forked from runuo/runuo
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTileList.cs
92 lines (75 loc) · 2.12 KB
/
TileList.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
/***************************************************************************
* TileList.cs
* -------------------
* begin : May 1, 2002
* copyright : (C) The RunUO Software Team
* email : [email protected]
*
* $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;
}
}
}