• Home
• us.ihmc
• ihmc-commons-test
• 0.30.5
• source code
• RecyclingArrayDequeTest.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

us.ihmc.commons.lists.RecyclingArrayDequeTest Maven / Gradle / Ivy

package us.ihmc.commons.lists;

import org.apache.commons.lang3.mutable.MutableInt;
import org.junit.jupiter.api.Test;
import org.junit.jupiter.api.parallel.Execution;
import org.junit.jupiter.api.parallel.ExecutionMode;

import java.util.Collections;

import static org.junit.jupiter.api.Assertions.*;

@Execution(ExecutionMode.SAME_THREAD)
public class RecyclingArrayDequeTest
{
   @Test
   public void testConstructors()
   {
      RecyclingArrayDeque queue = new RecyclingArrayDeque(MutableInt::new, MutableInt::setValue);
      assertTrue(queue.isEmpty());
      assertTrue(queue.pollLast() == null);

      queue = new RecyclingArrayDeque(MutableInt.class, MutableInt::setValue);
      assertTrue(queue.isEmpty());
      assertTrue(queue.pollLast() == null);

      queue = new RecyclingArrayDeque(10, MutableInt.class, MutableInt::setValue);
      assertTrue(queue.isEmpty());
      assertTrue(queue.pollLast() == null);

      queue = new RecyclingArrayDeque(10, MutableInt::new, MutableInt::setValue);
      assertTrue(queue.isEmpty());
      assertTrue(queue.pollLast() == null);
   }

   @Test
   public void testAddFirst()
   {
      RecyclingArrayDeque queue = new RecyclingArrayDeque(4, MutableInt::new, MutableInt::setValue);

      queue.addFirst().setValue(1);
      assertTrue(queue.size() == 1);
      queue.addLast().setValue(2);
   }

   @Test
   public void testPollFirst()
   {
      RecyclingArrayDeque queue = new RecyclingArrayDeque(4, MutableInt::new, MutableInt::setValue);
      queue.addLast().setValue(1);
      queue.addLast().setValue(2);
      queue.addLast().setValue(3);
      queue.addLast().setValue(4);

      assertTrue(queue.size() == 4);
      assertTrue(queue.pollFirst().getValue() == 1);
      assertTrue(queue.size() == 3);
      assertTrue(queue.pollFirst().getValue() == 2);
      assertTrue(queue.size() == 2);
      assertTrue(queue.pollFirst().getValue() == 3);
      assertTrue(queue.size() == 1);
      assertTrue(queue.pollFirst().getValue() == 4);
      assertTrue(queue.size() == 0);
   }

   @Test
   public void testPollLast()
   {
      RecyclingArrayDeque queue = new RecyclingArrayDeque(4, MutableInt::new, MutableInt::setValue);
      queue.addFirst().setValue(2);
      queue.addFirst().setValue(1);
      queue.addLast().setValue(3);
      queue.addLast().setValue(4);

      assertTrue(queue.size() == 4);
      assertTrue(queue.pollLast().getValue() == 4);
      assertTrue(queue.size() == 3);
      assertTrue(queue.pollLast().getValue() == 3);
      assertTrue(queue.size() == 2);
      assertTrue(queue.pollLast().getValue() == 2);
      assertTrue(queue.size() == 1);
      assertTrue(queue.pollLast().getValue() == 1);
      assertTrue(queue.size() == 0);
   }

   @Test
   public void testPeek()
   {
      RecyclingArrayDeque queue = new RecyclingArrayDeque(4, MutableInt::new, MutableInt::setValue);
      queue.addLast().setValue(3);
      queue.addLast().setValue(4);
      queue.addFirst().setValue(2);
      queue.addFirst().setValue(1);

      assertTrue(queue.peek().getValue() == 1);
      assertTrue(queue.peek().getValue() == 1);
      assertTrue(queue.pollFirst().getValue() == 1);
      assertTrue(queue.peek().getValue() == 2);
      assertTrue(queue.size() == 3);
   }

   @Test
   public void testPeekFirst()
   {
      //functionally identical to peek()
      RecyclingArrayDeque queue = new RecyclingArrayDeque(4, MutableInt::new, MutableInt::setValue);
      queue.addLast().setValue(3);
      queue.addFirst().setValue(2);
      queue.addLast().setValue(4);
      queue.addFirst().setValue(1);

      assertTrue(queue.peek().getValue() == 1);
      assertTrue(queue.peek().getValue() == 1);
      assertTrue(queue.pollFirst().getValue() == 1);
      assertTrue(queue.peek().getValue() == 2);
      assertTrue(queue.size() == 3);
   }

   @Test
   public void testPeekLast()
   {
      RecyclingArrayDeque queue = new RecyclingArrayDeque(4, MutableInt::new, MutableInt::setValue);
      queue.addFirst().setValue(4);
      queue.addFirst().setValue(3);
      queue.addFirst().setValue(2);
      queue.addFirst().setValue(1);

      assertTrue(queue.peekLast().getValue() == 4);
      assertTrue(queue.peekLast().getValue() == 4);
      assertTrue(queue.pollLast().getValue() == 4);
      assertTrue(queue.peekLast().getValue() == 3);
      assertTrue(queue.size() == 3);
   }

   @Test
   public void testRemoveFirst()
   {
      RecyclingArrayDeque queue = new RecyclingArrayDeque(4, MutableInt::new, MutableInt::setValue);
      queue.addFirst().setValue(4);
      queue.addFirst().setValue(3);
      queue.addFirst().setValue(2);
      queue.addFirst().setValue(1);

      assertTrue(queue.removeFirst().getValue() == 1);
      assertTrue(queue.removeFirst().getValue() == 2);
      assertTrue(queue.removeFirst().getValue() == 3);
      assertTrue(queue.removeFirst().getValue() == 4);
   }

   @Test
   public void testRemove()
   {
      // identical to remove first
      RecyclingArrayDeque queue = new RecyclingArrayDeque(4, MutableInt::new, MutableInt::setValue);
      queue.addFirst().setValue(4);
      queue.addFirst().setValue(3);
      queue.addFirst().setValue(2);
      queue.addFirst().setValue(1);

      assertTrue(queue.remove().getValue() == 1);
      assertTrue(queue.remove().getValue() == 2);
      assertTrue(queue.remove().getValue() == 3);
      assertTrue(queue.remove().getValue() == 4);
   }

   @Test
   public void testRemoveLast()
   {
      RecyclingArrayDeque queue = new RecyclingArrayDeque(4, MutableInt::new, MutableInt::setValue);
      queue.addFirst().setValue(4);
      queue.addFirst().setValue(3);
      queue.addFirst().setValue(2);
      queue.addFirst().setValue(1);

      assertTrue(queue.removeLast().getValue() == 4);
      assertTrue(queue.removeLast().getValue() == 3);
      assertTrue(queue.removeLast().getValue() == 2);
      assertTrue(queue.removeLast().getValue() == 1);
   }

   @Test
   public void testUnsupportedMethods()
   {
      RecyclingArrayDeque queue = new RecyclingArrayDeque(4, MutableInt::new, MutableInt::setValue);
      failIfSuccessful(queue::clone);
      failIfSuccessful(() -> queue.remove(new MutableInt()));
      failIfSuccessful(() -> queue.contains(new MutableInt()));
      failIfSuccessful(queue::iterator);
      failIfSuccessful(queue::toArray);
      failIfSuccessful(() -> queue.toArray(new MutableInt[0]));
      failIfSuccessful(() -> queue.containsAll(Collections.emptyList()));
      failIfSuccessful(() -> queue.addAll(Collections.emptyList()));
      failIfSuccessful(() -> queue.removeAll(Collections.emptyList()));
      failIfSuccessful(() -> queue.retainAll(Collections.emptyList()));
      failIfSuccessful(() -> queue.removeFirstOccurrence(new MutableInt()));
      failIfSuccessful(() -> queue.removeLastOccurrence(new MutableInt()));
      failIfSuccessful(() -> queue.offer(new MutableInt()));
      failIfSuccessful(queue::descendingIterator);
   }

   private void failIfSuccessful(Runnable runnable)
   {
      try
      {
         runnable.run();
         fail();
      }
      catch(Exception e)
      {
      }
   }
}