aboutsummaryrefslogtreecommitdiff
path: root/deque.c
diff options
context:
space:
mode:
authorThomas Schmucker <ts@its1.de>2020-08-14 18:27:17 +0200
committerThomas Schmucker <ts@its1.de>2020-08-14 18:27:17 +0200
commit327da44ec896f65c12befb5872ce364d0a1fd074 (patch)
tree145ba6f09b714bb32f0d85a81f19c6e46663926f /deque.c
parent1e6334eaa1ae4423061cea0455b08d6e096001f3 (diff)
downloaddata-structures-327da44ec896f65c12befb5872ce364d0a1fd074.tar.gz
data-structures-327da44ec896f65c12befb5872ce364d0a1fd074.tar.bz2
data-structures-327da44ec896f65c12befb5872ce364d0a1fd074.zip
Überflüssige Klammern entfernt
Diffstat (limited to 'deque.c')
-rw-r--r--deque.c10
1 files changed, 5 insertions, 5 deletions
diff --git a/deque.c b/deque.c
index eab623b..56df165 100644
--- a/deque.c
+++ b/deque.c
@@ -55,7 +55,7 @@ static void
55grow_map(struct deque *d) 55grow_map(struct deque *d)
56{ 56{
57 const size_t capacity = d->map_capacity + d->map_capacity / 2; 57 const size_t capacity = d->map_capacity + d->map_capacity / 2;
58 T ** map = calloc(map_capacity, sizeof *map); 58 T ** map = calloc(capacity, sizeof *map);
59 59
60 // copy elements 60 // copy elements
61 size_t i; 61 size_t i;
@@ -143,7 +143,7 @@ deque_get_at(struct deque *d, size_t idx, T *data)
143{ 143{
144 const size_t offset = d->offset + idx; 144 const size_t offset = d->offset + idx;
145 const size_t chunk_off = offset % CHUNK_CAPACITY; 145 const size_t chunk_off = offset % CHUNK_CAPACITY;
146 const size_t chunk_num = ((offset / CHUNK_CAPACITY) + d->map_begin) % d->map_capacity; 146 const size_t chunk_num = (offset / CHUNK_CAPACITY + d->map_begin) % d->map_capacity;
147 147
148 *data = d->map[chunk_num][chunk_off]; 148 *data = d->map[chunk_num][chunk_off];
149} 149}
@@ -153,11 +153,11 @@ deque_push_back(struct deque *d, T data)
153{ 153{
154 const size_t offset = d->offset + d->size; 154 const size_t offset = d->offset + d->size;
155 const size_t chunk_off = offset % CHUNK_CAPACITY; 155 const size_t chunk_off = offset % CHUNK_CAPACITY;
156 size_t chunk_num = ((offset / CHUNK_CAPACITY) + d->map_begin) % d->map_capacity; 156 size_t chunk_num = (offset / CHUNK_CAPACITY + d->map_begin) % d->map_capacity;
157 157
158 if ( chunk_num == d->map_end ) { 158 if ( chunk_num == d->map_end ) {
159 map_append_chunk(d); 159 map_append_chunk(d);
160 chunk_num = ((offset / CHUNK_CAPACITY) + d->map_begin) % d->map_capacity; 160 chunk_num = (offset / CHUNK_CAPACITY + d->map_begin) % d->map_capacity;
161 } 161 }
162 162
163 d->map[chunk_num][chunk_off] = data; 163 d->map[chunk_num][chunk_off] = data;
@@ -171,7 +171,7 @@ deque_pop_front(struct deque *d, T *data)
171 return false; 171 return false;
172 172
173 const size_t chunk_off = d->offset % CHUNK_CAPACITY; 173 const size_t chunk_off = d->offset % CHUNK_CAPACITY;
174 const size_t chunk_num = ((d->offset / CHUNK_CAPACITY) + d->map_begin) % d->map_capacity; 174 const size_t chunk_num = (d->offset / CHUNK_CAPACITY + d->map_begin) % d->map_capacity;
175 175
176 *data = d->map[chunk_num][chunk_off]; 176 *data = d->map[chunk_num][chunk_off];
177 177