Replies: 1 comment
-
Hrmz...I think a added = []
deleted = []
for f in state1:
if state1[f] and not state2[f]:
deleted.append(f)
if not state1[f] and state2[f]:
added.append(f)
return (added, deleted) Means that def __hash__(self):
return hash(str(self)) |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Each
Step
in a trace holds itsState
, which has its list ofFluent
objects. EachFluent
object stores its value as a property.This would mean the generators handle fluent values in one of two ways:
Fluent
objectsState
overwrites the value from state to stateState
's lists would have the same value regardless of actual state)My idea would be instead to store a list of
(Fluent, value)
tuples on State and remove thevalue
attribute from Fluent, or to store separate listsfluents
andvalues
that are indexed the same.These changes would likely break how generation currently works. Any other ideas or workarounds?
Beta Was this translation helpful? Give feedback.
All reactions