Function TEST

be/src/experiments/string-search-sse-test.cc:81–113

}

TEST(StringSearchTest, Basic) {
  // Basic Tests
  TestSearch("abcd", "a");
  TestSearch("abcd", "ab");
  TestSearch("abcd", "c");
  TestSearch("abcd", "cd");
  TestSearch("", "");
  TestSearch("abc", "");
  TestSearch("", "a");

  // Test single chars
  TestSearch("a", "a");
  TestSearch("a", "b");
  TestSearch("abc", "b");

  // Haystack is not full string
  TestSearch("abcabcd", "abc", 5);
  TestSearch("abcabcd", "abcd", 5);
  TestSearch("abcabcd", "abcd", 0);

  // Haystack and needle not full len
  TestSearch("abcde", "abaaaaaa", 4, 2);
  TestSearch("abcde", "abaaaaaa", 4, 3);
  TestSearch("abcdabaaaaa", "abaaaaaa", 4, 3);
  TestSearch("abcdabaaaaa", "abaaaaaa", 4, 0);
  TestSearch("abcdabaaaaa", "abaaaaaa", 0, 0);

  // Test last bit, this is the interesting edge case
  TestSearch("abcde", "e");
  TestSearch("abcde", "de");
  TestSearch("abcdede", "cde");
  TestSearch("abcdacde", "cde");
}
}

IMPALA_TEST_MAIN();