04-09-2014
Great!
Hi Scrutinizer,
thanks very much, that works perfectly!
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi all
I want to count total numbers of sentences separated by fullstop (.) in different files under a directory at one go. Any help is appreciated. (3 Replies)
Discussion started by: my_Perl
3 Replies
2. Shell Programming and Scripting
Hi,
I have a file with one column data (sample below) and I am trying to write a shell script to calculate the difference between consecutive data valuse i.e
Var = Ni -N(i-1)
0.3141
-3.6595
0.9171
5.2001
3.5331
3.7022
-6.1087
-5.1039
-9.8144
1.6516
-2.725
3.982
7.769
8.88 (5 Replies)
Discussion started by: malandisa
5 Replies
3. Shell Programming and Scripting
This is a variation of an earlier post found here:
unixcom/shell-programming-scripting/159821-merge-two-non-consecutive-lines.html
User Bartus11 was kind enough to solve that example.
Previously, I needed help combining two lines that are non-consecutive in a file. Now I need to do the... (7 Replies)
Discussion started by: munkee
7 Replies
4. Shell Programming and Scripting
I would like to compare the values of 2nd column of consecutive lines of same file in such a way so that if the difference between first value and second value is more than 100 it should print complete line else ignore line.
Input File
==========
PDB 2500
RTDB 123
RTDB-EAGLE 122
VSCCP 2565... (4 Replies)
Discussion started by: manuswami
4 Replies
5. Shell Programming and Scripting
:b:
Hi Folks,
I have a requirement to find the number of consecutive occurences based on month. Here is the below sample of my requirement.
I have say four columns
CARUSERNAME BRAND_CODE MONTH YEAR
Below is sample Data
John|C|JAN|2013
Tim|C|FEB|2013
Tom|C|Mar|2013
Ron|C|Apr|2013... (4 Replies)
Discussion started by: dinesh1985
4 Replies
6. UNIX for Dummies Questions & Answers
Dear All,
I have a file with only one column. And I want to add every 3 consecutive numbers together and print the result.
Input File:
21.1
10
10
55
11
99
10
8
4
Expected Output:
41.1 (5 Replies)
Discussion started by: NamS
5 Replies
7. Shell Programming and Scripting
Hello,
I have a file as follows:
ENSGALG00000000189
ENSGALG00000000189
ENSGALG00000000189
ENSGALG00000000215
ENSGALG00000000215
ENSGALG00000000218 ... (5 Replies)
Discussion started by: Homa
5 Replies
8. Shell Programming and Scripting
Dear Specialists,
I have following data
1 1 2
2 2 3
3 3 6
4 3 4
5 4 9
6 5 11
7 6 7
and I would like to obtain data like below
1 1 2
2 2 3
4 3 4
7 6 7 (2 Replies)
Discussion started by: Ryan Kim
2 Replies
9. Shell Programming and Scripting
When cut encounters consecutive delimiters it seems to count each instance as a field, at least with spaces. Is this typical behavior for any delimiter?
#:~$ ifconfig eth0 | grep HWaddr
eth0 Link encap:Ethernet HWaddr 94:de:80:a7:6d:e1
#:~$ ifconfig eth0 | grep HWaddr | cut -d " " -f... (6 Replies)
Discussion started by: Riker1204
6 Replies
10. Shell Programming and Scripting
Hi,
In an ideal scenario, I will have a listing of db transaction log that gets copied to a DR site and if I have them all, they will be numbered consecutively like below.
1_79811_01234567.arc
1_79812_01234567.arc
1_79813_01234567.arc
1_79814_01234567.arc
1_79815_01234567.arc... (3 Replies)
Discussion started by: newbie_01
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)