> On Oct 29, 2019, at 12:41, Christopher Lemmer Webber <cweb...@dustycloud.org> > wrote: > > But the documentation says that the `list?` predicate is O(n).
I’m not sure where you’re seeing that, but the documentation actually says just the opposite. Specifically, it says this: > This procedure effectively takes constant time due to internal caching (so > that any necessary traversals of pairs can in principle count as an extra > cost of allocating the pairs). In other words, `list?` is amortized constant time. -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/4E904F54-3605-4964-AC19-EB6617A5D9F7%40gmail.com.
