// Path: src/main/java/org/jheaps/DoubleEndedHeap.java
// public interface DoubleEndedHeap<K> extends Heap<K> {
// 
//     /**
//      * Find an element with the maximum key.
//      *
//      * @return an element with the maximum key
//      * @throws NoSuchElementException
//      *             if the heap is empty
//      */
//     K findMax();
// 
//     /**
//      * Delete and return an element with the maximum key. If multiple such
//      * elements exists, only one of them will be deleted.
//      *
//      * @return the deleted element with the maximum key
//      * @throws NoSuchElementException
//      *             if the heap is empty
//      */
//     K deleteMax();
// 
// }


import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import java.util.Comparator;
import java.util.NoSuchElementException;
import java.util.Random;
import org.jheaps.DoubleEndedHeap;
import org.junit.Test;
/*
 * (C) Copyright 2014-2016, by Dimitrios Michail
 *
 * JHeaps Library
 * 
 * Licensed 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.jheaps.tree;




public abstract class AbstractDoubleEndedHeapTest extends AbstractComparatorLongHeapTest {

	@Override
// Path: src/main/java/org/jheaps/DoubleEndedHeap.java
// public interface DoubleEndedHeap<K> extends Heap<K> {
// 
//     /**
//      * Find an element with the maximum key.
//      *
//      * @return an element with the maximum key
//      * @throws NoSuchElementException
//      *             if the heap is empty
//      */
//     K findMax();
// 
//     /**
//      * Delete and return an element with the maximum key. If multiple such
//      * elements exists, only one of them will be deleted.
//      *
//      * @return the deleted element with the maximum key
//      * @throws NoSuchElementException
//      *             if the heap is empty
//      */
//     K deleteMax();
// 
// }


// Path: src/test/java/org/jheaps/tree/AbstractDoubleEndedHeapTest.java
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import java.util.Comparator;
import java.util.NoSuchElementException;
import java.util.Random;
import org.jheaps.DoubleEndedHeap;
import org.junit.Test;

/*
 * (C) Copyright 2014-2016, by Dimitrios Michail
 *
 * JHeaps Library
 * 
 * Licensed 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.jheaps.tree;




public abstract class AbstractDoubleEndedHeapTest extends AbstractComparatorLongHeapTest {

	@Override
	protected abstract DoubleEndedHeap<Long> createHeap();