Rosetta Code

Algebraic data types: Difference between revisions

Page Discussion

Algebraic data types (view source)

Revision as of 20:47, 9 October 2017

19 bytes added ,  6 years ago
m
added whitespace before the TOC, added a ;Task (bold) header.
(Added Kotlin)
m (added whitespace before the TOC, added a ;Task (bold) header.)
Line 3:
Some languages offer direct support for [[wp:Algebraic_data_type|algebraic data types]] and pattern matching on them. While this of course can always be simulated with manual tagging and conditionals, it allows for terse code which is easy to read, and can represent the algorithm directly.
 
 
As an example, implement insertion in a [[wp:Red_Black_Tree|red-black-tree]]. A red-black-tree is a binary tree where each internal node has a color attribute ''red'' or ''black''. Moreover, no red node can have a red child, and every path from the root to an empty node must contain the same number of black nodes. As a consequence, the tree is balanced, and must be re-balanced after an insertion.▼
;Task:
As an example, implement insertion in a [[wp:Red_Black_Tree|red-black-tree]].
 
▲As an example, implement insertion in a [[wp:Red_Black_Tree|red-black-tree]]. A red-black-tree is a binary tree where each internal node has a color attribute ''red'' or ''black''. Moreover, no red node can have a red child, and every path from the root to an empty node must contain the same number of black nodes. As a consequence, the tree is balanced, and must be re-balanced after an insertion.
<br><br>
 
=={{header|Bracmat}}==
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/40926"