9 More Discussions You Might Find Interesting
I'm just interested to know how your sources.list look like. I got some repositories witch give some errors and I would like to clean it up.
and when I do apt-get update I get few lines showing errors like 404 , this is how my list look like:
# deb cdrom:/ squeeze main
# deb cdrom:/... (0 Replies)
Discussion started by: zdorian
2. Shell Programming and Scripting
Hello, here is my problem:
I have ma program in a first directory dir1:
file1.f90 file1.f90~ file1.o file2.f90 .... etc...
I have modified folder in an other directory:
file1_modified.f90 file2_modified.f90 .... etc...
All files from first... (8 Replies)
Discussion started by: shadok
3. Shell Programming and Scripting
hello forum members,
I have a script which is used find the Uname and passwords and redirects into a output.txt file.I hardcoded a string "ciadev" but iwant search two more strings also "absdev" and "absprod" So modify this script please.
I am lookinmg forward from you,
please find the below... (2 Replies)
Discussion started by: rajkumar_g
4. Shell Programming and Scripting
can someone suggest how i can list the contents of a directory and display their corresponding last modify time in the format yyyymmddhhmm?
thanks in advance! (16 Replies)
Discussion started by: Deanne
5. Shell Programming and Scripting
I am looking for script to modify /etc/shadow.
1-)User enters username
2-)The line of that user is found in /etc/shadow and *LK* is added infront of the second field in /etc/shadow.
How can I do this?
Thanks (7 Replies)
Discussion started by: tjay83
6. Shell Programming and Scripting
I have a script which connect to ATM's and pull two files from the ATM.
The which i try to pull is like
First 7 digit consist of year montn and date as well
After todays execution i want to change the date to next date
I add few lines in the script but it is not... (6 Replies)
Discussion started by: Renjesh
7. Shell Programming and Scripting
I am posting a script below which essentially excutes the following functions in the described order.
1) From a source directory pools together three files generated by system logs for each user session, tar's these files and archives them as a log set in a destination directory and these... (0 Replies)
Discussion started by: Sammy
8. Shell Programming and Scripting
I have this code, and i want work with a ls -shalR output in .txt
What i need read to do this??
# Allrights- A perl tool for making backups of file permissions
# Copyright (C) 2005 Norbert Klein <email@example.com>
# This program is free... (1 Reply)
Discussion started by: joangopan
9. Shell Programming and Scripting
We are running a quiz and the data collected from the quiz is submitted to the database. My requirement is to write a shell script to get these submitted records.
I should be able to run this shell script at any time and the records it returns should be the ones submitted after the script was... (5 Replies)
Discussion started by: sehgalniraj
bup-margin(1) General Commands Manual bup-margin(1)
bup-margin - figure out your deduplication safety margin
bup margin [options...]
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.
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.
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
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%)
Part of the bup(1) suite.
Avery Pennarun <firstname.lastname@example.org>.
Bup unknown- bup-margin(1)