1

/* $Id$ */

     2

#include "stdafx.h"

     3

     4

#include "openttd.h"

     5

#include "engine.h"

     6

     7

#include <new>

     8

#include "yapf/blob.hpp"

     9

    10

/* Engine list manipulators - current implementation is only C wrapper around CBlobT<EngineID> (see yapf/blob.hpp) */

    11

    12

/* we cannot expose CBlobT directly to C so we must cast EngineList* to CBlobT<EngineID>* always when we are called from C */

    13

#define B (*(CBlobT<EngineID>*)el)

    14

    15

/** Create Engine List (and initialize it to empty) */

    16

void EngList_Create(EngineList *el)

    17

{

    18

	// call CBlobT constructor explicitly

    19

	new (&B) CBlobT<EngineID>();

    20

}

    21

    22

/** Destroy Engine List (and free its contents) */

    23

void EngList_Destroy(EngineList *el)

    24

{

    25

	// call CBlobT destructor explicitly

    26

	B.~CBlobT<EngineID>();

    27

}

    28

    29

/** Return number of items stored in the Engine List */

    30

uint EngList_Count(const EngineList *el)

    31

{

    32

	return B.Size();

    33

}

    34

    35

/** Add new item at the end of Engine List */

    36

void EngList_Add(EngineList *el, EngineID eid)

    37

{

    38

	B.Append(eid);

    39

}

    40

    41

/** Return pointer to the items array held by Engine List */

    42

EngineID* EngList_Items(EngineList *el)

    43

{

    44

	return B.Data();

    45

}

    46

    47

/** Clear the Engine List (by invalidating all its items == reseting item count to zero) */

    48

void EngList_RemoveAll(EngineList *el)

    49

{

    50

	B.Clear();

    51

}

    52

    53

/** Sort all items using qsort() and given 'CompareItems' function */

    54

void EngList_Sort(EngineList *el, EngList_SortTypeFunction compare)

    55

{

    56

	qsort(B.Data(), B.Size(), sizeof(**el), compare);

    57

}

    58

    59

/** Sort selected range of items (on indices @ <begin, begin+num_items-1>) */

    60

void EngList_SortPartial(EngineList *el, EngList_SortTypeFunction compare, uint begin, uint num_items)

    61

{

    62

	assert(begin <= (uint)B.Size());

    63

	assert(begin + num_items <= (uint)B.Size());

    64

	qsort(B.Data() + begin, num_items, sizeof(**el), compare);

    65

}

    66

    67

#undef B

    68