Results 17,311–17,320 of 19,819 for %22HTTP Server%22.(0.011 seconds)
Previous
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
Next
Minimal perfect hashing code generator
The program mph tries to generate an order preserving minimal perfect
hashing (MPH) function for the set of keys, one per line, on stdin.
Each key can be at most 4095 characters long (see keys.h to increase
this limit), and the keys must be unique. If mph terminates, it emits
a language independent binary or text representation of the MPH
function on stdout. To generate a usable hash function, this output
should be fed to a language dependent filter, like emitc.
The OpenSSL library cross-compiled for MinGW32
This is the OpenSSL library cross-compiled for MinGW32.
Date and time library for OCaml
ocaml-calendar is an OCaml library for managing dates and times.
Ocaml Object interface for ocaml's standard library modules
The library is composed of 9 modules, each containing a single class,
and eventually some creation functions. Each of theses classes
corresponds almost exactly to a module in the standard library, and only
makes it object-oriented. Only Ogenlex adds a new feature, indexing on
the input stream.
Perl implementation of the A* pathfinding algorithm
This module implements the A* pathfinding algorithm. It acts as a base class
from which a custom map object can be derived. It requires from the map object
a subroutine named "getSurrounding" and provides to the object a routine called
"findPath" which calculates the shortest (ie. least-expensive) path between two
nodes.
Implementation of an Object Dependency Algorithm
This modules is a re-implementation of Algorithm::Dependency using only
objects instead of object ids, making use of Set::Object for book-keeping.
Generate prefixes from intervals
Taking an interval as input, this module will construct the smallest
set of prefixes, such that all numbers in the interval will match
exactly one of the prefixes, and no prefix will match a number not
in the interval.
Convert Moose libraries to Mouse ones, or vice versa
Any::Moose::Convert is a tool to convert Moose libraries to Mouse ones, or vice
versa.
Shuffle a list
Algorithm::Numerical::Shuffle
=============================
Shuffle is a perl module which performs a one pass, fair shuffle on a
list. If the list is passed as a reference to an array, the shuffle
is done in situ.
The running time of the algorithm is linear in the size of the list.
For an in situ shuffle, the memory overhead is constant; otherwise,
linear extra memory is used.
The algorithm used is discussed by Knuth [3]. It was first published
by Fisher and Yates [2], and later by Durstenfeld [1].
AnyEvent::DBI + SQL::Abstract
AnyEvent::DBI + SQL::Abstract