2002-06-06 16:49:28 +04:00
|
|
|
% $Id: manual.tex,v 1.55 2002/02/14 21:48:32 roberto Exp roberto $
|
1996-01-29 20:08:23 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\documentclass[11pt,twoside,draft]{article}
|
2000-11-07 15:44:44 +03:00
|
|
|
\usepackage{fullpage}
|
|
|
|
\usepackage{bnf}
|
2000-05-12 23:19:18 +04:00
|
|
|
\usepackage{graphicx}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
% no need for subscripts...
|
1998-08-21 21:43:44 +04:00
|
|
|
\catcode`\_=12
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
%\newcommand{\See}[1]{Section~\ref{#1}}
|
|
|
|
\newcommand{\See}[1]{\S\ref{#1}}
|
2001-09-24 19:54:36 +04:00
|
|
|
%\newcommand{\see}[1]{(see~\See{#1} on page \pageref{#1})}
|
2000-11-07 15:44:44 +03:00
|
|
|
\newcommand{\see}[1]{(see~\See{#1})}
|
2001-09-24 19:54:36 +04:00
|
|
|
\newcommand{\seepage}[1]{(see page~\pageref{#1})}
|
2000-11-07 15:44:44 +03:00
|
|
|
\newcommand{\M}[1]{{\rm\emph{#1}}}
|
1997-07-01 21:41:34 +04:00
|
|
|
\newcommand{\T}[1]{{\tt #1}}
|
1997-06-19 01:11:53 +04:00
|
|
|
\newcommand{\Math}[1]{$#1$}
|
1995-11-16 23:46:02 +03:00
|
|
|
\newcommand{\nil}{{\bf nil}}
|
2002-02-15 00:48:32 +03:00
|
|
|
\newcommand{\False}{{\bf false}}
|
|
|
|
\newcommand{\True}{{\bf true}}
|
2001-09-24 19:54:36 +04:00
|
|
|
%\def\tecgraf{{\sf TeC\kern-.21em\lower.7ex\hbox{Graf}}}
|
2002-06-06 16:49:28 +04:00
|
|
|
\def\tecgraf{{\sf Tecgraf}}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\newcommand{\Index}[1]{#1\index{#1@{\lowercase{#1}}}}
|
|
|
|
\newcommand{\IndexVerb}[1]{\T{#1}\index{#1@{\tt #1}}}
|
|
|
|
\newcommand{\IndexEmph}[1]{\emph{#1}\index{#1@{\lowercase{#1}}}}
|
|
|
|
\newcommand{\IndexTM}[1]{\index{#1 event@{``#1'' event}}\index{tag method!#1}}
|
1997-07-01 21:41:34 +04:00
|
|
|
\newcommand{\Def}[1]{\emph{#1}\index{#1}}
|
2000-11-07 15:44:44 +03:00
|
|
|
\newcommand{\IndexAPI}[1]{\T{#1}\DefAPI{#1}}
|
|
|
|
\newcommand{\IndexLIB}[1]{\T{#1}\DefLIB{#1}}
|
|
|
|
\newcommand{\DefLIB}[1]{\index{#1@{\tt #1}}}
|
|
|
|
\newcommand{\DefAPI}[1]{\index{C API!#1@{\tt #1}}}
|
2001-09-24 19:54:36 +04:00
|
|
|
\newcommand{\IndexKW}[1]{\index{keywords!#1@{\tt #1}}}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1996-11-01 20:02:10 +03:00
|
|
|
\newcommand{\ff}{$\bullet$\ }
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\newcommand{\Version}{4.1 (beta)}
|
1996-02-16 16:12:12 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
% changes to bnf.sty by LHF
|
|
|
|
\renewcommand{\Or}{$|$ }
|
|
|
|
\renewcommand{\rep}[1]{{\rm\{}\,#1\,{\rm\}}}
|
|
|
|
\renewcommand{\opt}[1]{{\rm [}\,#1\,{\,\rm]}}
|
2000-05-12 23:19:18 +04:00
|
|
|
\renewcommand{\ter}[1]{{\rm`{\tt#1}'}}
|
2000-09-18 23:41:16 +04:00
|
|
|
\newcommand{\NOTE}{\par\medskip\noindent\emph{NOTE}: }
|
2000-05-12 23:19:18 +04:00
|
|
|
|
1996-02-16 16:12:12 +03:00
|
|
|
\makeindex
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
\begin{document}
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
%{===============================================================
|
1997-02-21 18:19:37 +03:00
|
|
|
\thispagestyle{empty}
|
|
|
|
\pagestyle{empty}
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
{
|
|
|
|
\parindent=0pt
|
|
|
|
\vglue1.5in
|
|
|
|
{\LARGE\bf
|
|
|
|
The Programming Language Lua}
|
|
|
|
\hfill
|
|
|
|
\vskip4pt \hrule height 4pt width \hsize \vskip4pt
|
|
|
|
\hfill
|
|
|
|
Reference Manual for Lua version \Version
|
|
|
|
\\
|
|
|
|
\null
|
|
|
|
\hfill
|
|
|
|
Last revised on \today
|
|
|
|
\\
|
|
|
|
\vfill
|
|
|
|
\centering
|
|
|
|
\includegraphics[width=0.7\textwidth]{nolabel.ps}
|
|
|
|
\vfill
|
|
|
|
\vskip4pt \hrule height 2pt width \hsize
|
|
|
|
}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1998-06-07 01:05:52 +04:00
|
|
|
\newpage
|
1997-01-23 19:17:53 +03:00
|
|
|
\begin{quotation}
|
1999-04-07 20:40:04 +04:00
|
|
|
\parskip=10pt
|
2001-09-24 19:54:36 +04:00
|
|
|
\parindent=0pt
|
1997-02-21 18:19:37 +03:00
|
|
|
\footnotesize
|
2000-05-12 23:19:18 +04:00
|
|
|
\null\vfill
|
|
|
|
|
|
|
|
\noindent
|
2002-06-06 16:49:28 +04:00
|
|
|
Copyright \copyright\ 2002 Tecgraf, PUC-Rio. All rights reserved.
|
|
|
|
|
|
|
|
Permission is hereby granted, free of charge,
|
|
|
|
to any person obtaining a copy of this software
|
|
|
|
and associated documentation files (the "Software"),
|
|
|
|
to deal in the Software without restriction,
|
|
|
|
including without limitation the rights to use, copy, modify,
|
|
|
|
merge, publish, distribute, sublicense,
|
|
|
|
and/or sell copies of the Software,
|
|
|
|
and to permit persons to whom the Software is furnished to do so,
|
|
|
|
subject to the following conditions:
|
|
|
|
|
|
|
|
The above copyright notice and this permission notice shall be
|
|
|
|
included in all copies or substantial portions of the Software.
|
|
|
|
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
|
EXPRESS OR IMPLIED,
|
|
|
|
INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
|
|
|
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE
|
|
|
|
FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
|
|
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
|
|
|
|
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE
|
|
|
|
OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
1998-06-07 01:05:52 +04:00
|
|
|
|
1997-01-23 19:17:53 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
Copies of this manual can be obtained at
|
2001-09-24 19:54:36 +04:00
|
|
|
Lua's official web site,
|
|
|
|
\verb|www.lua.org|.
|
2000-09-18 23:41:16 +04:00
|
|
|
|
|
|
|
\bigskip
|
|
|
|
The Lua logo was designed by A. Nakonechny.
|
|
|
|
Copyright \copyright\ 1998. All rights reserved.
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{quotation}
|
|
|
|
%}===============================================================
|
1997-01-23 19:17:53 +03:00
|
|
|
\newpage
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\title{\Large\bf Reference Manual of the Programming Language Lua \Version}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
|
|
|
\author{%
|
2001-09-24 19:54:36 +04:00
|
|
|
Roberto Ierusalimschy\qquad
|
|
|
|
Luiz Henrique de Figueiredo\qquad
|
2000-05-12 23:19:18 +04:00
|
|
|
Waldemar Celes
|
|
|
|
\vspace{1.0ex}\\
|
|
|
|
\smallskip
|
|
|
|
\small\tt lua@tecgraf.puc-rio.br
|
|
|
|
\vspace{2.0ex}\\
|
|
|
|
%MCC 08/95 ---
|
|
|
|
\tecgraf\ --- Computer Science Department --- PUC-Rio
|
|
|
|
}
|
|
|
|
|
2002-06-06 16:49:28 +04:00
|
|
|
%\date{{\small \tt\$Date: 2002/02/14 21:48:32 $ $}}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
|
|
|
\maketitle
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\pagestyle{plain}
|
|
|
|
\pagenumbering{roman}
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\begin{abstract}
|
|
|
|
\noindent
|
|
|
|
Lua is a powerful, light-weight programming language
|
|
|
|
designed for extending applications.
|
|
|
|
Lua is also frequently used as a general-purpose, stand-alone language.
|
|
|
|
Lua combines simple procedural syntax
|
|
|
|
(similar to Pascal)
|
|
|
|
with
|
|
|
|
powerful data description constructs
|
|
|
|
based on associative arrays and extensible semantics.
|
|
|
|
Lua is
|
|
|
|
dynamically typed,
|
2002-02-15 00:48:32 +03:00
|
|
|
interpreted from opcodes,
|
2000-05-12 23:19:18 +04:00
|
|
|
and has automatic memory management with garbage collection,
|
|
|
|
making it ideal for
|
|
|
|
configuration,
|
|
|
|
scripting,
|
|
|
|
and
|
|
|
|
rapid prototyping.
|
|
|
|
|
|
|
|
This document describes version \Version\ of the Lua programming language
|
2000-09-18 23:41:16 +04:00
|
|
|
and the Application Program Interface (API)
|
|
|
|
that allows interaction between Lua programs and their host C~programs.
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{abstract}
|
|
|
|
|
|
|
|
\def\abstractname{Resumo}
|
|
|
|
\begin{abstract}
|
|
|
|
\noindent
|
|
|
|
Lua \'e uma linguagem de programa\c{c}\~ao
|
|
|
|
poderosa e leve,
|
2000-09-18 23:41:16 +04:00
|
|
|
projetada para estender aplica\c{c}\~oes.
|
2000-05-12 23:19:18 +04:00
|
|
|
Lua tamb\'em \'e frequentemente usada como uma linguagem de prop\'osito geral.
|
|
|
|
Lua combina programa\c{c}\~ao procedural
|
|
|
|
(com sintaxe semelhante \`a de Pascal)
|
|
|
|
com
|
|
|
|
poderosas constru\c{c}\~oes para descri\c{c}\~ao de dados,
|
|
|
|
baseadas em tabelas associativas e sem\^antica extens\'\i vel.
|
|
|
|
Lua \'e
|
|
|
|
tipada dinamicamente,
|
2002-02-15 00:48:32 +03:00
|
|
|
interpretada a partir de \emph{opcodes},
|
2000-05-12 23:19:18 +04:00
|
|
|
e tem gerenciamento autom\'atico de mem\'oria com coleta de lixo.
|
|
|
|
Essas caracter\'{\i}sticas fazem de Lua uma linguagem ideal para
|
|
|
|
configura\c{c}\~ao,
|
|
|
|
automa\c{c}\~ao (\emph{scripting})
|
|
|
|
e prototipagem r\'apida.
|
|
|
|
|
|
|
|
Este documento descreve a vers\~ao \Version\ da linguagem de
|
|
|
|
programa\c{c}\~ao Lua e a Interface de Programa\c{c}\~ao (API) que permite
|
2000-09-18 23:41:16 +04:00
|
|
|
a intera\c{c}\~ao entre programas Lua e programas C~hospedeiros.
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{abstract}
|
|
|
|
|
|
|
|
\newpage
|
|
|
|
\null
|
|
|
|
\newpage
|
1997-02-21 18:19:37 +03:00
|
|
|
\tableofcontents
|
|
|
|
|
|
|
|
\newpage
|
|
|
|
\setcounter{page}{1}
|
|
|
|
\pagestyle{plain}
|
2000-11-07 15:44:44 +03:00
|
|
|
\pagenumbering{arabic}
|
1997-02-21 18:19:37 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
%------------------------------------------------------------------------------
|
1995-11-16 23:46:02 +03:00
|
|
|
\section{Introduction}
|
|
|
|
|
|
|
|
Lua is an extension programming language designed to support
|
1997-06-19 00:14:52 +04:00
|
|
|
general procedural programming with data description
|
1995-11-16 23:46:02 +03:00
|
|
|
facilities.
|
2000-05-12 23:19:18 +04:00
|
|
|
Lua is intended to be used as a powerful, light-weight
|
1997-06-17 22:45:16 +04:00
|
|
|
configuration language for any program that needs one.
|
1995-11-16 23:46:02 +03:00
|
|
|
Lua is implemented as a library, written in C.
|
2001-09-24 19:54:36 +04:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
Being an extension language, Lua has no notion of a ``main'' program:
|
1997-07-01 21:41:34 +04:00
|
|
|
it only works \emph{embedded} in a host client,
|
2001-09-24 19:54:36 +04:00
|
|
|
called the \emph{embedding program} or simply the \emph{host}.
|
|
|
|
This host program can invoke functions to execute a piece of Lua code,
|
|
|
|
can write and read Lua variables,
|
2000-05-12 23:19:18 +04:00
|
|
|
and can register C~functions to be called by Lua code.
|
|
|
|
Through the use of C~functions, Lua can be augmented to cope with
|
1997-06-19 00:14:52 +04:00
|
|
|
a wide range of different domains,
|
1995-11-16 23:46:02 +03:00
|
|
|
thus creating customized programming languages sharing a syntactical framework.
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Lua is free software,
|
2000-09-18 23:41:16 +04:00
|
|
|
and is provided as usual with no guarantees,
|
2000-08-09 23:09:20 +04:00
|
|
|
as stated in its copyright notice.
|
1995-11-16 23:46:02 +03:00
|
|
|
The implementation described in this manual is available
|
2001-09-24 19:54:36 +04:00
|
|
|
at Lua's official web site, \verb|www.lua.org|.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
Like any other reference manual,
|
|
|
|
this document is dry in places.
|
|
|
|
For a discussion of the decisions behind the design of Lua,
|
|
|
|
see the papers below,
|
2001-09-24 19:54:36 +04:00
|
|
|
which are available at Lua's web site.
|
2000-05-12 23:19:18 +04:00
|
|
|
\begin{itemize}
|
|
|
|
\item
|
|
|
|
R.~Ierusalimschy, L.~H.~de Figueiredo, and W.~Celes.
|
|
|
|
Lua---an extensible extension language.
|
|
|
|
\emph{Software: Practice \& Experience} {\bf 26} \#6 (1996) 635--652.
|
|
|
|
\item
|
|
|
|
L.~H.~de Figueiredo, R.~Ierusalimschy, and W.~Celes.
|
|
|
|
The design and implementation of a language for extending applications.
|
|
|
|
\emph{Proceedings of XXI Brazilian Seminar on Software and Hardware} (1994) 273--283.
|
|
|
|
\item
|
|
|
|
L.~H.~de Figueiredo, R.~Ierusalimschy, and W.~Celes.
|
|
|
|
Lua: an extensible embedded language.
|
|
|
|
\emph{Dr. Dobb's Journal} {\bf 21} \#12 (Dec 1996) 26--33.
|
2001-09-24 19:54:36 +04:00
|
|
|
\item
|
|
|
|
R.~Ierusalimschy, L.~H.~de Figueiredo, and W.~Celes.
|
|
|
|
The evolution of an extension language: a history of Lua,
|
|
|
|
\emph{Proceedings of V Brazilian Symposium on Programming Languages} (2001) B-14--B-28.
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{itemize}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
%------------------------------------------------------------------------------
|
|
|
|
\section{Lua Concepts}\label{concepts}
|
|
|
|
|
|
|
|
This section describes the main concepts of Lua as a language.
|
|
|
|
The syntax and semantics of Lua are described in \See{language}.
|
|
|
|
The discussion below is not purely conceptual;
|
|
|
|
it includes references to the C~API \see{API},
|
|
|
|
because Lua is designed to be embedded in host programs.
|
|
|
|
It also includes references to the standard libraries \see{libraries}.
|
|
|
|
|
|
|
|
|
|
|
|
\subsection{Environment and Chunks}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
All statements in Lua are executed in a \Def{global environment}.
|
2000-08-09 23:09:20 +04:00
|
|
|
This environment is initialized with a call from the embedding program to
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|lua_open| and
|
2001-09-24 19:54:36 +04:00
|
|
|
persists until a call to \verb|lua_close|
|
1999-04-07 20:40:04 +04:00
|
|
|
or the end of the embedding program.
|
2000-09-18 23:41:16 +04:00
|
|
|
If necessary,
|
|
|
|
the host programmer can create multiple independent global
|
2000-05-12 23:19:18 +04:00
|
|
|
environments, and freely switch between them \see{mangstate}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
The global environment can be manipulated by Lua code or
|
|
|
|
by the embedding program,
|
2001-09-24 19:54:36 +04:00
|
|
|
using the API functions from the library that implements Lua.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
The unit of execution of Lua is called a \Def{chunk}.
|
2002-06-06 16:49:28 +04:00
|
|
|
A chunk is simply a sequence of statements.
|
1998-03-30 22:17:55 +04:00
|
|
|
Statements are described in \See{stats}.
|
1997-07-02 21:09:48 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
A chunk may be stored in a file or in a string inside the host program.
|
2002-02-15 00:48:32 +03:00
|
|
|
When a chunk is executed, first it is pre-compiled into opcodes for
|
2001-09-24 19:54:36 +04:00
|
|
|
a virtual machine,
|
2001-10-31 21:06:05 +03:00
|
|
|
and then the compiled statements are executed
|
|
|
|
by an interpreter for the virtual machine.
|
1995-11-16 23:46:02 +03:00
|
|
|
All modifications a chunk effects on the global environment persist
|
2000-05-12 23:19:18 +04:00
|
|
|
after the chunk ends.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
Chunks may also be pre-compiled into binary form and stored in files;
|
1997-06-19 00:14:52 +04:00
|
|
|
see program \IndexVerb{luac} for details.
|
1996-08-29 00:46:26 +04:00
|
|
|
Text files with chunks and their binary pre-compiled forms
|
2001-09-24 19:54:36 +04:00
|
|
|
are interchangeable;
|
1996-03-20 01:39:07 +03:00
|
|
|
Lua automatically detects the file type and acts accordingly.
|
|
|
|
\index{pre-compilation}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{\Index{Values and Types}} \label{TypesSec}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
Lua is a \emph{dynamically typed language}.
|
|
|
|
This means that
|
|
|
|
variables do not have types; only values do.
|
1995-11-16 23:46:02 +03:00
|
|
|
Therefore, there are no type definitions in the language.
|
1997-06-17 22:45:16 +04:00
|
|
|
All values carry their own type.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
There are seven \Index{basic types} in Lua:
|
|
|
|
\Def{nil}, \Def{boolean}, \Def{number},
|
1997-06-17 22:45:16 +04:00
|
|
|
\Def{string}, \Def{function}, \Def{userdata}, and \Def{table}.
|
1997-07-01 21:41:34 +04:00
|
|
|
\emph{Nil} is the type of the value \nil,
|
2002-02-15 00:48:32 +03:00
|
|
|
whose main property is to be different from any other value;
|
|
|
|
usually it represents the absence of a useful value.
|
|
|
|
\emph{Boolean} is the type of the values \False and \True.
|
|
|
|
In Lua, both \nil{} and \False make a condition fails,
|
|
|
|
and any other value makes it succeeds.
|
2001-10-31 21:06:05 +03:00
|
|
|
\emph{Number} represents real (double-precision floating-point) numbers.
|
2001-09-24 19:54:36 +04:00
|
|
|
\emph{String} represents arrays of characters.
|
2000-09-18 23:41:16 +04:00
|
|
|
\index{eight-bit clean}
|
|
|
|
Lua is 8-bit clean,
|
1998-06-18 21:36:27 +04:00
|
|
|
and so strings may contain any 8-bit character,
|
2000-11-07 15:44:44 +03:00
|
|
|
including embedded zeros (\verb|'\0'|) \see{lexical}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2002-06-06 16:49:28 +04:00
|
|
|
Functions are \emph{first-class values} in Lua.
|
1995-11-16 23:46:02 +03:00
|
|
|
This means that functions can be stored in variables,
|
1998-06-18 21:36:27 +04:00
|
|
|
passed as arguments to other functions, and returned as results.
|
1995-11-16 23:46:02 +03:00
|
|
|
Lua can call (and manipulate) functions written in Lua and
|
2001-09-24 19:54:36 +04:00
|
|
|
functions written in C
|
|
|
|
\see{functioncall}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1997-07-01 21:41:34 +04:00
|
|
|
The type \emph{userdata} is provided to allow
|
2000-11-07 15:44:44 +03:00
|
|
|
arbitrary \Index{C~pointers} to be stored in Lua variables.
|
2000-09-18 23:41:16 +04:00
|
|
|
This type corresponds to a \verb|void*|
|
|
|
|
and has no pre-defined operations in Lua,
|
2000-11-07 15:44:44 +03:00
|
|
|
except assignment and equality test.
|
2002-02-15 00:48:32 +03:00
|
|
|
However, by using \emph{metatables},
|
2001-09-24 19:54:36 +04:00
|
|
|
the programmer can define operations for userdata values
|
2002-02-15 00:48:32 +03:00
|
|
|
\see{metatables}.
|
2001-09-24 19:54:36 +04:00
|
|
|
Userdata values cannot be created or modified in Lua,
|
|
|
|
only through the C~API.
|
|
|
|
This guarantees the integrity of data owned by the host program.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1997-07-01 21:41:34 +04:00
|
|
|
The type \emph{table} implements \Index{associative arrays},
|
1996-08-29 00:46:26 +04:00
|
|
|
that is, \Index{arrays} that can be indexed not only with numbers,
|
1995-11-16 23:46:02 +03:00
|
|
|
but with any value (except \nil).
|
2001-09-24 19:54:36 +04:00
|
|
|
Moreover,
|
2002-06-06 16:49:28 +04:00
|
|
|
tables can be \emph{heterogeneous},
|
2001-09-24 19:54:36 +04:00
|
|
|
that is, they can contain values of all types.
|
2002-02-15 00:48:32 +03:00
|
|
|
Tables are the sole data structuring mechanism in Lua;
|
2001-09-24 19:54:36 +04:00
|
|
|
they may be used not only to represent ordinary arrays,
|
2000-11-07 15:44:44 +03:00
|
|
|
but also symbol tables, sets, records, graphs, trees, etc.
|
1995-11-16 23:46:02 +03:00
|
|
|
To represent \Index{records}, Lua uses the field name as an index.
|
|
|
|
The language supports this representation by
|
1997-06-09 22:16:33 +04:00
|
|
|
providing \verb|a.name| as syntactic sugar for \verb|a["name"]|.
|
2001-09-24 19:54:36 +04:00
|
|
|
There are several convenient ways to create tables in Lua
|
|
|
|
\see{tableconstructor}.
|
|
|
|
|
|
|
|
Like indices, the value of a table field can be of any type.
|
|
|
|
In particular,
|
|
|
|
because functions are first class values,
|
1995-11-16 23:46:02 +03:00
|
|
|
table fields may contain functions.
|
2002-06-06 16:49:28 +04:00
|
|
|
So, tables may also carry \emph{methods} \see{func-def}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
Tables, functions, and userdata values are \emph{objects}:
|
2001-09-24 19:54:36 +04:00
|
|
|
variables do not actually \emph{contain} these values,
|
|
|
|
only \emph{references} to them.
|
|
|
|
Assignment, parameter passing, and returns from functions
|
2002-02-15 00:48:32 +03:00
|
|
|
always manipulate references to these values,
|
|
|
|
and do not imply any kind of copy.
|
2001-09-24 19:54:36 +04:00
|
|
|
|
|
|
|
The library function \verb|type| returns a string describing the type
|
|
|
|
of a given value \see{pdf-type}.
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\subsubsection{Metatables}
|
|
|
|
|
|
|
|
Each table or userdata object in Lua may have a \Index{metatable}.
|
|
|
|
|
|
|
|
You can change several aspects of the behavior
|
|
|
|
of an object by setting specific fields in its metatable.
|
|
|
|
For instance, when an object is the operand of an addition,
|
|
|
|
Lua checks for a function in the field \verb|"add"| in its metatable.
|
|
|
|
If it finds one,
|
|
|
|
Lua calls that function to perform the addition.
|
|
|
|
|
2002-06-06 16:49:28 +04:00
|
|
|
A metatable works as a kind of an extended ``type'' for the object:
|
2002-02-15 00:48:32 +03:00
|
|
|
Objects that share a metatable has identical behavior.
|
|
|
|
|
|
|
|
A metatable controls how an object behaves in arithmetic operations,
|
|
|
|
order comparisons, concatenation, and indexing.
|
|
|
|
A metatable can also defines a function to be called when a userdata
|
|
|
|
is garbage collected,
|
|
|
|
and how the garbage collector treats entries in a table
|
|
|
|
\see{weak-table}.
|
|
|
|
\See{metatable} gives a detailed description of which events you
|
|
|
|
can control with metatables.
|
|
|
|
|
|
|
|
You can query and change the metatable of an object
|
|
|
|
through the \verb|metatable| function \see{pdf-metatable}.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
|
|
|
|
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
\subsection{\Index{Coercion}} \label{coercion}
|
|
|
|
|
2002-06-06 16:49:28 +04:00
|
|
|
Lua provides automatic conversion between
|
|
|
|
string and number values at run time.
|
2001-10-31 21:06:05 +03:00
|
|
|
Any arithmetic operation applied to a string tries to convert
|
|
|
|
that string to a number, following the usual rules.
|
|
|
|
Conversely, whenever a number is used when a string is expected,
|
|
|
|
the number is converted to a string, in a reasonable format.
|
|
|
|
The format is chosen so that
|
|
|
|
a conversion from number to string then back to number
|
|
|
|
reproduces the original number \emph{exactly}.
|
|
|
|
For complete control of how numbers are converted to strings,
|
|
|
|
use the \verb|format| function \see{format}.
|
|
|
|
|
|
|
|
|
|
|
|
\subsection{Variables}
|
|
|
|
|
|
|
|
There are two kinds of variables in Lua:
|
|
|
|
global variables
|
|
|
|
and local variables.
|
|
|
|
Variables are assumed to be global unless explicitly declared local
|
|
|
|
\see{localvar}.
|
2002-06-06 16:49:28 +04:00
|
|
|
Before the first assignment, the value of a variable is \nil.
|
2001-10-31 21:06:05 +03:00
|
|
|
|
2002-06-06 16:49:28 +04:00
|
|
|
All global variables live as fields in ordinary Lua tables.
|
|
|
|
Usually, globals live in a table called \Index{table of globals}.
|
|
|
|
However, a function can individually change its global table,
|
|
|
|
so that all global variables in that function will refer to that table.
|
|
|
|
This mechanism allows the creation of \Index{namespaces} and other
|
|
|
|
modularization facilities.
|
2001-10-31 21:06:05 +03:00
|
|
|
|
|
|
|
\Index{Local variables} are lexically scoped.
|
|
|
|
Therefore, local variables can be freely accessed by functions
|
|
|
|
defined inside their scope \see{visibility}.
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Garbage Collection}\label{GC}
|
2001-07-19 17:36:18 +04:00
|
|
|
|
|
|
|
Lua does automatic memory management.
|
2001-09-24 19:54:36 +04:00
|
|
|
This means that
|
|
|
|
you do not have to worry about allocating memory for new objects
|
|
|
|
and freeing it when the objects are no longer needed.
|
|
|
|
Lua manages memory automatically by running
|
|
|
|
a \Index{garbage collector} from time to time
|
|
|
|
and
|
2001-10-31 21:06:05 +03:00
|
|
|
collecting all dead objects
|
|
|
|
(all objects that are no longer accessible from Lua).
|
2001-09-24 19:54:36 +04:00
|
|
|
All objects in Lua are subject to automatic management:
|
2001-07-19 17:36:18 +04:00
|
|
|
tables, userdata, functions, and strings.
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Using the C~API,
|
|
|
|
you can set garbage-collector tag methods for user-defined
|
|
|
|
types based on userdata \see{tag-method}.
|
|
|
|
Lua calls those functions when it is about to free a userdata
|
|
|
|
of the corresponding type.
|
2002-02-15 00:48:32 +03:00
|
|
|
Using this facility, you can coordinate Lua's garbage collection
|
2001-09-24 19:54:36 +04:00
|
|
|
with external resource management
|
|
|
|
(such as closing files, network or database connections,
|
|
|
|
or freeing your own memory).
|
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
Lua uses two numbers to control its garbage-collection cycles.
|
|
|
|
One number counts how many bytes of dynamic memory Lua is using,
|
|
|
|
and the other is a threshold.
|
|
|
|
When the number of bytes crosses the threshold,
|
|
|
|
Lua runs the garbage collector,
|
2001-10-31 21:06:05 +03:00
|
|
|
which reclaims the memory of all dead objects.
|
2001-07-19 17:36:18 +04:00
|
|
|
The byte counter is corrected,
|
|
|
|
and then the threshold is reset to twice the value of the byte counter.
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Through the C~API, you can query those numbers,
|
2001-07-19 17:36:18 +04:00
|
|
|
and change the threshold \see{GC-API}.
|
|
|
|
Setting the threshold to zero actually forces an immediate
|
|
|
|
garbage-collection cycle,
|
2001-09-24 19:54:36 +04:00
|
|
|
while setting it to a huge number effectively stops the garbage collector.
|
|
|
|
Using Lua code you have a more limited control over garbage-collection cycles,
|
|
|
|
through the functions \verb|gcinfo| and \verb|collectgarbage|
|
|
|
|
\see{predefined}.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\subsubsection{Weak Tables}\label{weak-table}
|
2001-07-19 17:36:18 +04:00
|
|
|
|
|
|
|
A \IndexEmph{weak table} is a table whose elements are
|
|
|
|
\IndexEmph{weak references}.
|
2001-09-24 19:54:36 +04:00
|
|
|
A weak reference is ignored by the garbage collector.
|
|
|
|
In other words,
|
|
|
|
if the only references to an object are weak references,
|
|
|
|
then the garbage collector will collect that object.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
|
|
|
A weak table can have weak keys, weak values, or both.
|
|
|
|
A table with weak keys allows the collection of its keys,
|
2001-09-24 19:54:36 +04:00
|
|
|
but prevents the collection of its values.
|
|
|
|
A table with both weak keys and weak values allows the collection of
|
2002-06-06 16:49:28 +04:00
|
|
|
both keys and values.
|
2001-07-19 17:36:18 +04:00
|
|
|
In any case, if either the key or the value is collected,
|
|
|
|
the whole pair is removed from the table.
|
|
|
|
The weakness of a table is controled by the
|
2002-06-06 16:49:28 +04:00
|
|
|
\verb|__weakmode| field in its metatable \see{weakmode}.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
%------------------------------------------------------------------------------
|
|
|
|
\section{The Language}\label{language}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
This section describes the lexis, the syntax, and the semantics of Lua.
|
2001-09-24 19:54:36 +04:00
|
|
|
In other words,
|
|
|
|
this section describes
|
|
|
|
which tokens are valid,
|
|
|
|
how they can be combined,
|
|
|
|
and what their combinations mean.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
\subsection{Lexical Conventions} \label{lexical}
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\IndexEmph{Identifiers} in Lua can be any string of letters,
|
1998-06-18 21:36:27 +04:00
|
|
|
digits, and underscores,
|
1995-11-16 23:46:02 +03:00
|
|
|
not beginning with a digit.
|
2001-09-24 19:54:36 +04:00
|
|
|
This coincides with the definition of identifiers in most languages.
|
|
|
|
(The definition of letter depends on the current locale:
|
|
|
|
any character considered alphabetic by the current locale
|
|
|
|
can be used in an identifier.)
|
|
|
|
|
|
|
|
The following \IndexEmph{keywords} are reserved,
|
2001-07-19 17:36:18 +04:00
|
|
|
and cannot be used as identifiers:
|
1995-11-16 23:46:02 +03:00
|
|
|
\index{reserved words}
|
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
and break do else elseif
|
2002-02-15 00:48:32 +03:00
|
|
|
end false for function global
|
|
|
|
if in local nil not
|
|
|
|
or repeat return then true
|
|
|
|
until while
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
|
1997-07-02 21:09:48 +04:00
|
|
|
Lua is a case-sensitive language:
|
|
|
|
\T{and} is a reserved word, but \T{And} and \T{\'and}
|
2000-05-12 23:19:18 +04:00
|
|
|
(if the locale permits) are two different, valid identifiers.
|
2001-09-24 19:54:36 +04:00
|
|
|
As a convention, identifiers starting with an underscore followed by
|
2002-06-06 16:49:28 +04:00
|
|
|
uppercase letters (such as \verb|_VERSION|)
|
2000-04-14 21:47:55 +04:00
|
|
|
are reserved for internal variables.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
The following strings denote other \Index{tokens}:
|
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
+ - * / ^ %
|
2001-09-24 19:54:36 +04:00
|
|
|
~= <= >= < > == =
|
|
|
|
( ) { } [ ]
|
|
|
|
; : , . .. ...
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
|
|
|
|
2000-08-09 23:09:20 +04:00
|
|
|
\IndexEmph{Literal strings}
|
|
|
|
can be delimited by matching single or double quotes,
|
1995-11-16 23:46:02 +03:00
|
|
|
and can contain the C-like escape sequences
|
2000-09-18 23:41:16 +04:00
|
|
|
`\verb|\a|' (bell),
|
|
|
|
`\verb|\b|' (backspace),
|
|
|
|
`\verb|\f|' (form feed),
|
|
|
|
`\verb|\n|' (newline),
|
|
|
|
`\verb|\r|' (carriage return),
|
|
|
|
`\verb|\t|' (horizontal tab),
|
|
|
|
`\verb|\v|' (vertical tab),
|
|
|
|
`\verb|\\|' (backslash),
|
|
|
|
`\verb|\"|' (double quote),
|
|
|
|
`\verb|\'|' (single quote),
|
|
|
|
and `\verb|\|\emph{newline}' (that is, a backslash followed by a real newline,
|
2000-04-14 21:47:55 +04:00
|
|
|
which results in a newline in the string).
|
1998-03-30 22:17:55 +04:00
|
|
|
A character in a string may also be specified by its numerical value,
|
2000-09-18 23:41:16 +04:00
|
|
|
through the escape sequence `\verb|\|\emph{ddd}',
|
|
|
|
where \emph{ddd} is a sequence of up to three \emph{decimal} digits.
|
2000-05-12 23:19:18 +04:00
|
|
|
Strings in Lua may contain any 8-bit value, including embedded zeros,
|
2002-06-06 16:49:28 +04:00
|
|
|
which can be specified as `\verb|\0|'.
|
1998-06-07 01:05:52 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Literal strings can also be delimited by matching \verb|[[| $\ldots$ \verb|]]|.
|
1996-08-29 00:46:26 +04:00
|
|
|
Literals in this bracketed form may run for several lines,
|
2001-09-24 19:54:36 +04:00
|
|
|
may contain nested \verb|[[| $\ldots$ \verb|]]| pairs,
|
1995-11-16 23:46:02 +03:00
|
|
|
and do not interpret escape sequences.
|
2001-09-24 19:54:36 +04:00
|
|
|
For convenience,
|
|
|
|
when the opening \verb|[[| is immediately followed by a newline,
|
2001-07-19 17:36:18 +04:00
|
|
|
this newline is not included in the string.
|
1997-01-23 19:17:53 +03:00
|
|
|
This form is specially convenient for
|
1998-01-02 21:34:00 +03:00
|
|
|
writing strings that contain program pieces or
|
1997-06-17 22:45:16 +04:00
|
|
|
other quoted strings.
|
2001-09-24 19:54:36 +04:00
|
|
|
As an example, in a system using ASCII
|
2002-02-15 00:48:32 +03:00
|
|
|
(in which `\verb|a|' is coded as~97,
|
|
|
|
newline is coded as~10, and `\verb|1|' is coded as~49),
|
2002-06-06 16:49:28 +04:00
|
|
|
the four literals below denote the same string:
|
1998-03-30 22:17:55 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
1) "alo\n123\""
|
|
|
|
2) '\97lo\10\04923"'
|
|
|
|
3) [[alo
|
|
|
|
123"]]
|
2001-07-19 17:36:18 +04:00
|
|
|
4) [[
|
|
|
|
alo
|
|
|
|
123"]]
|
1998-03-30 22:17:55 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\IndexEmph{Numerical constants} may be written with an optional decimal part
|
1995-11-16 23:46:02 +03:00
|
|
|
and an optional decimal exponent.
|
1999-04-07 20:40:04 +04:00
|
|
|
Examples of valid numerical constants are
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
3 3.0 3.1416 314.16e-2 0.31416E1
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\IndexEmph{Comments} start anywhere outside a string with a
|
2002-06-06 16:49:28 +04:00
|
|
|
double hyphen (\verb|--|);
|
|
|
|
If the text after \verb|--| is different from \verb|[[|,
|
|
|
|
the comment is a short comment,
|
|
|
|
that runs until the end of the line.
|
|
|
|
Otherwise, it is a long comment,
|
|
|
|
that runs until the corresponding \verb|]]|.
|
|
|
|
Long comments may run for several lines,
|
|
|
|
and may contain nested \verb|[[| $\ldots$ \verb|]]| pairs.
|
2001-09-24 19:54:36 +04:00
|
|
|
For convenience,
|
|
|
|
the first line of a chunk is skipped if it starts with \verb|#|.
|
|
|
|
This facility allows the use of Lua as a script interpreter
|
|
|
|
in Unix systems \see{lua-sa}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Variables}\label{variables}
|
|
|
|
|
|
|
|
Variables are places that store values.
|
2001-10-31 21:06:05 +03:00
|
|
|
%In Lua, variables are given by simple identifiers or by table fields.
|
2001-09-24 19:54:36 +04:00
|
|
|
|
|
|
|
A single name can denote a global variable, a local variable,
|
|
|
|
or a formal parameter in a function
|
|
|
|
(formal parameters are just local variables):
|
|
|
|
\begin{Produc}
|
|
|
|
\produc{var}{name}
|
|
|
|
\end{Produc}%
|
|
|
|
|
|
|
|
Square brackets are used to index a table:
|
|
|
|
\begin{Produc}
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{var}{prefixexp \ter{[} exp \ter{]}}
|
2001-09-24 19:54:36 +04:00
|
|
|
\end{Produc}%
|
|
|
|
The first expression should result in a table value,
|
2002-02-15 00:48:32 +03:00
|
|
|
and the second expression identifies a specific entry inside that table.
|
2001-09-24 19:54:36 +04:00
|
|
|
|
|
|
|
The syntax \verb|var.NAME| is just syntactic sugar for
|
|
|
|
\verb|var["NAME"]|:
|
|
|
|
\begin{Produc}
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{var}{prefixexp \ter{.} name}
|
2001-09-24 19:54:36 +04:00
|
|
|
\end{Produc}%
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
The expression denoting the table to be indexed has a restricted syntax;
|
|
|
|
\See{expressions} for details.
|
|
|
|
|
|
|
|
The meaning of assignments and evaluations of global and
|
|
|
|
indexed variables can be changed via metatables.
|
2001-09-24 19:54:36 +04:00
|
|
|
An assignment to a global variable \verb|x = val|
|
2002-06-06 16:49:28 +04:00
|
|
|
is equivalent to the assignment
|
|
|
|
\verb|_glob.x = val|,
|
|
|
|
where \verb|_glob| is the table of globals of the running function
|
|
|
|
(\see{global-table} for a discussion about the table of globals).
|
2002-02-15 00:48:32 +03:00
|
|
|
An assignment to an indexed variable \verb|t[i] = val| is equivalent to
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|settable_event(t,i,val)|.
|
|
|
|
An access to a global variable \verb|x|
|
2002-06-06 16:49:28 +04:00
|
|
|
is equivalent to \verb|_glob.x|
|
|
|
|
(again, \see{global-table} for a discussion about \verb|_glob|).
|
2002-02-15 00:48:32 +03:00
|
|
|
An access to an indexed variable \verb|t[i]| is equivalent to
|
2001-09-24 19:54:36 +04:00
|
|
|
a call \verb|gettable_event(t,i)|.
|
2002-06-06 16:49:28 +04:00
|
|
|
See \See{metatable} for a complete description of the
|
|
|
|
\verb|settable_event| and \verb|gettable_event| functions.
|
2002-02-15 00:48:32 +03:00
|
|
|
(These functions are not defined in Lua.
|
|
|
|
We use them here only for explanatory purposes.)
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
|
1998-03-30 22:17:55 +04:00
|
|
|
\subsection{Statements}\label{stats}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1997-01-23 19:17:53 +03:00
|
|
|
Lua supports an almost conventional set of \Index{statements},
|
|
|
|
similar to those in Pascal or C.
|
1995-11-16 23:46:02 +03:00
|
|
|
The conventional commands include
|
2000-05-12 23:19:18 +04:00
|
|
|
assignment, control structures, and procedure calls.
|
1996-08-29 00:46:26 +04:00
|
|
|
Non-conventional commands include table constructors
|
2002-06-06 16:49:28 +04:00
|
|
|
and variable declarations.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsubsection{Chunks}\label{chunks}
|
|
|
|
The unit of execution of Lua is called a \Def{chunk}.
|
|
|
|
A chunk is simply a sequence of statements,
|
|
|
|
which are executed sequentially.
|
|
|
|
Each statement can be optionally followed by a semicolon:
|
|
|
|
\begin{Produc}
|
|
|
|
\produc{chunk}{\rep{stat \opt{\ter{;}}}}
|
|
|
|
\end{Produc}%
|
|
|
|
|
|
|
|
The notation used above is the usual extended BNF,
|
|
|
|
in which
|
|
|
|
\rep{\emph{a}}~means 0 or more \emph{a}'s, and
|
|
|
|
\opt{\emph{a}}~means an optional \emph{a}.
|
|
|
|
Non-terminals are shown in \emph{italics},
|
|
|
|
keywords are shown in {\bf bold},
|
|
|
|
and other terminal symbols are shown in {\tt typewriter} font,
|
|
|
|
enclosed in single quotes.
|
2002-06-06 16:49:28 +04:00
|
|
|
The complete syntax of Lua in extended BNF is given on page~\pageref{BNF}.
|
2001-09-24 19:54:36 +04:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
\subsubsection{Blocks}
|
2000-08-09 23:09:20 +04:00
|
|
|
A \Index{block} is a list of statements;
|
2000-09-18 23:41:16 +04:00
|
|
|
syntactically, a block is equal to a chunk:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
2000-08-09 23:09:20 +04:00
|
|
|
\produc{block}{chunk}
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{Produc}%
|
|
|
|
|
1998-01-02 21:34:00 +03:00
|
|
|
A block may be explicitly delimited:
|
|
|
|
\begin{Produc}
|
|
|
|
\produc{stat}{\rwd{do} block \rwd{end}}
|
|
|
|
\end{Produc}%
|
2002-02-15 00:48:32 +03:00
|
|
|
\IndexKW{do}
|
2000-11-07 15:44:44 +03:00
|
|
|
Explicit blocks are useful
|
2002-06-06 16:49:28 +04:00
|
|
|
to control the scope of variable declarations.
|
2000-11-07 15:44:44 +03:00
|
|
|
Explicit blocks are also sometimes used to
|
|
|
|
add a \rwd{return} or \rwd{break} statement in the middle
|
|
|
|
of another block \see{control}.
|
1998-01-02 21:34:00 +03:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
\subsubsection{\Index{Assignment}} \label{assignment}
|
2000-09-18 23:41:16 +04:00
|
|
|
Lua allows \Index{multiple assignment}.
|
1997-06-19 00:14:52 +04:00
|
|
|
Therefore, the syntax for assignment
|
2000-05-12 23:19:18 +04:00
|
|
|
defines a list of variables on the left side
|
1995-11-16 23:46:02 +03:00
|
|
|
and a list of expressions on the right side.
|
2000-09-18 23:41:16 +04:00
|
|
|
The elements in both lists are separated by commas:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
|
|
|
\produc{stat}{varlist1 \ter{=} explist1}
|
|
|
|
\produc{varlist1}{var \rep{\ter{,} var}}
|
2001-09-24 19:54:36 +04:00
|
|
|
\produc{explist1}{exp \rep{\ter{,} exp}}
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{Produc}%
|
2001-09-24 19:54:36 +04:00
|
|
|
Expressions are discussed in \See{expressions}.
|
|
|
|
|
|
|
|
Before the assignment,
|
|
|
|
the list of values is \emph{adjusted} to the length of
|
|
|
|
the list of variables.\index{adjustment}
|
2002-06-06 16:49:28 +04:00
|
|
|
If there are more values than needed,
|
2001-09-24 19:54:36 +04:00
|
|
|
the excess values are thrown away.
|
2002-06-06 16:49:28 +04:00
|
|
|
If there are less values than needed,
|
2001-09-24 19:54:36 +04:00
|
|
|
the list is extended with as many \nil's as needed.
|
|
|
|
If the list of expressions ends with a function call,
|
|
|
|
then all values returned by that function call enter in the list of values,
|
|
|
|
before the adjust
|
|
|
|
(except when the call is enclosed in parentheses; see \See{expressions}).
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
The assignment statement first evaluates all its expressions,
|
|
|
|
and only then makes the assignments.
|
2000-11-07 15:44:44 +03:00
|
|
|
So, the code
|
2000-05-12 23:19:18 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
i = 3
|
2001-09-24 19:54:36 +04:00
|
|
|
i, a[i] = i+1, 20
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{verbatim}
|
2002-06-06 16:49:28 +04:00
|
|
|
sets \verb|a[3]| to 20, without affecting \verb|a[4]|
|
2000-09-18 23:41:16 +04:00
|
|
|
because the \verb|i| in \verb|a[i]| is evaluated
|
2001-09-24 19:54:36 +04:00
|
|
|
before it is assigned 4.
|
2002-02-15 00:48:32 +03:00
|
|
|
Similarly, the line
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
x, y = y, x
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
exchanges the values of \verb|x| and \verb|y|.
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection{Control Structures}\label{control}
|
2000-09-18 23:41:16 +04:00
|
|
|
The control structures
|
2000-11-07 15:44:44 +03:00
|
|
|
\rwd{if}, \rwd{while}, and \rwd{repeat} have the usual meaning and
|
2001-09-24 19:54:36 +04:00
|
|
|
familiar syntax:
|
2002-02-15 00:48:32 +03:00
|
|
|
\index{while-do statement}\IndexKW{while}
|
|
|
|
\index{repeat-until statement}\IndexKW{repeat}\IndexKW{until}
|
|
|
|
\index{if-then-else statement}\IndexKW{if}\IndexKW{else}\IndexKW{elseif}
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
2001-07-19 17:36:18 +04:00
|
|
|
\produc{stat}{\rwd{while} exp \rwd{do} block \rwd{end}}
|
|
|
|
\produc{stat}{\rwd{repeat} block \rwd{until} exp}
|
|
|
|
\produc{stat}{\rwd{if} exp \rwd{then} block
|
|
|
|
\rep{\rwd{elseif} exp \rwd{then} block}
|
1995-11-16 23:46:02 +03:00
|
|
|
\opt{\rwd{else} block} \rwd{end}}
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{Produc}%
|
2002-06-06 16:49:28 +04:00
|
|
|
Lua also has a \rwd{for} statement, in two flavors \see{for}.
|
2001-09-24 19:54:36 +04:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
The \Index{condition expression} \M{exp} of a
|
|
|
|
control structure may return any value.
|
2002-06-06 16:49:28 +04:00
|
|
|
All values different from \nil\ and \False\ are considered true
|
|
|
|
(in particular, the number 0 and the empty string are also true);
|
2002-02-15 00:48:32 +03:00
|
|
|
both \False\ and \nil\ are considered false.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-08-09 23:09:20 +04:00
|
|
|
The \rwd{return} statement is used to return values
|
2002-02-15 00:48:32 +03:00
|
|
|
from a function or from a chunk.\IndexKW{return}
|
2000-11-07 15:44:44 +03:00
|
|
|
\label{return}%
|
|
|
|
\index{return statement}%
|
2001-09-24 19:54:36 +04:00
|
|
|
Functions and chunks may return more than one value,
|
|
|
|
and so the syntax for the \rwd{return} statement is
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
2000-04-14 21:47:55 +04:00
|
|
|
\produc{stat}{\rwd{return} \opt{explist1}}
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{Produc}%
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
The \rwd{break} statement can be used to terminate the execution of a
|
|
|
|
\rwd{while}, \rwd{repeat}, or \rwd{for} loop,
|
2002-02-15 00:48:32 +03:00
|
|
|
skipping to the next statement after the loop:\IndexKW{break}
|
2000-11-07 15:44:44 +03:00
|
|
|
\index{break statement}
|
2000-04-14 21:47:55 +04:00
|
|
|
\begin{Produc}
|
2000-08-09 23:09:20 +04:00
|
|
|
\produc{stat}{\rwd{break}}
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{Produc}%
|
2001-09-24 19:54:36 +04:00
|
|
|
A \rwd{break} ends the innermost enclosing loop.
|
2000-04-14 21:47:55 +04:00
|
|
|
|
2000-08-09 23:09:20 +04:00
|
|
|
\NOTE
|
2000-04-14 21:47:55 +04:00
|
|
|
For syntactic reasons, \rwd{return} and \rwd{break}
|
2002-02-15 00:48:32 +03:00
|
|
|
statements can only be written as the \emph{last} statement of a block.
|
2000-11-07 15:44:44 +03:00
|
|
|
If it is really necessary to \rwd{return} or \rwd{break} in the
|
|
|
|
middle of a block,
|
2001-09-24 19:54:36 +04:00
|
|
|
then an explicit inner block can used,
|
|
|
|
as in the idioms
|
|
|
|
`\verb|do return end|' and
|
|
|
|
`\verb|do break end|',
|
2002-02-15 00:48:32 +03:00
|
|
|
because now \rwd{return} and \rwd{break} are the last statements in
|
|
|
|
their (inner) blocks.
|
2001-09-24 19:54:36 +04:00
|
|
|
In practice,
|
|
|
|
these idioms are only used during debugging.
|
2002-02-15 00:48:32 +03:00
|
|
|
(For instance, a line `\verb|do return end|' can be added at the
|
|
|
|
beginning of a chunk for syntax checking only.)
|
2000-04-14 21:47:55 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection{For Statement} \label{for}\index{for statement}
|
2000-04-14 21:47:55 +04:00
|
|
|
|
2000-08-09 23:09:20 +04:00
|
|
|
The \rwd{for} statement has two forms,
|
2002-02-15 00:48:32 +03:00
|
|
|
one for numbers and one generic.
|
|
|
|
\IndexKW{for}\IndexKW{in}
|
2001-09-24 19:54:36 +04:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
The numerical \rwd{for} loop repeats a block of code while a
|
|
|
|
control variables runs through an arithmetic progression.
|
|
|
|
It has the following syntax:
|
2000-04-14 21:47:55 +04:00
|
|
|
\begin{Produc}
|
2001-07-19 17:36:18 +04:00
|
|
|
\produc{stat}{\rwd{for} name \ter{=} exp \ter{,} exp \opt{\ter{,} exp}
|
2000-04-14 21:47:55 +04:00
|
|
|
\rwd{do} block \rwd{end}}
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{Produc}%
|
2001-09-24 19:54:36 +04:00
|
|
|
The \emph{block} is repeated for \emph{name} starting at the value of
|
|
|
|
the first \emph{exp}, until it reaches the second \emph{exp} by steps of the
|
|
|
|
third \emph{exp}.
|
|
|
|
More precisely, a \rwd{for} statement like
|
2000-04-14 21:47:55 +04:00
|
|
|
\begin{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
for var = e1, e2, e3 do block end
|
2000-04-14 21:47:55 +04:00
|
|
|
\end{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
is equivalent to the code:
|
2000-04-14 21:47:55 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
do
|
|
|
|
local var, _limit, _step = tonumber(e1), tonumber(e2), tonumber(e3)
|
|
|
|
if not (var and _limit and _step) then error() end
|
|
|
|
while (_step>0 and var<=_limit) or (_step<=0 and var>=_limit) do
|
|
|
|
block
|
|
|
|
var = var+_step
|
|
|
|
end
|
|
|
|
end
|
2000-04-14 21:47:55 +04:00
|
|
|
\end{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
Note the following:
|
2000-05-12 23:19:18 +04:00
|
|
|
\begin{itemize}\itemsep=0pt
|
2002-02-15 00:48:32 +03:00
|
|
|
\item Both the limit and the step are evaluated only once,
|
|
|
|
before the loop starts.
|
2000-04-14 21:47:55 +04:00
|
|
|
\item \verb|_limit| and \verb|_step| are invisible variables.
|
2000-05-12 23:19:18 +04:00
|
|
|
The names are here for explanatory purposes only.
|
|
|
|
\item The behavior is \emph{undefined} if you assign to \verb|var| inside
|
2000-04-14 21:47:55 +04:00
|
|
|
the block.
|
2000-11-07 15:44:44 +03:00
|
|
|
\item If the third expression (the step) is absent, then a step of~1 is used.
|
2001-09-24 19:54:36 +04:00
|
|
|
\item You can use \rwd{break} to exit a \rwd{for} loop.
|
|
|
|
\item The loop variable \verb|var| is local to the statement;
|
|
|
|
you cannot use its value after the \rwd{for} ends or is broken.
|
|
|
|
If you need the value of the loop variable \verb|var|,
|
|
|
|
then assign it to another variable before breaking or exiting the loop.
|
2000-04-14 21:47:55 +04:00
|
|
|
\end{itemize}
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
The generic \rwd{for} statement works both over tables
|
|
|
|
and over functions.
|
|
|
|
When used with a \IndexEmph{generator function},
|
|
|
|
it calls this function to produce a new value for each iteration,
|
|
|
|
stopping when the new value is \nil.
|
2000-08-09 23:09:20 +04:00
|
|
|
It has the following syntax:
|
|
|
|
\begin{Produc}
|
2002-06-06 16:49:28 +04:00
|
|
|
\produc{stat}{\rwd{for} name \rep{\ter{,} name} \rwd{in} explist1
|
2000-08-09 23:09:20 +04:00
|
|
|
\rwd{do} block \rwd{end}}
|
|
|
|
\end{Produc}%
|
|
|
|
A \rwd{for} statement like
|
|
|
|
\begin{verbatim}
|
2002-06-06 16:49:28 +04:00
|
|
|
for var_1, ..., var_n in explist do block end
|
2000-08-09 23:09:20 +04:00
|
|
|
\end{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
is equivalent to the code:
|
2000-08-09 23:09:20 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
do
|
2002-06-06 16:49:28 +04:00
|
|
|
local _f, _s, var_1 = explist
|
2002-02-15 00:48:32 +03:00
|
|
|
while 1 do
|
2002-06-06 16:49:28 +04:00
|
|
|
local var_2, ..., var_n
|
|
|
|
var_1, ..., var_n = _f(_s, var_1)
|
|
|
|
if var_1 == nil then break end
|
2000-09-18 23:41:16 +04:00
|
|
|
block
|
|
|
|
end
|
|
|
|
end
|
2000-08-09 23:09:20 +04:00
|
|
|
\end{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
Note the following:
|
2000-08-09 23:09:20 +04:00
|
|
|
\begin{itemize}\itemsep=0pt
|
2002-06-06 16:49:28 +04:00
|
|
|
\item \verb|explist| is evaluated only once.
|
|
|
|
Its results are a ``generator'' function,
|
|
|
|
a ``state'', and an initial value for the ``iterator variable''.
|
|
|
|
\item \verb|_f| and \verb|_s| are invisible variables.
|
|
|
|
The names are here for explanatory purposes only.
|
|
|
|
\item The behavior is \emph{undefined} if you assign to any
|
|
|
|
\verb|var_i| inside the block.
|
2001-09-24 19:54:36 +04:00
|
|
|
\item You can use \rwd{break} to exit a \rwd{for} loop.
|
2002-06-06 16:49:28 +04:00
|
|
|
\item The loop variables \verb|var_i| are local to the statement;
|
2000-08-09 23:09:20 +04:00
|
|
|
you cannot use their values after the \rwd{for} ends.
|
2002-02-15 00:48:32 +03:00
|
|
|
If you need these values,
|
2001-09-24 19:54:36 +04:00
|
|
|
then assign them to other variables before breaking or exiting the loop.
|
2000-08-09 23:09:20 +04:00
|
|
|
\end{itemize}
|
|
|
|
|
2002-06-06 16:49:28 +04:00
|
|
|
If the first result of the expression list is a table \verb|t|
|
|
|
|
(instead of a function),
|
|
|
|
then the loop works as if it has received \verb|next, t| as its
|
|
|
|
expression list.
|
2002-02-15 00:48:32 +03:00
|
|
|
That is, the loop iterates over the (key,value) pairs of the table.
|
|
|
|
|
2000-08-09 23:09:20 +04:00
|
|
|
|
1996-02-05 17:52:47 +03:00
|
|
|
\subsubsection{Function Calls as Statements} \label{funcstat}
|
|
|
|
Because of possible side-effects,
|
1996-08-29 00:46:26 +04:00
|
|
|
function calls can be executed as statements:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
|
|
|
\produc{stat}{functioncall}
|
|
|
|
\end{Produc}%
|
1998-03-30 22:17:55 +04:00
|
|
|
In this case, all returned values are thrown away.
|
1998-01-06 22:17:31 +03:00
|
|
|
Function calls are explained in \See{functioncall}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
\subsubsection{Local Declarations} \label{localvar}
|
1997-01-23 19:17:53 +03:00
|
|
|
\Index{Local variables} may be declared anywhere inside a block.
|
2002-02-15 00:48:32 +03:00
|
|
|
The declaration may include an initial assignment:\IndexKW{local}
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
2001-09-24 19:54:36 +04:00
|
|
|
\produc{stat}{\rwd{local} namelist \opt{\ter{=} explist1}}
|
|
|
|
\produc{namelist}{name \rep{\ter{,} name}}
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{Produc}%
|
1996-08-29 00:46:26 +04:00
|
|
|
If present, an initial assignment has the same semantics
|
2001-09-24 19:54:36 +04:00
|
|
|
of a multiple assignment \see{assignment}.
|
1995-11-16 23:46:02 +03:00
|
|
|
Otherwise, all variables are initialized with \nil.
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
A chunk is also a block \see{chunks},
|
|
|
|
and so local variables can be declared outside any explicit block.
|
|
|
|
Such local variables die when the chunk ends.
|
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
Visibility rules for local variables are explained in \See{visibility}.
|
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{\Index{Expressions}}\label{expressions}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
%\subsubsection{\Index{Basic Expressions}}
|
|
|
|
The basic expressions in Lua are the following:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{exp}{prefixexp}
|
|
|
|
\produc{exp}{\rwd{nil} \Or \rwd{false} \Or \rwd{true}}
|
|
|
|
\produc{exp}{Number}
|
|
|
|
\produc{exp}{Literal}
|
2000-11-07 15:44:44 +03:00
|
|
|
\produc{exp}{function}
|
2000-08-09 23:09:20 +04:00
|
|
|
\produc{exp}{tableconstructor}
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{prefixexp}{var \Or functioncall \Or \ter{(} exp \ter{)}}
|
1998-01-02 21:34:00 +03:00
|
|
|
\end{Produc}%
|
2002-02-15 00:48:32 +03:00
|
|
|
\IndexKW{nil}
|
1998-01-02 21:34:00 +03:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
An expression enclosed in parentheses always results in only one value.
|
2001-09-24 19:54:36 +04:00
|
|
|
Thus,
|
|
|
|
\verb|(f(x,y,z))| is always a single value,
|
|
|
|
even if \verb|f| returns several values.
|
|
|
|
(The value of \verb|(f(x,y,z))| is the first value returned by \verb|f|
|
|
|
|
or \nil\ if \verb|f| does not return any values.)
|
2001-07-19 17:36:18 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\emph{Numbers} and \emph{literal strings} are explained in \See{lexical};
|
|
|
|
variables are explained in \See{variables};
|
2000-11-07 15:44:44 +03:00
|
|
|
function definitions are explained in \See{func-def};
|
2001-09-24 19:54:36 +04:00
|
|
|
function calls are explained in \See{functioncall};
|
|
|
|
table constructors are explained in \See{tableconstructor}.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Expressions can also be built with arithmetic operators, relational operators,
|
|
|
|
and logical operadors, all of which are explained below.
|
1997-06-09 22:16:33 +04:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
\subsubsection{Arithmetic Operators}
|
1997-06-19 00:14:52 +04:00
|
|
|
Lua supports the usual \Index{arithmetic operators}:
|
|
|
|
the binary \verb|+| (addition),
|
|
|
|
\verb|-| (subtraction), \verb|*| (multiplication),
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|/| (division), and \verb|^| (exponentiation);
|
1997-06-19 00:14:52 +04:00
|
|
|
and unary \verb|-| (negation).
|
1995-11-16 23:46:02 +03:00
|
|
|
If the operands are numbers, or strings that can be converted to
|
2001-09-24 19:54:36 +04:00
|
|
|
numbers \see{coercion},
|
2002-02-15 00:48:32 +03:00
|
|
|
then all operations except exponentiation have the usual meaning,
|
|
|
|
while exponentiation calls a global function \verb|pow|;
|
2001-09-24 19:54:36 +04:00
|
|
|
otherwise, an appropriate tag method is called \see{tag-method}.
|
2002-02-15 00:48:32 +03:00
|
|
|
The standard mathematical library defines function \verb|pow|,
|
1996-08-29 00:46:26 +04:00
|
|
|
giving the expected meaning to \Index{exponentiation}
|
1997-01-23 19:17:53 +03:00
|
|
|
\see{mathlib}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsubsection{Relational Operators}\label{rel-ops}
|
2000-09-18 23:41:16 +04:00
|
|
|
The \Index{relational operators} in Lua are
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
== ~= < > <= >=
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
These operators always result in \False\ or \True.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Equality (\verb|==|) first compares the type of its operands.
|
2002-02-15 00:48:32 +03:00
|
|
|
If the types are different, then the result is \False.
|
2001-09-24 19:54:36 +04:00
|
|
|
Otherwise, the values of the operands are compared.
|
2001-10-31 21:06:05 +03:00
|
|
|
Numbers and strings are compared in the usual way.
|
|
|
|
Tables, userdata, and functions are compared \emph{by reference},
|
2001-07-19 17:36:18 +04:00
|
|
|
that is,
|
|
|
|
two tables are considered equal only if they are the \emph{same} table.
|
2001-09-24 19:54:36 +04:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
Every time you create a new table (or userdata, or function),
|
2001-09-24 19:54:36 +04:00
|
|
|
this new value is different from any previously existing value.
|
2000-04-14 21:47:55 +04:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\NOTE
|
2000-04-14 21:47:55 +04:00
|
|
|
The conversion rules of \See{coercion}
|
1997-07-01 21:41:34 +04:00
|
|
|
\emph{do not} apply to equality comparisons.
|
2000-05-12 23:19:18 +04:00
|
|
|
Thus, \verb|"0"==0| evaluates to \emph{false},
|
1998-03-30 22:17:55 +04:00
|
|
|
and \verb|t[0]| and \verb|t["0"]| denote different
|
|
|
|
entries in a table.
|
2000-09-18 23:41:16 +04:00
|
|
|
\medskip
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
The operator \verb|~=| is exactly the negation of equality (\verb|==|).
|
|
|
|
|
2000-04-17 23:23:48 +04:00
|
|
|
The order operators work as follows.
|
1996-08-29 00:46:26 +04:00
|
|
|
If both arguments are numbers, then they are compared as such.
|
1997-06-17 22:45:16 +04:00
|
|
|
Otherwise, if both arguments are strings,
|
2001-10-31 21:06:05 +03:00
|
|
|
then their values are compared according to the current locale.
|
2000-05-12 23:19:18 +04:00
|
|
|
Otherwise, the ``lt'' tag method is called \see{tag-method}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
\subsubsection{Logical Operators}
|
2000-09-18 23:41:16 +04:00
|
|
|
The \Index{logical operators} in Lua are
|
1995-11-16 23:46:02 +03:00
|
|
|
\index{and}\index{or}\index{not}
|
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
and or not
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
Like the control structures \see{control},
|
2002-02-15 00:48:32 +03:00
|
|
|
all logical operators consider both \False\ and \nil\ as false
|
|
|
|
and anything else as true.
|
|
|
|
\IndexKW{and}\IndexKW{or}\IndexKW{not}
|
2000-09-18 23:41:16 +04:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
The operator \rwd{not} always return \False\ or \True.
|
|
|
|
|
|
|
|
The conjunction operator \rwd{and} returns its first argument
|
|
|
|
if its value is \False\ or \nil;
|
2001-09-24 19:54:36 +04:00
|
|
|
otherwise, \rwd{and} returns its second argument.
|
|
|
|
The disjunction operator \rwd{or} returns its first argument
|
2002-02-15 00:48:32 +03:00
|
|
|
if it is different from \nil and \False;
|
2001-09-24 19:54:36 +04:00
|
|
|
otherwise, \rwd{or} returns its second argument.
|
|
|
|
Both \rwd{and} and \rwd{or} use \Index{short-cut evaluation},
|
1995-11-16 23:46:02 +03:00
|
|
|
that is,
|
2000-11-07 15:44:44 +03:00
|
|
|
the second operand is evaluated only if necessary.
|
2002-02-15 00:48:32 +03:00
|
|
|
For example,
|
1998-06-18 21:36:27 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
10 or error() -> 10
|
|
|
|
nil or "a" -> "a"
|
|
|
|
nil and 10 -> nil
|
|
|
|
false and error() -> false
|
|
|
|
false and nil -> false
|
|
|
|
false or nil -> nil
|
|
|
|
10 and 20 -> 20
|
1998-06-18 21:36:27 +04:00
|
|
|
\end{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
%There are two useful Lua idioms that use logical operators.
|
|
|
|
%The first idiom is
|
|
|
|
%\begin{verbatim}
|
|
|
|
% x = x or v
|
|
|
|
%\end{verbatim}
|
|
|
|
%which is equivalent to
|
|
|
|
%\begin{verbatim}
|
|
|
|
% if not x then x = v end
|
|
|
|
%\end{verbatim}
|
|
|
|
%This idiom sets \verb|x| to a default value \verb|v| when \verb|x| is not set
|
|
|
|
%(provided that \verb|x| is not a boolean value).
|
|
|
|
|
|
|
|
%The second idiom is
|
|
|
|
%\begin{verbatim}
|
|
|
|
% x = a and b or c
|
|
|
|
%\end{verbatim}
|
|
|
|
%which should be read as \verb|x = (a and b) or c|.
|
|
|
|
%This idiom is equivalent to
|
|
|
|
%\begin{verbatim}
|
|
|
|
% if a then x = b else x = c end
|
|
|
|
%\end{verbatim}
|
|
|
|
%provided that \verb|b| is not \nil.
|
1998-06-18 21:36:27 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\subsubsection{Concatenation} \label{concat}
|
1998-06-18 21:36:27 +04:00
|
|
|
The string \Index{concatenation} operator in Lua is
|
2001-09-24 19:54:36 +04:00
|
|
|
denoted by two dots (`\verb|..|').
|
2000-09-18 23:41:16 +04:00
|
|
|
If both operands are strings or numbers, then they are converted to
|
2001-09-24 19:54:36 +04:00
|
|
|
strings according to the rules mentioned in \See{coercion}.
|
1997-06-19 00:14:52 +04:00
|
|
|
Otherwise, the ``concat'' tag method is called \see{tag-method}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
\subsubsection{Precedence}
|
2000-09-18 23:41:16 +04:00
|
|
|
\Index{Operator precedence} in Lua follows the table below,
|
2001-09-24 19:54:36 +04:00
|
|
|
from lower to higher priority:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
and or
|
|
|
|
< > <= >= ~= ==
|
|
|
|
..
|
|
|
|
+ -
|
|
|
|
* /
|
|
|
|
not - (unary)
|
|
|
|
^
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
1996-08-29 00:46:26 +04:00
|
|
|
All binary operators are left associative,
|
1997-06-09 22:16:33 +04:00
|
|
|
except for \verb|^| (exponentiation),
|
1995-11-16 23:46:02 +03:00
|
|
|
which is right associative.
|
2000-05-12 23:19:18 +04:00
|
|
|
\NOTE
|
2000-04-14 21:47:55 +04:00
|
|
|
The pre-compiler may rearrange the order of evaluation of
|
2002-02-15 00:48:32 +03:00
|
|
|
associative operators,
|
|
|
|
and may exchange the operands of commutative operators,
|
2000-04-14 21:47:55 +04:00
|
|
|
as long as these optimizations do not change normal results.
|
2000-05-12 23:19:18 +04:00
|
|
|
However, these optimizations may change some results
|
2001-07-19 17:36:18 +04:00
|
|
|
if you define non-associative (or non-commutative)
|
2000-04-14 21:47:55 +04:00
|
|
|
tag methods for these operators.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
\subsubsection{Table Constructors} \label{tableconstructor}
|
|
|
|
Table \Index{constructors} are expressions that create tables;
|
|
|
|
every time a constructor is evaluated, a new table is created.
|
|
|
|
Constructors can be used to create empty tables,
|
2000-11-07 15:44:44 +03:00
|
|
|
or to create a table and initialize some of its fields.
|
1999-04-07 20:40:04 +04:00
|
|
|
The general syntax for constructors is
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{tableconstructor}{\ter{\{} \opt{fieldlist} \ter{\}}}
|
|
|
|
\produc{fieldlist}{field \rep{fieldsep field} \opt{fieldsep}}
|
|
|
|
\produc{field}{\ter{[} exp \ter{]} \ter{=} exp \Or name \ter{=} exp \Or exp}
|
|
|
|
\produc{fieldsep}{\ter{,} \Or \ter{;}}
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{Produc}%
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
Each field of the form \verb|[exp1] = exp2| adds to the new table an entry
|
|
|
|
with key \verb|exp1| and value \verb|exp2|.
|
|
|
|
A field of the form \verb|name = exp| is equivalent to
|
|
|
|
\verb|["name"] = exp|.
|
|
|
|
Finally, fields of the form \verb|exp| add to the new table entries
|
|
|
|
with the given expression indexed by consecutive numerical integers,
|
|
|
|
starting with 1.
|
|
|
|
Fields in the other formats do not affect this counting.
|
1999-04-07 20:40:04 +04:00
|
|
|
For example,
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
a = {[f(1)] = g; "x", "y"; x = 1, f(x), [30] = 23; 45}
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
1999-04-07 20:40:04 +04:00
|
|
|
is equivalent to
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
do
|
|
|
|
local temp = {}
|
2002-02-15 00:48:32 +03:00
|
|
|
temp[f(1)] = g
|
|
|
|
temp[1] = "x" -- 1st exp
|
|
|
|
temp[2] = "y" -- 2nd exp
|
|
|
|
temp.x = 1 -- temp["x"] = 1
|
|
|
|
temp[3] = f(x) -- 3rd exp
|
|
|
|
temp[30] = 23
|
|
|
|
temp[4] = 45 -- 4th exp
|
2000-09-18 23:41:16 +04:00
|
|
|
a = temp
|
|
|
|
end
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
If the last expression in the list is a function call,
|
2001-09-24 19:54:36 +04:00
|
|
|
then all values returned by the call enter the list consecutively
|
|
|
|
\see{functioncall}.
|
2001-10-31 21:06:05 +03:00
|
|
|
If you want to avoid this,
|
2001-09-24 19:54:36 +04:00
|
|
|
enclose the function call in parentheses.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
The field list may have an optional trailing separator,
|
|
|
|
as a convenience for machine-generated code.
|
|
|
|
|
1998-01-02 21:34:00 +03:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
\subsubsection{Function Calls} \label{functioncall}
|
2000-09-18 23:41:16 +04:00
|
|
|
A \Index{function call} in Lua has the following syntax:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{functioncall}{prefixexp args}
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{Produc}%
|
2001-09-24 19:54:36 +04:00
|
|
|
In a function call,
|
2002-02-15 00:48:32 +03:00
|
|
|
first \M{prefixexp} and \M{args} are evaluated.
|
|
|
|
If the value of \M{prefixexp} has type \emph{function},
|
1998-03-30 22:17:55 +04:00
|
|
|
then this function is called,
|
|
|
|
with the given arguments.
|
1997-06-17 22:45:16 +04:00
|
|
|
Otherwise, the ``function'' tag method is called,
|
2002-02-15 00:48:32 +03:00
|
|
|
having as first parameter the value of \M{prefixexp},
|
2001-07-19 17:36:18 +04:00
|
|
|
followed by the original call arguments
|
2000-11-07 15:44:44 +03:00
|
|
|
\see{tag-method}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-04-14 21:47:55 +04:00
|
|
|
The form
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{functioncall}{prefixexp \ter{:} name args}
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{Produc}%
|
|
|
|
can be used to call ``methods''.
|
2000-09-18 23:41:16 +04:00
|
|
|
A call \verb|v:name(...)|
|
|
|
|
is syntactic sugar for \verb|v.name(v, ...)|,
|
|
|
|
except that \verb|v| is evaluated only once.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1999-04-07 20:40:04 +04:00
|
|
|
Arguments have the following syntax:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
1998-03-30 22:17:55 +04:00
|
|
|
\produc{args}{\ter{(} \opt{explist1} \ter{)}}
|
|
|
|
\produc{args}{tableconstructor}
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{args}{Literal}
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{Produc}%
|
1997-06-17 22:45:16 +04:00
|
|
|
All argument expressions are evaluated before the call.
|
1997-06-09 22:16:33 +04:00
|
|
|
A call of the form \verb|f{...}| is syntactic sugar for
|
|
|
|
\verb|f({...})|, that is,
|
2000-11-07 15:44:44 +03:00
|
|
|
the argument list is a single new table.
|
1998-01-02 21:34:00 +03:00
|
|
|
A call of the form \verb|f'...'|
|
|
|
|
(or \verb|f"..."| or \verb|f[[...]]|) is syntactic sugar for
|
|
|
|
\verb|f('...')|, that is,
|
2000-11-07 15:44:44 +03:00
|
|
|
the argument list is a single literal string.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
Because a function can return any number of results
|
1997-01-23 19:17:53 +03:00
|
|
|
\see{return},
|
2001-07-19 17:36:18 +04:00
|
|
|
the number of results must be adjusted before they are used.
|
1997-01-23 19:17:53 +03:00
|
|
|
If the function is called as a statement \see{funcstat},
|
2002-02-15 00:48:32 +03:00
|
|
|
then its return list is adjusted to~0 elements,
|
1997-01-23 19:17:53 +03:00
|
|
|
thus discarding all returned values.
|
2001-07-19 17:36:18 +04:00
|
|
|
If the function is called inside another expression,
|
|
|
|
or in the middle of a list of expressions,
|
2002-02-15 00:48:32 +03:00
|
|
|
then its return list is adjusted to~1 element,
|
1997-06-17 22:45:16 +04:00
|
|
|
thus discarding all returned values but the first one.
|
2001-07-19 17:36:18 +04:00
|
|
|
If the function is called as the last element of a list of expressions,
|
2001-09-24 19:54:36 +04:00
|
|
|
then no adjustment is made
|
|
|
|
(unless the call is enclosed in parentheses).
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
Here are some examples:
|
1998-06-18 21:36:27 +04:00
|
|
|
\begin{verbatim}
|
2000-11-07 15:44:44 +03:00
|
|
|
f() -- adjusted to 0 results
|
|
|
|
g(f(), x) -- f() is adjusted to 1 result
|
|
|
|
g(x, f()) -- g gets x plus all values returned by f()
|
|
|
|
a,b,c = f(), x -- f() is adjusted to 1 result (and c gets nil)
|
|
|
|
a,b,c = x, f() -- f() is adjusted to 2
|
|
|
|
a,b,c = f() -- f() is adjusted to 3
|
|
|
|
return f() -- returns all values returned by f()
|
2001-07-19 17:36:18 +04:00
|
|
|
return x,y,f() -- returns x, y, and all values returned by f()
|
|
|
|
{f()} -- creates a list with all values returned by f()
|
|
|
|
{f(), nil} -- f() is adjusted to 1 result
|
|
|
|
\end{verbatim}
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
If you enclose a function call in parentheses,
|
2001-07-19 17:36:18 +04:00
|
|
|
then it is adjusted to return exactly one value:
|
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
return x,y,(f()) -- returns x, y, and the first value from f()
|
|
|
|
{(f())} -- creates a table with exactly one element
|
1998-06-18 21:36:27 +04:00
|
|
|
\end{verbatim}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
As an exception to the format-free syntax of Lua,
|
|
|
|
you cannot put a line break before the \verb|(| in a function call.
|
|
|
|
That restriction avoids some ambiguities in the language.
|
|
|
|
If you write
|
|
|
|
\begin{verbatim}
|
|
|
|
a = f
|
|
|
|
(g).x(a)
|
|
|
|
\end{verbatim}
|
|
|
|
Lua would read that as \verb|a = f(g).x(a)|.
|
|
|
|
So, if you want two statements, you must add a semi-colon between them.
|
|
|
|
If you actually want to call \verb|f|,
|
|
|
|
you must remove the line break before \verb|(g)|.
|
|
|
|
|
|
|
|
|
1998-01-02 21:34:00 +03:00
|
|
|
\subsubsection{\Index{Function Definitions}} \label{func-def}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
The syntax for function definition is\IndexKW{function}
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
1998-01-02 21:34:00 +03:00
|
|
|
\produc{function}{\rwd{function} \ter{(} \opt{parlist1} \ter{)}
|
|
|
|
block \rwd{end}}
|
|
|
|
\produc{stat}{\rwd{function} funcname \ter{(} \opt{parlist1} \ter{)}
|
1995-11-16 23:46:02 +03:00
|
|
|
block \rwd{end}}
|
2001-07-19 17:36:18 +04:00
|
|
|
\produc{funcname}{name \rep{\ter{.} name} \opt{\ter{:} name}}
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{Produc}%
|
1999-04-07 20:40:04 +04:00
|
|
|
The statement
|
1998-01-02 21:34:00 +03:00
|
|
|
\begin{verbatim}
|
2000-11-07 15:44:44 +03:00
|
|
|
function f () ... end
|
1998-01-02 21:34:00 +03:00
|
|
|
\end{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
is syntactic sugar for
|
1998-01-02 21:34:00 +03:00
|
|
|
\begin{verbatim}
|
2000-11-07 15:44:44 +03:00
|
|
|
f = function () ... end
|
1998-01-02 21:34:00 +03:00
|
|
|
\end{verbatim}
|
2000-05-12 23:19:18 +04:00
|
|
|
and the statement
|
2000-04-14 21:47:55 +04:00
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
function t.a.b.c.f () ... end
|
2000-04-14 21:47:55 +04:00
|
|
|
\end{verbatim}
|
|
|
|
is syntactic sugar for
|
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
t.a.b.c.f = function () ... end
|
2000-04-14 21:47:55 +04:00
|
|
|
\end{verbatim}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1998-03-30 22:17:55 +04:00
|
|
|
A function definition is an executable expression,
|
1998-01-02 21:34:00 +03:00
|
|
|
whose value has type \emph{function}.
|
1995-11-16 23:46:02 +03:00
|
|
|
When Lua pre-compiles a chunk,
|
2000-09-18 23:41:16 +04:00
|
|
|
all its function bodies are pre-compiled too.
|
1998-01-02 21:34:00 +03:00
|
|
|
Then, whenever Lua executes the function definition,
|
2001-10-31 21:06:05 +03:00
|
|
|
the function is \emph{instantiated} (or \emph{closed}).
|
2000-04-14 21:47:55 +04:00
|
|
|
This function instance (or \emph{closure})
|
1998-01-02 21:34:00 +03:00
|
|
|
is the final value of the expression.
|
2000-04-14 21:47:55 +04:00
|
|
|
Different instances of the same function
|
2001-10-31 21:06:05 +03:00
|
|
|
may refer to different non-local variables \see{visibility}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
Parameters act as local variables,
|
1998-03-30 22:17:55 +04:00
|
|
|
initialized with the argument values:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{Produc}
|
2001-09-24 19:54:36 +04:00
|
|
|
\produc{parlist1}{namelist \opt{\ter{,} \ter{\ldots}}}
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{parlist1}{\ter{\ldots}}
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{Produc}%
|
2000-11-07 15:44:44 +03:00
|
|
|
\label{vararg}%
|
1997-06-17 22:45:16 +04:00
|
|
|
When a function is called,
|
|
|
|
the list of \Index{arguments} is adjusted to
|
2001-07-19 17:36:18 +04:00
|
|
|
the length of the list of parameters,
|
2000-11-07 15:44:44 +03:00
|
|
|
unless the function is a \Def{vararg function},
|
2000-05-12 23:19:18 +04:00
|
|
|
which is
|
2000-09-18 23:41:16 +04:00
|
|
|
indicated by three dots (`\verb|...|') at the end of its parameter list.
|
1997-06-17 22:45:16 +04:00
|
|
|
A vararg function does not adjust its argument list;
|
2000-05-12 23:19:18 +04:00
|
|
|
instead, it collects all extra arguments into an implicit parameter,
|
2000-11-07 15:44:44 +03:00
|
|
|
called \IndexLIB{arg}.
|
2000-05-12 23:19:18 +04:00
|
|
|
The value of \verb|arg| is a table,
|
|
|
|
with a field~\verb|n| whose value is the number of extra arguments,
|
2000-11-07 15:44:44 +03:00
|
|
|
and the extra arguments at positions 1,~2,~\ldots,~\verb|n|.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
As an example, consider the following definitions:
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
function f(a, b) end
|
|
|
|
function g(a, b, ...) end
|
|
|
|
function r() return 1,2,3 end
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
|
|
|
Then, we have the following mapping from arguments to parameters:
|
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
CALL PARAMETERS
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
f(3) a=3, b=nil
|
|
|
|
f(3, 4) a=3, b=4
|
|
|
|
f(3, 4, 5) a=3, b=4
|
|
|
|
f(r(), 10) a=1, b=10
|
|
|
|
f(r()) a=1, b=2
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
g(3) a=3, b=nil, arg={n=0}
|
2001-09-24 19:54:36 +04:00
|
|
|
g(3, 4) a=3, b=4, arg={n=0}
|
|
|
|
g(3, 4, 5, 8) a=3, b=4, arg={5, 8; n=2}
|
|
|
|
g(5, r()) a=5, b=1, arg={2, 3; n=2}
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-08-09 23:09:20 +04:00
|
|
|
Results are returned using the \rwd{return} statement \see{return}.
|
2000-05-12 23:19:18 +04:00
|
|
|
If control reaches the end of a function
|
|
|
|
without encountering a \rwd{return} statement,
|
1996-08-29 00:46:26 +04:00
|
|
|
then the function returns with no results.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
The \emph{colon} syntax
|
2000-09-18 23:41:16 +04:00
|
|
|
is used for defining \IndexEmph{methods},
|
2000-11-07 15:44:44 +03:00
|
|
|
that is, functions that have an implicit extra parameter \IndexVerb{self}.
|
2001-09-24 19:54:36 +04:00
|
|
|
Thus, the statement
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
function t.a.b.c:f (...) ... end
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
is syntactic sugar for
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
t.a.b.c.f = function (self, ...) ... end
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
|
|
|
|
1998-01-02 21:34:00 +03:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
\subsection{Visibility Rules} \label{visibility}
|
|
|
|
\index{visibility}
|
2000-11-07 15:44:44 +03:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
Lua is a lexically scoped language.
|
2002-06-06 16:49:28 +04:00
|
|
|
The scope of variables begins at the first statement \emph{after}
|
2001-10-31 21:06:05 +03:00
|
|
|
their declaration and lasts until the end of the innermost block that
|
|
|
|
includes the declaration.
|
|
|
|
For instance:
|
|
|
|
\begin{verbatim}
|
|
|
|
x = 10 -- global variable
|
|
|
|
do -- new block
|
|
|
|
local x = x -- new `x', with value 10
|
|
|
|
print(x) --> 10
|
|
|
|
x = x+1
|
|
|
|
do -- another block
|
2002-06-06 16:49:28 +04:00
|
|
|
local x = x+1 -- another `x'
|
2001-10-31 21:06:05 +03:00
|
|
|
print(x) --> 12
|
|
|
|
end
|
|
|
|
print(x) --> 11
|
|
|
|
end
|
|
|
|
print(x) --> 10 (the global one)
|
|
|
|
\end{verbatim}
|
|
|
|
Notice that, in a declaration like \verb|local x = x|,
|
|
|
|
the new \verb|x| being declared is not in scope yet,
|
|
|
|
so the second \verb|x| refers to the ``outside'' variable.
|
2001-09-24 19:54:36 +04:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
Because of this \Index{lexical scoping} rules,
|
|
|
|
local variables can be freely accessed by functions
|
|
|
|
defined inside their scope.
|
|
|
|
For instance:
|
|
|
|
\begin{verbatim}
|
|
|
|
local counter = 0
|
2002-02-15 00:48:32 +03:00
|
|
|
function inc (x)
|
2001-10-31 21:06:05 +03:00
|
|
|
counter = counter + x
|
|
|
|
return counter
|
|
|
|
end
|
|
|
|
\end{verbatim}
|
1998-01-02 21:34:00 +03:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
Notice that each execution of a \rwd{local} statement
|
|
|
|
``creates'' new local variables.
|
|
|
|
Consider the following example:
|
1998-01-02 21:34:00 +03:00
|
|
|
\begin{verbatim}
|
2001-10-31 21:06:05 +03:00
|
|
|
a = {}
|
|
|
|
local x = 20
|
|
|
|
for i=1,10 do
|
|
|
|
local y = 0
|
|
|
|
a[i] = function () y=y+1; return x+y end
|
|
|
|
end
|
1998-01-02 21:34:00 +03:00
|
|
|
\end{verbatim}
|
2001-10-31 21:06:05 +03:00
|
|
|
In that code,
|
|
|
|
each function uses a different \verb|y| variable,
|
|
|
|
while all of them share the same \verb|x|.
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\subsection{Error Handling} \label{error}
|
|
|
|
|
|
|
|
Because Lua is an extension language,
|
|
|
|
all Lua actions start from C~code in the host program
|
|
|
|
calling a function from the Lua library.
|
|
|
|
Whenever an error occurs during Lua compilation or execution,
|
2000-11-07 15:44:44 +03:00
|
|
|
the function \verb|_ERRORMESSAGE| is called \DefLIB{_ERRORMESSAGE}
|
2000-05-12 23:19:18 +04:00
|
|
|
(provided it is different from \nil),
|
|
|
|
and then the corresponding function from the library
|
|
|
|
(\verb|lua_dofile|, \verb|lua_dostring|,
|
2000-11-07 15:44:44 +03:00
|
|
|
\verb|lua_dobuffer|, or \verb|lua_call|)
|
2000-05-12 23:19:18 +04:00
|
|
|
is terminated, returning an error condition.
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
Memory allocation errors are an exception to the previous rule.
|
|
|
|
When memory allocation fails, Lua may not be able to execute the
|
2000-08-09 23:09:20 +04:00
|
|
|
\verb|_ERRORMESSAGE| function.
|
|
|
|
So, for this kind of error, Lua does not call
|
|
|
|
the \verb|_ERRORMESSAGE| function;
|
|
|
|
instead, the corresponding function from the library
|
2000-09-18 23:41:16 +04:00
|
|
|
returns immediately with a special error code (\verb|LUA_ERRMEM|).
|
2001-09-24 19:54:36 +04:00
|
|
|
This and other error codes are defined in \verb|lua.h|
|
|
|
|
\see{luado}.
|
2000-08-09 23:09:20 +04:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
The only argument to \verb|_ERRORMESSAGE| is a string
|
|
|
|
describing the error.
|
|
|
|
The default definition for
|
2000-11-07 15:44:44 +03:00
|
|
|
this function calls \verb|_ALERT|, \DefLIB{_ALERT}
|
2000-05-12 23:19:18 +04:00
|
|
|
which prints the message to \verb|stderr| \see{alert}.
|
2000-09-18 23:41:16 +04:00
|
|
|
The standard I/O library redefines \verb|_ERRORMESSAGE|
|
2001-10-31 21:06:05 +03:00
|
|
|
and uses the debug interface \see{debugI}
|
2000-05-12 23:19:18 +04:00
|
|
|
to print some extra information,
|
2001-10-31 21:06:05 +03:00
|
|
|
such as a call-stack traceback.
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
Lua code can explicitly generate an error by calling the
|
2000-05-12 23:19:18 +04:00
|
|
|
function \verb|error| \see{pdf-error}.
|
2000-09-18 23:41:16 +04:00
|
|
|
Lua code can ``catch'' an error using the function
|
2000-05-12 23:19:18 +04:00
|
|
|
\verb|call| \see{pdf-call}.
|
|
|
|
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\subsection{Metatables} \label{metatable}
|
|
|
|
|
|
|
|
Every table and userdata value in Lua may have a \emph{metatable}.
|
|
|
|
This \IndexEmph{metatable} is a table that defines the behavior of
|
|
|
|
the original table and userdata under some operations.
|
|
|
|
You can query and change the metatable of an object with
|
|
|
|
function \verb|metatable| \see{pdf-metatable}.
|
|
|
|
|
|
|
|
For each of these operations Lua associates a specific key.
|
|
|
|
When Lua performs one of these operations over a table or a userdata,
|
|
|
|
if checks whether that object has a metatable with the corresponding key.
|
|
|
|
If so, the value associated with that key (the \IndexEmph{handler})
|
|
|
|
controls how Lua will perform the operation.
|
|
|
|
|
|
|
|
Metatables control the operations listed next.
|
2002-06-06 16:49:28 +04:00
|
|
|
Each operation is identified by its corresponding name.
|
|
|
|
The key for each operation is a string with its name prefixed by
|
|
|
|
two underscores;
|
|
|
|
for instance, the key for operation ``add'' is the
|
|
|
|
string \verb|"__add"|.
|
2002-02-15 00:48:32 +03:00
|
|
|
The semantics of these operations is better explained by a Lua function
|
|
|
|
describing how the interpreter executes that operation.
|
|
|
|
%Each function shows how a handler is called,
|
|
|
|
%its arguments (that is, its signature),
|
|
|
|
%its results,
|
|
|
|
%and the default behavior in the absence of a handler.
|
2001-07-19 17:36:18 +04:00
|
|
|
The code shown here in Lua is only illustrative;
|
1997-06-17 22:45:16 +04:00
|
|
|
the real behavior is hard coded in the interpreter,
|
1997-07-05 02:35:38 +04:00
|
|
|
and it is much more efficient than this simulation.
|
|
|
|
All functions used in these descriptions
|
2001-09-24 19:54:36 +04:00
|
|
|
(\verb|rawget|, \verb|tonumber|, \verb|call|, etc.)\
|
1997-06-17 22:45:16 +04:00
|
|
|
are described in \See{predefined}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
\begin{description}
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``add'':]\IndexTM{add}
|
2002-02-15 00:48:32 +03:00
|
|
|
the \verb|+| operation.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
The function \verb|getbinhandler| below defines how Lua chooses a handler
|
1997-06-17 22:45:16 +04:00
|
|
|
for a binary operation.
|
1998-06-18 21:36:27 +04:00
|
|
|
First, Lua tries the first operand.
|
2002-02-15 00:48:32 +03:00
|
|
|
If its type does not define a handler for the operation,
|
1997-06-19 00:14:52 +04:00
|
|
|
then Lua tries the second operand.
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
function getbinhandler (op1, op2, event)
|
|
|
|
return metatable(op1)[event] or metatable(op2)[event]
|
2000-09-18 23:41:16 +04:00
|
|
|
end
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
2000-05-12 23:19:18 +04:00
|
|
|
Using this function,
|
2002-02-15 00:48:32 +03:00
|
|
|
the behavior of the ``add'' operation is
|
2000-09-18 23:41:16 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
function add_op (op1, op2)
|
2000-09-18 23:41:16 +04:00
|
|
|
local o1, o2 = tonumber(op1), tonumber(op2)
|
|
|
|
if o1 and o2 then -- both operands are numeric
|
|
|
|
return o1+o2 -- '+' here is the primitive 'add'
|
|
|
|
else -- at least one of the operands is not numeric
|
2002-06-06 16:49:28 +04:00
|
|
|
local h = getbinhandler(op1, op2, "__add")
|
2002-02-15 00:48:32 +03:00
|
|
|
if h then
|
|
|
|
-- call the handler with both operands
|
|
|
|
return h(op1, op2)
|
|
|
|
else -- no handler available: default behavior
|
2000-09-18 23:41:16 +04:00
|
|
|
error("unexpected type at arithmetic operation")
|
|
|
|
end
|
|
|
|
end
|
|
|
|
end
|
|
|
|
\end{verbatim}
|
2000-08-09 23:09:20 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``sub'':]\IndexTM{sub}
|
2002-02-15 00:48:32 +03:00
|
|
|
the \verb|-| operation.
|
|
|
|
Behavior similar to the ``add'' operation.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``mul'':]\IndexTM{mul}
|
2002-02-15 00:48:32 +03:00
|
|
|
the \verb|*| operation.
|
|
|
|
Behavior similar to the ``add'' operation.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``div'':]\IndexTM{div}
|
2002-02-15 00:48:32 +03:00
|
|
|
the \verb|/| operation.
|
|
|
|
Behavior similar to the ``add'' operation.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``pow'':]\IndexTM{pow}
|
2002-02-15 00:48:32 +03:00
|
|
|
the \verb|^| operation (exponentiation) operation.
|
|
|
|
\begin{verbatim} ??
|
|
|
|
function pow_op (op1, op2)
|
2002-06-06 16:49:28 +04:00
|
|
|
local h = getbinhandler(op1, op2, "__pow")
|
2002-02-15 00:48:32 +03:00
|
|
|
if h then
|
|
|
|
-- call the handler with both operands
|
|
|
|
return h(op1, op2)
|
|
|
|
else -- no handler available: default behavior
|
2000-09-18 23:41:16 +04:00
|
|
|
error("unexpected type at arithmetic operation")
|
|
|
|
end
|
|
|
|
end
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``unm'':]\IndexTM{unm}
|
2002-02-15 00:48:32 +03:00
|
|
|
the unary \verb|-| operation.
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
function unm_op (op)
|
2000-09-18 23:41:16 +04:00
|
|
|
local o = tonumber(op)
|
|
|
|
if o then -- operand is numeric
|
|
|
|
return -o -- '-' here is the primitive 'unm'
|
|
|
|
else -- the operand is not numeric.
|
2002-02-15 00:48:32 +03:00
|
|
|
-- Try to get a handler from the operand;
|
2002-06-06 16:49:28 +04:00
|
|
|
local h = metatable(op).__unm
|
2002-02-15 00:48:32 +03:00
|
|
|
if h then
|
|
|
|
-- call the handler with the operand and nil
|
|
|
|
return h(op, nil)
|
|
|
|
else -- no handler available: default behavior
|
2000-09-18 23:41:16 +04:00
|
|
|
error("unexpected type at arithmetic operation")
|
|
|
|
end
|
|
|
|
end
|
|
|
|
end
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``lt'':]\IndexTM{lt}
|
2002-02-15 00:48:32 +03:00
|
|
|
the \verb|<| operation.
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
function lt_op (op1, op2)
|
2000-09-18 23:41:16 +04:00
|
|
|
if type(op1) == "number" and type(op2) == "number" then
|
|
|
|
return op1 < op2 -- numeric comparison
|
|
|
|
elseif type(op1) == "string" and type(op2) == "string" then
|
|
|
|
return op1 < op2 -- lexicographic comparison
|
|
|
|
else
|
2002-06-06 16:49:28 +04:00
|
|
|
local h = getbinhandler(op1, op2, "__lt")
|
2002-02-15 00:48:32 +03:00
|
|
|
if h then
|
|
|
|
return h(op1, op2)
|
2000-09-18 23:41:16 +04:00
|
|
|
else
|
|
|
|
error("unexpected type at comparison");
|
|
|
|
end
|
|
|
|
end
|
|
|
|
end
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
The other order operators also use the \verb|lt_op| function,
|
2001-07-19 17:36:18 +04:00
|
|
|
according to the usual equivalences:
|
2000-04-14 21:47:55 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
a>b <=> b<a
|
|
|
|
a<=b <=> not (b<a)
|
|
|
|
a>=b <=> not (a<b)
|
2000-04-14 21:47:55 +04:00
|
|
|
\end{verbatim}
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``concat'':]\IndexTM{concatenation}
|
2002-02-15 00:48:32 +03:00
|
|
|
the \verb|..| (concatenation) operation.
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
function concat_op (op1, op2)
|
2000-09-18 23:41:16 +04:00
|
|
|
if (type(op1) == "string" or type(op1) == "number") and
|
|
|
|
(type(op2) == "string" or type(op2) == "number") then
|
|
|
|
return op1..op2 -- primitive string concatenation
|
|
|
|
else
|
2002-06-06 16:49:28 +04:00
|
|
|
local h = getbinhandler(op1, op2, "__concat")
|
2002-02-15 00:48:32 +03:00
|
|
|
if h then
|
|
|
|
return h(op1, op2)
|
2000-09-18 23:41:16 +04:00
|
|
|
else
|
|
|
|
error("unexpected type for concatenation")
|
|
|
|
end
|
|
|
|
end
|
|
|
|
end
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``index'':]\IndexTM{index}
|
2002-02-15 00:48:32 +03:00
|
|
|
This handler is called when Lua tries to retrieve the value of an index
|
1995-11-16 23:46:02 +03:00
|
|
|
not present in a table.
|
2002-02-15 00:48:32 +03:00
|
|
|
See the ``gettable'' operation for its semantics.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``gettable'':]\IndexTM{gettable}
|
1997-06-17 22:45:16 +04:00
|
|
|
called whenever Lua accesses an indexed variable.
|
2000-09-18 23:41:16 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
function gettable_op (table, key)
|
2002-06-06 16:49:28 +04:00
|
|
|
local h = metatable(table).__gettable
|
2002-02-15 00:48:32 +03:00
|
|
|
if h == nil then
|
|
|
|
if type(table) ~= "table" then
|
|
|
|
error("indexed expression not a table");
|
2000-09-18 23:41:16 +04:00
|
|
|
else
|
2002-02-15 00:48:32 +03:00
|
|
|
local v = rawget(table, key)
|
|
|
|
if v ~= nil then return v end
|
2002-06-06 16:49:28 +04:00
|
|
|
h = metatable(table).__index
|
2002-02-15 00:48:32 +03:00
|
|
|
if h == nil then return nil end
|
2000-09-18 23:41:16 +04:00
|
|
|
end
|
|
|
|
end
|
2002-02-15 00:48:32 +03:00
|
|
|
if type(h) == 'function' then
|
|
|
|
return h(table, key) -- call the handler
|
|
|
|
else return h[key] -- or repeat operation with it
|
2000-09-18 23:41:16 +04:00
|
|
|
end
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\item[``settable'':]\IndexTM{settable}
|
1997-06-19 00:14:52 +04:00
|
|
|
called when Lua assigns to an indexed variable.
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
function settable_event (table, key, value)
|
2002-06-06 16:49:28 +04:00
|
|
|
local h = metatable(table).__settable
|
2002-02-15 00:48:32 +03:00
|
|
|
if h == nil then
|
|
|
|
if type(table) ~= "table" then
|
|
|
|
error("indexed expression not a table")
|
|
|
|
rawset(table, key, value)
|
2000-09-18 23:41:16 +04:00
|
|
|
else
|
2002-02-15 00:48:32 +03:00
|
|
|
if type(h) == 'function' then
|
|
|
|
h(table, key, value) -- call the handler
|
|
|
|
else h[key] = value -- or repeat operation with it
|
2000-09-18 23:41:16 +04:00
|
|
|
end
|
|
|
|
end
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\item[``call'':]\IndexTM{call}
|
|
|
|
called when Lua calls a value.
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
function function_op (func, ...)
|
2000-09-18 23:41:16 +04:00
|
|
|
if type(func) == "function" then
|
2002-02-15 00:48:32 +03:00
|
|
|
return func(unpack(arg)) -- regular call
|
2000-09-18 23:41:16 +04:00
|
|
|
else
|
2002-06-06 16:49:28 +04:00
|
|
|
local h = metatable(func).__call
|
2002-02-15 00:48:32 +03:00
|
|
|
if h then
|
|
|
|
tinsert(arg, 1, func)
|
|
|
|
return h(unpack(arg))
|
2000-09-18 23:41:16 +04:00
|
|
|
else
|
|
|
|
error("call expression not a function")
|
|
|
|
end
|
|
|
|
end
|
|
|
|
end
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\end{description}
|
|
|
|
|
|
|
|
\subsubsection{Metatables and Garbage collection}
|
|
|
|
|
|
|
|
Metatables also control some aspects of the garbage collector.
|
|
|
|
First, they are used to define \IndexEmph{finalizer} methods
|
|
|
|
for userdata values.
|
2000-04-14 21:47:55 +04:00
|
|
|
For each userdata to be collected,
|
1997-06-17 22:45:16 +04:00
|
|
|
Lua does the equivalent of the following function:
|
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
function gc_op (obj)
|
2002-06-06 16:49:28 +04:00
|
|
|
local h = metatable(obj).__gc
|
2002-02-15 00:48:32 +03:00
|
|
|
if h then
|
|
|
|
h(obj)
|
2000-09-18 23:41:16 +04:00
|
|
|
end
|
|
|
|
end
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
2000-11-07 15:44:44 +03:00
|
|
|
In a garbage-collection cycle,
|
2002-02-15 00:48:32 +03:00
|
|
|
the finalizers for userdata are called in \emph{reverse}
|
|
|
|
order of their creation,
|
|
|
|
that is, the first finalizer to be called is the one associated
|
|
|
|
with the last userdata created in the program
|
|
|
|
(among those to be collected in this cycle).
|
|
|
|
|
|
|
|
Second, metatables control the weakmode of tables \see{weak-table}.
|
|
|
|
The weakmode of a table \verb|t| is defined by a string:
|
|
|
|
\label{weakmode}
|
|
|
|
\begin{verbatim}
|
2002-06-06 16:49:28 +04:00
|
|
|
s = metatable(t).__weakmode
|
2002-02-15 00:48:32 +03:00
|
|
|
\end{verbatim}
|
|
|
|
Valid values for this string are \verb|"k"| for weak keys,
|
|
|
|
\verb|"v"| for weak values,
|
|
|
|
and \verb|"kv"| for both.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
%------------------------------------------------------------------------------
|
|
|
|
\section{The Application Program Interface}\label{API}
|
2000-11-07 15:44:44 +03:00
|
|
|
\index{C API}
|
1995-11-16 23:46:02 +03:00
|
|
|
This section describes the API for Lua, that is,
|
2000-05-12 23:19:18 +04:00
|
|
|
the set of C~functions available to the host program to communicate
|
2000-09-18 23:41:16 +04:00
|
|
|
with Lua.
|
1997-01-23 19:17:53 +03:00
|
|
|
All API functions and related types and constants
|
1997-06-09 22:16:33 +04:00
|
|
|
are declared in the header file \verb|lua.h|.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\NOTE
|
2000-09-18 23:41:16 +04:00
|
|
|
Even when we use the term ``function'',
|
|
|
|
any facility in the API may be provided as a \emph{macro} instead.
|
2001-07-19 17:36:18 +04:00
|
|
|
All such macros use each of its arguments exactly once
|
2001-09-24 19:54:36 +04:00
|
|
|
(except for the first argument, which is always a Lua state),
|
2000-05-12 23:19:18 +04:00
|
|
|
and so do not generate hidden side-effects.
|
2000-04-14 21:47:55 +04:00
|
|
|
|
|
|
|
|
|
|
|
\subsection{States} \label{mangstate}
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
The Lua library is fully reentrant:
|
2001-09-24 19:54:36 +04:00
|
|
|
it has no global variables.
|
2000-11-07 15:44:44 +03:00
|
|
|
\index{state}
|
1998-06-03 00:37:04 +04:00
|
|
|
The whole state of the Lua interpreter
|
2001-09-24 19:54:36 +04:00
|
|
|
(global variables, stack, tag methods, etc.)\
|
2000-12-28 20:25:45 +03:00
|
|
|
is stored in a dynamically allocated structure of type \verb|lua_State|;
|
|
|
|
\DefAPI{lua_State}
|
2000-09-18 23:41:16 +04:00
|
|
|
this state must be passed as the first argument to
|
|
|
|
every function in the library (except \verb|lua_open| below).
|
1998-06-03 00:37:04 +04:00
|
|
|
|
1998-01-02 21:34:00 +03:00
|
|
|
Before calling any API function,
|
2000-11-07 15:44:44 +03:00
|
|
|
you must create a state by calling
|
1998-01-02 21:34:00 +03:00
|
|
|
\begin{verbatim}
|
2002-06-06 16:49:28 +04:00
|
|
|
lua_State *lua_open (void);
|
1998-01-02 21:34:00 +03:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_open}
|
1998-06-03 00:37:04 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
To release a state created with \verb|lua_open|, call
|
1998-01-02 21:34:00 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
void lua_close (lua_State *L);
|
1998-01-02 21:34:00 +03:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_close}
|
2000-09-18 23:41:16 +04:00
|
|
|
This function destroys all objects in the given Lua environment
|
2000-11-07 15:44:44 +03:00
|
|
|
(calling the corresponding garbage-collection tag methods, if any)
|
2000-09-18 23:41:16 +04:00
|
|
|
and frees all dynamic memory used by that state.
|
|
|
|
Usually, you do not need to call this function,
|
|
|
|
because all resources are naturally released when your program ends.
|
2000-05-12 23:19:18 +04:00
|
|
|
On the other hand,
|
|
|
|
long-running programs ---
|
2000-09-18 23:41:16 +04:00
|
|
|
like a daemon or a web server ---
|
2000-05-12 23:19:18 +04:00
|
|
|
might need to release states as soon as they are not needed,
|
2001-09-24 19:54:36 +04:00
|
|
|
to avoid growing too large.
|
2000-04-14 21:47:55 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
With the exception of \verb|lua_open|,
|
2000-11-07 15:44:44 +03:00
|
|
|
all functions in the Lua API need a state as their first argument.
|
2000-08-09 23:09:20 +04:00
|
|
|
|
2000-04-14 21:47:55 +04:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
\subsection{Threads}
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Lua offers a partial support for multiple threads of execution.
|
|
|
|
If you have a C~library that offers multi-threading or co-routines,
|
|
|
|
then Lua can cooperate with it to implement the equivalent facility in Lua.
|
2001-07-19 17:36:18 +04:00
|
|
|
The following function creates a new ``thread'' in Lua:
|
|
|
|
\begin{verbatim}
|
2002-06-06 16:49:28 +04:00
|
|
|
lua_State *lua_newthread (lua_State *L);
|
2001-07-19 17:36:18 +04:00
|
|
|
\end{verbatim}
|
|
|
|
\DefAPI{lua_newthread}
|
|
|
|
The new state returned by this function shares with the original state
|
|
|
|
all global environment (such as tables, tag methods, etc.),
|
2001-09-24 19:54:36 +04:00
|
|
|
but has an independent run-time stack.
|
2001-07-19 17:36:18 +04:00
|
|
|
(The use of these multiple stacks must be ``syncronized'' with C.
|
|
|
|
How to explain that? TO BE WRITTEN.)
|
|
|
|
|
|
|
|
Each thread has an independent table for global variables.
|
2001-09-24 19:54:36 +04:00
|
|
|
When you create a thread, this table is the same as that of the given state,
|
2001-07-19 17:36:18 +04:00
|
|
|
but you can change each one independently.
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
You destroy threads with \DefAPI{lua_closethread}
|
|
|
|
\begin{verbatim}
|
|
|
|
void lua_closethread (lua_State *L, lua_State *thread);
|
|
|
|
\end{verbatim}
|
|
|
|
You cannot close the sole (or last) thread of a state.
|
|
|
|
Instead, you must close the state itself.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\subsection{The Stack and Indices}
|
|
|
|
|
|
|
|
Lua uses a \emph{stack} to pass values to and from C.
|
|
|
|
Each element in this stack represents a Lua value
|
2001-09-24 19:54:36 +04:00
|
|
|
(\nil, number, string, etc.).
|
2000-09-18 23:41:16 +04:00
|
|
|
|
|
|
|
For convenience,
|
|
|
|
most query operations in the API do not follow a strict stack discipline.
|
|
|
|
Instead, they can refer to any element in the stack by using an \emph{index}:
|
|
|
|
A positive index represents an \emph{absolute} stack position
|
2001-10-31 21:06:05 +03:00
|
|
|
(starting at~1);
|
2000-09-18 23:41:16 +04:00
|
|
|
a negative index represents an \emph{offset} from the top of the stack.
|
|
|
|
More specifically, if the stack has \M{n} elements,
|
2001-09-24 19:54:36 +04:00
|
|
|
then index~1 represents the first element
|
2001-10-31 21:06:05 +03:00
|
|
|
(that is, the element that was pushed onto the stack first),
|
2000-11-07 15:44:44 +03:00
|
|
|
and
|
|
|
|
index~\M{n} represents the last element;
|
|
|
|
index~\Math{-1} also represents the last element
|
2000-09-18 23:41:16 +04:00
|
|
|
(that is, the element at the top),
|
|
|
|
and index \Math{-n} represents the first element.
|
|
|
|
We say that an index is \emph{valid}
|
2000-12-28 20:25:45 +03:00
|
|
|
if it lies between~1 and the stack top
|
2000-11-07 15:44:44 +03:00
|
|
|
(that is, if \verb|1 <= abs(index) <= top|).
|
2000-09-18 23:41:16 +04:00
|
|
|
\index{stack index} \index{valid index}
|
|
|
|
|
|
|
|
At any time, you can get the index of the top element by calling
|
|
|
|
\begin{verbatim}
|
|
|
|
int lua_gettop (lua_State *L);
|
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_gettop}
|
2000-11-07 15:44:44 +03:00
|
|
|
Because indices start at~1,
|
2000-09-18 23:41:16 +04:00
|
|
|
the result of \verb|lua_gettop| is equal to the number of elements in the stack
|
2000-11-07 15:44:44 +03:00
|
|
|
(and so 0~means an empty stack).
|
2000-09-18 23:41:16 +04:00
|
|
|
|
|
|
|
When you interact with Lua API,
|
|
|
|
\emph{you are responsible for controlling stack overflow}.
|
2000-12-28 20:25:45 +03:00
|
|
|
The function
|
2000-09-18 23:41:16 +04:00
|
|
|
\begin{verbatim}
|
2002-06-06 16:49:28 +04:00
|
|
|
int lua_checkstack (lua_State *L, int size);
|
2000-09-18 23:41:16 +04:00
|
|
|
\end{verbatim}
|
2002-06-06 16:49:28 +04:00
|
|
|
\DefAPI{lua_checkstack}
|
|
|
|
returns true if there is at lease \verb|size|
|
|
|
|
stack positions still available.
|
2000-11-07 15:44:44 +03:00
|
|
|
Whenever Lua calls C, \DefAPI{LUA_MINSTACK}
|
2002-06-06 16:49:28 +04:00
|
|
|
it ensures that \verb|lua_checkstack(L, LUA_MINSTACK)| is true,
|
|
|
|
that is, that
|
2000-09-18 23:41:16 +04:00
|
|
|
at least \verb|LUA_MINSTACK| positions are still available.
|
2002-06-06 16:49:28 +04:00
|
|
|
\verb|LUA_MINSTACK| is defined in \verb|lua.h| as 20,
|
2001-10-31 21:06:05 +03:00
|
|
|
so that usually you do not have to worry about stack space
|
|
|
|
unless your code has loops pushing elements onto the stack.
|
2000-09-18 23:41:16 +04:00
|
|
|
|
|
|
|
Most query functions accept as indices any value inside the
|
2002-06-06 16:49:28 +04:00
|
|
|
available stack space, that is, indices up to the maximum stack size
|
|
|
|
you (or Lua) have checked through \verb|lua_checkstack|.
|
2000-09-18 23:41:16 +04:00
|
|
|
Such indices are called \emph{acceptable indices}.
|
2001-09-24 19:54:36 +04:00
|
|
|
More formally, we define an \IndexEmph{acceptable index}
|
|
|
|
as follows:
|
2000-09-18 23:41:16 +04:00
|
|
|
\begin{verbatim}
|
|
|
|
(index < 0 && abs(index) <= top) || (index > 0 && index <= top + stackspace)
|
|
|
|
\end{verbatim}
|
2000-11-07 15:44:44 +03:00
|
|
|
Note that 0 is not an acceptable index.
|
2000-09-18 23:41:16 +04:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
Unless otherwise noticed,
|
|
|
|
any function that accepts valid indices can also be called with
|
|
|
|
\Index{pseudo-indices},
|
|
|
|
which represent some Lua values that are accessible to the C~code
|
|
|
|
but are not in the stack.
|
|
|
|
|
2001-10-31 23:31:38 +03:00
|
|
|
Pseudo-indices are used to access the table of globals \see{globals},
|
|
|
|
the registry, and the upvalues of a C function \see{c-closure}.
|
2001-10-31 21:06:05 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\subsection{Stack Manipulation}
|
|
|
|
The API offers the following functions for basic stack manipulation:
|
|
|
|
\begin{verbatim}
|
|
|
|
void lua_settop (lua_State *L, int index);
|
|
|
|
void lua_pushvalue (lua_State *L, int index);
|
|
|
|
void lua_remove (lua_State *L, int index);
|
|
|
|
void lua_insert (lua_State *L, int index);
|
2002-02-15 00:48:32 +03:00
|
|
|
void lua_replace (lua_State *L, int index);
|
2000-09-18 23:41:16 +04:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_settop}\DefAPI{lua_pushvalue}
|
2002-02-15 00:48:32 +03:00
|
|
|
\DefAPI{lua_remove}\DefAPI{lua_insert}\DefAPI{lua_replace}
|
2000-09-18 23:41:16 +04:00
|
|
|
|
|
|
|
\verb|lua_settop| accepts any acceptable index,
|
|
|
|
or 0,
|
|
|
|
and sets the stack top to that index.
|
|
|
|
If the new top is larger than the old one,
|
|
|
|
then the new elements are filled with \nil.
|
|
|
|
If \verb|index| is 0, then all stack elements are removed.
|
2001-09-24 19:54:36 +04:00
|
|
|
A useful macro defined in the \verb|lua.h| is
|
2000-09-18 23:41:16 +04:00
|
|
|
\begin{verbatim}
|
|
|
|
#define lua_pop(L,n) lua_settop(L, -(n)-1)
|
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_pop}
|
2000-09-18 23:41:16 +04:00
|
|
|
which pops \verb|n| elements from the stack.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\verb|lua_pushvalue| pushes onto the stack a \emph{copy} of the element
|
2000-09-18 23:41:16 +04:00
|
|
|
at the given index.
|
|
|
|
\verb|lua_remove| removes the element at the given position,
|
2001-09-24 19:54:36 +04:00
|
|
|
shifting down the elements above that position to fill the gap.
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|lua_insert| moves the top element into the given position,
|
2001-09-24 19:54:36 +04:00
|
|
|
shifting up the elements above that position to open space.
|
2002-02-15 00:48:32 +03:00
|
|
|
\verb|lua_replace| moves the top element into the given position,
|
|
|
|
without shifting any element (therefore it replaces the value at
|
|
|
|
the given position).
|
2000-09-18 23:41:16 +04:00
|
|
|
These functions accept only valid indices.
|
2001-10-31 21:06:05 +03:00
|
|
|
(Obviously, you cannot call \verb|lua_remove| or \verb|lua_insert| with
|
|
|
|
pseudo-indices, as they do not represent a stack position.)
|
2001-09-24 19:54:36 +04:00
|
|
|
|
|
|
|
As an example, if the stack starts as \verb|10 20 30 40 50*|
|
|
|
|
(from bottom to top; the \verb|*| marks the top),
|
2000-09-18 23:41:16 +04:00
|
|
|
then
|
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
lua_pushvalue(L, 3) --> 10 20 30 40 50 30*
|
|
|
|
lua_pushvalue(L, -1) --> 10 20 30 40 50 30 30*
|
|
|
|
lua_remove(L, -3) --> 10 20 30 40 30 30*
|
|
|
|
lua_remove(L, 6) --> 10 20 30 40 30*
|
|
|
|
lua_insert(L, 1) --> 30 10 20 30 40*
|
|
|
|
lua_insert(L, -1) --> 30 10 20 30 40* (no effect)
|
2002-02-15 00:48:32 +03:00
|
|
|
lua_replace(L, 2) --> 30 40 20 30*
|
|
|
|
lua_settop(L, -3) --> 30 40 20*
|
|
|
|
lua_settop(L, 6) --> 30 40 20 nil nil nil*
|
2000-09-18 23:41:16 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\subsection{Querying the Stack}
|
|
|
|
|
|
|
|
To check the type of a stack element,
|
1997-06-17 22:45:16 +04:00
|
|
|
the following functions are available:
|
2000-09-18 23:41:16 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
int lua_type (lua_State *L, int index);
|
2000-09-18 23:41:16 +04:00
|
|
|
int lua_isnil (lua_State *L, int index);
|
2002-02-15 00:48:32 +03:00
|
|
|
int lua_isboolean (lua_State *L, int index);
|
2000-09-18 23:41:16 +04:00
|
|
|
int lua_isnumber (lua_State *L, int index);
|
|
|
|
int lua_isstring (lua_State *L, int index);
|
|
|
|
int lua_istable (lua_State *L, int index);
|
|
|
|
int lua_isfunction (lua_State *L, int index);
|
|
|
|
int lua_iscfunction (lua_State *L, int index);
|
|
|
|
int lua_isuserdata (lua_State *L, int index);
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
\DefAPI{lua_type}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_isnil}\DefAPI{lua_isnumber}\DefAPI{lua_isstring}
|
2002-02-15 00:48:32 +03:00
|
|
|
\DefAPI{lua_istable}\DefAPI{lua_isboolean}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_isfunction}\DefAPI{lua_iscfunction}\DefAPI{lua_isuserdata}
|
2000-09-18 23:41:16 +04:00
|
|
|
These functions can be called with any acceptable index.
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\verb|lua_type| returns the type of a value in the stack,
|
2001-07-19 17:36:18 +04:00
|
|
|
or \verb|LUA_TNONE| for a non-valid index
|
|
|
|
(that is, if that stack position is ``empty'').
|
2002-02-15 00:48:32 +03:00
|
|
|
The types are coded by the following constants
|
2001-09-24 19:54:36 +04:00
|
|
|
defined in \verb|lua.h|:
|
2000-11-07 15:44:44 +03:00
|
|
|
\verb|LUA_TNIL|,
|
|
|
|
\verb|LUA_TNUMBER|,
|
2002-02-15 00:48:32 +03:00
|
|
|
\verb|LUA_TBOOLEAN|,
|
2000-11-07 15:44:44 +03:00
|
|
|
\verb|LUA_TSTRING|,
|
|
|
|
\verb|LUA_TTABLE|,
|
|
|
|
\verb|LUA_TFUNCTION|,
|
|
|
|
\verb|LUA_TUSERDATA|.
|
2002-02-15 00:48:32 +03:00
|
|
|
The following function translates a tag to a type name:
|
|
|
|
\begin{verbatim}
|
|
|
|
const char *lua_type (lua_State *L, int index);
|
|
|
|
\end{verbatim}
|
|
|
|
\DefAPI{lua_typename}
|
2000-09-18 23:41:16 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
The \verb|lua_is*| functions return~1 if the object is compatible
|
2000-04-14 21:47:55 +04:00
|
|
|
with the given type, and 0 otherwise.
|
2002-02-15 00:48:32 +03:00
|
|
|
(\verb|lua_isboolean| is an exception to this rule,
|
|
|
|
and it succeeds only for boolean values;
|
|
|
|
otherwise it would be useless,
|
|
|
|
as any value is compatible with a boolean.)
|
2000-09-18 23:41:16 +04:00
|
|
|
They always return 0 for a non-valid index.
|
|
|
|
\verb|lua_isnumber| accepts numbers and numerical strings,
|
1997-06-09 22:16:33 +04:00
|
|
|
\verb|lua_isstring| accepts strings and numbers \see{coercion},
|
2000-09-18 23:41:16 +04:00
|
|
|
and \verb|lua_isfunction| accepts both Lua functions and C~functions.
|
2000-05-12 23:19:18 +04:00
|
|
|
To distinguish between Lua functions and C~functions,
|
2000-04-14 21:47:55 +04:00
|
|
|
you should use \verb|lua_iscfunction|.
|
|
|
|
To distinguish between numbers and numerical strings,
|
2001-07-19 17:36:18 +04:00
|
|
|
you can use \verb|lua_rawtag| (or \verb|lua_tag|).
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
The API also has functions to compare two values in the stack:
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
int lua_equal (lua_State *L, int index1, int index2);
|
|
|
|
int lua_lessthan (lua_State *L, int index1, int index2);
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_equal} \DefAPI{lua_lessthan}
|
2001-09-24 19:54:36 +04:00
|
|
|
These functions are equivalent to their counterparts in Lua \see{rel-ops}.
|
2000-09-18 23:41:16 +04:00
|
|
|
Specifically, \verb|lua_lessthan| is equivalent to the \verb|lt_event|
|
2000-11-07 15:44:44 +03:00
|
|
|
described in \See{tag-method}.
|
2000-09-18 23:41:16 +04:00
|
|
|
Both functions return 0 if any of the indices are non-valid.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Getting Values from the Stack}
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
To translate a value in the stack to a specific C~type,
|
2000-05-12 23:19:18 +04:00
|
|
|
you can use the following conversion functions:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
int lua_toboolean (lua_State *L, int index);
|
2001-09-24 19:54:36 +04:00
|
|
|
lua_Number lua_tonumber (lua_State *L, int index);
|
2000-09-18 23:41:16 +04:00
|
|
|
const char *lua_tostring (lua_State *L, int index);
|
|
|
|
size_t lua_strlen (lua_State *L, int index);
|
|
|
|
lua_CFunction lua_tocfunction (lua_State *L, int index);
|
|
|
|
void *lua_touserdata (lua_State *L, int index);
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_tonumber}\DefAPI{lua_tostring}\DefAPI{lua_strlen}
|
2002-02-15 00:48:32 +03:00
|
|
|
\DefAPI{lua_tocfunction}\DefAPI{lua_touserdata}\DefAPI{lua_toboolean}
|
2000-09-18 23:41:16 +04:00
|
|
|
These functions can be called with any acceptable index.
|
|
|
|
When called with a non-valid index,
|
|
|
|
they act as if the given value had an incorrect type.
|
1997-06-19 00:14:52 +04:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\verb|lua_toboolean| converts the Lua value at the given index
|
|
|
|
to a C ``boolean'' value (that is, (int)0 or (int)1).
|
|
|
|
Like all tests in Lua, it returns 1 for any Lua value different from
|
|
|
|
\False\ and \nil;
|
|
|
|
otherwise it returns 0.
|
|
|
|
It also returns 0 when called with a non-valid index.
|
|
|
|
(If you want to accept only real boolean values,
|
|
|
|
use \verb|lua_isboolean| to test the type of the value.)
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|lua_tonumber| converts the Lua value at the given index
|
|
|
|
to a number (by default, \verb|lua_Number| is \verb|double|).
|
|
|
|
\DefAPI{lua_Number}
|
|
|
|
The Lua value must be a number or a string convertible to number
|
2000-09-18 23:41:16 +04:00
|
|
|
\see{coercion}; otherwise, \verb|lua_tonumber| returns~0.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|lua_tostring| converts the Lua value at the given index to a string
|
2000-04-14 21:47:55 +04:00
|
|
|
(\verb|const char*|).
|
2001-09-24 19:54:36 +04:00
|
|
|
The Lua value must be a string or a number;
|
2000-04-14 21:47:55 +04:00
|
|
|
otherwise, the function returns \verb|NULL|.
|
2000-12-28 20:25:45 +03:00
|
|
|
If the value is a number,
|
2001-09-24 19:54:36 +04:00
|
|
|
then \verb|lua_tostring| also
|
|
|
|
\emph{changes the actual value in the stack to a string}.
|
2001-10-31 21:06:05 +03:00
|
|
|
(This change confuses \verb|lua_next|
|
|
|
|
when \verb|lua_tostring| is applied to keys.)
|
|
|
|
\verb|lua_tostring| returns a fully aligned pointer
|
|
|
|
to a string inside the Lua environment.
|
2001-09-24 19:54:36 +04:00
|
|
|
This string always has a zero (\verb|'\0'|)
|
|
|
|
after its last character (as in~C),
|
|
|
|
but may contain other zeros in its body.
|
1998-03-30 22:17:55 +04:00
|
|
|
If you do not know whether a string may contain zeros,
|
2001-07-19 17:36:18 +04:00
|
|
|
you can use \verb|lua_strlen| to get its actual length.
|
1997-06-17 22:45:16 +04:00
|
|
|
Because Lua has garbage collection,
|
2000-09-18 23:41:16 +04:00
|
|
|
there is no guarantee that the pointer returned by \verb|lua_tostring|
|
2001-09-24 19:54:36 +04:00
|
|
|
will be valid after the corresponding value is removed from the stack.
|
|
|
|
So, if you need the string after the current function returns,
|
2001-10-31 21:06:05 +03:00
|
|
|
then you should duplicate it (or put it into the registry \see{registry}).
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|lua_tocfunction| converts a value in the stack to a C~function.
|
|
|
|
This value must be a C~function;
|
|
|
|
otherwise, \verb|lua_tocfunction| returns \verb|NULL|.
|
1998-01-06 22:17:31 +03:00
|
|
|
The type \verb|lua_CFunction| is explained in \See{LuacallC}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|lua_touserdata| converts a value to \verb|void*|.
|
|
|
|
This value must have type \emph{userdata};
|
|
|
|
otherwise, \verb|lua_touserdata| returns \verb|NULL|.
|
|
|
|
|
|
|
|
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Pushing Values onto the Stack}
|
2000-09-18 23:41:16 +04:00
|
|
|
|
|
|
|
The API has the following functions to
|
|
|
|
push C~values onto the stack:
|
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
void lua_pushboolean (lua_State *L, int b);
|
2001-09-24 19:54:36 +04:00
|
|
|
void lua_pushnumber (lua_State *L, lua_Number n);
|
2000-09-18 23:41:16 +04:00
|
|
|
void lua_pushlstring (lua_State *L, const char *s, size_t len);
|
|
|
|
void lua_pushstring (lua_State *L, const char *s);
|
|
|
|
void lua_pushnil (lua_State *L);
|
|
|
|
void lua_pushcfunction (lua_State *L, lua_CFunction f);
|
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_pushnumber}\DefAPI{lua_pushlstring}\DefAPI{lua_pushstring}
|
2002-02-15 00:48:32 +03:00
|
|
|
\DefAPI{lua_pushcfunction}\DefAPI{lua_pushusertag}\DefAPI{lua_pushboolean}
|
2001-07-19 17:36:18 +04:00
|
|
|
\DefAPI{lua_pushnil}\label{pushing}
|
2000-09-18 23:41:16 +04:00
|
|
|
These functions receive a C~value,
|
|
|
|
convert it to a corresponding Lua value,
|
|
|
|
and push the result onto the stack.
|
|
|
|
In particular, \verb|lua_pushlstring| and \verb|lua_pushstring|
|
2001-10-31 21:06:05 +03:00
|
|
|
make an internal copy of the given string.
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|lua_pushstring| can only be used to push proper C~strings
|
2000-04-14 21:47:55 +04:00
|
|
|
(that is, strings that end with a zero and do not contain embedded zeros);
|
2001-09-24 19:54:36 +04:00
|
|
|
otherwise, you should use the more general \verb|lua_pushlstring|,
|
2000-09-18 23:41:16 +04:00
|
|
|
which accepts an explicit size.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Controlling Garbage Collection}\label{GC-API}
|
2000-10-31 21:20:01 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Lua uses two numbers to control its garbage collection:
|
|
|
|
the \emph{count} and the \emph{threshold}
|
|
|
|
\see{GC}.
|
2000-10-31 21:20:01 +03:00
|
|
|
You can access the current values of these two numbers through the
|
|
|
|
following functions:
|
2000-05-12 23:19:18 +04:00
|
|
|
\begin{verbatim}
|
2000-10-31 21:20:01 +03:00
|
|
|
int lua_getgccount (lua_State *L);
|
|
|
|
int lua_getgcthreshold (lua_State *L);
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_getgcthreshold} \DefAPI{lua_getgccount}
|
2000-10-31 21:20:01 +03:00
|
|
|
Both return their respective values in Kbytes.
|
|
|
|
You can change the threshold value with
|
|
|
|
\begin{verbatim}
|
|
|
|
void lua_setgcthreshold (lua_State *L, int newthreshold);
|
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_setgcthreshold}
|
2000-10-31 21:20:01 +03:00
|
|
|
Again, the \verb|newthreshold| value is given in Kbytes.
|
|
|
|
When you call this function,
|
2000-11-07 15:44:44 +03:00
|
|
|
Lua sets the new threshold and checks it against the byte counter.
|
|
|
|
If the new threshold is smaller than the byte counter,
|
2001-09-24 19:54:36 +04:00
|
|
|
then Lua immediately runs the garbage collector.
|
|
|
|
In particular
|
|
|
|
\verb|lua_setgcthreshold(L,0)| forces a garbage collectiion.
|
2002-02-15 00:48:32 +03:00
|
|
|
After the collection,
|
2000-11-07 15:44:44 +03:00
|
|
|
a new threshold is set according to the previous rule.
|
2001-09-24 19:54:36 +04:00
|
|
|
%% TODO: What `previous rule'?
|
2000-10-31 21:20:01 +03:00
|
|
|
|
2000-12-28 20:25:45 +03:00
|
|
|
If you want to change the adaptive behavior of the garbage collector,
|
2000-11-07 15:44:44 +03:00
|
|
|
you can use the garbage-collection tag method for \nil\ %
|
2000-10-31 21:20:01 +03:00
|
|
|
to set your own threshold
|
2000-11-07 15:44:44 +03:00
|
|
|
(the tag method is called after Lua resets the threshold).
|
2000-05-12 23:19:18 +04:00
|
|
|
|
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
\subsection{Userdata}
|
|
|
|
|
|
|
|
You can create new userdata with the following functions:
|
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
void *lua_newuserdata (lua_State *L, size_t size);
|
|
|
|
void lua_newuserdatabox (lua_State *L, void *u);
|
2001-07-19 17:36:18 +04:00
|
|
|
\end{verbatim}
|
|
|
|
\DefAPI{lua_newuserdata}\DefAPI{lua_newuserdatabox}
|
|
|
|
The first function, \verb|lua_newuserdata|,
|
|
|
|
allocates a new block of memory with the given size,
|
|
|
|
pushes on the stack a new userdata with the block address,
|
|
|
|
and returns this address.
|
|
|
|
The second function, \verb|lua_newuserdatabox|,
|
|
|
|
gets a pointer and pushes on the stack a new userdata
|
|
|
|
with that pointer.
|
|
|
|
In this case, Lua does not care about the pointer's value.
|
|
|
|
By default, all userdata are created with a standard tag,
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|LUA_TUSERDATA|, which is defined in \verb|lua.h|.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
|
|
|
When Lua collects a userdata created by \verb|lua_newuserdata|,
|
|
|
|
it automatically frees its corresponding memory.
|
2001-10-31 21:06:05 +03:00
|
|
|
On the other hand, Lua never accesses pointers in
|
2001-07-19 17:36:18 +04:00
|
|
|
userdata created with \verb|lua_newuserdatabox|;
|
|
|
|
it is up to you to free any associated memory,
|
|
|
|
setting a garbage-collection tag method, for instance.
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\subsection{Metatables}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
%% TODO
|
2001-07-19 17:36:18 +04:00
|
|
|
|
1997-03-07 01:19:08 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Executing Lua Chunks}\label{luado}
|
2000-05-12 23:19:18 +04:00
|
|
|
A host program can execute Lua chunks written in a file or in a string
|
2001-09-24 19:54:36 +04:00
|
|
|
by using the following functions:
|
1997-03-07 01:19:08 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
int lua_dofile (lua_State *L, const char *filename);
|
|
|
|
int lua_dostring (lua_State *L, const char *string);
|
|
|
|
int lua_dobuffer (lua_State *L, const char *buff,
|
|
|
|
size_t size, const char *name);
|
1997-03-07 01:19:08 +03:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_dofile}\DefAPI{lua_dostring}\DefAPI{lua_dobuffer}%
|
2000-09-18 23:41:16 +04:00
|
|
|
These functions return
|
2001-09-24 19:54:36 +04:00
|
|
|
0 in case of success, or one of the following error codes
|
|
|
|
(defined in \verb|lua.h|)
|
|
|
|
if they fail:
|
2000-08-09 23:09:20 +04:00
|
|
|
\begin{itemize}
|
2000-11-07 15:44:44 +03:00
|
|
|
\item \IndexAPI{LUA_ERRRUN} ---
|
2000-08-09 23:09:20 +04:00
|
|
|
error while running the chunk.
|
2000-11-07 15:44:44 +03:00
|
|
|
\item \IndexAPI{LUA_ERRSYNTAX} ---
|
2000-08-09 23:09:20 +04:00
|
|
|
syntax error during pre-compilation.
|
2000-11-07 15:44:44 +03:00
|
|
|
\item \IndexAPI{LUA_ERRMEM} ---
|
2000-09-18 23:41:16 +04:00
|
|
|
memory allocation error.
|
2000-11-07 15:44:44 +03:00
|
|
|
For such errors, Lua does not call \verb|_ERRORMESSAGE| \see{error}.
|
|
|
|
\item \IndexAPI{LUA_ERRERR} ---
|
|
|
|
error while running \verb|_ERRORMESSAGE|.
|
|
|
|
For such errors, Lua does not call \verb|_ERRORMESSAGE| again, to avoid loops.
|
|
|
|
\item \IndexAPI{LUA_ERRFILE} ---
|
2000-08-09 23:09:20 +04:00
|
|
|
error opening the file (only for \verb|lua_dofile|).
|
|
|
|
In this case,
|
2000-05-12 23:19:18 +04:00
|
|
|
you may want to
|
|
|
|
check \verb|errno|,
|
|
|
|
call \verb|strerror|,
|
2000-08-09 23:09:20 +04:00
|
|
|
or call \verb|perror| to tell the user what went wrong.
|
|
|
|
\end{itemize}
|
|
|
|
|
1998-06-18 21:36:27 +04:00
|
|
|
When called with argument \verb|NULL|,
|
|
|
|
\verb|lua_dofile| executes the \verb|stdin| stream.
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|lua_dofile| and \verb|lua_dobuffer|
|
1998-06-16 01:34:14 +04:00
|
|
|
are both able to execute pre-compiled chunks.
|
|
|
|
They automatically detect whether the chunk is text or binary,
|
|
|
|
and load it accordingly (see program \IndexVerb{luac}).
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|lua_dostring| executes only source code,
|
2000-05-12 23:19:18 +04:00
|
|
|
given in textual form.
|
1998-06-16 01:34:14 +04:00
|
|
|
|
2001-01-29 22:33:55 +03:00
|
|
|
The fourth parameter to \verb|lua_dobuffer|
|
1998-06-16 01:34:14 +04:00
|
|
|
is the ``name of the chunk'',
|
2000-11-07 15:44:44 +03:00
|
|
|
which is used in error messages and debug information.
|
1998-06-19 22:47:06 +04:00
|
|
|
If \verb|name| is \verb|NULL|,
|
2000-05-12 23:19:18 +04:00
|
|
|
then Lua gives a default name to the chunk.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
These functions push onto the stack
|
2000-11-07 15:44:44 +03:00
|
|
|
any values eventually returned by the chunk.
|
2000-09-18 23:41:16 +04:00
|
|
|
A chunk may return any number of values;
|
|
|
|
Lua takes care that these values fit into the stack space,
|
2001-09-24 19:54:36 +04:00
|
|
|
%% TODO: how? o que acontece se nao da'?
|
2000-11-07 15:44:44 +03:00
|
|
|
but after the call the responsibility is back to you.
|
2000-09-18 23:41:16 +04:00
|
|
|
If you need to push other elements after calling any of these functions,
|
2000-11-07 15:44:44 +03:00
|
|
|
and you want to ``play safe'',
|
|
|
|
you must either check the stack space
|
2002-06-06 16:49:28 +04:00
|
|
|
with \verb|lua_checkstack|
|
2000-11-07 15:44:44 +03:00
|
|
|
or remove the returned elements
|
2000-09-18 23:41:16 +04:00
|
|
|
from the stack (if you do not need them).
|
|
|
|
For instance, the following code
|
2001-09-24 19:54:36 +04:00
|
|
|
executes a chunk from a file and discards all results returned by this chunk,
|
2000-09-18 23:41:16 +04:00
|
|
|
leaving the stack as it was before the call:
|
|
|
|
\begin{verbatim}
|
|
|
|
{
|
|
|
|
int oldtop = lua_gettop(L);
|
|
|
|
lua_dofile(L, filename);
|
|
|
|
lua_settop(L, oldtop);
|
|
|
|
}
|
|
|
|
\end{verbatim}
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Loading Lua Chunks}
|
|
|
|
You can load Lua chunks without executing them with
|
|
|
|
\begin{verbatim}
|
|
|
|
int lua_loadfile (lua_State *L, const char *filename);
|
|
|
|
int lua_loadbuffer (lua_State *L, const char *buff,
|
|
|
|
size_t size, const char *name);
|
|
|
|
\end{verbatim}
|
|
|
|
The compiled chunk is left as a function on top of the stack.
|
|
|
|
The return values are the same as those of
|
|
|
|
\verb|lua_dofile| and \verb|lua_dobuffer|.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Manipulating Tables}
|
|
|
|
|
|
|
|
Tables are created by calling
|
|
|
|
The function
|
|
|
|
\begin{verbatim}
|
|
|
|
void lua_newtable (lua_State *L);
|
|
|
|
\end{verbatim}
|
|
|
|
\DefAPI{lua_newtable}
|
|
|
|
This function creates a new, empty table and pushes it onto the stack.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
To read a value from a table that resides somewhere in the stack,
|
|
|
|
call
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
void lua_gettable (lua_State *L, int index);
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_gettable}
|
2000-09-18 23:41:16 +04:00
|
|
|
where \verb|index| refers to the table.
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|lua_gettable| pops a key from the stack
|
2000-09-18 23:41:16 +04:00
|
|
|
and returns (on the stack) the contents of the table at that key.
|
2001-09-24 19:54:36 +04:00
|
|
|
The table is left where it was in the stack;
|
|
|
|
this is convenient for getting multiple values from a table.
|
|
|
|
|
|
|
|
As in Lua, this function may trigger a tag method
|
|
|
|
for the ``gettable'' event \see{tag-method}.
|
2000-09-18 23:41:16 +04:00
|
|
|
To get the real value of any table key,
|
1997-06-17 22:45:16 +04:00
|
|
|
without invoking any tag method,
|
1998-06-18 21:36:27 +04:00
|
|
|
use the \emph{raw} version:
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
void lua_rawget (lua_State *L, int index);
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_rawget}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
To store a value into a table that resides somewhere in the stack,
|
|
|
|
you push the key and the value onto the stack
|
2000-05-12 23:19:18 +04:00
|
|
|
(in this order),
|
2000-09-18 23:41:16 +04:00
|
|
|
and then call
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
void lua_settable (lua_State *L, int index);
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_settable}
|
2000-09-18 23:41:16 +04:00
|
|
|
where \verb|index| refers to the table.
|
|
|
|
\verb|lua_settable| pops from the stack both the key and the value.
|
2001-09-24 19:54:36 +04:00
|
|
|
The table is left where it was in the stack;
|
|
|
|
this is convenient for setting multiple values in a table.
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
As in Lua, this operation may trigger a tag method
|
|
|
|
for the ``settable'' event.
|
1997-06-17 22:45:16 +04:00
|
|
|
To set the real value of any table index,
|
|
|
|
without invoking any tag method,
|
1998-06-18 21:36:27 +04:00
|
|
|
use the \emph{raw} version:
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
void lua_rawset (lua_State *L, int index);
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_rawset}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
You can traverse a table with the function
|
2000-09-18 23:41:16 +04:00
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
int lua_next (lua_State *L, int index);
|
2000-09-18 23:41:16 +04:00
|
|
|
\end{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
\DefAPI{lua_next}
|
|
|
|
where \verb|index| refers to the table to be traversed.
|
|
|
|
The function pops a key from the stack,
|
|
|
|
and pushes a key-value pair from the table
|
|
|
|
(the ``next'' pair after the given key).
|
|
|
|
If there are no more elements, then \verb|lua_next| returns 0
|
|
|
|
(and pushes nothing).
|
|
|
|
Use a \nil\ key to signal the start of a traversal.
|
|
|
|
|
|
|
|
A typical traversal looks like this:
|
|
|
|
\begin{verbatim}
|
|
|
|
/* table is in the stack at index `t' */
|
|
|
|
lua_pushnil(L); /* first key */
|
|
|
|
while (lua_next(L, t) != 0) {
|
|
|
|
/* `key' is at index -2 and `value' at index -1 */
|
|
|
|
printf("%s - %s\n",
|
|
|
|
lua_typename(L, lua_type(L, -2)), lua_typename(L, lua_type(L, -1)));
|
|
|
|
lua_pop(L, 1); /* removes `value'; keeps `key' for next iteration */
|
|
|
|
}
|
|
|
|
\end{verbatim}
|
|
|
|
|
|
|
|
NOTE:
|
2001-10-31 21:06:05 +03:00
|
|
|
While traversing a table,
|
|
|
|
do not call \verb|lua_tostring| on a key,
|
2001-09-24 19:54:36 +04:00
|
|
|
unless you know the key is actually a string.
|
|
|
|
Recall that \verb|lua_tostring| \emph{changes} the value at the given index;
|
|
|
|
this confuses \verb|lua_next|.
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\subsection{Manipulating Global Variables} \label{globals}
|
|
|
|
|
|
|
|
All global variables are kept in an ordinary Lua table.
|
|
|
|
This table is always at pseudo-index \IndexAPI{LUA_GLOBALSINDEX}.
|
|
|
|
|
|
|
|
To access and change the value of global variables,
|
|
|
|
you can use regular table operations over the global table.
|
|
|
|
For instance, to access the value of a global variable, do
|
2001-09-24 19:54:36 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
lua_pushstring(L, varname);
|
|
|
|
lua_gettable(L, LUA_GLOBALSINDEX);
|
2001-09-24 19:54:36 +04:00
|
|
|
\end{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
|
|
|
|
You can change the global table of a Lua thread using \verb|lua_replace|.
|
2001-09-24 19:54:36 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
|
|
|
|
\subsection{Using Tables as Arrays}
|
|
|
|
The API has functions that help to use Lua tables as arrays,
|
|
|
|
that is,
|
|
|
|
tables indexed by numbers only:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
void lua_rawgeti (lua_State *L, int index, int n);
|
|
|
|
void lua_rawseti (lua_State *L, int index, int n);
|
|
|
|
int lua_getn (lua_State *L, int index);
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_rawgeti}
|
|
|
|
\DefAPI{lua_rawseti}
|
|
|
|
\DefAPI{lua_getn}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-07-24 21:25:03 +04:00
|
|
|
\verb|lua_rawgeti| pushes the value of the \M{n}-th element of the table
|
2000-09-18 23:41:16 +04:00
|
|
|
at stack position \verb|index|.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\verb|lua_rawseti| sets the value of the \M{n}-th element of the table
|
2001-07-24 21:25:03 +04:00
|
|
|
at stack position \verb|index| to the value at the top of the stack,
|
2001-09-24 19:54:36 +04:00
|
|
|
removing this value from the stack.
|
2000-09-18 23:41:16 +04:00
|
|
|
|
|
|
|
\verb|lua_getn| returns the number of elements in the table
|
|
|
|
at stack position \verb|index|.
|
|
|
|
This number is the value of the table field \verb|n|,
|
|
|
|
if it has a numeric value,
|
2001-09-24 19:54:36 +04:00
|
|
|
or the largest numerical index with a non-\nil\ value in the table.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Calling Functions}
|
2000-09-18 23:41:16 +04:00
|
|
|
|
|
|
|
Functions defined in Lua
|
2000-11-07 15:44:44 +03:00
|
|
|
(and C~functions registered in Lua)
|
1998-06-18 21:36:27 +04:00
|
|
|
can be called from the host program.
|
1995-11-16 23:46:02 +03:00
|
|
|
This is done using the following protocol:
|
2000-09-18 23:41:16 +04:00
|
|
|
First, the function to be called is pushed onto the stack;
|
|
|
|
then, the arguments to the function are pushed
|
2001-09-24 19:54:36 +04:00
|
|
|
in \emph{direct order}, that is, the first argument is pushed first.
|
2000-09-18 23:41:16 +04:00
|
|
|
Finally, the function is called using
|
|
|
|
\begin{verbatim}
|
|
|
|
int lua_call (lua_State *L, int nargs, int nresults);
|
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_call}
|
2000-11-07 15:44:44 +03:00
|
|
|
This function returns the same error codes as \verb|lua_dostring| and
|
|
|
|
friends \see{luado}.
|
|
|
|
If you want to propagate the error,
|
2001-09-24 19:54:36 +04:00
|
|
|
%% TODO: explain 'propagate'.
|
2000-11-07 15:44:44 +03:00
|
|
|
instead of returning an error code,
|
|
|
|
use
|
|
|
|
\begin{verbatim}
|
|
|
|
void lua_rawcall (lua_State *L, int nargs, int nresults);
|
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_rawcall}
|
2000-11-07 15:44:44 +03:00
|
|
|
|
|
|
|
In both functions,
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|nargs| is the number of arguments that you pushed onto the stack.
|
|
|
|
All arguments and the function value are popped from the stack,
|
|
|
|
and the function results are pushed.
|
2001-07-19 17:36:18 +04:00
|
|
|
The number of results are adjusted to \verb|nresults|,
|
2000-11-07 15:44:44 +03:00
|
|
|
unless \verb|nresults| is \IndexAPI{LUA_MULTRET}.
|
2000-09-18 23:41:16 +04:00
|
|
|
In that case, \emph{all} results from the function are pushed.
|
2001-09-24 19:54:36 +04:00
|
|
|
The function results are pushed onto the stack in direct order
|
2000-09-18 23:41:16 +04:00
|
|
|
(the first result is pushed first),
|
|
|
|
so that after the call the last result is on the top.
|
1997-03-07 01:19:08 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
The following example shows how the host program may do the
|
1997-06-17 22:45:16 +04:00
|
|
|
equivalent to the Lua code:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
a = f("how", t.x, 14)
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
Here it is in~C:
|
1997-06-17 22:45:16 +04:00
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
lua_pushstring(L, "t");
|
|
|
|
lua_gettable(L, LUA_GLOBALSINDEX); /* global `t' (for later use) */
|
|
|
|
lua_pushstring(L, "a"); /* var name */
|
|
|
|
lua_pushstring(L, "f"); /* function name */
|
|
|
|
lua_gettable(L, LUA_GLOBALSINDEX); /* function to be called */
|
2000-09-18 23:41:16 +04:00
|
|
|
lua_pushstring(L, "how"); /* 1st argument */
|
2001-09-24 19:54:36 +04:00
|
|
|
lua_pushstring(L, "x"); /* push the string "x" */
|
2002-02-15 00:48:32 +03:00
|
|
|
lua_gettable(L, -5); /* push result of t.x (2nd arg) */
|
2001-09-24 19:54:36 +04:00
|
|
|
lua_pushnumber(L, 14); /* 3rd argument */
|
2002-02-15 00:48:32 +03:00
|
|
|
lua_call(L, 3, 1); /* call function with 3 arguments and 1 result */
|
|
|
|
lua_settable(L, LUA_GLOBALSINDEX); /* set global variable `a' */
|
2000-09-18 23:41:16 +04:00
|
|
|
lua_pop(L, 1); /* remove `t' from the stack */
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
Notice that the code above is ``balanced'':
|
2001-01-29 22:33:55 +03:00
|
|
|
at its end, the stack is back to its original configuration.
|
2000-09-18 23:41:16 +04:00
|
|
|
This is considered good programming practice.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
(We did this example using only the raw functions provided by Lua's API,
|
|
|
|
to show all the details.
|
|
|
|
Usually programmers use several macros and auxiliar functions that
|
|
|
|
provide higher level access to Lua.)
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\medskip
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
%% TODO: mover essas 2 para algum lugar melhor.
|
2000-09-18 23:41:16 +04:00
|
|
|
Some special Lua functions have their own C~interfaces.
|
2000-05-12 23:19:18 +04:00
|
|
|
The host program can generate a Lua error calling the function
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
void lua_error (lua_State *L, const char *message);
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_error}
|
1995-11-16 23:46:02 +03:00
|
|
|
This function never returns.
|
2000-05-12 23:19:18 +04:00
|
|
|
If \verb|lua_error| is called from a C~function that has been called from Lua,
|
1997-01-23 19:17:53 +03:00
|
|
|
then the corresponding Lua execution terminates,
|
1995-11-16 23:46:02 +03:00
|
|
|
as if an error had occurred inside Lua code.
|
2000-09-18 23:41:16 +04:00
|
|
|
Otherwise, the whole host program terminates with a call to
|
|
|
|
\verb|exit(EXIT_FAILURE)|.
|
2000-05-12 23:19:18 +04:00
|
|
|
Before terminating execution,
|
|
|
|
the \verb|message| is passed to the error handler function,
|
|
|
|
\verb|_ERRORMESSAGE| \see{error}.
|
1998-01-02 21:34:00 +03:00
|
|
|
If \verb|message| is \verb|NULL|,
|
1999-04-07 20:40:04 +04:00
|
|
|
then \verb|_ERRORMESSAGE| is not called.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
The function
|
|
|
|
\begin{verbatim}
|
|
|
|
void lua_concat (lua_State *L, int n);
|
|
|
|
\end{verbatim}
|
|
|
|
\DefAPI{lua_concat}
|
|
|
|
concatenates the \verb|n| values at the top of the stack,
|
2002-02-15 00:48:32 +03:00
|
|
|
pops them, and leaves the result at the top.
|
|
|
|
If \verb|n| is 1, the result is that single string
|
|
|
|
(that is, the function does nothing);
|
|
|
|
if \verb|n| is 0, the result is the empty string.
|
2001-09-24 19:54:36 +04:00
|
|
|
Concatenation is done following the usual semantics of Lua
|
|
|
|
\see{concat}.
|
2000-11-07 15:44:44 +03:00
|
|
|
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Defining C Functions} \label{LuacallC}
|
|
|
|
Lua can be extended with functions written in~C.
|
|
|
|
These functions must be of type \verb|lua_CFunction|,
|
|
|
|
which is defined as
|
2000-04-14 21:47:55 +04:00
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
typedef int (*lua_CFunction) (lua_State *L);
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_CFunction}
|
2001-09-24 19:54:36 +04:00
|
|
|
A C~function receives a Lua environment and returns an integer,
|
|
|
|
the number of values it has returned to Lua.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
In order to communicate properly with Lua,
|
2000-09-18 23:41:16 +04:00
|
|
|
a C~function must follow the following protocol,
|
|
|
|
which defines the way parameters and results are passed:
|
|
|
|
A C~function receives its arguments from Lua in the stack,
|
2000-11-07 15:44:44 +03:00
|
|
|
in direct order (the first argument is pushed first).
|
2000-09-18 23:41:16 +04:00
|
|
|
To return values to Lua, a C~function just pushes them onto the stack,
|
2000-11-07 15:44:44 +03:00
|
|
|
in direct order (the first result is pushed first),
|
2000-09-18 23:41:16 +04:00
|
|
|
and returns the number of results.
|
2000-05-12 23:19:18 +04:00
|
|
|
Like a Lua function, a C~function called by Lua can also return
|
1995-11-16 23:46:02 +03:00
|
|
|
many results.
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
As an example, the following function receives a variable number
|
|
|
|
of numerical arguments and returns their average and sum:
|
|
|
|
\begin{verbatim}
|
|
|
|
static int foo (lua_State *L) {
|
|
|
|
int n = lua_gettop(L); /* number of arguments */
|
2001-09-24 19:54:36 +04:00
|
|
|
lua_Number sum = 0;
|
2000-09-18 23:41:16 +04:00
|
|
|
int i;
|
|
|
|
for (i = 1; i <= n; i++) {
|
|
|
|
if (!lua_isnumber(L, i))
|
2000-11-07 15:44:44 +03:00
|
|
|
lua_error(L, "incorrect argument to function `average'");
|
2000-09-18 23:41:16 +04:00
|
|
|
sum += lua_tonumber(L, i);
|
|
|
|
}
|
|
|
|
lua_pushnumber(L, sum/n); /* first result */
|
|
|
|
lua_pushnumber(L, sum); /* second result */
|
|
|
|
return 2; /* number of results */
|
|
|
|
}
|
|
|
|
\end{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
|
|
|
|
To register a C~function to Lua,
|
|
|
|
there is the following convenience macro:
|
|
|
|
\begin{verbatim}
|
2002-02-15 00:48:32 +03:00
|
|
|
#define lua_register(L,n,f) \
|
|
|
|
(lua_pushstring(L, n), \
|
|
|
|
lua_pushcfunction(L, f), \
|
|
|
|
lua_settable(L, LUA_GLOBALSINDEX))
|
2001-09-24 19:54:36 +04:00
|
|
|
/* const char *n; */
|
|
|
|
/* lua_CFunction f; */
|
|
|
|
\end{verbatim}
|
|
|
|
\DefAPI{lua_register}
|
|
|
|
which receives the name the function will have in Lua,
|
|
|
|
and a pointer to the function.
|
|
|
|
Thus,
|
|
|
|
the C~function `\verb|foo|' above may be registered in Lua as `\verb|average|'
|
|
|
|
by calling
|
2000-09-18 23:41:16 +04:00
|
|
|
\begin{verbatim}
|
|
|
|
lua_register(L, "average", foo);
|
|
|
|
\end{verbatim}
|
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
\subsection{Defining C Closures} \label{c-closure}
|
2000-09-18 23:41:16 +04:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
When a C~function is created,
|
2001-10-31 21:06:05 +03:00
|
|
|
it is possible to associate some values to it,
|
2000-09-18 23:41:16 +04:00
|
|
|
thus creating a \IndexEmph{C~closure};
|
2001-10-31 21:06:05 +03:00
|
|
|
these values are then accessible to the function whenever it is called.
|
|
|
|
To associate values to a C~function,
|
2001-01-29 22:33:55 +03:00
|
|
|
first these values should be pushed onto the stack
|
2001-10-31 21:06:05 +03:00
|
|
|
(when there are multiple values, the first value is pushed first).
|
2000-12-28 20:25:45 +03:00
|
|
|
Then the function
|
1998-01-02 21:34:00 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n);
|
1998-01-02 21:34:00 +03:00
|
|
|
\end{verbatim}
|
2000-12-28 20:25:45 +03:00
|
|
|
\DefAPI{lua_pushcclosure}
|
2000-09-18 23:41:16 +04:00
|
|
|
is used to push the C~function onto the stack,
|
2001-10-31 21:06:05 +03:00
|
|
|
with the argument \verb|n| telling how many values should be
|
2000-09-18 23:41:16 +04:00
|
|
|
associated with the function
|
2001-10-31 21:06:05 +03:00
|
|
|
(\verb|lua_pushcclosure| also pops these values from the stack);
|
1998-01-09 17:57:43 +03:00
|
|
|
in fact, the macro \verb|lua_pushcfunction| is defined as
|
1998-06-18 21:36:27 +04:00
|
|
|
\verb|lua_pushcclosure| with \verb|n| set to 0.
|
2001-10-31 21:06:05 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
Then, whenever the C~function is called,
|
2001-10-31 21:06:05 +03:00
|
|
|
those values are located at specific pseudo-indices.
|
|
|
|
Those pseudo-indices are produced by a macro \IndexAPI{lua_upvalueindex}.
|
|
|
|
The first value associated with a function is at position
|
|
|
|
\verb|lua_upvalueindex(1)|, and so on.
|
1998-01-02 21:34:00 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
For examples of C~functions and closures, see files
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|lbaselib.c|, \verb|liolib.c|, \verb|lmathlib.c|, and \verb|lstrlib.c|
|
|
|
|
in the official Lua distribution.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1996-04-22 22:00:37 +04:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
\subsubsection*{Registry} \label{registry}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
Lua provides a pre-defined table that can be used by any C~code to
|
|
|
|
store whatever Lua value it needs to store,
|
|
|
|
especially if the C~code needs to keep that Lua value
|
|
|
|
outside the life span of a C~function.
|
|
|
|
This table is always located at pseudo-index
|
|
|
|
\IndexAPI{LUA_REGISTRYINDEX}.
|
2000-11-07 15:44:44 +03:00
|
|
|
Any C~library can store data into this table,
|
2000-10-31 21:20:01 +03:00
|
|
|
as long as it chooses a key different from other libraries.
|
2001-10-31 21:06:05 +03:00
|
|
|
The integer keys in the registry are used by the reference mechanism,
|
|
|
|
implemented by the auxiliar library,
|
|
|
|
and therefore should not be used by other purposes.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
%------------------------------------------------------------------------------
|
|
|
|
\section{The Debug Interface} \label{debugI}
|
2001-07-19 17:36:18 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Lua has no built-in debugging facilities.
|
|
|
|
Instead, it offers a special interface,
|
|
|
|
by means of functions and \emph{hooks},
|
|
|
|
which allows the construction of different
|
|
|
|
kinds of debuggers, profilers, and other tools
|
|
|
|
that need ``inside information'' from the interpreter.
|
|
|
|
This interface is declared in \verb|luadebug.h|.
|
|
|
|
|
|
|
|
\subsection{Stack and Function Information}
|
|
|
|
|
|
|
|
The main function to get information about the interpreter stack is
|
2001-07-19 17:36:18 +04:00
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
int lua_getstack (lua_State *L, int level, lua_Debug *ar);
|
2001-07-19 17:36:18 +04:00
|
|
|
\end{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
\DefAPI{lua_getstack}
|
|
|
|
This function fills parts of a \verb|lua_Debug| structure with
|
|
|
|
an identification of the \emph{activation record}
|
|
|
|
of the function executing at a given level.
|
|
|
|
Level~0 is the current running function,
|
|
|
|
whereas level \Math{n+1} is the function that has called level \Math{n}.
|
|
|
|
Usually, \verb|lua_getstack| returns 1;
|
|
|
|
when called with a level greater than the stack depth,
|
|
|
|
it returns 0.
|
|
|
|
|
|
|
|
The structure \verb|lua_Debug| is used to carry different pieces of
|
|
|
|
information about an active function:
|
2001-07-19 17:36:18 +04:00
|
|
|
\begin{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
typedef struct lua_Debug {
|
|
|
|
const char *event; /* "call", "return" */
|
|
|
|
int currentline; /* (l) */
|
|
|
|
const char *name; /* (n) */
|
2002-06-06 16:49:28 +04:00
|
|
|
const char *namewhat; /* (n) `global', `local', `field', `method' */
|
2001-09-24 19:54:36 +04:00
|
|
|
int nups; /* (u) number of upvalues */
|
|
|
|
int linedefined; /* (S) */
|
|
|
|
const char *what; /* (S) "Lua" function, "C" function, Lua "main" */
|
|
|
|
const char *source; /* (S) */
|
|
|
|
char short_src[LUA_IDSIZE]; /* (S) */
|
|
|
|
|
|
|
|
/* private part */
|
|
|
|
...
|
|
|
|
} lua_Debug;
|
2001-07-19 17:36:18 +04:00
|
|
|
\end{verbatim}
|
2001-09-24 19:54:36 +04:00
|
|
|
\DefAPI{lua_Debug}
|
|
|
|
\verb|lua_getstack| fills only the private part
|
|
|
|
of this structure, for future use.
|
|
|
|
To fill the other fields of \verb|lua_Debug| with useful information,
|
|
|
|
call
|
|
|
|
\begin{verbatim}
|
|
|
|
int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);
|
|
|
|
\end{verbatim}
|
|
|
|
\DefAPI{lua_getinfo}
|
|
|
|
This function returns 0 on error
|
|
|
|
(for instance, an invalid option in \verb|what|).
|
|
|
|
Each character in the string \verb|what|
|
|
|
|
selects some fields of \verb|ar| to be filled,
|
|
|
|
as indicated by the letter in parentheses in the definition of \verb|lua_Debug|
|
|
|
|
above:
|
|
|
|
`\verb|S|' fills in the fields \verb|source|, \verb|linedefined|,
|
|
|
|
and \verb|what|;
|
|
|
|
`\verb|l|' fills in the field \verb|currentline|, etc.
|
|
|
|
Moreover, `\verb|f|' pushes onto the stack the function that is
|
|
|
|
running at the given level.
|
|
|
|
|
|
|
|
To get information about a function that is not active (that is,
|
|
|
|
it is not in the stack),
|
|
|
|
you push the function onto the stack,
|
|
|
|
and start the \verb|what| string with the character `\verb|>|'.
|
|
|
|
For instance, to know in which line a function \verb|f| was defined,
|
|
|
|
you can write
|
|
|
|
\begin{verbatim}
|
|
|
|
lua_Debug ar;
|
2002-02-15 00:48:32 +03:00
|
|
|
lua_pushstring(L, "f");
|
|
|
|
lua_gettable(L, LUA_GLOBALSINDEX); /* get global `f' */
|
2001-09-24 19:54:36 +04:00
|
|
|
lua_getinfo(L, ">S", &ar);
|
|
|
|
printf("%d\n", ar.linedefined);
|
|
|
|
\end{verbatim}
|
|
|
|
The fields of \verb|lua_Debug| have the following meaning:
|
|
|
|
\begin{description}\leftskip=20pt
|
|
|
|
|
|
|
|
\item[source]
|
|
|
|
If the function was defined in a string,
|
|
|
|
then \verb|source| is that string;
|
|
|
|
if the function was defined in a file,
|
|
|
|
then \verb|source| starts with a \verb|@| followed by the file name.
|
|
|
|
|
|
|
|
\item[short\_src]
|
|
|
|
A ``printable'' version of \verb|source|, to be used in error messages.
|
|
|
|
|
|
|
|
\item[linedefined]
|
|
|
|
the line number where the definition of the function starts.
|
|
|
|
|
|
|
|
\item[what] the string \verb|"Lua"| if this is a Lua function,
|
|
|
|
\verb|"C"| if this is a C~function,
|
|
|
|
or \verb|"main"| if this is the main part of a chunk.
|
|
|
|
|
|
|
|
\item[currentline]
|
|
|
|
the current line where the given function is executing.
|
|
|
|
When no line information is available,
|
|
|
|
\verb|currentline| is set to \Math{-1}.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\item[name]
|
|
|
|
a reasonable name for the given function.
|
|
|
|
Because functions in Lua are first class values,
|
|
|
|
they do not have a fixed name:
|
|
|
|
Some functions may be the value of many global variables,
|
|
|
|
while others may be stored only in a table field.
|
|
|
|
The \verb|lua_getinfo| function checks whether the given
|
|
|
|
function is a tag method or the value of a global variable.
|
|
|
|
If the given function is a tag method,
|
|
|
|
then \verb|name| points to the event name.
|
|
|
|
%% TODO: mas qual o tag? Agora que temos tipos com nome, seria util saber
|
|
|
|
%% o tipo de TM. Em particular para mensagens de erro.
|
|
|
|
If the given function is the value of a global variable,
|
|
|
|
then \verb|name| points to the variable name.
|
|
|
|
If the given function is neither a tag method nor a global variable,
|
|
|
|
then \verb|name| is set to \verb|NULL|.
|
|
|
|
|
|
|
|
\item[namewhat]
|
|
|
|
Explains the previous field.
|
2002-06-06 16:49:28 +04:00
|
|
|
It can be \verb|"global"|, \verb|"local"|, \verb|"method"|,
|
|
|
|
\verb|"field"|, or \verb|""| (the empty string),
|
|
|
|
according to how the function was called.
|
|
|
|
(Lua uses the empty string when no other option seems to apply.)
|
2001-09-24 19:54:36 +04:00
|
|
|
|
|
|
|
\item[nups]
|
|
|
|
Number of upvalues of the function.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\end{description}
|
|
|
|
|
|
|
|
|
|
|
|
\subsection{Manipulating Local Variables}
|
|
|
|
|
|
|
|
For the manipulation of local variables,
|
|
|
|
\verb|luadebug.h| uses indices:
|
|
|
|
The first parameter or local variable has index~1, and so on,
|
|
|
|
until the last active local variable.
|
|
|
|
|
|
|
|
The following functions allow the manipulation of the
|
|
|
|
local variables of a given activation record:
|
|
|
|
\begin{verbatim}
|
|
|
|
const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n);
|
|
|
|
const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n);
|
|
|
|
\end{verbatim}
|
|
|
|
\DefAPI{lua_getlocal}\DefAPI{lua_setlocal}
|
|
|
|
The parameter \verb|ar| must be a valid activation record,
|
|
|
|
filled by a previous call to \verb|lua_getstack| or
|
|
|
|
given as argument to a hook \see{sub-hooks}.
|
|
|
|
\verb|lua_getlocal| gets the index \verb|n| of a local variable,
|
|
|
|
pushes its value onto the stack,
|
|
|
|
and returns its name.
|
|
|
|
%% TODO: why return name?
|
|
|
|
\verb|lua_setlocal| assigns the value at the top of the stack
|
|
|
|
to the variable and returns its name.
|
|
|
|
Both functions return \verb|NULL| on failure,
|
|
|
|
that is
|
|
|
|
when the index is greater than
|
|
|
|
the number of active local variables.
|
|
|
|
|
|
|
|
As an example, the following function lists the names of all
|
|
|
|
local variables for a function at a given level of the stack:
|
|
|
|
\begin{verbatim}
|
|
|
|
int listvars (lua_State *L, int level) {
|
|
|
|
lua_Debug ar;
|
|
|
|
int i = 1;
|
|
|
|
const char *name;
|
|
|
|
if (lua_getstack(L, level, &ar) == 0)
|
|
|
|
return 0; /* failure: no such level in the stack */
|
|
|
|
while ((name = lua_getlocal(L, &ar, i++)) != NULL) {
|
|
|
|
printf("%s\n", name);
|
|
|
|
lua_pop(L, 1); /* remove variable value */
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
\end{verbatim}
|
|
|
|
|
|
|
|
|
|
|
|
\subsection{Hooks}\label{sub-hooks}
|
|
|
|
|
|
|
|
The Lua interpreter offers two hooks for debugging purposes:
|
|
|
|
a \emph{call} hook and a \emph{line} hook.
|
|
|
|
Both have type \verb|lua_Hook|, defined as follows:
|
|
|
|
\begin{verbatim}
|
|
|
|
typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);
|
|
|
|
\end{verbatim}
|
|
|
|
\DefAPI{lua_Hook}
|
|
|
|
You can set the hooks with the following functions:
|
|
|
|
\begin{verbatim}
|
|
|
|
lua_Hook lua_setcallhook (lua_State *L, lua_Hook func);
|
|
|
|
lua_Hook lua_setlinehook (lua_State *L, lua_Hook func);
|
|
|
|
\end{verbatim}
|
|
|
|
\DefAPI{lua_setcallhook}\DefAPI{lua_setlinehook}
|
|
|
|
A hook is disabled when its value is \verb|NULL|,
|
|
|
|
which is the initial value of both hooks.
|
|
|
|
The functions \verb|lua_setcallhook| and \verb|lua_setlinehook|
|
|
|
|
set their corresponding hooks and return their previous values.
|
|
|
|
|
|
|
|
The call hook is called whenever the
|
|
|
|
interpreter enters or leaves a function.
|
2001-10-31 21:06:05 +03:00
|
|
|
The \verb|event| field of \verb|ar| has the string \verb|"call"|
|
2001-09-24 19:54:36 +04:00
|
|
|
or \verb|"return"|.
|
|
|
|
This \verb|ar| can then be used in calls to \verb|lua_getinfo|,
|
|
|
|
\verb|lua_getlocal|, and \verb|lua_setlocal|
|
|
|
|
to get more information about the function and to manipulate its
|
|
|
|
local variables.
|
|
|
|
|
|
|
|
The line hook is called every time the interpreter changes
|
|
|
|
the line of code it is executing.
|
|
|
|
The \verb|event| field of \verb|ar| has the string \verb|"line"|,
|
2001-10-31 21:06:05 +03:00
|
|
|
and the \verb|currentline| field has the new line number.
|
2001-09-24 19:54:36 +04:00
|
|
|
Again, you can use this \verb|ar| in other calls to the debug API.
|
|
|
|
|
|
|
|
While Lua is running a hook, it disables other calls to hooks.
|
|
|
|
Therefore, if a hook calls Lua to execute a function or a chunk,
|
|
|
|
this execution ocurrs without any calls to hooks.
|
|
|
|
|
|
|
|
|
|
|
|
%------------------------------------------------------------------------------
|
|
|
|
\section{Standard Libraries}\label{libraries}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
The standard libraries provide useful functions
|
2001-09-24 19:54:36 +04:00
|
|
|
that are implemented directly through the standard C~API.
|
|
|
|
Therefore, they are not essential to the language,
|
2000-09-18 23:41:16 +04:00
|
|
|
and are provided as separate C~modules.
|
|
|
|
Currently, Lua has the following standard libraries:
|
1995-11-16 23:46:02 +03:00
|
|
|
\begin{itemize}
|
2000-09-18 23:41:16 +04:00
|
|
|
\item basic library;
|
1995-11-16 23:46:02 +03:00
|
|
|
\item string manipulation;
|
2001-09-24 19:54:36 +04:00
|
|
|
\item mathematical functions (sin, log, etc.);
|
1996-04-29 22:50:08 +04:00
|
|
|
\item input and output (plus some system facilities).
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{itemize}
|
1998-01-09 17:57:43 +03:00
|
|
|
To have access to these libraries,
|
2000-09-18 23:41:16 +04:00
|
|
|
the C~host program must call the functions
|
|
|
|
\verb|lua_baselibopen|,
|
1998-01-09 17:57:43 +03:00
|
|
|
\verb|lua_strlibopen|, \verb|lua_mathlibopen|,
|
2000-11-07 15:44:44 +03:00
|
|
|
and \verb|lua_iolibopen|, which are declared in \verb|lualib.h|.
|
|
|
|
\DefAPI{lua_baselibopen}
|
|
|
|
\DefAPI{lua_strlibopen}
|
|
|
|
\DefAPI{lua_mathlibopen}
|
|
|
|
\DefAPI{lua_iolibopen}
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Lua's web site has links to Lua libraries written by users.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsection{Basic Functions} \label{predefined}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
The basic library provides some core functions to Lua.
|
2001-09-24 19:54:36 +04:00
|
|
|
If you do not include this library in your application,
|
2000-09-18 23:41:16 +04:00
|
|
|
you should check carefully whether you need to provide some alternative
|
|
|
|
implementation for some facilities.
|
2000-11-07 15:44:44 +03:00
|
|
|
(For instance,
|
2001-09-24 19:54:36 +04:00
|
|
|
without an \verb|_ERRORMESSAGE| function,
|
2000-11-07 15:44:44 +03:00
|
|
|
Lua is unable to show error messages.)
|
2000-09-18 23:41:16 +04:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
The basic library also defines a global variable \IndexAPI{_VERSION}
|
|
|
|
with a string containing the current interpreter version.
|
|
|
|
The current content of this string is {\tt "Lua \Version"}.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{_ALERT (message)}}\DefLIB{alert}\label{alert}
|
2000-05-12 23:19:18 +04:00
|
|
|
Prints its only string argument to \IndexVerb{stderr}.
|
|
|
|
All error messages in Lua are printed through the function stored
|
|
|
|
in the \verb|_ALERT| global variable
|
|
|
|
\see{error}.
|
|
|
|
Therefore, a program may assign another function to this variable
|
|
|
|
to change the way such messages are shown
|
|
|
|
(for instance, for systems without \verb|stderr|).
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{assert (v [, message])}}\DefLIB{assert}
|
2000-05-12 23:19:18 +04:00
|
|
|
Issues an \emph{``assertion failed!''} error
|
2001-01-31 22:53:01 +03:00
|
|
|
when its argument \verb|v| is \nil;
|
|
|
|
otherwise, returns this argument.
|
2000-05-12 23:19:18 +04:00
|
|
|
This function is equivalent to the following Lua function:
|
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
function assert (v, m)
|
|
|
|
if not v then
|
|
|
|
m = m or ""
|
|
|
|
error("assertion failed! " .. m)
|
|
|
|
end
|
2001-01-31 22:53:01 +03:00
|
|
|
return v
|
2000-09-18 23:41:16 +04:00
|
|
|
end
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{call (func, arg [, mode [, errhandler]])}}\DefLIB{call}
|
1998-01-02 21:34:00 +03:00
|
|
|
\label{pdf-call}
|
1998-08-25 00:14:56 +04:00
|
|
|
Calls function \verb|func| with
|
1997-06-17 22:45:16 +04:00
|
|
|
the arguments given by the table \verb|arg|.
|
|
|
|
The call is equivalent to
|
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
func(arg[1], arg[2], ..., arg[n])
|
1997-06-17 22:45:16 +04:00
|
|
|
\end{verbatim}
|
1998-11-13 19:48:48 +03:00
|
|
|
where \verb|n| is the result of \verb|getn(arg)| \see{getn}.
|
2000-09-18 23:41:16 +04:00
|
|
|
All results from \verb|func| are simply returned by \verb|call|.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
1998-01-02 21:34:00 +03:00
|
|
|
By default,
|
2000-05-12 23:19:18 +04:00
|
|
|
if an error occurs during the call to \verb|func|,
|
1998-01-02 21:34:00 +03:00
|
|
|
the error is propagated.
|
1998-03-30 22:17:55 +04:00
|
|
|
If the string \verb|mode| contains \verb|"x"|,
|
1998-01-02 21:34:00 +03:00
|
|
|
then the call is \emph{protected}.\index{protected calls}
|
1998-08-21 21:43:44 +04:00
|
|
|
In this mode, function \verb|call| does not propagate an error,
|
1999-04-07 20:40:04 +04:00
|
|
|
regardless of what happens during the call.
|
1998-01-02 21:34:00 +03:00
|
|
|
Instead, it returns \nil\ to signal the error
|
1998-08-21 21:43:44 +04:00
|
|
|
(besides calling the appropriated error handler).
|
1998-01-02 21:34:00 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
If \verb|errhandler| is provided,
|
2000-08-09 23:09:20 +04:00
|
|
|
the error function \verb|_ERRORMESSAGE| is temporarily set to \verb|errhandler|,
|
2000-05-12 23:19:18 +04:00
|
|
|
while \verb|func| runs.
|
1999-04-07 20:40:04 +04:00
|
|
|
In particular, if \verb|errhandler| is \nil,
|
1998-01-02 21:34:00 +03:00
|
|
|
no error messages will be issued during the execution of the called function.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{collectgarbage ([limit])}}\DefLIB{collectgarbage}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-10-31 21:20:01 +03:00
|
|
|
Sets the garbage-collection threshold for the given limit
|
2000-11-07 15:44:44 +03:00
|
|
|
(in Kbytes), and checks it against the byte counter.
|
|
|
|
If the new threshold is smaller than the byte counter,
|
|
|
|
then Lua immediately runs the garbage collector \see{GC}.
|
2000-10-31 21:20:01 +03:00
|
|
|
If \verb|limit| is absent, it defaults to zero
|
|
|
|
(thus forcing a garbage-collection cycle).
|
2000-09-20 21:21:20 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{dofile (filename)}}\DefLIB{dofile}
|
1998-08-25 00:14:56 +04:00
|
|
|
Receives a file name,
|
2001-09-24 19:54:36 +04:00
|
|
|
opens the named file, and executes its contents as a Lua chunk.
|
1996-01-29 20:08:23 +03:00
|
|
|
When called without arguments,
|
1998-03-30 22:17:55 +04:00
|
|
|
\verb|dofile| executes the contents of the standard input (\verb|stdin|).
|
1997-06-19 00:14:52 +04:00
|
|
|
If there is any error executing the file,
|
2001-07-19 17:36:18 +04:00
|
|
|
then \verb|dofile| returns \nil{} plus one of the following strings
|
|
|
|
describing the error:
|
|
|
|
\verb|"file error"|, \verb|"run-time error"|,
|
|
|
|
\verb|"syntax error"|, \verb|"memory error"|, or
|
|
|
|
\verb|"error in error handling"|.
|
1996-11-01 20:02:10 +03:00
|
|
|
Otherwise, it returns the values returned by the chunk,
|
2000-08-09 23:09:20 +04:00
|
|
|
or a non-\nil\ value if the chunk returns no values.
|
|
|
|
It issues an error when called with a non-string argument.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{dostring (string [, chunkname])}}\DefLIB{dostring}
|
1998-08-25 00:14:56 +04:00
|
|
|
Executes a given string as a Lua chunk.
|
1998-06-18 21:36:27 +04:00
|
|
|
If there is any error executing the string,
|
2001-09-24 19:54:36 +04:00
|
|
|
then \verb|dostring| returns \nil\ plus a string describing
|
2001-07-19 17:36:18 +04:00
|
|
|
the error (see \verb|dofile|).
|
1996-11-01 20:02:10 +03:00
|
|
|
Otherwise, it returns the values returned by the chunk,
|
2000-08-09 23:09:20 +04:00
|
|
|
or a non-\nil\ value if the chunk returns no values.
|
2000-05-12 23:19:18 +04:00
|
|
|
The optional parameter \verb|chunkname|
|
1998-06-19 22:47:06 +04:00
|
|
|
is the ``name of the chunk'',
|
|
|
|
used in error messages and debug information.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
\subsubsection*{\ff \T{error ([message])}}\DefLIB{error}\label{pdf-error}
|
2000-05-12 23:19:18 +04:00
|
|
|
Calls the error handler \see{error} and then terminates
|
|
|
|
the last protected function called
|
|
|
|
(in~C: \verb|lua_dofile|, \verb|lua_dostring|,
|
|
|
|
\verb|lua_dobuffer|, or \verb|lua_callfunction|;
|
|
|
|
in Lua: \verb|dofile|, \verb|dostring|, or \verb|call| in protected mode).
|
2001-10-31 21:06:05 +03:00
|
|
|
If \verb|message| is absent, the error handler is not called.
|
2000-05-12 23:19:18 +04:00
|
|
|
Function \verb|error| never returns.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{foreach (table, func)}}\DefLIB{foreach}
|
2000-09-18 23:41:16 +04:00
|
|
|
Executes the given \verb|func| over all elements of \verb|table|.
|
2000-05-12 23:19:18 +04:00
|
|
|
For each element, the function is called with the index and
|
|
|
|
respective value as arguments.
|
2001-09-24 19:54:36 +04:00
|
|
|
If the function returns a non-\nil\ value,
|
2000-05-12 23:19:18 +04:00
|
|
|
then the loop is broken, and this value is returned
|
|
|
|
as the final value of \verb|foreach|.
|
2001-09-24 19:54:36 +04:00
|
|
|
This function is equivalent to the following Lua function:
|
2000-05-12 23:19:18 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
function foreach (t, f)
|
|
|
|
for i, v in t do
|
|
|
|
local res = f(i, v)
|
|
|
|
if res then return res end
|
|
|
|
end
|
|
|
|
end
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
The behavior of \verb|foreach| is \emph{undefined} if you change
|
2000-11-07 15:44:44 +03:00
|
|
|
the table \verb|t| during the traversal.
|
2000-05-12 23:19:18 +04:00
|
|
|
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{foreachi (table, func)}}\DefLIB{foreachi}
|
2000-09-18 23:41:16 +04:00
|
|
|
Executes the given \verb|func| over the
|
2000-05-12 23:19:18 +04:00
|
|
|
numerical indices of \verb|table|.
|
|
|
|
For each index, the function is called with the index and
|
|
|
|
respective value as arguments.
|
|
|
|
Indices are visited in sequential order,
|
2000-11-07 15:44:44 +03:00
|
|
|
from~1 to \verb|n|,
|
2001-07-19 17:36:18 +04:00
|
|
|
where \verb|n| is the result of \verb|getn(table)| (see below).
|
2001-09-24 19:54:36 +04:00
|
|
|
If the function returns a non-\nil\ value,
|
2000-05-12 23:19:18 +04:00
|
|
|
then the loop is broken, and this value is returned
|
|
|
|
as the final value of \verb|foreachi|.
|
2001-09-24 19:54:36 +04:00
|
|
|
This function is equivalent to the following Lua function:
|
2000-05-12 23:19:18 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
function foreachi (t, f)
|
|
|
|
for i=1,getn(t) do
|
|
|
|
local res = f(i, t[i])
|
|
|
|
if res then return res end
|
|
|
|
end
|
|
|
|
end
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
\subsubsection*{\ff \T{gcinfo ()}}\DefLIB{gcinfo}
|
|
|
|
Returns the number of Kbytes of dynamic memory Lua is using,
|
|
|
|
and (as a second result) the
|
|
|
|
current garbage collector threshold (also in Kbytes).
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{getn (table)}}\DefLIB{getn}\label{getn}
|
2000-05-12 23:19:18 +04:00
|
|
|
Returns the ``size'' of a table, when seen as a list.
|
|
|
|
If the table has an \verb|n| field with a numeric value,
|
2000-11-07 15:44:44 +03:00
|
|
|
this value is the ``size'' of the table.
|
2001-09-24 19:54:36 +04:00
|
|
|
Otherwise, the ``size'' is the largest numerical index with a non-\nil\
|
2000-05-12 23:19:18 +04:00
|
|
|
value in the table.
|
2001-09-24 19:54:36 +04:00
|
|
|
This function is equivalent to the following Lua function:
|
2000-05-12 23:19:18 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
function getn (t)
|
2000-11-07 15:44:44 +03:00
|
|
|
if type(t.n) == "number" then return t.n end
|
2000-09-18 23:41:16 +04:00
|
|
|
local max = 0
|
|
|
|
for i, _ in t do
|
2000-11-07 15:44:44 +03:00
|
|
|
if type(i) == "number" and i>max then max=i end
|
2000-09-18 23:41:16 +04:00
|
|
|
end
|
|
|
|
return max
|
|
|
|
end
|
2000-05-12 23:19:18 +04:00
|
|
|
\end{verbatim}
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsubsection*{\ff \T{globals ([table])}}\DefLIB{globals}\label{pdf-globals}
|
2000-08-09 23:09:20 +04:00
|
|
|
Returns the current table of globals.
|
2000-09-18 23:41:16 +04:00
|
|
|
If the argument \verb|table| is given,
|
2000-11-07 15:44:44 +03:00
|
|
|
then it also sets this table as the table of globals.
|
2000-08-09 23:09:20 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsubsection*{\ff \T{loadfile (filename)}}\DefLIB{loadfile}
|
|
|
|
Similar to \verb|dofile|,
|
|
|
|
but returns the contents of a Lua chunk as a function,
|
|
|
|
instead of executing it.
|
|
|
|
|
|
|
|
\subsubsection*{\ff \T{loadstring (string [, chunkname])}}\DefLIB{loadstring}
|
|
|
|
Similar to \verb|dostring|,
|
|
|
|
but returns the contents of a Lua chunk as a function,
|
|
|
|
instead of executing it.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{next (table, [index])}}\DefLIB{next}
|
1998-08-25 00:14:56 +04:00
|
|
|
Allows a program to traverse all fields of a table.
|
1995-11-16 23:46:02 +03:00
|
|
|
Its first argument is a table and its second argument
|
|
|
|
is an index in this table.
|
2000-11-07 15:44:44 +03:00
|
|
|
\verb|next| returns the next index of the table and the
|
1995-11-16 23:46:02 +03:00
|
|
|
value associated with the index.
|
|
|
|
When called with \nil\ as its second argument,
|
2000-05-12 23:19:18 +04:00
|
|
|
\verb|next| returns the first index
|
|
|
|
of the table and its associated value.
|
1998-01-02 21:34:00 +03:00
|
|
|
When called with the last index,
|
|
|
|
or with \nil\ in an empty table,
|
2000-09-18 23:41:16 +04:00
|
|
|
\verb|next| returns \nil.
|
2000-05-12 23:19:18 +04:00
|
|
|
If the second argument is absent, then it is interpreted as \nil.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1998-01-02 21:34:00 +03:00
|
|
|
Lua has no declaration of fields;
|
1995-11-16 23:46:02 +03:00
|
|
|
semantically, there is no difference between a
|
|
|
|
field not present in a table or a field with value \nil.
|
2000-08-09 23:09:20 +04:00
|
|
|
Therefore, \verb|next| only considers fields with non-\nil\ values.
|
1997-01-23 19:17:53 +03:00
|
|
|
The order in which the indices are enumerated is not specified,
|
1998-01-02 21:34:00 +03:00
|
|
|
\emph{even for numeric indices}
|
1999-02-05 15:15:07 +03:00
|
|
|
(to traverse a table in numeric order,
|
2000-11-07 15:44:44 +03:00
|
|
|
use a numerical \rwd{for} or the function \verb|foreachi|).
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
The behavior of \verb|next| is \emph{undefined} if you change
|
|
|
|
the table during the traversal.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{print (e1, e2, ...)}}\DefLIB{print}
|
1998-08-25 00:14:56 +04:00
|
|
|
Receives any number of arguments,
|
2001-01-29 22:33:55 +03:00
|
|
|
and prints their values in \verb|stdout|,
|
|
|
|
using the strings returned by \verb|tostring|.
|
1995-11-16 23:46:02 +03:00
|
|
|
This function is not intended for formatted output,
|
1998-06-18 21:36:27 +04:00
|
|
|
but only as a quick way to show a value,
|
2001-09-24 19:54:36 +04:00
|
|
|
typically for debugging.
|
|
|
|
For formatted output, see \verb|format| \see{format}.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{rawget (table, index)}}\DefLIB{rawget}
|
1997-06-17 22:45:16 +04:00
|
|
|
Gets the real value of \verb|table[index]|,
|
|
|
|
without invoking any tag method.
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|table| must be a table;
|
|
|
|
\verb|index| is any value different from \nil.
|
1997-06-17 22:45:16 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{rawset (table, index, value)}}\DefLIB{rawset}
|
1998-06-18 21:36:27 +04:00
|
|
|
Sets the real value of \verb|table[index]| to \verb|value|,
|
1997-06-17 22:45:16 +04:00
|
|
|
without invoking any tag method.
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|table| must be a table;
|
|
|
|
\verb|index| is any value different from \nil;
|
1997-06-17 22:45:16 +04:00
|
|
|
and \verb|value| is any Lua value.
|
|
|
|
|
2002-06-06 16:49:28 +04:00
|
|
|
\subsubsection*{\ff \T{require (packagename)}}\DefLIB{require}
|
|
|
|
|
|
|
|
Loads the given package.
|
|
|
|
The function starts by looking into the table \IndexVerb{_LOADED}
|
|
|
|
whether \verb|packagename| is already loaded.
|
|
|
|
If it is, then \verb|require| is done.
|
|
|
|
Otherwise, it searches a path looking for a file to load.
|
|
|
|
|
|
|
|
If the global variable \IndexVerb{LUA_PATH} is a string,
|
|
|
|
this string is the path.
|
|
|
|
Otherwise, \verb|require| tries the environment variable \verb|LUA_PATH|.
|
|
|
|
In the last resort, it uses a predefined path.
|
|
|
|
|
|
|
|
The path is a sequence of \emph{templates} separated by semicolons.
|
|
|
|
For each template, \verb|require| will change an eventual interrogation
|
|
|
|
mark in the template to \verb|packagename|,
|
|
|
|
and then will try to load the resulting file name.
|
|
|
|
So, for instance, if the path is
|
|
|
|
\begin{verbatim}
|
|
|
|
"./?.lua;./?.lc;/usr/local/?/init.lua;/lasttry"
|
|
|
|
\end{verbatim}
|
|
|
|
a \verb|require "mod"| will try to load the files
|
|
|
|
\verb|./mod.lua|,
|
|
|
|
\verb|./mod.lc|,
|
|
|
|
\verb|/usr/local/mod/init.lua|,
|
|
|
|
and \verb|/lasttry|, in that order.
|
|
|
|
|
|
|
|
The function stops the search as soon as it can load a file,
|
|
|
|
and then it runs the file.
|
|
|
|
If there is any error loading or running the file,
|
|
|
|
or if it cannot find any file in the path,
|
|
|
|
then \verb|require| signals an error.
|
|
|
|
Otherwise, it marks in table \verb|_LOADED|
|
|
|
|
that the package is loaded, and returns.
|
|
|
|
|
|
|
|
While running a packaged file,
|
|
|
|
\verb|require| defines the global variable \IndexVerb{_REQUIREDNAME}
|
|
|
|
with the package name.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{sort (table [, comp])}}\DefLIB{sort}
|
2000-05-12 23:19:18 +04:00
|
|
|
Sorts table elements in a given order, \emph{in-place},
|
|
|
|
from \verb|table[1]| to \verb|table[n]|,
|
|
|
|
where \verb|n| is the result of \verb|getn(table)| \see{getn}.
|
|
|
|
If \verb|comp| is given,
|
2000-11-07 15:44:44 +03:00
|
|
|
then it must be a function that receives two table elements,
|
2002-02-15 00:48:32 +03:00
|
|
|
and returns true
|
2000-11-07 15:44:44 +03:00
|
|
|
when the first is less than the second
|
2001-09-24 19:54:36 +04:00
|
|
|
(so that \verb|not comp(a[i+1],a[i])| will be true after the sort).
|
2000-05-12 23:19:18 +04:00
|
|
|
If \verb|comp| is not given,
|
2000-11-07 15:44:44 +03:00
|
|
|
then the standard Lua operator \verb|<| is used instead.
|
1998-11-13 19:48:48 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
The sort algorithm is \emph{not} stable
|
2000-08-09 23:09:20 +04:00
|
|
|
(that is, elements considered equal by the given order
|
|
|
|
may have their relative positions changed by the sort).
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{tonumber (e [, base])}}\DefLIB{tonumber}
|
|
|
|
Tries to convert its argument to a number.
|
2000-05-12 23:19:18 +04:00
|
|
|
If the argument is already a number or a string convertible
|
|
|
|
to a number, then \verb|tonumber| returns that number;
|
|
|
|
otherwise, it returns \nil.
|
1998-11-13 19:48:48 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
An optional argument specifies the base to interpret the numeral.
|
|
|
|
The base may be any integer between 2 and 36, inclusive.
|
2001-09-24 19:54:36 +04:00
|
|
|
In bases above~10, the letter `A' (in either upper or lower case)
|
2000-05-12 23:19:18 +04:00
|
|
|
represents~10, `B' represents~11, and so forth, with `Z' representing 35.
|
|
|
|
In base 10 (the default), the number may have a decimal part,
|
|
|
|
as well as an optional exponent part \see{coercion}.
|
|
|
|
In other bases, only unsigned integers are accepted.
|
1998-11-13 19:48:48 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{tostring (e)}}\DefLIB{tostring}
|
2000-05-12 23:19:18 +04:00
|
|
|
Receives an argument of any type and
|
|
|
|
converts it to a string in a reasonable format.
|
2000-08-09 23:09:20 +04:00
|
|
|
For complete control of how numbers are converted,
|
2001-09-24 19:54:36 +04:00
|
|
|
use \verb|format| \see{format}.
|
1998-11-13 19:48:48 +03:00
|
|
|
|
|
|
|
|
2000-12-28 20:25:45 +03:00
|
|
|
\subsubsection*{\ff \T{tinsert (table, [pos,] value)}}\DefLIB{tinsert}
|
1999-02-05 15:15:07 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Inserts element \verb|value| at position \verb|pos| in \verb|table|,
|
|
|
|
shifting other elements up to open space, if necessary.
|
2000-04-14 21:47:55 +04:00
|
|
|
The default value for \verb|pos| is \verb|n+1|,
|
|
|
|
where \verb|n| is the result of \verb|getn(table)| \see{getn},
|
1999-02-05 15:15:07 +03:00
|
|
|
so that a call \verb|tinsert(t,x)| inserts \verb|x| at the end
|
|
|
|
of table \verb|t|.
|
2000-05-12 23:19:18 +04:00
|
|
|
This function also sets or increments the field \verb|n| of the table
|
1999-02-05 15:15:07 +03:00
|
|
|
to \verb|n+1|.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{tremove (table [, pos])}}\DefLIB{tremove}
|
1999-02-05 15:15:07 +03:00
|
|
|
|
|
|
|
Removes from \verb|table| the element at position \verb|pos|,
|
2001-09-24 19:54:36 +04:00
|
|
|
shifting other elements down to close the space, if necessary.
|
1999-02-05 15:15:07 +03:00
|
|
|
Returns the value of the removed element.
|
2000-05-12 23:19:18 +04:00
|
|
|
The default value for \verb|pos| is \verb|n|,
|
|
|
|
where \verb|n| is the result of \verb|getn(table)| \see{getn},
|
1999-02-05 15:15:07 +03:00
|
|
|
so that a call \verb|tremove(t)| removes the last element
|
|
|
|
of table \verb|t|.
|
2000-05-12 23:19:18 +04:00
|
|
|
This function also sets or decrements the field \verb|n| of the table
|
1999-02-05 15:15:07 +03:00
|
|
|
to \verb|n-1|.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{type (v)}}\DefLIB{type}\label{pdf-type}
|
2002-02-15 00:48:32 +03:00
|
|
|
Returns the type of its only argument, coded as a string.
|
|
|
|
The possible results of this function are
|
|
|
|
\verb|"nil"| (a string, not the value \nil),
|
|
|
|
\verb|"number"|,
|
|
|
|
\verb|"string"|,
|
|
|
|
\verb|"table"|,
|
|
|
|
\verb|"function"|,
|
|
|
|
and \verb|"userdata"|.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
|
|
|
\subsubsection*{\ff \T{unpack (list)}}\DefLIB{unpack}
|
|
|
|
Returns all elements from the given list.
|
|
|
|
This function is equivalent to
|
|
|
|
\begin{verbatim}
|
|
|
|
return list[1], list[2], ..., list[n]
|
|
|
|
\end{verbatim}
|
|
|
|
except that the above code can be valid only for a fixed \M{n}.
|
2001-09-24 19:54:36 +04:00
|
|
|
The number \M{n} of returned values
|
|
|
|
is the result of \verb|getn(list)| \seepage{getn}.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
\subsection{String Manipulation}
|
|
|
|
This library provides generic functions for string manipulation,
|
1996-11-01 20:02:10 +03:00
|
|
|
such as finding and extracting substrings and pattern matching.
|
2000-09-18 23:41:16 +04:00
|
|
|
When indexing a string in Lua, the first character is at position~1
|
1998-03-30 22:17:55 +04:00
|
|
|
(not at~0, as in C).
|
2001-09-24 19:54:36 +04:00
|
|
|
Indices are allowed to be negative and are interpreted as indexing backwards,
|
2000-11-07 15:44:44 +03:00
|
|
|
from the end of the string. Thus, the last character is at position \Math{-1},
|
|
|
|
and so on.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{strbyte (s [, i])}}\DefLIB{strbyte}
|
|
|
|
Returns the internal numerical code of the \M{i}-th character of \verb|s|.
|
|
|
|
If \verb|i| is absent, then it is assumed to be~1.
|
|
|
|
\verb|i| may be negative.
|
2000-05-12 23:19:18 +04:00
|
|
|
|
|
|
|
\NOTE
|
2000-09-18 23:41:16 +04:00
|
|
|
Numerical codes are not necessarily portable across platforms.
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{strchar (i1, i2, \ldots)}}\DefLIB{strchar}
|
2000-05-12 23:19:18 +04:00
|
|
|
Receives 0 or more integers.
|
|
|
|
Returns a string with length equal to the number of arguments,
|
2001-09-24 19:54:36 +04:00
|
|
|
in which each character has the internal numerical code equal
|
2000-05-12 23:19:18 +04:00
|
|
|
to its correspondent argument.
|
|
|
|
|
|
|
|
\NOTE
|
2000-09-18 23:41:16 +04:00
|
|
|
Numerical codes are not necessarily portable across platforms.
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsubsection*{\ff \T{strfind (s, pattern [, init [, plain]])}}\DefLIB{strfind}
|
1998-08-25 00:14:56 +04:00
|
|
|
Looks for the first \emph{match} of
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|pattern| in the string \verb|s|.
|
2000-11-07 15:44:44 +03:00
|
|
|
If it finds one, then \verb|strfind| returns the indices of \verb|s|
|
1997-06-19 00:14:52 +04:00
|
|
|
where this occurrence starts and ends;
|
1996-11-01 20:02:10 +03:00
|
|
|
otherwise, it returns \nil.
|
2000-05-12 23:19:18 +04:00
|
|
|
If the pattern specifies captures (see \verb|gsub| below),
|
1996-11-01 20:02:10 +03:00
|
|
|
the captured strings are returned as extra results.
|
2000-11-07 15:44:44 +03:00
|
|
|
A third, optional numerical argument \verb|init| specifies
|
|
|
|
where to start the search;
|
|
|
|
its default value is~1, and may be negative.
|
2002-02-15 00:48:32 +03:00
|
|
|
A value of \True\ as a fourth, optional argument \verb|plain|
|
1996-11-01 20:02:10 +03:00
|
|
|
turns off the pattern matching facilities,
|
1997-06-19 00:14:52 +04:00
|
|
|
so the function does a plain ``find substring'' operation,
|
|
|
|
with no characters in \verb|pattern| being considered ``magic''.
|
2000-11-07 15:44:44 +03:00
|
|
|
Note that if \verb|plain| is given, then \verb|init| must be given too.
|
1996-11-01 20:02:10 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{strlen (s)}}\DefLIB{strlen}
|
1995-11-16 23:46:02 +03:00
|
|
|
Receives a string and returns its length.
|
2000-05-12 23:19:18 +04:00
|
|
|
The empty string \verb|""| has length 0.
|
2000-09-18 23:41:16 +04:00
|
|
|
Embedded zeros are counted,
|
|
|
|
and so \verb|"a\000b\000c"| has length 5.
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{strlower (s)}}\DefLIB{strlower}
|
2000-05-12 23:19:18 +04:00
|
|
|
Receives a string and returns a copy of that string with all
|
2001-09-24 19:54:36 +04:00
|
|
|
uppercase letters changed to lowercase.
|
2000-05-12 23:19:18 +04:00
|
|
|
All other characters are left unchanged.
|
2001-09-24 19:54:36 +04:00
|
|
|
The definition of what an uppercase letter is depends on the current locale.
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{strrep (s, n)}}\DefLIB{strrep}
|
2000-05-12 23:19:18 +04:00
|
|
|
Returns a string that is the concatenation of \verb|n| copies of
|
|
|
|
the string \verb|s|.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{strsub (s, i [, j])}}\DefLIB{strsub}
|
1997-06-09 22:16:33 +04:00
|
|
|
Returns another string, which is a substring of \verb|s|,
|
2000-11-07 15:44:44 +03:00
|
|
|
starting at \verb|i| and running until \verb|j|;
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|i| and \verb|j| may be negative.
|
2000-11-07 15:44:44 +03:00
|
|
|
If \verb|j| is absent, then it is assumed to be equal to \Math{-1}
|
1997-06-17 22:45:16 +04:00
|
|
|
(which is the same as the string length).
|
|
|
|
In particular,
|
|
|
|
the call \verb|strsub(s,1,j)| returns a prefix of \verb|s|
|
1997-06-09 22:16:33 +04:00
|
|
|
with length \verb|j|,
|
1997-06-17 22:45:16 +04:00
|
|
|
and the call \verb|strsub(s, -i)| returns a suffix of \verb|s|
|
|
|
|
with length \verb|i|.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{strupper (s)}}\DefLIB{strupper}
|
1995-11-16 23:46:02 +03:00
|
|
|
Receives a string and returns a copy of that string with all
|
2001-09-24 19:54:36 +04:00
|
|
|
lowercase letters changed to uppercase.
|
1995-11-16 23:46:02 +03:00
|
|
|
All other characters are left unchanged.
|
2001-09-24 19:54:36 +04:00
|
|
|
The definition of what a lowercase letter is depends on the current locale.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{format (formatstring, e1, e2, \ldots)}}\DefLIB{format}
|
1996-02-06 00:32:19 +03:00
|
|
|
\label{format}
|
1998-08-25 00:14:56 +04:00
|
|
|
Returns a formatted version of its variable number of arguments
|
1997-03-07 01:19:08 +03:00
|
|
|
following the description given in its first argument (which must be a string).
|
1997-06-09 22:16:33 +04:00
|
|
|
The format string follows the same rules as the \verb|printf| family of
|
2000-05-12 23:19:18 +04:00
|
|
|
standard C~functions.
|
1996-08-29 00:46:26 +04:00
|
|
|
The only differences are that the options/modifiers
|
1997-06-09 22:16:33 +04:00
|
|
|
\verb|*|, \verb|l|, \verb|L|, \verb|n|, \verb|p|,
|
|
|
|
and \verb|h| are not supported,
|
|
|
|
and there is an extra option, \verb|q|.
|
2000-05-12 23:19:18 +04:00
|
|
|
The \verb|q| option formats a string in a form suitable to be safely read
|
1999-02-05 15:15:07 +03:00
|
|
|
back by the Lua interpreter:
|
|
|
|
The string is written between double quotes,
|
2000-05-12 23:19:18 +04:00
|
|
|
and all double quotes, returns, and backslashes in the string
|
1996-03-14 20:45:01 +03:00
|
|
|
are correctly escaped when written.
|
1996-11-01 20:02:10 +03:00
|
|
|
For instance, the call
|
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
format('%q', 'a string with "quotes" and \n new line')
|
1996-11-01 20:02:10 +03:00
|
|
|
\end{verbatim}
|
|
|
|
will produce the string:
|
|
|
|
\begin{verbatim}
|
|
|
|
"a string with \"quotes\" and \
|
|
|
|
new line"
|
|
|
|
\end{verbatim}
|
1996-03-14 20:45:01 +03:00
|
|
|
|
1997-06-09 22:16:33 +04:00
|
|
|
The options \verb|c|, \verb|d|, \verb|E|, \verb|e|, \verb|f|,
|
1997-09-16 23:01:10 +04:00
|
|
|
\verb|g|, \verb|G|, \verb|i|, \verb|o|, \verb|u|, \verb|X|, and \verb|x| all
|
1996-11-01 20:02:10 +03:00
|
|
|
expect a number as argument,
|
1997-06-09 22:16:33 +04:00
|
|
|
whereas \verb|q| and \verb|s| expect a string.
|
1999-02-05 15:15:07 +03:00
|
|
|
The \verb|*| modifier can be simulated by building
|
1997-01-23 19:17:53 +03:00
|
|
|
the appropriate format string.
|
|
|
|
For example, \verb|"%*g"| can be simulated with
|
|
|
|
\verb|"%"..width.."g"|.
|
1996-01-29 20:08:23 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\NOTE
|
2001-07-19 17:36:18 +04:00
|
|
|
String values to be formatted with
|
|
|
|
\verb|%s| cannot contain embedded zeros.
|
1998-03-30 22:17:55 +04:00
|
|
|
|
1998-01-02 21:34:00 +03:00
|
|
|
\subsubsection*{\ff \T{gsub (s, pat, repl [, n])}}
|
2000-11-07 15:44:44 +03:00
|
|
|
\DefLIB{gsub}
|
|
|
|
Returns a copy of \verb|s|
|
2000-05-12 23:19:18 +04:00
|
|
|
in which all occurrences of the pattern \verb|pat| have been
|
1997-06-09 22:16:33 +04:00
|
|
|
replaced by a replacement string specified by \verb|repl|.
|
2000-11-07 15:44:44 +03:00
|
|
|
\verb|gsub| also returns, as a second value,
|
1996-11-01 20:02:10 +03:00
|
|
|
the total number of substitutions made.
|
|
|
|
|
1997-06-09 22:16:33 +04:00
|
|
|
If \verb|repl| is a string, then its value is used for replacement.
|
2001-09-24 19:54:36 +04:00
|
|
|
Any sequence in \verb|repl| of the form \verb|%|\M{n},
|
|
|
|
with \M{n} between 1 and 9,
|
2000-05-12 23:19:18 +04:00
|
|
|
stands for the value of the \M{n}-th captured substring.
|
1996-11-01 20:02:10 +03:00
|
|
|
|
1997-06-09 22:16:33 +04:00
|
|
|
If \verb|repl| is a function, then this function is called every time a
|
1998-01-02 21:34:00 +03:00
|
|
|
match occurs, with all captured substrings passed as arguments,
|
2002-06-06 16:49:28 +04:00
|
|
|
in order (see below);
|
|
|
|
if the pattern specifies no captures,
|
|
|
|
then the whole match is passed as a sole argument.
|
1996-11-01 20:02:10 +03:00
|
|
|
If the value returned by this function is a string,
|
1997-01-23 19:17:53 +03:00
|
|
|
then it is used as the replacement string;
|
1996-11-01 20:02:10 +03:00
|
|
|
otherwise, the replacement string is the empty string.
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
The last, optional parameter \verb|n| limits
|
1996-11-01 20:02:10 +03:00
|
|
|
the maximum number of substitutions to occur.
|
1997-06-09 22:16:33 +04:00
|
|
|
For instance, when \verb|n| is 1 only the first occurrence of
|
|
|
|
\verb|pat| is replaced.
|
1996-11-01 20:02:10 +03:00
|
|
|
|
1999-04-07 20:40:04 +04:00
|
|
|
Here are some examples:
|
1996-11-01 20:02:10 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
x = gsub("hello world", "(%w+)", "%1 %1")
|
|
|
|
--> x="hello hello world world"
|
1998-01-02 21:34:00 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
x = gsub("hello world", "(%w+)", "%1 %1", 1)
|
|
|
|
--> x="hello hello world"
|
1997-06-19 00:14:52 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
x = gsub("hello world from Lua", "(%w+)%s*(%w+)", "%2 %1")
|
|
|
|
--> x="world hello Lua from"
|
1998-06-18 21:36:27 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
x = gsub("home = $HOME, user = $USER", "%$(%w+)", getenv)
|
|
|
|
--> x="home = /home/roberto, user = roberto" (for instance)
|
1997-06-19 00:14:52 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
x = gsub("4+5 = $return 4+5$", "%$(.-)%$", dostring)
|
|
|
|
--> x="4+5 = 9"
|
1997-06-19 00:14:52 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
local t = {name="Lua", version="4.1"}
|
2001-10-31 21:06:05 +03:00
|
|
|
x = gsub("$name - $version", "%$(%w+)", function (v) return t[v] end)
|
2001-09-24 19:54:36 +04:00
|
|
|
--> x="Lua - 4.1"
|
1997-06-19 00:14:52 +04:00
|
|
|
|
2001-10-31 21:06:05 +03:00
|
|
|
local t = {}
|
2002-06-06 16:49:28 +04:00
|
|
|
gsub("first second word", "%w+", function (w) tinsert(t, w) end)
|
2000-09-18 23:41:16 +04:00
|
|
|
--> t={"first", "second", "word"; n=3}
|
1996-11-01 20:02:10 +03:00
|
|
|
\end{verbatim}
|
|
|
|
|
1997-06-19 00:14:52 +04:00
|
|
|
|
1996-11-01 20:02:10 +03:00
|
|
|
\subsubsection*{Patterns} \label{pm}
|
|
|
|
|
1996-11-06 23:26:56 +03:00
|
|
|
\paragraph{Character Class:}
|
|
|
|
a \Def{character class} is used to represent a set of characters.
|
1996-11-01 20:02:10 +03:00
|
|
|
The following combinations are allowed in describing a character class:
|
2001-09-24 19:54:36 +04:00
|
|
|
\begin{description}\leftskip=20pt
|
2001-07-19 17:36:18 +04:00
|
|
|
\item[\emph{x}] (where \emph{x} is not one of the magic characters
|
1999-05-12 00:46:28 +04:00
|
|
|
\verb|^$()%.[]*+-?|)
|
1997-07-01 21:41:34 +04:00
|
|
|
--- represents the character \emph{x} itself.
|
1998-06-18 21:36:27 +04:00
|
|
|
\item[\T{.}] --- (a dot) represents all characters.
|
1997-07-01 21:41:34 +04:00
|
|
|
\item[\T{\%a}] --- represents all letters.
|
1999-02-05 15:15:07 +03:00
|
|
|
\item[\T{\%c}] --- represents all control characters.
|
1997-07-01 21:41:34 +04:00
|
|
|
\item[\T{\%d}] --- represents all digits.
|
2001-09-24 19:54:36 +04:00
|
|
|
\item[\T{\%l}] --- represents all lowercase letters.
|
1999-02-05 15:15:07 +03:00
|
|
|
\item[\T{\%p}] --- represents all punctuation characters.
|
1997-07-01 21:41:34 +04:00
|
|
|
\item[\T{\%s}] --- represents all space characters.
|
2001-09-24 19:54:36 +04:00
|
|
|
\item[\T{\%u}] --- represents all uppercase letters.
|
1997-07-01 21:41:34 +04:00
|
|
|
\item[\T{\%w}] --- represents all alphanumeric characters.
|
1999-10-04 21:51:04 +04:00
|
|
|
\item[\T{\%x}] --- represents all hexadecimal digits.
|
1999-02-05 15:15:07 +03:00
|
|
|
\item[\T{\%z}] --- represents the character with representation 0.
|
2000-08-09 23:09:20 +04:00
|
|
|
\item[\T{\%\M{x}}] (where \M{x} is any non-alphanumeric character) ---
|
1997-06-09 22:16:33 +04:00
|
|
|
represents the character \M{x}.
|
2000-11-07 15:44:44 +03:00
|
|
|
This is the standard way to escape the magic characters.
|
|
|
|
We recommend that any punctuation character (even the non magic)
|
2000-05-12 23:19:18 +04:00
|
|
|
should be preceded by a \verb|%|
|
2000-08-09 23:09:20 +04:00
|
|
|
when used to represent itself in a pattern.
|
1999-10-04 21:51:04 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\item[\T{[\M{set}]}] ---
|
2000-05-12 23:19:18 +04:00
|
|
|
represents the class which is the union of all
|
2001-09-24 19:54:36 +04:00
|
|
|
characters in \M{set}.
|
1996-11-01 20:02:10 +03:00
|
|
|
A range of characters may be specified by
|
1998-06-18 21:36:27 +04:00
|
|
|
separating the end characters of the range with a \verb|-|.
|
2000-05-12 23:19:18 +04:00
|
|
|
All classes \verb|%|\emph{x} described above may also be used as
|
2001-09-24 19:54:36 +04:00
|
|
|
components in \M{set}.
|
|
|
|
All other characters in \M{set} represent themselves.
|
2000-05-12 23:19:18 +04:00
|
|
|
For example, \verb|[%w_]| (or \verb|[_%w]|)
|
1999-10-04 21:51:04 +04:00
|
|
|
represents all alphanumeric characters plus the underscore,
|
|
|
|
\verb|[0-7]| represents the octal digits,
|
|
|
|
and \verb|[0-7%l%-]| represents the octal digits plus
|
2001-09-24 19:54:36 +04:00
|
|
|
the lowercase letters plus the \verb|-| character.
|
1999-10-04 21:51:04 +04:00
|
|
|
|
|
|
|
The interaction between ranges and classes is not defined.
|
|
|
|
Therefore, patterns like \verb|[%a-z]| or \verb|[a-%%]|
|
|
|
|
have no meaning.
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\item[\T{[\^\null\M{set}]}] ---
|
|
|
|
represents the complement of \M{set},
|
|
|
|
where \M{set} is interpreted as above.
|
1996-11-01 20:02:10 +03:00
|
|
|
\end{description}
|
1999-02-05 15:15:07 +03:00
|
|
|
For all classes represented by single letters (\verb|%a|, \verb|%c|, \ldots),
|
2001-09-24 19:54:36 +04:00
|
|
|
the corresponding uppercase letter represents the complement of the class.
|
1999-02-05 15:15:07 +03:00
|
|
|
For instance, \verb|%S| represents all non-space characters.
|
1996-11-01 20:02:10 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
The definitions of letter, space, etc.\ depend on the current locale.
|
1997-07-02 21:09:48 +04:00
|
|
|
In particular, the class \verb|[a-z]| may not be equivalent to \verb|%l|.
|
2000-04-14 21:47:55 +04:00
|
|
|
The second form should be preferred for portability.
|
1997-07-02 21:09:48 +04:00
|
|
|
|
1996-11-06 23:26:56 +03:00
|
|
|
\paragraph{Pattern Item:}
|
1999-05-12 00:46:28 +04:00
|
|
|
a \Def{pattern item} may be
|
1997-02-21 18:19:37 +03:00
|
|
|
\begin{itemize}
|
|
|
|
\item
|
|
|
|
a single character class,
|
|
|
|
which matches any single character in the class;
|
|
|
|
\item
|
1997-06-09 22:16:33 +04:00
|
|
|
a single character class followed by \verb|*|,
|
1997-02-21 18:19:37 +03:00
|
|
|
which matches 0 or more repetitions of characters in the class.
|
1999-05-12 00:46:28 +04:00
|
|
|
These repetition items will always match the longest possible sequence;
|
|
|
|
\item
|
|
|
|
a single character class followed by \verb|+|,
|
|
|
|
which matches 1 or more repetitions of characters in the class.
|
|
|
|
These repetition items will always match the longest possible sequence;
|
1997-02-21 18:19:37 +03:00
|
|
|
\item
|
1997-06-09 22:16:33 +04:00
|
|
|
a single character class followed by \verb|-|,
|
1997-02-21 18:19:37 +03:00
|
|
|
which also matches 0 or more repetitions of characters in the class.
|
1997-06-09 22:16:33 +04:00
|
|
|
Unlike \verb|*|,
|
2001-09-24 19:54:36 +04:00
|
|
|
these repetition items will always match the \emph{shortest} possible sequence;
|
1997-02-21 18:19:37 +03:00
|
|
|
\item
|
1997-06-09 22:16:33 +04:00
|
|
|
a single character class followed by \verb|?|,
|
1997-02-21 18:19:37 +03:00
|
|
|
which matches 0 or 1 occurrence of a character in the class;
|
|
|
|
\item
|
1997-07-02 21:09:48 +04:00
|
|
|
\T{\%\M{n}}, for \M{n} between 1 and 9;
|
2000-05-12 23:19:18 +04:00
|
|
|
such item matches a sub-string equal to the \M{n}-th captured string
|
1997-02-21 18:19:37 +03:00
|
|
|
(see below);
|
|
|
|
\item
|
1997-07-02 21:09:48 +04:00
|
|
|
\T{\%b\M{xy}}, where \M{x} and \M{y} are two distinct characters;
|
2000-05-12 23:19:18 +04:00
|
|
|
such item matches strings that start with~\M{x}, end with~\M{y},
|
1997-07-01 21:41:34 +04:00
|
|
|
and where the \M{x} and \M{y} are \emph{balanced}.
|
2000-05-12 23:19:18 +04:00
|
|
|
This means that, if one reads the string from left to right,
|
|
|
|
counting \Math{+1} for an \M{x} and \Math{-1} for a \M{y},
|
2000-11-07 15:44:44 +03:00
|
|
|
the ending \M{y} is the first \M{y} where the count reaches 0.
|
1997-06-19 00:14:52 +04:00
|
|
|
For instance, the item \verb|%b()| matches expressions with
|
1997-02-21 18:19:37 +03:00
|
|
|
balanced parentheses.
|
|
|
|
\end{itemize}
|
1996-11-01 20:02:10 +03:00
|
|
|
|
1996-11-06 23:26:56 +03:00
|
|
|
\paragraph{Pattern:}
|
|
|
|
a \Def{pattern} is a sequence of pattern items.
|
1997-06-09 22:16:33 +04:00
|
|
|
A \verb|^| at the beginning of a pattern anchors the match at the
|
1996-11-01 20:02:10 +03:00
|
|
|
beginning of the subject string.
|
1997-06-09 22:16:33 +04:00
|
|
|
A \verb|$| at the end of a pattern anchors the match at the
|
1996-11-01 20:02:10 +03:00
|
|
|
end of the subject string.
|
2000-05-12 23:19:18 +04:00
|
|
|
At other positions,
|
|
|
|
\verb|^| and \verb|$| have no special meaning and represent themselves.
|
1996-11-01 20:02:10 +03:00
|
|
|
|
1997-02-21 18:19:37 +03:00
|
|
|
\paragraph{Captures:}
|
2001-09-24 19:54:36 +04:00
|
|
|
A pattern may contain sub-patterns enclosed in parentheses;
|
2000-11-07 15:44:44 +03:00
|
|
|
they describe \Def{captures}.
|
1996-11-01 20:02:10 +03:00
|
|
|
When a match succeeds, the sub-strings of the subject string
|
1997-07-01 21:41:34 +04:00
|
|
|
that match captures are stored (\emph{captured}) for future use.
|
1996-11-06 23:26:56 +03:00
|
|
|
Captures are numbered according to their left parentheses.
|
1997-01-23 19:17:53 +03:00
|
|
|
For instance, in the pattern \verb|"(a*(.)%w(%s*))"|,
|
1997-02-21 18:19:37 +03:00
|
|
|
the part of the string matching \verb|"a*(.)%w(%s*)"| is
|
1998-06-18 21:36:27 +04:00
|
|
|
stored as the first capture (and therefore has number~1);
|
|
|
|
the character matching \verb|.| is captured with number~2,
|
|
|
|
and the part matching \verb|%s*| has number~3.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\NOTE
|
2000-11-07 15:44:44 +03:00
|
|
|
A pattern cannot contain embedded zeros. Use \verb|%z| instead.
|
2000-04-14 21:47:55 +04:00
|
|
|
|
1997-07-02 21:09:48 +04:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
\subsection{Mathematical Functions} \label{mathlib}
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
This library is an interface to most functions of the standard C~math library.
|
|
|
|
(Some have slightly different names.)
|
|
|
|
In addition,
|
|
|
|
it registers a tag method for the binary exponentiation operator \verb|^| that
|
1997-06-19 01:11:53 +04:00
|
|
|
returns \Math{x^y} when applied to numbers \verb|x^y|.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
The library provides the following functions:
|
2000-11-07 15:44:44 +03:00
|
|
|
\DefLIB{abs}\DefLIB{acos}\DefLIB{asin}\DefLIB{atan}
|
|
|
|
\DefLIB{atan2}\DefLIB{ceil}\DefLIB{cos}\DefLIB{def}\DefLIB{exp}
|
|
|
|
\DefLIB{floor}\DefLIB{log}\DefLIB{log10}\DefLIB{max}\DefLIB{min}
|
|
|
|
\DefLIB{mod}\DefLIB{rad}\DefLIB{sin}\DefLIB{sqrt}\DefLIB{tan}
|
|
|
|
\DefLIB{frexp}\DefLIB{ldexp}\DefLIB{random}\DefLIB{randomseed}
|
|
|
|
\begin{verbatim}
|
|
|
|
abs acos asin atan atan2 ceil cos deg exp floor log log10
|
2000-09-18 23:41:16 +04:00
|
|
|
max min mod rad sin sqrt tan frexp ldexp random randomseed
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{verbatim}
|
2000-11-07 15:44:44 +03:00
|
|
|
plus a global variable \IndexLIB{PI}.
|
1995-11-16 23:46:02 +03:00
|
|
|
Most of them
|
2000-05-12 23:19:18 +04:00
|
|
|
are only interfaces to the homonymous functions in the C~library,
|
1995-11-16 23:46:02 +03:00
|
|
|
except that, for the trigonometric functions,
|
1997-07-01 21:41:34 +04:00
|
|
|
all angles are expressed in \emph{degrees}, not radians.
|
2000-11-07 15:44:44 +03:00
|
|
|
The functions \verb|deg| and \verb|rad| can be used to convert
|
1998-01-02 21:34:00 +03:00
|
|
|
between radians and degrees.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1997-06-09 22:16:33 +04:00
|
|
|
The function \verb|max| returns the maximum
|
1995-11-16 23:46:02 +03:00
|
|
|
value of its numeric arguments.
|
1997-06-09 22:16:33 +04:00
|
|
|
Similarly, \verb|min| computes the minimum.
|
2000-05-12 23:19:18 +04:00
|
|
|
Both can be used with 1, 2, or more arguments.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1997-06-09 22:16:33 +04:00
|
|
|
The functions \verb|random| and \verb|randomseed| are interfaces to
|
|
|
|
the simple random generator functions \verb|rand| and \verb|srand|,
|
2001-09-24 19:54:36 +04:00
|
|
|
provided by ANSI~C.
|
2000-05-12 23:19:18 +04:00
|
|
|
(No guarantees can be given for their statistical properties.)
|
2001-09-24 19:54:36 +04:00
|
|
|
When called without arguments,
|
|
|
|
\verb|random| returns a pseudo-random real number in the range \Math{[0,1)}.
|
1997-07-31 02:15:18 +04:00
|
|
|
When called with a number \Math{n},
|
1998-03-30 22:17:55 +04:00
|
|
|
\verb|random| returns a pseudo-random integer in the range \Math{[1,n]}.
|
1999-02-05 15:15:07 +03:00
|
|
|
When called with two arguments, \Math{l} and \Math{u},
|
|
|
|
\verb|random| returns a pseudo-random integer in the range \Math{[l,u]}.
|
1996-02-09 20:21:27 +03:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
\subsection{Input and Output Facilities} \label{libio}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1999-03-29 18:21:37 +04:00
|
|
|
All input and output operations in Lua are done, by default,
|
2001-09-24 19:54:36 +04:00
|
|
|
over two \Def{file handles}: one for reading and one for writing.
|
1997-06-27 00:39:10 +04:00
|
|
|
These handles are stored in two Lua global variables,
|
|
|
|
called \verb|_INPUT| and \verb|_OUTPUT|.
|
|
|
|
The global variables
|
2000-05-12 23:19:18 +04:00
|
|
|
\verb|_STDIN|, \verb|_STDOUT|, and \verb|_STDERR|
|
1997-06-27 00:39:10 +04:00
|
|
|
are initialized with file descriptors for
|
2000-11-07 15:44:44 +03:00
|
|
|
\verb|stdin|, \verb|stdout|, and \verb|stderr|.
|
1997-06-27 00:39:10 +04:00
|
|
|
Initially, \verb|_INPUT=_STDIN| and \verb|_OUTPUT=_STDOUT|.
|
2000-11-07 15:44:44 +03:00
|
|
|
\DefLIB{_INPUT}\DefLIB{_OUTPUT}
|
|
|
|
\DefLIB{_STDIN}\DefLIB{_STDOUT}\DefLIB{_STDERR}
|
1997-06-27 00:39:10 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
A file handle is a userdata containing the file stream (\verb|FILE*|),
|
1997-06-27 00:39:10 +04:00
|
|
|
and with a distinctive tag created by the I/O library.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
Unless otherwise stated,
|
1996-11-01 20:02:10 +03:00
|
|
|
all I/O functions return \nil\ on failure and
|
|
|
|
some value different from \nil\ on success.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{openfile (filename, mode)}}\DefLIB{openfile}
|
1999-03-29 18:21:37 +04:00
|
|
|
|
|
|
|
This function opens a file,
|
|
|
|
in the mode specified in the string \verb|mode|.
|
|
|
|
It returns a new file handle,
|
|
|
|
or, in case of errors, \nil\ plus a string describing the error.
|
1999-04-07 20:40:04 +04:00
|
|
|
This function does not modify either \verb|_INPUT| or \verb|_OUTPUT|.
|
1999-03-29 18:21:37 +04:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
The \verb|mode| string can be any of the following:
|
2001-09-24 19:54:36 +04:00
|
|
|
\begin{description}\leftskip=20pt
|
2000-04-14 21:47:55 +04:00
|
|
|
\item[``r''] read mode;
|
|
|
|
\item[``w''] write mode;
|
|
|
|
\item[``a''] append mode;
|
|
|
|
\item[``r+''] update mode, all previous data is preserved;
|
|
|
|
\item[``w+''] update mode, all previous data is erased;
|
|
|
|
\item[``a+''] append update mode, previous data is preserved,
|
1999-03-29 18:21:37 +04:00
|
|
|
writing is only allowed at the end of file.
|
|
|
|
\end{description}
|
2000-05-12 23:19:18 +04:00
|
|
|
The \verb|mode| string may also have a \verb|b| at the end,
|
1999-03-29 18:21:37 +04:00
|
|
|
which is needed in some systems to open the file in binary mode.
|
2001-07-19 17:36:18 +04:00
|
|
|
This string is exactly what is used in the standard~C function \verb|fopen|.
|
1999-03-29 18:21:37 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{closefile (handle)}}\DefLIB{closefile}
|
1999-03-29 18:21:37 +04:00
|
|
|
|
|
|
|
This function closes the given file.
|
1999-04-07 20:40:04 +04:00
|
|
|
It does not modify either \verb|_INPUT| or \verb|_OUTPUT|.
|
1999-03-29 18:21:37 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{readfrom (filename)}}\DefLIB{readfrom}
|
1996-11-01 20:02:10 +03:00
|
|
|
|
1997-06-27 00:39:10 +04:00
|
|
|
This function may be called in two ways.
|
2001-07-19 17:36:18 +04:00
|
|
|
When called with a file name, it opens the named file (in text mode),
|
1997-06-27 00:39:10 +04:00
|
|
|
sets its handle as the value of \verb|_INPUT|,
|
|
|
|
and returns this value.
|
1997-01-23 19:17:53 +03:00
|
|
|
It does not close the current input file.
|
1995-11-16 23:46:02 +03:00
|
|
|
When called without parameters,
|
1997-06-27 00:39:10 +04:00
|
|
|
it closes the \verb|_INPUT| file,
|
|
|
|
and restores \verb|stdin| as the value of \verb|_INPUT|.
|
1996-11-01 21:02:53 +03:00
|
|
|
If this function fails, it returns \nil,
|
|
|
|
plus a string describing the error.
|
1996-11-01 20:02:10 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\NOTE
|
2000-11-07 15:44:44 +03:00
|
|
|
If \verb|filename| starts with a \verb-|-,
|
1998-03-30 22:17:55 +04:00
|
|
|
then a \Index{piped input} is opened, via function \IndexVerb{popen}.
|
1997-01-23 19:17:53 +03:00
|
|
|
Not all systems implement pipes.
|
|
|
|
Moreover,
|
1997-06-27 00:39:10 +04:00
|
|
|
the number of files that can be open at the same time is
|
|
|
|
usually limited and depends on the system.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{writeto (filename)}}\DefLIB{writeto}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1997-06-27 00:39:10 +04:00
|
|
|
This function may be called in two ways.
|
1996-11-01 20:02:10 +03:00
|
|
|
When called with a file name,
|
2001-07-19 17:36:18 +04:00
|
|
|
it opens the named file (in text mode),
|
1997-06-27 00:39:10 +04:00
|
|
|
sets its handle as the value of \verb|_OUTPUT|,
|
|
|
|
and returns this value.
|
1997-01-23 19:17:53 +03:00
|
|
|
It does not close the current output file.
|
1998-06-18 21:36:27 +04:00
|
|
|
Note that, if the file already exists,
|
1997-07-01 21:41:34 +04:00
|
|
|
then it will be \emph{completely erased} with this operation.
|
1995-11-16 23:46:02 +03:00
|
|
|
When called without parameters,
|
1997-06-27 00:39:10 +04:00
|
|
|
this function closes the \verb|_OUTPUT| file,
|
|
|
|
and restores \verb|stdout| as the value of \verb|_OUTPUT|.
|
1995-11-16 23:46:02 +03:00
|
|
|
\index{closing a file}
|
1996-11-01 21:02:53 +03:00
|
|
|
If this function fails, it returns \nil,
|
|
|
|
plus a string describing the error.
|
1996-11-01 20:02:10 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\NOTE
|
2000-11-07 15:44:44 +03:00
|
|
|
If \verb|filename| starts with a \verb-|-,
|
2000-09-18 23:41:16 +04:00
|
|
|
then a \Index{piped input} is opened, via function \IndexVerb{popen}.
|
1997-01-23 19:17:53 +03:00
|
|
|
Not all systems implement pipes.
|
|
|
|
Moreover,
|
1997-06-27 00:39:10 +04:00
|
|
|
the number of files that can be open at the same time is
|
|
|
|
usually limited and depends on the system.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{appendto (filename)}}\DefLIB{appendto}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
Opens a file named \verb|filename| (in text mode)
|
2001-09-24 19:54:36 +04:00
|
|
|
sets its handle as the value of \verb|_OUTPUT|,
|
|
|
|
and returns this value.
|
1997-06-09 22:16:33 +04:00
|
|
|
Unlike the \verb|writeto| operation,
|
2000-08-09 23:09:20 +04:00
|
|
|
this function does not erase any previous contents of the file;
|
|
|
|
instead, anything written to the file is appended to its end.
|
1996-11-01 21:02:53 +03:00
|
|
|
If this function fails, it returns \nil,
|
|
|
|
plus a string describing the error.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{remove (filename)}}\DefLIB{remove}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1998-08-25 00:14:56 +04:00
|
|
|
Deletes the file with the given name.
|
1996-11-01 21:02:53 +03:00
|
|
|
If this function fails, it returns \nil,
|
|
|
|
plus a string describing the error.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{rename (name1, name2)}}\DefLIB{rename}
|
1996-03-14 20:45:01 +03:00
|
|
|
|
1998-08-25 00:14:56 +04:00
|
|
|
Renames file named \verb|name1| to \verb|name2|.
|
1996-11-01 21:02:53 +03:00
|
|
|
If this function fails, it returns \nil,
|
|
|
|
plus a string describing the error.
|
1996-03-14 20:45:01 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{flush ([filehandle])}}\DefLIB{flush}
|
1998-08-25 00:14:56 +04:00
|
|
|
|
|
|
|
Saves any written data to the given file.
|
|
|
|
If \verb|filehandle| is not specified,
|
2000-05-12 23:19:18 +04:00
|
|
|
then \verb|flush| flushes all open files.
|
1998-08-25 00:14:56 +04:00
|
|
|
If this function fails, it returns \nil,
|
|
|
|
plus a string describing the error.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{seek (filehandle [, whence] [, offset])}}\DefLIB{seek}
|
1998-08-25 00:14:56 +04:00
|
|
|
|
1999-02-12 22:23:02 +03:00
|
|
|
Sets and gets the file position,
|
|
|
|
measured in bytes from the beginning of the file,
|
1998-08-25 00:14:56 +04:00
|
|
|
to the position given by \verb|offset| plus a base
|
|
|
|
specified by the string \verb|whence|, as follows:
|
2001-09-24 19:54:36 +04:00
|
|
|
\begin{description}\leftskip=20pt
|
2000-04-14 21:47:55 +04:00
|
|
|
\item[``set''] base is position 0 (beginning of the file);
|
|
|
|
\item[``cur''] base is current position;
|
|
|
|
\item[``end''] base is end of file;
|
1998-08-25 00:14:56 +04:00
|
|
|
\end{description}
|
|
|
|
In case of success, function \verb|seek| returns the final file position,
|
|
|
|
measured in bytes from the beginning of the file.
|
2001-09-24 19:54:36 +04:00
|
|
|
If this function fails, it returns \nil,
|
1998-08-25 00:14:56 +04:00
|
|
|
plus a string describing the error.
|
|
|
|
|
|
|
|
The default value for \verb|whence| is \verb|"cur"|,
|
|
|
|
and for \verb|offset| is 0.
|
|
|
|
Therefore, the call \verb|seek(file)| returns the current
|
|
|
|
file position, without changing it;
|
|
|
|
the call \verb|seek(file, "set")| sets the position to the
|
|
|
|
beginning of the file (and returns 0);
|
|
|
|
and the call \verb|seek(file, "end")| sets the position to the
|
|
|
|
end of the file, and returns its size.
|
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
\subsubsection*{\ff \T{tmpfile ()}}\DefLIB{tmpfile}
|
|
|
|
|
|
|
|
Returns a handle for a temporary file.
|
|
|
|
This file is open in read/write mode,
|
|
|
|
and it is automatically removed when the program ends.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{tmpname ()}}\DefLIB{tmpname}
|
1996-03-14 20:45:01 +03:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
Returns a string with a file name that can
|
1996-03-14 20:45:01 +03:00
|
|
|
be used for a temporary file.
|
2000-04-14 21:47:55 +04:00
|
|
|
The file must be explicitly opened before its use
|
|
|
|
and removed when no longer needed.
|
1996-03-14 20:45:01 +03:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
This function is equivalent to the \verb|tmpnam| C~function,
|
|
|
|
and many people (and even some compilers!) advise against its use,
|
2001-07-19 17:36:18 +04:00
|
|
|
because between the time you call the function
|
|
|
|
and the time you open the file,
|
|
|
|
it is possible for another process
|
|
|
|
to create a file with the same name.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{read ([filehandle,] format1, ...)}}\DefLIB{read}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
1998-08-25 00:14:56 +04:00
|
|
|
Reads file \verb|_INPUT|,
|
|
|
|
or \verb|filehandle| if this argument is given,
|
2000-04-14 21:47:55 +04:00
|
|
|
according to the given formats, which specify what to read.
|
|
|
|
For each format,
|
|
|
|
the function returns a string (or a number) with the characters read,
|
|
|
|
or \nil\ if it cannot read data with the specified format.
|
2000-05-12 23:19:18 +04:00
|
|
|
When called without formats,
|
2001-09-24 19:54:36 +04:00
|
|
|
it uses a default format that reads the entire next line
|
1996-11-01 20:02:10 +03:00
|
|
|
(see below).
|
|
|
|
|
2000-04-14 21:47:55 +04:00
|
|
|
The available formats are
|
2001-09-24 19:54:36 +04:00
|
|
|
\begin{description}\leftskip=20pt
|
1999-04-07 20:40:04 +04:00
|
|
|
\item[``*n''] reads a number;
|
2000-04-14 21:47:55 +04:00
|
|
|
this is the only format that returns a number instead of a string.
|
|
|
|
\item[``*a''] reads the whole file, starting at the current position.
|
|
|
|
On end of file, it returns the empty string.
|
2002-06-06 16:49:28 +04:00
|
|
|
\item[``*l''] reads the next line (skipping the end of line),
|
2001-07-19 17:36:18 +04:00
|
|
|
returning \nil\ on end of file.
|
|
|
|
This is the default format.
|
2000-05-12 23:19:18 +04:00
|
|
|
\item[\emph{number}] reads a string with up to that number of characters,
|
|
|
|
or \nil\ on end of file.
|
2001-09-24 19:54:36 +04:00
|
|
|
If number is zero,
|
|
|
|
it reads nothing and returns an empty string,
|
2001-07-19 17:36:18 +04:00
|
|
|
or \nil\ on end of file.
|
1999-03-29 18:21:37 +04:00
|
|
|
\end{description}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{write ([filehandle, ] value1, ...)}}\DefLIB{write}
|
1996-11-01 20:02:10 +03:00
|
|
|
|
1998-08-25 00:14:56 +04:00
|
|
|
Writes the value of each of its arguments to
|
2001-01-29 22:33:55 +03:00
|
|
|
filehandle \verb|_OUTPUT|,
|
1998-08-25 00:14:56 +04:00
|
|
|
or to \verb|filehandle| if this argument is given.
|
1996-11-01 20:02:10 +03:00
|
|
|
The arguments must be strings or numbers.
|
1997-01-23 19:17:53 +03:00
|
|
|
To write other values,
|
1997-06-27 00:39:10 +04:00
|
|
|
use \verb|tostring| or \verb|format| before \verb|write|.
|
1996-11-01 21:02:53 +03:00
|
|
|
If this function fails, it returns \nil,
|
|
|
|
plus a string describing the error.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\subsection{System Facilities} \label{libiosys}
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{clock ()}}\DefLIB{clock}
|
2000-09-18 23:41:16 +04:00
|
|
|
|
|
|
|
Returns an approximation of the amount of CPU time
|
|
|
|
used by the program, in seconds.
|
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
\subsubsection*{\ff \T{date ([format [, time]])}}\DefLIB{date}
|
|
|
|
|
|
|
|
Returns a string or a table containing date and time,
|
|
|
|
formatted according to the given string \verb|format|.
|
|
|
|
|
|
|
|
If the \verb|time| argument is present,
|
|
|
|
this is the time to be formatted
|
|
|
|
(see the \verb|time| function for a description of this value).
|
|
|
|
Otherwise, \verb|date| formats the current time.
|
|
|
|
|
|
|
|
If \verb|format| starts with \verb|!|,
|
2001-09-24 19:54:36 +04:00
|
|
|
then the date is formatted in Coordinated Universal Time.
|
1996-01-29 20:08:23 +03:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
After that optional character,
|
|
|
|
if \verb|format| is \verb|*t|,
|
2001-09-24 19:54:36 +04:00
|
|
|
then \verb|date| returns a table with the following fields:
|
|
|
|
\verb|year|, \verb|month| (1--12), \verb|day| (1--31),
|
|
|
|
\verb|hour| (0--23), \verb|min| (0--59), \verb|sec| (0--59),
|
2001-07-19 17:36:18 +04:00
|
|
|
\verb|wday| (weekday, Sunday is 1),
|
|
|
|
\verb|yday| (day of the year),
|
|
|
|
and \verb|isdst| (daylight saving flag).
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
If format is not \verb|*t|,
|
|
|
|
then \verb|date| returns the date as a string,
|
2002-02-15 00:48:32 +03:00
|
|
|
formatted according with the same rules as the C~function \verb|strftime|.
|
1996-02-09 22:02:30 +03:00
|
|
|
When called without arguments,
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|date| returns a reasonable date and time representation that depends on
|
|
|
|
the host system and on the current locale (thus, \verb|date()| is equivalent
|
|
|
|
to \verb|date("%c")|).
|
1998-05-21 02:21:35 +04:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
\subsubsection*{\ff \T{difftime (t1, t2)}}\DefLIB{difftime}
|
|
|
|
|
|
|
|
Returns the number of seconds from time \verb|t1| to time \verb|t2|.
|
|
|
|
In Posix, Windows, and some other systems,
|
2001-09-24 19:54:36 +04:00
|
|
|
this value is exactly \verb|t1|\Math{-}\verb|t2|.
|
2001-07-19 17:36:18 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{execute (command)}}\DefLIB{execute}
|
1998-05-21 02:21:35 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
This function is equivalent to the C~function \verb|system|.
|
|
|
|
It passes \verb|command| to be executed by an operating system shell.
|
|
|
|
It returns a status code, which is system-dependent.
|
1996-01-29 20:08:23 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{exit ([code])}}\DefLIB{exit}
|
1996-01-29 20:08:23 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
Calls the C~function \verb|exit|,
|
1997-06-09 22:16:33 +04:00
|
|
|
with an optional \verb|code|,
|
2001-09-24 19:54:36 +04:00
|
|
|
to terminate the host program.
|
2000-04-14 21:47:55 +04:00
|
|
|
The default value for \verb|code| is the success code.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{getenv (varname)}}\DefLIB{getenv}
|
1996-11-01 20:02:10 +03:00
|
|
|
|
1998-06-18 21:36:27 +04:00
|
|
|
Returns the value of the process environment variable \verb|varname|,
|
1996-11-01 20:02:10 +03:00
|
|
|
or \nil\ if the variable is not defined.
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{setlocale (locale [, category])}}\DefLIB{setlocale}
|
1997-07-02 21:09:48 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
This function is an interface to the C~function \verb|setlocale|.
|
1998-01-07 19:26:48 +03:00
|
|
|
\verb|locale| is a string specifying a locale;
|
1998-06-18 21:36:27 +04:00
|
|
|
\verb|category| is an optional string describing which category to change:
|
|
|
|
\verb|"all"|, \verb|"collate"|, \verb|"ctype"|,
|
|
|
|
\verb|"monetary"|, \verb|"numeric"|, or \verb|"time"|;
|
|
|
|
the default category is \verb|"all"|.
|
1997-07-02 21:09:48 +04:00
|
|
|
The function returns the name of the new locale,
|
|
|
|
or \nil\ if the request cannot be honored.
|
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
\subsubsection*{\ff \T{time ([table])}}\DefLIB{time}
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
Returns the current time when called without arguments,
|
|
|
|
or a time representing the date and time specified by the given table.
|
2001-07-19 17:36:18 +04:00
|
|
|
This table must have fields \verb|year|, \verb|month|, and \verb|day|,
|
|
|
|
and may have fields \verb|hour|, \verb|min|, \verb|sec|, and \verb|isdst|
|
|
|
|
(for a description of these fields, see the \verb|date| function).
|
|
|
|
|
|
|
|
The returned value is a number, whose meaning depends on your system.
|
|
|
|
In Posix, Windows, and some other systems, this number counts the number
|
|
|
|
of seconds since some given start time (the ``epoch'').
|
|
|
|
In other systems, the meaning is not specified,
|
2001-09-24 19:54:36 +04:00
|
|
|
and the number returned bt \verb|time| can be used only as an argument to
|
|
|
|
\verb|date| and \verb|difftime|.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\subsection{The Reflexive Debug Interface}
|
1999-03-29 18:21:37 +04:00
|
|
|
|
|
|
|
The library \verb|ldblib| provides
|
2000-05-12 23:19:18 +04:00
|
|
|
the functionality of the debug interface to Lua programs.
|
1999-03-29 18:21:37 +04:00
|
|
|
If you want to use this library,
|
1999-04-07 20:40:04 +04:00
|
|
|
your host application must open it,
|
2000-04-14 21:47:55 +04:00
|
|
|
by calling \verb|lua_dblibopen|.
|
2000-11-07 15:44:44 +03:00
|
|
|
\DefAPI{lua_dblibopen}
|
1999-03-29 18:21:37 +04:00
|
|
|
|
|
|
|
You should exert great care when using this library.
|
1999-04-07 20:40:04 +04:00
|
|
|
The functions provided here should be used exclusively for debugging
|
2001-09-24 19:54:36 +04:00
|
|
|
and similar tasks, such as profiling.
|
1999-03-29 18:21:37 +04:00
|
|
|
Please resist the temptation to use them as a
|
2001-07-19 17:36:18 +04:00
|
|
|
usual programming tool:
|
|
|
|
They can be \emph{very} slow.
|
|
|
|
Moreover, \verb|setlocal| and \verb|getlocal|
|
|
|
|
violate the privacy of local variables,
|
|
|
|
and therefore can compromise some (otherwise) secure code.
|
1999-03-29 18:21:37 +04:00
|
|
|
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{getinfo (function, [what])}}\DefLIB{getinfo}
|
2000-05-12 23:49:18 +04:00
|
|
|
|
|
|
|
This function returns a table with information about a function.
|
|
|
|
You can give the function directly,
|
|
|
|
or you can give a number as the value of \verb|function|,
|
|
|
|
which means the function running at level \verb|function| of the stack:
|
|
|
|
Level 0 is the current function (\verb|getinfo| itself);
|
|
|
|
level 1 is the function that called \verb|getinfo|;
|
|
|
|
and so on.
|
|
|
|
If \verb|function| is a number larger than the number of active functions,
|
2000-11-07 15:44:44 +03:00
|
|
|
then \verb|getinfo| returns \nil.
|
1999-03-29 18:21:37 +04:00
|
|
|
|
2000-05-12 23:49:18 +04:00
|
|
|
The returned table contains all the fields returned by \verb|lua_getinfo|,
|
2000-04-14 21:47:55 +04:00
|
|
|
with the string \verb|what| describing what to get.
|
2000-05-12 23:49:18 +04:00
|
|
|
The default for \verb|what| is to get all information available.
|
2001-09-24 19:54:36 +04:00
|
|
|
If present,
|
|
|
|
the option \verb|f|
|
2002-02-15 00:48:32 +03:00
|
|
|
adds a field named \verb|func| with the function itself.
|
1999-03-29 18:21:37 +04:00
|
|
|
|
2000-05-12 23:49:18 +04:00
|
|
|
For instance, the expression \verb|getinfo(1,"n").name| returns
|
|
|
|
the name of the current function, if a reasonable name can be found,
|
|
|
|
and \verb|getinfo(print)| returns a table with all available information
|
|
|
|
about the \verb|print| function.
|
1999-03-29 18:21:37 +04:00
|
|
|
|
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{getlocal (level, local)}}\DefLIB{getlocal}
|
1999-03-29 18:21:37 +04:00
|
|
|
|
2000-04-14 21:47:55 +04:00
|
|
|
This function returns the name and the value of the local variable
|
|
|
|
with index \verb|local| of the function at level \verb|level| of the stack.
|
2000-11-07 15:44:44 +03:00
|
|
|
(The first parameter or local variable has index~1, and so on,
|
1999-03-29 18:21:37 +04:00
|
|
|
until the last active local variable.)
|
2000-04-14 21:47:55 +04:00
|
|
|
The function returns \nil\ if there is no local
|
|
|
|
variable with the given index,
|
|
|
|
and raises an error when called with a \verb|level| out of range.
|
2000-11-07 15:44:44 +03:00
|
|
|
(You can call \verb|getinfo| to check whether the level is valid.)
|
1999-03-29 18:21:37 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{setlocal (level, local, value)}}\DefLIB{setlocal}
|
1999-03-29 18:21:37 +04:00
|
|
|
|
2000-04-14 21:47:55 +04:00
|
|
|
This function assigns the value \verb|value| to the local variable
|
|
|
|
with index \verb|local| of the function at level \verb|level| of the stack.
|
|
|
|
The function returns \nil\ if there is no local
|
|
|
|
variable with the given index,
|
|
|
|
and raises an error when called with a \verb|level| out of range.
|
2001-09-24 19:54:36 +04:00
|
|
|
(You can call \verb|getinfo| to check whether the level is valid.)
|
1999-03-29 18:21:37 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{setcallhook (hook)}}\DefLIB{setcallhook}
|
1999-03-29 18:21:37 +04:00
|
|
|
|
|
|
|
Sets the function \verb|hook| as the call hook;
|
|
|
|
this hook will be called every time the interpreter starts and
|
|
|
|
exits the execution of a function.
|
2000-11-07 15:44:44 +03:00
|
|
|
The only argument to the call hook is the event name (\verb|"call"| or
|
2000-04-14 21:47:55 +04:00
|
|
|
\verb|"return"|).
|
2000-11-07 15:44:44 +03:00
|
|
|
You can call \verb|getinfo| with level 2 to get more information about
|
2000-04-14 21:47:55 +04:00
|
|
|
the function being called or returning
|
2000-11-07 15:44:44 +03:00
|
|
|
(level~0 is the \verb|getinfo| function,
|
|
|
|
and level~1 is the hook function).
|
1999-03-29 18:21:37 +04:00
|
|
|
When called without arguments,
|
|
|
|
this function turns off call hooks.
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|setcallhook| returns the old call hook.
|
1999-03-29 18:21:37 +04:00
|
|
|
|
2000-11-07 15:44:44 +03:00
|
|
|
\subsubsection*{\ff \T{setlinehook (hook)}}\DefLIB{setlinehook}
|
1999-03-29 18:21:37 +04:00
|
|
|
|
|
|
|
Sets the function \verb|hook| as the line hook;
|
|
|
|
this hook will be called every time the interpreter changes
|
|
|
|
the line of code it is executing.
|
2000-11-07 15:44:44 +03:00
|
|
|
The only argument to the line hook is the line number the interpreter
|
2000-04-14 21:47:55 +04:00
|
|
|
is about to execute.
|
1999-03-29 18:21:37 +04:00
|
|
|
When called without arguments,
|
|
|
|
this function turns off line hooks.
|
2001-09-24 19:54:36 +04:00
|
|
|
\verb|setlinehook| returns the old line hook.
|
1999-03-29 18:21:37 +04:00
|
|
|
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
%------------------------------------------------------------------------------
|
1997-01-23 19:17:53 +03:00
|
|
|
\section{\Index{Lua Stand-alone}} \label{lua-sa}
|
1996-11-01 20:02:10 +03:00
|
|
|
|
|
|
|
Although Lua has been designed as an extension language,
|
2000-11-07 15:44:44 +03:00
|
|
|
to be embedded in a host C~program,
|
2001-09-24 19:54:36 +04:00
|
|
|
it is also frequently used as a stand-alone language.
|
2000-09-18 23:41:16 +04:00
|
|
|
An interpreter for Lua as a stand-alone language,
|
1996-11-01 20:02:10 +03:00
|
|
|
called simply \verb|lua|,
|
|
|
|
is provided with the standard distribution.
|
|
|
|
This program can be called with any sequence of the following arguments:
|
2000-09-18 23:41:16 +04:00
|
|
|
\begin{description}\leftskip=20pt
|
2000-10-31 21:20:01 +03:00
|
|
|
\item[\T{-sNUM}] sets the stack size to \T{NUM}
|
|
|
|
(if present, this must be the first option);
|
2000-09-18 23:41:16 +04:00
|
|
|
\item[\T{-} ] executes \verb|stdin| as a file;
|
2001-09-24 19:54:36 +04:00
|
|
|
\item[\T{-c}] calls \verb|lua_close| after processing all arguments;
|
|
|
|
\item[\T{-e} \rm\emph{stat}] executes string \emph{stat};
|
|
|
|
\item[\T{-f} \rm\emph{filename}] executes file \emph{filename} with the
|
2000-04-14 21:47:55 +04:00
|
|
|
remaining arguments in table \verb|arg|;
|
|
|
|
\item[\T{-i}] enters interactive mode with prompt;
|
|
|
|
\item[\T{-q}] enters interactive mode without prompt;
|
|
|
|
\item[\T{-v}] prints version information;
|
2001-09-24 19:54:36 +04:00
|
|
|
\item[\T{var=}\rm\emph{value}] sets global \verb|var| to string \verb|"|\emph{value}\verb|"|;
|
|
|
|
\item[\emph{filename}] executes file \emph{filename}.
|
1996-11-01 20:02:10 +03:00
|
|
|
\end{description}
|
1998-01-02 21:34:00 +03:00
|
|
|
When called without arguments,
|
2000-11-07 15:44:44 +03:00
|
|
|
\verb|lua| behaves as \verb|lua -v -i| when \verb|stdin| is a terminal,
|
1998-03-30 22:17:55 +04:00
|
|
|
and as \verb|lua -| otherwise.
|
1998-01-02 21:34:00 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
All arguments are handled in order, except \verb|-c|.
|
1996-11-01 20:02:10 +03:00
|
|
|
For instance, an invocation like
|
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
$ lua -i a=test prog.lua
|
1996-11-01 20:02:10 +03:00
|
|
|
\end{verbatim}
|
2000-05-12 23:19:18 +04:00
|
|
|
will first interact with the user until an \verb|EOF| in \verb|stdin|,
|
1998-01-02 21:34:00 +03:00
|
|
|
then will set \verb|a| to \verb|"test"|,
|
1998-03-30 22:17:55 +04:00
|
|
|
and finally will run the file \verb|prog.lua|.
|
2000-09-18 23:41:16 +04:00
|
|
|
(Here,
|
|
|
|
\verb|$| is the shell prompt. Your prompt may be different.)
|
1996-11-01 20:02:10 +03:00
|
|
|
|
2000-04-14 21:47:55 +04:00
|
|
|
When the option \T{-f filename} is used,
|
2000-09-18 23:41:16 +04:00
|
|
|
all remaining arguments in the command line
|
2000-11-07 15:44:44 +03:00
|
|
|
are passed to the Lua program \verb|filename| in a table called \verb|arg|.
|
2000-09-18 23:41:16 +04:00
|
|
|
In this table,
|
|
|
|
the field \verb|n| gets the index of the last argument,
|
2000-11-07 15:44:44 +03:00
|
|
|
and the field 0 gets \verb|"filename"|.
|
2000-04-14 21:47:55 +04:00
|
|
|
For instance, in the call
|
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
$ lua a.lua -f b.lua t1 t3
|
2000-04-14 21:47:55 +04:00
|
|
|
\end{verbatim}
|
|
|
|
the interpreter first runs the file \T{a.lua},
|
2000-11-07 15:44:44 +03:00
|
|
|
then creates a table
|
2000-04-14 21:47:55 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
arg = {"t1", "t3"; n = 2, [0] = "b.lua"}
|
2000-04-14 21:47:55 +04:00
|
|
|
\end{verbatim}
|
2000-11-07 15:44:44 +03:00
|
|
|
and finally runs the file \T{b.lua}.
|
2001-09-24 19:54:36 +04:00
|
|
|
|
|
|
|
The stand-alone interpreter includes
|
|
|
|
all standard libraries plus the reflexive debug interface.
|
|
|
|
It also provides a \verb|getargs| function that
|
2000-05-12 23:19:18 +04:00
|
|
|
can be used to access \emph{all} command line arguments.
|
2001-09-24 19:54:36 +04:00
|
|
|
\DefLIB{getargs}
|
2000-09-18 23:41:16 +04:00
|
|
|
For instance, if you call Lua with the line
|
2000-08-09 23:09:20 +04:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
$ lua -c a b
|
2000-08-09 23:09:20 +04:00
|
|
|
\end{verbatim}
|
2000-11-07 15:44:44 +03:00
|
|
|
then a call to \verb|getargs| in \verb|a| or \verb|b| will return the table
|
2000-09-18 23:41:16 +04:00
|
|
|
\begin{verbatim}
|
|
|
|
{[0] = "lua", [1] = "-c", [2] = "a", [3] = "b", n = 3}
|
|
|
|
\end{verbatim}
|
2000-04-14 21:47:55 +04:00
|
|
|
|
|
|
|
In interactive mode,
|
2001-09-24 19:54:36 +04:00
|
|
|
a multi-line statement can be written ending intermediate
|
2000-09-18 23:41:16 +04:00
|
|
|
lines with a backslash (`\verb|\|').
|
2000-11-07 15:44:44 +03:00
|
|
|
If the global variable \IndexVerb{_PROMPT} is defined as a string,
|
|
|
|
then its value is used as the prompt.
|
2000-09-18 23:41:16 +04:00
|
|
|
Therefore, the prompt can be changed directly on the command line:
|
1996-11-01 20:02:10 +03:00
|
|
|
\begin{verbatim}
|
2000-09-18 23:41:16 +04:00
|
|
|
$ lua _PROMPT='myprompt> ' -i
|
1996-11-01 20:02:10 +03:00
|
|
|
\end{verbatim}
|
2000-11-07 15:44:44 +03:00
|
|
|
or in any Lua programs by assigning to \verb|_PROMPT|.
|
2001-09-24 19:54:36 +04:00
|
|
|
Note the use of \verb|-i| to enter interactive mode; otherwise,
|
|
|
|
the program would end just after the assignment to \verb|_PROMPT|.
|
1996-11-01 20:02:10 +03:00
|
|
|
|
1998-06-18 21:36:27 +04:00
|
|
|
In Unix systems, Lua scripts can be made into executable programs
|
2000-05-12 23:19:18 +04:00
|
|
|
by using \verb|chmod +x| and the~\verb|#!| form,
|
2000-04-14 21:47:55 +04:00
|
|
|
as in \verb|#!/usr/local/bin/lua|,
|
|
|
|
or \verb|#!/usr/local/bin/lua -f| to get other arguments.
|
2001-09-24 19:54:36 +04:00
|
|
|
(Of course,
|
|
|
|
the location of the Lua interpreter may be different in your machine.
|
|
|
|
If \verb|lua| is in your \verb|PATH|,
|
|
|
|
then a more portable solution is \verb|#!/usr/bin/env lua|.)
|
1998-06-18 21:36:27 +04:00
|
|
|
|
1999-10-04 21:51:04 +04:00
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
%------------------------------------------------------------------------------
|
1995-11-16 23:46:02 +03:00
|
|
|
\section*{Acknowledgments}
|
|
|
|
|
2001-09-24 19:54:36 +04:00
|
|
|
The authors thank CENPES/PETROBRAS which,
|
2000-08-09 23:09:20 +04:00
|
|
|
jointly with \tecgraf, used early versions of
|
|
|
|
this system extensively and gave valuable comments.
|
2001-09-24 19:54:36 +04:00
|
|
|
The authors also thank Carlos Henrique Levy,
|
1996-02-09 19:37:58 +03:00
|
|
|
who found the name of the game.
|
2000-08-09 23:09:20 +04:00
|
|
|
Lua means ``moon'' in Portuguese.
|
1995-11-16 23:46:02 +03:00
|
|
|
|
|
|
|
|
|
|
|
\appendix
|
|
|
|
|
1996-08-29 00:46:26 +04:00
|
|
|
\section*{Incompatibilities with Previous Versions}
|
2000-09-18 23:41:16 +04:00
|
|
|
\addcontentsline{toc}{section}{Incompatibilities with Previous Versions}
|
1995-11-16 23:46:02 +03:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
We took a great care to avoid incompatibilities with
|
1995-11-16 23:46:02 +03:00
|
|
|
the previous public versions of Lua,
|
2000-11-07 15:44:44 +03:00
|
|
|
but some differences had to be introduced.
|
1996-11-01 20:02:10 +03:00
|
|
|
Here is a list of all these incompatibilities.
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
\subsection*{Incompatibilities with \Index{version 4.0}}
|
2000-08-30 22:58:46 +04:00
|
|
|
|
|
|
|
\subsubsection*{Changes in the Language}
|
1999-02-05 15:15:07 +03:00
|
|
|
\begin{itemize}
|
1998-01-02 21:34:00 +03:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\item
|
2001-07-19 17:36:18 +04:00
|
|
|
Function calls written between parentheses result in exactly one value.
|
2000-08-30 22:58:46 +04:00
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\item
|
2002-02-15 00:48:32 +03:00
|
|
|
A function call as the last expression in a list constructor
|
2001-07-19 17:36:18 +04:00
|
|
|
(like \verb|{a,b,f()}}|) has all its return values inserted in the list.
|
2000-08-30 22:58:46 +04:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\item
|
2001-07-19 17:36:18 +04:00
|
|
|
\rwd{global} and \rwd{in} are reserved words.
|
2000-08-30 22:58:46 +04:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\item
|
2001-07-19 17:36:18 +04:00
|
|
|
When a literal string of the form \verb|[[...]]| starts with a newline,
|
|
|
|
this newline is ignored.
|
2000-08-30 22:58:46 +04:00
|
|
|
|
|
|
|
\item Old pre-compiled code is obsolete, and must be re-compiled.
|
|
|
|
|
|
|
|
\end{itemize}
|
|
|
|
|
|
|
|
|
|
|
|
\subsubsection*{Changes in the Libraries}
|
|
|
|
\begin{itemize}
|
|
|
|
|
2000-09-18 23:41:16 +04:00
|
|
|
\item
|
2001-07-19 17:36:18 +04:00
|
|
|
The \verb|read| option \verb|*w| is obsolete.
|
2000-08-30 22:58:46 +04:00
|
|
|
|
|
|
|
\item
|
2001-07-19 17:36:18 +04:00
|
|
|
The \verb|format| option \verb|%n$| is obsolete.
|
2000-08-30 22:58:46 +04:00
|
|
|
|
|
|
|
\item
|
2001-07-19 17:36:18 +04:00
|
|
|
\verb|newtag| is deprecated, being replaced by \verb|newtype|.
|
|
|
|
Tags created in Lua with \verb|newtype| (or \verb|newtag|) can only
|
|
|
|
be used for tables.
|
2000-09-18 23:41:16 +04:00
|
|
|
|
2000-08-30 22:58:46 +04:00
|
|
|
\end{itemize}
|
|
|
|
|
|
|
|
|
|
|
|
\subsubsection*{Changes in the API}
|
|
|
|
\begin{itemize}
|
|
|
|
|
|
|
|
\item
|
2001-07-19 17:36:18 +04:00
|
|
|
The \verb|lua_pushuserdata| function has been replaced by
|
|
|
|
\verb|lua_newuserdatabox|.
|
2000-08-30 22:58:46 +04:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{itemize}
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
%{===============================================================
|
2001-09-24 19:54:36 +04:00
|
|
|
\newpage
|
2000-09-18 23:41:16 +04:00
|
|
|
\section*{The Complete Syntax of Lua} \label{BNF}
|
|
|
|
|
2000-10-31 21:20:01 +03:00
|
|
|
\addcontentsline{toc}{section}{The Complete Syntax of Lua}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
|
|
|
\renewenvironment{Produc}{\vspace{0.8ex}\par\noindent\hspace{3ex}\it\begin{tabular}{rrl}}{\end{tabular}\vspace{0.8ex}\par\noindent}
|
|
|
|
|
|
|
|
\renewcommand{\OrNL}{\\ & \Or & }
|
2000-11-07 15:44:44 +03:00
|
|
|
%\newcommand{\Nter}[1]{{\rm{\tt#1}}}
|
|
|
|
\newcommand{\Nter}[1]{#1}
|
|
|
|
|
|
|
|
\index{grammar}
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\begin{Produc}
|
|
|
|
|
2000-08-30 22:58:46 +04:00
|
|
|
\produc{chunk}{\rep{stat \opt{\ter{;}}}}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-08-09 23:09:20 +04:00
|
|
|
\produc{block}{chunk}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
|
|
|
\produc{stat}{%
|
|
|
|
varlist1 \ter{=} explist1
|
|
|
|
\OrNL functioncall
|
|
|
|
\OrNL \rwd{do} block \rwd{end}
|
2001-07-19 17:36:18 +04:00
|
|
|
\OrNL \rwd{while} exp \rwd{do} block \rwd{end}
|
|
|
|
\OrNL \rwd{repeat} block \rwd{until} exp
|
|
|
|
\OrNL \rwd{if} exp \rwd{then} block
|
|
|
|
\rep{\rwd{elseif} exp \rwd{then} block}
|
2000-05-12 23:19:18 +04:00
|
|
|
\opt{\rwd{else} block} \rwd{end}
|
|
|
|
\OrNL \rwd{return} \opt{explist1}
|
2000-08-09 23:09:20 +04:00
|
|
|
\OrNL \rwd{break}
|
2002-02-15 00:48:32 +03:00
|
|
|
\OrNL \rwd{for} \Nter{Name} \ter{=} exp \ter{,} exp \opt{\ter{,} exp}
|
2000-05-12 23:19:18 +04:00
|
|
|
\rwd{do} block \rwd{end}
|
2002-06-06 16:49:28 +04:00
|
|
|
\OrNL \rwd{for} \Nter{Name} \rep{\ter{,} \Nter{Name}} \rwd{in} explist1
|
2000-08-30 22:58:46 +04:00
|
|
|
\rwd{do} block \rwd{end}
|
2000-05-12 23:19:18 +04:00
|
|
|
\OrNL \rwd{function} funcname \ter{(} \opt{parlist1} \ter{)} block \rwd{end}
|
2001-09-24 19:54:36 +04:00
|
|
|
\OrNL \rwd{local} namelist \opt{init}
|
2000-05-12 23:19:18 +04:00
|
|
|
}
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{funcname}{\Nter{Name} \rep{\ter{.} \Nter{Name}}
|
|
|
|
\opt{\ter{:} \Nter{Name}}}
|
2000-08-30 22:58:46 +04:00
|
|
|
|
|
|
|
\produc{varlist1}{var \rep{\ter{,} var}}
|
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\produc{var}{%
|
2002-02-15 00:48:32 +03:00
|
|
|
\Nter{Name}
|
|
|
|
\Or prefixexp \ter{[} exp \ter{]}
|
|
|
|
\Or prefixexp \ter{.} \Nter{Name}
|
2000-05-12 23:19:18 +04:00
|
|
|
}
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{namelist}{\Nter{Name} \rep{\ter{,} \Nter{Name}}}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
|
|
|
\produc{init}{\ter{=} explist1}
|
|
|
|
|
2001-07-19 17:36:18 +04:00
|
|
|
\produc{explist1}{\rep{exp \ter{,}} exp}
|
2000-08-30 22:58:46 +04:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
\produc{exp}{%
|
|
|
|
\rwd{nil}
|
2002-02-15 00:48:32 +03:00
|
|
|
\Or \Nter{Number}
|
|
|
|
\Or \Nter{Literal}
|
2000-05-12 23:19:18 +04:00
|
|
|
\Or function
|
2002-02-15 00:48:32 +03:00
|
|
|
\Or prefixexp
|
|
|
|
\OrNL tableconstructor
|
2000-08-09 23:09:20 +04:00
|
|
|
\Or exp binop exp
|
|
|
|
\Or unop exp
|
2000-05-12 23:19:18 +04:00
|
|
|
}
|
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{prefixexp}{var \Or functioncall \Or \ter{(} exp \ter{)}}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-08-30 22:58:46 +04:00
|
|
|
\produc{functioncall}{%
|
2002-02-15 00:48:32 +03:00
|
|
|
prefixexp args
|
|
|
|
\Or prefixexp \ter{:} \Nter{Name} args
|
2000-08-30 22:58:46 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
\produc{args}{%
|
|
|
|
\ter{(} \opt{explist1} \ter{)}
|
|
|
|
\Or tableconstructor
|
2002-02-15 00:48:32 +03:00
|
|
|
\Or \Nter{Literal}
|
2000-08-30 22:58:46 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
\produc{function}{\rwd{function} \ter{(} \opt{parlist1} \ter{)} block \rwd{end}}
|
|
|
|
|
|
|
|
\produc{parlist1}{%
|
2002-02-15 00:48:32 +03:00
|
|
|
\Nter{Name} \rep{\ter{,} \Nter{Name}} \opt{\ter{,} \ter{\ldots}}
|
|
|
|
\Or \ter{\ldots}
|
2000-08-30 22:58:46 +04:00
|
|
|
}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2002-02-15 00:48:32 +03:00
|
|
|
\produc{tableconstructor}{\ter{\{} \opt{fieldlist} \ter{\}}}
|
|
|
|
\produc{fieldlist}{field \rep{fieldsep field} \opt{fieldsep}}
|
|
|
|
\produc{field}{\ter{[} exp \ter{]} \ter{=} exp \Or name \ter{=} exp \Or exp}
|
|
|
|
\produc{fieldsep}{\ter{,} \Or \ter{;}}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-08-30 22:58:46 +04:00
|
|
|
\produc{binop}{\ter{+} \Or \ter{-} \Or \ter{*} \Or \ter{/} \Or \ter{\^{ }} \Or
|
2002-02-15 00:48:32 +03:00
|
|
|
\ter{..} \Or \ter{<} \Or \ter{<=} \Or \ter{>} \Or \ter{>=}
|
2000-08-30 22:58:46 +04:00
|
|
|
\Or \ter{==} \Or \ter{\~{ }=} \OrNL \rwd{and} \Or \rwd{or}}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
2000-08-30 22:58:46 +04:00
|
|
|
\produc{unop}{\ter{-} \Or \rwd{not}}
|
2000-05-12 23:19:18 +04:00
|
|
|
|
|
|
|
\end{Produc}
|
2001-09-24 19:54:36 +04:00
|
|
|
|
2000-05-12 23:19:18 +04:00
|
|
|
%}===============================================================
|
|
|
|
|
2000-10-31 21:20:01 +03:00
|
|
|
% Index
|
1998-08-21 21:43:44 +04:00
|
|
|
|
2000-10-31 21:20:01 +03:00
|
|
|
\newpage
|
2000-09-18 23:41:16 +04:00
|
|
|
\addcontentsline{toc}{section}{Index}
|
1996-02-16 16:12:12 +03:00
|
|
|
\input{manual.id}
|
2000-10-31 21:20:01 +03:00
|
|
|
|
1995-11-16 23:46:02 +03:00
|
|
|
\end{document}
|