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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
//
// CodePointIndexer.cs : indexing table optimizer
//
// Author:
// Atsushi Enomoto <atsushi@ximian.com>
//
// Copyright (C) 2005 Novell, Inc (http://www.novell.com)
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
using System;
using System.Globalization;
using System.Text;
namespace Mono.Globalization.Unicode
{
internal class CodePointIndexer
{
public static Array CompressArray (
Array source, Type type, CodePointIndexer indexer)
{
int totalCount = 0;
for (int i = 0; i < indexer.ranges.Length; i++)
totalCount += indexer.ranges [i].Count;
Array ret = Array.CreateInstance (type, totalCount);
for (int i = 0; i < indexer.ranges.Length; i++)
Array.Copy (
source,
indexer.ranges [i].Start,
ret,
indexer.ranges [i].IndexStart,
indexer.ranges [i].Count);
return ret;
}
// This class is used to compactize indexes to limited areas so that
// we can save extraneous 0,0,0,0,0... in the tables.
[Serializable]
internal struct TableRange
{
public TableRange (int start, int end, int indexStart)
{
Start = start;
End = end;
Count = End - Start;
IndexStart = indexStart;
IndexEnd = IndexStart + Count;
}
public readonly int Start;
public readonly int End;
public readonly int Count;
public readonly int IndexStart;
public readonly int IndexEnd;
}
readonly TableRange [] ranges;
public readonly int TotalCount;
int defaultIndex;
int defaultCP;
public CodePointIndexer (int [] starts, int [] ends, int defaultIndex, int defaultCP)
{
this.defaultIndex = defaultIndex;
this.defaultCP = defaultCP;
ranges = new TableRange [starts.Length];
for (int i = 0; i < ranges.Length; i++)
ranges [i] = new TableRange (starts [i],
ends [i], i == 0 ? 0 :
ranges [i - 1].IndexStart +
ranges [i - 1].Count);
for (int i = 0; i < ranges.Length; i++)
TotalCount += ranges [i].Count;
// for (int i = 0; i < ranges.Length; i++)
// Console.Error.WriteLine ("RANGES [{0}] : {1:x} to {2:x} index {3:x} to {4:x}. total {5:x}", i, ranges [i].Start, ranges [i].End, ranges [i].IndexStart, ranges [i].IndexEnd, ranges [i].Count);
// Console.Error.WriteLine ("Total items: {0:X} ({1})", TotalCount, TotalCount);
}
public int ToIndex (int cp)
{
for (int t = 0; t < ranges.Length; t++) {
if (cp < ranges [t].Start)
return defaultIndex;
else if (cp < ranges [t].End)
return cp - ranges [t].Start + ranges [t].IndexStart;
}
return defaultIndex;
// throw new SystemException (String.Format ("Should not happen: no map definition for cp {0:x}({1})", cp, (char) cp));
}
public int ToCodePoint (int i)
{
for (int t = 0; t < ranges.Length; t++) {
/*
if (t > 0 && i < ranges [t - 1].IndexEnd)
return defaultCP; // unexpected out of range
if (ranges [t].IndexStart <= i &&
i < ranges [t].IndexEnd)
return i - ranges [t].IndexStart
+ ranges [t].Start;
*/
if (i < ranges [t].IndexStart)
return defaultCP;
if (i < ranges [t].IndexEnd)
return i - ranges [t].IndexStart
+ ranges [t].Start;
}
return defaultCP;
// throw new SystemException (String.Format ("Should not happen: no map definition for index {0:x}({1})", i, i));
}
}
}
|
