The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.

Search results for "module:Tie::Array::Lazy"

Tie::Array::Lazy - Lazy -- but mutable -- arrays. River stage zero No dependents

Tie::Array::Lazy implements a *lazy array*, an array that generates the element on demand. It is a lot like a *lazy list* but unlike lazy lists seen in many functional languages like Haskell, lazy arrays are mutable so you can assign values to their ...

DANKOGAI/Tie-Array-Lazy-0.02 - 09 Aug 2012 19:15:35 UTC

Tie::Array::Sorted::Lazy - An array which is kept sorted River stage zero No dependents

This is a version Tie::Array::Sorted optimised for arrays which are stored to more often than fetching. In this case the array is resorted on retrieval, rather than insertion. (It only re-sorts if data has been modified since the last sort). tie @a, ...

TMTM/Tie-Array-Sorted-1.41 - 07 Aug 2006 14:56:53 UTC

Tie::Array::Lazier - Lazier than Tie::Array::Lazy River stage zero No dependents

Tie::Array::Lazier is a child class of Tie::Array::Lazy that behaves a lot like its parent except for one thing; It is even lazier. Instead of filling elements up to $index, Tie::Array::Lazier It calls "$self->maker" when "$self->array->[$index]" is ...

DANKOGAI/Tie-Array-Lazy-0.02 - 09 Aug 2012 19:15:35 UTC

Tie::Array::File::LazyRead - Read a file record by record using tied array and for() River stage one • 1 direct dependent • 1 total dependent

EXPERIMENTAL, PROOF-OF-CONCEPT. When "for()" is given a tied array: for (@tied_array) { ... } it will invoke "FETCHSIZE" on the tied array to find out the size, then FETCH(0), *then FETCHSIZE() again, then FETCH(1), and so on.* In other words, "FETCH...

PERLANCAR/Tie-Array-File-LazyRead-0.001 - 16 Apr 2019 10:54:24 UTC

Tie::LazyList - Perl extension for lazy lists growing on demand River stage zero No dependents

"Tie::LazyList" allows you to create lazy lists ( "infinite lists, whose tail remain unevaluated", Watt ) growing on demand with user-defined generation function. What you have is a usual Perl array whose elements are generated by some function and w...

GENIE/Tie-LazyList-0.05 - 14 Jul 2001 18:26:36 UTC

Tie::Anon - tie anonymous array, hash, etc. and return it River stage zero No dependents

When I feel extremely lazy, I don't want to write my $tied_arrayref = do { tie my @a, "Tie::File", "hoge.dat"; \@a; }; With Tie::Anon, you can do the same by my $tied_arrayref = tiea("Tie::File", "hoge.dat");...

TOSHIOITO/Tie-Anon-0.02 - 17 Aug 2014 01:37:12 UTC

Tie::File - Access the lines of a disk file via a Perl array River stage three • 30 direct dependents • 100 total dependents

"Tie::File" represents a regular text file as a Perl array. Each element in the array corresponds to a record in the file. The first line of the file is element 0 of the array; the second line is element 1, and so on. The file is *not* loaded into me...

TODDR/Tie-File-1.07 - 20 Feb 2023 17:05:34 UTC

SPOPS::Tie - Simple class implementing tied hash with some goodies River stage one • 2 direct dependents • 2 total dependents

Stores data for a SPOPS object, and also some accompanying materials such as whether the object has been changed and any temporary variables. Checking Changed State You can check whether the data have changed since the last fetch by either calling th...

CWINTERS/SPOPS-0.87 - 02 Jun 2004 01:03:25 UTC

Tie::LLHash - Ordered hashes River stage one • 3 direct dependents • 6 total dependents

This class implements an ordered hash-like object. It's a cross between a Perl hash and a linked list. Use it whenever you want the speed and structure of a Perl hash, but the orderedness of a list. See also Tie::IxHash by Gurusamy Sarathy. It's simi...

XAERXESS/Tie-LLHash-1.004 - 03 Oct 2014 07:41:27 UTC

Tie::Quicksort::Lazy - a lazy quicksort with tiearray interface River stage zero No dependents

A pure-perl lazy, stable, quicksort. The only defined way to access the resulting tied array is with "shift". Sorting is deferred until an item is required. Stability is maintained by choosing a pivot element randomly and treating equal elements diff...

DAVIDNICO/Tie-Quicksort-Lazy-0.04 - 25 May 2009 03:07:32 UTC

Tie::Array::Sorted - An array which is kept sorted River stage zero No dependents

This presents an ordinary array, but 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 an...

TMTM/Tie-Array-Sorted-1.41 - 07 Aug 2006 14:56:53 UTC

Tie::RDBM::Cached - Tie hashes to relational databases. River stage zero No dependents

In addition to Tie::RDBM this module provides a caching method for fast updates to data. This can be EASILY achieved by the user with a little effort without resorting to this module. I wrote the module because I like the interface to the hash and on...

HARRY/Tie-RDBM-Cached-0.03 - 24 Sep 2004 23:57:59 UTC
12 results (0.064 seconds)