10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Could I run 2 python scripts at the same time side by side output on the same line in this same format but with scripts?
from itertools import izip_longest
with open("file1") as textfile1, open("file2") as textfile2:
for x, y in izip_longest(textfile1, textfile2, fillvalue=""):
x =... (4 Replies)
Discussion started by: bigvito19
4 Replies
2. Shell Programming and Scripting
Hi,
I am looking for a sed/awk script to join two large (~300 M) single column files (one is sorted and the other is not sorted) side-by-side. I have a shell script but its taking ages to do the task so looking for an optimized fast solution.
The two files look like:
File1 (sorted)
a1... (1 Reply)
Discussion started by: sajal.bhatia
1 Replies
3. Shell Programming and Scripting
I have about 100s of files of type text in a known directory. I want to merge all files side by side. Number of lines in all the files will remain same.
For example file1 contains
cat
dog
File 2 contains
rat
mat
Output file should be
cat rat
dog mat
Using awk I was able to... (5 Replies)
Discussion started by: kanthrajgowda
5 Replies
4. Shell Programming and Scripting
Hi I'm trying to compare 3 or more files based on similar values and outputting them into 3 columns.
For example:
file1
ABC
DEF
GHI
file2
DEF
DER
file3
ABC
DER
The output should come out like this
file1 file2 file3
ABC ABC (4 Replies)
Discussion started by: zerofire123
4 Replies
5. Shell Programming and Scripting
Input file_1:
P78811
P40108
O17861
Q6NTW1
P40986
Q6PBK1
P38264
Q6PBK1
Q9CZ49
Q1GZI0
Input file_2: (6 Replies)
Discussion started by: patrick87
6 Replies
6. Web Development
I have installed WAMPSERVER 2.0 on my windows vista x64 system but still am having issues with getting the webserver to be seen outside my local network. It is working fine within my local network.
Been through several setup tutorials so far, no dice still.
For testing purposes I have... (1 Reply)
Discussion started by: davidmanvell
1 Replies
7. Shell Programming and Scripting
I have 2 text files, both have one simple, single column. The 2 files might be the same length, or might not, and if not, it's unknown which one would be longer.
For this example, file1 is longer:
---file1
Joe
Bob
Mary
Sally
Fred
Elmer
David
---file2
Tomato
House
Car... (3 Replies)
Discussion started by: cajunfries
3 Replies
8. Shell Programming and Scripting
Hi Everyone,
I need a shell/perl script to bring selected columns from all the files located in a directory and place them in a new file side by side.
File1:
a b c d
2 3 4 5
f g h i
..........
File2:
I II III IV
w x y z
..............
and so on many files are there...... (8 Replies)
Discussion started by: ks_reddy
8 Replies
9. Shell Programming and Scripting
Hi,
I have to sql queries like
select sno,sname from temptable;
select deptno,dname from depttable;
In excel i want to specify the column number to which my output should be displayed.
please help me in this...
thanks in advance... (6 Replies)
Discussion started by: prasee
6 Replies
10. UNIX for Dummies Questions & Answers
Atm i have Windows 98. Can i install a Unix system like Redhat on my computer, and on boot choose which one to go to? Like i can with Win95 & 98...
Please help me. I dont know alot about unix so im still learning. I just know its better than Win for the internet and it doesnt crash.
:) (14 Replies)
Discussion started by: Pcslider
14 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)