bookConverter Namespace Reference

Classes
class	OptionParser

Functions
def	ccopy (a)
def	cexists (s, c)
def	compute (min, max)
def	create_declaration (cid)
def	create_xsd ()
def	kpermutation (vfrom, vto, min, max)
def	priorities ()
def	read_data ()

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

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)

def bookConverter.compute	(		min,
			max
	)

Definition at line 105 of file bookConverter.py.

References mps_setup.append, ccopy(), cexists(), and kpermutation().

Referenced by DTCalibValidation.analyze(), ClosestApproachInRPhi.calculate(), Basic2DGenericPFlowPositionCalc.calculateAndSetPositionActual(), ClosestApproachInRPhi.clone(), DTRecHitQuality.dqmAnalyze(), IPTagPlotter< Container, Base >.finalize(), TrackCountingTagPlotter.finalize(), TrackProbabilityTagPlotter.finalize(), PhysicsTools::MVATrainer.getTrainCalibration(), PhysicsTools::MVATrainer.makeTrainCalibration(), MaterialEffectsUpdator.mass(), magfieldparam::BCycl< float >.operator()(), priorities(), DTRecHitBaseAlgo.reconstruct(), GsfMaterialEffectsUpdator.updateState(), RPCRecHitBaseAlgo.~RPCRecHitBaseAlgo(), VariableComputer.~VariableComputer(), and VariableComputerTest.~VariableComputerTest().

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) 

def bookConverter.create_declaration

(

cid

)

Definition at line 75 of file bookConverter.py.

Referenced by priorities().

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

def bookConverter.create_xsd

(

)

Definition at line 57 of file bookConverter.py.

Referenced by priorities().

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)

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 = []

def bookConverter.priorities

(

)

Definition at line 118 of file bookConverter.py.

References mps_setup.append, compute(), create_declaration(), create_xsd(), and read_data().

Referenced by TrackAlgoPriorityOrder.TrackAlgoPriorityOrder().

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

def bookConverter.read_data

(

)

Definition at line 16 of file bookConverter.py.

References objects.autophobj.float, and createfilelist.int.

Referenced by priorities().

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 name not in elements:
          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)