SortedVector.vala 1.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
  1. using Invercargill;
  2. using Invercargill.DataStructures;
  3. void sorted_vector_tests() {
  4. Test.add_func("/invercargill/structure/sorted_vector/add_item", () => {
  5. var series = new SortedVector<int>();
  6. series.add(8);
  7. assert(series.first_or_default() == 8);
  8. assert(series.count() == 1);
  9. });
  10. Test.add_func("/invercargill/structure/sorted_vector/add_many", () => {
  11. var series = new SortedVector<int>();
  12. var items = Iterate.range(0, 10000000);
  13. series.add_all(items);
  14. assert(series.count() == 10000000);
  15. assert(series.matches(items, (a, b) => a == b));
  16. });
  17. Test.add_func("/invercargill/structure/sorted_vector/add_many_reversed", () => {
  18. var series = new SortedVector<int>();
  19. var items = Iterate.range(300000, 0, -1);
  20. series.add_all(items);
  21. assert(series.count() == 300000);
  22. });
  23. Test.add_func("/invercargill/structure/sorted_vector/add_twice", () => {
  24. var series = new SortedVector<int>();
  25. var items = Iterate.range(0, 100);
  26. series.add_all(items);
  27. series.add_all(items);
  28. assert(series.count() == 200);
  29. series.matches(items.interleave(items), (a, b) => a == b);
  30. });
  31. Test.add_func("/invercargill/structure/sorted_vector/to_array", () => {
  32. var items = new int[] { 1, 8, 2, 4, 6, 5, 3, 10, 3, 7 };
  33. var expected = new int[] { 1, 2, 3, 3, 4, 5, 6, 7, 8, 10 };
  34. var series = new SortedVector<int>();
  35. series.add_all(Wrap.array(items));
  36. var array = series.to_array();
  37. assert_cmpint(array.length, CompareOperator.EQ, 10);
  38. for(int i = 0; i < expected.length; i++) {
  39. assert_cmpint(array[i], CompareOperator.EQ, expected[i]);
  40. }
  41. });
  42. }