OrderedSet.OrderedSet Class Reference

Inheritance diagram for OrderedSet.OrderedSet:

Public Member Functions
def	__contains__ (self, key)
def	__eq__ (self, other)
def	__init__ (self, iterable=None)
def	__iter__ (self)
def	__len__ (self)
def	__repr__ (self)
def	__reversed__ (self)
def	add (self, key)
def	discard (self, key)
def	pop (self, last=True)

Public Attributes
	end
	map

Detailed Description

Definition at line 29 of file OrderedSet.py.

Constructor & Destructor Documentation

__init__()

def OrderedSet.OrderedSet.__init__	(		self,
			iterable = None
	)

Definition at line 31 of file OrderedSet.py.

    def __init__(self, iterable=None):
        self.end = end = [] 
        end += [None, end, end]         # sentinel node for doubly linked list
        self.map = {}                   # key --> [key, prev, next]
        if iterable is not None:
            self |= iterable

Member Function Documentation

__contains__()

def OrderedSet.OrderedSet.__contains__	(		self,
			key
	)

Definition at line 41 of file OrderedSet.py.

References OrderedSet.OrderedSet.map, HcalEmap.map, EMap.map, and cscdqm::Summary.map.

    def __contains__(self, key):
        return key in self.map

__eq__()

def OrderedSet.OrderedSet.__eq__	(		self,
			other
	)

Definition at line 82 of file OrderedSet.py.

Referenced by SequenceTypes._UnarySequenceOperator.__ne__().

    def __eq__(self, other):
        if isinstance(other, OrderedSet):
            return len(self) == len(other) and list(self) == list(other)
        return set(self) == set(other)

            

__iter__()

def OrderedSet.OrderedSet.__iter__

(

self

)

Definition at line 56 of file OrderedSet.py.

References OrderedSet.OrderedSet.end, LumiSectionFilter< T >.end, poly< T >::const_iterator.end, cond::RunInfo_t.end, o2olib.O2ORunMgr.end, esMonitoring.FDOutputListener.end, and svgfig.LineAxis.end.

    def __iter__(self):
        end = self.end
        curr = end[2]
        while curr is not end:
            yield curr[0]
            curr = curr[2]

__len__()

def OrderedSet.OrderedSet.__len__

(

self

)

Definition at line 38 of file OrderedSet.py.

References OrderedSet.OrderedSet.map, HcalEmap.map, EMap.map, and cscdqm::Summary.map.

    def __len__(self):
        return len(self.map)

__repr__()

def OrderedSet.OrderedSet.__repr__

(

self

)

Definition at line 77 of file OrderedSet.py.

References __class__< T >.__class__().

Referenced by datamodel.Object.__str__().

    def __repr__(self):
        if not self:
            return '%s()' % (self.__class__.__name__,)
        return '%s(%r)' % (self.__class__.__name__, list(self))

__reversed__()

def OrderedSet.OrderedSet.__reversed__

(

self

)

Definition at line 63 of file OrderedSet.py.

References OrderedSet.OrderedSet.end, LumiSectionFilter< T >.end, poly< T >::const_iterator.end, cond::RunInfo_t.end, o2olib.O2ORunMgr.end, esMonitoring.FDOutputListener.end, and svgfig.LineAxis.end.

    def __reversed__(self):
        end = self.end
        curr = end[1]
        while curr is not end:
            yield curr[0]
            curr = curr[1]

add()

def OrderedSet.OrderedSet.add	(		self,
			key
	)

Definition at line 44 of file OrderedSet.py.

References OrderedSet.OrderedSet.end, LumiSectionFilter< T >.end, poly< T >::const_iterator.end, cond::RunInfo_t.end, o2olib.O2ORunMgr.end, esMonitoring.FDOutputListener.end, svgfig.LineAxis.end, OrderedSet.OrderedSet.map, HcalEmap.map, EMap.map, and cscdqm::Summary.map.

Referenced by counter.Counter.register(), SequenceTypes._TaskBase.remove(), and SequenceTypes._TaskBase.replace().

    def add(self, key):
        if key not in self.map:
            end = self.end
            curr = end[1]
            curr[2] = end[1] = self.map[key] = [key, curr, end]

discard()

def OrderedSet.OrderedSet.discard	(		self,
			key
	)

Definition at line 50 of file OrderedSet.py.

References OrderedSet.OrderedSet.map, HcalEmap.map, EMap.map, cscdqm::Summary.map, and OrderedSet.OrderedSet.pop().

Referenced by OrderedSet.OrderedSet.pop().

    def discard(self, key):
        if key in self.map:        
            key, prev, next = self.map.pop(key)
            prev[2] = next
            next[1] = prev

pop()

def OrderedSet.OrderedSet.pop	(		self,
			last = True
	)

Definition at line 70 of file OrderedSet.py.

References OrderedSet.OrderedSet.discard(), DQMNet.discard(), OrderedSet.OrderedSet.end, LumiSectionFilter< T >.end, poly< T >::const_iterator.end, cond::RunInfo_t.end, o2olib.O2ORunMgr.end, esMonitoring.FDOutputListener.end, and svgfig.LineAxis.end.

Referenced by SequenceTypes.Schedule._replaceIfHeldDirectly(), and OrderedSet.OrderedSet.discard().

    def pop(self, last=True):
        if not self:
            raise KeyError('set is empty')
        key = self.end[1][0] if last else self.end[2][0]
        self.discard(key)
        return key

Member Data Documentation

end

OrderedSet.OrderedSet.end

Definition at line 32 of file OrderedSet.py.

Referenced by OrderedSet.OrderedSet.__iter__(), OrderedSet.OrderedSet.__reversed__(), OrderedSet.OrderedSet.add(), Types.LuminosityBlockRange.cppID(), Types.EventRange.cppID(), and OrderedSet.OrderedSet.pop().

map

OrderedSet.OrderedSet.map

Definition at line 34 of file OrderedSet.py.

Referenced by OrderedSet.OrderedSet.__contains__(), OrderedSet.OrderedSet.__len__(), OrderedSet.OrderedSet.add(), and OrderedSet.OrderedSet.discard().