Closed stchang closed 8 years ago
The implicit queue is implemented with a pair of queues, but Okasaki uses a queue of pairs. The former is much slower.
Okasaki's version requires polymorphic recursion, which Typed Racket does not currently support.
The implicit queue is implemented with a pair of queues, but Okasaki uses a queue of pairs. The former is much slower.