Vector.h 1.35 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/* Do not edit this file. It was automatically genarated. */

#ifndef HEADER_Vector
#define HEADER_Vector
/*
htop
(C) 2004-2006 Hisham H. Muhammad
Released under the GNU GPL, see the COPYING file
in the source distribution for its full text.
*/

#include "Object.h"
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>

#include "debug.h"
#include <assert.h>


#ifndef DEFAULT_SIZE
#define DEFAULT_SIZE -1
#endif

typedef void(*Vector_procedure)(void*);

typedef struct Vector_ {
   Object **array;
   int arraySize;
   int growthRate;
   int items;
   char* vectorType;
   bool owner;
} Vector;


Vector* Vector_new(char* vectorType_, bool owner, int size);

void Vector_delete(Vector* this);

void Vector_prune(Vector* this);

void Vector_sort(Vector* this);

void Vector_insert(Vector* this, int index, void* data_);

Object* Vector_take(Vector* this, int index);

Object* Vector_remove(Vector* this, int index);

void Vector_moveUp(Vector* this, int index);

void Vector_moveDown(Vector* this, int index);

void Vector_set(Vector* this, int index, void* data_);

inline Object* Vector_get(Vector* this, int index);

inline int Vector_size(Vector* this);

void Vector_merge(Vector* this, Vector* v2);

void Vector_add(Vector* this, void* data_);

inline int Vector_indexOf(Vector* this, void* search_);

void Vector_foreach(Vector* this, Vector_procedure f);

#endif