32 #include <apr_pools.h>
33 #include <apr_tables.h>
38 #define MAX(a, b) ((a) < (b) ? (b) : (a))
43 #define MIN(a, b) ((a) < (b) ? (a) : (b))
172 svn_sort__bsearch_lower_bound(
const void *key,
173 const apr_array_header_t *array,
174 int (*compare_func)(
const void *,
const void *));
180 svn_sort__array_insert(
const void *new_element,
181 apr_array_header_t *array,
191 svn_sort__array_delete(apr_array_header_t *arr,
193 int elements_to_delete);
apr_ssize_t klen
size of the key
int svn_sort_compare_items_lexically(const svn_sort__item_t *a, const svn_sort__item_t *b)
Compare two svn_sort__item_t's, returning an integer greater than, equal to, or less than 0...
This structure is used to hold a key/value from a hash table.
int svn_sort_compare_paths(const void *a, const void *b)
Compare two const char * paths, returning an integer greater than, equal to, or less than 0...
const void * key
pointer to the key
int svn_sort_compare_ranges(const void *a, const void *b)
Compare two svn_merge_range_t *'s, returning an integer greater than, equal to, or less than 0 if the...
int svn_sort_compare_revisions(const void *a, const void *b)
Compare two svn_revnum_t's, returning an integer greater than, equal to, or less than 0...
apr_array_header_t * svn_sort__hash(apr_hash_t *ht, int(*comparison_func)(const svn_sort__item_t *, const svn_sort__item_t *), apr_pool_t *pool)
Sort ht according to its keys, return an apr_array_header_t containing svn_sort__item_t structures ho...
void * value
pointer to the value
int svn_sort_compare_items_as_paths(const svn_sort__item_t *a, const svn_sort__item_t *b)
Compare two svn_sort__item_t's, returning an integer greater than, equal to, or less than 0...
struct svn_sort__item_t svn_sort__item_t
This structure is used to hold a key/value from a hash table.