debian/0000755000000000000000000000000011613505234007166 5ustar debian/rules0000755000000000000000000000003611612352571010250 0ustar #!/usr/bin/make -f %: dh $@ debian/changelog0000644000000000000000000000025611613505224011042 0ustar libtie-array-iterable-perl (0.03-1) unstable; urgency=low * Initial Release. (Closes: #635374) -- Julien Vaubourg Mon, 25 Jul 2011 19:29:27 +0200 debian/watch0000644000000000000000000000020111612352571010213 0ustar version=3 http://search.cpan.org/dist/Tie-Array-Iterable/ .*/Tie-Array-Iterable-v?(\d[\d.-]+)\.(?:tar(?:\.gz|\.bz2)?|tgz|zip)$ debian/patches/0000755000000000000000000000000011613505234010615 5ustar debian/patches/fix-man-spelling.patch0000644000000000000000000000327711613504620015017 0ustar Description: Fix some spelling errors in the manpage. Origin: vendor Forwarded: https://rt.cpan.org/Ticket/Display.html?id=69813 Author: gregor herrmann Reviewed-by: gregor herrmann Last-Update: 2011-07-26 --- a/Iterable.pm +++ b/Iterable.pm @@ -381,12 +381,12 @@ no way to do this without maintaining some additional state information. The concept of iterators is that each iterator is a bookmark to a spot, -typically concidered between two elements. While there is some overhead +typically considered between two elements. While there is some overhead to the use of iterators, it allows elements to be added or removed from the list, with the iterator adjusting appropriate, and allows the state of a list traversal to be saved when needed. -For example, the following perl code will drop into an endless block +For example, the following Perl code will drop into an endless block (this mimics the functionality of the above code): my @array = (0..10); @@ -395,7 +395,7 @@ if ( $i == 3 ) { unshift @a, ( 11..15 ); } } -However, the synopsis code will not be impared when the unshift operation +However, the synopsis code will not be impaired when the unshift operation is performed; the iteration will simply continue at the next element, being 4 in this case. @@ -593,7 +593,7 @@ Advances the iterator to the very end position. Note that this is the undefined state, and the only way to resume traversal is to move to -preceeding elements. Also note that for a backwards iterator, this +preceding elements. Also note that for a backwards iterator, this means to move to the beginning of the array. Parentheses are not required. debian/patches/series0000644000000000000000000000002711613503703012030 0ustar fix-man-spelling.patch debian/control0000644000000000000000000000317011613504063010571 0ustar Source: libtie-array-iterable-perl Section: perl Priority: optional Maintainer: Debian Perl Group Uploaders: Julien Vaubourg Build-Depends: debhelper (>= 8) Build-Depends-Indep: perl Standards-Version: 3.9.2 Vcs-Browser: http://svn.debian.org/viewsvn/pkg-perl/trunk/libtie-array-iterable-perl/ Vcs-Svn: svn://svn.debian.org/pkg-perl/trunk/libtie-array-iterable-perl/ Homepage: http://search.cpan.org/dist/Tie-Array-Iterable/ Package: libtie-array-iterable-perl Architecture: all Depends: ${misc:Depends}, ${perl:Depends} Description: module allowing 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 C/C++ or Perl, the 'easy' way to visit each item on a list is to use a counter, and then a for( ;; ) loop. However, this requires knowledge on how long the array is to know when to end. In addition, if items are removed or inserted into the array during the loop, then the counter will be incorrect on the next run through the loop, and will cause problems. . While some aspects of this are fixed in Perl by the use of for or foreach, these commands still suffer when items are removed or added to the array while in these loops. Also, if one wished to use break to step out of a foreach loop, then restart where they left at some later point, there is no way to do this without maintaining some additional state information. debian/copyright0000644000000000000000000000210311613503703011114 0ustar Format-Specification: http://svn.debian.org/wsvn/dep/web/deps/dep5.mdwn?op=file&rev=135 Maintainer: Michael K. Neylon Source: http://search.cpan.org/dist/Tie-Array-Iterable/ Name: Tie-Array-Iterable Files: * Copyright: 2001, Michael K. Neylon License: Artistic or GPL-1+ Files: debian/* Copyright: 2011, Julien Vaubourg License: Artistic or GPL-1+ License: Artistic This program is free software; you can redistribute it and/or modify it under the terms of the Artistic License, which comes with Perl. . On Debian systems, the complete text of the Artistic License can be found in `/usr/share/common-licenses/Artistic'. License: GPL-1+ This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. . On Debian systems, the complete text of version 1 of the GNU General Public License can be found in `/usr/share/common-licenses/GPL-1'. debian/source/0000755000000000000000000000000011613505234010466 5ustar debian/source/format0000644000000000000000000000001411613503703011673 0ustar 3.0 (quilt) debian/compat0000644000000000000000000000000211613503703010363 0ustar 8