Home
last modified time | relevance | path

Searched refs:FindPath (Results 1 – 25 of 65) sorted by relevance

123

/external/libchrome/base/
Dvalues.h236 Value* FindPath(std::initializer_list<StringPiece> path);
237 Value* FindPath(span<const StringPiece> path);
238 const Value* FindPath(std::initializer_list<StringPiece> path) const;
239 const Value* FindPath(span<const StringPiece> path) const;
Dvalues.cc319 Value* Value::FindPath(std::initializer_list<StringPiece> path) { in FindPath() function in base::Value
320 return const_cast<Value*>(const_cast<const Value*>(this)->FindPath(path)); in FindPath()
323 Value* Value::FindPath(span<const StringPiece> path) { in FindPath() function in base::Value
324 return const_cast<Value*>(const_cast<const Value*>(this)->FindPath(path)); in FindPath()
327 const Value* Value::FindPath(std::initializer_list<StringPiece> path) const { in FindPath() function in base::Value
329 return FindPath(make_span(path.begin(), path.size())); in FindPath()
332 const Value* Value::FindPath(span<const StringPiece> path) const { in FindPath() function in base::Value
360 const Value* result = FindPath(path); in FindPathOfType()
/external/angle/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h110 int FindPath(GraphId source, GraphId dest, int max_path_len,
Dgraphcycles_test.cc284 int path_len = graph_cycles.FindPath(id[nodes[from]], id[nodes[to]], in TEST()
389 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
Dgraphcycles.cc634 int GraphCycles::FindPath(GraphId idx, GraphId idy, int max_path_len, in FindPath() function in absl::synchronization_internal::GraphCycles
680 return FindPath(x, y, 0, nullptr) > 0; in IsReachable()
/external/libtextclassifier/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h110 int FindPath(GraphId source, GraphId dest, int max_path_len,
Dgraphcycles_test.cc285 int path_len = graph_cycles.FindPath(id[nodes[from]], id[nodes[to]], in TEST()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
/external/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h110 int FindPath(GraphId source, GraphId dest, int max_path_len,
Dgraphcycles_test.cc285 int path_len = graph_cycles.FindPath(id[nodes[from]], id[nodes[to]], in TEST()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
/external/cronet/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h110 int FindPath(GraphId source, GraphId dest, int max_path_len,
Dgraphcycles_test.cc285 int path_len = graph_cycles.FindPath(id[nodes[from]], id[nodes[to]], in TEST()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
/external/openscreen/third_party/abseil/src/absl/synchronization/internal/
Dgraphcycles.h110 int FindPath(GraphId source, GraphId dest, int max_path_len,
Dgraphcycles_test.cc285 int path_len = graph_cycles.FindPath(id[nodes[from]], id[nodes[to]], in TEST()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
/external/tensorflow/third_party/absl/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h110 int FindPath(GraphId source, GraphId dest, int max_path_len,
Dgraphcycles_test.cc285 int path_len = graph_cycles.FindPath(id[nodes[from]], id[nodes[to]], in TEST()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
/external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h110 int FindPath(GraphId source, GraphId dest, int max_path_len,
Dgraphcycles_test.cc285 int path_len = graph_cycles.FindPath(id[nodes[from]], id[nodes[to]], in TEST()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
Dgraphcycles.cc630 int GraphCycles::FindPath(GraphId idx, GraphId idy, int max_path_len, in FindPath() function in absl::synchronization_internal::GraphCycles
676 return FindPath(x, y, 0, nullptr) > 0; in IsReachable()
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h110 int FindPath(GraphId source, GraphId dest, int max_path_len,
Dgraphcycles_test.cc285 int path_len = graph_cycles.FindPath(id[nodes[from]], id[nodes[to]], in TEST()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
/external/tensorflow/tensorflow/compiler/xla/service/graphcycles/
Dgraphcycles.h115 int FindPath(int32_t source, int32_t dest, int max_path_len,
Dgraphcycles.cc300 int GraphCycles::FindPath(int32_t x, int32_t y, int max_path_len, in FindPath() function in tensorflow::GraphCycles
341 return FindPath(x, y, 0, nullptr) > 0; in IsReachable()
Dgraphcycles_test.cc300 int path_len = graph_cycles.FindPath(nodes[from], nodes[to], in TEST()
401 int np = g_.FindPath(x, y, kPathSize, path); in Path()
/external/perfetto/src/trace_processor/importers/common/
Dclock_tracker.cc176 ClockTracker::ClockPath ClockTracker::FindPath(ClockId src, ClockId target) { in FindPath() function in perfetto::trace_processor::ClockTracker
240 ClockPath path = FindPath(src_clock_id, target_clock_id); in ConvertSlowpath()
Dclock_tracker.h329 ClockPath FindPath(ClockId src, ClockId target);

123