CMS 3D CMS Logo
List of all members | Public Member Functions | Public Attributes
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

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

Definition at line 31 of file OrderedSet.py.

31  def __init__(self, iterable=None):
32  self.end = end = []
33  end += [None, end, end] # sentinel node for doubly linked list
34  self.map = {} # key --> [key, prev, next]
35  if iterable is not None:
36  self |= iterable
37 
OrderedSet.OrderedSet.__init__
def __init__(self, iterable=None)
Definition: OrderedSet.py:31

Member Function Documentation

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.

41  def __contains__(self, key):
42  return key in self.map
43 
OrderedSet.OrderedSet.__contains__
def __contains__(self, key)
Definition: OrderedSet.py:41
def OrderedSet.OrderedSet.__eq__ (   self,
  other 
)

Definition at line 82 of file OrderedSet.py.

References list().

Referenced by SequenceTypes._UnarySequenceOperator.__ne__().

82  def __eq__(self, other):
83  if isinstance(other, OrderedSet):
84  return len(self) == len(other) and list(self) == list(other)
85  return set(self) == set(other)
86 
87 
OrderedSet.OrderedSet.__eq__
def __eq__(self, other)
Definition: OrderedSet.py:82
list
How EventSelector::AcceptEvent() decides whether to accept an event for output otherwise it is excluding the probing of A single or multiple positive and the trigger will pass if any such matching triggers are PASS or EXCEPTION[A criterion thatmatches no triggers at all is detected and causes a throw.] A single negative with an expectation of appropriate bit checking in the decision and the trigger will pass if any such matching triggers are FAIL or EXCEPTION A wildcarded negative criterion that matches more than one trigger in the trigger list("!*","!HLTx*"if it matches 2 triggers or more) will accept the event if all the matching triggers are FAIL.It will reject the event if any of the triggers are PASS or EXCEPTION(this matches the behavior of"!*"before the partial wildcard feature was incorporated).Triggers which are in the READY state are completely ignored.(READY should never be returned since the trigger paths have been run
def OrderedSet.OrderedSet.__iter__ (   self)

Definition at line 56 of file OrderedSet.py.

References OrderedSet.OrderedSet.end, poly< T >::const_iterator.end, edm::IDVectorMap< ID, C, P >::range.end, validateAlignments.ValidationJob.end, cond::RunInfo_t.end, validateAlignments.ValidationJobMultiIOV.end, o2olib.O2ORunMgr.end, esMonitoring.FDOutputListener.end, LHCInfoImpl::LumiSectionFilter.end, and svgfig.LineAxis.end.

56  def __iter__(self):
57  end = self.end
58  curr = end[2]
59  while curr is not end:
60  yield curr[0]
61  curr = curr[2]
62 
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.

38  def __len__(self):
39  return len(self.map)
40 
def OrderedSet.OrderedSet.__repr__ (   self)

Definition at line 77 of file OrderedSet.py.

References list().

77  def __repr__(self):
78  if not self:
79  return '%s()' % (self.__class__.__name__,)
80  return '%s(%r)' % (self.__class__.__name__, list(self))
81 
list
How EventSelector::AcceptEvent() decides whether to accept an event for output otherwise it is excluding the probing of A single or multiple positive and the trigger will pass if any such matching triggers are PASS or EXCEPTION[A criterion thatmatches no triggers at all is detected and causes a throw.] A single negative with an expectation of appropriate bit checking in the decision and the trigger will pass if any such matching triggers are FAIL or EXCEPTION A wildcarded negative criterion that matches more than one trigger in the trigger list("!*","!HLTx*"if it matches 2 triggers or more) will accept the event if all the matching triggers are FAIL.It will reject the event if any of the triggers are PASS or EXCEPTION(this matches the behavior of"!*"before the partial wildcard feature was incorporated).Triggers which are in the READY state are completely ignored.(READY should never be returned since the trigger paths have been run
def OrderedSet.OrderedSet.__reversed__ (   self)

Definition at line 63 of file OrderedSet.py.

References OrderedSet.OrderedSet.end, poly< T >::const_iterator.end, edm::IDVectorMap< ID, C, P >::range.end, validateAlignments.ValidationJob.end, cond::RunInfo_t.end, validateAlignments.ValidationJobMultiIOV.end, o2olib.O2ORunMgr.end, esMonitoring.FDOutputListener.end, LHCInfoImpl::LumiSectionFilter.end, and svgfig.LineAxis.end.

63  def __reversed__(self):
64  end = self.end
65  curr = end[1]
66  while curr is not end:
67  yield curr[0]
68  curr = curr[1]
69 
OrderedSet.OrderedSet.__reversed__
def __reversed__(self)
Definition: OrderedSet.py:63
def OrderedSet.OrderedSet.add (   self,
  key 
)

Definition at line 44 of file OrderedSet.py.

References OrderedSet.OrderedSet.end, poly< T >::const_iterator.end, edm::IDVectorMap< ID, C, P >::range.end, validateAlignments.ValidationJob.end, cond::RunInfo_t.end, validateAlignments.ValidationJobMultiIOV.end, o2olib.O2ORunMgr.end, esMonitoring.FDOutputListener.end, LHCInfoImpl::LumiSectionFilter.end, svgfig.LineAxis.end, OrderedSet.OrderedSet.map, HcalEmap.map, EMap.map, and cscdqm::Summary.map.

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

44  def add(self, key):
45  if key not in self.map:
46  end = self.end
47  curr = end[1]
48  curr[2] = end[1] = self.map[key] = [key, curr, end]
49 
OrderedSet.OrderedSet.add
def add(self, key)
Definition: OrderedSet.py:44
def OrderedSet.OrderedSet.discard (   self,
  key 
)

Definition at line 50 of file OrderedSet.py.

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

Referenced by OrderedSet.OrderedSet.pop().

50  def discard(self, key):
51  if key in self.map:
52  key, prev, next = self.map.pop(key)
53  prev[2] = next
54  next[1] = prev
55 
OrderedSet.OrderedSet.discard
def discard(self, key)
Definition: OrderedSet.py:50
def OrderedSet.OrderedSet.pop (   self,
  last = True 
)

Definition at line 70 of file OrderedSet.py.

References OrderedSet.OrderedSet.discard(), DQMNet.discard(), OrderedSet.OrderedSet.end, poly< T >::const_iterator.end, edm::IDVectorMap< ID, C, P >::range.end, validateAlignments.ValidationJob.end, cond::RunInfo_t.end, validateAlignments.ValidationJobMultiIOV.end, o2olib.O2ORunMgr.end, esMonitoring.FDOutputListener.end, LHCInfoImpl::LumiSectionFilter.end, and svgfig.LineAxis.end.

70  def pop(self, last=True):
71  if not self:
72  raise KeyError('set is empty')
73  key = self.end[1][0] if last else self.end[2][0]
74  self.discard(key)
75  return key
76 
OrderedSet.OrderedSet.discard
def discard(self, key)
Definition: OrderedSet.py:50
OrderedSet.OrderedSet.pop
def pop(self, last=True)
Definition: OrderedSet.py:70

Member Data Documentation

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().

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().

Generated for CMSSW Reference Manual by doxygen 1.8.11