warrentyexpired/ModernUO
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fix: Cleans up core code (#1187)

Browse source 
**Only one functional change**
* Fixes a bug in LogFactory where `Warning` is being logged as `Information`

Non-functional changes:
* Updates/Fixes copyright headers
* Removes namespace scopes for core files.

View with [whitespace off](https://github.com/modernuo/ModernUO/pull/1187/files?w=1).
This commit is contained in:
Kamron Batman 2022-10-10 21:47:08 -07:00 • committed by GitHub
parent 0138d40bda
commit f268d5d4e2
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
262 changed files with 28527 additions and 28646 deletions
Download patch file Download diff file Expand all files Collapse all files

85
Projects/Server/KeywordList.cs
View file

@ -1,65 +1,64 @@
using System;
namespace Server
namespace Server;
public class KeywordList
{
public class KeywordList
private static readonly int[] m_EmptyInts = Array.Empty<int>();
private int[] m_Keywords;
public KeywordList()
{
private static readonly int[] m_EmptyInts = Array.Empty<int>();
private int[] m_Keywords;
m_Keywords = new int[8];
Count = 0;
}
public KeywordList()
public int Count { get; private set; }
public bool Contains(int keyword)
{
var contains = false;
for (var i = 0; !contains && i < Count; ++i)
{
m_Keywords = new int[8];
Count = 0;
contains = keyword == m_Keywords[i];
}
public int Count { get; private set; }
return contains;
}
public bool Contains(int keyword)
public void Add(int keyword)
{
if (Count + 1 > m_Keywords.Length)
{
var contains = false;
var old = m_Keywords;
m_Keywords = new int[old.Length * 2];
for (var i = 0; !contains && i < Count; ++i)
for (var i = 0; i < old.Length; ++i)
{
contains = keyword == m_Keywords[i];
m_Keywords[i] = old[i];
}
return contains;
}
public void Add(int keyword)
m_Keywords[Count++] = keyword;
}
public int[] ToArray()
{
if (Count == 0)
{
if (Count + 1 > m_Keywords.Length)
{
var old = m_Keywords;
m_Keywords = new int[old.Length * 2];
for (var i = 0; i < old.Length; ++i)
{
m_Keywords[i] = old[i];
}
}
m_Keywords[Count++] = keyword;
return m_EmptyInts;
}
public int[] ToArray()
var keywords = new int[Count];
for (var i = 0; i < Count; ++i)
{
if (Count == 0)
{
return m_EmptyInts;
}
var keywords = new int[Count];
for (var i = 0; i < Count; ++i)
{
keywords[i] = m_Keywords[i];
}
Count = 0;
return keywords;
keywords[i] = m_Keywords[i];
}
Count = 0;
return keywords;
}
}