Hi All,
I am trying to write a shell script which firstly will search some files and then increase the port numbers mentioned in them by a certain no.
let me clear it with an example-
suppose there r few files a,b,c,d....
file a's content-
<serverEntries xmi:id="ServerEntry_1"... (3 Replies)
Morning,
I have a database log file that i need to scan thru to find all successful logins within the last 40 days,
What i have currently done is create a bash script to scan the last month and pipe out the results to a text file.
YEAR=`date '+%Y'`
MONTH=`date '+%m'`
grep 'Login... (12 Replies)
Hello all,
New to this forum!
I got a Q: i want to find all files with numbers in the file name. e.g. blabla234.pm or fool654.pl
action i took:
ls | egrep '+'
ls | egrep
ls | egrep +
ls | egrep ''
ls | egrep '(+)'
ls | egrep '()'
ls | egrep '(.*.*)'
ls | egrep '.*.*'
ls | grep... (2 Replies)
cat *.out |grep "<some text>" | awk '{print $6}'
For ex,This will reutrn me
11111
22222
is it possible to add these two numbers in the above given command itself?I can write this to a file and find the sum.
But I prefer to this calculation in the above given line itself.
Any... (3 Replies)
Hi,
I want to write a script that does something like this:
I have a file, in which in every line, there is a string of words, and followed by some space, a number.
Now, I want to identify the line, which has the largest startFace number (say m=8118), take that number and add it to the... (2 Replies)
i want to basically get the lowest numbers from a list ... for example my input file is ....
1
2
3
6
7
8
9
10
11
13
Now i want to create a script or a one liner which i can use like this ...
for example ..../getlowest 3 --> this gives me the next 3 lowest numbers which... (6 Replies)
Hi,
I have a file as
ABC 1634230,1634284,1634349,1634468 1634272,1634301,1634356,1634534
What I want is to find distance between the numbers.. column 1 is the gene name and column 2 are starts and column 3 are their respective stops for the starts. So what I want is column 3 which has +1... (2 Replies)
Dear All
I am having data file containing 0 to 40,000 like this...
0 5
1 65
2 159
3 356
...
...
40000 19
I want to find the probability of distribution between the numbers. The second column values are angles from 0 to 360 and the 1st column is number of files.
I am expecting... (2 Replies)
Discussion started by: bala06
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)