A poset is complete if every directed subset has a least upper bound.
Example Every discrete poset is a DCPO [math-4J1T]
Every discrete poset is a DCPO, every singleton sets are directed, with least upper bound .
Definition Category of DCPOs [math-P5X4]
DCPOs with Scott continuous, via Scott topology, it's a full subcategory of the category of topological spaces.