From 2594eff0980780d2e65713eeb9e1c769252c8a5c Mon Sep 17 00:00:00 2001 From: Steve Downey Date: Thu, 22 Oct 2026 07:41:31 -0400 Subject: [PATCH] [temp.constr.order] Subsumption is a preorder, not a partial ordering The note says the subsumption relation defines a partial ordering on constraints. By the definition in p1, A && B and B && A subsume each other and are different constraints, so the relation is not antisymmetric: it is a preorder. The partial ordering the note goes on to list uses is the ordering of declarations that p4 and p5 induce from it. Say so. --- source/templates.tex | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/source/templates.tex b/source/templates.tex index 9c0e511ef7..04cfde695d 100644 --- a/source/templates.tex +++ b/source/templates.tex @@ -2460,8 +2460,10 @@ \pnum \begin{note} -The subsumption relation defines a partial ordering on constraints. -This partial ordering is used to determine +The subsumption relation is a preorder on constraints: +it is reflexive and transitive, +but two different constraints can subsume each other. +The ordering of declarations it induces is used to determine \begin{itemize} \item the best viable candidate of non-template functions\iref{over.match.best}, \item the address of a non-template function\iref{over.over},