I don't understand how the range-based version works.
The following code is like the generator-based version:
#include
"share/atspre_staload.hats"
fun
triples
(
) : stream_vt(@(int,int,int)) =
aux1(1) where
{
//
vtypedef
res_vt = stream_vt(@(int,int,int))
//
fun
aux1
(z: int): res_vt = aux2(1, z)
and
aux2
(x: int, z: int): res_vt =
if x <= z then aux3(x, x, z) else aux1(z+1)
and
aux3
(x: int, y: int, z: int): res_vt =
$ldelay
(
if
y <= z
then
(
stream_vt_cons((x, y, z), aux3(x, y+1, z))
)
else !(aux2(x+1, z))
)
}
implement
main0(argc,argv) = let
//
#define N 1000
//
val ts =
stream_vt_filter_fun
( triples(),
lam(ts) => let val (x, y, z) = ts in x*x + y*y = z*z end
)
val ts = stream_vt_takeLte(ts, N)
in
(
stream_vt_con_free
(stream_vt_foreach<(int, int, int)>(ts))
) where
{
implement
stream_vt_foreach$fwork<@(int,int,int)><void>(t,env) =
let
val (x, y, z) = t
in
println!(x, "," , y , "," , z)
end
}
end // end of [main0]
On Sunday, January 6, 2019 at 11:31:45 AM UTC-5, aditya siram wrote:
>
> Anyone want to help make a benchmark better? I tried my hand at an ATS
> implementation [1] of the Pythagoras Benchmark [2] from a few days ago and
> currently the stream based ATS version is running about about 2.5x slower
> compared to the fastest range based one in D [3].
>
> [1] https://github.com/deech/triples-ats
> [2] https://github.com/atilaneves/pythagoras
> [3] https://github.com/atilaneves/pythagoras/blob/master/range.d
>
>
--
You received this message because you are subscribed to the Google Groups
"ats-lang-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/ats-lang-users.
To view this discussion on the web visit
https://groups.google.com/d/msgid/ats-lang-users/aeea7a1b-810f-4afd-a214-8b235ea5e8b3%40googlegroups.com.
