if ( `$ALIAS_AR[$no]` == 7 ) then
echo "true"
else
echo "False"
endif
@ no++
end
And the script can't be ran as there are several problems, like ls: invalid option -- '|'
Can anyone give me a suggestion about this?
PS: the above code is just demo, I want to use the pre-stored command to retrieve the status of running time.
I am trying to set a command into a variable in a csh script using command substituion with ``. I am having a problem with ps command combined with grep. The command is as follows (shows processes running with the word gpts in them).
/usr/ucb/ps axwww | grep gpts
this works fine at the... (2 Replies)
hi,
i have 3 fields in a file and linked them through 2 associative arrays.. the problem is one of the associative array is working while the other is not.. the code part is:
awk ' BEGIN {
FS="|"
rc = getline < "ICX_RULES"
while ( rc == 1 )
{
rule_id=$1
rule_parameter=$2... (2 Replies)
Dear friends...
Kindly if any one can help me to know the differences in definning & retreiving data from arrays in the sh,csh & ksh.
I always facing problems in this issue.
thanks...:)
BR (3 Replies)
Hello Guys,
I was trying to obtain the information from the /etc/passwd file, here was my script:
38 echo -n "What's your login name? "
39 set logname=$<
40 echo "Your login name is $logname, your user's ID is `grep $logname /etc/passwd|awk -F: '{print $3}'`"
41 echo " Your home dir is... (1 Reply)
I'm trying call the first item in the array then put it in a loop to call the next items in order.
set $p = (port-1, port-2, port-3, port-4, exit)
<sourcePort>daughtercard:$P</sourcePort>
if ($p == "exit") then
break
else ($p >> 1)
I know the above code isn't correct. I'm... (1 Reply)
Hi Perl folks,
I am having problems printing elements from an array at runtime.
I wish to push elements into array at runtime and the print it later.
Now I wish to print this matrix using colors.
So I do something like this to enter the runtime values in array:
... (1 Reply)
I'm having a problem with this bit of my script. '/tmp/data' contains the output of 'ls -l', and I'm assigning a couple of the columns to an array. The problem is that it line starts on the third line of 'ls -l' rather than the first one.
@ count = 7
set line = `cat /tmp/data`
while ($count... (1 Reply)
I am trying to code a 4 by 4 array. However the naming convention is diffrent.
Please refer the image below
https://lh5.googleusercontent.com/-Dl0vdjfXtU0/Tnh02_ORJpI/AAAAAAAAAKU/4c2zyFP9IB0/array.JPG
I want to name them in order :
from 0 to 3 --> (0,0) cell to (0,3)
from 4 to 7 --> (1,0)... (0 Replies)
set -A allfiles `find $usrhtml -type f`
i am trying to populate this array with the find command. It works fine when find is looking through a single directory but when i add a new subdirectory the files in the subdirectory get duplicated. Can anyone help me and fix this so each files in... (1 Reply)
i have a list of apps that i need to forcequit and, from time to time, that list changes. perfect excuse to manage a single array! however, my strings with spaces aren't passing as i'd like them to. here's the simple script:
#!/bin/sh
#-----Array
apps=( firefox-bin firefox... (6 Replies)
Discussion started by: hungryd
6 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)