Properly deterministic hashing that accounts for deps

State#hash now gives consistent results (finally) and takes deps into account
(again)

1 files changed, 3 insertions, 1 deletions

diff --git a/state.rb b/state.rb
index 2a52b19..cc49bd9 100644
--- a/state.rb
+++ b/state.rb
@@ -214,7 +214,9 @@ class State
 
 	# Our ID is a function of our class and deps
 	def hash
-		(self.class.hash ** 2 + self.params.sort.hash) % 0x4000000000000000
+		(self.class.name.hash ** 3 +
+		 self.params.sort.hash ** 2 +
+		 @deps.map{ |x| x.state.hash }.sort.hash) % 0x4000000000000000
 	end
 
 	# A state is rooted in a set of states if any state in the set which it _may_