htop/Vector.h

69 lines
1.4 KiB
C
Raw Normal View History

#ifndef HEADER_Vector
#define HEADER_Vector
/*
2011-12-26 21:35:57 +00:00
htop - Vector.h
2011-05-26 16:35:07 +00:00
(C) 2004-2011 Hisham H. Muhammad
Released under the GNU GPLv2, see the COPYING file
in the source distribution for its full text.
*/
#include "Object.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;
const ObjectClass* type;
int arraySize;
int growthRate;
int items;
bool owner;
} Vector;
Vector* Vector_new(const ObjectClass* type, bool owner, int size);
void Vector_delete(Vector* this);
void Vector_prune(Vector* this);
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_set(Vector* this, int idx, void* data_);
#ifndef NDEBUG
Object* Vector_get(Vector* this, int idx);
int Vector_size(const Vector* this);
int Vector_count(const Vector* this);
#else /* NDEBUG */
#define Vector_get(v_, idx_) ((v_)->array[idx_])
#define Vector_size(v_) ((v_)->items)
#endif /* NDEBUG */
void Vector_add(Vector* this, void* data_);
int Vector_indexOf(const Vector* this, const void* search_, Object_Compare compare);
void Vector_splice(Vector* this, Vector* from);
#endif