code></a> elements. If the intervals set has no
 lower limit, the first interval will have its low bound equal to
 <code>Double.NEGATIVE_INFINITY</code>. If the intervals set has
 no upper limit, the last interval will have its upper bound equal
 to <code>Double.POSITIVE_INFINITY</code>. 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></div>
<dl><dt><span class="strong">Returns:</span></dt><dd>a new ord