gen_times_rawab

mutis.lib.gen_times_rawab(t1, t2, dt0=None, ndtmax=1.0, nbinsmin=121, force=None)

LEGACY. Returns t, dt for use with adaptative binning methods.

Uses a shitty algorithm to find a time binning in which each bin contains a minimum of points (specified by nbinsmin, with an starting bin size (dt0) and a maximum bin size (ndtmax*dt0).

The algorithms start at the first time bin, and enlarges the bin size until it has enough points or it reaches the maximum length, then creates another starting at that point.

If force is True, then it discards the created bins on which there are not enough points.