From f3147ea2d1598914c2db53e8cfb34c8ff81e2ff4 Mon Sep 17 00:00:00 2001 From: Daniel Lange Date: Thu, 27 Aug 2020 07:48:10 +0200 Subject: New upstream version 3.0.0 --- Vector.h | 28 +++++++++++++++------------- 1 file changed, 15 insertions(+), 13 deletions(-) (limited to 'Vector.h') diff --git a/Vector.h b/Vector.h index 85939bf..0d9f1c2 100644 --- a/Vector.h +++ b/Vector.h @@ -27,38 +27,38 @@ typedef struct Vector_ { } Vector; -Vector* Vector_new(ObjectClass* type, bool owner, int size); +extern Vector* Vector_new(ObjectClass* type, bool owner, int size); -void Vector_delete(Vector* this); +extern void Vector_delete(Vector* this); #ifdef DEBUG -int Vector_count(Vector* this); +extern int Vector_count(Vector* this); #endif -void Vector_prune(Vector* this); +extern void Vector_prune(Vector* this); // If I were to use only one sorting algorithm for both cases, it would probably be this one: /* */ -void Vector_quickSort(Vector* this); +extern void Vector_quickSort(Vector* this); -void Vector_insertionSort(Vector* this); +extern void Vector_insertionSort(Vector* this); -void Vector_insert(Vector* this, int idx, void* data_); +extern void Vector_insert(Vector* this, int idx, void* data_); -Object* Vector_take(Vector* this, int idx); +extern Object* Vector_take(Vector* this, int idx); -Object* Vector_remove(Vector* this, int idx); +extern Object* Vector_remove(Vector* this, int idx); -void Vector_moveUp(Vector* this, int idx); +extern void Vector_moveUp(Vector* this, int idx); -void Vector_moveDown(Vector* this, int idx); +extern void Vector_moveDown(Vector* this, int idx); -void Vector_set(Vector* this, int idx, void* data_); +extern void Vector_set(Vector* this, int idx, void* data_); #ifdef DEBUG @@ -84,8 +84,10 @@ extern int Vector_size(Vector* this); */ -void Vector_add(Vector* this, void* data_); +extern void Vector_add(Vector* this, void* data_); extern int Vector_indexOf(Vector* this, void* search_, Object_Compare compare); +void Vector_splice(Vector* this, Vector* from); + #endif -- cgit v1.2.3