pike.git / src / rbtree.h

version» Context lines:

pike.git/src/rbtree.h:1:   /*   || This file is part of Pike. For copyright information see COPYRIGHT.   || Pike is distributed under GPL, LGPL and MPL. See the file COPYING   || for more information. - || $Id: rbtree.h,v 1.10 2003/04/02 19:22:44 mast Exp $ + || $Id: rbtree.h,v 1.11 2008/06/29 12:07:04 nilsson Exp $   */      /* An implementation of a threaded red/black balanced binary tree.    *    * Created 2001-04-27 by Martin Stjernholm    */      #ifndef RBTREE_H   #define RBTREE_H   
pike.git/src/rbtree.h:147:    *    * get_nth:    * Returns the nth entry, counting from the beginning. Note that    * this is a linear operation.    *    * All destructive operations might change the tree root.    */      struct rb_node_hdr *rb_insert (struct rb_node_hdr **root,    rb_find_fn *find_fn, void *key, -  struct rb_node_hdr *new); +  struct rb_node_hdr *new_node);   void rb_add (struct rb_node_hdr **root,    rb_find_fn *find_fn, void *key, -  struct rb_node_hdr *new); +  struct rb_node_hdr *new_node);   void rb_add_after (struct rb_node_hdr **root,    rb_find_fn *find_fn, void *key, -  struct rb_node_hdr *new, +  struct rb_node_hdr *new_node,    struct rb_node_hdr *existing);   struct rb_node_hdr *rb_remove (struct rb_node_hdr **root,    rb_find_fn *find_fn, void *key);   void rb_remove_node (struct rb_node_hdr **root,    rb_find_fn *find_fn, void *key,    struct rb_node_hdr *node);   struct rb_node_hdr *rb_remove_with_move (struct rb_node_hdr **root,    rb_find_fn *find_fn, void *key,    size_t node_size,    rb_free_fn *cleanup_fn,