Tie::Array::Iterable - Allows creation of iterators for lists and arrays

"Tie::Hash::Iterable" allows one to create iterators for lists and arrays. The concept of iterators is borrowed from the C++ STL [1], in which most of the collections have iterators, though this class does not attempt to fully mimic it. Typically, in...

MNEYLON/Tie-Array-Iterable-0.03 - 16 Nov 2001 02:35:46 GMT - Search in distribution

PSGI::FAQ - Frequently Asked Questions and answers

MIYAGAWA/PSGI-1.102 - 24 Jul 2013 20:13:37 GMT - Search in distribution

Data::Iter - easily iterate over a hash/array

Data::Iter provides functions for comfortably iterating over perl data structures. Its slower, but easier to code. An array containing object elements for every iteration is generated with the iter() function - due to array'ish nature of for(), forea...

MUENALAN/Data-Iter-0.2 - 31 Dec 2009 13:50:16 GMT - Search in distribution

Array::Iterator - A simple class for iterating over Perl arrays

This class provides a very simple iterator interface. It is is uni-directional and can only be used once. It provides no means of reverseing or reseting the iterator. It is not recommended to alter the array during iteration, however no attempt is ma...

SHARYANTO/Array-Iterator-0.11 - 18 Sep 2013 15:40:57 GMT - Search in distribution

Tie::Scalar::RingBuffer - Treat a scalar as a ring buffer iterator.

A ring buffer is a queue in which the tail and head are logically connected so that there is effectively no end to the queue. This modules treats a listref as a ring buffer, and creates an iterator for that ring buffer. The iteration is completely hi...

MILLAWAY/Tie-Scalar-RingBuffer-0.04 - 08 Dec 2003 19:42:24 GMT - Search in distribution

6 results (0.309 seconds)