deque 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: c65845c668169e8cfc2f5141b808c9dce3490d1a
+  data.tar.gz: af586eef828b492e5b35e81fb4a7783aeede8883
+SHA512:
+  metadata.gz: fc47a1aadf9c213a655a167be61b588b7e7637d86d625a9a20dde8032aae66da0f9e4b6d3036f9c26ad5c17042c630e03ac5df96c64c5f003fc0de7afe43ac43
+  data.tar.gz: 2703c8582042b93bfabb25ef93fb8ce88d4c3dcad72607dec7a3fa63faa3283148db1e5ce2a7f90eec132149b49ded70fa77442ec21ef4ae8191300afb76edaa

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 deque.gemspec
+gemspec

data/Gemfile.lock

@@ -0,0 +1,25 @@
+PATH
+  remote: .
+  specs:
+    deque (1.0.0)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    minitest (5.8.3)
+    rake (10.4.2)
+    rake-compiler (1.0.1)
+      rake
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.12)
+  deque!
+  minitest (~> 5.0)
+  rake (~> 10.0)
+  rake-compiler
+
+BUNDLED WITH
+   1.12.5

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,33 @@
+# Deque
+
+Deque is a wrapper around the standard C++ data structure of the same name. A Deque provides a queue structure that can efficiently handle insertions and removals of data from both the front and the back of the structure.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'deque'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install deque
+
+## Usage
+
+The API is essentially the same as that of a Ruby Array.
+
+* TODO: This code has been around in my toolbox for many years, and the API almost certainly can be cleaned up so that it is a much more feature-for-feature compatible struture to the current Ruby Array.
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/deque. 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(:deque)
+
+task :default => :test

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "deque"
+
+# 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/deque.gemspec

@@ -0,0 +1,28 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'deque/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "deque"
+  spec.version       = Deque::VERSION
+  spec.authors       = ["Kirk Haines"]
+  spec.email         = ["wyhaines@gmail.com"]
+
+  spec.summary       = %q{A Deque data structure for Ruby.}
+  spec.description   = %q{A Deque is a queue type data structure that allows efficient insertion and deletion from both ends of the queue. This implementation wrapps the standard C++ structure of the same name.}
+  spec.homepage      = "http://github.com/wyhaines/deque"
+  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/deque/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

data/ext/deque/extconf.rb

@@ -0,0 +1,3 @@
+require 'mkmf'
+
+create_makefile("deque")

data/ext/deque/rubymain.cpp

@@ -0,0 +1,428 @@
+#include <deque>
+#include <iostream>
+#include <string>
+using namespace std;
+
+#include <ruby.h>
+
+/* static VALUE DequeClassTop; */
+static VALUE DequeClass;
+
+
+static void deque_mark (deque<VALUE>* dq)
+{
+        deque<VALUE>::iterator q_iterator;
+        if (dq) {
+                for ( q_iterator = (*dq).begin(); q_iterator != (*dq).end(); q_iterator++ ) {
+                        rb_gc_mark(*q_iterator);
+                }
+        }
+}
+
+static void deque_free (deque<VALUE>* dq)
+{
+        if (dq)
+                delete dq;
+}
+
+static VALUE deque_new (VALUE self)
+{
+        deque<VALUE>* dq = new deque<VALUE>;
+        VALUE v = Data_Wrap_Struct (DequeClass, deque_mark, deque_free, dq);
+        return v;
+}
+
+static VALUE deque_push_front (VALUE self, VALUE obj)
+{
+        deque<VALUE>* dq = NULL;
+        Data_Get_Struct (self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        (*dq).push_front(obj);
+
+        return self;
+}
+
+static VALUE deque_pop_front (VALUE self)
+{
+        deque<VALUE>* dq = NULL;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        if ((*dq).empty()) {
+                return Qnil;
+        } else {
+                VALUE r = (*dq).front();
+                (*dq).pop_front();
+                return r;
+        }
+}
+
+static VALUE deque_push_back (VALUE self, VALUE obj)
+{
+        deque<VALUE>* dq = NULL;
+        Data_Get_Struct (self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        (*dq).push_back(obj);
+
+        return self;
+}
+
+static VALUE deque_pop_back (VALUE self)
+{
+        deque<VALUE>* dq = NULL;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        if ((*dq).empty()) {
+                return Qnil;
+        } else {
+                VALUE r = (*dq).back();
+                (*dq).pop_back();
+                return r;
+        }
+}
+
+static VALUE deque_size (VALUE self)
+{
+        deque<VALUE>* dq = NULL;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        return INT2NUM((*dq).size());
+}
+
+static VALUE deque_max_size (VALUE self)
+{
+        deque<VALUE>* dq = NULL;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        return INT2NUM((*dq).max_size());
+}
+
+static VALUE deque_clear (VALUE self)
+{
+        deque<VALUE>* dq = NULL;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        (*dq).clear();
+        return self;
+}
+
+static VALUE deque_empty (VALUE self)
+{
+        deque<VALUE>* dq = NULL;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        if ((*dq).empty()) {
+                return Qtrue;
+        } else {
+                return Qfalse;
+        }
+}
+
+static VALUE deque_to_s (VALUE self)
+{
+        VALUE s = rb_str_new2("");
+        ID to_s = rb_intern("to_s");
+        ID concat = rb_intern("concat");
+
+        deque<VALUE>* dq = NULL;
+        deque<VALUE>::iterator q_iterator;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        for ( q_iterator = (*dq).begin(); q_iterator != (*dq).end(); q_iterator++ ) {
+                s = rb_str_concat(s,rb_funcall(*q_iterator, to_s, 0));
+        }
+        return rb_str_to_str(s);
+}
+
+/*
+   static VALUE deque_join (VALUE self, VALUE delimiter)
+   {
+        VALUE s = rb_str_new2("");
+        ID to_s = rb_intern("to_s");
+        ID concat = rb_intern("concat");
+
+        deque<VALUE>* dq = NULL;
+        deque<VALUE>::iterator q_iterator;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        for ( q_iterator = (*dq).begin(); q_iterator != (*dq).end(); q_iterator++ ) {
+                rb_funcall(s,concat,1,rb_funcall(*q_iterator,to_s,0));
+        }
+
+        return rb_str_to_str(s);
+   }
+ */
+static VALUE deque_to_a (VALUE self)
+{
+        VALUE ary = rb_ary_new();
+        ID push = rb_intern("push");
+
+        deque<VALUE>* dq = NULL;
+        deque<VALUE>::iterator q_iterator;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        for ( q_iterator = (*dq).begin(); q_iterator != (*dq).end(); q_iterator++ ) {
+                //rb_funcall(ary,push,1,*q_iterator);
+                rb_ary_push(ary,*q_iterator);
+        }
+
+        return ary;
+}
+
+static VALUE deque_inspect (VALUE self)
+{
+        VALUE s = rb_str_new2("[");
+        VALUE comma = rb_str_new2(",");
+        ID inspect = rb_intern("inspect");
+        ID concat = rb_intern("concat");
+
+        deque<VALUE>* dq = NULL;
+        deque<VALUE>::iterator q_iterator;
+        deque<VALUE>::iterator last_q_iterator;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        last_q_iterator = (*dq).end();
+
+        for ( q_iterator = (*dq).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+                rb_str_concat(s,rb_funcall(*q_iterator,inspect,0));
+                if (q_iterator != (last_q_iterator - 1))
+                        rb_str_concat(s,comma);
+        }
+        rb_str_concat(s,rb_str_new2("]"));
+
+        return rb_str_to_str(s);
+}
+
+static VALUE deque_first (VALUE self)
+{
+        deque<VALUE>* dq = NULL;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        return (*dq).front();
+}
+
+static VALUE deque_last (VALUE self)
+{
+        deque<VALUE>* dq = NULL;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        return (*dq).back();
+}
+
+static VALUE deque_replace (VALUE self, VALUE new_dq)
+{
+        deque<VALUE>* dq = NULL;
+        deque<VALUE>* ndq = NULL;
+        deque<VALUE>::iterator q_iterator;
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        Data_Get_Struct(new_dq, deque<VALUE>, ndq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        if (!ndq)
+                rb_raise (rb_eException, "No Deque object to copy");
+
+        (*dq).clear();
+        for ( q_iterator = (*ndq).begin(); q_iterator != (*ndq).end(); q_iterator++ ) {
+                (*dq).push_back(*q_iterator);
+        }
+
+        return self;
+}
+
+static VALUE deque_at (VALUE self, VALUE pos)
+{
+        deque<VALUE>* dq = NULL;
+        long c_pos = rb_num2long(pos);
+
+        Data_Get_Struct(self, deque<VALUE>, dq);
+
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        if ((c_pos < 0) || (c_pos >= (*dq).size()))
+                rb_raise (rb_eException, "Out of bounds index on Deque object");
+
+        return *((*dq).begin() + c_pos);
+}
+
+static VALUE deque_delete (VALUE self, VALUE obj)
+{
+        deque<VALUE>* dq = NULL;
+        deque<VALUE>::iterator q_iterator;
+        deque<VALUE>::iterator last_q_iterator;
+
+        Data_Get_Struct(self, deque<VALUE>, dq);
+
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        last_q_iterator = (*dq).end();
+        for ( q_iterator = (*dq).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+                if (rb_equal(*q_iterator, obj)) {
+                        (*dq).erase(q_iterator);
+                        break;
+                }
+        }
+
+        return self;
+}
+
+static VALUE deque_delete_at (VALUE self, VALUE pos)
+{
+        deque<VALUE>* dq = NULL;
+        deque<VALUE>::iterator q_iterator;
+        long c_pos = rb_num2long(pos);
+
+        Data_Get_Struct(self, deque<VALUE>, dq);
+
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        if ((c_pos < 0) || (c_pos >= (*dq).size()))
+                rb_raise (rb_eException, "Out of bounds index on Deque object");
+
+        q_iterator = (*dq).begin();
+        for ( int n = 0; n < c_pos; n++) {
+                q_iterator++;
+        }
+        (*dq).erase(q_iterator);
+
+        return *q_iterator;
+}
+
+static VALUE deque_insert (VALUE self, VALUE pos, VALUE val)
+{
+        deque<VALUE>* dq = NULL;
+        deque<VALUE>::iterator q_iterator;
+        long c_pos = rb_num2long(pos);
+
+        Data_Get_Struct(self, deque<VALUE>, dq);
+
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        if ((c_pos < 0) || (c_pos > (*dq).size()))
+                rb_raise (rb_eException, "Out of bounds index on Deque object");
+
+        q_iterator = (*dq).begin() + c_pos;
+        (*dq).insert(q_iterator,val);
+
+        return self;
+}
+
+static VALUE deque_assign_at (VALUE self, VALUE pos, VALUE val)
+{
+        deque_delete(self,pos);
+        deque_insert(self,pos,val);
+
+        return self;
+}
+
+static VALUE deque_each (VALUE self)
+{
+        deque<VALUE>* dq = NULL;
+        deque<VALUE>::iterator q_iterator;
+        deque<VALUE>::iterator last_q_iterator;
+
+        Data_Get_Struct(self, deque<VALUE>, dq);
+
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        last_q_iterator = (*dq).end();
+        for ( q_iterator = (*dq).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+                rb_yield(*q_iterator);
+        }
+
+        return self;
+}
+
+static VALUE deque_index (VALUE self, VALUE match_obj)
+{
+        deque<VALUE>* dq = NULL;
+        deque<VALUE>::iterator q_iterator;
+        deque<VALUE>::iterator last_q_iterator;
+
+        Data_Get_Struct(self, deque<VALUE>, dq);
+        if (!dq)
+                rb_raise (rb_eException, "No Deque Object");
+
+        last_q_iterator = (*dq).end();
+        int pos = 0;
+        for ( q_iterator = (*dq).begin(); q_iterator != last_q_iterator; q_iterator++ ) {
+                if (rb_equal(*q_iterator,match_obj) == Qtrue) {
+                        return INT2NUM(pos);
+                } else {
+                        pos++;
+                }
+        }
+        return Qnil;
+}
+
+/**********************
+   Init_deque
+**********************/
+
+extern "C" void Init_deque()
+{
+/*        DequeClassTop = rb_define_class("Deque", rb_cObject); 
+	DequeClass = rb_define_class_under (DequeClassTop, "Deque", rb_cObject); */
+	DequeClass = rb_define_class ("Deque", rb_cObject);
+
+        rb_define_module_function (DequeClass, "new", (VALUE (*)(...))deque_new, 0);
+        rb_define_method (DequeClass, "unshift", (VALUE (*)(...))deque_push_front,1);
+        rb_define_method (DequeClass, "shift", (VALUE (*)(...))deque_pop_front,0);
+        rb_define_method (DequeClass, "push", (VALUE (*)(...))deque_push_back,1);
+        rb_define_method (DequeClass, "<<", (VALUE (*)(...))deque_push_back,1);
+        rb_define_method (DequeClass, "pop", (VALUE (*)(...))deque_pop_back,0);
+        rb_define_method (DequeClass, "size", (VALUE (*)(...))deque_size,0);
+        rb_define_method (DequeClass, "length", (VALUE (*)(...))deque_size,0);
+        rb_define_method (DequeClass, "max_size", (VALUE (*)(...))deque_max_size,0);
+        rb_define_method (DequeClass, "clear", (VALUE (*)(...))deque_clear,0);
+        rb_define_method (DequeClass, "empty?", (VALUE (*)(...))deque_empty,0);
+        rb_define_method (DequeClass, "to_s", (VALUE (*)(...))deque_to_s,0);
+        rb_define_method (DequeClass, "to_a", (VALUE (*)(...))deque_to_a,0);
+        rb_define_method (DequeClass, "first", (VALUE (*)(...))deque_first,0);
+        rb_define_method (DequeClass, "last", (VALUE (*)(...))deque_last,0);
+        rb_define_method (DequeClass, "replace", (VALUE (*)(...))deque_replace,1);
+        rb_define_method (DequeClass, "inspect", (VALUE (*)(...))deque_inspect,0);
+        rb_define_method (DequeClass, "at", (VALUE (*)(...))deque_at,1);
+        rb_define_method (DequeClass, "[]", (VALUE (*)(...))deque_at,1);
+        rb_define_method (DequeClass, "delete", (VALUE (*)(...))deque_delete,1);
+        rb_define_method (DequeClass, "delete_at", (VALUE (*)(...))deque_delete_at,1);
+        rb_define_method (DequeClass, "insert", (VALUE (*)(...))deque_insert,2);
+        rb_define_method (DequeClass, "[]=", (VALUE (*)(...))deque_assign_at,2);
+        rb_define_method (DequeClass, "each", (VALUE (*)(...))deque_each,0);
+        rb_define_method (DequeClass, "index", (VALUE (*)(...))deque_index,1);
+
+        rb_include_module (DequeClass, rb_mEnumerable);
+        rb_require("deque/version.rb");
+}

data/lib/deque/version.rb

@@ -0,0 +1,3 @@
+class Deque
+  VERSION = "1.0.0"
+end

metadata

@@ -0,0 +1,115 @@
+--- !ruby/object:Gem::Specification
+name: deque
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- Kirk Haines
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-09-05 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: A Deque is a queue type data structure that allows efficient insertion
+  and deletion from both ends of the queue. This implementation wrapps the standard
+  C++ structure of the same name.
+email:
+- wyhaines@gmail.com
+executables: []
+extensions:
+- ext/deque/extconf.rb
+extra_rdoc_files: []
+files:
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- deque.gemspec
+- ext/deque/extconf.rb
+- ext/deque/rubymain.cpp
+- lib/deque/version.rb
+homepage: http://github.com/wyhaines/deque
+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: A Deque data structure for Ruby.
+test_files: []