1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
/*
* node_iterator.h
*
* Created on: Mar 8, 2011
* Author: posixninja
*
* Copyright (c) 2011 Joshua Hill. All Rights Reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef NODE_ITERATOR_H_
#define NODE_ITERATOR_H_
#include "iterator.h"
#include "node_list.h"
// This class implements the abstract iterator class
typedef struct node_iterator_t {
// Super class
struct iterator_t super;
// Local members
struct node_t*(*next)(struct node_iterator_t* iterator);
int(*bind)(struct node_iterator_t* iterator, struct node_list_t* list);
unsigned int count;
unsigned int position;
struct node_list_t* list;
struct node_t* end;
struct node_t* begin;
struct node_t* value;
} node_iterator_t;
void node_iterator_destroy(node_iterator_t* iterator);
node_iterator_t* node_iterator_create(node_list_t* list);
struct node_t* node_iterator_next(struct node_iterator_t* iterator);
int node_iterator_bind(struct node_iterator_t* iterator, struct node_list_t* list);
#endif /* NODE_ITERATOR_H_ */
|
