| OLD | NEW |
|---|
| (Empty) |
| 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>References</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>References</h1> | |
| 17 | |
| 18 <ol> | |
| 19 <li>[<a name="abrahams97exception" id= | |
| 20 "abrahams97exception">abrahams97exception</a>] Dave Abrahams, | |
| 21 STL Exception Handling Contract, <a href= | |
| 22 "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/1997/N1075.pdf"> | |
| 23 http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/1997/N1075.pdf</a></li> | |
| 24 | |
| 25 <li>[<a name="alexandrescu01modern" id= | |
| 26 "alexandrescu01modern">alexandrescu01modern</a>] Andrei | |
| 27 Alexandrescu, <i>Modern C++ Design: Generic Programming and | |
| 28 Design Patterns Applied</i>, Addison-Wesley Publishing | |
| 29 Company, 2001</li> | |
| 30 | |
| 31 <li>[<a name="andrew04mtf" id="andrew04mtf">andrew04mtf</a>] | |
| 32 K. Andrew and D. Gleich, "MTF, Bit, and COMB: A Guide to | |
| 33 Deterministic and Randomized Algorithms for the List Update | |
| 34 Problem"</li> | |
| 35 | |
| 36 <li>[<a name="austern00noset" id= | |
| 37 "austern00noset">austern00noset</a>] Matthew Austern, "Why | |
| 38 You shouldn't use <tt>set</tt> - and What You Should Use | |
| 39 Instead", C++ Report, April, 2000</li> | |
| 40 | |
| 41 <li>[<a name="austern01htprop" id= | |
| 42 "austern01htprop">austern01htprop</a>] Matthew Austern, "A | |
| 43 Proposal to Add Hashtables to the Standard Library", <a href= | |
| 44 "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2001/n1326l.html"> | |
| 45 http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2001/n1326l.html</a></li
> | |
| 46 | |
| 47 <li>[<a name="austern98segmented" id= | |
| 48 "austern98segmented">austern98segmented</a>] Matthew Austern, | |
| 49 "Segmented iterators and hierarchical algorithms", Generic | |
| 50 Programming, April 1998, pp. 80-90</li> | |
| 51 | |
| 52 <li>[<a name="boost_timer" id="boost_timer">boost_timer</a>], | |
| 53 "Boost timer library", <a href= | |
| 54 "http://www.boost.org/">http://www.boost.org</a> by Beman | |
| 55 Dawes</li> | |
| 56 | |
| 57 <li>[<a name="boost_pool" id="boost_pool">boost_pool</a>], | |
| 58 "Boost pool library", <a href= | |
| 59 "http://www.boost.org/">http://www.boost.org</a> by Stephen | |
| 60 Cleary</li> | |
| 61 | |
| 62 <li>[<a name="boost_type_traits" id= | |
| 63 "boost_type_traits">boost_type_traits</a>], "Boost | |
| 64 <tt>type_traits</tt> library", <a href= | |
| 65 "http://www.boost.org/">http://www.boost.org</a> by John | |
| 66 Maddock, Steve Cleary, <i>et. al.</i></li> | |
| 67 | |
| 68 <li>[<a name="brodal96priority" id= | |
| 69 "brodal96priority">brodal96priority</a>] Gerth Stolting | |
| 70 Brodal, <a href= | |
| 71 "http://portal.acm.org/citation.cfm?id=313883">Worst-case | |
| 72 efficient priority queues</a></li> | |
| 73 | |
| 74 <li>[<a name="bulka99efficient" id= | |
| 75 "bulka99efficient">bulka99efficient</a>] D. Bulka, and D. | |
| 76 Mayhew, "Efficient C++ Programming Techniques.", | |
| 77 Addison-Wesley Publishing Company, Addison-Wesley, 1997</li> | |
| 78 | |
| 79 <li>[<a name="clrs2001" id="clrs2001">clrs2001</a>] T. H. | |
| 80 Cormen, C. E., Leiserson, R. L. Rivest, C. and Stein, | |
| 81 "Introduction to Algorithms, 2nd ed.", MIT Press, 2001</li> | |
| 82 | |
| 83 <li>[<a name="dinkumware_stl" id= | |
| 84 "dinkumware_stl">dinkumware_stl</a>], "Dinkumware C++ Library | |
| 85 Reference", <a href= | |
| 86 "http://www.dinkumware.com/htm_cpl/index.html">http://www.dinkumware.com/h
tm_cpl/index.html</a></li> | |
| 87 | |
| 88 <li>[<a name="dubhashi98neg" id= | |
| 89 "dubhashi98neg">dubhashi98neg</a>] D. Dubashi, and D. Ranjan, | |
| 90 "Balls and bins: A study in negative dependence.", Random | |
| 91 Structures and Algorithms 13, 2 (1998), 99-124</li> | |
| 92 | |
| 93 <li>[<a name="fagin79extendible" id= | |
| 94 "fagin79extendible">fagin79extendible</a>] R. Fagin, J. | |
| 95 Nievergelt, N. Pippenger, and H. R. Strong, "Extendible | |
| 96 hashing - a fast access method for dynamic files", ACM Trans. | |
| 97 Database Syst. 4, 3 (1979), 315-344</li> | |
| 98 | |
| 99 <li>[<a name="filliatre2000ptset" id= | |
| 100 "filliatre2000ptset">filliatre2000ptset</a>], J. C. | |
| 101 Filliatre, "Ptset: Sets of integers implemented as Patricia | |
| 102 trees", <a href= | |
| 103 "http://www.lri.fr/~filliatr/ftp/ocaml/misc/ptset.ml">http://www.lri.fr/~f
illiatr/ftp/ocaml/misc/ptset.ml</a></li> | |
| 104 | |
| 105 <li>[<a name="fredman86pairing" id= | |
| 106 "fredman86pairing">fredman86pairing</a>], M. L. Fredman, R | |
| 107 Sedgewick, D. D. Sleator, R. E. Tarjan, <a href= | |
| 108 "http://www.cs.cmu.edu/~sleator/papers/pairing-heaps.pdf">The | |
| 109 pairing heap: a new form of self-adjusting heap</a></li> | |
| 110 | |
| 111 <li>[<a name="gamma95designpatterns" id= | |
| 112 "gamma95designpatterns">gamma95designpatterns</a>] E. Gamma, | |
| 113 R. Helm, R. Johnson, and J. Vlissides, "Design Patterns - | |
| 114 Elements of Reusable Object-Oriented Software", | |
| 115 Addison-Wesley Publishing Company, Addison-Wesley, 1995</li> | |
| 116 | |
| 117 <li>[<a name="garg86order" id="garg86order">garg86order</a>] | |
| 118 A. K. Garg and C. C. Gotlieb, "Order-preserving key | |
| 119 transformations", Trans. Database Syst. 11, 2 (1986), | |
| 120 213-234</li> | |
| 121 | |
| 122 <li>[<a name="hyslop02making" id= | |
| 123 "hyslop02making">hyslop02making</a>] J. Hyslop, and H. | |
| 124 Sutter, "Making a real hash of things", C++ Report, May | |
| 125 2002</li> | |
| 126 | |
| 127 <li>[<a name="jossutis01stl" id= | |
| 128 "jossutis01stl">jossutis01stl</a>] N. M. Jossutis, "The C++ | |
| 129 Standard Library - A Tutorial and Reference", Addison-Wesley | |
| 130 Publishing Company, Addison-Wesley, 2001</li> | |
| 131 | |
| 132 <li>[<a name="kt99fat_heaps" id= | |
| 133 "kt99fat_heaps">kt99fat_heas</a>] Haim Kaplan and Robert E. | |
| 134 Tarjan, <a href= | |
| 135 "http://www.cs.princeton.edu/research/techreps/TR-597-99">New | |
| 136 Heap Data Structures</a></li> | |
| 137 | |
| 138 <li>[<a name="kleft00sets" id="kleft00sets">kleft00sets</a>] | |
| 139 Klaus Kleft and Angelika Langer, "Are Set Iterators Mutable | |
| 140 or Immutable?", C/C++ Users Jornal, October 2000</li> | |
| 141 | |
| 142 <li>[<a name="knuth98sorting" id= | |
| 143 "knuth98sorting">knuth98sorting</a>] D. E. Knuth, "The Art of | |
| 144 Computer Programming - Sorting and Searching", Addison-Wesley | |
| 145 Publishing Company, Addison-Wesley, 1998</li> | |
| 146 | |
| 147 <li>[<a name="liskov98data" id= | |
| 148 "liskov98data">liskov98data</a>] B. Liskov, "Data abstraction | |
| 149 and hierarchy", SIGPLAN Notices 23, 5 (May 1998)</li> | |
| 150 | |
| 151 <li>[<a name="litwin80lh" id="litwin80lh">litwin80lh</a>] W. | |
| 152 Litwin, "Linear hashing: A new tool for file and table | |
| 153 addressing", Proceedings of International Conference on Very | |
| 154 Large Data Bases (June 1980), pp. 212-223</li> | |
| 155 | |
| 156 <li>[<a name="maverik_lowerbounds" id= | |
| 157 "maverik_lowerbounds">maverik_lowerbounds</a>] Maverik Woo, | |
| 158 <a href= | |
| 159 "http://magic.aladdin.cs.cmu.edu/2005/08/01/deamortization-part-2-binomial
-heaps/"> | |
| 160 Deamortization - Part 2: Binomial Heaps</a></li> | |
| 161 | |
| 162 <li>[<a name="metrowerks_stl" id= | |
| 163 "metrowerks_stl">metrowerks_stl</a>], "Metrowerks CodeWarrior | |
| 164 Pro 7 MSL C++ Reference Manual",</li> | |
| 165 | |
| 166 <li>[<a name="meyers96more" id= | |
| 167 "meyers96more">meyers96more</a>] S. Meyers, "More Effective | |
| 168 C++: 35 New Ways to Improve Your Programs and Designs - 2nd | |
| 169 ed.", Addison-Wesley Publishing Company, Addison-Wesley, | |
| 170 1996</li> | |
| 171 | |
| 172 <li>[<a name="meyers00nonmember" id= | |
| 173 "meyers00nonmember">meyers00nonmember</a>] S. Meyers, "How | |
| 174 Non-Member Functions Improve Encapsulation", C/C++ Users | |
| 175 Journal, 2000</li> | |
| 176 | |
| 177 <li>[<a name="meyers01stl" id="meyers01stl">meyers01stl</a>] | |
| 178 S. Meyers, "Effective STL: 50 Specific Ways to Improve Your | |
| 179 Use of the Standard Template Library", Addison-Wesley | |
| 180 Publishing Company, Addison-Wesley, 2001</li> | |
| 181 | |
| 182 <li>[<a name="meyers02both" id= | |
| 183 "meyers02both">meyers02both</a>] S. Meyers, "Class Template, | |
| 184 Member Template - or Both?", C/C++ Users Journal, 2003</li> | |
| 185 | |
| 186 <li>[<a name="motwani95random" id= | |
| 187 "motwani95random">motwani95random</a>] R. Motwani, and P. | |
| 188 Raghavan, "Randomized Algorithms", Cambridge University | |
| 189 Press</li> | |
| 190 | |
| 191 <li>[<a name="mscom" id="mscom">mscom</a>] <a href= | |
| 192 "http://www.microsoft.com/com">COM: Component Model Object | |
| 193 Technologies</a></li> | |
| 194 | |
| 195 <li>[<a name="musser95rationale" id= | |
| 196 "musser95rationale">musser95rationale</a>], David R. Musser, | |
| 197 "Rationale for Adding Hash Tables to the C++ Standard | |
| 198 Template Library"</li> | |
| 199 | |
| 200 <li>[<a name="musser96stltutorial" id= | |
| 201 "musser96stltutorial">musser96stltutorial</a>] D. R. Musser | |
| 202 and A. Saini, "STL Tutorial and Reference Guide", | |
| 203 Addison-Wesley Publishing Company, Addison-Wesley, 1996</li> | |
| 204 | |
| 205 <li>[<a name="nelson96stlpq" id= | |
| 206 "nelson96stlpq">nelson96stlpql</a>] Mark Nelson, <a href= | |
| 207 "http://www.dogma.net/markn/articles/pq_stl/priority.htm">Priority | |
| 208 Queues and the STL</a>, Dr. Dobbs Journal, January, 1996</li> | |
| 209 | |
| 210 <li>[<a name="okasaki98mereable" id= | |
| 211 "okasaki98mereable">okasaki98mereable</a>] C. Okasaki and A. | |
| 212 Gill, "Fast mergeable integer maps", In Workshop on ML, pages | |
| 213 77--86, September 1998. 95</li> | |
| 214 | |
| 215 <li>[<a name="sgi_stl" id="sgi_stl">sgi_stl</a>] SGI, | |
| 216 "Standard Template Library Programmer's Guide", <a href= | |
| 217 "http://www.sgi.com/tech/stl">http://www.sgi.com/tech/stl</a></li> | |
| 218 | |
| 219 <li>[<a name="select_man" id="select_man">select_man</a>] | |
| 220 <a href= | |
| 221 "http://www.scit.wlv.ac.uk/cgi-bin/mansec?3C+select"><tt>select</tt> | |
| 222 man page.</a></li> | |
| 223 | |
| 224 <li>[<a name="sleator84amortized" id= | |
| 225 "sleator84amortized">sleator84amortized</a>] D. D. Sleator | |
| 226 and R. E. Tarjan, "Amortized Efficiency of List Update | |
| 227 Problems", ACM Symposium on Theory of Computing, 1984</li> | |
| 228 | |
| 229 <li>[<a name="sleator85self" id= | |
| 230 "sleator85self">sleator85self</a>] D. D. Sleator and R. E. | |
| 231 Tarjan, "Self-Adjusting Binary Search Trees", ACM Symposium | |
| 232 on Theory of Computing, 1985</li> | |
| 233 | |
| 234 <li>[<a name="stepanov94standard" id= | |
| 235 "stepanov94standard">stepanov94standard</a>] A. A. Stepanov | |
| 236 and M. Lee", "The Standard Template Library"</li> | |
| 237 | |
| 238 <li>[<a name="stroustrup97cpp" id= | |
| 239 "stroustrup97cpp">stroustrup97cpp</a>] Bjarne Stroustrup, | |
| 240 <i>The C++ Programming Langugage -3rd ed.</i>, Addison-Wesley | |
| 241 Publishing Company,Reading, MA, USA, 1997</li> | |
| 242 | |
| 243 <li>[<a name="vandevoorde2002cpptemplates" id= | |
| 244 "vandevoorde2002cpptemplates">vandevoorde2002cpptemplates</a>] | |
| 245 D. Vandevoorde, and N. M. Josuttis, "C++ Templates: The | |
| 246 Complete Guide", Addison-Wesley Publishing Company, | |
| 247 Addison-Wesley, 2002</li> | |
| 248 | |
| 249 <li>[<a name="wickland96thirty" id= | |
| 250 "wickland96thirty">wickland96thirty</a>] C. A. Wickland, | |
| 251 "Thirty Years Among the Dead", National Psychological | |
| 252 Institute, Los Angeles, 1996,<a href= | |
| 253 "http://myweb.wvnet.edu/~gsa00121/books/amongdead30.zip">http://myweb.wvne
t.edu/gsa00121/books/amongdead30.zip</a></li> | |
| 254 </ol> | |
| 255 <hr /> | |
| 256 </div> | |
| 257 </body> | |
| 258 </html> | |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 3050029:
[gcc] GCC 4.5.0=>4.5.1 (Closed)
Base URL: ssh://git@gitrw.chromium.org:9222/nacl-toolchain.git