Hi There!
My final task for today is to delete lines starting with certain numbers
for e.g., my text block is
and i want to delete all lines starting with 11 or 17 or 21
I know i can use multiple sed commands like
sed '/^11,/d' <filename>
sed '/^17,/d' <filename>
sed '/^21,/d'... (2 Replies)
I have my input sometyhing like this
aaa
bbbbbb cccccc
ddddd eeeee
1234 ravi kumar
aaaaaa vvvvvvv
5678 ravi kumar
rrrrrrr mmmmmmm
I want the output as follows.
aaa
bbbbbb cccccc
ddddd eeeee
1234 ravi kumar
aaaaaa vvvvvvv
5678 ravi kumar (2 Replies)
I have my data something like this. I want to delete all the lines before the frist instance of the key word 'ravi kumar'
aaa
bbbbbb cccccc
ddddd eeeee
1234 ravi kumar
aaaaaa vvvvvvv
5678 ravi kumar
rrrrrrr mmmmmmm
I want the output as follows.
1234 ravi kumar
aaaaaa... (8 Replies)
I have my data something like this
I need to search for the keyword yyyy in the susequent lines and if it is present, delete the second line with keyword.
In other words, if a keywords is found in two subsequent lines delete the second line.
input data:
aaaa bbbbb cccc dddd
xxxx... (4 Replies)
Hi all,
I am trying to remove the words which has XYZ as a prt of that.
My input file is something like this :
PHNDAZLF-UPS-XYZ' aaaaaaa bbbbb
ADFRTEJKS-XYZ cccccccc ddddddd rrrrrr
SGETHEHDJ-ABC-RXY' hhhhh ttttt' kkkk
FHJSKSJDKD-XXX-YYY
Output expected is :
aaaaaaa... (7 Replies)
im a new student in programming and im stuck on this question so please please HELP ME. thanks.
the question is this:
enter a command to delete all files that have filenames starting with labtest, except labtest itself (delete all files startign with 'labtest' followed by one or more... (2 Replies)
Hi Geeks :b:,
I need to delete a line from file that contains a particular keyword.
I had read in some forum of unix.com that below code could be used
sed "/$titlesearch/d" movielist >tmp
mv tmp movielist
But my file contains lines which contain slashes (/)
FOr eg:
/etc/movie/title/... (5 Replies)
consider the contents of a file has many stuff including few stuff that i need.. so i perfromed the below function
cat filename | grep "ALTER TABLE"
its output is as shown below
.
.
.
.
. SET @sql:=CONCAT('ALTER TABLE RecordMixProfile AUTO_INCREMENT=', @maxId) ;
SET... (14 Replies)
Platform : RHEL 5.8
I have text file called myapplication.log . In this file, I have around 800 lines which start with the followng three strings
PWRBRKER-3493
PWRBRKER-7834
SCHEDULER-ERROR
How can I delete these lines in one go ? (13 Replies)
Hi
I want to implement something like this:
if( keyword1 exists)
then
check if(keyword2 exists in the same line)
then replace keyword 2 with New_Keyword
else
Add New_Keyword at the end of line
end if
eg:
Check for Keyword JUNGLE and add/replace... (7 Replies)
Discussion started by: dashing201
7 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)