LeastUpperBound

The join of two values in a lattice: the least value at or above both.

LeastUpperBound(a, b)The join of two values in a lattice: the least value at or above both.

Typed signatures

Type	Package	Applies
(any, any) -> unknown	structures	always

Domain: Structures

Details

• The Lattice protocol's member, and what Max folds when its arguments' type is a lattice.

Examples

Basic #

In a linear order, the larger of the two

live ↗

In$\mathrm{LeastUpperBound}(3, 5)$Out$5$

Scope #

Under dominance, the join of two incomparable partitions

live ↗

In$\mathrm{LeastUpperBound}({\operatorname{IntegerPartition}}([3, 1, 1, 1]), {\operatorname{IntegerPartition}}([2, 2, 2]))$Out${\operatorname{IntegerPartition}}([3, 2, 1])$

About

Examples	2

See also: GreatestLowerBound, Max, Compare