Algebraic data types: Difference between revisions
Content added Content deleted
m (Added some empty lines.) |
m (→{{header|Tailspin}}: better text) |
||
| Line 2,112: | Line 2,112: | ||
{{trans|Haskell}} |
{{trans|Haskell}} |
||
Tailspin doesn't have algebraic types or type names, so here using a tag. Neither does it have the |
Tailspin doesn't have algebraic types or type names, so here using a tag. Neither does it have destructuring (which seems to be posited in the problem statement). Arguably, pattern matching in Tailspin is more readable while still as concise. |
||
that is posited in the problem statement. Arguably Tailspin is more readable while still as concise. |
|||
<lang tailspin> |
<lang tailspin> |
||
processor RedBlackTree |
processor RedBlackTree |
||