Searched refs:PartitionTreeNode (Results 1 – 3 of 3) sorted by relevance
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| D | 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_; } in parent()
58 PartitionTreeNode* left_child() const { return children_[kLeftChild]; } in left_child()
59 PartitionTreeNode* right_child() const { return children_[kRightChild]; } in right_child()
72 PartitionTreeNode* parent_;
73 PartitionTreeNode* children_[2];
[all …]
|
| D | vp8_partition_aggregator.cc | 21 PartitionTreeNode::PartitionTreeNode(PartitionTreeNode* parent, in PartitionTreeNode() function in webrtc::PartitionTreeNode
38 PartitionTreeNode* PartitionTreeNode::CreateRootNode(const size_t* size_vector, in CreateRootNode()
40 PartitionTreeNode* root_node = new PartitionTreeNode( in CreateRootNode()
46 PartitionTreeNode::~PartitionTreeNode() { in ~PartitionTreeNode()
51 int PartitionTreeNode::Cost(size_t penalty) { in Cost()
63 bool PartitionTreeNode::CreateChildren(size_t max_size) { in CreateChildren()
70 new PartitionTreeNode(this, &size_vector_[1], num_partitions_ - 1, in CreateChildren()
80 children_[kRightChild] = new PartitionTreeNode( in CreateChildren()
94 size_t PartitionTreeNode::NumPackets() { in NumPackets()
108 PartitionTreeNode* PartitionTreeNode::GetOptimalNode(size_t max_size, in GetOptimalNode()
[all …]
|
| D | vp8_partition_aggregator_unittest.cc | 18 TEST(PartitionTreeNode, CreateAndDelete) { in TEST() argument
21 PartitionTreeNode* node1 = in TEST()
22 PartitionTreeNode::CreateRootNode(kVector, kNumPartitions); in TEST()
23 PartitionTreeNode* node2 = in TEST()
24 new PartitionTreeNode(node1, kVector, kNumPartitions, 17); in TEST()
29 TEST(PartitionTreeNode, CreateChildrenAndDelete) { in TEST() argument
34 PartitionTreeNode* root = in TEST()
35 PartitionTreeNode::CreateRootNode(kVector, kNumPartitions); in TEST()
47 TEST(PartitionTreeNode, FindOptimalConfig) { in TEST() argument
52 PartitionTreeNode* root = in TEST()
[all …]
|