[Haskell-cafe] Re: tail-recursing through an associative list

[Seth Gordon]

apfelmus at quantentunnel.de wrote:
> For logarithmic access times, you should use a binary search tree like
> Data.Map or similar. The problem in your case could be that matchKeys is
> only approximate and your keys cannot be ordered in suitable fasion.

That is precisely the problem that I was dealing with.

I've been ruminating on some way to use a map to solve the problem,
although since this project has been demoted from "cool side project for
work" to "cool side project for my Copious Free Time", I don't know when
I'll be able to implement it.

Thanks for all your suggestions--at least I feel like I am on the right
track.