Ports Search

This module provides a convenient interface to timing functions through tied scalars.

This package contains the following perl5 modules: * Time::CTime - ctime, strftime, and asctime * Time::JulianDay - Julian calendar manipulations * Time::ParseDate - reverses strftime and also understands relative times * Time::Timezone - miscellaneous timezone manipulations routines * Time::DaysInMonth - simply report the number of days in a month

The POSIX standard provides three functions for converting between integer epoch values and 6-component "broken-down" time representations. localtime and gmtime convert an epoch into the 6 components of seconds, minutes, hours, day of month, month and year, in either local timezone or UTC. The mktime function converts a local broken-down time into an epoch value. However, POSIX does not provide a UTC version of this. This module provides a function timegm which has this ability.

Load your commonly-used modules in a single import

Metabase transport for Test::Reporter

Test::Reporter reports the test results of any given distribution to the CPAN testing service. See http://testers.cpan.org/ for details. Test::Reporter has wide support for various perl5's and platforms.

Test::Requires::Git checks if the version of Git available for testing meets the given requirements. The "current git" is obtained by running git --version (so the first git binary found in the PATH will be tested). If the checks fail, then all tests will be skipped.

This module allows you to compose Test::More tests from roles. It is inspired by the excellent Test::Routine module, but uses Moo instead of Moose. This gives most of the benefits without the need for Moose as a test dependency.

Test::Script::Run exports some subs to help test and run scripts in your dist's bin/ directory, if the script path is not absolute. Nearly all the essential code is stolen from Prophet::Test, we think subs like those should live below Test:: namespace, that's why we packed them and created this module.

Tree::RedBlack is a perl implementation of the Red/Black tree algorithm found in the book "Algorithms", by Cormen, Leiserson & Rivest (more commonly known as "CLR" or "The White Book"). A Red/Black tree is a binary tree which remains "balanced"- that is, the longest length from root to a node is at most one more than the shortest such length. It is fairly efficient; no operation takes more than O(lg(n)) time. A Tree::RedBlack object supports the following methods: new(), root(), cmp(&), insert($, $), delete($), find($), node($), min() and max().