10-28-2010
Thankx the sed command worked
![Smilie Smilie](https://www.unix.com/images/smilies/smile.gif)
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
suppose u have a file
23 33
44 66
55 88
Another file
49
34
49
90
So to find where these numbers lie between in the first file
output shud be while using second file and search for the first file
44 66
-
23 33
44 66
- (1 Reply)
Discussion started by: cdfd123
1 Replies
2. Shell Programming and Scripting
I have some files in unix
ls -1
TMH.backend.tar.421E-03.Z
TMH.backend.tar.421E-04.Z
TMH.backend.tar.421E-05.Z
TMH.backend.tar.421E-06.Z
TMH.backend.tar.421E-07.Z
TMH.backend.tar.421E-08.Z
TMH.backend.tar.421E-08.Z.bak20081223164844
TMH.backend.tar.421E-09.Z... (1 Reply)
Discussion started by: on9west
1 Replies
3. Shell Programming and Scripting
NR_037575 -0.155613339079513 -0.952655362767482 -1.42096466949375 -0.797042023687969 -1.26535133041424 -0.468309306726272
NR_037576 0.59124585320226 0.408702582537126 0.888885242203586 -0.182543270665134 0.297639389001326 0.480182659666459... (4 Replies)
Discussion started by: quincyjones
4 Replies
4. Shell Programming and Scripting
From following data, I want to only publish those lines in which column 6 has the value with extension .dat.
col1,col2,col3,col4,col5,col6.txt,col7,col8
col1,col2,col3,col4,col5,col6.date,col7,col8
col1,col2,col3,col4,col5,col6.jpg,col7,col8
col1,col2,col3,col4.dat,col5,col6.dat,col7,col8... (3 Replies)
Discussion started by: fahdmirza
3 Replies
5. Shell Programming and Scripting
How to do alternation using regular expressions in the 'find' command? Like say you want to find all files that do not match the names specifically "this" or "that" within a directory using regular expressions? (10 Replies)
Discussion started by: stevensw
10 Replies
6. Shell Programming and Scripting
Experts:
I don't know that regular expressions will ever be easy for me, so if one of you guru's could help out, I'd appreciate it.
I'm trying to match a line in our syslog, but I can't figure out how to match a number inside a bracket. This is what I'm trying to match.
"Jul 16 00:01:34... (2 Replies)
Discussion started by: jdveencamp
2 Replies
7. Shell Programming and Scripting
Hi All
I am new to this forum and also regex.
I am using bash scripting and have a file like this
"0012","efgh","12345678","adfdf", "36598745"
"87654321","hijk","lmno"
I want the ouput to be
12345678
36598745
87654321
Criteria like this
- number
- 8 carachters long
Please let... (21 Replies)
Discussion started by: buttseire
21 Replies
8. UNIX for Dummies Questions & Answers
I've got two files that each contain a 16-digit number in positions 1-16. The first file has 63,120 entries all sorted numerically. The second file has 142,479 entries, also sorted numerically.
I want to read through each file and output the entries that appear in both. So far I've had no... (13 Replies)
Discussion started by: Scottie1954
13 Replies
9. UNIX for Dummies Questions & Answers
Greetings. I have a three column file, and there are some numbers in the second column that are <1. However I need all numbers to be positive, thus need to replace all those numbers with just one. I feel like there must be a simple way to use awk to find these numbers and sed to replace but can't... (5 Replies)
Discussion started by: Twinklefingers
5 Replies
10. Programming
Hello,
I am using the Sublime Plugin LogHighlight.
I can use RegEx there to highlight some lines in sublime.
Now I need to find every line, that has a number of above 25000.
the lines look like this:
smart_sdl.result: 8947
smart_sdm.result: 8947
smart_sdn.result: 25000
Currently I am... (3 Replies)
Discussion started by: blend_in
3 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)