Talk:Red black tree sort: Difference between revisions
that's a good question
(Red-Black Trees in a Functional Setting) |
(that's a good question) |
||
Line 6:
something like Red-Black Tree. Thoughts? --Short Circuit 22:19, 6 November 2007 (MST)
:Are you trying to do this? On [[Algebraic data types]] I've added a reference to a paper describing what I think the author wanted done on that task.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:46, 20 June 2022 (UTC)
:: Actually, I am trying to do the opposite -- though for similar reasons. Here, I am trying to make room for red-black tree implementations which are not based on pattern matching.
:: In this context -- once we have more of the details sorted out -- it might be interesting to compare some of the implementations (pattern matching vs non-pattern matching, in languages where an implementation has been supplied for each approach). --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 18:45, 20 June 2022 (UTC)
== Validation issues ==
| |||