03-15-2011
could you please comment on the code to make me understand a bit
thanks for your help though
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hello all,
Below is what I am trying to accomplish:
I have a file that looks like this
/* ----------------- xxxx.y_abcd_00000050 ----------------- */
jdghjghkla
sadgsdags
asdgsdgasd
asdgsagasdg
/* ----------------- xxxx.y_abcd_00000055 ----------------- */
sdgsdg
sdgxcvzxcbv... (8 Replies)
Discussion started by: alfredo123
8 Replies
2. UNIX for Dummies Questions & Answers
Hello. I have an RS/6000 running AIX 4 and I need to be able to see if there are any users that are logged on more than once from the same terminal so I can kick them off to make room for other terminals. 64 connections is the limit. Currently I am doing this:
who | more
and then manually... (11 Replies)
Discussion started by: raidzero
11 Replies
3. Shell Programming and Scripting
Hello,
I have a page where multiple fields and their values are displayed. But I am able to sort only a few fields. When I looked into the issue, it is seen that the for each row of info , an unique id is generated and id.txt is generated and saved. Only those fields which are inside that id.txt... (3 Replies)
Discussion started by: eagercyber
3 Replies
4. UNIX for Dummies Questions & Answers
Hi,
Let's say I have these 3 columns;
NGC1234 6 9
SL899 4 1
NGC1075 8 3
SL709 5 2
And I want to sort the data according to the first column (from a to z) like having them as:
NGC1075 8 3
NGC1234 6 9
SL709 5 2
SL899 4 1
Can that be done... (2 Replies)
Discussion started by: cosmologist
2 Replies
5. UNIX for Dummies Questions & Answers
Hi,
I have a problem on data sorting, example my file as below:
123 123/789 aaa bbb ccc ddd (adf)
112 112/123 aaa bbb ccc (ade)
102 1a3/7g9 (adf)03
110 12b/129 aaa bbb ccc ddd fff(a8f)03
117 42f/8c9 aaa bbb ccc ddd (adf)
142 120/tyu fff... (7 Replies)
Discussion started by: 793589
7 Replies
6. UNIX for Dummies Questions & Answers
Hello guys. I need help figuring this one out. It's probably really easy. Thanks in advance!
I have a file say for example containing this:
Rice Food
Carrots Food
Beans Food
Plates Kitchen
Fork Kitchen
Knives Kitchen
I need:
Food Rice, Carrots, Beans
Kitchen Plates, Fork,... (7 Replies)
Discussion started by: visuelz
7 Replies
7. Shell Programming and Scripting
My actual data looks like below
i have given only format. i can't give exact data format of my requirement due to some reasons. I this set of data lines about 5000
I need to come up with information in below
exact format of my data set :
Line<space>Number1<space>"somedata":... (1 Reply)
Discussion started by: ckaramsetty
1 Replies
8. Shell Programming and Scripting
Hi,
PFB the data:
C_Random_130417
Java_Random_130518
Perl_Random_120519
Perl_Random_120528
so the values are ending with year,i.e.,130417
i want to sort the values with date.
i want the output like this:
Perl_Random_120519
Perl_Random_120528
C_Random_130417
Java_Random_130518
can... (5 Replies)
Discussion started by: arindam guha
5 Replies
9. Shell Programming and Scripting
Hi Gurus,
I have a requests to sort data based on AS 400 sorting order. below is example: the data is sorted by ascending order. could anybody explain how AS 400 sort data?
IMM00007
07918607
1242
423 (3 Replies)
Discussion started by: green_k
3 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)