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
42 #region Static members
43 public static int Compare (SortKey sk1, SortKey sk2)
45 if (Object.ReferenceEquals (sk1, sk2)
46 || Object.ReferenceEquals (sk1.OriginalString,
50 byte [] d1 = sk1.KeyData;
51 byte [] d2 = sk2.KeyData;
53 int len = d1.Length > d2.Length ? d2.Length : d1.Length;
54 for (int i = 0; i < len; i++)
56 return d1 [i] < d2 [i] ? -1 : 1;
57 return d1.Length == d2.Length ? 0 : d1.Length < d2.Length ? -1 : 1;
61 readonly string source;
62 readonly CompareOptions options;
66 // for legacy unmanaged one
67 internal SortKey (int lcid, string source, CompareOptions opt)
74 internal SortKey (int lcid, string source, byte [] buffer, CompareOptions opt,
75 int lv1Length, int lv2Length, int lv3Length,
76 int kanaSmallLength, int markTypeLength,
77 int katakanaLength, int kanaWidthLength,
86 public virtual string OriginalString {
87 get { return source; }
90 public virtual byte [] KeyData {
94 // copy from original SortKey.cs
95 public override bool Equals (object value)
97 SortKey other = (value as SortKey);
99 if((this.lcid==other.lcid) &&
100 (this.options==other.options) &&
101 (Compare (this, other)==0)) {
109 public override int GetHashCode ()
112 return 0; // should not happen though.
114 for (int i = 1; i < key.Length; i++)
115 val ^= (int) key [i] << (i & 3);
119 // copy from original SortKey.cs
120 public override string ToString()
122 return("SortKey - "+lcid+", "+options+", "+source);