This is librep.info, produced by makeinfo version 4.6 from librep.texi. INFO-DIR-SECTION Programming Languages START-INFO-DIR-ENTRY * librep: (librep). A flexible Lisp environment END-INFO-DIR-ENTRY This is Edition 1.2, last updated 8 September 2000, of `The librep Manual', for librep, Version 0.13. Copyright 1999-2000 John Harper. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one.  File: librep.info, Node: Debugging, Next: Tips, Prev: Timers, Up: The language Debugging ========= When you have written a Lisp program you will have to debug it (unless all your programs work first time?). There are two main classes of errors; syntax errors and semantic errors. Syntax errors occur when the text you've typed out to represent your program is not a valid representation of a Lisp object (since a program is simply an ordered set of Lisp objects). When you try to load your program the Lisp reader will find the syntax error and tell you about, unfortunately though it probably won't be able to tell you exactly where the error is. The most common source of syntax errors is too few or too many parentheses; the Jade or Emacs `Ctrl-Meta-f' and `Ctrl-Meta-b' commands can be used to show the structure of the program as the Lisp reader sees it. Semantic errors are what we normally call bugs--errors in logic, the program is syntactically correct but doesn't do what you want it to. For these types of errors librep provides hooks to allow interactive debugging. The debugger supplied with librep uses these hooks to implement a simple command line debugger; programs using librep as an extension language may provide their own debugger interface. There are several ways to enter the Lisp debugger; functions can be marked so that they cause the debugger to be entered when they are called, breakpoints can be written in functions or it can be called explicitly with a form to step through. - Command: trace symbol This command marks the symbol SYMBOL so that each time its value is dereferenced the debugger is entered when the next form is evaluated. This can be used to set breakpoints on functions (or variables). When called interactively SYMBOL is prompted for. - Command: untrace symbol The opposite of `trace'--unmarks the symbol. - Function: break This function causes the debugger to be entered immediately. By putting the form `(break)' at suitable points in your program simple breakpoints can be created. - Command: step form This function invokes the debugger to step through the form FORM. When called interactively FORM is prompted for. - Function: backtrace #!optional stream Prints a description of the current Lisp function call stack to STREAM (or `standard-output' if STREAM is undefined). (backtrace (current-buffer)) -| # ((current-buffer)) nil -| # ((backtrace (current-buffer))) t => t Each line represents a stack frame, the first item is the called function, the second is the list of arguments applied to it. The third item is true if the list of arguments as displayed has already been evaluated. Whenever the Lisp debugger is entered the form waiting to be evaluated is printed, preceded by the current depth of execution in angular brackets. At this point the special debugger commands available are, `step' `s' Step into the current form; this means that in a list form the debugger is used to evaluated each argument in turn. `next' `n' Continue evaluating forms normally until the next form at the current level is entered, then re-enter the debugger. `continue' `c' Continue execution normally. Note that this command is the one to use when an error has been trapped. `return FORM' `r FORM' Evaluate FORM then return this value as the result of the current form. `print FORM' `p FORM' Evaluate FORM, then print its value. `form' `f' Print the form being debugged. `backtrace' `b' Print a backtrace of the current Lisp call stack. Entering a null string repeats the previous `next', `step', or `continue' command. After the form has been evaluated (i.e. after you've typed one of the commands above) the value of the form is printed in the buffer, prefixed by the string `=> '. Note that it is also possible to make certain types of errors invoke the debugger immediately they are signalled, see *Note Errors::. Also note that the debugger is unable to step through compiled Lisp code.  File: librep.info, Node: Tips, Prev: Debugging, Up: The language Tips ==== This section of the manual gives advice about programming in `librep'. For advice on getting the most out of the compiler, see *Note Compilation Tips::. * Menu: * Comment Styles:: Different types of comments  File: librep.info, Node: Comment Styles, Up: Tips Comment Styles -------------- As already described, single-line comments in Lisp are introduced by a semi-colon (`;') character. By convention a different number of semi-colons is used to introduce different types of comments, `;' A comment referring to the line of Lisp code that it occurs on, comments of this type are usually indented to the same depth, on the right of the Lisp code. When editing in Jade's Lisp mode the command `Meta-;' can be used to insert a comment of this type. For example, (defconst op-call #x08) ;call (stk[n] stk[n-1] ... stk[0]) ; pops n values, replacing the ; function with the result. (defconst op-push #x10) ;pushes constant # n `;;' Comments starting with two semi-colons are written on a line of their own and indented to the same depth as the next line of Lisp code. They describe the following lines of code. For example, (let ((fname (concat file-name ?c))) ;; Be sure to remove any partially written dst-file. (when (file-exists-p fname) (delete-file fname))) Comments of this type are also placed before a function definition to describe the function. This saves wasting memory with a documentation string in a module's internal functions. For example, ;; Compile a form which occurred at the `top-level' into a ;; byte code form. ;; defuns, defmacros, defvars, etc... are treated specially. ;; require forms are evaluated before being output uncompiled; ;; this is so any macros are brought in before they're used. (defun comp-compile-top-form (form) ... `;;;' This type of comment always starts in the first column of the line, they are used to make general comments about a program and don't refer to any function or piece of code in particular. For example, ;;; Notes: ;;; Instruction Encoding ;;; ==================== ;;; Instructions which get an argument (with opcodes of zero up to ... `;;;;' Each program should have a comment of this type as its first line, the body of the comment is the name of the file, two dashes and a brief description of what the program does. They always start in the first column. For example, ;;;; compiler.jl -- Simple compiler for Lisp files/forms If you adhere to these standards the indentation functions provide by the Lisp mode will indent your comments to the correct depth.  File: librep.info, Node: The REPL, Next: librep Internals, Prev: The language, Up: Top The REPL ******** When you invoke the stand-alone librep interpreter without giving it a script to execute the system is started in interactive mode. This means that the "REPL" is entered--the read-eval-print loop. The REPL works as its name suggests. It reads Lisp forms from the console, evaluates them, and then prints the result back to the console. Here is an example REPL session: user> (+ 1 1) 2 user> (cons 'a 'b) (a . b) The `user>' string is the prompt that the REPL prints when it is waiting for an input form. This form may span several lines, e.g.: user> (cons 'a 'b) (a . b) The prompt above contains the string `user'. This is the name of the module that the form will be evaluated in (*note Modules::). As well as allowing arbitrary Lisp forms to be entered and evaluated, the REPL provides a rich set of meta-commands, these are used to configure and inspect the state of the system, as well as providing convenient shortcuts for common operations. A meta-command is differentiated from a normal Lisp form by preceding it with a comma (`,') character. The name of the command should follow the comma, with any argument forms after that. Note that unlike normal Lisp forms, no parentheses are used to mark the command application. For example the `whereis' meta-command searches all loaded modules for those exporting a particular symbol. It might be used as follows: user> ,whereis string-match string-match is exported by: rep.regexp The following table lists all currently supported meta-commands: `access STRUCT ...' Add the modules named STRUCT ... to the list of structures whose exported definitions may be accessed by the current module (using the `structure-ref' special form). `accessible' Print the names of the modules whose contents may be accessed using the `structure-ref' form from the current module. `apropos "REGEXP"' Print the definitions in the scope of the current module whose names match the regular expression REGEXP. `bindings' Print all bindings in the current module. `collect' Run the garbage collector. `compile [STRUCT ...]' Compile any uncompiled functions in the modules named STRUCT .... If no named modules are given, use the current module. `compile-proc PROCEDURE ...' Compile the functions called PROCEDURE ... in the current module. `describe SYMBOL' Look for documentation describing the current meaning of SYMBOL, if any is found, print it. `dis FORM' Disassemble the bytecode form or compiled function that is the result of evaluating FORM. `expand FORM' Print FORM with any outermost macro calls recursively expanded. `exports' Print the names of the variables exported from the current module. `help' List all REPL commands. `imports' Print the names of the modules imported by the current module. `in STRUCT [FORM]' If FORM is given, temporarily switch to the module called STRUCT, evaluate FORM printing the result, then switch back to the original module. If FORM isn't given, simply switch the current module to be STRUCT. `interfaces' Print all defined module interfaces, and their definitions. `load STRUCT ...' Attempt to load the module called STRUCT. `load-file "FILENAME" ...' Load the file of Lisp forms called FILENAME. `locate SYMBOL' Recursively scan from the current module for the module providing the binding of SYMBOL. `new STRUCT' Create a new module called STRUCT, and set it as the current module. It will import the `rep.module-system' module, but nothing else (i.e. no actual language). `open STRUCT ...' Import the modules called STRUCT ... to the current module. This is analogous to the `open' clause in the configuration form of the module's definition. `profile FORM' Evaluate FORM, recording information about the frequency and duration of the calls it makes to subroutines (and the calls they make, and so on). This information is tabulated and printed after the evaluation has finished. `quit' Terminate the Lisp interpreter. `reload STRUCT ...' Reload the modules called STRUCT .... If modules of these names had previously been loaded, they will be deallocated when there are no remaining references to them. Note that importing the interface of one module into another does not create object references between the two modules (the references are purely symbolic). However, each closure (i.e. function) created in a module does contain a reference to the module it was created in. `step FORM' Evaluate FORM in single-step mode (using the debugger). `structures' Print the names of all currently defined modules. `time FORM' Evaluate the form FORM, print the result and the time it took to perform the evaluation. `unload STRUCT ...' Attempt to unload the modules called STRUCT .... As with reloading, unloading a module only removes the link between the module name and the module body. Only once no more references exist to the module body will it be freed. `whereis SYMBOL' Scan all loaded modules for those that export a binding of SYMBOL, and print the results.  File: librep.info, Node: librep Internals, Next: Reporting bugs, Prev: The REPL, Up: Top librep Internals **************** This chapter will document the internals of `librep', including how to embed the interpreter into general applications, and how to write dynamically-loadable C libraries. Unfortunately most of it hasn't been written. As always, the best reference is the source, Luke! * Menu: * Intro To Internals:: * Data Type Representation:: * Garbage Collection Internals:: * Defining Lisp Subrs:: * Useful Functions:: * Shared Libraries::  File: librep.info, Node: Intro To Internals, Next: Data Type Representation, Up: librep Internals Introduction To librep Internals ================================  File: librep.info, Node: Data Type Representation, Next: Garbage Collection Internals, Prev: Intro To Internals, Up: librep Internals Data Type Representation ========================  File: librep.info, Node: Garbage Collection Internals, Next: Defining Lisp Subrs, Prev: Data Type Representation, Up: librep Internals Garbage Collection Internals ============================  File: librep.info, Node: Defining Lisp Subrs, Next: Useful Functions, Prev: Garbage Collection Internals, Up: librep Internals Defining Lisp Subrs ===================  File: librep.info, Node: Useful Functions, Next: Shared Libraries, Prev: Defining Lisp Subrs, Up: librep Internals Useful Functions ================  File: librep.info, Node: Shared Libraries, Prev: Useful Functions, Up: librep Internals Shared Libraries ================  File: librep.info, Node: Reporting bugs, Next: News, Prev: librep Internals, Up: Top Reporting bugs ************** If the `librep' interpreter crashes it's probably a bug (unless you're using the `rep-gtk' binding, in which case creating invalid GTK widget hierarchies can easily crash the Lisp system). If the interpreter hangs such that sending it interrupt signals doesn't fix the problem, that's probably also a bug. To help me fix any bugs found please try to collect as much meaningful information as possible. This will hopefully include stack backtraces (of both the C and Lisp stacks if possible), what features are loaded, what you did immediately before triggering the bug, a description of your the system, etc... Please send any bug reports to the mailing list: . Alternatively, the author may be contacted at: .  File: librep.info, Node: News, Next: Function index, Prev: Reporting bugs, Up: Top News **** 0.16 ==== * New modules `rep.data.trie', `rep.threads.proxy' * Also added `rep.xml.reader' and `rep.xml.printer', though these should probably be used with extreme caution * Appending to queues is now O(1) not O(n) * Many changes to `rep.net.rpc' module, protocol is incompatible with previous version. Should be more robust * `rep.i18n.gettext' module exports the `bindtextdomaincodeset' function (Christophe Fergeau) * Slightly more secure way of seeding the rng * `inexact->exact' can now convert floating point numbers to rationals (though not optimally). This means that `numerator' and `denominator' also work better with floats now * New function `file-ttyp' * Some random bug fixes 0.15 ==== * Parser can now associate lexical location (file name and line number) with parsed objects. Added `call-with-lexical-origins' and `lexical-origin' functions. This adds memory overhead but is only enabled in interpreted mode, or other times it could be useful (e.g. when compiling) * The compiler enables line-numbering, and uses the information when it prints errors. It also prints errors in a more standard format (intended to mimic GCC), and distinguishes warnings from errors * Debugger is much improved, and supports emacs-style emission of line number tokens. Use the included `rep-debugger.el' elisp code to source-debug rep programs in Emacs! * New command line option `--debug'. When given, rep starts up in the debugger * Reformatted backtrace output. Also backtraces only ever include evaluated argument lists now. They also include lexical information when possible * Syntax errors include error description and line number * Now supports weak reference objects. New functions `make-weak-ref', `weak-ref', `weak-ref-set'. A weak reference is a pointer to another object. When that object is garbage collected, the pointer in the weak reference is set to false. * New `error helper' module. When an error is handled, this module is called and tries to print a human-understandable message explaining why the error may have occurred * REPL commands may now be specified by their shortest unique set of leading characters, e.g. `,o' instead of `,open' * Added an `#undefined' value. Returned by `%define' and the macros using it (`defun', `defmacro', etc...) * New function `table-size' in module `rep.data.tables' * `thread-suspend' returns true iff the timeout was reached (i.e. return false if `thread-wake' was used to unsuspend the thread) * Objects defined using the `object' macro now have an implicit `self' binding - the object representing their self (or their most derived self) * Added TIMEOUT parameter to `condition-variable-wait' and `obtain-mutex' functions * New `rep.threads.message-port' module, implements a simple message queue for threads * `log' function now optionally accepts a second argument, the base of the logarithm * Use gmp to generate random numbers when possible (if at least version 3 of gmp is found) [disabled in librep 0.15.1 - gmp seems to be buggy?] * The `string-replace' function may now be given a function as its TEMPLATE parameter * Bug fixes: - Signal an error if writes don't write all characters they were asked to. Also, some functions could write fewer characters than they were supposed to even if no errors occurred - Remembered that file sizes may not fit in fixnums - Don't preserve trailing slashes in results of canonical-file-name (to make the path canonical) - Don't signal an error when end of file is encountered immediately after reading `#\X' syntax - `current-thread' and `all-threads' will create a thread object for the implicit thread if there isn't one already - In C subrs that take optional integer arguments, signal an error if the given value isn't an integer or undefined (false). Also, accept all types of numbers where it makes sense to do so - Signal an error if end of file is read while parsing a block comment - Don't ever return a null object from `current-time-string' - Catch errors signalled during command line option processing, and pass them to the standard error handler - Right hand side of `letrec' bindings may now have more than one form - The `object' macro now evaluates its BASE-OBJECT parameter exactly once - Finally removed `define-value' - Ignore null lines (or lines which only have comments) in the repl - In the compiler, don't expand macros which have have been shadowed by local bindings - Don't print some compiler errors/warnings twice - Fixes for `mips-compaq-nonstopux' architecture (Tom Bates) - Fixed `,reload' and `,unload' repl commands not to try to remove non-existent structures 0.14 ==== * New module `rep.util.md5', has two functions for generating MD5 message digests (of files or strings) * Changes to the `rep.io.sockets' function: In the `socket-server' function the HOST and/or PORT arguments may be false, meaning to listen on all addresses and to choose a random unused port. New functions `socket-peer-address' and `socket-peer-port', these always returns the details of the far end of the connetion. `socket-address' and `socket-port' have been changed to always return the details of the local connection point. * New function in `rep.system' module, `crypt'. A wrapper for the system's `crypt' function (if it has one) * New function in `rep.threads' mdoule, `make-suspended-thread' * New module `rep.net.rpc', provides a text-stream based RPC mechanism for Lisp programs. Similar in some ways to untyped CORBA. (This is still in the experimental stage - its interface may change in forthcoming releases) * New functions in `rep.data' module, `list->vector' and `vector->list' * New macro `define-special-form'. A combination of `defvar' and `setq' - it always makes the variable special and it always sets it to the given value * New module `rep.test.framework' implementing `assert', `check' and `test' macros. This provides a framework for implementing unit tests in Lisp modules (such that running the interpreter with the `--check' option will run all tests that have been set up to be autoloaded * Bug fixes: - When reading from strings, don't choke on zero bytes - When writing into sockets, be aware that the socket is in non-blocking mode - SDBM and GDBM modules now close any open databases before the interpreter exits - Fixed the `rep_parse_number' function not to require a terminating null character in the string when parsing bignums - Only define `Qrep_lang_interpreter' once - Don't assign vm registers to physical registers on 68000 architectures - it's been reported to crash - When running asynchronous subprocesses, open and initialize the pty slave before forking to avoid a race condition with the child process - Flush symbols from the module cache at another point - Fixes for Unixware - When compiling non-top-level `defvar' forms, add any doc string they have to the database 0.13.5 ====== * Tar file handling no longer requires GNU tar * The `defvar' special form can now take only a single argument * The reader now treats `#\return' characters as white space * Other miscellaneous bug fixes... 0.13.4 ====== * Don't restrict symbols exported from plugin libraries, some need to export symbols to work properly (this bug only seemed to appear on Solaris systems) * Added `rep_file_type' and `rep_guardian_type' to the list of symbols exported from librep * Fixed the `install-aliases' script (Peter Teichman) * New module `rep.threads.condition-variable' * Added `string-split' and `string-replace' to the gaol 0.13.3 ====== * Try to only export public symbols from `librep.so' and modules * When expanding file names translate `/..' to `/' * Set an upper bound on the allowed recursion depth when regexp matching, prevents the stack from overflowing in pathological cases * Added optional second arg to `readline' function, a function to call to generate completions. The `rl-completion-generator' method of supplying this function is deprecated * Fixed bugs when handling character-case in regexp module (Andrew Rodionoff) * Added an `premature-end-of-stream' error. This is signalled instead of `end-of-stream' when reading characters in the middle of a syntax form. The `end-of-stream' error is only signalled when the end of the stream is reached before encountering anything other than whitespace characters * Fixed bug of expanding declarations in the `define' macro expansion 0.13.2 ====== * Fix `define' so that it tracks bound variables and ignores shadowed keywords when traversing code * Added checks to compilation process for the kind of missing shared-library problems that many people see * Fixed the `install-aliases' shell script * New configure option: `--enable-full-name-terminator' 0.13.1 ====== * Added functions `remove-if' and `remove-if-not' * Various bug-fixes for non-linux or solaris systems (John H. Palmieri, Philippe Defert) * `#f', `#t', `#!optional', `#!key' and `#!rest' are now uninterned symbols. Keywords are interned in a separate obarray * Fixed bug of caching regexps even when their string has been modified * Fixed some bugs in the ftp remote file handler and the `pwd-prompt' function * Fixed `define' to ignore `structure' and `define-structure' forms 0.13 ==== * The end-of-list / boolean-false object is no longer the symbol `nil'. Instead there is a special object `()' fulfulling these two roles. For modules importing the `rep' module, the symbol `nil' evaluates to `()'. This allows the `scheme' module to be more compliant with the Scheme standard * Parameter list changes: - Deprecated `&optional' and `&rest', in favour of `#!optional' and `#!rest'. - Added keyword parameters. Use `#!key' to declare them. Keyword syntax is `#:PARAM'. For example: ((lambda (#!key a b) (list a b)) #:b 2 #:a 1) => (1 2) - `#!optional' and `#!key' parameters may now have default values, syntax is `(VAR DEFAULT)'. For example: ((lambda (#!optional (a 1)) a)) => 1 * The module namespace is now hierarchical. `.' characters in module names denote directory separators, e.g. `foo.bar' translates to the file `foo/bar' All module names prefixed with `rep.' are reserved for librep, other top-level names should be picked to be as unique as possible The existing modules have been renamed to fit this scheme (see the file `TREE' in the distribution for the hierarchy details). However, old module names will still work for the time being * The `rep' module no longer includes the `rep.regexp', `rep.system', `rep.io.files', `rep.io.processes' or `rep.io.file-handlers' modules. These need to be imported explicitly * Doc strings are now indexed by module name as well as symbol name. The `define' macro now takes a doc string as its optional third parameter * Record constructors may include all lambda-list keywords (e.g. keywords and/or default values) * Incompatible virtual machine changes, hence bytecode files will need to be recompiled. Improvements include: - Only heap-allocate variables when absolutely necessary - Closure analysis to allow inlining of some types of `letrec' expressions - Added a `safe' virtual machine, which makes no assumptions regarding validity of bytecode, so is safe for untrusted code * Added an `unscheme' module. Another Scheme implementation, but the goal of this one is to integrate cleanly with the librep runtime environment, even if this is at the expense of R4RS compliance For example, in `unscheme' code, `#f => ()' and `#t => t'. This allows rep and unscheme functions to call each other without needing to convert any data * By default, it is now illegal to modify top-level variables that have not previously been defined * New macro `define-structures' to export multiple views of a single underlying environment * The librep runtime no longer handles the `--help' option itself, this should be done by scripts * Don't search `$LD_LIBRARY_PATH' for plugins, but prepend all directories in colon-separated `$REP_DL_LOAD_PATH' to `dl-load-path'. Similarly, the contents of `$REP_LOAD_PATH' is prepended to `rep-load-path' * `(/ X) => (/ 1 X)' * Extra string-manipulation functions: `string-replace', `string-split' (in the `rep.regexp' module) * `#f' and `#t' are now primitive symbols, not special objects * Special case tail-recursive calls to `apply', to ensure they get eliminated * The `0x123' and `0123' read syntaxes have been deprecated, use `#x123' and `#o123' instead * `#| ... |#' comments now nest correctly * New modules: `rep.i18n.gettext', `rep.vm.safe-interpreter', `rep.vm.assembler', `unscheme', `rep.data.objects', `rep.www.quote-url', `rep.www.fetch-url', `rep.util.ispell', `rep.util.base64', `rep.util.autoloader', `rep.io.sockets', `rep.util.time', `rep.net.domain-name' * Bug fixes, including: - Find size of `long long' type on AIX, IRIX and Solaris (Dan McNichol, Albert Chin-A-Young) - Never allow macros to be called as functions - Make bitfields unsigned (Albert Chin-A-Young) - Fixed bounds-checking when parsing non-base-10 fixnums - Thread fixes (and much lower thread-switch latency in many cases) - Fixed `DEFUN' macro for C++ (Matt Tucker); also fixed header files to avoid C++ keywords - Make error message for bytecode version mismatches more meaningful - Fixed: `default-boundp', `continuation-callable-p' - Only the evaluate the value of `defvar' forms if the symbol isn't already bound - Compile else-less `case' expressions correctly; eliminate tail-recursion in `cond' forms when possible - Various fixes in `scheme' module 0.12.4 ====== * Support building without GNU MP, `--without-gmp' option to configure. Use `long long' for non-fixnum integers (promote to floats when out of range); no exact rationals. There's also an option to disable continuations/threading (`--disable-continuations') * Sanitized function inlining: - Use `(declare (inline NAMES...))' to tell the compiler that it might be useful to inline the named functions - Don't even think about inlining across module/file boundaries (for now anyway) * Cleaned up the `gaol' module. Interface is essentially: `gaol-define', `gaol-define-special', `gaol-define-file-handler'. Added `gaol-open' to import complete modules. Still supports old interface * Be a lot more efficient when printing quoted strings and symbol names (for some streams there used to be a system-call per character!) Also, when quoting weird symbol names, be more intelligent * Removed code to autoload from modules (which didn't really work anyway) * Be more intelligent about deciding when to flush the module cache * Build fixes for IRIX (David Kaelbling) * Other miscellaneous bug-fixes and performance tweaks 0.12.3 ====== * New function `thread-join', waits for a specified thread to exit, then returns the value of the last form it evaluated * Added a rudimentary profiler (`,profile FORM' command in repl) * Reorganized `ring' module, sanitized the interface (preserving compatibility with old functions), also added a `ring->list' function * `rplaca' and `rplacd' (but not `setcar' and `setcdr') functions now return the cell being modified, not the value being stored into it, for compatibility with CL (Karl Hegbloom) * `unwind-protect', `catch', `condition-case': these special forms are now macros * When signalling `bad-arg' or `missing-arg' errors, try to include the function as the first element of the error data * `load' function now _only_ loads files without suffixes if NO-SUFFIX arg is non-`nil' (prevents picking up un-suffixed files by mistake, e.g. from the current directory) * Fixed some bugs when reading rationals * Fixed bug of `gettext' module not redefining `_' binding in `rep' module * Fixed bug when building `rep-config' script (Mark Hewitt, Dan Winship) * Fixed bug of `rep_INTERN_SPECIAL' macro not looking for default values of special variables * Fixed interpreted versions of `min' and `max' when operating on non-numeric values * If unable to allocate heap space, just print an error and terminate the program (the low-memory handling doesn't currently work properly) * Fixed bug when extracting doc strings from `define' forms * Fixed bug when compiling structure definitions in non-top-level environments * Fixed bug of being unable to `load' empty files * When recursively macro-expanding, dereference identifiers in the correct module 0.12.2 ====== * The tar file-handler now caches the unpacked archive (wins big when loading sawfish themes) * The `gaol' module can now create multiple gaols, each with it's own namespace * More performance tweaks * Miscellaneous bug-fixes (more vm stack smashing, `defconst' never evaluates its constant) 0.12.1 ====== * Some virtual machine performance tweaks * Fixed nasty stack smashing bug (when using compiler declarations) * Some 64-bit cleanups (George Lebl) * Fixed non-ANSI C syntax (Sam Falkner) 0.12 ==== * Added a basic module system. Modelled after the Scheme48 system, but simpler. At its simplest, include a `define-structure' form in each file representing a module: (define-structure NAME INTERFACE CONFIG BODY...) The external definitions of this module can then be imported by other modules through their CONFIG statements, e.g. `(open NAMES...)'. Most modules will open `rep' to get the standard language definitions. `foo#bar' reads as `(structure-ref foo bar)' The `timers', `tables', `sdbm', `gdbm', `readline', `gettext', `ring', `mutex', `memoize', `lisp-doc', `disassembler', `compiler', `date', `cgi-get', `gaol' features are all now modules (this is backwards compatible, since modules may be imported using `require') See the "Modules" section of the manual for more details. * The repl now contains meta-commands for inspecting and configuring the module system (amongst other things) * Added a facility for creating new primitive types: `make-datum', `datum-ref', `datum-set', `has-type-p', `define-datum-printer' * Added an SRFI 9 compatible `define-record-type' macro for defining data structures (the `records' module) * Added fluid variables--a method of creating dynamically scoped bindings that fit well with lexically scoped definitions (`make-fluid', `fluid', `fluid-set', `with-fluids', `let-fluids') * Added a `queues' module providing a basic queue type * Added stream functions: `peek-char', `input-stream-p', `output-stream-p' * Interpreter now also eliminates tail-calls * Changed handling of inexact numbers to be compatible with the Scheme standard: - Many operations now produce inexact outputs if any of their inputs are inexact (e.g. `min', `max', `floor', `ceiling', `round', `truncate') - `eql' and `equal' no longer ignore exactness when comparing numbers. `=', `/=', `<', `>', `<=' and `>=' _do_ ignore inexactness. E.g. (eql 2 2.) => nil (= 2 2.) => t * Support most of Scheme's read-syntax for numbers (i.e. `#b', `#o', `#d', `#x' radix prefixes, and `#e', `#i' exactness prefixes). * Implemented Scheme's `string->number' and `number->string' functions * Included a basic R4RS Scheme implementation (module: `scheme'). Do `,new foo ,open scheme' to test it in the repl, use `(open scheme)' instead of `(open rep)' to use it within modules. The compiler also knows enough about Scheme to be able to compile it. Also, use the `-s' or `--scheme' options to load a file of Scheme code. * The debugger works better (and can be used to walk the stack history somewhat) * Last arg of `append' and `nconc' may be a non-proper-list now * Implemented the Scheme `do' macro for iteration * `define' supports curried functions. E.g. `(define ((plus a) b) (+ a b))', then `(plus 1)' evaluates to the function that adds one to its argument. * Many performance improvements: - Allocates less memory (so garbage collects less often) - Much faster at bytecode-to-bytecode function calling - Much reduced VM overhead (when compiled with GCC) * Compiler improvements: - Supports the `(declare CLAUSES...)' form. See the "Compiler Declarations" section of the manual for details on the actual declarations supported. - Is cleverer about detecting when to create new bindings when tail recursing, and when the old bindings can just be overwritten - Groks the module system, and the language of the module being compiled (so that it can compile both rep and Scheme code) - Splices bodies of top-level `progn' and `begin' forms themselves into the top-level (for when macros expand into multiple definitions) - Compiling already defined functions (or whole modules of functions) now (mostly) works - Coalesce and compile non-defining top-level forms * Many bug fixes (see ChangeLog files for details) 0.11.3 ====== * Fixed bug of throwing uninitialized errors when autoloading * Fixed bug of interpreting `(let () ...)' as a named let 0.11.2 ====== * Replaced many special forms by macros--`let', `let*', `function', `if', `and', `or', `prog2', `defmacro', `defun', `defconst', `define-value', `setq-default' * `let' now supports Scheme's named-let construct for iteration via tail recursion * Parse some standard Common Lisp and Scheme syntax: `#| ... |#' block comments, `#\C' or `#\NAME' characters (where NAME may be one of: `space', `newline', `backspace', `tab', `linefeed', `return', `page', `rubout'), and `#(...)' vectors * When comparing symbols, compare their names as strings * Implemented Scheme's `dynamic-wind' function * Fixed bug of sometimes evaluating function arguments in the environment of the callee not the caller * Fixed bug when calculating how long to sleep for when no threads are available * Fixed bugs in mutex implementation (Damon Anderson) * Work around bugs in Tru64 `RTLD_GLOBAL'; everything should work on Tru64 now (Aron Griffis) * Fixed bug of not saving current regexp state across continuations 0.11.1 ====== * The compiler now eliminates single-function tail calls (instead of leaving it to the virtual machine) * Updated to use libtool-1.3.4 * Miscellaneous bug fixes and minor changes 0.11 ==== * Better support for numerical computing. Now supports bignums, rational numbers (numerator and denominator are bignums), and floating point values as well as the original fixnums. Many new numerical functions supporting these types. Promotes and demotes hopefully as you'd expect (never demotes an inexact number to an exact number). Tries to follow the Scheme numeric system as much as possible * Supports "guardian" objects through the `make-guardian' function (as described in Dybvig's paper). These are a clean mechanism for allowing the programmer to control when arbitrary lisp objects are finally deallocated. Also added a new hook: `after-gc-hook' * The default error handler can now be redefined. If the variable `error-handler-function' contains a function then it will be called to handle the error, with arguments `(ERROR DATA)'. * New special form `case', switches on a key value and sets of constants * New function `call/cc' (also available through the alias `call-with-current-continuation'). Provides scheme-like continuation functions. Special variables are now deep-bound to support this correctly * Supports "soft" preemptive threads using continuations and a general "barrier" mechanism (used either for restricting control flow, or for receiving notification when control passes across a barrier) * Parameter lists in lambda expressions now support improper lists, as in scheme. E.g. `(lambda (x . y) ...)' * Implements the scheme `define' syntax, with support for inner definitions * The `tables' plugin implements hash tables, with extensible hashing and comparison methods; supports both strongly and weakly keyed tables * Included a GDBM binding; DOC files are now stored in GDBM files (SDBM has limits on datum sizes) * `put' and `get' functions now use `equal' to compare property names * Virtual machine / compiler improvements: - Variable references and mutations are classified by type: lexical bindings use (one-dimensional) lexically addressed instructions, global non-special bindings have their own instructions, everything else uses the original instructions. Similar classification when creating new bindings - Eliminate tail-recursive function calls wherever possible in compiled code (when the calling function has no dynamic state) Compiled lisp code will need to be rebuilt to run on the modified virtual machine. * When expanding macros, bind `macro-environment' to the macro environment it was called with. This allows macros to reliably expand inner macro uses * New hook `before-exit-hook'. Called immediately before exiting * `rep-xgettext' now has an option `--c'. This makes it output pseudo C code containing the string constants found * Fixed misfeature of interpreting filenames `FOO//BAR' as `/BAR'. Contiguous path separators are now merged (i.e. `FOO/BAR') 0.10 ==== * Updated support for dumping (freezing) lisp definitions to handle lisp-1 nature with closures. Also now generates C code instead of assembler for portability; creates a plugin that may be loaded through the REP_DUMP_FILE environment variable * Plugin `.la' files may now contain rep-specific settings: `rep_open_globally=yes' and `rep_requires='FEATURES...'' * New function `define-value'. A combination of `set' and `defvar', but without implying dynamic scope * `load' scans AFTER-LOAD-ALIST for plugins as well as lisp libraries * `(if t)' now evaluates to `nil' not `t' * Fix regexp bug in matching simple non-greedy operators (Matt Krai) * Borrowed guile's bouncing parentheses for readline (Ceri Storey) * New C functions `rep_load_environment' and `rep_top_level_exit' * `defvar' allows symbols to be redefined in protected environments if they haven't also been defined by unprotected environments * Detect GCC's with broken `__builtin_return_address' functions (George Lebl) * Try to use libc `gettext' implementation, but only if it looks like it's the GNU implementation 0.9 === * Support for using GNU readline (give configure the `--with-readline' option) * New functions: `letrec', `caar', ..., `cddr', `caaar', ..., `cdddr', `in-hook-p', `make-variable-special' * Changed `unless' to have the Common Lisp semantics--return `nil' when the condition evaluates true, not the value of the condition * Fixed/added some compiler optimisations * Fixed `rep-xgettext' script to remove duplicated strings and to search exhaustively * `add-hook' forces the hook variable to be special (in case it wasn't declared using `defvar') 0.8.1 ===== Fixed some documentation bugs; fixed some build problems 0.8 === * Default scoping is now lexical, only variables declared using `defvar' are dynamically scoped. * There is now only a single namespace for symbols (excepting property lists), this means that the `fset', `symbol-function' and `fboundp' functions have been removed This allows all elements in procedure-call forms to be evaluated equally (as in scheme), so things like: ((if t + -) 1 2) now work. Related to this, function names (i.e. symbols and lambda expressions) are no longer dereferenced by any operations taking functions as arguments. Only built-in subroutines and closures are considered functions. This means that where before you'd write something like: (mapcar '+ '(1 2 3)) this is now illegal; the `+' function must be evaluated: (mapcar + '(1 2 3)) * `lambda' is now a special form evaluating to a closure (as in scheme); this means that the following are exactly equivalent: (lambda (x) x) == (function (lambda (x) x)) == #'(lambda (x) x) An alternative method of enclosing a lambda expression is to use the `make-closure' function. * `gaol' module providing semi-safe environment for untrusted code to evaluate in * Support for i18n through `gettext' module; also support for `%1$s' type format specifiers * New functions `string-equal' and `string-lessp' 0.7.1 ===== * Added `--with-rep-prefix' option to autoconf AM_PATH_REP macro * Fixed bug when inserting a new timer before an existing timer * Fix the malloc tracking code * Fix dlmalloc for FreeBSD * Use install when installing, not cp * Some fixes for compiling with SUN's C compiler on Solaris 0.7 === * Added file handler for read-only access to the contents of tar archives, access files like `foo.tar.gz#tar/bar' * `process-id' function now returns pid of lisp interpreter when called with zero arguments * Added (untested) support for loading dynamic objects via `shl_load' (HP-UX) * Added (untested) support for systems that prefix symbol names in dynamic objects with underscores * Fix bug when compiling `last' function * Fix bug of not closing files in the `load' function 0.6.2 ===== * Added `autoload-verbose' variable; set it to `nil' to turn off the messages when autoloading * Fix problems when `--prefix' option has a trailing slash * Updated libtool files to version 1.3.3 * Initial (incomplete) support for building under Tru64, from Aron Griffis 0.6.1 ===== No new features; minor portability tweaks and build changes. Fix bug of trying to load directories as Lisp scripts 0.6 === * Add `unsetenv' function * `system' now uses `process-environment' * Workaround compiler bug with GCC 2.95 on sparc * Fix build problem where libsdbm.la can't be located 0.5 === * New function `set-input-handler', registers an asynchronous input handler for a local file * Don't abort on receipt of unexpected `SIGCHLD' signals * Upgrade libtool to version 1.2f * The `rep' binary by default always loads a script named `rep', not named by it's `argv[0]' (this breaks under the newer libtool) 0.4 === * Sending a rep process a `SIGUSR2' prints all debug buffers * Added `--with-value-type', and `--with-malloc-alignment' configure options. Also added code to automatically detect the first of these options. * Fixed some 64-bit problems * Removed the difference between static and dynamic strings 0.3 === * New compiler command line option `--write-docs' 0.2 === * The variables `error-mode' and `interrupt-mode' control where errors and user-interrupts (i.e. `SIGINT' signals) are handled. The three possible values are: `top-level', `exit' and `nil' (denotes the current event loop). * Fixed bug where all dynamic types were erroneously `symbolp'. * `SIGINT', `SIGHUP' and `SIGTERM' signals should now be caught more successfully. * Added a new directory to `dl-load-path': `LIBEXECDIR/rep/ARCH' to contain third-party shared libraries. 0.1 === First public release.  File: librep.info, Node: Function index, Next: Variable index, Prev: News, Up: Top Function index ************** * Menu: * *: Arithmetic Functions. * +: Arithmetic Functions. * -: Arithmetic Functions. * /: Arithmetic Functions. * /=: Comparison Predicates. * 1+: Arithmetic Functions. * 1-: Arithmetic Functions. * <: Comparison Predicates. * <=: Comparison Predicates. * =: Comparison Predicates. * >: Comparison Predicates. * >=: Comparison Predicates. * _: i18n. * abs: Real Number Functions. * accept-process-output: Process I/O. * acos: Mathematical Functions. * active-processes: Process Objects. * add-hook: Normal Hooks. * all-threads: Creating Threads. * alpha-char-p: Characters. * alphanumericp: Characters. * and: Conditional Structures. * append: Building Lists. * apply: Calling Functions. * apropos: Obarrays. * aref: Array Functions. * arrayp: Array Functions. * aset: Array Functions. * asin: Mathematical Functions. * assoc: Association Lists. * assq: Association Lists. * atan: Mathematical Functions. * atom: Cons Cells. * autoload: Autoloading. * backquote: Backquoting. * backtrace: Debugging. * beep: Beeping. * bindtextdomain: i18n. * boundp: Void Variables. * break: Debugging. * bytecodep: Compilation Functions. * call-hook: Normal Hooks. * call-process: Synchronous Processes. * call-with-current-continuation: Continuations. * call-with-dynamic-root: Thread Contexts. * call/cc: Continuations. * canonical-file-name: File Names. * capitalize-string: String Functions. * car: Cons Cells. * case: Conditional Structures. * catch: Catch and Throw. * cdr: Cons Cells. * ceiling: Real Number Functions. * char-downcase: Characters. * char-upcase: Characters. * close-file: Destroying File Objects. * closure-function: Anonymous Functions. * closurep: Anonymous Functions. * compile-directory: Compilation Functions. * compile-file: Compilation Functions. * compile-form: Compilation Functions. * compile-function: Compilation Functions. * compile-module: Compilation Functions. * complete-string: String Functions. * concat: Strings. * cond: Conditional Structures. * condition-case: Errors. * cons: Cons Cells. * consp: Cons Cells. * continue-process: Process States. * copy-file: Manipulating Files. * copy-file-from-local-fs: File Handlers. * copy-file-to-local-fs: File Handlers. * copy-sequence: Sequence Functions. * copy-stream: Output Functions. * cos: Mathematical Functions. * current-thread: Creating Threads. * current-time: Timestamps. * current-time-string: Formatting Dates. * datum-ref: Datums. * datum-set: Datums. * declare: Compiler Declarations. * defconst: Defining Variables. * define <1>: Definitions. * define: Defining Variables. * define-datum-printer: Datums. * define-interface: Module Interfaces. * define-macro: Definitions. * define-record-discloser: Records. * define-record-type: Records. * define-structure: Module Definition. * define-structures: Module Definition. * defmacro: Defining Macros. * defun: Defining Functions. * defvar: Defining Variables. * delete: Modifying Lists. * delete-directory: Manipulating Directories. * delete-file: Manipulating Files. * delete-from-queue: Queues. * delete-if: Mapping Functions. * delete-if-not: Mapping Functions. * delete-timer: Timers. * delq: Modifying Lists. * denominator: Rational Functions. * dequeue: Queues. * digit-char-p: Characters. * directory-file-name: File Names. * directory-files: Manipulating Directories. * disassemble-fun: Disassembly. * do: Looping Structures. * elt: Sequence Functions. * enqueue: Queues. * eq: Equality Predicates. * eq-hash: Hash Tables. * eql: Equality Predicates. * equal: Equality Predicates. * equal-hash: Hash Tables. * eval: Evaluation. * eval-after-load: Load Function. * eval-when-compile: Compiler Declarations. * evenp: Numeric Predicates. * exact->inexact: Rational Functions. * exactp: Numeric Predicates. * exp: Mathematical Functions. * expand-file-name: File Names. * expand-last-match: Regexp Functions. * expt: Mathematical Functions. * featurep: Features. * file-binding: Functions on File Objects. * file-bound-stream: Functions on File Objects. * file-directory-p: File Information. * file-exists-p: File Information. * file-handler-data: Functions on File Objects. * file-modes: File Information. * file-modes-as-string: File Information. * file-modtime: File Information. * file-name-absolute-p: File Names. * file-name-as-directory: File Names. * file-name-directory: File Names. * file-name-nondirectory: File Names. * file-newer-than-file-p: File Information. * file-nlinks: File Information. * file-owner-p: File Information. * file-readable-p: File Information. * file-regular-p: File Information. * file-size: File Information. * file-symlink-p: File Information. * file-writable-p: File Information. * filep: File Objects. * filter: Mapping Functions. * find-symbol: Obarrays. * fix-time: Timestamps. * floor: Real Number Functions. * fluid: Fluid Variables. * fluid-set: Fluid Variables. * flush-file: Functions on File Objects. * format: Formatted Output. * funcall: Calling Functions. * functionp: Functions. * garbage-collect: Garbage Collection. * gcd: Integer Functions. * gensym: Creating Symbols. * get: Property Lists. * get-command-line-option: Command Line Options. * get-output-stream-string: Output Streams. * getenv: Environment Variables. * has-type-p: Datums. * if: Conditional Structures. * inexact->exact: Real Number Functions. * inexactp: Numeric Predicates. * input-stream-p: Streams. * integerp: Numeric Predicates. * intern: Interning. * intern-symbol: Interning. * interrupt-process: Signalling Processes. * keywordp: Keyword Symbols. * kill-process: Signalling Processes. * last: Accessing List Elements. * lcm: Integer Functions. * length: Sequence Functions. * let <1>: Looping Structures. * let: Local Variables. * let*: Local Variables. * let-fluids: Fluid Variables. * letrec: Local Variables. * list: Building Lists. * list*: Building Lists. * listp: Lists. * load: Load Function. * local-file-name: File Names. * log: Mathematical Functions. * logand: Bitwise Functions. * logior: Bitwise Functions. * lognot: Bitwise Functions. * logxor: Bitwise Functions. * lower-case-p: Characters. * lsh: Bitwise Functions. * macroexpand: Macro Expansion. * macroexpand-1: Macro Expansion. * macrop: Macros. * make-closure: Anonymous Functions. * make-datum: Datums. * make-directory: Manipulating Directories. * make-file-from-stream: File Handlers. * make-fluid: Fluid Variables. * make-guardian: Guardians. * make-keyword: Keyword Symbols. * make-list: Building Lists. * make-mutex: Mutexes. * make-obarray: Obarrays. * make-process: Process Objects. * make-queue: Queues. * make-string: Strings. * make-string-input-stream: Input Streams. * make-string-output-stream: Output Streams. * make-suspended-thread: Creating Threads. * make-symbol: Creating Symbols. * make-symlink: Manipulating Symlinks. * make-table: Hash Tables. * make-temp-name: File Names. * make-thread: Creating Threads. * make-timer: Timers. * make-vector: Vectors. * make-weak-table: Hash Tables. * makunbound: Void Variables. * mapc: Mapping Functions. * mapcar: Mapping Functions. * mapconcat: String Functions. * match-end: Regexp Functions. * match-start: Regexp Functions. * max: Comparison Predicates. * maybe-obtain-mutex: Mutexes. * member: Accessing List Elements. * memq: Accessing List Elements. * message: Messages. * min: Comparison Predicates. * mod: Integer Functions. * modulo: Integer Functions. * mutexp: Mutexes. * nconc: Modifying Lists. * negativep: Numeric Predicates. * not: Conditional Structures. * nreverse: Modifying Lists. * nth: Accessing List Elements. * nthcdr: Accessing List Elements. * null: Lists. * numberp: Numbers. * numerator: Rational Functions. * obtain-mutex: Mutexes. * oddp: Numeric Predicates. * open-file: Creating File Objects. * or: Conditional Structures. * output-stream-p: Streams. * parse-date: Parsing Dates. * positivep: Numeric Predicates. * prin1: Output Functions. * prin1-to-string: Output Functions. * princ: Output Functions. * print: Output Functions. * process-args: Process Objects. * process-connection-type: Asynchronous Processes. * process-dir: Process Objects. * process-error-stream: Process I/O. * process-exit-status: Process Information. * process-exit-value: Process Information. * process-function: Process States. * process-id: Process Information. * process-in-use-p: Process States. * process-output-stream: Process I/O. * process-prog: Process Objects. * process-running-p: Process States. * process-stopped-p: Process States. * processp: Process Objects. * prog1: Sequencing Structures. * prog2: Sequencing Structures. * progn: Sequencing Structures. * provide: Features. * put: Property Lists. * queue->list: Queues. * queue-empty-p: Queues. * queue-length: Queues. * queuep: Queues. * quote: Quoting. * quote-regexp: Regexp Functions. * quotient: Integer Functions. * random: Random Numbers. * rassoc: Association Lists. * rassq: Association Lists. * rationalp: Numeric Predicates. * read <1>: Input Functions. * read: The Lisp Reader. * read-char: Input Functions. * read-from-string: Input Functions. * read-line: Input Functions. * read-symlink: Manipulating Symlinks. * realp: Numeric Predicates. * release-mutex: Mutexes. * remainder: Integer Functions. * remote-ftp-add-passwd: Remote Files. * remove: Building Lists. * remove-hook: Normal Hooks. * remq: Building Lists. * rename-file: Manipulating Files. * require: Features. * reverse: Building Lists. * round: Real Number Functions. * rplaca: Cons Cells. * rplacd: Cons Cells. * run-byte-code: Compilation Functions. * seconds->time: Timestamps. * seek-file: Functions on File Objects. * sequencep <1>: Sequence Functions. * sequencep: Sequences. * set: Setting Variables. * set-file-handler-data: Functions on File Objects. * set-file-modes: File Information. * set-input-handler: Functions on File Objects. * set-process-args: Process Objects. * set-process-connection-type: Asynchronous Processes. * set-process-dir: Process Objects. * set-process-error-stream: Process I/O. * set-process-function: Process States. * set-process-output-stream: Process I/O. * set-process-prog: Process Objects. * set-timer: Timers. * setenv: Environment Variables. * setplist: Property Lists. * setq: Setting Variables. * signal: Errors. * signal-process: Signalling Processes. * sin: Mathematical Functions. * sit-for: Process I/O. * sleep-for: Sleeping. * sort: Modifying Lists. * space-char-p: Characters. * special-form-p: Special Forms. * sqrt: Mathematical Functions. * start-process: Asynchronous Processes. * stderr-file: Creating File Objects. * stdin-file: Creating File Objects. * stdout-file: Creating File Objects. * step: Debugging. * stop-process: Process States. * streamp: Streams. * string-capitalized-p: String Functions. * string-downcase: String Functions. * string-equal: Strings. * string-hash: Hash Tables. * string-head-eq: String Functions. * string-lessp: Strings. * string-looking-at: Regexp Functions. * string-lower-case-p: String Functions. * string-match: Regexp Functions. * string-replace: Regexp Functions. * string-upcase: String Functions. * string-upper-case-p: String Functions. * string<: Strings. * string=: Strings. * stringp: Strings. * structure: Module Definition. * subr-name: Functions. * subrp: Functions. * substring: Strings. * symbol-hash: Hash Tables. * symbol-name: Symbol Attributes. * symbol-plist: Property Lists. * symbol-value: Variables. * symbolp: Symbols. * system: Shell Commands. * system-name: System Information. * table-bound-p: Hash Tables. * table-ref: Hash Tables. * table-set: Hash Tables. * table-unset: Hash Tables. * table-walk: Hash Tables. * tablep: Hash Tables. * tan: Mathematical Functions. * textdomain: i18n. * thread-delete: Deleting Threads. * thread-deleted-p: Deleting Threads. * thread-forbid: Manipulating Threads. * thread-join: Manipulating Threads. * thread-permit: Manipulating Threads. * thread-suspend: Manipulating Threads. * thread-suspended-p: Manipulating Threads. * thread-wake: Manipulating Threads. * thread-yield: Manipulating Threads. * threadp: Creating Threads. * throw: Catch and Throw. * time-: Timestamps. * time->seconds: Timestamps. * time-later-p: Timestamps. * trace: Debugging. * translate-string: String Functions. * truncate: Real Number Functions. * unintern: Interning. * unless: Conditional Structures. * unsetenv: Environment Variables. * untrace: Debugging. * unwind-protect: Cleanup Forms. * upper-case-p: Characters. * useless-function: Descriptions. * user-full-name: User Information. * user-home-directory: User Information. * user-login-name: User Information. * vector: Vectors. * vectorp: Vectors. * when: Conditional Structures. * while: Looping Structures. * with-fluids: Fluid Variables. * with-internal-definitions: Definitions. * without-interrupts: Manipulating Threads. * write: Output Functions. * zerop: Numeric Predicates.  File: librep.info, Node: Variable index, Next: Concept index, Prev: Function index, Up: Top Variable index ************** * Menu: * after-gc-hook: Garbage Collection. * after-load-alist: Load Function. * backtrace-on-error: Errors. * command-line-args <1>: Command Line Options. * command-line-args: Invocation. * date-vec-day: Parsing Dates. * date-vec-day-abbrev: Parsing Dates. * date-vec-epoch-time: Parsing Dates. * date-vec-hour: Parsing Dates. * date-vec-minute: Parsing Dates. * date-vec-month: Parsing Dates. * date-vec-month-abbrev: Parsing Dates. * date-vec-second: Parsing Dates. * date-vec-timezone: Parsing Dates. * date-vec-year: Parsing Dates. * debug-on-error: Errors. * default-directory: File Names. * dl-load-path: Load Function. * downcase-table: String Functions. * features: Features. * file-handler-alist: File Handlers. * flatten-table: String Functions. * format-hooks-alist: Formatted Output. * garbage-threshold: Garbage Collection. * grains-of-sand: Descriptions. * idle-garbage-threshold: Garbage Collection. * lisp-lib-directory: Load Function. * load-filename: Load Function. * load-path: Load Function. * max-lisp-depth: Evaluation. * obarray: Obarrays. * operating-system: System Information. * print-escape: Output Functions. * print-length: Output Functions. * print-level: Output Functions. * process-environment: Process Objects. * remote-auto-backend-alist: Remote Files. * remote-default-backend: Remote Files. * remote-default-user: Remote Files. * remote-ftp-anon-passwd: Remote Files. * remote-ftp-anon-users: Remote Files. * remote-ftp-display-progress: Remote Files. * remote-ftp-show-messages: Remote Files. * remote-host-user-alist: Remote Files. * rep-build-id: System Information. * rep-version: System Information. * seconds-per-day: Timestamps. * standard-error: Output Streams. * standard-input: Input Streams. * standard-output: Output Streams. * upcase-table: String Functions.  File: librep.info, Node: Concept index, Prev: Variable index, Up: Top Concept index ************* * Menu: * Accessing list elements: Accessing List Elements. * Alists: Association Lists. * Anonymous functions: Anonymous Functions. * Arguments, command line: Command Line Options. * Arithmetic Functions: Arithmetic Functions. * Array functions: Array Functions. * Arrays: Sequences. * Association lists: Association Lists. * Asynchronous processes: Asynchronous Processes. * Asynchronous timers: Timers. * Atom: Cons Cells. * Autoload forms: Autoload Forms. * Autoloading: Autoloading. * Backquoting: Backquoting. * Beeping: Beeping. * Bitwise functions: Bitwise Functions. * Block structured definitions: Definitions. * Boolean values: nil and t. * Boolean values, predicate functions: Predicate Functions. * Bugs, reporting: Reporting bugs. * Building lists: Building Lists. * Calendar date and time: Time and Date. * Calling functions: Calling Functions. * Catch and throw: Catch and Throw. * Characters: Characters. * Circular lists: Infinite Lists. * Cleanup forms: Cleanup Forms. * Command line options: Command Line Options. * Comment styles: Comment Styles. * Comments: Read Syntax. * Comparison predicates: Comparison Predicates. * Compilation functions: Compilation Functions. * Compilation tips: Compilation Tips. * Compilation, disassembly of forms: Disassembly. * Compiled Lisp: Compiled Lisp. * Compiler declarations: Compiler Declarations. * Compiling macros: Compiling Macros. * Conditional structures: Conditional Structures. * Cons cells: Cons Cells. * Continuations: Continuations. * Control Structures: Control Structures. * Control structures, conditionals: Conditional Structures. * Control structures, looping: Looping Structures. * Control structures, non-local exits: Non-Local Exits. * Control structures, sequencing: Sequencing Structures. * Copying: Copying. * Creating file objects: Creating File Objects. * Creating symbols: Creating Symbols. * Creating threads: Creating Threads. * Data type representation: Data Type Representation. * Data types: Data Types. * Data types, datums: Datums. * Data types, hash tables: Hash Tables. * Data types, queues: Queues. * Data types, records: Records. * Data types, summary of: Types Summary. * Date and time: Time and Date. * Date and time, timestamps: Timestamps. * Dates, formatting as strings: Formatting Dates. * Dates, parsing: Parsing Dates. * Datums: Datums. * Debugging: Debugging. * Declarations, compiler: Compiler Declarations. * Defining functions: Defining Functions. * Defining lisp subrs: Defining Lisp Subrs. * Defining macros: Defining Macros. * Defining variables: Defining Variables. * Definitions, block structured: Definitions. * Deleting threads: Deleting Threads. * Descriptions: Descriptions. * Destroying file objects: Destroying File Objects. * Disassembly: Disassembly. * Distribution conditions: Copying. * Dynamically loaded libraries: Shared Libraries. * Embedding librep: librep Internals. * Environment variables: Environment Variables. * Equality predicates: Equality Predicates. * Errors: Errors. * Escape sequences in strings: Strings. * Evaluating Lisp forms: Evaluation. * Evaluation: Evaluation. * Executing rep scripts: Invocation. * Executing shell commands: Shell Commands. * Expansion, of macros: Macro Expansion. * Features: Features. * File Handlers: File Handlers. * File handlers, remote files: Remote Files. * File information: File Information. * File names: File Names. * File objects: File Objects. * File objects, creating: Creating File Objects. * File objects, destroying: Destroying File Objects. * File objects, functions: Functions on File Objects. * Files: Files. * Files, closing: Destroying File Objects. * Files, manipulating: Manipulating Files. * Files, manipulating directories: Manipulating Directories. * Files, opening: Creating File Objects. * Files, remote: Remote Files. * Fluid variables: Fluid Variables. * Formatted output: Formatted Output. * Formatting dates: Formatting Dates. * Forms, autoload: Autoload Forms. * Forms, constant: Self-Evaluating Forms. * Forms, function call: Function Call Forms. * Forms, macro call: Macro Call Forms. * Forms, self-evaluating: Self-Evaluating Forms. * Forms, special: Special Forms. * Forms, symbol: Symbol Forms. * Forms, variable: Symbol Forms. * Function call forms: Function Call Forms. * Function exits: Function Exits. * Functions: Functions. * Functions as hooks: Functions As Hooks. * Functions on File Objects: Functions on File Objects. * Functions, anonymous: Anonymous Functions. * Functions, block structured: Definitions. * Functions, calling: Calling Functions. * Functions, compilation: Compilation Functions. * Functions, defining: Defining Functions. * Functions, descriptions of: Descriptions. * Functions, input: Input Functions. * Functions, lambda expressions: Lambda Expressions. * Functions, loading: Load Function. * Functions, local: Local Functions. * Functions, mapping: Mapping Functions. * Functions, output: Output Functions. * Garbage collection: Garbage Collection. * Garbage collection internals: Garbage Collection Internals. * Garbage collection, guardians: Guardians. * Guardians: Guardians. * Hash tables: Hash Tables. * Hooks: Hooks. * Hooks, functions as: Functions As Hooks. * Hooks, normal: Normal Hooks. * Implicitly Interpreting rep scripts: Invocation. * Infinite lists: Infinite Lists. * Input and output: Streams. * Input functions: Input Functions. * Input streams: Input Streams. * Integer functions: Integer Functions. * Integers: Numbers. * Interface, C: librep Internals. * Internals: librep Internals. * Internals, data types: Data Type Representation. * Internals, defining subrs: Defining Lisp Subrs. * Internals, garbage collection: Garbage Collection Internals. * Internals, introduction to: Intro To Internals. * Internals, useful functions: Useful Functions. * Internationalisation: i18n. * Interning: Interning. * Introduction: Introduction. * Introduction to librep internals: Intro To Internals. * Introduction, Lisp: Intro. * Invocation: Invocation. * Keyword symbols: Keyword Symbols. * Lambda expressions: Lambda Expressions. * Libraries, shared: Shared Libraries. * librep internals: librep Internals. * librep Internals: librep Internals. * Licence: Copying. * Lisp forms, evaluating: Evaluation. * Lisp, the rep dialect: The language. * List forms: List Forms. * List structure: List Structure. * Lists: Lists. * Lists, accessing elements: Accessing List Elements. * Lists, association: Association Lists. * Lists, building: Building Lists. * Lists, circular: Infinite Lists. * Lists, mapping: Mapping Functions. * Lists, modifying: Modifying Lists. * Load function: Load Function. * Loading: Loading. * Loading programs: Loading. * Loading, on reference: Autoloading. * Local functions: Local Functions. * Local variables: Local Variables. * Looping structures: Looping Structures. * Macro call forms: Macro Call Forms. * Macro expansion: Macro Expansion. * Macros: Macros. * Macros, backquoting: Backquoting. * Macros, compiling: Compiling Macros. * Macros, defining: Defining Macros. * Manipulating files: Manipulating Files. * Manipulating Symbolic Links: Manipulating Symlinks. * Manipulating threads: Manipulating Threads. * Manual notation: Notation. * Mapping functions: Mapping Functions. * Matching strings: Regexp Functions. * Mathematical functions: Mathematical Functions. * Messages: Messages. * Modifying lists: Modifying Lists. * Modules: Modules. * Modules, and special variables: Modules and Special Variables. * Modules, definition of: Module Definition. * Modules, interfaces: Module Interfaces. * Modules, loading: Module Loading. * Mutexes: Mutexes. * Mutual exclusion devices: Mutexes. * Names of files: File Names. * News: News. * nil and t: nil and t. * Non-local exits: Non-Local Exits. * Non-local exits, catch and throw: Catch and Throw. * Non-local exits, cleanup forms: Cleanup Forms. * Non-local exits, errors: Errors. * Non-local exits, function exits: Function Exits. * Normal hooks: Normal Hooks. * Notation: Notation. * Numbers: Numbers. * Numbers, arithmetic functions: Arithmetic Functions. * Numbers, bitwise functions: Bitwise Functions. * Numbers, integer functions: Integer Functions. * Numbers, mathematical functions: Mathematical Functions. * Numbers, predicates on: Numeric Predicates. * Numbers, pseudo random: Random Numbers. * Numbers, rational functions: Rational Functions. * Numbers, real number functions: Real Number Functions. * Numeric predicates: Numeric Predicates. * Obarrays: Obarrays. * Options, command line: Command Line Options. * Output functions: Output Functions. * Output streams: Output Streams. * Output, formatted: Formatted Output. * Parsing dates: Parsing Dates. * Predicate functions: Predicate Functions. * Predicates on numbers: Numeric Predicates. * Predicates, comparison: Comparison Predicates. * Predicates, equality: Equality Predicates. * Predicates, type: Type Predicates. * Printed representation: Printed Representation. * Process I/O: Process I/O. * Process information: Process Information. * Process objects: Process Objects. * Process states: Process States. * Processes: Processes. * Processes, asynchronous: Asynchronous Processes. * Processes, signalling: Signalling Processes. * Processes, synchronous: Synchronous Processes. * Programs, loading: Loading. * Property lists: Property Lists. * Pseudo-random numbers: Random Numbers. * Queues: Queues. * Quoting: Quoting. * Random numbers: Random Numbers. * Rational functions: Rational Functions. * Read syntax: Read Syntax. * Read-eval-print loop: The REPL. * Reader, the Lisp: The Lisp Reader. * Reading directories: Manipulating Directories. * Real number functions: Real Number Functions. * Records: Records. * Regexp functions: Regexp Functions. * Regexp syntax: Regexp Syntax. * Regexps: Regular Expressions. * Regular expression syntax: Regexp Syntax. * Regular expressions: Regular Expressions. * Remote files: Remote Files. * rep, the Lisp dialect: The language. * Reporting bugs: Reporting bugs. * Representation of data types: Data Type Representation. * Scope and extent: Scope and Extent. * Scripts, executing implicitly: Invocation. * Self-evaluating forms: Self-Evaluating Forms. * Sequence functions: Sequence Functions. * Sequences: Sequences. * Sequences, cons cells: Cons Cells. * Sequencing structures: Sequencing Structures. * Setting variables: Setting Variables. * Shared libraries: Shared Libraries. * Shell commands, executing: Shell Commands. * Signalling processes: Signalling Processes. * Sleeping: Sleeping. * Special forms: Special Forms. * Streams: Streams. * Streams, formatted output: Formatted Output. * Streams, input: Input Streams. * Streams, input functions: Input Functions. * Streams, output: Output Streams. * Streams, output functions: Output Functions. * String functions: String Functions. * String matching: Regexp Functions. * Strings, escape sequences: Strings. * Style, comments: Comment Styles. * Subprocesses: Processes. * Subrs, defining: Defining Lisp Subrs. * Symbol attributes: Symbol Attributes. * Symbol forms: Symbol Forms. * Symbol syntax: Symbol Syntax. * Symbolic Links, manipulating: Manipulating Symlinks. * Symbols: Symbols. * Symbols, creating: Creating Symbols. * Symbols, interning: Interning. * Symbols, keywords: Keyword Symbols. * Symbols, obarrays: Obarrays. * Symbols, property lists: Property Lists. * Synchronous processes: Synchronous Processes. * Syntax of objects: Read Syntax. * Syntax of regexps: Regexp Syntax. * System information: System Information. * t: nil and t. * The language: The language. * The Lisp reader: The Lisp Reader. * The REPL: The REPL. * Thread contexts: Thread Contexts. * Thread implementation notes: Thread Implementation Notes. * Threads: Threads. * Threads, creating: Creating Threads. * Threads, deleting: Deleting Threads. * Threads, manipulating: Manipulating Threads. * Threads, mutexes: Mutexes. * Time and date: Time and Date. * Time, formatting as strings: Formatting Dates. * Time, parsing: Parsing Dates. * Timers, asynchronous: Timers. * Timestamps: Timestamps. * Tips: Tips. * Tips, comment styles: Comment Styles. * Tips, compilation: Compilation Tips. * Type predicates: Type Predicates. * Types summary: Types Summary. * Useful functions: Useful Functions. * User information: User Information. * Variables: Variables. * Variables, defining: Defining Variables. * Variables, descriptions of: Descriptions. * Variables, fluid: Fluid Variables. * Variables, local: Local Variables. * Variables, scope and extent of: Scope and Extent. * Variables, setting: Setting Variables. * Variables, void: Void Variables. * Void variables: Void Variables.