Ports 搜索

Module::Depends extracts module dependencies from an unpacked distribution tree. Module::Depends only evaluates the META.yml shipped with a distribution. This won't be effective until all distributions ship META.yml files, so we suggest you take your life in your hands and look at Module::Depends::Intrusive.

SSLScan is a fast SSL port scanner. SSLScan connects to SSL ports and determines what ciphers are supported, which are the servers prefered ciphers, which SSL protocols are supported and returns the SSL certificate. Client certificates and private key can be configured and output is to text / XML.

File::Flat implements a flat filesystem. A flat filesystem is a filesystem in which directories do not exist. It provides an abstraction over any normal filesystem which makes it appear as if directories do not exist. In effect, it will automatically create directories as needed. This is create for things like install scripts and such, as you never need to worry about the existence of directories, just write to a file, no matter where it is.

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).

Hypermail is a program that takes a file of mail messages in UNIX mailbox format and generates a set of cross-referenced HTML documents. Each file that is created represents a separate message in the mail archive and contains links to other articles, so that the entire archive can be browsed in a number of ways by following links. Archives generated by Hypermail can be incrementally updated, and Hypermail is set by default to only update archives when changes are detected.

Sloth allows you to slow down a specified application by specifying (in miliseconds) the delay on the process. It slows down the process by sending SIGSTOP & SIGCONT signals to the process over a very fast period of time, giving the appearance of a slower application.

Clozure CL (formerly known as OpenMCL) is a free Common Lisp implementation. Features include: * A fast, precise, compacting, generational garbage collector written in hand-optimized C. The sizes of the generations are fully configurable. * Full native OS threads on all platforms. The API includes support for shared memory, locking, and blocking for OS operations such as I/O. * Full Unicode support. * Excellent debugging facilities. The names of all local variables are available in a backtrace. * A complete, mature foreign function interface. * Many extensions including: files mapped to Common Lisp vectors for fast file I/O; thread local hash tables and streams to eliminate locking overhead; cons hashing support.

The zeroer utility can be used to wipe empty space on a disk. In contrary to dd, zeroer does not wipe existing files on a partition. It overwrites the unallocated disk space around existing files, which means that deleted files cannot be restored after processing a certain partition with zeroer. The utility's principle consists in writing huge zero-padded memory blocks to a file. To a certain extent this works similar to dd, however zeroer dynamically reduces the blockwriter's buffer size when the filesystem is going to be full.

This module implements a trie data structure. The term "trie" comes from the word retrieval, but is generally pronounced like "try". A trie is a tree structure (or directed acyclic graph), the nodes of which represent letters in a word. For example, the final lookup for the word 'bob' would look something like $ref->{'b'}{'o'}{'b'}{'00'} (the 00 being an end marker). Only nodes which would represent words in the trie exist, making the structure slightly smaller than a hash of the same data set. The advantages of the trie over other data storage methods is that lookup times are O(1) WRT the size of the index. For sparse data sets, it is probably not as efficient as performing a binary search on a sorted list, and for small files, it has a lot of overhead. The main advantage (at least from my perspective) is that it provides a relatively cheap method for finding a list of words in a large, dense data set which begin with a certain string.

Fish Supper is a simple arcade/puzzle game, loosely based on the retro classic Frogger. Guide a cat across a series of rivers, jumping from log to log to reach a tasty fish supper on the other side. Make sure you've got a crystal the same colour as the log before you land on it, though, or you'll be zapped back to the beginning.