public void Dispose()
{
// Get rid of dummies
for (int i = 0; i < hashSize; i++)
{
hash[i].Dispose(manager);
hash[i] = null;
}
manager.Release(hash);
hash = null;
manager.Release(this);
}
public void Dispose()
{
leftVertex = null;
rightVertex = null;
if (clippedVertices != null)
{
clippedVertices.Clear();
manager.Release(clippedVertices);
clippedVertices = null;
}
sites.Clear();
manager.Release(this);
}
public void Dispose()
{
foreach (var site in sites)
{
site.Dispose();
}
manager.Release(sites);
ResetListIndex();
}
public void Dispose()
{
sites.Dispose();
foreach (Edge e in edges)
{
e.Dispose();
}
manager.Release(edges);
foreach (Vertex ve in vertices)
{
ve.Dispose(manager);
}
manager.Release(vertices);
plotBounds = Rectf.zero;
}
public void Dispose()
{
Halfedge halfedge = leftEnd.edgeListRightNeighbor;
Halfedge prevHe;
while (halfedge != rightEnd)
{
prevHe = halfedge;
halfedge = halfedge.edgeListRightNeighbor;
prevHe.Dispose(manager);
}
leftEnd.ReallyDispose(manager);
leftEnd = null;
rightEnd.ReallyDispose(manager);
rightEnd = null;
manager.Release(hash);
manager.Release(this);
}
public void ReallyDispose(VoronoiManager manager)
{
edgeListLeftNeighbor = null;
edgeListRightNeighbor = null;
nextInPriorityQueue = null;
edge = null;
leftRight = null;
vertex = null;
manager.Release(this);
}
public void Dispose(VoronoiManager manager)
{
if (edgeListLeftNeighbor != null || edgeListRightNeighbor != null)
{
// still in EdgeList
return;
}
if (nextInPriorityQueue != null)
{
// still in PriorityQueue
return;
}
edge = null;
leftRight = null;
vertex = null;
manager.Release(this);
}
public void Dispose()
{
Clear();
manager.Release(this);
}
public void Dispose(VoronoiManager manager)
{
coord = Vector2f.zero;
manager.Release(this);
}