How to use

DoubleLinkedIntListItem

in

jsettlers.common.utils.collections.list

public ListMinBucketQueue(int maxNumberOfIds) {
  this.buckets = DoubleLinkedList.getArray(NUMBER_OF_BUCKETS);
  this.handles = new DoubleLinkedIntListItem[maxNumberOfIds];
  for (int i = 0; i < maxNumberOfIds; i++) {
    handles[i] = new DoubleLinkedIntListItem(i);
  }
}

@Test
public void testIteratorLoop() {
  for (int i = 0; i < TEST_NUMBERS; i++) {
    list.pushEnd(new DoubleLinkedIntListItem(i));
  }
  int i = 0;
  for (DoubleLinkedIntListItem curr : list) {
    assertEquals(i, curr.value);
    i++;
  }
}

@Test
public void testSerialization() throws IOException, ClassNotFoundException {
  for (int i = 0; i < TEST_NUMBERS; i++) {
    list.pushEnd(new DoubleLinkedIntListItem(i));
  }
  DoubleLinkedList<DoubleLinkedIntListItem> readList = TestUtils.serializeAndDeserialize(list);
  assertListEquals(list, readList);
}

@Test
public void testIteratorRemove() {
  for (int i = 0; i < TEST_NUMBERS; i++) {
    list.pushEnd(new DoubleLinkedIntListItem(i));
  }
  int i = 0;
  Iterator<DoubleLinkedIntListItem> iter = list.iterator();
  while (iter.hasNext()) {
    assertEquals(i, iter.next().value);
    iter.remove();
    i++;
  }
  assertEquals(TEST_NUMBERS, i);
  assertEquals(0, list.size());
  assertTrue(list.isEmpty());
  assertFalse(list.iterator().hasNext());
}

@Test
public void testIteratorRemoveHalf() {
  for (int i = 0; i < TEST_NUMBERS; i++) {
    list.pushEnd(new DoubleLinkedIntListItem(i));
  }
  int i = 0;
  Iterator<DoubleLinkedIntListItem> iter = list.iterator();
  while (iter.hasNext()) {
    DoubleLinkedIntListItem curr = iter.next();
    assertEquals(i, curr.value);
    if (curr.value % 2 == 0) {
      iter.remove();
    }
    i++;
  }
  assertEquals(TEST_NUMBERS / 2, list.size());
  assertTrue(list.iterator().hasNext());
  i = 1;
  for (DoubleLinkedIntListItem curr : list) {
    assertEquals(i, curr.value);
    i += 2;
  }
}

@Test
public void testMerge() {
  DoubleLinkedList<DoubleLinkedIntListItem> list2 = new DoubleLinkedList<>();
  for (int i = 0; i < TEST_NUMBERS; i++) {
    list.pushEnd(new DoubleLinkedIntListItem(i));
    list2.pushEnd(new DoubleLinkedIntListItem(i));
  }
  list2.mergeInto(list);
  assertEquals(0, list2.size());
  assertEquals(TEST_NUMBERS * 2, list.size());
  assertEquals(list2.head, ((DoubleLinkedListItem<DoubleLinkedIntListItem>) list2.head).next);
  assertEquals(list2.head, ((DoubleLinkedListItem<DoubleLinkedIntListItem>) list2.head).prev);
  int i = 0;
  for (DoubleLinkedIntListItem curr : list) {
    assertEquals(i % TEST_NUMBERS, curr.value);
    i++;
  }
}

@Test
public void testPushFrontAndPopFrontWithClear() {
  for (int i = 0; i < TEST_NUMBERS; i++) {
    list.pushFront(new DoubleLinkedIntListItem(i));
  }
  assertEquals(TEST_NUMBERS, list.size());
  list.clear();
  assertEquals(0, list.size());
  testPushFrontAndPopFront();
}

@Test
public void testPushEndAndPopFrontWithClear() {
  for (int i = 0; i < TEST_NUMBERS; i++) {
    list.pushEnd(new DoubleLinkedIntListItem(i));
  }
  assertEquals(TEST_NUMBERS, list.size());
  list.clear();
  assertEquals(0, list.size());
  testPushEndAndPopFront();
}

@Test
public void testPushFrontAndPopFront() {
  assertEquals(0, list.size());
  for (int i = 0; i < TEST_NUMBERS; i++) {
    list.pushFront(new DoubleLinkedIntListItem(i));
    assertEquals(i + 1, list.size());
  }
  for (int i = TEST_NUMBERS - 1; i >= 0; i--) {
    assertEquals(i + 1, list.size());
    assertEquals(i, list.popFront().value);
  }
  assertEquals(0, list.size());
}

@Test
public void testPushEndAndPopFront() {
  assertEquals(0, list.size());
  for (int i = 0; i < TEST_NUMBERS; i++) {
    list.pushEnd(new DoubleLinkedIntListItem(i));
    assertEquals(i + 1, list.size());
  }
  for (int i = 0; i < TEST_NUMBERS; i++) {
    assertEquals(10 - i, list.size());
    assertEquals(i, list.popFront().value);
  }
  assertEquals(0, list.size());
}

@Test
public void testRemoveByHandle() {
  DoubleLinkedIntListItem handles[] = new DoubleLinkedIntListItem[TEST_NUMBERS];
  for (int i = 0; i < TEST_NUMBERS; i++) {
    handles[i] = new DoubleLinkedIntListItem(i);
    list.pushFront(handles[i]);
  }
  list.remove(handles[4]);
  list.remove(handles[7]);
  assertEquals("incorrect size after removing 2 values", TEST_NUMBERS - 2, list.size());
  assertNull("the removed item should not hold a 'next' reference", handles[4].next);
  assertNull("the removed item should not hold a 'prev' reference", handles[4].prev);
  assertNull("the removed item should not hold a 'next' reference", handles[7].next);
  assertNull("the removed item should not hold a 'prev' reference", handles[7].prev);
  for (int i = TEST_NUMBERS - 1; i >= 0; i--) {
    if (i == 4 || i == 7) { // skip the removed values
      continue;
    }
    assertEquals(i, list.popFront().value);
  }
  assertEquals("incorrect size after popFront all values", 0, list.size());
}