GaudiPython.Pythonizations Namespace Reference

Functions
def	_printHisto1D (h)
def	_contentsHisto1D (h)
def	_printHisto2D (h)
def	_printStatusCode (s)
def	_printBitReference (b)
def	_printFillStream (o)
def	_container__getitem__ (self, k)
def	_container__len__ (self)
def	_container__iter__ (self)
def	_draw_aida_ (self, *args)
def	__mapbase_iter__ (self)
def	__mapbase_iteritems__ (self)
def	__mapbase_keys__ (self)
def	__mapbase_items__ (self)
def	__mapbase_values__ (self)
def	__mapbase_contains__ (self, key)
def	__mapbase_get__ (self, key, value=None)
def	__mapbase_str__ (self)
def	__mapbase_setitem__ (self, key, value)
def	__mapbase_delitem__ (self, key)

Variables
	__all__
	(c) Copyright 1998-2023 CERN for the benefit of the LHCb and ATLAS collaborations # # This software is distributed under the terms of the Apache version 2 licence, # copied verbatim in the file "LICENSE". More...
	Draw
	plot
	__repr__
	__getitem__
	__len__
	__iter__
	update
	invalidate
	SUCCESS
	FAILURE
	_eq
	_ne
	executeEvent
	Helpers for re-entrant interfaces. More...
	isExecuted
	filterPassed
	_execute_orig
	execute
	self
	ctx

Function Documentation

__mapbase_contains__()

def GaudiPython.Pythonizations.__mapbase_contains__	(		self,
			key
	)

Check if the certainkey is in the map

>>> m     = ...        ## the map
>>> if 'a' in m : ...  ##  chekc the presence of the key in the map

Definition at line 378 of file Pythonizations.py.

def __mapbase_contains__(self, key):
    """
    Check if the certainkey is in the map
 
    >>> m     = ...        ## the map
    >>> if 'a' in m : ...  ##  chekc the presence of the key in the map
 
    """
    _num = self.count(key)
    return False if 0 == _num else True
 
 
# ============================================
# Get the value for certain key,
#   return predefined value otherwise
#
#  @code
#
#    >>> m      = ...          ## the map
#    >>> v = m.get( key , 15 ) ## return the value[key] for existing key, else 15
#
#  @endcode
#  @see Gaudi::Utils::MapBase
#  @see GaudiUtils::Map
#  @see GaudiUtils::HashMap
#  @see GaudiUtils::VectorMap
#  @see GaudiUtils::Map::count
#  @see GaudiUtils::HashMap::count
#  @ see GaudiUtils::VectorMap::count
#  @author Vanya BELYAEV Ivan.BElyaev@itep.ru
#  @date 2010-02-20
 
 

__mapbase_delitem__()

def GaudiPython.Pythonizations.__mapbase_delitem__	(		self,
			key
	)

'Del-item' for MapBase-based maps:

>>> m      = ...        ## the map
>>> del m[key]

Definition at line 515 of file Pythonizations.py.

def __mapbase_delitem__(self, key):
    """
    'Del-item' for MapBase-based maps:
 
    >>> m      = ...        ## the map
    >>> del m[key]
 
    """
    _erased = True if key in self else False
    self.erase(key)
    return _erased
 
 
gbl.Gaudi.Utils.MapBase.__len__ = lambda s: s.size()
gbl.Gaudi.Utils.MapBase.__iter__ = __mapbase_iter__
gbl.Gaudi.Utils.MapBase.keys = __mapbase_keys__
gbl.Gaudi.Utils.MapBase.__iteritems__ = __mapbase_iteritems__
gbl.Gaudi.Utils.MapBase.values = __mapbase_values__
gbl.Gaudi.Utils.MapBase.__contains__ = __mapbase_contains__
gbl.Gaudi.Utils.MapBase.get = __mapbase_get__
gbl.Gaudi.Utils.MapBase.__str__ = __mapbase_str__
gbl.Gaudi.Utils.MapBase.__repr__ = __mapbase_str__
gbl.Gaudi.Utils.MapBase.__setitem__ = __mapbase_setitem__
gbl.Gaudi.Utils.MapBase.__delitem__ = __mapbase_delitem__
gbl.Gaudi.Utils.MapBase.__getitem__ = lambda s, key: s.at(key)
gbl.Gaudi.Utils.MapBase.items = __mapbase_iteritems__
 

__mapbase_get__()

def GaudiPython.Pythonizations.__mapbase_get__	(		self,
			key,
			value = None
	)

Get the value for the certain key, or 'value' otherwise

>>> m     = ...        ## the map
>>> v = m.get ( key , 15 )

Definition at line 411 of file Pythonizations.py.

def __mapbase_get__(self, key, value=None):
    """
    Get the value for the certain key, or 'value' otherwise
 
    >>> m     = ...        ## the map
    >>> v = m.get ( key , 15 )
 
    """
    if key in self:
        return self.at(key)
    return value
 
 
# ============================================
# Representation of MapBase-based maps
#
#  @code
#
#    >>> m      = ...        ## the map
#    >>> print(m)
#
#  @endcode
#  @see Gaudi::Utils::MapBase
#  @see GaudiUtils::Map
#  @see GaudiUtils::HashMap
#  @see GaudiUtils::VectorMap
#  @author Vanya BELYAEV Ivan.BElyaev@itep.ru
#  @date 2010-02-20
 
 

__mapbase_items__()

def GaudiPython.Pythonizations.__mapbase_items__

(

self

)

Get the list of items

>>> m     = ...        ## the map
>>> items = m.keys()   ## get the list of items

Definition at line 305 of file Pythonizations.py.

def __mapbase_items__(self):
    """
    Get the list of items
 
    >>> m     = ...        ## the map
    >>> items = m.keys()   ## get the list of items
 
    """
    _size = len(self)
    _items = []
    for i in range(0, _size):
        _key = self.key_at(i)
        _value = self.at(_key)
        _items.append((_key, _value))
    return _items
 
 
# ============================================
# Get the list of values for the map
#
#  @code
#
#    >>> m      = ...           ## the map
#    >>> values = m.values ()   ## get the list of values
#
#  @endcode
#  @see Gaudi::Utils::MapBase
#  @see GaudiUtils::Map
#  @see GaudiUtils::HashMap
#  @see GaudiUtils::VectorMap
#  @see GaudiUtils::Map::value_at
#  @see GaudiUtils::HashMap::value_at
#  @ see GaudiUtils::VectorMap::value_at
#  @author Vanya BELYAEV Ivan.Belyaev@itep.ru
#  @date 2010-02-20
 
 

__mapbase_iter__()

def GaudiPython.Pythonizations.__mapbase_iter__

(

self

)

The iterator for MapBase-based containers

>>> m = ...  ## the map
>>> for key in m : print(key , m[key])

Definition at line 196 of file Pythonizations.py.

def __mapbase_iter__(self):
    """
    The iterator for MapBase-based containers
 
    >>> m = ...  ## the map
    >>> for key in m : print(key , m[key])
 
    """
    _size = len(self)
    _index = 0
    while _index < _size:
        yield self.key_at(_index)
        _index += 1
 
 
# =============================================================================
# The iterator for MapBase class
#
#  @code
#
#    >>> m = ...  ## the map
#    >>> for key,value in m.iteritems() : print(key , value)
#
#  @endcode
#  @see Gaudi::Utils::MapBase
#  @see GaudiUtils::Map
#  @see GaudiUtils::HashMap
#  @see GaudiUtils::VectorMap
#  @see GaudiUtils::Map::key_at
#  @see GaudiUtils::HashMap::key_at
#  @see GaudiUtils::VectorMap::key_at
#  @see GaudiUtils::Map::value_at
#  @see GaudiUtils::HashMap::value_at
#  @see GaudiUtils::VectorMap::value_at
#  @author Vanya BELYAEV Ivan.Belyaev@itep.ru
#  @date 2010-02-20
 
 

__mapbase_iteritems__()

def GaudiPython.Pythonizations.__mapbase_iteritems__

(

self

)

The iterator for MapBase-based containers

>>> m = ...  ## the map
>>> for key,value in m.iteritems() : print(key, value)

Definition at line 234 of file Pythonizations.py.

def __mapbase_iteritems__(self):
    """
    The iterator for MapBase-based containers
 
    >>> m = ...  ## the map
    >>> for key,value in m.iteritems() : print(key, value)
 
    """
    _size = len(self)
    _index = 0
    while _index < _size:
        _key = self.key_at(_index)
        yield (_key, self.at(_key))
        _index += 1
 
 
# ============================================
# Get the list of keys for the map
#
#  @code
#
#    >>> m    = ...        ## the map
#    >>> keys = m.keys()   ## get the list of keys
#
#  @endcode
#  @see Gaudi::Utils::MapBase
#  @see GaudiUtils::Map
#  @see GaudiUtils::HashMap
#  @see GaudiUtils::VectorMap
#  @see GaudiUtils::Map::key_at
#  @see GaudiUtils::HashMap::key_at
#  @ see GaudiUtils::VectorMap::key_at
#  @author Vanya BELYAEV Ivan.BElyaev@itep.ru
#  @date 2010-02-20
 
 

__mapbase_keys__()

def GaudiPython.Pythonizations.__mapbase_keys__

(

self

)

Get the list of keys

>>> m = ...           ## the map
>>> keys = m.keys()   ## get the list of keys

Definition at line 270 of file Pythonizations.py.

def __mapbase_keys__(self):
    """
    Get the list of keys
 
    >>> m = ...           ## the map
    >>> keys = m.keys()   ## get the list of keys
 
    """
    _size = len(self)
    _keys = []
    for i in range(0, _size):
        _keys.append(self.key_at(i))
    return _keys
 
 
# ============================================
# Get the list of items for the map
#
#  @code
#
#    >>> m     = ...        ## the map
#    >>> items = m.items()   ## get the list of items
#
#  @endcode
#  @see Gaudi::Utils::MapBase
#  @see GaudiUtils::Map
#  @see GaudiUtils::HashMap
#  @see GaudiUtils::VectorMap
#  @see GaudiUtils::Map::key_at
#  @see GaudiUtils::HashMap::key_at
#  @ see GaudiUtils::VectorMap::key_at
#  @author Vanya BELYAEV Ivan.BElyaev@itep.ru
#  @date 2010-02-20
 
 

__mapbase_setitem__()

def GaudiPython.Pythonizations.__mapbase_setitem__	(		self,
			key,
			value
	)

'Set-item' for MapBase-based maps:

>>> m      = ...        ## the map
>>> m[key] = value     ## set the item

Definition at line 481 of file Pythonizations.py.

def __mapbase_setitem__(self, key, value):
    """
    'Set-item' for MapBase-based maps:
 
    >>> m      = ...        ## the map
    >>> m[key] = value     ## set the item
 
    """
    _replaced = True if key in self else False
    self.update(key, value)
    return _replaced
 
 
# ============================================
# "Del-item" for MapBase-based maps:
#
#  @code
#
#    >>> m        = ...   ## the map
#    >>> del m [ key]     ## del th eitem
#
#  @endcode
#
#  @see Gaudi::Utils::MapBase
#  @see GaudiUtils::Map
#  @see GaudiUtils::HashMap
#  @see GaudiUtils::VectorMap
#  @see GaudiUtils::Map::erase
#  @see GaudiUtils::HashMap::erase
#  @see GaudiUtils::VectorMap::erase
#  @author Vanya BELYAEV Ivan.BElyaev@itep.ru
#  @date 2010-02-20
 
 

__mapbase_str__()

def GaudiPython.Pythonizations.__mapbase_str__

(

self

)

Representation of MapBase-based maps:

>>> m     = ...        ## the map
>>> print(map)

Definition at line 441 of file Pythonizations.py.

def __mapbase_str__(self):
    """
    Representation of MapBase-based maps:
 
    >>> m     = ...        ## the map
    >>> print(map)
 
    """
    _result = " { "
    _size = len(self)
    for i in range(0, _size):
        _key = self.key_at(i)
        _val = self.at(_key)
        if 0 != i:
            _result += " , "
        _result += " %s : %s " % (str(_key), str(_val))
    _result += " } "
    return _result
 
 
# ============================================
# "Setitem" for MapBase-based maps:
#
#  @code
#
#    >>> m        = ...        ## the map
#    >>> m [ key] = value    ## set the item
#
#  @endcode
#  @see Gaudi::Utils::MapBase
#  @see GaudiUtils::Map
#  @see GaudiUtils::HashMap
#  @see GaudiUtils::VectorMap
#  @see GaudiUtils::Map::update
#  @see GaudiUtils::HashMap::update
#  @see GaudiUtils::VectorMap::update
#  @author Vanya BELYAEV Ivan.BElyaev@itep.ru
#  @date 2010-02-20
 
 

__mapbase_values__()

def GaudiPython.Pythonizations.__mapbase_values__

(

self

)

Get the list of values

>>> m      = ...          ## the map
>>> values = m.values()   ## get the list of values

Definition at line 342 of file Pythonizations.py.

def __mapbase_values__(self):
    """
    Get the list of values
 
    >>> m      = ...          ## the map
    >>> values = m.values()   ## get the list of values
 
    """
    _size = len(self)
    _values = []
    for i in range(0, _size):
        _value = self.value_at(i)
        _values.append(_value)
    return _values
 
 
# ============================================
# Check if the certain key is in the map
#
#  @code
#
#    >>> m      = ...        ## the map
#    >>> if 'a' in m : print('key is in the map!')
#
#  @endcode
#  @see Gaudi::Utils::MapBase
#  @see GaudiUtils::Map
#  @see GaudiUtils::HashMap
#  @see GaudiUtils::VectorMap
#  @see GaudiUtils::Map::count
#  @see GaudiUtils::HashMap::count
#  @ see GaudiUtils::VectorMap::count
#  @author Vanya BELYAEV Ivan.BElyaev@itep.ru
#  @date 2010-02-20
 
 

_container__getitem__()

def GaudiPython.Pythonizations._container__getitem__ (   self,   k  )

private

Definition at line 87 of file Pythonizations.py.

def _container__getitem__(self, k):
    return self.containedObject(k)
 
 

_container__iter__()

def GaudiPython.Pythonizations._container__iter__ (   self )

private

Definition at line 95 of file Pythonizations.py.

def _container__iter__(self):
    if hasattr(self, "containedObjects"):
        sequential = self.containedObjects()
    else:
        sequential = self
    count = 0
    limit = self.__len__()
    while count < limit:
        yield sequential.__getitem__(count)
        count += 1
 
 

_container__len__()

def GaudiPython.Pythonizations._container__len__ (   self )

private

Definition at line 91 of file Pythonizations.py.

def _container__len__(self):
    return self.numberOfObjects()
 
 

_contentsHisto1D()

def GaudiPython.Pythonizations._contentsHisto1D (   h )

private

Definition at line 44 of file Pythonizations.py.

def _contentsHisto1D(h):
    x = h.axis()
    return map(h.binEntries, range(x.bins()))
 
 

_draw_aida_()

def GaudiPython.Pythonizations._draw_aida_ (   self, *  args  )

private

Draw AIDA histogram (through access to internal ROOT histogram

>>> aida = ...    # get the historgam
>>> aida.Draw()

Definition at line 107 of file Pythonizations.py.

def _draw_aida_(self, *args):
    """
    Draw AIDA histogram (through access to internal ROOT histogram
 
    >>> aida = ...    # get the historgam
    >>> aida.Draw()
 
    """
    _fun = gbl.Gaudi.Utils.Aida2ROOT.aida2root
    _root = _fun(self)
    return _root.Draw(*args)
 
 
gbl.AIDA.IHistogram1D.__str__ = _printHisto1D
gbl.AIDA.IHistogram1D.contents = _contentsHisto1D
gbl.AIDA.IHistogram2D.__str__ = _printHisto2D

_printBitReference()

def GaudiPython.Pythonizations._printBitReference (   b )

private

Definition at line 69 of file Pythonizations.py.

def _printBitReference(b):
    return str(1 == b.bool())
 
 

_printFillStream()

def GaudiPython.Pythonizations._printFillStream (   o )

private

Definition at line 73 of file Pythonizations.py.

def _printFillStream(o):
    if o:
        s = gbl.stringstream()
        o.fillStream(s)
        out = str(s.str())
        if out == "":
            out = o.__class__.__name__ + " object"
            if hasattr(o, "hasKey") and o.hasKey():
                out += " key = " + str(o.key())
    else:
        out = o.__class__.__name__ + " NULL object"
    return out
 
 

_printHisto1D()

def GaudiPython.Pythonizations._printHisto1D (   h )

private

Definition at line 34 of file Pythonizations.py.

def _printHisto1D(h):
    x = h.axis()
    return 'Histogram 1D "%s" %d bins [%f,%f]' % (
        h.title(),
        x.bins(),
        x.lowerEdge(),
        x.upperEdge(),
    )
 
 

_printHisto2D()

def GaudiPython.Pythonizations._printHisto2D (   h )

private

Definition at line 49 of file Pythonizations.py.

def _printHisto2D(h):
    x, y = h.xAxis(), h.yAxis()
    return 'Histogram 2D "%s" %d xbins [%f,%f], %d ybins [%f,%f]' % (
        h.title(),
        x.bins(),
        x.lowerEdge(),
        x.upperEdge(),
        y.bins(),
        y.lowerEdge(),
        y.upperEdge(),
    )
 
 

_printStatusCode()

def GaudiPython.Pythonizations._printStatusCode (   s )

private

Definition at line 62 of file Pythonizations.py.

def _printStatusCode(s):
    if s.isSuccess():
        return "SUCCESS"
    else:
        return "FAILURE"
 
 

Variable Documentation

__all__

GaudiPython.Pythonizations.__all__

private

(c) Copyright 1998-2023 CERN for the benefit of the LHCb and ATLAS collaborations # # This software is distributed under the terms of the Apache version 2 licence, # copied verbatim in the file "LICENSE".

# # In applying this licence, CERN does not waive the privileges and immunities # granted to it by virtue of its status as an Intergovernmental Organization # or submit itself to any jurisdiction. #

File: GaudiPython/Pythonizations.py Author: Pere Mato (pere..nosp@m.mato.nosp@m.@cern.nosp@m..ch)

Definition at line 17 of file Pythonizations.py.

__getitem__

GaudiPython.Pythonizations.__getitem__

private

Definition at line 141 of file Pythonizations.py.

__iter__

GaudiPython.Pythonizations.__iter__

private

Definition at line 143 of file Pythonizations.py.

__len__

GaudiPython.Pythonizations.__len__

private

Definition at line 142 of file Pythonizations.py.

__repr__

GaudiPython.Pythonizations.__repr__

private

Definition at line 134 of file Pythonizations.py.

_eq

GaudiPython.Pythonizations._eq

private

Definition at line 160 of file Pythonizations.py.

_execute_orig

GaudiPython.Pythonizations._execute_orig

private

Definition at line 577 of file Pythonizations.py.

_ne

GaudiPython.Pythonizations._ne

private

Definition at line 165 of file Pythonizations.py.

ctx

GaudiPython.Pythonizations.ctx

Definition at line 578 of file Pythonizations.py.

Draw

GaudiPython.Pythonizations.Draw

Definition at line 131 of file Pythonizations.py.

execute

GaudiPython.Pythonizations.execute

Definition at line 578 of file Pythonizations.py.

executeEvent

GaudiPython.Pythonizations.executeEvent

Helpers for re-entrant interfaces.

GaudiPython is inherently single threaded and it's unpractical to use the new re-entrant interfaces. Moreover a lot of existing code (like GaudiMP) expects the old signatures.

Definition at line 574 of file Pythonizations.py.

FAILURE

GaudiPython.Pythonizations.FAILURE

Definition at line 156 of file Pythonizations.py.

filterPassed

GaudiPython.Pythonizations.filterPassed

Definition at line 576 of file Pythonizations.py.

invalidate

GaudiPython.Pythonizations.invalidate

Definition at line 148 of file Pythonizations.py.

isExecuted

GaudiPython.Pythonizations.isExecuted

Definition at line 575 of file Pythonizations.py.

plot

GaudiPython.Pythonizations.plot

Definition at line 132 of file Pythonizations.py.

self

GaudiPython.Pythonizations.self

Definition at line 578 of file Pythonizations.py.

SUCCESS

GaudiPython.Pythonizations.SUCCESS

Definition at line 155 of file Pythonizations.py.

update

GaudiPython.Pythonizations.update

Definition at line 145 of file Pythonizations.py.