For each file, they have a unique name as XX1.phe.ps. XX1.phe.ps I want to merge all the files AND, add part of the file name "XXX" to the first column.
So the expected output is:
All,
I've basic knowlege on understanding UNIX Shell Programming. Right now I need to write a script for the following requirement. Kindly help me or suggest me how to write a Shell script.
I've 8 .csv files that are containing "Detail" records. Each file getting more than 1 million. Another... (3 Replies)
Hi,
I have a pointer file ptr.txt.
There may be any number of files mentioned in the ptr.txt file
eg: cat ptr.txt
/home/abc.txt
/home/pqr.txt
/home/xyz.txt
I have to read this pointer file and merge the files given in the pointer file
so that final file say... (1 Reply)
Hi, guys. I have one question:
I have two files: passwd and shadow (the number of records in these files are not equal)the contents of them are below:
passwd:
**************
ftp:x:24:24:
sshd:x:71:65:
uucp:x:10:14:
brownj:x:5005:1000:
sherrys: x :5006:1000:
...
*************
... (2 Replies)
Hi, I have a question that I cannot solve.
if I have a file like this (lets say "x-values.dat"):
x1
x2
x3
another file like this (lets say "y-values.dat"):
y1
y2
y3
y4
and another file like this (lets say "p-values.dat"):
p1
p2
p3
...
p12
How can I get this output?
x1 y1 p1
x1 y2... (16 Replies)
Hi guys,
I have a question which might be easy to answer but I don't how to do it.
The thing is I need to make a program in C which creates a file with all the content from the files in \etc.
I'm not new to C language but to UNIX.
I've read somewhere I need to use functions like f_read... (2 Replies)
Dear programmers,
I have a question about conditionally merging multiple files and having their file names in the first column.
Input files:
file.1.extension file.2.extension file.3.extension file.4.extension ... file.1000.extension
where each file looks like this (with multiple lines):... (5 Replies)
Hi, I need help with merging two files. My requirement is as below:
File 1:
MachineA
MachineB
File 2:
Process1
Process2
Desired File:
MachineA Process1
MachineB Process2
If file 2 contains only one entry Process1, then second line in the desired output should be:
MachineA Process1... (1 Reply)
Hi All,
i have a requirement as below.
There are two files.
In 1st file a.txt i have four lines as below
Ramesh
Suresh
Pradeep
Franklin
In 2nd file b.txt i have 5 lines as below
Francis
Elizabeth
David
John
Ravi
The output file suppose c.txt should contain 1st line of... (5 Replies)
Hello
Below is my requirement
I have 3 files A1.txt , A2.txt and A3.txt . A2 is dynamically generating file
I want the merge of A1,A2 and A3 in A2.txt
Could you please help? (3 Replies)
Data files coming in different names in a file name called process.txt.
1. shipments_yyyymmdd.gz
2 Order_yyyymmdd.gz
3. Invoice_yyyymmdd.gz
4. globalorder_yyyymmdd.gz
The process needs to discard all the below files and only process two of the 4 file names available
... (1 Reply)
Discussion started by: dsravanam
1 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)
01-04-2013
