1

/* $Id$ */

     2

     5

#ifndef  ARRAY_HPP

     6

#define  ARRAY_HPP

     7

     8

#include "fixedsizearray.hpp"

     9

    10

/** Flexible array with size limit. Implemented as fixed size

    11

 *  array of fixed size arrays */

    12

template <class Titem_, int Tblock_size_ = 1024, int Tnum_blocks_ = Tblock_size_>

    13

class CArrayT {

    14

public:

    15

	typedef Titem_ Titem; ///< Titem is now visible from outside

    16

	typedef CFixedSizeArrayT<Titem_, Tblock_size_> CSubArray; ///< inner array

    17

	typedef CFixedSizeArrayT<CSubArray, Tnum_blocks_> CSuperArray; ///< outer array

    18

    19

protected:

    20

	CSuperArray     m_a; ///< array of arrays of items

    21

    22

public:

    23

	static const int Tblock_size = Tblock_size_; ///< block size is now visible from outside

    24

	static const int Tnum_blocks = Tnum_blocks_; ///< number of blocks is now visible from outside

    25

	static const int Tcapacity   = Tblock_size * Tnum_blocks; ///< total max number of items

    26

    27

	/** implicit constructor */

    28

	FORCEINLINE CArrayT() { }

    29

	/** Clear (destroy) all items */

    30

	FORCEINLINE void Clear() {m_a.Clear();}

    31

	/** Return actual number of items */

    32

	FORCEINLINE int Size() const

    33

	{

    34

		int super_size = m_a.Size();

    35

		if (super_size == 0) return 0;

    36

		int sub_size = m_a[super_size - 1].Size();

    37

		return (super_size - 1) * Tblock_size + sub_size;

    38

	}

    39

	/** return true if array is empty */

    40

	FORCEINLINE bool IsEmpty() { return m_a.IsEmpty(); }

    41

	/** return true if array is full */

    42

	FORCEINLINE bool IsFull() { return m_a.IsFull() && m_a[Tnum_blocks - 1].IsFull(); }

    43

	/** return first sub-array with free space for new item */

    44

	FORCEINLINE CSubArray& FirstFreeSubArray()

    45

	{

    46

		int super_size = m_a.Size();

    47

		if (super_size > 0) {

    48

			CSubArray& sa = m_a[super_size - 1];

    49

			if (!sa.IsFull()) return sa;

    50

		}

    51

		return m_a.Add();

    52

	}

    53

	/** allocate but not construct new item */

    54

	FORCEINLINE Titem_& AddNC() { return FirstFreeSubArray().AddNC(); }

    55

	/** allocate and construct new item */

    56

	FORCEINLINE Titem_& Add()   { return FirstFreeSubArray().Add(); }

    57

	/** indexed access (non-const) */

    58

	FORCEINLINE Titem& operator [] (int idx)

    59

	{

    60

		CSubArray& sa = m_a[idx / Tblock_size];

    61

		Titem& item   = sa [idx % Tblock_size];

    62

		return item;

    63

	}

    64

	/** indexed access (const) */

    65

	FORCEINLINE const Titem& operator [] (int idx) const

    66

	{

    67

		CSubArray& sa = m_a[idx / Tblock_size];

    68

		Titem& item   = sa [idx % Tblock_size];

    69

		return item;

    70

	}

    71

};

    72

    73

#endif /* ARRAY_HPP */