gullah 0.0.2 → 0.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: cdb5fc63d2f73407d20cfc3fdb709f27e800a1b4c4b572243e46af970d2563c6
-  data.tar.gz: 4803e11f42479445bc125013777e797fe526f949e1d9620bea34a974f83fd3dc
+  metadata.gz: 8aa15a5c7da0a8578bc3462d2342205dbba603f316384bebd2a500c8e15cb3f1
+  data.tar.gz: 0e16604686a51b37e14ae5272e218702b317b3a6447e159ccf8b0e685f176780
 SHA512:
-  metadata.gz: 03ad7649f31e61e78cb7220809a13e68ce6e8bdc88c497b251c36c9c5a885688bb1fd075b8d0e31e8724ee4d697446ace38cce36381a9ef1f1a2ac5c5642d334
-  data.tar.gz: 0d86b4e95ef0f6390cac7a47bafc45ed45e68d3bedc0524b95dd82fc2140281da3db3a380a71814f0862ca94e3b05f21634f3975a2b38eb42719254debbd03e3
+  metadata.gz: 3ccb50387a8a3fb97cb4cf2ea4bb01946c6e300bda78b1af10aa83d8c0ff22c74de8551bc5dbb96ffec6ba0410a2946f8a24e946abe63a5076713f1d62dbfa12
+  data.tar.gz: c1916ff70ac408e8b870c2af1d7cdeb5036778b6876bf277e15ec9a9f2eb65e6c55e51ddb8d526ec99550e6bf508014e239aac532b1759f1c054b57de191bf8a

data/.gitignore

@@ -1,2 +1,3 @@
 doc/*
 .yardoc/*
+.byebug_history

data/CHANGES.md

@@ -1,5 +1,8 @@
 # Change Log
 
+## 0.0.3 *2023-11-24*
+* a few optimizations
+
 ## 0.0.2 *2021-8-29*
 * still more improvements to documentation
 

data/README.md

@@ -85,3 +85,7 @@ Another possibility, if I have sufficient spare time and am sufficiently ambitio
 # Acknowledgements
 
 I would like to thank my family and co-workers for tolerating me saying "Gullah" much more often than any of them expected.
+
+# Dedication
+
+I dedicate this gem to my son Jude, a.k.a [TurkeyMcMac](https://github.com/TurkeyMcMac). He was a better programmer than I will ever be and was only getting better. More importantly, he was a kind, funny, thoughtful person. I miss him every day. I love you, Jude.

data/lib/gullah/parse.rb

@@ -81,14 +81,14 @@ module Gullah
     # and the ancestor node where the test was run as erroneous,
     # so they will increase the +incorrectness_count+ by 2.
     def incorrectness_count
-      @incorrectness_count ||= roots.select(&:failed?).count
+      @incorrectness_count ||= roots.count(&:failed?)
     end
 
     ##
     # The count of nodes which have some structure test which was never
     # successfully run.
     def pending_count
-      @pending_count ||= roots.select(&:pending_tests?).count
+      @pending_count ||= roots.count(&:pending_tests?)
     end
 
     ##
@@ -122,7 +122,7 @@ module Gullah
     #
     #   parses = Grammar.parse "this grammar uses the usual whitespace rule"
     #
-    #   parses.first.nodes.select { |n| n.name == :_ws }.count  # => 6
+    #   parses.first.nodes.count { |n| n.name == :_ws }  # => 6
     def nodes
       NodeIterator.new self
     end

data/lib/gullah/version.rb

@@ -3,5 +3,5 @@
 module Gullah
   # This is an alpha release. Gullah has not yet been used in anything
   # other than unit tests.
-  VERSION = '0.0.2'
+  VERSION = '0.0.3'
 end

data/test/basic_test.rb

@@ -43,7 +43,7 @@ class BasicTest < Minitest::Test
     parses.each do |p|
       assert_equal 1, p.roots.length, 'parse has a root node'
       root = p.roots.first
-      assert_equal 2, root.subtree.select(&:nonterminal?).count, 'parse has 2 nonterminal nodes'
+      assert_equal 2, root.subtree.count(&:nonterminal?), 'parse has 2 nonterminal nodes'
       assert root.subtree.select(&:nonterminal?).each do |_n|
         assert_equal 2, b.children.length, 'nonterminal nodes each have 2 children'
       end
@@ -96,10 +96,10 @@ class BasicTest < Minitest::Test
     parse = parses.first
     assert_equal 8, parse.roots.length, 'there are 8 nodes in the parse'
     assert parse.roots.all?(&:leaf?), 'all nodes are leaf nodes'
-    assert_equal 3, parse.roots.select { |n| n.name == :ws }.count, 'there are 3 whitespace nodes'
-    assert_equal 3, parse.roots.select(&:ignorable?).count, 'there are 3 ignorable nodes'
-    assert_equal 4, parse.roots.select { |n| n.name == :word }.count, 'there are 4 word nodes'
-    assert_equal 1, parse.roots.select(&:trash?).count, 'there is 1 trash node'
+    assert_equal 3, parse.roots.count { |n| n.name == :ws }, 'there are 3 whitespace nodes'
+    assert_equal 3, parse.roots.count(&:ignorable?), 'there are 3 ignorable nodes'
+    assert_equal 4, parse.roots.count { |n| n.name == :word }, 'there are 4 word nodes'
+    assert_equal 1, parse.roots.count(&:trash?), 'there is 1 trash node'
     last_node = parse.roots.last
     assert last_node.trash?, 'the last node is the trash node'
   end
@@ -156,9 +156,9 @@ class BasicTest < Minitest::Test
     assert_equal 1, parse.roots.reject(&:ignorable?).count, 'there is a root node for this parse'
     root = parse.roots.first
     assert_equal :s, root.name, 'found expected root'
-    assert_equal 2, root.subtree.select { |n| n.name == :thing }.count, 'two things'
-    assert_equal 1, root.subtree.select { |n| n.name == :word }.count, 'one word'
-    assert_equal 1, root.subtree.select { |n| n.name == :integer }.count, 'one integer'
+    assert_equal 2, root.subtree.count { |n| n.name == :thing }, 'two things'
+    assert_equal 1, root.subtree.count { |n| n.name == :word }, 'one word'
+    assert_equal 1, root.subtree.count { |n| n.name == :integer }, 'one integer'
   end
 
   class SubRulesWithTest
@@ -185,8 +185,8 @@ class BasicTest < Minitest::Test
     things = root.subtree.select { |n| n.name == :thing }
     assert_equal 2, things.count, 'two things'
     assert things.all? { |n| n.attributes[:satisfied].include?(%i[foo etc]) }, 'passing tests stuff in extra bits'
-    assert_equal 1, root.subtree.select { |n| n.name == :word }.count, 'one word'
-    assert_equal 1, root.subtree.select { |n| n.name == :integer }.count, 'one integer'
+    assert_equal 1, root.subtree.count { |n| n.name == :word }, 'one word'
+    assert_equal 1, root.subtree.count { |n| n.name == :integer }, 'one integer'
   end
 
   class SubRulesWithAncestorTest
@@ -218,8 +218,8 @@ class BasicTest < Minitest::Test
       assert thing.attributes[:satisfied_descendant].include?([:foo, root.position]),
              'descendant is marked when ancestor test passes'
     end
-    assert_equal 1, root.subtree.select { |n| n.name == :word }.count, 'one word'
-    assert_equal 1, root.subtree.select { |n| n.name == :integer }.count, 'one integer'
+    assert_equal 1, root.subtree.count { |n| n.name == :word }, 'one word'
+    assert_equal 1, root.subtree.count { |n| n.name == :integer }, 'one integer'
   end
 
   class LeftAncestor

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: gullah
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.0.3
 platform: ruby
 authors:
 - David F. Houghton
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2021-08-29 00:00:00.000000000 Z
+date: 2023-11-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -142,7 +142,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.2.15
+rubygems_version: 3.4.15
 signing_key:
 specification_version: 4
 summary: A bottom up parser generator