2001-09-06 Jeffrey Stedfast <fejj@ximian.com>

	* String.cs (System): Don't mix uint and int.

svn path=/trunk/mcs/; revision=730

diff --git a/mcs/class/corlib/System/String.cs b/mcs/class/corlib/System/String.cs
index 82a72e22b0df8b8bbb6c11b4d8c3b4b48f8b230c..fa6cc692c89a0a377e1c9e50c913792ef0a940e8 100644 (file)
--- a/mcs/class/corlib/System/String.cs
+++ b/mcs/class/corlib/System/String.cs
@@ -200,7 +200,7 @@ namespace System {
                private static int BoyerMoore (char[] haystack, string needle, int startIndex, int count)
                {
                        /* (hopefully) Unicode-safe Boyer-Moore implementation */
-                       uint[] skiptable = new uint[65536];  /* our unicode-safe skip-table */
+                       int[] skiptable = new uint[65536];  /* our unicode-safe skip-table */
                        int h, n, he, ne, hc, nc, i;
 
                        if (haystack == null || needle == null)
@@ -226,7 +226,7 @@ namespace System {
                         * pattern buffer (needle) to the distance from the index to
                         * the end of the pattern buffer. */
                        for (nc = 0; nc < ne; nc++)
-                               skiptable[(uint) needle[nc]] = ne - nc;
+                               skiptable[(int) needle[nc]] = ne - nc;
 
                        h = startIndex;
                        while (count >= needle.Length) {
@@ -239,7 +239,7 @@ namespace System {
                                                break;
 
                                if (needle[nc] != haystack[hc]) {
-                                       n = skiptable[(uint) haystack[hc]] - i;
+                                       n = skiptable[(int) haystack[hc]] - i;
                                        h += n;
                                        count -= n;
                                } else