Lines Matching defs:cut
243 >>> needle = (left := needle[:cut]) + (right := needle[cut:])
244 where the "local period" of the cut is maximal.
246 The local period of the cut is the minimal length of a string w
253 Crochemore and Perrin (1991) show that this cut can be computed
260 >>> cut, period = factorize(x)
261 >>> x[:cut], (right := x[cut:])
274 Py_ssize_t cut1, period1, cut2, period2, cut, period;
278 // Take the later cut.
281 cut = cut1;
285 cut = cut2;
288 LOG("split: "); LOG_STRING(needle, cut);
289 LOG(" + "); LOG_STRING(needle + cut, len_needle - cut);
293 return cut;
307 Py_ssize_t cut;
321 p->cut = STRINGLIB(_factorize)(needle, len_needle, &(p->period));
322 assert(p->period + p->cut <= len_needle);
325 p->cut * STRINGLIB_SIZEOF_CHAR));
327 assert(p->cut <= len_needle/2);
328 assert(p->cut < p->period);
333 p->period = Py_MAX(p->cut, len_needle - p->cut) + 1;
366 const Py_ssize_t cut = p->cut;
397 Py_ssize_t i = Py_MAX(cut, memory);
401 window_last += i - cut + 1;
406 for (i = memory; i < cut; i++) {
420 Py_ssize_t mem_jump = Py_MAX(cut, memory) - cut + 1;
437 Py_ssize_t gap_jump_end = Py_MIN(len_needle, cut + gap);
455 for (Py_ssize_t i = cut; i < gap_jump_end; i++) {
458 assert(gap >= i - cut + 1);
466 assert(i - cut + 1 > gap);
467 window_last += i - cut + 1;
471 for (Py_ssize_t i = 0; i < cut; i++) {