5 // Atsushi Enomoto <atsushi@ximian.com>
7 // Copyright (C) 2005 Novell, Inc (http://www.novell.com)
9 // Permission is hereby granted, free of charge, to any person obtaining
10 // a copy of this software and associated documentation files (the
11 // "Software"), to deal in the Software without restriction, including
12 // without limitation the rights to use, copy, modify, merge, publish,
13 // distribute, sublicense, and/or sell copies of the Software, and to
14 // permit persons to whom the Software is furnished to do so, subject to
15 // the following conditions:
17 // The above copyright notice and this permission notice shall be
18 // included in all copies or substantial portions of the Software.
20 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
21 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
22 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
23 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
24 // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
25 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
26 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
30 // This file works with our managed collation implementation.
35 using System.Globalization;
37 namespace System.Globalization
41 #region Static members
42 public static int Compare (SortKey sk1, SortKey sk2)
44 if (Object.ReferenceEquals (sk1, sk2)
45 || Object.ReferenceEquals (sk1.OriginalString,
49 byte [] d1 = sk1.KeyData;
50 byte [] d2 = sk2.KeyData;
52 int len = d1.Length > d2.Length ? d2.Length : d1.Length;
53 for (int i = 0; i < len; i++)
55 return d1 [i] < d2 [i] ? -1 : 1;
56 return d1.Length == d2.Length ? 0 : d1.Length < d2.Length ? -1 : 1;
60 readonly string source;
61 readonly CompareOptions options;
65 // for legacy unmanaged one
66 internal SortKey (int lcid, string source, CompareOptions opt)
73 internal SortKey (int lcid, string source, byte [] buffer, CompareOptions opt,
74 int lv1Length, int lv2Length, int lv3Length,
75 int kanaSmallLength, int markTypeLength,
76 int katakanaLength, int kanaWidthLength,
85 public string OriginalString {
86 get { return source; }
89 public byte [] KeyData {
93 // copy from original SortKey.cs
94 public override bool Equals (object value)
96 SortKey other = (value as SortKey);
98 if((this.lcid==other.lcid) &&
99 (this.options==other.options) &&
100 (Compare (this, other)==0)) {
108 public override int GetHashCode ()
111 return 0; // should not happen though.
113 for (int i = 1; i < key.Length; i++)
114 val ^= (int) key [i] << (i & 3);
118 // copy from original SortKey.cs
119 public override string ToString()
121 return("SortKey - "+lcid+", "+options+", "+source);