Would be cool to see an ATS entry

[Cody Goodman]

http://www.reddit.com/r/haskell/comments/2pvn03/pathfinding_benchmark_of_arm_for_several/

The author is taking pull requests and it would be cool to see/show off how ATS does on this problem.

I personally don't know enough ATS yet, but thought I'd put this message in front of those who did.

Also might be good press and generate interest in ATS.

[Hongwei Xi]

Well, it will only be healthy for ATS if someone other than me can stand up for this :)

A fast bitset implementation seems to be the key. I would just use a standard bitset

implementation and see how it does. If ATS can't beat C++ on this one, then it should
be pretty close. Or I just "borrow" the bitset implementation in C++ :)

--
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 ats-lang-user...@googlegroups.com.
To post to this group, send email to ats-lan...@googlegroups.com.
Visit this group at http://groups.google.com/group/ats-lang-users.
To view this discussion on the web visit https://groups.google.com/d/msgid/ats-lang-users/0c9d6af2-5af1-4892-b736-4886e2b877ae%40googlegroups.com.

[gmhwxi]

FYI.

I have made available an implementation of bit vector in ATS:

https://github.com/githwxi/ATS-Postiats/blob/master/libats/SATS/bitvec.sats

On Saturday, December 20, 2014 at 10:59:56 PM UTC-5, gmhwxi wrote:

Well, it will only be healthy for ATS if someone other than me can stand up for this :)

A fast bitset implementation seems to be the key. I would just use a standard bitset

implementation and see how it does. If ATS can't beat C++ on this one, then it should
be pretty close. Or I just "borrow" the bitset implementation in C++ :)