Have a column "address" which is combination of city, region and postal code like.
Format is : city<comma><space>region<space>postal code
abc, xyz 123456
All these three city, region and postal code are not mandatory. There can be any one of the above. In that case a nell... (2 Replies)
Greetings,
I have an input file with two columns. The first column has different codes. Each time I have a new code I need to split the columns into new ones. The input file looks like this
CR124 1320
CR124 1138
CR124 682
CR124 629
CR124 592
CR124 580
CR124 537
CR161 3967... (2 Replies)
Greetings,
I have an input file with two columns. The first column has different codes. Each time I have a new code I need to split the columns into new ones. The input file looks like this
CR124 1320
CR124 1138
CR124 682
CR124 629
CR124 592
CR124 580
CR124 537
CR161 3967
CR161 3656... (6 Replies)
Hi,
I have a file /tmp/1.txt. (Space b/w the fields are not equal)
#cat 1.txt
35G 22G 13G 64% /mount1
15G 7.1G 7.5G 49% /mount2
2G 9.9G 4.7G 68% /mount3
15G 9.1G 5G 63% /mount4
i want to wite a script to display these values as below.
O/P:
35G-22G-13G-64%-/mount1... (15 Replies)
hi all,
i have a file like thsi
a 1 3;4
b 2 4;7
c 4 5;6
d 4 5;8
now i want 1st, 2nd and in 3rd column i want only 1st column
the output should be like below
a 1 3
b 2 4
c 4 5
d 4 5
I need it in perl; please dont write in Shell scripting (1 Reply)
Hi, all.
How can I split all columns into multiple columns separated by tab?
Input:
qq ee TT 12 m1
aa gg GG 34 2u
zz dd hh 56 4h
ww cc JJ 78 5y
ss ff kk 90 j8
xx pp mm 13 p0
Output:
q q e e T T 1 2 m 1
a a g g G G 3 4 2 u
z z d d h h 5 6 4 h
w w c c J J 7 8 5 y (8 Replies)
Any one can help me in converting columns into rows.
example
I have input file
10000|
10002|
10003|
10004|
10005|
I want output in below format
PARTY|PART_DT
10000|12080000000
10002|13075200000
10003|13939200000
10004|1347200000
10004|133600000
10004|1152000000 (13 Replies)
Hi,
I am trying to split the following output into two columns, where each column has Source: Destination:
OUTPUT TO FILTER
$ tshark -r Capture_without_mtr.pcap -V | awk '/ (Source|Destination): /' | more
Source: x.x.x.x
Destination: x.x.x.x
Source:... (2 Replies)
Discussion started by: sand1234
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)