[Split chapter 3 into a new chapter 4
Bryan O'Sullivan <bos@serpentine.com>**20070721053913] {
move ./en/ch04-library.xml ./en/ch05-library.xml
move ./en/ch05-typeclasses.xml ./en/ch06-typeclasses.xml
move ./en/ch06-io.xml ./en/ch07-io.xml
move ./en/ch07-globs-and-regexps.xml ./en/ch08-globs-and-regexps.xml
adddir ./examples/ch04
hunk ./en/00book.xml 14
-<!ENTITY ch04     SYSTEM "ch04-library.xml">
-<!ENTITY ch05     SYSTEM "ch05-typeclasses.xml">
-<!ENTITY ch06     SYSTEM "ch06-io.xml">
-<!ENTITY ch07     SYSTEM "ch07-globs-and-regexps.xml">
+<!ENTITY ch04     SYSTEM "ch04-coding.xml">
+<!ENTITY ch05     SYSTEM "ch05-library.xml">
+<!ENTITY ch06     SYSTEM "ch06-typeclasses.xml">
+<!ENTITY ch07     SYSTEM "ch07-io.xml">
+<!ENTITY ch08     SYSTEM "ch08-globs-and-regexps.xml">
hunk ./en/00book.xml 98
+  &ch08;
hunk ./en/ch03-funcs-types.xml 1215
-
-  <sect1 id="hs.funcstypes.rle">
-    <title>Example: Run-Length Encoding</title>
-    <remark>FIXME:   Example: run-length encoding.  Use to show how
-      looping can be done via tail recursion.
-    </remark>
-  </sect1>
-
-  <sect1 id="hs.funcstypes.inference">
-    <title>Type Inference</title>
-    <remark>FIXME: Discuss type inference: what it is and how it can
-      save a lot of work.
-    </remark>
-  </sect1>
-
-  <sect1 id="hs.funcstypes.anonymous">
-    <title>Anonymous (Lambda) Functions</title>
-    <remark>FIXME</remark>
-  </sect1>
-
-  <sect1 id="hs.funcstypes.partialapp">
-    <title>Partial Application</title>
-    <remark>FIXME</remark>
-  </sect1>
-
-  <sect1 id="hs.funcstypes.typeclasses">
-    <title>Typeclasses</title>
-    <remark>FIXME: Introduce type classes.  Show how ghci infers types
-      with constraints. Define some functions that use type class
-      constraints. Talk about when it's appropriate to write explicit
-      signatures. 
-    </remark>
-    <para>See also <xref linkend="hs.typeclasses"/>.</para>
-  </sect1>
-
-  <sect1 id="hs.funcstypes.mapapi">
-    <title>Example: Data.Map API</title>
-    <remark>FIXME: Small example would be a finite map data structure
-      API, with a list and tree implementation (different complexity,
-      same api). Ties together basic types, small functions, top level
-      functions. class Map m where new     :: m k v insert  :: k -> v
-      -> m k v -> m k v lookup  :: k -> m k v -> v -- simple, O(n)
-      data Map1 k v = [(k,v)] -- less simple, O(log n) data Map2 k v =
-      Node k v (Map2 k v) (Map2 k v) | Empty
-
-    </remark>
-  </sect1>
addfile ./en/ch04-fp.xml
hunk ./en/ch04-fp.xml 1
+<!-- vim: set filetype=docbkxml shiftwidth=2 autoindent expandtab tw=77 : -->
+
+<chapter id="hs.fp">
+  <title>Functional programming</title>
+
+  <remark>FIXME</remark>
+
+  <sect1 id="hs.funcstypes.rle">
+    <title>Example: Run-Length Encoding</title>
+    <remark>FIXME:   Example: run-length encoding.  Use to show how
+      looping can be done via tail recursion.
+    </remark>
+  </sect1>
+
+  <sect1 id="hs.funcstypes.inference">
+    <title>Type Inference</title>
+    <remark>FIXME: Discuss type inference: what it is and how it can
+      save a lot of work.
+    </remark>
+  </sect1>
+
+  <sect1 id="hs.funcstypes.anonymous">
+    <title>Anonymous (Lambda) Functions</title>
+    <remark>FIXME</remark>
+  </sect1>
+
+  <sect1 id="hs.funcstypes.partialapp">
+    <title>Partial Application</title>
+    <remark>FIXME</remark>
+  </sect1>
+
+  <sect1 id="hs.funcstypes.typeclasses">
+    <title>Typeclasses</title>
+    <remark>FIXME: Introduce type classes.  Show how ghci infers types
+      with constraints. Define some functions that use type class
+      constraints. Talk about when it's appropriate to write explicit
+      signatures. 
+    </remark>
+    <para>See also <xref linkend="hs.typeclasses"/>.</para>
+  </sect1>
+
+  <sect1 id="hs.funcstypes.mapapi">
+    <title>Example: Data.Map API</title>
+    <remark>FIXME: Small example would be a finite map data structure
+      API, with a list and tree implementation (different complexity,
+      same api). Ties together basic types, small functions, top level
+      functions. class Map m where new     :: m k v insert  :: k -> v
+      -> m k v -> m k v lookup  :: k -> m k v -> v -- simple, O(n)
+      data Map1 k v = [(k,v)] -- less simple, O(log n) data Map2 k v =
+      Node k v (Map2 k v) (Map2 k v) | Empty
+
+    </remark>
+  </sect1>
+</chapter>
+
+<!--
+local variables: 
+sgml-parent-document: ("00book.xml" "chapter")
+end:
+-->
addfile ./examples/ch04/RunLength.hs
hunk ./examples/ch04/RunLength.hs 1
+runLength [] = []
+runLength (x:xs) = runLength' 1 x xs
+    where
+      runLength' n a [] = [(n, a)]
+      runLength' n a (x:xs)
+          | a == x    = runLength' (n+1) a xs
+          | otherwise = (n, a) : runLength' 1 x xs
}