-
Notifications
You must be signed in to change notification settings - Fork 11.7k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add paginated lookups for EnumerableSet and EnumerableMap #4909
Comments
Note, if we implement this, I think we should follow a pagination system similar to graphQL It would return an array of length between 0 and N. If the returned array length is smaller than N, the caller knows there is no more data. If the returned array length is N, then there may or may not be more data to fetch. In that case the caller needs to do another call, moving the offset P by N to get ne next elements. |
I don't see a good use case other for very specific cases of on-chain pagination. But they're unclear to me.
If we're doing this, the larger discussion may be if we rather implement offset-based pagination or other. I think both have different properties but we need the concrete use cases to decide between them. |
Proposed in #4907.
Usecases need to be evaluated.
The text was updated successfully, but these errors were encountered: