Merge pull request #23 from walter-weinmann/wwe_persistance

Erlang Enhancement Proposals (EEP).

eep-XXXX.md

@@ -547,45 +547,41 @@ Rationale
 
 The functional design of the module b_trees is based on the module gb_trees:  
 
-<center>
-<table>
-  <tr><th>b_trees</th>          <th>gb_trees</th></tr>
-
-  <tr><td>n/a</td>              <td>balance/1</td></tr>
-  <tr><td>delete/2</td>         <td>delete/2</td></tr>
-  <tr><td>delete_any/2</td>     <td>delete_any/2</td></tr>
-  <tr><td>empty/1</td>          <td>empty/0</td></tr>
-  <tr><td>enter/3</td>          <td>enter/3</td></tr>
-  <tr><td>from_dict/2</td>      <td>from_orddict/1</td></tr>
-  <tr><td>get/2</td>            <td>get/2</td></tr>
-  <tr><td>height/1</td>         <td>n/a</td></tr>
-  <tr><td>insert/3</td>         <td>insert/3</td></tr>
-  <tr><td>is_defined/2</td>     <td>is_defined/2</td></tr>
-  <tr><td>is_empty/1</td>       <td>is_empty/1</td></tr>
-  <tr><td>iterator/1</td>       <td>iterator/1</td></tr>
-  <tr><td>iterator_from/2</td>  <td>iterator_from/2</td></tr>
-  <tr><td>keys/1</td>           <td>keys/1</td></tr>
-  <tr><td>largest/1</td>        <td>largest/1</td></tr>
-  <tr><td>lookup/2</td>         <td>lookup/2</td></tr>
-  <tr><td>map/2</td>            <td>map/2</td></tr>
-  <tr><td>next/1</td>           <td>next/1</td></tr>
-  <tr><td>set_parameter/3</td>  <td>n/a</td></tr>
-  <tr><td>size_key_values/1</td><td>size/1</td></tr>
-  <tr><td>size_nodes/1</td>     <td>n/a</td></tr>
-  <tr><td>smallest/1</td>       <td>smallest/1</td></tr>
-  <tr><td>sort_ascending/2</td> <td>n/a</td></tr>
-  <tr><td>sort_descending/2</td><td>n/a</td></tr>
-  <tr><td>take/2</td>           <td>take/2</td></tr>
-  <tr><td>take_any/2</td>       <td>take_any/2</td></tr>
-  <tr><td>take_largest/1</td>   <td>take_largest/1</td></tr>
-  <tr><td>take_smallest/1</td>  <td>take_smallest/1</td></tr>
-  <tr><td>to_list/1</td>        <td>to_list/1</td></tr>
-  <tr><td>update/3</td>         <td>update/3</td></tr>
-  <tr><td>values/1</td>         <td>values/1</td></tr>
-</table>
-</center>
-
-The functions delete/2 and insert/3 are an implementation of the algorithms 
+  b_trees          | gb_trees
+ ------------------|---------
+  n/a              | balance/1
+  delete/2         | delete/2
+  delete_any/2     | delete_any/2
+  empty/1          | empty/0
+  enter/3          | enter/3
+  from_dict/2      | from_orddict/1
+  get/2            | get/2
+  height/1         | n/a
+  insert/3         | insert/3
+  is_defined/2     | is_defined/2
+  is_empty/1       | is_empty/1
+  iterator/1       | iterator/1
+  iterator_from/2  | iterator_from/2
+  keys/1           | keys/1
+  largest/1        | largest/1
+  lookup/2         | lookup/2
+  map/2            | map/2
+  next/1           | next/1
+  set_parameter/3  | n/a
+  size_key_values/1| size/1
+  size_nodes/1     | n/a
+  smallest/1       | smallest/1
+  sort_ascending/2 | n/a
+  sort_descending/2| n/a
+  take/2           | take/2
+  take_any/2       | take_any/2
+  take_largest/1   | take_largest/1
+  take_smallest/1  | take_smallest/1
+  to_list/1        | to_list/1
+  update/3         | update/3
+  values/1         | values/1
+
+The functions `delete/2` and `insert/3` are implementations of the algorithms 
 of Cormen, Thomas; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2009), 
 Introduction to Algorithms (Third ed.), MIT Press and McGraw-Hill, pp. 484-504, 
 ISBN 0-262-03384-4. Chapter 18: B-Trees.