Skip to content

Conversation

@tlively
Copy link
Member

@tlively tlively commented Oct 27, 2023

The elements of Array<L, N> lattice are arrays of length N of elements of
L, compared pairwise with each other. This lattice is a concrete
implementation of what would be written L^N with pen and paper.

return getTopImpl(std::make_index_sequence<N>());
}

// `a` <= `b` if their elements are pairwise <=, etc.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Maybe stress that this is not the same as dictionary sorting (which would stop at the first difference)?

Base automatically changed from joinee-joiner to main October 30, 2023 20:27
The elements of `Array<L, N>` lattice are arrays of length `N` of elements of
`L`, compared pairwise with each other. This lattice is a concrete
implementation of what would be written L^N with pen and paper.
@tlively
Copy link
Member Author

tlively commented Oct 31, 2023

Merge activity

  • Oct 30, 10:45 PM: @tlively started a stack merge that includes this pull request via Graphite.
  • Oct 30, 10:45 PM: @tlively merged this pull request with Graphite.

@tlively tlively merged commit bdc8b4d into main Oct 31, 2023
@tlively tlively deleted the array-lattice branch October 31, 2023 02:45
radekdoulik pushed a commit to dotnet/binaryen that referenced this pull request Jul 12, 2024
The elements of `Array<L, N>` lattice are arrays of length `N` of elements of
`L`, compared pairwise with each other. This lattice is a concrete
implementation of what would be written L^N with pen and paper.
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.

3 participants