09-24-2015
And what code have you tried so far...?
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
i need a date manipulation unix shell script, to find the difference between any two dates. kindly help me:confused: (2 Replies)
Discussion started by: user1
2 Replies
2. Shell Programming and Scripting
Hi All :D
I have a long file having different fields like :-
hh:mm:ss seconds
14:15:56 120
14:18:36 12
15:12:36 1500
I want to subtract the hh:mm:ss in line(2) from hh:mm:ss in line(1) & compare the output of substraction (obtained in... (10 Replies)
Discussion started by: vanand420
10 Replies
3. UNIX for Advanced & Expert Users
hi
i am having a script in which i am supposed to extract data for three different dates...first date is current date
second date is 15 days back
third date is 40 days back
for eg consider todays date 26062006 as first date then
second date is 11062006
third date is 17052006
now in my... (2 Replies)
Discussion started by: rochitsharma
2 Replies
4. Shell Programming and Scripting
Hi,
I have a scenario to just plug out the file name from the following location path.
/opt/project/data/int/holdFiles/csv195687.csv
So, how do I get just file name which is "csv195687.csv" from the above line using awk/shell scripting? Can we use indexOf and Substring in awk to get... (7 Replies)
Discussion started by: anilvvnn
7 Replies
5. Shell Programming and Scripting
Hi All,
I have a pipe delimited file with around 30 fields. What is the simple way to Update a value for any column. For ex. If i want to update 22 field with "album".
Similarly, how to do this for the whole file and selective records of the file.
Example file contents:
... (5 Replies)
Discussion started by: Joe2226
5 Replies
6. Shell Programming and Scripting
Hi Guys...
I do have a script that I need to use time or time function in my condition.
The logic will be like if the current time of execution is between 7am and 7pm then do 1,2,3,etc else do 4,5,6.
I need help is that function or how best can I do this.
Thanks in advance.
Please... (3 Replies)
Discussion started by: Phuti
3 Replies
7. Shell Programming and Scripting
Hello!
I need to realize such task.
1. In my user's home dir I have folder1;
2. In folder1 I have some (various count) subfolders with random names;
3. In these subfolders I have one file anyname.pdf (various name in each subfolder) and file content.txt (constant name in each subfolder)
##... (7 Replies)
Discussion started by: optik77
7 Replies
8. UNIX for Dummies Questions & Answers
Hey guys,
I have a file which contains 22,373 ping trace outputs which I generated using a script I made, see excerpt below:
...
PING6(72=40+8+24 bytes) 2001:630:301:1453:219:e3ff:fee7:8c2a --> 2406:8000:101:c020::24
32 bytes from 2406:8000:101:c020::24, icmp_seq=0 hlim=44 time=279.163 ms... (6 Replies)
Discussion started by: churchill
6 Replies
9. UNIX for Dummies Questions & Answers
Hi,
I am trying to extract lines from a text file given a text file containing line numbers to be extracted from the first file. How do I go about doing this? Thanks! (1 Reply)
Discussion started by: evelibertine
1 Replies
10. Shell Programming and Scripting
hi all,
trying this using shell/bash with sed/awk/grep
I have two files, one containing one column, the other containing multiple columns (comma delimited).
file1.txt
abc12345
def12345
ghi54321
...
file2.txt
abc1,text1,texta
abc,text2,textb
def123,text3,textc
gh,text4,textd... (6 Replies)
Discussion started by: shogun1970
6 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)