Is there an efficient way to walk a vector n elements in?

[njlr]

[nikhedonia]

although this is possible:

 vector >> drop(n) >> take(m);

Given that this is an random access container I'd suggest implementing an slice / advance operator that is random-access iterator aware.