10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hello,
I have a huge set of data that needs to be reformatted.
Here is a simple example to explain the process.
I have number n=5 and a input with many numbers separated with comma:
... (11 Replies)
Discussion started by: liuzhencc
11 Replies
2. UNIX for Dummies Questions & Answers
Dear Sir,
I have file input
RGR001|108.28|-2.86489|100-120|RANGGAR
RGR002|108.071|-2.69028|80-100|RANNGAR
RGR003|108.168|-2.97053|50-80|RANNGAR
RGR007|108.192722222|-2.766138889|0-50|RANGGARI want to create files by joining each rows with each rows below
Output as below
... (4 Replies)
Discussion started by: radius
4 Replies
3. UNIX for Dummies Questions & Answers
Hallo Team,
I need to manipulate existing data file. Have a look at current data and expected data:
Current Data:
27873517141
27873540000
27873515109
27873517140
27873540001
27873540000
27873501343
27873540000
27873517140
27873511292
27873645989
27873540000
27873540000... (7 Replies)
Discussion started by: kekanap
7 Replies
4. Shell Programming and Scripting
Hello, I am a very novice user of awk, I have a set of files named file001, file002, file003, file004, etc., each contains four fields (columns of data) separated each by a uneven number of spaces. I want to substitute those spaces by a TAB, so I am using this line of awk script:
awk -v OFS="\t"... (4 Replies)
Discussion started by: jaldo0805
4 Replies
5. UNIX for Dummies Questions & Answers
Hello Unix.com
How can I sort from a large email list only the emails that finish with .ca domain?
cat <list> | grep "\.ca\b" >> <new list> isnt working perfectly.
Any tips?
Best regards, Galford D. Weller (2 Replies)
Discussion started by: galford
2 Replies
6. UNIX for Dummies Questions & Answers
Hi all!
my first post here, so mods -- if this should ideally be in the scripts section, please move there. Thanks!
I have data in the following format:
key1:value1 key2:value2 key3:value3
A
B
C
D
key1:value4 key2:value5 key3:value6
A1
B1
key1: ...
and so on
I want an output... (2 Replies)
Discussion started by: gnat01
2 Replies
7. UNIX for Dummies Questions & Answers
Hi Everyone,
I was wondering if someone could help me to transform my data into a format I need.
Here is an example of what my data looks like
E F G H
A 1 2 3 4
B 5 6 7 8
C 9 1 2 3
D 4 5 6 7
and this is what I would need it to look like:
AE 1
BE 5
CE 9
DE 4
AF 2
BF 6
CF 1 (6 Replies)
Discussion started by: zajtat
6 Replies
8. Shell Programming and Scripting
HI all
i have a file consisting of following numbers
0000
0000
0000
0000
0000
1010
0000
0100
0000
0000
0000
1111
0000
1010
0000
0100 (3 Replies)
Discussion started by: vaibhavkorde
3 Replies
9. Shell Programming and Scripting
Hi everyone..
I am new here, hello.. I hope this doesn't come across to you folks as a stupid question, I'm somewhat new to scripting :)
I'm seeking some help in finding a way to manipulate data output for every two characters - example:
numbers.lst contains the following output:... (3 Replies)
Discussion started by: explicit
3 Replies
10. UNIX for Dummies Questions & Answers
Hello
I am currently having problems in mapulating a certain file which contains vaious data.
Belos is a sample content
Event=<3190>
Client IP=<151.111.11.143> DNS=<abc.sbc.com> TransCount=<139>
Client IP=<150.222.133.163> DNS=<xyz.yuu.com> TransCount=<3734>
Event=<3120>
Client... (11 Replies)
Discussion started by: khestoi
11 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)