This page is part of the web mail archives of SRFI 101 from before July 7th, 2015. The new archives for SRFI 101 contain all messages, not just those from before July 7th, 2015.
Unless there are objections, I will add this to the next revision of the SRFI.
David procedure: (count obj) -> kReturns the number of pairs in the chain of pairs, obj. When given a list, this procedure returns a result equivalent to (length obj). This operation must take time bounded by O(log k).
(count '(a b c)) => 3 (count '(a (b) (c))) => 3 (count '(a b . c)) => 2 (count '()) => 0 (count 5) => 0