diff --git a/src/lay/lay/doc/manual/drc_runsets.xml b/src/lay/lay/doc/manual/drc_runsets.xml index cfca61a1e..64b5422e8 100644 --- a/src/lay/lay/doc/manual/drc_runsets.xml +++ b/src/lay/lay/doc/manual/drc_runsets.xml @@ -807,31 +807,31 @@ overlaps = layer.size(0.2).raw.merged(2)
- "measurement" is "width", "notch", "isolated" ("iso"), "separation" ("sep"), "overlap" or "enclosure" ("enc"). They have the + "measurement" is "width", "notch", "isolated" ("iso"), "separation" ("sep"), "overlap" or "enclosure" ("enc"). The last three checks are two-layer checks which require a second layer. The second layer is specified together with the measurement like this:
@@ -856,7 +856,8 @@ overlaps = layer.size(0.2).raw.merged(2)- However, the universal DRC is much more: it offers a number of options to further process + However, the universal DRC is much more than a convenient way to write checks: + it offers a number of options to further process the results. The functionality behind the universal DRC function is basically a kind of loop over all primary shapes (the ones from the layer the "drc" function is called on). The operations in the drc function's brackets is executed on each of the primary shapes @@ -876,7 +877,7 @@ overlaps = layer.size(0.2).raw.merged(2)
- The boolean AND is computed between the edges on the primary shape and returns these + The boolean AND is computed between the edges on the primary shape and returns the parts where both space and width violations are flagged. The boolean operation is more efficient than the plain alternative:
@@ -890,16 +891,16 @@ overlaps = layer.size(0.2).raw.merged(2)- The reson is that performing the boolean computation in the local loop can be - shortcut if one input is empty and it does not need to store a (potentially big) - layer set with edges as produced by the plain-method implementation. Instead it + The reason is that performing the boolean computation in the local loop can be + shortcut if one inputs is empty. It does not need to store a (potentially big) + edge set with edges as produced by the plain-method implementation. Instead it will work with a temporary and local edge set only and free the memory space as soon as it moves on to the next primary shape.
- The universal DRC function is a rich feature and offers filters based on - polygons or edge properties, polygon or edge manipulation, conditionals + Overall, the universal DRC function is a rich feature and offers filters based on + polygons or edge properties, polygon or edge manipulation operators, conditionals and a lot more. For more details see the drc function documentation.