Recursive enumerations in Swift - Step-by-Step Execution

Concept Flow - Recursive enumerations

Define enum with case

↓

Case has associated value

↓

Associated value is enum itself

↓

Create instance recursively

↓

Use switch to match cases

↓

Process recursively

↓

Base case reached

↓

Return result

Recursive enumerations define cases that can hold instances of the same enum, allowing recursive data structures like trees or lists.

Execution Sample

Swift

indirect enum Number {
    case value(Int)
    case add(Number, Number)
}

let five = Number.value(5)
let sum = Number.add(five, Number.value(3))

Defines a recursive enum Number with values and addition, then creates instances representing 5 and 5 + 3.

Execution Table

Step	Action	Evaluation	Result
1	Define enum Number with cases value(Int) and add(Number, Number)	N/A	Enum type Number created
2	Create instance five = Number.value(5)	Number.value(5)	five holds value 5
3	Create instance Number.value(3)	Number.value(3)	Temporary instance holds value 3
4	Create instance sum = Number.add(five, Number.value(3))	Number.add(Number.value(5), Number.value(3))	sum holds add case with two Number values
5	Switch on sum to process	sum is add case	Extract left and right Number values
6	Process left: five is value(5)	value case with 5	Return 5
7	Process right: value(3)	value case with 3	Return 3
8	Add results 5 + 3	5 + 3	8
9	Return final result 8	N/A	Computation complete

💡 All recursive cases processed, base cases reached, computation finished

Variable Tracker

Variable	Start	After Step 2	After Step 4	Final
five	nil	Number.value(5)	Number.value(5)	Number.value(5)
sum	nil	nil	Number.add(Number.value(5), Number.value(3))	Number.add(Number.value(5), Number.value(3))
temporary Number.value(3)	nil	nil	Number.value(3)	Number.value(3)

Key Moments - 3 Insights

Why can an enum case hold the enum type itself?

Because Swift allows recursive enums with the 'indirect' keyword or by marking the enum indirect, enabling cases to hold instances of the same enum type, as shown in the execution_table step 4.

How does the recursion stop when processing the enum?

The recursion stops at base cases like 'value(Int)' which do not contain further enum instances, as seen in steps 6 and 7 where the value cases return directly.

What happens if we try to process an enum case without handling all cases in switch?

The code will not compile because Swift requires exhaustive switch statements on enums, ensuring all cases including recursive ones are handled, as implied in step 5.

Visual Quiz - 3 Questions

Look at the execution_table at step 4, what does the 'sum' variable hold?

A An enum case 'add' holding two Number instances

B An integer value 8

C An enum case 'value' holding 3

D Nil

💡 Hint

Check the 'Result' column in step 4 of execution_table

At which step does the recursion reach the base case for the left value?

A Step 5

B Step 7

C Step 6

D Step 8

💡 Hint

Look at the 'Action' and 'Evaluation' columns in steps 6 and 7

If we add another case to Number enum without updating the switch, what happens?

A The code compiles and runs normally

B The code fails to compile due to non-exhaustive switch

C The recursion never stops

D The enum loses recursive ability

💡 Hint

Refer to key_moments about exhaustive switch handling

Concept Snapshot

Recursive enumerations allow enum cases to hold instances of the same enum type.
Use 'indirect' keyword to enable recursion.
Process with switch statements handling all cases.
Base cases stop recursion.
Useful for trees, expressions, and linked structures.

Full Transcript

Recursive enumerations in Swift let you define enum cases that can hold instances of the same enum, enabling recursive data structures. The example defines an enum Number with two cases: value holding an integer, and add holding two Number instances. We create instances representing 5 and 5 + 3. Processing uses a switch statement that matches the add case, recursively processes left and right values, and sums them. The recursion stops at value cases which hold integers directly. This approach allows building and processing recursive data like expression trees. Swift requires exhaustive switch statements to handle all enum cases, ensuring safe recursion.