Next: SRFI-13 Case Mapping, Previous: SRFI-13 Prefixes/Suffixes, Up: SRFI-13
Use these procedures to find out whether a string contains a given character or a given substring, or a character from a set of characters.
Search through the string s from left to right, returning the index of the first occurence of a character satisfying good, which must be one of:
- character ch
- The character is ch.
- predicate (procedure) p
- The character satisfies p.
- character set cset
- The character is in cset.
Search through the string s from left to right, returning the index of the first occurence of a character which satisfies skip, which must be one of:
- character ch
- The character is not ch.
- predicate (procedure) p
- The character does not satisfy p.
- character set cset
- The character is not in cset.
Return the count of the number of characters in the string s which satisfies good, which must be one of:
- character ch
- Count if the character is ch.
- predicate (procedure) p
- Count if the character satisfies p.
- character set cset
- Count if the character is in cset.