Home
last modified time | relevance | path

Searched defs:node (Results 326 – 350 of 8398) sorted by relevance

1...<<11121314151617181920>>...336

/aosp_15_r20/external/guava/guava/src/com/google/common/graph/
H A DStandardNetwork.java132 public Set<E> incidentEdges(N node) { in incidentEdges()
145 public Set<N> adjacentNodes(N node) { in adjacentNodes()
160 public Set<E> inEdges(N node) { in inEdges()
165 public Set<E> outEdges(N node) { in outEdges()
170 public Set<N> predecessors(N node) { in predecessors()
175 public Set<N> successors(N node) { in successors()
179 final NetworkConnections<N, E> checkedConnections(N node) { in checkedConnections()
197 final boolean containsNode(N node) { in containsNode()
H A DForwardingGraph.java67 public Set<N> adjacentNodes(N node) { in adjacentNodes()
72 public Set<N> predecessors(N node) { in predecessors()
77 public Set<N> successors(N node) { in successors()
82 public Set<EndpointPair<N>> incidentEdges(N node) { in incidentEdges()
87 public int degree(N node) { in degree()
92 public int inDegree(N node) { in inDegree()
97 public int outDegree(N node) { in outDegree()
H A DGraph.java179 Set<N> adjacentNodes(N node); in adjacentNodes()
202 Set<N> predecessors(N node); in predecessors()
228 Set<N> successors(N node); in successors()
251 Set<EndpointPair<N>> incidentEdges(N node); in incidentEdges()
267 int degree(N node); in degree()
278 int inDegree(N node); in inDegree()
289 int outDegree(N node); in outDegree()
/aosp_15_r20/external/guava/android/guava/src/com/google/common/graph/
H A DStandardNetwork.java132 public Set<E> incidentEdges(N node) { in incidentEdges()
145 public Set<N> adjacentNodes(N node) { in adjacentNodes()
160 public Set<E> inEdges(N node) { in inEdges()
165 public Set<E> outEdges(N node) { in outEdges()
170 public Set<N> predecessors(N node) { in predecessors()
175 public Set<N> successors(N node) { in successors()
179 final NetworkConnections<N, E> checkedConnections(N node) { in checkedConnections()
197 final boolean containsNode(N node) { in containsNode()
H A DForwardingGraph.java67 public Set<N> adjacentNodes(N node) { in adjacentNodes()
72 public Set<N> predecessors(N node) { in predecessors()
77 public Set<N> successors(N node) { in successors()
82 public Set<EndpointPair<N>> incidentEdges(N node) { in incidentEdges()
87 public int degree(N node) { in degree()
92 public int inDegree(N node) { in inDegree()
97 public int outDegree(N node) { in outDegree()
H A DGraph.java179 Set<N> adjacentNodes(N node); in adjacentNodes()
202 Set<N> predecessors(N node); in predecessors()
228 Set<N> successors(N node); in successors()
251 Set<EndpointPair<N>> incidentEdges(N node); in incidentEdges()
267 int degree(N node); in degree()
278 int inDegree(N node); in inDegree()
289 int outDegree(N node); in outDegree()
/aosp_15_r20/art/compiler/optimizing/
H A Dloop_optimization.cc621 LoopNode* node = new (loop_allocator_) LoopNode(loop_info); in AddLoop() local
643 void HLoopOptimization::RemoveLoop(LoopNode* node) { in RemoveLoop()
666 bool HLoopOptimization::TraverseLoopsInnerToOuter(LoopNode* node) { in TraverseLoopsInnerToOuter()
704 void HLoopOptimization::CalculateAndSetTryCatchKind(LoopNode* node) { in CalculateAndSetTryCatchKind()
783 void HLoopOptimization::SimplifyInduction(LoopNode* node) { in SimplifyInduction()
810 void HLoopOptimization::SimplifyBlocks(LoopNode* node) { in SimplifyBlocks()
878 bool HLoopOptimization::TryOptimizeInnerLoopFinite(LoopNode* node) { in TryOptimizeInnerLoopFinite()
941 bool HLoopOptimization::TryVectorizePredicated(LoopNode* node, in TryVectorizePredicated()
965 bool HLoopOptimization::TryVectorizedTraditional(LoopNode* node, in TryVectorizedTraditional()
982 bool HLoopOptimization::OptimizeInnerLoop(LoopNode* node) { in OptimizeInnerLoop()
[all …]
/aosp_15_r20/external/skia/experimental/tskit/
H A Dpackage-lock.json54 "node": ">=4" string
68 "node": ">=4" string
92 "node": ">=4" string
104 "node": ">=4" string
145 "node": "^10.12.0 || >=12.0.0" string
157 "node": ">=8" string
169 "node": ">=8" string
182 "node": ">= 8" string
191 "node": ">= 8" string
204 "node": ">= 8" string
[all …]
/aosp_15_r20/external/apache-xml/src/main/java/org/apache/xpath/
H A DNodeSet.java130 public NodeSet(Node node) in NodeSet()
526 Node node = nodelist.item(i); in addNodesInDocOrder() local
550 Node node; in addNodesInDocOrder() local
580 Node node = nodelist.item(testIndex); in addNodesInDocOrder() local
632 public int addNodeInDocOrder(Node node, boolean test, XPathContext support) in addNodeInDocOrder()
706 public int addNodeInDocOrder(Node node, XPathContext support) in addNodeInDocOrder()
1205 Node node = m_map[i]; in removeElement() local
1258 public void setElementAt(Node node, int index) in setElementAt()
1304 Node node = m_map[i]; in contains() local
1333 Node node = m_map[i]; in indexOf() local
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/core/grappler/
H A Dgraph_view.cc25 int OpOutputPortIdToArgId(const NodeDef& node, const OpDef& op, int port_id) { in OpOutputPortIdToArgId()
29 int OpInputPortIdToArgId(const NodeDef& node, const OpDef& op, int port_id) { in OpInputPortIdToArgId()
33 bool HasSingleFanoutNode(const GraphView& graph_view, const NodeDef* node, in HasSingleFanoutNode()
39 bool HasFanouts(const GraphView& graph_view, const NodeDef* node, int port) { in HasFanouts()
44 bool HasControlFanin(const GraphView& graph_view, const NodeDef* node) { in HasControlFanin()
49 bool HasControlFanout(const GraphView& graph_view, const NodeDef* node) { in HasControlFanout()
54 bool HasControlFaninOrFanout(const GraphView& graph_view, const NodeDef* node) { in HasControlFaninOrFanout()
/aosp_15_r20/external/angle/src/compiler/translator/tree_util/
H A DIntermNodePatternMatcher.cpp23 bool IntermNodePatternMatcher::IsDynamicIndexingOfNonSSBOVectorOrMatrix(TIntermBinary *node) in IsDynamicIndexingOfNonSSBOVectorOrMatrix()
29 bool IntermNodePatternMatcher::IsDynamicIndexingOfVectorOrMatrix(TIntermBinary *node) in IsDynamicIndexingOfVectorOrMatrix()
36 bool IntermNodePatternMatcher::IsDynamicIndexingOfSwizzledVector(TIntermBinary *node) in IsDynamicIndexingOfSwizzledVector()
41 bool IntermNodePatternMatcher::matchInternal(TIntermBinary *node, TIntermNode *parentNode) const in matchInternal()
75 bool IntermNodePatternMatcher::match(TIntermBinary *node, TIntermNode *parentNode) const in match()
84 bool IntermNodePatternMatcher::match(TIntermBinary *node, in match()
102 bool IntermNodePatternMatcher::match(TIntermAggregate *node, TIntermNode *parentNode) const in match()
H A DFindPreciseNodes.cpp145 AccessChain GetAssignmentAccessChain(TIntermOperator *node) in GetAssignmentAccessChain()
154 void TraverseIndexNodesOnly(TIntermNode *node, Traverser *traverser) in TraverseIndexNodesOnly()
378 bool visitUnary(Visit visit, TIntermUnary *node) override in visitUnary()
390 bool visitBinary(Visit visit, TIntermBinary *node) override in visitBinary()
404 bool visitDeclaration(Visit visit, TIntermDeclaration *node) override in visitDeclaration()
434 bool visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *node) override in visitFunctionDefinition()
447 bool visitBranch(Visit visit, TIntermBranch *node) override in visitBranch()
459 TIntermGlobalQualifierDeclaration *node) override in visitGlobalQualifierDeclaration()
512 bool visitUnary(Visit visit, TIntermUnary *node) override in visitUnary()
527 bool visitBinary(Visit visit, TIntermBinary *node) override in visitBinary()
[all …]
/aosp_15_r20/external/freetype/src/cache/
H A Dftcmru.c29 FTC_MruNode node ) in FTC_MruNode_Prepend()
73 FTC_MruNode node ) in FTC_MruNode_Up()
122 FTC_MruNode node ) in FTC_MruNode_Remove()
206 FTC_MruNode first, node; in FTC_MruList_Find() local
240 FTC_MruNode node = NULL; in FTC_MruList_New() local
296 FTC_MruNode node; in FTC_MruList_Lookup() local
310 FTC_MruNode node ) in FTC_MruList_Remove()
333 FTC_MruNode prev, node; in FTC_MruList_RemoveSelection() local
/aosp_15_r20/device/google/contexthub/firmware/os/core/
Dheap.c67 static inline struct HeapNode* heapPrvGetNext(struct HeapNode* node) in heapPrvGetNext()
75 struct HeapNode* node; in heapInit() local
95 struct HeapNode *node = gHeapHead, *next; in heapMergeFreeChunks() local
117 struct HeapNode *node, *best = NULL; in heapAlloc() local
170 struct HeapNode *node, *t; in heapFree() local
207 struct HeapNode *node; in heapFreeAll() local
235 struct HeapNode *node; in heapGetFreeSize() local
260 struct HeapNode *node; in heapGetTaskSize() local
/aosp_15_r20/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue383/
H A DRepresenterConfigurationTest.java40 MappingNode node = (MappingNode) yaml.represent(new TestObject(27, "test")); in testDefaultFlowStyleNotOverridden() local
54 MappingNode node = (MappingNode) yaml.represent(new TestObject(27, "test")); in testDefaultFlowStyleIsOverridden() local
65 ScalarNode node = (ScalarNode) yaml.represent("test"); in testDefaultScalarStyleNotOverridden() local
80 ScalarNode node = (ScalarNode) yaml.represent("test"); in testDefaultScalarStyleOverridden() local
88 ScalarNode node = (ScalarNode) yaml.represent("test"); in testPlainStyleByDefault() local
103 ScalarNode node = (ScalarNode) yaml.represent(calendar.getTime()); in testTimeZoneNotOverridden() local
121 ScalarNode node = (ScalarNode) yaml.represent(calendar.getTime()); in testTimeZoneOverridden() local
133 ScalarNode node = (ScalarNode) yaml.represent(calendar.getTime()); in testDefaultTimeZone() local
/aosp_15_r20/external/coreboot/src/vendorcode/cavium/bdk/libbdk-hal/
H A Dbdk-l2c.c56 int bdk_l2c_set_core_way_partition(bdk_node_t node, int core, uint32_t mask) in bdk_l2c_set_core_way_partition()
66 int bdk_l2c_set_hw_way_partition(bdk_node_t node, uint32_t mask) in bdk_l2c_set_hw_way_partition()
75 int bdk_l2c_get_hw_way_partition(bdk_node_t node) in bdk_l2c_get_hw_way_partition()
80 int bdk_l2c_get_cache_size_bytes(bdk_node_t node) in bdk_l2c_get_cache_size_bytes()
86 int bdk_l2c_get_num_sets(bdk_node_t node) in bdk_l2c_get_num_sets()
130 int bdk_l2c_get_num_assoc(bdk_node_t node) in bdk_l2c_get_num_assoc()
138 int bdk_l2c_unlock_mem_region(bdk_node_t node, uint64_t start, uint64_t len) in bdk_l2c_unlock_mem_region()
H A Dbdk-pcie.c59 uint8_t bdk_pcie_config_read8(bdk_node_t node, int pcie_port, int bus, int dev, int fn, int reg) in bdk_pcie_config_read8()
85 uint16_t bdk_pcie_config_read16(bdk_node_t node, int pcie_port, int bus, int dev, int fn, int reg) in bdk_pcie_config_read16()
111 uint32_t bdk_pcie_config_read32(bdk_node_t node, int pcie_port, int bus, int dev, int fn, int reg) in bdk_pcie_config_read32()
144 void bdk_pcie_config_write8(bdk_node_t node, int pcie_port, int bus, int dev, int fn, int reg, uint… in bdk_pcie_config_write8()
164 void bdk_pcie_config_write16(bdk_node_t node, int pcie_port, int bus, int dev, int fn, int reg, uin… in bdk_pcie_config_write16()
184 void bdk_pcie_config_write32(bdk_node_t node, int pcie_port, int bus, int dev, int fn, int reg, uin… in bdk_pcie_config_write32()
202 uint64_t bdk_pcie_mem_read64(bdk_node_t node, int pcie_port, uint64_t address) in bdk_pcie_mem_read64()
216 void bdk_pcie_mem_write64(bdk_node_t node, int pcie_port, uint64_t address, uint64_t data) in bdk_pcie_mem_write64()
/aosp_15_r20/external/tensorflow/tensorflow/lite/core/
H A Dsubgraph.cc78 TfLiteStatus ReportOpError(TfLiteContext* context, const TfLiteNode& node, in ReportOpError()
210 const TfLiteNode& node(size_t index) const override { in node() function in tflite::InterpreterInfo
288 TfLiteNode& node = nodes_and_registration_[node_index].first; in CleanupNode() local
461 TfLiteNode* node = &nodes_and_registration_[node_index].first; in ReplaceNodeSubsetsWithDelegateKernels() local
825 TfLiteNode& node = node_and_reg.first; in AddNodeWithParameters() local
878 const TfLiteNode* node, const TfLiteRegistration* registration) const { in OpMightHaveSideEffect() argument
1004 TfLiteNode* node) { in OpPrepare()
1037 TfLiteNode* node) { in OpInvoke()
1061 TfLiteStatus Subgraph::MayAllocateOpOutput(TfLiteNode* node) { in MayAllocateOpOutput()
1088 TfLiteNode& node = nodes_and_registration_[node_index].first; in PrepareOpsStartingAt() local
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/compiler/mlir/tfr/python/
H A Dop_reg_gen.py38 def visit_Name(self, node): argument
41 def visit_Constant(self, node): argument
44 def visit_keyword(self, node): argument
47 def visit_List(self, node): argument
50 def visit_arguments(self, node): argument
53 def visit_FunctionDef(self, node): argument
120 def transform_ast(self, node, ctx): argument
/aosp_15_r20/external/skia/infra/bots/gen_tasks_logic/
H A Dcompile_cas.go117 type node struct { struct
118 children map[string]*node
119 name string
120 isLeaf bool
133 func (n *node) isRoot() bool {
138 func (n *node) add(entry []string) {
185 func (n *node) entries() [][]string {
/aosp_15_r20/external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/javaparsermodel/
H A DJavaParserFacade.java169 public SymbolReference<ResolvedTypeDeclaration> solve(ThisExpr node) { in solve()
211 …private void solveArguments(Node node, NodeList<Expression> args, boolean solveLambdas, List<Resol… in solveArguments()
290 public ResolvedType getType(Node node) { in getType()
307 public ResolvedType getType(Node node, boolean solveLambdas) { in getType()
350 private Optional<ResolvedType> find(DataKey<ResolvedType> dataKey, Node node) { in find()
446 private ResolvedType getTypeConcrete(Node node, boolean solveLambdas) { in getTypeConcrete()
451 protected com.github.javaparser.ast.body.TypeDeclaration<?> findContainingTypeDecl(Node node) { in findContainingTypeDecl()
462 protected Node findContainingTypeDeclOrObjectCreationExpr(Node node) { in findContainingTypeDeclOrObjectCreationExpr()
562 public ResolvedType convert(Type type, Node node) { in convert()
592 public ResolvedReferenceTypeDeclaration getTypeDeclaration(Node node) { in getTypeDeclaration()
[all …]
/aosp_15_r20/external/nullaway/nullaway/src/main/java/com/uber/nullaway/dataflow/
H A DAccessPath.java132 public static AccessPath fromLocal(LocalVariableNode node) { in fromLocal()
142 static AccessPath fromVarDecl(VariableDeclarationNode node) { in fromVarDecl()
156 static AccessPath fromFieldAccess(FieldAccessNode node, AccessPathContext apContext) { in fromFieldAccess()
161 private static AccessPath fromNodeAndContext(Node node, AccessPathContext apContext) { in fromNodeAndContext()
175 MethodInvocationNode node, VisitorState state, AccessPathContext apContext) { in fromMethodCall()
184 MethodInvocationNode node, AccessPathContext apContext) { in fromVanillaMethodCall()
256 MethodInvocationNode node, VisitorState state, AccessPathContext apContext) { in getForMapInvocation()
264 private static Node stripCasts(Node node) { in stripCasts()
306 MethodInvocationNode node, VisitorState state, AccessPathContext apContext) { in fromMapGetCall()
329 Node node, VisitorState state, AccessPathContext apContext) { in getAccessPathForNode()
[all …]
/aosp_15_r20/external/jemalloc_new/test/unit/
H A Dph.c43 node_print(const node_t *node, unsigned depth) { in node_print()
88 node_validate(const node_t *node, const node_t *parent) { in node_validate()
152 node_remove(heap_t *heap, node_t *node) { in node_remove()
160 node_t *node = heap_remove_first(heap); in node_remove_first() local
167 node_t *node = heap_remove_any(heap); in node_remove_any() local
251 node_t *node = node_remove_first(&heap); in TEST_BEGIN() local
265 node_t *node = heap_first(&heap); in TEST_BEGIN() local
288 node_t *node = heap_any(&heap); in TEST_BEGIN() local
/aosp_15_r20/external/tensorflow/tensorflow/core/grappler/optimizers/
H A Dstatic_schedule.cc34 const VirtualPlacer& placer, const NodeDef& node) { in PredictExecutionTime()
67 for (const NodeDef& node : item.graph.node()) { in EstimateEarliestExecutionTimes() local
82 for (const NodeDef& node : item.graph.node()) { in EstimateEarliestExecutionTimes() local
105 const NodeDef* node = ready_nodes.front(); in EstimateEarliestExecutionTimes() local
139 for (const NodeDef& node : item.graph.node()) { in EstimateRequiredTimes() local
145 for (const NodeDef& node : item.graph.node()) { in EstimateRequiredTimes() local
158 for (const NodeDef& node : item.graph.node()) { in EstimateRequiredTimes() local
176 const NodeDef* node = ready_nodes.front(); in EstimateRequiredTimes() local
/aosp_15_r20/packages/apps/Car/RotaryController/src/com/android/car/rotary/
DTreeTraverser.java43 AccessibilityNodeInfo findNodeOrAncestor(@NonNull AccessibilityNodeInfo node, in findNodeOrAncestor()
57 AccessibilityNodeInfo findNodeOrAncestor(@NonNull AccessibilityNodeInfo node, in findNodeOrAncestor()
80 AccessibilityNodeInfo depthFirstSearch(@NonNull AccessibilityNodeInfo node, in depthFirstSearch()
94 AccessibilityNodeInfo depthFirstSearch(@NonNull AccessibilityNodeInfo node, in depthFirstSearch()
124 AccessibilityNodeInfo reverseDepthFirstSearch(@NonNull AccessibilityNodeInfo node, in reverseDepthFirstSearch()
150 void depthFirstSelect(@NonNull AccessibilityNodeInfo node, in depthFirstSelect()
173 private AccessibilityNodeInfo copyNode(@Nullable AccessibilityNodeInfo node) { in copyNode()

1...<<11121314151617181920>>...336