summaryrefslogtreecommitdiff
path: root/fedora/.local/bin/htop-vim/Vector.h
diff options
context:
space:
mode:
authorTheSiahxyz <164138827+TheSiahxyz@users.noreply.github.com>2026-04-28 15:42:50 +0900
committerTheSiahxyz <164138827+TheSiahxyz@users.noreply.github.com>2026-04-28 15:42:50 +0900
commitae78dbbff81196f1d7bc8fabf84d05e6b9f3ca03 (patch)
treefdc69ee3e2772aa4db7e8efe4bd30d101c7f82ac /fedora/.local/bin/htop-vim/Vector.h
parent06ad645351572c0e7188c52028998384d718df2e (diff)
updatesHEADmaster
Diffstat (limited to 'fedora/.local/bin/htop-vim/Vector.h')
-rw-r--r--fedora/.local/bin/htop-vim/Vector.h99
1 files changed, 0 insertions, 99 deletions
diff --git a/fedora/.local/bin/htop-vim/Vector.h b/fedora/.local/bin/htop-vim/Vector.h
deleted file mode 100644
index b7b3903..0000000
--- a/fedora/.local/bin/htop-vim/Vector.h
+++ /dev/null
@@ -1,99 +0,0 @@
-#ifndef HEADER_Vector
-#define HEADER_Vector
-/*
-htop - Vector.h
-(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"
-
-#include <stdbool.h>
-
-
-#ifndef DEFAULT_SIZE
-#define DEFAULT_SIZE (-1)
-#endif
-
-typedef struct Vector_ {
- Object** array;
- const ObjectClass* type;
- int arraySize;
- int growthRate;
- int items;
- /* lowest index of a pending soft remove/delete operation,
- used to speed up compaction */
- int dirty_index;
- /* count of soft deletes, required for Vector_count to work in debug mode */
- int dirty_count;
- 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_quickSortCustomCompare(Vector* this, Object_Compare compare);
-static inline void Vector_quickSort(Vector* this) {
- Vector_quickSortCustomCompare(this, this->type->compare);
-}
-
-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);
-
-/* Vector_softRemove marks the item at index idx for deletion without
- reclaiming any space. If owned, the item is immediately freed.
-
- Vector_compact must be called to reclaim space.*/
-Object* Vector_softRemove(Vector* this, int idx);
-
-/* Vector_compact reclaims space free'd up by Vector_softRemove, if any. */
-void Vector_compact(Vector* this);
-
-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(const Vector* this, int idx);
-int Vector_size(const Vector* this);
-
-/* Vector_countEquals returns true if the number of non-NULL items
- in the Vector is equal to expectedCount. This is only for debugging
- and consistency checks. */
-bool Vector_countEquals(const Vector* this, unsigned int expectedCount);
-
-#else /* NDEBUG */
-
-static inline Object* Vector_get(const Vector* this, int idx) {
- return this->array[idx];
-}
-
-static inline int Vector_size(const Vector* this) {
- return this->items;
-}
-
-#endif /* NDEBUG */
-
-static inline const ObjectClass* Vector_type(const Vector* this) {
- return this->type;
-}
-
-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