11-29-2012
Post the output of od -c < FILE4 using code tags.
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
I am writing a shell script that needs to remove duplicate lines within a file by category.
example:
section a
a
c
b
a
section b
a
b
a
c
I need to remove the duplicates within th category with out removing the duplicates from the 2 different sections (one of the a's in section... (1 Reply)
Discussion started by: RichElks
1 Replies
2. Shell Programming and Scripting
I have two files and need to compare the two files and to remove the matching lines from both the files (4 Replies)
Discussion started by: shellscripter
4 Replies
3. Shell Programming and Scripting
Input:
a
b
b
c
d
d
I need:
a
c
I know how to get this (the lines that have duplicates) :
b
d
sort file | uniq -d
But i need opossite of this. I have searched the forum and other places as well, but have found solution for everything except this variant of the problem. (3 Replies)
Discussion started by: necroman08
3 Replies
4. Shell Programming and Scripting
Hi everyone
I have a dilemma and I'm hoping someone has an answer for me.
I have two files:
# cat masterfile
line3
line4
line5
line6
line7
# cat tempfile
line1
line2
line3
line4
I want to compare tempfile with masterfile. (3 Replies)
Discussion started by: soliberus
3 Replies
5. Shell Programming and Scripting
Hi all,
I'm a newbie and I'm sorry if my question is too simple.
I'm having problem to delete the files that have less than certain lines, say 16.
#!/bin/tcsh
set filen = `sh -c 'ls *csv 2> /dev/null'`
foreach fil (${filen})
if ]; then
rm -f ${filen}
fi
end
exit
... (2 Replies)
Discussion started by: GoldenFire
2 Replies
6. Shell Programming and Scripting
Have two files and want to compare the content of file1 with file2. When matched remove the line.
awk 'NR==FNR {b; next} !(b in $0)' file1 file2file1
1. if match
2. removefile2
1. this line has to be removed if match
2. this line has a match, remove
3. this line has no match, no removingThe... (3 Replies)
Discussion started by: sdf
3 Replies
7. Shell Programming and Scripting
Hello,
I need to run a command or shell script that will remove the last 3 lines from every .js file that is under the directory /var/ww/vhost/
Can you please help ?
thank you. (22 Replies)
Discussion started by: MaRiOsGR
22 Replies
8. Shell Programming and Scripting
Hi All, I have two files
file1
123456CRTGHG
125437CRNDGF
126537CRDDGF
file2
123456CRTZHC
124567CJHGHG
125987CJHGDF
I need to compare the two files and any records in file 1 and 2 based on initial n characters (6 in example) need to be ignored.
string separated by unprintable... (2 Replies)
Discussion started by: Bruble
2 Replies
9. Shell Programming and Scripting
I have two files, a keepout.txt and a database.csv. They're unsorted, but could be sorted.
keepout:
user1
buser3
anuser19
notheruser27
database:
user1,2343,"information about",field,blah,34
user2,4231,"mo info",etc,stuff,43
notheruser27,4344,"hiya",thing,more thing,423... (4 Replies)
Discussion started by: esoffron
4 Replies
10. Shell Programming and Scripting
I have two large files (~250GB) that I am trying to remove the where GT: 0/0 or 1/1 or 2/2 for both files. I was going to use a bash with the below awk, which I think will find each line but how do I remove that line is that condition is found? Thank you :).
Input
20 60055 . A ... (4 Replies)
Discussion started by: cmccabe
4 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)