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

   1 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
   2 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Acknowledgments</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><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><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"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="pbds.ack"></a>Acknowledgments</h2></div></div></div><p>
   3       Written by Ami Tavory and Vladimir Dreizin (IBM Haifa Research
   4       Laboratories), and Benjamin Kosnik (Red Hat).
   5     </p><p>
   6       This library was partially written at IBM's Haifa Research Labs.
   7       It is based heavily on policy-based design and uses many useful
   8       techniques from Modern C++ Design: Generic Programming and Design
   9       Patterns Applied by Andrei Alexandrescu.
  10     </p><p>
  11       Two ideas are borrowed from the SGI-STL implementation:
  12     </p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>
  13           The prime-based resize policies use a list of primes taken from
  14           the SGI-STL implementation.
  15         </p></li><li class="listitem"><p>
  16           The red-black trees contain both a root node and a header node
  17           (containing metadata), connected in a way that forward and
  18           reverse iteration can be performed efficiently.
  19         </p></li></ol></div><p>
  20       Some test utilities borrow ideas from
  21       <a class="link" href="http://www.boost.org/doc/libs/release/libs/timer/index.html" target="_top">boost::timer</a>.
  22     </p><p>
  23       We would like to thank Scott Meyers for useful comments (without
  24       attributing to him any flaws in the design or implementation of the
  25       library).
  26     </p><p>We would like to thank Matt Austern for the suggestion to
  27     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>