nodesets 0.0.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 6973b486464e08befc4f99114654eb52e25db997
+  data.tar.gz: a954a9e38efe4dd85c0141cc2ce91d8fd50b3a05
+SHA512:
+  metadata.gz: d424f0036f276b841063335467b3176245689f4384eb432cdb044e4076f4f7eb8c10f4aad07084ed95caab23762a9455422a530bc32c44a2a66e9fad9ae82fa5
+  data.tar.gz: f32ae6d788e7fcbfdaa4254a1058d80282aed4911682173a5b928c81e1e99d6e98e49b059f5e9a048cdb4e77193c4e1632f65d59298e303cec674363a522f883

data/.gitignore

@@ -0,0 +1,21 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log
+# Vim swap files
+[._]*.s[a-v][a-z]
+[._]*.sw[a-p]
+[._]s[a-v][a-z]
+[._]sw[a-p]
+#Gem itself
+#*.gem

data/.gitlab-ci.yml

@@ -0,0 +1,18 @@
+image: "ruby:2.0"
+
+stages:
+  - setup
+  - test
+
+before_script:
+  - bundle install
+
+rspec:
+  stage: test
+  cache:
+    key: gems
+    policy: pull
+  script:
+    - bundle exec rspec spec
+  tags:
+    - docker

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2017 Adam Spencer
+
+MIT License
+
+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,34 @@
+[![pipeline status](https://git.computecanada.ca/cc-provisioning/nodesets/badges/master/pipeline.svg)](https://git.computecanada.ca/cc-provisioning/nodesets/commits/master)
+# Nodesets
+
+Nodeset rubygem, includes sample, as well as usable, executables. Fold, expand or count nodesets.  Allows exclude, intersection or XOR from the specified nodesets.
+Attempts to follows Slurm Nodeset (NodeName) conventions, possibly more if extensions are added.
+Not as feature filled as ClusterShell NodeSet written in Python, but faster at the moment and does the job in ruby.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'nodeset'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install nodesets
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it ( https://git.computecanada.ca/cc-provisioning/nodesets/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -0,0 +1,2 @@
+require "bundler/gem_tasks"
+

data/bin/nodeset.rb

@@ -0,0 +1,75 @@
+#!/usr/bin/env ruby
+
+require 'optparse'
+require 'nodesets'
+
+options = {
+  :field_separator  => ' ',
+}
+
+optparse = OptionParser.new do|opts|
+  opts.banner = "Usage: nodeset.rb [options]"
+  opts.on( '--debug', 'Support pry for debugging' ) do
+    options[:debug] = true
+  end
+  opts.on( '-v', '--verbose', 'Output a lot of job information' ) do
+    options[:verbose] = true
+  end
+  opts.on( '-f', '--fs \'separator...\'', 'Field separator to use between nodes, defaults to space' ) do |fs|
+    options[:field_separator] = fs.gsub(/(#{SEPARATORS.keys.map{|x|Regexp.escape(x)}.join('|')})/,SEPARATORS)
+  end
+  opts.on( '-e', '--expand [NodeSet]', 'Expand NodeSet to a list' ) do |nodes|
+    options[:expand] = nodes ? nodes : ''
+  end
+  opts.on( '-f', '--fold [Nodes]', 'Fold a node list of most forms into a proper NodeSet' ) do |nodes|
+    options[:fold] = nodes ? nodes : ''
+  end
+  opts.on( '-c', '--count [Nodes]', 'Count a node list of most forms of NodeSet' ) do |nodes|
+    options[:count] = nodes ? nodes : ''
+  end
+  opts.on( '-x', '--exclude Nodes', 'Exclude specified NodeSet from inputted NodeSet' ) do |nodes|
+    options[:exclude] = nodes
+  end
+  opts.on( '-i', '--intersection Nodes', 'Calculate specified NodeSet intersection from inputted NodeSet' ) do |nodes|
+    options[:intersection] = nodes
+  end
+  opts.on( '-X', '--xor Nodes', 'Calculate symmetric difference between this NodeSet and inputted NodeSet' ) do |nodes|
+    options[:xor] = nodes
+  end
+end
+begin optparse.parse!
+  rescue OptionParser::InvalidOption => e
+  puts e
+  puts optparse
+  exit 1
+end
+
+if ARGF.filename != "-" or (not STDIN.tty? and not STDIN.closed?)
+  input = ARGF.read.gsub("\n", ',').chomp(',')
+end
+
+fail 'Can only set either --fold or --expand, not both' if options[:fold] && options[:expand]
+fail 'Can only set one or none of --exclude, --intersection or --xor' if [options[:exclude],options[:intersection],options[:xor]].compact.count > 1
+
+nodeset = Nodesets::Nodeset.new
+[options[:expand], options[:fold], options[:count], input].each do |nodes|
+  nodeset.merge(nodes) if not nodes.nil? || nodes.empty?
+end
+
+out = []
+to_out = []
+if options[:exclude]
+  nodeset = nodeset - options[:exclude]
+elsif options[:intersection]
+  nodeset = nodeset & options[:intersection]
+elsif options[:xor]
+  nodeset = nodeset ^ options[:xor]
+end
+out << nodeset.count if options[:count]
+if options[:expand]
+  out.concat(nodeset.to_a)
+elsif options[:fold]
+  out << nodeset.fold
+end
+to_out << out.join(options[:field_separator]) if out
+puts to_out

data/bin/nodeset_non_oo_example.rb

@@ -0,0 +1,66 @@
+#!/usr/bin/env ruby
+
+require 'optparse'
+require 'nodesets'
+
+options = {
+  :field_separator  => ' ',
+}
+
+optparse = OptionParser.new do|opts|
+  opts.banner = "Usage: nodeset_oo_example.rb [options]"
+  opts.on( '--debug', 'Support pry for debugging' ) do
+    options[:debug] = true
+  end
+  opts.on( '-v', '--verbose', 'Output a lot of job information' ) do
+    options[:verbose] = true
+  end
+  opts.on( '-f', '--fs \'separator...\'', 'Field separator to use between nodes, defaults to space' ) do |fs|
+    options[:field_separator] = fs.gsub(/(#{SEPARATORS.keys.map{|x|Regexp.escape(x)}.join('|')})/,SEPARATORS)
+  end
+  opts.on( '-e', '--expand [NodeSet]', 'Expand NodeSet to a list' ) do |nodes|
+    options[:expand] = nodes ? nodes : ''
+  end
+  opts.on( '-f', '--fold [Nodes]', 'Fold a node list of most forms into a proper NodeSet' ) do |nodes|
+    options[:fold] = nodes ? nodes : ''
+  end
+  opts.on( '-c', '--count [Nodes]', 'Count a node list of most forms of NodeSet' ) do |nodes|
+    options[:count] = nodes ? nodes : ''
+  end
+end
+begin optparse.parse!
+  rescue OptionParser::InvalidOption => e
+  puts e
+  puts optparse
+  exit 1
+end
+
+if ARGF.filename != "-" or (not STDIN.tty? and not STDIN.closed?)
+  input = ARGF.read
+end
+
+fail 'Can only set either --fold or --expand, not both' if options[:fold] && options[:expand]
+
+node_out = []
+to_out = []
+expanded = nil
+expanded_of_folded = nil
+if not options[:expand].nil?
+  options[:expand] = options[:expand]+','+input if input
+  expanded = Nodesets.parse_nodeset(options[:expand])
+  node_out << expanded
+elsif not options[:fold].nil?
+  options[:fold] = options[:fold]+','+input if input
+  expanded_of_folded = Nodesets.parse_nodeset(options[:fold])
+  node_out << [Nodesets.make_nodeset(expanded_of_folded)]
+end
+if not options[:count].nil?
+  incl_input = nil
+  incl_count = nil
+  incl_count = count if not options[:count].empty?
+  incl_input = input if not options[:expand] && options[:fold]
+  nodes = [expanded, expanded_of_folded, incl_count, incl_input].compact.join(',')
+  to_out << Nodesets.parse_nodeset(nodes).count
+end
+to_out << node_out.join(options[:field_separator]) if node_out
+puts to_out.flatten

data/lib/nodesets/human_sortable_array.rb

@@ -0,0 +1,42 @@
+module Nodesets
+  # http://www.zenspider.com/ruby/2012/01/array-natural_sort.html
+  # https://dzone.com/articles/convert-ruby-array-ranges
+  # This has been improved since the posting
+  # a.to_ranges.map { |x| x.count > 1 ? x.to_s.gsub!(/([[:digit:]]+)[.]{2}[[:alpha:]]+([[:digit:]]+)/,'[\1-\2]') : x.first }
+  class HumanSortableArray < Array
+    #def initialize(arr, compact_uniq = false, sorted = false)
+    #  @compact_uniq = compact_uniq
+    #  @sorted       = sorted
+    #  super(arr)
+    #end
+    def human_sort
+      self.sort_by { |item| item.to_s.split(/(\d+)/).map { |e| [e.to_i, e] } }
+    end
+    def to_ranges
+      array = self
+      #array = HumanSortableArray.new(self).human_sort
+      #array = if not @compact_uniq && @sorted
+      #  HumanSortableArray.new(self.compact.uniq, true, true).human_sort_simple
+      #else
+      #  self
+      #end
+      #array = HumanSortableArray.new(self.compact.uniq, true, true).human_sort
+      ranges = []
+      if !array.empty?
+        # Initialize the left and right endpoints of the range
+        left, right = array.first, nil
+        array.each do |obj|
+          # If the right endpoint is set and obj is not equal to right's successor
+          # then we need to create a range.
+          if right && obj != right.succ
+            ranges << (left == right ? left : Range.new(left,right))
+            left = obj
+          end
+          right = obj
+        end
+        ranges << (left == right ? left : Range.new(left,right))
+      end
+      ranges
+    end
+  end
+end

data/lib/nodesets/nodeset.rb

@@ -0,0 +1,61 @@
+require 'set'
+
+module Nodesets
+  class Nodeset < Set
+    attr_reader :sorted
+    def initialize(nodes = nil, sorted = false)
+      @sorted = sorted
+      nodes = Nodesets.parse_nodeset(nodes) if nodes && nodes.is_a?(String)
+      #nodes = Nodesets.parse_nodeset(nodes) if nodes && (! nodes.is_a?(Set))
+      super(nodes)
+    end
+    def merge(nodes)
+      @sorted = false
+      if nodes && (! nodes.is_a?(Set))
+        nodes = if nodes.is_a?(Array)
+          nodes.map {|x| Nodesets.parse_nodeset(x) }.flatten
+        else
+          Nodesets.parse_nodeset(nodes)
+        end
+      end
+      super(nodes)
+    end
+    def subtract(nodes)
+      @sorted = false
+      nodes = Nodesets.parse_nodeset(nodes) if nodes && (! nodes.is_a?(Set))
+      super(nodes)
+    end
+    def &(nodes)
+      nodes = Nodesets.parse_nodeset(nodes) if nodes && (! nodes.is_a?(Set))
+      super(nodes)
+    end
+    def ^(nodes)
+      nodes = Nodesets.parse_nodeset(nodes) if nodes && (! nodes.is_a?(Set))
+      self.class.new(super(nodes))
+    end
+    def human_sort
+      if @sorted
+        self
+      else
+        Nodesets::Nodeset.new(Nodesets::HumanSortableArray.new(self.to_a).human_sort, true)
+      end
+    end
+    def human_sort!
+      self.replace(human_sort)
+      #replaced = self.replace(human_sort)
+      #@sorted = true
+      #replaced
+    end
+    def [](pos)
+      self.human_sort! unless @sorted
+      self.to_a[pos]
+    end
+    def fold
+      Nodesets.make_nodeset(self)
+    end
+    def expand(sort: true)
+      self.human_sort! if (! @sorted) && sort
+      self.to_a
+    end
+  end
+end

data/lib/nodesets/version.rb

@@ -0,0 +1,3 @@
+module Nodesets
+  VERSION = "0.0.2"
+end

data/lib/nodesets.rb

@@ -0,0 +1,80 @@
+require "nodesets/version"
+require "nodesets/human_sortable_array"
+require "nodesets/nodeset"
+
+module Nodesets
+
+  SEPARATORS = {
+    '\n' => "\n",
+    '\r' => "\r",
+    '\t' => "\t",
+    '\0' => "\0",
+  }
+  Nodeset_split = /,(?=(?:[^\]]*\[[^\[]*\])*[^\]]*\z)/.freeze
+  Nodeset_single_split = /\[(.+?)\]$/.freeze
+  SCONTROL_ALLOCGPU_REGEX = /NodeName=(?<nodename>\S+)(?:.*)AllocTRES=\S+?gpu=(?<gpucount>\S+)/.freeze
+
+  class << self
+#    require "#{File.expand_path('../nodeset_gem', __FILE__)}/human_sortable_array"
+#    require "#{File.expand_path('../nodeset_gem', __FILE__)}/nodeset"
+    def parse_nodeset(nodeset)
+      nodeset = nodeset.split(Nodeset_split).map do |set|
+        match = /(\d.*)/.match(set) if not set.include?('[')
+        set = "#{match.pre_match}[#{match[0]}]" if match
+        prefix, digits = set.split(Nodeset_single_split)
+        post_digits = digits.split(',').map do |x|
+          if x.include?('-')
+            first, _, last = x.partition('-')
+            (first.to_i..last.to_i).to_a.map do |y|
+              name =  "#{prefix}#{y}"
+              name = yield name if block_given?
+              name
+            end
+          else
+            name = "#{prefix}#{x}"
+            name = yield name if block_given?
+            name
+          end
+        end.flatten
+      end.flatten.uniq
+      ## FIXME: Probably not the parsers job to do the sorting, removed it for now
+      ##   expensive call and breaks test predictability
+      #Nodesets::HumanSortableArray.new(nodeset).human_sort
+    end
+    def parse_nodeset_arr(nodeset_arr)
+      nodeset_arr.each_with_object([]) do |nodeset, node_arr|
+        node_arr.concat(parse_nodeset(nodeset))
+      end
+    end
+    def make_nodeset(node_arr)
+      # For speed, and because we only currently support a single prefix in a nodeset
+      # we will assume that the first items prefix is the same as all the rest
+      node_arr = node_arr.to_a
+      node_prefix = node_arr[0].partition(/^([-_A-Za-z]+)/)[1]
+      node_prefix_length = node_prefix.length
+      num_w_ranges = node_arr.map do |x|
+        x[node_prefix_length..-1].to_i
+      end
+      ## Old, less efficient method
+      #node_prefix = ''
+      #num_w_ranges = node_arr.map do |x|
+      #  name_split = x.partition(/^([-_A-Za-z]+)/)
+      #  node_prefix = name_split[1] if node_prefix.empty?
+      #  name_split.last
+      #end
+      num_w_ranges = Nodesets::HumanSortableArray.new(num_w_ranges.sort).to_ranges.map do |x|
+        ## Old, less efficient method
+        #x.to_s.sub('..','-')
+        begin
+          y = x.to_s
+          y[/\.\./] = '-'
+          y
+        rescue IndexError
+          x
+        end
+      end.join(',')
+      node_arr.length > 1 ? "#{node_prefix}[#{num_w_ranges}]" : "#{node_prefix}#{num_w_ranges}"
+    end
+  end
+
+end

data/nodesets.gemspec

@@ -0,0 +1,36 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'nodesets/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'nodesets'
+  spec.version       = Nodesets::VERSION
+  spec.summary       = "Nodeset parsing the way that Slurm tends to handle, folding or expanding"
+  spec.description   = %q(
+Allows parsing nodenames or Nodesets in the way that Slurm generally handles,
+you can either fold an array of names into a nodeset, or you can expand a nodeset into
+an array of separate node names.
+  )
+  spec.authors       = ["Adam Spencer"]
+  spec.email         = 'adam.spencer@sfu.ca'
+  #s.executables = [
+  #  "nodeset_gem.rb",
+  #]
+  #s.files            = [
+  #  "lib/nodeset_gem.rb",
+  #  "lib/nodeset_gem/nodeset.rb",
+  #  "lib/nodeset_gem/human_sortable_array.rb",
+  #]
+  spec.homepage      = 'http://rubygems.org/gems/nodesets'
+  spec.license       = 'MIT'
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.7"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.2"
+end

data/spec/nodesets_spec.rb

@@ -0,0 +1,92 @@
+require 'nodesets'
+
+# TODO: Add further tests
+#       Fix the :human_sort, :human_sort! test
+describe Nodesets do
+  it "Nodeset pre-ordered contains iam1,iam9,iam10,iam11,iam20" do
+    arr = ['iam1','iam9','iam10','iam11','iam20']
+    expect(Nodesets::Nodeset.new(arr.join(',')).to_a).to eql(arr)
+  end
+
+  it "Nodeset pre-unordered contains iam9,iam10,iam11,iam20,iam1" do
+    arr = ['iam9','iam10','iam11','iam20','iam1']
+    expect(Nodesets::Nodeset.new(arr.join(',')).to_a).to eql(arr)
+  end
+
+  it "Nodeset human_sorted" do
+    unsorted_arr = ['iam9','iam10','iam11','iam20','iam1']
+    sorted_arr = ['iam1','iam9','iam10','iam11','iam20']
+    expect(Nodesets::Nodeset.new(unsorted_arr.join(',')).human_sort.to_a).to eql(sorted_arr)
+  end
+
+  it "Nodeset human_sort and human_sort! to return the same sorted array when to_a" do
+    unsorted_arr = ['iam9','iam10','iam11','iam20','iam1']
+    initial = Nodesets::Nodeset.new(unsorted_arr.join(','))
+    human_sort_wo_dup = initial.human_sort
+    human_sort_w_dup  = initial.human_sort!
+    expect(human_sort_wo_dup.to_a == human_sort_w_dup.to_a).to be true
+  end
+
+  ### TODO: FIXME: This test currently does not work
+  ## The purpose of this test is to verify that :human_sort returns a new object, and 
+  ##  :human_sort! replaces the current object with a new object, unsure of how to test this...
+  #it "Nodeset human_sort! (duplicate, new, object returned rather than the same object)" do
+  #  unsorted_arr = ['iam9','iam10','iam11','iam20','iam1']
+  #  initial = Nodesets::Nodeset.new(unsorted_arr.join(','))
+  #  human_sort_wo_dup = initial.human_sort
+  #  human_sort_w_dup  = initial.human_sort!
+  #  expect(human_sort_wo_dup == human_sort_w_dup).to be true
+  #  expect(human_sort_wo_dup.object_id == human_sort_w_dup.object_id).to be false
+  #end
+
+  it "Nodeset after value merge to contain the same values(not order specific) as array" do
+    arr = ['iam1','iam9','iam10','iam11','iam20']
+    initial = Nodesets::Nodeset.new(arr.join(','))
+    to_adjust = 'iam3'
+    adjusted_arr = (arr << to_adjust)
+    adjusted_nodeset_arr = initial.merge(to_adjust).to_a
+    expect(adjusted_nodeset_arr & adjusted_arr == adjusted_arr && adjusted_nodeset_arr - adjusted_arr == []).to be true
+  end
+
+  it "Nodeset after value subtraction to contain the same values(not order specific) as array" do
+    arr = ['iam1','iam9','iam10','iam11','iam20']
+    initial = Nodesets::Nodeset.new(arr.join(','))
+    to_adjust = 'iam11'
+    adjusted_arr = arr - [to_adjust]
+    adjusted_nodeset_arr = initial.subtract(to_adjust).to_a
+    expect(adjusted_nodeset_arr & adjusted_arr == adjusted_arr && adjusted_nodeset_arr - adjusted_arr == []).to be true
+  end
+
+  it "Nodeset :& intersection converted back to array to match array intersection(not order specific)" do
+    arr = ['iam1','iam9','iam10','iam11','iam20']
+    intersection = ['iam9','iam11','iam400']
+    initial = Nodesets::Nodeset.new(arr.join(','))
+    adjusted_arr = arr & intersection
+    adjusted_nodeset_arr = (initial & Nodesets::Nodeset.new(intersection.join(','))).to_a
+    expect(adjusted_nodeset_arr & adjusted_arr == adjusted_arr && adjusted_nodeset_arr - adjusted_arr == []).to be true
+  end
+
+  it "Nodeset fold properly" do
+    arr = ['iam1','iam9','iam10','iam11','iam20']
+    expect(Nodesets::Nodeset.new(arr.join(',')).fold).to eql('iam[1,9-11,20]')
+  end
+
+  it "Nodeset expand properly and be :human_sort'ed" do
+    arr = ['iam13','iam1','iam9','iam10','iam11','iam20']
+    human_sorted_arr = ['iam1','iam9','iam10','iam11','iam13','iam20']
+    expect(Nodesets::Nodeset.new(arr.join(',')).expand).to eql(human_sorted_arr)
+  end
+
+  it "Nodeset XOR properly" do
+    arr = ['iam1','iam9','iam10','iam11','iam20']
+    xor_arr = ['iam1','iam10','iam11']
+    shouldbe_arr = ['iam9','iam20']
+    expect((Nodesets::Nodeset.new(arr.join(',')) ^ Nodesets::Nodeset.new(xor_arr.join(','))).to_a).to eql(shouldbe_arr)
+  end
+
+  it "Nodeset unsorted array to sorted subset :[] properly" do
+    arr = ['iam1','iam15','iam9','iam10','iam11','iam20']
+    expect(Nodesets::Nodeset.new(arr.join(','))[2..4]).to eql(['iam10','iam11','iam15'])
+  end
+
+end

metadata

@@ -0,0 +1,104 @@
+--- !ruby/object:Gem::Specification
+name: nodesets
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+platform: ruby
+authors:
+- Adam Spencer
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2017-11-10 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.7'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.7'
+- !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: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '3.2'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '3.2'
+description: "\nAllows parsing nodenames or Nodesets in the way that Slurm generally
+  handles,\nyou can either fold an array of names into a nodeset, or you can expand
+  a nodeset into\nan array of separate node names.\n  "
+email: adam.spencer@sfu.ca
+executables:
+- nodeset.rb
+- nodeset_non_oo_example.rb
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .gitlab-ci.yml
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/nodeset.rb
+- bin/nodeset_non_oo_example.rb
+- lib/nodesets.rb
+- lib/nodesets/human_sortable_array.rb
+- lib/nodesets/nodeset.rb
+- lib/nodesets/version.rb
+- nodesets.gemspec
+- spec/nodesets_spec.rb
+homepage: http://rubygems.org/gems/nodesets
+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.0.14.1
+signing_key: 
+specification_version: 4
+summary: Nodeset parsing the way that Slurm tends to handle, folding or expanding
+test_files:
+- spec/nodesets_spec.rb