diff options
| author | Tyge Løvset <[email protected]> | 2021-05-20 17:46:35 +0200 |
|---|---|---|
| committer | Tyge Løvset <[email protected]> | 2021-05-20 17:46:35 +0200 |
| commit | 0c64fe64f7fb3df211e87094962e1c2a9e08a6c8 (patch) | |
| tree | 2d659b26edebdd5a41635cc3a85ca36817bc4cf2 /include/stc/cqueue.h | |
| parent | 079aa69a085ddb478c15f20f6f0f4b0d790022b8 (diff) | |
| download | STC-modified-0c64fe64f7fb3df211e87094962e1c2a9e08a6c8.tar.gz STC-modified-0c64fe64f7fb3df211e87094962e1c2a9e08a6c8.zip | |
Moved stc folder into include folder.
Diffstat (limited to 'include/stc/cqueue.h')
| -rw-r--r-- | include/stc/cqueue.h | 93 |
1 files changed, 93 insertions, 0 deletions
diff --git a/include/stc/cqueue.h b/include/stc/cqueue.h new file mode 100644 index 00000000..37d18fba --- /dev/null +++ b/include/stc/cqueue.h @@ -0,0 +1,93 @@ +/* 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 CQUEUE_H_INCLUDED
+#define CQUEUE_H_INCLUDED
+
+/* Queue adapter, default uses clist.
+
+ #include <stc/crandom.h>
+ #include <stc/cqueue.h>
+ using_cdeq(i, int);
+ using_cqueue(i, cdeq_i);
+
+ int main() {
+ int n = 10000000;
+ stc64_t rng = stc64_init(1234);
+ stc64_uniform_t dist = stc64_uniform_init(rng, 0, n);
+
+ c_with (cqueue_i queue = cqueue_i_init(), cqueue_i_del(&queue))
+ {
+ // Push ten million random numbers onto the queue.
+ for (int i=0; i<n; ++i)
+ cqueue_i_push(&queue, stc64_uniform(&dist));
+
+ // Push or pop on the queue ten million times
+ printf("%d\n", n);
+ for (int i=n; i>0; --i) {
+ int r = stc64_uniform(&dist);
+ if (r & 1)
+ ++n, cqueue_i_push(&queue, r);
+ else
+ --n, cqueue_i_pop(&queue);
+ }
+ }
+ printf("%d\n", n);
+ }
+*/
+#include "cdeq.h"
+
+#define using_cqueue(X, ctype) \
+ _c_using_cqueue(cqueue_##X, ctype)
+
+#define _c_using_cqueue(CX, ctype) \
+ typedef ctype CX; \
+ typedef ctype##_value_t CX##_value_t; \
+ typedef ctype##_rawvalue_t CX##_rawvalue_t; \
+ typedef ctype##_iter_t CX##_iter_t; \
+\
+ STC_INLINE CX CX##_init(void) {return ctype##_init();} \
+ STC_INLINE CX CX##_clone(CX q) {return ctype##_clone(q);} \
+ STC_INLINE CX##_value_t CX##_value_clone(CX##_value_t val) \
+ {return ctype##_value_clone(val);} \
+ STC_INLINE void CX##_clear(CX* self) {ctype##_clear(self);} \
+ STC_INLINE void CX##_del(CX* self) {ctype##_del(self);} \
+\
+ STC_INLINE size_t CX##_size(CX q) {return ctype##_size(q);} \
+ STC_INLINE bool CX##_empty(CX q) {return ctype##_empty(q);} \
+ STC_INLINE CX##_value_t* CX##_front(const CX* self) {return ctype##_front(self);} \
+ STC_INLINE CX##_value_t* CX##_back(const CX* self) {return ctype##_back(self);} \
+\
+ STC_INLINE void CX##_pop(CX* self) {ctype##_pop_front(self);} \
+ STC_INLINE void CX##_push(CX* self, ctype##_value_t value) \
+ {ctype##_push_back(self, value);} \
+ STC_INLINE void CX##_emplace(CX* self, CX##_rawvalue_t raw) \
+ {ctype##_emplace_back(self, raw);} \
+ STC_INLINE void CX##_emplace_items(CX *self, const CX##_rawvalue_t arr[], size_t n) \
+ {ctype##_emplace_items(self, arr, n);} \
+\
+ STC_INLINE CX##_iter_t CX##_begin(const CX* self) {return ctype##_begin(self);} \
+ STC_INLINE CX##_iter_t CX##_end(const CX* self) {return ctype##_end(self);} \
+ STC_INLINE void CX##_next(CX##_iter_t* it) {ctype##_next(it);} \
+ struct stc_trailing_semicolon
+
+#endif
|