···
48
+
// nicer looking but idc
49
+
// |> list.filter(fn(i) {
50
+
// list.any(fresh_ranges, fn(range) { i >= range.0 && i <= range.1 })
54
+
// this thing crashed my computer btw im stupid
// |> list.fold(set.new(), fn(acc, i) {
···
// io.println(set.size(haha) |> int.to_string)
let base_set: set.Set(#(Int, Int)) = set.new()
58
-
|> list.fold(base_set, fn(prev_seen_ranges, range) {
59
-
let #(range, seen_ranges) =
61
-
|> set.fold(#(range, prev_seen_ranges), fn(acc, seen_range) {
62
-
let #(range, seen_ranges) = acc
66
-
// int.compare(range.0, seen_range.0),
67
-
// int.compare(range.1, seen_range.1),
68
-
// int.compare(range.0, seen_range.1),
69
-
// int.compare(range.1, seen_range.0),
71
-
// btw im refusing to ever do something better than this idc about your sorting and whatever this is the way shut the fuck up i spent three hours on this i will be using it
73
-
int.compare(range.0, seen_range.0),
74
-
int.compare(range.1, seen_range.1),
75
-
int.compare(range.0, seen_range.1),
76
-
int.compare(range.1, seen_range.0)
78
-
// if there's no touching
79
-
Gt, Gt, Gt, Gt | Lt, Lt, Lt, Lt -> #(range, seen_ranges)
80
-
// if it's inside of the other one
81
-
Gt, Lt, _, _ | Eq, Lt, _, _ | Gt, Eq, _, _ | Eq, Eq, _, _ -> #(
85
-
// if the other one is inside it
86
-
Lt, Gt, _, _ | Eq, Gt, _, _ | Lt, Eq, _, _ -> #(
88
-
set.delete(seen_ranges, seen_range),
90
-
// if it's touching on the left side make them touch
92
-
#(range.0, seen_range.1),
93
-
set.delete(seen_ranges, seen_range),
95
-
// if it's touching on the right size make them touch
97
-
#(seen_range.0, range.1),
98
-
set.delete(seen_ranges, seen_range),
64
+
|> list.fold(base_set, fn(prev_seen_ranges, range) {
65
+
let #(range, seen_ranges) =
67
+
|> set.fold(#(range, prev_seen_ranges), fn(acc, seen_range) {
68
+
let #(range, seen_ranges) = acc
72
+
// int.compare(range.0, seen_range.0),
73
+
// int.compare(range.1, seen_range.1),
74
+
// int.compare(range.0, seen_range.1),
75
+
// int.compare(range.1, seen_range.0),
77
+
// btw im refusing to ever do something better than this idc about your sorting and whatever this is the way shut the fuck up i spent three hours on this i will be using it
79
+
int.compare(range.0, seen_range.0),
80
+
int.compare(range.1, seen_range.1),
81
+
int.compare(range.0, seen_range.1),
82
+
int.compare(range.1, seen_range.0)
84
+
// if there's no touching
85
+
Gt, Gt, Gt, Gt | Lt, Lt, Lt, Lt -> #(range, seen_ranges)
86
+
// if it's inside of the other one
87
+
Gt, Lt, _, _ | Eq, Lt, _, _ | Gt, Eq, _, _ | Eq, Eq, _, _ -> #(
91
+
// if the other one is inside it
92
+
Lt, Gt, _, _ | Eq, Gt, _, _ | Lt, Eq, _, _ -> #(
94
+
set.delete(seen_ranges, seen_range),
96
+
// if it's touching on the left side make them touch
98
+
#(range.0, seen_range.1),
99
+
set.delete(seen_ranges, seen_range),
101
+
// if it's touching on the right size make them touch
103
+
#(seen_range.0, range.1),
104
+
set.delete(seen_ranges, seen_range),
103
-
case range == #(0, 0) {
104
-
False -> seen_ranges |> set.insert(range)
105
-
True -> seen_ranges
109
+
case range == #(0, 0) {
110
+
False -> seen_ranges |> set.insert(range)
111
+
True -> seen_ranges
|> set.fold(0, fn(acc, range) { acc + range.1 - range.0 + 1 })