/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.apache.giraph.types.heaps;

import org.junit.Assert;
import org.junit.Test;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

// AUTO-GENERATED class via class:
// org.apache.giraph.generate.GeneratePrimitiveClasses

public class TestFixedCapacityIntLongMinHeap {
  @Test
  public void testHeap() {
    int heapCapacity = 5;
    FixedCapacityIntLongMinHeap heap =
        new FixedCapacityIntLongMinHeap(heapCapacity);
    int[] keys = new int[]{0, 1, 0, 10, 20, 0, 3, 4};
    long[] values = new long[]{
        0, 1, 2, 2, 2,
        3, 3, 4};

    List<Integer> positions = new ArrayList<>();
    for (int i = 0; i < keys.length; i++) {
      positions.add(i);
    }
    Collections.shuffle(positions);
    for (Integer position : positions) {
      heap.add(keys[position], values[position]);
    }

    for (int i = keys.length - heapCapacity; i < keys.length; i++) {
      Assert.assertEquals(heap.size(), heapCapacity);
      Assert.assertEquals(heap.getMinKey(), keys[i]);
      Assert.assertEquals(heap.getMinValue(), values[i]);
      heap.removeMin();
      heapCapacity--;
    }
    Assert.assertTrue(heap.isEmpty());
  }
}
