Mercurial > hg > CbC > old > akasha
view src/insert_verification/include/akashaLLRBContext.h @ 11:b13d2c8d4b47
Fix iterator
author | Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp> |
---|---|
date | Wed, 16 Mar 2016 17:19:50 +0900 |
parents | e864ede359cc |
children | f0a1f02e8493 |
line wrap: on
line source
/* Context definition for llrb example */ #include "stack.h" #define ALLOCATE_SIZE 1000 #define LIMIT_OF_VERIFICATION_SIZE 16 enum Code { InsertOnce, ShowTree, IterateInsertion, /* definitions from llrb */ Allocator, Put, Replace, Insert, Compare, RotateL, RotateR, SetTree, InsertCase1, InsertCase2, InsertCase3, InsertCase4, InsertCase4_1, InsertCase4_2, InsertCase5, StackClear, Get, Search, Delete, Delete1, Delete2, Delete3, Replace_d1, Replace_d2, FindMax1, FindMax2, DeleteCase1, DeleteCase2, DeleteCase3, DeleteCase4, DeleteCase5, DeleteCase6, Exit, }; enum Relational { EQ, GT, LT, }; enum UniqueData { Allocate, Tree, Node, Iter, }; struct Context { enum Code next; int codeNum; __code (**code) (struct Context*); void* heapStart; void* heap; long heapLimit; int dataNum; stack_ptr code_stack; stack_ptr node_stack; union Data **data; }; union Data { struct Comparable { // inteface enum Code compare; union Data* data; } compare; struct Count { enum Code next; long i; } count; struct Tree { enum Code next; struct Node* root; struct Node* current; struct Node* deleted; int result; } tree; struct Node { // need to tree enum Code next; int key; // comparable data segment int value; struct Node* left; struct Node* right; // need to balancing enum Color { Red, Black, } color; } node; struct Allocate { enum Code next; long size; } allocate; /* for verification */ struct IterElem { unsigned int val; struct IterElem* next; } iterElem; struct Iterator { struct Tree* tree; struct Iterator* previousDepth; struct IterElem* head; struct IterElem* last; } iterator; };