| 72 | } |
| 73 | |
| 74 | bool VectorPool::release(VectorPtr& vector) { |
| 75 | if (FOLLY_UNLIKELY(vector == nullptr)) { |
| 76 | return false; |
| 77 | } |
| 78 | if (vector.use_count() != 1 || vector->size() > kMaxRecycleSize) { |
| 79 | return false; |
| 80 | } |
| 81 | |
| 82 | auto cacheIndex = toCacheIndex(vector->type()); |
| 83 | if (cacheIndex < 0) { |
| 84 | return false; |
| 85 | } |
| 86 | return vectors_[cacheIndex].maybePushBack(vector); |
| 87 | } |
| 88 | |
| 89 | size_t VectorPool::release(std::vector<VectorPtr>& vectors) { |
| 90 | size_t numReleased = 0; |
no test coverage detected