In some shells, the exclamation point triggers history expansion (even when double quoted). In this case, since there's no need for parameter expansion or command subsitution, simply use the stronger single quotes.
I have statement like this
column_id.columnname=="value"
in unix i want to modify above statement to
variable1=="value"
that means i have to replace the string before "==" by string "variable1"
second catch is, in statement instead of "==" you can have any arithmatic comarision... (7 Replies)
Hi
I am trying to find a product code hightlighted in red, and re-insert it at another place on the same file. I shall be grateful if anyone can help me with this. Stuck and have deadline!!:confused:
Original Line: (I can get source data in one of these two formats)
ISD=977155185403901+DIE... (2 Replies)
Hi,
There are some "n" files in a directory which contains comman string.A command to find and replace the string in all the files without looping.
like if i am in a directory :
# find ./ -name ".txt" | xargs sed -e 's/test/tst'
Upto here is performed correctly and i want to... (4 Replies)
hi,
i have a data in a file like below:
100 8388kmn844., 8488
200 8398kmn894., 8398
i want replace from kmn to . as null.
output should be
100 8388, 8488
200 8398, 8398
Plz help.
Thanks in advance (1 Reply)
I am looking to find and replace a string in a file, can anyone suggest a global find and replace. looked at previous replies on other queries but none seem to address what i am looking for. aint familiar with sed so trying to use ordinary unix commands if possible
Thanks in advance (2 Replies)
Need to convert
echo "7 6"
to
$7,$6
But the count of numbers can increase say echo "7,6,8,9" tried this didn't work
echo "7 6" | sed 's/\(*\)/\1/'
But did not help much (3 Replies)
Dear All
To find a file, according to you, I tried as:
#find / -name file-name -print
To find a string inside the files , I tried as :
#find / -name "*" |xargs grep "string"
Can you please let me know how can I try for find/replace (i.e.
finding the intended string inside the text files... (6 Replies)
I have the following requirement in the shell script
1. I have more than 200 shell script files. I need to find out how many shell scripts have "sqlplus /" in the shell file
2. I need to replace all the shell scripts in the single command
for example: connect scott/scott
replace as ... (6 Replies)
i am having a file test1.txt and its contents is as follows.
<abcaaa bbb ccc ddd>
<dddeeeffff>
<my computer>
<abcmydocuments>
Now I need to find the text abc and should be replaced as follows.
<abc>
<dddeeeffff>
<my computer>
<abc>
First line has the text "abc" and it has to be... (3 Replies)
Hi All,
I have data like below
1 CREATE TABLE temp123
2 (
3 col1 INTEGER,
4 col2 CHAR(3) CHARACTER SET LATIN NOT CASESPECIFIC,
5 col3 DECIMAL(19,0),
6 col4 VARCHAR(80) CHARACTER SET LATIN NOT CASESPECIFIC,
7 start_dt DAte FORMAT 'YY/MM/DD',
8 end_dt DATE FORMAT 'YY/MM/DD',
9 datecol1... (6 Replies)
Discussion started by: baranisachin
6 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)