01-06-2012
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi Friends,
Can anyone help me with this:
To get the count of files that are existing in a directory created on a perticular date like in the example (01/08) .(having same pattern for the filename)
ex:
FileName Creted Date
FILE001 01/08/2007
FILE005 ... (6 Replies)
Discussion started by: sbasetty
6 Replies
2. Shell Programming and Scripting
I'm trying to assign variables that include the current value of a count, but I can't seem to get it working... this script is incomplete, but some guidance on how to use a dynamic variable would be helpful:
Sample Input:
bash-2.03$ more sg2.txt
Results for group6
443
1394
Results for... (3 Replies)
Discussion started by: earnstaf
3 Replies
3. Shell Programming and Scripting
Hi,
I have a requirement ,let us say 1000 files needs to be transferred in an hour from one path to another path and if the files (1000 files) are transferred within an hour ( say 40 mins), then the process should remain idle for the remaining time ( 20 mins). (3 Replies)
Discussion started by: Asaikarthik
3 Replies
4. UNIX for Dummies Questions & Answers
Hi,
I am trying to count the number of occurance of a specific value in a column and increment the variable in the second column accordingly. I have very little information about Unix. As an example,
21 1
32 1
32 2
45 1
56 1
56 2
56 3
73 1
82 1
Thanks,
Natasha (2 Replies)
Discussion started by: natasha
2 Replies
5. Shell Programming and Scripting
Hi,
I have a file with 4 million rows. what i am trying to achieve is for every 1000 interval count the number of rows and display it
i/p
12
200
400
750
1000
1500
1800
2200
2345
2600
2896
3020
3400 (0 Replies)
Discussion started by: Diya123
0 Replies
6. Shell Programming and Scripting
Hi,
I have a file which has 4500 entries
10000
9880
9800
8700
8200
...
.....
...
...
...
...
...
...
...
50 (1 Reply)
Discussion started by: Diya123
1 Replies
7. Shell Programming and Scripting
i have a file with data as follows:
3/23/2014 22:01:18 1
3/23/2014 22:01:47 0
3/23/2014 22:03:35 0
3/23/2014 22:04:50 1
3/24/2014 1:16:41 0
3/24/2014 1:18:00 0
3/24/2014 1:18:36 0
3/24/2014 1:21:46 0
3/25/2014 13:00:31 1
3/25/2014 13:00:54 0
3/25/2014 13:13:09 0
3/25/2014 13:14:15 0... (2 Replies)
Discussion started by: ssk250
2 Replies
8. Shell Programming and Scripting
Hello,
Using bash script, i need to process the following file:
887,86,,2013-11-06,1,10030,5,2,0,200,,
887,86,,2013-11-05,1,10030,5,2,0,199,,
887,138,,2013-11-06,1,10031,6,2,0,1610612736,,
887,164,,2013-11-06,1,10000,0,2,0,36000,,
and to create a new file such as the below
... (2 Replies)
Discussion started by: JonhyDeep
2 Replies
9. UNIX for Beginners Questions & Answers
Hi Folks -
I'm looking for the best way to to increment fiscal weeks - allow me to explain.
At my one client, 10/01/17 was the beginning if year fiscal year 2018.
Each week, I need to manage a unique set of variable that are updated in my application - they are called substitution variables.... (31 Replies)
Discussion started by: SIMMS7400
31 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)