04-22-2011
I have a bad habit of editing my replies after I post them.
See?
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Thanks PxT answered my "compare two files"question very quick and neat!!:-)
I have a question about .history file I couldn't find any satisfied answer from book.
1. This file was created automatically when you set up user's environment or you have to use a command to create it or you... (4 Replies)
Discussion started by: b5fnpct
4 Replies
2. UNIX for Dummies Questions & Answers
hi, .sh_history keeps a list of past commands that we entered. but it has a limit and where do we set this limit. thanks. (1 Reply)
Discussion started by: yls177
1 Replies
3. UNIX for Advanced & Expert Users
Hi Friends,
We are currently 5 people using same Unix login-id on different terminals, .sh_history file contains list of commands typed by all 5 peoples(commands history) with the below list :
$tail .sh_history
ls -ltr
pwd
cd ..
ls -ltr
clear
cd temp
more kk.lst
Now my question... (9 Replies)
Discussion started by: krishna
9 Replies
4. UNIX for Dummies Questions & Answers
All,
I had a request to delete filed under a directory that was 35 days old . And they asked me to scedule it in CRON . I have done that .
I have use find and delete with mtime to perfrom this task .
But my script is not deleting this .cshrc,.exrc,.login,.profile,.sh_history file... (1 Reply)
Discussion started by: arunkumar_mca
1 Replies
5. AIX
hi
what's the difference between .sh_history and sh_history for root user?
thanks
itik (1 Reply)
Discussion started by: itik
1 Replies
6. AIX
Hello Everyone:
Does anyone know how I will setup my account to put timestamp in my .sh_history? I do not hold the root account. I am using AIX 5 and ksh shell. I tried every solution I can find in the internet but nothing seems to work OR I am just applying those in the wrong way. Anyone knows... (4 Replies)
Discussion started by: Orbix
4 Replies
7. UNIX for Advanced & Expert Users
Hello,
I've a script that verifies users connections.
This is the check part
do
NEVER=$(finger $USER | grep -i Never)
if
then
NAME=$(finger $USER | grep -i "In real life" | sed -e 's/^.*life: //')
echo $USER $NAME >> never_logged #" "$NEVER
fi
done
that for a specific... (6 Replies)
Discussion started by: gogol_bordello
6 Replies
8. UNIX for Advanced & Expert Users
Hi,
I'm on a linux machine. But I see that sh_history is not updated since february 15. How is it possible ?
Thank you.
uname -a
Linux MYSERVER 2.6.18-194.11.3.el5PAE #1 SMP Mon Aug 23 15:57:10 EDT 2010 i686 i686 i386 GNU/Linux
ls -al
-rw------- 1 oracle dba 3644 fév 15 09:28... (10 Replies)
Discussion started by: big123456
10 Replies
9. AIX
Hi,
I can't get all the enties of AIX .sh_history in email. only first entry of the history is emailed after executing the below code.
mail -s "History `date +%d-%m-%Y`" myemail@xyz.com <$HOME/.sh_history
Can anyone help? (3 Replies)
Discussion started by: m_raheelahmed
3 Replies
10. Shell Programming and Scripting
Shell script logic
Hi
I have 2 input files like with file 1 content as (file1)
"BRGTEST-242" a.txt "BRGTEST-240" a.txt "BRGTEST-219" e.txt
File 2 contents as fle(2)
"BRGTEST-244" a.txt "BRGTEST-244" b.txt "BRGTEST-231" c.txt "BRGTEST-231" d.txt "BRGTEST-221" e.txt
I want to get... (22 Replies)
Discussion started by: pottic
22 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)