HomeSort by relevance Sort by last modified time
    Searched refs:NodeBase (Results 1 - 11 of 11) sorted by null

  /external/chromium_org/ui/gfx/geometry/
r_tree_base.h 28 class NodeBase;
32 typedef ScopedVector<NodeBase> Nodes;
39 class GFX_EXPORT NodeBase {
41 virtual ~NodeBase();
54 virtual scoped_ptr<NodeBase> RemoveAndReturnLastChild() = 0;
67 NodeBase* parent() { return parent_; }
68 const NodeBase* parent() const { return parent_; }
69 void set_parent(NodeBase* parent) { parent_ = parent; }
74 NodeBase(const Rect& rect, NodeBase* parent)
    [all...]
r_tree_base.cc 28 // RTreeBase::NodeBase --------------------------------------------------------
30 RTreeBase::NodeBase::~NodeBase() {
33 void RTreeBase::NodeBase::RecomputeBoundsUpToRoot() {
39 RTreeBase::NodeBase::NodeBase(const Rect& rect, NodeBase* parent)
44 void RTreeBase::NodeBase::RecomputeLocalBounds() {
49 RTreeBase::RecordBase::RecordBase(const Rect& rect) : NodeBase(rect, NULL) {
65 scoped_ptr<RTreeBase::NodeBase>
    [all...]
r_tree.h 93 scoped_ptr<NodeBase> record;
r_tree_unittest.cc 42 void ValidateNode(const RTreeBase::NodeBase* node_base,
62 const RTreeBase::NodeBase* child_node = node->child(i);
103 typedef RTreeBase::NodeBase RTreeNodeBase;
    [all...]
  /frameworks/compile/mclinker/include/mcld/ADT/
TreeBase.h 19 class NodeBase
22 NodeBase *left;
23 NodeBase *right;
26 NodeBase()
44 NodeBase* m_pNode;
51 TreeIteratorBase(NodeBase *X)
61 void hook(NodeBase* pNode) { assert(0 && "not allowed"); }
92 void TreeIteratorBase::hook<TreeIteratorBase::Leftward>(NodeBase* pOther)
98 void TreeIteratorBase::hook<TreeIteratorBase::Rightward>(NodeBase* pOther)
104 class Node : public NodeBase
    [all...]
BinTree.h 34 DFSIterator(NodeBase *X)
59 std::stack<NodeBase *> m_Stack;
69 BFSIterator(NodeBase *X)
94 std::queue<NodeBase *> m_Queue;
123 explicit PolicyIteratorBase(NodeBase* X)
156 explicit PolicyIterator(NodeBase* X)
249 explicit TreeIterator(NodeBase* X)
283 NodeBase node;
  /frameworks/compile/mclinker/include/mcld/
InputTree.h 41 explicit PolicyIterator(NodeBase* X)
152 // FIXME: provide the iterater constructors for constant NodeBase instead of
155 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node));
247 virtual void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const = 0;
256 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const {
269 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const {
  /frameworks/compile/mclinker/lib/Core/
InputTree.cpp 39 NodeBase* node = createNode();
  /external/llvm/include/llvm/ADT/
IntervalMap.h 186 //--- IntervalMapImpl::NodeBase ---//
213 class NodeBase {
226 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
285 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
296 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
309 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
443 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
559 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
697 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
    [all...]
  /external/chromium_org/third_party/WebKit/Source/wtf/
LinkedHashSet.h 146 typedef LinkedHashSetNodeBase NodeBase;
267 NodeBase m_anchor;
276 typedef LinkedHashSetNodeBase NodeBase;
282 static void translate(Node& location, ValuePeekInType key, NodeBase* anchor)
ListHashSet.h 251 typedef ListHashSetNodeBase<ValueArg> NodeBase;
293 return static_cast<Node*>(fastMalloc(sizeof(NodeBase)));
349 AlignedBuffer<sizeof(NodeBase) * m_poolSize, WTF_ALIGN_OF(NodeBase)> m_pool;
    [all...]

Completed in 106 milliseconds