Thank you for that, but it seems a bit complicated...
This is working atm...
But I have to keep calling randomizer in order to make it get a fresh result and also when I call sed with $result, it makes all replacements the same rather than unique $result
Last edited by holyearth; 11-10-2011 at 10:48 AM..
Hi,
I got a Textfile contains hundreds of lines like this:
3 02 8293820 0 22 22
All I need is this:
293820 0 22 22
So i decided to delete until the first '8' comes up. But how I can realize that? (9 Replies)
I need a sed line that will take STDM111 and change it to STDM161
the STDM will always be constant but the 3 numbers after will be random, I just need it to always replace the middle number with 6 regardless of what the numbers are. (8 Replies)
Hi everyone, this is my first post.
Some time ago I did a script to convert .csv files to oracle inserts. Now I need to add something and I can't make it work. This is the code:
#!/bin/bash
#Rev. 2
paso_uno()
{
local tmp=`mktemp temp.uno`
cat $1 > $2
cat $2 > $tmp
mv $tmp $2
}... (7 Replies)
Hi,
I've a txt file which contains the following kind of listed data
18971 ./aosrp18.r
15340 ./aosrp12.r
22996 ./aosrp08.r
17125 ./aosrp06.r
I'm trying to get rid of the ./ in the file and have tried the following with sed but I'm not getting the correct result... I'm not sure what way... (7 Replies)
Hi all,
I need to run a number of scripts which have a certain phrase on them so I have identified these by;
grep -l 100 *script | sort -u
Normally I could just run something along the lines of;
for i in `grep -l 100 *script | sort -u`; do ./${i}; done
However before I run each of... (0 Replies)
I have a text file where I want to use sed to do multiple replacements all at once (i.e. with a single command) . I want to convert all AA's to 0, all AG's to 1 and all GG's to 2. How do I go about doing that? Thanks! (2 Replies)
Hi ,
How can i get count of replacements done by sed in a file.
I know grep -c is a method.
But say if sed had made 10 replacement in a file, can i get number 10 some how? (8 Replies)
Hello all. I am a beginner UNIX user who is using UNIX to work on a bioinformatics project for my university.
I have a bit of a complicated issue in trying to use sed (or awk) to "find and replace" bases (letters) in a genetics data spreadsheet (converted to a text file, can be either... (3 Replies)
Hello All,
I have something like below
LDC100/rel/prod/libinactrl.a
LAA2000/rel/prod/libinactrl.a
I want to remove till first forward slash that is outputshould be as below
rel/prod/libinactrl.a
rel/prod/libinactrl.a
How can I do that ??? (8 Replies)
Discussion started by: anand.shah
8 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)