Hi, I did the way you suggested but still it's not working fine. It's displaying good records on console and displaying all good and bad records with errorcode attached to the bad records into a single good file. Bad file is not getting created.
Code i used :
There is a HUGE difference between the code RudiC suggested:
and the code you're using:
The condition OUT==$0 must be placed on the same line as the opening brace for the actions to be performed when that condition is true.
Otherwise, as you have seen, you get the default action for the good lines (print to standard output) and write every line (the default when no condition is specified) to the file named by GOOD and skip remaining lines in the script (next) (so nothing is written to the file named by BAD on the next line of your script.
Hi,
I have a situation to append spaces to end of first record (header)and last record (footer) based on second record length.
The first record length is always 20.The second record will be different for different files.I have to append spaces for the first line based on second record... (2 Replies)
I have problem when I use the command "pax -awvf /dev/rmt0 ./data1" in AIX 5.3.0.0. The command with parameter -a allow me to append the tape but when I try to retrieve the data that I append, it will show me error.
I would like to know if anyone have the same problem and any solution found?
Tq. (0 Replies)
Hi,
I have a sample file which contains records.
Input File :
1 user1 username1\password@database-name
2 user2 username2\password@database-name
3 user3 username1\password@database-name
I should search for a 'username1\' in those records. If 'username1\' is found in those records, that record... (7 Replies)
Hi All,
I just want to append the value in variable at the end of the file.
var=1234
sed -e "$a $var" file1 > file 2.
But I get this error
sed: -e expression #1, char 4: unknown command: `1'
Kindly let m know how can I do that... (5 Replies)
Hi Everyone,
I have an issue and trying to get a solution but was not succesful yet. Any help is greatly appreciated.
I am using ksh to inoke sql loader to load data from txt file into two oracle tables based on the condition written in the control file. If an error occurs while loading into... (8 Replies)
Hello,
For the input file, I am trying to split those records which have multiple values seperated by '|' in the last input field, into multiple records and each record corresponds to the common input fields + one of the value from the last field.
I was trying with an example on this forum... (4 Replies)
Hi! all
can any one tell me how to compare current record of column with next and previous record in awk without using array
my case is like this
input.txt
0 32
1 26
2 27
3 34
4 26
5 25
6 24
9 23
0 32
1 28
2 15
3 26
4 24 (7 Replies)
I need to append |\r\n (a pipe character and CRLF) at end of each record in Unix to all records where they are not already present.
So first check for the presence of |\r\n and if absent append it else do nothing (3 Replies)
export PATH=$PATH:/opt/IBM/db2/V9.5/95fp4/bin
DB2INSTANCE=bancbcb1
export DB2INSTANCE
db2 "connect to dyaxprpt user xyz using byx"
echo "Load lastest data start"
Row=$(db2 –x “delete from xyz.ROL_yxpwhere axl_ING_ID in(50127,50455,503458,175748)”)
If ; then
echo “no data deleted”
elif ;... (2 Replies)
Discussion started by: jagu
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)