Substring

substring(String, List, Integer)

Given a string $s$, a list of strings $\{s_1,...,s_k\}$, and a positive integer $n$, searches $s_i$ in $s$ starting from the $n$-th char. If more than one $s_j$ appear in the original string, only the first appearance is returned. If the find ends with no matches, failed is returned. The output is a list with two elements: an integer with the position of the string and the string $s_i$.

Given a string $s$ and a list of strings $\{s_1,...,s_k\}$, searches $s_i$ in $s$. If more than one $s_j$ appear in the original string, only the first appearance is returned. If the find ends with no matches, failed is returned. The output is a list with two elements: an integer with the position of the string and the string $s_i$.