1 files changed, 189 insertions, 0 deletions
diff --git a/tests/check/libs/queuearray.c b/tests/check/libs/queuearray.c
index ca5024b..b8fac2b 100644
--- a/tests/check/libs/queuearray.c
+++ b/tests/check/libs/queuearray.c
@@ -226,6 +226,192 @@ GST_START_TEST (test_array_grow_end)
 
 GST_END_TEST;
 
+static int
+compare_pointer_value (gconstpointer a, gconstpointer b)
+{
+  return (int) ((guintptr) a - (guintptr) b);
+}
+
+GST_START_TEST (test_array_find)
+{
+  GstQueueArray *array;
+  guint i;
+  guint index;
+
+  guint random_initial = g_random_int_range (10, 100);
+  guint value_to_find = 5;
+
+  /* Create an array of initial size 10 */
+  array = gst_queue_array_new (10);
+  fail_unless_equals_int (array->size, 10);
+
+  while (random_initial--) {
+    gst_queue_array_push_tail (array, GINT_TO_POINTER (g_random_int ()));
+    gst_queue_array_pop_head (array);
+  }
+
+  /* push 10 values in */
+  for (i = 0; i < 10; i++)
+    gst_queue_array_push_tail (array, GINT_TO_POINTER (i));
+
+  fail_unless_equals_int (array->length, 10);
+  fail_unless_equals_int (array->size, 10);
+
+  index =
+      gst_queue_array_find (array, compare_pointer_value,
+      GINT_TO_POINTER (value_to_find));
+  fail_if (index == -1);
+  fail_unless_equals_int (value_to_find, GPOINTER_TO_INT (array->array[index]));
+
+  /* push 10 values in */
+  for (i = 0; i < 10; i++)
+    gst_queue_array_pop_head (array);
+
+  index =
+      gst_queue_array_find (array, compare_pointer_value,
+      GINT_TO_POINTER (value_to_find));
+  fail_unless (index == -1);
+
+  gst_queue_array_free (array);
+}
+
+GST_END_TEST;
+
+GST_START_TEST (test_array_drop)
+{
+  GstQueueArray *array;
+  guint i;
+  guint index;
+  guint index_2;
+
+  /* Create an array of initial size 10 */
+  array = gst_queue_array_new (10);
+  fail_unless_equals_int (array->size, 10);
+
+  for (i = 0; i < 5; i++)
+    gst_queue_array_push_tail (array, GINT_TO_POINTER (i));
+
+  fail_unless (array->length == 5);
+
+  /* Naive case remove head */
+  index =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (0));
+  fail_if (index == -1);
+  gst_queue_array_drop_element (array, index);
+  fail_unless (array->length == 4);
+  index =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (0));
+  fail_unless (index == -1);
+
+  /* Naive case remove tail */
+  index =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (4));
+  fail_if (index == -1);
+  gst_queue_array_drop_element (array, index);
+  fail_unless (array->length == 3);
+  index =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (4));
+  fail_unless (index == -1);
+
+  /* Remove in middle of non-wrapped */
+  index =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (2));
+  index_2 =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (3));
+  fail_if (index == -1);
+  fail_if (index_2 == -1);
+  gst_queue_array_drop_element (array, index);
+  fail_unless (array->length == 2);
+  index =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (2));
+  fail_unless (index == -1);
+  index_2 =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (3));
+  fail_if (index_2 == -1);
+
+  /* Remove the rest */
+  while (array->length)
+    gst_queue_array_pop_head (array);
+
+  /* Add until wrapping */
+  for (i = 0; i < 9; i++)
+    gst_queue_array_push_tail (array, GINT_TO_POINTER (i));
+
+  fail_unless (array->head > array->tail);
+
+  /* Remove from between head and array end */
+  index =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (1));
+  fail_if (index == -1);
+  fail_unless (index > array->head);
+  index_2 = array->head;
+  gst_queue_array_drop_element (array, index);
+  fail_unless (array->length == 8);
+  fail_if (array->head == index_2);
+  index =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (1));
+  fail_unless (index == -1);
+
+  /* Remove from between head and array end */
+  index =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (8));
+  fail_if (index == -1);
+  fail_unless (index < array->tail);
+  index_2 = array->tail;
+  gst_queue_array_drop_element (array, index);
+  fail_unless (array->length == 7);
+  fail_if (array->tail == index_2);
+  index =
+      gst_queue_array_find (array, compare_pointer_value, GINT_TO_POINTER (8));
+  fail_unless (index == -1);
+
+  gst_queue_array_free (array);
+}
+
+GST_END_TEST;
+
+GST_START_TEST (test_array_drop2)
+{
+#define NUM_QA_ELEMENTS 674
+  gboolean in_array[NUM_QA_ELEMENTS] = { FALSE, };
+  GstQueueArray *array;
+  guint i, j, count, idx;
+
+  array = gst_queue_array_new (10);
+
+  for (i = 0; i < NUM_QA_ELEMENTS; i++) {
+    gpointer element = GUINT_TO_POINTER (i);
+
+    if (g_random_boolean ()) {
+      gst_queue_array_push_tail (array, element);
+      in_array[i] = TRUE;
+    }
+  }
+
+  for (j = 0, count = 0; j < NUM_QA_ELEMENTS; j++)
+    count += in_array[j] ? 1 : 0;
+  fail_unless_equals_int (array->length, count);
+
+  while (array->length > 0) {
+    for (i = 0; i < NUM_QA_ELEMENTS; i++) {
+      if (g_random_boolean () && g_random_boolean () && in_array[i]) {
+        idx = gst_queue_array_find (array, compare_pointer_value,
+            GUINT_TO_POINTER (i));
+        gst_queue_array_drop_element (array, idx);
+        in_array[i] = FALSE;
+      }
+    }
+
+    for (j = 0, count = 0; j < NUM_QA_ELEMENTS; j++)
+      count += in_array[j] ? 1 : 0;
+    fail_unless_equals_int (array->length, count);
+  }
+
+  gst_queue_array_free (array);
+}
+
+GST_END_TEST;
+
 static Suite *
 gst_queue_array_suite (void)
 {
@@ -239,6 +425,9 @@ gst_queue_array_suite (void)
   tcase_add_test (tc_chain, test_array_grow_multiple);
   tcase_add_test (tc_chain, test_array_grow_middle);
   tcase_add_test (tc_chain, test_array_grow_end);
+  tcase_add_test (tc_chain, test_array_find);
+  tcase_add_test (tc_chain, test_array_drop);
+  tcase_add_test (tc_chain, test_array_drop2);
 
   return s;
 }