1<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" 2 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> 3 4<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"> 5<head> 6 <meta name="generator" content= 7 "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" /> 8 9 <title>Policy-Based Data Structures</title> 10 <meta http-equiv="Content-Type" content= 11 "text/html; charset=us-ascii" /> 12 </head> 13 14<body> 15 <div id="page"> 16 <h1>Policy-Based Data Structures</h1> 17 18 <h5>Ami Tavory and Vladimir Dreizin, IBM Haifa Research 19 Laboratories, and Benjamin Kosnik, Red Hat</h5> 20 21 <h5><a href="mailto:pbassoc@gmail.com">pbassoc@gmail.com</a></h5> 22 23 <p>This is a library of policy-based elementary 24 data structures: associative containers and priority queues. It 25 is designed for high-performance, flexibility, semantic safety, 26 and conformance to the corresponding containers in <tt>std</tt> 27 and std::tr1 (except for some points where it differs by 28 design).</p> 29 30 <p>The documentation is organized as follows:</p> 31 32 <ol> 33 <li> 34 <a href="introduction.html">Introductory</a> 35 36 <ol> 37 <li><a href="introduction.html">Introduction</a></li> 38 39 <li><a href="motivation.html">Motivation</a></li> 40 41 <li><a href="prerequisites.html">Usage 42 Prerequisites</a></li> 43 </ol> 44 </li> 45 46 <li> 47 <a href="interface.html">Interface</a> 48 49 <ol> 50 <li><a href="tutorial.html">Short Tutorial</a></li> 51 52 <li><a href="concepts.html">Concepts</a></li> 53 54 <li><a href="interface.html">Specifics</a></li> 55 </ol> 56 </li> 57 58 <li> 59 <a href="design.html">Design</a> 60 61 <ol> 62 <li> 63 <a href="assoc_design.html">Associative Containers</a> 64 65 <ol> 66 <li><a href="ds_gen.html">Data-Structure 67 Genericity and Interface</a> </li> 68 69 <li><a href="tree_based_containers.html">Tree-Based 70 Containers</a></li> 71 72 <li><a href="trie_based_containers.html">Trie-Based 73 Containers</a></li> 74 75 <li><a href="hash_based_containers.html">Hash-Based 76 Containers</a></li> 77 78 <li><a href="lu_based_containers.html">List-Based 79 Containers</a> </li> 80 </ol> 81 </li> 82 83 <li><a href="pq_design.html">Priority Queues</a></li> 84 </ol> 85 </li> 86 87 <li> 88 <a href="examples.html">Examples</a> 89 90 <ol> 91 <li><a href="assoc_examples.html">Associative 92 Containers</a></li> 93 94 <li><a href="pq_examples.html">Priority Queues</a></li> 95 </ol> 96 </li> 97 98 <li> 99 <a href="tests.html">Tests</a> 100 101 <ol> 102 <li> 103 <a href="assoc_tests.html">Associative Containers</a> 104 105 <ol> 106 <li><a href="assoc_regression_tests.html">Regression 107 Tests</a></li> 108 109 <li><a href= 110 "assoc_performance_tests.html">Performance 111 Tests</a></li> 112 </ol> 113 </li> 114 115 <li> 116 <a href="pq_tests.html">Priority Queues</a> 117 118 <ol> 119 <li><a href="pq_regression_tests.html">Regression 120 Tests</a></li> 121 122 <li><a href="pq_performance_tests.html">Performance 123 Tests</a></li> 124 </ol> 125 </li> 126 </ol> 127 </li> 128 129 <li> 130 <a href="misc.html">Misc.</a> 131 132 <ol> 133 <li><a href="acks.html">Acknowledgments</a></li> 134 135 <li><a href="contact.html">Contact</a></li> 136 137 <li><a href="disclaimer.html">Disclaimer and 138 Copyright</a></li> 139 140 <li><a href="references.html">References</a></li> 141 </ol> 142 </li> 143 </ol> 144 </div> 145</body> 146</html> 147