public static void AddDirtWord(string word, DirtyWordNode root)
{
DirtyWordNode curNode = root;
char[] arr = word.ToCharArray();
for (int i = 0; i < arr.Length; i++)
{
char c = arr[i];
curNode = curNode.AppendChild(c, i == arr.Length - 1);
}
}
void RebuildMapping()
{
needRebuild = false;
mapping = new Dictionary <string, Sprite>();
rootNode = new DirtyWordNode();
if (data != null)
{
foreach (var i in data)
{
mapping[i.Value] = i.Sprite;
DirtWordService.AddDirtWord(i.Value, rootNode);
}
}
}
public DirtyWordNode AppendChild(char c, bool canTerminate)
{
if (!children.ContainsKey(c))
{
DirtyWordNode node = new DirtyWordNode();
node.Character = c;
node.Word = word + c;
node.CanTerminate = canTerminate;
children.Add(c, node);
return(node);
}
else
{
return(children[c]);
}
}
public static string ReplaceDirtWord(this string str, DirtyWordNode root, out List <DirtyWordNode> match)
{
match = new List <DirtyWordNode>();
if (str == null)
{
return(null);
}
char[] arr = str.ToCharArray();
int curIdx = 0;
int wordIdx = 0;
StringBuilder sb = new StringBuilder();
DirtyWordNode curNode = root;
DirtyWordNode old = curNode;
while (curIdx < str.Length)
{
char c = arr[curIdx + wordIdx];
old = curNode;
curNode = curNode[c];
if (curNode != null)
{
wordIdx++;
if (curNode.Terminated)
{
DirtyWordNode newNode = new DirtyWordNode();
newNode.Word = curNode.Word;
newNode.Index = curIdx;
match.Add(newNode);
for (int i = 0; i < curNode.Word.Length; i++)
{
sb.Append('*');
}
curIdx += wordIdx;
wordIdx = 0;
curNode = root;
}
else if (curIdx + wordIdx >= str.Length)
{
for (int i = 0; i < wordIdx; i++)
{
sb.Append(arr[curIdx + i]);
}
curIdx += wordIdx;
}
}
else
{
if (old != null && old != root)
{
if (old.CanTerminate)
{
DirtyWordNode newNode = new DirtyWordNode();
newNode.Word = curNode.Word;
newNode.Index = curIdx;
match.Add(newNode);
for (int i = 0; i < old.Word.Length; i++)
{
sb.Append('*');
}
}
else
{
sb.Append(old.Word);
}
curNode = root;
curIdx += wordIdx;
wordIdx = 0;
old = null;
}
else
{
sb.Append(c);
curNode = root;
curIdx++;
wordIdx = 0;
}
}
}
if (old != null && old != root)
{
if (old.CanTerminate)
{
DirtyWordNode newNode = new DirtyWordNode();
newNode.Word = curNode.Word;
newNode.Index = curIdx;
match.Add(newNode);
for (int i = 0; i < old.Word.Length; i++)
{
sb.Append('*');
}
}
else
{
sb.Append(old.Word);
}
curNode = root;
curIdx += wordIdx;
wordIdx = 0;
old = null;
}
return(sb.ToString());
}
