Recursive closures suffer from a severe memory leak. Sub::Recursive makes the problem go away cleanly and at the same time allows you to write recursive subroutines as expression and can make them truly anonymous. There's no significant speed difference between using &recursive and writing the simpler leaking solution.
5 lines
265 B
Text
5 lines
265 B
Text
$NetBSD: distinfo,v 1.1.1.1 2009/03/17 02:53:59 phonohawk Exp $
|
|
|
|
SHA1 (Sub-Recursive-0.03.tar.gz) = 57edd67f27a00c1af2ad257d6129b4bc5843bc64
|
|
RMD160 (Sub-Recursive-0.03.tar.gz) = 04a9a297149171226a522387968d761949514b1f
|
|
Size (Sub-Recursive-0.03.tar.gz) = 6014 bytes
|