Searched refs:BufferIntervalTreeNode (Results 1 – 2 of 2) sorted by relevance
313 struct BufferIntervalTreeNode { struct323 BufferIntervalTreeNode* left; argument325 BufferIntervalTreeNode* right; argument327 BufferIntervalTreeNode* parent; argument345 BufferIntervalTreeNode* GetRoot() { return root_; } in GetRoot()348 BufferIntervalTreeNode* root_ = nullptr;349 std::list<BufferIntervalTreeNode> node_storage_;
629 node_storage_.emplace_back(BufferIntervalTreeNode{ in Add()638 BufferIntervalTreeNode* parent = root_; in Add()660 BufferIntervalTreeNode* to_delete = root_; in Remove()681 std::function<void(BufferIntervalTreeNode*)> fix_up = in Remove()682 [&](BufferIntervalTreeNode* node) { in Remove()737 BufferIntervalTreeNode* to_promote = to_delete->right; in Remove()792 std::vector<const BufferIntervalTreeNode*> visiting_stack; in ChunksOverlappingInTime()795 const BufferIntervalTreeNode* top = visiting_stack.back(); in ChunksOverlappingInTime()