01-08-2013
What did you try while using awk?
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Dears,
I have the below data,
sss-aaaaaa
111211 222222 33333 22222 1163111
sss-vvvvvv
111311 224522 335633 24322 111511
sss-cccccc
111221 224522 333333 24322 111511
sss-dddddd
111211 222222 33333 22345222 113111
I want to make them like
... (7 Replies)
Discussion started by: yahyaaa
7 Replies
2. Shell Programming and Scripting
Hi all,
This is program to identify and arrange programs(scripts) based on their she-bang values to a folder with the same name.
The parts of mkdir and copy and creating problems.I also doubt the use of hash...maybe some problems in it.
Please help out debugging this.
Code pasted at:
Paste... (2 Replies)
Discussion started by: Vivek788
2 Replies
3. Shell Programming and Scripting
Hello Guys,
I have around 100 hosts setup as alias in my profile for easy sshing.
alias ada='ssh -Y username@da.domain.com'
alias ast='ssh -Y username@terix.domain.com'
alias bb1='ssh -X username@ggserver.ns.domain.com'
.
.
.
.
I now would like to use sshmenu software in which... (4 Replies)
Discussion started by: upengan78
4 Replies
4. UNIX for Dummies Questions & Answers
Hi
I have 100 xy graphs and need to average these together in a line by line fashion. The value of the x axis are the same. y differs e.g. taking only 2 graphs:
graph 1
x y
1 3
2 5
3 7
4 9
5 11
graph 2
x y
1 4
2 6
3 10 (2 Replies)
Discussion started by: jenjen_mt
2 Replies
5. Shell Programming and Scripting
Hi there!
Can this be done with AWK? Several text files (file1, file2, etc) with different number of lines. Need to append each file to a Reference File (ReFile), and match each line of file1, file2 etc to the closest value in ReFile. Empty cells must be filled with NA, or 0. The number of lines... (2 Replies)
Discussion started by: sramirez
2 Replies
6. UNIX for Dummies Questions & Answers
I have thousand lines of data...:
A 1
B 2
C 3
D 4
E 5
A 21
B 22
C 23
D 24
E 25
A 31
B 32
C 33
D 34
E 35
...........
ON AND AND ON (3 Replies)
Discussion started by: bobo
3 Replies
7. Shell Programming and Scripting
Hello All,
Please find attached input and output files. I want to write a shell script to achieve this. I tried using awk but not getting how to do this as I am new to shell programming.
Thanks (4 Replies)
Discussion started by: Sudeep Bhattad
4 Replies
8. Shell Programming and Scripting
I have a file with user activity and need to display only the start and end timestamp of the activity. I don't know how can we write an logic for this please help me in a bettr way to work on it
User Activity_log
-----------------------------------
... (5 Replies)
Discussion started by: lazydev
5 Replies
9. Shell Programming and Scripting
I have data like this
1 a,b,c 2 a,c 3 b,d 4 e,f would like convert like this 1 a 1 b 1 c 2 a 2 c 3 b 3 d 4 e 4 f
Please help me out (4 Replies)
Discussion started by: jhonnyrip
4 Replies
10. UNIX for Beginners Questions & Answers
By using this code how can we get the stars in inverted positions?
str="*"
for i in 1 2 3 4 5
do
echo "$str"
str="$str *"
done
The output should be like this
* * * * *
* * * *
* * *
* *
*
Please use CODE tags as required by forum rules!... (5 Replies)
Discussion started by: Meeran Rizvi
5 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)