06-17-2013
It cannot be done with grep, because the input needs to be transformed..
8 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
I want to try running the free down load from sun, their solaris 8.
I have an intel pentium 3, 550 mhz, 8 GB drive, with 128 ram. I this anough to run a unix os like solaris 8. Also is their a browser that I could use with solaris8 so as to connect to the internet. Does ie have a version for unix.... (3 Replies)
Discussion started by: gparsons70
3 Replies
2. AIX
Hey
May be a dumb question
Can I use a SPOT which is at 5.3 TL6 to boot an LPAR (with 5.3 TL8) in to maintenance mode? Will it work ?
Is it mandatory that SPOT should be of same or higher version in such case?
Bala (1 Reply)
Discussion started by: balaji_prk
1 Replies
3. Shell Programming and Scripting
I am trying to script and came up with a conclusion that I need a do while loop in my statement. I am stuck with the
do while syntax. I need to use it alongwith the if then else statement. Can I use it is a big question? I actually need to get all the files
that are there from within run_dt to... (1 Reply)
Discussion started by: aronmelon
1 Replies
4. Shell Programming and Scripting
1.Write an automated shell program(s) that can create, monitor the log files and report the issues for matching pattern.
(i) Conditions for creating log files.
Log file is created with date (example 2010_03_27.log). If the log file size is 10 Mb for a particular day then automatically the log... (3 Replies)
Discussion started by: praveen12
3 Replies
5. Shell Programming and Scripting
Hi all,
I have little working knowledge in unix shell scripting. I have a requirement where i need to pull out some data in between the strings in the file.
Input:
TEST
a
a
c
f
d
TEST
f
e
g
g
TEST
Output: (7 Replies)
Discussion started by: satyasrin82
7 Replies
6. Shell Programming and Scripting
Hi,
There is a requirement, needs to split the text file based on RC code present in text file.
For this, needs to write a unix shell programing script for the above requirement.
For example in text file, if there are distinct RC codes, then we needs to split into multiple text files. In... (1 Reply)
Discussion started by: Chandra2678
1 Replies
7. UNIX for Dummies Questions & Answers
Please help in creating script for below requirement.
I will be running 1 command and will get below entries in a text file say file44.txt
*******************************
DFDL1005 06:30 00:05
ABFL2003 10/22 01:10
CFTL1256 10/24 00:10
10/25 09:20 PM
********************************
.... (3 Replies)
Discussion started by: Vinay_3308
3 Replies
8. UNIX for Beginners Questions & Answers
Hi Everyone,
Can anyone of you help me on how to get files creation time on ftp server/Remote server in unix.
Regards,
Avinash. (6 Replies)
Discussion started by: Avinash varma
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)