CHAPTER 1 RECURSION AND CALLBACK; 1.1 DECIMAL TO BINARY CONVERSION; 1.2 FACTORIAL; 1.3 THE TOWER OF HANOI; 1.4 HIERARCHICAL DATA; 1.5 APPLICATIONS AND VARIATIONS OF DIRECTORY WALKING; 1.6 FUNCTIONAL VERSUS OBJECT-ORIENTED PROGRAMMING; 1.7 HTML; 1.8 WHEN RECURSION BLOWS UP; CHAPTER 2 DISPATCH TABLES; 2.1 CONFIGURATION FILE HANDLING; 2.2 CALCULATOR; CHAPTER 3 CACHING AND MEMOIZATION; 3.1 CACHING FIXES RECURSION; 3.2 INLINE CACHING; 3.3 GOOD IDEAS; 3.4 MEMOIZATION; 3.5 THE MEMOIZE MODULE; 3.6 CAVEATS; 3.7 KEY GENERATION; 3.8 CACHING IN OBJECT METHODS; 3.9 PERSISTENT CACHES.
Text of Note
3.10 ALTERNATIVES TO MEMOIZATION3.11 EVANGELISM; 3.12 THE BENEFITS OF SPEED; CHAPTER 4 ITERATORS; 4.1 INTRODUCTION; 4.2 HOMEMADE ITERATORS; 4.3 EXAMPLES; 4.4 FILTERS AND TRANSFORMS; 4.5 THE SEMIPREDICATE PROBLEM; 4.6 ALTERNATIVE INTERFACES TO ITERATORS; 4.7 AN EXTENDED EXAMPLE: WEB SPIDERS; CHAPTER 5 FROM RECURSION TO ITERATORS; 5.1 THE PARTITION PROBLEM REVISTED; 5.2 HOW TO CONVERT A RECURSIVE FUNCTION TO AN ITERATOR; 5.3 A GENERIC SEARCH ITERATOR; 5.
0
8
SUMMARY OR ABSTRACT
Text of Note
Most Perl programmers, including the inventor of Perl, were originally trained as C and UNIX programmers. So the Perl programs that they write bear a strong resemblance to C programs. But Perl incorporates many features that have their roots in non-C programming languages such as LISP. These advanced features are not well understood and are rarely used by most Perl programmers, but they are very powerful. They can automate tasks in everyday programming that are difficult to solve any other way, and also serve as an introduction to the techniques of functional programming for those who have not.