BufferWithSize with Backpressure Support

[zsxwing]

For #1479

[cloudbees-pull-request-builder]

RxJava-pull-requests #1433 SUCCESS
This pull request looks good

[benjchristensen]

This could theoretically be larger than Long.MAX_VALUE

[cloudbees-pull-request-builder]

RxJava-pull-requests #1463 SUCCESS
This pull request looks good

[davidmoten]

isn't that potentially more than required? The number required is exactly skip * (n-1) + count isn't it?

[zsxwing]

The number of the first request is count + skip * (n - 1). The number of other requests should be skip * n.
Assume we receive two request n1 and n2, then we should request count + skip * (n1 + n2 - 1) totally. When we receive the request n2, because we already requested count + skip * (n1 - 1), we should request the remain number: count + skip * (n1 + n2 - 1) - (count + skip * (n1 - 1)) = skip * n2.

[davidmoten]

Gotcha, thanks
On 1 Aug 2014 21:08, "Shixiong Zhu" notifications@github.com wrote:

The number of the first request is count + skip * (n - 1). The number of
other requests should be skip * n.
Assume we receive two request n1 and n2, then we should request count +
skip * (n1 + n2 - 1) totally. When we receive the request n2, because we
already request count + skip * (n1 - 1), we should request the remain
number: count + skip * (n1 + n2 - 1) - count + skip * (n1 - 1) = skip * n2
.

—
Reply to this email directly or view it on GitHub
#1507 (comment).

[benjchristensen]

Thank you.