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

  /external/webrtc/webrtc/modules/rtp_rtcp/source/
vp8_partition_aggregator.h 23 class PartitionTreeNode {
26 PartitionTreeNode(PartitionTreeNode* parent,
32 static PartitionTreeNode* CreateRootNode(const size_t* size_vector,
35 ~PartitionTreeNode();
52 PartitionTreeNode* GetOptimalNode(size_t max_size, size_t penalty);
57 PartitionTreeNode* parent() const { return parent_; }
58 PartitionTreeNode* left_child() const { return children_[kLeftChild]; }
59 PartitionTreeNode* right_child() const { return children_[kRightChild]; }
72 PartitionTreeNode* parent_
    [all...]
vp8_partition_aggregator.cc 21 PartitionTreeNode::PartitionTreeNode(PartitionTreeNode* parent,
38 PartitionTreeNode* PartitionTreeNode::CreateRootNode(const size_t* size_vector,
40 PartitionTreeNode* root_node = new PartitionTreeNode(
46 PartitionTreeNode::~PartitionTreeNode() {
51 int PartitionTreeNode::Cost(size_t penalty)
    [all...]
vp8_partition_aggregator_unittest.cc 18 TEST(PartitionTreeNode, CreateAndDelete) {
21 PartitionTreeNode* node1 =
22 PartitionTreeNode::CreateRootNode(kVector, kNumPartitions);
23 PartitionTreeNode* node2 =
24 new PartitionTreeNode(node1, kVector, kNumPartitions, 17);
29 TEST(PartitionTreeNode, CreateChildrenAndDelete) {
34 PartitionTreeNode* root =
35 PartitionTreeNode::CreateRootNode(kVector, kNumPartitions);
47 TEST(PartitionTreeNode, FindOptimalConfig) {
52 PartitionTreeNode* root
    [all...]

Completed in 79 milliseconds