Hey guys, I was given a task that involved parcing a large file that looked somthing like this...
A1-0999999,SMITH,.25
A1-0999999,JOHN,.75
A1-0999999,HELMET,.1.25
A1-0999999,HOOP,.10.25
D1-1212121,SMITH,4.00
D1-1212121,TH,9.00
D1-1212121,MITCH,10.20
D1-1212121,RETAL,3.00
A1-9909555,,3.00... (2 Replies)
I have a bcp file that contains 10 fields. These fields are separated by a tab. How can I add my name as a new field in the 8th position for every record? I've been playing w/ sed and awk but can't seem to figure this out. (3 Replies)
Hi,
Kindly assist by analyzing the code below and suggest changes to achieve the required output.
The input file:
01-010241800000 35000 MV010 02/03/09 0306 03060226 03
02-004103300000 470000 MV010 02/03/09 0301 03010276 03
The objective is to convert field No4. from dd/mm/yy to yyyymmdd... (5 Replies)
Dear experts,
I have a file called "check" with contents like below
i used the sed command like below to get the value of "success" and "failed" only
My question is how can i get the value to include the time "03:15", so that i can get a value such as below : -
Appreciate... (4 Replies)
hi
i have file as below , i want to add duplicate records like bell_bb to one record with valuve as 15 ( addition of both )
any oneline awk script to achive this ?
header 0
CAMPAIGN_NAME 1
Bell_BB 14
Bell_MONTHLY 803
SOLO_UNBEATABLE 644
Bell_BB 1
Bell_MONTHLY 25
SOLO_UNBEATABLE... (4 Replies)
Dears,
I need a script or command which can find the unique number from the second filed and against that number it adds the total of first field .
17215630 , 0
907043 ,1
201050 ,10
394149 ,4
1964 ,9
17215630, 0
907043 ,1
201050, 10
394149 ,4
1964 ,9
1234234, 55
23 ,100
33 ,67
... (2 Replies)
I have a flat file
test.log
red,5,,,,,
green,7,,,,,
blue,4,,,,,
red,8,,,,,
green,9,,,,,
How i get a a result:
blue,4,,,,,
green,16,,,,,
red,13,,,,,
Thanks
Video tutorial on how to use code tags in The UNIX and Linux Forums. (2 Replies)
Hi,
I have the following file, I'd like to add an additional blank field to this file
This is a tab delimited file, I have tried the same thing on excel, but looking for a unix solution.
Here is my input:
Country Postal Admin4 StreetBaseName StreetType
HUN 2243 Kóka Dózsa György ... (3 Replies)
Hi I have file as given below
040|14300|40.0|563000
042|13200000|40.0
041|100|40.0
043|10000|40.0
045|102|40.0
I want to check
if field 4 is null then I have to place | in position 4.
result set should be
040|14300|40.0|563000
042|13200000|40.0|
041|100|40.0|
043|10000|40.0|... (9 Replies)
Discussion started by: shabeena
9 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)