2007-06-13 19:39:38 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 2007 Pascal vd Heiden, www.codeimp.com
|
|
|
|
* This program is released under GNU General Public License
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
using System;
|
|
|
|
using System.Collections;
|
|
|
|
using System.Collections.Generic;
|
|
|
|
using System.Globalization;
|
|
|
|
using System.Text;
|
2007-06-14 12:37:46 +00:00
|
|
|
using CodeImp.DoomBuilder.Geometry;
|
2007-06-13 19:39:38 +00:00
|
|
|
|
|
|
|
namespace CodeImp.DoomBuilder.Map
|
|
|
|
{
|
|
|
|
internal class MapManager : IDisposable
|
|
|
|
{
|
|
|
|
#region ================== Constants
|
|
|
|
|
|
|
|
#endregion
|
|
|
|
|
|
|
|
#region ================== Variables
|
|
|
|
|
2007-06-14 12:37:46 +00:00
|
|
|
// Map structures
|
|
|
|
private LinkedList<Vertex> vertices;
|
|
|
|
private LinkedList<Linedef> linedefs;
|
|
|
|
private LinkedList<Sidedef> sidedefs;
|
|
|
|
private LinkedList<Sector> sectors;
|
|
|
|
private LinkedList<Thing> things;
|
|
|
|
|
2007-06-13 19:39:38 +00:00
|
|
|
// Disposing
|
|
|
|
private bool isdisposed = false;
|
|
|
|
|
|
|
|
#endregion
|
|
|
|
|
|
|
|
#region ================== Properties
|
|
|
|
|
2007-06-14 12:37:46 +00:00
|
|
|
public ICollection<Vertex> Vertices { get { return vertices; } }
|
|
|
|
public ICollection<Linedef> Linedefs { get { return linedefs; } }
|
|
|
|
public ICollection<Sidedef> Sidedefs { get { return sidedefs; } }
|
|
|
|
public ICollection<Sector> Sectors { get { return sectors; } }
|
|
|
|
public ICollection<Thing> Things { get { return things; } }
|
2007-06-13 19:39:38 +00:00
|
|
|
public bool IsDisposed { get { return isdisposed; } }
|
|
|
|
|
|
|
|
#endregion
|
|
|
|
|
|
|
|
#region ================== Constructor / Disposer
|
|
|
|
|
2007-06-14 12:37:46 +00:00
|
|
|
// Constructor for new empty map
|
2007-06-13 19:39:38 +00:00
|
|
|
public MapManager()
|
|
|
|
{
|
|
|
|
// Initialize
|
2007-06-14 12:37:46 +00:00
|
|
|
vertices = new LinkedList<Vertex>();
|
|
|
|
linedefs = new LinkedList<Linedef>();
|
|
|
|
sidedefs = new LinkedList<Sidedef>();
|
|
|
|
sectors = new LinkedList<Sector>();
|
|
|
|
things = new LinkedList<Thing>();
|
2007-06-13 19:39:38 +00:00
|
|
|
|
|
|
|
// We have no destructor
|
|
|
|
GC.SuppressFinalize(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Diposer
|
|
|
|
public void Dispose()
|
|
|
|
{
|
2007-06-14 12:37:46 +00:00
|
|
|
ArrayList list;
|
|
|
|
|
2007-06-13 19:39:38 +00:00
|
|
|
// Not already disposed?
|
|
|
|
if(!isdisposed)
|
|
|
|
{
|
2007-06-14 12:37:46 +00:00
|
|
|
// Already set isdisposed so that changes can be prohibited
|
|
|
|
isdisposed = true;
|
|
|
|
|
|
|
|
// Dispose all things
|
|
|
|
list = new ArrayList(things);
|
|
|
|
foreach(Thing t in list) t.Dispose();
|
|
|
|
|
|
|
|
// Dispose all sectors
|
|
|
|
list = new ArrayList(sectors);
|
|
|
|
foreach(Sector s in list) s.Dispose();
|
|
|
|
|
|
|
|
// Dispose all sidedefs
|
|
|
|
list = new ArrayList(sidedefs);
|
|
|
|
foreach(Sidedef sd in list) sd.Dispose();
|
|
|
|
|
|
|
|
// Dispose all linedefs
|
|
|
|
list = new ArrayList(linedefs);
|
|
|
|
foreach(Linedef l in list) l.Dispose();
|
2007-06-13 19:39:38 +00:00
|
|
|
|
2007-06-14 12:37:46 +00:00
|
|
|
// Dispose all vertices
|
|
|
|
list = new ArrayList(vertices);
|
|
|
|
foreach(Vertex v in list) v.Dispose();
|
|
|
|
|
|
|
|
// Clean up
|
|
|
|
vertices = null;
|
|
|
|
linedefs = null;
|
|
|
|
sidedefs = null;
|
|
|
|
sectors = null;
|
|
|
|
things = null;
|
|
|
|
|
2007-06-13 19:39:38 +00:00
|
|
|
// Done
|
|
|
|
isdisposed = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#endregion
|
|
|
|
|
2007-06-14 12:37:46 +00:00
|
|
|
#region ================== Management
|
|
|
|
|
|
|
|
// This creates a new vertex
|
|
|
|
public Vertex CreateVertex(Vector2D pos)
|
|
|
|
{
|
|
|
|
LinkedListNode<Vertex> listitem;
|
|
|
|
Vertex v;
|
|
|
|
|
|
|
|
// Make a list item
|
|
|
|
listitem = new LinkedListNode<Vertex>(null);
|
|
|
|
|
|
|
|
// Make the vertex
|
|
|
|
v = new Vertex(this, listitem, pos);
|
|
|
|
listitem.Value = v;
|
|
|
|
|
|
|
|
// Add vertex to the list
|
|
|
|
vertices.AddLast(listitem);
|
|
|
|
|
|
|
|
// Return result
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
|
|
|
// This creates a new linedef
|
|
|
|
public Linedef CreateLinedef(Vertex start, Vertex end)
|
|
|
|
{
|
|
|
|
LinkedListNode<Linedef> listitem;
|
|
|
|
Linedef l;
|
|
|
|
|
|
|
|
// Make a list item
|
|
|
|
listitem = new LinkedListNode<Linedef>(null);
|
|
|
|
|
|
|
|
// Make the linedef
|
|
|
|
l = new Linedef(this, listitem, start, end);
|
|
|
|
listitem.Value = l;
|
|
|
|
|
|
|
|
// Add linedef to the list
|
|
|
|
linedefs.AddLast(listitem);
|
|
|
|
|
|
|
|
// Return result
|
|
|
|
return l;
|
|
|
|
}
|
|
|
|
|
|
|
|
// This creates a new sidedef
|
|
|
|
public Sidedef CreateSidedef(Linedef l, bool front, Sector s)
|
|
|
|
{
|
|
|
|
LinkedListNode<Sidedef> listitem;
|
|
|
|
Sidedef sd;
|
|
|
|
|
|
|
|
// Make a list item
|
|
|
|
listitem = new LinkedListNode<Sidedef>(null);
|
|
|
|
|
|
|
|
// Make the sidedef
|
|
|
|
sd = new Sidedef(this, listitem, l, front, s);
|
|
|
|
listitem.Value = sd;
|
|
|
|
|
|
|
|
// Add sidedef to the list
|
|
|
|
sidedefs.AddLast(listitem);
|
|
|
|
|
|
|
|
// Return result
|
|
|
|
return sd;
|
|
|
|
}
|
|
|
|
|
|
|
|
// This creates a new sector
|
|
|
|
public Sector CreateSector()
|
|
|
|
{
|
|
|
|
LinkedListNode<Sector> listitem;
|
|
|
|
Sector s;
|
|
|
|
|
|
|
|
// Make a list item
|
|
|
|
listitem = new LinkedListNode<Sector>(null);
|
|
|
|
|
|
|
|
// Make the sector
|
|
|
|
s = new Sector(this, listitem);
|
|
|
|
listitem.Value = s;
|
|
|
|
|
|
|
|
// Add sector to the list
|
|
|
|
sectors.AddLast(listitem);
|
|
|
|
|
|
|
|
// Return result
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
// This creates a new thing
|
|
|
|
public Thing CreateThing(int type, Vector2D pos)
|
|
|
|
{
|
|
|
|
LinkedListNode<Thing> listitem;
|
|
|
|
Thing t;
|
|
|
|
|
|
|
|
// Make a list item
|
|
|
|
listitem = new LinkedListNode<Thing>(null);
|
|
|
|
|
|
|
|
// Make the thing
|
|
|
|
t = new Thing(this, listitem, type, pos);
|
|
|
|
listitem.Value = t;
|
|
|
|
|
|
|
|
// Add thing to the list
|
|
|
|
things.AddLast(listitem);
|
|
|
|
|
|
|
|
// Return result
|
|
|
|
return t;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endregion
|
|
|
|
|
|
|
|
#region ================== Static Tools
|
|
|
|
|
|
|
|
// This finds the line closest to the specified position
|
|
|
|
public static Linedef NearestLinedef(ICollection<Linedef> selection, Vector2D pos)
|
|
|
|
{
|
|
|
|
Linedef closest = null;
|
|
|
|
float distance = float.MaxValue;
|
|
|
|
float d;
|
|
|
|
|
|
|
|
// Go for all linedefs in selection
|
|
|
|
foreach(Linedef l in selection)
|
|
|
|
{
|
|
|
|
// Calculate distance and check if closer than previous find
|
|
|
|
d = l.DistanceToSq(pos, true);
|
|
|
|
if(d < distance)
|
|
|
|
{
|
|
|
|
// This one is closer
|
|
|
|
closest = l;
|
|
|
|
distance = d;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return result
|
|
|
|
return closest;
|
|
|
|
}
|
|
|
|
|
|
|
|
// This finds the vertex closest to the specified position
|
|
|
|
public static Vertex NearestVertex(ICollection<Vertex> selection, Vector2D pos)
|
|
|
|
{
|
|
|
|
Vertex closest = null;
|
|
|
|
float distance = float.MaxValue;
|
|
|
|
float d;
|
|
|
|
|
|
|
|
// Go for all vertices in selection
|
|
|
|
foreach(Vertex v in selection)
|
|
|
|
{
|
|
|
|
// Calculate distance and check if closer than previous find
|
|
|
|
d = v.DistanceToSq(pos);
|
|
|
|
if(d < distance)
|
|
|
|
{
|
|
|
|
// This one is closer
|
|
|
|
closest = v;
|
|
|
|
distance = d;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return result
|
|
|
|
return closest;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endregion
|
|
|
|
|
|
|
|
#region ================== Tools
|
|
|
|
|
|
|
|
// This finds the line closest to the specified position
|
|
|
|
public Linedef NearestLinedef(Vector2D pos) { return MapManager.NearestLinedef(linedefs, pos); }
|
2007-06-13 19:39:38 +00:00
|
|
|
|
2007-06-14 12:37:46 +00:00
|
|
|
// This finds the vertex closest to the specified position
|
|
|
|
public Vertex NearestVertex(Vector2D pos) { return MapManager.NearestVertex(vertices, pos); }
|
|
|
|
|
2007-06-13 19:39:38 +00:00
|
|
|
#endregion
|
|
|
|
}
|
|
|
|
}
|