Lesson 23 of 59

5 mins read

Iterables & Higher-Order Methods: map, where, fold

In Plain English

Dart collections implement the `Iterable<T>` interface, providing rich functional chaining methods. `.map()` transforms each element; `.where()` filters by boolean predicates; `.expand()` flattens nested lists; `.reduce()` combines elements of the same type; and `.fold()` aggregates elements starting with an explicit initial seed value.

The Mental Model

"A functional pipeline is like an industrial water filtration plant: water flows through sediment filters (.where), mineralization stages (.map), and into a clean holding reservoir (.fold)."

Deep Dive: How It Works

Lazy Iterables: Methods like `.map()` and `.where()` return lazy `Iterable` objects that do not compute until `.toList()` or iteration occurs.

`.reduce()` vs `.fold()`: `.reduce()` uses the first element as accumulator and throws on empty lists; `.fold(initialValue, ...)` is safe on empty collections.

Pipeline Chaining: Combining multiple operations in a fluent readable stream.

Syntax Blueprint

final result = numbers
  .where((n) => n.isEven)
  .map((n) => n * 10)
  .fold(0, (sum, n) => sum + n);

Functional transformation pipeline chaining filter, map, and aggregation.

Core Rules to Remember

Lazy Evaluation: Chained transformations execute only when elements are iterated.

Safe Aggregation with fold: Always prefer `.fold(seed, ...)` over `.reduce()` to handle empty collections safely.

Immutability Friendly: Higher-order methods return new collections without mutating the source list.

Common Beginner Traps & How to Fix Them

Mistake:Calling `.reduce()` on an empty collection and crashing with `StateError (No element)`.

Why it happens: `.reduce()` requires at least one element to initialize the accumulator.

How to fix: Use `.fold(0, (acc, item) => ...)` with an explicit initial seed value.

Pro Tip: Use `.any((item) => ...)` and `.every((item) => ...)` for fast short-circuiting boolean checks across collections.

Live Interactive Example

Hit Run Code to see it live

Functional Data Processing Pipeline

Python 3.12

Output Console

Click "Run Code" to view the rendered output.

How it works: Filtered positive numbers (15, 20, 35, 50 = 120), added 10% bonus (132.00) using fold.

Your Turn: Micro Challenge

No pressure! Edit the starter code below and test your solution with instant feedback.

Micro Exercise

Filter and Sum Even Numbers

Given `final numbers = [1, 2, 3, 4, 5, 6];`.
Use `.where((n) => n % 2 == 0).fold(0, (a, b) => a + b)` to sum even numbers.
Print `Even Sum: $sum`.

Sandbox Output

Click "Run & Check" to test your solution.

Finished reading and practicing?

Mark this lesson as completed to update your course progress.