Lines Matching defs:to
61 // we abort due to reaching the recursion limit.
262 // No need to flatten if we are going to find the answer on the first
264 // in each string, due to the trivial case handling above.
291 // We have a fast integer-only case here to avoid a conversion to double in
292 // the common case where from and to are Smis.
377 int to = offsets.at(i * 2 + 1);
379 isolate->factory()->NewProperSubString(subject, from, to);
395 // Flatten the string. If someone wants to get a char at an index
633 // array_length is length of original array (used to add separators);
634 // separator is string to put between elements. Assumed to be non-empty.
682 // means that the string is too large to create.
716 // Copies Latin1 characters to the given fixed array looking up
747 // Converts a String to JSArray.
769 // to prevent GC from seeing partially initialized array.
797 // fitting into one-byte when converting to uppercase.
820 // Convert all characters to upper case, assuming that they will fit
845 // input but here is a character that converts to several
850 // memcpy what we already have to the result string. Also,
853 // extend the existing string to be able to hold the full
865 // the next character may affect what a character converts to,
867 // to.
878 // to allocate a two-byte string for to uppercase.
895 // become garbage; there is no reason to keep two identical strings
1158 // equality is 0 and inequality is 1 so we have to negate the result
