Ports 搜索

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.

Flexible date and time handling via common-sense strings.

A subclass of Date::Range that uses Time::Piece objects, rather than Date::Simple, to manipulate ranges of dates.

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

A simple class to provide a dictionary style API to a binary tree of data. This can provide a useful alternative to a long-lived hash in long running daemons and processes.

The Boehm-Weiser garbage collection package, for C and C++ - garbage collection and memory leak detection libraries. A garbage collector is something which automatically frees malloc'd memory for you by working out what parts of memory your program no longer has pointers to. As a result, garbage collectors can also inform you of memory leaks (if they find memory they can free, it means you have lost all of your pointers to it, but you didn't free it). C programs may be linked against either of these, and should run (with GC or leak detection) without change. C++ programs must include a header to use garbage collection, though leak detection should work without such source code modifications. See the man page and header files. ps: garbage collection is addictive.

Encapsulates/makes/manipulates objects that represent nodes in a tree structure. The tree structure is not an object itself, but is emergent from the linkages you create between nodes. This class provides the methods for making linkages that can be used to build up a tree, while preventing you from ever making any kinds of linkages which are not allowed in a tree (such as having a node be its own mother or ancestor, or having a node have two mothers).

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.