maprbcpp 0.9.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 16ff4ebd10a8e0e6b68f8f8563331ac04b1e23af
+  data.tar.gz: 63d8abb83fb55d3d2391e962d258951463af7e69
+SHA512:
+  metadata.gz: c4bee0435efc61c974f729026e3c646f7cda3c785c060244256d04edbde6f03cf0449ef26f48242899984f165147b12f59448b4e0933f8e4c2e13d4b07fdfae0
+  data.tar.gz: 1d19d7622f862f5548b29e1e191f3e6a7522177769f00e1563370844e02c7c59badf558fbde472dc1d96f4d6c9dfc0e363652dc2741ddeee9deff9def62315d6

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,49 @@
+# Contributor Code of Conduct
+
+As contributors and maintainers of this project, and in the interest of
+fostering an open and welcoming community, we pledge to respect all people who
+contribute through reporting issues, posting feature requests, updating
+documentation, submitting pull requests or patches, and other activities.
+
+We are committed to making participation in this project a harassment-free
+experience for everyone, regardless of level of experience, gender, gender
+identity and expression, sexual orientation, disability, personal appearance,
+body size, race, ethnicity, age, religion, or nationality.
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery
+* Personal attacks
+* Trolling or insulting/derogatory comments
+* Public or private harassment
+* Publishing other's private information, such as physical or electronic
+  addresses, without explicit permission
+* Other unethical or unprofessional conduct
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+By adopting this Code of Conduct, project maintainers commit themselves to
+fairly and consistently applying these principles to every aspect of managing
+this project. Project maintainers who do not follow or enforce the Code of
+Conduct may be permanently removed from the project team.
+
+This code of conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community.
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting a project maintainer at wyhaines@gmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. Maintainers are
+obligated to maintain confidentiality with regard to the reporter of an
+incident.
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 1.3.0, available at
+[http://contributor-covenant.org/version/1/3/0/][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/3/0/

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in map-rbcpp.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Kirk Haines
+
+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.

data/README.md

@@ -0,0 +1,49 @@
+# Maprbcpp
+
+  Maps are associative containers which store values, indexed by key, but which provide ordered access to the values, sorted by the key. This implementation wraps the standard implementation found in C++.
+
+  This implementation has been in my toolbox for a very long time, and the API is in definite need of some love to make it fully Hash compatible.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'map-rbcpp'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install map-rbcpp
+
+## Usage
+
+```ruby
+require 'maprbcpp'
+
+m = Maprbcpp.new
+m['z'] = 26
+m['a'] = 1
+
+pp m
+```
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/map-rbcpp. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1,13 @@
+require "bundler/gem_tasks"
+require "rake/testtask"
+require "rake/extensiontask"
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << "test"
+  t.libs << "lib"
+  t.test_files = FileList['test/**/*_test.rb']
+end
+
+Rake::ExtensionTask.new(:maprbcpp)
+
+task :default => :test

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "map/rbcpp"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/ext/maprbcpp/extconf.rb

@@ -0,0 +1,3 @@
+require 'mkmf'
+
+create_makefile "maprbcpp"

data/ext/maprbcpp/rubymain.cpp

@@ -0,0 +1,493 @@
+#include <iostream>
+#include <map>
+#include <string>
+#include "string.h"
+using namespace std;
+
+#include <ruby.h>
+
+static VALUE MapClass;
+
+struct classcomp {
+        bool operator() (const char *s1, const char *s2) const
+        {
+                if ( strcmp(s1,s2) < 0) {
+                        return true;
+                } else {
+                        return false;
+                }
+        }
+};
+
+typedef std::map<char *,VALUE,classcomp> rb_map;
+typedef std::map<char *,VALUE,classcomp>::iterator rb_map_iterator;
+
+static void sptm_mark (rb_map* st)
+{
+        rb_map_iterator q_iterator;
+        if (st) {
+                for ( q_iterator = (*st).begin(); q_iterator != (*st).end(); q_iterator++ ) {
+                        rb_gc_mark(q_iterator->second);
+                }
+        }
+}
+
+static void sptm_free (rb_map* st)
+{
+        if (st)
+                delete st;
+}
+
+static VALUE sptm_new (VALUE self)
+{
+        rb_map* st = new rb_map;
+        VALUE v = Data_Wrap_Struct (MapClass, sptm_mark, sptm_free, st);
+        return v;
+}
+
+/*
+   static VALUE sptm_parent (VALUE self)
+   {
+   rb_map* st = NULL;
+   Data_Get_Struct(self, rb_map, st);
+   if (!st)
+    rb_raise (rb_eException, "No Map Object");
+
+   if ((*st).empty()) {
+    return Qnil;
+   } else {
+    rb_map_iterator parent = (*st).parent();
+    VALUE r = rb_ary_new();
+
+    rb_ary_push(r,rb_str_new2(parent->first));
+    rb_ary_push(r,parent->second);
+    return r;
+   }
+   }
+ */
+
+static VALUE sptm_pop_front (VALUE self)
+{
+        rb_map* st = NULL;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        if ((*st).empty()) {
+                return Qnil;
+        } else {
+                rb_map_iterator front = (*st).begin();
+                VALUE r = rb_ary_new();
+
+                rb_ary_push(r,rb_str_new2(front->first));
+                rb_ary_push(r,front->second);
+                (*st).erase(front);
+                return r;
+        }
+}
+
+static VALUE sptm_pop_back (VALUE self)
+{
+        rb_map* st = NULL;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        if ((*st).empty()) {
+                return Qnil;
+        } else {
+                rb_map_iterator back = (*st).end();
+                back--;
+                VALUE r = rb_ary_new();
+                rb_ary_push(r,rb_str_new2(back->first));
+                rb_ary_push(r,back->second);
+                (*st).erase(back);
+                return r;
+        }
+}
+
+
+static VALUE sptm_size (VALUE self)
+{
+        rb_map* st = NULL;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        return INT2NUM((*st).size());
+}
+
+
+static VALUE sptm_max_size (VALUE self)
+{
+        rb_map* st = NULL;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        return INT2NUM((*st).max_size());
+}
+
+static VALUE sptm_clear (VALUE self)
+{
+        rb_map* st = NULL;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        (*st).clear();
+        return self;
+}
+
+static VALUE sptm_empty (VALUE self)
+{
+        rb_map* st = NULL;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        if ((*st).empty()) {
+                return Qtrue;
+        } else {
+                return Qfalse;
+        }
+}
+
+static VALUE sptm_to_s (VALUE self)
+{
+        VALUE s = rb_str_new2("");
+
+        rb_map* st = NULL;
+        rb_map_iterator q_iterator;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        for ( q_iterator = (*st).begin(); q_iterator != (*st).end(); q_iterator++ ) {
+                rb_str_concat(s,rb_str_new2(q_iterator->first));
+                rb_str_concat(s,rb_convert_type(q_iterator->second, T_STRING, "String", "to_str"));
+        }
+
+        return rb_str_to_str(s);
+}
+
+static VALUE sptm_to_a (VALUE self)
+{
+        VALUE ary = rb_ary_new();
+
+        rb_map* st = NULL;
+        rb_map_iterator q_iterator;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        for ( q_iterator = (*st).begin(); q_iterator != (*st).end(); q_iterator++ ) {
+                rb_ary_push(ary,rb_str_new2(q_iterator->first));
+                rb_ary_push(ary,q_iterator->second);
+        }
+
+        return ary;
+}
+
+static VALUE sptm_inspect (VALUE self)
+{
+        VALUE s = rb_str_new2("{");
+        VALUE arrow = rb_str_new2("=>");
+        VALUE comma = rb_str_new2(",");
+
+        rb_map* st = NULL;
+        rb_map_iterator q_iterator;
+        rb_map_iterator last_q_iterator;
+        rb_map_iterator before_last_q_iterator;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        if (!((*st).end() == (*st).begin())) {
+                before_last_q_iterator = last_q_iterator = (*st).end();
+                before_last_q_iterator--;
+
+                for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+                        rb_str_concat(s,rb_inspect(rb_str_new2((*q_iterator).first)));
+                        rb_str_concat(s,arrow);
+                        rb_str_concat(s,rb_inspect((*q_iterator).second));
+                        if (q_iterator != before_last_q_iterator)
+                                rb_str_concat(s,comma);
+                }
+        }
+
+        rb_str_concat(s,rb_str_new2("}"));
+
+        return rb_str_to_str(s);
+}
+
+static VALUE sptm_first (VALUE self)
+{
+        rb_map* st = NULL;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        if ((*st).empty()) {
+                return Qnil;
+        } else {
+                rb_map_iterator front = (*st).begin();
+                VALUE r = rb_ary_new();
+                rb_ary_push(r,rb_str_new2(front->first));
+                rb_ary_push(r,front->second);
+                return r;
+        }
+}
+
+static VALUE sptm_last (VALUE self)
+{
+        rb_map* st = NULL;
+        Data_Get_Struct(self, rb_map, st);
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        if ((*st).empty()) {
+                return Qnil;
+        } else {
+                rb_map_iterator back = (*st).end();
+                back--;
+                VALUE r = rb_ary_new();
+                rb_ary_push(r,rb_str_new2(back->first));
+                rb_ary_push(r,back->second);
+                return r;
+        }
+}
+
+/*
+   static VALUE sptm_replace (VALUE self, VALUE new_st)
+   {
+   rb_map* st = NULL;
+   rb_map* nst = NULL;
+   rb_map_iterator q_iterator;
+   Data_Get_Struct(self, rb_map, st);
+   Data_Get_Struct(new_st, rb_map, nst);
+   if (!st)
+    rb_raise (rb_eException, "No Map Object");
+
+   if (!nst)
+    rb_raise (rb_eException, "No Map object to copy");
+
+   (*st).clear();
+   for ( q_iterator = (*nst).begin(); q_iterator != (*nst).end(); q_iterator++ ) {
+    (*st).push_back(*q_iterator);
+   }
+
+   return self;
+   }
+ */
+
+
+static VALUE sptm_insert (VALUE self, VALUE key, VALUE val)
+{
+        rb_map* st = NULL;
+        std::pair<rb_map_iterator, bool> rv;
+        std::pair<char *,VALUE> sp;
+        char * skey;
+        char * svp;
+
+        svp = StringValuePtr(key);
+        skey = new char[strlen(svp)+1];
+        strcpy(skey,svp);
+
+        Data_Get_Struct(self, rb_map, st);
+
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        sp = make_pair(skey,val);
+        rv = (*st).insert(sp);
+        if (!rv.second) {
+                (*st).erase(rv.first);
+                (*st).insert(sp);
+        }
+
+        return self;
+}
+
+static VALUE sptm_at (VALUE self, VALUE key)
+{
+        rb_map* st = NULL;
+        rb_map_iterator q_iterator;
+
+        char * skey = StringValuePtr(key);
+
+        Data_Get_Struct(self, rb_map, st);
+
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        q_iterator = (*st).find(skey);
+        if (q_iterator == (*st).end()) {
+                return Qnil;
+        } else {
+                return q_iterator->second;
+        }
+}
+
+
+static VALUE sptm_delete (VALUE self, VALUE key)
+{
+        rb_map* st = NULL;
+        rb_map_iterator q_iterator;
+
+        char * skey = StringValuePtr(key);
+
+        Data_Get_Struct(self, rb_map, st);
+
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        q_iterator = (*st).find(skey);
+        if (q_iterator == (*st).end()) {
+                return Qnil;
+        } else {
+                (*st).erase(q_iterator);
+        }
+
+        return self;
+}
+
+/*
+   static VALUE sptm_delete_value (VALUE self, VALUE obj)
+   {
+   rb_map* st = NULL;
+   rb_map_iterator q_iterator;
+   rb_map_iterator last_q_iterator;
+
+   Data_Get_Struct(self, rb_map, st);
+
+   if (!st)
+    rb_raise (rb_eException, "No Map Object");
+
+   last_q_iterator = (*st).end();
+   for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+    if (rb_equal(q_iterator->second, obj)) {
+      (*st).erase(q_iterator);
+      break;
+    }
+   }
+
+   return self;
+   }
+ */
+
+static VALUE sptm_each (VALUE self)
+{
+        rb_map* st = NULL;
+        rb_map_iterator q_iterator;
+        rb_map_iterator last_q_iterator;
+
+        Data_Get_Struct(self, rb_map, st);
+
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        last_q_iterator = (*st).end();
+        for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+                rb_yield_values(2,rb_str_new2(q_iterator->first),q_iterator->second);
+        }
+
+        return self;
+}
+
+static VALUE sptm_index (VALUE self, VALUE match_obj)
+{
+        rb_map* st = NULL;
+        rb_map_iterator q_iterator;
+        rb_map_iterator last_q_iterator;
+
+        Data_Get_Struct(self, rb_map, st);
+
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        last_q_iterator = (*st).end();
+        for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+                if (rb_equal(q_iterator->second, match_obj)) {
+                        return rb_str_new2(q_iterator->first);
+                }
+        }
+        return Qnil;
+}
+
+static VALUE sptm_keys (VALUE self)
+{
+        rb_map* st = NULL;
+        rb_map_iterator q_iterator;
+        rb_map_iterator last_q_iterator;
+
+        Data_Get_Struct(self, rb_map, st);
+
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        last_q_iterator = (*st).end();
+        VALUE r = rb_ary_new();
+        for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+                rb_ary_push(r,rb_str_new2(q_iterator->first));
+        }
+
+        return r;
+}
+
+static VALUE sptm_values (VALUE self)
+{
+        rb_map* st = NULL;
+        rb_map_iterator q_iterator;
+        rb_map_iterator last_q_iterator;
+
+        Data_Get_Struct(self, rb_map, st);
+
+        if (!st)
+                rb_raise (rb_eException, "No Map Object");
+
+        last_q_iterator = (*st).end();
+        VALUE r = rb_ary_new();
+        for ( q_iterator = (*st).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+                rb_ary_push(r,q_iterator->second);
+        }
+
+        return r;
+}
+
+/**********************
+   Init_sptm
+**********************/
+
+extern "C" void Init_maprbcpp()
+{
+        MapClass = rb_define_class("Maprbcpp", rb_cObject);
+
+        rb_define_module_function (MapClass, "new", (VALUE (*)(...))sptm_new, 0);
+        rb_define_method (MapClass, "shift", (VALUE (*)(...))sptm_pop_front,0);
+        rb_define_method (MapClass, "pop", (VALUE (*)(...))sptm_pop_back,0);
+        rb_define_method (MapClass, "size", (VALUE (*)(...))sptm_size,0);
+        rb_define_method (MapClass, "length", (VALUE (*)(...))sptm_size,0);
+        rb_define_method (MapClass, "max_size", (VALUE (*)(...))sptm_max_size,0);
+        rb_define_method (MapClass, "clear", (VALUE (*)(...))sptm_clear,0);
+        rb_define_method (MapClass, "empty?", (VALUE (*)(...))sptm_empty,0);
+        rb_define_method (MapClass, "to_s", (VALUE (*)(...))sptm_to_s,0);
+        rb_define_method (MapClass, "to_a", (VALUE (*)(...))sptm_to_a,0);
+        rb_define_method (MapClass, "first", (VALUE (*)(...))sptm_first,0);
+        rb_define_method (MapClass, "last", (VALUE (*)(...))sptm_last,0);
+        //rb_define_method (MapClass, "parent", (VALUE(*)(...))sptm_parent,0);
+        //rb_define_method (MapClass, "replace", (VALUE(*)(...))sptm_replace,1);
+        rb_define_method (MapClass, "inspect", (VALUE (*)(...))sptm_inspect,0);
+        rb_define_method (MapClass, "at", (VALUE (*)(...))sptm_at,1);
+        rb_define_method (MapClass, "[]", (VALUE (*)(...))sptm_at,1);
+        rb_define_method (MapClass, "delete", (VALUE (*)(...))sptm_delete,1);
+        rb_define_method (MapClass, "insert", (VALUE (*)(...))sptm_insert,2);
+        rb_define_method (MapClass, "[]=", (VALUE (*)(...))sptm_insert,2);
+        rb_define_method (MapClass, "each", (VALUE (*)(...))sptm_each,0);
+        rb_define_method (MapClass, "index", (VALUE (*)(...))sptm_index,1);
+        rb_define_method (MapClass, "keys", (VALUE (*)(...))sptm_keys,0);
+        rb_define_method (MapClass, "values", (VALUE (*)(...))sptm_values,0);
+
+        rb_require("maprbcpp/version.rb");
+//	rb_include_module (MapClass, rb_mEnumerable);
+}

data/lib/maprbcpp/version.rb

@@ -0,0 +1,3 @@
+module MapRbcpp
+  VERSION = "0.9.1"
+end

data/maprbcpp.gemspec

@@ -0,0 +1,27 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'maprbcpp/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "maprbcpp"
+  spec.version       = MapRbcpp::VERSION
+  spec.authors       = ["Kirk Haines"]
+  spec.email         = ["wyhaines@gmail.com"]
+
+  spec.summary       = %q{An implementation of a Map (ordered key/value storage container) that wraps the standard C++ container class.}
+  spec.description   = %q{Maps are associative containers which store values, indexed by key, but which provide ordered access to the values, sorted by the key. This implementation wraps the standard implementation found in C++.}
+  spec.homepage      = "http://github.com/wyhaines/map-rbcpp"
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = "exe"
+  spec.require_paths = ["lib"]
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.extensions    = %w[ext/maprbcpp/extconf.rb]
+
+  spec.add_development_dependency "bundler", "~> 1.12"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "minitest", "~> 5.0"
+  spec.add_development_dependency "rake-compiler", "~> 0"
+end

metadata

@@ -0,0 +1,115 @@
+--- !ruby/object:Gem::Specification
+name: maprbcpp
+version: !ruby/object:Gem::Version
+  version: 0.9.1
+platform: ruby
+authors:
+- Kirk Haines
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-09-06 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.12'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.12'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+- !ruby/object:Gem::Dependency
+  name: rake-compiler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Maps are associative containers which store values, indexed by key, but
+  which provide ordered access to the values, sorted by the key. This implementation
+  wraps the standard implementation found in C++.
+email:
+- wyhaines@gmail.com
+executables: []
+extensions:
+- ext/maprbcpp/extconf.rb
+extra_rdoc_files: []
+files:
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- ext/maprbcpp/extconf.rb
+- ext/maprbcpp/rubymain.cpp
+- lib/maprbcpp/version.rb
+- maprbcpp.gemspec
+homepage: http://github.com/wyhaines/map-rbcpp
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.5.1
+signing_key: 
+specification_version: 4
+summary: An implementation of a Map (ordered key/value storage container) that wraps
+  the standard C++ container class.
+test_files: []