Hello all,
I want to transpose the rows of a file to the columns (every characters include spaces), i.e.:
input:
abcdefg
123 456
output:
a1
b2
c3
d
e4
f5
g6
I wrote a script:
#!/bin/csh -f (15 Replies)
Hi ALL
I have one input file say FILE1 which looks as below.
a=1
b=2
c=3
a=4
b=5
c=6
.
.
.
Here a,b,c...etc are variable names.
The output file(FILE2) should look like
1,2,3
4,5,6
.....
..... (5 Replies)
Hi I have an input file and I want to transpose it but I need to take care that if any field is missing for a record it should be popoulated with space for that field - using a shell script
INFILE
----------
emp=1
sal=2
loc=abc
emp=2
sal=21
sal=22
loc=xyz
emp=5
loc=abc
OUTFILE... (10 Replies)
Hi,
I have a file like this
a b c
d e f
g h i
j k l
Case1:
I want to transpose the whole file
Output1
a d g j
b e h k
c f i l
Case2
Transpose a specific column - Say 3rd (6 Replies)
Hi Friends,
I have a file with a structure like this:
<file1.csv>
field1,field2,field3,field4,field5,field6,field7,field8,field9,field10,field11,field12
Few Salient points on the file's structure
(1)The fields from field1 to field6 is fixed and they would always be present in the file... (2 Replies)
Hello,
I have a text file with 148 rows and 2532691 columns. I need to transpose the data. The command that I am using is
awk '
{
for (i=1; i<=NF; i++) {
a = $i
}
}
NF>p { p = NF }
END {
for(j=1; j<=p; j++) {
str=a
for(i=2; i<=NR; i++){
... (6 Replies)
Hello,
I have a file which looks like this
Input:
Sample Genotype Assay Well plate
Sample1 T xx A01 1
Sample2 T xx A01 2
Sample3 T xx A01 3
Sample4 T xx A02 4
Sample5 T xx A02 5
Sample6 T xx A02 ... (4 Replies)
Discussion started by: nans
4 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)