diff options
| author | David Robillard <d@drobilla.net> | 2020-12-31 15:34:15 +0100 |
|---|---|---|
| committer | David Robillard <d@drobilla.net> | 2020-12-31 15:34:15 +0100 |
| commit | ed9a6e98b8e4e010117e1228333569aa31c51d9e (patch) | |
| tree | 3c333f1c7ce2109222d06aa026b939e379e55b5d /zix/sorted_array.h | |
| parent | de27dcfe0bb72ef1ec937c4aaee26eef6ff7918e (diff) | |
| download | zix-ed9a6e98b8e4e010117e1228333569aa31c51d9e.tar.gz zix-ed9a6e98b8e4e010117e1228333569aa31c51d9e.tar.bz2 zix-ed9a6e98b8e4e010117e1228333569aa31c51d9e.zip | |
Separate source from headers
Diffstat (limited to 'zix/sorted_array.h')
| -rw-r--r-- | zix/sorted_array.h | 147 |
1 files changed, 0 insertions, 147 deletions
diff --git a/zix/sorted_array.h b/zix/sorted_array.h deleted file mode 100644 index 92f13e6..0000000 --- a/zix/sorted_array.h +++ /dev/null @@ -1,147 +0,0 @@ -/* - Copyright 2011-2014 David Robillard <http://drobilla.net> - - Permission to use, copy, modify, and/or distribute this software for any - purpose with or without fee is hereby granted, provided that the above - copyright notice and this permission notice appear in all copies. - - THIS SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES - WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF - MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR - ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES - WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN - ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF - OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -*/ - -#ifndef ZIX_SORTED_ARRAY_H -#define ZIX_SORTED_ARRAY_H - -#include "zix/common.h" - -#include <stdbool.h> -#include <stddef.h> - -#ifdef __cplusplus -extern "C" { -#endif - -/** - @addtogroup zix - @{ - @name SortedArray - @{ -*/ - -/** - A sorted array. -*/ -typedef struct ZixSortedArrayImpl ZixSortedArray; - -/** - An iterator over a ZixSortedArray. -*/ -typedef void* ZixSortedArrayIter; - -/** - Create a new (empty) sorted array. -*/ -ZIX_API -ZixSortedArray* -zix_sorted_array_new(bool allow_duplicates, - ZixComparator cmp, - void* cmp_data, - size_t elem_size); - -/** - Free `a`. -*/ -ZIX_API -void -zix_sorted_array_free(ZixSortedArray* a); - -/** - Return the number of elements in `a`. -*/ -ZIX_PURE_API -size_t -zix_sorted_array_size(const ZixSortedArray* a); - -/** - Insert the element `e` into `a` and point `ai` at the new element. -*/ -ZIX_API -ZixStatus -zix_sorted_array_insert(ZixSortedArray* a, - const void* e, - ZixSortedArrayIter* ai); - -/** - Remove the item pointed at by `ai` from `a`. -*/ -ZIX_API -ZixStatus -zix_sorted_array_remove(ZixSortedArray* a, ZixSortedArrayIter ai); - -/** - Set `ai` to be the largest element <= `e` in `a`. - If no such item exists, `ai` is set to NULL. -*/ -ZIX_API -ZixStatus -zix_sorted_array_find(const ZixSortedArray* a, - const void* e, - ZixSortedArrayIter* ai); - -/** - Return the element at index `index`. -*/ -ZIX_PURE_API -void* -zix_sorted_array_index(const ZixSortedArray* a, size_t index); - -/** - Return the data associated with the given array item. -*/ -ZIX_CONST_API -void* -zix_sorted_array_get_data(ZixSortedArrayIter ai); - -/** - Return an iterator to the first (smallest) element in `a`. -*/ -ZIX_PURE_API -ZixSortedArrayIter -zix_sorted_array_begin(ZixSortedArray* a); - -/** - Return an iterator the the element one past the last element in `a`. -*/ -ZIX_PURE_API -ZixSortedArrayIter -zix_sorted_array_end(ZixSortedArray* a); - -/** - Return true iff `a` is an iterator to the end of its tree. -*/ -ZIX_PURE_API -bool -zix_sorted_array_iter_is_end(ZixSortedArray* a, ZixSortedArrayIter i); - -/** - Return an iterator that points to the element one past `a`. -*/ -ZIX_PURE_API -ZixSortedArrayIter -zix_sorted_array_iter_next(ZixSortedArray* a, ZixSortedArrayIter i); - -/** - @} - @} -*/ - -#ifdef __cplusplus -} /* extern "C" */ -#endif - -#endif /* ZIX_SORTED_ARRAY_H */ |