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)
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)
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)
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)
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)
Source file
Name:hostname1
Masking views : Yes
Storage Group Names : hostname1
device (5):
Name:hostname2
Masking views : Yes
Storage Group Names : hostname2
device (5):
Name:hostname3
Masking views : no
Storage Group Names : hostname3
device (5):... (9 Replies)
Discussion started by: ranjancom2000
9 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)