data_structures_rmolinari 0.5.0 → 0.5.1

data/ext/shared.h

@@ -0,0 +1,33 @@
+#ifndef SHARED_H
+#define SHARED_H
+
+#include <stddef.h>
+#include "ruby.h"
+
+#define mShared rb_define_module("Shared")
+#define eSharedDataError rb_const_get(mShared, rb_intern_const("DataError"))
+#define eSharedInternalLogicError rb_const_get(mShared, rb_intern_const("InternalLogicError"))
+#define mDataStructuresRMolinari rb_define_module("DataStructuresRMolinari")
+
+//#define debug(...) printf(__VA_ARGS__)
+#define debug(...)
+
+/* What we might think of as vector[index]. It is assignable */
+#define lval(vector, index) (*get(vector, index))
+
+/*
+ * Binary tree arithmetic for an implicit tree in an array, 1-based.
+ *
+ * TODO: into shared header
+ */
+#define TREE_ROOT 1
+size_t midpoint(size_t left, size_t right);
+size_t left_child(size_t i);
+size_t right_child(size_t i);
+
+/*
+ * Check that a Ruby value is a non-negative Fixnum and convert it to a C unsigned long
+ */
+unsigned long checked_nonneg_fixnum(VALUE val);
+
+#endif

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: data_structures_rmolinari
 version: !ruby/object:Gem::Version
-  version: 0.5.0
+  version: 0.5.1
 platform: ruby
 authors:
 - Rory Molinari
@@ -89,7 +89,9 @@ files:
 - ext/c_disjoint_union/extconf.rb
 - ext/c_segment_tree_template/extconf.rb
 - ext/c_segment_tree_template/segment_tree_template.c
+- ext/cc.h
 - ext/shared.c
+- ext/shared.h
 - lib/data_structures_rmolinari.rb
 - lib/data_structures_rmolinari/algorithms.rb
 - lib/data_structures_rmolinari/c_segment_tree_template_impl.rb