| 1 | #include "cll1.h" |
| 2 | |
| 3 | def_mem(Leaf) |
| 4 | { |
| 5 | int seq; |
| 6 | array(Leaf); |
| 7 | }; |
| 8 | |
| 9 | program |
| 10 | { |
| 11 | Leaf leaf,root=NULL; |
| 12 | int newkey; |
| 13 | int seq=0; |
| 14 | int odd=1; |
| 15 | |
| 16 | print("Input values:"); |
| 17 | for_ints(newkey, 8,1,-2,745,-32,-64,27,4,-300,0,300,40,-30,-40,400, 200 ) |
| 18 | { |
| 19 | printf("%d. [%d]\n",seq,newkey); |
| 20 | |
| 21 | leaf=get_mem(Leaf); |
| 22 | leaf->seq=seq++; |
| 23 | |
| 24 | //store(leaf,root,newkey) is declared as: |
| 25 | |
| 26 | //init |
| 27 | leaf->__next=NULL; |
| 28 | leaf->__seek=NULL; |
| 29 | leaf->__key=newkey; |
| 30 | |
| 31 | //store new node without indexing, first |
| 32 | insert(leaf,root,order_by_num,__key); |
| 33 | |
| 34 | //reindex B+ tree |
| 35 | for(leaf=root;leaf->__next;leaf=leaf->__next) |
| 36 | { |
| 37 | //auto seek |
| 38 | if(!leaf->__seek && leaf->__next) |
| 39 | leaf->__seek=leaf->__next->__next; |
| 40 | |
| 41 | if(leaf->__key<=newkey) |
| 42 | { |
| 43 | if(leaf->__seek && leaf->__seek->__key>newkey) leaf->__seek=leaf->__seek->__next; |
| 44 | } |
| 45 | else |
| 46 | { |
| 47 | if(odd && leaf->__seek) |
| 48 | { |
| 49 | leaf->__seek==leaf->__seek->__next; |
| 50 | } |
| 51 | else |
| 52 | { |
| 53 | leaf->__seek=leaf->__next->__seek; |
| 54 | leaf->__next->__seek=NULL; |
| 55 | } |
| 56 | odd=1-odd; |
| 57 | } |
| 58 | } |
| 59 | } |
| 60 | |
| 61 | print("Values were stored as:"); |
| 62 | for_each(leaf,root) |
| 63 | { |
| 64 | printf("%d. [%d]",leaf->seq,leaf->__key); |
| 65 | if (leaf->__seek) |
| 66 | printf("-> %d. [%d]\n",leaf->__seek->seq,leaf->__seek->__key); |
| 67 | else |
| 68 | print(""); |
| 69 | } |
| 70 | } |