| CPAN Directory | FDULAU [ Archive ] |
| fabrice@dulaunoy.com | |
| Homepage | http://gilmore.ael.be/~fdulau/WikiIndex.html |
| CPAN Testers | [Module test results] [CPAN Testers Author Matrix] |
Distribution
|
Released | ||
|---|---|---|---|
| Config-Basic-1.85 | [Download] [Browse] | 13 Jun 2007 | |
| Parse-RPN-2.47 | [Download] [Browse] | 30 Apr 2009 | |
| Proc-Forking-1.38 | [Download] [Browse] | 15 Aug 2005 | |
| Tie-Array-QueueExpire-0.55 | [Download] [Browse] | 23 Sep 2008 | |
| Tie-CountLoop-1.7 | Have a counter looping in a scalar with min max and increment value. | [Download] [Browse] | 25 Sep 2008 |
| Tie-Hash-ImmutableKeys-1.14 | Perl module to create a HASH where keys are immutable but not the leaf data. It is possible to modify the key by FORCE_STORE or FORCE_DELETE. It is working on all the tree key created (keys and subkey | [Download] [Browse] | 14 Jun 2007 |
| Tie-Hash-RegexKeys-1.2 | Match hash keys using Regular Expressions | [Download] [Browse] | 04 Oct 2005 |
| Parse::RPN | Spdfg |
RPN parser/processor (like FORTH) | Parse-RPN-2.47 |
| Proc::Forking | SpdOg |
OO interace to fork with load limit | Proc-Forking-1.38 |
| Tie::Array::QueueExpire | apdhg |
ARRAY persistent and expire oldest data | Tie-Array-QueueExpire-0.55 |
| Tie::CountLoop | Rpdhg |
Counter looping scalar w. min max inc | Tie-CountLoop-1.7 |
| Tie::Hash::ImmutableKeys | apdhg |
create hash with immutable key leaf | Tie-Hash-ImmutableKeys-1.14 |
| Tie::Hash::RegexKeys | Spdfp |
Extend Tie::HRegex to retrieve the KEYS in p | Tie-Hash-RegexKeys-1.2 |
