7 More Discussions You Might Find Interesting
1. UNIX for Beginners Questions & Answers
I am working on a script to get the final total size and so far have the following and wondering if this can be improved.
# Compare the desired size of each lvm to the standard size. If it is desired is larger than calculate the difference and keep that value as the amount to add to that LVM. ... (5 Replies)
Discussion started by: user3528
5 Replies
2. What is on Your Mind?
This came to my attention very recently...
I have put it here as a fun item not related to UNIX in any way...
Chudnovsky algorithm - Wikipedia
WOW!
And a great, light hearted 16 minute video about it:
Calculating π by hand: the Chudnovsky algorithm - YouTube
Enjoy... (3 Replies)
Discussion started by: wisecracker
3 Replies
3. Shell Programming and Scripting
Hi All,
I want to send an email if the time difference from previous mail sent is more than or equal to 30 mins.
I have written below code and it's working fine.
In this script I am storing previous mail sent time in txt file.
Instead of storing in txt file how to store in a variable.... (8 Replies)
Discussion started by: nalu
8 Replies
4. UNIX for Advanced & Expert Users
I don't the following why ?:confused:
$ awk 'BEGIN{printf "%.40f\n",(0.33*3)}'
0.9899999999999999911182158029987476766109
$ awk 'BEGIN{printf "%.4f\n",(0.33*3)}'
0.9900 (0 Replies)
Discussion started by: saloman
0 Replies
5. Shell Programming and Scripting
Hi,
I'm trying to create an XML sitemap of our dynamic ecommerce sites SEO Friendly URLs and am trying to create the initial page listing.
I have a CSV file that looks like the following and need duplicate the lines based on a value which needs calculating.
... (2 Replies)
Discussion started by: jamesfx
2 Replies
6. Shell Programming and Scripting
Hi,
My text file looks like this...
I am not sure if it is tab separated or space separated.
SHANTNU 101 12:40:00 AM 04:53:00 AM 219:40:00 04:23:00 AM 10 12:01:00 AM 296:18 1:55
test 342 12:53:00 AM 01:09:00 PM 144:43:00 07:44:00 AM 47 12:05:00 AM... (7 Replies)
Discussion started by: shantanuo
7 Replies
7. UNIX for Dummies Questions & Answers
I need to add an average field to a file. I can create it in an on-screen report and it does what I need using the awk command but I can't get it to create a new file with the additional field. Here's what I'm working with:
file layout: id:lastname:firstname:grade1:grade2:grade3:grade4
I... (1 Reply)
Discussion started by: atchleykl
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)