what the sed statement does is, extracts the table "ReplicatorInfo" and pastes it into tablextract.sql.... but its not functioning properly because the end point is lowercase but in fact the endpoint should be in upper case since it is same way in main file... so can anyone please help me to modify same sed command so that endpoint is considered as case insensitive.. :-/
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)
I need to remove a pattern say, ABCD whether it is in uppercase or lowercase from a string. How to do it using SED?
for example
ABCDEF should output to EF
abcdEF should also output to EF (2 Replies)
Hello,
How do I set case insensitive search mode while the file is open with more command ?
(I know -i option which could be used before opening)
thanks
Vilius (2 Replies)
Hi,
I have a file named "test_file" that has the below content. It has words in upper/lower cases
PRODOPS
prodOPS
ProdOps
PRODops
escalate
Shell
My requirement is to replace all the "prodops" (what ever case it may be) with "productionoperations".
I tried using the "i" option with... (7 Replies)
here is a statement
awk '/CREATE PROCEDURE/,/elimiter/' "$file1" > onlyproc1.sql
which mean cut from create procedure to Delimiter or delimiter and paste it in onlyproc1.sql... my query is how to make this case insensitive.. that is i want the above code to work whther it is Delimiter or... (26 Replies)
I am using a variable called $variable in a pattern search to print from a starting variable to a constant value. the variable search should be case in sensitive.
i tired using Ip at the end in the below command. but in ksh it is not working.
sed -n "/$variable/,/constant/p" file
i also... (11 Replies)
Hi All,
What is the command to search a file for a case-insensitive match
1.grep -nc text filename
2.grep -i text filename
3.grep -i filename text
4.grep -nc filename text
5.grep -c text filename
Thanks for your help (1 Reply)
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
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)