Hi everybody! :) :D :D :)
it's great to be here since this is my first post.
touch /base/oracle/FRA/XMUT00/RMAN_FLAG
touch /base/oracle/FRA/XRLL00/RMAN_FLAG
find directory name containing RMAN_FLAG :
$ find /base/oracle/FRA -name RMAN_FLAG -print|xargs -n1 dirname |sort -u... (3 Replies)
machine: HPUX
file: a.dat
contents:
decimal 1
decimal 2
string 1
string 2
ASCII value of 'd': 100.
to grep lines that have 'd', I use the following command
grep d a.dat
My requirement:
I should grep for lines that contain 'd'. But I should use ASCII value of 'd' in the command... (1 Reply)
Hi,
I have to read a MS word document to find some strings(expressions) .The reading should be done by paragraph.I have to show the entire paragraph If I find any string/expression in that.
Please help me out.
Thanks
Regards
Kris (5 Replies)
Hi...
I have a file abc.txt , havin more then 10,000 lines, each field separated by '#'.
I want to grep 9914699895 and 999 from abc.txt
I am trying
cat abc.txt | grep 9914699895 | grep 999
but i am also getting data like 9991111111 or 9991010101
I want to grep "999" exactly and... (1 Reply)
this is a little more complex than that. I have a text file and I need to find all the distinct words that appear in a line after the word TABLESPACE
when I grep for just the word tablespace, I get:
how do i parse this a little better so i have a smaller file to read?
This is just an... (4 Replies)
Can we use a here document inside a here document?
Something like this
ssh user@remotehost << REMOTE
sudo vserver vsernamename enter << VSERVER
perform actions on vserver.
VSERVER
REMOTE (6 Replies)
Hello,
I have a log file with many lines and I want to grep pcific values from spcific lines, I'm not sure if it is possible or not
Sample
16-11-11 19:54:13:INFO:Connection to device ip 20.10.11.23 took 0
16-11-11 19:54:13:FINE:Sending request.
16-11-11 19:54:13:INFO:Received response from... (3 Replies)
This
for i in /dev/disco/*;do lvdisplay $i|grep -i size;done
Return me every size of lvm in vg "disco"
I want to return me,the size and the name of lvm,how to do this?
Thanks (7 Replies)
I'm new to Unix and I have been trying to fix this problem for the past week.
How would I use grep to display only certain numbers for a list. For example, if I have this list:
Joe senior 4/50
John junior 25/50
Mary junior 41/50
Martha sophomore 2/50
...How do I get a file... (1 Reply)
Hi,
I have a file in which I need to print all the lines that have decimal values in the second column.
The below prints all the decimal values from the second column but I need the complete line to be printed.
cat hello.out | sed 's/ */:/g' | cut -d : -f 2 | ggrep -Eo "+\.+" Can you... (2 Replies)
Discussion started by: mohtashims
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)