[swift-users] problems with simple binary-trees program

Isaac Gouy igouy2 at yahoo.com
Sun Dec 20 01:48:29 CST 2015


On Saturday, December 19, 2015 2:39 PM, David Turnbull <dturnbull at gmail.com> wrote:

>Winners of this test have pooled memory (apr_pools) and tail recursion.


A simple Swift program that completed the workloads within an hour time-out would be an incredible improvement :-)

Instead of looking at the "Winners" compare with the TypeScript program

http://benchmarksgame.alioth.debian.org/u64q/program.php?test=binarytrees‚ü®=typescript&id=2

Why does a Swift transliteration of that program perform so slowly?


More information about the swift-users mailing list