01-16-2015
Quote:
Originally Posted by
Don Cragun
Is the year included in the timestamp in the log file you're searching?
If not, it may be difficult to determine which set of lines you want.
unfortunately, the year is not included. and i agree, that makes it difficult.
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I saw a few posts close to what i want to do, but they didn't look like they would work exactly.. or I need to think out of the box on this.
I have a file that I keep server stats in for my own performance analysis. this file has the output from many commands in it (uptime, vmstats, ps, swap... (2 Replies)
Discussion started by: MizzGail
2 Replies
2. Shell Programming and Scripting
Hi all,
I have the following script, but are not too sure about the syntax to complete the script.
In essence, the script must connect to a SFTP server at a client site with username and password located in a file on my server.
Then change to the appropriate directory.
Pull the data to the... (1 Reply)
Discussion started by: codenjanod
1 Replies
3. Shell Programming and Scripting
Good day Gurus,
I have a csv file that contains an inventory of active servers. This csv file contains a well over a hundred systems (IBM, SUN, HP). It also contains those systems details. See below for an example
hostA,invver,1.02,20100430
hostA,date,08/30/2010,06:18
hostA,use,"Unknown... (4 Replies)
Discussion started by: LuffyDMonkey
4 Replies
4. Shell Programming and Scripting
Hi,
Can anyone please tell me whether we can pull the file from the remote server tru FTP, with the same date the file is available in remote server?
Thanks,
Punitha (1 Reply)
Discussion started by: puni
1 Replies
5. Shell Programming and Scripting
Hi there,
I'm having a problem trying to extract data from within a text file. I'm trying to extract this manually for a lack of better words.
I need any items that fall within latitude 36.5 to 39.5 and long -75.3 to -83.9
I have been doing this using cat neta.txt | grep '!38' and working... (6 Replies)
Discussion started by: Mikey
6 Replies
6. Shell Programming and Scripting
Hi there, Please could anyone help with this.
I have an xml file that contains repeating values eg
<Rule name> AAAAA
<Action> BBBBB
</Action>
<Data> CCCCC
</Data>
<Type> DDDDD
</Type>
</Rule name>
<Rule name> A1A1A1A1
<Action> B1B1B1B1
</Action>
<Data> C1C1C1C
</Data>
<Type>... (4 Replies)
Discussion started by: ssideel
4 Replies
7. Shell Programming and Scripting
Hello, fellow computer junkies. First time poster! My boss wrote an application (Mavericks 10.9, Mountain Lion 10.8) that checks a user's security settings. The user runs the application, then it spits out an email that is sent back to our inbox showing the results. On our end, we have a mail rule... (5 Replies)
Discussion started by: sudo
5 Replies
8. Shell Programming and Scripting
I'm scanning a list of emails- I need to pull 2 pieces of data, then move to the next file:
Sender's Email Address
Email Date
I need these to be outputted into a single column- separated by a ",". Like this:
Email1's Address, Email1's Date Stamp
Email2's Address, Email2's Date Stamp... (4 Replies)
Discussion started by: sudo
4 Replies
9. UNIX for Beginners Questions & Answers
Hello.
I am trying to get some info from log file.
I have fileA , which contains all the country prefixes (the file contains one column and "n" rows ).
And i have fileB, which contains huge data of phone numbers (the file contains one column and "n" rows).
What i want to do is, to count... (7 Replies)
Discussion started by: dragonfly85
7 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)