Hard Backpressure

Window Processing

Create a Flux of 1 through 9 and use window(3) to split it into windows of 3. For each window, collect to a list and print it.

window(n) splits the Flux into sub-Flux publishers of size n (unlike buffer which creates Lists).

Expected

[1, 2, 3]
[4, 5, 6]
[7, 8, 9]

Previous Next

Main.kt

Window Processing

hard⏱ 15 minkotlinreactorchallengebackpressure

Create a Flux of 1 through 9 and use window(3) to split it into windows of 3. For each window, collect to a list and print it.

window(n) splits the Flux into sub-Flux publishers of size n (unlike buffer which creates Lists).

Why this works

window(n) groups elements into sub-Flux publishers of size n. Unlike buffer() which produces Lists, window() produces Flux<Flux<T>>. You typically flatMap each window to process it.

Expected output

[1, 2, 3]
[4, 5, 6]
[7, 8, 9]

Reactor Challenges/Backpressure

Hard Backpressure

Window Processing

Create a Flux of 1 through 9 and use window(3) to split it into windows of 3. For each window, collect to a list and print it.

window(n) splits the Flux into sub-Flux publishers of size n (unlike buffer which creates Lists).

Expected

[1, 2, 3]
[4, 5, 6]
[7, 8, 9]

Previous Next

Main.kt

Window Processing

hard⏱ 15 minkotlinreactorchallengebackpressure

Create a Flux of 1 through 9 and use window(3) to split it into windows of 3. For each window, collect to a list and print it.

window(n) splits the Flux into sub-Flux publishers of size n (unlike buffer which creates Lists).

Why this works

window(n) groups elements into sub-Flux publishers of size n. Unlike buffer() which produces Lists, window() produces Flux<Flux<T>>. You typically flatMap each window to process it.

Expected output

[1, 2, 3]
[4, 5, 6]
[7, 8, 9]