I have a file which contains a list of search values
$cat my.txt
FTIP002671604
FTIP002702940
FTIP002703183
FTIP002414805
And lots of such search values. I have to search these valus in the current directory. Can we do this one command wihtout writing a script.
Regards,
Rahul. (1 Reply)
Hi everybody! :) :D :D :)
it's great to be here since this is my first post.
touch /base/oracle/FRA/XMUT00/RMAN_FLAG
touch /base/oracle/FRA/XRLL00/RMAN_FLAG
find directory name containing RMAN_FLAG :
$ find /base/oracle/FRA -name RMAN_FLAG -print|xargs -n1 dirname |sort -u... (3 Replies)
I want to list my vars in a script so they look like
while read IN
var1
var2
var3
var4
do
echo $IN
done
Then in the same script have them read and processed.
the closest I can get is as follows but this is obviously wrong.
NOTE I want a list not all the entries on one line, that... (5 Replies)
Hello together!
I have a list like this
1 3
2 5
3 7
4 2
Now I want to take the average of the second column and multiply it by the difference of the first and last value of the first column.
I posted an similar thread, but now I wonder how I can tell awk in an easy way to take specific... (2 Replies)
Hello Guys.
I have a very big file where I need to change some values according a list on other file.
The following file is were I have the values to be changed.
The field where I need to replace the values is
File_Nb : File1.txt
Obs_Report_Result :
# ===== (5)... (19 Replies)
I have a CSV with below values
name,city,2,country
name,city,15,country
abc,wq,10,afdfd,
qeqe,ewqre,1,wqew
I need to sort them in ascending order based on the value of column 3 and then , pick the rows with values less than 10 and be able to display the columns in that row. Can anyone... (11 Replies)
Dear Group,
I have following input:
sa;sb;sc;sd;period;ma;mb;mc;md;me
sa1;sb1;sc1;sd1;200001;ma1;mb1;mc1;md1;me1
sa2;sb2;sc2;sd2;200002;ma2;mb2;mc2;md2;me2
sa3;sb3;sc3;sd3;200003;ma3;mb3;mc3;md3;me3
first line contains the headers!
I want to create with one pass the following output:... (8 Replies)
Hello All,
There are various codes available to find the intersection between two sets in python. But my case is the following:
I want to find the continual common pattern in different lists compared to list1.
(i have underlined the longest common patterns in set a and set b)
a = 2, 3, 5,... (1 Reply)
Discussion started by: Zam_1234
1 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)