-
Notifications
You must be signed in to change notification settings - Fork 72
Conversation
@@ -487,7 +497,9 @@ async def validate_prefilled( | |||
prefilled_slots = {} | |||
events = [] | |||
|
|||
for slot_name in self.required_slots(tracker): | |||
requiredSlots = self._requested_slot_without_slot_set(tracker) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
camelCase is for JS :)
@@ -23,7 +26,11 @@ def get_required_slots(self, tracker, start=None): | |||
for edge in sorted(current_edges, key=lambda e: e.get("condition") is None): | |||
target, condition = edge.get("target"), edge.get("condition") | |||
if self.check_condition(tracker, condition): | |||
required_slots.append(self.nodes.get(target)) | |||
targetNode = self.nodes.get(target) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
camel case
@@ -118,6 +118,32 @@ def required_slots_graph(conjunction="OR", negated=False): | |||
], | |||
} | |||
|
|||
def required_slots_graph_with_set_slots(conjunction="OR", negated=False): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
don't copy the test -- just change required_slots_graph
and test_required_slots
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Actually I don't want that because I specifically want to test if everything goes well when a graph does not end with a slot set.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Then you can add slotset as a parameter of the existing test. I just don't like having two copies of the same 50+ lines.
No description provided.