|
| def | __new__ (cls, name=None, **kwargs) |
| |
| def | __init__ (self, name=None, **kwargs) |
| |
| def | name (self) |
| |
| def | getType (cls) |
| |
| def | properties (self) |
| |
| def | isApplicable (self) |
| |
| def | getGaudiType (cls) |
| |
| def | __repr__ (self) |
| |
| def | __setattr__ (self, name, value) |
| |
| def | __and__ (self, rhs) |
| |
| def | __or__ (self, rhs) |
| |
| def | __invert__ (self) |
| |
| def | __rshift__ (self, rhs) |
| |
| def | visitNode (self, visitor) |
| |
| def | __eq__ (self, other) |
| |
| def | __hash__ (self) |
| |
| def | getFullName (self) |
| |
Helper class to use a ControlFlowNode as an algorithm configurable
instance.
Definition at line 1851 of file Configurable.py.
◆ __init__()
| def GaudiKernel.Configurable.SuperAlgorithm.__init__ |
( |
|
self, |
|
|
|
name = None, |
|
|
** |
kwargs |
|
) |
| |
Definition at line 1873 of file Configurable.py.
1873 def __init__(self, name=None, **kwargs):
1874 self._name = name
or self.getType()
1875 self.graph = self._initGraph()
1877 setattr(self, key, kwargs[key])
◆ __new__()
| def GaudiKernel.Configurable.SuperAlgorithm.__new__ |
( |
|
cls, |
|
|
|
name = None, |
|
|
** |
kwargs |
|
) |
| |
Definition at line 1857 of file Configurable.py.
1857 def __new__(cls, name=None, **kwargs):
1860 if name
in Configurable.allConfigurables:
1861 instance = Configurable.allConfigurables[name]
1862 assert type(instance)
is cls, (
1863 "trying to reuse {0!r} as name of a {1} instance while it"
1865 "already used for an instance of {2}"
1866 ).
format(name, cls.__name__,
type(instance).__name__)
1869 instance = super(SuperAlgorithm, cls).__new__(cls)
1870 Configurable.allConfigurables[name] = instance
◆ __repr__()
| def GaudiKernel.Configurable.SuperAlgorithm.__repr__ |
( |
|
self | ) |
|
◆ __setattr__()
| def GaudiKernel.Configurable.SuperAlgorithm.__setattr__ |
( |
|
self, |
|
|
|
name, |
|
|
|
value |
|
) |
| |
Definition at line 1918 of file Configurable.py.
1918 def __setattr__(self, name, value):
1919 super(SuperAlgorithm, self).__setattr__(name, value)
1920 if name
in (
"_name",
"graph"):
1924 class PropSetter(object):
1925 def enter(self, node):
1927 setattr(node, name, value)
1928 except (ValueError, AttributeError):
1932 def leave(self, node):
1935 self._visitSubNodes(PropSetter())
◆ _initGraph()
| def GaudiKernel.Configurable.SuperAlgorithm._initGraph |
( |
|
self | ) |
|
|
private |
◆ _makeAlg()
| def GaudiKernel.Configurable.SuperAlgorithm._makeAlg |
( |
|
self, |
|
|
|
typ, |
|
|
** |
kwargs |
|
) |
| |
|
private |
Instantiate and algorithm of type 'typ' with a name suitable for use
inside a SuperAlgorithm.
Definition at line 1900 of file Configurable.py.
1900 def _makeAlg(self, typ, **kwargs):
1902 Instantiate and algorithm of type 'typ' with a name suitable for use
1903 inside a SuperAlgorithm.
1905 name =
"{0}_{1}".
format(self.name, kwargs.pop(
"name", typ.getType()))
1906 return typ(name, **kwargs)
◆ _visitSubNodes()
| def GaudiKernel.Configurable.SuperAlgorithm._visitSubNodes |
( |
|
self, |
|
|
|
visitor |
|
) |
| |
|
private |
◆ getGaudiType()
| def GaudiKernel.Configurable.SuperAlgorithm.getGaudiType |
( |
|
cls | ) |
|
◆ getType()
| def GaudiKernel.Configurable.SuperAlgorithm.getType |
( |
|
cls | ) |
|
◆ isApplicable()
| def GaudiKernel.Configurable.SuperAlgorithm.isApplicable |
( |
|
self | ) |
|
◆ name()
| def GaudiKernel.Configurable.SuperAlgorithm.name |
( |
|
self | ) |
|
◆ properties()
| def GaudiKernel.Configurable.SuperAlgorithm.properties |
( |
|
self | ) |
|
◆ _name
| GaudiKernel.Configurable.SuperAlgorithm._name |
|
private |
◆ graph
| GaudiKernel.Configurable.SuperAlgorithm.graph |
The documentation for this class was generated from the following file: