mirror of https://github.com/KLayout/klayout.git
Spelling errors in code and comments fixed
This commit is contained in:
parent
14e2d9f632
commit
5d26cf4c77
|
|
@ -1315,7 +1315,7 @@
|
|||
* The net tracer now allows to use layer combinations (derived by boolean operations)
|
||||
for the conductive and via layers. See The Net Tracing Feature for details.
|
||||
* A technology management is integrated into Klayout.
|
||||
That allows to switch various settings depending on the choosen technology.
|
||||
That allows to switch various settings depending on the chosen technology.
|
||||
See About Technology Management for details about this feature.
|
||||
* The drawing can now be rotated or flipped without having to modify the layout.
|
||||
This function can be found in the "Display" menu under "Global Transformation".
|
||||
|
|
@ -1865,7 +1865,7 @@
|
|||
* The instance browser now has a "Choose cell" button where the cell can be
|
||||
chosen whose instances will be presented.
|
||||
* For most editing operations, the status bar will now indicate more detailed
|
||||
informations such as move distance.
|
||||
information such as move distance.
|
||||
* Pasted shapes and instances now are selected initially.
|
||||
* Enhanced OASIS compression mode (can be chosen from the options dialog on
|
||||
saving). Reduces file size considerably by creating regular shape arrays if
|
||||
|
|
|
|||
|
|
@ -1049,7 +1049,7 @@ Service::begin_move (lay::Editable::MoveMode mode, const db::DPoint &p, lay::ang
|
|||
double l = double (search_range) / widget ()->mouse_event_trans ().mag ();
|
||||
db::DBox search_dbox = db::DBox (p, p).enlarged (db::DVector (l, l));
|
||||
|
||||
// test, wether we are moving a handle of one selected object
|
||||
// test, whether we are moving a handle of one selected object
|
||||
for (std::map<obj_iterator, unsigned int>::const_iterator r = m_selected.begin (); r != m_selected.end (); ++r) {
|
||||
|
||||
obj_iterator ri = r->first;
|
||||
|
|
|
|||
|
|
@ -897,7 +897,7 @@ gsi::Class<AnnotationRef> decl_Annotation (decl_BasicAnnotation, "lay", "Annotat
|
|||
),
|
||||
"@brief A layout annotation (i.e. ruler)\n"
|
||||
"\n"
|
||||
"Annotation objects provide a way to attach measurements or descriptive informations to a layout view. "
|
||||
"Annotation objects provide a way to attach measurements or descriptive information to a layout view. "
|
||||
"Annotation objects can appear as rulers for example. Annotation objects can be configured in "
|
||||
"different ways using the styles provided. By configuring an annotation object properly, it can appear "
|
||||
"as a rectangle or a plain line for example.\n"
|
||||
|
|
|
|||
|
|
@ -145,7 +145,7 @@ GenericWriterOptions::add_options (tl::CommandLineOptions &cmd, const std::strin
|
|||
)
|
||||
<< tl::arg (group +
|
||||
"#--multi-xy-records", &m_gds2_multi_xy_records, "Allows unlimited number of points",
|
||||
"If this option is given, multiple XY records will be written to accomodate an unlimited number "
|
||||
"If this option is given, multiple XY records will be written to accommodate an unlimited number "
|
||||
"of points per polygon or path. However, such files may not be compatible with some consumers."
|
||||
)
|
||||
<< tl::arg (group +
|
||||
|
|
@ -169,7 +169,7 @@ GenericWriterOptions::add_options (tl::CommandLineOptions &cmd, const std::strin
|
|||
<< tl::arg (group +
|
||||
"#!--no-timestamps", &m_gds2_write_timestamps, "Don't write timestamps",
|
||||
"Writes a dummy time stamp instead of the actual time. With this option, GDS2 files become "
|
||||
"bytewise indentical even if written at different times. This option is useful if binary "
|
||||
"bytewise identical even if written at different times. This option is useful if binary "
|
||||
"identity is important (i.e. in regression scenarios)."
|
||||
)
|
||||
<< tl::arg (group +
|
||||
|
|
|
|||
|
|
@ -624,7 +624,7 @@ struct DB_PUBLIC_TEMPLATE box
|
|||
* @brief Conversion to string
|
||||
*
|
||||
* If dbu is set, it determines the factor by which the coordinates are multiplied to render
|
||||
* micron units. In addition, a micron format is choosen for output of these coordinates.
|
||||
* micron units. In addition, a micron format is chosen for output of these coordinates.
|
||||
*/
|
||||
std::string to_string (double dbu) const
|
||||
{
|
||||
|
|
|
|||
|
|
@ -60,7 +60,7 @@ class ImportLayerMapping;
|
|||
* @brief The cell object
|
||||
*
|
||||
* A cell object consists of a set of shape containers (called layers),
|
||||
* a set of child cell instances and auxiliary informations such as
|
||||
* a set of child cell instances and auxiliary information such as
|
||||
* the parent instance list.
|
||||
* A cell is identified through an index given to the cell upon instantiation.
|
||||
* The cell index is valid in the context of a cell graph object which
|
||||
|
|
|
|||
|
|
@ -598,7 +598,7 @@ public:
|
|||
* @brief Conversion to a string.
|
||||
*
|
||||
* If dbu is set, it determines the factor by which the coordinates are multiplied to render
|
||||
* micron units. In addition, a micron format is choosen for output of these coordinates.
|
||||
* micron units. In addition, a micron format is chosen for output of these coordinates.
|
||||
*/
|
||||
std::string to_string (double dbu) const
|
||||
{
|
||||
|
|
|
|||
|
|
@ -306,7 +306,7 @@ public:
|
|||
* @brief Conversion to a string.
|
||||
*
|
||||
* If dbu is set, it determines the factor by which the coordinates are multiplied to render
|
||||
* micron units. In addition, a micron format is choosen for output of these coordinates.
|
||||
* micron units. In addition, a micron format is chosen for output of these coordinates.
|
||||
*/
|
||||
std::string to_string (double dbu) const
|
||||
{
|
||||
|
|
|
|||
|
|
@ -711,7 +711,7 @@ public:
|
|||
/**
|
||||
* @brief Merge the given edges in a simple "non-zero wrapcount" fashion
|
||||
*
|
||||
* The egdes provided must form valid closed contours. Contours oriented differently "cancel" each other.
|
||||
* The edges provided must form valid closed contours. Contours oriented differently "cancel" each other.
|
||||
* Overlapping contours are merged when the orientation is the same.
|
||||
*
|
||||
* The result is presented as a set of edges forming closed contours. Hulls are oriented clockwise while
|
||||
|
|
@ -729,7 +729,7 @@ public:
|
|||
/**
|
||||
* @brief Merge the given edges in a simple "non-zero wrapcount" fashion into polygons
|
||||
*
|
||||
* The egdes provided must form valid closed contours. Contours oriented differently "cancel" each other.
|
||||
* The edges provided must form valid closed contours. Contours oriented differently "cancel" each other.
|
||||
* Overlapping contours are merged when the orientation is the same.
|
||||
*
|
||||
* This method produces polygons and allows to fine-tune the parameters for that purpose.
|
||||
|
|
@ -795,7 +795,7 @@ public:
|
|||
* on the individual result polygons of the merge step. The result may contain overlapping contours, but no self-overlaps.
|
||||
*
|
||||
* dx and dy describe the sizing. A positive value indicates oversize (outwards) while a negative one describes undersize (inwards).
|
||||
* The sizing applied can be choosen differently in x and y direction. In this case, the sign must be identical for both
|
||||
* The sizing applied can be chosen differently in x and y direction. In this case, the sign must be identical for both
|
||||
* dx and dy.
|
||||
*
|
||||
* The result is presented as a set of edges forming closed contours. Hulls are oriented clockwise while
|
||||
|
|
@ -820,7 +820,7 @@ public:
|
|||
* Polygon overlap occures if the polygons are close enough, so a positive sizing makes polygons overlap.
|
||||
*
|
||||
* dx and dy describe the sizing. A positive value indicates oversize (outwards) while a negative one describes undersize (inwards).
|
||||
* The sizing applied can be choosen differently in x and y direction. In this case, the sign must be identical for both
|
||||
* The sizing applied can be chosen differently in x and y direction. In this case, the sign must be identical for both
|
||||
* dx and dy.
|
||||
*
|
||||
* This method produces polygons and allows to fine-tune the parameters for that purpose.
|
||||
|
|
|
|||
|
|
@ -976,7 +976,7 @@ public:
|
|||
/**
|
||||
* @brief Returns edges (point-like) representing the start part of the edges
|
||||
*
|
||||
* The length of the part can be choosen by length or a fraction of the original length.
|
||||
* The length of the part can be chosen by length or a fraction of the original length.
|
||||
* If length and fraction are 0, a point at the beginning of the edge will be created.
|
||||
* If length is non-zero and fraction is 0, a segment in the direction of the edge
|
||||
* with the given length is created, even if the length is larger than the original
|
||||
|
|
|
|||
|
|
@ -301,7 +301,7 @@ public:
|
|||
/**
|
||||
* @brief Adds the given attribute to the attribute set
|
||||
*
|
||||
* Attributes are arbitary IDs attached to clusters.
|
||||
* Attributes are arbitrary IDs attached to clusters.
|
||||
* The attribute value 0 is reserved for "no attribute" and is not
|
||||
* put into the set.
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -138,7 +138,7 @@ struct LPLogicalLessFunc
|
|||
* @brief A layer offset
|
||||
*
|
||||
* This struct defines a layer offset which can be "added" to a LayerProperties object
|
||||
* If the layer offset is defined with a name, any occurance of '*' in the string
|
||||
* If the layer offset is defined with a name, any occurrence of '*' in the string
|
||||
* is replaced with the original name. This way, applying "*_A" with "+" yields a
|
||||
* postfix "_A" to the original layer name (if it is named).
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -1304,7 +1304,7 @@ Layout::do_update ()
|
|||
try {
|
||||
|
||||
// if the hierarchy has been changed so far, update
|
||||
// the hierarchy management informations
|
||||
// the hierarchy management information
|
||||
if (hier_dirty ()) {
|
||||
{
|
||||
tl::SelfTimer timer (tl::verbosity () > layout_base_verbosity + 10, "Updating relations");
|
||||
|
|
@ -1324,7 +1324,7 @@ Layout::do_update ()
|
|||
|
||||
// if something on the bboxes (either on shape level or on
|
||||
// cell bbox level - i.e. by child instances) has been changed,
|
||||
// update the bbox informations. In addition sort the shapes
|
||||
// update the bbox information. In addition sort the shapes
|
||||
// lists of region queries, since they might have changed once
|
||||
// the bboxes are dirty.
|
||||
if (bboxes_dirty ()) {
|
||||
|
|
|
|||
|
|
@ -95,7 +95,7 @@ public:
|
|||
* @brief Invalidate the bounding boxes
|
||||
*
|
||||
* This method is supposed to be called by shape containers for example if
|
||||
* some event has occured that changed the bounding boxes.
|
||||
* some event has occurred that changed the bounding boxes.
|
||||
*
|
||||
* If the index is std::numeric_limits<unsigned int>::max, this method
|
||||
* applies to all layers.
|
||||
|
|
|
|||
|
|
@ -471,7 +471,7 @@ public:
|
|||
* * No connection indicated (circuit_cell_name_prefix == 0: the net shapes are simply put into their
|
||||
* respective circuits. The connections are not indicated.
|
||||
* * Subnet hierarchy (circuit_cell_name_prefix != 0): for each root net, a full hierarchy is built
|
||||
* to accomodate the subnets (see build_net in recursive mode).
|
||||
* to accommodate the subnets (see build_net in recursive mode).
|
||||
*
|
||||
* If a device cell name prefix is given, cells will be produced for each device abstract
|
||||
* using a name like device_cell_name_prefix + device name.
|
||||
|
|
|
|||
|
|
@ -66,7 +66,7 @@ private:
|
|||
};
|
||||
|
||||
/**
|
||||
* @brief A property mapper based on a dynamic propery id generation
|
||||
* @brief A property mapper based on a dynamic property id generation
|
||||
*
|
||||
* This class can be used as property mapper for certain "insert" flavors of
|
||||
* the Instance and Shapes class.
|
||||
|
|
|
|||
|
|
@ -144,7 +144,7 @@ public:
|
|||
* @brief Undo the current transaction
|
||||
*
|
||||
* The current transaction is undone with this method.
|
||||
* The 'available_undo' method can be used to determine wether
|
||||
* The 'available_undo' method can be used to determine whether
|
||||
* there are transactions to undo.
|
||||
*/
|
||||
void undo ();
|
||||
|
|
@ -153,7 +153,7 @@ public:
|
|||
* @brief Redo the next available transaction
|
||||
*
|
||||
* The next transaction is redone with this method.
|
||||
* The 'available_redo' method can be used to determine wether
|
||||
* The 'available_redo' method can be used to determine whether
|
||||
* there are transactions to undo.
|
||||
*/
|
||||
void redo ();
|
||||
|
|
|
|||
|
|
@ -845,7 +845,7 @@ public:
|
|||
/**
|
||||
* @brief Get the x perspective tilt angle in degree
|
||||
*
|
||||
* To achieve the same visual effect, a different tilt angle has to be choosen for
|
||||
* To achieve the same visual effect, a different tilt angle has to be chosen for
|
||||
* a given observer distance z. This method computes the tilt angle for the given observer
|
||||
* distance.
|
||||
*/
|
||||
|
|
@ -854,7 +854,7 @@ public:
|
|||
/**
|
||||
* @brief Get the y perspective tilt angle in degree
|
||||
*
|
||||
* To achieve the same visual effect, a different tilt angle has to be choosen for
|
||||
* To achieve the same visual effect, a different tilt angle has to be chosen for
|
||||
* a given observer distance z. This method computes the tilt angle for the given observer
|
||||
* distance.
|
||||
*/
|
||||
|
|
@ -868,7 +868,7 @@ public:
|
|||
/**
|
||||
* @brief Returns the matrix for perspective transformation
|
||||
*
|
||||
* To achieve the same visual effect, a different tilt angle has to be choosen for
|
||||
* To achieve the same visual effect, a different tilt angle has to be chosen for
|
||||
* a given observer distance z. This method computes the tilt angle for the given observer
|
||||
* distance.
|
||||
*
|
||||
|
|
@ -970,7 +970,7 @@ struct MatrixAdjustFlags
|
|||
* @param landmarks_before The points before the transformation.
|
||||
* @param landmarks_after The points after the transformation.
|
||||
* @param flags Selects the properties to adjust.
|
||||
* @param fixed_point The index of the fixed point (one that is definitly mapped to the target) or -1 if there is none
|
||||
* @param fixed_point The index of the fixed point (one that is definitely mapped to the target) or -1 if there is none
|
||||
*/
|
||||
void DB_PUBLIC adjust_matrix (Matrix2d &matrix, db::DVector &disp, const std::vector <db::DPoint> &landmarks_before, const std::vector <db::DPoint> &landmarks_after, MatrixAdjustFlags::Flags flags, int fixed_point = -1);
|
||||
|
||||
|
|
@ -986,7 +986,7 @@ void DB_PUBLIC adjust_matrix (Matrix2d &matrix, db::DVector &disp, const std::ve
|
|||
* @param landmarks_before The points before the transformation.
|
||||
* @param landmarks_after The points after the transformation.
|
||||
* @param flags Selects the properties to adjust.
|
||||
* @param fixed_point The index of the fixed point (one that is definitly mapped to the target) or -1 if there is none
|
||||
* @param fixed_point The index of the fixed point (one that is definitely mapped to the target) or -1 if there is none
|
||||
*/
|
||||
void DB_PUBLIC adjust_matrix (Matrix3d &matrix, const std::vector <db::DPoint> &landmarks_before, const std::vector <db::DPoint> &landmarks_after, MatrixAdjustFlags::Flags flags, int fixed_point = -1);
|
||||
|
||||
|
|
|
|||
|
|
@ -34,7 +34,7 @@ namespace db
|
|||
/**
|
||||
* @brief A structure describing the meta information from the reader
|
||||
*
|
||||
* In the meta information block, the reader provides additional informations
|
||||
* In the meta information block, the reader provides additional information
|
||||
* about the file and content etc.
|
||||
* "name" is a unique name that can be used to identify the information.
|
||||
* "description" is a "speaking" description of the information.
|
||||
|
|
|
|||
|
|
@ -446,7 +446,7 @@ public:
|
|||
/**
|
||||
* @brief Gets the qualified name
|
||||
*
|
||||
* The qualified name is like the expanded name, but preceeded with the
|
||||
* The qualified name is like the expanded name, but preceded with the
|
||||
* Circuit name if known (e.g. "CIRCUIT:NET")
|
||||
*/
|
||||
std::string qname () const;
|
||||
|
|
|
|||
|
|
@ -123,7 +123,7 @@ public:
|
|||
}
|
||||
|
||||
/**
|
||||
* @brief Gets the cell name the error occured in
|
||||
* @brief Gets the cell name the error occurred in
|
||||
*/
|
||||
const std::string &cell_name () const
|
||||
{
|
||||
|
|
|
|||
|
|
@ -270,7 +270,7 @@ public:
|
|||
* @brief String conversion
|
||||
*
|
||||
* If dbu is set, it determines the factor by which the coordinates are multiplied to render
|
||||
* micron units. In addition, a micron format is choosen for output of these coordinates.
|
||||
* micron units. In addition, a micron format is chosen for output of these coordinates.
|
||||
*/
|
||||
std::string
|
||||
to_string (double dbu) const
|
||||
|
|
|
|||
|
|
@ -118,7 +118,7 @@ void cut_polygon (const PolygonType &input, const typename PolygonType::edge_typ
|
|||
* @brief Split a polygon into two or more parts
|
||||
*
|
||||
* This function splits a polygon into parts using some heuristics to determine a "suitable" cut line.
|
||||
* The cut line is choosen through a vertex close to a center (either horizontal or vertical). The splitting
|
||||
* The cut line is chosen through a vertex close to a center (either horizontal or vertical). The splitting
|
||||
* is supposed to create smaller parts with less vertices or a better area ratio of polygon to bounding box area.
|
||||
*
|
||||
* @param polygon The input polygon
|
||||
|
|
|
|||
|
|
@ -208,7 +208,7 @@ public:
|
|||
* @param box The region to select
|
||||
* @param mode See above
|
||||
* @param flags The kind of shapes to iterate over (or-ed constants of flags_type)
|
||||
* @param prop_sel The propery selection
|
||||
* @param prop_sel The property selection
|
||||
* @param inv_prop_sel True, if shapes not matching the property selection shall be reported
|
||||
*/
|
||||
ShapeIterator (const shapes_type &shapes, const box_type &box, region_mode mode, unsigned int flags = All, const property_selector *prop_sel = 0, bool inv_prop_sel = false);
|
||||
|
|
|
|||
|
|
@ -33,10 +33,10 @@ namespace db
|
|||
/**
|
||||
* @brief A traits class for the various shape types
|
||||
*
|
||||
* This class provides informations about various properties of the shape class, i.e.
|
||||
* - wether the objects must be dereferenced into standanlone containers
|
||||
* - wether the objects are arrays, potentially using the array repository
|
||||
* - wether the objects have properties
|
||||
* This class provides information about various properties of the shape class, i.e.
|
||||
* - whether the objects must be dereferenced into standanlone containers
|
||||
* - whether the objects are arrays, potentially using the array repository
|
||||
* - whether the objects have properties
|
||||
*/
|
||||
template <class Sh>
|
||||
struct shape_traits
|
||||
|
|
|
|||
|
|
@ -910,7 +910,7 @@ TilingProcessor::execute (const std::string &desc)
|
|||
}
|
||||
|
||||
if (job.has_error ()) {
|
||||
throw tl::Exception (tl::to_string (tr ("Errors occured during processing. First error message says:\n")) + job.error_messages ().front ());
|
||||
throw tl::Exception (tl::to_string (tr ("Errors occurred during processing. First error message says:\n")) + job.error_messages ().front ());
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -1433,7 +1433,7 @@ operator<< (std::ostream &os, const simple_trans<C> &t)
|
|||
/**
|
||||
* @brief A complex transformation
|
||||
*
|
||||
* A complex transformation provides magnification, mirroring at the x-axis, rotation by an arbitary
|
||||
* A complex transformation provides magnification, mirroring at the x-axis, rotation by an arbitrary
|
||||
* angle and a displacement. The template parameters for this transformation are
|
||||
* I (the input coordinate type), F (the output coordinate type) and R (the representation
|
||||
* type used internally for representing the floating-point members).
|
||||
|
|
|
|||
|
|
@ -382,7 +382,7 @@ struct coord_traits<int64_t>
|
|||
/**
|
||||
* @brief Coord_traits specialisation for double coordinates
|
||||
*
|
||||
* The precision is choosen such that the double coordinate
|
||||
* The precision is chosen such that the double coordinate
|
||||
* can represent "micrometers" with a physical resolution limit of 0.01 nm.
|
||||
* The area precision will render reliable vector product signs for vectors
|
||||
* of roughly up to 60 mm length.
|
||||
|
|
|
|||
|
|
@ -312,7 +312,7 @@ public:
|
|||
* @brief String conversion
|
||||
*
|
||||
* If dbu is set, it determines the factor by which the coordinates are multiplied to render
|
||||
* micron units. In addition, a micron format is choosen for output of these coordinates.
|
||||
* micron units. In addition, a micron format is chosen for output of these coordinates.
|
||||
*/
|
||||
std::string
|
||||
to_string (double dbu) const
|
||||
|
|
|
|||
|
|
@ -2016,7 +2016,7 @@ Class<db::Cell> decl_Cell ("db", "Cell",
|
|||
"The algorithm supports a global fill raster as well as local (per-polygon) origin optimization. In the latter case "
|
||||
"the origin of the regular raster is optimized per individual polygon of the fill region.\n"
|
||||
"\n"
|
||||
"A more elaborate version of this method is available which also returns informations about the non-filled parts.\n"
|
||||
"A more elaborate version of this method is available which also returns information about the non-filled parts.\n"
|
||||
"\n"
|
||||
"This method has been introduced in version 0.23.\n"
|
||||
) +
|
||||
|
|
@ -3060,7 +3060,7 @@ Class<db::Cell> decl_Cell ("db", "Cell",
|
|||
"@brief A cell\n"
|
||||
"\n"
|
||||
"A cell object consists of a set of shape containers (called layers),\n"
|
||||
"a set of child cell instances and auxiliary informations such as\n"
|
||||
"a set of child cell instances and auxiliary information such as\n"
|
||||
"the parent instance list.\n"
|
||||
"A cell is identified through an index given to the cell upon instantiation.\n"
|
||||
"Cell instances refer to single instances or array instances. Both are encapsulated in the\n"
|
||||
|
|
|
|||
|
|
@ -630,7 +630,7 @@ Class<db::Edge> decl_Edge ("db", "Edge",
|
|||
"An edge is a connection between points, usually participating in a larger context "
|
||||
"such as a polygon. An edge has a defined direction (from p1 to p2). "
|
||||
"Edges play a role in the database as parts of polygons and to describe a line through both points.\n"
|
||||
"Altough supported, edges are rarely used as individual database objects.\n"
|
||||
"Although supported, edges are rarely used as individual database objects.\n"
|
||||
"\n"
|
||||
"See @<a href=\"/programming/database_api.xml\">The Database API@</a> for more details about the "
|
||||
"database objects like the Edge class."
|
||||
|
|
@ -678,7 +678,7 @@ Class<db::DEdge> decl_DEdge ("db", "DEdge",
|
|||
"such as a polygon. An edge has a defined direction (from p1 to p2). "
|
||||
"Edges play a role in the database as parts of polygons and to describe a line through both points.\n"
|
||||
"The \\Edge object is also used inside the boolean processor (\\EdgeProcessor).\n"
|
||||
"Altough supported, edges are rarely used as individual database objects.\n"
|
||||
"Although supported, edges are rarely used as individual database objects.\n"
|
||||
"\n"
|
||||
"See @<a href=\"/programming/database_api.xml\">The Database API@</a> for more details about the "
|
||||
"database objects like the Edge class."
|
||||
|
|
|
|||
|
|
@ -222,7 +222,7 @@ Class<db::EdgeProcessor> decl_EdgeProcessor ("db", "EdgeProcessor",
|
|||
"This method has been added in version 0.22.\n"
|
||||
"\n"
|
||||
"The mode specifies the rule to use when producing output. A value of 0 specifies the even-odd rule. "
|
||||
"A positive value specfies the wrap count threshold (postive only). A negative value specifies the "
|
||||
"A positive value specifies the wrap count threshold (positive only). A negative value specifies the "
|
||||
"threshold of the absolute value of the wrap count (i.e. -1 is non-zero rule).\n"
|
||||
"\n"
|
||||
"@param mode See description\n"
|
||||
|
|
@ -268,7 +268,7 @@ Class<db::EdgeProcessor> decl_EdgeProcessor ("db", "EdgeProcessor",
|
|||
"This method has been added in version 0.22.\n"
|
||||
"\n"
|
||||
"The mode specifies the rule to use when producing output. A value of 0 specifies the even-odd rule. "
|
||||
"A positive value specfies the wrap count threshold (postive only). A negative value specifies the "
|
||||
"A positive value specifies the wrap count threshold (positive only). A negative value specifies the "
|
||||
"threshold of the absolute value of the wrap count (i.e. -1 is non-zero rule).\n"
|
||||
"\n"
|
||||
"@param mode See description\n"
|
||||
|
|
@ -281,7 +281,7 @@ Class<db::EdgeProcessor> decl_EdgeProcessor ("db", "EdgeProcessor",
|
|||
"@brief Merge the given edges in a simple \"non-zero wrapcount\" fashion\n"
|
||||
"@args in\n"
|
||||
"\n"
|
||||
"The egdes provided must form valid closed contours. Contours oriented differently \"cancel\" each other. \n"
|
||||
"The edges provided must form valid closed contours. Contours oriented differently \"cancel\" each other. \n"
|
||||
"Overlapping contours are merged when the orientation is the same.\n"
|
||||
"\n"
|
||||
"The result is presented as a set of edges forming closed contours. Hulls are oriented clockwise while\n"
|
||||
|
|
@ -300,7 +300,7 @@ Class<db::EdgeProcessor> decl_EdgeProcessor ("db", "EdgeProcessor",
|
|||
"@brief Merge the given polygons and specify the merge mode\n"
|
||||
"@args in, mode\n"
|
||||
"\n"
|
||||
"The egdes provided must form valid closed contours. Contours oriented differently \"cancel\" each other. \n"
|
||||
"The edges provided must form valid closed contours. Contours oriented differently \"cancel\" each other. \n"
|
||||
"Overlapping contours are merged when the orientation is the same.\n"
|
||||
"\n"
|
||||
"The result is presented as a set of edges forming closed contours. Hulls are oriented clockwise while\n"
|
||||
|
|
@ -312,7 +312,7 @@ Class<db::EdgeProcessor> decl_EdgeProcessor ("db", "EdgeProcessor",
|
|||
"This method has been added in version 0.22.\n"
|
||||
"\n"
|
||||
"The mode specifies the rule to use when producing output. A value of 0 specifies the even-odd rule. "
|
||||
"A positive value specfies the wrap count threshold (postive only). A negative value specifies the "
|
||||
"A positive value specifies the wrap count threshold (positive only). A negative value specifies the "
|
||||
"threshold of the absolute value of the wrap count (i.e. -1 is non-zero rule).\n"
|
||||
"\n"
|
||||
"@param mode See description\n"
|
||||
|
|
@ -323,7 +323,7 @@ Class<db::EdgeProcessor> decl_EdgeProcessor ("db", "EdgeProcessor",
|
|||
"@brief Merge the given edges in a simple \"non-zero wrapcount\" fashion into polygons\n"
|
||||
"@args in, resolve_holes, min_coherence\n"
|
||||
"\n"
|
||||
"The egdes provided must form valid closed contours. Contours oriented differently \"cancel\" each other. \n"
|
||||
"The edges provided must form valid closed contours. Contours oriented differently \"cancel\" each other. \n"
|
||||
"Overlapping contours are merged when the orientation is the same.\n"
|
||||
"\n"
|
||||
"This method produces polygons and allows to fine-tune the parameters for that purpose.\n"
|
||||
|
|
@ -343,7 +343,7 @@ Class<db::EdgeProcessor> decl_EdgeProcessor ("db", "EdgeProcessor",
|
|||
"@brief Merge the given polygons and specify the merge mode\n"
|
||||
"@args in, resolve_holes, min_coherence, mode\n"
|
||||
"\n"
|
||||
"The egdes provided must form valid closed contours. Contours oriented differently \"cancel\" each other. \n"
|
||||
"The edges provided must form valid closed contours. Contours oriented differently \"cancel\" each other. \n"
|
||||
"Overlapping contours are merged when the orientation is the same.\n"
|
||||
"\n"
|
||||
"This method produces polygons and allows to fine-tune the parameters for that purpose.\n"
|
||||
|
|
@ -354,7 +354,7 @@ Class<db::EdgeProcessor> decl_EdgeProcessor ("db", "EdgeProcessor",
|
|||
"This method has been added in version 0.22.\n"
|
||||
"\n"
|
||||
"The mode specifies the rule to use when producing output. A value of 0 specifies the even-odd rule. "
|
||||
"A positive value specfies the wrap count threshold (postive only). A negative value specifies the "
|
||||
"A positive value specifies the wrap count threshold (positive only). A negative value specifies the "
|
||||
"threshold of the absolute value of the wrap count (i.e. -1 is non-zero rule).\n"
|
||||
"\n"
|
||||
"@param mode See description\n"
|
||||
|
|
@ -412,7 +412,7 @@ Class<db::EdgeProcessor> decl_EdgeProcessor ("db", "EdgeProcessor",
|
|||
"on the individual result polygons of the merge step. The result may contain overlapping contours, but no self-overlaps. \n"
|
||||
"\n"
|
||||
"dx and dy describe the sizing. A positive value indicates oversize (outwards) while a negative one describes undersize (inwards).\n"
|
||||
"The sizing applied can be choosen differently in x and y direction. In this case, the sign must be identical for both\n"
|
||||
"The sizing applied can be chosen differently in x and y direction. In this case, the sign must be identical for both\n"
|
||||
"dx and dy.\n"
|
||||
"\n"
|
||||
"The 'mode' parameter describes the corner fill strategy. Mode 0 connects all corner segments directly. Mode 1 is the 'octagon' strategy in which "
|
||||
|
|
@ -441,7 +441,7 @@ Class<db::EdgeProcessor> decl_EdgeProcessor ("db", "EdgeProcessor",
|
|||
"Polygon overlap occures if the polygons are close enough, so a positive sizing makes polygons overlap.\n"
|
||||
"\n"
|
||||
"dx and dy describe the sizing. A positive value indicates oversize (outwards) while a negative one describes undersize (inwards).\n"
|
||||
"The sizing applied can be choosen differently in x and y direction. In this case, the sign must be identical for both\n"
|
||||
"The sizing applied can be chosen differently in x and y direction. In this case, the sign must be identical for both\n"
|
||||
"dx and dy.\n"
|
||||
"\n"
|
||||
"The 'mode' parameter describes the corner fill strategy. Mode 0 connects all corner segments directly. Mode 1 is the 'octagon' strategy in which "
|
||||
|
|
|
|||
|
|
@ -423,7 +423,7 @@ Class<db::Edges> dec_Edges ("db", "Edges",
|
|||
"The edges form the contours of the polygons.\n"
|
||||
) +
|
||||
constructor ("new", &new_a2, gsi::arg ("array"),
|
||||
"@brief Constructor from an egde array\n"
|
||||
"@brief Constructor from an edge array\n"
|
||||
"\n"
|
||||
"This constructor creates a region from an array of edges.\n"
|
||||
) +
|
||||
|
|
@ -500,7 +500,7 @@ Class<db::Edges> dec_Edges ("db", "Edges",
|
|||
"\n"
|
||||
"This constructor creates an edge collection from the shapes delivered by the given recursive shape iterator.\n"
|
||||
"It feeds the shapes from a hierarchy of cells into the hierarchical edge set.\n"
|
||||
"The edges remain within their original hierachy unless other operations require the edges to be moved in the hierarchy.\n"
|
||||
"The edges remain within their original hierarchy unless other operations require the edges to be moved in the hierarchy.\n"
|
||||
"\n"
|
||||
"Text objects are not inserted, because they cannot be converted to edges.\n"
|
||||
"Edge objects are inserted as such. If \"as_edges\" is true, \"solid\" objects (boxes, polygons, paths) are converted to edges which "
|
||||
|
|
@ -519,7 +519,7 @@ Class<db::Edges> dec_Edges ("db", "Edges",
|
|||
"\n"
|
||||
"This constructor creates an edge collection from the shapes delivered by the given recursive shape iterator.\n"
|
||||
"It feeds the shapes from a hierarchy of cells into the hierarchical edge set.\n"
|
||||
"The edges remain within their original hierachy unless other operations require the edges to be moved in the hierarchy.\n"
|
||||
"The edges remain within their original hierarchy unless other operations require the edges to be moved in the hierarchy.\n"
|
||||
"The transformation is useful to scale to a specific database unit for example.\n"
|
||||
"\n"
|
||||
"Text objects are not inserted, because they cannot be converted to edges.\n"
|
||||
|
|
@ -550,7 +550,7 @@ Class<db::Edges> dec_Edges ("db", "Edges",
|
|||
"@code\n"
|
||||
"dots = RBA::Edges::new(iter, \"*\") # all texts\n"
|
||||
"dots = RBA::Edges::new(iter, \"A*\") # all texts starting with an 'A'\n"
|
||||
"dots = RBA::Edges::new(iter, \"A*\", false) # all texts exactly matchin 'A*'\n"
|
||||
"dots = RBA::Edges::new(iter, \"A*\", false) # all texts exactly matching 'A*'\n"
|
||||
"@/code\n"
|
||||
"\n"
|
||||
"This method has been introduced in version 0.26.\n"
|
||||
|
|
@ -571,7 +571,7 @@ Class<db::Edges> dec_Edges ("db", "Edges",
|
|||
"@code\n"
|
||||
"region = RBA::Region::new(iter, dss, \"*\") # all texts\n"
|
||||
"region = RBA::Region::new(iter, dss, \"A*\") # all texts starting with an 'A'\n"
|
||||
"region = RBA::Region::new(iter, dss, \"A*\", false) # all texts exactly matchin 'A*'\n"
|
||||
"region = RBA::Region::new(iter, dss, \"A*\", false) # all texts exactly matching 'A*'\n"
|
||||
"@/code\n"
|
||||
"\n"
|
||||
"This method has been introduced in version 0.26.\n"
|
||||
|
|
|
|||
|
|
@ -1956,7 +1956,7 @@ Class<db::Layout> decl_Layout ("db", "Layout",
|
|||
"@brief Registers a PCell declaration under the given name\n"
|
||||
"@args name, declaration\n"
|
||||
"Registers a local PCell in the current layout. If a declaration with that name\n"
|
||||
"alreay exists, it is replaced with the new declaration.\n"
|
||||
"already exists, it is replaced with the new declaration.\n"
|
||||
"\n"
|
||||
"This method has been introduced in version 0.22.\n"
|
||||
) +
|
||||
|
|
|
|||
|
|
@ -376,7 +376,7 @@ Class<db::LayoutToNetlist> decl_dbLayoutToNetlist ("db", "LayoutToNetlist",
|
|||
"@li No connection indicated (circuit_cell_name_prefix == 0: the net shapes are simply put into their\n"
|
||||
" respective circuits. The connections are not indicated. @/li\n"
|
||||
"@li Subnet hierarchy (circuit_cell_name_prefix != 0): for each root net, a full hierarchy is built\n"
|
||||
" to accomodate the subnets (see build_net in recursive mode). @/li\n"
|
||||
" to accommodate the subnets (see build_net in recursive mode). @/li\n"
|
||||
"@/ul\n"
|
||||
"\n"
|
||||
"If a device name prefix is given, device shapes will be output on device cells named\n"
|
||||
|
|
|
|||
|
|
@ -93,14 +93,14 @@ Class<db::Manager> decl_Manager ("db", "Manager",
|
|||
"@brief Undo the current transaction\n"
|
||||
"\n"
|
||||
"The current transaction is undone with this method.\n"
|
||||
"The 'has_undo' method can be used to determine wether\n"
|
||||
"The 'has_undo' method can be used to determine whether\n"
|
||||
"there are transactions to undo.\n"
|
||||
) +
|
||||
gsi::method ("redo", &db::Manager::redo,
|
||||
"@brief Redo the next available transaction\n"
|
||||
"\n"
|
||||
"The next transaction is redone with this method.\n"
|
||||
"The 'has_redo' method can be used to determine wether\n"
|
||||
"The 'has_redo' method can be used to determine whether\n"
|
||||
"there are transactions to undo.\n"
|
||||
) +
|
||||
gsi::method_ext ("has_undo?", &has_undo,
|
||||
|
|
|
|||
|
|
@ -557,7 +557,7 @@ gsi::Class<db::Matrix3d> decl_Matrix3d ("db", "Matrix3d",
|
|||
"@param landmarks_before The points before the transformation.\n"
|
||||
"@param landmarks_after The points after the transformation.\n"
|
||||
"@param mode Selects the adjustment mode. Must be one of the Adjust... constants.\n"
|
||||
"@param fixed_point The index of the fixed point (one that is definitly mapped to the target) or -1 if there is none\n"
|
||||
"@param fixed_point The index of the fixed point (one that is definitely mapped to the target) or -1 if there is none\n"
|
||||
) +
|
||||
gsi::method ("AdjustNone", &adjust_none,
|
||||
"@brief Mode for \\adjust: adjust nothing\n"
|
||||
|
|
|
|||
|
|
@ -331,7 +331,7 @@ Class<db::Net> decl_dbNet ("db", "Net",
|
|||
) +
|
||||
gsi::method ("qname|to_s", &db::Net::qname,
|
||||
"@brief Gets the qualified name.\n"
|
||||
"The qualified name is like the expanded name, but the circuit's name is preceeded\n"
|
||||
"The qualified name is like the expanded name, but the circuit's name is preceded\n"
|
||||
"(i.e. 'CIRCUIT:NET') if available.\n"
|
||||
) +
|
||||
gsi::method ("expanded_name", &db::Net::expanded_name,
|
||||
|
|
@ -878,7 +878,7 @@ Class<db::Circuit> decl_dbCircuit ("db", "Circuit",
|
|||
"A circuit has pins by which it can connect to the outside. Pins are "
|
||||
"created using \\create_pin and are represented by the \\Pin class.\n"
|
||||
"\n"
|
||||
"Futhermore, a circuit manages the components of the netlist. "
|
||||
"Furthermore, a circuit manages the components of the netlist. "
|
||||
"Components are devices (class \\Device) and subcircuits (class \\SubCircuit). "
|
||||
"Devices are basic devices such as resistors or transistors. Subcircuits "
|
||||
"are other circuits to which nets from this circuit connect. "
|
||||
|
|
|
|||
|
|
@ -154,8 +154,8 @@ Class<db::NetlistDeviceExtractorError> decl_dbNetlistDeviceExtractorError ("db",
|
|||
"@brief Sets the category description.\n"
|
||||
"See \\category_name= for details about categories."
|
||||
),
|
||||
"@brief An error that occured during device extraction\n"
|
||||
"The device extractor will keep errors that occured during extraction of the devices. "
|
||||
"@brief An error that occurred during device extraction\n"
|
||||
"The device extractor will keep errors that occurred during extraction of the devices. "
|
||||
"It does not by using this error class.\n"
|
||||
"\n"
|
||||
"An error is basically described by the cell/circuit it occures in and the message. "
|
||||
|
|
|
|||
|
|
@ -1328,7 +1328,7 @@ struct polygon_defs
|
|||
"@brief Iterate over the edges that make up the polygon\n"
|
||||
"\n"
|
||||
"This iterator will deliver all edges, including those of the holes. "
|
||||
"Hole edges are oriented counterclockwise while hull egdes are oriented clockwise.\n"
|
||||
"Hole edges are oriented counterclockwise while hull edges are oriented clockwise.\n"
|
||||
) +
|
||||
iterator ("each_edge", (typename C::polygon_edge_iterator (C::*)(unsigned int) const) (&C::begin_edge),
|
||||
"@brief Iterate over the edges of one contour of the polygon\n"
|
||||
|
|
@ -1338,7 +1338,7 @@ struct polygon_defs
|
|||
"\n"
|
||||
"This iterator will deliver all edges of the contour specified by the contour parameter. "
|
||||
"The hull has contour number 0, the first hole has contour 1 etc.\n"
|
||||
"Hole edges are oriented counterclockwise while hull egdes are oriented clockwise.\n"
|
||||
"Hole edges are oriented counterclockwise while hull edges are oriented clockwise.\n"
|
||||
"\n"
|
||||
"This method was introduced in version 0.24."
|
||||
) +
|
||||
|
|
|
|||
|
|
@ -729,7 +729,7 @@ Class<db::Region> decl_Region ("db", "Region",
|
|||
"@code\n"
|
||||
"region = RBA::Region::new(iter, \"*\") # all texts\n"
|
||||
"region = RBA::Region::new(iter, \"A*\") # all texts starting with an 'A'\n"
|
||||
"region = RBA::Region::new(iter, \"A*\", false) # all texts exactly matchin 'A*'\n"
|
||||
"region = RBA::Region::new(iter, \"A*\", false) # all texts exactly matching 'A*'\n"
|
||||
"@/code\n"
|
||||
"\n"
|
||||
"This method has been introduced in version 0.25. The enlargement parameter has been added in version 0.26.\n"
|
||||
|
|
@ -751,7 +751,7 @@ Class<db::Region> decl_Region ("db", "Region",
|
|||
"@code\n"
|
||||
"region = RBA::Region::new(iter, dss, \"*\") # all texts\n"
|
||||
"region = RBA::Region::new(iter, dss, \"A*\") # all texts starting with an 'A'\n"
|
||||
"region = RBA::Region::new(iter, dss, \"A*\", false) # all texts exactly matchin 'A*'\n"
|
||||
"region = RBA::Region::new(iter, dss, \"A*\", false) # all texts exactly matching 'A*'\n"
|
||||
"@/code\n"
|
||||
"\n"
|
||||
"This variant has been introduced in version 0.26.\n"
|
||||
|
|
|
|||
|
|
@ -1365,7 +1365,7 @@ Class<db::Shape> decl_Shape ("db", "Shape",
|
|||
"@brief Iterates over the edges of the object\n"
|
||||
"\n"
|
||||
"This method applies to polygons and simple polygons and delivers all edges that form the polygon's contours. "
|
||||
"Hole edges are oriented counterclockwise while hull egdes are oriented clockwise.\n"
|
||||
"Hole edges are oriented counterclockwise while hull edges are oriented clockwise.\n"
|
||||
"\n"
|
||||
"It will throw an exception if the object is not a polygon.\n"
|
||||
) +
|
||||
|
|
@ -1383,7 +1383,7 @@ Class<db::Shape> decl_Shape ("db", "Shape",
|
|||
"\n"
|
||||
"This method applies to polygons and simple polygons and delivers all edges that form the given contour of the polygon. "
|
||||
"The hull has contour number 0, the first hole has contour 1 etc.\n"
|
||||
"Hole edges are oriented counterclockwise while hull egdes are oriented clockwise.\n"
|
||||
"Hole edges are oriented counterclockwise while hull edges are oriented clockwise.\n"
|
||||
"\n"
|
||||
"It will throw an exception if the object is not a polygon.\n"
|
||||
"\n"
|
||||
|
|
|
|||
|
|
@ -412,7 +412,7 @@ Class<db::Text> decl_Text ("db", "Text",
|
|||
"A text object has a point (location), a text, a text transformation,\n"
|
||||
"a text size and a font id. Text size and font id are provided to be\n"
|
||||
"be able to render the text correctly.\n"
|
||||
"Text objects are used as labels (i.e. for pins) or to indiciate a particular position.\n"
|
||||
"Text objects are used as labels (i.e. for pins) or to indicate a particular position.\n"
|
||||
"\n"
|
||||
"The \\Text class uses integer coordinates. A class that operates with floating-point coordinates "
|
||||
"is \\DText.\n"
|
||||
|
|
@ -462,7 +462,7 @@ Class<db::DText> decl_DText ("db", "DText",
|
|||
"A text object has a point (location), a text, a text transformation,\n"
|
||||
"a text size and a font id. Text size and font id are provided to be\n"
|
||||
"be able to render the text correctly.\n"
|
||||
"Text objects are used as labels (i.e. for pins) or to indiciate a particular position.\n"
|
||||
"Text objects are used as labels (i.e. for pins) or to indicate a particular position.\n"
|
||||
"\n"
|
||||
"The \\DText class uses floating-point coordinates. A class that operates with integer coordinates "
|
||||
"is \\Text.\n"
|
||||
|
|
|
|||
|
|
@ -1040,7 +1040,7 @@ Class<db::DCplxTrans> decl_DCplxTrans ("db", "DCplxTrans",
|
|||
cplx_trans_defs<db::DCplxTrans>::methods (),
|
||||
"@brief A complex transformation\n"
|
||||
"\n"
|
||||
"A complex transformation provides magnification, mirroring at the x-axis, rotation by an arbitary\n"
|
||||
"A complex transformation provides magnification, mirroring at the x-axis, rotation by an arbitrary\n"
|
||||
"angle and a displacement. This is also the order, the operations are applied.\n"
|
||||
"\n"
|
||||
"A complex transformation provides a superset of the simple transformation.\n"
|
||||
|
|
@ -1129,7 +1129,7 @@ Class<db::CplxTrans> decl_CplxTrans ("db", "CplxTrans",
|
|||
cplx_trans_defs<db::CplxTrans>::methods (),
|
||||
"@brief A complex transformation\n"
|
||||
"\n"
|
||||
"A complex transformation provides magnification, mirroring at the x-axis, rotation by an arbitary\n"
|
||||
"A complex transformation provides magnification, mirroring at the x-axis, rotation by an arbitrary\n"
|
||||
"angle and a displacement. This is also the order, the operations are applied.\n"
|
||||
"This version can transform integer-coordinate objects into floating-point coordinate objects. "
|
||||
"This is the generic and exact case, for example for non-integer magnifications.\n"
|
||||
|
|
@ -1212,7 +1212,7 @@ Class<db::ICplxTrans> decl_ICplxTrans ("db", "ICplxTrans",
|
|||
cplx_trans_defs<db::ICplxTrans>::methods (),
|
||||
"@brief A complex transformation\n"
|
||||
"\n"
|
||||
"A complex transformation provides magnification, mirroring at the x-axis, rotation by an arbitary\n"
|
||||
"A complex transformation provides magnification, mirroring at the x-axis, rotation by an arbitrary\n"
|
||||
"angle and a displacement. This is also the order, the operations are applied.\n"
|
||||
"This version can transform integer-coordinate objects into the same, which may involve rounding and can be inexact.\n"
|
||||
"\n"
|
||||
|
|
@ -1294,7 +1294,7 @@ Class<db::VCplxTrans> decl_VCplxTrans ("db", "VCplxTrans",
|
|||
cplx_trans_defs<db::VCplxTrans>::methods (),
|
||||
"@brief A complex transformation\n"
|
||||
"\n"
|
||||
"A complex transformation provides magnification, mirroring at the x-axis, rotation by an arbitary\n"
|
||||
"A complex transformation provides magnification, mirroring at the x-axis, rotation by an arbitrary\n"
|
||||
"angle and a displacement. This is also the order, the operations are applied.\n"
|
||||
"This version can transform floating point coordinate objects into integer coordinate objects, which may involve rounding and can be inexact.\n"
|
||||
"\n"
|
||||
|
|
|
|||
|
|
@ -87,7 +87,7 @@ TEST(1)
|
|||
}
|
||||
EXPECT_EQ (m, (unsigned int) 0x04231); // c1,c5,c3,c4,c2
|
||||
|
||||
// check relation informations ..
|
||||
// check relation information ..
|
||||
db::Cell::child_cell_iterator ch;
|
||||
db::Cell::const_iterator chi;
|
||||
db::Cell::parent_cell_iterator pa;
|
||||
|
|
|
|||
|
|
@ -46,7 +46,7 @@ TEST(1)
|
|||
c1.push_back (db::Point (200, 0));
|
||||
p1.assign_hull (c1.begin (), c1.end ());
|
||||
|
||||
// insert two references to indentical but shifted polygons
|
||||
// insert two references to identical but shifted polygons
|
||||
db::PolygonRef pref1 (p1, rep);
|
||||
|
||||
db::Polygon p2;
|
||||
|
|
@ -115,7 +115,7 @@ TEST(2)
|
|||
c1.push_back (db::Point (200, 0));
|
||||
p1.assign_hull (c1.begin (), c1.end ());
|
||||
|
||||
// insert two references to indentical but shifted polygons
|
||||
// insert two references to identical but shifted polygons
|
||||
db::PolygonRef pr1 (p1, *rep);
|
||||
|
||||
db::Polygon p2;
|
||||
|
|
@ -156,7 +156,7 @@ TEST(1SIMPLE)
|
|||
c1.push_back (db::Point (200, 0));
|
||||
p1.assign_hull (c1.begin (), c1.end ());
|
||||
|
||||
// insert two references to indentical but shifted polygons
|
||||
// insert two references to identical but shifted polygons
|
||||
db::SimplePolygonRef pref1 (p1, rep);
|
||||
|
||||
db::SimplePolygon p2;
|
||||
|
|
@ -225,7 +225,7 @@ TEST(2SIMPLE)
|
|||
c1.push_back (db::Point (200, 0));
|
||||
p1.assign_hull (c1.begin (), c1.end ());
|
||||
|
||||
// insert two references to indentical but shifted polygons
|
||||
// insert two references to identical but shifted polygons
|
||||
db::SimplePolygonRef pr1 (p1, *rep);
|
||||
|
||||
db::SimplePolygon p2;
|
||||
|
|
|
|||
|
|
@ -1365,7 +1365,7 @@ CODE
|
|||
# borders of the polygons of the second operand.
|
||||
#
|
||||
# The following images show the effect of the "and" method
|
||||
# on polygons and egdes (layer1: red, layer2: blue):
|
||||
# on polygons and edges (layer1: red, layer2: blue):
|
||||
#
|
||||
# @table
|
||||
# @tr
|
||||
|
|
@ -1392,7 +1392,7 @@ CODE
|
|||
# of the second operand.
|
||||
#
|
||||
# The following images show the effect of the "not" method
|
||||
# on polygons and egdes (layer1: red, layer2: blue):
|
||||
# on polygons and edges (layer1: red, layer2: blue):
|
||||
#
|
||||
# @table
|
||||
# @tr
|
||||
|
|
@ -1416,7 +1416,7 @@ CODE
|
|||
# This method is available for polygon and edge layers.
|
||||
#
|
||||
# The following images show the effect of the "xor" method
|
||||
# on polygons and egdes (layer1: red, layer2: blue):
|
||||
# on polygons and edges (layer1: red, layer2: blue):
|
||||
#
|
||||
# @table
|
||||
# @tr
|
||||
|
|
@ -1439,7 +1439,7 @@ CODE
|
|||
# This method is available for polygon and edge layers.
|
||||
#
|
||||
# The following images show the effect of the "or" method
|
||||
# on polygons and egdes (layer1: red, layer2: blue):
|
||||
# on polygons and edges (layer1: red, layer2: blue):
|
||||
#
|
||||
# @table
|
||||
# @tr
|
||||
|
|
@ -1462,7 +1462,7 @@ CODE
|
|||
# This method is available for polygon, edge and edge pair layers.
|
||||
#
|
||||
# The following images show the effect of the "join" method
|
||||
# on polygons and egdes (layer1: red, layer2: blue):
|
||||
# on polygons and edges (layer1: red, layer2: blue):
|
||||
#
|
||||
# @table
|
||||
# @tr
|
||||
|
|
|
|||
|
|
@ -54,7 +54,7 @@
|
|||
<widget class="QLabel" name="label_4" >
|
||||
<property name="text" >
|
||||
<string>Radius to apply on polygon corners
|
||||
(Radius for inner corners can be specified seperately.
|
||||
(Radius for inner corners can be specified separately.
|
||||
Leave empty to get the same radius than for outer corners)</string>
|
||||
</property>
|
||||
</widget>
|
||||
|
|
|
|||
|
|
@ -228,7 +228,7 @@ MainService::cm_descend ()
|
|||
throw tl::Exception (tl::to_string (QObject::tr ("Select an object to determine into which instance to descend")));
|
||||
}
|
||||
if (! common_inst.valid () || common_inst.ambigous ()) {
|
||||
throw tl::Exception (tl::to_string (QObject::tr ("Selection is ambigous - cannot determine into which instance to descend")));
|
||||
throw tl::Exception (tl::to_string (QObject::tr ("Selection is ambiguous - cannot determine into which instance to descend")));
|
||||
}
|
||||
|
||||
// remove the common path and create a new set of selections
|
||||
|
|
|
|||
|
|
@ -47,7 +47,7 @@ struct GSI_PUBLIC Callee
|
|||
/**
|
||||
* @brief Callback connector object
|
||||
*
|
||||
* This object holds informations about the actual implementation of the callback
|
||||
* This object holds information about the actual implementation of the callback
|
||||
* on the scripting client's side.
|
||||
*/
|
||||
struct Callback
|
||||
|
|
|
|||
|
|
@ -42,7 +42,7 @@ namespace gsi
|
|||
{
|
||||
|
||||
// ---------------------------------------------------------------
|
||||
// Access to the internal informations of GSI
|
||||
// Access to the internal information of GSI
|
||||
|
||||
static int t_void () { return T_void; }
|
||||
static int t_bool () { return T_bool; }
|
||||
|
|
|
|||
|
|
@ -63,7 +63,7 @@ struct IncompatibleReturnTypeException
|
|||
*
|
||||
* A class declaration collects objects of this kind to represent methods and their specific
|
||||
* implementation.
|
||||
* This class is implemented in various specific ways that bind the abstract call to a specifc
|
||||
* This class is implemented in various specific ways that bind the abstract call to a specific
|
||||
* C++ method.
|
||||
*/
|
||||
class GSI_PUBLIC MethodBase
|
||||
|
|
|
|||
|
|
@ -1451,7 +1451,7 @@ struct compute_pass_obj<arg_pass_ownership, X>
|
|||
*
|
||||
* The type declaration carries the basic type code and flags, if the argument
|
||||
* is an iterator delivering the given types of a vector of the given types and
|
||||
* adds class informations if the type is "T_object", "T_object_ref", "T_object_cref".
|
||||
* adds class information if the type is "T_object", "T_object_ref", "T_object_cref".
|
||||
*/
|
||||
class GSI_PUBLIC ArgType
|
||||
{
|
||||
|
|
|
|||
|
|
@ -484,7 +484,7 @@ gsi::Class<ImageRef> decl_Image (decl_BasicImage, "lay", "Image",
|
|||
"line by line. Each line must consist of \"w\" values where the first value is the leftmost pixel.\n"
|
||||
"Note, that the rows are oriented in the mathematical sense (first one is the lowest) contrary to \n"
|
||||
"the common convention for image data.\n"
|
||||
"Initially the pixel width and heigt will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"Initially the pixel width and height will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"To adjust the data range use the \\min_value and \\max_value properties.\n"
|
||||
"\n"
|
||||
"@param w The width of the image\n"
|
||||
|
|
@ -499,7 +499,7 @@ gsi::Class<ImageRef> decl_Image (decl_BasicImage, "lay", "Image",
|
|||
"line by line. Each line must consist of \"w\" values where the first value is the leftmost pixel.\n"
|
||||
"Note, that the rows are oriented in the mathematical sense (first one is the lowest) contrary to \n"
|
||||
"the common convention for image data.\n"
|
||||
"Initially the pixel width and heigt will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"Initially the pixel width and height will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"To adjust the data range use the \\min_value and \\max_value properties.\n"
|
||||
"\n"
|
||||
"@param w The width of the image\n"
|
||||
|
|
@ -518,7 +518,7 @@ gsi::Class<ImageRef> decl_Image (decl_BasicImage, "lay", "Image",
|
|||
"and so on. Note, that the rows are oriented in the mathematical sense (first one is the lowest) contrary to \n"
|
||||
"the common convention for image data.\n"
|
||||
"The data fields can be accessed with the \"data\", \"set_data\", \"pixel\" or \"set_pixel\" methods.\n"
|
||||
"Initially the pixel width and heigt will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"Initially the pixel width and height will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"\n"
|
||||
"@param w The width of the image\n"
|
||||
"@param h The height of the image\n"
|
||||
|
|
@ -534,7 +534,7 @@ gsi::Class<ImageRef> decl_Image (decl_BasicImage, "lay", "Image",
|
|||
"and so on. Note, that the rows are oriented in the mathematical sense (first one is the lowest) contrary to \n"
|
||||
"the common convention for image data.\n"
|
||||
"The data fields can be accessed with the \"data\", \"set_data\", \"pixel\" or \"set_pixel\" methods.\n"
|
||||
"Initially the pixel width and heigt will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"Initially the pixel width and height will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"\n"
|
||||
"@param w The width of the image\n"
|
||||
"@param h The height of the image\n"
|
||||
|
|
@ -550,7 +550,7 @@ gsi::Class<ImageRef> decl_Image (decl_BasicImage, "lay", "Image",
|
|||
"line by line and separated by color channel. Each line must consist of \"w\" values where the first value is the leftmost pixel.\n"
|
||||
"Note, that the rows are oriented in the mathematical sense (first one is the lowest) contrary to \n"
|
||||
"the common convention for image data.\n"
|
||||
"Initially the pixel width and heigt will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"Initially the pixel width and height will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"To adjust the data range use the \\min_value and \\max_value properties.\n"
|
||||
"\n"
|
||||
"@param w The width of the image\n"
|
||||
|
|
@ -567,7 +567,7 @@ gsi::Class<ImageRef> decl_Image (decl_BasicImage, "lay", "Image",
|
|||
"line by line and separated by color channel. Each line must consist of \"w\" values where the first value is the leftmost pixel.\n"
|
||||
"Note, that the rows are oriented in the mathematical sense (first one is the lowest) contrary to \n"
|
||||
"the common convention for image data.\n"
|
||||
"Initially the pixel width and heigt will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"Initially the pixel width and height will be 1 micron and the data range will be 0 to 1.0 (black to white level). \n"
|
||||
"To adjust the data range use the \\min_value and \\max_value properties.\n"
|
||||
"\n"
|
||||
"@param w The width of the image\n"
|
||||
|
|
@ -931,7 +931,7 @@ gsi::Class<ImageRef> decl_Image (decl_BasicImage, "lay", "Image",
|
|||
"view automatically once the image object has been inserted into a view. "
|
||||
"Note that changes are not immediately reflected in the view, but are delayed until the view is refreshed. "
|
||||
"Hence, iterating the view's images will not render the same results than the image objects attached to the view. "
|
||||
"To ensure synchonization, call \\Image#update."
|
||||
"To ensure synchronization, call \\Image#update."
|
||||
);
|
||||
|
||||
/**
|
||||
|
|
|
|||
|
|
@ -189,7 +189,7 @@ DataMapping::create_data_mapping (bool monochrome, double xmin, double xmax, uns
|
|||
int h2, s2, v2;
|
||||
false_color_nodes [i].second.getHsv (&h2, &s2, &v2);
|
||||
|
||||
// The number of steps is choosen such that the full HSV band divides into approximately 200 steps
|
||||
// The number of steps is chosen such that the full HSV band divides into approximately 200 steps
|
||||
double nsteps = 0.5 * sqrt (double (h1 - h2) * double (h1 - h2) + double (s1 - s2) * double (s1 - s2) + double (v1 - v2) * double (v1 - v2));
|
||||
int n = int (floor (nsteps + 1.0));
|
||||
double dx = (false_color_nodes [i].first - false_color_nodes [i - 1].first) / n;
|
||||
|
|
|
|||
|
|
@ -618,7 +618,7 @@ Service::begin_move (lay::Editable::MoveMode mode, const db::DPoint &p, lay::ang
|
|||
|
||||
} else if (mode == lay::Editable::Partial) {
|
||||
|
||||
// test, wether we are moving a handle of one selected object
|
||||
// test, whether we are moving a handle of one selected object
|
||||
for (std::map<obj_iterator, unsigned int>::const_iterator s = m_selected.begin (); s != m_selected.end (); ++s) {
|
||||
|
||||
MoveMode mm = move_none;
|
||||
|
|
|
|||
|
|
@ -34,7 +34,7 @@
|
|||
<item row="0" column="0" colspan="2" >
|
||||
<widget class="QLabel" name="label_2" >
|
||||
<property name="text" >
|
||||
<string>Specifiy the number of digits to be used for displaying ...</string>
|
||||
<string>Specify the number of digits to be used for displaying ...</string>
|
||||
</property>
|
||||
<property name="wordWrap" >
|
||||
<bool>true</bool>
|
||||
|
|
|
|||
|
|
@ -995,7 +995,7 @@ Press 'Select+Replace' button to show items found, select some and replace them<
|
|||
<item>
|
||||
<widget class="QLabel" name="label_9" >
|
||||
<property name="text" >
|
||||
<string>Press 'Execute' button to excute the query</string>
|
||||
<string>Press 'Execute' button to execute the query</string>
|
||||
</property>
|
||||
<property name="alignment" >
|
||||
<set>Qt::AlignCenter</set>
|
||||
|
|
|
|||
|
|
@ -26,7 +26,7 @@
|
|||
<p>
|
||||
When a layout containing library references is saved, KLayout stores
|
||||
some meta information in that file which allows it to restore the
|
||||
library links and related informations.
|
||||
library links and related information.
|
||||
For GDS, that meta information is stored in a separate top cell. For OASIS,
|
||||
the meta information is stored in special per-cell properties.
|
||||
For other formats, the meta information is not stored currently.
|
||||
|
|
|
|||
|
|
@ -60,7 +60,7 @@
|
|||
<p>
|
||||
PCell's are usually packed in libraries. PCell libraries can be provided as
|
||||
shared objects/DLL's (in C++) or as Ruby scripts. Because PCell code is only executed if
|
||||
required, performance usally is not the main objective. A Ruby implementation
|
||||
required, performance usually is not the main objective. A Ruby implementation
|
||||
will therefore be sufficient in most cases and
|
||||
is a much easier to maintain. The Ruby approach also benefits from KLayout's integrated development
|
||||
environment.
|
||||
|
|
|
|||
|
|
@ -106,7 +106,7 @@
|
|||
</p>
|
||||
|
||||
<p>When a shape is converted to a donut, the shape's bounding box will be used to define the
|
||||
enclosing box of the donut and the hole's diameter will be choosen to be half of the outer
|
||||
enclosing box of the donut and the hole's diameter will be chosen to be half of the outer
|
||||
diameter.
|
||||
</p>
|
||||
|
||||
|
|
@ -136,7 +136,7 @@
|
|||
The PCell features a parameter that defines the radius. The path itself
|
||||
can be manipulated as usual, in particular with partial edit mode.
|
||||
Path objects can be converted to ROUND_PATH pcells. In that case, the initial radius
|
||||
will be choosen to be roughly 10 percent of the minimum bounding box dimensions
|
||||
will be chosen to be roughly 10 percent of the minimum bounding box dimensions
|
||||
of the original path.
|
||||
</p>
|
||||
|
||||
|
|
@ -154,7 +154,7 @@
|
|||
The PCell features a parameter that defines the radius. The polygon itself
|
||||
can be manipulated as usual, in particular with partial edit mode.
|
||||
Polygon, box or path objects can be converted to ROUND_POLYGON pcells. In that case, the initial radius
|
||||
will be choosen to be roughly 10 percent of the minimum bounding box dimensions
|
||||
will be chosen to be roughly 10 percent of the minimum bounding box dimensions
|
||||
of the original polygon.
|
||||
</p>
|
||||
|
||||
|
|
@ -173,7 +173,7 @@
|
|||
The PCell features two parameters that define the radius and width of the "rim" line.
|
||||
The polygon or box itself can be manipulated as usual.
|
||||
Polygon, box or path objects can be converted to STROKED_POLYGON or STROKED_BOX pcells.
|
||||
In that case, the initial radius will be zero. The width of the rim line will be choosen
|
||||
In that case, the initial radius will be zero. The width of the rim line will be chosen
|
||||
to be roughly 10 percent of the minimum bounding box dimensions of the original polygon.
|
||||
For STROKED_BOX, the bounding box of the original shape will be used as the basic shape.
|
||||
</p>
|
||||
|
|
|
|||
|
|
@ -50,7 +50,7 @@
|
|||
<p>
|
||||
By creating conductor layers with boolean expressions, it is possible for example to separate an active area
|
||||
layer of a CMOS transistor into source and drain regions by subtracting the gate poly. Symbolic layers are useful
|
||||
to use "speaking" names for layers instead of the numeric layer/datatype specificiation.
|
||||
to use "speaking" names for layers instead of the numeric layer/datatype specification.
|
||||
Please note, that the net tracer is considerably slower when using boolean expressions.
|
||||
</p>
|
||||
|
||||
|
|
|
|||
|
|
@ -76,7 +76,7 @@ result will be the edges of the first operand which are inside or on the
|
|||
borders of the polygons of the second operand.
|
||||
</p><p>
|
||||
The following images show the effect of the "and" method
|
||||
on polygons and egdes (layer1: red, layer2: blue):
|
||||
on polygons and edges (layer1: red, layer2: blue):
|
||||
</p><p>
|
||||
<table>
|
||||
<tr>
|
||||
|
|
@ -847,7 +847,7 @@ It is an alias for the "+" operator.
|
|||
This method is available for polygon, edge and edge pair layers.
|
||||
</p><p>
|
||||
The following images show the effect of the "join" method
|
||||
on polygons and egdes (layer1: red, layer2: blue):
|
||||
on polygons and edges (layer1: red, layer2: blue):
|
||||
</p><p>
|
||||
<table>
|
||||
<tr>
|
||||
|
|
@ -1017,7 +1017,7 @@ result will be the edges of the first operand which are outside the polygons
|
|||
of the second operand.
|
||||
</p><p>
|
||||
The following images show the effect of the "not" method
|
||||
on polygons and egdes (layer1: red, layer2: blue):
|
||||
on polygons and edges (layer1: red, layer2: blue):
|
||||
</p><p>
|
||||
<table>
|
||||
<tr>
|
||||
|
|
@ -1203,7 +1203,7 @@ It is an alias for the "|" operator.
|
|||
This method is available for polygon and edge layers.
|
||||
</p><p>
|
||||
The following images show the effect of the "or" method
|
||||
on polygons and egdes (layer1: red, layer2: blue):
|
||||
on polygons and edges (layer1: red, layer2: blue):
|
||||
</p><p>
|
||||
<table>
|
||||
<tr>
|
||||
|
|
@ -2321,7 +2321,7 @@ It is an alias for the "^" operator.
|
|||
This method is available for polygon and edge layers.
|
||||
</p><p>
|
||||
The following images show the effect of the "xor" method
|
||||
on polygons and egdes (layer1: red, layer2: blue):
|
||||
on polygons and edges (layer1: red, layer2: blue):
|
||||
</p><p>
|
||||
<table>
|
||||
<tr>
|
||||
|
|
|
|||
|
|
@ -136,7 +136,7 @@
|
|||
|
||||
<ul>
|
||||
<li><b>Produce net names:</b> Check this option to assign user properties with the
|
||||
net name to the net shapes in DEF files. The user propery name used for that
|
||||
net name to the net shapes in DEF files. The user property name used for that
|
||||
purpose can be specified in the edit box below the check box. Use KLayout's
|
||||
variant notation (see <link href="about/variant_notation.xml"/>) to specify
|
||||
value and type of the property name.
|
||||
|
|
|
|||
|
|
@ -15,7 +15,7 @@
|
|||
</p>
|
||||
|
||||
<p>
|
||||
Two copy modes are provided: deep and shallow copy. When "copy" or "cut" is choosen and
|
||||
Two copy modes are provided: deep and shallow copy. When "copy" or "cut" is chosen and
|
||||
the cell instantiates other cells, a dialog will been shown in which the mode can be selected:
|
||||
</p>
|
||||
|
||||
|
|
|
|||
|
|
@ -42,7 +42,7 @@
|
|||
<p>
|
||||
This is the initial situation: a cell is instantiated 9 times in a 3x3 array and one shape
|
||||
inside one of these instances is selected. The two following screenshots show the full-level
|
||||
hierarchy view and just the top level hiearchy to demonstrate that the cell is placed
|
||||
hierarchy view and just the top level hierarchy to demonstrate that the cell is placed
|
||||
9 times.
|
||||
</p>
|
||||
|
||||
|
|
|
|||
|
|
@ -18,7 +18,7 @@
|
|||
items. Usually, a value is a collection of geometrical objects which somehow flag
|
||||
some position or drawn geometry. Multiple of such values comprise a "marker item".
|
||||
The report database associates these marker items with
|
||||
additional informations:</p>
|
||||
additional information:</p>
|
||||
|
||||
<ul>
|
||||
<li><b>Tags:</b> Flags that indicate certain conditions. The marker browser uses
|
||||
|
|
@ -102,7 +102,7 @@
|
|||
properties. Tagged values are generated by certain generators and can represent
|
||||
measurement values or similar. When tagged values are present, they will be shown
|
||||
in the markers list. The markers can be sorted by these values by clicking on the
|
||||
approriate header.
|
||||
appropriate header.
|
||||
</p>
|
||||
|
||||
</doc>
|
||||
|
|
|
|||
|
|
@ -119,7 +119,7 @@
|
|||
<li><class_doc href="MainWindow#reader_options"/>: gets the current layout reader options and allows modification of the latter.
|
||||
The reader options configure the reading of layouts.</li>
|
||||
<li><class_doc href="MainWindow#save_session"/> and <class_doc href="MainWindow#restore_session"/>: save or restore a session.
|
||||
Sessions contain a window settings and informations about the layouts loaded.
|
||||
Sessions contain a window settings and information about the layouts loaded.
|
||||
Sessions allows storing and restoring of the state of the main window.</li>
|
||||
<li><class_doc href="MainWindow#select_view"/>: switches to the given tab. This equivalent to using <class_doc href="MainWindow#current_view_index="/>.</li>
|
||||
<li><class_doc href="MainWindow#view"/>: gets the <class_doc href="LayoutView"/> object for a given tab index.</li>
|
||||
|
|
|
|||
|
|
@ -1046,11 +1046,11 @@ end</pre>
|
|||
|
||||
<p>
|
||||
With version 0.23, new collection objects entered the stage: <class_doc href="Region"/>, <class_doc href="Edges"/> and
|
||||
<class_doc href="EdgePairs"/> which basically provide a way to store polygons, edges or egde pair objects
|
||||
<class_doc href="EdgePairs"/> which basically provide a way to store polygons, edges or edge pair objects
|
||||
independently from the shapes container. They are mainly used to implement bulk operations, specifically for
|
||||
the DRC functionality. The cooperate with the shapes container in the sense that they can be inserted into
|
||||
a shapes container which will produce polygons or edges in the layout database (edge pairs are converted to single
|
||||
egdes or polygons. These classes are discussed in <link href="/programming/geometry_api.xml"/>.
|
||||
edges or polygons. These classes are discussed in <link href="/programming/geometry_api.xml"/>.
|
||||
</p>
|
||||
|
||||
<h2>The Shape class</h2>
|
||||
|
|
|
|||
|
|
@ -159,7 +159,7 @@ end</pre>
|
|||
<p>
|
||||
The layout view is the representation of a layout tab (<class_doc href="LayoutView"/>). That is basically the window to
|
||||
the layouts loaded into that tab.
|
||||
All related information such as the display settings, the zoom area, the layer properties and the informations about the
|
||||
All related information such as the display settings, the zoom area, the layer properties and the information about the
|
||||
cell shown, the hierarchy levels and further settings go here.
|
||||
</p>
|
||||
|
||||
|
|
|
|||
|
|
@ -215,7 +215,7 @@ end</pre>
|
|||
Starting with version 0.24, the <tt>QFlags</tt> template is supported as a separate class.
|
||||
The name of the class indicates the relationship to the enum class.
|
||||
For example, <tt>QFlags<QMessageBox::Icon></tt> is available as <tt>QMessageBox_QFlags_Icon</tt>.
|
||||
Enum classes are derived from their respective flags class, so they can serve to initialize aguments
|
||||
Enum classes are derived from their respective flags class, so they can serve to initialize arguments
|
||||
expecting flags.
|
||||
It's hardly required to operate with the flags classes directly, since they are created automatically
|
||||
when joining enum's with the "or" (<tt>|</tt>) operator:
|
||||
|
|
|
|||
|
|
@ -226,7 +226,7 @@ end</pre>
|
|||
having to write "RBA::" in front of the class names.
|
||||
</p>
|
||||
|
||||
<p>The initialization of the object is alreay a very important step. First, it
|
||||
<p>The initialization of the object is already a very important step. First, it
|
||||
must initialize the super class. Then it has to declare the PCell parameters.
|
||||
Each PCell has a set of parameters that define the appearance of the PCell.
|
||||
Parameters have a symbolic name, a type, a description and optionally a default
|
||||
|
|
|
|||
|
|
@ -170,7 +170,7 @@ static gsi::Methods application_methods ()
|
|||
"@return A value indicating whether the operation was successful\n"
|
||||
"\n"
|
||||
"This method siletly does nothing, if the config file does not\n"
|
||||
"exist. If it does and an error occured, the error message is printed\n"
|
||||
"exist. If it does and an error occurred, the error message is printed\n"
|
||||
"on stderr. In both cases, false is returned.\n"
|
||||
) +
|
||||
method<C, lay::MainWindow *> ("main_window", &C::main_window,
|
||||
|
|
|
|||
|
|
@ -170,7 +170,7 @@ static void ui_exception_handler_def (QWidget *parent)
|
|||
if (! parent) {
|
||||
parent = QApplication::activeWindow () ? QApplication::activeWindow () : lay::MainWindow::instance ();
|
||||
}
|
||||
QMessageBox::critical (parent, QObject::tr ("Error"), QObject::tr ("An unspecific error occured"));
|
||||
QMessageBox::critical (parent, QObject::tr ("Error"), QObject::tr ("An unspecific error occurred"));
|
||||
}
|
||||
|
||||
// --------------------------------------------------------------------------------
|
||||
|
|
|
|||
|
|
@ -183,7 +183,7 @@ public:
|
|||
* @brief Read the configuration from a file
|
||||
*
|
||||
* This method siletly does nothing, if the config file does not
|
||||
* exist. If it does and an error occured, the error message is printed
|
||||
* exist. If it does and an error occurred, the error message is printed
|
||||
* on stderr. In both cases, false is returned.
|
||||
*/
|
||||
bool read_config (const std::string &config_file);
|
||||
|
|
|
|||
|
|
@ -99,7 +99,7 @@ public:
|
|||
/**
|
||||
* @brief Registers an URL (with version) for download in the given target directory
|
||||
*
|
||||
* The target directory can be empty. In this case, the downloader will pick an approriate one.
|
||||
* The target directory can be empty. In this case, the downloader will pick an appropriate one.
|
||||
*/
|
||||
void register_download (const std::string &name, const std::string &token, const std::string &url, const std::string &version);
|
||||
|
||||
|
|
|
|||
|
|
@ -29,7 +29,7 @@
|
|||
namespace lay {
|
||||
|
||||
/**
|
||||
* @brief This class provides the program's version informations
|
||||
* @brief This class provides the program's version information
|
||||
*/
|
||||
|
||||
class LAY_PUBLIC Version
|
||||
|
|
|
|||
|
|
@ -17,7 +17,7 @@
|
|||
# load the UI file
|
||||
# TODO: this is how to load a file from a path next to the .lym file
|
||||
# ui_file = QFile::new(QFileInfo::new($0).dir.filePath("MyDialog.ui"))
|
||||
# Initially we use the sample file provided as resoure
|
||||
# Initially we use the sample file provided as resource
|
||||
ui_file = QFile::new(":/macro-templates/qt_designer.ui")
|
||||
ui_file.open(QIODevice::ReadOnly)
|
||||
dialog = QFormBuilder::new.load(ui_file, Application::instance.main_window)
|
||||
|
|
|
|||
|
|
@ -313,7 +313,7 @@
|
|||
<!-- In the following contexts, a slash character ('/') is a division operator -->
|
||||
<!-- Everywhere else, it's a regular expression delimiter -->
|
||||
|
||||
<!-- A slash is always a division operator, even if preceeded by whitespace -->
|
||||
<!-- A slash is always a division operator, even if preceded by whitespace -->
|
||||
<context name="check_div_1" attribute="Normal Text" fallthrough="true" fallthroughContext="#pop" lineEndContext="#pop">
|
||||
<RegExpr attribute="Normal Text" String="\s*" context="#stay"/>
|
||||
<AnyChar attribute="Operator" String="/%" context="#pop"/>
|
||||
|
|
@ -325,7 +325,7 @@
|
|||
<AnyChar attribute="Operator" String="/%" context="#pop#pop"/>
|
||||
</context>
|
||||
|
||||
<!-- A slash is division operator if it's the first character, or if preceeded and followed by whitespace -->
|
||||
<!-- A slash is division operator if it's the first character, or if preceded and followed by whitespace -->
|
||||
<context name="check_div_2" attribute="Normal Text" fallthrough="true" fallthroughContext="#pop" lineEndContext="#pop">
|
||||
<AnyChar attribute="Operator" String="/%" context="#pop"/>
|
||||
<RegExpr attribute="Normal Text" String="\s+" context="check_div_2_internal"/>
|
||||
|
|
|
|||
|
|
@ -360,7 +360,7 @@ Class<BrowserDialog_Stub> decl_BrowserDialog (QT_EXTERNAL_BASE (QDialog) "lay",
|
|||
"@brief Reloads the current page"
|
||||
) +
|
||||
gsi::method ("home=|#set_home", &BrowserDialog_Stub::set_home,
|
||||
"@brief Sets the browser's initial and current URL which is selected if the \"home\" location is choosen\n"
|
||||
"@brief Sets the browser's initial and current URL which is selected if the \"home\" location is chosen\n"
|
||||
"@args home_url\n"
|
||||
"The home URL is the one shown initially and the one which is selected when the \"home\" button is pressed. "
|
||||
"The default location is \"int:/index.html\".\n"
|
||||
|
|
@ -513,7 +513,7 @@ Class<lay::BrowserPanel> decl_BrowserPanel (QT_EXTERNAL_BASE (QWidget) "lay", "B
|
|||
"@brief Reloads the current page"
|
||||
) +
|
||||
gsi::method ("home=", &lay::BrowserPanel::set_home,
|
||||
"@brief Sets the browser widget's initial and current URL which is selected if the \"home\" location is choosen\n"
|
||||
"@brief Sets the browser widget's initial and current URL which is selected if the \"home\" location is chosen\n"
|
||||
"@args home_url\n"
|
||||
"The home URL is the one shown initially and the one which is selected when the \"home\" button is pressed. "
|
||||
"The default location is \"int:/index.html\".\n"
|
||||
|
|
@ -726,7 +726,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 items The list of items to show in the selection element\n"
|
||||
"@param selection The initial selection (index of the element selected intially)\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"
|
||||
"Starting from 0.22, this method is deprecated and it is recommended to use the ask_... equivalent."
|
||||
) +
|
||||
|
|
|
|||
|
|
@ -978,7 +978,7 @@ Class<lay::LayerProperties> decl_LayerProperties ("lay", "LayerProperties",
|
|||
"This is the hierarchy level at which the drawing starts. "
|
||||
"This property is only meaningful, if \\has_upper_hier_level is true. "
|
||||
"The hierarchy level can be relative in which case, 0 refers to the context cell's level. "
|
||||
"A mode can be specfied for the hierarchy level which is 0 for absolute, 1 for minimum "
|
||||
"A mode can be specified for the hierarchy level which is 0 for absolute, 1 for minimum "
|
||||
"of specified level and set level and 2 for maximum of specified level and set level. "
|
||||
) +
|
||||
method_ext ("upper_hier_level", &get_upper_hier_level_1,
|
||||
|
|
@ -1069,7 +1069,7 @@ Class<lay::LayerProperties> decl_LayerProperties ("lay", "LayerProperties",
|
|||
"This is the hierarchy level at which the drawing starts. "
|
||||
"This property is only meaningful, if \\has_lower_hier_level is true. "
|
||||
"The hierarchy level can be relative in which case, 0 refers to the context cell's level. "
|
||||
"A mode can be specfied for the hierarchy level which is 0 for absolute, 1 for minimum "
|
||||
"A mode can be specified for the hierarchy level which is 0 for absolute, 1 for minimum "
|
||||
"of specified level and set level and 2 for maximum of specified level and set level. "
|
||||
) +
|
||||
method_ext ("lower_hier_level", &get_lower_hier_level_1,
|
||||
|
|
|
|||
|
|
@ -676,7 +676,7 @@ Class<lay::LayoutView> decl_LayoutView (QT_EXTERNAL_BASE (QWidget) "lay", "Layou
|
|||
"current path is returned for the cellview given by cv_index.\n"
|
||||
"The cell path is a list of cell indices from the top cell to the current cell.\n"
|
||||
"\n"
|
||||
"@param cv_index The cellview index for which to get the current path from (usally this will be the active cellview index)"
|
||||
"@param cv_index The cellview index for which to get the current path from (usually this will be the active cellview index)"
|
||||
"\n"
|
||||
"This method is was deprecated in version 0.25 since from then, the \\CellView object can be used to obtain an manipulate the selected cell."
|
||||
) +
|
||||
|
|
@ -684,10 +684,10 @@ Class<lay::LayoutView> decl_LayoutView (QT_EXTERNAL_BASE (QWidget) "lay", "Layou
|
|||
"@brief Sets the path to the current cell\n"
|
||||
"\n"
|
||||
"The current cell is the one highlighted in the browser with the focus rectangle. The\n"
|
||||
"cell given by the path is hightlighted and scrolled into view.\n"
|
||||
"cell given by the path is highlighted and scrolled into view.\n"
|
||||
"To select the cell to be drawn, use the \\select_cell or \\select_cell_path method.\n"
|
||||
"\n"
|
||||
"@param cv_index The cellview index for which to set the current path for (usally this will be the active cellview index)\n"
|
||||
"@param cv_index The cellview index for which to set the current path for (usually this will be the active cellview index)\n"
|
||||
"@param path The path to the current cell\n"
|
||||
"\n"
|
||||
"This method is was deprecated in version 0.25 since from then, the \\CellView object can be used to obtain an manipulate the selected cell."
|
||||
|
|
@ -1020,7 +1020,7 @@ Class<lay::LayoutView> decl_LayoutView (QT_EXTERNAL_BASE (QWidget) "lay", "Layou
|
|||
"\n"
|
||||
"This method inserts the new properties node before the position given by \"iter\" and returns "
|
||||
"a const reference to the element created. The iterator that specified the position will remain valid "
|
||||
"after the node was inserted and will point to the newly created node. It can be used to add futher nodes. "
|
||||
"after the node was inserted and will point to the newly created node. It can be used to add further nodes. "
|
||||
"To add children to the node inserted, use iter.last_child as insertion point for the next insert operations.\n"
|
||||
"\n"
|
||||
"Since version 0.22, this method accepts LayerProperties and LayerPropertiesNode objects. A LayerPropertiesNode "
|
||||
|
|
@ -1034,7 +1034,7 @@ Class<lay::LayoutView> decl_LayoutView (QT_EXTERNAL_BASE (QWidget) "lay", "Layou
|
|||
"This version addresses a specific list in a multi-tab layer properties arrangement with the \"index\" parameter. "
|
||||
"This method inserts the new properties node before the position given by \"iter\" and returns "
|
||||
"a const reference to the element created. The iterator that specified the position will remain valid "
|
||||
"after the node was inserted and will point to the newly created node. It can be used to add futher nodes. "
|
||||
"after the node was inserted and will point to the newly created node. It can be used to add further nodes. "
|
||||
"\n"
|
||||
"This method has been introduced in version 0.21.\n"
|
||||
"Since version 0.22, this method accepts LayerProperties and LayerPropertiesNode objects. A LayerPropertiesNode "
|
||||
|
|
@ -1104,7 +1104,7 @@ Class<lay::LayoutView> decl_LayoutView (QT_EXTERNAL_BASE (QWidget) "lay", "Layou
|
|||
"This iterator delivers the layers of this view, either in a recursive or non-recursive\n"
|
||||
"fashion, depending which iterator increment methods are used.\n"
|
||||
"The iterator delivered by \\end_layers is the past-the-end iterator. It can be compared\n"
|
||||
"agains a current iterator to check, if there are no further elements.\n"
|
||||
"against a current iterator to check, if there are no further elements.\n"
|
||||
"\n"
|
||||
"Starting from version 0.25, an alternative solution is provided with 'each_layer' which is based on the "
|
||||
"\\LayerPropertiesNodeRef class."
|
||||
|
|
@ -1119,7 +1119,7 @@ Class<lay::LayoutView> decl_LayoutView (QT_EXTERNAL_BASE (QWidget) "lay", "Layou
|
|||
"This iterator delivers the layers of this view, either in a recursive or non-recursive\n"
|
||||
"fashion, depending which iterator increment methods are used.\n"
|
||||
"The iterator delivered by \\end_layers is the past-the-end iterator. It can be compared\n"
|
||||
"agains a current iterator to check, if there are no further elements.\n"
|
||||
"against a current iterator to check, if there are no further elements.\n"
|
||||
"This version addresses a specific list in a multi-tab layer properties arrangement with the \"index\" parameter. "
|
||||
"This method has been introduced in version 0.21.\n"
|
||||
) +
|
||||
|
|
@ -1497,7 +1497,7 @@ Class<lay::LayoutView> decl_LayoutView (QT_EXTERNAL_BASE (QWidget) "lay", "Layou
|
|||
"A transaction brackets a sequence of database modifications that appear as a single "
|
||||
"undo action. Only modifications that are wrapped inside a transaction..commit call pair "
|
||||
"can be undone.\n"
|
||||
"Each transaction must be terminated with a \\commit method call, even if some error occured. "
|
||||
"Each transaction must be terminated with a \\commit method call, even if some error occurred. "
|
||||
"It is advisable therefore to catch errors and issue a commit call in this case.\n"
|
||||
"\n"
|
||||
"This method was introduced in version 0.16."
|
||||
|
|
|
|||
|
|
@ -123,7 +123,7 @@ Class<lay::AbstractMenu> decl_AbstractMenu ("lay", "AbstractMenu",
|
|||
"\n"
|
||||
"@<table>\n"
|
||||
" @<tr>@<td>\"\" @</td>@<td>is the root@</td>@</tr> \n"
|
||||
" @<tr>@<td>\"[<path>.]<name>\" @</td>@<td>is an element of the submenu given by <path>. If <path> is ommitted, this refers to an element in the root@</td>@</tr> \n"
|
||||
" @<tr>@<td>\"[<path>.]<name>\" @</td>@<td>is an element of the submenu given by <path>. If <path> is omitted, this refers to an element in the root@</td>@</tr> \n"
|
||||
" @<tr>@<td>\"[<path>.]end\" @</td>@<td>refers to the item past the last item of the submenu given by <path> or root@</td>@</tr>\n"
|
||||
" @<tr>@<td>\"[<path>.]begin\" @</td>@<td>refers to the first item of the submenu given by <path> or root@</td>@</tr>\n"
|
||||
" @<tr>@<td>\"[<path>.]#<n>\" @</td>@<td>refers to the nth item of the submenu given by <path> or root (n is an integer number)@</td>@</tr>\n"
|
||||
|
|
|
|||
|
|
@ -905,7 +905,7 @@ Class<lay::PluginRoot> decl_PluginRoot ("lay", "PluginRoot",
|
|||
"@return A value indicating whether the operation was successful\n"
|
||||
"\n"
|
||||
"This method siletly does nothing, if the config file does not\n"
|
||||
"exist. If it does and an error occured, the error message is printed\n"
|
||||
"exist. If it does and an error occurred, the error message is printed\n"
|
||||
"on stderr. In both cases, false is returned.\n"
|
||||
) +
|
||||
method_ext ("get_config", &get_config,
|
||||
|
|
|
|||
|
|
@ -624,7 +624,7 @@ private:
|
|||
* Menu items and submenus are referred to by a "path". The path is a string with this interpretation:
|
||||
*
|
||||
* "" is the root
|
||||
* "[<path>.]<name>" is an element of the submenu given by <path>. If <path> is ommitted, this refers to
|
||||
* "[<path>.]<name>" is an element of the submenu given by <path>. If <path> is omitted, this refers to
|
||||
* an element in the root
|
||||
* "[<path>.]end refers to the item past the last item of the submenu given by <path> or root
|
||||
* "[<path>.]begin refers to the first item of the submenu given by <path> or root
|
||||
|
|
|
|||
|
|
@ -37,7 +37,7 @@ namespace lay
|
|||
* The renderer is supposed to render a set of edges to
|
||||
* one or more bitmaps. One bitmap holds the contour
|
||||
* information, one the fill. A third one holds the
|
||||
* vertex informations (dots).
|
||||
* vertex information (dots).
|
||||
*
|
||||
* The intended use model is first to reserve a number of
|
||||
* points if necessary, the fill the renderer with the
|
||||
|
|
|
|||
|
|
@ -534,7 +534,7 @@ bitmaps_to_image_rgb (const std::vector<lay::ViewOp> &view_ops_in,
|
|||
|
||||
}
|
||||
|
||||
// Collect all necessary informations to transfer a single scanline ..
|
||||
// Collect all necessary information to transfer a single scanline ..
|
||||
|
||||
masks.erase (masks.begin (), masks.end ());
|
||||
|
||||
|
|
|
|||
|
|
@ -140,7 +140,7 @@ public:
|
|||
* The pattern returned is guaranteed to be at least of
|
||||
* size (32*pattern_stride)x64 bits. If the actual width or height is smaller,
|
||||
* the pattern is repeated to fill this area.
|
||||
* The pattern stride may be bigger than 1 to accomodate pattern with
|
||||
* The pattern stride may be bigger than 1 to accommodate pattern with
|
||||
* a width that is not a fraction of 32. Such pattern are repeated until
|
||||
* they fill a multiple of 32 bits.
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -136,7 +136,7 @@ public:
|
|||
* proximity is a typical distance value of the point to the closest
|
||||
* object in micron. The plugin with the least point selection proximity
|
||||
* is selected first for the actual "select" operation.
|
||||
* If a plugin definitly wants to get the selection, it should return
|
||||
* If a plugin definitely wants to get the selection, it should return
|
||||
* a negative value. If the plugin is only weakly interested in a selection,
|
||||
* it should return the value provided by the default implementation.
|
||||
* The click_proximity method can be used to implement cycling through
|
||||
|
|
@ -186,7 +186,7 @@ public:
|
|||
* This method is used by the single-point selection cycling protocol to clear the
|
||||
* plugin's single-point selection state. The cycling protocol is used when a certain
|
||||
* point is clicked at multiple times. A plugin is supposed to remember such selections and
|
||||
* exlcude them from futher checks. If all objects in question are selected, no further
|
||||
* exlcude them from further checks. If all objects in question are selected, no further
|
||||
* object would be selected. clear_previous_selection is called in that case to indicate that
|
||||
* the previous selection should be cleared and a new cycle is about to begin
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -1438,7 +1438,7 @@ LayerPropertiesList::expand (const std::map<int, int> &map_cv_index, bool add_de
|
|||
|
||||
}
|
||||
|
||||
// erase the items specfied to removal (cv mapping to -1)
|
||||
// erase the items specified to removal (cv mapping to -1)
|
||||
for (std::set<int>::const_iterator cv = cvrefs_to_erase.begin (); cv != cvrefs_to_erase.end (); ++cv) {
|
||||
remove_cv_references (*cv, false);
|
||||
}
|
||||
|
|
|
|||
|
|
@ -2613,7 +2613,7 @@ LayoutView::add_new_layers (const std::vector <unsigned int> &layer_ids, int cv_
|
|||
lay::LayerPropertiesList new_props (get_properties ());
|
||||
|
||||
// don't create new layers for those, for which there are layers already: compute a
|
||||
// set of layers alreay present
|
||||
// set of layers already present
|
||||
std::set <db::LayerProperties, db::LPLogicalLessFunc> present_layers;
|
||||
for (LayerPropertiesConstIterator lay_iter = begin_layers (); ! lay_iter.at_end (); ++lay_iter) {
|
||||
if (! lay_iter->has_children () && lay_iter->cellview_index () == cv_index) {
|
||||
|
|
@ -4279,7 +4279,7 @@ LayoutView::max_hier_changed (int i)
|
|||
}
|
||||
|
||||
/**
|
||||
* @brief set the maximum hierachy level to the number of levels available
|
||||
* @brief set the maximum hierarchy level to the number of levels available
|
||||
*/
|
||||
void
|
||||
LayoutView::max_hier ()
|
||||
|
|
|
|||
|
|
@ -1451,7 +1451,7 @@ public:
|
|||
* @brief Set the path to the current cell
|
||||
*
|
||||
* The current cell is the one highlighted in the browser with the focus rectangle. The
|
||||
* cell given by the path is hightlighted and scrolled into view.
|
||||
* cell given by the path is highlighted and scrolled into view.
|
||||
*/
|
||||
void set_current_cell_path (int cv_index, const cell_path_type &path);
|
||||
|
||||
|
|
|
|||
|
|
@ -132,7 +132,7 @@ public:
|
|||
* The pattern returned is guaranteed to be at least of
|
||||
* size (32*pattern_stride)x64 bits. If the actual width or height is smaller,
|
||||
* the pattern is repeated to fill this area.
|
||||
* The pattern stride may be bigger than 1 to accomodate pattern with
|
||||
* The pattern stride may be bigger than 1 to accommodate pattern with
|
||||
* a width that is not a fraction of 32. Such pattern are repeated until
|
||||
* they fill a multiple of 32 bits.
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -818,7 +818,7 @@ public:
|
|||
* If the configuration file cannot be written, false
|
||||
* is returned but no exception is thrown.
|
||||
*
|
||||
* @return false, if an error occured.
|
||||
* @return false, if an error occurred.
|
||||
*/
|
||||
bool write_config (const std::string &config_file);
|
||||
|
||||
|
|
@ -826,10 +826,10 @@ public:
|
|||
* @brief Read the configuration from a file
|
||||
*
|
||||
* This method siletly does nothing, if the config file does not
|
||||
* exist. If it does and an error occured, the error message is printed
|
||||
* exist. If it does and an error occurred, the error message is printed
|
||||
* on stderr. In both cases, false is returned.
|
||||
*
|
||||
* @return false, if an error occured.
|
||||
* @return false, if an error occurred.
|
||||
*/
|
||||
bool read_config (const std::string &config_file);
|
||||
|
||||
|
|
|
|||
|
|
@ -51,7 +51,7 @@ class CanvasPlane;
|
|||
* The renderer is supposed to render a set of edges to
|
||||
* one or more bitmaps. One bitmap holds the contour
|
||||
* information, one the fill. A third one holds the
|
||||
* vertex informations (dots).
|
||||
* vertex information (dots).
|
||||
*
|
||||
* The intended use model is first to reserve a number of
|
||||
* points if necessary, the fill the renderer with the
|
||||
|
|
|
|||
|
|
@ -954,7 +954,7 @@ void Macro::install_doc () const
|
|||
} else if (ex.test ("@method") || (st = ex.test ("@static_method")) == true) {
|
||||
|
||||
if (cls == 0) {
|
||||
tl::error << tl::to_string (QObject::tr ("Reading class doc from ")) << path () << ": " << tl::to_string (QObject::tr ("@method without preceeding @class"));
|
||||
tl::error << tl::to_string (QObject::tr ("Reading class doc from ")) << path () << ": " << tl::to_string (QObject::tr ("@method without preceding @class"));
|
||||
} else {
|
||||
|
||||
std::string n;
|
||||
|
|
|
|||
|
|
@ -46,12 +46,12 @@ public:
|
|||
virtual ~CIFDiagnostics ();
|
||||
|
||||
/**
|
||||
* @brief Issue an error with positional informations
|
||||
* @brief Issue an error with positional information
|
||||
*/
|
||||
virtual void error (const std::string &txt) = 0;
|
||||
|
||||
/**
|
||||
* @brief Issue a warning with positional informations
|
||||
* @brief Issue a warning with positional information
|
||||
*/
|
||||
virtual void warn (const std::string &txt) = 0;
|
||||
};
|
||||
|
|
|
|||
|
|
@ -118,14 +118,14 @@ public:
|
|||
virtual const char *format () const { return "CIF"; }
|
||||
|
||||
/**
|
||||
* @brief Issue an error with positional informations
|
||||
* @brief Issue an error with positional information
|
||||
*
|
||||
* Reimplements CIFDiagnostics
|
||||
*/
|
||||
virtual void error (const std::string &txt);
|
||||
|
||||
/**
|
||||
* @brief Issue a warning with positional informations
|
||||
* @brief Issue a warning with positional information
|
||||
*
|
||||
* Reimplements CIFDiagnostics
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -46,12 +46,12 @@ public:
|
|||
virtual ~DXFDiagnostics ();
|
||||
|
||||
/**
|
||||
* @brief Issue an error with positional informations
|
||||
* @brief Issue an error with positional information
|
||||
*/
|
||||
virtual void error (const std::string &txt) = 0;
|
||||
|
||||
/**
|
||||
* @brief Issue a warning with positional informations
|
||||
* @brief Issue a warning with positional information
|
||||
*/
|
||||
virtual void warn (const std::string &txt) = 0;
|
||||
};
|
||||
|
|
|
|||
|
|
@ -122,14 +122,14 @@ public:
|
|||
virtual const char *format () const { return "DXF"; }
|
||||
|
||||
/**
|
||||
* @brief Issue an error with positional informations
|
||||
* @brief Issue an error with positional information
|
||||
*
|
||||
* Reimplements DXFDiagnostics
|
||||
*/
|
||||
virtual void error (const std::string &txt);
|
||||
|
||||
/**
|
||||
* @brief Issue a warning with positional informations
|
||||
* @brief Issue a warning with positional information
|
||||
*
|
||||
* Reimplements DXFDiagnostics
|
||||
*/
|
||||
|
|
|
|||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue