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

2015-12-23 Thread Michael Gottesman via swift-users
> On Dec 23, 2015, at 11:32 AM, Pascal Urban wrote: > >> >> On 22.12.2015, at 21:40, Michael Gottesman > > wrote: >> >> >>> On Dec 22, 2015, at 2:31 PM, Pascal Urban via swift-users >>>

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

2015-12-23 Thread Pascal Urban via swift-users
> On 22.12.2015, at 21:40, Michael Gottesman wrote: > > >> On Dec 22, 2015, at 2:31 PM, Pascal Urban via swift-users >> > wrote: >> >>> >>> On 20.12.2015, at 19:54, Maurus Kühne via swift-users >>>

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

2015-12-20 Thread Isaac Gouy via swift-users
> On Sunday, December 20, 2015 9:58 AM, Pascal Urban wrote: ... > Both of these implementations are slow because they always create binary > trees > with a depth of maxDepth instead of, well, the correct depth. Thank you! As always, I suspected I'd made a dumb mistake - but

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

2015-12-20 Thread Maurus Kühne via swift-users
> On 20.12.2015, at 19:08, Isaac Gouy via swift-users > wrote: > >> On Sunday, December 20, 2015 9:58 AM, Pascal Urban wrote: > > ... >> Both of these implementations are slow because they always create binary >> trees > >> with a depth of maxDepth

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

2015-12-20 Thread Janosch Hildebrand via swift-users
> On 20 Dec 2015, at 08:48, Isaac Gouy via swift-users > wrote: > > On Saturday, December 19, 2015 2:39 PM, David Turnbull > wrote: > >> Winners of this test have pooled memory (apr_pools) and tail recursion. > > > A simple Swift program that

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

2015-12-20 Thread Pascal Urban via swift-users
> 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=2 > >

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

2015-12-19 Thread David Turnbull via swift-users
Winners of this test have pooled memory (apr_pools) and tail recursion. Here's a version that's 5X faster: https://gist.github.com/AE9RB/ce29eacb5f2214f401af -david (https://github.com/AE9RB/SwiftGL) On Sat, Dec 19, 2015 at 10:34 AM, Isaac Gouy via swift-users < swift-users@swift.org> wrote: >

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

2015-12-19 Thread Isaac Gouy via swift-users
On Saturday, December 19, 2015 2:39 PM, David Turnbull wrote: >Here's a version that's 5X faster: >https://gist.github.com/AE9RB/ce29eacb5f2214f401af fwiw your 5X faster version also exceeds the one hour time-out. n=12 5.034secs n=16 1308.819secs n=20 >3605.874secs

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

2015-12-19 Thread Isaac Gouy via swift-users
On Saturday, December 19, 2015 2:39 PM, David Turnbull 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