| 7 |
7u83 |
1 |
/*
|
|
|
2 |
* Copyright 2019, The PLANIX Project
|
|
|
3 |
*
|
|
|
4 |
* Redistribution and use in source and binary forms, with or without
|
|
|
5 |
* modification, are permitted provided that the following conditions are
|
|
|
6 |
* met:
|
|
|
7 |
*
|
|
|
8 |
* 1. Redistributions of source code must retain the above copyright notice,
|
|
|
9 |
* this list of conditions and the following disclaimer.
|
|
|
10 |
*
|
|
|
11 |
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
12 |
* notice, this list of conditions and the following disclaimer in the
|
|
|
13 |
* documentation and/or other materials provided with the distribution.
|
|
|
14 |
*
|
|
|
15 |
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
|
|
|
16 |
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
|
|
|
17 |
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
|
18 |
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
|
|
|
19 |
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
|
20 |
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
|
21 |
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
|
22 |
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|
|
23 |
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
|
24 |
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
|
25 |
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
26 |
*/
|
|
|
27 |
/**
|
|
|
28 |
*@file
|
|
|
29 |
*@brief Implementation of mavliter_next
|
|
|
30 |
*/
|
|
|
31 |
|
|
|
32 |
#include "mavl.h"
|
|
|
33 |
|
|
|
34 |
/**
|
|
|
35 |
* Get the next element within an AVL Tree.
|
|
|
36 |
* @param i pointer to AVL Iterator
|
|
|
37 |
* @return the element or NULL if there is no next elemeent.
|
|
|
38 |
*/
|
|
|
39 |
|
|
|
40 |
void *
|
|
|
41 |
mavliter_next ( struct mavliter *i )
|
|
|
42 |
{
|
|
|
43 |
while ( i->stack_ptr ) {
|
|
|
44 |
i->stack_ptr--;
|
|
|
45 |
i->cur = i->stack[i->stack_ptr];
|
|
|
46 |
|
|
|
47 |
if ( !i->cur )
|
|
|
48 |
continue;
|
|
|
49 |
|
|
|
50 |
if ( ( i->stack_ptr ) & 1 )
|
|
|
51 |
return mavlnode_dataptr ( i->cur );
|
|
|
52 |
|
|
|
53 |
break;
|
|
|
54 |
}
|
|
|
55 |
|
|
|
56 |
|
|
|
57 |
if ( !i->cur )
|
|
|
58 |
return NULL;
|
|
|
59 |
|
| 40 |
7u83 |
60 |
while ( i->cur->s[0] ) {
|
| 7 |
7u83 |
61 |
|
| 40 |
7u83 |
62 |
/* push s[1] branch */
|
|
|
63 |
i->stack[i->stack_ptr++] = i->cur->s[1];
|
| 7 |
7u83 |
64 |
|
|
|
65 |
/* push node */
|
|
|
66 |
i->stack[i->stack_ptr++] = i->cur;
|
|
|
67 |
|
| 40 |
7u83 |
68 |
i->cur = i->cur->s[0];
|
| 7 |
7u83 |
69 |
}
|
|
|
70 |
|
| 40 |
7u83 |
71 |
i->stack[i->stack_ptr++] = i->cur->s[1];
|
| 7 |
7u83 |
72 |
|
|
|
73 |
return mavlnode_dataptr ( i->cur );
|
|
|
74 |
|
|
|
75 |
}
|
|
|
76 |
|