This module provides functions for expressing durations in rounded or
exact terms.
Time::HiRes module: High resolution time, sleep, and alarm.
Implement usleep, ualarm, and gettimeofday for Perl, as well as wrappers
to implement time, sleep, and alarm that know about non-integral
seconds.
This is a perl module for dealing with time intervals. Among other
things, this module can tell you the number of hours, minutes, and
seconds elapsed between two dates.
The prefork pragma is intended to allow module writers to optimise
module loading for both scenarios with as little additional code as
possible.
The prefork.pm is intended to serve as a central and optional
marshalling point for state detection (are we running in procedural or
pre-forking mode) and to act as a relatively light-weight module
loader.
Elapsed and estimated finish time reporting
Our external experience unfolds in 3 1/2 dimensions (time has a
dimensionality of 1/2). The Time::Warp module offers developers
control over the measurement of time.
The TimeDate distribution replaces earlier GetDate distribution, which was
only a date parser. The date parser contained in this distribution
is far superior to the yacc based parser, and a *lot* faster.
The parser contained here will only parse absolute dates, if you want a date
parser that can parse relative dates then take a look at the
Time modules by David Muir on CPAN.
The file Local.pm.new which is included in this distribution is a patched
version of Time::Local which comes with perl. It fixes two problems
- It determines the zone offset based on now rather than epoch
- It fixes a problem with looping forever when a year > 1900 is passed in
This module implements a memory-efficient node type (for trees, skip lists
and similar data structures) for Perl.
You may ask "Why bother implementing an ordered structure such as a tree
when Perl has hashes built-in?" Since Perl is optimized for speed over
memory usage, hashes (and lists) use a lot of memory.
So the purpose of this package is to provide a simple low-level Node class
which can be used as a base class to implement various kinds of tree
structures. Each node has a key/value pair and a variable number of
"children" pointers.
How nodes are organized or the algorithm used to organize them is for you
to implement.
There is no Pure-perl version because this package was written to overcome
limitations of Perl.
This module can parse various types of input (formatted and containing
hierarchal information) into a tree structure. It can also deparse these
same tree structures back into a string. It accepts various types of input,
such as strings, filenames, and array references. The tree structure used
is a hierarchy of Tree::Simple objects.
Tree::R - Perl extension for the Rtree data structure and algorithms