10 More Discussions You Might Find Interesting
1. UNIX for Beginners Questions & Answers
Dears,
In the below string, please let me know how to make the sed search case-incensitive. I have more such lines in my script instead of let me know any other easier option.
sed -n '/dn: MSISDN=/,/^\s*$/p' full.ldif > temp ; sed -n... (4 Replies)
Discussion started by: Kamesh G
4 Replies
2. UNIX for Dummies Questions & Answers
I am using HP-Unix B.11.31.
Question: How to do the case insensitive search using FIND?
Example: I would like list the files with extension of *.SQL & *.sql.
When I try with command find . -type f -name *.sql, it does not lists file with *.SQL. (5 Replies)
Discussion started by: Siva SQL
5 Replies
3. Shell Programming and Scripting
Hi All,
In one shell script I have
In variable "i" I am getting a full path of a file. Now I want to compare something like
-- upper(*Nav*))
I dont want to do like below because in each CASE statement I doing so many operations.
Please guide me.
Thanks in advance... (4 Replies)
Discussion started by: vishalaksha
4 Replies
4. Shell Programming and Scripting
Hey , i am trying to do a search for the certain books , and im trying to make it case insensitive. what i have come up with so far is this :
Database.txt
RETARDED MONKEY:RACHEAL ABRAHAML:30:30:20
GOLD:FATIN:23.20:12:3
STUPID:JERLYN:20:40:3
echo -n "Title: "
read Title
echo -n... (3 Replies)
Discussion started by: gregarion
3 Replies
5. Shell Programming and Scripting
Hi,
Im still new to scripting and this forum and could so with a little help
I understand:
if ; then
good
else
bad
fi
but how do I do the same check but ignore the case of <dir2>?
Many thanks!
Matt (1 Reply)
Discussion started by: mjwoodford
1 Replies
6. Shell Programming and Scripting
Hi All,
How we can perform case-insensitive search with AWK.:rolleyes:
regards,
Sam (11 Replies)
Discussion started by: sam25
11 Replies
7. Shell Programming and Scripting
I'd like to print a line if a substring is matched in a case insensitive manner
something like do a case insensitive search for ABCD as a substring:
awk '{ if (substr($1,1,4) == "") print $1 }' infile > outfile
I'm not certain how to make the syntax work???
Thanks (4 Replies)
Discussion started by: dcfargo
4 Replies
8. Shell Programming and Scripting
hi everyone,
I need to do the following thing in a case insesitive mode
sed 's/work/job/g' filename
since work could appear in different form as Work WORK WorK wORK,....
I was wondering if i could do a case insensitive search of a word.
thanks in advance,
:) (4 Replies)
Discussion started by: ROOZ
4 Replies
9. Shell Programming and Scripting
can I tell awk to be case insensitive for one operation without setting the ignorecase value ?
thanks,
Steffen (7 Replies)
Discussion started by: forever_49ers
7 Replies
10. UNIX for Dummies Questions & Answers
How can I do a case insensitive locate? (3 Replies)
Discussion started by: davis.ml
3 Replies
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)