Searched refs:hasOutgoing (Results 1 – 14 of 14) sorted by relevance
523 private boolean hasOutgoing() {654 if (debug.on()) debug.log(() -> "hasOutgoing = " + hasOutgoing());655 while (hasOutgoing() && demand.tryDecrement()) {
530 private boolean hasOutgoing() {661 if (debug.on()) debug.log(() -> "hasOutgoing = " + hasOutgoing());662 while (hasOutgoing() && demand.tryDecrement()) {
531 private boolean hasOutgoing() {662 if (debug.on()) debug.log(() -> "hasOutgoing = " + hasOutgoing());663 while (hasOutgoing() && demand.tryDecrement()) {
537 private boolean hasOutgoing() {700 if (debug.on()) debug.log(() -> "hasOutgoing = " + hasOutgoing());701 while (hasOutgoing() && demand.tryDecrement()) {
671 … if ((dirS == "1" && !(node->hasIncoming(edge))) || (dirS == "0" && !(node->hasOutgoing(edge)))) { in parse_Lanes()866 if (!via->hasOutgoing(edg2)) { in parse_TurnsToSignalGroups()995 if (!node->hasOutgoing(toEdge)) { in parse_LanesConnections()
395 bool hasOutgoing(const NBEdge* const e) const;
242 if (!node->hasOutgoing(to)) { in mustBrake()
1525 NBNode::hasOutgoing(const NBEdge* const e) const { in hasOutgoing() function in NBNode1792 } while ((!hasOutgoing(*i) || from->isTurningDirectionAt(*i)) && *i != from); in isLeftMover()
745 bool hasOutgoing(const Expr& x);
5661 if (!diffLogicGraph.hasOutgoing(v)) constrainedBelow = false; in computeTermBounds()5827 bool TheoryArithOld::DifferenceLogicGraph::hasOutgoing(const Expr& x) in hasOutgoing() function in TheoryArithOld::DifferenceLogicGraph5915 if (!diffLogicGraph.hasIncoming(var) || !diffLogicGraph.hasOutgoing(var)) { in isUnconstrained()