it's -> its

This commit is contained in:
Matthias Koefferlein 2023-07-30 14:46:58 +02:00
parent 2ae01a3e91
commit 3736b59156
46 changed files with 95 additions and 95 deletions

View File

@ -136,11 +136,11 @@ GenericWriterOptions::add_options (tl::CommandLineOptions &cmd, const std::strin
"\n"
"Multiple operations can be specified by combining them with a comma. "
"Positive and negative selection happens in the order given. Hence it's possible "
"to select a cell with it's children and then unselect some children of this cell.\n"
"to select a cell with its children and then unselect some children of this cell.\n"
"\n"
"Examples:\n\n"
"* \"TOP1,TOP2\" - Select cells TOP1 and TOP2 with all of their children\n"
"* \"(TOP)\" - Select only cell TOP, but none of it's child cells\n"
"* \"(TOP)\" - Select only cell TOP, but none of its child cells\n"
"* \"TOP,-A\" - Select cell TOP (plus children), then remove A (with children)"
);

View File

@ -191,7 +191,7 @@ HierarchyBuilder::reset ()
void
HierarchyBuilder::register_variant (db::cell_index_type non_var, db::cell_index_type var)
{
// non_var (despite it's name) may be a variant created previously.
// non_var (despite its name) may be a variant created previously.
variant_to_original_target_map_type::const_iterator v = m_variants_to_original_target_map.find (non_var);
if (v != m_variants_to_original_target_map.end ()) {
non_var = v->second;

View File

@ -1358,7 +1358,7 @@ Layout::add_cell (const char *name)
m_cells.push_back_ptr (new_cell);
m_cell_ptrs [new_index] = new_cell;
// enter it's index and cell_name
// enter its index and cell_name
register_cell_name (name, new_index);
if (manager () && manager ()->transacting ()) {
@ -1380,7 +1380,7 @@ Layout::add_anonymous_cell ()
m_cells.push_back_ptr (new_cell);
m_cell_ptrs [new_index] = new_cell;
// enter it's index and cell_name
// enter its index and cell_name
register_cell_name (0, new_index);
if (manager () && manager ()->transacting ()) {
@ -1393,7 +1393,7 @@ Layout::add_anonymous_cell ()
void
Layout::register_cell_name (const char *name, cell_index_type ci)
{
// enter it's index and cell_name
// enter its index and cell_name
char *cp;
if (name == 0) {
@ -2254,7 +2254,7 @@ Layout::get_pcell_variant_dict (pcell_id_type pcell_id, const std::map<std::stri
m_cells.push_back_ptr (variant);
m_cell_ptrs [new_index] = variant;
// enter it's index and cell_name
// enter its index and cell_name
register_cell_name (b.c_str (), new_index);
if (manager () && manager ()->transacting ()) {
@ -2293,7 +2293,7 @@ Layout::get_pcell_variant (pcell_id_type pcell_id, const std::vector<tl::Variant
m_cells.push_back_ptr (variant);
m_cell_ptrs [new_index] = variant;
// enter it's index and cell_name
// enter its index and cell_name
register_cell_name (b.c_str (), new_index);
if (manager () && manager ()->transacting ()) {
@ -2932,7 +2932,7 @@ Layout::get_lib_proxy (Library *lib, cell_index_type cell_index)
m_cells.push_back_ptr (proxy);
m_cell_ptrs [new_index] = proxy;
// enter it's index and cell_name
// enter its index and cell_name
register_cell_name (b.c_str (), new_index);
if (manager () && manager ()->transacting ()) {
@ -2968,7 +2968,7 @@ Layout::create_cold_proxy (const db::LayoutOrCellContextInfo &info)
m_cells.push_back_ptr (proxy);
m_cell_ptrs [new_index] = proxy;
// enter it's index and cell_name
// enter its index and cell_name
register_cell_name (b.c_str (), new_index);
if (manager () && manager ()->transacting ()) {

View File

@ -277,7 +277,7 @@ void path<C>::create_shifted_points (C start, C end, C width, bool forward, Iter
Iter ppp = pp;
++ppp;
// Compute the unit vector of the line and it's normal (times width)
// Compute the unit vector of the line and its normal (times width)
db::DVector ed (*pp - *p);
ed *= 1.0 / ed.double_length ();
@ -383,7 +383,7 @@ void path<C>::create_shifted_points (C start, C end, C width, bool forward, Iter
// Segments are too short - the won't intersect: In this case we create a loop of three
// points which define the area in self-overlapping way but confined to the path within
// the limits of it's width.
// the limits of its width.
// HINT: the execution of this code is a pretty strong evidence for the existence to loops
// in the contour delivered. A proof however is missing ..
*pts++ = *pp + vector<C> (nd);

View File

@ -32,7 +32,7 @@ db::DEdge compute_shifted (const db::edge<C> &e, C dx, C dy, double ext, int nsi
{
tl_assert (! e.is_degenerate ()); // no coincident points allowed
// Compute the unit vector of the line and it's normal (times width)
// Compute the unit vector of the line and its normal (times width)
db::DVector ec (e.d ());
ec *= 1.0 / ec.double_length ();
db::DVector nc (-ec.y (), ec.x ());
@ -47,7 +47,7 @@ db::DEdge compute_shifted (const db::edge<C> &e, C dx, C dy, double ext, int nsi
/**
* @brief Smart multiplication of a vector with a distance
* This function tries to keep the length of the vector on grid if it's
* This function tries to keep the length of the vector on grid if its
* a 45 degree or horizontal/vertical one.
*/
template <class C>

View File

@ -151,7 +151,7 @@ void create_shifted_points (C /*c*/, bool forward, Iter from, Iter to, WIter wfr
WIter www = ww;
++www;
// Compute the unit vector of the line and it's normal (times width)
// Compute the unit vector of the line and its normal (times width)
db::DVector ed (*pp - *p);
ed *= 1.0 / ed.double_length ();
@ -258,7 +258,7 @@ void create_shifted_points (C /*c*/, bool forward, Iter from, Iter to, WIter wfr
// Segments are too short - the won't intersect: In this case we create a loop of three
// points which define the area in self-overlapping way but confined to the path within
// the limits of it's width.
// the limits of its width.
// HINT: the execution of this code is a pretty strong evidence for the existence to loops
// in the contour delivered. A proof however is missing ..
*pts++ = *pp + vector<C> (nd2);

View File

@ -1875,14 +1875,14 @@ Class<db::Cell> decl_Cell ("db", "Cell",
gsi::method_ext ("write", &write_simple, gsi::arg ("file_name"),
"@brief Writes the cell to a layout file\n"
"The format of the file will be determined from the file name. Only the cell and "
"it's subtree below will be saved.\n"
"its subtree below will be saved.\n"
"\n"
"This method has been introduced in version 0.23.\n"
) +
gsi::method_ext ("write", &write_options, gsi::arg ("file_name"), gsi::arg ("options"),
"@brief Writes the cell to a layout file\n"
"The format of the file will be determined from the file name. Only the cell and "
"it's subtree below will be saved.\n"
"its subtree below will be saved.\n"
"In contrast to the other 'write' method, this version allows one to specify save options, i.e. "
"scaling etc.\n"
"\n"
@ -2576,7 +2576,7 @@ Class<db::Cell> decl_Cell ("db", "Cell",
"\n"
"In contrast to the \\transform method, this method allows propagation of the transformation into child cells. "
"More precisely: it applies just a part of the given transformation to the instance, such that when transforming "
"the cell instantiated and it's shapes with the same transformation, the result will reflect the desired transformation. Mathematically spoken, the "
"the cell instantiated and its shapes with the same transformation, the result will reflect the desired transformation. Mathematically spoken, the "
"transformation of the instance (A) is transformed with the given transformation T using \"A' = T * A * Tinv\" where "
"Tinv is the inverse of T. In effect, the transformation T commutes with the new instance transformation A' and can be "
"applied to child cells as well. This method is therefore useful to transform a hierarchy of cells.\n"
@ -3221,7 +3221,7 @@ Class<db::Cell> decl_Cell ("db", "Cell",
"\n"
"The parameters are given in the order the parameters are declared. Use \\pcell_declaration "
"on the instance to get the PCell declaration object of the cell. That PCellDeclaration object "
"delivers the parameter declaration with it's 'get_parameters' method.\n"
"delivers the parameter declaration with its 'get_parameters' method.\n"
"Each parameter in the variant list passed to the second list of values corresponds to "
"one parameter declaration.\n"
"\n"
@ -4013,7 +4013,7 @@ Class<db::Instance> decl_Instance ("db", "Instance",
"@param layer_index The index of the layer the bounding box will be computed for.\n"
"The bounding box incorporates all instances that the array represents. "
"It gives the overall extension of the child cell as seen in the calling cell (or all array members if the instance forms an array) "
"for the given layer. If the layer is empty in this cell and all it's children', an empty bounding box will be returned. "
"for the given layer. If the layer is empty in this cell and all its children', an empty bounding box will be returned. "
"\n"
"This method has been introduced in version 0.25. 'bbox' is the preferred synonym for it since version 0.28."
) +

View File

@ -132,7 +132,7 @@ Class<db::CellMapping> decl_CellMapping ("db", "CellMapping",
"If used as a pseudo-target for the cell mapping, this index indicates "
"that the cell shall be dropped rather than created on the target side "
"or skipped by flattening. Instead, all shapes of this cell are discarded "
"and it's children are not translated unless explicitly requested or "
"and its children are not translated unless explicitly requested or "
"if required are children for other cells.\n"
"\n"
"This constant has been introduced in version 0.25."

View File

@ -727,7 +727,7 @@ Class<db::CompoundRegionOperationNode> decl_CompoundRegionOperationNode ("db", "
"If 'is_square' is true, only squares will be selected. If 'inverse' is true, the non-rectangle/non-square shapes are returned.\n"
) +
gsi::constructor ("new_edges", &new_edges, gsi::arg ("input"),
"@brief Creates a node converting polygons into it's edges.\n"
"@brief Creates a node converting polygons into its edges.\n"
) +
gsi::constructor ("new_edge_length_filter", &new_edge_length_filter, gsi::arg ("input"), gsi::arg ("inverse", false), gsi::arg ("lmin", 0), gsi::arg ("lmax", std::numeric_limits<db::Edge::distance_type>::max (), "max"),
"@brief Creates a node filtering edges by their length.\n"

View File

@ -1374,7 +1374,7 @@ Class<db::Layout> decl_Layout ("db", "Layout",
"If the region is (conceptionally) a flat region, it will be inserted into the cell's shapes "
"list as a flat sequence of polygons.\n"
"If the region is a deep (hierarchical) region, it will create a subhierarchy below the given "
"cell and it's shapes will be put into the respective cells. Suitable subcells will be picked "
"cell and its shapes will be put into the respective cells. Suitable subcells will be picked "
"for inserting the shapes. If a hierarchy already exists below the given cell, the algorithm will "
"try to reuse this hierarchy.\n"
"\n"
@ -1386,7 +1386,7 @@ Class<db::Layout> decl_Layout ("db", "Layout",
"If the edge collection is (conceptionally) flat, it will be inserted into the cell's shapes "
"list as a flat sequence of edges.\n"
"If the edge collection is deep (hierarchical), it will create a subhierarchy below the given "
"cell and it's edges will be put into the respective cells. Suitable subcells will be picked "
"cell and its edges will be put into the respective cells. Suitable subcells will be picked "
"for inserting the edges. If a hierarchy already exists below the given cell, the algorithm will "
"try to reuse this hierarchy.\n"
"\n"
@ -1398,7 +1398,7 @@ Class<db::Layout> decl_Layout ("db", "Layout",
"If the edge pair collection is (conceptionally) flat, it will be inserted into the cell's shapes "
"list as a flat sequence of edge pairs.\n"
"If the edge pair collection is deep (hierarchical), it will create a subhierarchy below the given "
"cell and it's edge pairs will be put into the respective cells. Suitable subcells will be picked "
"cell and its edge pairs will be put into the respective cells. Suitable subcells will be picked "
"for inserting the edge pairs. If a hierarchy already exists below the given cell, the algorithm will "
"try to reuse this hierarchy.\n"
"\n"
@ -1410,7 +1410,7 @@ Class<db::Layout> decl_Layout ("db", "Layout",
"If the text collection is (conceptionally) flat, it will be inserted into the cell's shapes "
"list as a flat sequence of texts.\n"
"If the text collection is deep (hierarchical), it will create a subhierarchy below the given "
"cell and it's texts will be put into the respective cells. Suitable subcells will be picked "
"cell and its texts will be put into the respective cells. Suitable subcells will be picked "
"for inserting the texts. If a hierarchy already exists below the given cell, the algorithm will "
"try to reuse this hierarchy.\n"
"\n"

View File

@ -388,7 +388,7 @@ Class<db::LayoutToNetlist> decl_dbLayoutToNetlist ("db", "LayoutToNetlist",
"@brief Extracts devices\n"
"See the class description for more details.\n"
"This method will run device extraction for the given extractor. The layer map is specific\n"
"for the extractor and uses the region objects derived with \\make_layer and it's variants.\n"
"for the extractor and uses the region objects derived with \\make_layer and its variants.\n"
"\n"
"In addition, derived regions can be passed too. Certain limitations apply. It's safe to use\n"
"boolean operations for deriving layers. Other operations are applicable as long as they are\n"
@ -410,7 +410,7 @@ Class<db::LayoutToNetlist> decl_dbLayoutToNetlist ("db", "LayoutToNetlist",
) +
gsi::method ("connect", (void (db::LayoutToNetlist::*) (const db::Region &)) &db::LayoutToNetlist::connect, gsi::arg ("l"),
"@brief Defines an intra-layer connection for the given layer.\n"
"The layer is either an original layer created with \\make_includelayer and it's variants or\n"
"The layer is either an original layer created with \\make_includelayer and its variants or\n"
"a derived layer. Certain limitations apply. It's safe to use\n"
"boolean operations for deriving layers. Other operations are applicable as long as they are\n"
"capable of delivering hierarchical layers.\n"
@ -810,7 +810,7 @@ Class<db::LayoutToNetlist> decl_dbLayoutToNetlist ("db", "LayoutToNetlist",
"@li Preparation\n"
" In this step, the device recognition and extraction layers are drawn from\n"
" the framework. Derived can now be computed using boolean operations.\n"
" Methods to use in this step are \\make_layer and it's variants.\n"
" Methods to use in this step are \\make_layer and its variants.\n"
" Layer preparation is not necessarily required to happen before all\n"
" other steps. Layers can be computed shortly before they are required.\n"
"@/li\n"
@ -821,7 +821,7 @@ Class<db::LayoutToNetlist> decl_dbLayoutToNetlist ("db", "LayoutToNetlist",
" may be specified here. Layer preparation may happen between calls to \\extract_devices.\n"
"@/li\n"
"@li Once the devices are derived, the netlist connectivity can be defined and the\n"
" netlist extracted. The connectivity is defined with \\connect and it's\n"
" netlist extracted. The connectivity is defined with \\connect and its\n"
" flavours. The actual netlist extraction happens with \\extract_netlist.\n"
"@/li\n"
"@li After netlist extraction, the information is ready to be retrieved.\n"

View File

@ -1701,7 +1701,7 @@ Class<db::Circuit> decl_dbCircuit (decl_dbNetlistObject, "db", "Circuit",
) +
gsi::method ("flatten_subcircuit", &db::Circuit::flatten_subcircuit, gsi::arg ("subcircuit"),
"@brief Flattens a subcircuit\n"
"This method will substitute the given subcircuit by it's contents. The subcircuit is removed "
"This method will substitute the given subcircuit by its contents. The subcircuit is removed "
"after this."
) +
gsi::iterator ("each_subcircuit", (db::Circuit::subcircuit_iterator (db::Circuit::*) ()) &db::Circuit::begin_subcircuits, (db::Circuit::subcircuit_iterator (db::Circuit::*) ()) &db::Circuit::end_subcircuits,
@ -1986,7 +1986,7 @@ Class<db::Netlist> decl_dbNetlist ("db", "Netlist",
) +
gsi::method ("flatten_circuit", &db::Netlist::flatten_circuit, gsi::arg ("circuit"),
"@brief Flattens a subcircuit\n"
"This method will substitute all instances (subcircuits) of the given circuit by it's "
"This method will substitute all instances (subcircuits) of the given circuit by its "
"contents. After this, the circuit is removed."
) +
gsi::method_ext ("flatten_circuit", &flatten_circuit_by_name, gsi::arg ("pattern"),

View File

@ -454,7 +454,7 @@ Class<GenericNetlistCompareLogger> decl_GenericNetlistCompareLogger (decl_dbNetl
),
"@brief An event receiver for the netlist compare feature.\n"
"The \\NetlistComparer class will send compare events to a logger derived from this class. "
"Use this class to implement your own logger class. You can override on of it's methods to receive certain "
"Use this class to implement your own logger class. You can override on of its methods to receive certain "
"kind of events."
"\n"
"This class has been introduced in version 0.26.\n"

View File

@ -325,7 +325,7 @@ Class<GenericDeviceExtractor> decl_GenericDeviceExtractor (decl_dbNetlistDeviceE
"This method is supposed to set up the device extractor. This involves three basic steps:\n"
"defining the name, the device class and setting up the device layers.\n"
"\n"
"Use \\name= to give the extractor and it's device class a name.\n"
"Use \\name= to give the extractor and its device class a name.\n"
"Use \\register_device_class to register the device class you need.\n"
"Defined the layers by calling \\define_layer once or several times.\n"
) +
@ -377,7 +377,7 @@ Class<GenericDeviceExtractor> decl_GenericDeviceExtractor (decl_dbNetlistDeviceE
"@return The layer descriptor object created for this layer (use 'index' to get the layer's index)\n"
"As \\define_layer, this method allows specification of device extraction layer. In addition to \\define_layout, it features "
"a fallback layer. If in the device extraction statement, the primary layer is not given, "
"the fallback layer will be used. Hence, this layer is optional. The fallback layer is given by it's "
"the fallback layer will be used. Hence, this layer is optional. The fallback layer is given by its "
"index and must be defined before the layer using the fallback layer is defined. "
"For the index, 0 is the first layer defined, 1 the second and so forth."
) +

View File

@ -372,7 +372,7 @@ struct simple_polygon_defs
method ("is_box?", &C::is_box,
"@brief Returns a value indicating whether the polygon is a simple box.\n"
"\n"
"A polygon is a box if it is identical to it's bounding box.\n"
"A polygon is a box if it is identical to its bounding box.\n"
"\n"
"@return True if the polygon is a box.\n"
"\n"
@ -1380,7 +1380,7 @@ struct polygon_defs
method ("is_box?", &C::is_box,
"@brief Returns true, if the polygon is a simple box.\n"
"\n"
"A polygon is a box if it is identical to it's bounding box.\n"
"A polygon is a box if it is identical to its bounding box.\n"
"\n"
"@return True if the polygon is a box.\n"
"\n"

View File

@ -120,7 +120,7 @@ gsi::Class<db::TechnologyComponent> technology_component_decl ("db", "Technology
"@brief A part of a technology definition\n"
"Technology components extend technology definitions (class \\Technology) by "
"specialized subfeature definitions. For example, the net tracer supplies "
"it's technology-dependent specification through a technology component called "
"its technology-dependent specification through a technology component called "
"\\NetTracerTechnology.\n"
"\n"
"Components are managed within technologies and can be accessed from a technology "

View File

@ -174,7 +174,7 @@ gsi::Class<db::TileOutputReceiver> &dbdecl_TileOutputReceiverBase ()
gsi::Class<TileOutputReceiver_Impl> decl_TileOutputReceiver (decl_TileOutputReceiverBase, "db", "TileOutputReceiver",
gsi::callback ("begin", &TileOutputReceiver_Impl::begin, &TileOutputReceiver_Impl::begin_cb, gsi::arg ("nx"), gsi::arg ("ny"), gsi::arg ("p0"), gsi::arg ("dx"), gsi::arg ("dy"), gsi::arg ("frame"),
"@brief Initiates the delivery\n"
"This method is called before the first tile delivers it's data.\n"
"This method is called before the first tile delivers its data.\n"
"\n"
"@param nx The number of tiles in x direction\n"
"@param ny The number of tiles in y direction\n"

View File

@ -739,7 +739,7 @@ struct cplx_trans_defs
method ("invert", &C::invert,
"@brief Inverts the transformation (in place)\n"
"\n"
"Inverts the transformation and replaces this transformation by it's\n"
"Inverts the transformation and replaces this transformation by its\n"
"inverted one.\n"
"\n"
"@return The inverted transformation\n"

View File

@ -62,7 +62,7 @@ namespace gsi
gsi::method ("spline_interpolation", &db::UtilsDummy::spi1, gsi::arg ("control_points"), gsi::arg ("weights"), gsi::arg ("degree"), gsi::arg ("knots"), gsi::arg ("relative_accuracy"), gsi::arg ("absolute_accuracy"),
"@brief This function computes the Spline curve for a given set of control points (point, weight), degree and knots.\n"
"\n"
"The knot vector needs to be padded and it's size must fulfill the condition:\n"
"The knot vector needs to be padded and its size must fulfill the condition:\n"
"\n"
"@code\n"
" knots.size == control_points.size + degree + 1\n"

View File

@ -2409,7 +2409,7 @@ TEST(15_EmptySubCircuitWithoutPinNames)
" subcircuit TRANS $3 ($1=OUT,$2=$5,$3=$2);\n"
" subcircuit TRANS $4 ($1=OUT,$2=$4,$3=$2);\n"
"end;\n"
// This circuit is an abstract and it's pins are not defined by the pin names ->
// This circuit is an abstract and its pins are not defined by the pin names ->
// they are internally marked as swappable
"circuit TRANS ($1=$1,$2=$2,$3=$3);\n"
"end;\n";
@ -4152,7 +4152,7 @@ TEST(23_NodesRemovedWithError)
" subcircuit INV2PAIR $5 ($2=$I25,$3=VDD,$4=VSS,$5=$I6,$6=$I7);\n"
"end;\n"
"circuit INV2PAIR ($2=$I8,$3=$I5,$4=$I4,$5=$I3,$6=$I2);\n"
// NOTE: $1 pin should not be connected to different nets, although it's not functional
// NOTE: $1 pin should not be connected to different nets, although its not functional
" subcircuit INV2 $1 ($1=$3,IN=$I3,$3=$I7,OUT=$I6,VSS=$I4,VDD=$I5);\n"
" subcircuit INV2 $2 ($1=$6,IN=$I6,$3=$I8,OUT=$I2,VSS=$I4,VDD=$I5);\n"
"end;\n"

View File

@ -335,7 +335,7 @@ module DRC
#
# 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.
#
# 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.
@ -528,7 +528,7 @@ module DRC
#
# 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.
#
# The following example computes every part of the input which is closer than

View File

@ -630,7 +630,7 @@ CODE
# @synopsis layer.with_area_ratio(min .. max)
# @synopsis layer.with_area_ratio(value)
# @synopsis layer.with_area_ratio(min, max)
# 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.
#
@ -648,7 +648,7 @@ CODE
# %DRC%
# @name with_relative_height
# @brief Selects polygons by the ratio of the height vs. width of it's bounding box
# @brief Selects polygons by the ratio of the height vs. width of its bounding box
# @synopsis layer.with_relative_height(min .. max)
# @synopsis layer.with_relative_height(value)
# @synopsis layer.with_relative_height(min, max)

View File

@ -496,7 +496,7 @@ struct writer
if (atype.is_ref () || atype.is_ptr ()) {
// TODO: morph the variant to the requested type and pass it's pointer (requires a non-const reference for arg)
// TODO: morph the variant to the requested type and pass its pointer (requires a non-const reference for arg)
// -> we would have a reference that can modify the argument (out parameter).
R *v = new R (var2c<R>::get (*arg));
heap->push (v);
@ -542,7 +542,7 @@ struct writer<StringType>
} else {
// TODO: morph the variant to the requested type and pass it's pointer (requires a non-const reference for arg)
// TODO: morph the variant to the requested type and pass its pointer (requires a non-const reference for arg)
// -> we would have a reference that can modify the argument (out parameter).
// NOTE: by convention we pass the ownership to the receiver for adaptors.
aa->write<void *> ((void *)new StringAdaptorImpl<std::string> (arg->to_string ()));

View File

@ -225,7 +225,7 @@ private:
};
/**
* @brief The template providing a binding of a "free iterator" (one that provides it's own at_end method)
* @brief The template providing a binding of a "free iterator" (one that provides its own at_end method)
*/
template <class I>
class FreeIterAdaptor

View File

@ -40,10 +40,10 @@ class QtLifetimeMonitor
};
/**
* @brief A helper object that is attached to a QObject to monitor it's lifetime
* @brief A helper object that is attached to a QObject to monitor its lifetime
*
* This object will be put into the properties table of the QObject (more precisely: a copy).
* When the QObject is destroyed, it's properties are destroyed too and through reference
* When the QObject is destroyed, its properties are destroyed too and through reference
* counting the destruction of the QObject is detected. The monitoring itself is implemented
* through a gsi::ObjectBase object which plugs seamlessly into the gsi type system:
*

View File

@ -7,7 +7,7 @@
@args id, ...
This method implements Ruby's fallback mechanism and adds some convenience to
QObject: through that implementation, each child object can be accessed through
it's name. That method will deliver a reference to the child object or nil if there
its name. That method will deliver a reference to the child object or nil if there
is no child element with that name.
For example:

View File

@ -541,7 +541,7 @@ MainWindow::init_menu ()
}
// if not in editable mode, hide all entries from "edit_mode" group
// TODO: later do this on each change of the view - each view might get it's own editable mode
// TODO: later do this on each change of the view - each view might get its own editable mode
bool view_mode = (lay::ApplicationBase::instance () && !lay::ApplicationBase::instance ()->is_editable ());
std::vector<std::string> edit_mode_grp = menu ()->group ("edit_mode");
@ -742,7 +742,7 @@ MainWindow::about_to_exec ()
}
}
// TODO: later, each view may get it's own editable flag
// TODO: later, each view may get its own editable flag
if (lay::ApplicationBase::instance () && !lay::ApplicationBase::instance ()->is_editable ()) {
TipDialog td (this,
tl::to_string (QObject::tr ("KLayout has been started in viewer mode. In this mode, editor functions are not available.\n\nTo enable these functions, start KLayout in editor mode by using the \"-e\" command line switch or select it as the default mode in the setup dialog. Choose \"Setup\" in the \"File\" menu and check \"Use editing mode by default\" on the \"Editing Mode\" page in the \"Application\" section.")),

View File

@ -201,10 +201,10 @@ SaltController::install_packages (const std::vector<std::string> &packages, bool
}
if (n.find ("http:") == 0 || n.find ("https:") == 0 || n.find ("file:") == 0 || n[0] == '/' || n[0] == '\\') {
// it's a URL
// its a URL
manager.register_download (std::string (), std::string (), n, v);
} else {
// it's a plain name
// its a plain name
manager.register_download (n, std::string (), std::string (), v);
}

View File

@ -580,7 +580,7 @@ SaltGrainPropertiesDialog::accept ()
if (d->version.empty ()) {
dependencies_alert->warn () << tr ("No version specified for dependency '%1'").arg (tl::to_qstring (d->name)) << tl::endl
<< tr ("Please consider giving a version here. Versions help deciding whether a package needs to be updated.") << tl::endl
<< tr ("If the dependency package has a version itself, the version is automatically set to it's current version.");
<< tr ("If the dependency package has a version itself, the version is automatically set to its current version.");
}
if (!d->url.empty ()) {

View File

@ -46,7 +46,7 @@ module PCellLibModule
end
def coerce_parameters_impl
# TODO: use x to access parameter x and set_x to modify it's value
# TODO: use x to access parameter x and set_x to modify its value
end
def produce_impl

View File

@ -34,7 +34,7 @@ class PCell(pya.PCellDeclarationHelper):
return "TODO: create description"
def coerce_parameters_impl(self):
# TODO: use x to access parameter x and set_x to modify it's value
# TODO: use x to access parameter x and set_x to modify its value
def produce_impl(self):
# TODO: produce the cell content

View File

@ -48,7 +48,7 @@ module PCellPackageModule
end
def coerce_parameters_impl
# TODO: use x to access parameter x and set_x to modify it's value
# TODO: use x to access parameter x and set_x to modify its value
end
def produce_impl

View File

@ -1241,7 +1241,7 @@ Class<lay::LayerPropertiesNode> decl_LayerPropertiesNode (
"Each layer properties node object has a unique ID that is created \n"
"when a new LayerPropertiesNode object is instantiated. The ID is\n"
"copied when the object is copied. The ID can be used to identify the\n"
"object irregardless of it's content.\n"
"object irregardless of its content.\n"
),
"@brief A layer properties node structure\n"
"\n"
@ -1441,7 +1441,7 @@ Class<lay::LayerPropertiesConstIterator> decl_LayerPropertiesIterator (
"@brief Returns the index of the child within the parent\n"
"\n"
"This method returns the index of that the properties node the iterator points to in the list\n"
"of children of it's parent. If the element does not have a parent, the \n"
"of children of its parent. If the element does not have a parent, the \n"
"index of the element in the global list is returned.\n"
),
"@brief Layer properties iterator\n"

View File

@ -1438,7 +1438,7 @@ LAYBASIC_PUBLIC Class<lay::LayoutViewBase> decl_LayoutViewBase ("lay", "LayoutVi
"@brief Hierarchically iterates over the layers in the given layer list\n"
"\n"
"This version of this method allows specification of the layer list to be iterated over. "
"The layer list is specified by it's index which is a value between 0 and \\num_layer_lists-1."
"The layer list is specified by its index which is a value between 0 and \\num_layer_lists-1."
"For details see the parameter-less version of this method.\n"
"\n"
"This method was introduced in version 0.25."
@ -1666,7 +1666,7 @@ LAYBASIC_PUBLIC Class<lay::LayoutViewBase> decl_LayoutViewBase ("lay", "LayoutVi
"\n"
"If a file is loaded, this event is triggered.\n"
"When this event is triggered, the file was already loaded and the new file is the new active cellview.\n"
"Despite it's name, this event is also triggered if a layout object is loaded into the view.\n"
"Despite its name, this event is also triggered if a layout object is loaded into the view.\n"
"\n"
"Before version 0.25 this event was based on the observer pattern obsolete now. The corresponding methods "
"(add_file_open_observer/remove_file_open_observer) have been removed in 0.25.\n"
@ -1683,7 +1683,7 @@ LAYBASIC_PUBLIC Class<lay::LayoutViewBase> decl_LayoutViewBase ("lay", "LayoutVi
gsi::event ("on_layer_list_changed", static_cast<tl::event<int> (lay::LayoutViewBase::*)> (&lay::LayoutViewBase::layer_list_changed_event), gsi::arg ("flags"),
"@brief An event indicating that the layer list has changed\n"
"\n"
"This event is triggered after the layer list has changed it's configuration.\n"
"This event is triggered after the layer list has changed its configuration.\n"
"The integer argument gives a hint about the nature of the changed:\n"
"Bit 0 is set, if the properties (visibility, color etc.) of one or more layers have changed. Bit 1 is\n"
"set if the hierarchy has changed. Bit 2 is set, if layer names have changed."
@ -2239,7 +2239,7 @@ Class<lay::CellViewRef> decl_CellView ("lay", "CellView",
"\n"
"This method will construct any path to this cell, not a \n"
"particular one. It will clear the context path\n"
"and update the context and target cell. Note that the cell is specified by it's index.\n"
"and update the context and target cell. Note that the cell is specified by its index.\n"
) +
method ("cell_name=|set_cell_name", (void (lay::CellViewRef::*) (const std::string &)) &lay::CellViewRef::set_cell, gsi::arg ("cell_name"),
"@brief Sets the cell by name\n"
@ -2394,9 +2394,9 @@ Class<lay::CellViewRef> decl_CellView ("lay", "CellView",
"is addressed by an cell_index or a cell object reference.\n"
"The layout pointer can be nil, indicating that the cell view is invalid.\n"
"\n"
"The cell is not only identified by it's index or object but also \n"
"The cell is not only identified by its index or object but also \n"
"by the path leading to that cell. This path indicates how to find the\n"
"cell in the hierarchical context of it's parent cells. \n"
"cell in the hierarchical context of its parent cells. \n"
"\n"
"The path is in fact composed of two parts: first in an unspecific fashion,\n"
"just describing which parent cells are used. The target of this path\n"

View File

@ -730,7 +730,7 @@ Class<gsi::PluginBase> decl_Plugin ("lay", "Plugin",
callback ("config_finalize", &gsi::PluginBase::config_finalize, &gsi::PluginBase::f_config_finalize,
"@brief Sends the post-configuration request to the plugin\n"
"After all configuration parameters have been sent, 'config_finalize' is called to given the plugin a chance to "
"update it's internal state according to the new configuration.\n"
"update its internal state according to the new configuration.\n"
) +
callback ("key_event", &gsi::PluginBase::key_event, &gsi::PluginBase::f_key_event, gsi::arg ("key"), gsi::arg ("buttons"),
"@brief Handles the key pressed event\n"
@ -840,7 +840,7 @@ Class<gsi::PluginBase> decl_Plugin ("lay", "Plugin",
),
"@brief The plugin object\n"
"\n"
"This class provides the actual plugin implementation. Each view gets it's own instance of the plugin class. The plugin factory \\PluginFactory class "
"This class provides the actual plugin implementation. Each view gets its own instance of the plugin class. The plugin factory \\PluginFactory class "
"must be specialized to provide a factory for new objects of the Plugin class. See the documentation there for details about the plugin mechanism and "
"the basic concepts.\n"
"\n"

View File

@ -1532,7 +1532,7 @@ Recorder::eventFilter (QObject *object, QEvent *event)
if (event->type() == QEvent::MouseButtonPress) {
// send the test event to make the object print it's content
// send the test event to make the object print its content
QEvent event (QEvent::MaxUser);
event.ignore ();

View File

@ -52,7 +52,7 @@ namespace lay
#if defined(__APPLE__)
// On MacOS, the main menu bar and it's decendent children
// On MacOS, the main menu bar and its decendent children
// can't be modified using "removeAction", followed by "addAction"
// to achieve a move operation.If we try to do so, segmentation faults happen
// in the timer event that presumably tries to merge the menu bar

View File

@ -54,7 +54,7 @@ void
BitmapRenderer::clear ()
{
// this implementation is efficient but does not free memory -
// the idea is to let the BitmapRenderer object manage it's workspace.
// the idea is to let the BitmapRenderer object manage its workspace.
m_edges.erase (m_edges.begin (), m_edges.end ());
// might be manhattan
m_ortho = true;

View File

@ -216,7 +216,7 @@
<item row="1" column="0" colspan="2">
<widget class="QLabel" name="label">
<property name="text">
<string>If this option is selected, the subcircuits parts of a net are represented by individual cells. Otherwise the net with it's subcircuit parts is exported as a whole (flattened).</string>
<string>If this option is selected, the subcircuits parts of a net are represented by individual cells. Otherwise the net with its subcircuit parts is exported as a whole (flattened).</string>
</property>
<property name="wordWrap">
<bool>true</bool>

View File

@ -344,7 +344,7 @@ Class<BrowserDialog_Stub> decl_BrowserDialog (QT_EXTERNAL_BASE (QDialog) "lay",
"The browser dialog displays HTML code in a browser panel. The HTML code is delivered through a separate "
"object of class \\BrowserSource which acts as a \"server\" for a specific kind of URL scheme. Whenever the "
"browser sees a URL starting with \"int:\" it will ask the connected BrowserSource object for the HTML code "
"of that page using it's 'get' method. The task of the BrowserSource object is to format the data requested "
"of that page using its 'get' method. The task of the BrowserSource object is to format the data requested "
"in HTML and deliver it.\n"
"\n"
"One use case for that class is the implementation of rich data browsers for structured information. In a "
@ -699,7 +699,7 @@ Class<InputDialog> decl_InputDialog ("lay", "InputDialog",
"@param title The title to display for the dialog\n"
"@param label The label text to display for the dialog\n"
"@param value The initial value for the input field\n"
"@return A \\StringValue object with has_value? set to true, if \"Ok\" was pressed and the value given in it's value attribute\n"
"@return A \\StringValue object with has_value? set to true, if \"Ok\" was pressed and the value given in its value attribute\n"
"Starting from 0.22, this method is deprecated and it is recommended to use the ask_... equivalent."
) +
gsi::method ("#get_item", &get_item, gsi::arg ("title"), gsi::arg ("label"), gsi::arg ("items"), gsi::arg ("value"),
@ -708,7 +708,7 @@ Class<InputDialog> decl_InputDialog ("lay", "InputDialog",
"@param label The label text to display for the dialog\n"
"@param items The list of items to show in the selection element\n"
"@param selection The initial selection (index of the element selected initially)\n"
"@return A \\StringValue object with has_value? set to true, if \"Ok\" was pressed and the value given in it's value attribute\n"
"@return A \\StringValue object with has_value? set to true, if \"Ok\" was pressed and the value given in its value attribute\n"
"Starting from 0.22, this method is deprecated and it is recommended to use the ask_... equivalent."
) +
gsi::method ("#get_string_password", &get_string_password, gsi::arg ("title"), gsi::arg ("label"), gsi::arg ("value"),
@ -716,7 +716,7 @@ Class<InputDialog> decl_InputDialog ("lay", "InputDialog",
"@param title The title to display for the dialog\n"
"@param label The label text to display for the dialog\n"
"@param value The initial value for the input field\n"
"@return A \\StringValue object with has_value? set to true, if \"Ok\" was pressed and the value given in it's value attribute\n"
"@return A \\StringValue object with has_value? set to true, if \"Ok\" was pressed and the value given in its value attribute\n"
"Starting from 0.22, this method is deprecated and it is recommended to use the ask_... equivalent."
) +
gsi::method ("#get_double", &get_double, gsi::arg ("title"), gsi::arg ("label"), gsi::arg ("value"), gsi::arg ("digits"),
@ -725,7 +725,7 @@ Class<InputDialog> decl_InputDialog ("lay", "InputDialog",
"@param label The label text to display for the dialog\n"
"@param value The initial value for the input field\n"
"@param digits The number of digits allowed\n"
"@return A \\DoubleValue object with has_value? set to true, if \"Ok\" was pressed and the value given in it's value attribute\n"
"@return A \\DoubleValue object with has_value? set to true, if \"Ok\" was pressed and the value given in its value attribute\n"
"Starting from 0.22, this method is deprecated and it is recommended to use the ask_... equivalent."
) +
gsi::method ("#get_double_ex", &get_double_ex, gsi::arg ("title"), gsi::arg ("label"), gsi::arg ("value"), gsi::arg ("min"), gsi::arg ("max"), gsi::arg ("digits"),
@ -736,7 +736,7 @@ Class<InputDialog> decl_InputDialog ("lay", "InputDialog",
"@param min The minimum value allowed\n"
"@param max The maximum value allowed\n"
"@param digits The number of digits allowed\n"
"@return A \\DoubleValue object with has_value? set to true, if \"Ok\" was pressed and the value given in it's value attribute\n"
"@return A \\DoubleValue object with has_value? set to true, if \"Ok\" was pressed and the value given in its value attribute\n"
"Starting from 0.22, this method is deprecated and it is recommended to use the ask_... equivalent."
) +
gsi::method ("#get_int", &get_int, gsi::arg ("title"), gsi::arg ("label"), gsi::arg ("value"),
@ -744,7 +744,7 @@ Class<InputDialog> decl_InputDialog ("lay", "InputDialog",
"@param title The title to display for the dialog\n"
"@param label The label text to display for the dialog\n"
"@param value The initial value for the input field\n"
"@return A \\IntValue object with has_value? set to true, if \"Ok\" was pressed and the value given in it's value attribute\n"
"@return A \\IntValue object with has_value? set to true, if \"Ok\" was pressed and the value given in its value attribute\n"
"Starting from 0.22, this method is deprecated and it is recommended to use the ask_... equivalent."
) +
gsi::method ("#get_int_ex", &get_int_ex, gsi::arg ("title"), gsi::arg ("label"), gsi::arg ("value"), gsi::arg ("min"), gsi::arg ("max"), gsi::arg ("step"),
@ -755,7 +755,7 @@ Class<InputDialog> decl_InputDialog ("lay", "InputDialog",
"@param min The minimum value allowed\n"
"@param max The maximum value allowed\n"
"@param step The step size for the spin buttons\n"
"@return A \\IntValue object with has_value? set to true, if \"Ok\" was pressed and the value given in it's value attribute\n"
"@return A \\IntValue object with has_value? set to true, if \"Ok\" was pressed and the value given in its value attribute\n"
"Starting from 0.22, this method is deprecated and it is recommended to use the ask_... equivalent."
) +
gsi::method ("ask_string", &ask_string, gsi::arg ("title"), gsi::arg ("label"), gsi::arg ("value"),

View File

@ -84,7 +84,7 @@ HCPCellTreeWidget::HCPCellTreeWidget (QWidget *parent, const char *name, QWidget
HCPCellTreeWidget::~HCPCellTreeWidget ()
{
// NOTE: this should not be required, but I got a strange crash on closing the app with Qt 5.12.8
// after using changePersistentIndex inside the model when ~QTreeWidget tried to clean up it's
// after using changePersistentIndex inside the model when ~QTreeWidget tried to clean up its
// persistent indexes and only found a model which was deleted already.
QAbstractItemModel *m = model ();
if (m) {

View File

@ -735,7 +735,7 @@ void
LayoutViewFunctions::cm_cell_cut ()
{
if (view ()->hierarchy_panel ()) {
// TODO: currently the hierarchy panel's cut function does it's own transaction handling.
// TODO: currently the hierarchy panel's cut function does its own transaction handling.
// Otherwise the cut function is not working propertly.
view ()->hierarchy_panel ()->cut ();
}
@ -1873,12 +1873,12 @@ LayoutViewFunctions::cm_edit_layer ()
{
lay::LayerPropertiesConstIterator sel = view ()->current_layer ();
if (sel.is_null ()) {
throw tl::Exception (tl::to_string (tr ("No layer selected for editing it's properties")));
throw tl::Exception (tl::to_string (tr ("No layer selected for editing its properties")));
}
int index = sel->cellview_index ();
if (sel->has_children () || index < 0 || int (view ()->cellviews ()) <= index || sel->layer_index () < 0) {
throw tl::Exception (tl::to_string (tr ("No valid layer selected for editing it's properties")));
throw tl::Exception (tl::to_string (tr ("No valid layer selected for editing its properties")));
}
const lay::CellView &cv = view ()->cellview (index);

View File

@ -1356,7 +1356,7 @@ void
LayoutView::cut ()
{
if (mp_hierarchy_panel && mp_hierarchy_panel->has_focus ()) {
// TODO: currently the hierarchy panel's cut function does it's own transaction handling.
// TODO: currently the hierarchy panel's cut function does its own transaction handling.
// Otherwise the cut function is not working propertly.
mp_hierarchy_panel->cut ();
} else if (mp_control_panel && mp_control_panel->has_focus ()) {

View File

@ -328,11 +328,11 @@ gsi::ClassExt<db::LoadLayoutOptions> dxf_reader_options (
"This method has been added in version 0.25.3."
) +
gsi::method_ext ("dxf_keep_other_cells=", &set_dxf_keep_other_cells, gsi::arg ("value"),
"@brief If this option is set to true, all cells are kept, not only the top cell and it's children\n"
"@brief If this option is set to true, all cells are kept, not only the top cell and its children\n"
"\nThis property has been added in version 0.21.15.\n"
) +
gsi::method_ext ("dxf_keep_other_cells?|#dxf_keep_other_cells", &get_dxf_keep_other_cells,
"@brief If this option is true, all cells are kept, not only the top cell and it's children\n"
"@brief If this option is true, all cells are kept, not only the top cell and its children\n"
"\nThis property has been added in version 0.21.15.\n"
) +
gsi::method_ext ("dxf_polyline_mode=", &set_dxf_polyline_mode, gsi::arg ("mode"),

View File

@ -266,7 +266,7 @@
<item row="6" column="1" colspan="3">
<widget class="QCheckBox" name="keep_other_cells_cbx">
<property name="text">
<string>Check this box to keep all cells, not only the top cell and it's children</string>
<string>Check this box to keep all cells, not only the top cell and its children</string>
</property>
</widget>
</item>

View File

@ -184,7 +184,7 @@ Class<rdb::Cell> decl_RdbCell ("rdb", "RdbCell",
"@brief Gets the cell name\n"
"The cell name is an string that identifies the category in the database. "
"Additionally, a cell may carry a variant identifier which is a string that uniquely identifies a cell "
"in the context of it's variants. The \"qualified name\" contains both the cell name and the variant name. "
"in the context of its variants. The \"qualified name\" contains both the cell name and the variant name. "
"Cell names are also used to identify report database cell's with layout cells. "
"@return The cell name\n"
) +
@ -347,7 +347,7 @@ Class<rdb::Category> decl_RdbCategory ("rdb", "RdbCategory",
) +
gsi::method_ext ("scan_layer", &scan_layer, gsi::arg ("layout"), gsi::arg ("layer"), gsi::arg ("cell", (const db::Cell *) 0, "nil"), gsi::arg ("levels", -1), gsi::arg ("with_properties", true),
"@brief Scans a layer from a layout into this category, starting with a given cell and a depth specification\n"
"Creates RDB items for each polygon or edge shape read from the cell and it's children in the layout on the given layer and puts them into this category.\n"
"Creates RDB items for each polygon or edge shape read from the cell and its children in the layout on the given layer and puts them into this category.\n"
"New cells will be generated when required.\n"
"\"levels\" is the number of hierarchy levels to take the child cells from. 0 means to use only \"cell\" and don't descend, -1 means \"all levels\".\n"
"Other settings like database unit, description, top cell etc. are not made in the RDB.\n"
@ -1031,7 +1031,7 @@ Class<rdb::Database> decl_ReportDatabase ("rdb", "ReportDatabase",
) +
gsi::method ("description", &rdb::Database::description,
"@brief Gets the databases description\n"
"The description is a general purpose string that is supposed to further describe the database and it's content "
"The description is a general purpose string that is supposed to further describe the database and its content "
"in a human-readable form.\n"
"@return The description string\n"
) +