92 lines
No EOL
2.1 KiB
C#
92 lines
No EOL
2.1 KiB
C#
/***************************************************************************
|
|
* TileList.cs
|
|
* -------------------
|
|
* begin : May 1, 2002
|
|
* copyright : (C) The RunUO Software Team
|
|
* email : info@runuo.com
|
|
*
|
|
* $Id$
|
|
*
|
|
***************************************************************************/
|
|
|
|
/***************************************************************************
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
***************************************************************************/
|
|
|
|
using System;
|
|
|
|
namespace Server
|
|
{
|
|
public class TileList
|
|
{
|
|
private StaticTile[] m_Tiles;
|
|
private int m_Count;
|
|
|
|
public TileList()
|
|
{
|
|
m_Tiles = new StaticTile[8];
|
|
m_Count = 0;
|
|
}
|
|
|
|
public int Count
|
|
{
|
|
get
|
|
{
|
|
return m_Count;
|
|
}
|
|
}
|
|
|
|
public void AddRange( StaticTile[] tiles )
|
|
{
|
|
if ( (m_Count + tiles.Length) > m_Tiles.Length )
|
|
{
|
|
StaticTile[] old = m_Tiles;
|
|
m_Tiles = new StaticTile[(m_Count + tiles.Length) * 2];
|
|
|
|
for ( int i = 0; i < old.Length; ++i )
|
|
m_Tiles[i] = old[i];
|
|
}
|
|
|
|
for ( int i = 0; i < tiles.Length; ++i )
|
|
m_Tiles[m_Count++] = tiles[i];
|
|
}
|
|
|
|
public void Add( ushort id, sbyte z )
|
|
{
|
|
if ( (m_Count + 1) > m_Tiles.Length )
|
|
{
|
|
StaticTile[] old = m_Tiles;
|
|
m_Tiles = new StaticTile[old.Length * 2];
|
|
|
|
for ( int i = 0; i < old.Length; ++i )
|
|
m_Tiles[i] = old[i];
|
|
}
|
|
|
|
m_Tiles[m_Count].m_ID = id;
|
|
m_Tiles[m_Count].m_Z = z;
|
|
++m_Count;
|
|
}
|
|
|
|
private static StaticTile[] m_EmptyTiles = new StaticTile[0];
|
|
|
|
public StaticTile[] ToArray()
|
|
{
|
|
if ( m_Count == 0 )
|
|
return m_EmptyTiles;
|
|
|
|
StaticTile[] tiles = new StaticTile[m_Count];
|
|
|
|
for ( int i = 0; i < m_Count; ++i )
|
|
tiles[i] = m_Tiles[i];
|
|
|
|
m_Count = 0;
|
|
|
|
return tiles;
|
|
}
|
|
}
|
|
} |