Results 4,021–4,030 of 18,669 for descr.zh_CN%3A%E9%81%8F%E5%88%B6%E5%9E%83%E5%9C%BE.(0.012 seconds)
Document Object Model library
LibDOM is an implementation of the W3C DOM, written in C.
Powerful, fast, stable, and easily extensible sound editor for GNOME
GLAME is meant to be the GIMP of audio processing. It is designed to be
a powerful, fast, stable, and easily extensible sound editor for GNOME
desktop.
IDE for writing software for GNOME
Builder attempts to be an IDE for writing software for GNOME. It does not try
to be a generic IDE, but one specialized for writing GNOME software.
GNOME glade library
LibGlade allows GLADE interfaces to be handled at runtime, freeing
GUI development from code development. This allows an interface to
be changed without requiring a re-compilation.
Run programs and inherit environment changes
The Shell::Source allows arbitrary shell scripts, or other programs for
that matter, to be run and their environment to be inherited into a Perl
program.
Collection of functions and scripts to debug Erlang in production
Recon is a library to be dropped into any other Erlang project, to
be used to assist DevOps people diagnose problems in production
nodes.
Library to read digital camera file meta-data
This library allows metadata that is written to files on a digital camera to be
read. This library will be required for the gphoto2 port.
PGP Public Key Server
This program implements a standard PGP Key Server, which can be assumed
to be in addition to the public key server at MIT.
Format R Code Automatically
Provides a function tidy_source() to format R source code. Spaces
and indent will be added to the code automatically, and comments
will be preserved under certain conditions, so that R code will be
more human-readable and tidy.
Rabin-Karp streaming hash
This is an implementation of Rabin and Karp's streaming hash, as described
in "Winnowing: Local Algorithms for Document Fingerprinting" by Schleimer,
Wilkerson, and Aiken. Following the suggestion of Schleimer, I am using
their second equation:
$H[ $c[2..$k + 1] ] = (( $H[ $c[1..$k] ] - $c[1] ** $k ) + $c[$k+1] ) * $k
The results of this hash encodes information about the next k values in
the stream (hense k-gram.) This means for any given stream of length n
integer values (or characters), you will get back n - k + 1 hash values.
For best results, you will want to create a code generator that filters
your data to remove all unnecessary information. For example, in a large
english document, you should probably remove all white space, as well as
removing all capitalization.