[Isolates] Make lint happy.

src/string-search.h

 // Copyright 2010 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 167 matching lines @@
     memset(bad_char_occurrence,
            -1,
            table_size * sizeof(*bad_char_occurrence));
   } else {
     for (int i = 0; i < table_size; i++) {
       bad_char_occurrence[i] = start - 1;
     }
   }
   for (int i = start; i < pattern.length() - 1; i++) {
     PatternChar c = pattern[i];
-    int bucket = (sizeof(PatternChar) ==1) ? c : c % RuntimeState::kBMAlphabetSize;
+    int bucket = (sizeof(PatternChar) ==1)
+        ? c : c % RuntimeState::kBMAlphabetSize;
     bad_char_occurrence[bucket] = i;
   }
 }
 
 
 template <typename PatternChar>
-static void BoyerMoorePopulateGoodSuffixTable(RuntimeState* state,
-                                              Vector<const PatternChar> pattern) {
+static void BoyerMoorePopulateGoodSuffixTable(
+    RuntimeState* state, Vector<const PatternChar> pattern) {
   RuntimeState::BMGoodSuffixBuffers& bmgs_buffers = *state->bmgs_buffers();
   int m = pattern.length();
   int start = m < RuntimeState::kBMMaxShift ? 0 : m - RuntimeState::kBMMaxShift;
   int len = m - start;
   // Compute Good Suffix tables.
   bmgs_buffers.Initialize(m);
 
   bmgs_buffers.shift(m-1) = 1;
   bmgs_buffers.suffix(m) = m + 1;
   PatternChar last_char = pattern[m - 1];
@@ skipping 319 matching lines @@
     case SEARCH_SHORT: return SimpleIndexOf(sub, pat, start_index);
     case SEARCH_LONG: return ComplexIndexOf(state, sub, pat, start_index);
   }
   UNREACHABLE();
   return -1;
 }
 
 }}  // namespace v8::internal
 
 #endif  // V8_STRING_SEARCH_H_