This project has retired. For details please refer to its Attic page.
TestFixedCapacityIntLongMinHeap xref
View Javadoc

1   /*
2    * Licensed to the Apache Software Foundation (ASF) under one
3    * or more contributor license agreements.  See the NOTICE file
4    * distributed with this work for additional information
5    * regarding copyright ownership.  The ASF licenses this file
6    * to you under the Apache License, Version 2.0 (the
7    * "License"); you may not use this file except in compliance
8    * with the License.  You may obtain a copy of the License at
9    *
10   *     http://www.apache.org/licenses/LICENSE-2.0
11   *
12   * Unless required by applicable law or agreed to in writing, software
13   * distributed under the License is distributed on an "AS IS" BASIS,
14   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15   * See the License for the specific language governing permissions and
16   * limitations under the License.
17   */
18  
19  package org.apache.giraph.types.heaps;
20  
21  import org.junit.Assert;
22  import org.junit.Test;
23  
24  import java.util.ArrayList;
25  import java.util.Collections;
26  import java.util.List;
27  
28  // AUTO-GENERATED class via class:
29  // org.apache.giraph.generate.GeneratePrimitiveClasses
30  
31  public class TestFixedCapacityIntLongMinHeap {
32    @Test
33    public void testHeap() {
34      int heapCapacity = 5;
35      FixedCapacityIntLongMinHeap heap =
36          new FixedCapacityIntLongMinHeap(heapCapacity);
37      int[] keys = new int[]{0, 1, 0, 10, 20, 0, 3, 4};
38      long[] values = new long[]{
39          0, 1, 2, 2, 2,
40          3, 3, 4};
41  
42      List<Integer> positions = new ArrayList<>();
43      for (int i = 0; i < keys.length; i++) {
44        positions.add(i);
45      }
46      Collections.shuffle(positions);
47      for (Integer position : positions) {
48        heap.add(keys[position], values[position]);
49      }
50  
51      for (int i = keys.length - heapCapacity; i < keys.length; i++) {
52        Assert.assertEquals(heap.size(), heapCapacity);
53        Assert.assertEquals(heap.getMinKey(), keys[i]);
54        Assert.assertEquals(heap.getMinValue(), values[i]);
55        heap.removeMin();
56        heapCapacity--;
57      }
58      Assert.assertTrue(heap.isEmpty());
59    }
60  }