Because of the presence of encounter-order-sensitive stream operations like limit, computation trees can get quite deep even if the user only wants the first few elements. The range spliterators should, for large ranges, right-bias the split so that rather splitting into two equal huge chunks, it splits off a merely large chunk instead.