On Mon, Feb 10, 2014 at 6:49 PM, Yuhao Dong <ith...@outlook.com> wrote: > > - Some things in racket are pathologically slow. As an example, try > implementing a cipher with loops and array indices and bytestrings. It > will end up orders of magnitude slower than, say, C or Go or Java, or > sometimes even Python.
The other drawbacks of Racket you mention require more complex answers, but this just shouldn't happen. Can you provide an example? The one case where this might be expected is computation on 32-bit integers on a 32-bit system, since Racket fixnums are only 31 bits, and computation over that size will allocate lots of bignums (or similar for 64 bits). Sam ____________________ Racket Users list: http://lists.racket-lang.org/users
