Your output doesn't seem consistent. I think you are probably intending to convert to what is called record format, where each line conveys it's "own context". I suggest awk not grep. Here is a starting point:
Here is the same example, but this time using an awk file, because placing awk script on the command line can sometimes be confusing
I did not account for the "searched pattern" part of your records, but this is a starting point only and hope the use of awk in this fashion can help. Look at BEGIN and END statements in awk as well.
Hi
Following is the code . When I give input as Bangalore,its dospalying Welcome to Hitech City. But say , if I select Delhi or US, its not displaying the corresponding message. Its still says Welcome to Hitech City.
Seems that it not entering in the elif part. Please suggest.
#!... (4 Replies)
I just want to write a little script, that reads the lines from a file, echos somthing in a new tmp.file and then do some commands whith the tmp.files.
while read -r line
do
echo "TEST=" > tmp.$$
echo "$line" >> tmp.$$
any_command < tmp.$$
done < $INPUTFILE
But I think I have to... (2 Replies)
Dear experts,
i am quite new to shell script please any one can help me in this regard
i would like write a script which takes input in the form
>./Test.sh a,10,b,20,c,30...
in this way i can give input in any number which is not constant
in the end through loop i want to... (3 Replies)
Hi everyone,
I have n number of data in my file "temp" in following order.In each line table_name and
column_name are different.input data is in same format each query in three lines.
ALTER TABLE table_name
ADD ( column_name1 VARCHAR2(10),
column_name2 VARCHAR2(70) );
... (23 Replies)
Hi all,
i write a script c shell
set i = 1
while ( $i <= $#array )
echo "$array"
@ i++
end
i want to set it to i = i +2 in that statement . Can anybody help me?
---------- Post updated at 02:46 PM ---------- Previous update was at 02:35 PM ----------
anybody not how to solve it??? (2 Replies)
Hello I am very new to shell and I bought some books and trying to learn it. I started trying to write a script that will take a number and count it down to 1 with commas in between. This number can only be one argument. If lower than one or higher than one argument it sends an error message. ... (4 Replies)
I am looking to a solution to the following problem. I have a very large file that looks something like this:
Each group of three numbers on each line are three probabilities that sum to one.
I want to output the maximum for each group of three. So desired output would be:
or... (6 Replies)
Hi,
I have multiple files in a directory. Each file will have a header.I have to check if any of the files has 0 rows other than the header then I have to delete the files.
Here “ Empty file” in my case means a file has header information but no data. I have to delete such files.
If the file... (2 Replies)
Hi
I have written a shell script which will test 300 to 500 IPs to find which are pinging and which are not pinging.
the script which give output as
10.x.x.x is pining
10.x.x.x. is not pining
-
-
-
10.x.x.x is pining
like above.
But, this script is taking... (6 Replies)
I want to create a shell script to add a user and modify its comment field mentioned in a file.
1.
File value:-
username comment field value
xyz123 xyztesting
abc123 abctesting
def123 deftesting
2. i am using below loop to create user... (2 Replies)
Discussion started by: Anil
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)