02-11-2008
works good, thanks
Do yo have a solution within awk ?
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
Can anybody tell me why this function returns 49?
printf "%d\n" \'10
I don't understand what the \ and ' are there for?
thanks!!! (1 Reply)
Discussion started by: m0nk3y
1 Replies
2. Programming
What is the output of the following program considering an x86 based parameter passing sequence where stack grows towards lower memory addresses and that arguments are evaluated from right to left:
int i=10;
int f1()
{
static int i = 15;
printf("f1:%d ", i);
return i--;
}
main()
{... (2 Replies)
Discussion started by: arunviswanath
2 Replies
3. Shell Programming and Scripting
I am trying to display a number with commas
printf "%d\n" 323232
printf "%d\n" 1234567
I want the output to be:
323,232
1,234,567
I tried to change %d to other formats and could find the solution.
any idea? (7 Replies)
Discussion started by: ynixon
7 Replies
4. Shell Programming and Scripting
Hi,
I am using below command to display the number of line, but its returning no of lines along with file name.
But i want only no of line in the variable p.
Please help me on this?
p=`wc -l "text file"`
echo "$p" (6 Replies)
Discussion started by: shivanete
6 Replies
5. Shell Programming and Scripting
Hello,
I wrote a script that does lot of things, and I would like to change the format of a number but without printing it now (so I don't want to use printf as it will print the value immediately).
Schematically here is what I have:
awk 'BEGIN{number=0.01234567}
$1==$2{$3=number}... (5 Replies)
Discussion started by: jolecanard
5 Replies
6. Shell Programming and Scripting
Hello
Wondering if anybody may be able to advise on how I can filter the contents of the following file:
<object_name>-<version> <Instance>
GM_GUI_code.fmb-4 1
GM_GUI_code.fmb-5 1
GM_GUI_code.fmx-4 ... (7 Replies)
Discussion started by: Glyn_Mo
7 Replies
7. Shell Programming and Scripting
printf FH2" 3'b%b : begin\n",$i;
where i is an integer in the loop
is displaying
3'b1 : begin
expected output was
3'b001 : begin (1 Reply)
Discussion started by: dll_fpga
1 Replies
8. Shell Programming and Scripting
Not able to sorting two fileds resolved printf issue
01-1000/9|JAN
01-0000/6|MAN
01-1010/2|JAN
01-1010/2|JAN
01-1010/2|JAN
01-1000/9|JAN
01-1000/9|JAN
01-1000/9|SAA
01-1000/9|SAA
01-0000/6|SAN
01-0000/6|SAN
1.sort -t'|' -k1,1n -k2,2 file (3 Replies)
Discussion started by: kalia4u
3 Replies
9. Shell Programming and Scripting
Hi all - I'm completely stumped by a script I'm working on...
The short version is I have a file called 'lookup' and in it are hundreds of names (first and last). I have a script that basically allows the user to enter a name, and what I need to have happen is something like this:
Record... (8 Replies)
Discussion started by: sabster
8 Replies
10. UNIX for Beginners Questions & Answers
Hi, I have some code. Everything works as it should, but, when I call view_all_contacts() to print the data, each line doesn't line up as it should. I get tab keys between each line.
The problem code is this:
printf("\n\eHere is the rest of the code:
void add_contact();... (5 Replies)
Discussion started by: ignatius
5 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)
NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS
--predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO
bup-midx(1), bup-save(1)
BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown- bup-margin(1)