06-11-2013
The standard Time::Local module is sufficient for your purpose.
Look at its man page for details.
10 More Discussions You Might Find Interesting
1. Solaris
Hi ,
I am trying to find out the List of files modified or added aftter installation of any component on SUN solaris box .
But i am not able to do it using ls or find command .
Can somebody help me out ?
Thanks
Sanjay Gupta (2 Replies)
Discussion started by: sanajyg_mnit
2 Replies
2. Shell Programming and Scripting
Time Between Dates
Does anyone know how to figure out the time between two dates in HP-UX, by reading two log files start.log(starting time) and end.log(ending time)?
So if I have the content of
start.log as :
Mon, Feb 18, 2008 09:30:02 PM
&
end.log as:
Tue, Feb 19, 2008 01:25:14 AM
... (3 Replies)
Discussion started by: Sreejith_VK
3 Replies
3. HP-UX
Time Between Dates
Does anyone know how to figure out the time between two dates, by reading two log files start.log(starting time) and end.log(ending time)?
So if I have the content of
start.log as :
Mon, Feb 18, 2008 09:30:02 PM
&
end.log as:
Tue, Feb 19, 2008 01:25:14 AM
How can... (2 Replies)
Discussion started by: Sreejith_VK
2 Replies
4. Shell Programming and Scripting
Here is two time I have:
Jul 12 16:02:01
Jul 13 01:02:01
and how can I do a simple match to get difference between two time which is 09:00:00
Thanks in advance. (3 Replies)
Discussion started by: ford99
3 Replies
5. UNIX for Advanced & Expert Users
in a multi user system of 3 users X,Y,Z, if i know that X is presently online, is it possible to determine for how long has he been online? i mean the time duration (3 Replies)
Discussion started by: arindamlive
3 Replies
6. Shell Programming and Scripting
Hi All,
I have the following time stamp data in 2 columns
Date TimeStamp(also with milliseconds)
05/23/2012 08:30:11.250
05/23/2012 08:30:15.500
05/23/2012 08:31.15.500
.
.
etc
From this data I need the following output.
0.00( row1-row1 in seconds)
04.25( row2-row1 in... (5 Replies)
Discussion started by: ks_reddy
5 Replies
7. Shell Programming and Scripting
Oracle Enterprise Linux
We want to track how long a process takes to complete its execution. This is what we want in the schell script
Before the process is started , get the time with date, hours and minutes
execute the process
After the process has ended , get the time with date,... (5 Replies)
Discussion started by: omega3
5 Replies
8. Shell Programming and Scripting
Hi,
how to calculate the time difference between PST date and PDT date in perl scripting.
date1: Mon Dec 31 16:00:01 PST 2015
date2: Tue Mar 19 06:09:30 PDT 2013
and also difference between PST-PST and PDT-PDT
need difference in months or days (months prefereble). (3 Replies)
Discussion started by: praveen265
3 Replies
9. UNIX for Dummies Questions & Answers
Hi
there is a lot of file dated from last week till ofpresent date.
if i want to list only last 3 days files using ls command how can i do it
please suggest. below is the list of the file.
and i want to list files from MAy 12 to May 16.
Nov 22 2011 NSSM.UPPLSCPLB81
Jan 12... (2 Replies)
Discussion started by: scriptor
2 Replies
10. UNIX for Beginners Questions & Answers
I want to calculate duration for below file in this format
SID | Date | Starttime |Date |End time
1607 |2019-04-05|13:06:42|2019-04-05|13:07:12
2327 |2019-04-05|13:57:26|2019-04-05|13:57:43
O/p should be like this:
SID | Date | Starttime |Date |Endtime... (4 Replies)
Discussion started by: anupmishra
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)