	
		
		
		
	
Acknowledgements
	
This library was written at the http://www.haifa.il.ibm.com/dept/storage/network.htmlNetwork Storage Technologies  Group of
http://www.haifa.il.ibm.com/IBM's Haifa Research Labs .	
The library is based heavily on policy-based design and uses many useful
techniques from [
references.html#knuth98sortingalexandrescu01modern ].
	
	
 Two ideas are borrowed from the SGI-STL implementation [ references.html#sgi_stlsgi_stl ]:
	
		
			The prime-based resize policies use a list of primes taken from the SGI-STL implementation.
		
		
 The red-black trees contain both a root node and a header
	node (containing metadata), connected in a way
	that forward and reverse iteration can be performed efficiently.
		
	
	
	
 Some test utilities borrow ideas from [ references.html#boost_timerboost_timer ].
	
	
 We would like to thank Scott Meyers for useful comments (without attributing to him
	any flaws in the design or implementation of the library).
	
	
 Much of the documentation is
http://www.python.org/[Python Powered] .
	
