Home
last modified time | relevance | path

Searched refs:Leaf (Results 1 – 25 of 67) sorted by relevance

123

/external/python/cpython3/Lib/lib2to3/tests/
Dtest_pytree.py35 l1 = pytree.Leaf(100, "foo")
40 l1 = pytree.Leaf(100, "foo")
44 l1 = pytree.Leaf(100, "foo")
46 l2 = pytree.Leaf(100, "foo", context=(" ", (10, 1)))
52 l1 = pytree.Leaf(2, 5)
57 l1 = pytree.Leaf(100, "foo")
58 l2 = pytree.Leaf(100, "foo", context=(" ", (1, 0)))
60 l3 = pytree.Leaf(101, "foo")
61 l4 = pytree.Leaf(100, "bar")
66 l1 = pytree.Leaf(100, "foo")
[all …]
Dtest_util.py7 from lib2to3.pytree import Node, Leaf
91 [Leaf(token.NUMBER, 1), Leaf(token.NUMBER, 2),
92 Leaf(token.NUMBER, 3)],
93 [Leaf(token.NUMBER, 1), Leaf(token.NUMBER, 3),
94 Leaf(token.NUMBER, 2), Leaf(token.NUMBER, 4)],
95 [Leaf(token.STRING, "b"), Leaf(token.STRING, "j", prefix=" ")]
/external/python/cpython2/Lib/lib2to3/tests/
Dtest_pytree.py37 l = pytree.Leaf(100, "foo")
57 l1 = pytree.Leaf(100, "foo")
62 l1 = pytree.Leaf(100, "foo")
66 l1 = pytree.Leaf(100, "foo")
68 l2 = pytree.Leaf(100, "foo", context=(" ", (10, 1)))
74 l1 = pytree.Leaf(2, 5)
79 l1 = pytree.Leaf(100, "foo")
80 l2 = pytree.Leaf(100, "foo", context=(" ", (1, 0)))
82 l3 = pytree.Leaf(101, "foo")
83 l4 = pytree.Leaf(100, "bar")
[all …]
Dtest_util.py10 from lib2to3.pytree import Node, Leaf
94 [Leaf(token.NUMBER, 1), Leaf(token.NUMBER, 2),
95 Leaf(token.NUMBER, 3)],
96 [Leaf(token.NUMBER, 1), Leaf(token.NUMBER, 3),
97 Leaf(token.NUMBER, 2), Leaf(token.NUMBER, 4)],
98 [Leaf(token.STRING, "b"), Leaf(token.STRING, "j", prefix=" ")]
/external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/
Dleaf_model_operators.h41 virtual float GetOutputValue(const decision_trees::Leaf& leaf,
45 virtual void UpdateModel(decision_trees::Leaf* leaf,
49 virtual void InitModel(decision_trees::Leaf* leaf) const = 0;
52 decision_trees::Leaf* leaf) const = 0;
64 float GetOutputValue(const decision_trees::Leaf& leaf,
67 void UpdateModel(decision_trees::Leaf* leaf, const InputTarget* target,
70 void InitModel(decision_trees::Leaf* leaf) const override;
73 decision_trees::Leaf* leaf) const override;
83 float GetOutputValue(const decision_trees::Leaf& leaf,
86 void UpdateModel(decision_trees::Leaf* leaf, const InputTarget* target,
[all …]
Dleaf_model_operators.cc20 using decision_trees::Leaf;
50 const decision_trees::Leaf& leaf, int32 o) const { in GetOutputValue()
55 Leaf* leaf, const InputTarget* target, int example) const { in UpdateModel()
67 void DenseClassificationLeafModelOperator::InitModel(Leaf* leaf) const { in InitModel()
74 const LeafStat& stat, decision_trees::Leaf* leaf) const { in ExportModel()
80 const decision_trees::Leaf& leaf, int32 o) const { in GetOutputValue()
90 Leaf* leaf, const InputTarget* target, int example) const { in UpdateModel()
108 const LeafStat& stat, decision_trees::Leaf* leaf) const { in ExportModel()
114 const decision_trees::Leaf& leaf, int32 o) const { in GetOutputValue()
123 Leaf* leaf, const InputTarget* target, int example) const { in UpdateModel()
[all …]
Dleaf_model_operators_test.cc26 using tensorflow::decision_trees::Leaf;
66 Leaf l; in TestClassificationNormalUse()
122 std::unique_ptr<Leaf> leaf(new Leaf); in TEST()
153 std::unique_ptr<Leaf> leaf(new Leaf); in TEST()
182 std::unique_ptr<Leaf> leaf(new Leaf); in TEST()
206 std::unique_ptr<Leaf> leaf(new Leaf); in TEST()
Ddecision-tree-resource.cc21 using decision_trees::Leaf;
63 Leaf* left_leaf = new_left->mutable_leaf(); in SplitNode()
70 Leaf* right_leaf = new_right->mutable_leaf(); in SplitNode()
/external/selinux/python/sepolgen/src/sepolgen/
Drefpolicy.py151 class Leaf(PolicyBase): class
262 class SecurityContext(Leaf):
271 Leaf.__init__(self, parent)
337 class ObjectClass(Leaf):
346 Leaf.__init__(self, parent)
352 class TypeAttribute(Leaf):
358 Leaf.__init__(self, parent)
365 class RoleAttribute(Leaf):
371 Leaf.__init__(self, parent)
379 class Role(Leaf):
[all …]
/external/python/cpython2/Lib/lib2to3/
Dfixer_util.py8 from .pytree import Leaf, Node
19 [keyword, Leaf(token.EQUAL, u"="), value])
22 return Leaf(token.LPAR, u"(")
25 return Leaf(token.RPAR, u")")
36 target + [Leaf(token.EQUAL, u"=", prefix=u" ")] + source)
40 return Leaf(token.NAME, name, prefix=prefix)
48 return Leaf(token.COMMA, u",")
52 return Leaf(token.DOT, u".")
70 return Leaf(token.NEWLINE, u"\n")
74 return Leaf(token.NEWLINE, u"")
[all …]
/external/python/cpython3/Lib/lib2to3/
Dfixer_util.py6 from .pytree import Leaf, Node
17 [keyword, Leaf(token.EQUAL, "="), value])
20 return Leaf(token.LPAR, "(")
23 return Leaf(token.RPAR, ")")
34 target + [Leaf(token.EQUAL, "=", prefix=" ")] + source)
38 return Leaf(token.NAME, name, prefix=prefix)
46 return Leaf(token.COMMA, ",")
50 return Leaf(token.DOT, ".")
68 return Leaf(token.NEWLINE, "\n")
72 return Leaf(token.NEWLINE, "")
[all …]
/external/python/cpython2/Lib/lib2to3/fixes/
Dfix_metaclass.py23 from ..fixer_util import Name, syms, Node, Leaf
39 if isinstance(left_side, Leaf) and \
115 if isinstance(left_node, Leaf) and \
137 if isinstance(node, Leaf) and node.type != token.DEDENT:
186 node.insert_child(2, Leaf(token.RPAR, u')'))
188 node.insert_child(2, Leaf(token.LPAR, u'('))
198 arglist.append_child(Leaf(token.COMMA, u','))
217 pass_leaf = Leaf(text_type, u'pass')
220 node.append_child(Leaf(token.NEWLINE, u'\n'))
226 pass_leaf = Leaf(text_type, u'pass')
[all …]
/external/python/cpython3/Lib/lib2to3/fixes/
Dfix_metaclass.py23 from ..fixer_util import syms, Node, Leaf
39 if isinstance(left_side, Leaf) and \
115 if isinstance(left_node, Leaf) and \
137 if isinstance(node, Leaf) and node.type != token.DEDENT:
186 node.insert_child(2, Leaf(token.RPAR, ')'))
188 node.insert_child(2, Leaf(token.LPAR, '('))
198 arglist.append_child(Leaf(token.COMMA, ','))
217 pass_leaf = Leaf(text_type, 'pass')
220 node.append_child(Leaf(token.NEWLINE, '\n'))
226 pass_leaf = Leaf(text_type, 'pass')
[all …]
Dfix_ws_comma.py20 COMMA = pytree.Leaf(token.COMMA, ",")
21 COLON = pytree.Leaf(token.COLON, ":")
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
DLowerSwitch.cpp65 BasicBlock* newLeafBlock(CaseRange& Leaf, Value* Val,
175 BasicBlock* LowerSwitch::newLeafBlock(CaseRange& Leaf, Value* Val, in newLeafBlock() argument
186 if (Leaf.Low == Leaf.High) { in newLeafBlock()
189 Leaf.Low, "SwitchLeaf"); in newLeafBlock()
192 if (cast<ConstantInt>(Leaf.Low)->isMinValue(true /*isSigned*/)) { in newLeafBlock()
194 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in newLeafBlock()
196 } else if (cast<ConstantInt>(Leaf.Low)->isZero()) { in newLeafBlock()
198 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in newLeafBlock()
202 Constant* NegLo = ConstantExpr::getNeg(Leaf.Low); in newLeafBlock()
206 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High); in newLeafBlock()
[all …]
/external/llvm/lib/Transforms/Utils/
DLowerSwitch.cpp81 BasicBlock *newLeafBlock(CaseRange &Leaf, Value *Val, BasicBlock *OrigBlock,
295 BasicBlock* LowerSwitch::newLeafBlock(CaseRange& Leaf, Value* Val, in newLeafBlock() argument
305 if (Leaf.Low == Leaf.High) { in newLeafBlock()
308 Leaf.Low, "SwitchLeaf"); in newLeafBlock()
311 if (Leaf.Low->isMinValue(true /*isSigned*/)) { in newLeafBlock()
313 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in newLeafBlock()
315 } else if (Leaf.Low->isZero()) { in newLeafBlock()
317 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in newLeafBlock()
321 Constant* NegLo = ConstantExpr::getNeg(Leaf.Low); in newLeafBlock()
325 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High); in newLeafBlock()
[all …]
/external/llvm/include/llvm/ADT/
DIntervalMap.h934 typedef IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits> Leaf; typedef
1149 return NR.get<Leaf>().safeLookup(x, NotFound); in treeSafeLookup()
1160 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1170 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, size, in branchRoot()
1177 Leaf *L = newNode<Leaf>(); in branchRoot()
1186 rootBranch().stop(n) = node[n].template get<Leaf>().stop(size[n]-1); in branchRoot()
1189 rootBranchStart() = node[0].template get<Leaf>().start(0); in branchRoot()
1211 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, Size, in splitRoot()
1267 deleteNode(&Node.get<Leaf>()); in deleteNode()
1319 return branched() ? path.leaf<Leaf>().start(path.leafOffset()) : in unsafeStart()
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DIntervalMap.h913 typedef IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits> Leaf; typedef
1139 return NR.get<Leaf>().safeLookup(x, NotFound); in treeSafeLookup()
1150 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1160 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, NULL, size, in branchRoot()
1167 Leaf *L = newNode<Leaf>(); in branchRoot()
1176 rootBranch().stop(n) = node[n].template get<Leaf>().stop(size[n]-1); in branchRoot()
1179 rootBranchStart() = node[0].template get<Leaf>().start(0); in branchRoot()
1201 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, NULL, Size, in splitRoot()
1257 deleteNode(&Node.get<Leaf>()); in deleteNode()
1309 return branched() ? path.leaf<Leaf>().start(path.leafOffset()) : in unsafeStart()
[all …]
/external/tensorflow/tensorflow/contrib/boosted_trees/proto/
Dsplit_info.proto14 // Left Leaf node.
15 tensorflow.boosted_trees.trees.Leaf left_child = 2;
17 // Right Leaf node.
18 tensorflow.boosted_trees.trees.Leaf right_child = 3;
/external/llvm/lib/DebugInfo/CodeView/
DCVTypeVisitor.cpp76 uint8_t Leaf = Data.front(); in skipPadding() local
77 if (Leaf < LF_PAD0) in skipPadding()
81 unsigned BytesToAdvance = Leaf & 0x0F; in skipPadding()
98 TypeLeafKind Leaf = TypeLeafKind(unsigned(*LeafPtr)); in visitFieldList() local
99 switch (Leaf) { in visitFieldList()
/external/clang/lib/Rewrite/
DRewriteRope.cpp616 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in Destroy() local
617 delete Leaf; in Destroy()
630 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in split() local
631 return Leaf->split(Offset); in split()
644 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in insert() local
645 return Leaf->insert(Offset, R); in insert()
653 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in erase() local
654 return Leaf->erase(Offset, NumBytes); in erase()
733 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(getRoot(Root))) in clear() local
734 Leaf->clear(); in clear()
/external/swiftshader/third_party/subzero/src/
DIceTimerTree.cpp187 TimerIdT Leaf = Nodes[StackTop].Interior; in update() local
188 if (Leaf >= LeafTimes.size()) { in update()
189 LeafTimes.resize(Leaf + 1); in update()
190 LeafCounts.resize(Leaf + 1); in update()
192 LeafTimes[Leaf] += Delta; in update()
194 ++LeafCounts[Leaf]; in update()
/external/tensorflow/tensorflow/contrib/boosted_trees/kernels/
Dtraining_ops.cc30 using boosted_trees::trees::Leaf;
48 bool IsLeafWellFormed(const Leaf& leaf) { in IsLeafWellFormed()
221 boosted_trees::trees::Leaf* const bias = in Compute()
251 boosted_trees::trees::Leaf* RetrieveBias( in RetrieveBias()
553 boosted_trees::trees::Leaf* MergeLeafWeights( in MergeLeafWeights()
554 const boosted_trees::trees::Leaf& source, in MergeLeafWeights()
555 boosted_trees::trees::Leaf* dest) { in MergeLeafWeights()
565 case boosted_trees::trees::Leaf::kVector: { in MergeLeafWeights()
581 case boosted_trees::trees::Leaf::kSparseVector: { in MergeLeafWeights()
611 case boosted_trees::trees::Leaf::LEAF_NOT_SET: { in MergeLeafWeights()
/external/llvm/test/MC/COFF/
Dcv-def-range.s41 .short 4609 # Leaf type: LF_ARGLIST
44 .short 4104 # Leaf type: LF_PROCEDURE
51 .short 5633 # Leaf type: LF_FUNC_ID
/external/libusb/libusb/os/
Dhaiku_pollfs.cpp117 if (strcmp(path.Leaf(), "hub") == 0) in WatchedEntry()
120 sscanf(path.Leaf(), "%d", &tmp); in WatchedEntry()
123 while (strcmp(parent_path.Leaf(), "usb") != 0) { in WatchedEntry()
124 sscanf(parent_path.Leaf(), "%d", &tmp); in WatchedEntry()

123