hi everybody:
My question is how could i add a new columns to a file that it has one column like this:
06/06/2005
06/07/2005
06/08/2005
06/09/2005
06/10/2005
06/11/2005
06/12/2005
06/13/2005
06/14/2005
06/15/2005
06/16/2005
06/17/2005
....
And i want add columns like :
06/06/2005 ... (4 Replies)
Hi I'm new to this forum and I'm a beginner when it comes to shell programming and awk programming. But I have the following problem:
I've a list like this:
1
2
3
4
5
6
7
8
Either from a file or output from a command. What I would like to do is to arrange these values into x columns... (17 Replies)
can anyone help me how do i add the colums using awk seperated by character @. for eg i have
3@4
2@9
5@1
the result should be
10 14
i tried using
{ sum+= $1 }
END { print sum }
but it just gives the result 10. can anyone help me with this one
thank you and best regards (7 Replies)
I have a data file with 4 columns, of the format:
A1 A2 A3 A4
B1 B2 B3 B4
C1 C2 C3 C4
etc..
I would like to insert to put column 2,3,4 on a new line so my new format would be:
A1
A2 A3 A4
B1
B2 B3 B4
C1
C2 C3 C4
etc.
but am new at using AWK and am not sure how to do it. (5 Replies)
Hi,
I would like to get some specific fields from one long line.
My line looks like
CcnCDRFile0-8535123473201007170536_2010-07-20_17:06:02:,,9963387265,,,,,00720141432,,+0.310,+79.255,+78.945,,,,1492,,,,0,... (1 Reply)
I have a file that has a list in this format:
abcdefg|mia21acs.acs.oaklahoma.net|10.83.19.21|||PROV|ADTHNION21E|USA|DLAR|CISCO||OS|1.0.7.10
abcdefg|cle22acs.acs.oaklahoma.net|10.83.19.22|||PROV|ADTHNION22E|USA|DLAR|CISCO||OS|1.0.7.10
I need to pull the red highlighed fileds so the output looks... (2 Replies)
HI ,
I have a comma delimiter file, in which I want to remove 8th and 9th column.
I tried removing those columns using the below code
awk 'BEGIN { FS=","; OFS="," } {$8=$9="";gsub(",+",",",$0)}1' infile
But the problem is 8th and 9th columns are user entered fields, theyvhave carriage... (1 Reply)
Hi experts,
I've used several solutions from this forum to delete nonsense and rearrange data in the project file I'm working on. I'm hoping you guys can give me some tips on further rearranging the data (I've seen a few solutions by searching, but one specific item has me stumped, which is only... (5 Replies)
Hi,
I'm trying to copy and paste the sixth column from a bunch of files into a single file having each column pasted in separate columns (and not one after each other in just one column.)
I tried this code but works only partially because it copied and pasted 50 rows of each column... (6 Replies)
Discussion started by: Frastra
6 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)