Searched refs:connector (Results 1 – 3 of 3) sorted by relevance
417 /// root and marking the depth of each connector value (operand). Then we join418 /// the candidate roots based on the common connector values, taking the one447 // Map from candidate connector values to their roots and depths. Using a in buildCostGraph() 517 if (!entry.connector /* new edge */ || entry.cost.first > q.depth) { in buildCostGraph() 518 if (!entry.connector) in buildCostGraph() 521 entry.connector = value; in buildCostGraph() 576 // `connector`, violating the optimality of our spanning tree. in visitUpward() 633 << entry.connector.getLoc() << "\n"; in buildPredicateList() 681 // up starting from the connector, until the candidate root is reached, and in buildPredicateList() 694 // Determine the connector in buildPredicateList() 695 Value connector = graph[target][source].connector; buildPredicateList() local [all...]
70 Value connector; member
684 // connector.724 // connector range.