06-13-2005
yeah, it was that darn quote after 'DISABLED';
and BTW, you can leave the (minus) in the <<-EOSQL4
by adding the minus it removes any un-wanted TAB characters in the SQL.
Thanks so much guys!
9 More Discussions You Might Find Interesting
1. HP-UX
Hi Everyone
I am having hard drive problems with a C3000 Visualize workstation. The machine has two 9.1Gb disks. One dedicated to the OS 11i and the other containing one lvol /space. When I boot up the second disk can be seen in sam but nowhere else, ie cd /space freezes.
I fear that on boot... (3 Replies)
Discussion started by: C3000
3 Replies
2. Solaris
Hi,
I have an application which requires libsunmath.so.1, however; my os version seems to be missing this file (find from root level did not return anything).
Version: SunOS 5.10
where can I get this file?
thanks, (1 Reply)
Discussion started by: orahi001
1 Replies
3. UNIX for Dummies Questions & Answers
Hi,
My tcsh window doesn't have a scrollbar, so I don't get a lot of history! Can you help to get scrollbar?
Thanks (3 Replies)
Discussion started by: parisa_3456
3 Replies
4. Linux
Hi,
I am trying migrate webmin application from solaris to linux. But that is not working in Linux. because the library librpcsoc.so has missed in Linux box..
Could you please advice me that how to resolve this issue and also that how to install that library as well. (1 Reply)
Discussion started by: Mani_apr08
1 Replies
5. Shell Programming and Scripting
Hi,
I am getting this error while running the following code.
i=`awk '{print $2}' test1.txt`
j=`awk '{print $4}' test1.txt`
k=`awk '{print $6}' test1.txt`
if ; then
echo "Up."
else
echo "down"
fi
rm -f test.txt test1.txt
error is this:
line 12: '
Please suggest. (2 Replies)
Discussion started by: arijitsaha
2 Replies
6. Shell Programming and Scripting
I have a file that should cover a days worth of stats, at the beginning of each 15 minute report I have a unique header that looks like the below example. The "0000" and "0015" will change in the header line to show which 15 Minute interval the report is covering and of course from day to day the... (7 Replies)
Discussion started by: fsanchez
7 Replies
7. SuSE
Hello,
This is a programming question as well as a suse question, so let me know if you think I should post this in programming.
I have an application that I compiled under opensuse 12.2 using g77-3.3/g++3.3. The program compiles and runs just fine. I gave the application to a colleague who... (2 Replies)
Discussion started by: LMHmedchem
2 Replies
8. Red Hat
I am trying to install VirtualBox on RHEL 5 but I need the 32 bit version for 32 bit Windows. When I run yum I get the following:
sudo yum localinstall /auto/spvtg-it/spvss-migration/Software/VirtualBox-4.3-4.3.2_90405_el6-1.i686.rpm
Loaded plugins: fastestmirror
Setting up Local Package... (13 Replies)
Discussion started by: gw1500se
13 Replies
9. Programming
Heyas
Me trying some C.. cout in specific, thats what i remembered:
#include <stdio.h>
// -- Just the above or with all the below ones, no change
#include <stdio_ext.h>
#include <stdlib.h>
#include <wchar.h>
//#include <iostream> // I assume its the same anyway?
//#include <iostream.h>... (2 Replies)
Discussion started by: sea
2 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)