Hello,
I am writing a shell script and I need to find a way to
count the number of whitespaces in a string.
Eg:
NAME="Bob Hope"
I am looking for a way to count the number of whitespaces in this string. So a command that would take this string and return 1.
Or take
"First Middle Last"... (3 Replies)
Sample input:
Loading File System
Networking in nature
Closing the System
now i need to extract the patterns between the words File and Closing:
i.e. sample output:
System
Networking in Nature
Thanks in advance !!!!!!!!!!!!!!!!! (6 Replies)
Hi,
i have following lines of code which is properly working.
CAT1="${InputFile}CAT_*0?????"
CAT2="${InputFile}CAT_*0?????"
CountRecords(){
integer i=1
while ]; do
print P$i `nawk 'END {print NR}' $1 ` >> ${OutputPath}result.txt &
i=i+1
shift
done
}
CountRecords "$CAT1"... (8 Replies)
This should be somewhat simple, but I need some help with this one.
I have a bunch of files with tags on the end like so...
Filename {tag1}.ext
Filename2 {tag1} {tag2}.ext
I want to hold in a variable just the filename with all the " {tag}" removed. The tag can be anything so I'm looking... (4 Replies)
Hi guys...Wow I just composed a huge post and it got erased as I was logged out automatically
Anyways I hope someone can help me out here.
So the task I'm working on is like this
I have a bunch of files that I care about sitting in a directory say $HOME/files
Now my job is to go and loop... (6 Replies)
I need something to strip out some text from a string. I basically have a variable that will always be in the same pattern but will be a different length. Example below. I need to somehow extract the text between <Strat> and </Source> from example below. I can't load it into a file for audit... (5 Replies)
HI,
Please help me with the following problem:
I have an xml file with the following lines
<NameValuePair>
<name>SharedResources/JDBC/Admin/password</name>
<value>rjmadmin</value>
</NameValuePair>
<NameValuePair>
... (4 Replies)
Hi,
I am trying to find a way to get sed/awk/grep to help me find a string in a log file that exists between two datestamps and then print the preceding datestamp up to the next datestamp.
Here is an example of my logfile:
+++ 2013/03/28 17:01:37.085 SIGNALING HIGH ACTIVE
Failure Response... (5 Replies)
Hi all, I wish to get the string between u' and '
This is the test.txt file:
PLAY ***********************************
GATHERING FACTS *****************************
OK:
TASK: ****************************
changed:
TASK: ***************************
ok: => {"msg":... (11 Replies)
Discussion started by: celine
11 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)