Repository: akkartik/teliva
Branch: main
Commit: 618b49fbf3db
Files: 169
Total size: 1.6 MB
Directory structure:
gitextract_eymj815d/
├── .gitattributes
├── .gitignore
├── COPYRIGHT.md
├── Makefile
├── README.md
├── anagrams.tlv
├── break.tlv
├── chesstv.tlv
├── counter.tlv
├── doc/
│ ├── contents.html
│ ├── lua.css
│ ├── manual.css
│ └── manual.html
├── gemini.tlv
├── graphviz.tlv
├── hanoi.tlv
├── life.tlv
├── lisp.lua
├── lisp.tlv
├── manual_tests
├── sandboxing/
│ ├── README.md
│ ├── includes
│ ├── system_includes
│ └── unique_system_includes
├── shell.nix
├── sieve.tlv
├── smol.tlv
├── src/
│ ├── Makefile
│ ├── file.lua
│ ├── json.lua
│ ├── jsonf.lua
│ ├── kilo.c
│ ├── lapi.c
│ ├── lapi.h
│ ├── lauxlib.c
│ ├── lauxlib.h
│ ├── lbaselib.c
│ ├── lcode.c
│ ├── lcode.h
│ ├── lcurses/
│ │ ├── Makefile
│ │ ├── _helpers.c
│ │ ├── chstr.c
│ │ ├── compat-5.2.c
│ │ ├── compat-5.2.h
│ │ ├── curses.c
│ │ ├── curses.lua
│ │ ├── strlcpy.c
│ │ └── window.c
│ ├── ldebug.c
│ ├── ldebug.h
│ ├── ldo.c
│ ├── ldo.h
│ ├── ldump.c
│ ├── lfunc.c
│ ├── lfunc.h
│ ├── lgc.c
│ ├── lgc.h
│ ├── linit.c
│ ├── liolib.c
│ ├── llex.c
│ ├── llex.h
│ ├── llimits.h
│ ├── lmathlib.c
│ ├── lmem.c
│ ├── lmem.h
│ ├── lobject.c
│ ├── lobject.h
│ ├── lopcodes.c
│ ├── lopcodes.h
│ ├── loslib.c
│ ├── lparser.c
│ ├── lparser.h
│ ├── lstate.c
│ ├── lstate.h
│ ├── lstring.c
│ ├── lstring.h
│ ├── lstrlib.c
│ ├── ltable.c
│ ├── ltable.h
│ ├── ltablib.c
│ ├── ltm.c
│ ├── ltm.h
│ ├── lua.c
│ ├── lua.h
│ ├── luaconf.h
│ ├── lualib.h
│ ├── luasec/
│ │ ├── Makefile
│ │ ├── compat.h
│ │ ├── config.c
│ │ ├── context.c
│ │ ├── context.h
│ │ ├── ec.c
│ │ ├── ec.h
│ │ ├── https.lua
│ │ ├── options.c
│ │ ├── options.h
│ │ ├── options.lua
│ │ ├── ssl.c
│ │ ├── ssl.h
│ │ ├── ssl.lua
│ │ ├── x509.c
│ │ └── x509.h
│ ├── luasocket/
│ │ ├── auxiliar.c
│ │ ├── auxiliar.h
│ │ ├── buffer.c
│ │ ├── buffer.h
│ │ ├── compat.c
│ │ ├── compat.h
│ │ ├── except.c
│ │ ├── except.h
│ │ ├── ftp.lua
│ │ ├── headers.lua
│ │ ├── http.lua
│ │ ├── inet.c
│ │ ├── inet.h
│ │ ├── io.c
│ │ ├── io.h
│ │ ├── ltn12.lua
│ │ ├── luasocket.c
│ │ ├── luasocket.h
│ │ ├── makefile
│ │ ├── mbox.lua
│ │ ├── mime.c
│ │ ├── mime.h
│ │ ├── mime.lua
│ │ ├── options.c
│ │ ├── options.h
│ │ ├── pierror.h
│ │ ├── select.c
│ │ ├── select.h
│ │ ├── serial.c
│ │ ├── smtp.lua
│ │ ├── socket.h
│ │ ├── socket.lua
│ │ ├── tcp.c
│ │ ├── tcp.h
│ │ ├── timeout.c
│ │ ├── timeout.h
│ │ ├── tp.lua
│ │ ├── udp.c
│ │ ├── udp.h
│ │ ├── unix.c
│ │ ├── unix.h
│ │ ├── unixdgram.c
│ │ ├── unixdgram.h
│ │ ├── unixstream.c
│ │ ├── unixstream.h
│ │ ├── url.lua
│ │ ├── usocket.c
│ │ ├── usocket.h
│ │ ├── wsocket.c
│ │ └── wsocket.h
│ ├── lundump.c
│ ├── lundump.h
│ ├── lvm.c
│ ├── lvm.h
│ ├── lzio.c
│ ├── lzio.h
│ ├── realpath.c
│ ├── task.lua
│ ├── teliva.c
│ ├── teliva.h
│ ├── tlv.c
│ ├── tlv.h
│ └── vimrc.vim
├── template.tlv
├── toot-toot.tlv
├── tour.md
└── zet.tlv
================================================
FILE CONTENTS
================================================
================================================
FILE: .gitattributes
================================================
*.teliva linguist-language=Lua
*.tlv linguist-language=Lua
================================================
FILE: .gitignore
================================================
*.o
*.a
================================================
FILE: COPYRIGHT.md
================================================
Lua License
-----------
Lua is licensed under the terms of the MIT license reproduced below.
This means that Lua is free software and can be used for both academic
and commercial purposes at absolutely no cost.
For details and rationale, see http://www.lua.org/license.html .
===============================================================================
Copyright (C) 1994-2012 Lua.org, PUC-Rio.
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.
===============================================================================
================================================
FILE: Makefile
================================================
# makefile for installing Lua
# see INSTALL for installation instructions
# see src/Makefile and src/luaconf.h for further customization
# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT =======================
# Your platform. See PLATS for possible values.
PLAT= none
# Where to install. The installation starts in the src and doc directories,
# so take care if INSTALL_TOP is not an absolute path.
INSTALL_TOP= /usr/local
INSTALL_BIN= $(INSTALL_TOP)/bin
INSTALL_INC= $(INSTALL_TOP)/include
INSTALL_LIB= $(INSTALL_TOP)/lib
INSTALL_MAN= $(INSTALL_TOP)/man/man1
#
# You probably want to make INSTALL_LMOD and INSTALL_CMOD consistent with
# LUA_ROOT, LUA_LDIR, and LUA_CDIR in luaconf.h (and also with etc/lua.pc).
INSTALL_LMOD= $(INSTALL_TOP)/share/lua/$V
INSTALL_CMOD= $(INSTALL_TOP)/lib/lua/$V
# How to install. If your install program does not support "-p", then you
# may have to run ranlib on the installed liblua.a (do "make ranlib").
INSTALL= install -p
INSTALL_EXEC= $(INSTALL) -m 0755
INSTALL_DATA= $(INSTALL) -m 0644
#
# If you don't have install you can use cp instead.
# INSTALL= cp -p
# INSTALL_EXEC= $(INSTALL)
# INSTALL_DATA= $(INSTALL)
# Utilities.
MKDIR= mkdir -p
RANLIB= ranlib
# == END OF USER SETTINGS. NO NEED TO CHANGE ANYTHING BELOW THIS LINE =========
# Keep this sync'd with src/Makefile
PLATS= freebsd linux macosx netbsd openbsd
# What to install.
TO_BIN= lua luac
TO_INC= lua.h luaconf.h lualib.h lauxlib.h ../etc/lua.hpp
TO_LIB= liblua.a
TO_MAN= lua.1 luac.1
# Lua version and release.
V= 5.1
R= 5.1.5
all: $(PLAT)
$(PLATS) clean:
cd src && $(MAKE) $@
install: dummy
cd src && $(MKDIR) $(INSTALL_BIN) $(INSTALL_INC) $(INSTALL_LIB) $(INSTALL_MAN) $(INSTALL_LMOD) $(INSTALL_CMOD)
cd src && $(INSTALL_EXEC) $(TO_BIN) $(INSTALL_BIN)
cd src && $(INSTALL_DATA) $(TO_INC) $(INSTALL_INC)
cd src && $(INSTALL_DATA) $(TO_LIB) $(INSTALL_LIB)
cd doc && $(INSTALL_DATA) $(TO_MAN) $(INSTALL_MAN)
ranlib:
cd src && cd $(INSTALL_LIB) && $(RANLIB) $(TO_LIB)
local:
$(MAKE) install INSTALL_TOP=..
none:
@echo "Please do"
@echo " make PLATFORM"
@echo "where PLATFORM is one of these:"
@echo " $(PLATS)"
@echo "See INSTALL for complete instructions."
# make may get confused with test/ and INSTALL in a case-insensitive OS
dummy:
# echo config parameters
echo:
@echo ""
@echo "These are the parameters currently set in src/Makefile to build Lua $R:"
@echo ""
@cd src && $(MAKE) -s echo
@echo ""
@echo "These are the parameters currently set in Makefile to install Lua $R:"
@echo ""
@echo "PLAT = $(PLAT)"
@echo "INSTALL_TOP = $(INSTALL_TOP)"
@echo "INSTALL_BIN = $(INSTALL_BIN)"
@echo "INSTALL_INC = $(INSTALL_INC)"
@echo "INSTALL_LIB = $(INSTALL_LIB)"
@echo "INSTALL_MAN = $(INSTALL_MAN)"
@echo "INSTALL_LMOD = $(INSTALL_LMOD)"
@echo "INSTALL_CMOD = $(INSTALL_CMOD)"
@echo "INSTALL_EXEC = $(INSTALL_EXEC)"
@echo "INSTALL_DATA = $(INSTALL_DATA)"
@echo ""
@echo "See also src/luaconf.h ."
@echo ""
# echo private config parameters
pecho:
@echo "V = $(V)"
@echo "R = $(R)"
@echo "TO_BIN = $(TO_BIN)"
@echo "TO_INC = $(TO_INC)"
@echo "TO_LIB = $(TO_LIB)"
@echo "TO_MAN = $(TO_MAN)"
# echo config parameters as Lua code
# uncomment the last sed expression if you want nil instead of empty strings
lecho:
@echo "-- installation parameters for Lua $R"
@echo "VERSION = '$V'"
@echo "RELEASE = '$R'"
@$(MAKE) echo | grep = | sed -e 's/= /= "/' -e 's/$$/"/' #-e 's/""/nil/'
@echo "-- EOF"
# list targets that do not create files (but not all makes understand .PHONY)
.PHONY: all $(PLATS) clean test install local none dummy echo pecho lecho
# (end of Makefile)
================================================
FILE: README.md
================================================
# Teliva - an environment for end-user programming
> “Enable all people to modify the software they use in the course of using it.”
> — https://futureofcoding.org/episodes/033.html
> “What if we, and all computer users, could reach in and modify our favorite apps?”
> — https://www.inkandswitch.com/end-user-programming
> “Software must be as easy to change as it is to use.”
> — https://malleable.systems
## What's this, then?
Teliva is the most naive way to make software as easy to change as it is to
use: an interpreted environment for running shareable little text-mode apps.
Its language of choice is Lua, excluding all features that can conceivably
introduce moving parts in running a Lua program.
Here's how you run one of the example apps (the [Tower of Hanoi](https://en.wikipedia.org/wiki/Tower_of_Hanoi)):
```sh
git clone https://github.com/akkartik/teliva
cd teliva
make linux # replace with 'macosx', etc. depending on your OS
src/teliva hanoi.tlv
```
No matter what app you run, you are always guaranteed access to a single
obvious, consistent way (currently the hotkey `ctrl-u`) to inspect its
sources.
When you look under the hood of an app, the first thing you see is a
_big-picture view_ which shows the app's major data structures and a top-down
view of the app's code.
Select a definition, make a change, hit `ctrl-x`, and the app will run with
your updates. ([video](https://archive.org/details/akkartik-2021-11-14))
You will need some Unix-like platform with a C compiler and the ncurses and
openssl libraries. Some possible commands to install them, depending on your
OS and package manager of choice:
* `guix shell -D lua openssl -- make linux`
* `nix-shell --pure` (from a directory containing shell.nix in this repo)
* `sudo apt install libncursesw6-dev openssl`
* `brew install ncurses openssl`
So far I've tested Teliva on Linux, Mac OS X, OpenBSD, NetBSD and FreeBSD; it
should work on other flavors of BSD, WSL on Windows, etc. with only minor
modifications.
## What else can it do?
Anything! Some more sample apps to try out:
* Conway's Game of Life, as an example of an animated local app.
```
src/teliva life.tlv
```
[video](https://merveilles.town/@akkartik/107277755421024772)
* A viewer for [LiChess TV](https://lichess.org/tv), as an example of
animation and accessing a remote API over a network.
```
src/teliva chesstv.tlv
```
[video](https://merveilles.town/@akkartik/107319684018301051)
* A browser for the [Gemini protocol](https://gemini.circumlunar.space).
```
src/teliva gemini.tlv
```
[video](https://merveilles.town/@akkartik/107489728557201145)
These are just a start. The sky is the limit.
## So, just a programming language, then?
There's one big difference with other programming languages: Teliva apps are
sandboxed like a browser. Most languages assume the fiction that the person
running a program trusts all the code in the program. This assumption hasn't
been valid since a decade after the Unix big bang, if then. Teliva takes on
the reality that apps can get complex and use code written by strangers. In
response, Teliva tries to always summarize for you what the program you're
running is trying to do, and to ask you before a random app tries to do
something sensitive. Permissions you grant a Teliva app will be _flexible_ and
_easy to understand_. Browsers and mobile apps today tend to make you choose
between those two properties.
The sandboxing experience is still under construction. See [this talk](https://archive.org/details/akkartik-2022-01-16-fosdem)
(15 minutes) for a rundown of current thinking. It isn't yet safe to run
untrusted Teliva apps you download from the internet. (Fortunately you're
unlikely to run into any such apps.)
## Isn't this just an IDE?
There's one big difference: these apps are not intended to be runnable outside
of the Teliva environment. Editing the sources and visualizing permissions
granted will always be core features that are front and center in the UI.
A second, more subtle difference: it's primarily an environment for _running_
apps, and only secondarily for editing them. Starting up the environment puts
you in a running app by default. Creating an app from a clean slate is a
low-priority use case, as is lots of specialized support for developing
complex apps. The sweet spot for Teliva is simple apps that people will want
to edit after using for a while.
## Who are we trusting by trusting you?
Teliva is designed to have a shallow, manageable software supply chain. I
rely on packages distributed by the following reputable brands:
* A well-known Posix OS, either Linux or BSD.
* A standard C library, usually GNU libc.
* The [ncurses](https://tldp.org/HOWTO/NCURSES-Programming-HOWTO) library for
building text-mode user interfaces. ([Alternative documentation](https://tldp.org/LDP/lpg-0.4.pdf))
Teliva's codebase also includes forks of the following reputable brands:
* [Lua 5.1](https://www.lua.org/manual/5.1)
* The [Kilo](https://github.com/antirez/kilo) text editor, modified to use
ncurses. (Read more about it in this [fantastic walk-through](https://viewsourcecode.org/snaptoken/kilo).)
* The [lcurses](https://github.com/lcurses/lcurses) binding for ncurses (as
module `curses`).
* The [luasocket](https://w3.impa.br/~diego/software/luasocket) library of
networking primitives (modules `socket`, `http`, `url`, `headers`, `mime`,
`ltn12`).
* The [luasec](https://github.com/brunoos/luasec) library for HTTPS support
(modules `https` and `ssl`).
* The [json.lua](https://github.com/rxi/json.lua) library for
serializing/deserializing to JSON (modules `json` and `jsonf`).
I only add to this list with great deliberation. Since it includes indirect
suppliers (suppliers of suppliers), I have an incentive to only include
suppliers who also have shallow supply chains. Minimizing the size of the
supply chain should result in more reliable software that requires less
frequent upgrades.
(Look in [the manual](https://akkartik.github.io/teliva/doc/manual.html) for
more details of what's available.)
## Why Lua?
It's reputedly the fastest interpreted language per line of implementation
code.
## Will it run any Lua program?
Not quite. My priority is providing a good experience for newcomers to
comprehend and modify the programs they use. If it's not clear how to provide
that experience for some kinds of Lua programs, I'd rather disable support for
them in Teliva and let people use regular Lua. Or other platforms!
- This approach doesn't make sense for batch programs, I think. I also don't
yet have a good story for building server programs in this way.
- I don't know how to obtain a simple, shallow graphics stack, so there's no
support for graphics at the moment.
- Teliva initializes the ncurses library by default, so apps should assume
they have access to a (color, UTF-8) text-mode window for printing text to,
and a keyboard for reading keystrokes from.
- Teliva doesn't use files for source code, so the `require` keyword no longer
makes sense. You get some libraries preloaded (see below). Beyond those,
apps should include all Lua code they want to use.
- To create a well-behaved sandbox, Teliva doesn't support adding libraries
with C bindings beyond the few it starts up with.
- Functions that start with `test_` are special. They're considered automated
tests and called without arguments every time an app starts up.
- The function `main` is special. It runs every time an app starts up, if all
its automated tests pass.
- Some functions are disabled because I don't know how to sandbox them
effectively:
- `os.execute`, `os.getenv`, `io.popen`
- `io.lines` (not a security issue; just difficult to distinguish missing
files from sandboxing issues)
- Some functions are disabled because they don't seem to make sense in an
ncurses environment. This includes the Lua notions of default files, which
start out as stdin/stdout.
- `io.input`, `io.read`
- `io.output`, `io.write`, `io.flush`
- `curses.getstr()`, `curses.mvgetstr()` (When using these it's easy for the
screen to get confusing.)
- Some functions in lcurses have [additional smarts](https://github.com/lcurses/lcurses/blob/master/lib/curses.lua).
Teliva is [consistent with the underlying ncurses](https://github.com/akkartik/teliva/blob/main/src/lcurses/curses.lua).
Look in [the manual](https://akkartik.github.io/teliva/doc/manual.html) for
more details of what's available.
I may delete more capabilities throughout this stack as I discover features
that don't fit well with the Teliva experience. If you find Teliva of use,
please [introduce yourself](http://akkartik.name/contact) to me so that I am
aware of your use cases. Anybody who is interested can gain a say in its
future direction.
## What's with the name?
Teliva is the Tamil root for ‘clear’. Very much aspirational.
## Known issues
* Colors are currently hardcoded. You get a light background even if your
terminal started out dark. To tweak colors, look for calls to
`assume_default_colors()` and `init_pair()`, either in .tlv files for a
specific app, or in the C sources for the standard code browser/editor.
* Backspace is known to not work in some configurations. As a workaround,
typing `ctrl-h` tends to work in those situations.
* Keys outside the main keyboard area are mostly not supported. This includes
the delete key when it's set away from the main keyboard area. (Macs call
the backspace key “delete”; it should behave like backspace. As
a consequence the menu sometimes mentions keys that don't work, just to
encourage people to try options.)
* chesstv.tlv silently fails on OpenBSD and NetBSD for some reason I haven't
investigated yet. Interestingly, I'm running Teliva with curses on NetBSD
but ncurses on OpenBSD, so that is probably not an issue.
* life.tlv looks terrible on OpenBSD and NetBSD, with lines wrapping halfway.
## Mirrors and Forks
Updates to Teliva can be downloaded from the following mirrors:
* https://github.com/akkartik/teliva
* https://repo.or.cz/teliva.git
* https://codeberg.org/akkartik/teliva
* https://tildegit.org/akkartik/teliva
* https://git.tilde.institute/akkartik/teliva
* https://git.sr.ht/~akkartik/teliva
* https://pagure.io/teliva
Forks of Teliva are encouraged. If you show me your fork, I'll link to it
here.
## Feedback
[Most appreciated.](http://akkartik.name/contact)
================================================
FILE: anagrams.tlv
================================================
# .tlv file generated by https://github.com/akkartik/teliva
# You may edit it if you are careful; however, you may see cryptic errors if you
# violate Teliva's assumptions.
#
# .tlv files are representations of Teliva programs. Teliva programs consist of
# sequences of definitions. Each definition is a table of key/value pairs. Keys
# and values are both strings.
#
# Lines in .tlv files always follow exactly one of the following forms:
# - comment lines at the top of the file starting with '#' at column 0
# - beginnings of definitions starting with '- ' at column 0, followed by a
# key/value pair
# - key/value pairs consisting of ' ' at column 0, containing either a
# spaceless value on the same line, or a multi-line value
# - multiline values indented by more than 2 spaces, starting with a '>'
#
# If these constraints are violated, Teliva may unceremoniously crash. Please
# report bugs at http://akkartik.name/contact
- __teliva_timestamp: original
str_helpers:
>-- some string helpers from http://lua-users.org/wiki/StringIndexing
>
>-- index characters using []
>getmetatable('').__index = function(str,i)
> if type(i) == 'number' then
> return str:sub(i,i)
> else
> return string[i]
> end
>end
>
>-- ranges using (), selected bytes using {}
>getmetatable('').__call = function(str,i,j)
> if type(i)~='table' then
> return str:sub(i,j)
> else
> local t={}
> for k,v in ipairs(i) do
> t[k]=str:sub(v,v)
> end
> return table.concat(t)
> end
>end
>
>-- iterate over an ordered sequence
>function q(x)
> if type(x) == 'string' then
> return x:gmatch('.')
> else
> return ipairs(x)
> end
>end
>
>-- insert within string
>function string.insert(str1, str2, pos)
> return str1:sub(1,pos)..str2..str1:sub(pos+1)
>end
>
>function string.remove(s, pos)
> return s:sub(1,pos-1)..s:sub(pos+1)
>end
>
>function string.pos(s, sub)
> return string.find(s, sub, 1, true) -- plain=true to disable regular expressions
>end
>
>-- TODO: backport utf-8 support from Lua 5.3
- __teliva_timestamp: original
debugy:
>debugy = 5
- __teliva_timestamp: original
dbg:
>-- helper for debug by print; overlay debug information towards the right
>-- reset debugy every time you refresh screen
>function dbg(window, s)
> local oldy = 0
> local oldx = 0
> oldy, oldx = window:getyx()
> window:mvaddstr(debugy, 60, s)
> debugy = debugy+1
> window:mvaddstr(oldy, oldx, '')
>end
- __teliva_timestamp: original
check:
>function check(x, msg)
> if x then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' '..str(x)..' is false/nil')
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
check_eq:
>function check_eq(x, expected, msg)
> if eq(x, expected) then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' expected '..str(expected)..' but got '..str(x))
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
eq:
>function eq(a, b)
> if type(a) ~= type(b) then return false end
> if type(a) == 'table' then
> if #a ~= #b then return false end
> for k, v in pairs(a) do
> if b[k] ~= v then
> return false
> end
> end
> for k, v in pairs(b) do
> if a[k] ~= v then
> return false
> end
> end
> return true
> end
> return a == b
>end
- __teliva_timestamp: original
str:
>-- smarter tostring
>-- slow; used only for debugging
>function str(x)
> if type(x) == 'table' then
> local result = ''
> result = result..#x..'{'
> for k, v in pairs(x) do
> result = result..str(k)..'='..str(v)..', '
> end
> result = result..'}'
> return result
> elseif type(x) == 'string' then
> return '"'..x..'"'
> end
> return tostring(x)
>end
- __teliva_timestamp: original
find_index:
>function find_index(arr, x)
> for n, y in ipairs(arr) do
> if x == y then
> return n
> end
> end
>end
- __teliva_timestamp: original
trim:
>function trim(s)
> return s:gsub('^%s*', ''):gsub('%s*$', '')
>end
- __teliva_timestamp: original
split:
>function split(s, d)
> result = {}
> for match in (s..d):gmatch("(.-)"..d) do
> table.insert(result, match);
> end
> return result
>end
- __teliva_timestamp: original
map:
>-- only for arrays
>function map(l, f)
> result = {}
> for _, x in ipairs(l) do
> table.insert(result, f(x))
> end
> return result
>end
- __teliva_timestamp: original
reduce:
>-- only for arrays
>function reduce(l, f, init)
> result = init
> for _, x in ipairs(l) do
> result = f(result, x)
> end
> return result
>end
- __teliva_timestamp: original
filter:
>function filter(h, f)
> result = {}
> for k, v in pairs(h) do
> if f(k, v) then
> result[k] = v
> end
> end
> return result
>end
- __teliva_timestamp: original
ifilter:
>-- only for arrays
>function ifilter(l, f)
> result = {}
> for _, x in ipairs(l) do
> if f(x) then
> table.insert(result, x)
> end
> end
> return result
>end
- __teliva_timestamp: original
sort_letters:
>function sort_letters(s)
> tmp = {}
> for i=1,#s do
> table.insert(tmp, s[i])
> end
> table.sort(tmp)
> local result = ''
> for _, c in pairs(tmp) do
> result = result..c
> end
> return result
>end
>
>function test_sort_letters(s)
> check_eq(sort_letters(''), '', 'test_sort_letters: empty')
> check_eq(sort_letters('ba'), 'ab', 'test_sort_letters: non-empty')
> check_eq(sort_letters('abba'), 'aabb', 'test_sort_letters: duplicates')
>end
- __teliva_timestamp: original
count_letters:
>-- TODO: handle unicode
>function count_letters(s)
> local result = {}
> for i=1,s:len() do
> local c = s[i]
> if result[c] == nil then
> result[c] = 1
> else
> result[c] = result[c] + 1
> end
> end
> return result
>end
- __teliva_timestamp: original
count:
>-- turn an array of elements into a map from elements to their frequency
>-- analogous to count_letters for non-strings
>function count(a)
> local result = {}
> for i, v in ipairs(a) do
> if result[v] == nil then
> result[v] = 1
> else
> result[v] = result[v] + 1
> end
> end
> return result
>end
- __teliva_timestamp: original
union:
>function union(a, b)
> for k, v in pairs(b) do
> a[k] = v
> end
> return a
>end
- __teliva_timestamp: original
subtract:
>-- set subtraction
>function subtract(a, b)
> for k, v in pairs(b) do
> a[k] = nil
> end
> return a
>end
- __teliva_timestamp: original
all:
>-- universal quantifier on sets
>function all(s, f)
> for k, v in pairs(s) do
> if not f(k, v) then
> return false
> end
> end
> return true
>end
- __teliva_timestamp: original
to_array:
>-- turn a set into an array
>-- drops values
>function to_array(h)
> local result = {}
> for k, _ in pairs(h) do
> table.insert(result, k)
> end
> return result
>end
- __teliva_timestamp: original
append:
>-- concatenate list 'elems' into 'l', modifying 'l' in the process
>function append(l, elems)
> for i=1,#elems do
> table.insert(l, elems[i])
> end
>end
- __teliva_timestamp: original
prepend:
>-- concatenate list 'elems' into the start of 'l', modifying 'l' in the process
>function prepend(l, elems)
> for i=1,#elems do
> table.insert(l, i, elems[i])
> end
>end
- __teliva_timestamp: original
all_but:
>function all_but(x, idx)
> if type(x) == 'table' then
> local result = {}
> for i, elem in ipairs(x) do
> if i ~= idx then
> table.insert(result,elem)
> end
> end
> return result
> elseif type(x) == 'string' then
> if idx < 1 then return x:sub(1) end
> return x:sub(1, idx-1) .. x:sub(idx+1)
> else
> error('all_but: unsupported type '..type(x))
> end
>end
>
>function test_all_but()
> check_eq(all_but('', 0), '', 'all_but: empty')
> check_eq(all_but('abc', 0), 'abc', 'all_but: invalid low index')
> check_eq(all_but('abc', 4), 'abc', 'all_but: invalid high index')
> check_eq(all_but('abc', 1), 'bc', 'all_but: first index')
> check_eq(all_but('abc', 3), 'ab', 'all_but: final index')
> check_eq(all_but('abc', 2), 'ac', 'all_but: middle index')
>end
- __teliva_timestamp: original
set:
>function set(l)
> local result = {}
> for i, elem in ipairs(l) do
> result[elem] = true
> end
> return result
>end
- __teliva_timestamp: original
set_eq:
>function set_eq(l1, l2)
> return eq(set(l1), set(l2))
>end
>
>function test_set_eq()
> check(set_eq({1}, {1}), 'set_eq: identical')
> check(not set_eq({1, 2}, {1, 3}), 'set_eq: different')
> check(set_eq({1, 2}, {2, 1}), 'set_eq: order')
> check(set_eq({1, 2, 2}, {2, 1}), 'set_eq: duplicates')
>end
- __teliva_timestamp: original
clear:
>function clear(lines)
> while #lines > 0 do
> table.remove(lines)
> end
>end
- __teliva_timestamp: original
zap:
>function zap(target, src)
> clear(target)
> append(target, src)
>end
- __teliva_timestamp: original
mfactorial:
>-- memoized version of factorial
>-- doesn't memoize recursive calls, but may be good enough
>mfactorial = memo1(factorial)
- __teliva_timestamp: original
factorial:
>function factorial(n)
> local result = 1
> for i=1,n do
> result = result*i
> end
> return result
>end
- __teliva_timestamp: original
memo1:
>-- a higher-order function that takes a function of a single arg
>-- (that never returns nil)
>-- and returns a memoized version of it
>function memo1(f)
> local memo = {}
> return function(x)
> if memo[x] == nil then
> memo[x] = f(x)
> end
> return memo[x]
> end
>end
>
>-- mfactorial doesn't seem noticeably faster
>function test_memo1()
> for i=0,30 do
> check_eq(mfactorial(i), factorial(i), 'memo1 over factorial: '..str(i))
> end
>end
- __teliva_timestamp: original
num_permutations:
>-- number of permutations of n distinct objects, taken r at a time
>function num_permutations(n, r)
> return factorial(n)/factorial(n-r)
>end
>
>-- mfactorial doesn't seem noticeably faster
>function test_memo1()
> for i=0,30 do
> for j=0,i do
> check_eq(num_permutations(i, j), mfactorial(i)/mfactorial(i-j), 'num_permutations memoizes: '..str(i)..'P'..str(j))
> end
> end
>end
- __teliva_timestamp: original
menu:
>-- To show app-specific hotkeys in the menu bar, add hotkey/command
>-- arrays of strings to the menu array.
>menu = {
> {'^h', 'backspace'},
>}
- __teliva_timestamp: original
Window:
>Window = curses.stdscr()
- __teliva_timestamp: original
doc:blurb:
>Show all anagrams of a given word
- __teliva_timestamp: original
word:
>word = ''
- __teliva_timestamp: original
cursor:
>cursor = 1
- __teliva_timestamp: original
main:
>function main()
> Window:nodelay(true)
> while true do
> render(Window)
> update(Window)
> end
>end
- __teliva_timestamp: original
update:
>function update(window)
> local key
> while true do
> key = window:getch()
> if key then break end
> end
> if key == curses.KEY_LEFT then
> if cursor > 1 then
> cursor = cursor-1
> end
> elseif key == curses.KEY_RIGHT then
> if cursor <= #word then
> cursor = cursor+1
> end
> elseif key == curses.KEY_BACKSPACE or key == 8 or key == 127 then -- ctrl-h, ctrl-?, delete
> if cursor > 1 then
> cursor = cursor-1
> word = word:remove(cursor)
> end
> elseif key >= 32 and key < 127 then
> word = word:insert(string.char(key), cursor-1)
> cursor = cursor+1
> end
>end
- __teliva_timestamp: original
render:
>function render(window)
> window:clear()
>
> local prompt_str = ' what is your name? '
> window:attron(curses.A_REVERSE)
> window:mvaddstr(0, 0, prompt_str)
> window:attroff(curses.A_REVERSE)
> window:addstr(' ')
> window:attron(curses.A_BOLD)
> window:addstr(word)
> window:attroff(curses.A_BOLD)
> window:mvaddstr(2, 0, '')
> local results = anagrams(word)
> if #results > 0 then
> window:attron(curses.A_REVERSE)
> print(#results..' anagrams')
> window:attroff(curses.A_REVERSE)
> for i, w in ipairs(results) do
> window:addstr(w)
> window:addstr(' ')
> end
> end
>
> window:mvaddstr(0, string.len(prompt_str)+cursor, '')
> window:refresh()
>end
- __teliva_timestamp:
>Mon Feb 21 17:42:28 2022
anagrams:
>function anagrams(word)
> return gather(sort_letters(word))
>end
- __teliva_timestamp:
>Mon Feb 21 18:18:07 2022
gather:
>function gather(s)
> if s == '' then return {} end
> local result = {}
> for i=1, #s do
> if i == 1 or s[i] ~= s[i-1] then
> append(result, combine(s[i], gather(all_but(s, i))))
> end
> end
> return result
>end
- __teliva_timestamp: original
__teliva_note:
>basic version
combine:
>-- return 'l' with each element prefixed with 'prefix'
>function combine(prefix, l)
> if #l == 0 then return {prefix} end
> local result = {}
> for _, elem in ipairs(l) do
> table.insert(result, prefix..elem)
> end
> return result
>end
>
>function test_combine()
> check_eq(combine('abc', {}), {'abc'}, 'test_combine: empty list')
>end
- __teliva_timestamp:
>Sat Mar 5 15:24:00 2022
count_anagrams:
>function count_anagrams(s)
> local result = factorial(s:len())
> local letter_counts = count_letters(s)
> for l, cnt in pairs(letter_counts) do
> result = result / factorial(cnt)
> end
> return result
>end
- __teliva_timestamp:
>Sat Mar 5 15:53:23 2022
key_pressed:
>-- only works when nodelay (non-blocking keyboard)
>function key_pressed(window)
> local c = window:getch()
> if c == nil then return false end
> window:ungetch(c)
> return true
>end
- __teliva_timestamp:
>Sat Mar 5 15:55:34 2022
render:
>function render(window)
> window:clear()
>
> local prompt_str = ' what is your name? '
> window:attron(curses.A_REVERSE)
> window:mvaddstr(0, 0, prompt_str)
> window:attroff(curses.A_REVERSE)
> window:addstr(' ')
> window:attron(curses.A_BOLD)
> window:addstr(word)
> window:attroff(curses.A_BOLD)
> window:mvaddstr(2, 0, '')
> if #word > 0 then
> local num_anagrams = count_anagrams(word)
> window:attron(curses.A_REVERSE)
> print(num_anagrams..' anagrams')
> window:attroff(curses.A_REVERSE)
> local results = anagrams(word)
> if results == nil then -- interrupted
> window:addstr('...')
> else
> assert(#results == num_anagrams, "something's wrong; the count is unexpected")
> for i, w in ipairs(results) do
> window:addstr(w)
> window:addstr(' ')
> if key_pressed(window) then
> break
> end
> end
> end
> end
>
> window:mvaddstr(0, string.len(prompt_str)+cursor, '')
> window:refresh()
>end
- __teliva_timestamp:
>Sat Mar 5 15:56:35 2022
__teliva_note:
>restart computation when a key is pressed
gather:
>-- return a list of unique permutations of a sorted string 's'
>-- the letters in 's' must be in alphabetical order, so that duplicates are adjacent
>-- this function can take a long time for long strings, so we make it interruptible
>-- if a key is pressed, it returns nil
>-- since it's recursive, we also need to handle recursive calls returning nil
>function gather(s)
> if s == '' then return {} end
> local result = {}
> for i=1, #s do
> if i == 1 or s[i] ~= s[i-1] then
> local subresult = gather(all_but(s, i))
> if subresult == nil then return nil end -- interrupted
> append(result, combine(s[i], subresult))
> end
> if key_pressed(Window) then return nil end -- interrupted
> end
> return result
>end
================================================
FILE: break.tlv
================================================
# .tlv file generated by https://github.com/akkartik/teliva
# You may edit it if you are careful; however, you may see cryptic errors if you
# violate Teliva's assumptions.
#
# .tlv files are representations of Teliva programs. Teliva programs consist of
# sequences of definitions. Each definition is a table of key/value pairs. Keys
# and values are both strings.
#
# Lines in .tlv files always follow exactly one of the following forms:
# - comment lines at the top of the file starting with '#' at column 0
# - beginnings of definitions starting with '- ' at column 0, followed by a
# key/value pair
# - key/value pairs consisting of ' ' at column 0, containing either a
# spaceless value on the same line, or a multi-line value
# - multiline values indented by more than 2 spaces, starting with a '>'
#
# If these constraints are violated, Teliva may unceremoniously crash. Please
# report bugs at http://akkartik.name/contact
- __teliva_timestamp: original
str_helpers:
>-- some string helpers from http://lua-users.org/wiki/StringIndexing
>
>-- index characters using []
>getmetatable('').__index = function(str,i)
> if type(i) == 'number' then
> return str:sub(i,i)
> else
> return string[i]
> end
>end
>
>-- ranges using (), selected bytes using {}
>getmetatable('').__call = function(str,i,j)
> if type(i)~='table' then
> return str:sub(i,j)
> else
> local t={}
> for k,v in ipairs(i) do
> t[k]=str:sub(v,v)
> end
> return table.concat(t)
> end
>end
>
>-- iterate over an ordered sequence
>function q(x)
> if type(x) == 'string' then
> return x:gmatch('.')
> else
> return ipairs(x)
> end
>end
>
>-- insert within string
>function string.insert(str1, str2, pos)
> return str1:sub(1,pos)..str2..str1:sub(pos+1)
>end
>
>function string.remove(s, pos)
> return s:sub(1,pos-1)..s:sub(pos+1)
>end
>
>function string.pos(s, sub)
> return string.find(s, sub, 1, true) -- plain=true to disable regular expressions
>end
>
>-- TODO: backport utf-8 support from Lua 5.3
- __teliva_timestamp: original
debugy:
>debugy = 5
- __teliva_timestamp: original
dbg:
>-- helper for debug by print; overlay debug information towards the right
>-- reset debugy every time you refresh screen
>function dbg(window, s)
> local oldy = 0
> local oldx = 0
> oldy, oldx = window:getyx()
> window:mvaddstr(debugy, 60, s)
> debugy = debugy+1
> window:mvaddstr(oldy, oldx, '')
>end
- __teliva_timestamp: original
check:
>function check(x, msg)
> if x then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' '..str(x)..' is false/nil')
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
check_eq:
>function check_eq(x, expected, msg)
> if eq(x, expected) then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' expected '..str(expected)..' but got '..str(x))
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
eq:
>function eq(a, b)
> if type(a) ~= type(b) then return false end
> if type(a) == 'table' then
> if #a ~= #b then return false end
> for k, v in pairs(a) do
> if b[k] ~= v then
> return false
> end
> end
> for k, v in pairs(b) do
> if a[k] ~= v then
> return false
> end
> end
> return true
> end
> return a == b
>end
- __teliva_timestamp: original
str:
>-- smarter tostring
>-- slow; used only for debugging
>function str(x)
> if type(x) == 'table' then
> local result = ''
> result = result..#x..'{'
> for k, v in pairs(x) do
> result = result..str(k)..'='..str(v)..', '
> end
> result = result..'}'
> return result
> elseif type(x) == 'string' then
> return '"'..x..'"'
> end
> return tostring(x)
>end
- __teliva_timestamp: original
find_index:
>function find_index(arr, x)
> for n, y in ipairs(arr) do
> if x == y then
> return n
> end
> end
>end
- __teliva_timestamp: original
trim:
>function trim(s)
> return s:gsub('^%s*', ''):gsub('%s*$', '')
>end
- __teliva_timestamp: original
split:
>function split(s, d)
> result = {}
> for match in (s..d):gmatch("(.-)"..d) do
> table.insert(result, match);
> end
> return result
>end
- __teliva_timestamp: original
map:
>-- only for arrays
>function map(l, f)
> result = {}
> for _, x in ipairs(l) do
> table.insert(result, f(x))
> end
> return result
>end
- __teliva_timestamp: original
reduce:
>-- only for arrays
>function reduce(l, f, init)
> result = init
> for _, x in ipairs(l) do
> result = f(result, x)
> end
> return result
>end
- __teliva_timestamp: original
filter:
>function filter(h, f)
> result = {}
> for k, v in pairs(h) do
> if f(k, v) then
> result[k] = v
> end
> end
> return result
>end
- __teliva_timestamp: original
ifilter:
>-- only for arrays
>function ifilter(l, f)
> result = {}
> for _, x in ipairs(l) do
> if f(x) then
> table.insert(result, x)
> end
> end
> return result
>end
- __teliva_timestamp: original
sort_letters:
>function sort_letters(s)
> tmp = {}
> for i=1,#s do
> table.insert(tmp, s[i])
> end
> table.sort(tmp)
> local result = ''
> for _, c in pairs(tmp) do
> result = result..c
> end
> return result
>end
>
>function test_sort_letters(s)
> check_eq(sort_letters(''), '', 'test_sort_letters: empty')
> check_eq(sort_letters('ba'), 'ab', 'test_sort_letters: non-empty')
> check_eq(sort_letters('abba'), 'aabb', 'test_sort_letters: duplicates')
>end
- __teliva_timestamp: original
count_letters:
>-- TODO: handle unicode
>function count_letters(s)
> local result = {}
> for i=1,s:len() do
> local c = s[i]
> if result[c] == nil then
> result[c] = 1
> else
> result[c] = result[c] + 1
> end
> end
> return result
>end
- __teliva_timestamp: original
count:
>-- turn an array of elements into a map from elements to their frequency
>-- analogous to count_letters for non-strings
>function count(a)
> local result = {}
> for i, v in ipairs(a) do
> if result[v] == nil then
> result[v] = 1
> else
> result[v] = result[v] + 1
> end
> end
> return result
>end
- __teliva_timestamp: original
union:
>function union(a, b)
> for k, v in pairs(b) do
> a[k] = v
> end
> return a
>end
- __teliva_timestamp: original
subtract:
>-- set subtraction
>function subtract(a, b)
> for k, v in pairs(b) do
> a[k] = nil
> end
> return a
>end
- __teliva_timestamp: original
all:
>-- universal quantifier on sets
>function all(s, f)
> for k, v in pairs(s) do
> if not f(k, v) then
> return false
> end
> end
> return true
>end
- __teliva_timestamp: original
to_array:
>-- turn a set into an array
>-- drops values
>function to_array(h)
> local result = {}
> for k, _ in pairs(h) do
> table.insert(result, k)
> end
> return result
>end
- __teliva_timestamp: original
append:
>-- concatenate list 'elems' into 'l', modifying 'l' in the process
>function append(l, elems)
> for i=1,#elems do
> table.insert(l, elems[i])
> end
>end
- __teliva_timestamp: original
prepend:
>-- concatenate list 'elems' into the start of 'l', modifying 'l' in the process
>function prepend(l, elems)
> for i=1,#elems do
> table.insert(l, i, elems[i])
> end
>end
- __teliva_timestamp: original
all_but:
>function all_but(x, idx)
> if type(x) == 'table' then
> local result = {}
> for i, elem in ipairs(x) do
> if i ~= idx then
> table.insert(result,elem)
> end
> end
> return result
> elseif type(x) == 'string' then
> if idx < 1 then return x:sub(1) end
> return x:sub(1, idx-1) .. x:sub(idx+1)
> else
> error('all_but: unsupported type '..type(x))
> end
>end
>
>function test_all_but()
> check_eq(all_but('', 0), '', 'all_but: empty')
> check_eq(all_but('abc', 0), 'abc', 'all_but: invalid low index')
> check_eq(all_but('abc', 4), 'abc', 'all_but: invalid high index')
> check_eq(all_but('abc', 1), 'bc', 'all_but: first index')
> check_eq(all_but('abc', 3), 'ab', 'all_but: final index')
> check_eq(all_but('abc', 2), 'ac', 'all_but: middle index')
>end
- __teliva_timestamp: original
set:
>function set(l)
> local result = {}
> for i, elem in ipairs(l) do
> result[elem] = true
> end
> return result
>end
- __teliva_timestamp: original
set_eq:
>function set_eq(l1, l2)
> return eq(set(l1), set(l2))
>end
>
>function test_set_eq()
> check(set_eq({1}, {1}), 'set_eq: identical')
> check(not set_eq({1, 2}, {1, 3}), 'set_eq: different')
> check(set_eq({1, 2}, {2, 1}), 'set_eq: order')
> check(set_eq({1, 2, 2}, {2, 1}), 'set_eq: duplicates')
>end
- __teliva_timestamp: original
clear:
>function clear(lines)
> while #lines > 0 do
> table.remove(lines)
> end
>end
- __teliva_timestamp: original
zap:
>function zap(target, src)
> clear(target)
> append(target, src)
>end
- __teliva_timestamp: original
mfactorial:
>-- memoized version of factorial
>-- doesn't memoize recursive calls, but may be good enough
>mfactorial = memo1(factorial)
- __teliva_timestamp: original
factorial:
>function factorial(n)
> local result = 1
> for i=1,n do
> result = result*i
> end
> return result
>end
- __teliva_timestamp: original
memo1:
>-- a higher-order function that takes a function of a single arg
>-- (that never returns nil)
>-- and returns a memoized version of it
>function memo1(f)
> local memo = {}
> return function(x)
> if memo[x] == nil then
> memo[x] = f(x)
> end
> return memo[x]
> end
>end
>
>-- mfactorial doesn't seem noticeably faster
>function test_memo1()
> for i=0,30 do
> check_eq(mfactorial(i), factorial(i), 'memo1 over factorial: '..str(i))
> end
>end
- __teliva_timestamp: original
num_permutations:
>-- number of permutations of n distinct objects, taken r at a time
>function num_permutations(n, r)
> return factorial(n)/factorial(n-r)
>end
>
>-- mfactorial doesn't seem noticeably faster
>function test_memo1()
> for i=0,30 do
> for j=0,i do
> check_eq(num_permutations(i, j), mfactorial(i)/mfactorial(i-j), 'num_permutations memoizes: '..str(i)..'P'..str(j))
> end
> end
>end
- __teliva_timestamp: original
menu:
>-- To show app-specific hotkeys in the menu bar, add hotkey/command
>-- arrays of strings to the menu array.
>menu = {}
- __teliva_timestamp: original
Window:
>Window = curses.stdscr()
- __teliva_timestamp: original
window:
>-- constructor for fake screen and window
>-- call it like this:
>-- local w = window{
>-- kbd=kbd('abc'),
>-- scr=scr{h=5, w=4},
>-- }
>-- eventually it'll do everything a real ncurses window can
>function window(h)
> h.__index = h
> setmetatable(h, h)
> h.__index = function(table, key)
> return rawget(h, key)
> end
> h.attrset = function(self, x)
> self.scr.attrs = x
> end
> h.attron = function(self, x)
> -- currently same as attrset since Lua 5.1 doesn't have bitwise operators
> -- doesn't support multiple attrs at once
>-- local old = self.scr.attrs
>-- self.scr.attrs = old|x
> self.scr.attrs = x
> end
> h.attroff = function(self, x)
> -- currently borked since Lua 5.1 doesn't have bitwise operators
> -- doesn't support multiple attrs at once
>-- local old = self.scr.attrs
>-- self.scr.attrs = old & (~x)
> self.scr.attrs = curses.A_NORMAL
> end
> h.getch = function(self)
> local c = table.remove(h.kbd, 1)
> if c == nil then return c end
> return string.byte(c) -- for verisimilitude with ncurses
> end
> h.addch = function(self, c)
> local scr = self.scr
> if c == '\n' then
> scr.cursy = scr.cursy+1
> scr.cursx = 0
> return
> end
> if scr.cursy <= scr.h then
> scr[scr.cursy][scr.cursx] = {data=c, attrs=scr.attrs}
> scr.cursx = scr.cursx+1
> if scr.cursx > scr.w then
> scr.cursy = scr.cursy+1
> scr.cursx = 1
> end
> end
> end
> h.addstr = function(self, s)
> for i=1,s:len() do
> self:addch(s[i])
> end
> end
> h.mvaddch = function(self, y, x, c)
> self.scr.cursy = y
> self.scr.cursx = x
> self:addch(c)
> end
> h.mvaddstr = function(self, y, x, s)
> self.scr.cursy = y
> self.scr.cursx = x
> self:addstr(s)
> end
> h.clear = function(self)
> clear_scr(self.scr)
> end
> h.refresh = function(self)
> -- nothing
> end
> return h
>end
- __teliva_timestamp: original
kbd:
>function kbd(keys)
> local result = {}
> for i=1,keys:len() do
> table.insert(result, keys[i])
> end
> return result
>end
- __teliva_timestamp: original
scr:
>function scr(props)
> props.cursx = 1
> props.cursy = 1
> clear_scr(props)
> return props
>end
- __teliva_timestamp: original
clear_scr:
>function clear_scr(props)
> props.cursy = 1
> props.cursx = 1
> for y=1,props.h do
> props[y] = {}
> for x=1,props.w do
> props[y][x] = {data=' ', attrs=curses.A_NORMAL}
> end
> end
> return props
>end
- __teliva_timestamp: original
check_screen:
>function check_screen(window, contents, message)
> local x, y = 1, 1
> for i=1,contents:len() do
> check_eq(window.scr[y][x].data, contents[i], message..'/'..y..','..x)
> x = x+1
> if x > window.scr.w then
> y = y+1
> x = 1
> end
> end
>end
>
>-- putting it all together, an example test of both keyboard and screen
>function test_check_screen()
> local lines = {
> c='123',
> d='234',
> a='345',
> b='456',
> }
> local w = window{
> kbd=kbd('abc'),
> scr=scr{h=3, w=5},
> }
> local y = 1
> while true do
> local b = w:getch()
> if b == nil then break end
> w:mvaddstr(y, 1, lines[string.char(b)])
> y = y+1
> end
> check_screen(w, '345 '..
> '456 '..
> '123 ',
> 'test_check_screen')
>end
- __teliva_timestamp: original
check_reverse:
>function check_reverse(window, contents, message)
> local x, y = 1, 1
> for i=1,contents:len() do
> if contents[i] ~= ' ' then
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & curses.A_REVERSE, message..'/'..y..','..x)
> check_eq(window.scr[y][x].attrs, curses.A_REVERSE, message..'/'..y..','..x)
> else
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & (~curses.A_REVERSE), message..'/'..y..','..x)
> check(window.scr[y][x].attrs ~= curses.A_REVERSE, message..'/'..y..','..x)
> end
> x = x+1
> if x > window.scr.w then
> y = y+1
> x = 1
> end
> end
>end
- __teliva_timestamp: original
check_bold:
>function check_bold(window, contents, message)
> local x, y = 1, 1
> for i=1,contents:len() do
> if contents[i] ~= ' ' then
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & curses.A_BOLD, message..'/'..y..','..x)
> check_eq(window.scr[y][x].attrs, curses.A_BOLD, message..'/'..y..','..x)
> else
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & (~curses.A_BOLD), message..'/'..y..','..x)
> check(window.scr[y][x].attrs ~= curses.A_BOLD, message..'/'..y..','..x)
> end
> x = x+1
> if x > window.scr.w then
> y = y+1
> x = 1
> end
> end
>end
- __teliva_timestamp: original
check_color:
>-- check which parts of a screen have the given color_pair
>function check_color(window, cp, contents, message)
> local x, y = 1, 1
> for i=1,contents:len() do
> if contents[i] ~= ' ' then
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & curses.color_pair(cp), message..'/'..y..','..x)
> check_eq(window.scr[y][x].attrs, curses.color_pair(cp), message..'/'..y..','..x)
> else
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & (~curses.A_BOLD), message..'/'..y..','..x)
> check(window.scr[y][x].attrs ~= curses.color_pair(cp), message..'/'..y..','..x)
> end
> x = x+1
> if x > window.scr.w then
> y = y+1
> x = 1
> end
> end
>end
- __teliva_timestamp: original
sep:
>-- horizontal separator
>function sep(window)
> local y, _ = window:getyx()
> window:mvaddstr(y+1, 0, '')
> local _, cols = window:getmaxyx()
> for col=1,cols do
> window:addstr('_')
> end
>end
- __teliva_timestamp: original
render:
>function render(window)
> window:clear()
> -- draw stuff to screen here
> window:attron(curses.A_BOLD)
> window:mvaddstr(1, 5, "example app")
> window:attrset(curses.A_NORMAL)
> for i=0,15 do
> window:attrset(curses.color_pair(i))
> window:mvaddstr(3+i, 5, "========================")
> end
> window:refresh()
>end
- __teliva_timestamp: original
update:
>function update(window)
> local key = window:getch()
> -- process key here
>end
- __teliva_timestamp: original
init_colors:
>function init_colors()
> for i=0,7 do
> curses.init_pair(i, i, -1)
> end
> curses.init_pair(8, 7, 0)
> curses.init_pair(9, 7, 1)
> curses.init_pair(10, 7, 2)
> curses.init_pair(11, 7, 3)
> curses.init_pair(12, 7, 4)
> curses.init_pair(13, 7, 5)
> curses.init_pair(14, 7, 6)
> curses.init_pair(15, -1, 15)
>end
- __teliva_timestamp: original
main:
>function main()
> init_colors()
>
> while true do
> render(Window)
> update(Window)
> end
>end
- __teliva_timestamp:
>Thu Mar 17 21:21:29 2022
program:
>program = {lines = nil, cursor = nil}
>-- lines: [line]
>-- cursor: int, index into lines
>-- line: {[word], cursor}
>-- word: {string, cursor}
- __teliva_timestamp:
>Thu Mar 17 21:27:38 2022
render:
>function render(window)
> local key = window:getch()
> for row, line in ipair(program.lines) do
> for col, word in ipair(line.words) do
> window:addstr(word)
> window:addstr(' ')
> end
> window:addstr('\n')
> end
>end
- __teliva_timestamp:
>Thu Mar 17 21:28:39 2022
render:
>function render(window)
> local key = window:getch()
> for row, line in ipairs(program.lines) do
> for col, word in pairs(line.words) do
> window:addstr(word)
> window:addstr(' ')
> end
> window:addstr('\n')
> end
>end
- __teliva_timestamp:
>Thu Mar 17 21:31:33 2022
Program:
>Program = {
> cursor_y = 1,
> lines = {
> {
> cursor_x = 1,
> words = {
> {
> cursor = 0,
> data = '',
> },
> },
> },
> },
>}
>
>
>
>
>
- __teliva_timestamp:
>Thu Mar 17 21:32:05 2022
render:
>function render(window)
> window:clear()
> for row, line in ipairs(program.lines) do
> for col, word in pairs(line.words) do
> window:addstr(word)
> window:addstr(' ')
> end
> window:addstr('\n')
> end
> window:refresh()
>end
- __teliva_timestamp:
>Thu Mar 17 21:32:22 2022
render:
>function render(window)
> window:clear()
> for row, line in ipairs(program.lines) do
> for col, word in pairs(line.words) do
> window:addstr(word.data)
> window:addstr(' ')
> end
> window:addstr('\n')
> end
> window:refresh()
>end
- __teliva_timestamp:
>Thu Mar 17 21:33:00 2022
update:
>function update(window)
> local key = window:getch()
> if key == ' ' then
> print('space')
> window:getch()
> end
>end
- __teliva_timestamp:
>Thu Mar 17 21:33:17 2022
update:
>function update(window)
> local key = window:getch()
> if key == string.byte(' ') then
> print('space')
> window:getch()
> end
>end
- __teliva_timestamp:
>Thu Mar 17 21:33:31 2022
update:
>function update(window)
> local key = string.char(window:getch())
> if key == ' ' then
> print('space')
> window:getch()
> end
>end
- __teliva_timestamp:
>Thu Mar 17 21:36:14 2022
__teliva_note:
>very initial skeleton
>- just render, no eval
>- no stack rendering
>- no cursor (just appends)
update:
>function update(window)
> local key = string.char(window:getch())
> if key == ' ' then
> table.insert(program.lines[1].words, {data='', cursor=0})
> else
> local words = program.lines[1].words
> words[#words].data = words[#words].data .. key
> end
>end
- __teliva_timestamp:
>Thu Mar 17 21:39:24 2022
main:
>function main()
> init_colors()
>
> while true do
> render(Window)
> update(Window)
> end
>end
>
>function test_basic_render()
>
- __teliva_timestamp:
>Thu Mar 17 21:43:05 2022
main:
>function main()
> init_colors()
>
> while true do
> render(Window, Program)
> update(Window, Program)
> end
>end
- __teliva_timestamp:
>Thu Mar 17 21:43:11 2022
render:
>function render(window, program)
> window:clear()
> for row, line in ipairs(program.lines) do
> for col, word in pairs(line.words) do
> window:addstr(word.data)
> window:addstr(' ')
> end
> window:addstr('\n')
> end
> window:refresh()
>end
>
>function test_render()
> local w = window{
> kbd=kbd(''),
> scr=scr{h=3, w=5},
> }
>end
- __teliva_timestamp:
>Thu Mar 17 21:43:20 2022
update:
>function update(window, program, key)
> if key == ' ' then
> table.insert(program.lines[1].words, {data='', cursor=0})
> else
> local words = program.lines[1].words
> words[#words].data = words[#words].data .. key
> end
>end
- __teliva_timestamp:
>Thu Mar 17 21:58:10 2022
Program:
>Program = empty_program()
- __teliva_timestamp:
>Thu Mar 17 21:58:10 2022
empty_program:
>function empty_program()
> return {
> cursor_y = 1,
> lines = {
> {
> cursor_x = 1,
> words = {
> {
> cursor = 0,
> data = '',
> },
> },
> },
> },
> }
>end
- __teliva_timestamp:
>Thu Mar 17 22:36:24 2022
render:
>function render(window, program)
> window:clear()
> for row, line in ipairs(program.lines) do
> for col, word in pairs(line.words) do
> window:addstr(word.data)
> window:addstr(' ')
> end
> window:addstr('\n')
> end
> window:refresh()
>end
- __teliva_timestamp:
>Thu Mar 17 22:41:01 2022
__teliva_note:
>a passing test
main:
>function main()
> init_colors()
>
> while true do
> render(Window, Program)
> local key = string.char(Window:getch()) -- nodelay can't be set
> update(Window, Program, key)
> end
>end
>
>function test_incomplete()
> local w = window{
> kbd=kbd('ab c'),
> scr=scr{h=3, w=5},
> }
> local prog = empty_program()
> while true do
> render(w, prog)
> local key = w:getch()
> if key == nil then break end
> update(w, prog, string.char(key))
> end
> check_screen(w, 'ab c '..
> ' '..
> ' ',
> 'test_main_incomplete')
>end
- __teliva_timestamp: original
doc:blurb:
>A concatenative programming language with a live-updating debug UI.
>by Kartik Agaram and Sumeet Agarwal
>
>Highly incomplete.
>
>Previous prototypes:
> - https://archive.org/details/akkartik-2min-2020-12-06
> - https://merveilles.town/@akkartik/105759816342173743
================================================
FILE: chesstv.tlv
================================================
# .tlv file generated by https://github.com/akkartik/teliva
# You may edit it if you are careful; however, you may see cryptic errors if you
# violate Teliva's assumptions.
#
# .tlv files are representations of Teliva programs. Teliva programs consist of
# sequences of definitions. Each definition is a table of key/value pairs. Keys
# and values are both strings.
#
# Lines in .tlv files always follow exactly one of the following forms:
# - comment lines at the top of the file starting with '#' at column 0
# - beginnings of definitions starting with '- ' at column 0, followed by a
# key/value pair
# - key/value pairs consisting of ' ' at column 0, containing either a
# spaceless value on the same line, or a multi-line value
# - multiline values indented by more than 2 spaces, starting with a '>'
#
# If these constraints are violated, Teliva may unceremoniously crash. Please
# report bugs at http://akkartik.name/contact
- __teliva_timestamp: original
check:
>function check(x, msg)
> if x then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' '..str(x)..' is false/nil')
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
check_eq:
>function check_eq(x, expected, msg)
> if eq(x, expected) then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' expected '..str(expected)..' but got '..str(x))
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
eq:
>function eq(a, b)
> if type(a) ~= type(b) then return false end
> if type(a) == 'table' then
> if #a ~= #b then return false end
> for k, v in pairs(a) do
> if b[k] ~= v then
> return false
> end
> end
> for k, v in pairs(b) do
> if a[k] ~= v then
> return false
> end
> end
> return true
> end
> return a == b
>end
- __teliva_timestamp: original
str:
>-- smarter tostring
>-- slow; used only for debugging
>function str(x)
> if type(x) == 'table' then
> local result = ''
> result = result..#x..'{'
> for k, v in pairs(x) do
> result = result..str(k)..'='..str(v)..', '
> end
> result = result..'}'
> return result
> elseif type(x) == 'string' then
> return '"'..x..'"'
> end
> return tostring(x)
>end
- __teliva_timestamp: original
Window:
>Window = curses.stdscr()
>-- animation-based app
>Window:nodelay(true)
>lines, cols = Window:getmaxyx()
- __teliva_timestamp: original
current_game:
>current_game = {}
- __teliva_timestamp: original
piece_glyph:
>piece_glyph = {
> -- for legibility, white pieces also use unicode glyphs for black pieces
> -- we rely on colors to distinguish them
> K = 0x265a,
> Q = 0x265b,
> R = 0x265c,
> B = 0x265d,
> N = 0x265e,
> P = 0x265f,
> k = 0x265a,
> q = 0x265b,
> r = 0x265c,
> b = 0x265d,
> n = 0x265e,
> p = 0x265f,
>}
- __teliva_timestamp: original
top_player:
>function top_player(current_game)
> if current_game.players[1].color == "black" then
> return current_game.players[1]
> end
> return current_game.players[2]
>end
- __teliva_timestamp: original
bottom_player:
>function bottom_player(current_game)
> if current_game.players[1].color == "white" then
> return current_game.players[1]
> end
> return current_game.players[2]
>end
- __teliva_timestamp: original
render_player:
>function render_player(y, x, player)
> Window:mvaddstr(y, x, player.user.name)
> Window:addstr(" · ")
> Window:addstr(tostring(player.rating))
>end
- __teliva_timestamp: original
render_square:
>function render_square(current_game, rank, file, highlighted_squares)
> -- decide whether to highlight
> local hl = 0
> if (rank == highlighted_squares.from.rank and file == highlighted_squares.from.file)
> or (rank == highlighted_squares.to.rank and file == highlighted_squares.to.file) then
> hl = 4
> end
> if (rank+file)%2 == 1 then
> -- light square
> Window:attrset(curses.color_pair(1+hl))
> else
> -- dark square
> Window:attrset(curses.color_pair(3+hl))
> end
> Window:mvaddstr((8 - rank + 1)*3, file*5, " ")
> Window:mvaddstr((8 - rank + 1)*3+1, file*5, " ")
> Window:mvaddstr((8 - rank + 1)*3+2, file*5, " ")
> Window:attrset(curses.A_NORMAL)
>end
- __teliva_timestamp: original
render_fen_rank:
>function render_fen_rank(rank, fen_rank, highlighted_squares)
> local file = 1
> for x in fen_rank:gmatch(".") do
> if x:match("%d") then
> file = file + tonumber(x)
> else
> -- decide whether to highlight
> local hl = 0
> if (rank == highlighted_squares.from.rank and file == highlighted_squares.from.file)
> or (rank == highlighted_squares.to.rank and file == highlighted_squares.to.file) then
> hl = 4
> end
> if (rank+file)%2 == 1 then
> if x < 'Z' then
> -- white piece on light square
> Window:attrset(curses.color_pair(1+hl))
> else
> -- black piece on light square
> Window:attrset(curses.color_pair(2+hl))
> end
> else
> if x < 'Z' then
> -- white piece on dark square
> Window:attrset(curses.color_pair(3+hl))
> else
> -- black piece on dark square
> Window:attrset(curses.color_pair(4+hl))
> end
> end
> Window:mvaddstr((8 - rank + 1)*3+1, file*5+2, utf8(piece_glyph[x]))
> Window:attrset(curses.A_NORMAL)
> file = file + 1
> end
> end
>end
- __teliva_timestamp: original
render_time:
>function render_time(y, x, seconds)
> if seconds == nil then return end
> Window:mvaddstr(y, x, tostring(math.floor(seconds/60)))
> Window:addstr(string.format(":%02d", seconds%60))
>end
- __teliva_timestamp: original
render_board:
>function render_board(current_game)
>--? Window:mvaddstr(1, 50, dump(current_game.fen))
>--? Window:mvaddstr(6, 50, dump(current_game.previously_moved_squares))
> render_player(2, 5, top_player(current_game))
> render_time(2, 35, current_game.bc)
> for rank=8,1,-1 do
> for file=1,8 do
> render_square(current_game, rank, file, current_game.previously_moved_squares)
> end
> render_fen_rank(rank, current_game.fen_rank[8-rank+1], current_game.previously_moved_squares)
> end
> render_player(27, 5, bottom_player(current_game))
> render_time(27, 35, current_game.wc)
>end
- __teliva_timestamp: original
parse_lm:
>function parse_lm(move)
>--? Window:mvaddstr(4, 50, move)
> local file1 = string.byte(move:sub(1, 1)) - 96 -- 'a'-1
> local rank1 = string.byte(move:sub(2, 2)) - 48 -- '0'
> local file2 = string.byte(move:sub(3, 3)) - 96 -- 'a'-1
> local rank2 = string.byte(move:sub(4, 4)) - 48 -- '0'
>--? Window:mvaddstr(5, 50, dump({{rank1, file1}, {rank2, file2}}))
> return {from={rank=rank1, file=file1}, to={rank=rank2, file=file2}}
>end
- __teliva_timestamp: original
render:
>function render(chunk)
> local o = json.decode(chunk)
> if o.t == "featured" then
> current_game = o.d
>--? current_game.lm = "__"
> current_game.previously_moved_squares = {from={rank=0, file=0}, to={rank=0, file=0}} -- no highlight
> else
> current_game.fen = o.d.fen
> current_game.wc = o.d.wc
> current_game.bc = o.d.bc
>--? current_game.lm = o.d.lm
> current_game.previously_moved_squares = parse_lm(o.d.lm)
>--? Window:nodelay(false)
>--? Window:mvaddstr(3, 50, "paused")
> end
> current_game.fen_rank = split(current_game.fen, "%w+")
> render_board(current_game)
> Window:refresh()
>end
- __teliva_timestamp: original
init_colors:
>function init_colors()
> -- colors
> local light_piece = 1
> local dark_piece = 0
> local light_square = 252
> local dark_square = 242
> local light_last_moved_square = 229
> local dark_last_moved_square = 226
> -- initialize colors
> curses.init_pair(1, light_piece, light_square)
> curses.init_pair(2, dark_piece, light_square)
> curses.init_pair(3, light_piece, dark_square)
> curses.init_pair(4, dark_piece, dark_square)
> curses.init_pair(5, light_piece, light_last_moved_square)
> curses.init_pair(6, dark_piece, light_last_moved_square)
> curses.init_pair(7, light_piece, dark_last_moved_square)
> curses.init_pair(8, dark_piece, dark_last_moved_square)
>end
- __teliva_timestamp: original
main:
>function main()
> init_colors()
> local request = {
> url = "https://lichess.org/api/tv/feed",
> sink = function(chunk, err)
> if chunk then
> Window:clear()
> render(chunk)
> Window:getch()
> end
> return 1
> end,
> }
> http.request(request)
>end
- __teliva_timestamp: original
utf8:
>-- https://stackoverflow.com/questions/7983574/how-to-write-a-unicode-symbol-in-lua
>function utf8(decimal)
> local bytemarkers = { {0x7FF,192}, {0xFFFF,224}, {0x1FFFFF,240} }
> if decimal<128 then return string.char(decimal) end
> local charbytes = {}
> for bytes,vals in ipairs(bytemarkers) do
> if decimal<=vals[1] then
> for b=bytes+1,2,-1 do
> local mod = decimal%64
> decimal = (decimal-mod)/64
> charbytes[b] = string.char(128+mod)
> end
> charbytes[1] = string.char(vals[2]+decimal)
> break
> end
> end
> return table.concat(charbytes)
>end
- __teliva_timestamp: original
split:
>function split(s, pat)
> result = {}
> for x in s:gmatch(pat) do
> table.insert(result, x)
> end
> return result
>end
- __teliva_timestamp: original
dump:
>-- https://stackoverflow.com/questions/9168058/how-to-dump-a-table-to-console
>function dump(o)
> if type(o) == 'table' then
> local s = '{ '
> for k,v in pairs(o) do
> if type(k) ~= 'number' then k = '"'..k..'"' end
> s = s .. '['..k..'] = ' .. dump(v) .. ','
> end
> return s .. '} '
> else
> return tostring(o)
> end
>end
- __teliva_timestamp:
>Sat Feb 12 18:57:02 2022
__teliva_note:
>better UX when app isn't permitted to access the network
main:
>function main()
> init_colors()
> local request = {
> url = "https://lichess.org/api/tv/feed",
> sink = function(chunk, err)
> if chunk then
> Window:clear()
> -- main event loop is here
> render(chunk)
> Window:getch()
> end
> return 1
> end,
> }
> http.request(request)
> -- degenerate event loop just to show errors in sandboxing, etc.
> while true do Window:getch(); end
>end
- __teliva_timestamp:
>Thu Feb 17 20:00:23 2022
doc:blurb:
>A demo of Teliva's support for networking: watch the current live chess game from Lichess TV.
>
>Compare with https://lichess.org/tv on a browser.
================================================
FILE: counter.tlv
================================================
# .tlv file generated by https://github.com/akkartik/teliva
# You may edit it if you are careful; however, you may see cryptic errors if you
# violate Teliva's assumptions.
#
# .tlv files are representations of Teliva programs. Teliva programs consist of
# sequences of definitions. Each definition is a table of key/value pairs. Keys
# and values are both strings.
#
# Lines in .tlv files always follow exactly one of the following forms:
# - comment lines at the top of the file starting with '#' at column 0
# - beginnings of definitions starting with '- ' at column 0, followed by a
# key/value pair
# - key/value pairs consisting of ' ' at column 0, containing either a
# spaceless value on the same line, or a multi-line value
# - multiline values indented by more than 2 spaces, starting with a '>'
#
# If these constraints are violated, Teliva may unceremoniously crash. Please
# report bugs at http://akkartik.name/contact
- __teliva_timestamp: original
check:
>function check(x, msg)
> if x then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' '..str(x)..' is false/nil')
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
check_eq:
>function check_eq(x, expected, msg)
> if eq(x, expected) then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' expected '..str(expected)..' but got '..str(x))
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
eq:
>function eq(a, b)
> if type(a) ~= type(b) then return false end
> if type(a) == 'table' then
> if #a ~= #b then return false end
> for k, v in pairs(a) do
> if b[k] ~= v then
> return false
> end
> end
> for k, v in pairs(b) do
> if a[k] ~= v then
> return false
> end
> end
> return true
> end
> return a == b
>end
- __teliva_timestamp: original
str:
>-- smarter tostring
>-- slow; used only for debugging
>function str(x)
> if type(x) == 'table' then
> local result = ''
> result = result..#x..'{'
> for k, v in pairs(x) do
> result = result..str(k)..'='..str(v)..', '
> end
> result = result..'}'
> return result
> elseif type(x) == 'string' then
> return '"'..x..'"'
> end
> return tostring(x)
>end
- __teliva_timestamp: original
Window:
>Window = curses.stdscr()
- __teliva_timestamp: original
n:
>n = 0
- __teliva_timestamp: original
render:
>function render(window)
> window:clear()
> window:attron(curses.A_BOLD)
> window:attron(curses.color_pair(6))
> window:mvaddstr(10, 10, " ")
> window:mvaddstr(10, 11, n)
> window:attroff(curses.color_pair(6))
> window:attroff(curses.A_BOLD)
> window:refresh()
>end
- __teliva_timestamp: original
menu:
>menu = {
> {"Enter", "increment"}
>}
- __teliva_timestamp: original
update:
>function update(window)
> local key = window:getch()
> if key == 10 then
> n = n+1
> end
>end
- __teliva_timestamp: original
main:
>function main()
> for i=1,7 do
> curses.init_pair(i, 0, i)
> end
>
> while true do
> render(Window)
> update(Window)
> end
>end
- __teliva_timestamp:
>Thu Feb 17 20:01:19 2022
doc:blurb:
>Example app: counter widget
>
>Look at the menu below to see what keyboard shortcuts are available.
================================================
FILE: doc/contents.html
================================================
Teliva Reference Manual - contents
Teliva Reference Manual
This reference manual for Teliva is based on the official definition of the
Lua language.
Teliva is a platform based on Lua for sandboxed software packaged with an
environment for making changes to it. For a more detailed introduction, see
the Readme.
Teliva is free software, and is provided as usual with no guarantees, as
stated in its license.
This manual is based on the Lua manual. Lua features absent in Teliva should
be absent in this manual as well. Features added to
Teliva above and beyond Lua will be described in text like this.
For a discussion of the decisions behind the design of Lua,
see the technical papers available at Lua's web site.
For a detailed introduction to programming in Lua,
see Roberto's book, Programming in Lua (Second Edition).
This section describes the lexis, the syntax, and the semantics of Lua.
In other words,
this section describes
which tokens are valid,
how they can be combined,
and what their combinations mean.
The language constructs will be explained using the usual extended BNF notation,
in which
{a} means 0 or more a's, and
[a] means an optional a.
Non-terminals are shown like non-terminal,
keywords are shown like kword,
and other terminal symbols are shown like `=´.
The complete syntax of Lua can be found in §8
at the end of this manual.
Names
(also called identifiers)
in Lua can be any string of letters,
digits, and underscores,
not beginning with a digit.
This coincides with the definition of names 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.)
Identifiers are used to name variables and table fields.
The following keywords are reserved
and cannot be used as names:
and break do else elseif
end false for function if
in local nil not or
repeat return then true until while
Lua is a case-sensitive language:
and is a reserved word, but And and AND
are two different, valid names.
As a convention, names starting with an underscore followed by
uppercase letters (such as _VERSION)
are reserved for internal global variables used by Lua.
Literal strings
can be delimited by matching single or double quotes,
and can contain the following C-like escape sequences:
'\a' (bell),
'\b' (backspace),
'\f' (form feed),
'\n' (newline),
'\r' (carriage return),
'\t' (horizontal tab),
'\v' (vertical tab),
'\\' (backslash),
'\"' (quotation mark [double quote]),
and '\'' (apostrophe [single quote]).
Moreover, a backslash followed by a real newline
results in a newline in the string.
A character in a string can also be specified by its numerical value
using the escape sequence \ddd,
where ddd is a sequence of up to three decimal digits.
(Note that if a numerical escape is to be followed by a digit,
it must be expressed using exactly three digits.)
Strings in Lua can contain any 8-bit value, including embedded zeros,
which can be specified as '\0'.
Literal strings can also be defined using a long format
enclosed by long brackets.
We define an opening long bracket of level n as an opening
square bracket followed by n equal signs followed by another
opening square bracket.
So, an opening long bracket of level 0 is written as [[,
an opening long bracket of level 1 is written as [=[,
and so on.
A closing long bracket is defined similarly;
for instance, a closing long bracket of level 4 is written as ]====].
A long string starts with an opening long bracket of any level and
ends at the first closing long bracket of the same level.
Literals in this bracketed form can run for several lines,
do not interpret any escape sequences,
and ignore long brackets of any other level.
They can contain anything except a closing bracket of the proper level.
For convenience,
when the opening long bracket is immediately followed by a newline,
the newline is not included in the string.
As an example, in a system using ASCII
(in which 'a' is coded as 97,
newline is coded as 10, and '1' is coded as 49),
the five literal strings below denote the same string:
a = 'alo\n123"'
a = "alo\n123\""
a = '\97lo\10\04923"'
a = [[alo
123"]]
a = [==[
alo
123"]==]
A numerical constant can be written with an optional decimal part
and an optional decimal exponent.
Lua also accepts integer hexadecimal constants,
by prefixing them with 0x.
Examples of valid numerical constants are
3 3.0 3.1416 314.16e-2 0.31416E1 0xff 0x56
A comment starts with a double hyphen (--)
anywhere outside a string.
If the text immediately after -- is not an opening long bracket,
the comment is a short comment,
which runs until the end of the line.
Otherwise, it is a long comment,
which runs until the corresponding closing long bracket.
Long comments are frequently used to disable code temporarily.
Lua is a dynamically typed language.
This means that
variables do not have types; only values do.
There are no type definitions in the language.
All values carry their own type.
All values in Lua are first-class values.
This means that all values can be stored in variables,
passed as arguments to other functions, and returned as results.
There are eight basic types in Lua:
nil, boolean, number,
string, function, userdata,
thread, and table.
Nil is the type of the value nil,
whose main property is to be different from any other value;
it usually represents the absence of a useful value.
Boolean is the type of the values false and true.
Both nil and false make a condition false;
any other value makes it true.
Number represents real (double-precision floating-point) numbers.
(It is easy to build Lua interpreters that use other
internal representations for numbers,
such as single-precision float or long integers;
see file luaconf.h.)
String represents arrays of characters.
Lua is 8-bit clean:
strings can contain any 8-bit character,
including embedded zeros ('\0') (see §2.1).
The type userdata is opaque to Teliva, and
used by low-level code to manage details of C data stored in Lua
variables. Unlike Lua, Teliva doesn't support creating or managing userdata
since it doesn't permit extension by C libraries. This manual doesn't allude
to userdata further.
The type thread represents independent threads of execution
and it is used to implement coroutines (see §2.11).
Do not confuse Lua threads with operating-system threads.
Lua supports coroutines on all systems,
even those that do not support threads.
The type table implements associative arrays,
that is, arrays that can be indexed not only with numbers,
but with any value (except nil).
Tables can be heterogeneous;
that is, they can contain values of all types (except nil).
Tables are the sole data structuring mechanism in Lua;
they can be used to represent ordinary arrays,
symbol tables, sets, records, graphs, trees, etc.
To represent records, Lua uses the field name as an index.
The language supports this representation by
providing a.name as syntactic sugar for a["name"].
There are several convenient ways to create tables in Lua
(see §2.5.7).
Like indices,
the value of a table field can be of any type (except nil).
In particular,
because functions are first-class values,
table fields can contain functions.
Thus tables can also carry methods (see §2.5.9).
Tables, functions and threads are objects:
variables do not actually contain these values,
only references to them.
Assignment, parameter passing, and function returns
always manipulate references to such values;
these operations do not imply any kind of copy.
The library function type returns a string describing the type
of a given value.
Lua provides automatic conversion between
string and number values at run time.
Any arithmetic operation applied to a string tries to convert
this string to a number, following the usual conversion rules.
Conversely, whenever a number is used where a string is expected,
the number is converted to a string, in a reasonable format.
For complete control over how numbers are converted to strings,
use the format function from the string library
(see string.format).
Any variable is assumed to be global unless explicitly declared
as a local (see §2.4.7).
Local variables are lexically scoped:
local variables can be freely accessed by functions
defined inside their scope (see §2.6).
Before the first assignment to a variable, its value is nil.
Square brackets are used to index a table:
var ::= prefixexp `[´ exp `]´
The meaning of accesses to global variables
and table fields can be changed via metatables.
An access to an indexed variable t[i] is equivalent to
a call gettable_event(t,i).
(See §2.8 for a complete description of the
gettable_event function.
This function is not defined or callable in Lua.
We use it here only for explanatory purposes.)
The syntax var.Name is just syntactic sugar for
var["Name"]:
var ::= prefixexp `.´ Name
All global variables live as fields in ordinary Lua tables,
called environment tables or simply
environments (see §2.9).
Each function has its own reference to an environment,
so that all global variables in this function
will refer to this environment table.
When a function is created,
it inherits the environment from the function that created it.
To get the environment table of a Lua function,
you call getfenv.
To replace it,
you call setfenv.
An access to a global variable x
is equivalent to _env.x,
which in turn is equivalent to
gettable_event(_env, "x")
where _env is the environment of the running function.
(See §2.8 for a complete description of the
gettable_event function.
This function is not defined or callable in Lua.
Similarly, the _env variable is not defined in Lua.
We use them here only for explanatory purposes.)
Lua supports an almost conventional set of statements,
similar to those in Pascal or C.
This set includes
assignments, control structures, function calls,
and variable declarations.
The unit of execution of Lua is called a chunk.
A chunk is simply a sequence of statements,
which are executed sequentially.
Each statement can be optionally followed by a semicolon:
chunk ::= {stat [`;´]}
There are no empty statements and thus ';;' is not legal.
Lua handles a chunk as the body of an anonymous function
with a variable number of arguments
(see §2.5.9).
As such, chunks can define local variables,
receive arguments, and return values.
A chunk can be stored in a file or in a string inside the host program.
To execute a chunk,
Lua first pre-compiles the chunk into instructions for a virtual machine,
and then it executes the compiled code
with an interpreter for the virtual machine.
Chunks can also be pre-compiled into binary form;
see program luac for details.
Programs in source and compiled forms are interchangeable;
Lua automatically detects the file type and acts accordingly.
A block is a list of statements;
syntactically, a block is the same as a chunk:
block ::= chunk
A block can be explicitly delimited to produce a single statement:
stat ::= do block end
Explicit blocks are useful
to control the scope of variable declarations.
Explicit blocks are also sometimes used to
add a return or break statement in the middle
of another block (see §2.4.4).
Lua allows multiple assignments.
Therefore, the syntax for assignment
defines a list of variables on the left side
and a list of expressions on the right side.
The elements in both lists are separated by commas:
stat ::= varlist `=´ explist
varlist ::= var {`,´ var}
explist ::= exp {`,´ exp}
Before the assignment,
the list of values is adjusted to the length of
the list of variables.
If there are more values than needed,
the excess values are thrown away.
If there are fewer values than needed,
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 call enter the list of values,
before the adjustment
(except when the call is enclosed in parentheses; see §2.5).
The assignment statement first evaluates all its expressions
and only then are the assignments performed.
Thus the code
i = 3
i, a[i] = i+1, 20
sets a[3] to 20, without affecting a[4]
because the i in a[i] is evaluated (to 3)
before it is assigned 4.
Similarly, the line
x, y = y, x
exchanges the values of x and y,
and
x, y, z = y, z, x
cyclically permutes the values of x, y, and z.
The meaning of assignments to global variables
and table fields can be changed via metatables.
An assignment to an indexed variable t[i] = val is equivalent to
settable_event(t,i,val).
(See §2.8 for a complete description of the
settable_event function.
This function is not defined or callable in Lua.
We use it here only for explanatory purposes.)
An assignment to a global variable x = val
is equivalent to the assignment
_env.x = val,
which in turn is equivalent to
settable_event(_env, "x", val)
where _env is the environment of the running function.
(The _env variable is not defined in Lua.
We use it here only for explanatory purposes.)
The control structures
if, while, and repeat have the usual meaning and
familiar syntax:
stat ::= while exp do block end
stat ::= repeat block until exp
stat ::= if exp then block {elseif exp then block} [else block] end
Lua also has a for statement, in two flavors (see §2.4.5).
The condition expression of a
control structure can return any value.
Both false and nil are considered false.
All values different from nil and false are considered true
(in particular, the number 0 and the empty string are also true).
In the repeat–until loop,
the inner block does not end at the until keyword,
but only after the condition.
So, the condition can refer to local variables
declared inside the loop block.
The return statement is used to return values
from a function or a chunk (which is just a function).
Functions and chunks can return more than one value,
and so the syntax for the return statement is
stat ::= return [explist]
The break statement is used to terminate the execution of a
while, repeat, or for loop,
skipping to the next statement after the loop:
stat ::= break
A break ends the innermost enclosing loop.
The return and break
statements can only be written as the last statement of a block.
If it is really necessary to return or break in the
middle of a block,
then an explicit inner block can be used,
as in the idioms
do return end and do break end,
because now return and break are the last statements in
their (inner) blocks.
The for statement has two forms:
one numeric and one generic.
The numeric for loop repeats a block of code while a
control variable runs through an arithmetic progression.
It has the following syntax:
stat ::= for Name `=´ exp `,´ exp [`,´ exp] do block end
The block is repeated for name starting at the value of
the first exp, until it passes the second exp by steps of the
third exp.
More precisely, a for statement like
for v = e1, e2, e3 do block end
is equivalent to the code:
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
local v = varblockvar = var + step
end
end
Note the following:
All three control expressions are evaluated only once,
before the loop starts.
They must all result in numbers.
var, limit, and step are invisible variables.
The names shown here are for explanatory purposes only.
If the third expression (the step) is absent,
then a step of 1 is used.
You can use break to exit a for loop.
The loop variable v is local to the loop;
you cannot use its value after the for ends or is broken.
If you need this value,
assign it to another variable before breaking or exiting the loop.
The generic for statement works over functions,
called iterators.
On each iteration, the iterator function is called to produce a new value,
stopping when this new value is nil.
The generic for loop has the following syntax:
stat ::= for namelist in explist do block end
namelist ::= Name {`,´ Name}
A for statement like
for var_1, ···, var_n in explist do block end
is equivalent to the code:
do
local f, s, var = explist
while true do
local var_1, ···, var_n = f(s, var)
var = var_1
if var == nil then break end
block
end
end
Note the following:
explist is evaluated only once.
Its results are an iterator function,
a state,
and an initial value for the first iterator variable.
f, s, and var are invisible variables.
The names are here for explanatory purposes only.
You can use break to exit a for loop.
The loop variables var_i are local to the loop;
you cannot use their values after the for ends.
If you need these values,
then assign them to other variables before breaking or exiting the loop.
Local variables can be declared anywhere inside a block.
The declaration can include an initial assignment:
stat ::= local namelist [`=´ explist]
If present, an initial assignment has the same semantics
of a multiple assignment (see §2.4.3).
Otherwise, all variables are initialized with nil.
A chunk is also a block (see §2.4.1),
and so local variables can be declared in a chunk outside any explicit block.
The scope of such local variables extends until the end of the chunk.
The visibility rules for local variables are explained in §2.6.
Numbers and literal strings are explained in §2.1;
variables are explained in §2.3;
function definitions are explained in §2.5.9;
function calls are explained in §2.5.8;
table constructors are explained in §2.5.7.
Vararg expressions,
denoted by three dots ('...'), can only be used when
directly inside a vararg function;
they are explained in §2.5.9.
Binary operators comprise arithmetic operators (see §2.5.1),
relational operators (see §2.5.2), logical operators (see §2.5.3),
and the concatenation operator (see §2.5.4).
Unary operators comprise the unary minus (see §2.5.1),
the unary not (see §2.5.3),
and the unary length operator (see §2.5.5).
Both function calls and vararg expressions can result in multiple values.
If an expression is used as a statement
(only possible for function calls (see §2.4.6)),
then its return list is adjusted to zero elements,
thus discarding all returned values.
If an expression is used as the last (or the only) element
of a list of expressions,
then no adjustment is made
(unless the call is enclosed in parentheses).
In all other contexts,
Lua adjusts the result list to one element,
discarding all values except the first one.
Here are some examples:
f() -- adjusted to 0 results
g(f(), x) -- f() is adjusted to 1 result
g(x, f()) -- g gets x plus all results from f()
a,b,c = f(), x -- f() is adjusted to 1 result (c gets nil)
a,b = ... -- a gets the first vararg parameter, b gets
-- the second (both a and b can get nil if there
-- is no corresponding vararg parameter)
a,b,c = x, f() -- f() is adjusted to 2 results
a,b,c = f() -- f() is adjusted to 3 results
return f() -- returns all results from f()
return ... -- returns all received vararg parameters
return x,y,f() -- returns x, y, and all results from f()
{f()} -- creates a list with all results from f()
{...} -- creates a list with all vararg parameters
{f(), nil} -- f() is adjusted to 1 result
Any expression enclosed in parentheses always results in only one value.
Thus,
(f(x,y,z)) is always a single value,
even if f returns several values.
(The value of (f(x,y,z)) is the first value returned by f
or nil if f does not return any values.)
Lua supports the usual arithmetic operators:
the binary + (addition),
- (subtraction), * (multiplication),
/ (division), % (modulo), and ^ (exponentiation);
and unary - (negation).
If the operands are numbers, or strings that can be converted to
numbers (see §2.2.1),
then all operations have the usual meaning.
Exponentiation works for any exponent.
For instance, x^(-0.5) computes the inverse of the square root of x.
Modulo is defined as
a % b == a - math.floor(a/b)*b
That is, it is the remainder of a division that rounds
the quotient towards minus infinity.
Equality (==) first compares the type of its operands.
If the types are different, then the result is false.
Otherwise, the values of the operands are compared.
Numbers and strings are compared in the usual way.
Objects (tables, threads, and functions)
are compared by reference:
two objects are considered equal only if they are the same object.
Every time you create a new object
(a table, thread, or function),
this new object is different from any previously existing object.
You can change the way that Lua compares tables by using the "eq" metamethod
(see §2.8).
The conversion rules of §2.2.1do not apply to equality comparisons.
Thus, "0"==0 evaluates to false,
and t[0] and t["0"] denote different
entries in a table.
The operator ~= is exactly the negation of equality (==).
The order operators work as follows.
If both arguments are numbers, then they are compared as such.
Otherwise, if both arguments are strings,
then their values are compared according to the current locale.
Otherwise, Lua tries to call the "lt" or the "le"
metamethod (see §2.8).
A comparison a > b is translated to b < a
and a >= b is translated to b <= a.
The logical operators in Lua are
and, or, and not.
Like the control structures (see §2.4.4),
all logical operators consider both false and nil as false
and anything else as true.
The negation operator not always returns false or true.
The conjunction operator and returns its first argument
if this value is false or nil;
otherwise, and returns its second argument.
The disjunction operator or returns its first argument
if this value is different from nil and false;
otherwise, or returns its second argument.
Both and and or use short-cut evaluation;
that is,
the second operand is evaluated only if necessary.
Here are some examples:
10 or 20 --> 10
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
(In this manual,
--> indicates the result of the preceding expression.)
The string concatenation operator in Lua is
denoted by two dots ('..').
If both operands are strings or numbers, then they are converted to
strings according to the rules mentioned in §2.2.1.
Otherwise, the "concat" metamethod is called (see §2.8).
The length operator is denoted by the unary operator #.
The length of a string is its number of bytes
(that is, the usual meaning of string length when each
character is one byte).
The length of a table t is defined to be any
integer index n
such that t[n] is not nil and t[n+1] is nil;
moreover, if t[1] is nil, n can be zero.
For a regular array, with non-nil values from 1 to a given n,
its length is exactly that n,
the index of its last value.
If the array has "holes"
(that is, nil values between other non-nil values),
then #t can be any of the indices that
directly precedes a nil value
(that is, it may consider any such nil value as the end of
the array).
Operator precedence in Lua follows the table below,
from lower to higher priority:
or
and
< > <= >= ~= ==
..
+ -
* / %
not # - (unary)
^
As usual,
you can use parentheses to change the precedences of an expression.
The concatenation ('..') and exponentiation ('^')
operators are right associative.
All other binary operators are left associative.
Table constructors are expressions that create tables.
Every time a constructor is evaluated, a new table is created.
A constructor can be used to create an empty table
or to create a table and initialize some of its fields.
The general syntax for constructors is
tableconstructor ::= `{´ [fieldlist] `}´
fieldlist ::= field {fieldsep field} [fieldsep]
field ::= `[´ exp `]´ `=´ exp | Name `=´ exp | exp
fieldsep ::= `,´ | `;´
Each field of the form [exp1] = exp2 adds to the new table an entry
with key exp1 and value exp2.
A field of the form name = exp is equivalent to
["name"] = exp.
Finally, fields of the form exp are equivalent to
[i] = exp, where i are consecutive numerical integers,
starting with 1.
Fields in the other formats do not affect this counting.
For example,
a = { [f(1)] = g; "x", "y"; x = 1, f(x), [30] = 23; 45 }
is equivalent to
do
local t = {}
t[f(1)] = g
t[1] = "x" -- 1st exp
t[2] = "y" -- 2nd exp
t.x = 1 -- t["x"] = 1
t[3] = f(x) -- 3rd exp
t[30] = 23
t[4] = 45 -- 4th exp
a = t
end
If the last field in the list has the form exp
and the expression is a function call or a vararg expression,
then all values returned by this expression enter the list consecutively
(see §2.5.8).
To avoid this,
enclose the function call or the vararg expression
in parentheses (see §2.5).
The field list can have an optional trailing separator,
as a convenience for machine-generated code.
In a function call,
first prefixexp and args are evaluated.
If the value of prefixexp has type function,
then this function is called
with the given arguments.
Otherwise, the prefixexp "call" metamethod is called,
having as first parameter the value of prefixexp,
followed by the original call arguments
(see §2.8).
The form
functioncall ::= prefixexp `:´ Name args
can be used to call "methods".
A call v:name(args)
is syntactic sugar for v.name(v,args),
except that v is evaluated only once.
All argument expressions are evaluated before the call.
A call of the form f{fields} is
syntactic sugar for f({fields});
that is, the argument list is a single new table.
A call of the form f'string'
(or f"string" or f[[string]])
is syntactic sugar for f('string');
that is, the argument list is a single literal string.
As an exception to the free-format syntax of Lua,
you cannot put a line break before the '(' in a function call.
This restriction avoids some ambiguities in the language.
If you write
a = f
(g).x(a)
Lua would see that as a single statement, 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 f,
you must remove the line break before (g).
A call of the form returnfunctioncall is called
a tail call.
Lua implements proper tail calls
(or proper tail recursion):
in a tail call,
the called function reuses the stack entry of the calling function.
Therefore, there is no limit on the number of nested tail calls that
a program can execute.
However, a tail call erases any debug information about the
calling function.
Note that a tail call only happens with a particular syntax,
where the return has one single function call as argument;
this syntax makes the calling function return exactly
the returns of the called function.
So, none of the following examples are tail calls:
return (f(x)) -- results adjusted to 1
return 2 * f(x)
return x, f(x) -- additional results
f(x); return -- results discarded
return x or f(x) -- results adjusted to 1
function ::= function funcbody
funcbody ::= `(´ [parlist] `)´ block end
The following syntactic sugar simplifies function definitions:
stat ::= function funcname funcbody
stat ::= localfunction Name funcbody
funcname ::= Name {`.´ Name} [`:´ Name]
The statement
function f () body end
translates to
f = function () body end
The statement
function t.a.b.c.f () body end
translates to
t.a.b.c.f = function () body end
The statement
local function f () body end
translates to
local f; f = function () body end
not to
local f = function () body end
(This only makes a difference when the body of the function
contains references to f.)
A function definition is an executable expression,
whose value has type function.
When Lua pre-compiles a chunk,
all its function bodies are pre-compiled too.
Then, whenever Lua executes the function definition,
the function is instantiated (or closed).
This function instance (or closure)
is the final value of the expression.
Different instances of the same function
can refer to different external local variables
and can have different environment tables.
Parameters act as local variables that are
initialized with the argument values:
parlist ::= namelist [`,´ `...´] | `...´
When a function is called,
the list of arguments is adjusted to
the length of the list of parameters,
unless the function is a variadic or vararg function,
which is
indicated by three dots ('...') at the end of its parameter list.
A vararg function does not adjust its argument list;
instead, it collects all extra arguments and supplies them
to the function through a vararg expression,
which is also written as three dots.
The value of this expression is a list of all actual extra arguments,
similar to a function with multiple results.
If a vararg expression is used inside another expression
or in the middle of a list of expressions,
then its return list is adjusted to one element.
If the expression is used as the last element of a list of expressions,
then no adjustment is made
(unless that last expression is enclosed in parentheses).
As an example, consider the following definitions:
function f(a, b) end
function g(a, b, ...) end
function r() return 1,2,3 end
Then, we have the following mapping from arguments to parameters and
to the vararg expression:
Results are returned using the return statement (see §2.4.4).
If control reaches the end of a function
without encountering a return statement,
then the function returns with no results.
The colon syntax
is used for defining methods,
that is, functions that have an implicit extra parameter self.
Thus, the statement
Lua is a lexically scoped language.
The scope of variables begins at the first statement after
their declaration and lasts until the end of the innermost block that
includes the declaration.
Consider the following example:
x = 10 -- global variable
do -- new block
local x = x -- new 'x', with value 10
print(x) --> 10
x = x+1
do -- another block
local x = x+1 -- another 'x'
print(x) --> 12
end
print(x) --> 11
end
print(x) --> 10 (the global one)
Notice that, in a declaration like local x = x,
the new x being declared is not in scope yet,
and so the second x refers to the outside variable.
Because of the lexical scoping rules,
local variables can be freely accessed by functions
defined inside their scope.
A local variable used by an inner function is called
an upvalue, or external local variable,
inside the inner function.
Notice that each execution of a local statement
defines new local variables.
Consider the following example:
a = {}
local x = 20
for i=1,10 do
local y = 0
a[i] = function () y=y+1; return x+y end
end
The loop creates ten closures
(that is, ten instances of the anonymous function).
Each of these closures uses a different y variable,
while all of them share the same x.
Every value in Lua can have a metatable.
This metatable is an ordinary Lua table
that defines the behavior of the original value
under certain special operations.
You can change several aspects of the behavior
of operations over a value by setting specific fields in its metatable.
For instance, when a non-numeric value is the operand of an addition,
Lua checks for a function in the field "__add" in its metatable.
If it finds one,
Lua calls this function to perform the addition.
We call the keys in a metatable events
and the values metamethods.
In the previous example, the event is "add"
and the metamethod is the function that performs the addition.
You can query the metatable of any value
through the getmetatable function.
You can replace the metatable of tables
through the setmetatable
function.
Tables have individual metatables
(although multiple tables can share their metatables).
Values of all other types share one single metatable per type;
that is, there is one single metatable for all numbers,
one for all strings, etc.
A metatable controls how an object behaves in arithmetic operations,
order comparisons, concatenation, length operation, and indexing.
For each of these operations Lua associates a specific key
called an event.
When Lua performs one of these operations over a value,
it checks whether this value has a metatable with the corresponding event.
If so, the value associated with that key (the metamethod)
controls how Lua will perform the operation.
Metatables control the operations listed next.
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 "__add".
The semantics of these operations is better explained by a Lua function
describing how the interpreter executes the operation.
The code shown here in Lua is only illustrative;
the real behavior is hard coded in the interpreter
and it is much more efficient than this simulation.
All functions used in these descriptions
(rawget, tonumber, etc.)
are described in §5.1.
In particular, to retrieve the metamethod of a given object,
we use the expression
metatable(obj)[event]
This should be read as
rawget(getmetatable(obj) or {}, event)
That is, the access to a metamethod does not invoke other metamethods,
and the access to objects with no metatables does not fail
(it simply results in nil).
"add":
the + operation.
The function getbinhandler below defines how Lua chooses a handler
for a binary operation.
First, Lua tries the first operand.
If its type does not define a handler for the operation,
then Lua tries the second operand.
function getbinhandler (op1, op2, event)
return metatable(op1)[event] or metatable(op2)[event]
end
By using this function,
the behavior of the op1 + op2 is
function add_event (op1, op2)
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
local h = getbinhandler(op1, op2, "__add")
if h then
-- call the handler with both operands
return (h(op1, op2))
else -- no handler available: default behavior
error(···)
end
end
end
"sub":
the - operation.
Behavior similar to the "add" operation.
"mul":
the * operation.
Behavior similar to the "add" operation.
"div":
the / operation.
Behavior similar to the "add" operation.
"mod":
the % operation.
Behavior similar to the "add" operation,
with the operation
o1 - floor(o1/o2)*o2 as the primitive operation.
"pow":
the ^ (exponentiation) operation.
Behavior similar to the "add" operation,
with the function pow (from the C math library)
as the primitive operation.
"unm":
the unary - operation.
function unm_event (op)
local o = tonumber(op)
if o then -- operand is numeric?
return -o -- '-' here is the primitive 'unm'
else -- the operand is not numeric.
-- Try to get a handler from the operand
local h = metatable(op).__unm
if h then
-- call the handler with the operand
return (h(op))
else -- no handler available: default behavior
error(···)
end
end
end
"concat":
the .. (concatenation) operation.
function concat_event (op1, op2)
if (type(op1) == "string" or type(op1) == "number") and
(type(op2) == "string" or type(op2) == "number") then
return op1 .. op2 -- primitive string concatenation
else
local h = getbinhandler(op1, op2, "__concat")
if h then
return (h(op1, op2))
else
error(···)
end
end
end
"len":
the # operation.
function len_event (op)
if type(op) == "string" then
return strlen(op) -- primitive string length
elseif type(op) == "table" then
return #op -- primitive table length
else
local h = metatable(op).__len
if h then
-- call the handler with the operand
return (h(op))
else -- no handler available: default behavior
error(···)
end
end
end
See §2.5.5 for a description of the length of a table.
"eq":
the == operation.
The function getcomphandler defines how Lua chooses a metamethod
for comparison operators.
A metamethod only is selected when both objects
being compared have the same type
and the same metamethod for the selected operation.
function getcomphandler (op1, op2, event)
if type(op1) ~= type(op2) then return nil end
local mm1 = metatable(op1)[event]
local mm2 = metatable(op2)[event]
if mm1 == mm2 then return mm1 else return nil end
end
The "eq" event is defined as follows:
function eq_event (op1, op2)
if type(op1) ~= type(op2) then -- different types?
return false -- different objects
end
if op1 == op2 then -- primitive equal?
return true -- objects are equal
end
-- try metamethod
local h = getcomphandler(op1, op2, "__eq")
if h then
return (h(op1, op2))
else
return false
end
end
a ~= b is equivalent to not (a == b).
"lt":
the < operation.
function lt_event (op1, op2)
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
local h = getcomphandler(op1, op2, "__lt")
if h then
return (h(op1, op2))
else
error(···)
end
end
end
a > b is equivalent to b < a.
"le":
the <= operation.
function le_event (op1, op2)
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
local h = getcomphandler(op1, op2, "__le")
if h then
return (h(op1, op2))
else
h = getcomphandler(op1, op2, "__lt")
if h then
return not h(op2, op1)
else
error(···)
end
end
end
end
a >= b is equivalent to b <= a.
Note that, in the absence of a "le" metamethod,
Lua tries the "lt", assuming that a <= b is
equivalent to not (b < a).
"index":
The indexing access table[key].
function gettable_event (table, key)
local h
if type(table) == "table" then
local v = rawget(table, key)
if v ~= nil then return v end
h = metatable(table).__index
if h == nil then return nil end
else
h = metatable(table).__index
if h == nil then
error(···)
end
end
if type(h) == "function" then
return (h(table, key)) -- call the handler
else return h[key] -- or repeat operation on it
end
end
"newindex":
The indexing assignment table[key] = value.
function settable_event (table, key, value)
local h
if type(table) == "table" then
local v = rawget(table, key)
if v ~= nil then rawset(table, key, value); return end
h = metatable(table).__newindex
if h == nil then rawset(table, key, value); return end
else
h = metatable(table).__newindex
if h == nil then
error(···)
end
end
if type(h) == "function" then
h(table, key,value) -- call the handler
else h[key] = value -- or repeat operation on it
end
end
"call":
called when Lua calls a value.
function function_event (func, ...)
if type(func) == "function" then
return func(...) -- primitive call
else
local h = metatable(func).__call
if h then
return h(func, ...)
else
error(···)
end
end
end
Besides metatables, objects of types thread and function
have another table associated with them, called their
environment.
Like metatables, environments are regular tables and
multiple objects can share the same environment.
Threads are created sharing the environment of the creating thread.
Nested Lua functions are created sharing the environment of
the creating Lua function.
Environments associated with threads are called
global environments.
They are used as the default environment for threads.
Environments associated with Lua functions are used to resolve
all accesses to global variables within the function (see §2.3).
They are used as the default environment for nested Lua functions
created by the function.
You can change the environment of a Lua function or the
running thread by calling setfenv.
You can get the environment of a Lua function or the running thread
by calling getfenv.
Lua performs automatic memory management.
This means that
you have to worry neither about allocating memory for new objects
nor about freeing it when the objects are no longer needed.
Lua manages memory automatically by running
a garbage collector from time to time
to collect all dead objects
(that is, objects that are no longer accessible from Lua).
All memory used by Lua is subject to automatic management:
tables, functions, threads, strings, etc.
Lua implements an incremental mark-and-sweep collector.
It uses two numbers to control its garbage-collection cycles:
the garbage-collector pause and
the garbage-collector step multiplier.
Both use percentage points as units
(so that a value of 100 means an internal value of 1).
The garbage-collector pause
controls how long the collector waits before starting a new cycle.
Larger values make the collector less aggressive.
Values smaller than 100 mean the collector will not wait to
start a new cycle.
A value of 200 means that the collector waits for the total memory in use
to double before starting a new cycle.
The step multiplier
controls the relative speed of the collector relative to
memory allocation.
Larger values make the collector more aggressive but also increase
the size of each incremental step.
Values smaller than 100 make the collector too slow and
can result in the collector never finishing a cycle.
The default, 200, means that the collector runs at "twice"
the speed of memory allocation.
Modifying these parameters requires changes to Teliva's C
sources.
A weak table is a table whose elements are
weak references.
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 this object.
A weak table can have weak keys, weak values, or both.
A table with weak keys allows the collection of its keys,
but prevents the collection of its values.
A table with both weak keys and weak values allows the collection of
both keys and values.
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 controlled by the
__mode field of its metatable.
If the __mode field is a string containing the character 'k',
the keys in the table are weak.
If __mode contains 'v',
the values in the table are weak.
After you use a table as a metatable,
you should not change the value of its __mode field.
Otherwise, the weak behavior of the tables controlled by this
metatable is undefined.
Lua supports coroutines,
also called collaborative multithreading.
A coroutine in Lua represents an independent thread of execution.
Unlike threads in multithread systems, however,
a coroutine only suspends its execution by explicitly calling
a yield function.
You create a coroutine with a call to coroutine.create.
Its sole argument is a function
that is the main function of the coroutine.
The create function only creates a new coroutine and
returns a handle to it (an object of type thread);
it does not start the coroutine execution.
When you first call coroutine.resume,
passing as its first argument
a thread returned by coroutine.create,
the coroutine starts its execution,
at the first line of its main function.
Extra arguments passed to coroutine.resume are passed on
to the coroutine main function.
After the coroutine starts running,
it runs until it terminates or yields.
A coroutine can terminate its execution in two ways:
normally, when its main function returns
(explicitly or implicitly, after the last instruction);
and abnormally, if there is an unprotected error.
In the first case, coroutine.resume returns true,
plus any values returned by the coroutine main function.
In case of errors, coroutine.resume returns false
plus an error message.
A coroutine yields by calling coroutine.yield.
When a coroutine yields,
the corresponding coroutine.resume returns immediately,
even if the yield happens inside nested function calls
(that is, not in the main function,
but in a function directly or indirectly called by the main function).
In the case of a yield, coroutine.resume also returns true,
plus any values passed to coroutine.yield.
The next time you resume the same coroutine,
it continues its execution from the point where it yielded,
with the call to coroutine.yield returning any extra
arguments passed to coroutine.resume.
Like coroutine.create,
the coroutine.wrap function also creates a coroutine,
but instead of returning the coroutine itself,
it returns a function that, when called, resumes the coroutine.
Any arguments passed to this function
go as extra arguments to coroutine.resume.
coroutine.wrap returns all the values returned by coroutine.resume,
except the first one (the boolean error code).
Unlike coroutine.resume,
coroutine.wrap does not catch errors;
any error is propagated to the caller.
As an example,
consider the following code:
function foo (a)
print("foo", a)
return coroutine.yield(2*a)
end
co = coroutine.create(function (a,b)
print("co-body", a, b)
local r = foo(a+1)
print("co-body", r)
local r, s = coroutine.yield(a+b, a-b)
print("co-body", r, s)
return b, "end"
end)
print("main", coroutine.resume(co, 1, 10))
print("main", coroutine.resume(co, "r"))
print("main", coroutine.resume(co, "x", "y"))
print("main", coroutine.resume(co, "x", "y"))
When you run it, it produces the following output:
co-body 1 10
foo 2
main true 4
co-body r
main true 11 -9
co-body x y
main true 10 end
main false cannot resume dead coroutine
Coroutines are powerful, but require some experience to use tastefully. Try to
use them judiciously. If you find yourself juggling lots of coroutines and
trying to decide which one to try to resume, you should probably be using
tasks and channels instead. On the other hand, tasks have
some cognitive overheads. You have to explicitly manage them with
task.scheduler, and errors can
sometimes be hard to track down. For simple generators that emit elements
on demand, a coroutine is likely the best solution.
The standard Lua libraries provide useful functions
that are implemented directly in C.
Some of these functions provide essential services to the language
(e.g., type and getmetatable);
others provide access to "outside" services (e.g., I/O);
and others could be implemented in Lua itself,
but are quite useful or have critical performance requirements that
deserve an implementation in C (e.g., table.sort).
Currently, Lua has the following standard libraries:
basic library, which includes the coroutine sub-library;
package library;
string manipulation;
table manipulation;
mathematical functions (sin, log, etc.);
input and output;
operating system facilities;
debug facilities.
Except for the basic and package libraries,
each library provides all its functions as fields of a global table
or as methods of its objects.
The basic library provides some core functions to Lua.
If you do not include this library in your application,
you should check carefully whether you need to provide
implementations for some of its facilities.
Issues an error when
the value of its argument v is false (i.e., nil or false);
otherwise, returns all its arguments.
message is an error message;
when absent, it defaults to "assertion failed!"
This function is a generic interface to the garbage collector.
It performs different functions according to its first argument, opt:
"collect":
performs a full garbage-collection cycle.
This is the default option.
"stop":
stops the garbage collector.
"restart":
restarts the garbage collector.
"count":
returns the total memory in use by Lua (in Kbytes).
"step":
performs a garbage-collection step.
The step "size" is controlled by arg
(larger values mean more steps) in a non-specified way.
If you want to control the step size
you must experimentally tune the value of arg.
Returns true if the step finished a collection cycle.
"setpause":
sets arg as the new value for the pause of
the collector (see §2.10).
Returns the previous value for pause.
"setstepmul":
sets arg as the new value for the step multiplier of
the collector (see §2.10).
Returns the previous value for step.
Terminates the last protected function called
and returns message as the error message.
Function error never returns.
Usually, error adds some information about the error position
at the beginning of the message.
The level argument specifies how to get the error position.
With level 1 (the default), the error position is where the
error function was called.
Level 2 points the error to where the function
that called error was called; and so on.
Passing a level 0 avoids the addition of error position information
to the message.
A global variable that
holds the global environment (that is, _G._G = _G).
Lua itself does not use this variable;
changing its value does not affect any environment,
nor vice-versa.
(Use setfenv to change environments.)
Returns the current environment in use by the function.
f can be a Lua function or a number
that specifies the function at that stack level:
Level 1 is the function calling getfenv.
If the given function is not a Lua function,
or if f is 0,
getfenv returns the global environment.
The default for f is 1.
If object does not have a metatable, returns nil.
Otherwise,
if the object's metatable has a "__metatable" field,
returns the associated value.
Otherwise, returns the metatable of the given object.
Allows a program to traverse all fields of a table.
Its first argument is a table and its second argument
is an index in this table.
next returns the next index of the table
and its associated value.
When called with nil as its second argument,
next returns an initial index
and its associated value.
When called with the last index,
or with nil in an empty table,
next returns nil.
If the second argument is absent, then it is interpreted as nil.
In particular,
you can use next(t) to check whether a table is empty.
The order in which the indices are enumerated is not specified,
even for numeric indices.
(To traverse a table in numeric order,
use a numerical for or the ipairs function.)
The behavior of next is undefined if,
during the traversal,
you assign any value to a non-existent field in the table.
You may however modify existing fields.
In particular, you may clear existing fields.
Receives any number of arguments,
and prints their values to stdout,
using the tostring function to convert them to strings.
print is not intended for formatted output,
but only as a quick way to show a value,
typically for debugging.
For formatted output, use string.format.
Sets the real value of table[index] to value,
without invoking any metamethod.
table must be a table,
index any value different from nil,
and value any Lua value.
If index is a number,
returns all arguments after argument number index.
Otherwise, index must be the string "#",
and select returns the total number of extra arguments it received.
Sets the environment to be used by the given function.
f can be a Lua function or a number
that specifies the function at that stack level:
Level 1 is the function calling setfenv.
setfenv returns the given function.
As a special case, when f is 0 setfenv changes
the environment of the running thread.
In this case, setfenv returns no values.
Sets the metatable for the given table.
(You cannot change the metatable of other types.)
If metatable is nil,
removes the metatable of the given table.
If the original metatable has a "__metatable" field,
raises an error.
Tries to convert its argument to a number.
If the argument is already a number or a string convertible
to a number, then tonumber returns this number;
otherwise, it returns nil.
An optional argument specifies the base to interpret the numeral.
The base may be any integer between 2 and 36, inclusive.
In bases above 10, the letter 'A' (in either upper or lower case)
represents 10, 'B' represents 11, and so forth,
with 'Z' representing 35.
In base 10 (the default), the number can have a decimal part,
as well as an optional exponent part (see §2.1).
In other bases, only unsigned integers are accepted.
Receives an argument of any type and
converts it to a string in a reasonable format.
For complete control of how numbers are converted,
use string.format.
If the metatable of e has a "__tostring" field,
then tostring calls the corresponding value
with e as argument,
and uses the result of the call as its result.
Returns the type of its only argument, coded as a string.
The possible results of this function are
"nil" (a string, not the value nil),
"number",
"string",
"boolean",
"table",
"function",
"thread",
and "userdata".
Returns the elements from the given table.
This function is equivalent to
return list[i], list[i+1], ···, list[j]
except that the above code can be written only for a fixed number
of elements.
By default, i is 1 and j is the length of the list,
as defined by the length operator (see §2.5.5).
The operations related to coroutines comprise a sub-library of
the basic library and come inside the table coroutine.
See §2.11 for a general description of coroutines.
Starts or continues the execution of coroutine co.
The first time you resume a coroutine,
it starts running its body.
The values val1, ··· are passed
as the arguments to the body function.
If the coroutine has yielded,
resume restarts it;
the values val1, ··· are passed
as the results from the yield.
If the coroutine runs without any errors,
resume returns true plus any values passed to yield
(if the coroutine yields) or any values returned by the body function
(if the coroutine terminates).
If there is any error,
resume returns false plus the error message.
Returns the status of coroutine co, as a string:
"running",
if the coroutine is running (that is, it called status);
"suspended", if the coroutine is suspended in a call to yield,
or if it has not started running yet;
"normal" if the coroutine is active but not running
(that is, it has resumed another coroutine);
and "dead" if the coroutine has finished its body function,
or if it has stopped with an error.
Creates a new coroutine, with body f.
f must be a Lua function.
Returns a function that resumes the coroutine each time it is called.
Any arguments passed to the function behave as the
extra arguments to resume.
Returns the same values returned by resume,
except the first boolean.
In case of error, propagates the error.
Suspends the execution of the calling coroutine.
The coroutine cannot be running a primitive implemented in
C, a metamethod, or an iterator.
Any arguments to yield are passed as extra results to resume.
This library provides generic functions for string manipulation,
such as finding and extracting substrings, and pattern matching.
When indexing a string in Lua, the first character is at position 1
(not at 0, as in C).
Indices are allowed to be negative and are interpreted as indexing backwards,
from the end of the string.
Thus, the last character is at position -1, and so on.
The string library provides all its functions inside the table
string.
It also sets a metatable for strings
where the __index field points to the string table.
Therefore, you can use the string functions in object-oriented style.
For instance, string.byte(s, i)
can be written as s:byte(i).
The string library assumes one-byte character encodings.
Receives zero or more integers.
Returns a string with length equal to the number of arguments,
in which each character has the internal numerical code equal
to its corresponding argument.
Note that numerical codes are not necessarily portable across platforms.
Looks for the first match of
pattern in the string s.
If it finds a match, then find returns the indices of s
where this occurrence starts and ends;
otherwise, it returns nil.
A third, optional numerical argument init specifies
where to start the search;
its default value is 1 and can be negative.
A value of true as a fourth, optional argument plain
turns off the pattern matching facilities,
so the function does a plain "find substring" operation,
with no characters in pattern being considered "magic".
Note that if plain is given, then init must be given as well.
If the pattern has captures,
then in a successful match
the captured values are also returned,
after the two indices.
Returns a formatted version of its variable number of arguments
following the description given in its first argument (which must be a string).
The format string follows the same rules as the printf family of
standard C functions.
The only differences are that the options/modifiers
*, l, L, n, p,
and h are not supported
and that there is an extra option, q.
The q option formats a string in a form suitable to be safely read
back by the Lua interpreter:
the string is written between double quotes,
and all double quotes, newlines, embedded zeros,
and backslashes in the string
are correctly escaped when written.
For instance, the call
string.format('%q', 'a string with "quotes" and \n new line')
will produce the string:
"a string with \"quotes\" and \
new line"
The options c, d, E, e, f,
g, G, i, o, u, X, and x all
expect a number as argument,
whereas q and s expect a string.
This function does not accept string values
containing embedded zeros,
except as arguments to the q option.
Returns an iterator function that,
each time it is called,
returns the next captures from pattern over string s.
If pattern specifies no captures,
then the whole match is produced in each call.
As an example, the following loop
s = "hello world from Lua"
for w in string.gmatch(s, "%a+") do
print(w)
end
will iterate over all the words from string s,
printing one per line.
The next example collects all pairs key=value from the
given string into a table:
t = {}
s = "from=world, to=Lua"
for k, v in string.gmatch(s, "(%w+)=(%w+)") do
t[k] = v
end
For this function, a '^' at the start of a pattern does not
work as an anchor, as this would prevent the iteration.
Returns a copy of s
in which all (or the first n, if given)
occurrences of the pattern have been
replaced by a replacement string specified by repl,
which can be a string, a table, or a function.
gsub also returns, as its second value,
the total number of matches that occurred.
If repl is a string, then its value is used for replacement.
The character % works as an escape character:
any sequence in repl of the form %n,
with n between 1 and 9,
stands for the value of the n-th captured substring (see below).
The sequence %0 stands for the whole match.
The sequence %% stands for a single %.
If repl is a table, then the table is queried for every match,
using the first capture as the key;
if the pattern specifies no captures,
then the whole match is used as the key.
If repl is a function, then this function is called every time a
match occurs, with all captured substrings passed as arguments,
in order;
if the pattern specifies no captures,
then the whole match is passed as a sole argument.
If the value returned by the table query or by the function call
is a string or a number,
then it is used as the replacement string;
otherwise, if it is false or nil,
then there is no replacement
(that is, the original match is kept in the string).
Here are some examples:
x = string.gsub("hello world", "(%w+)", "%1 %1")
--> x="hello hello world world"
x = string.gsub("hello world", "%w+", "%0 %0", 1)
--> x="hello hello world"
x = string.gsub("hello world from Lua", "(%w+)%s*(%w+)", "%2 %1")
--> x="world hello Lua from"
x = string.gsub("home = $HOME, user = $USER", "%$(%w+)", os.getenv)
--> x="home = /home/roberto, user = roberto"
local t = {name="lua", version="5.1"}
x = string.gsub("$name-$version.tar.gz", "%$(%w+)", t)
--> x="lua-5.1.tar.gz"
Receives a string and returns a copy of this string with all
uppercase letters changed to lowercase.
All other characters are left unchanged.
The definition of what an uppercase letter is depends on the current locale.
Looks for the first match of
pattern in the string s.
If it finds one, then match returns
the captures from the pattern;
otherwise it returns nil.
If pattern specifies no captures,
then the whole match is returned.
A third, optional numerical argument init specifies
where to start the search;
its default value is 1 and can be negative.
Returns the substring of s that
starts at i and continues until j;
i and j can be negative.
If j is absent, then it is assumed to be equal to -1
(which is the same as the string length).
In particular,
the call string.sub(s,1,j) returns a prefix of s
with length j,
and string.sub(s, -i) returns a suffix of s
with length i.
Receives a string and returns a copy of this string with all
lowercase letters changed to uppercase.
All other characters are left unchanged.
The definition of what a lowercase letter is depends on the current locale.
A character class is used to represent a set of characters.
The following combinations are allowed in describing a character class:
x:
(where x is not one of the magic characters^$()%.[]*+-?)
represents the character x itself.
.: (a dot) represents all characters.
%a: represents all letters.
%c: represents all control characters.
%d: represents all digits.
%l: represents all lowercase letters.
%p: represents all punctuation characters.
%s: represents all space characters.
%u: represents all uppercase letters.
%w: represents all alphanumeric characters.
%x: represents all hexadecimal digits.
%z: represents the character with representation 0.
%x: (where x is any non-alphanumeric character)
represents the character x.
This is the standard way to escape the magic characters.
Any punctuation character (even the non magic)
can be preceded by a '%'
when used to represent itself in a pattern.
[set]:
represents the class which is the union of all
characters in set.
A range of characters can be specified by
separating the end characters of the range with a '-'.
All classes %x described above can also be used as
components in set.
All other characters in set represent themselves.
For example, [%w_] (or [_%w])
represents all alphanumeric characters plus the underscore,
[0-7] represents the octal digits,
and [0-7%l%-] represents the octal digits plus
the lowercase letters plus the '-' character.
The interaction between ranges and classes is not defined.
Therefore, patterns like [%a-z] or [a-%%]
have no meaning.
[^set]:
represents the complement of set,
where set is interpreted as above.
For all classes represented by single letters (%a, %c, etc.),
the corresponding uppercase letter represents the complement of the class.
For instance, %S represents all non-space characters.
The definitions of letter, space, and other character groups
depend on the current locale.
In particular, the class [a-z] may not be equivalent to %l.
Pattern Item:
A pattern item can be
a single character class,
which matches any single character in the class;
a single character class followed by '*',
which matches 0 or more repetitions of characters in the class.
These repetition items will always match the longest possible sequence;
a single character class followed by '+',
which matches 1 or more repetitions of characters in the class.
These repetition items will always match the longest possible sequence;
a single character class followed by '-',
which also matches 0 or more repetitions of characters in the class.
Unlike '*',
these repetition items will always match the shortest possible sequence;
a single character class followed by '?',
which matches 0 or 1 occurrence of a character in the class;
%n, for n between 1 and 9;
such item matches a substring equal to the n-th captured string
(see below);
%bxy, where x and y are two distinct characters;
such item matches strings that start with x, end with y,
and where the x and y are balanced.
This means that, if one reads the string from left to right,
counting +1 for an x and -1 for a y,
the ending y is the first y where the count reaches 0.
For instance, the item %b() matches expressions with
balanced parentheses.
Pattern:
A pattern is a sequence of pattern items.
A '^' at the beginning of a pattern anchors the match at the
beginning of the subject string.
A '$' at the end of a pattern anchors the match at the
end of the subject string.
At other positions,
'^' and '$' have no special meaning and represent themselves.
Captures:
A pattern can contain sub-patterns enclosed in parentheses;
they describe captures.
When a match succeeds, the substrings of the subject string
that match captures are stored (captured) for future use.
Captures are numbered according to their left parentheses.
For instance, in the pattern "(a*(.)%w(%s*))",
the part of the string matching "a*(.)%w(%s*)" is
stored as the first capture (and therefore has number 1);
the character matching "." is captured with number 2,
and the part matching "%s*" has number 3.
As a special case, the empty capture () captures
the current string position (a number).
For instance, if we apply the pattern "()aa()" on the
string "flaaap", there will be two captures: 3 and 5.
A pattern cannot contain embedded zeros. Use %z instead.
This library provides generic functions for table manipulation.
It provides all its functions inside the table table.
Most functions in the table library assume that the table
represents an array or a list.
For these functions, when we talk about the "length" of a table
we mean the result of the length operator.
Given an array where all elements are strings or numbers,
returns table[i]..sep..table[i+1] ··· sep..table[j].
The default value for sep is the empty string,
the default for i is 1,
and the default for j is the length of the table.
If i is greater than j, returns the empty string.
Inserts element value at position pos in table,
shifting up other elements to open space, if necessary.
The default value for pos is n+1,
where n is the length of the table (see §2.5.5),
so that a call table.insert(t,x) inserts x at the end
of table t.
Returns the largest positive numerical index of the given table,
or zero if the table has no positive numerical indices.
(To do its job this function does a linear traversal of
the whole table.)
Removes from table the element at position pos,
shifting down other elements to close the space, if necessary.
Returns the value of the removed element.
The default value for pos is n,
where n is the length of the table,
so that a call table.remove(t) removes the last element
of table t.
Sorts table elements in a given order, in-place,
from table[1] to table[n],
where n is the length of the table.
If comp is given,
then it must be a function that receives two table elements,
and returns true
when the first is less than the second
(so that not comp(a[i+1],a[i]) will be true after the sort).
If comp is not given,
then the standard Lua operator < is used instead.
The sort algorithm is not stable;
that is, elements considered equal by the given order
may have their relative positions changed by the sort.
Returns the arc tangent of y/x (in radians),
but uses the signs of both parameters to find the
quadrant of the result.
(It also handles correctly the case of x being zero.)
This function is an interface to the simple
pseudo-random generator function rand provided by ANSI C.
(No guarantees can be given for its statistical properties.)
When called without arguments,
returns a uniform pseudo-random real number
in the range [0,1).
When called with an integer number m,
math.random returns
a uniform pseudo-random integer in the range [1, m].
When called with two integer numbers m and n,
math.random returns a uniform pseudo-random
integer in the range [m, n].
While Teliva supports the standard Lua primitives for managing files via
handles, idiomatic Teliva uses some slightly different primitives that use a
subtly different file object (name tbd).
This function opens a file exclusively for reading, and returns an object (NOT
a file handle as in Lua) or nil on error. If the returned object is
stored in variable f, f.read(format) will read from
the file. Legal values for format are identical to
file:read(format).
(The fs parameter is currently unused. It will be used to pass in
fake file systems for tests.)
This function opens a file exclusively for writing, and returns an object (NOT
a file handle as in Lua) or nil on error. If the result is stored in
variable f, f.write(x) will write x to
the file. f.close() will persist the changes and make them
externally visible. All changes will be hidden until f.close().
(The fs parameter is currently unused. It will be used to pass in
fake file systems for tests.)
The rest of this section describes Lua's standard primitives for File I/O.
Unless otherwise stated,
all File I/O functions return nil on failure
(plus an error message as a second result and
a system-dependent error code as a third result)
and some value different from nil on success.
This function opens a file,
in the mode specified in the string mode.
It returns a new file handle,
or, in case of errors, nil plus an error message.
The mode string can be any of the following:
"r": read mode (the default);
"w": write mode;
"a": append mode;
"r+": update mode, all previous data is preserved;
"w+": update mode, all previous data is erased;
"a+": append update mode, previous data is preserved,
writing is only allowed at the end of file.
The mode string can also have a 'b' at the end,
which is needed in some systems to open the file in binary mode.
This string is exactly what is used in the
standard C function fopen.
This function is sandboxed. It may fail if the computer owner's
permissions disallow it.
Checks whether obj is a valid file handle.
Returns the string "file" if obj is an open file handle,
"closed file" if obj is a closed file handle,
or nil if obj is not a file handle.
Closes file.
Note that files are automatically closed when
their handles are garbage collected,
but that takes an unpredictable amount of time to happen.
Reads the file file,
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.
When called without formats,
it uses a default format that reads the entire next line
(see below).
The available formats are
"*n":
reads a number;
this is the only format that returns a number instead of a string.
"*a":
reads the whole file, starting at the current position.
On end of file, it returns the empty string.
"*l":
reads the next line (skipping the end of line),
returning nil on end of file.
This is the default format.
number:
reads a string with up to this number of characters,
returning nil on end of file.
If number is zero,
it reads nothing and returns an empty string,
or nil on end of file.
Sets and gets the file position,
measured from the beginning of the file,
to the position given by offset plus a base
specified by the string whence, as follows:
"set": base is position 0 (beginning of the file);
"cur": base is current position;
"end": base is end of file;
In case of success, function seek returns the final file position,
measured in bytes from the beginning of the file.
If this function fails, it returns nil,
plus a string describing the error.
The default value for whence is "cur",
and for offset is 0.
Therefore, the call file:seek() returns the current
file position, without changing it;
the call file:seek("set") sets the position to the
beginning of the file (and returns 0);
and the call file:seek("end") sets the position to the
end of the file, and returns its size.
Writes the value of each of its arguments to
the file.
The arguments must be strings or numbers.
To write other values,
use tostring or string.format before write.
Returns a string or a table containing date and time,
formatted according to the given string format.
If the time argument is present,
this is the time to be formatted
(see the os.time function for a description of this value).
Otherwise, date formats the current time.
If format starts with '!',
then the date is formatted in Coordinated Universal Time.
After this optional character,
if format is the string "*t",
then date returns a table with the following fields:
year (four digits), month (1--12), day (1--31),
hour (0--23), min (0--59), sec (0--61),
wday (weekday, Sunday is 1),
yday (day of the year),
and isdst (daylight saving flag, a boolean).
If format is not "*t",
then date returns the date as a string,
formatted according to the same rules as the C function strftime.
When called without arguments,
date returns a reasonable date and time representation that depends on
the host system and on the current locale
(that is, os.date() is equivalent to os.date("%c")).
Deletes the file or directory with the given name.
Directories must be empty to be removed.
If this function fails, it returns nil,
plus a string describing the error.
Sets the current locale of the program.
locale is a string specifying a locale;
category is an optional string describing which category to change:
"all", "collate", "ctype",
"monetary", "numeric", or "time";
the default category is "all".
The function returns the name of the new locale,
or nil if the request cannot be honored.
If locale is the empty string,
the current locale is set to an implementation-defined native locale.
If locale is the string "C",
the current locale is set to the standard C locale.
When called with nil as the first argument,
this function only returns the name of the current locale
for the given category.
Returns the current time when called without arguments,
or a time representing the date and time specified by the given table.
This table must have fields year, month, and day,
and may have fields hour, min, sec, and isdst
(for a description of these fields, see the os.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,
and the number returned by time can be used only as an argument to
date and difftime.
Returns a string with a file name that can
be used for a temporary file.
The file must be explicitly opened before its use
and explicitly removed when no longer needed.
On some systems (POSIX),
this function also creates a file with that name,
to avoid security risks.
(Someone else might create the file with wrong permissions
in the time between getting the name and creating the file.)
You still have to open the file to use it
and to remove it (even if you do not use it).
When possible,
you may prefer to use io.tmpfile,
which automatically removes the file when the program ends.
Teliva includes curses facilities identical to Lua's lcurses
library. As there, the top-level module is called curses. All apps
start with the terminal window initialized using
curses.initscr. Look at the
sample apps for example usage.
Initializes the current terminal to stop scrolling and enable moving the
cursor. You shouldn't need to ever call this from Teliva; it's always called
for you before an app is loaded.
Returns a window object for the current terminal. Most curses
operations require a window. Windows are an app's gateway to both print to
screen and read keys from keyboard. Teliva's template.tlv for new applications
saves the result in a global called Window, so you should be able
to avoid calling stdscr directly most of the time.
Curses supports multiple and nested windows. They haven't been tried
yet in the context of Teliva, but they're expected to work. Please report your
experience if you try them out.
Creates a fake window suitable for passing around in tests. The table passed
in should have two keys: a kbd
containing a keyboard, and a scr
containing a screen.
This helper is implemented in template.tlv, so new apps should pick it up from
there.
Teliva includes the well-known
json.lua library (module
json). It also includes a variant in module jsonf that can
read JSON from channels opened by
start_reading.
Reads a value encoded in JSON from a file and returns it.
f is the type of file object returned by
start_reading (i.e. supporting
f.read(format)).
For example, suppose file foo contains '[1,2,3,{"x":10}]'. Then:
local infile = start_reading(nil, 'foo')
jsonf.decode(infile) -- Returns { 1, 2, 3, { x = 10 } }
Run fun as a coroutine with given parameters. Spawn tasks instead of
just calling coroutine.create
when you can't statically predict how your coroutines will transfer control to
each other.
Starts running any spawned tasks. Execution transfers to spawned tasks;
this function only returns when there are no tasks left to run or when all
tasks are blocked (deadlock).
Write value to a channel. Blocks the current coroutine if the
channel is already full. (Channels with size 0 always block if there isn't
already a coroutine trying to recv
from them.)
Here is the complete syntax of Lua in extended BNF.
(It does not describe operator precedences.)
chunk ::= {stat [`;´]} [laststat [`;´]]
block ::= chunk
stat ::= varlist `=´ explist |
functioncall |
do block end |
while exp do block end |
repeat block until exp |
if exp then block {elseif exp then block} [else block] end |
for Name `=´ exp `,´ exp [`,´ exp] do block end |
for namelist in explist do block end |
function funcname funcbody |
localfunction Name funcbody |
local namelist [`=´ explist]
laststat ::= return [explist] | break
funcname ::= Name {`.´ Name} [`:´ Name]
varlist ::= var {`,´ var}
var ::= Name | prefixexp `[´ exp `]´ | prefixexp `.´ Name
namelist ::= Name {`,´ Name}
explist ::= {exp `,´} exp
exp ::= nil | false | true | Number | String | `...´ | function |
prefixexp | tableconstructor | exp binop exp | unop exp
prefixexp ::= var | functioncall | `(´ exp `)´
functioncall ::= prefixexp args | prefixexp `:´ Name args
args ::= `(´ [explist] `)´ | tableconstructor | String
function ::= function funcbody
funcbody ::= `(´ [parlist] `)´ block end
parlist ::= namelist [`,´ `...´] | `...´
tableconstructor ::= `{´ [fieldlist] `}´
fieldlist ::= field {fieldsep field} [fieldsep]
field ::= `[´ exp `]´ `=´ exp | Name `=´ exp | exp
fieldsep ::= `,´ | `;´
binop ::= `+´ | `-´ | `*´ | `/´ | `^´ | `%´ | `..´ |
`<´ | `<=´ | `>´ | `>=´ | `==´ | `~=´ |
and | or
unop ::= `-´ | not | `#´
Last update:
Mon Feb 13 18:54:19 BRST 2012
================================================
FILE: gemini.tlv
================================================
# .tlv file generated by https://github.com/akkartik/teliva
# You may edit it if you are careful; however, you may see cryptic errors if you
# violate Teliva's assumptions.
#
# .tlv files are representations of Teliva programs. Teliva programs consist of
# sequences of definitions. Each definition is a table of key/value pairs. Keys
# and values are both strings.
#
# Lines in .tlv files always follow exactly one of the following forms:
# - comment lines at the top of the file starting with '#' at column 0
# - beginnings of definitions starting with '- ' at column 0, followed by a
# key/value pair
# - key/value pairs consisting of ' ' at column 0, containing either a
# spaceless value on the same line, or a multi-line value
# - multiline values indented by more than 2 spaces, starting with a '>'
#
# If these constraints are violated, Teliva may unceremoniously crash. Please
# report bugs at http://akkartik.name/contact
- __teliva_timestamp: original
str_helpers:
>-- some string helpers from http://lua-users.org/wiki/StringIndexing
>
>-- index characters using []
>getmetatable('').__index = function(str,i)
> if type(i) == 'number' then
> return str:sub(i,i)
> else
> return string[i]
> end
>end
>
>-- ranges using (), selected bytes using {}
>getmetatable('').__call = function(str,i,j)
> if type(i)~='table' then
> return str:sub(i,j)
> else
> local t={}
> for k,v in ipairs(i) do
> t[k]=str:sub(v,v)
> end
> return table.concat(t)
> end
>end
>
>-- iterate over an ordered sequence
>function q(x)
> if type(x) == 'string' then
> return x:gmatch('.')
> else
> return ipairs(x)
> end
>end
>
>-- insert within string
>function string.insert(str1, str2, pos)
> return str1:sub(1,pos)..str2..str1:sub(pos+1)
>end
>
>function string.remove(s, pos)
> return s:sub(1,pos-1)..s:sub(pos+1)
>end
>
>function string.pos(s, sub)
> return string.find(s, sub, 1, true) -- plain=true to disable regular expressions
>end
>
>-- TODO: backport utf-8 support from Lua 5.3
- __teliva_timestamp: original
debugy:
>debugy = 5
- __teliva_timestamp: original
dbg:
>-- helper for debug by print; overlay debug information towards the right
>-- reset debugy every time you refresh screen
>function dbg(window, s)
> local oldy = 0
> local oldx = 0
> oldy, oldx = window:getyx()
> window:mvaddstr(debugy, 60, s)
> debugy = debugy+1
> window:mvaddstr(oldy, oldx, '')
>end
- __teliva_timestamp: original
check:
>function check(x, msg)
> if x then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' '..str(x)..' is false/nil')
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
check_eq:
>function check_eq(x, expected, msg)
> if eq(x, expected) then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' expected '..str(expected)..' but got '..str(x))
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
eq:
>function eq(a, b)
> if type(a) ~= type(b) then return false end
> if type(a) == 'table' then
> if #a ~= #b then return false end
> for k, v in pairs(a) do
> if b[k] ~= v then
> return false
> end
> end
> for k, v in pairs(b) do
> if a[k] ~= v then
> return false
> end
> end
> return true
> end
> return a == b
>end
- __teliva_timestamp: original
str:
>-- smarter tostring
>-- slow; used only for debugging
>function str(x)
> if type(x) == 'table' then
> local result = ''
> result = result..#x..'{'
> for k, v in pairs(x) do
> result = result..str(k)..'='..str(v)..', '
> end
> result = result..'}'
> return result
> elseif type(x) == 'string' then
> return '"'..x..'"'
> end
> return tostring(x)
>end
- __teliva_timestamp: original
find_index:
>function find_index(arr, x)
> for n, y in ipairs(arr) do
> if x == y then
> return n
> end
> end
>end
- __teliva_timestamp: original
trim:
>function trim(s)
> return s:gsub('^%s*', ''):gsub('%s*$', '')
>end
- __teliva_timestamp: original
split:
>function split(s, d)
> result = {}
> for match in (s..d):gmatch("(.-)"..d) do
> table.insert(result, match);
> end
> return result
>end
- __teliva_timestamp: original
clear:
>function clear(lines)
> while #lines > 0 do
> table.remove(lines)
> end
>end
- __teliva_timestamp: original
Window:
>Window = curses.stdscr()
- __teliva_timestamp: original
render_line:
>function render_line(window, y, line)
> window:mvaddstr(y, 0, '')
> for i=1,line:len() do
> window:addstr(line[i])
> end
>end
- __teliva_timestamp: original
render_link:
>function render_link(window, y, line)
> local rendered_line = line:gsub('=>%s*%S*%s*', '')
> if trim(rendered_line) == '' then
> rendered_line = line
> end
> render_line(window, y, rendered_line)
>end
- __teliva_timestamp: original
state:
>state = {
> lines={},
> history={},
> highlight_index=0,
> source=false, -- show source (link urls, etc.)
>}
- __teliva_timestamp: original
render_page:
>function render_page(window)
> local y = 0
> window:attron(curses.color_pair(6))
> print(state.url)
> window:attroff(curses.color_pair(6))
> y = y+2
>--? dbg(window, state.highlight_index)
> for i, line in pairs(state.lines) do
> if not state.source and line:find('=> ') == 1 then
> if state.highlight_index == 0 or i == state.highlight_index then
> -- highlighted link
> state.highlight_index = i -- TODO: ugly state update while rendering, just for first render after gemini_get
> window:attron(curses.A_REVERSE)
> render_link(window, y, line)
> window:attroff(curses.A_REVERSE)
> else
> -- link
> window:attron(curses.A_BOLD)
> render_link(window, y, line)
> window:attroff(curses.A_BOLD)
> end
> else
> -- non-link
> render_line(window, y, line)
> end
> y = y+1
> end
>end
- __teliva_timestamp: original
render:
>function render(window, lines)
> window:clear()
> render_page(window, lines)
> curses.curs_set(0)
> window:refresh()
>end
- __teliva_timestamp: original
menu:
>menu = {
> {'Enter', 'go to highlight'},
> {'<-', 'back'},
> {'^g', 'enter url'},
> {'^u', 'view source'},
>}
- __teliva_timestamp: original
edit_line:
>function edit_line(window)
> local result = ''
> local cursor = 1
> local screen_rows, screen_cols = window:getmaxyx()
> menu = {
> {'enter', 'submit'},
> {'^g', 'cancel'},
> {'^u', 'clear'},
> }
> while true do
> window:mvaddstr(screen_rows-1, 9, '')
> window:clrtoeol()
> window:mvaddstr(screen_rows-1, 9, result)
> window:attron(curses.A_REVERSE)
> -- window:refresh()
> local key = window:getch()
> window:attrset(curses.A_NORMAL)
> if key >= 32 and key < 127 then
> local screen_rows, screen_cols = window:getmaxyx()
> if #result < screen_cols then
> result = result:insert(string.char(key), cursor-1)
> cursor = cursor+1
> end
> elseif key == curses.KEY_LEFT then
> if cursor > 1 then
> cursor = cursor-1
> end
> elseif key == curses.KEY_RIGHT then
> if cursor <= #result then
> cursor = cursor+1
> end
> elseif key == curses.KEY_BACKSPACE then
> if cursor > 1 then
> cursor = cursor-1
> result = result:remove(cursor)
> end
> elseif key == 21 then -- ctrl-u
> result = ''
> cursor = 1
> elseif key == 10 then -- enter
> return result
> elseif key == 7 then -- ctrl-g
> return nil
> end
> end
>end
- __teliva_timestamp: original
is_link:
>function is_link(line)
> return line:find('=>%s*%S*%s*') == 1
>end
- __teliva_timestamp: original
next_link:
>function next_link()
> local new_index = state.highlight_index
> while true do
> new_index = new_index+1
> if new_index > #state.lines then return end
> if is_link(state.lines[new_index]) then break end
> end
> state.highlight_index = new_index
>end
- __teliva_timestamp: original
previous_link:
>function previous_link()
> local new_index = state.highlight_index
> while true do
> new_index = new_index - 1
> if new_index < 1 then return end
> if is_link(state.lines[new_index]) then break end
> end
> state.highlight_index = new_index
>end
- __teliva_timestamp: original
update:
>function update(window)
> local key = window:getch()
> local screen_rows, screen_cols = window:getmaxyx()
> if key == curses.KEY_DOWN then
> next_link()
> elseif key == curses.KEY_UP then
> previous_link()
> elseif key == curses.KEY_LEFT then
> if #state.history > 1 then
> table.remove(state.history)
> gemini_get(table.remove(state.history))
> end
> elseif key == 21 then -- ctrl-u
> state.source = not state.source
> elseif key == 10 then -- enter
> local s, e, new_url = string.find(state.lines[state.highlight_index], '=>%s*(%S*)')
> gemini_get(url.absolute(state.url, new_url))
> elseif key == 7 then -- ctrl-g
> window:mvaddstr(screen_rows-2, 0, '')
> window:clrtoeol()
> window:mvaddstr(screen_rows-1, 0, '')
> window:clrtoeol()
> window:mvaddstr(screen_rows-1, 5, 'go: ')
> curses.curs_set(2)
> local old_menu = menu
> local new_url = edit_line(window)
> menu = old_menu
> if new_url then
> state.url = new_url
> gemini_get(new_url)
> end
> curses.curs_set(0)
> end
>end
- __teliva_timestamp: original
init_colors:
>function init_colors()
> for i=0,7 do
> curses.init_pair(i, i, -1)
> end
> curses.init_pair(8, 7, 0)
> curses.init_pair(9, 7, 1)
> curses.init_pair(10, 7, 2)
> curses.init_pair(11, 7, 3)
> curses.init_pair(12, 7, 4)
> curses.init_pair(13, 7, 5)
> curses.init_pair(14, 7, 6)
> curses.init_pair(15, -1, 15)
>end
- __teliva_timestamp: original
main:
>function main()
> Window:clear()
> Window:refresh()
> init_colors()
> local lines = {}
> local url = ''
> if #arg > 0 then
> state.url = arg[1]
> lines = gemini_get(state.url)
> end
> while true do
> render(Window, lines)
> update(Window, lines)
> end
>end
- __teliva_timestamp: original
http_get:
>function http_get(url)
> -- https://stackoverflow.com/questions/42445423/luasocket-serveraccept-timeout-tcp
> local parsed_url = socket.url.parse(url)
> local tcp = socket.tcp()
> tcp:connect(parsed_url.host, 80)
> tcp:send('GET / HTTP/1.1\r\n')
> -- http requires the Host header
> tcp:send(string.format('Host: %s\r\n', parsed_url.host))
> tcp:send('\r\n')
> -- tcp:receive('*a') doesn't seem to detect when a request is done
> -- so we have to manage the size of the expected response
> headers = {}
> while true do
> local s, status = tcp:receive()
> if s == nil then break end
> if s == '' then break end
> local header, value = s:match('(.-): (.*)')
> if header == nil then
> print(s)
> else
> headers[header:lower()] = value
> print(header, value)
> end
> end
> local bytes_remaining = tonumber(headers['content-length'])
> body = ''
> while true do
> local s, status = tcp:receive(bytes_remaining)
> if s == nil then break end
> body = body .. s
> bytes_remaining = bytes_remaining - s:len()
> if bytes_remaining <= 0 then break end
> end
> return body
>end
- __teliva_timestamp: original
https_get:
>-- http://notebook.kulchenko.com/programming/https-ssl-calls-with-lua-and-luasec
>function https_get(url)
> local parsed_url = socket.url.parse(url)
> local params = {
> mode = 'client',
> protocol = 'any',
> verify = 'none', -- I don't know what I'm doing
> options = 'all',
> }
> local conn = socket.tcp()
> conn:connect(parsed_url.host, parsed_url.port or 443)
> conn, err = ssl.wrap(conn, params)
> if conn == nil then
> io.write(err)
> os.exit(1)
> end
> conn:dohandshake()
>
> conn:send(url .. "\r\n")
> local line, err = conn:receive()
> return line or err
>end
- __teliva_timestamp: original
parse_gemini_body:
>function parse_gemini_body(conn, type)
> if type == 'text/gemini' then
> while true do
> local line, err = conn:receive()
> if line == nil then break end
> table.insert(state.lines, line)
> end
> elseif type:sub(1, 5) == 'text/' then
> while true do
> local line, err = conn:receive()
> if line == nil then break end
> table.insert(state.lines, line)
> end
> end
>end
- __teliva_timestamp: original
gemini_get:
>-- http://notebook.kulchenko.com/programming/https-ssl-calls-with-lua-and-luasec
>-- https://tildegit.org/solderpunk/gemini-demo-2
>-- returns an array of lines, containing either the body or just an error
>function gemini_get(url)
> if url:find("://") == nil then
> url = "gemini://" .. url
> end
> local parsed_url = socket.url.parse(url)
> local params = {
> mode = 'client',
> protocol = 'any',
> verify = 'none', -- I don't know what I'm doing
> options = 'all',
> }
> local conn = socket.tcp()
> local conn2, err = conn:connect(parsed_url.host, parsed_url.port or 1965)
> clear(state.lines)
> state.highlight_index = 0 -- highlighted link not computed yet
> if conn2 == nil then
> table.insert(state.lines, err)
> return
> end
> conn, err = ssl.wrap(conn, params)
> if conn == nil then
> table.insert(state.lines, err)
> return
> end
> conn:dohandshake()
> conn:send(url .. "\r\n")
> local line, err = conn:receive()
> if line == nil then
> table.insert(state.lines, err)
> return
> end
> local status, meta = line:match("(%S+) (%S+)")
> if status[1] == '2' then
> parse_gemini_body(conn, meta)
> state.url = url
> table.insert(state.history, url)
> elseif status[1] == '3' then
> gemini_get(socket.url.absolute(url, meta))
> elseif status[1] == '4' or line[1] == '5' then
> table.insert(state.lines, 'Error: '..meta)
> else
> table.insert(state.lines, 'invalid response from server: '..line)
> end
>end
- __teliva_timestamp:
>Thu Feb 17 20:04:42 2022
doc:blurb:
>A bare-bones browser for the Gemini protocol
>
>https://gemini.circumlunar.space
>
>A couple of good pages to try it out with:
> $ src/teliva gemini.tlv gemini.circumlunar.space
> $ src/teliva gemini.tlv gemini.conman.org
> $ src/teliva gemini.tlv gemini.susa.net/cgi-bin/links.lua # shows 20 random links from Gemini space
================================================
FILE: graphviz.tlv
================================================
# .tlv file generated by https://github.com/akkartik/teliva
# You may edit it if you are careful; however, you may see cryptic errors if you
# violate Teliva's assumptions.
#
# .tlv files are representations of Teliva programs. Teliva programs consist of
# sequences of definitions. Each definition is a table of key/value pairs. Keys
# and values are both strings.
#
# Lines in .tlv files always follow exactly one of the following forms:
# - comment lines at the top of the file starting with '#' at column 0
# - beginnings of definitions starting with '- ' at column 0, followed by a
# key/value pair
# - key/value pairs consisting of ' ' at column 0, containing either a
# spaceless value on the same line, or a multi-line value
# - multiline values indented by more than 2 spaces, starting with a '>'
#
# If these constraints are violated, Teliva may unceremoniously crash. Please
# report bugs at http://akkartik.name/contact
- __teliva_timestamp: original
str_helpers:
>-- some string helpers from http://lua-users.org/wiki/StringIndexing
>
>-- index characters using []
>getmetatable('').__index = function(str,i)
> if type(i) == 'number' then
> return str:sub(i,i)
> else
> return string[i]
> end
>end
>
>-- ranges using (), selected bytes using {}
>getmetatable('').__call = function(str,i,j)
> if type(i)~='table' then
> return str:sub(i,j)
> else
> local t={}
> for k,v in ipairs(i) do
> t[k]=str:sub(v,v)
> end
> return table.concat(t)
> end
>end
>
>-- iterate over an ordered sequence
>function q(x)
> if type(x) == 'string' then
> return x:gmatch('.')
> else
> return ipairs(x)
> end
>end
>
>-- insert within string
>function string.insert(str1, str2, pos)
> return str1:sub(1,pos)..str2..str1:sub(pos+1)
>end
>
>function string.remove(s, pos)
> return s:sub(1,pos-1)..s:sub(pos+1)
>end
>
>function string.pos(s, sub)
> return string.find(s, sub, 1, true) -- plain=true to disable regular expressions
>end
>
>-- TODO: backport utf-8 support from Lua 5.3
- __teliva_timestamp: original
debugy:
>debugy = 5
- __teliva_timestamp: original
dbg:
>-- helper for debug by print; overlay debug information towards the right
>-- reset debugy every time you refresh screen
>function dbg(window, s)
> local oldy = 0
> local oldx = 0
> oldy, oldx = window:getyx()
> window:mvaddstr(debugy, 60, s)
> debugy = debugy+1
> window:mvaddstr(oldy, oldx, '')
>end
- __teliva_timestamp: original
check:
>function check(x, msg)
> if x then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' '..str(x)..' is false/nil')
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
check_eq:
>function check_eq(x, expected, msg)
> if eq(x, expected) then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' expected '..str(expected)..' but got '..str(x))
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
eq:
>function eq(a, b)
> if type(a) ~= type(b) then return false end
> if type(a) == 'table' then
> if #a ~= #b then return false end
> for k, v in pairs(a) do
> if b[k] ~= v then
> return false
> end
> end
> for k, v in pairs(b) do
> if a[k] ~= v then
> return false
> end
> end
> return true
> end
> return a == b
>end
- __teliva_timestamp: original
str:
>-- smarter tostring
>-- slow; used only for debugging
>function str(x)
> if type(x) == 'table' then
> local result = ''
> result = result..#x..'{'
> for k, v in pairs(x) do
> result = result..str(k)..'='..str(v)..', '
> end
> result = result..'}'
> return result
> elseif type(x) == 'string' then
> return '"'..x..'"'
> end
> return tostring(x)
>end
- __teliva_timestamp: original
find_index:
>function find_index(arr, x)
> for n, y in ipairs(arr) do
> if x == y then
> return n
> end
> end
>end
- __teliva_timestamp: original
trim:
>function trim(s)
> return s:gsub('^%s*', ''):gsub('%s*$', '')
>end
- __teliva_timestamp: original
split:
>function split(s, d)
> result = {}
> for match in (s..d):gmatch("(.-)"..d) do
> table.insert(result, match);
> end
> return result
>end
- __teliva_timestamp: original
map:
>-- only for arrays
>function map(l, f)
> result = {}
> for _, x in ipairs(l) do
> table.insert(result, f(x))
> end
> return result
>end
- __teliva_timestamp: original
reduce:
>-- only for arrays
>function reduce(l, f, init)
> result = init
> for _, x in ipairs(l) do
> result = f(result, x)
> end
> return result
>end
- __teliva_timestamp: original
filter:
>function filter(h, f)
> result = {}
> for k, v in pairs(h) do
> if f(k, v) then
> result[k] = v
> end
> end
> return result
>end
- __teliva_timestamp: original
ifilter:
>-- only for arrays
>function ifilter(l, f)
> result = {}
> for _, x in ipairs(l) do
> if f(x) then
> table.insert(result, x)
> end
> end
> return result
>end
- __teliva_timestamp: original
sort_letters:
>function sort_letters(s)
> tmp = {}
> for i=1,#s do
> table.insert(tmp, s[i])
> end
> table.sort(tmp)
> local result = ''
> for _, c in pairs(tmp) do
> result = result..c
> end
> return result
>end
>
>function test_sort_letters(s)
> check_eq(sort_letters(''), '', 'test_sort_letters: empty')
> check_eq(sort_letters('ba'), 'ab', 'test_sort_letters: non-empty')
> check_eq(sort_letters('abba'), 'aabb', 'test_sort_letters: duplicates')
>end
- __teliva_timestamp: original
count_letters:
>-- TODO: handle unicode
>function count_letters(s)
> local result = {}
> for i=1,s:len() do
> local c = s[i]
> if result[c] == nil then
> result[c] = 1
> else
> result[c] = result[c] + 1
> end
> end
> return result
>end
- __teliva_timestamp: original
count:
>-- turn an array of elements into a map from elements to their frequency
>-- analogous to count_letters for non-strings
>function count(a)
> local result = {}
> for i, v in ipairs(a) do
> if result[v] == nil then
> result[v] = 1
> else
> result[v] = result[v] + 1
> end
> end
> return result
>end
- __teliva_timestamp: original
union:
>function union(a, b)
> for k, v in pairs(b) do
> a[k] = v
> end
> return a
>end
- __teliva_timestamp: original
subtract:
>-- set subtraction
>function subtract(a, b)
> for k, v in pairs(b) do
> a[k] = nil
> end
> return a
>end
- __teliva_timestamp: original
all:
>-- universal quantifier on sets
>function all(s, f)
> for k, v in pairs(s) do
> if not f(k, v) then
> return false
> end
> end
> return true
>end
- __teliva_timestamp: original
to_array:
>-- turn a set into an array
>-- drops values
>function to_array(h)
> local result = {}
> for k, _ in pairs(h) do
> table.insert(result, k)
> end
> return result
>end
- __teliva_timestamp: original
append:
>-- concatenate list 'elems' into 'l', modifying 'l' in the process
>function append(l, elems)
> for i=1,#elems do
> table.insert(l, elems[i])
> end
>end
- __teliva_timestamp: original
prepend:
>-- concatenate list 'elems' into the start of 'l', modifying 'l' in the process
>function prepend(l, elems)
> for i=1,#elems do
> table.insert(l, i, elems[i])
> end
>end
- __teliva_timestamp: original
all_but:
>function all_but(x, idx)
> if type(x) == 'table' then
> local result = {}
> for i, elem in ipairs(x) do
> if i ~= idx then
> table.insert(result,elem)
> end
> end
> return result
> elseif type(x) == 'string' then
> if idx < 1 then return x:sub(1) end
> return x:sub(1, idx-1) .. x:sub(idx+1)
> else
> error('all_but: unsupported type '..type(x))
> end
>end
>
>function test_all_but()
> check_eq(all_but('', 0), '', 'all_but: empty')
> check_eq(all_but('abc', 0), 'abc', 'all_but: invalid low index')
> check_eq(all_but('abc', 4), 'abc', 'all_but: invalid high index')
> check_eq(all_but('abc', 1), 'bc', 'all_but: first index')
> check_eq(all_but('abc', 3), 'ab', 'all_but: final index')
> check_eq(all_but('abc', 2), 'ac', 'all_but: middle index')
>end
- __teliva_timestamp: original
set:
>function set(l)
> local result = {}
> for i, elem in ipairs(l) do
> result[elem] = true
> end
> return result
>end
- __teliva_timestamp: original
set_eq:
>function set_eq(l1, l2)
> return eq(set(l1), set(l2))
>end
>
>function test_set_eq()
> check(set_eq({1}, {1}), 'set_eq: identical')
> check(not set_eq({1, 2}, {1, 3}), 'set_eq: different')
> check(set_eq({1, 2}, {2, 1}), 'set_eq: order')
> check(set_eq({1, 2, 2}, {2, 1}), 'set_eq: duplicates')
>end
- __teliva_timestamp: original
clear:
>function clear(lines)
> while #lines > 0 do
> table.remove(lines)
> end
>end
- __teliva_timestamp: original
zap:
>function zap(target, src)
> clear(target)
> append(target, src)
>end
- __teliva_timestamp: original
mfactorial:
>-- memoized version of factorial
>-- doesn't memoize recursive calls, but may be good enough
>mfactorial = memo1(factorial)
- __teliva_timestamp: original
factorial:
>function factorial(n)
> local result = 1
> for i=1,n do
> result = result*i
> end
> return result
>end
- __teliva_timestamp: original
memo1:
>-- a higher-order function that takes a function of a single arg
>-- (that never returns nil)
>-- and returns a memoized version of it
>function memo1(f)
> local memo = {}
> return function(x)
> if memo[x] == nil then
> memo[x] = f(x)
> end
> return memo[x]
> end
>end
>
>-- mfactorial doesn't seem noticeably faster
>function test_memo1()
> for i=0,30 do
> check_eq(mfactorial(i), factorial(i), 'memo1 over factorial: '..str(i))
> end
>end
- __teliva_timestamp: original
num_permutations:
>-- number of permutations of n distinct objects, taken r at a time
>function num_permutations(n, r)
> return factorial(n)/factorial(n-r)
>end
>
>-- mfactorial doesn't seem noticeably faster
>function test_memo1()
> for i=0,30 do
> for j=0,i do
> check_eq(num_permutations(i, j), mfactorial(i)/mfactorial(i-j), 'num_permutations memoizes: '..str(i)..'P'..str(j))
> end
> end
>end
- __teliva_timestamp: original
menu:
>-- To show app-specific hotkeys in the menu bar, add hotkey/command
>-- arrays of strings to the menu array.
>menu = {}
- __teliva_timestamp: original
Window:
>Window = curses.stdscr()
- __teliva_timestamp: original
window:
>-- constructor for fake screen and window
>-- call it like this:
>-- local w = window{
>-- kbd=kbd('abc'),
>-- scr=scr{h=5, w=4},
>-- }
>-- eventually it'll do everything a real ncurses window can
>function window(h)
> h.__index = h
> setmetatable(h, h)
> h.__index = function(table, key)
> return rawget(h, key)
> end
> h.attrset = function(self, x)
> self.scr.attrs = x
> end
> h.attron = function(self, x)
> -- currently same as attrset since Lua 5.1 doesn't have bitwise operators
> -- doesn't support multiple attrs at once
>-- local old = self.scr.attrs
>-- self.scr.attrs = old|x
> self.scr.attrs = x
> end
> h.attroff = function(self, x)
> -- currently borked since Lua 5.1 doesn't have bitwise operators
> -- doesn't support multiple attrs at once
>-- local old = self.scr.attrs
>-- self.scr.attrs = old & (~x)
> self.scr.attrs = curses.A_NORMAL
> end
> h.getch = function(self)
> local c = table.remove(h.kbd, 1)
> if c == nil then return c end
> return string.byte(c) -- for verisimilitude with ncurses
> end
> h.addch = function(self, c)
> local scr = self.scr
> if c == '\n' then
> scr.cursy = scr.cursy+1
> scr.cursx = 0
> return
> end
> if scr.cursy <= scr.h then
> scr[scr.cursy][scr.cursx] = {data=c, attrs=scr.attrs}
> scr.cursx = scr.cursx+1
> if scr.cursx > scr.w then
> scr.cursy = scr.cursy+1
> scr.cursx = 1
> end
> end
> end
> h.addstr = function(self, s)
> for i=1,s:len() do
> self:addch(s[i])
> end
> end
> h.mvaddch = function(self, y, x, c)
> self.scr.cursy = y
> self.scr.cursx = x
> self:addch(c)
> end
> h.mvaddstr = function(self, y, x, s)
> self.scr.cursy = y
> self.scr.cursx = x
> self:addstr(s)
> end
> h.clear = function(self)
> clear_scr(self.scr)
> end
> h.refresh = function(self)
> -- nothing
> end
> return h
>end
- __teliva_timestamp: original
kbd:
>function kbd(keys)
> local result = {}
> for i=1,keys:len() do
> table.insert(result, keys[i])
> end
> return result
>end
- __teliva_timestamp: original
scr:
>function scr(props)
> props.cursx = 1
> props.cursy = 1
> clear_scr(props)
> return props
>end
- __teliva_timestamp: original
clear_scr:
>function clear_scr(props)
> props.cursy = 1
> props.cursx = 1
> for y=1,props.h do
> props[y] = {}
> for x=1,props.w do
> props[y][x] = {data=' ', attrs=curses.A_NORMAL}
> end
> end
> return props
>end
- __teliva_timestamp: original
check_screen:
>function check_screen(window, contents, message)
> local x, y = 1, 1
> for i=1,contents:len() do
> check_eq(window.scr[y][x].data, contents[i], message..'/'..y..','..x)
> x = x+1
> if x > window.scr.w then
> y = y+1
> x = 1
> end
> end
>end
>
>-- putting it all together, an example test of both keyboard and screen
>function test_check_screen()
> local lines = {
> c='123',
> d='234',
> a='345',
> b='456',
> }
> local w = window{
> kbd=kbd('abc'),
> scr=scr{h=3, w=5},
> }
> local y = 1
> while true do
> local b = w:getch()
> if b == nil then break end
> w:mvaddstr(y, 1, lines[string.char(b)])
> y = y+1
> end
> check_screen(w, '345 '..
> '456 '..
> '123 ',
> 'test_check_screen')
>end
- __teliva_timestamp: original
check_reverse:
>function check_reverse(window, contents, message)
> local x, y = 1, 1
> for i=1,contents:len() do
> if contents[i] ~= ' ' then
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & curses.A_REVERSE, message..'/'..y..','..x)
> check_eq(window.scr[y][x].attrs, curses.A_REVERSE, message..'/'..y..','..x)
> else
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & (~curses.A_REVERSE), message..'/'..y..','..x)
> check(window.scr[y][x].attrs ~= curses.A_REVERSE, message..'/'..y..','..x)
> end
> x = x+1
> if x > window.scr.w then
> y = y+1
> x = 1
> end
> end
>end
- __teliva_timestamp: original
check_bold:
>function check_bold(window, contents, message)
> local x, y = 1, 1
> for i=1,contents:len() do
> if contents[i] ~= ' ' then
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & curses.A_BOLD, message..'/'..y..','..x)
> check_eq(window.scr[y][x].attrs, curses.A_BOLD, message..'/'..y..','..x)
> else
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & (~curses.A_BOLD), message..'/'..y..','..x)
> check(window.scr[y][x].attrs ~= curses.A_BOLD, message..'/'..y..','..x)
> end
> x = x+1
> if x > window.scr.w then
> y = y+1
> x = 1
> end
> end
>end
- __teliva_timestamp: original
check_color:
>-- check which parts of a screen have the given color_pair
>function check_color(window, cp, contents, message)
> local x, y = 1, 1
> for i=1,contents:len() do
> if contents[i] ~= ' ' then
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & curses.color_pair(cp), message..'/'..y..','..x)
> check_eq(window.scr[y][x].attrs, curses.color_pair(cp), message..'/'..y..','..x)
> else
> -- hacky version while we're without bitwise operators on Lua 5.1
>-- check(window.scr[y][x].attrs & (~curses.A_BOLD), message..'/'..y..','..x)
> check(window.scr[y][x].attrs ~= curses.color_pair(cp), message..'/'..y..','..x)
> end
> x = x+1
> if x > window.scr.w then
> y = y+1
> x = 1
> end
> end
>end
- __teliva_timestamp: original
sep:
>-- horizontal separator
>function sep(window)
> local y, _ = window:getyx()
> window:mvaddstr(y+1, 0, '')
> local _, cols = window:getmaxyx()
> for col=1,cols do
> window:addstr('_')
> end
>end
- __teliva_timestamp: original
render:
>function render(window)
> window:clear()
> -- draw stuff to screen here
> window:attron(curses.A_BOLD)
> window:mvaddstr(1, 5, "example app")
> window:attrset(curses.A_NORMAL)
> for i=0,15 do
> window:attrset(curses.color_pair(i))
> window:mvaddstr(3+i, 5, "========================")
> end
> window:refresh()
>end
- __teliva_timestamp: original
update:
>function update(window)
> local key = window:getch()
> -- process key here
>end
- __teliva_timestamp: original
doc:blurb:
>A REPL for queries about a graph in a .dot file.
- __teliva_timestamp: original
main:
>function main()
> if #arg == 0 then
> Window:clear()
> print('restart this app with the name of a .dot file')
> Window:refresh()
> while true do Window:getch(); end
> end
> Graph = read_dot_file(arg[1])
>
> while true do
> render(Window)
> update(Window)
> end
>end
- __teliva_timestamp: original
Graph:
>Graph = {}
- __teliva_timestamp: original
read_dot_file:
>function read_dot_file(filename)
> local graph = {}
> local infile = start_reading(nil, filename)
> if infile then
> local chars = graphviz_buffered_reader(infile)
> local tokens = graphviz_tokenizer(chars)
> parse_graph(tokens, graph)
> end
> return graph
>end
- __teliva_timestamp: original
graphviz_buffered_reader:
>-- a stream of characters that can peek up to two characters ahead at a time
>-- returns nil when there's nothing left to read
>function graphviz_buffered_reader(infile)
> return {
> infile = infile,
> peek = infile.read(1),
> peek2 = infile.read(1),
> read = function(self)
> local result = self.peek
> self.peek = self.peek2
> self.peek2 = self.infile.read(1)
> return result
> end,
> }
>end
- __teliva_timestamp: original
graphviz_tokenizer:
>-- a stream of tokens that can peek up to one token at a time
>-- returns nil when there's nothing left to read
>function graphviz_tokenizer(chars)
> return {
> chars = chars,
> peek = function(self)
> if not self.buffer then
> self.buffer = self:next_token()
> end
> return self.buffer
> end,
> read = function(self)
> local result
> if self.buffer then
> result = self.buffer
> self.buffer = nil
> else
> result = self:next_token()
> end
> return result
> end,
> next_token = function(self)
> self:skip_whitespace_and_comments()
> local c = self.chars.peek
> if c == nil then return nil end
> if string.pos('/*;,', c) then
> -- should be skipped as comments
> error('unexpected character '..c)
> elseif string.pos('[]{}():=', c) then
> -- single-char tokens
> return self.chars:read()
> elseif c == '"' then
> return self:string()
> elseif c == '<' then
> error('html strings are not implemented yet')
> elseif c == '-' then
> if self.chars.peek2 == '-' or self.chars.peek2 == '>' then
> return self:edgeop()
> else
> return self:numeral()
> end
> elseif string.pos('.0123456789', c) then
> return self:numeral()
> elseif string.match(c, '[%a_]') then
> return self:identifier()
> else
> error('unexpected character '..str(c))
> end
> end,
> skip_whitespace_and_comments = function(self)
> while true do
> local c = self.chars.peek
> if c == nil then
> break -- end of chars
> elseif string.match(c, '%s') then
> self.chars:read()
> elseif string.pos(',;', c) then
> self.chars:read()
> elseif c == '#' then
> self.chars:read() -- skip
> while self.chars:read() ~= '\n' do end
> elseif c == '/' then
> local c2 = self.chars.peek2
> if c2 == '*' then
> self.chars:read() -- skip '/'
> self.chars:read() -- skip '*'
> while true do
> if self.chars.peek == '*' and self.chars.peek2 == '/' then
> self.chars:read() -- skip '*'
> self.chars:read() -- skip '/'
> break
> end
> end
> elseif c2 == '/' then
> self.chars:read() -- skip '/'
> self.chars:read() -- skip '/'
> while self.chars:read() ~= '\n' do end
> else
> error('unexpected character after "/": '..c)
> end
> else
> break
> end
> end
> end,
> string = function(self)
> assert(self.chars.peek == '"')
> local result = self.chars:read()
> while true do
> local c = self.chars.peek
> if c == nil then
> error('unterminated string literal')
> end
> result = result..self.chars:read()
> if c == '\\' then
> result = result..self.chars:read() -- unconditionally read next char
> elseif c == '"' then
> break
> end
> end
> return result
> end,
> numeral = function(self)
> local result = ''
> while true do
> local c = self.chars.peek
> if c == nil then
> return result
> elseif string.pos('-.0123456789', c) then
> result = result..self.chars:read()
> else
> break
> end
> end
> if string.match(self.chars.peek, '%w') then
> error('invalid character after numeral '..result)
> end
> return result
> end,
> identifier = function(self)
> local result = ''
> while true do
> local c = self.chars.peek
> if c == nil then
> error('unterminated string literal')
> elseif string.match(c, '[%w_]') then
> result = result..self.chars:read()
> else
> break
> end
> end
> return result
> end,
> edgeop = function(self)
> return self.chars:read()..self.chars:read()
> end,
> }
>end
>
>function check_tokenizer(stream, expected, msg)
> local infile = fake_file_stream(stream)
> local chars = graphviz_buffered_reader(infile)
> local tokens = graphviz_tokenizer(chars)
> check_eq(tokens:read(), expected, msg)
>end
>
>function test_graphviz_tokenizer()
> check_tokenizer('123', '123', 'tokenizer: numeral')
> check_tokenizer(' 123', '123', 'tokenizer: skips whitespace')
> check_tokenizer('123 124', '123', 'tokenizer: numeral')
> check_tokenizer('-12.3 124', '-12.3', 'tokenizer: numeral')
> check_tokenizer('a123 124', 'a123', 'tokenizer: identifier')
> check_tokenizer('"abc def" 124', '"abc def"', 'tokenizer: string')
> check_tokenizer('', nil, 'tokenizer: eof')
>end
- __teliva_timestamp: original
parse_graph:
>-- https://graphviz.org/doc/info/lang.html
>function parse_graph(tokens, graph)
> local t = tokens:read()
> if t == 'strict' then
> t = tokens:read()
> end
> if t == 'graph' then
> error('undirected graphs not supported just yet')
> elseif t == 'digraph' then
> return parse_directed_graph(tokens, graph)
> else
> error('parse_graph: unexpected token '..t)
> end
>end
- __teliva_timestamp:
>Fri Mar 18 16:52:39 2022
skip_attr_list:
>function skip_attr_list(tokens)
> while true do
> local tok = tokens:read()
> if tok == nil then
> error('unterminated attr list; looked for "]" in vain')
> end
> if tok == ']' then break end
> end
>end
- __teliva_timestamp:
>Fri Mar 18 17:01:49 2022
parse_directed_graph:
>function parse_directed_graph(tokens, graph)
> tokens:read() -- skip name
> assert(tokens:read() == '{')
> while true do
> if tokens:peek() == nil then
> error('file not terminated with "}"')
> end
> if tokens:peek() == '}' then break end
> local tok1 = tokens:read()
> if tok1 == '[' then
> skip_attr_list(tokens)
> else
> local tok2 = tokens:read()
> if tok2 == '[' then
> -- node_stmt
> skip_attr_list(tokens)
> -- otherwise ignore node declarations;
> -- we'll assume the graph is fully connected
> -- and we can focus on just edges
> elseif tok2 == '->' then
> -- edge_stmt
> local tok3 = tokens:read()
> if graph[tok1] == nil then
> graph[tok1] = {}
> end
> graph[tok1][tok3] = true
> elseif tok2 == '--' then
> error('unexpected token "--" in digraph; edges should be directed using "->"')
> elseif tok2 == '=' then
> -- id '=' id
> -- skip
> tokens:read()
> else
> error('unexpected token '..tok2)
> end
> end
> end
> assert(tokens:read() == '}')
>end
- __teliva_timestamp:
>Fri Mar 18 17:21:16 2022
Focus:
>-- The focus is a set of nodes we're constantly running
>-- certain queries against.
>Focus = {}
- __teliva_timestamp:
>Fri Mar 18 17:21:40 2022
Graph:
>-- The set of edges parsed from the given .dot file.
>Graph = {}
- __teliva_timestamp:
>Fri Mar 18 17:29:25 2022
render_focus:
>function render_focus(window)
> window:attrset(curses.A_BOLD)
> window:mvaddstr(5, 1, 'focus: ')
> window:attrset(curses.A_NORMAL)
> for _, node in ipairs(Focus) do
> window:addstr(node)
> window:addstr(' ')
> end
>
> window:mvaddstr(8, 0, '')
> local lines, cols = window:getmaxyx()
> for col=1,cols do
> window:addstr('_')
> end
>end
- __teliva_timestamp:
>Fri Mar 18 17:30:11 2022
render_queries_on_focus:
>function render_queries_on_focus(window)
> window:attrset(curses.A_BOLD)
> window:mvaddstr(10, 1, '')
> -- TODO
>end
- __teliva_timestamp:
>Fri Mar 18 17:30:39 2022
render:
>function render(window)
> window:clear()
> render_basic_stats(window)
> render_focus(window)
> render_queries_on_focus(window)
> window:refresh()
>end
- __teliva_timestamp:
>Fri Mar 18 17:35:20 2022
sources:
>function sources(Graph)
> local is_target = {}
> for source, targets in pairs(Graph) do
> for target, _ in pairs(targets) do
> is_target[target] = true
> end
> end
> local result = {}
> for source, _ in pairs(Graph) do
> if not is_target[source] then
> table.insert(result, source)
> end
> end
> return result
>end
- __teliva_timestamp:
>Fri Mar 18 17:35:57 2022
render_basic_stats:
>function render_basic_stats(window)
> window:attrset(curses.A_BOLD)
> window:mvaddstr(1, 1, 'sources: ')
> window:attrset(curses.A_NORMAL)
> local sources = sources(Graph)
> for _, node in ipairs(sources) do
> window:addstr(node)
> window:addstr(' ')
> end
> window:mvaddstr(3, 0, '')
> local lines, cols = window:getmaxyx()
> for col=1,cols do
> window:addstr('_')
> end
>end
- __teliva_timestamp:
>Fri Mar 18 17:51:18 2022
main:
>function main()
> if #arg == 0 then
> Window:clear()
> print('restart this app with the name of a .dot file')
> Window:refresh()
> while true do Window:getch(); end
> end
> for _, filename in ipairs(arg) do
> read_dot_file(filename, Graph)
> end
>
> while true do
> render(Window)
> update(Window)
> end
>end
- __teliva_timestamp:
>Fri Mar 18 17:51:32 2022
read_dot_file:
>function read_dot_file(filename, graph)
> local infile = start_reading(nil, filename)
> if infile then
> local chars = graphviz_buffered_reader(infile)
> local tokens = graphviz_tokenizer(chars)
> parse_graph(tokens, graph)
> end
>end
- __teliva_timestamp:
>Fri Mar 18 18:59:24 2022
count:
>function count(h)
> local result = 0
> for k, v in pairs(h) do
> result = result+1
> end
> return result
>end
- __teliva_timestamp:
>Fri Mar 18 18:59:24 2022
num_nodes:
>function num_nodes(Graph)
> local nodes = {}
> for k, v in pairs(Graph) do
> nodes[k] = true
> for k, v in pairs(v) do
> nodes[k] = true
> end
> end
> local result = 0
> for k, v in pairs(nodes) do
> result = result+1
> end
> return result
>end
- __teliva_timestamp:
>Fri Mar 18 19:00:19 2022
render_basic_stats:
>function render_basic_stats(window)
> window:attrset(curses.A_BOLD)
> window:mvaddstr(1, 1, 'sources: ')
> window:attrset(curses.A_NORMAL)
> local sources = sources(Graph)
> for _, node in ipairs(sources) do
> window:addstr(node)
> window:addstr(' ')
> end
> window:attrset(curses.A_BOLD)
> window:addstr('size: ')
> window:attrset(curses.A_NORMAL)
> window:addstr(tostring(num_nodes(Graph)))
> window:addstr(' nodes')
> window:mvaddstr(3, 0, '')
> local lines, cols = window:getmaxyx()
> for col=1,cols do
> window:addstr('_')
> end
>end
- __teliva_timestamp:
>Fri Mar 18 19:01:49 2022
main:
>function main()
> if #arg == 0 then
> Window:clear()
> print('restart this app with the name of a .dot file')
> Window:refresh()
> while true do Window:getch(); end
> end
> for _, filename in ipairs(arg) do
> read_dot_file(filename, Graph)
> end
> Focus = sources(Graph)
>
> while true do
> render(Window)
> update(Window)
> end
>end
- __teliva_timestamp:
>Fri Mar 18 19:09:56 2022
reachable:
>function reachable(graph, node)
> local reached = {}
> local todo = {node}
> while #todo > 0 do
> local curr = table.remove(todo)
> if reached[curr] == nil then
> reached[curr] = true
> local targets = graph[curr]
> if targets then
> for target, _ in pairs(graph[curr]) do
> table.insert(todo, target)
> end
> end
> end
> end
> return reached
>end
- __teliva_timestamp:
>Fri Mar 18 20:27:16 2022
bold:
>function bold(window, text)
> window:attrset(curses.A_BOLD)
> window:addstr(text)
> window:attrset(curses.A_NORMAL)
>end
- __teliva_timestamp:
>Fri Mar 18 20:30:39 2022
render_queries_on_focus:
>function render_queries_on_focus(window)
> render_reachable_sets(window)
>end
- __teliva_timestamp:
>Fri Mar 18 20:30:39 2022
render_reachable_sets:
>function render_reachable_sets(window)
> local deps = {}
> local needed_by = {}
> for _, node in ipairs(Focus) do
> deps[node] = reachable(Graph, node)
> for dep, _ in pairs(deps[node]) do
> if needed_by[dep] == nil then
> needed_by[dep] = {}
> end
> append(needed_by[dep], {node})
> end
> end
> for k, v in ipairs(needed_by) do
> table.sort(v)
> end
> window:mvaddstr(10, 0, '')
> local sets = {Focus} -- queue
> local done = {}
> while #sets > 0 do
> local from_nodes = table.remove(sets, 1)
> if #from_nodes == 0 then break end
> table.sort(from_nodes)
> local key = table.concat(from_nodes)
> if done[key] == nil then
> done[key] = true
> local y, x = window:getyx()
> window:mvaddstr(y+2, 0, '')
> window:attrset(curses.A_BOLD)
> render_list(window, from_nodes)
> window:attrset(curses.A_NORMAL)
> window:addstr(' -> ')
> render_set(window, filter(needed_by, function(node, users) return set_eq(users, from_nodes) end))
> for i, elem in ipairs(from_nodes) do
> table.insert(sets, all_but(from_nodes, i))
> end
> end
> end
>end
- __teliva_timestamp:
>Fri Mar 18 20:32:18 2022
render_list:
>function render_list(window, l)
> window:addstr('{')
> for i, node in ipairs(l) do
> if i > 1 then window:addstr(' ') end
> window:addstr(node)
> end
> window:addstr('}')
>end
- __teliva_timestamp:
>Fri Mar 18 20:32:18 2022
render_set:
>function render_set(window, h)
> window:addstr('(')
> window:addstr(count(h))
> window:addstr(') ')
> for node, _ in pairs(h) do
> window:addstr(node)
> window:addstr(' ')
> end
>end
- __teliva_timestamp:
>Sat Mar 19 09:19:10 2022
main:
>function main()
> if #arg == 0 then
> Window:clear()
> print('restart this app with the name of a .dot file')
> Window:refresh()
> while true do Window:getch(); end
> end
> for _, filename in ipairs(arg) do
> read_dot_file(filename, Graph)
> end
> Focus = sources(Graph)
> Nodes = toposort(Graph)
>
> while true do
> render(Window)
> update(Window)
> end
>end
- __teliva_timestamp:
>Sat Mar 19 09:32:33 2022
nodes:
>function nodes(graph)
> local result = {}
> for n, deps in pairs(graph) do
> result[n] = true
> for n, _ in pairs(deps) do
> result[n] = true
> end
> end
> return result
>end
- __teliva_timestamp:
>Sat Mar 19 16:27:32 2022
toposort:
>-- stable sort of nodes in a graph
>-- nodes always occur before all their dependencies
>-- disconnected nodes are in alphabetical order
>function toposort(graph)
> -- non-map variables are arrays
> -- result = leaves in graph
> -- candidates = non-leaves
> local result = {}
> local resultMap = {}
> local candidatesMap = nodes(graph)
> local leavesMap = filter(candidatesMap, function(k, v) return graph[k] == nil end)
> local leaves = to_array(leavesMap)
> table.sort(leaves)
> union(resultMap, leavesMap)
> prepend(result, leaves)
> subtract(candidatesMap, leavesMap)
>
> function in_result(x, _) return resultMap[x] end
> function all_deps_in_result(k, _) return all(graph[k], in_result) end
> while true do
> local oldcount = count(candidatesMap)
> if oldcount == 0 then break end
> local inducteesMap = filter(candidatesMap, all_deps_in_result)
> local inductees = to_array(inducteesMap)
> table.sort(inductees)
> union(resultMap, inducteesMap)
> prepend(result, inductees)
> subtract(candidatesMap, inducteesMap)
> if oldcount == count(candidatesMap) then
> error('toposort: graph is not connected')
> end
> end
> return result
>end
- __teliva_timestamp:
>Sat Mar 19 16:32:24 2022
render_focus:
>function render_focus(window)
> local y, _ = window:getyx()
> window:mvaddstr(y+1, 0, '')
> bold(window, 'focus: ')
> for _, node in ipairs(Focus) do
> window:addstr(node)
> window:addstr(' ')
> end
> sep(window)
>end
- __teliva_timestamp:
>Sat Mar 19 16:33:19 2022
render_basic_stats:
>function render_basic_stats(window)
> bold(window, tostring(#Nodes)..' nodes: ')
> for i, node in ipairs(Nodes) do
> window:attrset(curses.A_REVERSE)
> window:addstr(i)
> window:attrset(curses.A_NORMAL)
> window:addstr(' ')
> window:addstr(node)
> window:addstr(' ')
> end
> sep(window)
>end
- __teliva_timestamp:
>Sat Mar 19 16:35:34 2022
render_reachable_sets:
>function render_reachable_sets(window)
> local deps = {}
> local needed_by = {}
> for _, node in ipairs(Focus) do
> deps[node] = reachable(Graph, node)
> for dep, _ in pairs(deps[node]) do
> if needed_by[dep] == nil then
> needed_by[dep] = {}
> end
> append(needed_by[dep], {node})
> end
> end
> for k, v in ipairs(needed_by) do
> table.sort(v)
> end
> local sets = {Focus} -- queue
> local done = {}
> while #sets > 0 do
> local from_nodes = table.remove(sets, 1)
> if #from_nodes == 0 then break end
> table.sort(from_nodes)
> local key = table.concat(from_nodes)
> if done[key] == nil then
> done[key] = true
> local y, x = window:getyx()
> window:mvaddstr(y+2, 0, '')
> window:attrset(curses.A_BOLD)
> render_list(window, from_nodes)
> window:attrset(curses.A_NORMAL)
> window:addstr(' -> ')
> render_set(window, filter(needed_by, function(node, users) return set_eq(users, from_nodes) end))
> for i, elem in ipairs(from_nodes) do
> table.insert(sets, all_but(from_nodes, i))
> end
> end
> end
>end
- __teliva_timestamp:
>Sat Mar 19 21:05:05 2022
toposort:
>-- stable sort of nodes in a graph
>-- nodes always occur before all their dependencies
>-- disconnected nodes are in alphabetical order
>function toposort(graph)
> -- non-map variables are arrays
> -- result = leaves in graph
> -- candidates = non-leaves
> local inResultMap = {}
> local candidatesMap = nodes(graph)
> local leavesMap = filter(candidatesMap, function(k, v) return graph[k] == nil end)
> local leaves = to_array(leavesMap)
> table.sort(leaves)
> union(inResultMap, leavesMap)
> local result = {leaves}
> subtract(candidatesMap, leavesMap)
>
> function in_result(x, _) return inResultMap[x] end
> function all_deps_in_result(k, _) return all(graph[k], in_result) end
> while true do
> local oldcount = count(candidatesMap)
> if oldcount == 0 then break end
> local inducteesMap = filter(candidatesMap, all_deps_in_result)
> local inductees = to_array(inducteesMap)
> table.sort(inductees)
> union(inResultMap, inducteesMap)
> table.insert(result, 1, inductees)
> subtract(candidatesMap, inducteesMap)
> if oldcount == count(candidatesMap) then
> error('toposort: graph is not connected')
> end
> end
> return result
>end
- __teliva_timestamp:
>Sat Mar 19 21:05:57 2022
render_basic_stats:
>function render_basic_stats(window)
> bold(window, tostring(#Nodes)..' nodes:')
> local i = 1
> for _, stratum in ipairs(Nodes) do
> window:addstr('\n ')
> for _, node in ipairs(stratum) do
> window:attrset(curses.A_REVERSE)
> window:addstr(i)
> window:attrset(curses.A_NORMAL)
> window:addstr(' ')
> window:addstr(node)
> window:addstr(' ')
> i = i+1
> end
> end
> sep(window)
>end
================================================
FILE: hanoi.tlv
================================================
# .tlv file generated by https://github.com/akkartik/teliva
# You may edit it if you are careful; however, you may see cryptic errors if you
# violate Teliva's assumptions.
#
# .tlv files are representations of Teliva programs. Teliva programs consist of
# sequences of definitions. Each definition is a table of key/value pairs. Keys
# and values are both strings.
#
# Lines in .tlv files always follow exactly one of the following forms:
# - comment lines at the top of the file starting with '#' at column 0
# - beginnings of definitions starting with '- ' at column 0, followed by a
# key/value pair
# - key/value pairs consisting of ' ' at column 0, containing either a
# spaceless value on the same line, or a multi-line value
# - multiline values indented by more than 2 spaces, starting with a '>'
#
# If these constraints are violated, Teliva may unceremoniously crash. Please
# report bugs at http://akkartik.name/contact
- __teliva_timestamp: original
check:
>function check(x, msg)
> if x then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' '..str(x)..' is false/nil')
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
check_eq:
>function check_eq(x, expected, msg)
> if eq(x, expected) then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' expected '..str(expected)..' but got '..str(x))
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
eq:
>function eq(a, b)
> if type(a) ~= type(b) then return false end
> if type(a) == 'table' then
> if #a ~= #b then return false end
> for k, v in pairs(a) do
> if b[k] ~= v then
> return false
> end
> end
> for k, v in pairs(b) do
> if a[k] ~= v then
> return false
> end
> end
> return true
> end
> return a == b
>end
- __teliva_timestamp: original
str:
>-- smarter tostring
>-- slow; used only for debugging
>function str(x)
> if type(x) == 'table' then
> local result = ''
> result = result..#x..'{'
> for k, v in pairs(x) do
> result = result..str(k)..'='..str(v)..', '
> end
> result = result..'}'
> return result
> elseif type(x) == 'string' then
> return '"'..x..'"'
> end
> return tostring(x)
>end
- __teliva_timestamp: original
render:
>function render(window)
> window:clear()
> local lines, cols = window:getmaxyx()
> local line = math.floor(lines/2)
> local col = math.floor(cols/4)
> for i,t in ipairs(tower) do
> render_tower(window, line, i*col, i, t)
> end
> window:refresh()
>end
- __teliva_timestamp: original
lines:
>function lines(window)
> local lines, cols = window:getmaxyx()
> return lines
>end
- __teliva_timestamp: original
pop:
>function pop(array)
> return table.remove(array)
>end
- __teliva_timestamp: original
Window:
>Window = curses.stdscr()
- __teliva_timestamp: original
render_tower:
>function render_tower(window, line, col, tower_index, tower)
> window:attron(curses.A_BOLD)
> window:mvaddch(line+2, col, string.char(96+tower_index))
> window:attroff(curses.A_BOLD)
> window:attron(curses.color_pair(15))
> window:mvaddstr(line+1, col-6, " ")
> window:attroff(curses.color_pair(15))
> for i, n in ipairs(tower) do
> render_disk(window, line, col, n)
> line = line - 1
> end
> for i=1,5-len(tower)+1 do
> window:attron(curses.color_pair(15))
> window:mvaddstr(line, col, " ")
> window:attroff(curses.color_pair(15))
> line = line - 1
> end
>end
- __teliva_timestamp: original
tower:
>tower = {{6, 5, 4, 3, 2}, {}, {}}
- __teliva_timestamp: original
render_disk:
>function render_disk(window, line, col, size)
> col = col-size+1
> for i=1,size do
> window:attron(curses.color_pair(size))
> window:mvaddstr(line, col, " ")
> window:attroff(curses.color_pair(size))
> col = col+2
> end
>end
- __teliva_timestamp: original
main:
>function main()
> curses.assume_default_colors(238, 139)
> for i=1,7 do
> curses.init_pair(i, 0, i)
> end
> curses.init_pair(15, 0, 250) -- tower frames
>
> while true do
> render(Window)
> update(Window)
> end
>end
- __teliva_timestamp: original
len:
>function len(array)
> local result = 0
> for k in pairs(array) do
> result = result+1
> end
> return result
>end
- __teliva_timestamp: original
update:
>function update(window)
> window:mvaddstr(lines(window)-2, 5, "tower to remove top disk from? ")
> local from = window:getch() - 96
> window:mvaddstr(lines(window)-1, 5, "tower to stack it on? ")
> local to = window:getch() - 96
> make_move(from, to)
>end
- __teliva_timestamp: original
make_move:
>function make_move(from, to)
> local disk = pop(tower[from])
> table.insert(tower[to], disk)
>end
- __teliva_timestamp: original
cols:
>function cols(window)
> local lines, cols = window:getmaxyx()
> return cols
>end
- __teliva_timestamp:
>Thu Feb 17 20:07:06 2022
doc:blurb:
>Single-player game: the Towers of Hanoi
>
>Move disks around from one tower A to tower B, under one constraint: a disk can never lie above a smaller disk.
>
>https://en.wikipedia.org/wiki/Tower_of_Hanoi
================================================
FILE: life.tlv
================================================
# .tlv file generated by https://github.com/akkartik/teliva
# You may edit it if you are careful; however, you may see cryptic errors if you
# violate Teliva's assumptions.
#
# .tlv files are representations of Teliva programs. Teliva programs consist of
# sequences of definitions. Each definition is a table of key/value pairs. Keys
# and values are both strings.
#
# Lines in .tlv files always follow exactly one of the following forms:
# - comment lines at the top of the file starting with '#' at column 0
# - beginnings of definitions starting with '- ' at column 0, followed by a
# key/value pair
# - key/value pairs consisting of ' ' at column 0, containing either a
# spaceless value on the same line, or a multi-line value
# - multiline values indented by more than 2 spaces, starting with a '>'
#
# If these constraints are violated, Teliva may unceremoniously crash. Please
# report bugs at http://akkartik.name/contact
- __teliva_timestamp: original
str_helpers:
>-- some string helpers from http://lua-users.org/wiki/StringIndexing
>
>-- index characters using []
>getmetatable('').__index = function(str,i)
> if type(i) == 'number' then
> return str:sub(i,i)
> else
> return string[i]
> end
>end
>
>-- ranges using (), selected bytes using {}
>getmetatable('').__call = function(str,i,j)
> if type(i)~='table' then
> return str:sub(i,j)
> else
> local t={}
> for k,v in ipairs(i) do
> t[k]=str:sub(v,v)
> end
> return table.concat(t)
> end
>end
>
>-- iterate over an ordered sequence
>function q(x)
> if type(x) == 'string' then
> return x:gmatch('.')
> else
> return ipairs(x)
> end
>end
>
>-- insert within string
>function string.insert(str1, str2, pos)
> return str1:sub(1,pos)..str2..str1:sub(pos+1)
>end
>
>function string.remove(s, pos)
> return s:sub(1,pos-1)..s:sub(pos+1)
>end
>
>function string.pos(s, sub)
> return string.find(s, sub, 1, true) -- plain=true to disable regular expressions
>end
>
>-- TODO: backport utf-8 support from Lua 5.3
- __teliva_timestamp: original
debugy:
>debugy = 5
- __teliva_timestamp: original
dbg:
>-- helper for debug by print; overlay debug information towards the right
>-- reset debugy every time you refresh screen
>function dbg(window, s)
> local oldy = 0
> local oldx = 0
> oldy, oldx = window:getyx()
> window:mvaddstr(debugy, 60, s)
> debugy = debugy+1
> window:mvaddstr(oldy, oldx, '')
>end
- __teliva_timestamp: original
check:
>function check(x, msg)
> if x then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' '..str(x)..' is false/nil')
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
check_eq:
>function check_eq(x, expected, msg)
> if eq(x, expected) then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' expected '..str(expected)..' but got '..str(x))
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
eq:
>function eq(a, b)
> if type(a) ~= type(b) then return false end
> if type(a) == 'table' then
> if #a ~= #b then return false end
> for k, v in pairs(a) do
> if b[k] ~= v then
> return false
> end
> end
> for k, v in pairs(b) do
> if a[k] ~= v then
> return false
> end
> end
> return true
> end
> return a == b
>end
- __teliva_timestamp: original
str:
>-- smarter tostring
>-- slow; used only for debugging
>function str(x)
> if type(x) == 'table' then
> local result = ''
> result = result..#x..'{'
> for k, v in pairs(x) do
> result = result..str(k)..'='..str(v)..', '
> end
> result = result..'}'
> return result
> elseif type(x) == 'string' then
> return '"'..x..'"'
> end
> return tostring(x)
>end
- __teliva_timestamp: original
menu:
>-- To show app-specific hotkeys in the menu bar, add hotkey/command
>-- arrays of strings to the menu array.
>menu = {}
- __teliva_timestamp: original
window:
>-- constructor for fake screen and window
>-- call it like this:
>-- local w = window{
>-- kbd=kbd('abc'),
>-- scr=scr{h=5, w=4},
>-- }
>-- eventually it'll do everything a real ncurses window can
>function window(h)
> h.__index = h
> setmetatable(h, h)
> h.__index = function(table, key)
> return rawget(h, key)
> end
> h.attrset = function(self, x)
> self.scr.attrs = x
> end
> h.attron = function(self, x)
> -- currently same as attrset since Lua 5.1 doesn't have bitwise operators
> -- doesn't support multiple attrs at once
>-- local old = self.scr.attrs
>-- self.scr.attrs = old|x
> self.scr.attrs = x
> end
> h.attroff = function(self, x)
> -- currently borked since Lua 5.1 doesn't have bitwise operators
> -- doesn't support multiple attrs at once
>-- local old = self.scr.attrs
>-- self.scr.attrs = old & (~x)
> self.scr.attrs = curses.A_NORMAL
> end
> h.getch = function(self)
> local c = table.remove(h.kbd, 1)
> if c == nil then return c end
> return string.byte(c) -- for verisimilitude with ncurses
> end
> h.addch = function(self, c)
> local scr = self.scr
> if c == '\n' then
> scr.cursy = scr.cursy+1
> scr.cursx = 0
> return
> end
> if scr.cursy <= scr.h then
> scr[scr.cursy][scr.cursx] = {data=c, attrs=scr.attrs}
> scr.cursx = scr.cursx+1
> if scr.cursx > scr.w then
> scr.cursy = scr.cursy+1
> scr.cursx = 1
> end
> end
> end
> h.addstr = function(self, s)
> for i=1,s:len() do
> self:addch(s[i])
> end
> end
> h.mvaddch = function(self, y, x, c)
> self.scr.cursy = y
> self.scr.cursx = x
> self:addch(c)
> end
> h.mvaddstr = function(self, y, x, s)
> self.scr.cursy = y
> self.scr.cursx = x
> self:addstr(s)
> end
> h.clear = function(self)
> clear_scr(self.scr)
> end
> h.refresh = function(self)
> -- nothing
> end
> return h
>end
- __teliva_timestamp: original
kbd:
>function kbd(keys)
> local result = {}
> for i=1,keys:len() do
> table.insert(result, keys[i])
> end
> return result
>end
- __teliva_timestamp: original
scr:
>function scr(props)
> props.cursx = 1
> props.cursy = 1
> clear_scr(props)
> return props
>end
- __teliva_timestamp: original
clear_scr:
>function clear_scr(props)
> props.cursy = 1
> props.cursx = 1
> for y=1,props.h do
> props[y] = {}
> for x=1,props.w do
> props[y][x] = {data=' ', attrs=curses.A_NORMAL}
> end
> end
> return props
>end
- __teliva_timestamp: original
check_screen:
>function check_screen(window, contents, message)
> local x, y = 1, 1
> for i=1,contents:len() do
> check_eq(window.scr[y][x].data, contents[i], message..'/'..y..','..x)
> x = x+1
> if x > window.scr.w then
> y = y+1
> x = 1
> end
> end
>end
>
>-- putting it all together, an example test of both keyboard and screen
>function test_check_screen()
> local lines = {
> c='123',
> d='234',
> a='345',
> b='456',
> }
> local w = window{
> kbd=kbd('abc'),
> scr=scr{h=3, w=5},
> }
> local y = 1
> while true do
> local b = w:getch()
> if b == nil then break end
> w:mvaddstr(y, 1, lines[string.char(b)])
> y = y+1
> end
> check_screen(w, '345 '..
> '456 '..
> '123 ',
> 'test_check_screen')
>end
- __teliva_timestamp: original
grid:
>-- main data structure
>grid = {}
>for i=1,lines*4 do
> grid[i] = {}
> for j=1,cols*2 do
> grid[i][j] = 0
> end
>end
- __teliva_timestamp: original
Window:
>Window = curses.stdscr()
>-- animation-based app
>Window:nodelay(true)
>curses.curs_set(0)
>lines, cols = Window:getmaxyx()
- __teliva_timestamp: original
grid_char:
>-- grab a 4x2 chunk of grid
>function grid_char(line, col)
> result = {}
> for l, row in ipairs({unpack(grid, (line-1)*4+1, line*4)}) do
> result[l] = {unpack(row, (col-1)*2+1, col*2)}
> end
> return result
>end
- __teliva_timestamp: original
print_grid_char:
>function print_grid_char(window, x)
> result = {}
> for l, row in ipairs(x) do
> for c, val in ipairs(row) do
> window:mvaddstr(l, c, val)
> end
> end
> return result
>end
- __teliva_timestamp: original
glyph:
>-- look up the braille pattern corresponding to a 4x2 chunk of grid
>-- https://en.wikipedia.org/wiki/Braille_Patterns
>-- not obviously programmatic because Unicode added 4x2 after 3x2
>glyph = {
> 0x2800, 0x2801, 0x2802, 0x2803, 0x2804, 0x2805, 0x2806, 0x2807, 0x2840, 0x2841, 0x2842, 0x2843, 0x2844, 0x2845, 0x2846, 0x2847,
> 0x2808, 0x2809, 0x280a, 0x280b, 0x280c, 0x280d, 0x280e, 0x280f, 0x2848, 0x2849, 0x284a, 0x284b, 0x284c, 0x284d, 0x284e, 0x284f,
> 0x2810, 0x2811, 0x2812, 0x2813, 0x2814, 0x2815, 0x2816, 0x2817, 0x2850, 0x2851, 0x2852, 0x2853, 0x2854, 0x2855, 0x2856, 0x2857,
> 0x2818, 0x2819, 0x281a, 0x281b, 0x281c, 0x281d, 0x281e, 0x281f, 0x2858, 0x2859, 0x285a, 0x285b, 0x285c, 0x285d, 0x285e, 0x285f,
> 0x2820, 0x2821, 0x2822, 0x2823, 0x2824, 0x2825, 0x2826, 0x2827, 0x2860, 0x2861, 0x2862, 0x2863, 0x2864, 0x2865, 0x2866, 0x2867,
> 0x2828, 0x2829, 0x282a, 0x282b, 0x282c, 0x282d, 0x282e, 0x282f, 0x2868, 0x2869, 0x286a, 0x286b, 0x286c, 0x286d, 0x286e, 0x286f,
> 0x2830, 0x2831, 0x2832, 0x2833, 0x2834, 0x2835, 0x2836, 0x2837, 0x2870, 0x2871, 0x2872, 0x2873, 0x2874, 0x2875, 0x2876, 0x2877,
> 0x2838, 0x2839, 0x283a, 0x283b, 0x283c, 0x283d, 0x283e, 0x283f, 0x2878, 0x2879, 0x287a, 0x287b, 0x287c, 0x287d, 0x287e, 0x287f,
>
> 0x2880, 0x2881, 0x2882, 0x2883, 0x2884, 0x2885, 0x2886, 0x2887, 0x28c0, 0x28c1, 0x28c2, 0x28c3, 0x28c4, 0x28c5, 0x28c6, 0x28c7,
> 0x2888, 0x2889, 0x288a, 0x288b, 0x288c, 0x288d, 0x288e, 0x288f, 0x28c8, 0x28c9, 0x28ca, 0x28cb, 0x28cc, 0x28cd, 0x28ce, 0x28cf,
> 0x2890, 0x2891, 0x2892, 0x2893, 0x2894, 0x2895, 0x2896, 0x2897, 0x28d0, 0x28d1, 0x28d2, 0x28d3, 0x28d4, 0x28d5, 0x28d6, 0x28d7,
> 0x2898, 0x2899, 0x289a, 0x289b, 0x289c, 0x289d, 0x289e, 0x289f, 0x28d8, 0x28d9, 0x28da, 0x28db, 0x28dc, 0x28dd, 0x28de, 0x28df,
> 0x28a0, 0x28a1, 0x28a2, 0x28a3, 0x28a4, 0x28a5, 0x28a6, 0x28a7, 0x28e0, 0x28e1, 0x28e2, 0x28e3, 0x28e4, 0x28e5, 0x28e6, 0x28e7,
> 0x28a8, 0x28a9, 0x28aa, 0x28ab, 0x28ac, 0x28ad, 0x28ae, 0x28af, 0x28e8, 0x28e9, 0x28ea, 0x28eb, 0x28ec, 0x28ed, 0x28ee, 0x28ef,
> 0x28b0, 0x28b1, 0x28b2, 0x28b3, 0x28b4, 0x28b5, 0x28b6, 0x28b7, 0x28f0, 0x28f1, 0x28f2, 0x28f3, 0x28f4, 0x28f5, 0x28f6, 0x28f7,
> 0x28b8, 0x28b9, 0x28ba, 0x28bb, 0x28bc, 0x28bd, 0x28be, 0x28bf, 0x28f8, 0x28f9, 0x28fa, 0x28fb, 0x28fc, 0x28fd, 0x28fe, 0x28ff,
>}
- __teliva_timestamp: original
utf8:
>-- https://stackoverflow.com/questions/7983574/how-to-write-a-unicode-symbol-in-lua
>function utf8(decimal)
> local bytemarkers = { {0x7FF,192}, {0xFFFF,224}, {0x1FFFFF,240} }
> if decimal<128 then return string.char(decimal) end
> local charbytes = {}
> for bytes,vals in ipairs(bytemarkers) do
> if decimal<=vals[1] then
> for b=bytes+1,2,-1 do
> local mod = decimal%64
> decimal = (decimal-mod)/64
> charbytes[b] = string.char(128+mod)
> end
> charbytes[1] = string.char(vals[2]+decimal)
> break
> end
> end
> return table.concat(charbytes)
>end
- __teliva_timestamp: original
grid_char_to_glyph_index:
>-- convert a chunk of grid into a number
>function grid_char_to_glyph_index(g)
> return g[1][1] + g[2][1]*2 + g[3][1]*4 + g[4][1]*8 +
> g[1][2]*16 + g[2][2]*32 + g[3][2]*64 + g[4][2]*128 +
> 1 -- 1-indexing
>end
- __teliva_timestamp: original
render:
>function render(window)
> window:clear()
> window:attron(curses.color_pair(1))
> for line=1,lines do
> for col=1,cols do
> window:addstr(utf8(glyph[grid_char_to_glyph_index(grid_char(line, col))]))
> end
> end
> window:attroff(curses.color_pair(1))
> window:refresh()
>end
- __teliva_timestamp: original
state:
>function state(line, col)
> if line < 1 or line > #grid or col < 1 or col > #grid[1] then
> return 0
> end
> return grid[line][col]
>end
- __teliva_timestamp: original
num_live_neighbors:
>function num_live_neighbors(line, col)
> return state(line-1, col-1) + state(line-1, col) + state(line-1, col+1) +
> state(line, col-1) + state(line, col+1) +
> state(line+1, col-1) + state(line+1, col) + state(line+1, col+1)
>end
- __teliva_timestamp: original
step:
>function step()
> local new_grid = {}
> for line=1,#grid do
> new_grid[line] = {}
> for col=1,#grid[1] do
> local n = num_live_neighbors(line, col)
> if n == 3 then
> new_grid[line][col] = 1
> elseif n == 2 then
> new_grid[line][col] = grid[line][col]
> else
> new_grid[line][col] = 0
> end
> end
> end
> grid = new_grid
>end
- __teliva_timestamp: original
sleep:
>function sleep(a)
> local sec = tonumber(os.clock() + a);
> while (os.clock() < sec) do
> end
>end
- __teliva_timestamp: original
load_file:
>function load_file(window, fs, filename)
> local infile = start_reading(fs, filename)
> if infile == nil then return end
> local line_index = lines -- quarter of the way down in pixels
> while true do
> local line = infile.read()
> if line == nil then break end
> if line:sub(1,1) ~= '!' then -- comment; plaintext files can't have whitespace before comments
> local col_index = cols
> for c in line:gmatch(".") do
> if c == '\r' then break end -- DOS line ending
> if c == '.' then
> grid[line_index][col_index] = 0
> else
> grid[line_index][col_index] = 1
> end
> col_index = col_index+1
> end
> line_index = line_index+1
> end
> end
>end
- __teliva_timestamp: original
update:
>menu = {{"arrow", "pan"}}
>
>function update(window, c)
> if c == curses.KEY_LEFT then
> for i=1,lines*4 do
> for j=2,cols*2 do
> grid[i][j-1] = grid[i][j]
> end
> grid[i][cols*2] = 0
> end
> elseif c == curses.KEY_DOWN then
> for i=lines*4-1,1,-1 do
> for j=1,cols*2 do
> grid[i+1][j] = grid[i][j]
> end
> end
> for j=1,cols*2 do
> grid[1][j] = 0
> end
> elseif c == curses.KEY_UP then
> for i=2,lines*4 do
> for j=1,cols*2 do
> grid[i-1][j] = grid[i][j]
> end
> end
> for j=1,cols*2 do
> grid[lines*4][j] = 0
> end
> elseif c == curses.KEY_RIGHT then
> for i=1,lines*4 do
> for j=cols*2-1,1,-1 do
> grid[i][j+1] = grid[i][j]
> end
> grid[i][1] = 0
> end
> end
>end
- __teliva_timestamp: original
main:
>function main()
> curses.init_pair(1, 22, 189)
>
> -- initialize grid based on commandline args
> if (#arg == 0) then
> -- by default, start from a deterministically random state
> for i=1,lines*4 do
> for j=1,cols*2 do
> grid[i][j] = math.random(0, 1)
> end
> end
> elseif arg[1] == "random" then
> -- start from a non-deterministically random start state
> math.randomseed(os.time())
> for i=1,lines*4 do
> for j=1,cols*2 do
> grid[i][j] = math.random(0, 1)
> end
> end
> -- shortcuts for some common patterns
> elseif arg[1] == "pentomino" then
> -- https://www.conwaylife.com/wiki/Pentomino
> grid[83][172] = 1
> grid[83][173] = 1
> grid[84][173] = 1
> grid[84][174] = 1
> grid[85][173] = 1
> elseif arg[1] == "glider" then
> -- https://www.conwaylife.com/wiki/Glider
> grid[5][4] = 1
> grid[6][5] = 1
> grid[7][3] = 1
> grid[7][4] = 1
> grid[7][5] = 1
> elseif arg[1] == "blinker" then
> -- https://www.conwaylife.com/wiki/Blinker
> grid[7][3] = 1
> grid[7][4] = 1
> grid[7][5] = 1
> elseif arg[1] == "block" then
> -- https://www.conwaylife.com/wiki/Block
> grid[5][4] = 1
> grid[5][5] = 1
> grid[6][4] = 1
> grid[6][5] = 1
> elseif arg[1] == "loaf" then
> -- https://www.conwaylife.com/wiki/Loaf
> grid[5][4] = 1
> grid[5][5] = 1
> grid[6][6] = 1
> grid[7][6] = 1
> grid[8][5] = 1
> grid[7][4] = 1
> grid[6][3] = 1
> else
> -- Load a file in the standard "plaintext" format: https://www.conwaylife.com/wiki/Plaintext
> --
> -- Each pattern page at https://www.conwaylife.com/wiki provides its
> -- plaintext representation in a block called "Pattern Files" on the right.
> --
> -- For example, check out the list of Important Patterns at
> -- https://www.conwaylife.com/wiki/Category:Patterns_with_Catagolue_frequency_class_0
> load_file(Window, nil, arg[1])
> end
>
> -- main loop
> while true do
> render(Window)
> c = Window:getch()
> update(Window, c)
> step()
> end
>end
- __teliva_timestamp:
>Thu Feb 17 19:58:19 2022
doc:blurb:
>Conway's Game of Life
>
>To get around limitations of text mode we use the braille character set to render 8 cells per character.
>
>By default it initializes the space with a random state of cells. You can also start it up with .cells files from https://conwaylife.com/wiki, or with a few special names:
> $ src/teliva life.tlv block
> $ src/teliva life.tlv loaf
> $ src/teliva life.tlv blinker
> $ src/teliva life.tlv glider
> $ src/teliva life.tlv pentomino
================================================
FILE: lisp.lua
================================================
-- atom types:
-- nil
-- true
-- {num=3.4}
-- {char='a'}
-- {str='bc'}
-- {sym='foo'}
-- non-atom type:
-- {car={num=3.4}, cdr=nil}
--
-- should {} mean anything special? currently just '(nil)
function atom(x)
return x == nil or x.num or x.char or x.str or x.sym
end
function car(x) return x.car end
function cdr(x) return x.cdr end
function cons(x, y) return {car=x, cdr=y} end
function iso(x, y)
if x == nil then return y == nil end
local done={}
if done[x] then return done[x] == y end
done[x] = y
if atom(x) then
if not atom(y) then return nil end
for k, v in pairs(x) do
if y[k] ~= v then return nil end
end
return true
end
for k, v in pairs(x) do
if not iso(y[k], v) then return nil end
end
for k, v in pairs(y) do
if not iso(x[k], v) then return nil end
end
return true
end
-- primitives; feel free to add more
-- format: lisp name = lua function that implements it
unary_functions = {
atom=atom,
car=car,
cdr=cdr,
}
binary_functions = {
cons=cons,
iso=iso,
}
function lookup(env, s)
if env[s] then return env[s] end
if env.next then return lookup(env.next, s) end
end
function eval(x, env)
function symeq(x, s)
return x and x.sym == s
end
if x.sym then
return lookup(env, x.sym)
elseif atom(x) then
return x
-- otherwise x is a pair
elseif symeq(x.car, 'quote') then
return x.cdr
elseif unary_functions[x.car.sym] then
return eval_unary(x, env)
elseif binary_functions[x.car.sym] then
return eval_binary(x, env)
-- special forms that don't always eval all their args
elseif symeq(x.car, 'if') then
return eval_if(x, env)
elseif symeq(x.car.car, 'fn') then
return eval_fn(x, env)
elseif symeq(x.car.car, 'label') then
return eval_label(x, env)
end
end
function eval_unary(x, env)
return unary_functions[x.car.sym](eval(x.cdr.car, env))
end
function eval_binary(x, env)
return binary_functions[x.car.sym](eval(x.cdr.car, env),
eval(x.cdr.cdr.car, env))
end
function eval_if(x, env)
-- syntax: (if check b1 b2)
local check = x.cdr.car
local b1 = x.cdr.cdr.car
local b2 = x.cdr.cdr.cdr.car
if eval(check, env) then
return eval(b1, env)
else
return eval(b2, env)
end
end
function eval_fn(x, env)
-- syntax: ((fn params body*) args*)
local callee = x.car
local args = x.cdr
local params = callee.cdr.car
local body = callee.cdr.cdr
return eval_exprs(body,
bind_env(params, args, env))
end
function bind_env(params, args, env)
if params == nil then return env end
local result = {next=env}
while true do
result[params.car.sym] = eval(args.car, env)
params = params.cdr
args = args.cdr
if params == nil then break end
end
return result
end
function eval_exprs(xs, env)
local result = nil
while xs do
result = eval(xs.car, env)
xs = xs.cdr
end
return result
end
function eval_label(x, env)
-- syntax: ((label f (fn params body*)) args*)
local callee = x.car
local args = x.cdr
local f = callee.cdr.car
local fn = callee.cdr.cdr.car
return eval({car=fn, cdr=args},
bind_env({f}, {callee}, env))
end
-- testing
function num(n) return {num=n} end
function char(c) return {char=c} end
function str(s) return {str=s} end
function sym(s) return {sym=s} end
function list(...)
-- gotcha: no element in arg can be nil; that short-circuits the ipairs below
local result = nil
local curr = nil
for _, x in ipairs({...}) do
if curr == nil then
result = {car=x}
curr = result
else
curr.cdr = {car=x}
curr = curr.cdr
end
end
return result
end
function p(x)
p2(x)
print()
end
function p2(x)
if x == nil then
io.write('nil')
elseif x == true then
io.write('true')
elseif x.num then
io.write(x.num)
elseif x.char then
io.write("\\"..x.char)
elseif x.str then
io.write('"'..x.str..'"')
elseif x.sym then
io.write(x.sym)
elseif x.cdr == nil then
io.write('(')
p2(x.car)
io.write(')')
elseif atom(x.cdr) then
io.write('(')
p2(x.car)
io.write(' . ')
p2(x.cdr)
io.write(')')
else
io.write('(')
while true do
p2(x.car)
x = x.cdr
if x == nil then break end
if atom(x) then
io.write(' . ')
p2(x)
break
end
io.write(' ')
end
io.write(')')
end
end
x = {num=3.4}
p(x)
p(cons(x, nil))
p(list(x))
p(iso(cons(x, nil), cons(x, nil)))
p(iso(list(x), list(x)))
p(iso(list(x, x), list(x)))
p(iso(list(x, x), list(x, x)))
p(iso(x, cons(x, nil)))
p (list(sym("cons"), num(42), num(1)))
p(eval(list(sym("cons"), num(42), num(1)), {}))
-- ((fn () 42)) => 42
-- can't use list here because of the gotcha above
assert(iso(eval(cons(cons(sym('fn'), cons(nil, cons(num(42))))), {}), num(42)))
-- ((fn (a) (cons a 1)) 42) => '(42 . 1)
assert(iso(eval(cons(cons(sym('fn'), cons(cons(sym('a')), cons(cons(sym('cons'), cons(sym('a'), cons(num(1))))))), cons(num(42)))), cons(num(42), num(1))))
================================================
FILE: lisp.tlv
================================================
# .tlv file generated by https://github.com/akkartik/teliva
# You may edit it if you are careful; however, you may see cryptic errors if you
# violate Teliva's assumptions.
#
# .tlv files are representations of Teliva programs. Teliva programs consist of
# sequences of definitions. Each definition is a table of key/value pairs. Keys
# and values are both strings.
#
# Lines in .tlv files always follow exactly one of the following forms:
# - comment lines at the top of the file starting with '#' at column 0
# - beginnings of definitions starting with '- ' at column 0, followed by a
# key/value pair
# - key/value pairs consisting of ' ' at column 0, containing either a
# spaceless value on the same line, or a multi-line value
# - multiline values indented by more than 2 spaces, starting with a '>'
#
# If these constraints are violated, Teliva may unceremoniously crash. Please
# report bugs at http://akkartik.name/contact
- __teliva_timestamp: original
str_helpers:
>-- some string helpers from http://lua-users.org/wiki/StringIndexing
>
>-- index characters using []
>getmetatable('').__index = function(str,i)
> if type(i) == 'number' then
> return str:sub(i,i)
> else
> return string[i]
> end
>end
>
>-- ranges using (), selected bytes using {}
>getmetatable('').__call = function(str,i,j)
> if type(i)~='table' then
> return str:sub(i,j)
> else
> local t={}
> for k,v in ipairs(i) do
> t[k]=str:sub(v,v)
> end
> return table.concat(t)
> end
>end
>
>-- iterate over an ordered sequence
>function q(x)
> if type(x) == 'string' then
> return x:gmatch('.')
> else
> return ipairs(x)
> end
>end
>
>-- insert within string
>function string.insert(str1, str2, pos)
> return str1:sub(1,pos)..str2..str1:sub(pos+1)
>end
>
>function string.remove(s, pos)
> return s:sub(1,pos-1)..s:sub(pos+1)
>end
>
>function string.pos(s, sub)
> return string.find(s, sub, 1, true) -- plain=true to disable regular expressions
>end
>
>-- TODO: backport utf-8 support from Lua 5.3
- __teliva_timestamp: original
check:
>function check(x, msg)
> if x then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' '..str(x)..' is false/nil')
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
check_eq:
>function check_eq(x, expected, msg)
> if eq(x, expected) then
> Window:addch('.')
> else
> print('F - '..msg)
> print(' expected '..str(expected)..' but got '..str(x))
> teliva_num_test_failures = teliva_num_test_failures + 1
> -- overlay first test failure on editors
> if teliva_first_failure == nil then
> teliva_first_failure = msg
> end
> end
>end
- __teliva_timestamp: original
eq:
>function eq(a, b)
> if type(a) ~= type(b) then return false end
> if type(a) == 'table' then
> if #a ~= #b then return false end
> for k, v in pairs(a) do
> if b[k] ~= v then
> return false
> end
> end
> for k, v in pairs(b) do
> if a[k] ~= v then
> return false
> end
> end
> return true
> end
> return a == b
>end
- __teliva_timestamp: original
str:
>-- smarter tostring
>-- slow; used only for debugging
>function str(x)
> if type(x) == 'table' then
> local result = ''
> result = result..#x..'{'
> for k, v in pairs(x) do
> result = result..str(k)..'='..str(v)..', '
> end
> result = result..'}'
> return result
> elseif type(x) == 'string' then
> return '"'..x..'"'
> end
> return tostring(x)
>end
- __teliva_timestamp: original
menu:
>-- To show app-specific hotkeys in the menu bar, add hotkey/command
>-- arrays of strings to the menu array.
>menu = {}
- __teliva_timestamp: original
Window:
>Window = curses.stdscr()
- __teliva_timestamp: original
render:
>function render(window)
> window:clear()
> -- draw stuff to screen here
> window:attron(curses.A_BOLD)
> window:mvaddstr(1, 5, "example app")
> window:attrset(curses.A_NORMAL)
> for i=0,15 do
> window:attrset(curses.color_pair(i))
> window:mvaddstr(3+i, 5, "========================")
> end
> window:refresh()
>end
- __teliva_timestamp: original
menu:
>-- To show app-specific hotkeys in the menu bar, add hotkey/command
>-- arrays of strings to the menu array.
>menu = {}
- __teliva_timestamp: original
update:
>function update(window)
> local key = window:getch()
> -- process key here
>end
- __teliva_timestamp: original
init_colors:
>function init_colors()
> for i=0,7 do
> curses.init_pair(i, i, -1)
> end
> curses.init_pair(8, 7, 0)
> curses.init_pair(9, 7, 1)
> curses.init_pair(10, 7, 2)
> curses.init_pair(11, 7, 3)
> curses.init_pair(12, 7, 4)
> curses.init_pair(13, 7, 5)
> curses.init_pair(14, 7, 6)
> curses.init_pair(15, -1, 15)
>end
- __teliva_timestamp: original
main:
>function main()
> init_colors()
>
> while true do
> render(Window)
> update(Window)
> end
>end
- __teliva_timestamp: original
eval:
>function eval(x, env)
> function symeq(x, s)
> return x and x.sym == s
> end
> if x.sym then
> return lookup(env, x.sym)
> elseif atom(x) then
> return x
> -- otherwise x is a pair
> elseif symeq(x.car, 'quote') then
> return x.cdr
> elseif unary_functions[x.car.sym] then
> return eval_unary(x, env)
> elseif binary_functions[x.car.sym] then
> return eval_binary(x, env)
> -- special forms that don't always eval all their args
> elseif symeq(x.car, 'if') then
> return eval_if(x, env)
> elseif symeq(x.car.car, 'fn') then
> return eval_fn(x, env)
> elseif symeq(x.car.car, 'label') then
> return eval_label(x, env)
> end
>end
- __teliva_timestamp: original
eval_unary:
>function eval_unary(x, env)
> return unary_functions[x.car.sym](eval(x.cdr.car, env))
>end
- __teliva_timestamp: original
eval_binary:
>function eval_binary(x, env)
> return binary_functions[x.car.sym](eval(x.cdr.car, env))
>end
- __teliva_timestamp: original
unary_functions:
>-- format: lisp name = lua function that implements it
>unary_functions = {
> atom=atom,
> car=car,
> cdr=cdr,
>}
- __teliva_timestamp: original
binary_functions:
>-- format: lisp name = lua function that implements it
>binary_functions = {
> cons=cons,
> iso=iso,
>}
- __teliva_timestamp: original
lookup:
>function lookup(env, s)
> if env[s] then return env[s] end
> if env.next then return lookup(env.next, s) end
>end
- __teliva_timestamp: original
eval_if:
>function eval_if(x, env)
> -- syntax: (if check b1 b2)
> local check = x.cdr.car
> local b1 = x.cdr.cdr.car
> local b2 = x.cdr.cdr.cdr.car
> if eval(check, env) then
> return eval(b1, env)
> else
> return eval(b2, env)
> end
>end
- __teliva_timestamp: original
eval_fn:
>function eval_fn(x, env)
> -- syntax: ((fn params body*) args*)
> local callee = x.car
> local args = x.cdr
> local params = callee.cdr.car
> local body = callee.cdr.cdr
> return eval_exprs(body,
> bind_env(params, args, env))
>end
- __teliva_timestamp: original
bind_env:
>function bind_env(params, args, env)
> if params == nil then return env end
> local result = {next=env}
> while true do
> result[params.car.sym] = eval(args.car, env)
> params = params.cdr
> args = args.cdr
> if params == nil then break end
> end
> return result
>end
- __teliva_timestamp: original
eval_exprs:
>function eval_exprs(xs, env)
> local result = nil
> while xs do
> result = eval(xs.car, env)
> xs = xs.cdr
> end
> return result
>end
- __teliva_timestamp: original
eval_label:
>function eval_label(x, env)
> -- syntax: ((label f (fn params body*)) args*)
> local callee = x.car
> local args = x.cdr
> local f = callee.cdr.car
> local fn = callee.cdr.cdr.car
> return eval({car=fn, cdr=args},
> bind_env({f}, {callee}, env))
>end
- __teliva_timestamp: original
atom:
>function atom(x)
> return x == nil or x.num or x.char or x.str or x.sym
>end
- __teliva_timestamp: original
car:
>function car(x) return x.car end
- __teliva_timestamp: original
cdr:
>function cdr(x) return x.cdr end
- __teliva_timestamp: original
cons:
>function cons(x, y) return {car=x, cdr=y} end
- __teliva_timestamp: original
doc:main:
>John McCarthy's Lisp -- without the metacircularity
>If you know Lua, this version might be easier to understand.
>
>Words highlighted like [[this]] are suggestions for places to jump to using ctrl-g (see the menu below).
>You can always jump back here using ctrl-b (for 'big picture').
>
>Lisp is a programming language that manipulates objects of a few different types.
>There are a few _atomic_ types, and one type that can combine them.
>The atomic types are what you would expect: numbers, characters, strings, symbols (variables). You can add others.
>
>The way to combine them is the [[cons]] table which has just two keys: a [[car]] and a [[cdr]]. Both can hold objects, either atoms or other cons tables.
>
>We'll now build an interpreter that can run programs constructed out of cons tables.
>
>One thing we'll need for an interpreter is a symbol table (env) that maps symbols to values (objects).
>We'll just use a Lua table for this purpose, but with one tweak: a _next_ pointer that allows us to combine tables together.
>See [[lookup]] now to get a sense for how we'll use envs.
>
>Lisp programs are just cons tables and atoms nested to arbitrary depths, constructing trees. A Lisp interpreter walks the tree of code,
>performing computations. Since cons tables can point to other cons tables, the tree-walker interpreter [[eval]] is recursive.
>As the interpreter gets complex, we'll extract parts of it into their own helper functions: [[eval_unary]], [[eval_binary]], [[eval_if]], and so on.
>The helper functions contain recursive calls to [[eval]], so that [[eval]] becomes indirectly recursive, and [[eval]] together with its helpers
>is mutually recursive. I sometimes find it helpful to think of them all as just one big function.
>
>All these mutually recursive functions take the same arguments: a current expression 'x' and the symbol table 'env'.
>But really, most of the interpreter is just walking the tree of expressions. Only two functions care about the internals of 'env':
> - [[lookup]] which reads within env as we saw before
> - [[bind_env]] which creates a new _scope_ of symbols for each new function call.
>More complex Lisps add even more arguments to every. single. helper. Each arg will still only really matter to a couple of functions.
>But we still have to pass them around all over the place.
>
>Hopefully this quick overview will help you get a sense for this codebase.
>
>Here's a reference list of eval helpers: [[eval_unary]], [[eval_binary]], [[eval_if]], [[eval_fn]], [[eval_exprs]], [[eval_label]]
>More complex Lisps with more features will likely add helpers for lumpy bits of the language.
>Here's a list of primitives implemented in Lua: [[atom]], [[car]], [[cdr]], [[cons]], [[iso]] (for 'isomorphic'; comparing trees all the way down to the leaves)
>Here's a list of _constructors_ for creating objects of different types: [[num]], [[char]], [[str]], [[sym]] (and of course [[cons]])
>I should probably add more primitives for operating on numbers, characters and strings..
- __teliva_timestamp: original
iso:
>function iso(x, y)
> if x == nil then return y == nil end
> local done={}
> -- watch out for the rare cyclical expression
> if done[x] then return done[x] == y end
> done[x] = y
> if atom(x) then
> if not atom(y) then return nil end
> for k, v in pairs(x) do
> if y[k] ~= v then return nil end
> end
> return true
> end
> for k, v in pairs(x) do
> if not iso(y[k], v) then return nil end
> end
> for k, v in pairs(y) do
> if not iso(x[k], v) then return nil end
> end
> return true
>end
================================================
FILE: manual_tests
================================================
run a program
run a program, edit
run a program, edit, make an edit, run | edit takes effect
run a program with error | big picture
run a program, edit, make an error, run
run a program, edit, ^g to a different definition, make an edit, ^e to run again
run a program, edit, ^g to a non-existent definition
run a program, edit, ^g to a different definition, ^g to a different definition, ^e to run again
start -> big picture -> edit -> move cursor -> run -> edit | cursor preserved
start -> big picture -> edit A -> move cursor -> big picture -> edit B | cursor initialized
start -> big picture -> edit -> move cursor -> run -> exit -> start | big picture (optional)
start -> big picture -> edit A -> move cursor -> run -> exit -> start -> ... -> edit B | cursor initialized
start -> big picture -> edit A -> move cursor -> run -> exit -> start -> ... -> edit B | big picture
syntax highlighting for line comments
syntax highlighting for multiline comments
start -> big picture -> recent changes -> add note -> save | note visible
start -> big picture -> arrow keys* | always exactly one definition highlighted
It's very important not to leak space on the Lua stack, particularly
proportionate to keypresses. That's a recipe for segfaults.
This implies that bouncing around between big picture, editor, recent changes,
running app.. shouldn't grow the call stack either.
== security/privacy
program draws over menu -> getch -> Teliva menu is still visible
app tries to read/write sensitive teliva files (teliva_edit_buffer, etc.) -> never allowed
TODO should we protect .c sources?
TODO protect against DoS attack filling up disk
assumptions:
listing files in a directory is not worth sandboxing
since reading their contents is sandboxed
and since UNIX permissions protect system directories
rmdir() is not worth sandboxing, since it only succeeds on empty directories
no need to sandbox unlink() since it's not exposed
================================================
FILE: sandboxing/README.md
================================================
This directory includes some working notes to audit the entire Teliva codebase
for side-effects that should be gated/sandboxed.
Founding principle for this approach: Side-effects come from the OS. There can
be no effects visible outside a Unix process (regardless of language) if it
doesn't invoke any OS syscalls.
## Top down
Things to secure:
* screen? Keep apps from drawing over standard Teliva UI elements.
* Teliva currently doesn't stop apps from overwriting the menu, if they're
clever. However, it always redraws its UI elements before accepting any
input from the keyboard.
* code? There are currently no protections against .tlv files clobbering
existing definitions. I'm hoping that disallowing native code keeps this
safe. Apps can only affect themselves.
* files opened (for read/write) on file system
* `io_open`
* `io_lines`
* destinations opened (for read/write) on network
* `inet_tryconnect` // `socket_connect`
* `inet_tryaccept` // `socket_accept`
It seems more difficult to control what is written to a file or socket once
it's opened. For starters let's just focus on the interfaces that convert a
string path or url to a file descriptor.
Scenarios:
* (1) app reads system files
* (1) app sends data to a remote server
* (1) app should _never_ be allowed to open Teliva's system files:
- `teliva_editor_state`
- app-specific sandboxing policies
* (2) app can read from a remote server but not write (POST)
* (1) app permissions are saved across restart
* (1) permissions the owner grants to one app are not automatically granted
to another
* (2) downloading a second app with identical name doesn't receive its
predecessors permissions
* app gains access to a remote server for a legitimate purpose, reads
sensitive data from the local system file for legitimate purpose. Now
there's nothing preventing it from exfiltrating the sensitive data to the
remote server.
- (2) solution: make it obvious in the UI that granting both permissions
allows an app to do anything. Educate people to separate apps that read
sensitive data from apps that access remote servers.
- (2) solution: map phases within an app to distinct permission sets
* app A legitimately needs to read sensitive data. It saves a copy to file
X. app B seems to legitimately needs to access the network, but also
asks to read file X. If the owner forgets who wrote file X and what it
contains, sensitive data could be exfiltrated.
* (3) app wants access to system() or exec() or popen()
Difficulty levels
1. I have some sense of how to enforce this.
2. Seems vaguely doable.
3. Seems unlikely to be doable.
UX:
* distinguish what Teliva can do, what the app can do, and Teliva's ability
to police the app.
* easily visualize Teliva's ability to police an app.
- maybe show a lock in halves; left half = file system, right half =
network. One half unlocked = orange. Both unlocked = red.
## Bottom up
* `includes`: all `#include`s throughout the codebase. I assume that C the
language itself can't invoke any syscalls without at least triggering
warnings from the compiler.
```
cd src
grep '#include' * */* > ../sandboxing/includes
```
* `system_includes`: all `#include <...>`s throughout the codebase. I assume
side-effects require going outside the codebase. `#include`s could smuggle
out of the codebase using relative paths (`../`) but I assume it's easy to
protect against this using code review.
```
grep '<' sandboxing/includes > sandboxing/system_includes
```
* `unique_system_includes`: deduped
```
sed 's/.*<\|>.*//g' sandboxing/system_includes |sort |uniq > sandboxing/unique_system_includes
```
================================================
FILE: sandboxing/includes
================================================
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include "lua.h"
kilo.c:#include "teliva.h"
lapi.c:#include
lapi.c:#include
lapi.c:#include
lapi.c:#include
lapi.c:#include "lua.h"
lapi.c:#include "lapi.h"
lapi.c:#include "ldebug.h"
lapi.c:#include "ldo.h"
lapi.c:#include "lfunc.h"
lapi.c:#include "lgc.h"
lapi.c:#include "lmem.h"
lapi.c:#include "lobject.h"
lapi.c:#include "lstate.h"
lapi.c:#include "lstring.h"
lapi.c:#include "ltable.h"
lapi.c:#include "ltm.h"
lapi.c:#include "lundump.h"
lapi.c:#include "lvm.h"
lapi.h:#include "lobject.h"
lauxlib.c:#include
lauxlib.c:#include
lauxlib.c:#include
lauxlib.c:#include
lauxlib.c:#include
lauxlib.c:#include
lauxlib.c:#include "lua.h"
lauxlib.c:#include "lauxlib.h"
lauxlib.h:#include
lauxlib.h:#include
lauxlib.h:#include "lua.h"
lbaselib.c:#include
lbaselib.c:#include
lbaselib.c:#include
lbaselib.c:#include
lbaselib.c:#include
lbaselib.c:#include "lua.h"
lbaselib.c:#include "lauxlib.h"
lbaselib.c:#include "lualib.h"
lcode.c:#include
lcode.c:#include "lua.h"
lcode.c:#include "lcode.h"
lcode.c:#include "ldebug.h"
lcode.c:#include "ldo.h"
lcode.c:#include "lgc.h"
lcode.c:#include "llex.h"
lcode.c:#include "lmem.h"
lcode.c:#include "lobject.h"
lcode.c:#include "lopcodes.h"
lcode.c:#include "lparser.h"
lcode.c:#include "ltable.h"
lcode.h:#include "llex.h"
lcode.h:#include "lobject.h"
lcode.h:#include "lopcodes.h"
lcode.h:#include "lparser.h"
ldblib.c:#include
ldblib.c:#include
ldblib.c:#include
ldblib.c:#include "lua.h"
ldblib.c:#include "lauxlib.h"
ldblib.c:#include "lualib.h"
ldebug.c:#include
ldebug.c:#include
ldebug.c:#include
ldebug.c:#include "lua.h"
ldebug.c:#include "lapi.h"
ldebug.c:#include "lcode.h"
ldebug.c:#include "ldebug.h"
ldebug.c:#include "ldo.h"
ldebug.c:#include "lfunc.h"
ldebug.c:#include "lobject.h"
ldebug.c:#include "lopcodes.h"
ldebug.c:#include "lstate.h"
ldebug.c:#include "lstring.h"
ldebug.c:#include "ltable.h"
ldebug.c:#include "ltm.h"
ldebug.c:#include "lvm.h"
ldebug.h:#include "lstate.h"
ldo.c:#include
ldo.c:#include
ldo.c:#include
ldo.c:#include
ldo.c:#include "lua.h"
ldo.c:#include "ldebug.h"
ldo.c:#include "ldo.h"
ldo.c:#include "lfunc.h"
ldo.c:#include "lgc.h"
ldo.c:#include "lmem.h"
ldo.c:#include "lobject.h"
ldo.c:#include "lopcodes.h"
ldo.c:#include "lparser.h"
ldo.c:#include "lstate.h"
ldo.c:#include "lstring.h"
ldo.c:#include "ltable.h"
ldo.c:#include "ltm.h"
ldo.c:#include "lundump.h"
ldo.c:#include "lvm.h"
ldo.c:#include "lzio.h"
ldo.h:#include "lobject.h"
ldo.h:#include "lstate.h"
ldo.h:#include "lzio.h"
ldump.c:#include
ldump.c:#include "lua.h"
ldump.c:#include "lobject.h"
ldump.c:#include "lstate.h"
ldump.c:#include "lundump.h"
lfunc.c:#include
lfunc.c:#include "lua.h"
lfunc.c:#include "lfunc.h"
lfunc.c:#include "lgc.h"
lfunc.c:#include "lmem.h"
lfunc.c:#include "lobject.h"
lfunc.c:#include "lstate.h"
lfunc.h:#include "lobject.h"
lgc.c:#include
lgc.c:#include "lua.h"
lgc.c:#include "ldebug.h"
lgc.c:#include "ldo.h"
lgc.c:#include "lfunc.h"
lgc.c:#include "lgc.h"
lgc.c:#include "lmem.h"
lgc.c:#include "lobject.h"
lgc.c:#include "lstate.h"
lgc.c:#include "lstring.h"
lgc.c:#include "ltable.h"
lgc.c:#include "ltm.h"
lgc.h:#include "lobject.h"
linit.c:#include "lua.h"
linit.c:#include "lualib.h"
linit.c:#include "lauxlib.h"
liolib.c:#include
liolib.c:#include
liolib.c:#include
liolib.c:#include
liolib.c:#include "lua.h"
liolib.c:#include "lauxlib.h"
liolib.c:#include "lualib.h"
llex.c:#include
llex.c:#include
llex.c:#include
llex.c:#include "lua.h"
llex.c:#include "ldo.h"
llex.c:#include "llex.h"
llex.c:#include "lobject.h"
llex.c:#include "lparser.h"
llex.c:#include "lstate.h"
llex.c:#include "lstring.h"
llex.c:#include "ltable.h"
llex.c:#include "lzio.h"
llex.h:#include "lobject.h"
llex.h:#include "lzio.h"
llimits.h:#include
llimits.h:#include
llimits.h:#include "lua.h"
lmathlib.c:#include
lmathlib.c:#include
lmathlib.c:#include "lua.h"
lmathlib.c:#include "lauxlib.h"
lmathlib.c:#include "lualib.h"
lmem.c:#include
lmem.c:#include "lua.h"
lmem.c:#include "ldebug.h"
lmem.c:#include "ldo.h"
lmem.c:#include "lmem.h"
lmem.c:#include "lobject.h"
lmem.c:#include "lstate.h"
lmem.h:#include
lmem.h:#include "llimits.h"
lmem.h:#include "lua.h"
loadlib.c:#include
loadlib.c:#include
loadlib.c:#include "lua.h"
loadlib.c:#include "lauxlib.h"
loadlib.c:#include "lualib.h"
loadlib.c:#include
loadlib.c:#include
loadlib.c:#include
lobject.c:#include
lobject.c:#include
lobject.c:#include
lobject.c:#include
lobject.c:#include
lobject.c:#include "lua.h"
lobject.c:#include "ldo.h"
lobject.c:#include "lmem.h"
lobject.c:#include "lobject.h"
lobject.c:#include "lstate.h"
lobject.c:#include "lstring.h"
lobject.c:#include "lvm.h"
lobject.h:#include
lobject.h:#include "llimits.h"
lobject.h:#include "lua.h"
lopcodes.c:#include "lopcodes.h"
lopcodes.h:#include "llimits.h"
loslib.c:#include
loslib.c:#include
loslib.c:#include
loslib.c:#include
loslib.c:#include
loslib.c:#include "lua.h"
loslib.c:#include "lauxlib.h"
loslib.c:#include "lualib.h"
lparser.c:#include
lparser.c:#include "lua.h"
lparser.c:#include "lcode.h"
lparser.c:#include "ldebug.h"
lparser.c:#include "ldo.h"
lparser.c:#include "lfunc.h"
lparser.c:#include "llex.h"
lparser.c:#include "lmem.h"
lparser.c:#include "lobject.h"
lparser.c:#include "lopcodes.h"
lparser.c:#include "lparser.h"
lparser.c:#include "lstate.h"
lparser.c:#include "lstring.h"
lparser.c:#include "ltable.h"
lparser.h:#include "llimits.h"
lparser.h:#include "lobject.h"
lparser.h:#include "lzio.h"
lstate.c:#include
lstate.c:#include "lua.h"
lstate.c:#include "ldebug.h"
lstate.c:#include "ldo.h"
lstate.c:#include "lfunc.h"
lstate.c:#include "lgc.h"
lstate.c:#include "llex.h"
lstate.c:#include "lmem.h"
lstate.c:#include "lstate.h"
lstate.c:#include "lstring.h"
lstate.c:#include "ltable.h"
lstate.c:#include "ltm.h"
lstate.h:#include "lua.h"
lstate.h:#include "lobject.h"
lstate.h:#include "ltm.h"
lstate.h:#include "lzio.h"
lstring.c:#include
lstring.c:#include "lua.h"
lstring.c:#include "lmem.h"
lstring.c:#include "lobject.h"
lstring.c:#include "lstate.h"
lstring.c:#include "lstring.h"
lstring.h:#include "lgc.h"
lstring.h:#include "lobject.h"
lstring.h:#include "lstate.h"
lstrlib.c:#include
lstrlib.c:#include
lstrlib.c:#include
lstrlib.c:#include
lstrlib.c:#include
lstrlib.c:#include "lua.h"
lstrlib.c:#include "lauxlib.h"
lstrlib.c:#include "lualib.h"
ltable.c:#include
ltable.c:#include
ltable.c:#include "lua.h"
ltable.c:#include "ldebug.h"
ltable.c:#include "ldo.h"
ltable.c:#include "lgc.h"
ltable.c:#include "lmem.h"
ltable.c:#include "lobject.h"
ltable.c:#include "lstate.h"
ltable.c:#include "ltable.h"
ltable.h:#include "lobject.h"
ltablib.c:#include
ltablib.c:#include "lua.h"
ltablib.c:#include "lauxlib.h"
ltablib.c:#include "lualib.h"
ltm.c:#include
ltm.c:#include "lua.h"
ltm.c:#include "lobject.h"
ltm.c:#include "lstate.h"
ltm.c:#include "lstring.h"
ltm.c:#include "ltable.h"
ltm.c:#include "ltm.h"
ltm.h:#include "lobject.h"
lua.c:#include
lua.c:#include
lua.c:#include
lua.c:#include
lua.c:#include
lua.c:#include
lua.c:#include
lua.c:#include
lua.c:#include
lua.c:#include
lua.c:#include
lua.c:#include "lua.h"
lua.c:#include "teliva.h"
lua.c:#include "lauxlib.h"
lua.c:#include "lualib.h"
lua.h:#include
lua.h:#include
lua.h:#include "luaconf.h"
lua.h:#include LUA_USER_H
luaconf.h:#include
luaconf.h:#include
luaconf.h:#include
luaconf.h:#include
luaconf.h:#include
luaconf.h:#include
lualib.h:#include "lua.h"
lundump.c:#include
lundump.c:#include "lua.h"
lundump.c:#include "ldebug.h"
lundump.c:#include "ldo.h"
lundump.c:#include "lfunc.h"
lundump.c:#include "lmem.h"
lundump.c:#include "lobject.h"
lundump.c:#include "lstring.h"
lundump.c:#include "lundump.h"
lundump.c:#include "lzio.h"
lundump.h:#include "lobject.h"
lundump.h:#include "lzio.h"
lvm.c:#include
lvm.c:#include
lvm.c:#include
lvm.c:#include "lua.h"
lvm.c:#include "ldebug.h"
lvm.c:#include "ldo.h"
lvm.c:#include "lfunc.h"
lvm.c:#include "lgc.h"
lvm.c:#include "lobject.h"
lvm.c:#include "lopcodes.h"
lvm.c:#include "lstate.h"
lvm.c:#include "lstring.h"
lvm.c:#include "ltable.h"
lvm.c:#include "ltm.h"
lvm.c:#include "lvm.h"
lvm.h:#include "ldo.h"
lvm.h:#include "lobject.h"
lvm.h:#include "ltm.h"
lzio.c:#include
lzio.c:#include "lua.h"
lzio.c:#include "llimits.h"
lzio.c:#include "lmem.h"
lzio.c:#include "lstate.h"
lzio.c:#include "lzio.h"
lzio.h:#include "lua.h"
lzio.h:#include "lmem.h"
menu.c:#include
menu.c:#include
menu.c:#include "lua.h"
menu.c:#include "lauxlib.h"
menu.c:#include "teliva.h"
tlv.c:#include
tlv.c:#include
tlv.c:#include
tlv.c:#include
tlv.c:#include
tlv.c:#include
tlv.c:#include "lua.h"
tlv.c:#include "lauxlib.h"
lcurses/_helpers.c:#include
lcurses/_helpers.c:#include
lcurses/_helpers.c:#include
lcurses/_helpers.c:#include
lcurses/_helpers.c:#include
lcurses/_helpers.c:#include
lcurses/_helpers.c:#include
lcurses/_helpers.c:#include
lcurses/_helpers.c:#include
lcurses/_helpers.c:#include "../lua.h"
lcurses/_helpers.c:#include "../lualib.h"
lcurses/_helpers.c:#include "../lauxlib.h"
lcurses/chstr.c:#include "_helpers.c"
lcurses/compat-5.2.c:#include
lcurses/compat-5.2.c:#include
lcurses/compat-5.2.c:#include "../lua.h"
lcurses/compat-5.2.c:#include "../lauxlib.h"
lcurses/compat-5.2.c:#include "compat-5.2.h"
lcurses/compat-5.2.c:#include
lcurses/compat-5.2.c:#include
lcurses/compat-5.2.h:#include
lcurses/compat-5.2.h:#include
lcurses/compat-5.2.h:#include
lcurses/compat-5.2.h:#include "../lua.h"
lcurses/compat-5.2.h:#include "../lauxlib.h"
lcurses/compat-5.2.h:#include "../lualib.h"
lcurses/compat-5.2.h:#include
lcurses/curses.c:#include "_helpers.c"
lcurses/curses.c:#include "strlcpy.c"
lcurses/curses.c:#include "chstr.c"
lcurses/curses.c:#include "window.c"
lcurses/strlcpy.c:#include
lcurses/strlcpy.c:#include
lcurses/window.c:#include "../teliva.h"
lcurses/window.c:#include "_helpers.c"
lcurses/window.c:#include "chstr.c"
luasec/compat.h:#include
luasec/config.c:#include "compat.h"
luasec/config.c:#include "options.h"
luasec/config.c:#include "ec.h"
luasec/context.c:#include
luasec/context.c:#include
luasec/context.c:#include
luasec/context.c:#include
luasec/context.c:#include
luasec/context.c:#include
luasec/context.c:#include
luasec/context.c:#include "../lua.h"
luasec/context.c:#include "../lauxlib.h"
luasec/context.c:#include "compat.h"
luasec/context.c:#include "context.h"
luasec/context.c:#include "options.h"
luasec/context.c:#include
luasec/context.c:#include "ec.h"
luasec/context.h:#include "../lua.h"
luasec/context.h:#include
luasec/context.h:#include "compat.h"
luasec/ec.c:#include
luasec/ec.c:#include "ec.h"
luasec/ec.h:#include "../lua.h"
luasec/ec.h:#include
luasec/options.c:#include
luasec/options.c:#include "options.h"
luasec/options.h:#include "compat.h"
luasec/options.lua:#include
luasec/options.lua:#include "options.h"
luasec/ssl.c:#include
luasec/ssl.c:#include
luasec/ssl.c:#include
luasec/ssl.c:#include
luasec/ssl.c:#include
luasec/ssl.c:#include
luasec/ssl.c:#include
luasec/ssl.c:#include
luasec/ssl.c:#include "../lua.h"
luasec/ssl.c:#include "../lauxlib.h"
luasec/ssl.c:#include "../luasocket/io.h"
luasec/ssl.c:#include "../luasocket/buffer.h"
luasec/ssl.c:#include "../luasocket/timeout.h"
luasec/ssl.c:#include "../luasocket/socket.h"
luasec/ssl.c:#include "x509.h"
luasec/ssl.c:#include "context.h"
luasec/ssl.c:#include "ssl.h"
luasec/ssl.h:#include
luasec/ssl.h:#include "../lua.h"
luasec/ssl.h:#include "../luasocket/io.h"
luasec/ssl.h:#include "../luasocket/buffer.h"
luasec/ssl.h:#include "../luasocket/timeout.h"
luasec/ssl.h:#include "../luasocket/socket.h"
luasec/ssl.h:#include "compat.h"
luasec/ssl.h:#include "context.h"
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include
luasec/x509.c:#include "../lua.h"
luasec/x509.c:#include "../lauxlib.h"
luasec/x509.c:#include "x509.h"
luasec/x509.h:#include
luasec/x509.h:#include "../lua.h"
luasec/x509.h:#include "compat.h"
luasocket/auxiliar.c:#include "luasocket.h"
luasocket/auxiliar.c:#include "auxiliar.h"
luasocket/auxiliar.c:#include
luasocket/auxiliar.c:#include
luasocket/auxiliar.h:#include "luasocket.h"
luasocket/buffer.c:#include "luasocket.h"
luasocket/buffer.c:#include "buffer.h"
luasocket/buffer.h:#include "luasocket.h"
luasocket/buffer.h:#include "io.h"
luasocket/buffer.h:#include "timeout.h"
luasocket/compat.c:#include "luasocket.h"
luasocket/compat.c:#include "compat.h"
luasocket/except.c:#include "luasocket.h"
luasocket/except.c:#include "except.h"
luasocket/except.c:#include
luasocket/except.h:#include "luasocket.h"
luasocket/inet.c:#include "luasocket.h"
luasocket/inet.c:#include "inet.h"
luasocket/inet.c:#include
luasocket/inet.c:#include
luasocket/inet.c:#include
luasocket/inet.h:#include "luasocket.h"
luasocket/inet.h:#include "socket.h"
luasocket/inet.h:#include "timeout.h"
luasocket/io.c:#include "luasocket.h"
luasocket/io.c:#include "io.h"
luasocket/io.h:#include "luasocket.h"
luasocket/io.h:#include "timeout.h"
luasocket/luasocket.c:#include "luasocket.h"
luasocket/luasocket.c:#include "auxiliar.h"
luasocket/luasocket.c:#include "except.h"
luasocket/luasocket.c:#include "timeout.h"
luasocket/luasocket.c:#include "buffer.h"
luasocket/luasocket.c:#include "inet.h"
luasocket/luasocket.c:#include "tcp.h"
luasocket/luasocket.c:#include "udp.h"
luasocket/luasocket.c:#include "select.h"
luasocket/luasocket.h:#include "../lua.h"
luasocket/luasocket.h:#include "../lauxlib.h"
luasocket/luasocket.h:#include "compat.h"
luasocket/mime.c:#include "luasocket.h"
luasocket/mime.c:#include "mime.h"
luasocket/mime.c:#include
luasocket/mime.c:#include
luasocket/mime.h:#include "luasocket.h"
luasocket/options.c:#include "luasocket.h"
luasocket/options.c:#include "auxiliar.h"
luasocket/options.c:#include "options.h"
luasocket/options.c:#include "inet.h"
luasocket/options.c:#include
luasocket/options.h:#include "luasocket.h"
luasocket/options.h:#include "socket.h"
luasocket/select.c:#include "luasocket.h"
luasocket/select.c:#include "socket.h"
luasocket/select.c:#include "timeout.h"
luasocket/select.c:#include "select.h"
luasocket/select.c:#include
luasocket/serial.c:#include "luasocket.h"
luasocket/serial.c:#include "auxiliar.h"
luasocket/serial.c:#include "socket.h"
luasocket/serial.c:#include "options.h"
luasocket/serial.c:#include "unix.h"
luasocket/serial.c:#include
luasocket/serial.c:#include
luasocket/socket.h:#include "io.h"
luasocket/socket.h:#include "wsocket.h"
luasocket/socket.h:#include "usocket.h"
luasocket/socket.h:#include "timeout.h"
luasocket/tcp.c:#include "luasocket.h"
luasocket/tcp.c:#include "auxiliar.h"
luasocket/tcp.c:#include "socket.h"
luasocket/tcp.c:#include "inet.h"
luasocket/tcp.c:#include "options.h"
luasocket/tcp.c:#include "tcp.h"
luasocket/tcp.c:#include
luasocket/tcp.h:#include "luasocket.h"
luasocket/tcp.h:#include "buffer.h"
luasocket/tcp.h:#include "timeout.h"
luasocket/tcp.h:#include "socket.h"
luasocket/timeout.c:#include "luasocket.h"
luasocket/timeout.c:#include "auxiliar.h"
luasocket/timeout.c:#include "timeout.h"
luasocket/timeout.c:#include
luasocket/timeout.c:#include
luasocket/timeout.c:#include
luasocket/timeout.c:#include
luasocket/timeout.c:#include
luasocket/timeout.c:#include
luasocket/timeout.h:#include "luasocket.h"
luasocket/udp.c:#include "luasocket.h"
luasocket/udp.c:#include "auxiliar.h"
luasocket/udp.c:#include "socket.h"
luasocket/udp.c:#include "inet.h"
luasocket/udp.c:#include "options.h"
luasocket/udp.c:#include "udp.h"
luasocket/udp.c:#include
luasocket/udp.c:#include
luasocket/udp.h:#include "luasocket.h"
luasocket/udp.h:#include "timeout.h"
luasocket/udp.h:#include "socket.h"
luasocket/unix.c:#include "luasocket.h"
luasocket/unix.c:#include "unixstream.h"
luasocket/unix.c:#include "unixdgram.h"
luasocket/unix.h:#include "luasocket.h"
luasocket/unix.h:#include "buffer.h"
luasocket/unix.h:#include "timeout.h"
luasocket/unix.h:#include "socket.h"
luasocket/unixdgram.c:#include "luasocket.h"
luasocket/unixdgram.c:#include "auxiliar.h"
luasocket/unixdgram.c:#include "socket.h"
luasocket/unixdgram.c:#include "options.h"
luasocket/unixdgram.c:#include "unix.h"
luasocket/unixdgram.c:#include
luasocket/unixdgram.c:#include
luasocket/unixdgram.c:#include
luasocket/unixdgram.h:#include "unix.h"
luasocket/unixstream.c:#include "luasocket.h"
luasocket/unixstream.c:#include "auxiliar.h"
luasocket/unixstream.c:#include "socket.h"
luasocket/unixstream.c:#include "options.h"
luasocket/unixstream.c:#include "unixstream.h"
luasocket/unixstream.c:#include
luasocket/unixstream.c:#include
luasocket/unixstream.h:#include "unix.h"
luasocket/usocket.c:#include "luasocket.h"
luasocket/usocket.c:#include "socket.h"
luasocket/usocket.c:#include "pierror.h"
luasocket/usocket.c:#include
luasocket/usocket.c:#include
luasocket/usocket.c:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/usocket.h:#include
luasocket/wsocket.c:#include "luasocket.h"
luasocket/wsocket.c:#include
luasocket/wsocket.c:#include "socket.h"
luasocket/wsocket.c:#include "pierror.h"
luasocket/wsocket.h:#include
luasocket/wsocket.h:#include
================================================
FILE: sandboxing/system_includes
================================================
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
kilo.c:#include
lapi.c:#include
lapi.c:#include
lapi.c:#include
lapi.c:#include
lauxlib.c:#include
lauxlib.c:#include
lauxlib.c:#include
lauxlib.c:#include
lauxlib.c:#include
lauxlib.c:#include
lauxlib.h:#include
lauxlib.h:#include
lbaselib.c:#include
lbaselib.c:#include
lbaselib.c:#include
lbaselib.c:#include
lbaselib.c:#include
lcode.c:#include
ldblib.c:#include
ldblib.c:#include
ldblib.c:#include
ldebug.c:#include
Lua 5.1 Reference Manual