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
|
/* 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.
*/
/* Priority-Queue adapter (implemented as heap), default uses cvec.
#include <stc/crandom.h>
#include <stc/cpque.h>
using_cvec(f, float);
using_cpque(f, cvec_f, -c_default_compare); // min-heap (increasing values)
int main() {
stc64_t rng = stc64_init(1234);
stc64_uniformf_t dist = stc64_uniformf_init(10.0f, 100.0f);
c_forvar (cpque_f queue = cpque_f_init(), cpque_f_del(&queue))
{
// Push ten million random numbers onto the queue.
for (int i=0; i<10000000; ++i)
cpque_f_push(&queue, stc64_uniformf(&rng, dist));
// Extract the 100 smallest.
for (int i=0; i<100; ++i) {
printf("%f ", *cpque_f_top(queue));
cpque_f_pop(&queue);
}
}
}
*/
#ifndef CPQUEUE_H_INCLUDED
#define CPQUEUE_H_INCLUDED
#include "cvec.h"
#define using_cpque(...) c_MACRO_OVERLOAD(using_cpque, __VA_ARGS__)
#define using_cpque_2(X, ctype) \
_c_using_cpque(cpque_##X, ctype, ctype##_value_compare)
#define using_cpque_3(X, ctype, i_CMP) \
_c_using_cpque(cpque_##X, ctype, i_CMP)
#define _c_using_cpque(Self, ctype, i_CMP) \
typedef ctype Self; \
typedef ctype##_value_t cx_value_t; \
typedef ctype##_rawvalue_t cx_rawvalue_t; \
\
STC_INLINE Self cx_memb(_init)(void) { return ctype##_init(); } \
STC_INLINE Self cx_memb(_clone)(Self pq) { return ctype##_clone(pq); } \
STC_INLINE cx_value_t cx_memb(_value_clone)(cx_value_t val) \
{ return ctype##_value_clone(val); } \
STC_INLINE void cx_memb(_clear)(Self* self) {ctype##_clear(self); } \
STC_INLINE void cx_memb(_del)(Self* self) {ctype##_del(self); } \
\
STC_INLINE size_t cx_memb(_size)(Self pq) { return ctype##_size(pq); } \
STC_INLINE bool cx_memb(_empty)(Self pq) { return ctype##_empty(pq); } \
\
STC_API void cx_memb(_make_heap)(Self* self); \
STC_API void cx_memb(_erase_at)(Self* self, size_t idx); \
STC_INLINE \
const cx_value_t* cx_memb(_top)(const Self* self) { return &self->data[0]; } \
STC_INLINE void cx_memb(_pop)(Self* self) { cx_memb(_erase_at)(self, 0); } \
\
STC_API void cx_memb(_push)(Self* self, cx_value_t value); \
STC_INLINE void cx_memb(_emplace)(Self* self, cx_rawvalue_t raw) \
{ cx_memb(_push)(self, ctype##_value_fromraw(raw)); } \
STC_API void cx_memb(_emplace_items)(Self *self, const cx_rawvalue_t arr[], size_t n); \
\
_c_implement_cpque(Self, ctype, i_CMP) \
struct stc_trailing_semicolon
/* -------------------------- IMPLEMENTATION ------------------------- */
#if !defined(STC_HEADER) || defined(STC_IMPLEMENTATION)
#define _c_implement_cpque(Self, ctype, i_CMP) \
\
STC_INLINE 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 void \
cx_memb(_erase_at)(Self* self, size_t idx) { \
size_t n = cx_memb(_size)(*self) - 1; \
self->data[idx] = self->data[n]; \
ctype##_pop_back(self); \
cx_memb(_sift_down_)(self->data - 1, idx + 1, n); \
} \
\
STC_API void \
cx_memb(_push)(Self* self, cx_value_t value) { \
ctype##_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, ctype##_value_fromraw(arr[i])); \
} \
#else
#define _c_implement_cpque(Self, ctype, i_CMP)
#endif
#endif
|
