Skip to content
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

Lattice implementation for tuples #359

Merged
merged 1 commit into from
Mar 13, 2022

Conversation

frankmcsherry
Copy link
Member

Implement Lattice for tuples. Appears to require the introduction of a Maximum trait, for bounded sets, on account of meet for lexicographic pairs appears to require it (as join appears to require minimum(), which we already have from Timestamp).

@frankmcsherry frankmcsherry merged commit 27492f2 into TimelyDataflow:master Mar 13, 2022
antiguru pushed a commit to antiguru/differential-dataflow that referenced this pull request May 11, 2022
This was referenced Oct 29, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant