You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Note, if we implement this, I think we should follow a pagination system similar to graphQL first & skip or the SQL offset & limit, where you request N entries start at index P.
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.
Note, if we implement this, I think we should follow a pagination system similar to graphQL first & skip or the SQL offset & limit, where you request N entries start at index P.
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: