As I'm not sure what "RT" in the awk program stands for (being an uninitialized and thus empty variable prohibiting the print), try this small modification of ./hari.sh's script:
Use nawk, of course...
Last edited by RudiC; 02-05-2013 at 07:13 AM..
Reason: use nawk
Hi Everyone,
I have a file with the below content:
File1.txt
======
###
###==> the below table was created for testing1 purpose;
###
create table 123
(
field1 date,
field2 char(10)
primary key(field1)
);
###
###==> the below table was created... (5 Replies)
Dear all
I have a file call interfaces.txt
Filename: interfaces.txt
How can I extract the information at below?
ABC_DB_001 hostname1 20901
ABC_DB_002 hostname2 20903
ABC_DB_003 hostname3 20905
Currently I am using a very stupid method
grep ^ABC interfaces.txt > name.txt
grep... (3 Replies)
Hi, I want to get data from Xml file by using sed or awk command. I want to get the following result :
mon titre 1;Createur1;Dossier1
mon titre 1;Createur1;Dossier1
and save it in cvs file (fichier.cvs).
FROM this Xml file (test.xml):
<playlist version="1">
<trackList>
<track>... (1 Reply)
Hi,
I have a file which has thousand of lines with lines starting with
And I want to extract and show to user only the below string from all the lines
Please note note that the above string is a time stamp and it would be different on all the lines.
Please tell me how to extract... (8 Replies)
hello forum members
I have txt file which consists the following information.
Server: abababa.xyz.ap.mxmx.com
Address: 111.143.211.202
Name: rmxd.ipc.ap.mxmx.com
Address: 144.111.99.9
from the abovefile i have to extract only string "rmxd.ipc.ap.mxmx.com" through awk command.... (1 Reply)
Hello everyone,
Firstly i do not require alot of help.. i am right at the end of finishing my scipt but cannot find a solution to the last part.
What i need to do is, prompt the user for a file to work with, which i have done.
promt the user for an output file - which is done.
#!/bin/bash... (14 Replies)
Dear all
I have a log file and the content like this
file name: temp.log
<?xml version="1.0" encoding="cp850"?>
<!DOCTYPE aaabbb SYSTEM '/dtdpath'>
<aaabbb>
<tranDtl>
<msgId>000001</msgId>
</tranDtl>
.....
</aaabbb>
...
... (1 Reply)
Please suggest a method (in c shell or any other shell) to implement following:
-To read file1.txt (sample file1 given below)
-To save name field in a variable <name>
-To save parameter field in a variable <parameter>
for ex. let a line in file1.txt be :
bill height weight
the extracted... (12 Replies)
I need to automate something as part of post processing in a script . Each project is identified by a 3 letter string which is part of hostname and based on hostname I need to copy a particular file to that machine from my distribution .
here are hostnames
pprdifeap01.corp.host.net (where... (1 Reply)
I would like to extract a digit from $0 starting 2,30 to 3,99 or 2.30 to 3.99
Can somebody fix this?
awk --re-interval '{if($0 ~ /{1}{2}/) {print FILENAME, substr($0,index($0,/{1}{2}/) , 4)}}'input
abcdefg sdlfkj 3,29 g. lasdfj
alsdfjasl 2.86 gr. slkjds sldkd
lskdjfsl sdfkj kdjlksj 3,34 g... (4 Replies)
Discussion started by: sdf
4 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)