book

Higher-Order Perl

March 2005

Intermediate to advanced

600 pages

14h

English

Read now

Unlock full access

1.1 DECIMAL TO BINARY CONVERSION1.2 FACTORIAL1.3 THE TOWER OF HANOI1.4 HIERARCHICAL DATA1.5 APPLICATIONS AND VARIATIONS OF DIRECTORY WALKING1.6 FUNCTIONAL VERSUS OBJECT-ORIENTED PROGRAMMING1.7 HTML1.8 WHEN RECURSION BLOWS UP
2.1 CONFIGURATION FILE HANDLING2.2 CALCULATOR
3.1 CACHING FIXES RECURSION3.2 INLINE CACHING3.3 GOOD IDEAS3.4 MEMOIZATION3.5 THE MEMOIZE MODULE3.6 CAVEATS3.7 KEY GENERATION3.8 CACHING IN OBJECT METHODS3.9 PERSISTENT CACHES3.10 ALTERNATIVES TO MEMOIZATION3.11 EVANGELISM3.12 THE BENEFITS OF SPEED
4.1 INTRODUCTION4.2 HOMEMADE ITERATORS4.3 EXAMPLES4.4 FILTERS AND TRANSFORMS4.5 THE SEMIPREDICATE PROBLEM4.6 ALTERNATIVE INTERFACES TO ITERATORS4.7 AN EXTENDED EXAMPLE: WEB SPIDERS

5.1 THE PARTITION PROBLEM REVISITED5.2 HOW TO CONVERT A RECURSIVE FUNCTION TO AN ITERATOR5.3 A GENERIC SEARCH ITERATOR5.4 OTHER GENERAL TECHNIQUES FOR ELIMINATING RECURSION
6.1 LINKED LISTS6.2 LAZY LINKED LISTS6.3 RECURSIVE STREAMS6.4 THE HAMMING PROBLEM6.5 REGEX STRING GENERATION6.6 THE NEWTON-RAPHSON METHOD6.7 POWER SERIES
7.1 CURRYING7.2 COMMON HIGHER-ORDER FUNCTIONS7.3 reduce() AND combine()7.4 DATABASES
8.1 LEXERS8.2 PARSING IN GENERAL8.3 RECURSIVE-DESCENT PARSERS8.4 ARITHMETIC EXPRESSIONS8.5 PARSING REGEXES8.6 OUTLINES8.7 DATABASE-QUERY PARSING8.8 BACKTRACKING PARSERS8.9 OVERLOADING
9.1 CONSTRAINT SYSTEMS9.2 LOCAL PROPAGATION NETWORKS9.3 LINEAR EQUATIONS9.4 linogram: A DRAWING SYSTEM9.5 CONCLUSION