Details
-
Bug
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
None
Description
Implement contains for exact matches of subportions of a string. Using the Knuth–Morris–Pratt algorithm, we should be able to do this in a linear runtime with a tiny bit of preprocessing at the invocation.
Attachments
Issue Links
- is related to
-
ARROW-12949 [C++] Add string starts-with/ends-with kernels
-
- Resolved
-
- relates to
-
ARROW-12950 [C++] Add substring count kernel
-
- Resolved
-
- links to