luke
/
klayout
mirror of https://github.com/KLayout/klayout.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

it's -> its

This commit is contained in:
Matthias Koefferlein 2023-07-30 14:50:53 +02:00
parent 3736b59156
commit 559c45a585
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/doc/doc/about/drc_ref_global.xml
View File

@ -768,7 +768,7 @@ is called on. This operation represents all "other" primary polygons while
</p><p>
This feature opens new options for processing layouts beyond the
abilities of the classical DRC concept. For classic DRC, intra-layer interactions
are always symmetric: a polygon cannot be considered separated from it's neighbors
are always symmetric: a polygon cannot be considered separated from its neighbors
on the same layer.
</p><p>
The following example computes every part of the input which is closer than

8
src/doc/doc/about/drc_ref_layer.xml
View File

@ -676,7 +676,7 @@ out = l1.drc((secondary(l2) &amp; primary).area &gt; 1.0)
</p><p>
Some filters operate on properties of the full, local, per-primary shape set.
While the loop is executed, the DRC expressions will collect shapes, either
from the primary, it's neighborhood (secondaries) or from deriving shape sets.
from the primary, its neighborhood (secondaries) or from deriving shape sets.
</p><p>
Obviously the primary is a simple one: it consists of a single shape, because
this is how the loop operates. Derived shape sets however can be more complex.
@ -1537,7 +1537,7 @@ from the other layer. Two polygons overlapping or touching at two locations are
</ul>
<p>
This operation is similar to the "&amp;" operator, but it does also report intersection points
between non-colinear, but intersection edges. Such points are reported as point-like,
between non-colinear, but intersecting edges. Such points are reported as point-like,
degenerated edge objects.
</p><p>
This method is available for edge layers. The argument must be an edge layer.
@ -3609,7 +3609,7 @@ This method is available for polygon or edge pair layers.
<li><tt>layer.with_area_ratio(min, max)</tt></li>
</ul>
<p>
The area ratio is a measure how far a polygon is approximated by it's
The area ratio is a measure how far a polygon is approximated by its
bounding box. The value is always larger or equal to 1. Boxes have a
area ratio of 1. Larger values mean more empty area inside the bounding box.
</p><p>
@ -3883,7 +3883,7 @@ upper limit.
</p><p>
This method is available for polygon layers only.
</p>
<a name="with_relative_height"/><h2>"with_relative_height" - Selects polygons by the ratio of the height vs. width of it's bounding box</h2>
<a name="with_relative_height"/><h2>"with_relative_height" - Selects polygons by the ratio of the height vs. width of its bounding box</h2>
<keyword name="with_relative_height"/>
<p>Usage:</p>
<ul>