Go to the source code of this file.
|
| PyDoc_STRVAR (AdjacencyIterator_doc, "Class hierarchy: :class:`Iterator` > :class:`AdjacencyIterator`\n" "\n" "Class for representing adjacency iterators used in the chaining\n" "process. An AdjacencyIterator is created in the increment() and\n" "decrement() methods of a :class:`ChainingIterator` and passed to the\n" "traverse() method of the ChainingIterator.\n" "\n" ".. method:: __init__()\n" " __init__(brother)\n" " __init__(vertex, restrict_to_selection=True, restrict_to_unvisited=True)\n" "\n" " Builds an :class:`AdjacencyIterator` using the default constructor,\n" " copy constructor or the overloaded constructor.\n" "\n" " :arg brother: An AdjacencyIterator object.\n" " :type brother: :class:`AdjacencyIterator`\n" " :arg vertex: The vertex which is the next crossing.\n" " :type vertex: :class:`ViewVertex`\n" " :arg restrict_to_selection: Indicates whether to force the chaining\n" " to stay within the set of selected ViewEdges or not.\n" " :type restrict_to_selection: bool\n" " :arg restrict_to_unvisited: Indicates whether a ViewEdge that has\n" " already been chained must be ignored ot not.\n" " :type restrict_to_unvisited: bool") |
|
static int | AdjacencyIterator_init (BPy_AdjacencyIterator *self, PyObject *args, PyObject *kwds) |
|
static PyObject * | AdjacencyIterator_iter (BPy_AdjacencyIterator *self) |
|
static PyObject * | AdjacencyIterator_iternext (BPy_AdjacencyIterator *self) |
|
| PyDoc_STRVAR (AdjacencyIterator_object_doc, "The ViewEdge object currently pointed to by this iterator.\n" "\n" ":type: :class:`ViewEdge`") |
|
static PyObject * | AdjacencyIterator_object_get (BPy_AdjacencyIterator *self, void *UNUSED(closure)) |
|
| PyDoc_STRVAR (AdjacencyIterator_is_incoming_doc, "True if the current ViewEdge is coming towards the iteration vertex, and\n" "False otherwise.\n" "\n" ":type: bool") |
|
static PyObject * | AdjacencyIterator_is_incoming_get (BPy_AdjacencyIterator *self, void *UNUSED(closure)) |
|
◆ AdjacencyIterator_init()
◆ AdjacencyIterator_is_incoming_get()
◆ AdjacencyIterator_iter()
◆ AdjacencyIterator_iternext()
◆ AdjacencyIterator_object_get()
◆ PyDoc_STRVAR() [1/3]
PyDoc_STRVAR |
( |
AdjacencyIterator_doc |
, |
|
|
"Class hierarchy: :class:`Iterator` |
, |
|
|
:class:`AdjacencyIterator`\n" "\n" "Class for representing adjacency iterators used in the chaining\n" "process. An AdjacencyIterator is created in the increment() and\n" "decrement() methods of a :class:`ChainingIterator` and passed to the\n" "traverse() method of the ChainingIterator.\n" "\n" ".. method::__init__()\n" " __init__(brother)\n" " __init__(vertex, restrict_to_selection=True, restrict_to_unvisited=True)\n" "\n" " Builds an :class:`AdjacencyIterator` using the default |
constructor, |
|
|
\n" " copy constructor or the overloaded constructor.\n" "\n" " :arg brother:An AdjacencyIterator object.\n" " :type brother::class:`AdjacencyIterator`\n" " :arg vertex:The vertex which is the next crossing.\n" " :type vertex::class:`ViewVertex`\n" " :arg restrict_to_selection:Indicates whether to force the chaining\n" " to stay within the set of selected ViewEdges or not.\n" " :type restrict_to_selection:bool\n" " :arg restrict_to_unvisited:Indicates whether a ViewEdge that has\n" " already been chained must be ignored ot not.\n" " :type restrict_to_unvisited:bool" |
|
|
) |
| |
◆ PyDoc_STRVAR() [2/3]
PyDoc_STRVAR |
( |
AdjacencyIterator_is_incoming_doc |
, |
|
|
"True if the current ViewEdge is coming towards the iteration |
vertex, |
|
|
and\n" "False otherwise.\n" "\n" ":type:bool" |
|
|
) |
| |
◆ PyDoc_STRVAR() [3/3]
PyDoc_STRVAR |
( |
AdjacencyIterator_object_doc |
, |
|
|
"The ViewEdge object currently pointed to by this iterator.\n" "\n" ":type: :class:`ViewEdge`" |
|
|
) |
| |
◆ AdjacencyIterator_Type
PyTypeObject AdjacencyIterator_Type |
◆ BPy_AdjacencyIterator_getseters
PyGetSetDef BPy_AdjacencyIterator_getseters[] |
|
static |
Initial value:= {
{"is_incoming",
(setter) nullptr,
AdjacencyIterator_is_incoming_doc,
nullptr},
{"object",
(setter) nullptr,
AdjacencyIterator_object_doc,
nullptr},
{nullptr, nullptr, nullptr, nullptr, nullptr}
}
static PyObject * AdjacencyIterator_is_incoming_get(BPy_AdjacencyIterator *self, void *UNUSED(closure))
static PyObject * AdjacencyIterator_object_get(BPy_AdjacencyIterator *self, void *UNUSED(closure))
Definition at line 156 of file BPy_AdjacencyIterator.cpp.