i have a file which contains text as shown below....
aaa|bbb|ccc|ddd|
cccc|ddddd|eeeee|ffffff
want to convert pipe symbol to tab like
aaaa bbbb cccc ddddd
ccccc ddddd eeeee ffffffffff
i tried with sed
sed 's/|/\t/g' file_name ...but i could not... (1 Reply)
I have text file, i want to replace all the charecters with tab.
suppose:
cat abc.txt
dfjkdf
dfdfd
fd
fd
the output should have 4 lines and each line will have 1 tab.
Thanks
:confused: (2 Replies)
my content:
samaccountname employeeid useraccountcontrol description
i want it to look like this:
"samaccountname","employeeid","useraccountcontrol","description" (2 Replies)
Dear users,
I have this problem, this is the example:
123 (tab) A (tab) B (tab) C (tab) 456
where the (tab) is actually the \t delimiter. I need to replace the A B and C for D E and F, this is:
123 (tab) D (tab) E (tab) F (tab) 456
The thing is that my file is quite long and this... (2 Replies)
Hi
I have a number of sequences and a string occurs a number of times in that sequence.
How can I select and replace only those strings which are followed by \tab.
for eg :
my sequence looks like :
string0 positive cd parent=string0 id =121 string0
string0 negative ef parent=... (2 Replies)
hi,
i need to replace a blank tab output in a file to zero.
input file:
2015/08/04 00:00:00 171 730579 27088 <blank> 3823 30273 1621778 ... (6 Replies)
My file looks like
3 33 210.01.10.0 2.1 1211 560 26 45 1298 98763451112 15412323499 INPUT OK
3 233 40.01.10.0 2.1 1451 780 54 99 1876 78787878784 15423210199 CANCEL OK
Aim is to replace the spaces in each line by tab
Used: sed -e 's/ */\t/g'
But I get output like this... (3 Replies)
Discussion started by: sa@@
3 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)