(row parquet.Row)
| 320 | } |
| 321 | |
| 322 | func (r *rowPool) Put(row parquet.Row) { |
| 323 | if cap(row) != r.size { |
| 324 | // Dont' repool slices that weren't created by this pool. |
| 325 | return |
| 326 | } |
| 327 | // Clear before putting into the pool. |
| 328 | // This is important so that pool entries don't hang |
| 329 | // onto the underlying buffers. |
| 330 | clear(row) |
| 331 | r.pool.Put(row[:0]) //nolint:all //SA6002 |
| 332 | } |
| 333 | |
| 334 | // estimateProtoSizeFromParquetRow estimates the byte-length of the corresponding |
| 335 | // trace in tempopb.Trace format. This method is unreasonably effective. |
no outgoing calls