This function buffers input values 8 at a time. After seeing all 8 values, it decides whether they should be encoded as a literal or repeated run.
| 1365 | /// This function buffers input values 8 at a time. After seeing all 8 values, |
| 1366 | /// it decides whether they should be encoded as a literal or repeated run. |
| 1367 | inline bool RleBitPackedEncoder::Put(uint64_t value) { |
| 1368 | ARROW_DCHECK(bit_width_ == 64 || value < (1ULL << bit_width_)); |
| 1369 | if (ARROW_PREDICT_FALSE(buffer_full_)) return false; |
| 1370 | |
| 1371 | if (ARROW_PREDICT_TRUE(current_value_ == value)) { |
| 1372 | ++repeat_count_; |
| 1373 | if (repeat_count_ > 8) { |
| 1374 | // This is just a continuation of the current run, no need to buffer the |
| 1375 | // values. |
| 1376 | // Note that this is the fast path for long repeated runs. |
| 1377 | return true; |
| 1378 | } |
| 1379 | } else { |
| 1380 | if (repeat_count_ >= 8) { |
| 1381 | // We had a run that was long enough but it has ended. Flush the |
| 1382 | // current repeated run. |
| 1383 | ARROW_DCHECK_EQ(literal_count_, 0); |
| 1384 | FlushRepeatedRun(); |
| 1385 | } |
| 1386 | repeat_count_ = 1; |
| 1387 | current_value_ = value; |
| 1388 | } |
| 1389 | |
| 1390 | buffered_values_[num_buffered_values_] = value; |
| 1391 | if (++num_buffered_values_ == 8) { |
| 1392 | ARROW_DCHECK_EQ(literal_count_ % 8, 0); |
| 1393 | FlushBufferedValues(false); |
| 1394 | } |
| 1395 | return true; |
| 1396 | } |
| 1397 | |
| 1398 | inline void RleBitPackedEncoder::FlushLiteralRun(bool update_indicator_byte) { |
| 1399 | if (literal_indicator_byte_ == NULL) { |
no outgoing calls