.
<DD><code>lowInclusive</code> - if low boundary is inclusive or not
<DD><code>high</code> - high boundary for key value,  if Null than there is no high boundary.
<DD><code>highInclusive</code> - if high boundary is inclusive or not
<DD><code>ascent</code> - iteration order: if <code>true</code>, then objects will be traversed in key ascending order
<DT><B>Returns</B>
<DD>Usually this method returns iterator object, but in some languages it is possible to pass block of code which
will be executed for each 