Vectorized over str and with respect to each code point
in pattern and replacement.
If pattern and replacement consist of a different number
of code points, then the extra code points in the longer of the two
are ignored, with a warning.
If code points in a given pattern are not unique, the
last corresponding replacement code point is used.
Time complexity for each string in str is
O(stri_length(str)*stri_length(pattern)).
Gagolewski M., stringi: Fast and portable character string processing in R, Journal of Statistical Software 103(2), 2022, 1-59, tools:::Rd_expr_doi("10.18637/jss.v103.i02")
Other transform:
stri_trans_general(),
stri_trans_list(),
stri_trans_nfc(),
stri_trans_tolower()