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