05-06-2015
Quote:
Originally Posted by
Corona688
Try IFS="" read -r separator
Thanks! Works great
This User Gave Thanks to Subbeh For This Post:
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
How to read character by character using awk (6 Replies)
Discussion started by: karnan
6 Replies
2. UNIX for Dummies Questions & Answers
im having trouble doing this:
i have a variable with 2 characters repeating e.g. aababbbaaaababaabbaabbba
is there a way i can search the variable for a's and b's and then change a's to b's and b's to a's?
im guessing its like getting the 1's compliment of the string
im doing this in... (2 Replies)
Discussion started by: vipervenom25
2 Replies
3. Shell Programming and Scripting
Can someone help me to write a script / command to read in a file, character by character, replace any unknown ASCII characters with space. then write out the file to a new filename/
Thanks! (1 Reply)
Discussion started by: raghav525
1 Replies
4. Shell Programming and Scripting
Hello all respected people,
Can i read a file character by character without using sed,awk and perl commands.
Thanks in advance. (4 Replies)
Discussion started by: murtaza
4 Replies
5. Shell Programming and Scripting
Hi,
How read character by character from a file .
and i need replace '.' with null if it comes as a 5 character
i am beginner ...please help me (1 Reply)
Discussion started by: kartheek
1 Replies
6. UNIX for Dummies Questions & Answers
I need a one-liner that will output characters 23 through 32 from a user defined record.
Thanks,
Kenny. (1 Reply)
Discussion started by: kenneth.mcbride
1 Replies
7. Shell Programming and Scripting
hello all
i request you to give the solution for the following problem..
I want read the text file.and print the contents character by character..like if the text file contains google means..i want to print
g
go
goo
goog
googl
google
like this Using unix Shell scripting...
without using... (1 Reply)
Discussion started by: samupnl
1 Replies
8. Shell Programming and Scripting
Guys,
Here is the input text file
<7001> 34 789 701 2
<HJS1> 2
<HJS2> 2
<HJS3> ... (2 Replies)
Discussion started by: gowrishankar05
2 Replies
9. Shell Programming and Scripting
i have this problem:
i must hide a string with a character such as _ by command
WORD=string;
XXX=`echo $WORD | sed 's//_/g'
but after, users must send in input a character and i must to replace the _ with the input character or better i can do this
-$CHARS_INPUT
i have think to use command... (3 Replies)
Discussion started by: tafazzi87
3 Replies
10. Shell Programming and Scripting
Hi friend,
I have one file , and i want to read that file character by character.
I need this script in ksh.
while using read option with -n1 am getting error.
while read -n1 c read has bad option
And if i am using below script, then if in a line has space like this ( Pallvi mahajan)... (10 Replies)
Discussion started by: pallvi_mahajan
10 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)