| 111 | PTree<T> const* operator[](size_t i) const { return entries_[i]; } |
| 112 | |
| 113 | void resize(size_t sz) { |
| 114 | size_ = sz; |
| 115 | ASSERT(size_ < N); |
| 116 | } |
| 117 | |
| 118 | void push_back(PTree<T> const* node) { |
| 119 | entries_[size_++] = { node }; |
no outgoing calls
no test coverage detected