Searched refs:IsPathEnd (Results 1 – 5 of 5) sorted by relevance
416 !IsPathEnd(chain_end) && !IsPathEnd(destination));459 if (!IsPathEnd(destination)) {471 !IsPathEnd(chain_end)) {705 while (!IsPathEnd(node)) {848 if (IsPathEnd(current)) {1063 if (!IsPathEnd(node0) && !IsPathEnd(node1)) {1171 return !IsPathEnd(node) &&1412 if (IsPathEnd(chain_end)) {1533 while (!IsPathEnd(node)) {1744 if (IsPathEnd(node)) {[all …]
50 if (IsPathEnd(chain_end)) return false; in MakeNeighbor()55 while (!IsPathEnd(next) && arc_evaluator_(chain_end, next) <= max_arc_value) { in MakeNeighbor()224 if (second_pair_node < 0 || IsPathEnd(second_pair_node) || in MakeNeighbor()288 if (IsPathEnd(node1)) return false; in MakeNeighbor()1337 [this](int64_t node) { return IsPathEnd(node); }, in FindMostExpensiveChainsOnRemainingPaths()1373 if (IsPathEnd(insertion_node)) return false; in RelocateSubTripFromPickup()1402 } while (num_opened_pairs != 0 && !IsPathEnd(current)); in RelocateSubTripFromPickup()1421 if (IsPathEnd(insertion_node)) return false; in RelocateSubTripFromDelivery()1619 } while (num_opened_pairs != 0 && !IsPathEnd(current)); in ExtractChainsFromPickup()
705 if (IsPathEnd(base)) { in MakeNeighbor()
1356 DCHECK(!IsPathEnd(node)); in Next()1454 DCHECK(!IsPathEnd(node)); in OldNext()1497 bool IsPathEnd(int64_t node) const { return node >= number_of_nexts_; } in IsPathEnd() function1504 return !IsPathEnd(node) && inactives_[node]; in IsInactive()
63 public bool IsPathEnd { property in MonoDevelop.Components.PathEntry315 if (leftPath [i].IsPathEnd) { in OnExposeEvent()