nodeleftright     203 maint/gnulib/lib/gl_anyavltree_list2.h               gl_list_node_t nodeleftright = nodeleft->right;
nodeleftright     213 maint/gnulib/lib/gl_anyavltree_list2.h                   node->left = nodeleftright;
nodeleftright     218 maint/gnulib/lib/gl_anyavltree_list2.h                   if (nodeleftright != NULL)
nodeleftright     219 maint/gnulib/lib/gl_anyavltree_list2.h                     nodeleftright->parent = node;
nodeleftright     225 maint/gnulib/lib/gl_anyavltree_list2.h                     (nodeleftright != NULL ? nodeleftright->branch_size : 0)
nodeleftright     253 maint/gnulib/lib/gl_anyavltree_list2.h                   gl_list_node_t L = nodeleft->right = nodeleftright->left;
nodeleftright     254 maint/gnulib/lib/gl_anyavltree_list2.h                   gl_list_node_t R = node->left = nodeleftright->right;
nodeleftright     255 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleftright->left = nodeleft;
nodeleftright     256 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleftright->right = node;
nodeleftright     258 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleftright->parent = node->parent;
nodeleftright     263 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleft->parent = nodeleftright;
nodeleftright     264 maint/gnulib/lib/gl_anyavltree_list2.h                   node->parent = nodeleftright;
nodeleftright     266 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleft->balance = (nodeleftright->balance > 0 ? -1 : 0);
nodeleftright     267 maint/gnulib/lib/gl_anyavltree_list2.h                   node->balance = (nodeleftright->balance < 0 ? 1 : 0);
nodeleftright     268 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleftright->balance = 0;
nodeleftright     276 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleftright->branch_size =
nodeleftright     279 maint/gnulib/lib/gl_anyavltree_list2.h                   *nodep = nodeleftright;
nodeleftright     121 maint/gnulib/lib/gl_avltree_ordered.h               NODE_T nodeleftright = nodeleft->right;
nodeleftright     131 maint/gnulib/lib/gl_avltree_ordered.h                   node->left = nodeleftright;
nodeleftright     136 maint/gnulib/lib/gl_avltree_ordered.h                   if (nodeleftright != NULL)
nodeleftright     137 maint/gnulib/lib/gl_avltree_ordered.h                     nodeleftright->parent = node;
nodeleftright     165 maint/gnulib/lib/gl_avltree_ordered.h                   NODE_T L = nodeleft->right = nodeleftright->left;
nodeleftright     166 maint/gnulib/lib/gl_avltree_ordered.h                   NODE_T R = node->left = nodeleftright->right;
nodeleftright     167 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleftright->left = nodeleft;
nodeleftright     168 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleftright->right = node;
nodeleftright     170 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleftright->parent = node->parent;
nodeleftright     175 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleft->parent = nodeleftright;
nodeleftright     176 maint/gnulib/lib/gl_avltree_ordered.h                   node->parent = nodeleftright;
nodeleftright     178 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleft->balance = (nodeleftright->balance > 0 ? -1 : 0);
nodeleftright     179 maint/gnulib/lib/gl_avltree_ordered.h                   node->balance = (nodeleftright->balance < 0 ? 1 : 0);
nodeleftright     180 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleftright->balance = 0;
nodeleftright     182 maint/gnulib/lib/gl_avltree_ordered.h                   *nodep = nodeleftright;