Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change

Re: Finding gaps in date ranges

by perlmonkey (Hermit)
on May 11, 2001 at 05:47 UTC ( #79623=note: print w/replies, xml ) Need Help??

in reply to Finding gaps in date ranges

Instead of trying to find out what you are missing, it is a lot easier (and faster) to just exclude what you have.
sub find_gaps { my $dates = shift; my @dates = sort{ $a->[0] <=> $b->[0] || $a->[1] <=> $b->[1] } map{[substr($_, 0, 4), substr($_, 5)]} keys %$dates; my( $minY,$minM,$maxY,$maxM ) = (@{$dates[0]}, @{$dates[-1]}); my @gaps; for my $y ($minY .. $maxY) { exists $dates->{"$y-$_"} ? next : push @gaps, "$y-$_" for ($minY == $y ? $minM : 1) .. ($maxY == $y ? $maxM : 12); } return \@gaps; }
This code sorts to finds the min and max of the date range, then loops over the entire range in order looking to see if we have that date already. If we dont have the date then keep it to return.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://79623]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (14)
As of 2016-10-26 20:54 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (348 votes). Check out past polls.