Talk:Red black tree sort: Difference between revisions
Content added Content deleted
(→Validation issues: new section) |
(Red-Black Trees in a Functional Setting) |
||
| Line 1: | Line 1: | ||
I am creating this task because the [[Algebraic data types]] task introduces unnecessary complexity in some languages. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 17:55, 13 June 2022 (UTC) |
I am creating this task because the [[Algebraic data types]] task introduces unnecessary complexity in some languages. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 17:55, 13 June 2022 (UTC) |
||
:On the talk page for [[Algebraic data types]] |
|||
I like the task, but I don't think it's a good application of the general case of pattern matching. Pattern |
|||
Matching should probably be geared towards globs and regular expressions, while this page should get moved to |
|||
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) |
|||
== Validation issues == |
== Validation issues == |
||