* No failures on our own tests....

test/mjsunit/unicode-test.js

 // Copyright 2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 9111 matching lines @@
           c.charCodeAt(0) - 20 < last_c) {
         re += "-" + c;
         last_c = -9999;
       } else {
         re += c;
         last_c = c.charCodeAt(0);
       }
     }
   }
   re += "]+)";
+  //dump_re(re);

[Christian Plesner Hansen, 2008/11/18 14:07:41]

?

   var char_class = new RegExp(re, "g");
   var munged = text.replace(char_class, "foo");
   assertEquals(munged_sizes[i - 1], munged.length, "munged size " + i);
 }
 
+
+function hex(x) {
+  x &= 15;
+  if (x < 10) {
+    return String.fromCharCode(x + 48);
+  } else {
+    return String.fromCharCode(x + 97 - 10);
+  }
+}
+
+
+function dump_re(re) {
+  var out = "";
+  for (var i = 0; i < re.length; i++) {
+    var c = re.charCodeAt(i);
+    if (c >= 32 && c <= 126) {
+      out += re[i];
+    } else if (c < 256) {
+      out += "\\x" + hex(c >> 4) + hex(c);
+    } else {
+      out += "\\u" + hex(c >> 12) + hex(c >> 8) + hex(c >> 4) + hex(c);
+    }
+  }
+  print ("re = " + out);
+}
+
 var thai_l_thingy = "\u0e44";
 var thai_l_regexp = new RegExp(thai_l_thingy);
 var thai_l_regexp2 = new RegExp("[" + thai_l_thingy + "]");
 assertTrue(thai_l_regexp.test(thai_l_thingy));
 assertTrue(thai_l_regexp2.test(thai_l_thingy));