/* Do not edit this file. It was automatically generated. */

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

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

#define swap(a_,x_,y_) do { void *tmp_ = (a_)[x_]; (a_)[x_] = (a_)[y_]; (a_)[y_] = tmp_; } while(0)

#ifndef DEFAULT_SIZE
#define DEFAULT_SIZE -1
#endif

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

Vector* Vector_new(ObjectClass* type, bool owner, int size);

void Vector_delete(Vector* this);

#ifndef NDEBUG

int Vector_count(const Vector *this);

#endif

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);

void Vector_insertionSort(Vector* this);

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

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

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

void Vector_moveUp(Vector* this, int idx);

void Vector_moveDown(Vector* this, int idx);

void Vector_moveToTop(Vector *this, int i);

void Vector_moveToBottom(Vector *this, int i);

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

#ifdef DEBUG

Object* Vector_get(const Vector *this, int idx);

#else

#define Vector_get(v_, idx_) ((v_)->array[idx_])

#endif

#ifdef DEBUG

int Vector_size(const Vector *this);

#else

#define Vector_size(v_) ((v_)->items)

#endif

/*

*/

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

int Vector_indexOf(const Vector *this, const void *search, Object_Compare compare);

#endif