Trees | Indices | Help |
---|
|
object --+ | dict --+ | AbstractALOHAModel
A class to build and store the full set of Abstract ALOHA Routine
|
|||
new empty dictionary |
|
||
|
|||
|
|||
|
|||
D[k] if k in D, else d |
|
||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from |
|
|||
Inherited from |
|
|||
Inherited from |
|
load the UFO model and init the dictionary
|
Compute if not already compute. Write file in models/MY_MODEL/MY_FORMAT. copy the file to output_dir |
return the AbstractRoutine with a given lorentz name, and for a given outgoing particle
|
create the requested ALOHA routine. data should be a list of tuple (lorentz, tag, outgoing) tag should be the list of special tag (like conjugation on pair) to apply on the object |
define all the AbstractRoutine linked to a given lorentz structure symmetry authorizes to use the symmetry of anoter lorentz structure. routines to define only a subset of the routines. |
define all the AbstractRoutine linked to a given lorentz structure symmetry authorizes to use the symmetry of anoter lorentz structure. routines to define only a subset of the routines. Compare to compute_aloha, each routines are computed independently. |
Search some symmetries in the vertices. We search if some identical particles are in a vertices in order to avoid to compute symmetrical contributions |
Search the interaction associate with more than one lorentz structure. If those lorentz structure have the same order and the same color then associate a multiple lorentz routines to ALOHA |
This returns out if no symmetries are available, otherwise it finds the lowest equivalent outgoing by recursivally calling this function. auth is a list of authorize output, if define |
Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Tue Jul 24 08:02:10 2012 | http://epydoc.sourceforge.net |