04-13-2015
Your request is ambiguous. What output are you hoping to produce?
Do you have an alias for ls that echoes an empty line and then performs a cat? Or, is the line starting with ls part of the data contained in abc.txt?
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
hi ,
I am trying to read two strings character by character using arrays
but i couldn't do it pls.give a solution (2 Replies)
Discussion started by: akmtcs
2 Replies
2. Shell Programming and Scripting
Hi Everyone....I am new to Unix and BASH programming...I just want to read a string and reverse it and display.....can anyone help me out???? (8 Replies)
Discussion started by: nikhilneela
8 Replies
3. Programming
i have a string "dfasdfasdfadf"
i want to count the number of times each character is repeated..
For instance, d is repeated 4 times, f is repeated 4 times..
can u give a program in c (1 Reply)
Discussion started by: pgmfourms
1 Replies
4. Shell Programming and Scripting
i have folowing code.
i dont want data in an array. i like to put my data file info (after filtering and converting to lower case) in to a string call "name". so it would look like this,
name= ffjtgj345 thgkty3 456gfhf rhtfn4 ......
how do i do that? i dont want to read # or blank lines.
... (13 Replies)
Discussion started by: usustarr
13 Replies
5. Shell Programming and Scripting
I have a text file where I need to find the string = ST*850*
This string is repetaed several times in the file, so I need to know how many times it appears in the file, this is the text files:
ISA*00* *00* *08*925485USNR *ZZ*IMSALADDERSP... (13 Replies)
Discussion started by: cucosss
13 Replies
6. Shell Programming and Scripting
HI,
Can anyone help me with a script.
i/p
calc 1 2 3 4 5 6 7 8
calc 4 5 6 calc 7 8 9
o/p
calc 1 2 3 4 5 6 7 8
calc 4 5 6
i.e remove anything after where two times the string calc is found.
thanks (3 Replies)
Discussion started by: Indra2011
3 Replies
7. Shell Programming and Scripting
Hi All,
My thanks in advance for you guys reading this and for any posts.
I'm having 100 XML files, I need script which replace a specific string.
It must be incrementing in 100 xml files..
Sample XML files:
<hwIPHostName type="attrib">DEMO1</hwIPHostName>
I need Demo1 to be... (4 Replies)
Discussion started by: karty2129
4 Replies
8. Shell Programming and Scripting
Hi below is the input file, i need to find repeated words and sum up the values of it which is second field from the repeated work.Im trying but getting no where close to it.Kindly give me a hint on how to go about it
Input
fruits,apple,20,fruits,mango,20,veg,carrot,12,veg,raddish,30... (11 Replies)
Discussion started by: 100bees
11 Replies
9. Shell Programming and Scripting
Hello guys,
I have problem with hpux shell script. I have one big text file that contains like
SOH
bla bla bla
bla bla bla
ETX SOH
bla bla bla
ETX
SOH
bla bla bla
ETX
What I need to do is save first SOH*BLA into file1.txt, save second SOH*BLA into file2.txt and so on.... (17 Replies)
Discussion started by: sembii
17 Replies
10. UNIX for Beginners Questions & Answers
I have this a file.txt with one line, whose content is
/app/jdk/java/bin/java -server -Xms3g -Xmx3g -XX:MaxPermSize=256m -Dweblogic.Name=O2pPod8_mapp_msrv1_1 -Djava.security.policy=/app/Oracle/Middleware/Oracle_Home/wlserver/server/lib/weblogic.policy -Djava.security.egd=file:/dev/./urandom... (3 Replies)
Discussion started by: Lam
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)