< prev index next >

src/hotspot/share/libadt/set.cpp

Print this page
rev 50962 : [mq]: 8207011

@@ -62,11 +62,11 @@
   set.Sort();                   // Sort elements for in-order retrieval
 
   uint len = 128;               // Total string space
   char *buf = NEW_C_HEAP_ARRAY(char,len, mtCompiler);// Some initial string space
 
-  register char *s = buf;       // Current working string pointer
+  char *s = buf;                // Current working string pointer
   *s++ = '{';
   *s = '\0';
 
   // For all elements of the Set
   uint hi = (uint)-2, lo = (uint)-2;

@@ -114,12 +114,12 @@
 //------------------------------parse------------------------------------------
 // Convert a textual representation of a Set, to a Set and union into "this"
 // Set.  Return the amount of text parsed in "len", or zero in "len".
 int Set::parse(const char *s)
 {
-  register char c;              // Parse character
-  register const char *t = s;   // Save the starting position of s.
+  char c;                       // Parse character
+  const char *t = s;            // Save the starting position of s.
   do c = *s++;                  // Skip characters
   while( c && (c <= ' ') );     // Till no more whitespace or EOS
   if( c != '{' ) return 0;      // Oops, not a Set openner
   if( *s == '}' ) return 2;     // The empty Set
 
< prev index next >