spaghetti_stack 0.2.0 → 0.2.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 5c893953db35b9bd965993b40cad8befd618a9329e3cafa0bdcbaf990c88e6ba
-  data.tar.gz: 872836fda20352bcfc92ff438efb4f93d80bc2c91262353193748ebb5c2c254d
+  metadata.gz: 494b92ee39864728a47a2a70513efa999801566d309fdff54465398c8c4703b0
+  data.tar.gz: 6dd8ab252a53367092c059030a968eec271fda0e682d77d275b677f0f88179af
 SHA512:
-  metadata.gz: 21f2083c79d4692a1b48bd3926cda07057e76dec5b33546c3203a48b02e2c47498ebf898700dc735375881ee3004417aa23d308f75d05e0c3ed9f4760de0a01a
-  data.tar.gz: b748b65925fd16c8f1b56c06377fa4c9e5f3f48fc49d77d72a68fd293ae4f7391f3c05ef37a1da54929f2b46d79973246ddb28d458f4f0e52a8f58e6d27a399c
+  metadata.gz: 1d874a020559c073164b9d02560a050c85258aa476c38f18c864983eb9a31de36a2ea7821a20078ce80c2b7847e228c54526141c35994599bc7227ca4c978416
+  data.tar.gz: 1c79c6b8eef769161ef44cadfb595279f2e7dbda0acf4ad46b4dc66f134d5afe9031a7835dafe6584e338c62f45a5f1fad0c83f773282d8443ef8a0ae171cca8

data/README.md

@@ -1,13 +1,13 @@
 # SpaghettiStack
 
 This is a Ruby implementation of a [SpaghettiStack](https://en.wikipedia.org/wiki/Parent_pointer_tree)(also called *parent pointer tree* or *cactus stack*). A SpaghettiStack can be thought as a linked list where each element (call nodes) keeps a reference pointing to their parent (possibly null), but not to their children. This means that a node can only access to it's parent, but not it's children. 
-Another particularity of this kind of stack is that when nodes are popped, they're kept in-memory instead of being destroyed, thus preserving the link to their parent. That's why this data structure is used by compilers to create symbol tables for each lexical scopes, because it allows them to revisit previous scopes one scope at the time to resolve references.
+Another particularity of this kind of stack is that when nodes are popped, they're kept in-memory instead of being destroyed, thus preserving the link to their parent. That's why this data structure is used by compilers to create symbol tables for each lexical scopes, because it allows them to revisit previous scopes to resolve references.
 ## Installation
 
 Add this line to your application's Gemfile:
 
 ```ruby
-gem 'spaghetti_stack'
+gem 'spaghetti_stack', '~> 0.1.2'
 ```
 
 And then execute:

data/lib/spaghetti_stack.rb

@@ -13,7 +13,7 @@ class SpaghettiStack
     end
 
     def update(data)
-      return self if data == @data
+      return @data if @data.frozen?
       @data = data
     end
   end

data/lib/spaghetti_stack/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 class SpaghettiStack
-  VERSION = "0.2.0"
+  VERSION = "0.2.1"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: spaghetti_stack
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.2.1
 platform: ruby
 authors:
 - mansakondo