-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathCollisionGrid.Point.cs
195 lines (185 loc) · 6.17 KB
/
CollisionGrid.Point.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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
// ***************************************************************************
// This is free and unencumbered software released into the public domain.
//
// Anyone is free to copy, modify, publish, use, compile, sell, or
// distribute this software, either in source code form or as a compiled
// binary, for any purpose, commercial or non-commercial, and by any
// means.
//
// In jurisdictions that recognize copyright laws, the author or authors
// of this software dedicate any and all copyright interest in the
// software to the public domain. We make this dedication for the benefit
// of the public at large and to the detriment of our heirs and
// successors. We intend this dedication to be an overt act of
// relinquishment in perpetuity of all present and future rights to this
// software under copyright law.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
// IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
// OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
// OTHER DEALINGS IN THE SOFTWARE.
//
// For more information, please refer to <http://unlicense.org>
// ***************************************************************************
using System.Collections.Generic;
using Microsoft.Xna.Framework;
namespace CollisionGrid
{
public partial class CollisionGrid<T>
{
public T[] Get(Point cell)
{
lock (lockObject)
{
List<T> contents;
Grid.TryGetValue(Clamp(cell), out contents);
if (contents == null)
{
return new T[0];
}
return contents.ToArray();
}
}
/// <summary>
/// Gets the first item encountered on the given cell.
/// </summary>
/// <param name="cell">The cell to search</param>
/// <returns>The item or default(T)</returns>
public T First(Point cell)
{
lock (lockObject)
{
List<T> contents;
Grid.TryGetValue(Clamp(cell), out contents);
if (contents != null && contents.Count > 0)
{
return contents[0];
}
return default(T);
}
}
/// <summary>
/// Adds a given item to a given cell.
/// If the cell already contains the item, it is not added a second time.
/// </summary>
/// <param name="item">The item to add</param>
/// <param name="cell">The cell to add the item to</param>
public void Add(T item, Point cell)
{
lock (lockObject)
{
Point c = Clamp(cell);
AddToGrid(item, c);
AddToItems(item, c);
}
}
private void AddToGrid(T item, Point cell)
{
List<T> l;
Grid.TryGetValue(cell, out l);
if (l == null)
{
if (ListOfItemQueue.Count > 0)
{
l = ListOfItemQueue.Dequeue();
}
else
{
l = new List<T>();
}
l.Add(item);
Grid.Add(cell, l);
}
else
{
if (!l.Contains(item))
{
l.Add(item);
}
}
}
private void AddToItems(T item, Point cell)
{
List<Point> pl;
ItemDictionary.TryGetValue(item, out pl);
if (pl == null)
{
if (ListOfPointQueue.Count > 0)
{
pl = ListOfPointQueue.Dequeue();
}
else
{
pl = new List<Point>();
}
pl.Add(cell);
ItemDictionary.Add(item, pl);
}
else
{
if (!pl.Contains(cell))
{
pl.Add(cell);
}
}
}
/// <summary>
/// Removes all items from the given cell.
/// If the items don't occupy another cell, they are removed as well.
/// </summary>
/// <param name="cell">The cell to remove items from</param>
public void Remove(Point cell)
{
lock (lockObject)
{
Point c = Clamp(cell);
List<T> l;
Grid.TryGetValue(c, out l);
if (l != null)
{
foreach (T i in l)
{
List<Point> pl;
ItemDictionary.TryGetValue(i, out pl);
if (pl != null)
{
pl.Remove(c);
if (pl.Count == 0)
{
ListOfPointQueue.Enqueue(pl);
ItemDictionary.Remove(i);
}
}
}
l.Clear();
ListOfItemQueue.Enqueue(l);
Grid.Remove(cell);
}
}
}
/// <summary>
/// Removes all occurrences of the given item and re-adds it at the new given cell.
/// If the item hasn't been in the grid before, this will just add it.
/// </summary>
/// <param name="item">The item to move</param>
/// <param name="cell">The cell to move it to</param>
public void Move(T item, Point cell)
{
lock (lockObject)
{
Remove(item);
Add(item, cell);
}
}
public bool IsEmpty(Point cell)
{
lock (lockObject)
{
return Get(cell).Length == 0;
}
}
}
}