[
https://issues.apache.org/jira/browse/OAK-1930?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14200672#comment-14200672
]
Alexander Klimetschek commented on OAK-1930:
--------------------------------------------
IMO this would just be convenience. Since Oak does a full lazy iteration, an
application can do this by just iterating (and skipping) as far as it wants. Or
is getSize(N) significantly faster than iterating through the result up to N?
> New method RangeIterator.getSize(int max)
> -----------------------------------------
>
> Key: OAK-1930
> URL: https://issues.apache.org/jira/browse/OAK-1930
> Project: Jackrabbit Oak
> Issue Type: New Feature
> Components: core, jcr, query
> Affects Versions: 1.0
> Reporter: Thomas Mueller
> Assignee: Thomas Mueller
> Fix For: 1.2
>
>
> The method RangeIterator.getSize() is part of the JCR API, and returns the
> number of items, but can also return -1 if not known.
> Currently, Oak doesn't return -1, but counts the items. This is slow
> (potentially very slow) if there are many items, for example, in a query
> result.
> I propose to add a new method RangeIterator.getSize(long max) that limits
> counting the entries. That way, an application can use a reasonable limit,
> and Oak doesn't need to count.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
