Folks,
I have a set of list that contains file names. I want to search through each of the list and delete any file that is found in the list.
eg.
LIST_A contains:
aaa
bbb
ccc
ddd
eeee
LIST_B contains:
aab
aac
adb
aed
assuming I want to... (6 Replies)
After searching for a specified string, I would like to delete couple of rows from the file and continue searching. Basically, I would like to search through a text file that holds logs with date-time stamp in them and then clean up the file if the log entry is more than 2 days old.
Example log... (0 Replies)
Hi, I've been searching in this forum for the last 4 hours trying to do one thing: search 2 lines and delete the above line. So far I have not be able to find something similar in this forum, so I need help. This is what I'm trying to do. For example, I have a file called file1:
file1
word1... (4 Replies)
Gurus
I have a CSV containing 60K records.Each row has 8 columns.
On some rows ,for the 7th column ,i find word 'UnknownState(898914497)' repeated many times.
e.g
<N_HOST> <tcp> <*> <*> <*> <*> ... (1 Reply)
Hi unix masters,
Im needing some guidance or a small code to enlight my problem.
Problem Example:
I have 3 different text ascii files. At each file, inside the text
have repeater marks.
--text 1 start--
123 -> mark
anytextanytext
anythinganything
123 ->mark
blahblah
blah
...... (6 Replies)
HI group members
I am new in unix
I want to search # symbol in a file.
if found need to delete the entire row in the file.
need to move the actual data(with out # symbol data) to another file.
Thanks (2 Replies)
I have n number of files like
custpoten_123.txt
custpoten_456.txt
custpoten_789.txt
custpoten_765.txt
from above all files i want to serach for a particular number and it should delete the whole line.i have a code for search and delete.
code is
#!/usr/bin/sh... (6 Replies)
Hi,
I'd like to delete emails on one of my Linux boxes using a criteria and I don't really know where to start. Any suggestions?
The emails I'd like to delete have all the following sub-string: checkdefunct.sh.sh
I have more than 187.000 emails and 90% of them I'd like to get rid of.
... (1 Reply)
Hi
I have data file like below:
NET_SALES^M ^M---- new fields for -- ^M ,YABA_FLAG^M ,DOO_FLAG^M
My requirement is to search for atleast 2 -- and remove all the words till first ^M is encountered.
In above case, output should be like
NET_SALES^M ^M ,YABA_FLAG^M ,DOO_FLAG^M
TIA... (4 Replies)
I have a sample text file like this.
CampaignId|^CampaignCd|^InsertionOrderCd|^OwningAdvertiserCd|^CampaignName
998201|^T15-06|^T15|^|^GTA 160x160
998277|^T15-07|^T15|^TEST|^GTA 160x160
998297|^T15-07|^T15|^TEST2|^GTA 160x160
I want to delete the line only when the 4th field is empty. ... (2 Replies)
Discussion started by: Tuxidow
2 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)