home *** CD-ROM | disk | FTP | other *** search
/ Power-Programmierung / CD2.mdf / c / library / dos / diverses / leda / man / contents.tex < prev    next >
Encoding:
Text File  |  1991-11-15  |  4.6 KB  |  114 lines
  1.  
  2. {\magtwo Table of Contents}
  3. \medskip
  4. \halign {
  5. #\       &#\dotfill&\hfil#\cr
  6. \cr
  7. {\bf 0} &{\bf Introduction}                               &1\cr
  8. \cr
  9. \cr
  10. {\bf 1} &{\bf Basics}                                     &3\cr
  11. \cr
  12. 1.1    &Specifications                                    &3\cr
  13. 1.2    &Arguments                                         &6\cr
  14. 1.3    &Overloading                                       &7\cr
  15. 1.4    &Linear Orders                                     &8\cr
  16. 1.5    &Items                                             &10\cr
  17. 1.6    &Input and Output                                  &12\cr
  18. 1.7    &Iteration                                         &12\cr
  19. 1.8    &Header Files                                      &13\cr
  20. 1.9    &Libraries                                         &13\cr
  21. \cr
  22. \cr
  23. {\bf 2} &{\bf Simple Data Types}                          &15\cr
  24. \cr
  25. 2.1    &Boolean ($bool$)                                  &15\cr
  26. 2.2    &Real Numbers ($real$)                             &15\cr
  27. 2.3    &Strings ($string$)                                &16\cr
  28. 2.4    &Real-valued vectors  ($vector$)                   &18\cr
  29. 2.5    &Real-valued matrices ($matrix$)                   &19\cr
  30. \cr
  31. \cr
  32. {\bf 3} &{\bf Basic Data Types}                           &21\cr
  33. \cr
  34. 3.1    &One Dimensional Arrays ($array$)                  &21\cr
  35. 3.2    &Two Dimensional Arrays ($array2$)                 &23\cr
  36. 3.3    &Stacks         ($stack$)                          &24\cr
  37. 3.4    &Queues         ($queue$)                          &25\cr
  38. 3.5    &Bounded Stacks ($b\_stack$)                       &26\cr
  39. 3.6    &Bounded Queues ($b\_queue$)                       &27\cr
  40. 3.7    &Lists          ($list$)                           &28\cr
  41. 3.8    &Sets           ($set$)                            &33\cr
  42. 3.9    &Integer Sets   ($int\_set$)                       &34\cr
  43. 3.10   &Partitions     ($partition$)                      &35\cr
  44. 3.11   &Dynamic collections of trees ($tree\_collection$) &36\cr
  45. \cr
  46. {\bf 4} &{\bf Priority Queues and Dictionaries }          &39\cr
  47. \cr
  48. 4.1      &Priority Queues   ($priority\_queue$)           &39\cr
  49. 4.2      &Bounded Priority Queues ($b\_priority\_queue$)  &41\cr
  50. 4.3      &Dictionaries      ($dictionary$)                &42\cr
  51. 4.4      &Dictionary Arrays ($d\_array$)                  &44\cr
  52. 4.5      &Hashing Arrays    ($h\_array$)                  &46\cr
  53. 4.6      &Sorted Sequences  ($sortseq$)                   &47\cr
  54. 4.7      &Persistent Dictionaries ($p_dictionary$)        &50\cr
  55. \cr
  56. \cr
  57. {\bf 5} &{\bf Graphs and Related Data Types}              &53\cr
  58. \cr
  59. 5.1    &Graphs ($graph$)                                  &53\cr
  60. 5.2    &Undirected Graphs ($ugraph$)                      &57\cr
  61. 5.3    &Planar Maps ($planar\_map$)                       &58\cr
  62. 5.4    &Parameterized Graphs ($GRAPH$)                    &60\cr
  63. 5.5    &Parameterized Undirected Graphs ($UGRAPH$)        &62\cr
  64. 5.6    &Parameterized Planar Maps ($PLANAR\_MAP$)         &63\cr
  65. 5.7    &Node and Edge Arrays ($node\_array, edge\_array$) \hbox to 5 truecm{\dotfill}&60\cr
  66. 5.8    &Two Dimensional Node Arrays ($node\_matrix$)      &66\cr
  67. 5.9    &Node and Edge Sets  ($node\_set, edge\_set$)      &67\cr
  68. 5.10   &Node Partitions ($node\_partition$)               &68\cr
  69. 5.11   &Node Priority Queues ($node\_pq$)                 &69\cr
  70. 5.12   &Graph Algorithms                                  &70\cr
  71. 5.13   &Miscellaneous                                     &76\cr
  72. \cr
  73. \cr
  74. {\bf 6} &{\bf Two-Dimensional Geometry}                   &77\cr
  75. \cr
  76. 6.1   &Basic two-dimensional objects                      &77\cr
  77. 6.2   &Two-Dimensional Dictionaries ($d2\_dictionary$)    &86\cr
  78. 6.3   &Sets of Points ($point\_set$)                      &88\cr
  79. 6.4   &Sets of Intervals ($interval\_set$)                &90\cr
  80. 6.5   &Sets of Parallel Segments ($segment\_set$)         &92\cr
  81. 6.6   &Planar Subdivision ($subdivision$)                 &94\cr
  82. 6.7   &Graphic Windows ($window$)                         &95\cr
  83. \cr
  84. \cr
  85. \cr
  86. \cr
  87. \cr
  88. {\bf 7} &{\bf Miscellaneous}                              &105\cr
  89. \cr
  90. 7.1   &Streams                                            &105\cr
  91. 7.2   &Useful Functions                                   &107\cr
  92. 7.3   &Error Handling                                     &108\cr
  93. \cr
  94. \cr
  95. {\bf 8} &{\bf Programs}                                   &109\cr
  96. \cr
  97. {\bf 9} &{\bf Tables}                                     &119\cr
  98. \cr
  99. {\bf 10} &{\bf References}                                &121\cr
  100. }
  101.  
  102. \vfill
  103.  
  104. {\magtwo  Acknowledgement}
  105.  
  106. The author would like to thank Kurt Mehlhorn for many helpful suggestions and 
  107. valuable comments.
  108.  
  109. \vglue 1cm
  110. \eject
  111.  
  112. \vglue 10cm
  113. \vfill\eject
  114.