parrotcode: Lua String Library | |
Contents | Language Implementations | Lua |
lib/luastring.pir - Lua String Library
This library provides generic functions for string manipulation, such as finding and extracting substrings, and pattern matching. When indexing a string in Lua, the first character is at position 1 (not at 0, as in C). Indices are allowed to be negative and are interpreted as indexing backwards, from the end of the string. Thus, the last character is at position -1, and so on.
The string library provides all its functions inside the table string
.
It also sets a metatable for strings where the __index
field points to the metatable itself.
Therefore,
you can use the string functions in object-oriented style.
For instance,
string.byte(s, i)
can be written as s:byte(i)
.
See "Lua 5.1 Reference Manual", section 5.4 "String Manipulation".
string.byte (s [, i [, j]])
s[i]
,
s[i+1]
,...,
s[j]
.
The default value for i
is 1; the default value for j
is i
.string.char (i1, i2, ...)
string.dump (function)
loadstring
on this string returns a copy of the function.
function
must be a Lua function without upvalues.string.find (s, pattern [, init [, plain]])
pattern
in the string s
.
If it finds a match,
then find
returns the indices of s
where this occurrence starts and ends; otherwise,
it returns nil.
A third,
optional numerical argument init
specifies where to start the search; its default value is 1 and may be negative.
A value of true as a fourth,
optional argument plain
turns off the pattern matching facilities,
so the function does a plain "find substring" operation,
with no characters in pattern
being considered "magic".
Note that if plain
is given,
then init
must be given as well.string.format (formatstring, e1, e2, ...)
printf
family of standard C functions.
The only differences are that the options/modifiers *
,
l
,
L
,
n
,
p
,
and h
are not supported,
and there is an extra option,
q
.
The q
option formats a string in a form suitable to be safely read back by the Lua interpreter: The string is written between double quotes,
and all double quotes,
newlines,
and backslashes in the string are correctly escaped when written.
For instance,
the call string.format(%q, a string with "quotes" and \n new line)
"a string with \"quotes\" and \
new line"
c
, d
, E
, e
, f
, g
, G
, i
, o
, u
, X
, and x
all expect a number as argument, whereas q
and s
expect a string.string.gmatch (s, pattern)
pattern
over string s
.pattern
specifies no captures, then the whole match is produced in each call. s = "hello world from Lua"
for w in string.gmatch(s, "%a+") do
print(w)
end
s
, printing one per line. The next example collects all pairs key=value
from the given string into a table: t = {}
s = "from=world, to=Lua"
for k, v in string.gmatch(s, "(%w+)=(%w+)") do
t[k] = v
end
string.gsub (s, pat, repl [, n])
s
in which all occurrences of the pattern pat
have been replaced by a replacement string specified by repl
. gsub
also returns, as a second value, the total number of substitutions made.repl
is a string, then its value is used for replacement. Any sequence in repl
of the form %n, with n between 1 and 9, stands for the value of the n-th captured substring.repl
is a function, then this function is called every time a match occurs, with all captured substrings passed as arguments, in order; if the pattern specifies no captures, then the whole match is passed as a sole argument. If the value returned by this function is a string, then it is used as the replacement string; otherwise, the replacement string is the empty string.n
limits the maximum number of substitutions to occur. For instance, when n
is 1 only the first occurrence of pat
is replaced.string.len (s)
""
has length 0. Embedded zeros are counted, so "a\000b\000c"
has length 5.string.lower (s)
string.match (s, pattern [, init])
pattern
in the string s
. If it finds one, then match
returns the captures from the pattern; otherwise it returns nil. If pattern
specifies no captures, then the whole match is returned. A third, optional numerical argument init
specifies where to start the search; its default value is 1 and may be negative.string.rep (s, n)
n
copies of the string s
.string.reverse (s)
s
reversed.string.sub (s, i [, j])
s
that starts at i
and continues until j
; i
and j
may be negative. If j
is absent, then it is assumed to be equal to -1 (which is the same as the string length). In particular, the call string.sub(s,1,j)
returns a prefix of s
with length j
, and string.sub(s, -i)
returns a suffix of s
with length i
.string.upper (s)
Francois Perrad
|