Ports Search

Results 2,4612,470 of 18,669 for descr.zh_CN%3A%E9%81%8F%E5%88%B6%E5%9E%83%E5%9C%BE.(0.01 seconds)
devel/Class-Singleton-1.5 (Score: 7.6352136E-4)
Perl module that describes a singular object class
This is the Class::Singleton module. A Singleton describes an object class that can have only one instance in any system. An example of a Singleton might be a print spooler or system registry. This module implements a Singleton class from which other classes can be derived. By itself, the Class::Singleton module does very little other than manage the instantiation of a single object. In deriving a class from Class::Singleton, your module will inherit the Singleton instantiation method and can implement whatever specific functionality is required.
devel/DateTime-Format-DateParse-0.05 (Score: 7.6352136E-4)
This module is a compatibility wrapper around Date::Parse
This module is a compatibility wrapper around Date::Parse. Provides a tool to process different combinations of dates and zones values. If a date doesn't contain a timezone suffix, and zone parameter is not set, then the timezone of the returned DateTime object will be set to the local timezone. This is consistent with the behavior of Date::Parse. If no zone is specified and the date string does specify a timezone/offset or if a zone format can not be parsed by DateTime::TimeZone, the returned DateTime object will have UTC timezone.
devel/libdict-0.2.1 (Score: 7.6295953E-4)
Library providing access to ``dictionary'' data structures
Libdict is a compact, ANSI C library which provides access to a set of generic and flexible ``dictionary'' data structures. All algorithms used in libdict have been optimized, and, with one very small exception, are not recursive but iterative. It was written by Farooq Mela, and is released under a BSD style licence. Libdict implements the following data structures: AVL Tree, Red-Black Tree, Splay Tree, Treap, Weight-balanced tree, Path-reduction tree, Hashtable (Chained). These structures can be used to efficiently store and retrieve key-data pairs. Each of these structures can be accessed using its direct API, or it can be accessed using a dictionary abstraction. Despite it's name, libdict can be used to store any kind of data and any kind of key (provided it fits into a 'void' pointer on your system).
textproc/XML-Handler-Dtd2Html-0.42 (Score: 7.6207187E-4)
SAX2 handler for generate a Html documentation from a DTD
SAX2 handler for generate a HTML documentation from a DTD
textproc/colorator-0.1 (Score: 7.6207187E-4)
Colorize your text in a terminal with a simple API
Colorize your text in a terminal with a simple API
Return a new instance a component on each request
Return a new instance a component on each request
www/Catalyst-Model-Adaptor-0.10 (Score: 7.6207187E-4)
Use a plain class as a Catalyst model
use a plain class as a Catalyst model
www/SlideShowPlugin-0.0.17261 (Score: 7.6207187E-4)
Convert a topic with headings into a slideshow
This plugin converts a topic with headings into a slideshow.
archivers/phk-3.0.1 (Score: 7.610868E-4)
PHK is a PHP-oriented package/archive system
PHK is a PHP-oriented package/archive system. Basically, it can be considered as a PHP-oriented equivalent of the Java jar format. As jar, PHK allows to distribute and run a library or an application as a single file. The PHK accelerator transparently makes PHK runtime faster.
devel/lazy_priority_queue-0.1.1 (Score: 7.610868E-4)
Priority queue implemented using a lazy binomial heap
Lazy priority queue is a pure Ruby priority queue which implements a lazy binomial heap. It supports the change priority operation, being suitable for algorithms like Dijkstra's shortest path and Prim's minimum spanning tree. It can be instantiated as a min-priority queue as well as a max-priority queue.