lazy-seq seq ops require visit on every operation

[frenchy64]

lazy_sequence's implementation uses runtime::{first,next,next_in_place} to traverse the inner seq, paying the cost of visit_seqable each step even though we know the inner seq's type once we call resolve_seq().

One idea might be to have resolve_seq() also cache the member functions of these operation as lambdas so the calls can be made directly.

  object_ptr lazy_sequence::first() const
  {
    resolve_seq();
    if(sequence)
    {
      // calls sequence->first() directly
      return cached_first(sequence);
    }
    return nil::nil_const();
  }

I'm also curious if there are other classes that have even longer "seq nesting".

[frenchy64]

Another seq container class cons is a little different. Unlike lazy_sequence::next(), cons::next() returns the inner collection. This means the subsequent runtime::next() call won't need to also go through cons::next().

jank/compiler+runtime/src/cpp/jank/runtime/obj/cons.cpp

Line 39 in 7ecc570

return runtime::seq(tail);