You are telling awk to either print the line that contains duplicates or print the string No Duplicates for each input line you read from the file. Try this instead:
Code:
awk '
BEGIN { FS = OFS = ","
}
$2 == $3 {
print
f++
}
END { if(f == 0) print "No Duplicates"
}' List_No_Duplicates.txt
If someone wants to try this on a Solaris/SunOS system, change awk to /usr/xpg4/bin/awk or nawk.
hi there
I'm getting a string from a sqlplus query, and I need to compare it with another string
Problem here, is that the string i get from query brings a 'carriage return' with it, and comparing throws always false value.
i need to delete all carriage retun charactres in string.
how... (6 Replies)
Hi friends
I need to return string value in functions
can anyone help me out to return string values rather than integer.
#!/bin/bash
add_a_user()
{
USER=$1
COMPANY=$2
shift; shift;
echo "Adding user $USER ..."
echo "$USER working in $COMPANY ..."
ret_type=YES
return... (1 Reply)
Hi there
i have a script which will create unix user accounts. Id like to validate the entered string so that it is specifically 8 characters or less and consists of only ! not
Is there a way to validate a string against a regular expression.. i.e
size=`printf "$var | wc -m`
... (1 Reply)
I have a folder of scripts:
bash:/folderpath/> ls
beginFile.sh
beginFileBackup.sh
beginAnother.sh
beginAnotherBackup.sh
beginJunk.sh
beginJunkBackup.sh
I'd like to be able to call just one (beginFile.sh) using this type of scheme:
#Run the beginFile script without the word "Backup" in... (1 Reply)
function blah {
return "string"
}
it keeps saying string: not found
How can i do this guys? Because I'm trying to do something like this
function print_daemon_options {
echo "Start Daemons - Please enter one or a combination of the following:"
if isDatasubEnabled &&... (11 Replies)
Gurus,
I have a files from where lines are like following
<ns0:ccid>123456789</ns0:ccid>
<ns0:ccid>1234
56789</ns0:ccid>
I would like to grep any number which will be as below (with carrige return): As 123456789 any number so I have to use the regular expression
<ns0:ccid>1234... (3 Replies)
Hello,
Awk seem treat the pattern as regular expression, how can awk search not using regular expression? e.g. just represent for "", not "A" or "a" . I don't want to add backslash . (2 Replies)
here is what i want to achieve... consider a file contains below contents. the file size is large about 60mb
cat dump.sql
INSERT INTO `table1` (`id`, `action`, `date`, `descrip`, `lastModified`) VALUES (1,'Change','2011-05-05 00:00:00','Account Updated','2012-02-10... (10 Replies)
Hi,
temp="/usr=25,/usr/lib=12"
How to get only dir names with out values.
I tried like below but no use.
tmp=${temp##*,}
echo $tmp
o/p:
/usr/lib=12
expected o/p:
/usr /usr/lib ---> in array (13 Replies)
Hi,
I am writing a script in awk trying to replace strings that are math expressions with their result.
For example, I have a file that looks like this:
5-1
32/8-1
4*12
17+1-3
I would like to get the following output:
4
3
48
15
I tried doing it the following way (using the "bc"... (8 Replies)
Discussion started by: avi.levi
8 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)