/** Build an ordered list of intervals representing the instance. * <p>This method builds this intervals set as an ordered list of * {@link Interval Interval} elements. If the intervals set has no * lower limit, the first interval will have its low bound equal to * {@code Double.NEGATIVE_INFINITY}. If the intervals set has * no upper limit, the last interval will have its upper bound equal * to {@code Double.POSITIVE_INFINITY}. An empty tree will * build an empty list while a tree representing the whole real line * will build a one element list with both bounds being * infinite.</p> * @return a new ordered list containing {@link Interval Interval} * elements */ public List<Interval> asList() { final List<Interval> list = new ArrayList<Interval>(); for (final double[] a : this) { list.add(new Interval(a[0], a[1])); } return list; }
/** Build an ordered list of intervals representing the instance. * <p>This method builds this intervals set as an ordered list of * {@link Interval Interval} elements. If the intervals set has no * lower limit, the first interval will have its low bound equal to * {@code Double.NEGATIVE_INFINITY}. If the intervals set has * no upper limit, the last interval will have its upper bound equal * to {@code Double.POSITIVE_INFINITY}. An empty tree will * build an empty list while a tree representing the whole real line * will build a one element list with both bounds being * infinite.</p> * @return a new ordered list containing {@link Interval Interval} * elements */ public List<Interval> asList() { final List<Interval> list = new ArrayList<Interval>(); for (final double[] a : this) { list.add(new Interval(a[0], a[1])); } return list; }
likMax = likelihood; return new Interval(lowMax, Math.min(end, alphaMax + step));
likMax = likelihood; return new Interval(lowMax, Math.min(end, alphaMax + step));