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
|
/* MIT License
*
* Copyright (c) 2021 Tyge Løvset, NORCE, www.norceresearch.no
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#ifndef CPQUE_H_INCLUDED
#define CPQUE_H_INCLUDED
#include <stdlib.h>
#include "ccommon.h"
#include "forward.h"
#endif
#define i_module cpque
#include "template.h"
#if !defined i_fwd
cx_deftypes(_c_cpque_types, Self, i_val);
#endif
typedef i_valraw cx_rawvalue_t;
STC_API void cx_memb(_make_heap)(Self* self);
STC_API void cx_memb(_erase_at)(Self* self, size_t idx);
STC_API void cx_memb(_push)(Self* self, cx_value_t value);
STC_API void cx_memb(_emplace_items)(Self *self, const cx_rawvalue_t arr[], size_t n);
STC_API Self cx_memb(_clone)(Self q);
STC_INLINE Self cx_memb(_init)(void)
{ return (Self){0, 0, 0}; }
STC_INLINE void cx_memb(_clear)(Self* self)
{ while (self->size) i_valdel(&self->data[--self->size]); }
STC_INLINE size_t cx_memb(_size)(Self q)
{ return q.size; }
STC_INLINE bool cx_memb(_empty)(Self q)
{ return !q.size; }
STC_INLINE size_t cx_memb(_capacity)(Self q)
{ return q.capacity; }
STC_INLINE void cx_memb(_pop)(Self* self)
{ cx_memb(_erase_at)(self, 0); }
STC_INLINE cx_value_t* cx_memb(_top)(const Self* self)
{ return &self->data[0]; }
STC_INLINE void cx_memb(_push_back_)(Self* self, cx_value_t value) {
if (self->size == self->capacity)
self->data = realloc(self->data, (self->capacity = self->size*3/2 + 4)*sizeof value);
self->data[ self->size++ ] = value;
}
STC_INLINE void cx_memb(_emplace)(Self* self, cx_rawvalue_t raw)
{ cx_memb(_push)(self, i_valfrom(raw)); }
STC_INLINE void cx_memb(_del)(Self* self)
{ cx_memb(_clear)(self); free(self->data); }
STC_INLINE int cx_memb(_value_compare)(const cx_value_t* x, const cx_value_t* y) {
cx_rawvalue_t rx = i_valto(x), ry = i_valto(y);
return i_cmp(&rx, &ry);
}
/* -------------------------- IMPLEMENTATION ------------------------- */
#if !defined(STC_HEADER) || defined(STC_IMPLEMENTATION) || defined(i_imp)
STC_API void
cx_memb(_sift_down_)(cx_value_t* arr, size_t i, size_t n) {
size_t r = i, c = i << 1;
while (c <= n) {
c += (c < n && i_cmp(&arr[c], &arr[c + 1]) < 0);
if (i_cmp(&arr[r], &arr[c]) < 0) {
cx_value_t tmp = arr[r]; arr[r] = arr[c]; arr[r = c] = tmp;
} else
return;
c <<= 1;
}
}
STC_API void
cx_memb(_make_heap)(Self* self) {
size_t n = cx_memb(_size)(*self);
cx_value_t *arr = self->data - 1;
for (size_t k = n >> 1; k != 0; --k)
cx_memb(_sift_down_)(arr, k, n);
}
STC_API Self cx_memb(_clone)(Self q) {
Self out = {(cx_value_t*) c_malloc(q.size*sizeof(cx_value_t)), q.size, q.size};
for (cx_value_t *a = out.data, *b = a + q.size; a != b; ++a) *a = i_valfrom(i_valto(q.data++));
return out;
}
STC_API void
cx_memb(_erase_at)(Self* self, size_t idx) {
size_t n = cx_memb(_size)(*self) - 1;
self->data[idx] = self->data[n];
--self->size;
cx_memb(_sift_down_)(self->data - 1, idx + 1, n);
}
STC_API void
cx_memb(_push)(Self* self, cx_value_t value) {
cx_memb(_push_back_)(self, value); /* sift-up the value */
size_t n = cx_memb(_size)(*self), c = n;
cx_value_t *arr = self->data - 1;
for (; c > 1 && i_cmp(&arr[c >> 1], &value) < 0; c >>= 1)
arr[c] = arr[c >> 1];
if (c != n) arr[c] = value;
}
STC_API void
cx_memb(_emplace_items)(Self *self, const cx_rawvalue_t arr[], size_t n) {
for (size_t i = 0; i < n; ++i)
cx_memb(_push)(self, i_valfrom(arr[i]));
}
#endif
#include "template.h"
|
