pylhe.LHEInitInfo

class pylhe.LHEInitInfo(beamA: int, beamB: int, energyA: float, energyB: float, PDFgroupA: int, PDFgroupB: int, PDFsetA: int, PDFsetB: int, weightingStrategy: int, numProcesses: int)

Bases: DictCompatibility

Store the first line of the <init> block as a dataclass.

__init__(beamA: int, beamB: int, energyA: float, energyB: float, PDFgroupA: int, PDFgroupB: int, PDFsetA: int, PDFsetB: int, weightingStrategy: int, numProcesses: int) → None

Methods

__init__(beamA, beamB, energyA, energyB, ...)
clear()
fromstring(string)	Create an LHEInitInfo instance from a string in LHE format.
get(k[,d])
items()
keys()
pop(k[,d])	If key is not found, d is returned if given, otherwise KeyError is raised.
popitem()	as a 2-tuple; but raise KeyError if D is empty.
setdefault(k[,d])
tolhe()	Return the init info block as a string in LHE format.
update([E, ]**F)	If E present and has a .keys() method, does: for k in E.keys(): D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v
values()

Attributes

fieldnames	Return the fieldnames.
beamA	Beam A PDG ID
beamB	Beam B PDG ID
energyA	Beam A energy
energyB	Beam B energy
PDFgroupA	PDF group for beam A
PDFgroupB	PDF group for beam B
PDFsetA	PDF set for beam A
PDFsetB	PDF set for beam B
weightingStrategy	Weighting strategy
numProcesses	Number of processes

PDFgroupA: int

PDF group for beam A

PDFgroupB: int

PDF group for beam B

PDFsetA: int

PDF set for beam A

PDFsetB: int

PDF set for beam B

beamA: int

Beam A PDG ID

beamB: int

Beam B PDG ID

clear() → None.  Remove all items from D.

energyA: float

Beam A energy

energyB: float

Beam B energy

property fieldnames: list[str]

Return the fieldnames.

For backward compatibility with versions < 1.0.0.

Deprecated since version 1.0.0: Listing fieldnames via object.fieldnames is deprecated and will be removed in a future version.

classmethod fromstring(string: str) → LHEInitInfo

Create an LHEInitInfo instance from a string in LHE format.

get(k[, d]) → D[k] if k in D, else d.  d defaults to None.

items() → a set-like object providing a view on D's items

keys() → a set-like object providing a view on D's keys

numProcesses: int

Number of processes

pop(k[, d]) → v, remove specified key and return the corresponding value.

If key is not found, d is returned if given, otherwise KeyError is raised.

popitem() → (k, v), remove and return some (key, value) pair

as a 2-tuple; but raise KeyError if D is empty.

setdefault(k[, d]) → D.get(k,d), also set D[k]=d if k not in D

tolhe() → str

Return the init info block as a string in LHE format.

Returns:

str: The init info block as a string in LHE format.

update([E, ]**F) → None.  Update D from mapping/iterable E and F.

If E present and has a .keys() method, does: for k in E.keys(): D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v

values() → an object providing a view on D's values

weightingStrategy: int

Weighting strategy