1. Each operation lists the big-O complexity; most operations are O(lg N).
2. There are no mutations
3. I think it would be rather redundant to mention that every operation that returns a new object conses.
2. There are no mutations
3. I think it would be rather redundant to mention that every operation that returns a new object conses.
That being said, for batch processing in single-threaded applications, the older SBCL gc is actually pretty good.
As far as constant factors go, this library is a middle ground; they strive for low constant factors in their algorithms, but it relies almost entirely on generic functions, so that alone is going to limit the maximum speed in e.g. tight loops.