Hi how do you compare it in ksh
ALINES=$(cat AFILE | wc -l)
BFIRST=$(head -1 BFILE)
I got ALINES=9 and BFRIST=records'9'
I want 9=9 , how do you write BLINES=9 from records'9' so I can say
ALINES==BLINES
Thanks (4 Replies)
I want a soultion to compare two arrays in sh with an easy way.I want a solution to synchrose users between different AIX servers where no NIS is available. All users are meant to be same on all 10 servers. So the approach is to consider first server as master user repository and whatever the users... (0 Replies)
Hi all,
How to check whether the given the two dates is minimal.
example:
Date 1 : 23-03-2008 with timestamp
Date 2: 20-03-2008 With tmestamp
I want to compare the twodates and which it gives the minimum date
i wnat to get the output like this below
output: the Date2 is... (1 Reply)
grep '^.......$' /usr/dict/words | cut -c1,2,3,5,6,7
This gives a list of 6 character strings, some are words some not. Any suggestions on how I can get rid of the ones that aren't words and print the ones that are? I have tried look with no luck yet. (1 Reply)
I have four files, I need to compare these files together.
As such i know "sdiff and comm" commands but these commands compare 2 files together. If I use sdiff command then i have to compare each file with other which will increase the codes.
Please suggest if you know some commands whcih can... (6 Replies)
Hi,
file contains only one row.
END OF FILE. ROW COUNT: 8,9
We need to check the file contains exact string "END OF FILE. ROW COUNT: " if yes, get the 8,9 values
then compare if both are equal print the "equal" if not "notequal".
Thanks, (4 Replies)
Hi,
I need your help with the below mentioned issue:
I have 2 files say,
file1.txt:
id|no|cde
a|4|7
b|3|2
c|8|8
d|8|9
file2.txt:
id|no|cde
a|4|6
b|2|2
c|8|8 (1 Reply)
Hi guys, looking for some help with a way to compare data in two files but with some conditions.
example,
File 1 consists of
site1,10.1.1.1
site2,20.2.2.2
site3,30.3.3.3
File 2 contains
site1,l0.1.1.1
site2,50.1.1.1
site3,30.3.3.3
site4,40.1.1.1
I want to be able to match the... (1 Reply)
Hi,
I have a file containing a list of codes, followed by a description, such as below:
008.0,ESCHERICHIA COLI
008.1,ARIZONA
008.2,AEROBACTER AEROGENES
008.6,ENTERITIS DUE TO SPECIFIED VIRUS
008.8,OTHER ORGANISM, NOT ELSEWHERE CLASSIFIED
008,INTESTINAL INFECTIONS DUE TO OTHER ORGANISMSI... (6 Replies)
Discussion started by: carlr
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)