Creates an eagerly-evaluated recursive structure.

The expression is evaluated immediately when the asteroid is created, making it suitable for structures that need immediate computation.

Examples

# In a star definition
core Node,
  value: 42,
  left: asteroid(core Leaf, value: 1),
  right: asteroid(core Leaf, value: 3)

# Direct access - no special functions needed
left_value = tree.left.value  # Immediate access

Deeply launches all rockets in a nested structure.

Useful for fully evaluating lazy structures when needed.

Evaluates a rocket to get its value.

If the value is a rocket (tagged tuple), it calls the stored function. If it's not a rocket, it returns the value as-is.

Examples

rocket_value = rocket(fn -> expensive_computation() end)
result = launch(rocket_value)  # Computes and returns result

normal_value = 42
result = launch(normal_value)  # Returns 42 directly

Creates a lazily-evaluated recursive structure.

The expression is wrapped in a function and only evaluated when launch/1 is called, making it suitable for infinite sequences or expensive computations that should be deferred.

Examples

# In a star definition
core Cons,
  head: 1,
  tail: rocket(fn -> build_next_stream() end)

# Launch rocket to access value
next_values = launch(stream.tail)  # Computed when launched

Counts the depth of nested rockets without launching them.

Useful for debugging infinite or deeply nested lazy structures.