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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
/*
* Copyright (c) International Business Machines Corp., 2014
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/*
* File: vector_iter.c
* Author: Shaun Wetzstein <shaun@us.ibm.com>
* Descr: dynamic array
* Note:
* Date: 10/22/10
*/
#include <unistd.h>
#include <stdarg.h>
#include <stdlib.h>
#include <malloc.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <limits.h>
#include "libclib.h"
#include "vector_iter.h"
/* ======================================================================= */
static inline const void *__vector_iter_bwd(vector_iter_t * self)
{
size_t low = 0;
const void *ret = NULL;
if (low < self->idx)
self->idx--;
if (low < self->idx)
ret = vector_at(self->vector, self->idx);
return ret;
}
static inline const void *__vector_iter_fwd(vector_iter_t * self)
{
size_t high = vector_size(self->vector);
const void *ret = NULL;
if (self->idx < high)
self->idx++;
if (self->idx < high)
ret = vector_at(self->vector, self->idx);
return ret;
}
int vector_iter_init(vector_iter_t * self, vector_t * vector, uint32_t flags)
{
assert(self != NULL);
assert(vector != NULL);
self->flags = flags;
self->vector = vector;
if (self->flags & VI_FLAG_BWD) {
self->idx = vector_size(self->vector);
__vector_iter_bwd(self);
} else {
self->idx = 0;
}
return 0;
}
int vector_iter_clear(vector_iter_t * self)
{
assert(self != NULL);
if (self->flags & VI_FLAG_BWD)
self->idx = vector_size(self->vector);
else
self->idx = 0;
self->vector = NULL;
return 0;
}
const void *vector_iter_elem(vector_iter_t * self)
{
assert(self != NULL);
if (vector_capacity(self->vector) <= self->idx) {
UNEXPECTED("'%d' index out-of-range", self->idx);
return NULL;
}
if (vector_size(self->vector) <= self->idx)
return NULL;
return vector_at(self->vector, self->idx);
}
const void *vector_iter_inc1(vector_iter_t * self)
{
return vector_iter_inc2(self, 1);
}
const void *vector_iter_inc2(vector_iter_t * self, size_t count)
{
assert(self != NULL);
const void *ret = NULL;
for (size_t i = 0; i < count; i++) {
if (self->flags & VI_FLAG_BWD)
ret = __vector_iter_bwd(self);
else
ret = __vector_iter_fwd(self);
}
return ret;
}
const void *vector_iter_dec1(vector_iter_t * self)
{
return vector_iter_dec2(self, 1);
}
const void *vector_iter_dec2(vector_iter_t * self, size_t count)
{
assert(self != NULL);
const void *ret = NULL;
for (size_t i = 0; i < count; i++) {
if (self->flags & VI_FLAG_BWD)
ret = __vector_iter_fwd(self);
else
ret = __vector_iter_bwd(self);
}
return ret;
}
size_t vector_iter_pos1(vector_iter_t * self)
{
assert(self != NULL);
return self->idx;
}
int vector_iter_pos2(vector_iter_t * self, size_t pos)
{
assert(self != NULL);
if (vector_size(self->vector) <= pos) {
UNEXPECTED("'%d' index out-of-range", pos);
return -1;
}
self->idx = pos;
return 0;
}
/* ======================================================================= */
|
