Partial Ordering of Specializations - The HAC Language
Description: The HAC Language

Next: Template Argument Deduction, Previous: Template Specialization, Up: Templates

### 9.8 Partial Ordering of Specializations

Partial and full specializations for a given template definition may be defined on a partial order. Specializations A and B are ordered A < B if and only if all template parameters that satisfy A also satisfy B and |A| < |B|. (In English, ...) If |A| = |B|, and A \neq B, then A and B are not comparable. Examples, please.