#include <apr_pools.h>
#include <apr_tables.h>
#include <apr_hash.h>
Go to the source code of this file.
Data Structures | |
struct | svn_sort__item_t |
This structure is used to hold a key/value from a hash table. More... | |
Typedefs | |
typedef svn_sort__item_t | svn_sort__item_t |
This structure is used to hold a key/value from a hash table. | |
Functions | |
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, according as a is greater than, equal to, or less than b. | |
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, according as a is greater than, equal to, or less than b according to a lexical key comparison. | |
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, according as b is greater than, equal to, or less than a. | |
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, using the same comparison rules as are used by svn_path_compare_paths(). | |
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 holding those keys and values (i.e. |
Definition in file svn_sorts.h.
|
This structure is used to hold a key/value from a hash table.
|
|
Sort ht according to its keys, return an
for each Storage is shared with the original hash, not copied.
comparison_func should take two
|
|
Compare two
This is useful for converting a hash into a sorted
apr_array_header_t *hdr;
hdr = svn_sort__hash (hsh, The key strings must be null-terminated, even though klen does not include the terminator. |
|
Compare two The keys are not required to be zero-terminated. |
|
Compare two This function is compatible for use with qsort().
|
|
Compare two Note that this sorts newest revision to oldest (IOW, descending order). This function is compatible for use with qsort().
This is useful for converting an array of revisions into a sorted |