Remove leftovers wip

Author: FelonEkonom

benchmark/metric/in_progress_memory.ex

@@ -11,7 +11,7 @@ defmodule Benchmark.Metric.InProgressMemory do
 
     if cumulative_memory > cumulative_memory_ref * (1 + @tolerance_factor),
       do:
-        IO.warn(
+        raise(
           "The memory performance has got worse! For test case: #{inspect(test_case, pretty: true)}
         the cumulative memory used to be: #{cumulative_memory_ref} MB and now it is: #{cumulative_memory} MB"
         )

benchmark/metric/message_queues_length.ex

@@ -4,8 +4,6 @@ defmodule Benchmark.Metric.MessageQueuesLength do
   @tolerance_factor 0.5
   @sampling_period 100
 
-  require Membrane.Logger
-
   @impl true
   def assert(queues_lengths, queues_lengths_ref, test_case) do
     cumulative_queues_length = integrate(queues_lengths)
@@ -14,7 +12,7 @@ defmodule Benchmark.Metric.MessageQueuesLength do
     if cumulative_queues_length >
          cumulative_queues_length_ref * (1 + @tolerance_factor),
        do:
-         IO.warn(
+         raise(
            "The cumulative queues length has got worse! For test case: #{inspect(test_case, pretty: true)}
           the cumulative queues length to be: #{cumulative_queues_length_ref} and now it is: #{cumulative_queues_length}"
          )

benchmark/metric/time.ex

@@ -5,12 +5,12 @@ defmodule Benchmark.Metric.Time do
 
   @impl true
   def assert(time, time_ref, test_case) do
-    if time > time_ref * (1 + @tolerance_factor) do
-      IO.warn(
-        "The time performance has got worse! For test case: #{inspect(test_case, pretty: true)} the test
+    if time > time_ref * (1 + @tolerance_factor),
+      do:
+        raise(
+          "The time performance has got worse! For test case: #{inspect(test_case, pretty: true)} the test
         used to take: #{time_ref} ms and now it takes: #{time} ms"
-      )
-    end
+        )
 
     :ok
   end

benchmark/run.exs

@@ -61,43 +61,43 @@ defmodule Benchmark.Run do
   require Membrane.Pad
 
   @test_cases [
-    # linear: [
-    #   reductions: 1_000,
-    #   max_random: 1,
-    #   number_of_filters: 10,
-    #   number_of_buffers: 500_000,
-    #   buffer_size: 1
-    # ],
-    # linear: [
-    #   reductions: 1_000,
-    #   max_random: 1,
-    #   number_of_filters: 100,
-    #   number_of_buffers: 50_000,
-    #   buffer_size: 1
-    # ],
-    # linear: [
-    #   reductions: 1_000,
-    #   max_random: 5,
-    #   number_of_filters: 10,
-    #   number_of_buffers: 50_000,
-    #   buffer_size: 1
-    # ],
+    linear: [
+      reductions: 1_000,
+      max_random: 1,
+      number_of_filters: 10,
+      number_of_buffers: 500_000,
+      buffer_size: 1
+    ],
+    linear: [
+      reductions: 1_000,
+      max_random: 1,
+      number_of_filters: 100,
+      number_of_buffers: 50_000,
+      buffer_size: 1
+    ],
+    linear: [
+      reductions: 1_000,
+      max_random: 5,
+      number_of_filters: 10,
+      number_of_buffers: 50_000,
+      buffer_size: 1
+    ],
     with_branches: [
       struct: [{1, 3}, {3, 2}, {2, 1}],
       reductions: 100,
       number_of_buffers: 50_000,
       buffer_size: 1,
       max_random: 1
-      # ],
-      # with_branches: [
-      #   struct: [{1, 2}, {1, 2}, {2, 1}, {2, 1}],
-      #   reductions: 100,
-      #   number_of_buffers: 500_000,
-      #   buffer_size: 1,
-      #   max_random: 10
+    ],
+    with_branches: [
+      struct: [{1, 2}, {1, 2}, {2, 1}, {2, 1}],
+      reductions: 100,
+      number_of_buffers: 500_000,
+      buffer_size: 1,
+      max_random: 10
     ]
   ]
-  @how_many_tries 10
+  @how_many_tries 5
   # [ms]
   @test_timeout 300_000
   # the greater the factor is, the more unevenly distributed by the dispatcher will the buffers be