10 More Discussions You Might Find Interesting
1. UNIX for Beginners Questions & Answers
I'm writing a BBS telnet program. I'm having issues with it not displaying lower ASCII characters. For example, instead of displaying the "smiley face" character (Ctrl-B), it displays ^B. Is this because i'm using Ncurses? If so, is there any way around this?
Thanks. (3 Replies)
Discussion started by: ignatius
2. Shell Programming and Scripting
I have been having an encoding problem that I need to solve.
I have an 4-column tab-separated file: I need to remove all of the lines that contain the string 'vis-à-vis'
achiever-n vis-à-vis+ns-j+vp oppose-v 1
achiever-n vis-à-vis+ns-the+vg assess-v 1
administrator-n ... (4 Replies)
Discussion started by: owwow14
3. Shell Programming and Scripting
I have many text files which contain some non-ASCII characters. I attach the screenshots of one of the files for people to have a look at. The issue is even after issuing the non-ASCII removal commands one of the characters does not go away. The character that goes away is the black one with a... (2 Replies)
Discussion started by: shoaibjameel123
4. Shell Programming and Scripting
I am having a file(1234.txt) downloaded from windows server (in Ascii format).However when i ftp this file to Unix server and try to work with it..i am unable to do anything.When i try to open the file using vi editor the file opens in the following format ...
@... (4 Replies)
Discussion started by: appu2176
5. Shell Programming and Scripting
I have a file in unix with ascii values. I need to convert all the ascii values in the file to ascii characters. File contains nearly 20000 records with ascii values. (10 Replies)
Discussion started by: sandeeppvk
6. Shell Programming and Scripting
I have a .xml file in unix. We are passing this file through a xml parser.
But we are getting some control characters from input file and XML parser is failing for the control character in file.Now I am getting following error,
Error at byte 243206625 of file filename_$.xml:
Error... (1 Reply)
Discussion started by: fantushmayu
7. UNIX for Dummies Questions & Answers
We have a unix file that contains special characters (ie. Ñ, °, É, ¿ , £ , ø ). When I try to read this file I get a codepage error and the characters are replaced by the # symbol. How do I keep the special characters from being read?
Ryan (3 Replies)
Discussion started by: Ryan2786
8. Shell Programming and Scripting
Is there any UNIX utility/command/executable that will convert mutlibyte characters to standard single byte ASCII characters in a given file?
Is there any UNIX utility/command/executable that will recognize multibyte characters in a given file name?
The typical multibyte... (8 Replies)
Discussion started by: jerardfjay
9. Shell Programming and Scripting
In the HP Unix that i'm using when i initialise a string as Stalled="'30¬G'"
Stalled=$Stalled" '30¬C'", it is taking the character ¬ as a comma. I need to grep for 30¬G 30¬C in a file and take its count. But since this character ¬ is not being understood, the count returns a zero.
The... (2 Replies)
Discussion started by: roops
i know it's out there, but I cannot remember how to check if a given ascii character string contains all digits or not ... any ideas?
ie...function("123") --> OK
function("NOT_A_NUMBER") --> returns error
thanks!! (2 Replies)
Discussion started by: jalburger
bup-margin(1) General Commands Manual bup-margin(1)
bup-margin - figure out your deduplication safety margin
bup margin [options...]
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.
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.
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
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%)
Part of the bup(1) suite.
Avery Pennarun <firstname.lastname@example.org>.
Bup unknown- bup-margin(1)