Wanting to transfer:
that file daily on or about 1300 EST. to Windows using an automated SFTP script. I already have the script that creates that file but I have to do it manually. I have so many things on my plate right now that this option is not the most efficient one. So, in turn, I would like the file script and sftp to run everyday around 1300 without me having to push the go button.
I have PuTTY installed on my Windows machine and I am using SNettERM for Unix.
Thanks Perderabo for your input as well.
Last edited by Scott; 05-21-2014 at 06:38 PM..
Reason: Code tags
I'm having a problem with a macro i put in my .exrc file.
Here's what I put: map #I ^[
^ [ is control-v and the escape key.
It places a # a the beginning of a line by simply hitting the # on the keyboard. Problem is, now when I hit "o" or "O" to move up or down a line, it places a # at... (1 Reply)
I'm upleveling code from 10.20 to 11.11....but I'm running into a problem in which the USRSTACK macro does not seem to be defined in 11.11. Has anybody else experienced this/fixed it/worked around it? Is there a different macro I should be using instead?
Thanks for any info you can provide!! (1 Reply)
Hi,
In my application I have some number c files. In each of the file the following line will be the first statement.
#ident "@(#) set.c 14.1.2.2 05/15/01 17:06:32"
I would like to know what is the use of the above statement.
Thanks
Sarwan (1 Reply)
I think there is no problem to use any macro in a new macro definishion, but I have a problem with that.
I can not understand why?
I have a *.mak file that inludes file with many definitions and rules.
##############################################
include dstndflt.mak
...
One of the... (2 Replies)
Hi,
I just opened one old RH box and found number of "macros" in there, that how they called in how-to doc, let say you type <rx> and this does a lot of stuff.
I can't figure out how it work, how I can edit/display these macros? Can anybody point to the right directions? I have some academic... (3 Replies)
Hi everyone,
What I am trying to do is assign a F-key a macro to save a file in vi and display said file in firefox. The details are as follows:
I am using a Win 7 laptop with and ssh program to log into a unix system.
What I am trying to do is figure out how to bring up the firefox... (1 Reply)
Hi,
I am using Send Keys to connect to UNIX server and invoke a script .
Is there an alternate way to connect to UNIX server using Excel macro and invoke a UNIX Shell script?
Anu (2 Replies)
Can some body explain this part in a header file for me?
#include <limits.h>
#define BIGNUM unsigned long long
typedef BIGNUM (*hash_t) (char *str);
......I have hard time for the second part:
typedef BIGNUM (*hash_t) (char *str); First, I could not find the definition of hash_t, which... (1 Reply)
Discussion started by: yifangt
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)