Lines Matching refs:labels
70 void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels);
74 public virtual void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels) {
259 public void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels) {
302 * version of the general visit(t, pattern) method. The labels arg
336 public VisitTreeWizardContextVisitor(TreeWizard outer, IContextVisitor visitor, IDictionary<string, object> labels, TreePattern tpattern) {
339 _labels = labels;
371 IDictionary<string, object> labels = new Dictionary<string, object>(); // reused for each _parse
373 Visit(t, rootTokenType, new VisitTreeWizardContextVisitor(this, visitor, labels, tpattern));
377 * Given a pattern like (ASSIGN %lhs:ID %rhs:.) with optional labels
379 * return true if the pattern matches and fill the labels Map with
380 * the labels pointing at the appropriate nodes. Return false if
391 public bool Parse(object t, string pattern, IDictionary<string, object> labels) {
400 bool matched = ParseCore(t, tpattern, labels);
411 * text arguments on nodes. Fill labels map with pointers to nodes
412 * in tree matched against nodes in pattern with labels.
415 protected virtual bool ParseCore(object t1, TreePattern tpattern, IDictionary<string, object> labels) {
430 if (tpattern.label != null && labels != null) {
432 labels[tpattern.label] = t1;
443 if (!ParseCore(child1, child2, labels)) {
