62 def _match_adjacent(block, ctx, ctx_set):  argument
64     if block[0] not in ctx_set:
68     if block[1] not in ctx_set:
80             if block[k] not in ctx_set:
86 def _might_match_adjacent(block, ctx, ctx_set, descendant_labels):  argument
87     matched = _match_adjacent(block, ctx, ctx_set)
110     def match(self, ctx, ctx_set):  argument
113                 if _match_adjacent(block, ctx, ctx_set) != len(block):
120     def might_match(self, ctx, ctx_set, descendant_labels):  argument
123                 if not _might_match_adjacent(block, ctx, ctx_set,
138     def is_irrelevant(self, ctx, ctx_set, descendant_labels):  argument
139         return self.match(ctx, ctx_set)
142     def requires_action(self, ctx, ctx_set, descendant_labels):  argument
143         return not self.might_match(ctx, ctx_set, descendant_labels)
146     def might_pass(self, failed_ctx, failed_ctx_set, ctx, ctx_set,  argument
150                 if (_match_adjacent(block, ctx, ctx_set) >
152                     return self.might_match(ctx, ctx_set, descendant_labels)
157     def is_irrelevant(self, ctx, ctx_set, descendant_labels):  argument
158         return not self.might_match(ctx, ctx_set, descendant_labels)
161     def requires_action(self, ctx, ctx_set, descendant_labels):  argument
162         return self.match(ctx, ctx_set)
165     def might_pass(self, failed_ctx, failed_ctx_set, ctx, ctx_set,  argument
169                 if (_match_adjacent(block, ctx, ctx_set) <
171                     return not self.match(ctx, ctx_set)
254                 if obj.requires_action(ctx, ctx_set, labels):
274                 elif obj.is_irrelevant(ctx, ctx_set, labels):
290                 if filter.might_pass(failed_ctx, failed_ctx_set, ctx, ctx_set,
295                 if filter.might_pass(failed_ctx, failed_ctx_set, ctx, ctx_set,
301             node.failed_cases.appendleft((ctx, ctx_set,
313         ctx_set = set(ctx)