One more approach not effective as Don's but may help.
Thanks Don for nice approach.
... ... ...
Thanks,
R. Singh
Hi RavinderSingh,
If you want to take this approach, wouldn't this be more efficient:
I don't see the need for the for loop; did I miss something?
The reason I didn't use this approach is that the script I suggested before will produce the desired output successfully even if the total length of the output is longer than LINE_MAX bytes as long as no single input line is longer than LINE_MAX. The behavior with this script is again unspecified if the length of the string stored in a is (LINE_MAX -1) or more bytes (which will happen whenever the size of the input file is LINE_MAX or more bytes).
----------------------------------------------
Update: Removed extraneous } as suggested by RavinderSingh13 in next message.
Last edited by Don Cragun; 08-21-2014 at 07:53 AM..
Reason: Fix typo }} -> }
Hi,
I have a source file with 'Aug 1 2004' kind format.
I need to search the records with certain period, like from Aug 1 2004 to Sep 20 2004.
Can someone give me some ideas what I should start with?
ThanX !! (1 Reply)
We use the MS access database, I want to convert the database to mysql db , could suggest is there any tools / methods that I can export the table and data from access , and import it to the new mysql db ? thx in advance. (3 Replies)
I have my main script calling another script to retrive a "ls -alt" of a directory that's located in a remote location I'm sftping into.
main.sh
#!/bin/ksh
getLS.sh > output.txt
getLS.sh
#!/bin/sh
/home<..>/sftp <host@ip> <<!
cd /some/dir/Log
ls -alt
quit
!
Basically I'd like to be... (2 Replies)
Hi I need help with some function. I have to fetch data from stdin without using of scanf() (I have to use getc or getchar) and then each sign I want to convert to another sign - here I can't use function strtol :( . In the end i want to print this string to stdout without using of function printf... (3 Replies)
hello,
my objective is to calculate the swap size
-bash-3.00# swap -l
swapfile dev swaplo blocks free
/dev/md/dsk/d1 85,1 8 33559776 16966160
so size=blocks*512/(1024*1024*1024)
since blocks are 512-blocks
any idea how to get it?
so far I was able to... (6 Replies)
Hi,
I am using awk to get particular dates in seconds and the output am getting is like 1.28071e+09.
How can I convert it to number format.
Can anyone help me out?
Thanks in advance..! (7 Replies)
Hi,
In my input variable values are c:/test/sample/
I need to convert it to c:\test\sample
I need to find and replace it
How do I do it?
var_conversion=`"$var_SearchFile" | sed 's/'\'/'/'/g'`
echo ${var_conversion%/*}
My code throws error (4 Replies)
Can someone translate this code to .bat for me? I have no clue.
#!/bin/sh
WAS_HOME="/opt/websphere/appserver/profiles/AppSrv01"
WAS_APP_SERVER="server1"
WAS_PROFILE_NAME="AppSrv01"
echo "Stopping App Server"
"${WAS_HOME}/bin/stopServer.sh" -profileName $WAS_PROFILE_NAME $WAS_APP_SERVER... (1 Reply)
Discussion started by: Blogger11
1 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)