Lines Matching refs:size_t
21 Vector(T* data, size_t length, bool isForward)
31 size_t length() const { return length_; }
38 T& operator[](size_t index) const {
45 size_t length_;
99 size_t pattern_length = pattern_.length();
112 size_t Search(Vector subject, size_t index) {
143 typedef size_t (StringSearch::*SearchFunction)(Vector, size_t);
144 size_t SingleCharSearch(Vector subject, size_t start_index);
145 size_t LinearSearch(Vector subject, size_t start_index);
146 size_t InitialSearch(Vector subject, size_t start_index);
147 size_t BoyerMooreHorspoolSearch(Vector subject, size_t start_index);
148 size_t BoyerMooreSearch(Vector subject, size_t start_index);
176 size_t start_;
200 size_t haystack_len) {
205 for (size_t i = haystack_len - 1; i != static_cast<size_t>(-1); i--) {
218 inline size_t FindFirstCharacter(Vector<const Char> pattern,
219 Vector<const Char> subject, size_t index) {
221 const size_t max_n = (subject.length() - pattern.length() + 1);
226 size_t pos = index;
228 const size_t bytes_to_search = (max_n - pos) * sizeof(Char);
248 size_t raw_pos = static_cast<size_t>(char_pos - subject.start());
264 inline size_t FindFirstCharacter(Vector<const uint8_t> pattern,
266 size_t index) {
268 const size_t subj_len = subject.length();
269 const size_t max_n = (subject.length() - pattern.length() + 1);
284 size_t raw_pos = static_cast<size_t>(char_pos - subject.start());
293 size_t StringSearch<Char>::SingleCharSearch(
295 size_t index) {
306 size_t StringSearch<Char>::LinearSearch(
308 size_t index) {
310 const size_t n = subject.length() - pattern_.length();
311 for (size_t i = index; i <= n; i++) {
318 for (size_t j = 1; j < pattern_.length(); j++) {
336 size_t StringSearch<Char>::BoyerMooreSearch(
338 size_t start_index) {
339 const size_t subject_length = subject.length();
340 const size_t pattern_length = pattern_.length();
342 size_t start = start_;
348 size_t index = start_index;
351 size_t j = pattern_length - 1;
387 const size_t pattern_length = pattern_.length();
390 const size_t start = start_;
391 const size_t length = pattern_length - start;
399 for (size_t i = start; i < pattern_length; i++) {
411 size_t suffix = pattern_length + 1;
413 size_t i = pattern_length;
417 if (static_cast<size_t>(shift_table[suffix]) == length) {
426 if (static_cast<size_t>(shift_table[pattern_length]) == length) {
439 for (size_t i = start; i <= pattern_length; i++) {
440 if (static_cast<size_t>(shift_table[i]) == length) {
455 size_t StringSearch<Char>::BoyerMooreHorspoolSearch(
457 size_t start_index) {
458 const size_t subject_length = subject.length();
459 const size_t pattern_length = pattern_.length();
470 size_t index = start_index; // No matches found prior to this index.
472 size_t j = pattern_length - 1;
507 const size_t pattern_length = pattern_.length();
512 const size_t start = start_;
516 const size_t table_size = AlphabetSize();
521 for (size_t i = 0; i < table_size; i++) {
525 for (size_t i = start; i < pattern_length - 1; i++) {
539 size_t StringSearch<Char>::InitialSearch(
541 size_t index) {
542 const size_t pattern_length = pattern_.length();
550 for (size_t i = index, n = subject.length() - pattern_length; i <= n; i++) {
557 size_t j = 1;
582 size_t SearchString(Vector<const Char> subject,
584 size_t start_index) {
594 size_t SearchString(const Char* haystack,
595 size_t haystack_length,
597 size_t needle_length,
598 size_t start_index,
608 size_t diff = haystack_length - needle_length;
609 size_t relative_start_index;
617 size_t pos = node::stringsearch::SearchString(
626 template <size_t N>
627 size_t SearchString(const char* haystack, size_t haystack_length,