Hi folks,
I would like to know the difference between shell programming and awk programming. Actually i have developed a few applications in both but i could not find a better difference other than the syntax differences.
For example, the awk programming syntax is complicated. It has "{" and... (4 Replies)
Hello Friends
I want to process only those lines which are not started with a * or "
example File name:
GRX
"RxDataTime, NSysClkEn, Frame","Size","Sleep","TNum","TSet","TWait"
*Init Start
*Comment Generated from: C:\Documents and Settings
000000,0000,1,0,0,0,0,0,0... (8 Replies)
Hello
i need help with following problem:
i need to update a file containing records in following format:
student1
classa
student2
classb
student3
student4
classc
i need to associate EACH student with a class in my output file ... so for students 3 and 4, i need to create a... (12 Replies)
Hi
I have a multi -line file which is sorted by the 1-st colomn in the following format:
400 0000 0001 1000 1010 0111 0000 1000 0000
402 1101 0000 1100 1010 0111 1000 1000 0000
403 1001 0000 1100 1010 0111 0000 1000 0000
495 1000 0000 1100 ... (4 Replies)
Good morning!
guys, help me please
I have a file like this one:
diamond 5 7.8
77777765 1 7
1234567890 9 3.5
diamond 2 1
1234567890 3 6.8
77777765 0 4
os Solaris
it's only example, columns may be more, but in my case only 3 columns
so, my question
how I can group according to... (1 Reply)
Good morning to everyone!
guys, help me please
I have a file like this one:
diamond 5 7.8
77777765 1 7
1234567890 9 3.5
diamond 2 1
1234567890 3 6.8
77777765 0 4
os Solaris
it's only example, columns may be more, but in my case only 3 columns
so, my question
how I can group... (1 Reply)
I have the list of numbers in a file
105.1
102.0
100.5
100
98
97.5
95
...
I want to get how many times I have numbers greater than a particular limit, say 100 in the list. How can I do that with awk command? (5 Replies)
Need assistance using awk .
Need assistance in awk programming.
Any idea of getting the marked data into a file.
</tr> <tr> <td class='labelOptional_ind'> cdr.00012325.0000000000000000.20130612.050005.WANP4722_csv </td> <td width='15%' class='labelOptional'> <div align='center'>... (8 Replies)
Hi All,
I am new to AWK programming. I have the following for loop in my awk program.
cat printhtml.awk:
BEGIN
-------- <some code here>
END{
----------<some code here>
for(N=0; N<H; N++)
{
for(M=5; M<D; M++) print "\t" D "";
}
-----
}
... (2 Replies)
Discussion started by: ctrld
2 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)