Need to modify contents of file with complex patterns
Quote:
Originally Posted by ygemici
Hi ,
Thanks for the solution, it modifies the lines with /var1 to /var and /flx1 to /flx respectively, But how to delete the lines with /dev/vg0/var and /dev/vg0/flx. when i use "grep -v /dev/vg0/var " for deletion bothe the lines with /dev/vg0/var1 and /dev/vg0/var are getting deleted. even sed for deletion is causing the same problem.
Please suggest a way for deleting only the lines with /dev/vg0/var and /dev/vg0/flx.
Hi,
Can anyone pls let me know how can i modify the file contents thru script.
Eg.
I have file abc.dat that contains below lines
Merge.resync.cycleFlag
Merge.resync.logFlag
Merge.resync.maxByteRate
Merge.resync.maxSearch
Merge.resync.rate
Merge.resync.tickLog ... (2 Replies)
Hi Gurus,
I have a file say for ex. file1 which has 3500 lines in it which are different account numbers and another file (file2) which has 230000 lines in it. I want to read all the lines in file1 and delete all those lines from file2 which has that same pattern as in file1. I am not quite... (4 Replies)
Hello,
I am new to sed and hope that someone can help me with the following task.
I need to modify a txt file which has format like this:
xy=CreateDB|head.queue|head.source|head.definition|rtf.edit|rtf.task|rft.cut
abc|source|divine|line4|5|true
into something like:
head.queue=abc... (19 Replies)
I have a table output in a text file (abc.txt)as follows
col1 ,
col2 ,
col3 ,
col4 ,
Here I want to modify this file as follows
col1 '~!#',
col2 '~!#',
col3 '~!#',
col3 '^@\n'
Could you help on this???
Thanks
Kris (1 Reply)
I have file like this:
rs111 A T 0.9 0.8 ...
rs112 AT T 0.8 0.2 ...
rs113 G CT 0.9 0.1...
I wish to replace all the NONE "A" or "T" or "G" or "C" values in column 3 and column 4 to " ", how can I do this?
thanks! (8 Replies)
I am wanting to fetch the content of the table within a file
the table begins with data label like
N Batch Mn(I) RMSdev I/rms Rmerge Number Nrej Cm%poss AnoCmp MaxRes CMlplc SmRmerge SmMaxRes $$ $$
. #columns of data
.
.
.
.
.
$$
I tried the command
awk... (18 Replies)
Hi one of the output of the command is as below
# sed -n "/CCM-ResourceHealthCheck:/,/---------/{/CCM-ResourceHealthCheck:/d;/---------/d;p;}" Automation.OutputZ$zoneCounter | sed 's/$/<br>/'
Resource List : <br>
*************************** 1. row ***************************<br>
... (2 Replies)
Hi,
What is the best approach to grab contents between
Changes
Dependencies
from the following example snippy
Changes in packages about to be updated:
bash-3.2-32.el5_9.1.x86_64
* Thu Jun 27 22:00:00 2013 Roman Rakus <rrakus@redhat.com> - 3.2-32.1
- Fixed a bug that caused... (2 Replies)
Hello.
For a given folder, I want to select any files find $PATH1 -f \( -name "*" but omit any files like pattern name ! -iname "*.jpg" ! -iname "*.xsession*" ..... \) and also omit any subfolder like pattern name -type d \( -name "/etc/gconf/gconf.*" -o -name "*cache*" -o -name "*Cache*" -o... (2 Replies)
Discussion started by: jcdole
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)