I've got to step out, so can't actually finish this, but I got the bulk of if basically done, just needs some adaptation and to be thrown in a shell script that takes parameters to be done cleaner.
More organized...
That hard coded in a few files will give you what you'd want, just change "[21].txt" to the proper regex or hardcoded names (and this should support 2 or 3 file comparisons as written, just change hardcoded lines). If that isn't enough to get you going I'll try to check back in later this afternoon for anything else.
Edit: What I see running the above with the same text files you gave:
Vryali,
Thanks for ur time, patience and interest. You proved the core value of this forum.
I will see how this solution is working and will post the outcome too.
Please look into it to make it generate all requested files.
I am a novice in coding as I come from the life sciences shop.
Can someone point me to a good book for drawing a process diagram for 50+ unix scripts? The scripts run at different frequencies, and do everything from putting and getting data via FTP, to database I/O, to checking disk space ... etc. (0 Replies)
Hey, I'm trying to use awk for some simple file manipulations but i'm getting soem wierd results.
So i want to open up a file which looks like this:
@relation 'autoMpg'
@attribute a numeric
@attribute b numeric
@attribute c numeric
@data
-1.170815,0.257522,0.016416... (2 Replies)
Hi there all,
I am using a line to get some replys from my PS
I do
ps -ef |awk '{printf $9}'
But my result is 1 big line.
No spaces between the lines or someting
for example:... (2 Replies)
In the following line The AWK statement parses through a listing for files and outputs the results using the {print} command to the screen. Is there a way to (a) send the output to a file and (b) actually perform a cp cmd to copy the listed files to another directory?
ls | awk -va=$a -vb=$b... (1 Reply)
I have files structured in stanzas, whose title is '', and the rest couples of 'id: value'. I need to find text within the title and return the whole stanzas that match the title.
The following works:
awk 'BEGIN{RS="";IGNORECASE=1}/^\/' myfileI would need to count all of the occurences, though,... (7 Replies)
Hi - we are looking for a (hopefully free/opensource) solution for diagramming our rack/hardware configuration. the rack solution seems easier to find than the hardware piece. i.e. on our IBM 770 with two CEC's, a method of noting what hardware points to what... for example, on the primary CEC,... (0 Replies)
Hi,
The following awk command :
asmcmd lsdg | awk '{print $13;}' | grep -i ${SID}
return the following output . An Empty line + two lines contain "/" at the end of the line
INDEVDATA/
INDEVFRA/
I need to remove the "/" as well as the empty line.
Please advise
Thanks (3 Replies)
Hi,
My input is like this
head input.txt
Set1,Set2,Set3
g1,g2,g3
g2,g1,g3,
g4,g5,g5
g1,g1,g1,
g2,g1,g1,
g6,g7,g8
,g7,g8
,,g8
My output file should be
Name,Set1,Set2,Set3
g1,1,1,1 (18 Replies)
Discussion started by: jacobs.smith
18 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)