2 // System.Globalization.SortKey.cs
5 // Dick Porter (dick@ximian.com)
7 // (C) 2002 Ximian, Inc.
11 // Copyright (C) 2004 Novell, Inc (http://www.novell.com)
13 // Permission is hereby granted, free of charge, to any person obtaining
14 // a copy of this software and associated documentation files (the
15 // "Software"), to deal in the Software without restriction, including
16 // without limitation the rights to use, copy, modify, merge, publish,
17 // distribute, sublicense, and/or sell copies of the Software, and to
18 // permit persons to whom the Software is furnished to do so, subject to
19 // the following conditions:
21 // The above copyright notice and this permission notice shall be
22 // included in all copies or substantial portions of the Software.
24 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
33 namespace System.Globalization {
36 [System.Runtime.InteropServices.ComVisible(true)]
39 public class SortKey {
41 private CompareOptions options;
45 /* Hide the .ctor() */
48 internal SortKey (int lcid, string source, CompareOptions options)
52 this.options = options;
55 public virtual byte[] KeyData
62 public virtual string OriginalString
69 public static int Compare (SortKey sortkey1, SortKey sortkey2)
71 if (sortkey1 == null) {
72 throw new ArgumentNullException ("sortkey1");
74 if (sortkey2 == null) {
75 throw new ArgumentNullException ("sortkey2");
78 byte[] keydata1 = sortkey1.key;
79 byte[] keydata2 = sortkey2.key;
81 if (keydata1.Length == 0) {
82 if (keydata2.Length == 0) {
88 int min_len = (keydata1.Length < keydata2.Length) ? keydata1.Length : keydata2.Length;
90 for (int i = 0; i < min_len; i++) {
91 if (keydata1[i] > keydata2[i]) {
93 } else if (keydata1[i] < keydata2[i]) {
98 if (keydata1.Length < keydata2.Length) {
100 } else if (keydata1.Length > keydata2.Length) {
107 public override bool Equals (object value)
109 SortKey other = (value as SortKey);
111 if ((this.lcid == other.lcid) &&
112 (this.options == other.options) &&
113 (Compare (this, other) == 0)) {
121 public override int GetHashCode ()
123 return str.GetHashCode ();
126 public override string ToString ()
128 return ("SortKey - " + lcid + ", " + options + ", " + str);