Kindly let me know if the file contains more than one column and the N/A is given in the 2 or 3 or 4 column. then hw to remove all those rows which contan N/A in 2 or 3 or 4 columns.
I have to compare 2 files which means 2 files with common entries in same column and separate those common entries in a diferent file as well right before those entries common so that I can separat common and Uncommon entries in rows in 2 different files. Is it possible
For eg.
one file
... (3 Replies)
Hi
I have a file like this
1234
2345
567889
567889
2345
234899420
83743
2345
67890
67890
................
so on
I want to delete entries which are more than once like 2345, 567889 and 67890 so that these appear once (4 Replies)
Hi
I want to remove entries with blank spaces
in my input file:
123
234
456
678
56789
345346456
589
3454
345456
3454566............................ (2 Replies)
Hi
I have a file with following entries
122 N/A
123 5654656
123423 43534543
4544 45435
435454 N/A
i Have to remove entries with N/A so that only
123 5654656
123423 43534543
4544 45435
remain in output file
can anybody guide for a code/unix/perl (2 Replies)
Dear all,
I am facing one problem
in my input file there are many Entries which starts from *FIELD * AV (checked the attached file)
I want all the entries in the output file which start from
*FIELD * AV
I have written this programm but its not printing all the entries with *FIELD... (4 Replies)
Hi all
I have an input file which contains so many entries like this: And, I want to count hw many among ASN in one column are converted to LYS in third coulmns. which means output shuld contain only "ASN number LYS"
Kindly let me know wny programm for this
My input is
ASN 217 LYS... (2 Replies)
Hi all
I have a big file which I have attached here.
And, I have to fetch certain entries and arrange in 5 columns
Name Drug DAP ID disease approved or notIn the attached file data is arranged with tab separated columns in this way:
and other data is... (2 Replies)
Hi all.
Kindly check it it's urgent!!
I have one big file from which which I have to fetch certain data
I have attached a small part of this file.
from the attached file, I have to fetch and arrange data in 3 columns
1 Generic name 2. Brand names 3. Drug... (10 Replies)
Discussion started by: manigrover
10 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)