Search some code: Max results:

Found 20103 results in 5037 files (6505KB index data, 29578 ngram matches, 7182 docs considered, 6710 docs (200MB) loaded, 426 docs skipped): for
substr:"needle" with options &zoekt.SearchOptions{EstimateDocCount:false, Whole:false, ShardMaxMatchCount:250, TotalMaxMatchCount:1000000, ShardMaxImportantMatch:2, TotalMaxImportantMatch:100, MaxWallTime:10000000000}
in 907.401017ms (queued: 2.117┬Ás)

chromium.googlesource.com/external/github.com/kripken/emscripten:tools/node_modules/source-map/lib/source-map/source-map-consumer.js:[master, ]

268:       var needle = {
346:       var needle = {
228:    * Find the mapping that best matches the hypothetical "needle" mapping that
273:       var mapping = this._findMapping(needle,
353:         needle.source = util.relative(this.sourceRoot, needle.source);
356:       var mapping = this._findMapping(needle,
232:     function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,
239:       if (aNeedle[aLineName] <= 0) {
241:                             + aNeedle[aLineName]);
243:       if (aNeedle[aColumnName] < 0) {
245:                             + aNeedle[aColumnName]);
248:       return binarySearch.search(aNeedle, aMappings, aComparator);
eclipse.googlesource.com/jgit/jgit:org.eclipse.jgit/src/org/eclipse/jgit/util/RawSubStringPattern.java:[master, ]
59: 	private final byte[] needle;
57: 	private final String needleString;
75: 		needle = new byte[b.length];
77: 			needle[i] = lc(b[i]);
91: 		final int needleLen = needle.length;
92: 		final byte first = needle[0];
109: 				if (neq(needle[j], text[si]))
72: 		needleString = patternText;
96: 		final int maxPos = rcs.endPtr - needleLen;
108: 			for (int j = 1; j < needleLen; j++, si++) {
131: 		return needleString;
github.com/html5rocks/www.html5rocks.com:static/demos/lemdoodle/examples/lem-embedded/lem-const.js:[master, ]
172:   'needle': ['intro-finale/items-needle-thread', 'intro-finale/items-needle'],
223:     'needle', 'halo', 'noodles', 'neutron', 'nose'
android.googlesource.com/platform/superproject:external/clang/lib/Sema/AnalysisBasedWarnings.cpp:[master, ]
591:   const DeclRefExpr *Needle;
587: /// a particular declaration (the needle) within any evaluated component of an
596:   ContainsReference(ASTContext &Context, const DeclRefExpr *Needle)
597:     : Inherited(Context), FoundReference(false), Needle(Needle) {}
608:     if (E == Needle)
github.com/GoogleChrome/chrome-app-samples:samples/text-editor/lib/ace/mode/text.js:[master, ]
135:             needle: needle
117:         var needle = line.substring(Math.max(startOuter, 0),
121:         if ((startOuter >= 0 && /^[\w\d]/.test(needle)) ||
122:             (endOuter <= lineCols && /[\w\d]$/.test(needle)))
125:         needle = line.substring(selection.start.column, selection.end.column);
126:         if (!/^[\w\d]+$/.test(needle))
chromium.googlesource.com/native_client/nacl-toolchain:newlib/newlib/libc/string/memmem.c:[master, ]
58:   const unsigned char *needle = (const unsigned char *) needle_start;
24: 	lengths of your haystack and needle, <<memmem>> can be much
49: _DEFUN (memmem, (haystack_start, haystack_len, needle_start, needle_len),
52: 	const void *needle_start _AND
53: 	size_t needle_len)
60:   if (needle_len == 0)
68:   while (needle_len <= haystack_len)
70:       if (!memcmp (haystack, needle, needle_len))
83:   if (haystack_len < needle_len)
90:   if (needle_len < LONG_NEEDLE_THRESHOLD)
92:       haystack = memchr (haystack, *needle, haystack_len);
93:       if (!haystack || needle_len == 1)
96:       if (haystack_len < needle_len)
98:       return two_way_short_needle (haystack, haystack_len, needle, needle_len);
100:   return two_way_long_needle (haystack, haystack_len, needle, needle_len);
88:      coefficient.  However, avoid memchr for long needles, since we
chromium.googlesource.com/external/github.com/Microsoft/ChakraCore:test/Regex/captures.js:[master, ]
60: var needle = /(bc)/;
63: haystack.match(needle);
67: needle = /xy/;
68: haystack.match(needle);
github.com/GoogleChrome/chrome-app-samples:samples/text-editor/lib/ace/editor_highlight_selected_word_test.js:[master, ]
139:             needle: "Mauris"
194:             needle: "consectetur"
chromium.googlesource.com/native_client/nacl-newlib:newlib/libc/string/memmem.c:[master, ]
duplicate result
github.com/GoogleCloudPlatform/appengine-php:php-src/ext/mbstring/libmbfl/mbfl/mbfilter.c:[master, ]
874: 	mbfl_wchar_device needle;
875: 	int needle_len;
879: 	int needle_pos;
890: 		if (c == (int)pc->needle.buffer[pc->needle_pos]) {
891: 			if (pc->needle_pos == 0) {
894: 			pc->needle_pos++;						/* needle pointer */
895: 			if (pc->needle_pos >= pc->needle_len) {
897: 				pc->needle_pos--;
900: 		} else if (pc->needle_pos != 0) {
902: 			h = (int *)pc->needle.buffer;
907: 				m = (int *)pc->needle.buffer;
908: 				n = pc->needle_pos - 1;
916: 						pc->needle_pos = 0;
921: 					pc->needle_pos--;
982:     mbfl_string *needle,
987: 	mbfl_string _haystack_u8, _needle_u8;
988: 	const mbfl_string *haystack_u8, *needle_u8;
991: 	if (haystack == NULL || haystack->val == NULL || needle == NULL || needle->val == NULL) {
1015: 	if (needle->no_encoding != mbfl_no_encoding_utf8) {
1016: 		mbfl_string_init(&_needle_u8);
1017: 		needle_u8 = mbfl_convert_encoding(needle, &_needle_u8, mbfl_no_encoding_utf8);
1018: 		if (needle_u8 == NULL) {
1023: 		needle_u8 = needle;
1026: 	if (needle_u8->len < 1) {
1032: 	if (haystack_u8->len < needle_u8->len) {
1038: 		unsigned int needle_u8_len = needle_u8->len;
1042: 		                    *needle_u8_val = needle_u8->val;
1044: 			jtbl[i] = needle_u8_len + 1;
1046: 		for (i = 0; i < needle_u8_len - 1; ++i) {
1047: 			jtbl[needle_u8_val[i]] = needle_u8_len - i;
1058: 		p += needle_u8_len;
1064: 			q = needle_u8_val + needle_u8_len;
1066: 				if (q == needle_u8_val) {
1089: 		unsigned int needle_u8_len = needle_u8->len, needle_len = 0;
1093: 		                    *needle_u8_val = needle_u8->val;
1095: 			jtbl[i] = needle_u8_len;
1097: 		for (i = needle_u8_len - 1; i > 0; --i) {
1098: 			unsigned char c = needle_u8_val[i];
1101: 				++needle_len;
1103: 				++needle_len;
1107: 			unsigned char c = needle_u8_val[0];
1109: 				++needle_len;
1111: 				++needle_len;
1116: 		qe = needle_u8_val + needle_u8_len;
1118: 			if (-offset > needle_len) {
1119: 				offset += needle_len; 
1144: 		if (p < e + needle_u8_len) {
1147: 		p -= needle_u8_len;
1150: 			q = needle_u8_val;
1154: 					p -= needle_u8_len;
1180: 	if (needle_u8 == &_needle_u8) {
1181: 		mbfl_string_clear(&_needle_u8);
1193:     mbfl_string *needle
1201: 	if (haystack == NULL || needle == NULL) {
1204: 	/* needle is converted into wchar */
1205: 	mbfl_wchar_device_init(&pc.needle);
1207: 	  needle->no_encoding,
1209: 	  mbfl_wchar_device_output, 0, &pc.needle);
1213: 	p = needle->val;
1214: 	n = needle->len;
1225: 	pc.needle_len = pc.needle.pos;
1226: 	if (pc.needle.buffer == NULL) {
1229: 	if (pc.needle_len <= 0) {
1230: 		mbfl_wchar_device_clear(&pc.needle);
1239: 		mbfl_wchar_device_clear(&pc.needle);
1244: 	pc.needle_pos = 0;
1260: 				pc.needle_pos = 0;
1267: 	mbfl_wchar_device_clear(&pc.needle);
android.googlesource.com/platform/external/chromium:chrome/browser/sync/syncable/syncable.h:[master, ]
1002:     EntryKernel needle;
1001:     // look something up in an index.  Needle in haystack metaphor.
chromium.googlesource.com/infra/infra/codesearch:appengine/third_party/npm_modules/node_modules/vulcanize/node_modules/uglify-js/node_modules/source-map/lib/source-map/source-map-consumer.js:[master, ]
305:       var needle = {
394:       var needle = {
265:    * Find the mapping that best matches the hypothetical "needle" mapping that
310:       var mapping = this._findMapping(needle,
316:       if (mapping && mapping.generatedLine === needle.generatedLine) {
401:         needle.source = util.relative(this.sourceRoot, needle.source);
404:       var mapping = this._findMapping(needle,
269:     function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,
276:       if (aNeedle[aLineName] <= 0) {
278:                             + aNeedle[aLineName]);
280:       if (aNeedle[aColumnName] < 0) {
282:                             + aNeedle[aColumnName]);
285:       return binarySearch.search(aNeedle, aMappings, aComparator);
chromium.googlesource.com/infra/infra/codesearch:appengine/third_party/npm_modules/node_modules/karma/node_modules/source-map/lib/source-map/source-map-consumer.js:[master, ]
310:       var needle = {
399:       var needle = {
270:    * Find the mapping that best matches the hypothetical "needle" mapping that
315:       var mapping = this._findMapping(needle,
321:       if (mapping && mapping.generatedLine === needle.generatedLine) {
406:         needle.source = util.relative(this.sourceRoot, needle.source);
409:       var mapping = this._findMapping(needle,
274:     function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,
281:       if (aNeedle[aLineName] <= 0) {
283:                             + aNeedle[aLineName]);
285:       if (aNeedle[aColumnName] < 0) {
287:                             + aNeedle[aColumnName]);
290:       return binarySearch.search(aNeedle, aMappings, aComparator);
chromium.googlesource.com/arc/arc:third_party/android/external/chromium/chrome/browser/sync/syncable/syncable.h:[master, ]
duplicate result
github.com/fuchsia-mirror/third_party-cmake:Source/cmTarget.cxx:[master, ]
565:   const cmSourceFileLocation& Needle;
581:   const cmSourceFileLocation& Needle;
567:   LocationMatcher(const cmSourceFileLocation& needle)
568:     : Needle(needle)
574:     return loc.Matches(this->Needle);
584:   TargetPropertyEntryFinder(const cmSourceFileLocation& needle)
585:     : Needle(needle)
595:                    CreateLocation(this->Needle.GetMakefile()));
598:                         LocationMatcher(this->Needle)) != locations.end();
chromium.googlesource.com/arc/arc:third_party/nacl-newlib/newlib/libc/string/memmem.c:[master, ]
duplicate result
github.com/yeoman/generator-angular:route/index.js:[master, ]
63:     needle: '.otherwise',
github.com/html5rocks/www.html5rocks.com:content/tutorials/doodles/lem/static/code/lem-const.js:[master, ]
185:   'needle': ['intro-finale/items-needle-thread', 'intro-finale/items-needle'],
236:     'needle', 'halo', 'noodles', 'neutron', 'nose'
github.com/google/rekall:rekall-core/rekall/scan.py:[master, ]
163:     needle = None
164:     needle_offset = None
539:     needles = []
55:         """Is the needle found at 'offset'?
59:             checked for the needle.
166:     def __init__(self, needle=None, needle_offset=0, **kwargs):
168:         self.needle = needle
169:         self.needle_offset = needle_offset
173:         buffer_offset = buffer_as.get_buffer_offset(offset) + self.needle_offset
174:         if buffer_as.data.startswith(self.needle, buffer_offset):
175:             return self.needle
178:         # Search the rest of the buffer for the needle.
179:         buffer_offset = buffer_as.get_buffer_offset(offset) + self.needle_offset
180:         dindex = buffer_as.data.find(self.needle, buffer_offset + 1)
531:             yield ("StringCheck", dict(needle=expected_bytes,
532:                                        needle_offset=rel_offset + array_offset))
552:                 needle=self.needles[0])
92:     def __init__(self, needles=None, **kwargs):
96:           needles: A list of strings we search for.
99:           RuntimeError: No needles provided.
105:         if not needles:
106:             raise RuntimeError("No needles provided to search.")
110:         if max([len(x) for x in needles]) > 50:
113:         tree = acora.AcoraBuilder(*needles)
538:     # Override with the needles to check for.
541:     def __init__(self, needles=None, **kwargs):
543:         if needles is not None:
544:             self.needles = needles
549:         if len(needles) == 1:
556:                 needles=self.needles)
586:         self.needles = []
594:             self.needles.append(tmp.obj_vm.read(0, tmp.obj_size))
596:         # The common string between all the needles.
598:             ("MultiStringFinderCheck", dict(needles=self.needles)),
chromium.googlesource.com/infra/third_party/npm_modules:node_modules/vulcanize/node_modules/uglify-js/node_modules/source-map/lib/source-map/source-map-consumer.js:[master, ]
duplicate result
chromium.googlesource.com/infra/third_party/npm_modules:node_modules/karma/node_modules/source-map/lib/source-map/source-map-consumer.js:[master, ]
duplicate result
chromium.googlesource.com/chromium/codesearch:infra:codesearch-gitlink-overlay/appengine/third_party/npm_modules/node_modules/vulcanize/node_modules/uglify-js/node_modules/source-map/lib/source-map/source-map-consumer.js:[master, ]
duplicate result
chromium.googlesource.com/chromium/codesearch:infra:codesearch-gitlink-overlay/appengine/third_party/npm_modules/node_modules/karma/node_modules/source-map/lib/source-map/source-map-consumer.js:[master, ]
duplicate result
android.googlesource.com/platform/external/clang_35a:lib/Sema/AnalysisBasedWarnings.cpp:[master, ]
577:   const DeclRefExpr *Needle;
573: /// a particular declaration (the needle) within any evaluated component of an
580:   ContainsReference(ASTContext &Context, const DeclRefExpr *Needle)
582:       FoundReference(false), Needle(Needle) {}
593:     if (E == Needle)
chromium.googlesource.com/native_client/pnacl-clang:lib/Sema/AnalysisBasedWarnings.cpp:[master, ]
579:   const DeclRefExpr *Needle;
575: /// a particular declaration (the needle) within any evaluated component of an
582:   ContainsReference(ASTContext &Context, const DeclRefExpr *Needle)
584:       FoundReference(false), Needle(Needle) {}
595:     if (E == Needle)
android.googlesource.com/platform/external/clang:lib/Sema/AnalysisBasedWarnings.cpp:[master, ]
duplicate result
github.com/fuchsia-mirror/third_party-clang:lib/Sema/AnalysisBasedWarnings.cpp:[master, ]
618:   const DeclRefExpr *Needle;
614: /// a particular declaration (the needle) within any evaluated component of an
623:   ContainsReference(ASTContext &Context, const DeclRefExpr *Needle)
624:     : Inherited(Context), FoundReference(false), Needle(Needle) {}
635:     if (E == Needle)
chromium.googlesource.com/external/github.com/kripken/emscripten-fastcomp-clang:lib/Sema/AnalysisBasedWarnings.cpp:[master, ]
duplicate result
chromium.googlesource.com/chromiumos/third_party/clang:lib/Sema/AnalysisBasedWarnings.cpp:[master, ]
768:   const DeclRefExpr *Needle;
764: /// a particular declaration (the needle) within any evaluated component of an
773:   ContainsReference(ASTContext &Context, const DeclRefExpr *Needle)
774:     : Inherited(Context), FoundReference(false), Needle(Needle) {}
785:     if (E == Needle)
chromium.googlesource.com/external/llvm.org/clang:lib/Sema/AnalysisBasedWarnings.cpp:[master, ]
duplicate result
github.com/llvm-mirror/clang:lib/Sema/AnalysisBasedWarnings.cpp:[master, ]
duplicate result
chromium.googlesource.com/external/github.com/llvm-mirror/clang:lib/Sema/AnalysisBasedWarnings.cpp:[master, ]
duplicate result
github.com/fuchsia-mirror/third_party-rust:src/libcore/str/pattern.rs:[master, ]
552:     needle: &'b str,
564: struct EmptyNeedle {
572:     fn new(haystack: &'a str, needle: &'b str) -> StrSearcher<'a, 'b> {
573:         if needle.is_empty() {
576:                 needle: needle,
587:                 needle: needle,
589:                     TwoWaySearcher::new(needle.as_bytes(), haystack.len())
603:                 // empty needle rejects every char and matches every empty string between them
618:                 // as long as it does correct matching and that haystack and needle are
627:                                                       self.needle.as_bytes(),
662:                                                self.needle.as_bytes(),
666:                                                self.needle.as_bytes(),
697:                                                            self.needle.as_bytes(),
731:                                                     self.needle.as_bytes(),
735:                                                     self.needle.as_bytes(),
749:     /// critical factorization index for reversed needle
754:     /// to a (byte & 63) == j present in the needle.
760:     /// index into needle before which we have already matched
762:     /// index into needle after which we have already matched
840:     fn new(needle: &[u8], end: usize) -> TwoWaySearcher {
841:         let (crit_pos_false, period_false) = TwoWaySearcher::maximal_suffix(needle, false);
842:         let (crit_pos_true, period_true) = TwoWaySearcher::maximal_suffix(needle, true);
856:         // needle, and we want to determine whether u is a suffix of
858:         // "Algorithm CP2", which is optimized for when the period of the needle
860:         if &needle[..crit_pos] == &needle[period.. period + crit_pos] {
862:             // compute a separate critical factorization for the reversed needle
870:             let crit_pos_back = needle.len() - cmp::max(
871:                 TwoWaySearcher::reverse_maximal_suffix(needle, period, false),
872:                 TwoWaySearcher::reverse_maximal_suffix(needle, period, true));
878:                 byteset: Self::byteset_create(&needle[..period]),
883:                 memory_back: needle.len(),
896:                 period: cmp::max(crit_pos, needle.len() - crit_pos) + 1,
897:                 byteset: Self::byteset_create(needle),
917:     // One of the main ideas of Two-Way is that we factorize the needle into
921:     // that (u, v) is a critical factorization for the needle.
923:     fn next<S>(&mut self, haystack: &[u8], needle: &[u8], long_period: bool)
929:         let needle_last = needle.len() - 1;
932:             // position + needle_last can not overflow if we assume slices
934:             let tail_byte = match haystack.get(self.position + needle_last) {
948:                 self.position += needle.len();
955:             // See if the right part of the needle matches
958:             for i in start..needle.len() {
959:                 if needle[i] != haystack[self.position + i] {
968:             // See if the left part of the needle matches
971:                 if needle[i] != haystack[self.position + i] {
974:                         self.memory = needle.len() - self.period;
983:             // Note: add self.period instead of needle.len() to have overlapping matches
984:             self.position += needle.len();
986:                 self.memory = 0; // set to needle.len() - self.period for overlapping matches
989:             return S::matching(match_pos, match_pos + needle.len());
1004:     // a reversed haystack with a reversed needle, matching first u' and then v'.
1006:     fn next_back<S>(&mut self, haystack: &[u8], needle: &[u8], long_period: bool)
1015:             // end - needle.len() will wrap around when there is no more room,
1018:             let front_byte = match haystack.get(self.end.wrapping_sub(needle.len())) {
1032:                 self.end -= needle.len();
1034:                     self.memory_back = needle.len();
1039:             // See if the left part of the needle matches
1043:                 if needle[i] != haystack[self.end - needle.len() + i] {
1046:                         self.memory_back = needle.len();
1052:             // See if the right part of the needle matches
1053:             let needle_end = if long_period { needle.len() }
1055:             for i in self.crit_pos_back..needle_end {
1056:                 if needle[i] != haystack[self.end - needle.len() + i] {
1066:             let match_pos = self.end - needle.len();
1067:             // Note: sub self.period instead of needle.len() to have overlapping matches
1068:             self.end -= needle.len();
1070:                 self.memory_back = needle.len();
1073:             return S::matching(match_pos, match_pos + needle.len());
559:     Empty(EmptyNeedle),
577:                 searcher: StrSearcherImpl::Empty(EmptyNeedle {
github.com/hanwen/artisjokke:needle2d/artisjokke-drawer2.hh:[master, ]
12:   Needle_inserter * needle_inserter_;
6: #include "needle-inserter.hh"
18:   virtual void set_needle ();
20:   virtual void draw_needle ();
github.com/hanwen/artisjokke:needle2d/artisjokke-drawer2.cc:[master, ]
12: float needle_color [] = {1,0,0};
69: Artisjokke_drawer2::set_needle()
104: Artisjokke_drawer2::draw_needle()
23: 		needle_inserter_,
29: 		needle_inserter_,
41: 			   needle_inserter_,
47: 			   needle_inserter_,
58:   this->needle_inserter_ =0; 
71:   if (!needle_inserter_->live())
74:   Vector3 needle_handle_;
75:   Vector3 needle_tip_;
77:   needle_handle_.set (-1.0,0.073,0.0);
78:   Vector3 needle_dir = Vector3 (0.99,0,0);
81:   build_rotmatrix (om, needle_drag_.quat_);
86:   Real fact = pow (2, needle_drag_.scale_(0));
93:   needle_dir *= fact;
94:   //  needle_dir = m * needle_dir;
96:   needle_handle_ = needle_handle_ + (needle_drag_. translate_)*0.10;
97:   needle_tip_ = needle_handle_ + needle_dir;
99:   needle_inserter_->move_needle (needle_handle_, needle_tip_);
106:   set_color (needle_color);
110:   Vector3 t= needle_inserter_->tip ();
111:   Vector3 h= needle_inserter_->handle ();
github.com/google/mysql-protobuf:unittest/gunit/item_like-t.cc:[mysql-5.7.9, ]
104:   const char *m_needle;
121:   const char *m_needle;
124: static const char *needles[] = {
218: static const char* falseNeedles[] = {
60:   const char needle[]= "%ACAGGTGCTGGAGAGGATGCGGAGAAATAGGAACA%" ;
62:   Item_string *it_needle=
63:     new Item_string(STRING_WITH_LEN(needle), &my_charset_latin1);
65:     new Item_func_like(it_haystack, it_needle, it_escape, false);
78:   const char needle[]= "%CAAAACCACTATGAGATATCATCTCACACCAGTTA%";
79:   Item_string *it_needle=
80:     new Item_string(STRING_WITH_LEN(needle), &my_charset_latin1);
83:     new Item_func_like(it_haystack, it_needle, it_escape, false);
97:     m_needle= GetParam();
114:     m_needle= GetParam();
207:   Item_string *it_needle=
208:     new Item_string(m_needle, strlen(m_needle), &my_charset_latin1);
213:     new Item_func_like(it_haystack, it_needle, it_escape, false);
296:   Item_string *it_needle=
297:     new Item_string(m_needle, strlen(m_needle), &my_charset_latin1);
302:     new Item_func_like(it_haystack, it_needle, it_escape, false);
200:                         ::testing::ValuesIn(needles));
199: INSTANTIATE_TEST_CASE_P(MoreNeedles, ItemLikeTestP,
203: TEST_P(ItemLikeTestP, MoreNeedlesTest)
289: INSTANTIATE_TEST_CASE_P(FalseNeedlesTest, ItemFalseLikeTestP,
290:                         ::testing::ValuesIn(falseNeedles));
292: TEST_P(ItemFalseLikeTestP,FalseNeedlesTest)
chromium.googlesource.com/arc/arc:third_party/chromium-ppapi/content/public/android/javatests/src/org/chromium/content/browser/ClipboardTest.java:[master, ]
33:     private static final String EXPECTED_HTML_NEEDLE = "http://www.example.com/";
78:         assertTrue(htmlText.contains(EXPECTED_HTML_NEEDLE));
github.com/google/coursebuilder-android-container-module:android/worker.py:[master, ]
110: _ACCEPT_LICENSE_NEEDLE = 'Do you accept the license'
133: _GRADLEW_INSTALL_SUCCESS_NEEDLE = 'BUILD SUCCESSFUL'
145: _TEST_FAILURE_NEEDLE = 'FAILURES!!!\r'
779:         return _GRADLEW_INSTALL_SUCCESS_NEEDLE not in result
782:         return _TEST_FAILURE_NEEDLE in result
1111:             if _ACCEPT_LICENSE_NEEDLE in line and not process.poll():
chromium.googlesource.com/chromium/codesearch:src/third_party/WebKit/PerformanceTests/Speedometer/resources/main.css:[master, ]
259: .gauge > .window > .needle {
chromium.googlesource.com/external/webrtc/codesearch:src:codesearch-gitlink-overlay/third_party/WebKit/PerformanceTests/Speedometer/resources/main.css:[master, ]
duplicate result
chromium.googlesource.com/arc/arc:third_party/nacl-glibc/string/str-two-way.h:[master, ]
213: two_way_short_needle (const unsigned char *haystack, size_t haystack_len,
307: two_way_long_needle (const unsigned char *haystack, size_t haystack_len,
66: # define LONG_NEEDLE_THRESHOLD 32U
68: # define LONG_NEEDLE_THRESHOLD SIZE_MAX
42:   LONG_NEEDLE_THRESHOLD.
60:    adds (1 << CHAR_BIT) + NEEDLE_LEN computations of preparation for a
61:    speedup no greater than a factor of NEEDLE_LEN.  The larger the
62:    needle, the better the potential performance gain.  On the other
82: /* Perform a critical factorization of NEEDLE, of length NEEDLE_LEN.
90:    When NEEDLE is factored into two halves, a local period is the
93:    non-empty NEEDLE have a local period of at least 1 and no greater
94:    than NEEDLE_LEN.
101:    in linear time, with 2 * NEEDLE_LEN comparisons, by computing the
106: critical_factorization (const unsigned char *needle, size_t needle_len,
111:   size_t j; /* Index into NEEDLE for current candidate suffix.  */
117:      0 <= j < NEEDLE_LEN - 1
119:      min(max_suffix, max_suffix_rev) < global period of NEEDLE
120:      1 <= p <= global period of NEEDLE
121:      p == global period of the substring NEEDLE[max_suffix{,_rev}+1...j]
129:   while (j + k < needle_len)
131:       a = CANON_ELEMENT (needle[j + k]);
132:       b = CANON_ELEMENT (needle[max_suffix + k]);
164:   while (j + k < needle_len)
166:       a = CANON_ELEMENT (needle[j + k]);
167:       b = CANON_ELEMENT (needle[max_suffix_rev + k]);
202: /* Return the first location of non-empty NEEDLE within HAYSTACK, or
204:    method is optimized for NEEDLE_LEN < LONG_NEEDLE_THRESHOLD.
206:    of 2 * NEEDLE_LEN comparisons.
209:    most 2 * HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching.
211:    HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching.  */
214: 		      const unsigned char *needle, size_t needle_len)
216:   size_t i; /* Index into current byte of NEEDLE.  */
218:   size_t period; /* The period of the right half of needle.  */
219:   size_t suffix; /* The index of the right half of needle.  */
221:   /* Factor the needle into two halves, such that the left half is
223:      periodic (with a period as large as NEEDLE_LEN - suffix).  */
224:   suffix = critical_factorization (needle, needle_len, &period);
228:   if (CMP_FUNC (needle, needle + period, suffix) == 0)
230:       /* Entire needle is periodic; a mismatch can only advance by the
235:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
239: 	  while (i < needle_len && (CANON_ELEMENT (needle[i])
242: 	  if (needle_len <= i)
246: 	      while (memory < i + 1 && (CANON_ELEMENT (needle[i])
254: 	      memory = needle_len - period;
265:       /* The two halves of needle are distinct; no extra memory is
267:       period = MAX (suffix, needle_len - suffix) + 1;
269:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
273: 	  while (i < needle_len && (CANON_ELEMENT (needle[i])
276: 	  if (needle_len <= i)
280: 	      while (i != SIZE_MAX && (CANON_ELEMENT (needle[i])
294: /* Return the first location of non-empty NEEDLE within HAYSTACK, or
296:    method is optimized for LONG_NEEDLE_THRESHOLD <= NEEDLE_LEN.
298:    of 3 * NEEDLE_LEN + (1 << CHAR_BIT) operations.
301:    most 2 * HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching,
302:    and sublinear performance O(HAYSTACK_LEN / NEEDLE_LEN) is possible.
304:    HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching, and
308: 		     const unsigned char *needle, size_t needle_len)
310:   size_t i; /* Index into current byte of NEEDLE.  */
312:   size_t period; /* The period of the right half of needle.  */
313:   size_t suffix; /* The index of the right half of needle.  */
316:   /* Factor the needle into two halves, such that the left half is
318:      periodic (with a period as large as NEEDLE_LEN - suffix).  */
319:   suffix = critical_factorization (needle, needle_len, &period);
323:      the end of NEEDLE, or NEEDLE_LEN if c is absent from the NEEDLE.
324:      shift_table[NEEDLE[NEEDLE_LEN - 1]] contains the only 0.  */
326:     shift_table[i] = needle_len;
327:   for (i = 0; i < needle_len; i++)
328:     shift_table[CANON_ELEMENT (needle[i])] = needle_len - i - 1;
332:   if (CMP_FUNC (needle, needle + period, suffix) == 0)
334:       /* Entire needle is periodic; a mismatch can only advance by the
340:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
344: 	  shift = shift_table[CANON_ELEMENT (haystack[j + needle_len - 1])];
349: 		  /* Since needle is periodic, but the last period has
352: 		  shift = needle_len - period;
361: 	  while (i < needle_len - 1 && (CANON_ELEMENT (needle[i])
364: 	  if (needle_len - 1 <= i)
368: 	      while (memory < i + 1 && (CANON_ELEMENT (needle[i])
376: 	      memory = needle_len - period;
387:       /* The two halves of needle are distinct; no extra memory is
390:       period = MAX (suffix, needle_len - suffix) + 1;
392:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
396: 	  shift = shift_table[CANON_ELEMENT (haystack[j + needle_len - 1])];
405: 	  while (i < needle_len - 1 && (CANON_ELEMENT (needle[i])
408: 	  if (needle_len - 1 <= i)
412: 	      while (i != SIZE_MAX && (CANON_ELEMENT (needle[i])
50:    needles, we also use a bad character shift table similar to the
59:    worthwhile.  Small needles should not compute a table, since it
chromium.googlesource.com/experimental/src-pruned-refs:content/public/android/javatests/src/org/chromium/content/browser/ClipboardTest.java:[master, ]
36:     private static final String EXPECTED_HTML_NEEDLE = "http://www.example.com/";
90:             assertTrue(htmlText.contains(EXPECTED_HTML_NEEDLE));
chromium.googlesource.com/chromium/chromium:content/public/android/javatests/src/org/chromium/content/browser/ClipboardTest.java:[trunk, ]
35:     private static final String EXPECTED_HTML_NEEDLE = "http://www.example.com/";
88:             assertTrue(htmlText.contains(EXPECTED_HTML_NEEDLE));
chromium.googlesource.com/native_client/nacl-toolchain:newlib/newlib/libc/string/str-two-way.h:[master, ]
198: two_way_short_needle (const unsigned char *haystack, size_t haystack_len,
292: two_way_long_needle (const unsigned char *haystack, size_t haystack_len,
53: # define LONG_NEEDLE_THRESHOLD 32U
55: # define LONG_NEEDLE_THRESHOLD SIZE_MAX
29:   LONG_NEEDLE_THRESHOLD.
47:    adds (1 << CHAR_BIT) + NEEDLE_LEN computations of preparation for a
48:    speedup no greater than a factor of NEEDLE_LEN.  The larger the
49:    needle, the better the potential performance gain.  On the other
67: /* Perform a critical factorization of NEEDLE, of length NEEDLE_LEN.
75:    When NEEDLE is factored into two halves, a local period is the
78:    non-empty NEEDLE have a local period of at least 1 and no greater
79:    than NEEDLE_LEN.
86:    in linear time, with 2 * NEEDLE_LEN comparisons, by computing the
91: critical_factorization (const unsigned char *needle, size_t needle_len,
96:   size_t j; /* Index into NEEDLE for current candidate suffix.  */
102:      0 <= j < NEEDLE_LEN - 1
104:      min(max_suffix, max_suffix_rev) < global period of NEEDLE
105:      1 <= p <= global period of NEEDLE
106:      p == global period of the substring NEEDLE[max_suffix{,_rev}+1...j]
114:   while (j + k < needle_len)
116:       a = CANON_ELEMENT (needle[j + k]);
117:       b = CANON_ELEMENT (needle[(size_t)(max_suffix + k)]);
149:   while (j + k < needle_len)
151:       a = CANON_ELEMENT (needle[j + k]);
152:       b = CANON_ELEMENT (needle[max_suffix_rev + k]);
187: /* Return the first location of non-empty NEEDLE within HAYSTACK, or
189:    method is optimized for NEEDLE_LEN < LONG_NEEDLE_THRESHOLD.
191:    of 2 * NEEDLE_LEN comparisons.
194:    most 2 * HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching.
196:    HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching.  */
199: 		      const unsigned char *needle, size_t needle_len)
201:   size_t i; /* Index into current byte of NEEDLE.  */
203:   size_t period; /* The period of the right half of needle.  */
204:   size_t suffix; /* The index of the right half of needle.  */
206:   /* Factor the needle into two halves, such that the left half is
208:      periodic (with a period as large as NEEDLE_LEN - suffix).  */
209:   suffix = critical_factorization (needle, needle_len, &period);
213:   if (CMP_FUNC (needle, needle + period, suffix) == 0)
215:       /* Entire needle is periodic; a mismatch can only advance by the
220:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
224: 	  while (i < needle_len && (CANON_ELEMENT (needle[i])
227: 	  if (needle_len <= i)
231: 	      while (memory < i + 1 && (CANON_ELEMENT (needle[i])
239: 	      memory = needle_len - period;
250:       /* The two halves of needle are distinct; no extra memory is
252:       period = MAX (suffix, needle_len - suffix) + 1;
254:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
258: 	  while (i < needle_len && (CANON_ELEMENT (needle[i])
261: 	  if (needle_len <= i)
265: 	      while (i != SIZE_MAX && (CANON_ELEMENT (needle[i])
279: /* Return the first location of non-empty NEEDLE within HAYSTACK, or
281:    method is optimized for LONG_NEEDLE_THRESHOLD <= NEEDLE_LEN.
283:    of 3 * NEEDLE_LEN + (1 << CHAR_BIT) operations.
286:    most 2 * HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching,
287:    and sublinear performance O(HAYSTACK_LEN / NEEDLE_LEN) is possible.
289:    HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching, and
293: 		     const unsigned char *needle, size_t needle_len)
295:   size_t i; /* Index into current byte of NEEDLE.  */
297:   size_t period; /* The period of the right half of needle.  */
298:   size_t suffix; /* The index of the right half of needle.  */
301:   /* Factor the needle into two halves, such that the left half is
303:      periodic (with a period as large as NEEDLE_LEN - suffix).  */
304:   suffix = critical_factorization (needle, needle_len, &period);
308:      the end of NEEDLE, or NEEDLE_LEN if c is absent from the NEEDLE.
309:      shift_table[NEEDLE[NEEDLE_LEN - 1]] contains the only 0.  */
311:     shift_table[i] = needle_len;
312:   for (i = 0; i < needle_len; i++)
313:     shift_table[CANON_ELEMENT (needle[i])] = needle_len - i - 1;
317:   if (CMP_FUNC (needle, needle + period, suffix) == 0)
319:       /* Entire needle is periodic; a mismatch can only advance by the
325:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
329: 	  shift = shift_table[CANON_ELEMENT (haystack[j + needle_len - 1])];
334: 		  /* Since needle is periodic, but the last period has
337: 		  shift = needle_len - period;
346: 	  while (i < needle_len - 1 && (CANON_ELEMENT (needle[i])
349: 	  if (needle_len - 1 <= i)
353: 	      while (memory < i + 1 && (CANON_ELEMENT (needle[i])
361: 	      memory = needle_len - period;
372:       /* The two halves of needle are distinct; no extra memory is
375:       period = MAX (suffix, needle_len - suffix) + 1;
377:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
381: 	  shift = shift_table[CANON_ELEMENT (haystack[j + needle_len - 1])];
390: 	  while (i < needle_len - 1 && (CANON_ELEMENT (needle[i])
393: 	  if (needle_len - 1 <= i)
397: 	      while (i != SIZE_MAX && (CANON_ELEMENT (needle[i])
37:    needles, we also use a bad character shift table similar to the
46:    worthwhile.  Small needles should not compute a table, since it
android.googlesource.com/platform/external/chromium_org:content/public/android/javatests/src/org/chromium/content/browser/ClipboardTest.java:[master, ]
36:     private static final String EXPECTED_HTML_NEEDLE = "http://www.example.com/";
90:             assertTrue(htmlText.contains(EXPECTED_HTML_NEEDLE));
chromium.googlesource.com/external/webrtc/codesearch/deps:third_party/WebKit/PerformanceTests/Speedometer/resources/main.css:[master, ]
duplicate result
chromium.googlesource.com/ios-chromium-mirror:content/public/android/javatests/src/org/chromium/content/browser/ClipboardTest.java:[master, ]
duplicate result
chromium.googlesource.com/chromium/src:content/public/android/javatests/src/org/chromium/content/browser/ClipboardTest.java:[master, ]
duplicate result
chromium.googlesource.com/native_client/nacl-newlib:newlib/libc/string/str-two-way.h:[master, ]
198: two_way_short_needle (const unsigned char *haystack, size_t haystack_len,
292: two_way_long_needle (const unsigned char *haystack, size_t haystack_len,
53: # define LONG_NEEDLE_THRESHOLD 32U
55: # define LONG_NEEDLE_THRESHOLD SIZE_MAX
29:   LONG_NEEDLE_THRESHOLD.
47:    adds (1 << CHAR_BIT) + NEEDLE_LEN computations of preparation for a
48:    speedup no greater than a factor of NEEDLE_LEN.  The larger the
49:    needle, the better the potential performance gain.  On the other
67: /* Perform a critical factorization of NEEDLE, of length NEEDLE_LEN.
75:    When NEEDLE is factored into two halves, a local period is the
78:    non-empty NEEDLE have a local period of at least 1 and no greater
79:    than NEEDLE_LEN.
86:    in linear time, with 2 * NEEDLE_LEN comparisons, by computing the
91: critical_factorization (const unsigned char *needle, size_t needle_len,
96:   size_t j; /* Index into NEEDLE for current candidate suffix.  */
102:      0 <= j < NEEDLE_LEN - 1
104:      min(max_suffix, max_suffix_rev) < global period of NEEDLE
105:      1 <= p <= global period of NEEDLE
106:      p == global period of the substring NEEDLE[max_suffix{,_rev}+1...j]
114:   while (j + k < needle_len)
116:       a = CANON_ELEMENT (needle[j + k]);
117:       b = CANON_ELEMENT (needle[(size_t)(max_suffix + k)]);
149:   while (j + k < needle_len)
151:       a = CANON_ELEMENT (needle[j + k]);
152:       b = CANON_ELEMENT (needle[max_suffix_rev + k]);
187: /* Return the first location of non-empty NEEDLE within HAYSTACK, or
189:    method is optimized for NEEDLE_LEN < LONG_NEEDLE_THRESHOLD.
191:    of 2 * NEEDLE_LEN comparisons.
194:    most 2 * HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching.
196:    HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching.  */
199: 		      const unsigned char *needle, size_t needle_len)
201:   size_t i; /* Index into current byte of NEEDLE.  */
203:   size_t period; /* The period of the right half of needle.  */
204:   size_t suffix; /* The index of the right half of needle.  */
206:   /* Factor the needle into two halves, such that the left half is
208:      periodic (with a period as large as NEEDLE_LEN - suffix).  */
209:   suffix = critical_factorization (needle, needle_len, &period);
213:   if (CMP_FUNC (needle, needle + period, suffix) == 0)
215:       /* Entire needle is periodic; a mismatch can only advance by the
220:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
224: 	  while (i < needle_len && (CANON_ELEMENT (needle[i])
227: 	  if (needle_len <= i)
231: 	      while (memory < i + 1 && (CANON_ELEMENT (needle[i])
239: 	      memory = needle_len - period;
250:       /* The two halves of needle are distinct; no extra memory is
252:       period = MAX (suffix, needle_len - suffix) + 1;
254:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
258: 	  while (i < needle_len && (CANON_ELEMENT (needle[i])
261: 	  if (needle_len <= i)
265: 	      while (i != SIZE_MAX && (CANON_ELEMENT (needle[i])
279: /* Return the first location of non-empty NEEDLE within HAYSTACK, or
281:    method is optimized for LONG_NEEDLE_THRESHOLD <= NEEDLE_LEN.
283:    of 3 * NEEDLE_LEN + (1 << CHAR_BIT) operations.
286:    most 2 * HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching,
287:    and sublinear performance O(HAYSTACK_LEN / NEEDLE_LEN) is possible.
289:    HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching, and
293: 		     const unsigned char *needle, size_t needle_len)
295:   size_t i; /* Index into current byte of NEEDLE.  */
297:   size_t period; /* The period of the right half of needle.  */
298:   size_t suffix; /* The index of the right half of needle.  */
301:   /* Factor the needle into two halves, such that the left half is
303:      periodic (with a period as large as NEEDLE_LEN - suffix).  */
304:   suffix = critical_factorization (needle, needle_len, &period);
308:      the end of NEEDLE, or NEEDLE_LEN if c is absent from the NEEDLE.
309:      shift_table[NEEDLE[NEEDLE_LEN - 1]] contains the only 0.  */
311:     shift_table[i] = needle_len;
312:   for (i = 0; i < needle_len; i++)
313:     shift_table[CANON_ELEMENT (needle[i])] = needle_len - i - 1;
317:   if (CMP_FUNC (needle, needle + period, suffix) == 0)
319:       /* Entire needle is periodic; a mismatch can only advance by the
325:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
329: 	  shift = shift_table[CANON_ELEMENT (haystack[j + needle_len - 1])];
334: 		  /* Since needle is periodic, but the last period has
337: 		  shift = needle_len - period;
346: 	  while (i < needle_len - 1 && (CANON_ELEMENT (needle[i])
349: 	  if (needle_len - 1 <= i)
353: 	      while (memory < i + 1 && (CANON_ELEMENT (needle[i])
361: 	      memory = needle_len - period;
372:       /* The two halves of needle are distinct; no extra memory is
375:       period = MAX (suffix, needle_len - suffix) + 1;
377:       while (AVAILABLE (haystack, haystack_len, j, needle_len))
381: 	  shift = shift_table[CANON_ELEMENT (haystack[j + needle_len - 1])];
390: 	  while (i < needle_len - 1 && (CANON_ELEMENT (needle[i])
393: 	  if (needle_len - 1 <= i)
397: 	      while (i != SIZE_MAX && (CANON_ELEMENT (needle[i])
37:    needles, we also use a bad character shift table similar to the
46:    worthwhile.  Small needles should not compute a table, since it
chromium.googlesource.com/chromiumos/third_party/glibc:string/str-two-way.h:[master, ]
duplicate result