10 More Discussions You Might Find Interesting
1. UNIX for Beginners Questions & Answers
Hello. I'm trying to self learn Perl and am stuck. I have a data.csv file that contains the following:
5,10,15,20,15,30
1,2,3,4,5
3,10
11
I'm trying to get Perl to take the indexes and add them all together to get 134. It says I need to use split and invoke the file via
<> (built-in... (2 Replies)
Discussion started by: Eric7giants
2 Replies
2. Shell Programming and Scripting
Example
I have following requirements where i need to search for particular string from the log files.Files will be archived with number attached end to it and creates a new log file.
First Day i will ran at 8:00 AM
Filename:a.log1
Wed Aug 24 04:46:34... (1 Reply)
Discussion started by: nareshnani211
1 Replies
3. Shell Programming and Scripting
Dear all,
I would like to split a file incrementally. My file looks like:
$path {
$name "path_sparc_ifu_dec_1" ;
$transition {
"dtu_inst_d" v ; // (in)
"U622/Y" ^ ; // (INVX16_LVT)
"U870/Y" ^ ; // (AND2X1_LVT)
"U873/Y" v ; // (INVX1_LVT)
"U872/Y" ^ ; // (NAND3X0_LVT)... (3 Replies)
Discussion started by: jypark22
3 Replies
4. Shell Programming and Scripting
Please, i have a question about rsync command:
Here is the command that i have used in my script:
rsync -ratlz --rsh="/usr/bin/sshpass ssh -o StrictHostKeyChecking=no" -aAXHltzh --progress --numeric-ids --devices --rsync-path="rsync" $1 $hostname:$1
using this command, i can... (0 Replies)
Discussion started by: chercheur111
0 Replies
5. Shell Programming and Scripting
Hi, I was wondering if someone could help with what is probably a fairly easy problem. I have two variables, i is between 1-5, j is between 11-15
I'd like to produce this:
1_11
2_12
3_13
4_14
5_15
Each number goes up incrementally with the other.
But my shoddy code is not... (5 Replies)
Discussion started by: hubleo
5 Replies
6. Web Development
We have been tuning MySQL lately and I ran accoss two useful tools that you might be interested in:
mysqltuner.pl
tuning-primer.sh
Both of these scripts are quite useful for MySQL tuning. Here is some sample output of mysqltuner.pl
>> MySQLTuner 0.9.8 - Major Hayden... (3 Replies)
Discussion started by: Neo
3 Replies
7. Shell Programming and Scripting
I wanted to use matrixs in awk and got some problem, here is some of the script code, from the BEGIN tag:
row_char="a";row_char="b";row_char="c";row_char="d";row_char="e"$
row_char="h";row_char="i";row_char="j";row_char="k";
from the proccess passage:
sentence,1]=1;
diffrence=4;
i=7;... (2 Replies)
Discussion started by: tal
2 Replies
8. Shell Programming and Scripting
Hello UNIX and Oracle Gurus,
After doing an intensive search from different websites, the UNIX forum I am posting this message seeking help..
I am trying to accomplish the following tasks through the shell script:
1. Rebuild indexes on a Table in Oracle
2. Analyze indexes and table... (0 Replies)
Discussion started by: madhunk
0 Replies
9. UNIX for Dummies Questions & Answers
Hi people,
Is this possible and if so any tips are very welcome.
Im trying to do the following:
this is what I have:
800__1__
this is what I want:
8000010
12345678
Im... (1 Reply)
Discussion started by: seaten
1 Replies
10. Shell Programming and Scripting
I've refined the filesystem size using awk and directed to a file name.
eg, here's the content in a file called "numbers"
$cat numbers
345
543
23423456
44435
546
.
.
how do you write a script to all these numbers to get the total?
thanks a lot. (9 Replies)
Discussion started by: kiem
9 Replies
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)
