Skip to content

doc: ordered processing end-to-end example #3328

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.

Sign up for GitHub

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

Merged
vigith merged 1 commit into from
Mar 23, 2026
Merged

doc: ordered processing end-to-end example #3328

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 9 additions & 0 deletions docs/user-guide/reference/ordered-processing.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -208,3 +208,12 @@ strict in-order guarantees.
- Source vertices (`in-1`, `in-2`) always preserve input order and require no extra configuration.
- Because `in-1` and `in-2` both feed into `cat` (a join), messages from the two sources are interleaved at `cat`.
Order preservation holds within each source's stream, not across the two sources.


### Complete Example

For a more complete example that combines ordered processing with event-time sorting, see
[ordered-stream-processing](https://github.com/numaproj/numaflow-rs/tree/main/examples/ordered-stream-processing)
in the Rust SDK. That example uses an accumulator to sort out-of-order events by event time, then feeds them through
partitioned map and sink vertices with ordered processing enabled, demonstrating both temporal and spatial ordering
working together.
Loading