03-01-2013
These 3 Users Gave Thanks to Scrutinizer For This Post:
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Please help me to do Vertical an horizontal pivoing in unix in single run.
The input file is like this-
MRKT|PROD|PRD|FACT1|FACT2|FACT3|FACT4
M1|P1|PR1|F11|F12|F13|F14
M1|P1|PR2|F21|F22|F23|F24
M1|P1|PR3|F31|F32|F33|F34
M2|P2|PR1|F41|F42|F43|F44
M2|P2|PR2|F51|F53|F54|F55... (4 Replies)
Discussion started by: marut_ashu
4 Replies
2. Shell Programming and Scripting
Hi Everyone,
I have three files.
FileA:
aaaa
aaaa
bb
ccc
FileB:
21
2
FileC:
eeeeeee
e
eee
ee
Would like to combine three of them, not like cat, to cat three files, but the output should be like: (3 Replies)
Discussion started by: jimmy_y
3 Replies
3. UNIX for Dummies Questions & Answers
Hi,
Silly question, if I have an excel file that looks something like this:
................. Subject 1 Subject 2 Subject 3 Subject 4
Fever..............13...........9.............23..........14
Headache.........2............12...........18..........23... (3 Replies)
Discussion started by: Xterra
3 Replies
4. UNIX for Dummies Questions & Answers
dear all,
i'm new to unix and i try to figure out the best case for making list of vertical text to become horizontal and skip the line 1 and 2.
example text :
Data DATE XXXXX
MAX
47
53
49
51
48
48
7
46
51
8
25 (6 Replies)
Discussion started by: andrisetia
6 Replies
5. Shell Programming and Scripting
Hi All,
My Input data is:
A=1
B=2
My desired Output should be:
A|B
1|2
Thanks in advance... (3 Replies)
Discussion started by: kmsekhar
3 Replies
6. Shell Programming and Scripting
Based on input
ail,UTT,id1_0,COMBO,21,24,21,19,85
al,UTHAST,id1_0,COMBO,342,390,361,361,1454
and awk code as
awk -F, '{ K=0; for(i=NF; i>=(NF-4); i--) { K=K+$i; J=J+$i;} { print K } } END { for ( l in J ) printf("%s ",J); }'
I'm trying to add columns and lines in single line. line... (6 Replies)
Discussion started by: busyboy
6 Replies
7. Shell Programming and Scripting
Hi All,
please help to achieve the desired output
Example: I have a file which contains the below data
empname
robert
empid
787
design
consultant
empname
alex
empid
898
design
advocate
Desired output should be
empname empid design
robert 787 consultant (19 Replies)
Discussion started by: rocky2013
19 Replies
8. UNIX for Dummies Questions & Answers
I need to change data from vertical to horizontal but with condition
input
USA|80
AUS|40
BRA|33
VEGAS|40
KENTUCKY|50
NEWYORK|21
DARWIN|33
ADELAIDE|21
SAOPAOLO|44
RIO|89
GAPIZA|44
BENFLEX|32
AXIS|44
ACRE|56
HEIGHT|22 (5 Replies)
Discussion started by: radius
5 Replies
9. UNIX for Dummies Questions & Answers
Hi Masters,
I need help to change my vertical data to horisontal
input
2015-04-13|JS|741667
2015-04-13|JSJ|2272
2015-04-13|TMS|107099
2015-04-12|JMD|47945
2015-04-13|TM|760024
2015-04-13|JM|484508
2015-04-14|JMJ|318
2015-04-14|JSD|54436
2015-04-13|JM|15410
Output... (2 Replies)
Discussion started by: radius
2 Replies
10. Shell Programming and Scripting
Hi,
I am creating a script that will pull data from database. The only thing missing now is that i have to transform the lines into horizontal list.
EXAMPLE
2015-07-15 09:00:00.0 |TCSERVER01 |5354
2015-07-15 09:01:00.0 |TCSERVER01 |6899 ... (5 Replies)
Discussion started by: reignangel2003
5 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)