forked from ernop/coil-levels
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solverutil.cs
73 lines (64 loc) · 2.02 KB
/
Solverutil.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
using System;
using System.Collections.Generic;
using System.Diagnostics.CodeAnalysis;
using System.Text;
using static coil.Navigation;
namespace coil
{
/// <summary>
/// not writing a solver, but some analytics require solver-like things.
/// </summary>
public static class Solverutil
{
public static List<(int, int)> GetNeighbors((int, int) pt)
{
return new List<(int, int)>() { (pt.Item1, pt.Item2-1),
(pt.Item1+1, pt.Item2),
(pt.Item1, pt.Item2+1),
(pt.Item1-1, pt.Item2),};
}
public static List<(int, int)> GetNeighbors(Seg seg)
{
var res = new List<(int, int)>();
res.Add(Add(seg.Start, Rot(Rot(seg.Dir))));
var candidate = seg.Start;
var dirs = new List<Dir>() { Rot(seg.Dir), ARot(seg.Dir) };
var ii = 0;
while (ii <= seg.Len)
{
foreach (var dir in dirs) {
res.Add(Add(candidate, dir));
}
ii++;
candidate = Add(candidate, seg.Dir);
}
res.Add(candidate);
return res;
}
public static HashSet<Seg> GetNeighboringSegs(Level level, Seg seg)
{
var res = new HashSet<Seg>(new SegComparer());
var neighbors = GetNeighbors(seg);
foreach (var nei in neighbors)
{
var neiseg = level.GetRowValue(nei);
if (neiseg != null)
{
res.Add(neiseg);
}
}
return res;
}
public class SegComparer : IEqualityComparer<Seg>
{
public bool Equals([AllowNull] Seg x, [AllowNull] Seg y)
{
return x.Index == y.Index;
}
public int GetHashCode([DisallowNull] Seg obj)
{
return obj.Index.GetHashCode();
}
}
}
}