Skip to content

container/heap: use sort.Interface where possible #65967

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

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

EdSchouten
Copy link

@EdSchouten EdSchouten commented Feb 27, 2024

Functions heap.Pop(), heap.Push() and heap.Remove() use type
heap.Interface. This type is equal to sort.Interface, with Push() and
Pop() methods added. This is necessary, because these functions affect
the size of the resulting heap.

Functions heap.Fix() and heap.Init() are different. They may compare and
swap elements in the underlying container, but never alter its size. It
is therefore possible to just use sort.Interface. This would make these
functions a lot more pleasant to use in situations where you know the
number of elements in the heap is fixed.

Consider the case where you use these functions to merge the results of
n infinitely long monotonically increasing sequences. For example, logs
received from multiple sources that need to be turned into a single
stream of events sorted by time. This can now be implemented as follows:

type Value ...
type Sequence <-chan Value

type PeekedSequence struct {
        First     Value
        Remainder Sequence
}

type SequenceHeap []PeekedSequence

func (h SequenceHeap) Len() int           { return len(h) }
func (h SequenceHeap) Less(i, j int) bool { return h[i].First < h[j].First }
func (h SequenceHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func MergeSequences(sequences []Sequence, out chan<- Value) {
        h := make(SequenceHeap, 0, len(sequences))
        for _, s := range sequences {
                h = append(h, PeekedSequence{
                        First:     <-s,
                        Remainder: s,
                })
        }
        heap.Init(h)
        for {
                out <- h[0].First
                h[0].First = <-h[0].Remainder
                heap.Fix(h, 0)
        }
}

Functions heap.Pop(), heap.Push() and heap.Remove() use type
heap.Interface. This type is equal to sort.Interface, with Push() and
Pop() methods added. This is necessary, because these functions affect
the size of the resulting heap.

Functions heap.Fix() and heap.Init() are different. They may compare and
swap elements in the underlying container, but never alter its size. It
is therefore possible to just use sort.Interface. This would make these
functions a lot more pleasant to use in situations where you know the
number of elements in the heap is fixed.

Consider the case where you use these functions to merge the results of
n infinitely long monotonically increasing sequences. For example, logs
received from multiple sources that need to be turned into a single
stream of events sorted by time. This can now be implemented as follows:

    type Value ...
    type Sequence <-chan Value

    type PeekedSequence struct {
            First     Value
            Remainder Sequence
    }

    type SequenceHeap []PeekedSequence

    func (h SequenceHeap) Len() int           { return len(h) }
    func (h SequenceHeap) Less(i, j int) bool { return h[i].First < h[j].First }
    func (h SequenceHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

    func MergeSequences(sequences []Sequence, out chan<- Value) {
            h := make(SequenceHeap, 0, len(sequences))
            for _, s := range sequences {
                    h = append(h, PeekedSequence{
                            First:     <-s,
                            Remainder: s,
                    })
            }
            heap.Init(h)
            for {
                    out <- h[0].First
                    h[0].First = <-h[0].Remainder
                    heap.Fix(h, 0)
            }
    }

Before this change was made, SequenceHeap had to provide Pop() and
Push() methods that are known to be unused.
@gopherbot
Copy link
Contributor

This PR (HEAD: cff8a71) has been imported to Gerrit for code review.

Please visit Gerrit at https://go-review.googlesource.com/c/go/+/567475.

Important tips:

  • Don't comment on this PR. All discussion takes place in Gerrit.
  • You need a Gmail or other Google account to log in to Gerrit.
  • To change your code in response to feedback:
    • Push a new commit to the branch used by your GitHub PR.
    • A new "patch set" will then appear in Gerrit.
    • Respond to each comment by marking as Done in Gerrit if implemented as suggested. You can alternatively write a reply.
    • Critical: you must click the blue Reply button near the top to publish your Gerrit responses.
    • Multiple commits in the PR will be squashed by GerritBot.
  • The title and description of the GitHub PR are used to construct the final commit message.
    • Edit these as needed via the GitHub web interface (not via Gerrit or git).
    • You should word wrap the PR description at ~76 characters unless you need longer lines (e.g., for tables or URLs).
  • See the Sending a change via GitHub and Reviews sections of the Contribution Guide as well as the FAQ for details.

@gopherbot
Copy link
Contributor

Message from Gopher Robot:

Patch Set 1:

(1 comment)


Please don’t reply on this GitHub thread. Visit golang.org/cl/567475.
After addressing review feedback, remember to publish your drafts!

@gopherbot
Copy link
Contributor

Message from Robert Griesemer:

Patch Set 2:

(1 comment)


Please don’t reply on this GitHub thread. Visit golang.org/cl/567475.
After addressing review feedback, remember to publish your drafts!

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.

2 participants