Method Store

cpp/src/arrow/acero/asof_join_node.cc:308–336

  }

  void Store(const std::shared_ptr<RecordBatch>& batch, row_index_t row, OnType time,
             DEBUG_ADD(ByType key, OnType for_time)) {
    DEBUG_SYNC(node_, "memo ", index_, " store: for_time=", for_time, " row=", row,
               " time=", time, " key=", key, DEBUG_MANIP(std::endl));
    if (no_future_ || entries_.count(key) == 0) {
      auto& e = entries_[key];
      // that we can do this assignment optionally, is why we
      // can get away with using shared_ptr above (the batch
      // shouldn't change that often)
      if (e.batch != batch) e.batch = batch;
      e.row = row;
      e.time = time;
    } else {
      future_entries_[key].emplace(time, batch, row);
    }
    // Maintain distinct times:
    // If no times are currently maintained then the given time is distinct and hence
    // pushed. Otherwise, the invariant is that the latest time is at the back. If no
    // future times are maintained, then only one time is maintained, and hence it is
    // overwritten with the given time. Otherwise, the given time must be no less than the
    // latest time, due to time ordering, so it is pushed back only if it is distinct.
    if (times_.empty() || (!no_future_ && times_.back() != time)) {
      times_.push_back(time);
    } else {
      times_.back() = time;
    }
    // `time` is the most advanced seen yet - `UpdateTime(time)` would work but not needed
    current_time_ = time;
  }

  std::optional<const Entry*> GetEntryForKey(ByType key) const {
    auto e = entries_.find(key);