Hi, I tried to implement some sort of balancing search tree. For this I need some sort of rotation operation, these need to look a bit deeper (two nodes) into the tree, but I only call them if I already now that these exists (aka are none leafs). But to look into the tree I need to pattern match on …

Probably just do nothing. If you get two nodes, rotate them and return the rotated nodes. If you get anything else just return it as is - the identity function. Maybe need to see some code to give a better recomendation.

First some code (there are 4 rotations (two double rotations and two single rotations) here a single rotation (the double rotations have to look one deeper and have one patternmatch more): single_L : a -> Tree a -> Tree a -> Tree a single_L el lst rst = case rst of E -> undefined T el2 _…

I would be interested in seeing the code that calls single_L as well. Since it’s already doing the pattern matching, can it pass in el, rlst, and rrst instead of rst?

“No runtime errors” is a very high priority for Elm. This means that you are not allowed to create functions that can fail. (Unless you’re implementing a core function like modBy 0.) The unsatisfying the solution of choosing a default value is probably your best choice. What I would do is: Use Deb…

What to do if you have a Non Exhaustive pattern match

Learn

Topic		Replies	Views
Cases where exhaustive pattern matching got in the way? Request Feedback	8	1688	May 31, 2019
Avoid Nested Pattern Matching Learn	1	763	November 11, 2023
Pattern match on record field values Learn	8	2752	September 4, 2021
Tail-call optimization Show and Tell	15	1658	June 8, 2021
Can I pattern match without a case expression? Learn	3	686	July 11, 2022

What to do if you have a Non Exhaustive pattern match

Related topics