2 * Copyright (C) 2013 FooProject
\r
3 * * 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
\r
4 * the Free Software Foundation; either version 3 of the License, or (at your option) any later version.
\r
6 * This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
\r
7 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
\r
9 You should have received a copy of the GNU General Public License along with this program. If not, see <http://www.gnu.org/licenses/>.
\r
12 using System.Collections.Generic;
\r
13 using System.Globalization;
\r
16 using System.Threading;
\r
17 using Slusser.Collections.Generic;
\r
19 namespace FooEditEngine
\r
22 /// ランダムアクセス可能な列挙子を提供するインターフェイス
\r
24 /// <typeparam name="T"></typeparam>
\r
25 public interface IRandomEnumrator<T>
\r
30 /// <param name="index">インデックス</param>
\r
31 /// <returns>Tを返す</returns>
\r
32 T this[int index]{get;}
\r
35 sealed class StringBuffer : IEnumerable<char>, IRandomEnumrator<char>
\r
37 GapBuffer<char> buf = new GapBuffer<char>();
\r
39 public StringBuffer()
\r
41 this.Update += (s, e) => { };
\r
44 public StringBuffer(StringBuffer buffer)
\r
47 buf.AddRange(buffer.buf, buffer.Length);
\r
50 public char this[int index]
\r
54 char c = buf[index];
\r
59 public string ToString(int index, int length)
\r
61 StringBuilder temp = new StringBuilder();
\r
63 for (int i = index; i < index + length; i++)
\r
64 temp.Append(buf[i]);
\r
65 return temp.ToString();
\r
68 public IEnumerable<string> GetLines(int startIndex, int endIndex, int maxCharCount = -1)
\r
70 foreach (Tuple<int, int> range in this.ForEachLines(startIndex, endIndex, maxCharCount))
\r
72 StringBuilder temp = new StringBuilder();
\r
74 int lineEndIndex = range.Item1;
\r
75 if (range.Item2 > 0)
\r
76 lineEndIndex += range.Item2 - 1;
\r
77 for (int i = range.Item1; i <= lineEndIndex; i++)
\r
78 temp.Append(buf[i]);
\r
79 yield return temp.ToString();
\r
83 public IEnumerable<Tuple<int,int>> ForEachLines(int startIndex, int endIndex, int maxCharCount = -1)
\r
85 int currentLineHeadIndex = startIndex;
\r
86 int currentLineLength = 0;
\r
88 for (int i = startIndex; i <= endIndex; i++)
\r
90 currentLineLength++;
\r
91 char c = this.buf[i];
\r
92 if (c == Document.NewLine ||
\r
93 (maxCharCount != -1 && currentLineLength >= maxCharCount))
\r
95 UnicodeCategory uc = CharUnicodeInfo.GetUnicodeCategory(c);
\r
96 if (uc != UnicodeCategory.NonSpacingMark &&
\r
97 uc != UnicodeCategory.SpacingCombiningMark &&
\r
98 uc != UnicodeCategory.EnclosingMark &&
\r
99 uc != UnicodeCategory.Surrogate)
\r
101 yield return new Tuple<int,int>(currentLineHeadIndex, currentLineLength);
\r
102 currentLineHeadIndex += currentLineLength;
\r
103 currentLineLength = 0;
\r
107 if (currentLineLength > 0)
\r
108 yield return new Tuple<int, int>(currentLineHeadIndex, currentLineLength);
\r
113 get { return this.buf.Count; }
\r
116 internal event DocumentUpdateEventHandler Update;
\r
118 internal void Replace(StringBuffer buf)
\r
120 this.Replace(buf.buf);
\r
123 internal void Replace(GapBuffer<char> buf)
\r
127 this.Update(this, new DocumentUpdateEventArgs(UpdateType.Replace, 0, 0, buf.Count));
\r
130 internal void Replace(int index, int length, IEnumerable<char> chars,int count)
\r
133 this.buf.RemoveRange(index, length);
\r
134 this.buf.InsertRange(index, chars,count);
\r
135 this.Update(this, new DocumentUpdateEventArgs(UpdateType.Replace, index, length, count));
\r
138 internal void Replace(string target, string pattern,bool ci = false)
\r
140 TextSearch ts = new TextSearch(target,ci);
\r
141 int left = 0, right = 0;
\r
142 char[] pattern_chars = pattern.ToCharArray();
\r
143 while((right = ts.IndexOf(this.buf,left)) != -1)
\r
145 this.buf.RemoveRange(right, target.Length);
\r
146 this.buf.InsertRange(right, pattern_chars, pattern.Length);
\r
147 left = right + pattern.Length;
\r
149 this.Update(this, new DocumentUpdateEventArgs(UpdateType.Clear, -1, -1, -1));
\r
150 this.Update(this, new DocumentUpdateEventArgs(UpdateType.Replace, 0, 0, buf.Count));
\r
153 internal int IndexOf(string target, int start,bool ci = false)
\r
155 TextSearch ts = new TextSearch(target,ci);
\r
156 return ts.IndexOf(this.buf, start);
\r
162 internal void Clear()
\r
165 this.Update(this, new DocumentUpdateEventArgs(UpdateType.Clear, 0, this.buf.Count,0));
\r
168 internal IEnumerable<char> GetEnumerator(int start, int length)
\r
170 for (int i = start; i < start + length; i++)
\r
171 yield return this.buf[i];
\r
174 #region IEnumerable<char> メンバー
\r
176 public IEnumerator<char> GetEnumerator()
\r
178 for (int i = 0; i < this.Length; i++)
\r
179 yield return this.buf[i];
\r
184 #region IEnumerable メンバー
\r
186 System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
\r
188 for (int i = 0; i < this.Length; i++)
\r
189 yield return this[i];
\r
195 sealed class TextSearch
\r
199 Dictionary<char, int> qsTable = new Dictionary<char, int>();
\r
200 bool caseInsenstive;
\r
201 public TextSearch(string pattern,bool ci = false)
\r
203 this.patternLength = pattern.Length;
\r
204 this.caseInsenstive = ci;
\r
207 this.CreateQSTable(pattern.ToLower());
\r
208 this.CreateQSTable(pattern.ToUpper());
\r
209 this.pattern = new char[pattern.Length];
\r
210 for (int i = 0; i < pattern.Length; i++)
\r
211 this.pattern[i] = CharTool.ToUpperFastIf(pattern[i]);
\r
215 this.CreateQSTable(pattern);
\r
216 this.pattern = pattern.ToCharArray();
\r
219 void CreateQSTable(string pattern)
\r
221 int len = pattern.Length;
\r
222 for (int i = 0; i < len; i++)
\r
224 if (!this.qsTable.ContainsKey(pattern[i]))
\r
225 this.qsTable.Add(pattern[i], len - i);
\r
227 this.qsTable[pattern[i]] = len - i;
\r
230 public int IndexOf(GapBuffer<char> buf, int start)
\r
233 int buflen = buf.Count - 1;
\r
234 int plen = this.patternLength;
\r
236 int end = buf.Count - plen;
\r
238 if (this.caseInsenstive)
\r
245 if (CharTool.ToUpperFastIf(buf[i + j]) != this.pattern[j])
\r
256 if (k <= buflen) //buffer以降にアクセスする可能性がある
\r
259 if (this.qsTable.TryGetValue(buf[k], out moveDelta))
\r
279 if (buf[i + j] != this.pattern[j])
\r
290 if (k <= buflen) //buffer以降にアクセスする可能性がある
\r
293 if (this.qsTable.TryGetValue(buf[k], out moveDelta))
\r
308 static class CharTool
\r
311 /// Converts characters to lowercase.
\r
313 const string _lookupStringL =
\r
314 "---------------------------------!-#$%&-()*+,-./0123456789:;<=>?@abcdefghijklmnopqrstuvwxyz[-]^_`abcdefghijklmnopqrstuvwxyz{|}~-";
\r
317 /// Converts characters to uppercase.
\r
319 const string _lookupStringU =
\r
320 "---------------------------------!-#$%&-()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[-]^_`ABCDEFGHIJKLMNOPQRSTUVWXYZ{|}~-";
\r
323 /// Get lowercase version of this ASCII character.
\r
325 public static char ToLower(char c)
\r
327 return _lookupStringL[c];
\r
331 /// Get uppercase version of this ASCII character.
\r
333 public static char ToUpper(char c)
\r
335 return _lookupStringU[c];
\r
339 /// Translate uppercase ASCII characters to lowercase.
\r
341 public static char ToLowerFastIf(char c)
\r
343 if (c >= 'A' && c <= 'Z')
\r
345 return (char)(c + 32);
\r
354 /// Translate lowercase ASCII characters to uppercase.
\r
356 public static char ToUpperFastIf(char c)
\r
358 if (c >= 'a' && c <= 'z')
\r
360 return (char)(c - 32);
\r