Backward search for a character within a string tuple.

::tuple_strrchr searches within the strings of the input tuple T1 for the characters of the input tuple T2. Both input tuples may only consist of strings. Otherwise ::tuple_strrchr returns an error. In any case backward search is used, i.e., every string is examined from its last to its first character. If the elements of T2 contain more than one character, only the first character of each element is considered for searching. If T1 contains only one string, all the characters defined in T2 are searched in this string. Thus the output tuple consists of as many elements as T2. Whenever a searched character has been found, the position of its first occurence gets stored in the output tuple Position . If a character can not be found, -1 will be returned instead of its position (remark: the position starts at 0 for the first character of a string). If both input tuples show the same number of elements, the search is done elementwise. I.e., the first character of the first element of T2 is searched within the first string of T1, the first character of the second element of T2 is searched within the second string of T1 and so on. The results of the elementwise searches are returned with Position that contains as many elements as T1 and T2. If T2 only contains one string, its first character is searched within all strings of T1. Thus in this case Position consists of as many elements as T1. If both input tuples contain more than one element and the number of elements differs for the input tuples, ::tuple_strrchr returns an error.

::tuple_strchr, ::tuple_strstr, ::tuple_strrstr, ::tuple_strlen, ::tuple_str_first_n, ::tuple_str_last_n, ::tuple_split, ::tuple_environment

Operators not requiring licensing