Mercurial > code
annotate array.h @ 67:cff6869fbc94
Modified [p]array_find to return the index for a better usage
| author | David Demelier <markand@malikania.fr> |
|---|---|
| date | Thu, 10 Nov 2011 18:27:04 +0100 |
| parents | f773c76b1f3c |
| children | 8f6d3850fac1 |
| rev | line source |
|---|---|
| 62 | 1 /* |
| 2 * array.h -- manipulate dynamic arrays | |
| 3 * | |
| 4 * Copyright (c) 2011, David Demelier <markand@malikania.fr> | |
| 5 * | |
| 6 * Permission to use, copy, modify, and/or distribute this software for any | |
| 7 * purpose with or without fee is hereby granted, provided that the above | |
| 8 * copyright notice and this permission notice appear in all copies. | |
| 9 * | |
| 10 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES | |
| 11 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF | |
| 12 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR | |
| 13 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES | |
| 14 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN | |
| 15 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF | |
| 16 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. | |
| 17 */ | |
| 18 | |
| 19 #ifndef _ARRAY_H_ | |
| 20 #define _ARRAY_H_ | |
| 21 | |
| 66 | 22 #ifdef __cplusplus |
| 23 extern "C" { | |
| 24 #endif | |
| 25 | |
| 62 | 26 /* Add some nonnull attributes for gcc/clang */ |
| 27 #ifdef __GNUC__ | |
| 28 # define __at_malloc __attribute__ ((malloc)) | |
| 29 # define __at_nonnull(...) __attribute__ ((nonnull (__VA_ARGS__))) | |
| 30 #else | |
| 31 # define __at_malloc | |
| 32 # define __at_nonnull(...) | |
| 33 #endif | |
| 34 | |
| 35 #define ARRAY_DEFAULT_BSIZE 128 | |
| 36 | |
| 37 enum array_type { | |
| 38 ARRAY_FIXED = 0, | |
| 39 ARRAY_AUTO = 1 | |
| 40 }; | |
| 41 | |
| 42 struct array { | |
| 43 enum array_type type; /* array's type (default FIXED) */ | |
| 44 void *data; /* array of data */ | |
| 45 int length; /* number of element inside */ | |
| 46 size_t size; /* current buffer size (allocated memory) */ | |
| 47 size_t unit; /* unit size (sizeof the object) */ | |
| 48 int bsize; /* block size (used when growing array) */ | |
| 49 int i; /* only for ARRAY_FOREACH(_R) */ | |
| 50 }; | |
| 51 | |
| 52 typedef void (*array_map_fn)(void *, void *); | |
| 53 typedef int (*array_cmp_fn)(void *, void *); | |
| 54 | |
| 55 struct array *array_new(enum array_type, size_t, int) __at_malloc; | |
| 56 int array_push(struct array *, const void *) __at_nonnull(1, 2); | |
| 57 int array_insert(struct array *, const void *, int) __at_nonnull(1, 2); | |
| 58 int array_append(struct array *, const void *) __at_nonnull(1, 2); | |
| 59 void array_pop(struct array *) __at_nonnull(1); | |
| 60 void array_unqueue(struct array *) __at_nonnull(1); | |
| 61 void array_remove(struct array *, int) __at_nonnull(1); | |
| 62 void array_unref(struct array *, const void *) __at_nonnull(1); | |
| 63 int array_iswap(struct array *, int, int) __at_nonnull(1); | |
| 64 int array_pswap(struct array *, const void *, const void *) __at_nonnull(1); | |
| 65 void array_map(const struct array *, array_map_fn, void *) __at_nonnull(1, 2); | |
|
67
cff6869fbc94
Modified [p]array_find to return the index for a better usage
David Demelier <markand@malikania.fr>
parents:
66
diff
changeset
|
66 int array_find(const struct array *, array_cmp_fn, void *, void *) __at_nonnull(1, 2); |
| 62 | 67 void array_clear(struct array *) __at_nonnull(1); |
| 68 void array_free(struct array *) __at_nonnull(1); | |
| 69 | |
| 70 #define ARRAY_HEAD(a, type) \ | |
| 71 (((type *)a->data)[0]) | |
| 72 #define ARRAY_TAIL(a, type) \ | |
| 73 (((type *)a->data)[(a->length == 0) ? 0 : a->length - 1]) | |
| 74 #define ARRAY_INDEX(a, i, type) \ | |
| 75 ((type *)(a)->data)[((i) < 0) \ | |
| 76 ? 0 : ((i) >= (a)->length) ? (a)->length - 1 : (i)] | |
| 77 | |
| 78 #define ARRAY_FOREACH_R(a, var) \ | |
| 79 for ((a)->i = 0, var = ARRAY_TAIL((a)); \ | |
| 80 (a)->i < (a)->length; ++(a)->i, --var) | |
| 81 | |
| 82 #define ARRAY_FOREACH(a, var, type) \ | |
| 83 for ((a)->i = 0, var = ARRAY_HEAD((a), type); \ | |
| 84 (a)->i < (a)->length; \ | |
| 85 ++(a)->i, var = ARRAY_INDEX((a), (a)->i, type)) | |
| 86 | |
| 66 | 87 #ifdef __cplusplus |
| 88 } | |
| 89 #endif | |
| 90 | |
| 62 | 91 #endif /* _ARRAY_H_ */ |