class_docstr: FIFO queue with fast indexing
  
  Operations getitem, setitem, append, popleft, and len
  are amortized O(1)-time, if this data structure is used ephemerally.
code: def sample(self, k):
      return [self[i] for i in sample_n_k(len(self), k)]
  
file_path: pfrl/pfrl/collections/random_access_queue.py
imports: import itertools
  from pfrl.utils.random import sample_n_k
label_desc: Use image node_id 11 for calling the RandomAccessQueue obj's underlying member method code with example usage: obj.sample(k) and returns: unknown