10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I hope I can explain this correctly. I am using Bash-4.2 for my shell.
I have a group of file names held in an array. I want to compare the names in this array against the names of files currently present in a directory. If the file does not exist in the directory, that is not a problem.... (5 Replies)
Discussion started by: BudMan
5 Replies
2. UNIX for Dummies Questions & Answers
I run cygwin on windows 7, and have been using the windows command line. I've been trying to gunzip some previously compressed large sequence output files in .txt.gz format. This worked for about the first 10 files and then for the rest of them the file (as viewed using the 'head' command) is... (1 Reply)
Discussion started by: woceht
1 Replies
3. UNIX for Dummies Questions & Answers
NEVERMIND.... "$TIME" did the trick... stupid me. :o
Hi,
I know that this must be something pretty dumb but I cant figure it out myself.
I have this:
#!/bin/bash
TIME="Time: 20120611"
FILE=file.log
grep $TIME $FILE
And I get the following output:
file.log:Time: 20120611... (2 Replies)
Discussion started by: RedSpyder
2 Replies
4. Shell Programming and Scripting
In shell script i have two variables with value
debit_sal="DOG,HIU,JIU,GYT,PPI,KIU,HUY........."
debit_req='HIU, JIU, HUY, GTR, KOI, ............"
i stored this two in two array
arr=$(echo $debit_sal| tr "," "\n");
arr1=$(echo $debit_req| tr ", " "\n"); #(note second arry has comma with... (5 Replies)
Discussion started by: greenworld123
5 Replies
5. Shell Programming and Scripting
Disclaimer: OP is 100% Awk beginner.
I use this code on ASCII files I need to report against.
awk 'BEGIN {
tokens = 0
tokens = 0
tokens = 0
}
{ for (token in tokens)
{ if ($1 == token){print $0; tokens++;}}}
END {for (token in tokens){
if( tokens ==... (1 Reply)
Discussion started by: alan
1 Replies
6. Shell Programming and Scripting
hi friends,
The code:
i=1
while
do
filename=`/usr/bin/ls -l| awk '{ print $9}'`
echo $filename>>summary.csv
#Gives the name of the file stored at column 9
count=`wc -l $filename | awk '{print $1}'`
echo $count>>summary.csv
#Gives just the count of lines of file "filename"
i=`expr... (1 Reply)
Discussion started by: rajsharma
1 Replies
7. Shell Programming and Scripting
Hi,
I am trying to sort and display the below(like) input using awk command:
Input:
------
0;A
4;A
5;A
33;A
45;A
0;B
4;B
5;B
33;B
45;B
Output (desired): (5 Replies)
Discussion started by: pvamsikr
5 Replies
8. UNIX for Dummies Questions & Answers
Hello,
I have two strings those are outputs of two echo commands:
$ logslist=`ls -1rt vp_lb_indv*.log | tail -1`; tail -7 $logslist | head -1
ERROR: Errors printed on pages 5,22.
$ logslist=`ls -1rt vp_lb_indv*.log | tail -1`; errpages=`tail -7 $logslist | head -1`; echo... (3 Replies)
Discussion started by: memoconq
3 Replies
9. Shell Programming and Scripting
Hello,
I have a shell script that is used as follows:
./script -s <Oracle_server_name>
the script returns several lines in this format:
parameter name required value Current Value comments
--------------- ------------- -------------- ---------
My objective now is to compare 2... (1 Reply)
Discussion started by: melanie_pfefer
1 Replies
10. Shell Programming and Scripting
I have a output of a command like this.
the command is : bdf|sed '/^e/d'|awk '{print$2/1048576}'
output :
0
0.515625
0.481979
2
2
2
7.8125
4
2
0.488281
7.8125
3.90625
4
1.95312
1
0.488281 (4 Replies)
Discussion started by: Krrishv
4 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)