assuming "cat" is the pattern, string (regardless length)
asdadfcat4
I need to get 4
for eirtrjkkkcat678- I'd get 678
(in b-shell)
Thanks in advance!!! (4 Replies)
How can find the intersection between files
for Example:
file1
entry1
entry2
entry3
entry33
file2
entry2
entry4
entry5
.
.
.
.
the output should be
entry2 (9 Replies)
Hi,
I have a string assinged to a varaible as below.
FILE=/var/adm/message
If $FILE is the value where it stores the path of message file.
I would like to extract the location of the file message as below
LOCATION=/var/adm
FILE may have value like /var/adm/xxxx/message
... (2 Replies)
Hi mates,
I am doing a script in ksh. I have the following string:
/opt/one/two/four/five/myFile.txt
And I have a variable:
echo "${variable}" -> /opt/one/two/
I would like to have just the string: four/five/myFile.txt
What is the better way to do that?
Thanks in... (3 Replies)
Hi,
A piece of script from Perl-cookbook I do not understand, and post here for explanation.
The purpose is to find the element in either array (union), and in both array (intersection). Thank you in advance.
@a=qw(1 3 5 6 7 8);
@b=qw(2 3 5 7 9);
foreach $e (@a, @b) {$union{$e}++ &&... (3 Replies)
I have a string something like "/opt/src/default.cfg" OR /opt/src/common/one
This whole string stored in an array. The problem is this string is not constant and it will keep on changing as lot of strings are stored in the array and it will be look like :-
case 1
/opt/src/default.cfg ... (8 Replies)
i have something like this...
echo "teCertificateId" | awk -F'Id' '{ print $1 }' | awk -F'te' '{ print $2 }'
Certifica
the awk should remove 'te' only if it is present at the start of the string.. anywhere else it should ignore it.
expected output is
Certificate (7 Replies)
Hi Friends,
I would like to be helped for the following issue I am currently stuck with
I have two files like the following
tom ram 10 20
hey bye 11 12
bus cat 20 30
put but 25 30
jak mok 11 12
fil don 76 57
bus cat 23 45
pan ban 09 78
put but 45 67
kis mis 23 45
I would like... (2 Replies)
Hi,
I'd like to intersect two files by the 4th col of the first file and 6th col of the second file. This is the code I use:
awk 'NR==FNR{A;next}$6 File1 File2
However, this is only outputting the second file lines. I'd like to have both lines in a single line separated by a tab.
Thanks in... (25 Replies)
Hi,
I needed to extract some specific characters from a string based on user input. For example: After the script executes the user enters the following details:
Please enter the string: This is a shell script
Please enter the starting position: 11
Please enter the number of characters to be... (4 Replies)
Discussion started by: ChandanN
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)