07-01-2014
Hi i am not able to work with grep -o in my OS
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi
Let say there is a file a.txt which contain number rows.
My intention is to find the number of occurences of a pattern. Let say the pattern is mdbase. then it should not count the occurences of mdbase1 or mdbase2 like this. When I tried to find it like
grep "/backup/surjya/mdbase"... (7 Replies)
Discussion started by: surjyap
7 Replies
2. Shell Programming and Scripting
I am trying to do some thing like this ..
In a file , if pattern found insert new pattern at the begining of the line containing the pattern.
example:
in a file I have this.
gtrow0unit1/gctunit_crrownorth_stage5_outnet_feedthru_pin
if i find feedthru_pin want to insert !! at the... (7 Replies)
Discussion started by: pitagi
7 Replies
3. Shell Programming and Scripting
Hi All,
I need to search in a csv file as mentioend in the Appendix A for a exact word lets "TEST".
But using teh below command iam getting TEST1234, TEST12 and otehr entries as well.
the problem is i check this condition to check to add a record to a table by making sure it does not... (16 Replies)
Discussion started by: rahman_riyaz
16 Replies
4. Shell Programming and Scripting
Contents of my file is:
DI
DI
DIR
PHI
I want to extract only DI. I am using below command
grep -w DI <file>
but it is also extracting DI.
Can i use any other command to extract exact pattern where '[' does not have special meaning (4 Replies)
Discussion started by: nehashine
4 Replies
5. Shell Programming and Scripting
I have a output like below:
A1
B2
C1
D3
A12
B4
A14
I am trying to find A1 by using grep
grep -i "A1"
But I got (4 Replies)
Discussion started by: anupdas
4 Replies
6. Shell Programming and Scripting
Hello.
I have written the following script to search and replace from one file into another.
#awk script to search and replace from file a in file b
NR == FNR { A=$2; next }
{ for( a in A ) sub(a, A)}1 file2 file1
While the function works pretty well, I want
a. The word in File 2 to... (8 Replies)
Discussion started by: gimley
8 Replies
7. Shell Programming and Scripting
Hello Everyone,
Im trying to run a search and replace of exact strings and the strings that im using variables that are passed through an array in a while loop. Here is a snip of my code:
USEROLD=`cat oldusers`
USERNEW=`cat newusers`
USEROLDARRAY=( $USEROLD )
USERNEWARRAY=( $USERNEW )... (4 Replies)
Discussion started by: skizim
4 Replies
8. Shell Programming and Scripting
Hi,
x=GATE
ps -ef|grep pmon
grid 552 1 0 Aug08 ? 00:00:51 asm_pmon_+ASM1
oracle 4314 1 0 Aug08 ? 00:04:08 ora_pmon_GATE1
oracle 5018 1351 0 10:14 pts/1 00:00:00 grep pmon
oracle 7329 1 0 Aug08 ? 00:02:19 ora_pmon_NRID1
ps... (3 Replies)
Discussion started by: rcc50886
3 Replies
9. Shell Programming and Scripting
My Input :
Hi editor
this is the
exact
pattern
which we looking for
the
previous
patternmatch
My code:
awk '/pattern/ { print a } { a = $0 }'
Current output :
exact
previous (3 Replies)
Discussion started by: Roozo
3 Replies
10. UNIX for Beginners Questions & Answers
I have this fileA
TEST FILE ABC
this file contains ABC;
TEST FILE DGHT this file contains DGHT;
TEST FILE 123
this file contains ABC,
this file contains DEF,
this file contains XYZ,
this file contains KLM
;
I want to have a fileZ that has only (begin search pattern for will be... (2 Replies)
Discussion started by: vbabz
2 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)