| [1] | 1 | /* Copyright (c) 2007-2009, Stanford University |
|---|
| 2 | * All rights reserved. |
|---|
| 3 | * |
|---|
| 4 | * Redistribution and use in source and binary forms, with or without |
|---|
| 5 | * modification, are permitted provided that the following conditions are met: |
|---|
| 6 | * * Redistributions of source code must retain the above copyright |
|---|
| 7 | * notice, this list of conditions and the following disclaimer. |
|---|
| 8 | * * Redistributions in binary form must reproduce the above copyright |
|---|
| 9 | * notice, this list of conditions and the following disclaimer in the |
|---|
| 10 | * documentation and/or other materials provided with the distribution. |
|---|
| 11 | * * Neither the name of Stanford University nor the names of its |
|---|
| 12 | * contributors may be used to endorse or promote products derived from |
|---|
| 13 | * this software without specific prior written permission. |
|---|
| 14 | * |
|---|
| 15 | * THIS SOFTWARE IS PROVIDED BY STANFORD UNIVERSITY ``AS IS'' AND ANY |
|---|
| 16 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|---|
| 17 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|---|
| 18 | * DISCLAIMED. IN NO EVENT SHALL STANFORD UNIVERSITY BE LIABLE FOR ANY |
|---|
| 19 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|---|
| 20 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
|---|
| 21 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
|---|
| 22 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|---|
| 23 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
|---|
| 24 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|---|
| 25 | */ |
|---|
| 26 | |
|---|
| 27 | #ifndef ITERATOR_H_ |
|---|
| 28 | #define ITERATOR_H_ |
|---|
| 29 | |
|---|
| 30 | #include "struct.h" |
|---|
| 31 | |
|---|
| 32 | struct iterator_t |
|---|
| 33 | { |
|---|
| 34 | keyvals_t **list_array; |
|---|
| 35 | int max_list; |
|---|
| 36 | int next_insert_pos; |
|---|
| 37 | int current_list; |
|---|
| 38 | int current_index; |
|---|
| 39 | val_t *val; |
|---|
| 40 | int size; |
|---|
| 41 | }; |
|---|
| 42 | |
|---|
| 43 | inline int iter_init (struct iterator_t *, int); |
|---|
| 44 | inline void iter_reset (struct iterator_t *); |
|---|
| 45 | inline void iter_rewind (struct iterator_t *); |
|---|
| 46 | inline int iter_next_list (struct iterator_t *, keyvals_t **); |
|---|
| 47 | inline void iter_finalize (struct iterator_t *); |
|---|
| 48 | |
|---|
| 49 | inline int iter_add (struct iterator_t *, keyvals_t *); |
|---|
| 50 | |
|---|
| 51 | #endif /* ITERATOR_H_ */ |
|---|
