mirror of
https://github.com/xzeldon/htop.git
synced 2025-07-12 12:14:36 +03:00
Mega-commit with features and tweaks for 1.0:
* Performance improvements * Support for splitting CPU meters into two or four columns (thanks to Wim Heirman) * Switch from PLPA, which is now deprecated, to HWLOC. * Bring back support for native Linux sched_setaffinity, so we don't have to use HWLOC where we don't need to. * Support for typing in user names and column fields in selection panels.
This commit is contained in:
19
Vector.h
19
Vector.h
@ -18,6 +18,8 @@ in the source distribution for its full text.
|
||||
#include <assert.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
|
||||
@ -45,7 +47,14 @@ int Vector_count(Vector* this);
|
||||
|
||||
void Vector_prune(Vector* this);
|
||||
|
||||
void Vector_sort(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_);
|
||||
|
||||
@ -59,8 +68,16 @@ void Vector_moveDown(Vector* this, int idx);
|
||||
|
||||
void Vector_set(Vector* this, int idx, void* data_);
|
||||
|
||||
#ifdef DEBUG
|
||||
|
||||
extern Object* Vector_get(Vector* this, int idx);
|
||||
|
||||
#else
|
||||
|
||||
#define Vector_get(v_, idx_) ((v_)->array[idx_])
|
||||
|
||||
#endif
|
||||
|
||||
extern int Vector_size(Vector* this);
|
||||
|
||||
/*
|
||||
|
Reference in New Issue
Block a user