Results 3,351–3,360 of 5,623 for /devel/.(0.003 seconds)
Perl array which is kept sorted
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.
Perl module implementing a case preserving hash table
Tie::CPHash is a Perl module implementing a case preserving but case
insensitive hash table.
LRU Cache in Memory through a tie interface
From README:
This module implements a least recently used (LRU) cache in memory
through a tie interface. Any time data is stored in the tied hash, that
key/value pair has an entry time associated with it, and as the cache
fills up, those members of the cache that are the oldest are removed to
make room for new entries.
So, the cache only "remembers" the last written entries, up to the size
of the cache. This can be especially useful if you access great amounts
of data, but only access a minority of the data a majority of the time.
The implementation is a hash, for quick lookups, overlaying a doubly
linked list for quick insertion and deletion. On a WinNT PII 300, writes
to the hash were done at a rate 3100 per second, and reads from the hash
at 6300 per second. Work has been done to optimize refreshing cache
entries that are frequently read from, code like $cache{entry}, which
moves the entry to the end of the linked list internally.
Flexibly reshape data: a reboot of the reshape package
Reshape lets you flexibly restructure and aggregate data using just
two functions: melt and cast.
Locking access to Berkeley DB v1.x
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.
Utility functions for working with Random Number Generators
This package contains a set of functions for working with Random
Number Generators (RNGs). In particular, it defines a generic S4
framework for getting/setting the current RNG, or RNG data that are
embedded into objects for reproducibility. Notably, convenient
default methods greatly facilitate the way current RNG settings can
be changed.
Safely Access the RStudio API
Access the RStudio API (if available) and provide informative error
messages when it's not.
Go library to parse line as shell words
Parse line as shell words.
Wrap functions in tied hash sugar
Tie::Function simplifies wrapping functions in tied hash syntax so they can be
interpolated in double-quoted literals without messy intermediate variables.
Ordered hashes for Perl in XS
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.