If i have two value in varible RKY5807, HMN5530. how can fetch and store another value Repo_ALIAS (/mine_repo/rike001) in variable. its very much similar to put where clause but i have no idea
Thank you for your help.
Moderator's Comments:
Use code tags, thanks.
Last edited by zaxxon; 02-15-2013 at 09:07 AM..
Reason: code tags, see PM
I want to do a grep with AND condition.
I have three files.
file1.txt
========
UNIX
......
WINDOWS
........
ORACLE
file2.txt
========
UNIX
.......
WINDOWS
...and many such files in a directory (6 Replies)
1. The problem statement, all variables and given/known data:
I have to grep a data file called datebook.txt. The last information in each line is a salary. I have to grep all the lines which precede those lines with 6 figure salaries. I can't SID it, or use Perl. It has to be grep (or egrep or... (3 Replies)
hi i need help with below code.
if ]
then
log "Exiting the script as ID= NULL"
log "Please run script first."
fi
i am calling grep inside this but its not running any ideas why ??
input file is like this --
Msg 102, Level 20, State 1:
Server... (4 Replies)
Hi,
In this code can able to match the pattern without case sensitive. Is that possible?
if u knw plz help me...
code:
echo "Enter name to search"
read n
if ;
echo "name found"
else
echo "Not Found"
fi (8 Replies)
I have below files under dir_a and dir_b and i want to sort out number of dir_a and dir_b files seperately and if i do the grep it should retrun 2 files in dir_a and 1 file in dir_b.
/dir_a/12345678
/dir_a/87654321
/dir_a/dir_b/12345687
But i am getting cat file|grep dir_a|wc -l
3... (6 Replies)
file input
aaaa,52C
aaaa,50C
bbbb,50C
bbbb,58C
aaaa,52C
bbbb,50C
aaaa,30C
bbbb,58C
cccc,60C
i want to print uniq lines with its max value of column2
expected output
aaaa,52C
bbbb,58C
cccc,60C
tks (4 Replies)
hi all,
i have an xml what i have to do is to search for the source id(s1) and if it matches with that in xml then extract the file mask from the name of the file i.e if the file name is
idr_%YYYY%%MM%%DD%_%N%.idr then , i want the part after first %
and before last % ie in this case
... (5 Replies)
I have file input
AAAA_XX_Start> rlong . 0W
130526-11:36:13 10.128.13.226 9.0j RBS_NODE_MODEL_N_1_50 stopfile=/tmp/13019
..
=================================================================================================================
MO ... (2 Replies)
Discussion started by: radius
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)