vector.h

Go to the documentation of this file.

#ifndef _vector_h_
#define _vector_h_

#include "bool.h"

typedef Bool (*LessThanOp)(void *item1, void *item2);

typedef void (*DestructorOp)(void *item);

void GenericPointerFree(void *item);

#define HEAP_PARENT_INDEX(i)  (((i) - 1) >> 1)

#define HEAP_CHILD_INDEX(i)   (((i) << 1) + 1)

struct Vector_t {
    LessThanOp lessOp;
    DestructorOp destructOp;
    void  *array;
    unsigned int itemSize;
    unsigned int items;
    unsigned int size;
    unsigned int minSize;
};

typedef struct Vector_t Vector;

Bool VectorInit(Vector *vec, unsigned int initSize);

void VectorDestroy(Vector *vec);

Bool VectorCopy(Vector *target, Vector *source);

void VectorClear(Vector *vec);

void *VectorAdd(Vector *vec);

void *VectorPush(Vector *vec, void *item);

void *VectorHeapPush(Vector *vec, void *item);

void VectorPop(Vector *vec);

void VectorHeapPop(Vector *vec);

void VectorHeapSort(Vector *vec);

#define VectorInsert(vec, index)  VectorInsertMany(vec, index, 1)

void *VectorInsertMany(Vector *vec, unsigned int index, unsigned int count);

#define VectorRemove(vec, index)  VectorRemoveMany(vec, index, 1)

void VectorRemoveMany(Vector *vec, unsigned int index, unsigned int count);

void VectorMakeHeap(Vector *vec);

Bool VectorReserve(Vector *vec, unsigned int size);

#define VectorFirst(vec)  (((vec)->items) ? (vec)->array : NULL)

#define VectorLast(vec)   (((vec)->items) ? \
             &(((char*)(vec)->array)[((vec)->items - 1) * (vec)->itemSize]) : \
             NULL)

#define VectorItem(vec, index)  (((unsigned)(index) < (vec)->items) ? \
                   &(((char*)(vec)->array)[index * (vec)->itemSize]) : NULL)

#endif

---