| Operators |
tuple_strrstr — Backward search for strings within a string tuple.
tuple_strrstr searches within the strings of the input tuple String for the strings of the input tuple ToFind. Both input tuples may only consist of strings. Otherwise tuple_strrstr returns an error. In any case backward search is used, i.e., every string is examined from its last to its first character. If String contains only one string, all strings of ToFind are searched in it. Thus, the output tuple consists of as many elements as ToFind. Whenever a searched string has been found, the position of its first occurrence gets stored in the output tuple Position (positions in strings are counted starting with 0). If a string can not be found, -1 will be returned instead of its position. If both input tuples show the same number of elements, the strings are searched elementwise. I.e., the first string of ToFind is searched within the first string of String, the second string of ToFind is searched within the second string of String and so on. The results of the elementwise searches are returned with Position that contains as many elements as String and ToFind. If ToFind only contains one string, this is searched within all strings of String. Thus, in this case Position consists of as many elements as String. If both input tuples contain more than one element and the number of elements differs for the input tuples, tuple_strrstr returns an error.
If either or both of the input tuples are empty, the operator returns an empty tuple.
HDevelop provides an in-line operation for tuple_strrstr, which can be used in an expression in the following syntax:
Position := strrstr(String, ToFind)
Input tuple with string(s) to examine.
Input tuple with string(s) to search.
Position of searched string(s) within the examined string(s).
tuple_strstr, tuple_strlen, tuple_strchr, tuple_strrchr, tuple_substr, tuple_str_first_n, tuple_str_last_n, tuple_split, tuple_environment
Foundation
| Operators |