#include<stdio.h>
#include<time.h>
int main()
{
struct tm tm;
time_t time = 1262322000; /*Jan, 01, 2010*/
char temp[128];
int i = 0;
while(i < 4)
{
memset(temp, 0, 128);
localtime_r(&time, &tm);
strftime(temp, 16, "%G%m%d", &tm);
printf("%s\n", temp);
++i;
time += 86400;
}
}
The output is: 20090101 20090102 20090103 20100104
Instead of: 20100101 20100102 20100103
20100104
here are the tm values after calling localtime_r for each iteration:
hi,
i am reading a string values from a file.the values are
2000
20000
300
10
5000
now retrieving each value one by one and printing if they are greater than 1000.
i use this statement for the same (in perl script)
if ($_ gt 1000){
print $_
}
but its now prininting all... (3 Replies)
hello gurus,
i want a perl/shell script which once invoked should convert a set of EPOCH timestamps to local time ( IST..i want) .
how does it work ,i have an idea on that..but writing a perl/shell script for it is not possible for me...so i need help for the same.
my exact requirement is... (2 Replies)
Hi,
I have a file containing timestamp( Example given below). How can i get date(mmd-dd-yyyy) from it?
($> cat file1.txt
2008-11-24 05:17:00.7043)
Thanks,
Sri (2 Replies)
hi
i need a scrit to convert one date format to another. for example
i have three columns in a file which gets a different format, but lastly i want output
with stadard timestamp as "yyyy-mm-dd hh:mm:ss"
column1 column2 ... (2 Replies)
Hi,
I have searched, read and tried, but no luck.
I have this code:
#!/bin/perl -w #-d
use strict;
use POSIX qw(strftime);
my $getprpw_list="/usr/lbin/getprpw -l";
my $host = "nbsol151";
my $user = "genadmin";
my %uid;
my %spwchg;
my %upwchg;
my %slogint; (2 Replies)
Can anyone provide me with a ksh or bash script which will accept a timestamp (format is YYYY-MM-DD-HH24.Mi.Ss) and time offset (in hours). The output will be (timestamp passed - time offset passed deducted from it) in the same YYYY-MM-DD-HH24.Mi.Ss format.
Basically I am trying to convert the... (1 Reply)
Hi All,
Please read the below data carefully.
I need an unix command for converting unix timestamp to Epoch timestamp.
I need to daily convert this today's unix(UTC) time to epoch time, so i am thinking to make a shellscript for this.
Please help me for this by providing... (3 Replies)
Hi,
I have a file as below
I need to overwrite the 2 nd column alone to numeric format like "06122011030414012345" as per the timestamp value
output file should be
the microseconds can be neglected if required.
Any help will be appreciated.
Thanks in advance (1 Reply)
Hi Team,
We have written a perl script to perform the GMT to MST timestamp conversion.
Input: 2013-12-01T05:23:19.374
Output: need the given timestamp in MT (MST/MDT)
#!/usr/bin/perl
use strict;
use warnings;
use Time::Local;
#always gmt
#my $tval = '2013-12-01T05:23:19.374';
... (4 Replies)
Hello All,
I have a file with many timestamps as in below format & example:
20150130105120
2015-> Year in YYYY
01-> Month in MM
30-> Day in DD
10-> Hour in HH
51-> Minute in mm
20-> Seconds in SS
This is in GMT. I want to convert all these time stamps in GMT+5:30 format..
Can... (4 Replies)
Discussion started by: ailnilanjan
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)