1 <?xml version=
"1.0" encoding=
"UTF-8" standalone=
"no"?>
2 <!DOCTYPE html PUBLIC
"-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
3 <html xmlns=
"http://www.w3.org/1999/xhtml"><head><title>Acknowledgments
</title><meta name=
"generator" content=
"DocBook XSL-NS Stylesheets V1.76.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 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 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"><a id=
"pbds.ack"/>Acknowledgments
</h2></div></div></div><p>
4 Written by Ami Tavory and Vladimir Dreizin (IBM Haifa Research
5 Laboratories), and Benjamin Kosnik (Red Hat).
7 This library was partially written at
8 <a class=
"link" href=
"http://www.haifa.il.ibm.com/">IBM's Haifa Research Labs
</a>.
9 It is based heavily on policy-based design and uses many useful
10 techniques from Modern C++ Design: Generic Programming and Design
11 Patterns Applied by Andrei Alexandrescu.
13 Two ideas are borrowed from the SGI-STL implementation:
14 </p><div class=
"orderedlist"><ol class=
"orderedlist"><li class=
"listitem"><p>
15 The prime-based resize policies use a list of primes taken from
16 the SGI-STL implementation.
17 </p></li><li class=
"listitem"><p>
18 The red-black trees contain both a root node and a header node
19 (containing metadata), connected in a way that forward and
20 reverse iteration can be performed efficiently.
21 </p></li></ol></div><p>
22 Some test utilities borrow ideas from
23 <a class=
"link" href=
"http://www.boost.org/doc/libs/release/libs/timer/index.html">boost::timer
</a>.
25 We would like to thank Scott Meyers for useful comments (without
26 attributing to him any flaws in the design or implementation of the
28 </p><p>We would like to thank Matt Austern for the suggestion to
29 include tries.
</p></div><div class=
"navfooter"><hr/><table width=
"100%" summary=
"Navigation footer"><tr><td align=
"left"><a accesskey=
"p" href=
"policy_based_data_structures_test.html">Prev
</a> </td><td align=
"center"><a accesskey=
"u" href=
"policy_data_structures.html">Up
</a></td><td align=
"right"> <a accesskey=
"n" href=
"ext_containers.html">Next
</a></td></tr><tr><td align=
"left" valign=
"top">Testing
</td><td align=
"center"><a accesskey=
"h" href=
"../index.html">Home
</a></td><td align=
"right" valign=
"top"> Chapter
23. HP/SGI Extensions
</td></tr></table></div></body></html>