rb_lovely 0.5.0 → 0.6.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: fc4258b3c5efab8a5b29067b61e51c0c9660de33
-  data.tar.gz: 1065affd37a40bde5b1b188c64fd0b69a6aadd99
+  metadata.gz: a101665aa179ecfdd7edfce739f5f2feee1af73d
+  data.tar.gz: 819f929306b9aeef392d0325e311badac9e4c019
 SHA512:
-  metadata.gz: f5fdd5429e26c7beeb8d37be5e614f2b553a6d21bcd7784f39e538be882c00748c90d47da312412b538ec43095d3f92e4b67da70ff54d20d16449141d080a4c8
-  data.tar.gz: 80d8f021ca4f675b336838893f9f5b5dcd2d29d74c536d83edc59908071a838399115f30c808f8784eae18220a55f5892be22d8371588c7cc22573df665753f1
+  metadata.gz: 26d39b7cee7223eb6e66cd5e7fecac58e59fcc3e9880e24c3c120e582ca590492d2f38fab8607ee03be02eca2747327841d6238cbda17db94cdd3f2aee0e035f
+  data.tar.gz: ba9d4986fce10cf32ea1c268cfa5e85301d28baa1d547646d1d9b4fe87167374d496e53ff806c43cd4c837a5d74f39319089872201f3396c6a63d4e9c3ea7636

data/ext/rb_lovely/container.hpp

@@ -1,10 +1,12 @@
-#ifndef RB_LOVELY_SETS_CONTAINER_HPP
-#define RB_LOVELY_SETS_CONTAINER_HPP
+#ifndef RB_LOVELY_CONTAINER_HPP
+#define RB_LOVELY_CONTAINER_HPP
 
 #include "ruby_util.hpp"
 
 namespace rb_lovely {
 
+// TODO: No more toS, provide inspect instead which is what the containers should be using
+//       for each member.
 auto toS = [](VALUE val) { return RSTRING_PTR(rb_funcall(val, to_sSym, 0)); };
 
 }

data/ext/rb_lovely/extconf.rb

@@ -2,6 +2,8 @@ require 'mkmf'
 $CPPFLAGS += ' -std=c++0x'
 with_cflags('-x c++') do
   # needed for SortedHash, optional
-  have_header('boost/multi_index_container.hpp')
+  unless have_header 'boost/multi_index_container.hpp'
+    warn 'Could not find boost, disabling SortedHash'
+  end
 end
 create_makefile('rb_lovely')

data/ext/rb_lovely/ruby_util.hpp

@@ -1,5 +1,5 @@
-#ifndef RB_LOVELY_SETS_UTIL_HPP
-#define RB_LOVELY_SETS_UTIL_HPP
+#ifndef RB_LOVELY_UTIL_HPP
+#define RB_LOVELY_UTIL_HPP
 #include "ruby.h"
 
 namespace rb_lovely {

data/ext/rb_lovely/sorted_hash.cpp

@@ -183,7 +183,7 @@ VALUE hashLast(VALUE self) {
   return last->val;
 }
 
-VALUE hashMutatingDelete(VALUE self, VALUE toDelete) {
+VALUE hashDelete(VALUE self, VALUE toDelete) {
   Hash* hash = rubyCast<Hash>(self);
   auto it = hash->container.find(toDelete);
   if (it == hash->container.end()) {
@@ -256,7 +256,7 @@ extern "C" {
     rb_define_method(rbHash, "to_s", RUBY_METHOD_FUNC(hashToString), 0);
     rb_define_method(rbHash, "first", RUBY_METHOD_FUNC(hashFirst), 0);
     rb_define_method(rbHash, "last", RUBY_METHOD_FUNC(hashLast), 0);
-    rb_define_method(rbHash, "delete", RUBY_METHOD_FUNC(hashMutatingDelete), 1);
+    rb_define_method(rbHash, "delete", RUBY_METHOD_FUNC(hashDelete), 1);
     // rb_define_method(rbHash, "reject!", RUBY_METHOD_FUNC(hashMutatingReject), 0);
     // rb_define_method(rbHash, "reject_first!", RUBY_METHOD_FUNC(hashMutatingRejectFirst), 0);
     // rb_define_method(rbHash, "select!", RUBY_METHOD_FUNC(hashMutatingSelect), 0);

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rb_lovely
 version: !ruby/object:Gem::Version
-  version: 0.5.0
+  version: 0.6.1
 platform: ruby
 authors:
 - James Pike
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-09-02 00:00:00.000000000 Z
+date: 2014-09-06 00:00:00.000000000 Z
 dependencies: []
 description: A fast sorted set built using std::set and a fast sorted hash built using
   boost::multi_index_container.