03-23-2010
Thanks for the answers, is it possible with awk?
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi All
I have the input file OMAK_11.
OMAK 000002EXCLUDE 1341
OMAK 000002EXCLUDE 1341
OMAK 000002EXCLUDE 1341
OMAK 000003EXCLUDE 1341
OMAK 000003EXCLUDE 1341
OMAK 000003EXCLUDE ... (8 Replies)
Discussion started by: dhanamurthy
8 Replies
2. Shell Programming and Scripting
I have a log file that for some reason, once or two time a month, line foods are missing.
This log is generated from vmstat everyminute. I dont know why sometimes it does this.
Each line in the log should have 18 columns separated by one or more spaces.
Good Log: (not actual log)
1 1... (8 Replies)
Discussion started by: Ikon
8 Replies
3. Shell Programming and Scripting
I have a list of id;
for example: file 1
dfghd
dfghe
dfgey
dfgeu
I have another data file that contain this ids as headers;
for ex. file2
>dfghd
gfdgfddl;klfkld;ld;lgl;dld'l'dv
>dfghe
gkwhjhsgdjdjdjhjddj
>dfgey
jdkjfhdjhfdkjhfdkhkdk
I wanted to compare file 1 and file 2... (1 Reply)
Discussion started by: Lucky Ali
1 Replies
4. Shell Programming and Scripting
Hi,
I have a text file with the following content:
monday,20
tuesday,10
wednesday,29
monday,10
friday,12
wednesday,14
monday,15
thursday,34
i want the following output:
monday,45
tuesday,10
wednesday,43
friday,12 (3 Replies)
Discussion started by: prashu_g
3 Replies
5. Shell Programming and Scripting
Thanks Bartus11 for your help in the following code to compare the two files "t1" and "t2".
awk 'NR==FNR{a=1;next}$2 in a{print $2}' t1 t2
First can anyone explain that what is the purpose of assigning a =1?
Second, the current script is printing out the matched columns between the... (4 Replies)
Discussion started by: coder83
4 Replies
6. Shell Programming and Scripting
Hi,
I'm running a DB query which returns names of people and writes it in a text file as shown below:
Carey, Jim; Cena, John
Cena, John
Sen, Tim; Burt, Terrence
Lock, Jessey; Carey, Jim
Norris, Chuck; Lee, Bruce
Rock, Dwayne; Lee, Bruce
I want to use awk and get all the names... (9 Replies)
Discussion started by: prashu_g
9 Replies
7. Shell Programming and Scripting
Hi all.
This is my first post on this forum. I've previously found great help in the huge knowledgebase that is here, but this time I have not been able to find a solution to my problem.
I have a large text file that looks like this:
typedef struct ABC_struct_nbr1_ {
char attr1; /*... (0 Replies)
Discussion started by: Yagi Uda
0 Replies
8. Shell Programming and Scripting
so my output is this:
session_closed=157
session_opened=151
session_closed=18
session_opened=17
there are two patterns here, but with different values. the two patterns are "session_opened" and "session_closed". i expect there will be many more other patterns.
what i want to do is... (8 Replies)
Discussion started by: SkySmart
8 Replies
9. Shell Programming and Scripting
The variable COUNTPRO contains:
COUNTPRO='Error__posting__message__to__EMR__Queue=0
Error__parsing__ReceiptSummary=0
xinetd__=4327
HTTP__1_1__500___=0
START__=2164
Marshaller__exception__while__converting__to__Receipt__xml=0
MessagePublisher__is__not__configured__correctly=0... (9 Replies)
Discussion started by: SkySmart
9 Replies
10. Shell Programming and Scripting
I need to vlookup and check the server not found.
Source file 1
server1
server2
server3
server4
server5_root
server6_silver
server7
server7-test
server7-temp
Source file 2
server1_bronze (6 Replies)
Discussion started by: ranjancom2000
6 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)