Thread::Pool::Simple provides a simple thread-pool implementation without
external dependencies outside core modules.
Jobs can be submitted to and handled by multi-threaded `workers' managed
by the pool.
A Perl mock RabbitMQ implementation for use when testing.
Breiman and Cutler's random forests for classification and regression
Tie::Array::Sorted represents an ordinary array, which is kept sorted.
All pushes and unshifts cause the elements in question to be inserted in
the appropriate location to maintain order.
Direct stores ($a[10] = "wibble") effectively splice out the original
value and insert the new element. It's not clear why you'd want to use
direct stores like that, but this module does the right thing if you do.
Reshape lets you flexibly restructure and aggregate data using just
two functions: melt and cast.
Tie::DB_FileLock extends DB_File, providing a locking layer using
flock().
Unlike Tie::DB_Lock, Tie::DB_FileLock does not duplicate files to
allow concurrent access for readers and writers. Tie::DB_FileLock
is therefore suitable for large dbms with relatively short locking
periods.
Tie::Hash::Indexed is very similar to Tie::IxHash. However,
it is written completely in XS and usually about twice as
fast as Tie::IxHash. It's quite a lot faster when it comes
to clearing or deleting entries from large hashes.
Currently, only the plain tying mechanism is supported.
Tie::Hash::MultiValue allows you to have hashes which store their values
in anonymous arrays, appending any new value to the already-existing ones.
This means that you can store as many items as you like under a single key,
and access them all at once by accessing the value stored under the key.
This Perl module presents hashes in sorted order.
Tie::Hash::TwoWay will take a list of one-way associations and
transparently create their reverse. For instance, say you have a list
of machines, and a list of classes that each machine belongs to.
Tie::Hash::TwoWay will take the machines, one by one, with an associated
array reference of class names, and build the reverse mapping of classes
to machines. All the mappings are stored as hashes. You can access the
secondary mappings as if they were hash keys in their own right.