Reference Manual

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages

Classes
class	OptionParser

Functions
def	ccopy

def	cexists

def	compute

def	create_declaration

def	create_xsd

def	kpermutation

def	priorities

def	read_data

Variables
dictionary	comb = {}

dictionary	elements = {}

list	histograms = []

dictionary	keys = {}

int	len_max = 0

int	len_min = 1000000

	max = len_max

int	min = 2

tuple	optManager = OptionParser()

	opts = opts.__dict__

dictionary	prior = {}

tuple	resdoc = dom.Document()

dictionary	results = {}

tuple	srcdoc = dom.parse(opts['src'])

Function Documentation

def bookConverter.ccopy ( a )

Definition at line 89 of file bookConverter.py.

Referenced by compute().

 
 def ccopy(a):
   r = []
   for v in a:
     r.append(v)
   return r

bookConverter.ccopy

def ccopy

Definition: bookConverter.py:89

def bookConverter.cexists	(	s,
		c
	)

Definition at line 81 of file bookConverter.py.

Referenced by compute().

 
 def cexists(s, c):
   d = len(c)
   for v1 in s:
     for v2 in c:
       if v1 == v2:
         d = d - 1
   return (d == 0)

bookConverter.cexists

def cexists

Definition: bookConverter.py:81

def bookConverter.compute	(	min,
		max
	)

Definition at line 105 of file bookConverter.py.

References python.multivaluedict.append(), ccopy(), cexists(), and kpermutation().

Referenced by DTCalibValidation.analyze(), DTRecHitQuality.analyze(), ClosestApproachInRPhi.calculate(), TrackCountingTagPlotter.finalize(), TrackProbabilityTagPlotter.finalize(), TrackIPTagPlotter.finalize(), PhysicsTools::MVATrainer.getTrainCalibration(), PhysicsTools::MVATrainer.makeTrainCalibration(), and DTRecHitBaseAlgo.reconstruct().

 
 def compute(min, max):
   print "Computing permutations"
   for v in kpermutation(0, len(keys), min, max):
     ci = -1
     for h in histograms:
       if cexists(h, v):
         if ci == -1:
           ci = len(comb)
           comb[ci] = ccopy(v)
           results[ci] = [h]
         else:
           results[ci].append(h) 

python.multivaluedict.append

def append

Definition: multivaluedict.py:73

bookConverter.kpermutation

def kpermutation

Definition: bookConverter.py:95

bookConverter.cexists

def cexists

Definition: bookConverter.py:81

bookConverter.compute

def compute

Definition: bookConverter.py:105

bookConverter.ccopy

def ccopy

Definition: bookConverter.py:89

def bookConverter.create_declaration ( cid )

Definition at line 75 of file bookConverter.py.

 
 def create_declaration(cid):
   co = comb[cid]
   print "Declaration to apply:", co
   for k in comb[cid]:
     print keys[k]['name'], '=', keys[k]['value']

bookConverter.create_declaration

def create_declaration

Definition: bookConverter.py:75

def bookConverter.create_xsd ( )

Definition at line 57 of file bookConverter.py.

 
 def create_xsd():
   for k in keys.keys():
     name = keys[k]['name']
 
   root = resdoc.createElement("xs:complexType")
   root.setAttribute("name", "HistogramType")
   resdoc.appendChild(root)
   seq = resdoc.createElement("xs:all")
   root.appendChild(seq)
   for e in sorted(elements.keys()):
     el = resdoc.createElement("xs:element")
     el.setAttribute("name", e)
     el.setAttribute("type", elements[e]['type'])
     if elements[e]['count'] < len(histograms):
       el.setAttribute("minOccurs", '0')
       el.setAttribute("maxOccurs", '1')
     seq.appendChild(el)

bookConverter.create_xsd

def create_xsd

Definition: bookConverter.py:57

def bookConverter.kpermutation	(	vfrom,
		vto,
		min,
		max
	)

Definition at line 95 of file bookConverter.py.

Referenced by compute().

 
 def kpermutation(vfrom, vto, min, max):
   vto = vto + 1
   queue = []
   for i in range(vfrom, vto):
     for j in range(i, vto):
       queue.append(j)
       if len(queue) >= min and len(queue) <= max:
         yield queue
     queue = []

bookConverter.kpermutation

def kpermutation

Definition: bookConverter.py:95

def bookConverter.priorities ( )

Definition at line 118 of file bookConverter.py.

References python.multivaluedict.append().

 
 def priorities():
   for ci in comb.keys():
     l = len(results[ci])
     if l == 1: 
       continue
     if not prior.has_key(l):
       prior[l] = [ci]
     else:
       prior[l].append(ci)

bookConverter.priorities

def priorities

Definition: bookConverter.py:118

python.multivaluedict.append

def append

Definition: multivaluedict.py:73

def bookConverter.read_data ( )

Definition at line 16 of file bookConverter.py.

 
 def read_data():
   print "Reading histogram file"
   n = 0
   histos = srcdoc.getElementsByTagName("Histogram")
   for histo in histos:
     h = []
     for key in histo.childNodes:
       if key.nodeType == key.ELEMENT_NODE:
         name = key.localName
         value = key.childNodes[0].nodeValue
         found = 0
 
         if not elements.has_key(name):
           elements[name] = {'type': '', 'count': 0}
         elements[name]['count'] = elements[name]['count'] + 1
 
         try:
           i = int(value)
           if elements[name]['type'] == '':
             elements[name]['type'] = 'xs:integer'
         except ValueError:
           try:
             i = float(value)  
             if elements[name]['type'] in ('', 'xs:integer'):
               elements[name]['type'] = 'xs:double'
           except ValueError:
             elements[name]['type'] = 'xs:string'
 
         for k in keys.keys():
           if keys[k]['name'] == name and keys[k]['value'] == value:
             keys[k]['count'] = keys[k]['count'] + 1
             h.append(k)
             found = 1
             break
         if found == 0:
           keys[n] = {'name': name, 'value': value, 'count': 1}
           h.append(n)
           n += 1
     h.sort()
     histograms.append(h)