]>
Commit | Line | Data |
---|---|---|
bb742ede | 1 | /* |
359fc2d2 | 2 | * Copyright (C) the libgit2 contributors. All rights reserved. |
bb742ede VM |
3 | * |
4 | * This file is part of libgit2, distributed under the GNU GPL v2 with | |
5 | * a Linking Exception. For full terms see the included COPYING file. | |
6 | */ | |
c4034e63 VM |
7 | #ifndef INCLUDE_vector_h__ |
8 | #define INCLUDE_vector_h__ | |
9 | ||
72556cc6 | 10 | #include "common.h" |
c4034e63 | 11 | |
c4034e63 | 12 | typedef int (*git_vector_cmp)(const void *, const void *); |
c4034e63 | 13 | |
882c7742 RB |
14 | enum { |
15 | GIT_VECTOR_SORTED = (1u << 0), | |
16 | GIT_VECTOR_FLAG_MAX = (1u << 1), | |
17 | }; | |
18 | ||
c4034e63 | 19 | typedef struct git_vector { |
b8457baa | 20 | size_t _alloc_size; |
c4034e63 | 21 | git_vector_cmp _cmp; |
c4034e63 | 22 | void **contents; |
b8457baa | 23 | size_t length; |
882c7742 | 24 | uint32_t flags; |
c4034e63 VM |
25 | } git_vector; |
26 | ||
ee1f0b1a RB |
27 | #define GIT_VECTOR_INIT {0} |
28 | ||
c25aa7cd PP |
29 | GIT_WARN_UNUSED_RESULT int git_vector_init( |
30 | git_vector *v, size_t initial_size, git_vector_cmp cmp); | |
c4034e63 | 31 | void git_vector_free(git_vector *v); |
9cfce273 | 32 | void git_vector_free_deep(git_vector *v); /* free each entry and self */ |
c4034e63 | 33 | void git_vector_clear(git_vector *v); |
c25aa7cd PP |
34 | GIT_WARN_UNUSED_RESULT int git_vector_dup( |
35 | git_vector *v, const git_vector *src, git_vector_cmp cmp); | |
74fa4bfa | 36 | void git_vector_swap(git_vector *a, git_vector *b); |
d7d46cfb | 37 | int git_vector_size_hint(git_vector *v, size_t size_hint); |
c4034e63 | 38 | |
25e0b157 RB |
39 | void **git_vector_detach(size_t *size, size_t *asize, git_vector *v); |
40 | ||
41a82592 RB |
41 | void git_vector_sort(git_vector *v); |
42 | ||
bad68c0a | 43 | /** Linear search for matching entry using internal comparison function */ |
11d9f6b3 | 44 | int git_vector_search(size_t *at_pos, const git_vector *v, const void *entry); |
bad68c0a RB |
45 | |
46 | /** Linear search for matching entry using explicit comparison function */ | |
11d9f6b3 | 47 | int git_vector_search2(size_t *at_pos, const git_vector *v, git_vector_cmp cmp, const void *key); |
86d7e1ca | 48 | |
bad68c0a RB |
49 | /** |
50 | * Binary search for matching entry using explicit comparison function that | |
51 | * returns position where item would go if not found. | |
52 | */ | |
11d9f6b3 | 53 | int git_vector_bsearch2( |
16248ee2 | 54 | size_t *at_pos, git_vector *v, git_vector_cmp cmp, const void *key); |
86d7e1ca | 55 | |
bad68c0a | 56 | /** Binary search for matching entry using internal comparison function */ |
11d9f6b3 | 57 | GIT_INLINE(int) git_vector_bsearch(size_t *at_pos, git_vector *v, const void *key) |
41a82592 | 58 | { |
11d9f6b3 | 59 | return git_vector_bsearch2(at_pos, v, v->_cmp, key); |
41a82592 | 60 | } |
c4034e63 | 61 | |
54b2a37a | 62 | GIT_INLINE(void *) git_vector_get(const git_vector *v, size_t position) |
86194b24 VM |
63 | { |
64 | return (position < v->length) ? v->contents[position] : NULL; | |
65 | } | |
c4034e63 | 66 | |
a48ea31d RB |
67 | #define GIT_VECTOR_GET(V,I) ((I) < (V)->length ? (V)->contents[(I)] : NULL) |
68 | ||
0b7cdc02 RB |
69 | GIT_INLINE(size_t) git_vector_length(const git_vector *v) |
70 | { | |
71 | return v->length; | |
72 | } | |
73 | ||
16248ee2 | 74 | GIT_INLINE(void *) git_vector_last(const git_vector *v) |
b6c93aef RB |
75 | { |
76 | return (v->length > 0) ? git_vector_get(v, v->length - 1) : NULL; | |
77 | } | |
78 | ||
bcf21c55 CMN |
79 | #define git_vector_foreach(v, iter, elem) \ |
80 | for ((iter) = 0; (iter) < (v)->length && ((elem) = (v)->contents[(iter)], 1); (iter)++ ) | |
81 | ||
ee1f0b1a | 82 | #define git_vector_rforeach(v, iter, elem) \ |
df93a681 | 83 | for ((iter) = (v)->length - 1; (iter) < SIZE_MAX && ((elem) = (v)->contents[(iter)], 1); (iter)-- ) |
ee1f0b1a | 84 | |
c4034e63 | 85 | int git_vector_insert(git_vector *v, void *element); |
bd370b14 RB |
86 | int git_vector_insert_sorted(git_vector *v, void *element, |
87 | int (*on_dup)(void **old, void *new)); | |
16248ee2 | 88 | int git_vector_remove(git_vector *v, size_t idx); |
0534641d | 89 | void git_vector_pop(git_vector *v); |
191adce8 | 90 | void git_vector_uniq(git_vector *v, void (*git_free_cb)(void *)); |
c67fd4c9 | 91 | |
16248ee2 | 92 | void git_vector_remove_matching( |
c67fd4c9 RB |
93 | git_vector *v, |
94 | int (*match)(const git_vector *v, size_t idx, void *payload), | |
95 | void *payload); | |
bd370b14 | 96 | |
db106d01 | 97 | int git_vector_resize_to(git_vector *v, size_t new_length); |
53571f2f ET |
98 | int git_vector_insert_null(git_vector *v, size_t idx, size_t insert_len); |
99 | int git_vector_remove_range(git_vector *v, size_t idx, size_t remove_len); | |
7cb904ba | 100 | |
db106d01 RB |
101 | int git_vector_set(void **old, git_vector *v, size_t position, void *value); |
102 | ||
882c7742 RB |
103 | /** Check if vector is sorted */ |
104 | #define git_vector_is_sorted(V) (((V)->flags & GIT_VECTOR_SORTED) != 0) | |
105 | ||
106 | /** Directly set sorted state of vector */ | |
107 | #define git_vector_set_sorted(V,S) do { \ | |
108 | (V)->flags = (S) ? ((V)->flags | GIT_VECTOR_SORTED) : \ | |
109 | ((V)->flags & ~GIT_VECTOR_SORTED); } while (0) | |
110 | ||
22b6b82f RB |
111 | /** Set the comparison function used for sorting the vector */ |
112 | GIT_INLINE(void) git_vector_set_cmp(git_vector *v, git_vector_cmp cmp) | |
113 | { | |
114 | if (cmp != v->_cmp) { | |
115 | v->_cmp = cmp; | |
882c7742 | 116 | git_vector_set_sorted(v, 0); |
22b6b82f RB |
117 | } |
118 | } | |
119 | ||
c67fd4c9 RB |
120 | /* Just use this in tests, not for realz. returns -1 if not sorted */ |
121 | int git_vector_verify_sorted(const git_vector *v); | |
122 | ||
0bd43371 CMN |
123 | /** |
124 | * Reverse the vector in-place. | |
125 | */ | |
126 | void git_vector_reverse(git_vector *v); | |
127 | ||
c4034e63 | 128 | #endif |