LatticeElement

A complete lattice is an ordered structure of values of type T. T could be anything, e.g., a set, a new data structure (like a range), or anything else. T depends on the analysis and typically has to abstract the value for the specific purpose.

This class is actually used to hold individual instances of the lattice's elements and to compute bigger elements depending on these two elements.

Implementations of this class have to implement the comparator, the least upper bound of two lattices.

Inheritors