Home
last modified time | relevance | path

Searched defs:roots (Results 1 – 25 of 105) sorted by relevance

12345

/external/smali/util/src/test/java/org/jf/util/
DPathUtilTest.java39 File[] roots = File.listRoots(); in pathUtilTest1() local
53 File[] roots = File.listRoots(); in pathUtilTest2() local
68 File[] roots = File.listRoots(); in pathUtilTest3() local
80 File[] roots = File.listRoots(); in pathUtilTest4() local
92 File[] roots = File.listRoots(); in pathUtilTest5() local
104 File[] roots = File.listRoots(); in pathUtilTest6() local
116 File[] roots = File.listRoots(); in pathUtilTest7() local
128 File[] roots = File.listRoots(); in pathUtilTest8() local
140 File[] roots = File.listRoots(); in pathUtilTest9() local
152 File[] roots = File.listRoots(); in pathUtilTest10() local
[all …]
/external/tensorflow/tensorflow/core/profiler/internal/
Dtfprof_scope.cc64 std::vector<ScopeNode*> roots; in Build() local
88 std::vector<ScopeNode*> roots = Account(root_->children, opts); in ShowInternal() local
111 void TFScope::Format(const std::vector<ScopeNode*> roots, string* display_str, in Format()
122 std::vector<ScopeNode*> roots, const std::vector<string>& regexes) { in SearchRoot()
146 std::vector<ScopeNode*> TFScope::PrintScope(const std::vector<ScopeNode*> roots, in PrintScope()
196 std::vector<ScopeNode*> TFScope::Account(const std::vector<ScopeNode*>& roots, in Account()
Dtfprof_graph.cc62 std::vector<GraphNode*> roots; in Build() local
90 std::vector<GraphNode*> roots = Account(root_->children, opts, &visits); in ShowInternal() local
119 const std::vector<GraphNode*>& roots, const std::vector<string>& regexes, in SearchRoot()
149 void TFGraph::Format(const std::vector<GraphNode*> roots, string* display_str, in Format()
159 std::vector<GraphNode*> TFGraph::PrintGraph(const std::vector<GraphNode*> roots, in PrintGraph()
213 std::vector<GraphNode*> TFGraph::Account(const std::vector<GraphNode*>& roots, in Account()
Dtfprof_code.cc491 std::vector<CodeNode*> roots = Account(root_->children, opts); in ShowInternal() local
550 std::vector<CodeNode*> TFCode::SearchRoot(std::vector<CodeNode*> roots, in SearchRoot()
575 std::vector<CodeNode*> TFCode::PrintScope(const std::vector<CodeNode*> roots, in PrintScope()
612 std::vector<CodeNode*> TFCode::Account(const std::vector<CodeNode*>& roots, in Account()
/external/skia/src/pathops/
DSkPathOpsRect.cpp17 int roots = 0; in setBounds() local
34 int roots = 0; in setBounds() local
51 int roots = 0; in setBounds() local
DSkPathOpsCurve.h360 static int line_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in line_intercept_h()
369 static int line_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in line_intercept_v()
378 static int quad_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in quad_intercept_h()
383 static int quad_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in quad_intercept_v()
388 static int conic_intercept_h(const SkPoint a[2], SkScalar w, SkScalar y, double* roots) { in conic_intercept_h()
393 static int conic_intercept_v(const SkPoint a[2], SkScalar w, SkScalar x, double* roots) { in conic_intercept_v()
398 static int cubic_intercept_h(const SkPoint a[3], SkScalar , SkScalar y, double* roots) { in cubic_intercept_h()
403 static int cubic_intercept_v(const SkPoint a[3], SkScalar , SkScalar x, double* roots) { in cubic_intercept_v()
DSkDConicLineIntersection.cpp77 double roots[2]; in horizontalIntersect() local
103 int roots = this->intersectRay(rootVals); in intersect() local
155 double roots[2]; in verticalIntersect() local
376 int SkIntersections::HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots) { in HorizontalIntercept()
381 int SkIntersections::VerticalIntercept(const SkDConic& conic, SkScalar x, double* roots) { in VerticalIntercept()
DSkDQuadLineIntersection.cpp175 int roots = intersectRay(rootVals); in intersect() local
204 int roots = horizontalIntersect(axisIntercept, rootVals); in horizontalIntersect() local
260 int roots = verticalIntersect(axisIntercept, rootVals); in verticalIntersect() local
452 int SkIntersections::HorizontalIntercept(const SkDQuad& quad, SkScalar y, double* roots) { in HorizontalIntercept()
457 int SkIntersections::VerticalIntercept(const SkDQuad& quad, SkScalar x, double* roots) { in VerticalIntercept()
/external/perfetto/src/trace_processor/importers/memory_tracker/
Dgraph.cc60 std::vector<Node*> roots; in VisitInDepthFirstPreOrder() local
70 std::vector<Node*> roots; in VisitInDepthFirstPostOrder() local
189 PreOrderIterator::PreOrderIterator(std::vector<Node*>&& roots) in PreOrderIterator()
232 PostOrderIterator::PostOrderIterator(std::vector<Node*>&& roots) in PostOrderIterator()
/external/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/localedistance/
DTerritoryContainment.java74 Set<String> roots = ImmutableSet.copyOf(Sets.difference(graph.keySet(), allContained)); in TerritoryContainment() local
76 "world region '%s' must be the only containment graph root (was %s)", WORLD, roots); in TerritoryContainment() local
/external/mesa3d/src/mapi/new/
DgenCommon.py66 def getFunctionsFromRoots(roots): argument
97 def getExportNamesFromRoots(target, roots): argument
/external/eigen/unsupported/test/
Dpolynomialutils.cpp36 EvalRootsType roots = EvalRootsType::Random(deg); in realRoots_to_monicPolynomial_test() local
74 EvalRootsType roots = EvalRootsType::Random(deg); in CauchyBounds() local
Dpolynomialsolver.cpp55 const RootsType& roots( psolve.roots() ); in aux_evalSolver() local
113 void evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, const REAL_ROOTS& real_ro… in evalSolverSugarFunction()
/external/dagger2/java/dagger/hilt/internal/processedrootsentinel/
DProcessedRootSentinel.java29 String[] roots(); in roots() method
/external/eigen/unsupported/doc/examples/
DPolynomialUtils1.cpp9 Vector4d roots = Vector4d::Random(); in main() local
DPolynomialSolver1.cpp12 Vector5d roots = Vector5d::Random(); in main() local
/external/jimfs/jimfs/src/main/java/com/google/common/jimfs/
DFileTree.java50 private final ImmutableSortedMap<Name, Directory> roots; field in FileTree
53 FileTree(Map<Name, Directory> roots) { in FileTree()
DConfiguration.java241 final ImmutableSet<String> roots; field in Configuration
349 private ImmutableSet<String> roots = ImmutableSet.of(); field in Configuration.Builder
643 List<String> roots = Lists.asList(first, more); in setRoots() local
/external/skia/tests/
DPathOpsCubicLineIntersectionTest.cpp50 int roots = i.intersect(cubic, line); in testFail() local
152 int roots = doIntersect(i, cubic, line); in testOne() local
/external/skia/tools/
Drewrite_includes.py24 roots = [ variable
/external/dagger2/java/dagger/hilt/processor/internal/root/
DComponentTree.java79 ImmutableList<ComponentDescriptor> roots = in ComponentTree() local
/external/perfetto/protos/perfetto/metrics/android/
Djava_heap_stats.proto47 repeated HeapRoots roots = 7; field
/external/skia/src/core/
DSkQuadClipper.cpp34 SkScalar roots[2]; // we only expect one, but make room for 2 for safety in chopMonoQuadAt() local
/external/jarjar/src/main/com/tonicsystems/jarjar/
DKeepProcessor.java31 private final List<String> roots = new ArrayList<String>(); field in KeepProcessor
/external/angle/third_party/vulkan-deps/spirv-tools/src/source/opt/
Dremove_unused_interface_variables_pass.cpp52 std::queue<uint32_t> roots; in CollectUsedVariables() local

12345