I have a Ques. Regarding awk
I have few strings in a file, like..
ABC
DEF_ABC
GHI_ABC
GHI
Now I want string which has only 'ABC', not the part of any other string as it is also present in 'DEF_ABC'
Output should be ABC
Please guide me asap !!
Thanks :b: (4 Replies)
Goo afternoon Sir'sould like to ask your help reagrding in this scenario using sed and awk.
********************************************************
Host:CDRMSAPPS1
Operating System:Linux 2.6.9-42.ELsmp
Machine Type:UNIX
Host Type:Client
Version:5.1... (2 Replies)
Hi,
I need to do the following but I don't know exactly what to do.
I need to monitor a file ... with tail -f for example, but I know that I could do it with awk, wait for a specific string ... , then perform an action, call a script, etc.
Let's say that my file name is test.txt , I need... (3 Replies)
Hi ,
i have file with delimiter as "|" and data in Double codes for all fields. how to filter data in a column like awk -F"|" '$1="asdf" {print $0}' test.
ex : "asdf"|"zxcv"
Thanks,
Soma (1 Reply)
hallow all i have question about awk i want indexing last key (in BOLD number)
ex: input.txt
1
252468812
52468812
1281268819
1252468812
1252468923
468812
1252468812
so output will like this
output text
1:252468812
2:52468812
4:1252468812
6:468812
7:1252468812
output get... (8 Replies)
Hello Gurus,
I have a requirement where I have to filter a value from some field which has 99% or greater than '99%'..
For ex:
The Date (file -- sample.csv) will be like below
Field1,Field2,Field3,Field4
860440512,844284992,16155520,99%
860440512,844284992,16155520,94%... (4 Replies)
I am trying to filter out some data with awk. If someone could help me that would be great. Below is my input file.
Date: 10-JUN-12 12:00:00
B 0: 00 00 00 00 10 00 16 28
B 120: 00 00 00 39 53 32 86 29
Date: 10-JUN-12 12:00:10
B 0: 00 00 00 00 10 01 11 22
B 120: 00 00 00 29 23 32 16 29... (5 Replies)
i have text file as below
CMF_COMP_ELEM_ GSM2_B71.WORLD_20121114130908.log 107496444 rows inserted into ALL_S1_CMF_COMP_ELEM.
CMF_COMP_ELEM_ GSM3_B71.WORLD_20121114130908.log 110729006 rows inserted into ALL_S1_CMF_COMP_ELEM.
CMF_COMP_ELEM_ GSM4_B71.WORLD_20121114130908.log 92549475... (8 Replies)
Hello all,
can you explain why this filter does not work, it prints all the lines in the file:
awk -v sel="TestString" 'sel' file while these work:
awk '/TestString/' file
awk -v sel="TestString" '$0~sel' file
Thanks!:) (6 Replies)
Discussion started by: gio001
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)