10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hello all ; )
I'got a file1 with a lot of emails like :
fistname.lastname@domaine1.comAnd another file2 with emails like
fistname.lastname@domaine2.ct.netI need a shell script that will read each line from the file1 and try to find if in file2 the fistname.lastname exist.
If yes, the... (1 Reply)
Discussion started by: Aswex
1 Replies
2. Shell Programming and Scripting
Input file
G A
G A,T
A C
A G,T,C
T C
.
.
Desired Output file
G A
G A
G T
A C
A G
A T
A C
T C (4 Replies)
Discussion started by: perl_beginner
4 Replies
3. Shell Programming and Scripting
I have a wordpress site. I need add "post_title" to all my "post_content" mysql field. Thanks.
my content: Free <b>Online Tips</b> output:Free post_title <b>Online Tips</b>:
This code does not work:
UPDATE wp_posts SET post_content = REPLACE ( post_content, 'Free <b>Online... (0 Replies)
Discussion started by: tara123
0 Replies
4. Shell Programming and Scripting
Hi,
Below is my input file :
AAAG(12) TC(14)
AACCCT(66) AACCCT(30) AACCCT(18) AACCCT(48)
TCTG(12) TCTG(20) TCTG(16) AC(12) AC(12) TCTG(16) TCTG(12) AC(12) AC(12) AC(12)
AC(26) AC(14)
AGTG(12) AC(24)
AGTG(12) TCC(12)
Desired output :
AAAG TC
AACCCT AACCCT AACCCT AACCCT
TCTG TCTG... (4 Replies)
Discussion started by: perl_beginner
4 Replies
5. Shell Programming and Scripting
Hi,
I am having trouble while using 'sed' with reading files. Please help. I have 3 files. File A, file B and file C. I want to find content of file B in file A and replace it by content in file C.
Thanks a lot!!
Here is a sample of my question.
e.g. (file A: a.txt; file B: b.txt; file... (3 Replies)
Discussion started by: dirkaulo
3 Replies
6. Shell Programming and Scripting
Format of one input file:
# >length=1
seq program data 909 1992
seq program record 909 1190
Desired output result:
# >length=1
length=1 program data 909 1992
length=1 program record 909 1190
I wanna to replace all the column 1 content (exclude the content start with "#") with the... (5 Replies)
Discussion started by: cpp_beginner
5 Replies
7. Shell Programming and Scripting
Hey,
I am gettin a bit crazy with my script. I have several input datas with the same name (5.ill) in different folders (daysim_01, daysim_02, etc.). The 4. column of each of the data has to be summed with each other and then hass to be written in one new file.
So file1:
1 1 0 1
2 1 1 2 ... (7 Replies)
Discussion started by: ergy1983
7 Replies
8. UNIX for Advanced & Expert Users
Hi,
I need help. I have XML file as below
<a n="infoLevel">
<v s="true"/>
</a>
<a n="localAddr">
<v s="server.host.com"/>
</a>
<a n="ListenPort">
<v s="21111"/>
</a>
I need to find variable "ListenPort" in line and then replace... (4 Replies)
Discussion started by: rdtrivedi
4 Replies
9. Shell Programming and Scripting
Hi All,sorry for inconvience....please find the attachement for my question i am unable to paste the question here....please help me in slving thisthanksk.k (4 Replies)
Discussion started by: G.K.K
4 Replies
10. Shell Programming and Scripting
Hi,
variable1="This is a car"
Now I want to replace the content of variable1, "car" to "dog". Is there any simple command I can use.
Thanks.
Joseph (4 Replies)
Discussion started by: josephwong
4 Replies
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)