github.com/unigraph-dev/dgraph@v1.1.1-0.20200923154953-8b52b426f765/algo/heap_test.go (about)

     1  /*
     2   * Copyright 2016-2018 Dgraph Labs, Inc. and Contributors
     3   *
     4   * Licensed under the Apache License, Version 2.0 (the "License");
     5   * you may not use this file except in compliance with the License.
     6   * You may obtain a copy of the License at
     7   *
     8   *     http://www.apache.org/licenses/LICENSE-2.0
     9   *
    10   * Unless required by applicable law or agreed to in writing, software
    11   * distributed under the License is distributed on an "AS IS" BASIS,
    12   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    13   * See the License for the specific language governing permissions and
    14   * limitations under the License.
    15   */
    16  
    17  package algo
    18  
    19  import (
    20  	"container/heap"
    21  	"testing"
    22  
    23  	"github.com/stretchr/testify/require"
    24  )
    25  
    26  func TestPush(t *testing.T) {
    27  	h := &uint64Heap{}
    28  	heap.Init(h)
    29  
    30  	e := elem{val: 5}
    31  	heap.Push(h, e)
    32  	e.val = 3
    33  	heap.Push(h, e)
    34  	e.val = 4
    35  	heap.Push(h, e)
    36  
    37  	require.Equal(t, h.Len(), 3)
    38  	require.EqualValues(t, (*h)[0].val, 3)
    39  
    40  	e.val = 10
    41  	(*h)[0] = e
    42  	heap.Fix(h, 0)
    43  	require.EqualValues(t, (*h)[0].val, 4)
    44  
    45  	e.val = 11
    46  	(*h)[0] = e
    47  	heap.Fix(h, 0)
    48  	require.EqualValues(t, (*h)[0].val, 5)
    49  
    50  	e = heap.Pop(h).(elem)
    51  	require.EqualValues(t, e.val, 5)
    52  
    53  	e = heap.Pop(h).(elem)
    54  	require.EqualValues(t, e.val, 10)
    55  
    56  	e = heap.Pop(h).(elem)
    57  	require.EqualValues(t, e.val, 11)
    58  
    59  	require.Equal(t, h.Len(), 0)
    60  }