I have gone through all the threads in the forum and tested out different things. I am trying to split a 3GB file into multiple files. Some files are even larger than this.
For example:
split -l 3000000 filename.txt
This is very slow and it splits the file with 3 million records in each... (10 Replies)
I did a lot of search on this forum on spiting file; found a lot, but my requirement is a bit different, please guide.
Master file:
x:start:5
line1:23
line2:12
2:90
x:end:5
x:start:2
45:56
22:90
x:end:2
x:start:3
line1:23
line2:12
x:end:3
x:start:2
line5:23 (1 Reply)
Hi ,
I just need to split a file and outputfiles are redirected to gzip file
need:
Input file - A.gz
content of A.gz is
100|sfdds|dffdds|200112|sdfdf
100|sfdds|dffdds|200112|sdfdf
100|sfdds|dffdds|200112|sdfdf
100|sfdds|dffdds|200212|sdfdf
100|sfdds|dffdds|200212|sdfdf... (3 Replies)
Hello,
I have a file like the following:
david,a,b,c,20,r
thomas,a,b,c,30,r
willaiam,a,b,c,80,r
barbara,a,b,c,100,r
I would like to split the file into other files using a condition for the contents of column 5.
The condition should be a if the contents of column 5 is in a range... (4 Replies)
Hi i have a file like
a 12
b 13
c 14
d 15
I want to split it based on a blank line like in first file I should have
a 12
b 13
and in the second file I have
c 14
d 15
How can i do this? Any help will be greatly appreciated (5 Replies)
Hi all,
I'm pretty new to Shell scripting and I need some help to split a source text file into multiple files. The source has a row with pattern where the file needs to be split, and the pattern row also contains the file name of the destination for that specific piece. Here is an example:
... (2 Replies)
Hi all,
I have a csv file that appears as follows:
,2013/03/26,2012/12/26,4,1,"2017/09/26,5.75%","2017/09/26,1,2018/09/26,1,2019/09/26,1,2020/09/26,1,2021/09/26,1",,,2012/12/26,now when i use the split function like this:
my @f = split/,/; the split function will split the data that is... (2 Replies)
Hi all,
First of all I' like to mention that I'm pretty new to unix scripting. :(
I'm trying to split an large xml with awk and rename it based on the values of two attributes.
Example XML
<RECORD>
<element1>11</element1>
<element2>22</element2>
<element3>33</element3>... (18 Replies)
Guys,
I have an input file
MGC001|108.28|-2.86489|100-120|MANGGAC
MGC002|108.071|-2.69028|80-100|KELAPA KAMPIT
MGC003|108.168|-2.97053|50-80|GANTUNG
MGC007|108.192722222|-2.766138889|0-50|KELAPA KAMPIT
MGC008|108.11075|-3.002666667|0-50|GANTUNG... (10 Replies)
I need to split the incoming source file in to multiple files using awk.
Split position is (6,13) : 8 positions
All the records that are greater than 20170101 and less than or equal to 20181231 should go in a split file with file name as source... (11 Replies)
Discussion started by: rosebud123
11 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)