pike.git / src / rbtree.c

version» Context lines:

pike.git/src/rbtree.c: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.c,v 1.20 2002/12/08 16:45:33 mast Exp $ + || $Id: rbtree.c,v 1.21 2002/12/19 02:40:29 mast Exp $   */      /* An implementation of a threaded red/black balanced binary tree.    *    * Created 2001-04-27 by Martin Stjernholm <mast@lysator.liu.se>    */      #include "global.h"    - RCSID("$Id: rbtree.c,v 1.20 2002/12/08 16:45:33 mast Exp $"); + RCSID("$Id: rbtree.c,v 1.21 2002/12/19 02:40:29 mast Exp $");      #include "interpret.h"   #include "pike_error.h"   #include "rbtree_low.h"      #include <assert.h>   #include <stdlib.h>      #if defined (PIKE_DEBUG) || defined (TEST_MULTISET)   
pike.git/src/rbtree.c:1749: Inside #if defined (PIKE_DEBUG) || defined (TEST_MULTISET)
   }, { /* Between nodes. */    if (!(node->flags & RB_THREAD_PREV))    fprintf (stderr, "\n%*s", depth, "");    if (node == root) fputs ("root=", stderr);    fprintf (stderr, "%p/%c",    node, node->flags & RB_RED ? 'R' : 'B');    if (dump_data) {    fputs (": ", stderr);    dump_data (node, extra);    } +  if (node->prev && node->prev == node->next) +  fputs (" [prev == next]", stderr);    }, { /* next is leaf. */    p = rbstack;    n2 = node;    RBSTACK_UP (p, n);    while (n && (n->flags & RB_THREAD_PREV || n->prev != n2)) {    n2 = n;    RBSTACK_UP (p, n);    }    if (node->next != n)    fprintf (stderr, "\n%*s[Thread ptr is %p, expected %p]",