forked from runuo/runuo
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathKeywordList.cs
85 lines (68 loc) · 1.88 KB
/
KeywordList.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
/***************************************************************************
* KeywordList.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 KeywordList
{
private int[] m_Keywords;
private int m_Count;
public KeywordList()
{
m_Keywords = new int[8];
m_Count = 0;
}
public int Count
{
get
{
return m_Count;
}
}
public bool Contains( int keyword )
{
bool contains = false;
for ( int i = 0; !contains && i < m_Count; ++i )
contains = ( keyword == m_Keywords[i] );
return contains;
}
public void Add( int keyword )
{
if ( (m_Count + 1) > m_Keywords.Length )
{
int[] old = m_Keywords;
m_Keywords = new int[old.Length * 2];
for ( int i = 0; i < old.Length; ++i )
m_Keywords[i] = old[i];
}
m_Keywords[m_Count++] = keyword;
}
private static int[] m_EmptyInts = new int[0];
public int[] ToArray()
{
if ( m_Count == 0 )
return m_EmptyInts;
int[] keywords = new int[m_Count];
for ( int i = 0; i < m_Count; ++i )
keywords[i] = m_Keywords[i];
m_Count = 0;
return keywords;
}
}
}