Hi,
when I execute the below script, I am getting following error "Badly placed ()'s". can anyone please help me fix
----------------------------------------------------------
# Usage: ani -n -a -s -w -d
#
#
# help_ani() To print help
#
help_ani()
{
echo "Usage: $0 -n -a -s -w -d"... (3 Replies)
Hi,
I am doing the following but it complains and says "for:badly formed number"
does anyone know why?
#!/bin/tcsh
foreach(....)
............
set depth=64
set width=23
if ($depth==64) then
echo "if"
set addr_bits=5
else
echo "else"
endif
echo "addr_bits:$addr_bits"
echo... (3 Replies)
how can I delete one line above and below the matching pattern ?
e.g I want to delete the line above and below the line with %CLI- in example below :
$CHECKSUM $1$DGA1043:TSTST01.DBF;1
%CLI-E-OPENIN, error opening $1$DGA1043:TSTST01.DBF
-RMS-E-FLK, file currently locked by another user
... (6 Replies)
I have the following script running every day numerous times a day and it works fine, but very occasionally I get the following error
if: Badly formed number.
Anyone know why?
Here is the script that runs with the follow parms
LCTMDBSE 100000 130000 160000
#!/bin/csh
... (0 Replies)
I have this file:
NPANXX|BILLDATE|DIVCODE|COMID|RAO|LIKECODE|BOSS|SORD|STATECODE|
087001|BP01|H|SWBT| |041|IMR6|IMSR6|AR|
087002|BP03|H|SWBT| |042|IMR6|IMSR6|AR|
087003|BP05|H|SWBT| |043|IMR6|IMSR6|AR|
....
these are the things that i HAve to do:
Insert a new column named “TEST”
All... (14 Replies)
i'm trying to run the following program but i keep getting the message "badly placed ()'s" can u help?
#include "modularity_mat.h"
#include "../sparse_mlpl/sparse_matrix.h"
adj_matrix_arr* allocate_mem_for_matrix_arr (int y) {
/* Create the adj matrix and allocate memory */
... (2 Replies)
The shell error message "Badly placed ()'s" can occur for a surprisingly simple oversight. If the script begins with a shell-invocation comment, but is missing the exclamation-point, it is simply a comment and not an invocation. If you attempt to execute it from a shell other than the shell you... (4 Replies)
The terminal is bash.
Whenever I try to execute csh just by itself it gives Badly Placed ()'s.
Whenever I try to use csh with a script it also gives Badly Placed ()'s.
My script is this, there is nothing wrong with it, since it used by other students in class as well. (I have also asked... (5 Replies)
Edit - I don't know how to delete posts. The question I asked here ended up not being the question I should have asked as I didn't realise I needed to edit my script to comply with SGE.
Hi,
My script is:
#!/bin/bash
# Perform fastqc on files in a specified directory.
for ((j=1;... (8 Replies)
I used the below script to Sum up a field in a file based on some unique values. But the problem is when it is summing up the units, it is truncating to 2 decimals and not 6 decimals as in the input file (Input file has the units with up to 6 Decimals – Sample data below, when the units in the 2... (4 Replies)
Discussion started by: brlsubbu
4 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)