Home
last modified time | relevance | path

Searched refs:haystack_length (Results 1 - 2 of 2) sorted by relevance

/third_party/node/src/
H A Dstring_search.h595 size_t haystack_length, in SearchString()
600 if (haystack_length < needle_length) return haystack_length; in SearchString()
607 haystack, haystack_length, is_forward); in SearchString()
608 size_t diff = haystack_length - needle_length; in SearchString()
619 if (pos == haystack_length) { in SearchString()
623 return is_forward ? pos : (haystack_length - needle_length - pos); in SearchString()
627 size_t SearchString(const char* haystack, size_t haystack_length, in SearchString() argument
630 reinterpret_cast<const uint8_t*>(haystack), haystack_length, in SearchString()
594 SearchString(const Char* haystack, size_t haystack_length, const Char* needle, size_t needle_length, size_t start_index, bool is_forward) SearchString() argument
H A Dnode_buffer.cc931 const size_t haystack_length = (enc == UCS2) ? in IndexOfString() local
937 int64_t opt_offset = IndexOfOffset(haystack_length, in IndexOfString()
948 if (haystack_length == 0) { in IndexOfString()
956 CHECK_LT(offset, haystack_length); in IndexOfString()
957 if ((is_forward && needle_length + offset > haystack_length) || in IndexOfString()
958 needle_length > haystack_length) { in IndexOfString()
962 size_t result = haystack_length; in IndexOfString()
969 if (haystack_length < 2 || needle_value.length() < 1) { in IndexOfString()
983 haystack_length / 2, in IndexOfString()
990 haystack_length / in IndexOfString()
1045 const size_t haystack_length = haystack_contents.length(); IndexOfBuffer() local
[all...]

Completed in 4 milliseconds