do not compile yet

[svn/Cll1h/.git] / demos / trees.c

#include "cll1.h"

def_mem(Leaf)
{
 int value; 
 array(Leaf);
};

program
{ 
 Leaf leaf,root=NULL;
 int newkey;

 for_ints(newkey,  8,1,-2,745,-32,-64,27,4 ) printf(" [%d]",i)
 {
  leaf=get_mem(Leaf);

  //init
  leaf->__next=NULL;
  leaf->__seek=NULL;
  leaf->__key=newkey;

  //grow tree
  {
    void *prev=NULL, *newleaf=leaf;
    //find where to store
    for(leaf=root; leaf && leaf->__key<=newkey ; leaf=leaf->__next)
    {
     prev=leaf;
     if(leaf->__seek && leaf->__seek->key<=newkey) leaf=leaf->__seek;
    }
    //store new node
    leaf=newleaf;
    if(prev)
    {
     leaf->__next=prev->__next->__next;
     prev->__next=leaf;
    }
    else
     leaf->__next=root;
    //auto seek
    if(leaf->__next->__next;)
     leaf->__seek=leaf->__next->__next;
    
    //reindex B+ tree
    for(leaf=root; leaf->__next ; leaf=leaf->__next)
    {
     if (leaf->__seek) 
     {
      if (leaf->__key <= newkey)
       leaf->__seek=leaf->__seek->__next;
     }
     else 
       leaf->__seek=leaf->__next->__seek;
    }
  }
 } 
}