I'm actually already building a stack and using a set (disguised as a map) to coalesce duplicate edges, but I have a big file to process next week, so I'll let you know.

I had actually thought that I could find an artful way to conceal the stack-as-data-structure as a stack-as-runtime-call-structure, but that was beyond my capabilities, alas. :(

Maybe someday.

On Fri, Dec 16, 2016 at 8:05 PM, Magnus Therning <magnus@therning.org> wrote:

John Lusk <johnlusk4@gmail.com> writes:

> Ha! Fixed! And committed to the GitHub repo mentioned previously, if
> anybody's interested.
>
> I spent too much time on it, but I couldn't let it go and now I have
> to brag.

Excellent!

If you have use for it in the future, but find that it's too slow or
demanding on memory then I *think* it's possible to skip building the
full tree and instead use a stack :)

/M

--
Magnus Therning OpenPGP: 0x927912051716CE39
email: magnus@therning.org jabber: magnus@therning.org
twitter: magthe http://therning.org/magnus

Finagle's Fourth Law:
Once a job is fouled up, anything done to improve it only makes it
worse.

_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners