How deeply does Write Powerful Rust Macros cover algebraic data type?

Defines product and sum types, then demonstrates enum matching and value mapping without developing their full implementation details.

Algebraic data type

As explained in Write Powerful Rust Macros

An algebraic data type is a composite type formed from product and sum type constructors to represent a defined set of values.

An algebraic data type combines product and sum type constructors to represent a defined set of values. Structs behave like product types, while Rust enums provide sum types whose restricted states work well with pattern matching. section 7.3

The two principal forms are:

Product type: combines properties, so possible states multiply; a u8 field and a boolean field allow 512 combinations. section 7.3
Sum type: selects among alternatives, so possible states add; Rust enums model these alternatives and support pattern matching. section 7.3

Representing success or failure

A custom enum can make outcomes explicit: Either<T> has Success(T) and Failure(String). Matching on the result forces the caller to distinguish the success path from failure handling.

How Write Powerful Rust Macros covers it

liveBook manning.com

Read Write Powerful Rust Macros on liveBook Get the book at manning.com

Also explained in

liveBook manning.com

Functional Design and Architecture: Examples in HaskellAn algebraic data type is a composite type formed from alternatives, products, or both, with its structure described by type constructors.
liveBook manning.com

The Joy of JavaScriptA composite type formed by combining simpler types with sum and product structure to represent a finite set of possibilities.
liveBook manning.com

Functional Programming in Scala, Second EditionAn algebraic data type is a data type defined as a sum of one or more data constructors, where each constructor is a product of its arguments.
liveBook manning.com

Learn Haskell by ExampleAn algebraic data type is a user-defined type formed from one or more named constructors, potentially carrying fields.

Compare how 5 books explain algebraic data type →

Related concepts

Haskellused by · Haskell is a statically typed, purely functional programming language with non-strict, typically lazy evaluation.
tupleincludes · A tuple is a finite, ordered collection of elements treated as a single composite value or record.
Eitherincludes · Either is a sum type representing one of two alternatives, conventionally called Left and Right and often used for failure and success outcomes.
optionincludes · An option type is a type that explicitly represents either a value of a specified type or the absence of a value.
data constructoruses · A data constructor is a named alternative of an algebraic data type that creates values of that type, optionally containing arguments.
union typeincludes · A union type is a type whose values can be any one of several specified alternative types or variants.

This explainer was generated by Manning's knowledge graph from the text of Write Powerful Rust Macros. The section links point to the parts of the book it draws on.