diff options
| author | David Robillard <d@drobilla.net> | 2013-12-25 02:38:06 +0000 |
|---|---|---|
| committer | David Robillard <d@drobilla.net> | 2013-12-25 02:38:06 +0000 |
| commit | 890f81e2f51ef47fe39e940ae0a422dde9b25574 (patch) | |
| tree | 2b9284f50bfd2eb84f5002a7fa8518c911542093 /src/zix | |
| parent | 05576eb9976357bc3870095c0d7e284c655ddb52 (diff) | |
| download | lilv-890f81e2f51ef47fe39e940ae0a422dde9b25574.tar.gz lilv-890f81e2f51ef47fe39e940ae0a422dde9b25574.tar.bz2 lilv-890f81e2f51ef47fe39e940ae0a422dde9b25574.zip | |
Fix some const-correctness violations.
git-svn-id: http://svn.drobilla.net/lad/trunk/lilv@5193 a436a847-0d15-0410-975c-d299462d15a1
Diffstat (limited to 'src/zix')
| -rw-r--r-- | src/zix/tree.c | 6 | ||||
| -rw-r--r-- | src/zix/tree.h | 6 |
2 files changed, 6 insertions, 6 deletions
diff --git a/src/zix/tree.c b/src/zix/tree.c index 844adb9..9915e89 100644 --- a/src/zix/tree.c +++ b/src/zix/tree.c @@ -612,7 +612,7 @@ zix_tree_find(const ZixTree* t, const void* e, ZixTreeIter** ti) } ZIX_API void* -zix_tree_get(ZixTreeIter* ti) +zix_tree_get(const ZixTreeIter* ti) { return ti ? ti->data : NULL; } @@ -658,13 +658,13 @@ zix_tree_rend(ZixTree* t) } ZIX_API bool -zix_tree_iter_is_end(ZixTreeIter* i) +zix_tree_iter_is_end(const ZixTreeIter* i) { return !i; } ZIX_API bool -zix_tree_iter_is_rend(ZixTreeIter* i) +zix_tree_iter_is_rend(const ZixTreeIter* i) { return !i; } diff --git a/src/zix/tree.h b/src/zix/tree.h index f89d9e5..4b6e039 100644 --- a/src/zix/tree.h +++ b/src/zix/tree.h @@ -86,7 +86,7 @@ zix_tree_find(const ZixTree* t, const void* e, ZixTreeIter** ti); Return the data associated with the given tree item. */ ZIX_API void* -zix_tree_get(ZixTreeIter* ti); +zix_tree_get(const ZixTreeIter* ti); /** Return an iterator to the first (smallest) element in @a t. @@ -104,7 +104,7 @@ zix_tree_end(ZixTree* t); Return true iff @a i is an iterator to the end of its tree. */ ZIX_API bool -zix_tree_iter_is_end(ZixTreeIter* i); +zix_tree_iter_is_end(const ZixTreeIter* i); /** Return an iterator to the last (largest) element in @a t. @@ -122,7 +122,7 @@ zix_tree_rend(ZixTree* t); Return true iff @a i is an iterator to the reverse end of its tree. */ ZIX_API bool -zix_tree_iter_is_rend(ZixTreeIter* i); +zix_tree_iter_is_rend(const ZixTreeIter* i); /** Return an iterator that points to the element one past @a i. |