public T set(int i, T x) {
// If index exists in front 'set' i in front
if (i < front.size()) return front.set(i, x);
// else if index exists in back set index from back (less mod front)
else return back.set(i - front.size(), x);
}
public T set(int i, T x) {
// If index exists in front 'set' i in front
if (i < front.size()) return front.set(i, x);
// else if index exists in back set index from back (less mod front)
else return back.set(i - front.size(), x);
}
