Home
last modified time | relevance | path

Searched refs:LeafNode (Results 1 – 4 of 4) sorted by relevance

/third_party/skia/experimental/graphite/src/geom/
DIntersectionTree.cpp59 class IntersectionTree::LeafNode final : public Node { class in skgpu::IntersectionTree
65 LeafNode() { in LeafNode() function in skgpu::IntersectionTree::LeafNode
171 LeafNode* hiNode = arena->make<LeafNode>(); in split()
204 : fRoot(fArena.make<LeafNode>()) { in IntersectionTree()
207 static_assert(kLeafNodeSize == sizeof(LeafNode)); in IntersectionTree()
DIntersectionTree.h51 class LeafNode; variable
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DIntervalMap.h563 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
626 unsigned LeafNode<KeyT, ValT, N, Traits>::
935 using Leaf = IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits>;
938 using RootLeaf = IntervalMapImpl::LeafNode<KeyT, ValT, N, Traits>;
/third_party/rust/crates/memchr/bench/data/code/
Drust-library.rs37971 struct LeafNode<K, V> {
37989 impl<K, V> LeafNode<K, V> { impl
38005 LeafNode::init(leaf.as_mut_ptr());
38019 data: LeafNode<K, V>,
38038 LeafNode::init(ptr::addr_of_mut!((*node.as_mut_ptr()).data));
38050 type BoxedNode<K, V> = NonNull<LeafNode<K, V>>;
38112 node: NonNull<LeafNode<K, V>>,
38138 Self::from_new_leaf(LeafNode::new())
38141 fn from_new_leaf(leaf: Box<LeafNode<K, V>>) -> Self {
38218 fn as_leaf_ptr(this: &Self) -> *mut LeafNode<K, V> {
[all …]