Skip to content

Commit f365165

Browse files
committed
Mark some slower running tests on Linux
1 parent 8e04c67 commit f365165

File tree

5 files changed

+9
-9
lines changed

5 files changed

+9
-9
lines changed

lib/2015/day_17.ex

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ defmodule AdventOfCode.Y2015.Day17 do
33
--- Day 17: No Such Thing as Too Much ---
44
Problem Link: https://adventofcode.com/2015/day/17
55
Difficulty: s
6-
Tags: not-fast-enough combinatorics
6+
Tags: slow revisit combinatorics
77
"""
88
alias AdventOfCode.Algorithms.Combinatorics
99
alias AdventOfCode.Helpers.{InputReader, Transformers}
@@ -20,8 +20,8 @@ defmodule AdventOfCode.Y2015.Day17 do
2020
solution_2 = Task.async(fn -> minimum_bottle_count(Enum.map(combinations, &length/1)) end)
2121

2222
{
23-
Task.await(solution_1),
24-
Task.await(solution_2)
23+
Task.await(solution_1, :infinity),
24+
Task.await(solution_2, :infinity)
2525
}
2626
end
2727

lib/2018/day_06.ex

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ defmodule AdventOfCode.Y2018.Day06 do
33
--- Day 6: Chronal Coordinates ---
44
Problem Link: https://adventofcode.com/2018/day/6
55
Difficulty: s
6-
Tags: not-fast-enough grid measurement
6+
Tags: slow revisit grid measurement
77
"""
88
alias AdventOfCode.Helpers.{InputReader, Transformers}
99

@@ -21,7 +21,7 @@ defmodule AdventOfCode.Y2018.Day06 do
2121

2222
task_1 = Task.async(fn -> covers_most_points(input) end)
2323
task_2 = Task.async(fn -> covers_distances_within(input, 10_000) end)
24-
{Task.await(task_1), Task.await(task_2)}
24+
{Task.await(task_1, :infinity), Task.await(task_2, :infinity)}
2525
end
2626

2727
@spec parse(binary()) :: points()

lib/2018/day_09.ex

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ defmodule AdventOfCode.Y2018.Day09 do
33
--- Day 9: Marble Mania ---
44
Problem Link: https://adventofcode.com/2018/day/9
55
Difficulty: s
6-
Tags: not-fast-enough circular-linked-list
6+
Tags: slow revisit circular-linked-list
77
"""
88
alias AdventOfCode.Algorithms.BiCircularList
99

@@ -14,7 +14,7 @@ defmodule AdventOfCode.Y2018.Day09 do
1414
task_1 = Task.async(fn -> run_1() end)
1515
task_2 = Task.async(fn -> run_2() end)
1616

17-
{Task.await(task_1), Task.await(task_2)}
17+
{Task.await(task_1, :infinity), Task.await(task_2, :infinity)}
1818
end
1919

2020
def run_1 do

lib/2023/day_10.ex

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ defmodule AdventOfCode.Y2023.Day10 do
33
--- Day 10: Pipe Maze ---
44
Problem Link: https://adventofcode.com/2023/day/10
55
Difficulty: xl
6-
Tags: graph graph-traversal needs-improvement not-fast-enough
6+
Tags: graph graph-traversal needs-improvement :slow :revisit
77
"""
88
alias AdventOfCode.Algorithms.Grid
99
alias AdventOfCode.Helpers.{InputReader, Transformers}

test/2016/day_10_test.exs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
defmodule AdventOfCode.Y2016.Day10Test do
22
@moduledoc false
33

4-
use ExUnit.Case, async: true
4+
use ExUnit.Case
55
@moduletag :y1610
66

77
alias AdventOfCode.Y2016.Day10, as: Solution

0 commit comments

Comments
 (0)