hat.h File Reference

#include "sysinc.h"

Include dependency graph for hat.h:

Go to the source code of this file.

Compounds
class	Hat
	This class implements a dynamicly growable array. More...
Defines
#define	GetTopIndex(i)   ((i)>>power)
	These macros ensure the these calculations get inlined even for stupid compilers.
#define	GetLeafIndex(i)   ((i)&leafMask)
#define	NULL   0
Enumerations
enum	{ min_hat_size = 32 }
	Minimum hat array will hold 32 *32 = 1024 elements. More...

---

Define Documentation

#define GetLeafIndex (  i   )     ((i)&leafMask)

Definition at line 11 of file hat.h. Referenced by sparse_array< chain_elem >::insert(), Hat< T >::leafIndex(), sparse_array< chain_elem >::operator[](), and Hat< T >::operator[]().

#define GetTopIndex (  i   )     ((i)>>power)

These macros ensure the these calculations get inlined even for stupid compilers. Definition at line 10 of file hat.h. Referenced by sparse_array< chain_elem >::insert(), sparse_array< chain_elem >::operator[](), Hat< T >::operator[](), sparse_array< chain_elem >::probe(), and Hat< T >::topIndex().

#define NULL   0

Definition at line 18 of file hat.h.

---

Enumeration Type Documentation

anonymous enum

Minimum hat array will hold 32 *32 = 1024 elements. Note that the 32 element leaves will be allocated on demand. Enumeration values: min_hat_size  Definition at line 15 of file hat.h. { min_hat_size = 32 };

---