A set of IndexIVFs concatenated together in a FIFO fashion. at each “step”, the oldest index slice is removed and a new index is added.
index should be initially empty and trained
void step(const Index *sub_index, bool remove_oldest)
Add one index to the current index and remove the oldest one.
sub_index – slice to swap in (can be NULL)
remove_oldest – if true, remove the oldest slices
common index that contains the sliding window
InvertedLists of index.
number of slices currently in index
same as index->nlist
- SlidingIndexWindow(Index *index)