tree module

class tree.HyperCube(boundaries, mismatch, constraint_func=<function mass_sym_constraint>, metric=None, metric_tensor=None, det=None)

Bases: object

N()

coord_volume()

dl(mismatch)

match(other)

num_templates(mismatch)

num_tmps_per_side(mismatch)

split(dim, reuse_metric=False)

template_volume(mismatch)

tile(mismatch, stochastic=False)

volume(metric_tensor=None)

class tree.Node(cube, parent=None, boundary=None)

Bases: object

A Node implements a node in a binary tree decomposition of the parameter space. A node is a container for one hypercube. It can have sub-nodes that split the hypercube.

bad_aspect_count = [0]

leafnodes(out=None)

Return a list of all leaf nodes that are ancestors of the given node and whose bounding box is not fully contained in the symmetryic region.

split(split_num_templates, mismatch, bifurcation=0, verbose=True, metric_tol=0.1, max_coord_vol=10.0)

template_count = [1]

tree.mass_sym_constraint(vertices, mass_ratio=inf, total_mass=inf)

tree.mass_sym_constraint_mc(vertices, mass_ratio=inf, total_mass=inf, minmax_m1=(0, inf), minmax_m2=(0, inf), minmax_mc=(0, inf))

tree.packing_density(n)

tree.uber_constraint(vertices, mtotal=100, ns_spin=0.05)