Mercurial > hg > octave-lyh > gnulib-hg
changeset 17193:52867afa3702
rbtree-list, rbtreehash-list: no 'static inline'
* lib/gl_anyrbtree_list2.h (rotate_left, rotate_right):
* lib/gl_anytree_list2.h (node_at):
* lib/gl_anytreehash_list1.h (hash_resize_after_add)
(gl_oset_first, add_nodes_to_buckets):
Now static, not static inline.
author | Paul Eggert <eggert@cs.ucla.edu> |
---|---|
date | Tue, 20 Nov 2012 22:25:10 -0800 |
parents | 56ba760172b4 |
children | 9db44c051d0f |
files | ChangeLog lib/gl_anyrbtree_list2.h lib/gl_anytree_list2.h lib/gl_anytreehash_list1.h |
diffstat | 4 files changed, 13 insertions(+), 6 deletions(-) [+] |
line wrap: on
line diff
--- a/ChangeLog +++ b/ChangeLog @@ -1,5 +1,12 @@ 2012-11-29 Paul Eggert <eggert@cs.ucla.edu> + rbtree-list, rbtreehash-list: no 'static inline' + * lib/gl_anyrbtree_list2.h (rotate_left, rotate_right): + * lib/gl_anytree_list2.h (node_at): + * lib/gl_anytreehash_list1.h (hash_resize_after_add) + (gl_oset_first, add_nodes_to_buckets): + Now static, not static inline. + regex: no 'static inline' * lib/regex_internal.c (calc_state_hash): * lib/regex_internal.h (bitset_set, bitset_clear, bitset_contain)
--- a/lib/gl_anyrbtree_list2.h +++ b/lib/gl_anyrbtree_list2.h @@ -163,7 +163,7 @@ Change the tree structure, update the branch sizes. The caller must update the colors and register D as child of its parent. */ -static inline gl_list_node_t +static gl_list_node_t rotate_left (gl_list_node_t b_node, gl_list_node_t d_node) { gl_list_node_t a_node = b_node->left; @@ -197,7 +197,7 @@ Change the tree structure, update the branch sizes. The caller must update the colors and register B as child of its parent. */ -static inline gl_list_node_t +static gl_list_node_t rotate_right (gl_list_node_t b_node, gl_list_node_t d_node) { gl_list_node_t a_node = b_node->left;
--- a/lib/gl_anytree_list2.h +++ b/lib/gl_anytree_list2.h @@ -137,7 +137,7 @@ } /* Return the node at the given position < gl_tree_size (list). */ -static inline gl_list_node_t +static gl_list_node_t node_at (gl_list_node_t root, size_t position) { /* Here we know that root != NULL. */
--- a/lib/gl_anytreehash_list1.h +++ b/lib/gl_anytreehash_list1.h @@ -29,7 +29,7 @@ #define MULTIPLE_NODES_MAGIC (void *) -1 /* Resize the hash table if needed, after list->count was incremented. */ -static inline void +static void hash_resize_after_add (gl_list_t list) { size_t count = (list->root != 0 ? list->root->branch_size : 0); @@ -87,7 +87,7 @@ } /* Return the first element of a non-empty ordered set of nodes. */ -static inline gl_list_node_t +static gl_list_node_t gl_oset_first (gl_oset_t set) { gl_oset_iterator_t iter = gl_oset_iterator (set); @@ -272,7 +272,7 @@ /* Build up the hash table during initialization: Store all the nodes of list->root in the hash table. Return 0 upon success, -1 upon out-of-memory. */ -static inline int +static int add_nodes_to_buckets (gl_list_t list) { /* Iterate across all nodes. */