Deprecated List

Member CrissCross::Data::AVLTree::find (Key const &_key) const

The return value of this function could be unpredictable if the contents of the table was anything but pointers or integers.

Class BubbleSort< T >

This is an extremely slow sorting method. It is provided for educational purposes ONLY.

Member CrissCross::Data::HashTable::find (Key const &_key) const

The return value of this function could be unpredictable if the contents of the table was anything but pointers or integers.

Class InsertionSort< T >

This is an extremely slow sorting method. It is provided for educational purposes ONLY.

Class MD2Hash

MD2 hashes are rarely used anymore because they are very slow to generate. The code for them is optimized for 8-bit machines and is no longer suitable for production use. It's highly recommended that you use MD4 or MD5 as a replacement of MD2.

Member CrissCross::Data::RedBlackTree::find (Key const &_key) const

The return value of this function could be unpredictable if the contents of the table was anything but pointers or integers.

Member CrissCross::Data::SplayTree::find (Key const &_key) const

The return value of this function could be unpredictable if the contents of the table was anything but pointers or integers.