| Cost(size_t penalty) | webrtc::PartitionTreeNode | |
| Cost(size_t penalty) | webrtc::PartitionTreeNode | |
| CreateChildren(size_t max_size) | webrtc::PartitionTreeNode | |
| CreateChildren(size_t max_size) | webrtc::PartitionTreeNode | |
| CreateRootNode(const size_t *size_vector, size_t num_partitions) | webrtc::PartitionTreeNode | static |
| CreateRootNode(const size_t *size_vector, size_t num_partitions) | webrtc::PartitionTreeNode | static |
| GetOptimalNode(size_t max_size, size_t penalty) | webrtc::PartitionTreeNode | |
| GetOptimalNode(size_t max_size, size_t penalty) | webrtc::PartitionTreeNode | |
| left_child() const | webrtc::PartitionTreeNode | inline |
| left_child() const | webrtc::PartitionTreeNode | inline |
| NumPackets() | webrtc::PartitionTreeNode | |
| NumPackets() | webrtc::PartitionTreeNode | |
| packet_start() const | webrtc::PartitionTreeNode | inline |
| packet_start() const | webrtc::PartitionTreeNode | inline |
| parent() const | webrtc::PartitionTreeNode | inline |
| parent() const | webrtc::PartitionTreeNode | inline |
| PartitionTreeNode(PartitionTreeNode *parent, const size_t *size_vector, size_t num_partitions, size_t this_size) | webrtc::PartitionTreeNode | |
| PartitionTreeNode(PartitionTreeNode *parent, const size_t *size_vector, size_t num_partitions, size_t this_size) | webrtc::PartitionTreeNode | |
| right_child() const | webrtc::PartitionTreeNode | inline |
| right_child() const | webrtc::PartitionTreeNode | inline |
| set_max_parent_size(int size) | webrtc::PartitionTreeNode | inline |
| set_max_parent_size(int size) | webrtc::PartitionTreeNode | inline |
| set_min_parent_size(int size) | webrtc::PartitionTreeNode | inline |
| set_min_parent_size(int size) | webrtc::PartitionTreeNode | inline |
| this_size() const | webrtc::PartitionTreeNode | inline |
| this_size() const | webrtc::PartitionTreeNode | inline |
| ~PartitionTreeNode() | webrtc::PartitionTreeNode | |
| ~PartitionTreeNode() | webrtc::PartitionTreeNode | |