fix the build
[mcs.git] / class / corlib / System.Globalization / SortKey.cs
blobbaaa584027d330831a8ae5e347d5eda9a6a020e5
1 //
2 // System.Globalization.SortKey.cs
3 //
4 // Author:
5 // Dick Porter (dick@ximian.com)
6 //
7 // (C) 2002 Ximian, Inc.
8 //
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:
20 //
21 // The above copyright notice and this permission notice shall be
22 // included in all copies or substantial portions of the Software.
23 //
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 {
35 [System.Runtime.InteropServices.ComVisible(true)]
36 [Serializable]
37 public class SortKey {
38 private string str;
39 private CompareOptions options;
40 private byte[] key;
41 private int lcid;
43 /* Hide the .ctor() */
44 SortKey () {}
46 internal SortKey (int lcid, string source, CompareOptions options)
48 this.lcid = lcid;
49 str = source;
50 this.options = options;
53 public virtual byte[] KeyData
55 get {
56 return key;
60 public virtual string OriginalString
62 get {
63 return str;
67 public static int Compare (SortKey sortkey1, SortKey sortkey2)
69 if (sortkey1 == null) {
70 throw new ArgumentNullException ("sortkey1");
72 if (sortkey2 == null) {
73 throw new ArgumentNullException ("sortkey2");
76 byte[] keydata1 = sortkey1.key;
77 byte[] keydata2 = sortkey2.key;
79 if (keydata1.Length == 0) {
80 if (keydata2.Length == 0) {
81 return 0;
83 return -1;
86 int min_len = (keydata1.Length < keydata2.Length) ? keydata1.Length : keydata2.Length;
88 for (int i = 0; i < min_len; i++) {
89 if (keydata1[i] > keydata2[i]) {
90 return 1;
91 } else if (keydata1[i] < keydata2[i]) {
92 return -1;
96 if (keydata1.Length < keydata2.Length) {
97 return -1;
98 } else if (keydata1.Length > keydata2.Length) {
99 return 1;
100 } else {
101 return 0;
105 public override bool Equals (object value)
107 SortKey other = (value as SortKey);
108 if (other != null) {
109 if ((this.lcid == other.lcid) &&
110 (this.options == other.options) &&
111 (Compare (this, other) == 0)) {
112 return true;
116 return false;
119 public override int GetHashCode ()
121 return str.GetHashCode ();
124 public override string ToString ()
126 return ("SortKey - " + lcid + ", " + options + ", " + str);