10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Please help me with this ...
Input file
N_DC_Fabric_A,AU_SAP01,c050760169900000(*),50060169472007fc(*),50060160472007fc(*),
N_DC_Fabric_A,AU_SAP02,c050760169900004,50060169472007fc(*),50060160472007fc(*),
N_DC_Fabric_A,AU_SAP03,c050760169900004,50060169472007fc,50060160472007fc,
... (9 Replies)
Discussion started by: greycells
9 Replies
2. Shell Programming and Scripting
Hi Experts,
I am trying to get system output to capture inside awk , but not working:
Please advise if this is possible :
I am trying something like this but not working, the output is coming wrong:
echo "" | awk '{d=system ("date") ; print "Current date is:" , d }'
Thanks, (5 Replies)
Discussion started by: rveri
5 Replies
3. UNIX for Dummies Questions & Answers
I have a script problem that I am not able to solve due my very limited understanding of unix/awk.
This is the contents of test.sh
awk '{print $1}'
From the prompt if I enter:
./test.sh Hello World
I would expect to see "Hello" but all I get is a blank line. Only then if I enter "Hello... (2 Replies)
Discussion started by: JasonHamm
2 Replies
4. UNIX for Dummies Questions & Answers
Can anyone help with this this one liner:
nawk -v RS='' '$1=$1' InputFile
What I have in the file:
0.0013985457223116
-0.0002338180925628
0.0
0.0003709430584958
-0.0005763523138347
0.0
And the output I want:
0.0013985457223116 -0.0002338180925628 0.0
0.0003709430584958... (1 Reply)
Discussion started by: mookie123
1 Replies
5. UNIX for Dummies Questions & Answers
Hi, in the following script, what does " a=$0} END " mean ?
do we need that ? Thanks
awk '{a=$0} END {for (i=NR; i>=1; i--) print a}' file (3 Replies)
Discussion started by: james94538
3 Replies
6. Shell Programming and Scripting
How I can rid of the following presentation du -sk /u*/oradata/TEST/*.dbf |awk '{print total+=$1} 1.28003e+06
4.35109e+06
4.36134e+06
4.4535e+06
5.47752e+06
5.48777e+06
7.52554e+06
7.73036e+06
9.06158e+06
:confused: thank you (3 Replies)
Discussion started by: zam
3 Replies
7. Shell Programming and Scripting
I am trying to read through a file, gather the states in that file and change it from an abbreviation to the ful text.
Can anyone provide some assistance.
Thanks!! (4 Replies)
Discussion started by: cnitadesigner
4 Replies
8. Shell Programming and Scripting
i have a little awk script that I use looks this:
awk '{if (FNR==1){print FILENAME; print $0}else print $0}' file1...file2....fi... > bundled.
i have completely forgotten how to unbundle this. I have tried several different approaches and still can not remember how to unbundle the file bundled.... (2 Replies)
Discussion started by: moxxx68
2 Replies
9. Shell Programming and Scripting
Hello,
I have the following command that does 2 searches.
awk '{if ($0 ~ /STRING1/) {c++} }{if ( c == 2 ) {sub(/STRING1/,"NEWSTRING") } } { print }' FILE
How do I search up after the first search?
thanks (4 Replies)
Discussion started by: ctcuser
4 Replies
10. Shell Programming and Scripting
I have the following error:
ls -lt | awk 'BEGIN NR > 1 { print $2, $9 }'
Syntax Error The source line is 1.
The error context is
BEGIN >>> NR <<< > 1 { print $2, $9 }
awk: 0602-500 Quitting The source line is 1.
What I want to do is ls a directory, skip the first... (3 Replies)
Discussion started by: lesstjm
3 Replies
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)
