libstdc++-v3/doc/html/manual/policy_data_structures_biblio.html

   1 <html><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8"><title>Acknowledgments</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.76.1"><meta name="keywords" content="
   2         ISO C++
   3       ,
   4         policy
   5       ,
   6         container
   7       ,
   8         data
   9       ,
  10         structure
  11       ,
  12         associated
  13       ,
  14         tree
  15       ,
  16         trie
  17       ,
  18         hash
  19       ,
  20         metaprogramming
  21       "><meta name="keywords" content="
  22       ISO C++
  23     ,
  24       library
  25     "><meta name="keywords" content="
  26       ISO C++
  27     ,
  28       runtime
  29     ,
  30       library
  31     "><link rel="home" href="../index.html" title="The GNU C++ Library"><link rel="up" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures"><link rel="prev" href="policy_based_data_structures_test.html" title="Testing"><link rel="next" href="ext_containers.html" title="Chapter 23. HP/SGI Extensions"></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Acknowledgments</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_based_data_structures_test.html">Prev</a> </td><th width="60%" align="center">Chapter 22. Policy-Based Data Structures</th><td width="20%" align="right"> <a accesskey="n" href="ext_containers.html">Next</a></td></tr></table><hr></div><div class="section" title="Acknowledgments"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a name="pbds.ack"></a>Acknowledgments</h2></div></div></div><p>
  32       Written by Ami Tavory and Vladimir Dreizin (IBM Haifa Research
  33       Laboratories), and Benjamin Kosnik (Red Hat).
  34     </p><p>
  35       This library was partially written at
  36       <a class="link" href="http://www.haifa.il.ibm.com/" target="_top">IBM's Haifa Research Labs</a>.
  37       It is based heavily on policy-based design and uses many useful
  38       techniques from Modern C++ Design: Generic Programming and Design
  39       Patterns Applied by Andrei Alexandrescu.
  40     </p><p>
  41       Two ideas are borrowed from the SGI-STL implementation:
  42     </p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>
  43           The prime-based resize policies use a list of primes taken from
  44           the SGI-STL implementation.
  45         </p></li><li class="listitem"><p>
  46           The red-black trees contain both a root node and a header node
  47           (containing metadata), connected in a way that forward and
  48           reverse iteration can be performed efficiently.
  49         </p></li></ol></div><p>
  50       Some test utilities borrow ideas from
  51       <a class="link" href="http://www.boost.org/doc/libs/release/libs/timer/index.html" target="_top">boost::timer</a>.
  52     </p><p>
  53       We would like to thank Scott Meyers for useful comments (without
  54       attributing to him any flaws in the design or implementation of the
  55       library).
  56     </p><p>We would like to thank Matt Austern for the suggestion to
  57     include tries.</p></div><div class="navfooter"><hr><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="policy_based_data_structures_test.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="policy_data_structures.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="ext_containers.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Testing </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Chapter 23. HP/SGI Extensions</td></tr></table></div></body></html>