#include
<class_node_containers_1_1_node_id_list.h>
List of all
members.
Member Function Documentation
NodeContainers.NodeIdList.__init__ |
( |
|
) |
|
NodeContainers.NodeIdList.__del__ |
( |
|
) |
|
NodeContainers.NodeIdList.__getattr__ |
( |
|
) |
|
NodeContainers.NodeIdList.__setattr__ |
( |
|
) |
|
NodeContainers.NodeIdList.__eq__ |
( |
|
) |
|
NodeContainers.NodeIdList.__ne__ |
( |
|
) |
|
NodeContainers.NodeIdList.__contains__ |
( |
|
) |
|
NodeContainers.NodeIdList.__iter__ |
( |
|
) |
|
NodeContainers.NodeIdList.__len__ |
( |
|
) |
|
NodeContainers.NodeIdList.__repr__ |
( |
|
) |
|
NodeContainers.NodeIdList.__or__ |
( |
|
) |
|
NodeContainers.NodeIdList.__and__ |
( |
|
) |
|
NodeContainers.NodeIdList.__sub__ |
( |
|
) |
|
NodeContainers.NodeIdList.__xor__ |
( |
|
) |
|
NodeContainers.NodeIdList.__ror__ |
( |
|
) |
|
NodeContainers.NodeIdList.__rand__ |
( |
|
) |
|
NodeContainers.NodeIdList.__rsub__ |
( |
|
) |
|
NodeContainers.NodeIdList.__rxor__ |
( |
|
) |
|
NodeContainers.NodeIdList.__ior__ |
( |
|
) |
|
NodeContainers.NodeIdList.__iand__ |
( |
|
) |
|
NodeContainers.NodeIdList.__isub__ |
( |
|
) |
|
NodeContainers.NodeIdList.__ixor__ |
( |
|
) |
|
NodeContainers.NodeIdList.issubset |
( |
|
) |
|
NodeContainers.NodeIdList.issuperset |
( |
|
) |
|
NodeContainers.NodeIdList.__le__ |
( |
|
) |
|
NodeContainers.NodeIdList.__ge__ |
( |
|
) |
|
NodeContainers.NodeIdList.union |
( |
|
) |
|
NodeContainers.NodeIdList.intersection |
( |
|
) |
|
NodeContainers.NodeIdList.difference |
( |
|
) |
|
NodeContainers.NodeIdList.symmetric_difference |
( |
|
) |
|
NodeContainers.NodeIdList.copy |
( |
|
) |
|
NodeContainers.NodeIdList.update |
( |
|
) |
|
NodeContainers.NodeIdList.intersection_update |
( |
|
) |
|
NodeContainers.NodeIdList.difference_update |
( |
|
) |
|
NodeContainers.NodeIdList.symmetric_difference_update |
( |
|
) |
|
NodeContainers.NodeIdList.add |
( |
|
) |
|
NodeContainers.NodeIdList.remove |
( |
|
) |
|
NodeContainers.NodeIdList.discard |
( |
|
) |
|
NodeContainers.NodeIdList.pop |
( |
|
) |
|
NodeContainers.NodeIdList.clear |
( |
|
) |
|
NodeContainers.NodeIdList.onNodeDeleted |
( |
|
) |
|
NodeContainers.NodeIdList.onNodeDirty |
( |
|
) |
|
Derive from this class and implement this method to do some
processing when a node in this list becomes dirty.
Reimplemented in
AlternativeSet.Alternative.
NodeContainers.NodeIdList.enableNodeDirtyMonitoring |
( |
|
) |
|
NodeContainers.NodeIdList.isNodeDirtyMonitoringEnabled |
( |
|
) |
|
NodeContainers.NodeIdList.enableNodeDeletionMonitoring |
( |
|
) |
|
NodeContainers.NodeIdList.isNodeDeletionMonitoringEnabled |
( |
|
) |
|
NodeContainers.NodeIdList.onNodeAdded |
( |
|
) |
|
NodeContainers.NodeIdList.onNodeRemoved |
( |
|
) |
|
NodeContainers.NodeIdList.ordered |
( |
|
) |
|
NodeContainers.NodeIdList.first |
( |
|
) |
|
Return the first node identifier in the selection order.
Raise a KeyError if the NodeIdList is
empty.
NodeContainers.NodeIdList.last |
( |
|
) |
|
Return the last node identifier in the selection order.
Raise a KeyError if the NodeIdList is
empty.
NodeContainers.NodeIdList.any |
( |
|
) |
|
Return an arbitrary node identifier.
Raise a KeyError if the NodeIdList is
empty.
NodeContainers.NodeIdList.empty |
( |
|
) |
|
NodeContainers.NodeIdList.asList |
( |
|
) |
|
NodeContainers.NodeIdList.asTuple |
( |
|
) |
|
NodeContainers.NodeIdList.asSet |
( |
|
) |
|
NodeContainers.NodeIdList.getAddConditions |
( |
|
) |
|
NodeContainers.NodeIdList.setAddConditions |
( |
|
) |
|
Note: the invariant is not maintained for this class.
NodeContainers.NodeIdList.getAddCallback |
( |
|
) |
|
NodeContainers.NodeIdList.setAddCallback |
( |
|
) |
|
NodeContainers.NodeIdList.getNodeDeletingCallback |
( |
|
) |
|
NodeContainers.NodeIdList.setNodeDeletingCallback |
( |
|
) |
|
NodeContainers.NodeIdList.getNodeDeletionCallback |
( |
|
) |
|
NodeContainers.NodeIdList.setNodeDeletionCallback |
( |
|
) |
|
NodeContainers.NodeIdList.getRemoveCallback |
( |
|
) |
|
NodeContainers.NodeIdList.setRemoveCallback |
( |
|
) |
|