From e276193d899f3de8474d47dd196b112be6f6bd64 Mon Sep 17 00:00:00 2001 From: "Reynaldo H. Verdejo Pinochet" Date: Mon, 19 Dec 2016 11:07:14 -0800 Subject: [PATCH] design/caps: fix organization by sub-topic Fix markdown use to express relationship between topics. --- markdown/design/caps.md | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/markdown/design/caps.md b/markdown/design/caps.md index 9d46b62704..7102debab1 100644 --- a/markdown/design/caps.md +++ b/markdown/design/caps.md @@ -18,7 +18,7 @@ or intersecting. ## Operations -# Fixating +### Fixating Caps are fixed if they only contain a single structure and this structure is fixed. A structure is fixed if none of its fields @@ -34,7 +34,7 @@ arbitrary value that is a subset of the unfixed field’s values. EMPTY caps are fixed caps and ANY caps are not. Caps with ANY caps features are not fixed. -# Subset +### Subset One caps "A" is a subset of another caps "B" if for each structure in "A" there exists a structure in "B" that is a superset of the structure @@ -52,14 +52,14 @@ always a superset of any other field. EMPTY caps are a subset of every other caps. Every caps are a subset of ANY caps. -# Equality +### Equality Caps "A" and "B" are equal if "A" is a subset of "B" and "B" is a subset of "A". This means that both caps are expressing the same possibilities but their structures can still be different if they contain unfixed fields. -# Intersection +### Intersection The intersection of caps "A" and caps "B" are the caps that contain the intersection of all their structures with each other. @@ -74,7 +74,7 @@ value. The intersection with ANY caps is always the other caps and the intersection with EMPTY caps is always EMPTY. -# Union +### Union The union of caps "A" and caps "B" are the caps that contain the union of all their structures with each other. @@ -88,7 +88,7 @@ contained in the union. The union with ANY caps is always ANY and the union with EMPTY caps is always the other caps. -# Subtraction +### Subtraction The subtraction of caps "A" from caps "B" is the most generic subset of "B" that has an empty intersection with "A" but only contains structures @@ -96,7 +96,7 @@ with names and caps features that are existing in "B". ## Basic Rules -# Semantics of caps and their usage +### Semantics of caps and their usage A caps can contain multiple structures, in which case any of the structures would be acceptable. The structures are in the preferred @@ -131,7 +131,7 @@ detect that something else can be used. The special ANY caps features can be used to specify that any caps feature would be accepted, for example if the buffer memory is not touched at all. -# Compatibility of caps +### Compatibility of caps Pads can be linked when the caps of both pads are compatible. This is the case when their intersection is not empty.