From 334c1249b3a0375f2332df574978a10880174442 Mon Sep 17 00:00:00 2001
From: Sam Fredrickson <kinghajj@gmail.com>
Date: Thu, 13 Mar 2008 21:24:23 -0700
Subject: [PATCH] Initial commit of newLISP.

---
 Makefile                                      |   415 +
 README                                        |    99 +
 build                                         |    66 +
 configure                                     |    71 +
 doc/._CodePatterns.html                       |   Bin 0 -> 255 bytes
 doc/CHANGES                                   |  4180 ++++
 doc/COPYING                                   |  1157 +
 doc/CREDITS                                   |   150 +
 doc/CodePatterns.html                         |  3573 ++++
 doc/ExpressionEvaluation.html                 |   404 +
 doc/FILES                                     |   161 +
 doc/INSTALL                                   |   169 +
 doc/LOCALIZATION                              |    41 +
 doc/License.html                              |   778 +
 doc/MemoryManagement.html                     |   242 +
 doc/TRU64BUILD                                |    14 +
 doc/manual_frame.html                         |    15 +
 doc/newLISP-9.3-Release.html                  |   208 +
 doc/newLISPdoc.html                           |   314 +
 doc/newlisp.1                                 |   102 +
 doc/newlisp_index.html                        |   510 +
 doc/newlisp_manual.html                       | 27373 ++++++++++++++++++++++++
 doc/newlispdoc-man.txt                        |    69 +
 doc/newlispdoc.1                              |    48 +
 examples/client                               |    37 +
 examples/finger                               |    35 +
 examples/form.cgi                             |    36 +
 examples/form.html                            |    35 +
 examples/init.lsp.example                     |    61 +
 examples/newLISP-Excel-Import.xls             |   Bin 0 -> 26624 bytes
 examples/opengl-demo.lsp                      |   166 +
 examples/prodcons.lsp                         |    53 +
 examples/server                               |    41 +
 examples/sqlite.cgi                           |    95 +
 examples/sqlite3.cgi                          |    94 +
 examples/syntax.cgi                           |   193 +
 examples/tcltk.lsp                            |    49 +
 examples/udp-client.lsp                       |    20 +
 examples/udp-server.lsp                       |    22 +
 examples/upload.cgi                           |    61 +
 examples/upload.html                          |    14 +
 examples/xmlrpc.cgi                           |   223 +
 guiserver/CHANGES                             |   802 +
 guiserver/COPYING                             |  1046 +
 guiserver/Makefile                            |    18 +
 guiserver/Manifest                            |     1 +
 guiserver/allfonts-demo.lsp                   |    43 +
 guiserver/animation-demo.lsp                  |    57 +
 guiserver/border-layout-demo.lsp              |    32 +
 guiserver/button-demo.lsp                     |    36 +
 guiserver/clipboard-demo.lsp                  |    27 +
 guiserver/cursor-demo.lsp                     |    47 +
 guiserver/drag-demo.lsp                       |    83 +
 guiserver/editor.txt                          |    32 +
 guiserver/font-demo.lsp                       |    61 +
 guiserver/frameless-demo.lsp                  |    28 +
 guiserver/guiserver.jar                       |   Bin 0 -> 281685 bytes
 guiserver/guiserver.lsp                       |  3122 +++
 guiserver/guiserver.lsp.html                  |  2588 +++
 guiserver/html-demo.lsp                       |    56 +
 guiserver/image-demo.lsp                      |    66 +
 guiserver/images/.DS_Store                    |   Bin 0 -> 15364 bytes
 guiserver/images/change-name                  |     2 +
 guiserver/images/clear-down32.png             |   Bin 0 -> 2303 bytes
 guiserver/images/clear32.png                  |   Bin 0 -> 2172 bytes
 guiserver/images/copy-down32.png              |   Bin 0 -> 1384 bytes
 guiserver/images/copy32.png                   |   Bin 0 -> 1444 bytes
 guiserver/images/cut-down32.png               |   Bin 0 -> 1651 bytes
 guiserver/images/cut32.png                    |   Bin 0 -> 1344 bytes
 guiserver/images/dotgray16.png                |   Bin 0 -> 3413 bytes
 guiserver/images/dotgray32.png                |   Bin 0 -> 3454 bytes
 guiserver/images/dotgreen16.png               |   Bin 0 -> 3530 bytes
 guiserver/images/dotgreen32.png               |   Bin 0 -> 3634 bytes
 guiserver/images/dotred16.png                 |   Bin 0 -> 3528 bytes
 guiserver/images/dotred32.png                 |   Bin 0 -> 3645 bytes
 guiserver/images/dotyellow16.png              |   Bin 0 -> 3521 bytes
 guiserver/images/dotyellow32.png              |   Bin 0 -> 3560 bytes
 guiserver/images/edit-down32.png              |   Bin 0 -> 1701 bytes
 guiserver/images/edit32.png                   |   Bin 0 -> 1547 bytes
 guiserver/images/folder-closed-down32.png     |   Bin 0 -> 1478 bytes
 guiserver/images/folder-closed32.png          |   Bin 0 -> 1471 bytes
 guiserver/images/folder-opened-down32.png     |   Bin 0 -> 2075 bytes
 guiserver/images/folder-opened32.png          |   Bin 0 -> 2024 bytes
 guiserver/images/font-book-down32.png         |   Bin 0 -> 1849 bytes
 guiserver/images/font-book32.png              |   Bin 0 -> 1966 bytes
 guiserver/images/green10.png                  |   Bin 0 -> 726 bytes
 guiserver/images/info-down32.png              |   Bin 0 -> 2380 bytes
 guiserver/images/info32.png                   |   Bin 0 -> 2409 bytes
 guiserver/images/new-down32.png               |   Bin 0 -> 1347 bytes
 guiserver/images/new32.png                    |   Bin 0 -> 1107 bytes
 guiserver/images/newLISP-down32.png           |   Bin 0 -> 2603 bytes
 guiserver/images/newLISP128.png               |   Bin 0 -> 18206 bytes
 guiserver/images/newLISP16.png                |   Bin 0 -> 3586 bytes
 guiserver/images/newLISP20.png                |   Bin 0 -> 3885 bytes
 guiserver/images/newLISP32.png                |   Bin 0 -> 2657 bytes
 guiserver/images/newLISP64.png                |   Bin 0 -> 7154 bytes
 guiserver/images/paste-down32.png             |   Bin 0 -> 2039 bytes
 guiserver/images/paste32.png                  |   Bin 0 -> 2103 bytes
 guiserver/images/pressedbutton32.png          |   Bin 0 -> 3223 bytes
 guiserver/images/red10.png                    |   Bin 0 -> 728 bytes
 guiserver/images/restart-down32.png           |   Bin 0 -> 2549 bytes
 guiserver/images/restart32.png                |   Bin 0 -> 2578 bytes
 guiserver/images/run-down32.png               |   Bin 0 -> 2423 bytes
 guiserver/images/run16.png                    |   Bin 0 -> 3582 bytes
 guiserver/images/run32.png                    |   Bin 0 -> 2483 bytes
 guiserver/images/save-down32.png              |   Bin 0 -> 1762 bytes
 guiserver/images/save32.png                   |   Bin 0 -> 1534 bytes
 guiserver/images/search-down32.png            |   Bin 0 -> 2473 bytes
 guiserver/images/search32.png                 |   Bin 0 -> 2551 bytes
 guiserver/images/stop-down32.png              |   Bin 0 -> 1669 bytes
 guiserver/images/stop32.png                   |   Bin 0 -> 1586 bytes
 guiserver/images/web32.png                    |   Bin 0 -> 4501 bytes
 guiserver/index.html                          |    51 +
 guiserver/java/ArcShape.java                  |    75 +
 guiserver/java/Base64Coder.java               |   148 +
 guiserver/java/ButtonWidget.java              |    79 +
 guiserver/java/CanvasWidget.java              |   815 +
 guiserver/java/CheckBoxWidget.java            |    80 +
 guiserver/java/CircleShape.java               |    69 +
 guiserver/java/ComboBoxWidget.java            |   111 +
 guiserver/java/DialogWidget.java              |   231 +
 guiserver/java/Dispatcher.java                |   306 +
 guiserver/java/EllipseShape.java              |    71 +
 guiserver/java/ErrorDialog.java               |    72 +
 guiserver/java/FilledArcShape.java            |    77 +
 guiserver/java/FilledCircleShape.java         |    70 +
 guiserver/java/FilledEllipseShape.java        |    72 +
 guiserver/java/FilledPolygonShape.java        |   103 +
 guiserver/java/FilledRectangle.java           |    79 +
 guiserver/java/FilledRectangleShape.java      |    70 +
 guiserver/java/FilledRoundRectShape.java      |    81 +
 guiserver/java/FilledRoundRectangleShape.java |    78 +
 guiserver/java/FilterFileReader.java          |    71 +
 guiserver/java/ImageButtonWidget.java         |    94 +
 guiserver/java/ImageLabelWidget.java          |    82 +
 guiserver/java/ImageShape.java                |    97 +
 guiserver/java/LabelWidget.java               |   108 +
 guiserver/java/LayoutBorder.java              |    53 +
 guiserver/java/LayoutFlow.java                |    64 +
 guiserver/java/LayoutGrid.java                |    57 +
 guiserver/java/LineShape.java                 |    73 +
 guiserver/java/ListBoxWidget.java             |   186 +
 guiserver/java/ListenerThread.java            |    52 +
 guiserver/java/MenuBarWidget.java             |    63 +
 guiserver/java/MenuItemCheckWidget.java       |   134 +
 guiserver/java/MenuItemWidget.java            |    94 +
 guiserver/java/MenuWidget.java                |    54 +
 guiserver/java/MyDocumentFilter.java          |    57 +
 guiserver/java/MyFileFilter.java              |    63 +
 guiserver/java/OSXAdapter.java                |    84 +
 guiserver/java/PanelWidget.java               |    59 +
 guiserver/java/PathShape.java                 |    87 +
 guiserver/java/PolygonShape.java              |   105 +
 guiserver/java/PopupMenuWidget.java           |    71 +
 guiserver/java/ProgressBarWidget.java         |    58 +
 guiserver/java/RadioButtonWidget.java         |    76 +
 guiserver/java/RectangleShape.java            |    75 +
 guiserver/java/RoundRectShape.java            |    79 +
 guiserver/java/RoundRectangleShape.java       |    78 +
 guiserver/java/ScrollPaneWidget.java          |    62 +
 guiserver/java/Shape.java                     |    65 +
 guiserver/java/SliderWidget.java              |    76 +
 guiserver/java/SoundSystem.java               |    91 +
 guiserver/java/SplashWindow.java              |    75 +
 guiserver/java/SplitPaneWidget.java           |    81 +
 guiserver/java/SyntaxHighlighter.java         |   294 +
 guiserver/java/SyntaxHighlighterC.java        |   314 +
 guiserver/java/TabbedPaneWidget.java          |   169 +
 guiserver/java/TextAreaWidget.java            |   381 +
 guiserver/java/TextFieldWidget.java           |    84 +
 guiserver/java/TextPaneWidget.java            |   614 +
 guiserver/java/TextShape.java                 |    89 +
 guiserver/java/ToggleButtonWidget.java        |    76 +
 guiserver/java/ToolbarWidget.java             |    67 +
 guiserver/java/WindowFrame.java               |   397 +
 guiserver/java/WindowWidget.java              |   114 +
 guiserver/java/aButton.java                   |    93 +
 guiserver/java/aTextWidget.java               |   319 +
 guiserver/java/gsObject.java                  |   844 +
 guiserver/java/guiserver.java                 |   339 +
 guiserver/java/java                           |     4 +
 guiserver/mouse-demo.lsp                      |    75 +
 guiserver/move-resize-demo.lsp                |    42 +
 guiserver/newlisp-edit.lsp                    |  1405 ++
 guiserver/newlisp-gs.nsi                      |   462 +
 guiserver/newlisp-gs.nsi.bak                  |   462 +
 guiserver/newlisp-win.ico                     |   Bin 0 -> 19518 bytes
 guiserver/pinballs-demo.lsp                   |   116 +
 guiserver/properties-demo.lsp                 |    33 +
 guiserver/rotation-demo.lsp                   |    66 +
 guiserver/shapes-demo.lsp                     |   122 +
 guiserver/sound-demo.lsp                      |    35 +
 guiserver/stroke-demo.lsp                     |   100 +
 guiserver/tabs-demo.lsp                       |    91 +
 guiserver/textrot-demo.lsp                    |    42 +
 guiserver/uppercase.lsp                       |     6 +
 guiserver/widgets-demo.lsp                    |   161 +
 guiserver/word-count.lsp                      |    10 +
 makefile_bsd                                  |    25 +
 makefile_bsd_IPv6                             |    25 +
 makefile_bsd_lib                              |    18 +
 makefile_bsd_utf8                             |    23 +
 makefile_darwin                               |    25 +
 makefile_darwinLP64                           |    25 +
 makefile_darwin_i386                          |    26 +
 makefile_darwin_lib                           |    23 +
 makefile_darwin_utf8                          |    22 +
 makefile_darwin_utf8_IPv6                     |    22 +
 makefile_debian                               |    26 +
 makefile_linux                                |    26 +
 makefile_linux64                              |    23 +
 makefile_linux64ILP32                         |    23 +
 makefile_linux64LP64                          |    23 +
 makefile_linux64LP64_utf8                     |    23 +
 makefile_linux64_lib                          |    23 +
 makefile_linux_IPv6                           |    26 +
 makefile_linux_lib                            |    23 +
 makefile_linux_lib_utf8                       |    23 +
 makefile_linux_readline                       |    27 +
 makefile_linux_utf8                           |    27 +
 makefile_linux_utf8_readline                  |    26 +
 makefile_mingw                                |    21 +
 makefile_mingw_utf8                           |    21 +
 makefile_mingwdll                             |    22 +
 makefile_mingwdll_utf8                        |    23 +
 makefile_netbsd                               |    23 +
 makefile_os2                                  |    21 +
 makefile_osx_package                          |    97 +
 makefile_solaris                              |    18 +
 makefile_solarisLP64                          |    18 +
 makefile_solaris_utf8                         |    21 +
 makefile_tru64                                |    25 +
 makefile_universal                            |    27 +
 makefile_universal_utf8                       |    29 +
 makefile_wings                                |    82 +
 modules/README.txt                            |    19 +
 modules/TEST                                  |   Bin 0 -> 2048 bytes
 modules/cgi.lsp                               |   188 +
 modules/crypto.lsp                            |   118 +
 modules/ftp.lsp                               |   139 +
 modules/gmp.lsp                               |   551 +
 modules/index.html                            |    51 +
 modules/infix.lsp                             |   135 +
 modules/mysql.lsp                             |   249 +
 modules/mysql5.lsp                            |   383 +
 modules/mysql51.lsp                           |   383 +
 modules/odbc.lsp                              |   531 +
 modules/pop3.lsp                              |   307 +
 modules/pop3.lsp.html                         |   172 +
 modules/postscript.lsp                        |   975 +
 modules/smtp.lsp                              |   100 +
 modules/sqlite3.lsp                           |   372 +
 modules/stat.lsp                              |   583 +
 modules/unix.lsp                              |   247 +
 modules/urlfiles                              |     2 +
 modules/winscript.lsp.html                    |   188 +
 modules/xmlrpc-client.lsp                     |   215 +
 modules/zlib.lsp                              |   113 +
 newlisp.c                                     |  6147 ++++++
 newlisp.h                                     |   483 +
 nl-debug.c                                    |   419 +
 nl-filesys.c                                  |  2281 ++
 nl-import.c                                   |   406 +
 nl-list.c                                     |  2093 ++
 nl-liststr.c                                  |  1685 ++
 nl-math.c                                     |  2921 +++
 nl-matrix.c                                   |   769 +
 nl-sock.c                                     |  2161 ++
 nl-string.c                                   |  2239 ++
 nl-symbol.c                                   |   815 +
 nl-utf8.c                                     |   263 +
 nl-web.c                                      |  1288 ++
 nl-xml.c                                      |   667 +
 pcre-chartables.c                             |   183 +
 pcre-config.h                                 |   108 +
 pcre-internal.h                               |   752 +
 pcre.c                                        |  9195 ++++++++
 pcre.h                                        |   239 +
 primes.h                                      |   391 +
 protos.h                                      |   606 +
 qa-comma                                      |  3234 +++
 qa-dot                                        |  3208 +++
 qa-lfs                                        |    28 +
 qa-local-domain                               |    41 +
 qa-net                                        |   131 +
 qa-setsig                                     |    72 +
 qa-utf16path.lsp                              |   107 +
 qa-utf8                                       |   128 +
 qa-xml                                        |   138 +
 unix-lib.c                                    |    85 +
 util/._newlisp.vim                            |   Bin 0 -> 443 bytes
 util/debug                                    |     1 +
 util/httpd-conf.lsp                           |    62 +
 util/link.lsp                                 |    87 +
 util/make-osx-images                          |     4 +
 util/nclocal.c                                |    98 +
 util/newlisp.vim                              |   222 +
 util/newlispdoc                               |   496 +
 util/pagetest.txt                             |   251 +
 util/preparepdf                               |    26 +
 util/sql.c                                    |    73 +
 util/standard.lsp                             |     3 +
 util/syntax-help                              |    21 +
 util/syntax.cgi                               |   193 +
 util/types.c                                  |    99 +
 win32-path.c                                  |   296 +
 win32-util.c                                  |   302 +
 win32dll.c                                    |   131 +
 win32dll.def                                  |     8 +
 309 files changed, 115007 insertions(+)
 create mode 100644 Makefile
 create mode 100644 README
 create mode 100755 build
 create mode 100755 configure
 create mode 100644 doc/._CodePatterns.html
 create mode 100644 doc/CHANGES
 create mode 100644 doc/COPYING
 create mode 100644 doc/CREDITS
 create mode 100644 doc/CodePatterns.html
 create mode 100644 doc/ExpressionEvaluation.html
 create mode 100644 doc/FILES
 create mode 100644 doc/INSTALL
 create mode 100644 doc/LOCALIZATION
 create mode 100644 doc/License.html
 create mode 100644 doc/MemoryManagement.html
 create mode 100644 doc/TRU64BUILD
 create mode 100644 doc/manual_frame.html
 create mode 100644 doc/newLISP-9.3-Release.html
 create mode 100644 doc/newLISPdoc.html
 create mode 100644 doc/newlisp.1
 create mode 100644 doc/newlisp_index.html
 create mode 100644 doc/newlisp_manual.html
 create mode 100644 doc/newlispdoc-man.txt
 create mode 100644 doc/newlispdoc.1
 create mode 100755 examples/client
 create mode 100755 examples/finger
 create mode 100755 examples/form.cgi
 create mode 100644 examples/form.html
 create mode 100755 examples/init.lsp.example
 create mode 100755 examples/newLISP-Excel-Import.xls
 create mode 100644 examples/opengl-demo.lsp
 create mode 100644 examples/prodcons.lsp
 create mode 100755 examples/server
 create mode 100755 examples/sqlite.cgi
 create mode 100755 examples/sqlite3.cgi
 create mode 100755 examples/syntax.cgi
 create mode 100644 examples/tcltk.lsp
 create mode 100644 examples/udp-client.lsp
 create mode 100644 examples/udp-server.lsp
 create mode 100755 examples/upload.cgi
 create mode 100644 examples/upload.html
 create mode 100755 examples/xmlrpc.cgi
 create mode 100644 guiserver/CHANGES
 create mode 100644 guiserver/COPYING
 create mode 100644 guiserver/Makefile
 create mode 100644 guiserver/Manifest
 create mode 100644 guiserver/allfonts-demo.lsp
 create mode 100644 guiserver/animation-demo.lsp
 create mode 100644 guiserver/border-layout-demo.lsp
 create mode 100644 guiserver/button-demo.lsp
 create mode 100644 guiserver/clipboard-demo.lsp
 create mode 100644 guiserver/cursor-demo.lsp
 create mode 100644 guiserver/drag-demo.lsp
 create mode 100644 guiserver/editor.txt
 create mode 100644 guiserver/font-demo.lsp
 create mode 100644 guiserver/frameless-demo.lsp
 create mode 100644 guiserver/guiserver.jar
 create mode 100644 guiserver/guiserver.lsp
 create mode 100644 guiserver/guiserver.lsp.html
 create mode 100644 guiserver/html-demo.lsp
 create mode 100644 guiserver/image-demo.lsp
 create mode 100644 guiserver/images/.DS_Store
 create mode 100644 guiserver/images/change-name
 create mode 100644 guiserver/images/clear-down32.png
 create mode 100644 guiserver/images/clear32.png
 create mode 100644 guiserver/images/copy-down32.png
 create mode 100644 guiserver/images/copy32.png
 create mode 100644 guiserver/images/cut-down32.png
 create mode 100644 guiserver/images/cut32.png
 create mode 100644 guiserver/images/dotgray16.png
 create mode 100644 guiserver/images/dotgray32.png
 create mode 100644 guiserver/images/dotgreen16.png
 create mode 100644 guiserver/images/dotgreen32.png
 create mode 100644 guiserver/images/dotred16.png
 create mode 100644 guiserver/images/dotred32.png
 create mode 100644 guiserver/images/dotyellow16.png
 create mode 100644 guiserver/images/dotyellow32.png
 create mode 100644 guiserver/images/edit-down32.png
 create mode 100644 guiserver/images/edit32.png
 create mode 100644 guiserver/images/folder-closed-down32.png
 create mode 100644 guiserver/images/folder-closed32.png
 create mode 100644 guiserver/images/folder-opened-down32.png
 create mode 100644 guiserver/images/folder-opened32.png
 create mode 100644 guiserver/images/font-book-down32.png
 create mode 100644 guiserver/images/font-book32.png
 create mode 100644 guiserver/images/green10.png
 create mode 100644 guiserver/images/info-down32.png
 create mode 100644 guiserver/images/info32.png
 create mode 100644 guiserver/images/new-down32.png
 create mode 100644 guiserver/images/new32.png
 create mode 100644 guiserver/images/newLISP-down32.png
 create mode 100644 guiserver/images/newLISP128.png
 create mode 100644 guiserver/images/newLISP16.png
 create mode 100644 guiserver/images/newLISP20.png
 create mode 100644 guiserver/images/newLISP32.png
 create mode 100644 guiserver/images/newLISP64.png
 create mode 100644 guiserver/images/paste-down32.png
 create mode 100644 guiserver/images/paste32.png
 create mode 100644 guiserver/images/pressedbutton32.png
 create mode 100644 guiserver/images/red10.png
 create mode 100644 guiserver/images/restart-down32.png
 create mode 100644 guiserver/images/restart32.png
 create mode 100644 guiserver/images/run-down32.png
 create mode 100644 guiserver/images/run16.png
 create mode 100644 guiserver/images/run32.png
 create mode 100644 guiserver/images/save-down32.png
 create mode 100644 guiserver/images/save32.png
 create mode 100644 guiserver/images/search-down32.png
 create mode 100644 guiserver/images/search32.png
 create mode 100644 guiserver/images/stop-down32.png
 create mode 100644 guiserver/images/stop32.png
 create mode 100644 guiserver/images/web32.png
 create mode 100644 guiserver/index.html
 create mode 100644 guiserver/java/ArcShape.java
 create mode 100644 guiserver/java/Base64Coder.java
 create mode 100644 guiserver/java/ButtonWidget.java
 create mode 100644 guiserver/java/CanvasWidget.java
 create mode 100644 guiserver/java/CheckBoxWidget.java
 create mode 100644 guiserver/java/CircleShape.java
 create mode 100644 guiserver/java/ComboBoxWidget.java
 create mode 100644 guiserver/java/DialogWidget.java
 create mode 100644 guiserver/java/Dispatcher.java
 create mode 100644 guiserver/java/EllipseShape.java
 create mode 100644 guiserver/java/ErrorDialog.java
 create mode 100644 guiserver/java/FilledArcShape.java
 create mode 100644 guiserver/java/FilledCircleShape.java
 create mode 100644 guiserver/java/FilledEllipseShape.java
 create mode 100644 guiserver/java/FilledPolygonShape.java
 create mode 100644 guiserver/java/FilledRectangle.java
 create mode 100644 guiserver/java/FilledRectangleShape.java
 create mode 100644 guiserver/java/FilledRoundRectShape.java
 create mode 100644 guiserver/java/FilledRoundRectangleShape.java
 create mode 100644 guiserver/java/FilterFileReader.java
 create mode 100644 guiserver/java/ImageButtonWidget.java
 create mode 100644 guiserver/java/ImageLabelWidget.java
 create mode 100644 guiserver/java/ImageShape.java
 create mode 100644 guiserver/java/LabelWidget.java
 create mode 100644 guiserver/java/LayoutBorder.java
 create mode 100644 guiserver/java/LayoutFlow.java
 create mode 100644 guiserver/java/LayoutGrid.java
 create mode 100644 guiserver/java/LineShape.java
 create mode 100644 guiserver/java/ListBoxWidget.java
 create mode 100644 guiserver/java/ListenerThread.java
 create mode 100644 guiserver/java/MenuBarWidget.java
 create mode 100644 guiserver/java/MenuItemCheckWidget.java
 create mode 100644 guiserver/java/MenuItemWidget.java
 create mode 100644 guiserver/java/MenuWidget.java
 create mode 100644 guiserver/java/MyDocumentFilter.java
 create mode 100644 guiserver/java/MyFileFilter.java
 create mode 100644 guiserver/java/OSXAdapter.java
 create mode 100644 guiserver/java/PanelWidget.java
 create mode 100644 guiserver/java/PathShape.java
 create mode 100644 guiserver/java/PolygonShape.java
 create mode 100644 guiserver/java/PopupMenuWidget.java
 create mode 100644 guiserver/java/ProgressBarWidget.java
 create mode 100644 guiserver/java/RadioButtonWidget.java
 create mode 100644 guiserver/java/RectangleShape.java
 create mode 100644 guiserver/java/RoundRectShape.java
 create mode 100644 guiserver/java/RoundRectangleShape.java
 create mode 100644 guiserver/java/ScrollPaneWidget.java
 create mode 100644 guiserver/java/Shape.java
 create mode 100644 guiserver/java/SliderWidget.java
 create mode 100644 guiserver/java/SoundSystem.java
 create mode 100644 guiserver/java/SplashWindow.java
 create mode 100644 guiserver/java/SplitPaneWidget.java
 create mode 100644 guiserver/java/SyntaxHighlighter.java
 create mode 100644 guiserver/java/SyntaxHighlighterC.java
 create mode 100644 guiserver/java/TabbedPaneWidget.java
 create mode 100644 guiserver/java/TextAreaWidget.java
 create mode 100644 guiserver/java/TextFieldWidget.java
 create mode 100644 guiserver/java/TextPaneWidget.java
 create mode 100644 guiserver/java/TextShape.java
 create mode 100644 guiserver/java/ToggleButtonWidget.java
 create mode 100644 guiserver/java/ToolbarWidget.java
 create mode 100644 guiserver/java/WindowFrame.java
 create mode 100644 guiserver/java/WindowWidget.java
 create mode 100644 guiserver/java/aButton.java
 create mode 100644 guiserver/java/aTextWidget.java
 create mode 100644 guiserver/java/gsObject.java
 create mode 100644 guiserver/java/guiserver.java
 create mode 100644 guiserver/java/java
 create mode 100644 guiserver/mouse-demo.lsp
 create mode 100644 guiserver/move-resize-demo.lsp
 create mode 100644 guiserver/newlisp-edit.lsp
 create mode 100644 guiserver/newlisp-gs.nsi
 create mode 100644 guiserver/newlisp-gs.nsi.bak
 create mode 100644 guiserver/newlisp-win.ico
 create mode 100644 guiserver/pinballs-demo.lsp
 create mode 100644 guiserver/properties-demo.lsp
 create mode 100644 guiserver/rotation-demo.lsp
 create mode 100644 guiserver/shapes-demo.lsp
 create mode 100644 guiserver/sound-demo.lsp
 create mode 100644 guiserver/stroke-demo.lsp
 create mode 100644 guiserver/tabs-demo.lsp
 create mode 100644 guiserver/textrot-demo.lsp
 create mode 100644 guiserver/uppercase.lsp
 create mode 100644 guiserver/widgets-demo.lsp
 create mode 100644 guiserver/word-count.lsp
 create mode 100644 makefile_bsd
 create mode 100644 makefile_bsd_IPv6
 create mode 100644 makefile_bsd_lib
 create mode 100644 makefile_bsd_utf8
 create mode 100644 makefile_darwin
 create mode 100644 makefile_darwinLP64
 create mode 100644 makefile_darwin_i386
 create mode 100644 makefile_darwin_lib
 create mode 100644 makefile_darwin_utf8
 create mode 100644 makefile_darwin_utf8_IPv6
 create mode 100644 makefile_debian
 create mode 100644 makefile_linux
 create mode 100644 makefile_linux64
 create mode 100644 makefile_linux64ILP32
 create mode 100644 makefile_linux64LP64
 create mode 100644 makefile_linux64LP64_utf8
 create mode 100644 makefile_linux64_lib
 create mode 100644 makefile_linux_IPv6
 create mode 100644 makefile_linux_lib
 create mode 100644 makefile_linux_lib_utf8
 create mode 100644 makefile_linux_readline
 create mode 100644 makefile_linux_utf8
 create mode 100644 makefile_linux_utf8_readline
 create mode 100644 makefile_mingw
 create mode 100644 makefile_mingw_utf8
 create mode 100644 makefile_mingwdll
 create mode 100644 makefile_mingwdll_utf8
 create mode 100644 makefile_netbsd
 create mode 100644 makefile_os2
 create mode 100644 makefile_osx_package
 create mode 100644 makefile_solaris
 create mode 100644 makefile_solarisLP64
 create mode 100644 makefile_solaris_utf8
 create mode 100644 makefile_tru64
 create mode 100644 makefile_universal
 create mode 100644 makefile_universal_utf8
 create mode 100644 makefile_wings
 create mode 100644 modules/README.txt
 create mode 100644 modules/TEST
 create mode 100644 modules/cgi.lsp
 create mode 100644 modules/crypto.lsp
 create mode 100644 modules/ftp.lsp
 create mode 100644 modules/gmp.lsp
 create mode 100644 modules/index.html
 create mode 100644 modules/infix.lsp
 create mode 100644 modules/mysql.lsp
 create mode 100644 modules/mysql5.lsp
 create mode 100644 modules/mysql51.lsp
 create mode 100644 modules/odbc.lsp
 create mode 100644 modules/pop3.lsp
 create mode 100644 modules/pop3.lsp.html
 create mode 100644 modules/postscript.lsp
 create mode 100644 modules/smtp.lsp
 create mode 100644 modules/sqlite3.lsp
 create mode 100644 modules/stat.lsp
 create mode 100644 modules/unix.lsp
 create mode 100644 modules/urlfiles
 create mode 100644 modules/winscript.lsp.html
 create mode 100644 modules/xmlrpc-client.lsp
 create mode 100644 modules/zlib.lsp
 create mode 100644 newlisp.c
 create mode 100644 newlisp.h
 create mode 100644 nl-debug.c
 create mode 100644 nl-filesys.c
 create mode 100644 nl-import.c
 create mode 100644 nl-list.c
 create mode 100644 nl-liststr.c
 create mode 100644 nl-math.c
 create mode 100644 nl-matrix.c
 create mode 100644 nl-sock.c
 create mode 100644 nl-string.c
 create mode 100644 nl-symbol.c
 create mode 100644 nl-utf8.c
 create mode 100644 nl-web.c
 create mode 100644 nl-xml.c
 create mode 100644 pcre-chartables.c
 create mode 100644 pcre-config.h
 create mode 100644 pcre-internal.h
 create mode 100644 pcre.c
 create mode 100644 pcre.h
 create mode 100644 primes.h
 create mode 100644 protos.h
 create mode 100755 qa-comma
 create mode 100755 qa-dot
 create mode 100644 qa-lfs
 create mode 100755 qa-local-domain
 create mode 100755 qa-net
 create mode 100755 qa-setsig
 create mode 100644 qa-utf16path.lsp
 create mode 100755 qa-utf8
 create mode 100755 qa-xml
 create mode 100644 unix-lib.c
 create mode 100644 util/._newlisp.vim
 create mode 100644 util/debug
 create mode 100644 util/httpd-conf.lsp
 create mode 100644 util/link.lsp
 create mode 100644 util/make-osx-images
 create mode 100644 util/nclocal.c
 create mode 100644 util/newlisp.vim
 create mode 100755 util/newlispdoc
 create mode 100644 util/pagetest.txt
 create mode 100755 util/preparepdf
 create mode 100644 util/sql.c
 create mode 100644 util/standard.lsp
 create mode 100644 util/syntax-help
 create mode 100755 util/syntax.cgi
 create mode 100644 util/types.c
 create mode 100644 win32-path.c
 create mode 100644 win32-util.c
 create mode 100644 win32dll.c
 create mode 100644 win32dll.def

diff --git a/Makefile b/Makefile
new file mode 100644
index 0000000..4b972fb
--- /dev/null
+++ b/Makefile
@@ -0,0 +1,415 @@
+#
+# USAGE:
+#
+# make <option>
+#
+# to see a list of all options, enter 'make' without any options
+#
+# Note! on some systems do 'gmake' instead of 'make' (most BSD)
+#
+# for 'make install' you have to login as 'root' else do 'make install_home'
+# note that 'make install_home' will not install guiserver files which
+# must be in /usr/share/newlisp in MacOX X and UNIX machines
+#
+# to make the distribution archive:  'make dist'
+#
+# to clean up (delete .o *~ core etc.):  'make clean'
+#
+#
+# Compile flags used:
+#
+# NANOSLEEP enables capability to return time in milli secs in 'time'
+# READLINE enables commandline editing and history, requires readline lib
+# NOIMPPORT disables the 'import' shared library import primitive
+#
+# Regular expressions now on all platforms Perl Compatible Regular Expresssions PCRE
+# see http://www.pcre.org. PCRE can be localized to other languages than English
+# by generating different character tables, see documentation at www.pcre.org
+# and file LOCALIZATION for details
+#
+
+VERSION = 9.3.3
+INT_VERSION = 9303
+GUISERVER = /usr/share/newlisp/guiserver
+
+default:
+	./build
+
+help:
+	@echo "Do one of the following:"
+	@echo
+	@echo "  make linux           # newlisp for LINUX (tested Debian & Fedora)"
+	@echo "  make linux_utf8      # newlisp for LINUX UTF-8"
+	@echo "  make linux_readline  # newlisp for LINUX with readline support"
+	@echo "  make linux_debian    # newlisp for LINUX with readline support for debian"
+	@echo "  make linux_utf8_readline  # newlisp for LINUX UTF-8 with readline support"
+	@echo "  make linux_lib       # newlisp.so as shared library for LINUX"
+	@echo "  make linux_lib_utf8  # newlisp.so as shared library for LINUX with UTF-8"
+	@echo "  make linux64ILP32    # newlisp for LINUX 64 with 32-bit pointers / AMD64"
+	@echo "  make linux64LP64     # newlisp for LINUX 64 with 64-bit pointers / AMD64"
+	@echo "  make tru64           # newlisp for HP tru64 with 32 bit pointers - read doc/TRU64BUILD"
+	@echo "  make bsd             # newlisp for FreeBSD and OpenBSD"
+	@echo "  make netbsd          # newlisp for NetBSD (same as previous w/o readline)"
+	@echo "  make bsd_lib         # newlisp.so as shared library for FreeBSD, OpenBSD, NetBSD"
+	@echo "  make darwin          # newlisp for Mac OSX v.10.4 or later, readline support"
+	@echo "  make darwin_utf8     # newlisp for Mac OSX v.10.4 or later, readline and UTF-8 support"
+	@echo "  make darwin_lib      # newlisp for Mac OSX v.10.3 or later as shared library"
+	@echo "  make universal       # newlisp for Mac OSX v.10.3 universal version ppc+intel"
+	@echo "  make universal_utf8  # newlisp for Mac OSX v.10.3 universal version ppc+intel UTF-8"
+	@echo "  make solaris         # newLISP for Sun SOLARIS (tested on Sparc)"
+	@echo "  make solarisLP64     # newLISP for Sun SOLARIS 64-bit LP64 (tested on Sparc)"
+	@echo "  make solaris_utf8    # newLISP for Sun SOLARIS UTF-8 (tested on Sparc)"
+	@echo "  make true64          # newLISP for tru64 UNIX LP64 tested on Alpha CPU"
+	@echo "  make mingw           # newlisp.exe for Win32 (MinGW compiler)"
+	@echo "  make mingw_utf8      # newlisp.exe for Win32 UTF-8 (MinGW icompiler)"
+	@echo "  make mingwdll        # newlisp.dll for Win32 (MinGW compiler)"
+	@echo "  make mingwdll_utf8   # newlisp.dll for Win32 UTF-8 (MinGW compiler)"
+	@echo "  make os2             # newlisp for OS/2 GCC 3.3.5 with libc061.dll"
+	@echo 
+	@echo "  make install         # install on LINUX/UNIX in /usr/bin and /usr/share (need to be root)"
+	@echo "  make uninstall       # uninstall on LINUX/UNIX from /usr/bin and /usr/share (need to be root)"
+	@echo "  make install_home    # install on LINUX/UNIX in users home directory "
+	@echo "  make uninstall_home  # uninstall on LINUX/UNIX from users home directory "
+	@echo
+	@echo "  make clean           # remove all *.o and .tar files etc. USE BETWEEN FLAVORS!"
+	@echo "  make test            # run qa-dot, qa-net and qa-xml test scripts"
+	@echo
+	@echo "Note! on some systems use gmake instead of make"
+	@echo "readline is for commandline editing support and requires libreadline"
+	@echo "only installed by default on BSDs (FreeBSD, NetBSD, OpenBSD, MacOS X/Darwin)"
+	@echo "If there is no UTF-8 option for your OS, consult makefile_xxx"
+
+linux:
+	make -f makefile_linux
+
+linux_utf8:
+	make -f makefile_linux_utf8
+
+linux_readline:
+	make -f makefile_linux_readline
+
+linux_debian:
+	make -f makefile_debian
+
+debian:
+	make -f makefile_debian
+
+linux_utf8_readline:
+	make -f makefile_linux_utf8_readline
+
+debian_utf8:
+	make -f makefile_linux_utf8_readline
+
+linux_lib:
+	make -f makefile_linux_lib
+
+linux_lib_utf8:
+	make -f makefile_linux_lib_utf8
+
+linux64ILP32:
+	make -f makefile_linux64ILP32
+	
+linux64LP64:
+	make -f makefile_linux64LP64
+
+tru64:
+	make -f makefile_tru64
+
+bsd:
+	make -f makefile_bsd
+
+netbsd:
+	make -f makefile_netbsd
+
+bsd_lib:
+	make -f makefile_bsd_lib
+
+darwin_lib:
+	make -f makefile_darwin_lib
+
+universal:
+	make -f makefile_universal
+
+universal_utf8:
+	make -f makefile_universal_utf8
+
+darwin:
+	make -f makefile_darwin
+	
+darwin_utf8:
+	make -f makefile_darwin_utf8
+
+solaris:
+	make -f makefile_solaris
+
+solarisLP64:
+	make -f makefile_solarisLP64
+
+solaris_utf8:
+	make -f makefile_solaris_utf8
+
+mingw:
+	make -f makefile_mingw
+
+mingw_utf8:
+	make -f makefile_mingw_utf8
+
+mingwdll:
+	make -f makefile_mingwdll
+
+mingwdll_utf8:
+	make -f makefile_mingwdll_utf8
+
+os2: 
+	make -f makefile_os2 
+	
+winall:
+	make clean
+	make -f makefile_mingw
+	make clean
+	make -f makefile_mingwdll
+	make clean
+	./newlisp qa-dot
+
+winall_utf8:
+	make clean
+	make -f makefile_mingw_utf8
+	make clean
+	make -f makefile_mingwdll_utf8
+	make clean
+	./newlisp qa-dot
+
+
+wings:
+	make -f makefile_wings
+
+# this cleans up the distribution directory for a clean build
+clean:
+	-rm *~ *.bak *.o *.obj *.map core *.tgz TEST
+	-rm guiserver/*.class doc/*~ util/*~ examples/*~ modules/*~
+	-rm  doc/*.bak util/*.bak examples/*.bak modules/*.bak
+	-chmod 644 *.h *.c *.lsp Makefile makefile*
+	-chmod 755 build configure examples/*
+	-chmod 644 doc/* modules/*.lsp examples/*.lsp examples/*.html
+	-chmod 644 guiserver/*
+	-chmod 755 guiserver/images
+	-chmod 644 guiserver/images/*
+	-chmod 755 guiserver/java
+	-chmod 644 guiserver/java/*
+
+# run test scripts
+test:
+	./newlisp qa-dot
+	./newlisp qa-xml
+	./newlisp qa-setsig
+	./newlisp qa-net
+
+# directory definitions
+datadir=$(DESTDIR)/usr/share
+bindir=$(DESTDIR)/usr/bin
+mandir=$(DESTDIR)/usr/share/man
+
+GUISERVER = /usr/share/newlisp/guiserver
+
+# this is the standard install in /usr/bin and usr/share
+# which as to be done as 'root' with supersuser permissions
+# for an install in your home directory use make install_home
+#
+# One-line description for distribution packages: 
+# newLISP is a LISP like, general purpose scripting language. 
+#
+# Longer description for distribution packages: 
+# newLISP is a scripting language for developing web applications and programs 
+# in general and in the domains of artificial intelligence (AI) and statistics.
+
+install:
+	-install -d $(datadir)/newlisp
+	-install -d $(datadir)/newlisp/modules
+	-install -d $(datadir)/newlisp/util
+	-install -d $(datadir)/doc/newlisp
+	-install -m 755 newlisp $(bindir)/newlisp
+	-install -m 644 examples/init.lsp.example $(datadir)/newlisp/init.lsp.example
+	-install -m 755 util/newlispdoc $(bindir)/newlispdoc
+	-install -m 644 util/syntax.cgi $(datadir)/newlisp/util/syntax.cgi
+	-install -m 644 util/newlisp.vim $(datadir)/newlisp/util/newlisp.vim
+	-install -m 644 util/link.lsp $(datadir)/newlisp/util/link.lsp
+	-install -m 644 util/httpd-conf.lsp $(datadir)/newlisp/util/httpd-conf.lsp
+	-install -m 644 doc/COPYING $(datadir)/doc/newlisp/COPYING
+	-install -m 644 doc/CREDITS $(datadir)/doc/newlisp/CREDITS
+	-install -m 644 doc/newlisp_manual.html $(datadir)/doc/newlisp/newlisp_manual.html
+	-install -m 644 doc/newlisp_index.html $(datadir)/doc/newlisp/newlisp_index.html
+	-install -m 644 doc/manual_frame.html $(datadir)/doc/newlisp/manual_frame.html
+	-install -m 644 doc/CodePatterns.html $(datadir)/doc/newlisp/CodePatterns.html
+	-install -m 644 doc/newLISPdoc.html $(datadir)/doc/newlisp/newLISPdoc.html
+	-install -m 644 doc/newLISP-9.3-Release.html $(datadir)/doc/newlisp/newLISP-9.3-Release.html
+	-install -m 644 doc/newlisp.1 $(mandir)/man1/newlisp.1
+	-install -m 644 doc/newlispdoc.1 $(mandir)/man1/newlispdoc.1
+	-install -m 644 modules/cgi.lsp $(datadir)/newlisp/modules/cgi.lsp
+	-install -m 644 modules/crypto.lsp $(datadir)/newlisp/modules/crypto.lsp
+	-install -m 644 modules/ftp.lsp $(datadir)/newlisp/modules/ftp.lsp
+	-install -m 644 modules/gmp.lsp $(datadir)/newlisp/modules/gmp.lsp
+	-install -m 644 modules/infix.lsp $(datadir)/newlisp/modules/infix.lsp
+	-install -m 644 modules/mysql.lsp $(datadir)/newlisp/modules/mysql.lsp
+	-install -m 644 modules/mysql5.lsp $(datadir)/newlisp/modules/mysql5.lsp
+	-install -m 644 modules/odbc.lsp $(datadir)/newlisp/modules/odbc.lsp
+	-install -m 644 modules/pop3.lsp $(datadir)/newlisp/modules/pop3.lsp
+	-install -m 644 modules/postscript.lsp $(datadir)/newlisp/modules/postscript.lsp
+	-install -m 644 modules/smtp.lsp $(datadir)/newlisp/modules/smtp.lsp
+	-install -m 644 modules/sqlite3.lsp $(datadir)/newlisp/modules/sqlite3.lsp
+	-install -m 644 modules/stat.lsp $(datadir)/newlisp/modules/stat.lsp
+	-install -m 644 modules/unix.lsp $(datadir)/newlisp/modules/unix.lsp
+	-install -m 644 modules/xmlrpc-client.lsp $(datadir)/newlisp/modules/xmlrpc-client.lsp
+	-install -m 644 modules/zlib.lsp $(datadir)/newlisp/modules/zlib.lsp
+	# GUI-Server install
+	-install -d $(datadir)/newlisp/guiserver
+	-install -d $(datadir)/doc/newlisp/guiserver
+	-install -m 755 guiserver/newlisp-edit.lsp $(bindir)/newlisp-edit
+	-install -m 644 guiserver/guiserver.jar $(datadir)/newlisp/guiserver.jar
+	-install -m 644 guiserver/guiserver.lsp $(datadir)/newlisp/guiserver.lsp
+	-install -m 644 guiserver/COPYING $(datadir)/doc/newlisp/guiserver/COPYING
+	-install -m 644 guiserver/index.html $(datadir)/doc/newlisp/guiserver/index.html
+	-install -m 644 guiserver/guiserver.lsp.html $(datadir)/doc/newlisp/guiserver/guiserver.lsp.html
+	-install -m 644 guiserver/allfonts-demo.lsp $(datadir)/newlisp/guiserver/allfonts-demo.lsp
+	-install -m 644 guiserver/animation-demo.lsp $(datadir)/newlisp/guiserver/animation-demo.lsp
+	-install -m 644 guiserver/border-layout-demo.lsp $(datadir)/newlisp/guiserver/border-layout-demo.lsp
+	-install -m 644 guiserver/button-demo.lsp $(datadir)/newlisp/guiserver/button-demo.lsp
+	-install -m 644 guiserver/clipboard-demo.lsp $(datadir)/newlisp/guiserver/clipboard-demo.lsp
+	-install -m 644 guiserver/cursor-demo.lsp $(datadir)/newlisp/guiserver/cursor-demo.lsp
+	-install -m 644 guiserver/drag-demo.lsp $(datadir)/newlisp/guiserver/drag-demo.lsp
+	-install -m 644 guiserver/font-demo.lsp $(datadir)/newlisp/guiserver/font-demo.lsp
+	-install -m 644 guiserver/frameless-demo.lsp $(datadir)/newlisp/guiserver/frameless-demo.lsp
+	-install -m 644 guiserver/html-demo.lsp $(datadir)/newlisp/guiserver/html-demo.lsp
+	-install -m 644 guiserver/image-demo.lsp $(datadir)/newlisp/guiserver/image-demo.lsp
+	-install -m 644 guiserver/mouse-demo.lsp $(datadir)/newlisp/guiserver/mouse-demo.lsp
+	-install -m 644 guiserver/move-resize-demo.lsp $(datadir)/newlisp/guiserver/move-resize-demo.lsp
+	-install -m 644 guiserver/pinballs-demo.lsp $(datadir)/newlisp/guiserver/pinballs-demo.lsp
+	-install -m 644 guiserver/properties-demo.lsp $(datadir)/newlisp/guiserver/properties-demo.lsp
+	-install -m 644 guiserver/rotation-demo.lsp $(datadir)/newlisp/guiserver/rotation-demo.lsp
+	-install -m 644 guiserver/shapes-demo.lsp $(datadir)/newlisp/guiserver/shapes-demo.lsp
+	-install -m 644 guiserver/sound-demo.lsp $(datadir)/newlisp/guiserver/sound-demo.lsp
+	-install -m 644 guiserver/stroke-demo.lsp $(datadir)/newlisp/guiserver/stroke-demo.lsp
+	-install -m 644 guiserver/tabs-demo.lsp $(datadir)/newlisp/guiserver/tabs-demo.lsp
+	-install -m 644 guiserver/textrot-demo.lsp $(datadir)/newlisp/guiserver/textrot-demo.lsp
+	-install -m 644 guiserver/widgets-demo.lsp $(datadir)/newlisp/guiserver/widgets-demo.lsp
+	-install -m 644 guiserver/word-count.lsp $(datadir)/newlisp/guiserver/word-count.lsp
+	-install -m 644 guiserver/uppercase.lsp $(datadir)/newlisp/guiserver/uppercase.lsp
+
+
+uninstall:
+	-rm  $(bindir)/newlisp
+	-rm  $(bindir)/newlispdoc
+	-rm  $(bindir)/newlisp-edit
+	-rm  -rf $(datadir)/newlisp
+	-rm  -rf $(datadir)/doc/newlisp
+	-rm  $(mandir)/man1/newlisp.1
+	-rm  $(mandir)/man1/newlispdoc.1
+
+# installs newLISP in home directory, but without guiserver files except
+# documentation. To make guiserver run from ~/share/newlisp. The loading
+# from guiserver.lsp at the beginning of a guiserver app and loading
+# of guiserver.jar from inside of guiserver.lsp have to be changed.
+
+install_home:
+	-install -d $(HOME)/bin
+	-install -d $(HOME)/share/newlisp
+	-install -d $(HOME)/share/newlisp/modules
+	-install -d $(HOME)/share/newlisp/util
+	-install -d $(HOME)/share/doc/newlisp/
+	-install -d $(HOME)/share/doc/newlisp/guiserver
+	-install -d $(HOME)/share/man/man1
+	-install -m 755 newlisp $(HOME)/bin/newlisp
+	-install -m 644 examples/init.lsp.example $(HOME)/share/newlisp/init.lsp.example
+	-install -m 755 util/newlispdoc $(HOME)/bin/newlispdoc
+	-install -m 644 util/syntax.cgi $(HOME)/share/newlisp/util/syntax.cgi
+	-install -m 644 util/newlisp.vim $(HOME)/share/newlisp/util/newlisp.vim
+	-install -m 644 util/link.lsp $(HOME)/share/newlisp/util/link.lsp
+	-install -m 644 util/httpd-conf.lsp $(HOME)/share/newlisp/util/httpd-conf.lsp
+	-install -m 644 guiserver/index.html $(HOME)/share/doc/newlisp/guiserver/index.html
+	-install -m 644 guiserver/guiserver.lsp.html $(HOME)/share/doc/newlisp/guiserver/guiserver.lsp.html
+	-install -m 644 doc/COPYING $(HOME)/share/doc/newlisp/COPYING
+	-install -m 644 doc/COPYING $(HOME)/share/doc/newlisp/guiserver/COPYING
+	-install -m 644 doc/CREDITS $(HOME)/share/doc/newlisp/CREDITS
+	-install -m 644 doc/newlisp_manual.html $(HOME)/share/doc/newlisp/newlisp_manual.html
+	-install -m 644 doc/newlisp_index.html $(HOME)/share/doc/newlisp/newlisp_index.html
+	-install -m 644 doc/manual_frame.html $(HOME)/share/doc/newlisp/manual_frame.html
+	-install -m 644 doc/CodePatterns.html $(HOME)/share/doc/newlisp/CodePatterns.html
+	-install -m 644 doc/newLISPdoc.html $(HOME)/share/doc/newlisp/newLISPdoc.html
+	-install -m 644 doc/newLISP-9.3-Release.html $(HOME)/share/doc/newlisp/newLISP-9.3-Release.html
+	-install -m 644 doc/newlisp.1 $(HOME)/share/man/man1/newlisp.1
+	-install -m 644 doc/newlispdoc.1 $(HOME)/share/man/man1/newlispdoc.1
+	-install -m 644 modules/cgi.lsp $(HOME)/share/newlisp/modules/cgi.lsp
+	-install -m 644 modules/crypto.lsp $(HOME)/share/newlisp/modules/crypto.lsp
+	-install -m 644 modules/ftp.lsp $(HOME)/share/newlisp/modules/ftp.lsp
+	-install -m 644 modules/gmp.lsp $(HOME)/share/newlisp/modules/gmp.lsp
+	-install -m 644 modules/infix.lsp $(HOME)/share/newlisp/modules/infix.lsp
+	-install -m 644 modules/mysql.lsp $(HOME)/share/newlisp/modules/mysql.lsp
+	-install -m 644 modules/mysql5.lsp $(HOME)/share/newlisp/modules/mysql5.lsp
+	-install -m 644 modules/odbc.lsp $(HOME)/share/newlisp/modules/odbc.lsp
+	-install -m 644 modules/pop3.lsp $(HOME)/share/newlisp/modules/pop3.lsp
+	-install -m 644 modules/postscript.lsp $(HOME)/share/newlisp/modules/postscript.lsp
+	-install -m 644 modules/smtp.lsp $(HOME)/share/newlisp/modules/smtp.lsp
+	-install -m 644 modules/sqlite3.lsp $(HOME)/share/newlisp/modules/sqlite3.lsp
+	-install -m 644 modules/stat.lsp $(HOME)/share/newlisp/modules/stat.lsp
+	-install -m 644 modules/unix.lsp $(HOME)/share/newlisp/modules/unix.lsp
+	-install -m 644 modules/xmlrpc-client.lsp $(HOME)/share/newlisp/modules/xmlrpc-client.lsp
+	-install -m 644 modules/zlib.lsp $(HOME)/share/newlisp/modules/zlib.lsp
+
+
+uninstall_home:
+	-rm  -rf $(HOME)/share/newlisp
+	-rm  -rf $(HOME)/share/doc/newlisp
+	-rm  $(HOME)/share/man/man1/newlisp.1
+	-rm $(HOME)/bin/newlisp
+	-rm $(HOME)/bin/newlispdoc
+
+# this makes the distribution newlisp-x.x.x.tgz from inside newlisp-x.x.x directory
+# you shouldn't use this, but send me the changed files with your contribution/fixes 
+# to lutz@nuevatec.com put the word: newlisp in the subject line
+#
+dist:
+	-mkdir newlisp-$(VERSION)
+	-mkdir newlisp-$(VERSION)/guiserver
+	-mkdir newlisp-$(VERSION)/guiserver/images
+	-mkdir newlisp-$(VERSION)/guiserver/java
+	-mkdir newlisp-$(VERSION)/modules
+	-mkdir newlisp-$(VERSION)/examples
+	-mkdir newlisp-$(VERSION)/doc
+	-mkdir newlisp-$(VERSION)/util
+	cp README newlisp-$(VERSION)
+	cp nl*.c newlisp.c *.h pcre*.c newlisp-$(VERSION)
+	cp win3*.* unix*.c newlisp-$(VERSION)
+	cp Makefile build configure makefile* qa* newlisp-$(VERSION)
+	cp modules/* newlisp-$(VERSION)/modules
+	cp examples/* newlisp-$(VERSION)/examples
+	cp doc/* newlisp-$(VERSION)/doc
+	cp util/* newlisp-$(VERSION)/util
+	cp -R guiserver/* newlisp-$(VERSION)/guiserver
+
+	tar czvf newlisp-$(VERSION).tgz newlisp-$(VERSION)/*
+	rm -rf newlisp-$(VERSION)
+	mv newlisp-$(VERSION).tgz ..
+
+osx_package:	
+	make -f makefile_osx_package
+
+# this changes to the current version number in several files
+#
+# before doing a 'make version' the VERSION variable at the beginning
+# of this file has to be changed to the new number
+#
+version:
+	sed -i.bak -E 's/int version = .+;/int version = $(INT_VERSION);/' newlisp.c
+	sed -i.bak -E 's/newLISP v.[[:digit:]]+.[[:digit:]]+.[[:digit:]]+ /newLISP v.$(VERSION) /' newlisp.c
+	sed -i.bak -E 's/newLISP v.+ Manual/newLISP v.$(VERSION) Manual/' doc/newlisp_manual.html
+	sed -i.bak -E 's/Reference v.+<\/h2>/Reference v.$(VERSION)<\/h2>/' doc/newlisp_manual.html
+	sed -i.bak -E 's/newlisp-....-win/newlisp-$(INT_VERSION)-win/' guiserver/newlisp-gs.nsi
+	sed -i.bak -E 's/and newLISP .+ on /and newLISP $(VERSION) on /' guiserver/newlisp-gs.nsi
+
+# Prepare the manual file for PDF conversion, byt replaceing all <span class="function"></span>
+# with <font color="#DD0000"></font> in the syntax statements and replacing &rarr; (one line
+# arrow with &rArr; (double line arrow). This is necessary when using OpenOffcice PDF conversion 
+#
+preparepdf:
+	util/preparepdf doc/newlisp_manual.html doc/newlisp_manual_preparepdf.html
+
+# end of file
diff --git a/README b/README
new file mode 100644
index 0000000..835a64e
--- /dev/null
+++ b/README
@@ -0,0 +1,99 @@
+newLISP version 9.x.x for LINUX, FreeBSD, Mac OSX Solaris and Win32
+===================================================================
+
+
+INTRODUCTION
+------------
+newLISP(tm) is LISP like scripting language for general programming
+artificial intelligence and statistics. 
+
+For more details about newLISP see the Users Manual and Reference in the
+distribution file: 'newlisp_manual.html' and for newlisp-tk: 
+'./newlisp-tk/newlisp-tk.html'
+
+Code contributions, bug fixes, reports and comments are welcome. New
+versions are available at:
+
+ http://newlisp.org
+    or
+ http://newlisp.org/downloads
+    or
+ http://sourceforge.net/projects/newlisp
+
+See the file CHANGES in the source distribtion for changes over 
+previous versions or
+
+ http://newlisp.org/downloads/newLISP_xx_Release_Notes.html
+
+New versions in development are available at:
+
+ http://newlisp.org/downloads/development
+
+Please contact me via email at: lutz@nuevatec.com.
+
+
+BUILD and INSTALL
+----------------
+
+See the files doc/INSTALL, doc/LOCALIZATION and doc/FILES for detailed 
+info or type: 
+
+  make
+
+to discover the current platform and make for Linux, MacOSX, FreeBSD, OpenBSD,
+NetBSD and Solaris/SunOS automatically.
+
+then to install with superuser permissions in /usr/bin
+
+  make install
+
+or from a user account if the sudo command is available
+
+  sudo make install
+
+or to install in ~/bin (bin in home directory) without root permissions
+
+  make install_home
+
+see all flavors and platform available for install:
+
+  make help
+
+will list all available platforms and flavors, newLISP can also be made as
+a shared, dhynamic library: newlisp.so. newlisp.dylib and  newlisp.dll
+
+The file configure is not required, but can be used to discover the
+makefile the make utility would use. The file configure has been
+included for compatibility with packageing/installing systems requiring
+the autoconf/automake system which is *not* required to make newLISP.
+
+
+MINIMUM INSTALL
+---------------
+Note that for a minumum install only the executable newlisp or newlisp.exe
+ion Win32 is necessary. 
+
+On Mac OS X or other UNIX copy  newlisp to /usr/bin or to ~/bin and give
+it executable permissions.
+
+
+LICENSE
+-------
+newLISP and Nuevatec are trademarks of Lutz Mueller. Files in the newLISP
+distribution are protected by the "GNU General Public License Version 3, June 2007". 
+For the full text of this license see the accompanying file COPYING in the doc
+directory, or the appendix in the file newlisp_manual.html. Documentation files
+are protected by the "GNU Free Doumentation License Version 1.2, November 2002".
+A copy of this license is also included in the file COPYING.
+
+This and information about lcensing from other contributors to newLISP is
+contained in the file COPYING in the source distribution.
+
+MORE INFO
+---------
+See in the doc/ directory of the source distribution
+
+Lutz Mueller, January 2008
+
+                                  +++
+
diff --git a/build b/build
new file mode 100755
index 0000000..ddadb56
--- /dev/null
+++ b/build
@@ -0,0 +1,66 @@
+#!/bin/sh
+# this script tries to discover the OS platform and configuration
+# and then makes newLISP using the appropiate makefile
+# if this script fails and for other special flavors, like
+# making shared libraries etc., type: 
+#
+#      make help
+# to see all options
+#
+
+echo
+case `uname` in 
+	Darwin)
+		echo Discovered Darwin Mac OSX with readline suport:
+		if [ -e /usr/lib/libreadline.dylib ]; then
+			make darwin_utf8 # make with readline support
+		else 
+			make osx # make without readline support
+		fi
+		exit
+		;;
+	Linux)
+		echo Discovered Linux:
+		make linux
+		exit
+		;;
+	FreeBSD)
+		echo Discovered FreeBSD:
+		make bsd
+		exit
+		;;
+	NetBSD)
+		echo Discovered NetBSD:
+		make netbsd
+		exit
+		;;
+	OpenBSD)
+		echo Discoverd OpenBSD:
+		make bsd
+		exit
+		;;
+	SunOS)
+		echo  Discovered SunOS:
+		make solaris
+		exit
+		;;
+	OSF1)
+		echo Discovered Tru64 Unix, please read doc/TRU64BUILD
+		make -f makefile_tru64
+		exit
+		;;
+MINGW32_NT-5.1)
+		echo Discoverd MINGW32 on NT-5.1
+		make mingw	# this is with MinGW on MSYS
+		exit
+		;;
+	OS/2)
+		echo Discoverd OS/2
+		make os2
+		exit
+		;;
+esac
+
+echo Could not discover your OS platform use one of the following commands:
+
+make help
diff --git a/configure b/configure
new file mode 100755
index 0000000..5689125
--- /dev/null
+++ b/configure
@@ -0,0 +1,71 @@
+#!/bin/sh
+# this script tries to discover the OS platform and configuration
+# and then makes newLISP using the appropiate makefile
+# if this script fails and for other special flavors, like
+# making shared libraries etc., type: 
+#
+#      make help
+# to see all options
+#
+
+echo
+case `uname` in 
+	Darwin)
+		echo Discovered Darwin MacOS X with readline suport, enter:
+		echo "     make"
+		echo to make a UTF-8 version for MacOS X with readline support
+		exit
+		;;
+	Linux)
+		echo Discovered Linux, enter:
+		echo "     make"
+		echo to make for linux
+		exit
+		;;
+	FreeBSD)
+		echo Discovered FreeBSD, enter
+		echo "     make"
+		echo to make for FeeBSD
+		exit
+		;;
+	NetBSD)
+		echo Discoverd NetBSD, enter:
+		echo "     make"
+		echo to make for NetBSD
+		exit
+		;;
+	OpenBSD)
+		echo Discoverd OpenBSD, enter:
+		echo "     make"
+		echo to make for OpenBSD
+		exit
+		;;
+	SunOS)
+		echo  Discovered SunOS, enter:
+		echo "     make"
+		echo to make for SunOS
+		exit
+		;;
+	OSF1)
+		echo Discovered True64 Unix, please read doc/TRU64BUILD and enter:
+		echo "     make"
+		echo to make for True64 Unix
+		exit
+		;;
+MINGW32_NT-5.1)
+		echo Discoverd MINGW32 on NT-5.1, enter:
+		echo "     make"
+		echo to make for MinGW32 on Win32
+		exit
+		;;
+	OS/2)
+		echo Discoverd OS/2
+		echo "     make"
+		echo to make for OS/2
+		exit
+		;;
+esac
+
+echo Could not discover your OS platform use one of the following commands:
+
+make help
diff --git a/doc/._CodePatterns.html b/doc/._CodePatterns.html
new file mode 100644
index 0000000000000000000000000000000000000000..0e56e3c839ebb6d89a149072d7e7a42b81fb2437
GIT binary patch
literal 255
zcwS>*6=P>$Vqox1Ojhs@R)|o50+1L3ClDI}@mU}S@&7Xr1sp>{f*8~$uVR4cSOLW0
zXi69n;;PB{xq68O1v#mDxv3?IDTyVCR@uHTo+YWd;Tfq#scuF2xy1}g1v#0;B?bly
z8RG>sGD=Dctn~HE%ggohQp<r71$y~K>H5z3DX9U8B_*jvdBu7eCAm2qTu|E>q1G~?
HIl~kHypSxU

literal 0
HcwPel00001

diff --git a/doc/CHANGES b/doc/CHANGES
new file mode 100644
index 0000000..eb9ee97
--- /dev/null
+++ b/doc/CHANGES
@@ -0,0 +1,4180 @@
+6.0.25
+'find', 'replace' and 'search' now have an option for case insensitive
+search, updated source and manual
+
+6.0.26 - 6.0.27 - 11:34 AM 4/4/99
+'trace' got stuck in executeCommandline() in traceExit() because an empty
+ fgets() in LINUX still has a '\n'
+
+6.0.27 - 6.0.28 - 6:30 PM 4/6/99
+'import' now returns primitve address
+'define' now also works like (define x y) ; as in SCHEME
+'char' now defaults to 0 on offset and returns unsigned int
+new 'mod' floating point modular function
+new 'abs' floating point absolute value function
+new 'trim' trims spaces or characters both sides
+
+6.0.28 - 6.0.29
+'filter' new primitive
+
+6.0.29 - 6.0.30
+'dump' now displays address of cell
+'make-dir' mode parameter now optional defaults to 493 = drwxr-xr-x
+
+6.0.30 - 6.0.31
+fixed trim, which had all kinds of problems
+new 'difference' returns set difference of two lists
+new 'intersect' resturns set intersection of two lists
+new 'unique' returns unique set from list (duplicates removed)
+when comparing lambda expressions, now state lists also get compared
+
+6.0.31 - 6.0.33
+'match' now also works on list expressions, wildcard symbols 
+can occur on different nesting levels. 
+ 
+6.0.33 - 6.0.34 Released on www.newlisp.org
+in 'substring' the length parameter is now optional 
+math exception showed wrong error message 
+tty setup now only when tty detected else supress buffering 
+for usage with 'socker'
+
+6.0.33 - 6.0.35 4/20/2000
+inlined cleanupResults() in evaluateExpression() ca. 4% speedup !
+took out all #pragma statements
+took out termio stuff, works better without
+new functions read-file, write-file
+new functions read-process, write-process
+new function error-text
+
+6.035 - 6.0.36 4/21/2000
+'char' now also can take a number as an argument converting it to a 
+string of one character: 
+(char 65) => "A"
+(char "A") => 65
+'integer' and 'float' now return 'nil' if the string passed does
+not start with a number digit or +/-
+strings can now encode characters in the form \nnn where nnn
+is a 3 digit decimal (leading 0' if less 100) e.g.:
+"\065\066\067" => "ABC"
+
+6.036 - 6.039 4/28/2000
+added 'chop', 'explode', 'get-float', 'starts-with', 'ends-with'
+added 'random' 'normal'
+renamed 'get-number' to 'get-integer'
+added script for httpd webserver demon
+
+6.039 - 6.043
+'symbol' now takes optional context argument
+'symbols' now gives error message if symbol args is not context
+eliminated 'sourcePtr' which wasn't used anyway, introduced
+'sourceLine' for keeping track of line-numbers in error messages
+added 'encrypt' for one-time-pad encryption/decryption
+
+6.043 - 6.044
+speedup in deleteList() and copyList()
+
+6.044 - 6.045
+took out 'sourceLine', too much confusing situtations which are
+unresolvable. 'eval-string' now does multiple expressions
+
+6.045 - 6.048
+put back pushResultFlag, 'eval' needed it. 
+fixed bug in 'substring' for trailing 0's, changed tokeString to 
+resemble split() and taking separators > 1 char.
+This also changes pack/unpack in parsePackFormat() to take care of
+more than one space between formats. 
+After reset and execution of 'error-event' errorReg now set to 0.
+
+6.048 - 6.049
+took out executeSymbolParams modifying executeParams for optional arg
+'reset' now throws 'user reset - no error' - error, so it can be handled as
+a non-error in user defined error handlers, also takes now optional
+symbol for 'resetEvent to be exuted after errorEvent.
+
+6.049 - 6.051
+'reset' now takes optional third parameter for stacksize. So the
+syntax for reset is nor (reset [resetEventSymbol] [stacksize])
+
+6.051 - 6.052
+no length limitiation anymore for printing strings to the console
+'replace-nth' new primitive
+
+6.052 - 6.054 5/19/2000
+'let' new primitive like in other Lisp but dynamically scoped
+'seed' new primitive seeds random generator for rand, random, normal
+now feature complete for 6.1 release
+
+6.054 - 6.055 5/20/2000
+fixed memory leek in varPrintf()
+'integer' and 'float' now take optional thirsd parameter for default
+return value if string cannot be parsed.
+
+6.055 - 6.056
+fixed bug in 'symbol' which would not overwrite symbols in MAIN for
+symbols in other contexts so (symbol "set" 'MyContext) now works
+creating a symbol 'set in MyContext.
+
+6.056 - 6.059 5/29/2000
+improved pretty printing for 'let', which takes now the same flag
+as 'cond'. Improved httpd script, now sends http header for each
+file.
+
+6.059 - 6.060 5/29/2000
+httpd did fail on POST on some browsers now 'upper-case' when matching
+'content-length'. Alos fixed in manuual
+
+6.060 - 6.0.61
+changed 'parse' so it parses a max token length of 2048 (256 previous)
+this was already changed erarlier on the Win32 versions.
+The read-line limit of 16384 should be changed at some point to infinite
+similar to the print buffer. At the moment cgi vi std/IO is limited by
+read-line to forms no bigger than 16384.
+
+6.0.61 - 6.0.62
+varPrintf was still limited. MAX_PRINT_LEN changed to size.
+
+6.0.62 - 6.0.63
+'integer' now parses also hex strings eg: (integer "0xFF") => 255
+'write-line' now retuenw nil on file errors
+
+6.0.63 - 6.0.64
+5% speedup introducing cell type masks
+
+6.0.64 - 6.0.65
+1% speedup taking out symbol in evaluateExpression
+
+6.0.65 - 6.0.67
+new 'count' counts elements of one list in another list
+
+6.0.67 - 6.0.68
+fixed error in 'reverse'
+
+6.0.68 - 6.0.69
+'parse' now without size limitations in tokens when using breakstr argument.
+
+6.0.69 - 6.0.70
+'string' now without size limitations of printing in string
+
+6.0.69 - 6.0/71
+'read-line' now without size limitations
+
+6.0.71 - 6.0.72
+'for' fixed bug when from and to where equal would run forever
+
+6.0.72 - 6.0.73
+'putenv' didn't work, fixed
+
+6.0.73 - 6.0.75
+problem with ebaluateLambda when passing (set 'p ...) to (foo p) as an argument 
+for parameter p.
+
+6.0.75 - 6.0.76
+additional functions: prob-z prob-chi2 and crit-chi2. (for ...) no works with
+floating point numbers. Additional module xml.lsp
+
+6.0.76 - 6.0.77
+additional function: join. Additional module mail.lsp
+additional function: sequence
+
+6.0.77 - 6.0.79
+additional functions: xml-parse, xml-error
+fixed buffer overflow bug in varPrintf to string device (function 'string)
+
+6.0.79 -> 6.1.0
+new function println
+6.1.14 documentation
+
+6.1.0 -> 6.1.1
+new function fft and ifft
+6.1.15 documentation
+
+6.1.1 -> 6.1.2
+the length parameter in 'sublist' is now optional (assumes all)
+
+6.1.2 -> 6.1.3
+fixed default for 'true' in 'case'
+
+6.1.3 -> 6.1.4
+new function 'swap' for swapping elements in a list
+
+6.1.4 -> 6.1.5
+new function 'read-url' for reading pages/files via http
+revision of httpd script more RFC compliant
+
+6.1.5 -> 6.1.6
+'read-url' nl-web.c now handles proxy's if HTTP_PROXY is set to proxy URL
+new functions 'collect'and 'select' for selecting multiple elements from a
+list
+
+6.1.6 -> 6.1.7 Release
+'rand' now takes an optional second parameter to return a list of random
+numbers (similar to 'random' and 'normal')
+many formatting changes in manual.
+
+================================================================================
+6.1.7exp -> experimental '-p port' mode
+
+6.1.7 -> 6.1.8
+fixed bug in error event handling when error==0
+
+6.1.8 -> 6.1.9
+trace now is a source level debugger, similar in funcitonality to the Win32
+version, but for a character console.
+linking now encrypted, new functions 'betai' and 'gammaln'
+
+6.1.9 -> 6.1.10 
+fixed bug which could affect parsing \xxx in getToken() where isdigit(x)
+'prob-chi2' now more precise using gammap(),
+new functions 'crit-z', 'beta' and 'gammai'
+
+6.1.10 -> 6.1.11
+new 'debug-highlight' for setting pre and post string in debugger
+highlighting. Eliminated example httpget because 'read-url' does
+the same. 
+
+6.1.12 -> 6.1.12
+'swap' now treats negative values as the last element, consistent
+with other functions, 'read-url' fix in error message text
+init.lsp, mysql.lsp etc have moved to /usr/local/newlisp
+
+6.1.12 -> 6.1.15
+'read-url' now handles also redirects
+
+6.1.15 -> 6.1.16
+fixed bug in trace mode, trace stopped at all args evals in function
+calls. Still stops and shows result for each 'map', which is ok, but
+must be documented. Improved subroutines for handling POP3 and SMTP mail.
+
+6.1.16 -> 6.1.17
+new matrix functions 'invert', 'multiply', 'transpose'
+
+6.1.17 -> 6.1.18
+fixed dimension problem in transpose
+
+6.1.18 - > 6.1.19
+fixed missing error text for 'singular matrix' in invert
+
+6.1.19 -> 6.1.20
+ifft didn't normalize right when N not a power of 2
+evaluateLambda() rewritten to store statics in a way that
+anonymous lambda expressions with static data can be stored
+this also gave a general speed up of about 5%.
+
+6.1.20p2
+(nth -1 lst) now returns the last element instead of nil. This
+is consisten with other functions
+
+6.1.20p4
+eliminated optional parameters in reset, because never worked right.
+instead the error-event can be used for code after reset and the stack
+size can now be specified on the command line.
+
+6.1.20p5
+eliminated get-state and set-state as primitves, they are now written
+in newLISP and part of the initialization file /usr/local/newlisp/init.lsp
+
+6.1.20p6
+new function 'regex for POSIX 1003.2 regular expressions (GNU library)
+ifdef'ed readline, only works in CYGWIN, cannot figure unresolved 'tputs()' etc in
+libreadline.so in LINUX, seems not to see libcurses?
+
+6.1.20p7
+cleanup makefile for different features NANOSLEEP, READLINE, REGEX
+cleanup fft
+took out replace-match, new function index
+
+6.1.20p8
+cleanup regex, additions changes in manual
+
+6.1.20 -> 6.3.pre1
+READLINE finally working on Mandrake missing link to 'libtermcap.so'
+lots of manual changes
+ 
+6.3.pre2
+preparing to replace simple binary tree for symbols woth RB balanced tree
+
+6.3.pre4
+running RB balanced tree code
+
+6.3.pre5
+fixed bug in 'symbols for context and 'delete for context
+
+6.3.pre6
+changed httpd CHANGES
+===============================================================================
+6.3 Release
+time-of-day new function
+
+6.3.01
+a fix for 'regex' in the CYGWIN version sent in by Steve Adams
+
+6.3.02
+additional optional parameter in 'eval-string'
+streamlining code in nl-web.c, reformatting manual so it is easier converted
+to PDF
+
+6.3.04
+new -p commandline parameter for TCP/IP port mode of newLISP.
+Fixed format for default data type (will treat as string),
+also format will permit now unlimeted size of the formatted 
+output (was 2047 bytes).
+
+6.3.05
+cleanup -p with trace for rt/lf translation
+
+===============================================================================
+6.3.06 Release  July 8th, 2001
+optional parameter 'nil in 'eval for silent evaluation evaulates without return
+value and prompt on the console, needed for Tcl/Tk integration
+
+6.3.07 Release
+a new function 'debug (shortcut fr using trace) and various bugfixes in the
+trace/debug functions. '{' and '}' characters are allowed as string delimiters
+but only on the outer level, they get replaced by the parser. This allows
+writing 'nicer' source for HTML and TK stuff.
+
+6.3.08
+regex now also returns sub expressions. further changes in debugger to accomodate
+remote TclTk controlled debugging: (q)uit now quits execution, (c)ontinue stops
+debugging but continues execution.
+
+===============================================================================
+6.3.09 Release July 16th, 2001
+string now can take more than one parameters, like concat but works on different
+data types
+
+6.3.10
+added symbol count to 'sys-info'
+added ERR: string in error message when in trace for TclTk frontend
+
+6.3.11
+new function 'dotree' to iterate thrugh symbol trees, usefull for simulating
+arrays and hashes
+
+===============================================================================
+6.3.12 Release July 30th, 2001
+new function 'catch' for catching errors when evaluating expressions
+fixed bug in net-connect when trying to connect to dead port
+
+===============================================================================
+6.3.14 Release August 2nd, 2001
+changes in newlisp_manual.html and newlisp-tk.html
+cleanup and improvment of qa file
+fixed crash-bug in markReferences and saveSymbol when copying contexts
+function 'args' now works also for lambda, no symbol param necessary anymore
+===============================================================================
+6.3.15 Release September 3rd, 2001
+xml-parse now accepts empty atribute value strings e.g.: <ATAG ATT=""></ATAG>
+net-lookup now works in both directions: ip->name and name->ip
+===============================================================================
+6.3.16 Release September 6th, 2001
+float division by 0.0 now yields 'Inf', as specified by IEE 754. Before 6.3.16
+it would couse a Math exception. Now all compare operations with NaN return 'nil'.
+new functions 'floor' and 'ceil' and 'NaN?'.
+ 
+Ctrl-D will now longer crash but exit newLISP
+
+More LSB compliance in install directories used: now /usr/share/newlisp
+instead of old /usr/local/newlisp
+
+===============================================================================
+6.3.17 Release September 9th, 2001
+fixed a memory leak in 'regex'. The leak could not be fixed in the CYGWIN
+version which uses regexp !
+
+
+6.3.18
+fixed rounding problem in 'sequence', Ctrl-D will not exit but only do newline
+if at beginning of line, else it will behave as expected under readline, to exit
+newLISP with one keystoke use Ctrl-C instead.
+output cleanup in error-text and error-event
+better standard behaviour of 'cond' when action clause is missing
+new function 'series' for generating geometric sequences.
+new function 'rotate' for rotating lists
+
+6.3.20 Release October 22nd, 2001
+bug fix in xml-parse when parsing closing tags without opening tags
+bug fix memory leak in catch and eval-string uder error conditions
+about 30% speedup removing copyCell/pushResult in: inc set define
+manual changes and additions.
+tookout net-cleanup in  network examples
+
+6.3.21p1
+bug fix in 'char' when using with floats
+'integer' now also takes floats converting them into integer
+also now translates "055" to 45 taking it as an octal number,
+which is consistend now with the parser.
+'float' now also takes integeres converting into floats
+
+6.3.21p2
+eliminated symbol->type in SYMBOL typdef, which reduces symbol memory by from 36 to 32 byte
+fixed a bug where sometimes newlisp wouldn't exit after tk-frontend exited
+
+===============================================================================
+6.3.21 Release November 13th, 2001
+MAX_ERROR_NUMBER was to high, parenthesis count wasn't reset when evalCatchFlag
+
+6.3.22
+fixed potential bug in join with memory intialization
+fixed problem parsing URL when redirection in 'read-url'
+'get-url/read-url' now also handles 205 and 307 return codes
+'get-url/read-url' now always only returns header portion if "header" option is specified
+new -d demon mode, like -p but newLISP stays in memory to accept a new connection
+new function 'put-url' for HTTP PUT method
+new function 'post-url' for HTTP POST method
+
+===============================================================================
+6.3.23 Release January 6th, 2002
+new function 'binomial'
+
+6.3.24
+'exit' now closes net work connection when running in '-d' demon mode.
+new function 'now' returns detailed date/time info: (y m d h m s us dy dw)
+new function 'date-value' converts date/time into seconds since 1970-1-1
+new financial functions 'pmt', 'nper', 'pv', 'fv', 'npv'
+bug fix in 'map' which would crash when last arg was not a list (as it should be)
+replaced 'MySQL:close' with 'MySQL:close-db' to avoid overwriting of close in MAIN in mysql.lsp
+
+===============================================================================
+6.4.00 Release March 20th, 2002
+inclusion of BWidget set in the Win32 tk v 0.80 distibution, many manual changes
+
+6.4.1
+main-args now returns path of program as first list member
+get-url "debug" option now can be specified together with "header" option
+post-url content-type now is optional and defaults to "application/x-www-form-urlencoded"
+added closing channel in get-url
+fixed bug in 'join', which could crash on an empty list
+httpd, finger and gettime changes for new 'main-args'
+balloon help in newlisp-tk v. 081
+new '(tk-args)' when running Tcl/Tk frontend returns newlisp-tk commandline args
+several changes in stat.lsp/plot directing temporal files to /tmp
+fixed potential crash bug in 'dotree'
+Win32 installer now puts desktop icon
+
+===============================================================================
+6.4.2 Release April 22nd, 2002
+'format' now for multiple args
+
+6.4.3 development release
+'parse' now correctly does handles trailing separator by returning an empty token ""
+
+6.4.4
+buffer limit in vsnprintf() was not handled correctly, putting a space limitation
+on 'string' (16k), 'format' (2k) and 'C' functions depending on varPrintf(),
+fixed potential buffer overflow in writeStreamStr().
+'tranpose' did not check for matrix type.
+experimental function 'throw'
+
+6.4.5 Development release
+starts-with, ends-with 
+now are working type polymorph on strings and lists
+rotate now takes negative numbers for left rotation
+rearranged lambda evaluation (eval args before saving environment),
+which causes 6% speed improvements
+'args' only available in define-macro (again as before 6.3.14)
+changed 'if', 'unless', 'while', 'until' for less CPU stack requirements
+
+6.4.6
+'nth', 'first', 'last', 'rest'
+now are working type polymorph on strings and lists
+'cons' works now correctly on 1 arg  (who cares? -> consistency proof)
+potenial cell-memory leak on error in 'apply'
+
+6.4.7 Development release
+improved syntax for statics environment list as assoc list:
+(define  (foo a b c ((x 1) (y 2) (z 3))) ....)
+to retrieve statics environment just do:
+(last (first foo) => ((x 1) (y 2) (z 3))
+also improves speed of ststic processing by about 10%
+
+===============================================================================
+6.4.8 Release May 16, 2002
+empty? now works on strings
+fix for 'cons' when lambda expr is second argument
+fix for (rest "") which now returns ""
+fix for (first "") now returns nil
+purelisp.lsp for prooving consistency
+fix for link.lsp on CYGWIN
+
+6.4.9 Development release May 21st, 2002
+'nil' as a symbol was not always treated as nil value constant
+(push exp lst) now works even if lst does not contain a list
+in that case old contents of lst gets deleted and initialized
+with () before pushing exp, this makes initialization of lists
+to '() before pushing on it unnecessary.
+'time' now works as a timer returning mseconds needed to evaluate
+this is also mor compatible how other Lisp's define 'time'
+an expression, for old funcitonality of 'time' use (apply date-value (now))
+'sort' now takes an optional parameter '< or '> for ascending/descending
+also about 30% speedup, like in: (sort myList '>)
+
+6.4.10 Development release May 21st, 2002
+correct treatment of symbol 'nil in 'and' and 'or'
+eliminated orSymbol reference in soirce code
+speedup parsing source
+dump with parameter now returns list (cellAdress, cellType, cellNext, cellAux, cellContents)
+stepsize in 'for' 'sequence' always forced to positive
+
+6.4.11
+'push' in its new form did not respect 'nil and 'true
+new error message when trying to set/define/push on 'nil, 'true or context
+speedup in multiple compares in nl-math.c 
+speedup in upper-case, lower-case
+speedup in get-char, get-string, get-integer and get-float
+
+
+6.4.12
+boolean types and symbols are equal
+another speed improvement in lambad and expression evaluation
+over all speed improvement over 6.4.8 now about 5-10% depending
+on expression mix.
+local iterator symbols are now handled on environment stack for
+better error recovery.
+new chapter "Data structure objects in lists" in docs and
+many little doc changes.
+
+===============================================================================
+6.5.0 Release May 28th, 2002
+no changes related to newlisp itself except for versioning
+changes in httpd (see httpd file)
+changes in newlisp-IDE for changes in httpd and changes for date display
+
+6.5.1
+compiles with -Wall -pedantic -Wno-uninitialized -O2 
+-Wall -pedantic for better portability
+-Wno-uninitialized to suppress 'fork' 'longjmp' warning in -O2
+-O2 does ~25% speed and size improvement!
+'let' did not handle empty parameter lists and now double fast
+
+6.5.2 development release June 3rd
+'concat' is deprecated 'append' doubles functionality of 'concat'
+new individual makefiles for making newLISP on different platforms without
+the need to tweak makefiles.
+
+6.5.4
+'find', 'replace' and file 'search' now can do Regular Expressions.
+Regular Expressions are not dependend any more on the C-library
+on the OS platform used, instead PCRE (Perl Compatible Regular Expressions)
+is used on all platforms and the source is contained in the distribution.
+Additions to INSTALL file about PCRE and localization of newLISP.
+
+6.5.5
+fix for 'replace' in regex mode
+
+6.5.5 -> 6.5.7
+changes in win32.lsp and makefile_win32
+eliminated file: nl-importDM.c was already merged
+new chapter 'Lambda expressions in newLISP' in newlisp_manual.html
+
+===============================================================================
+6.5.8 Released version (functionally equal to 6.5.7) June 13th 2002
+#ifdef NOIMPORT instead of MAC_OSC in evaluateExpression()
+spelling stuff in newlisp_manual.html
+
+6.5.10
+- incorporated nl-web.c into native win32 version to make work get-url, post-url
+and put-url. Server modes -p and -d now are working too in native win32 version.
+
+- newlisp-tk.tcl changed to work with win32 because read-line/write-line don't 
+work on sockets in win32. 
+
+- writeStramChar() now works also on binary streams
+
+- newlisp-tk.tcl changed to work on remote connection over the internet.
+Shows acceptable speed on dial-up (old newlisp-tk.conf should be deleted)
+
+- 'reload last' button in newlisp-tk GUI
+
+- dependency fix in makefile_win32
+
+
+6.5.11
+- moved to Borlanc C++ v5.5 compiler, gives faster and smaller executable than 
+ Digital Mars compiler previously used. Now all functions of the Linux version
+ also work in the Win32 version.
+
+6.5.12
+- changes in newlisp-tk.tcl for faster performance on remote and working
+  reliable with win32 version. Old newlisp-tk.conf should be deleted.
+  Win-tk version can now be distributed without CYGWIN DLLs using the
+  Borland 'C' Win32 compile.
+
+6.5.13
+- fixed problem in 'net-receive', which was introduced in 6.5.10
+  httpd now works fine with win32 compile (with change in line 147 of httpd)
+
+- send() in net-send and win32_fprintf() now performs check and resend
+
+6.5.14
+- reintroduced writeStreamChar in 'net-receive', writeStreamChar did not zero buffer
+- debug was broken with TK because of missing redefine of fgets() in nl-debug.c
+
+6.5.15
+- net-close wasn't working in win32 version, which gave problems in cgi in httpd
+- new newlisp-IDE-1.3.tgz with fixes for LF -> RET/LF translation which was happening
+  in win32 pipes
+
+6.5.16
+- doc changes
+- took out again size-check and resend in netSend() and win32_fprintf() as it is
+  not relevant in blocking sockets
+- mail.lsp was broken because of change how optional parameter in 'find' works
+- 'read-process' and 'write-process' collapsed to 'exec'
+- match for lists now behaves like match for string returning a list of matches
+  ie. (match '(I * you) '(I love you)) => (I (love) you)
+  this allows easier substituting of star/* patterns in pattern matches in chat
+  robots
+
+6.5.17
+- new option# parameter in 'xml-parse' 
+    (a) option# 1 to surpress white-space TEXT fields (for data XMLs)
+    (b) option# 2 to surpress empty attribute tags (for tags which never have attributes)
+    (c) option# 4 to surpress comments
+    (d) option# 8 to tanslate tag names into symbols
+
+- new 'xml-type-tags' for definig alternative tags for "ELEMENT", "CDATA", "COMMENT"
+  and "ELEMENT". Instead symbol can be defined or nil can be specified to surpress
+  the type tag completely.
+
+- the newlisp-tk_win32 version now comes with the win32 native compile
+
+- fixed bug in 'string', which was not reentrant
+
+===============================================================================
+6.5.18 Release August 3, 2002
+- fixed stream problem in 'eval-string' in Win32
+- fixed openStrStream, didn't initialize stream->handle to 0
+
+6.5.19
+- doc changes, renamed mail.lsp to pop3.lsp, sendmail.lsp to smtp.lsp
+- memory initialization in p_format()
+
+6.5.20
+- fixed p_format again, vsnprintf() doesn't include null-char in return count
+  as advertised in GNU docs
+- doc changes
+
+6.5.21
+- 'explode' now also works on binary contents
+- 'file-info' modification and creation time where added
+- can now specify \000 in string constants
+- in imported function now up to 10 parameters (previous 8)
+- odbc.lsp module for ODBC communications
+
+6.5.22
+- comparing symbols now includes the context name in their comparison
+- 'name' new function to extract the name of a symbol as astring without the context
+- milli second resolution in 'time-of-day', 'now' and 'time' in Win32
+- newlisp_manual.book for conversion html->pdf with HTMLDOC http://www.easysw.com
+  this makes a printable manual. Print double sided then cut 8.0 x 9 inch, which is
+  2 from the bottom and 0.5 from the right side when printed on 8.5 x 11 inch paper;
+  then spiral bind (thin round spirals, not the flat once).
+- post-url was never working on win32 becuase of missing win32_fwrite
+
+
+===============================================================================
+6.5.23 ----------- released September 17, 2002
+- httpd fix for empty query string 
+- newlisp-IDE-1.6.tgz now saves files up to 10k, changed POST encoding to multi part
+
+6.5.24
+- quote wil not evaluate it's argument anymore, but work like Scheme or Common Lisp
+- in newlisp-tk the lisp file estension can now be configured in newlisp-tk.config
+- in Win32 now line termination gets written as RT-LF, 
+  change also in newlisp-tk.tcl when filling editbox
+- net-read-line now protected from deletion in newlisp-tk browser
+- prettyPrint will never put newline after quote
+- fixed prettyPrint bug when printing empty prettyPrint constructs (while, dotimes etc)
+
+6.5.25
+- quote fixed again (quoted twice)
+
+6.5.26
+- doc fixes
+- date crashed on values resulting in dates before 1970-Jan-1 00:00:00
+  in the Win32 version. In Win32 now minimum value for date is 86400,
+  which is safely on or after 1970-Jan-1 00:00:00 for all time zones
+- NaN can now be put into a variable for comparison
+- division by zero now causes a math exception also in floats (previously
+  inf was returned in cygwin/Unix version and Win32 crashed)
+- in mixed arithmetik using integer operators NaN is taken as 0
+
+6.5.27
+- new function 'constant' to protect symbol contents from changing
+- fixed bug in newlisp-tk.tcl which was introduced after 6.5.23
+  which caused problems in Mouse.lsp (_result -> result in 'tk')
+- 'div' with NaN value raised exception/crashed in Win32, now
+   returns NaN
+- DOMAIN error messages in the Win32 versions are now silenced
+
+6.5.28
+- doc changes
+- new function 'setq', both 'set' and 'setq' and now can take multiple args
+  note that old init.lsp should be updated because of macro for 'setq'
+- new option number 16 in xml-parse for generating SXML output
+
+- 7.0.0 pre release
+- bug fix for 'string', suppresses all pretty-print formatting
+- better error reporting on pop3.lsp and smtp.lsp with debug-flag true
+===============================================================================
+- 7.0.1 release October 24, 2002
+  merged caveGuy's pop3.lsp mail-id improvements
+
+- 7.0.2
+- readLineStream was not initizlized during program startup and caused
+  'current-line' to crash if not used after a 'read-line'
+- direct execution mode with new command line option -e
+- in SXML parsing attribute tags where left strings instead of symbols
+- 'find' now also does regex when looking up a string in list of strings
+
+- 7.0.3
+- example in newLISP for put.cgi in newlisp_manual.html
+- include cgi.lsp in distribution
+- the header in the SMTP interface smtp.lsp was not finished with empty line
+- 'save now can save multiple contexts and/or symbols at once
+- 'open now has a "append" or "a" option
+
+===============================================================================
+- 7.0.4 release February 2, 2003
+  replace now gives error instead of returning 'nil when second arg not
+  list or string
+  new primitive 'lookup' works like assoc with extracting parameter
+  fixed bug in pop3.lsp
+  moved to version 5.4 of Freewrap for making the newlisp-tk.exe, which
+  is now doubled in size because 5.4 doesn't compress anymore (see Freewrap
+  docs).
+
+- 7.0.5
+  Manual improvements in for correct conversion with HTML2DOC
+  additional hour offset parameter in 'now' and 'date'
+  fixed bug in dotree which caused crashes on Windows
+  'context', 'dotree' and 'symbols' now accept unquoted
+  symbol if the symbols is a context.
+  contexts can be deleted again when empty
+  The newlisp-tk Windows version is now wrapped with freewrap v.5.5
+  and based on Tcl/Tk version 8.4.1 and BWidget v.1.6
+  newlisp-tk.tcl has been changed for better usage of 'context'
+
+- 7.1.0-rc1
+  PCRE Perl Compatible Regular Expression support updated to version 4.3
+  in 'replace' now replacement pattern with back references and as 
+  lisp expression. Sub expressions are stored in variable $1, $2 ... etc.
+  $0 contains the whole pattern found. These variables are also filled
+  in 'regex' 'find' (all functions doing regular expressions).
+  The new implementation of 'replace' is also faster (about 15%).
+  example: 
+  (replace "%([0-9A-F][0-9A-F])" str (char (integer(append "0x" $1))) 1)
+  This will do URL translation i.e.: "xxx%41xxx%42" -> "xxxAxxxB".
+
+- 7.1.0-rc2
+  'parse' can take regular expressions in sepearator when additional
+  options parameter is defined (as in find, replace)  
+
+===============================================================================
+- 7.1.0 Release August 28, 2003
+  'search' like 'find' and 'replace' also accepts regular expression
+  when extra options parameter is given.
+  [text] and [/text] can be used as string limiters for large text regions
+  i.e. for HTML in cgi pages written with newLISP. Text limited this way
+  stays completely unprocessed and contain any characters.
+  The function 'symbol' accepts unquoted symbol for context parameter
+  (like 'dotree', 'context', 'symbols')
+  PCRE Perl Compatible Regular Expression support updated to version 4.4
+  extensive manual changes formatting and PDF release  
+
+- 7.1.1
+  surpression of some compiler warnings in Mac OSX compile
+  makefile for linux has strip turned on and readline support
+  was not the default
+
+- 7.1.2
+  third parameter in 'symbol' for supression of symbol creation, if
+  not found; return 'nil instead.
+  HTML manual had formatting error, which caused all after 'regex'
+  to be in curier.
+
+===============================================================================
+- 7.1.3 release September 3, 2003
+  [text]...[/text] caused problems in TCP/IP communications
+ 
+===============================================================================
+- 7.1.4 release September 6, 2003
+  uninitialized memory in writeStreamStr() caused problems when
+  running newlisp-tk and transferring bigger string buffers.
+  win32_fprintf() did not work right for buffers > 2048, which
+  caused problems in browsing bigger buffers in newLISP-tk.
+
+- 7.1.6
+  new function 'process' for launching independent child processes
+  (will not block), new function 'pipe' for use with child processes.
+
+  'if' now accepts multiple condition-exp pairs and then works like a
+  cond without parenthesis around condition-value. 'if' with
+  condition-exp-exp or condition-exp still works like before.
+
+  new 'net-send-udp' and 'net-receive-udp' for UDP communications
+  without need of net-listen,net-accept and net-connect. 
+
+  On Mac OSX 'import' is now enabled using to addtional files
+  osx-dlfcn.n/h for compiling. This import is for '.dylib'
+  libaries.
+  'append' now also can append binary strings (i.e. containing 0's)
+  'joint' now also can joint binary strings (including the joint string)
+
+  if the length of a sublist in slice is 0 then sice returns the empty
+  list '(), previously returned nil. This is more consistent with the
+  behavior of slice on strings and at the end of lists.
+
+  'write-buffer' now acepts both: a symbol or a string
+
+  'send' now accepts both: a symbol or a string
+  
+  'symbol' pretended to create a symbol although context would not exist
+
+  error messages now include the offending expression/parameter which
+  caused the error.
+
+
+- 7.1.7
+  speedup in UDP communications (no session registration)
+  memory leak fixed in 'net-receive-udp'
+
+  'first' of an empty string now returns an empty string, previously nil
+
+  improved cgi.lsp
+
+  'reverse' now works on strings
+
+- 7.1.8
+  'throw' now is documented (actually happened in 7.1.7)
+
+  'collect' and 'select' now also work on strings
+  i.e: (collect "2001-09-20" 5 6 8 9 0 1 2 3) => "09202001"
+
+  'slice' couldn't slice lambda's
+
+  memory leak in searchBufferRegex() affecting 'find' and 'replace' was fixed
+
+- 7.1.9  
+  'set' with multiple args had a cell memory leak
+
+  'transpose' had a memory leak
+
+- 7.1.10
+  logfile support for remote mode -p and -d with '-l logfilename'
+
+  fixed bug in pretty print on command line
+
+  fixed bug in 'save', which went into a loop when saving symbols containing
+  contexts
+
+- 7.1.12 
+  logfile with string -L options also logs remote command line input
+ 
+  'fft' and 'ifft' now can take plain numbers instead of complex numbers
+  or a mixture of both
+
+  regular expression speedup 5 to 50% by chaching the search pattern
+  and avoiding recompile, speedup greatly depends on complexity of
+  pattern relatively to the length of the search string
+
+  rearranged functions in source files to make newlisp.c more manageable
+
+  eliminated various unecessary typedefs
+
+  Sun SOLARIS is now supported (not much tested though)
+
+  operating system number in last position of 'sys-info'
+  linux 1, bsd 2, osx 3, solaris 4, cygwin 5, win32 6
+
+  strings containig zeros are now displayed correctly i.e. 
+  (pack "c c c" 0 1 2 3) => "\000\001\002\003"
+
+- 7.1.14
+  redundancy in printString() eliminated
+
+  memory leak in 'parse' with regex fixed
+
+  the userdefined function for an error is now reported
+
+  overall speedup since 7104 of about 5%
+
+  commented out undocumented function 'symbol-dump'
+
+===============================================================================
+- 7.2.0 is 7.1.14 released October 2nd, 2003
+
+
+- 7.2.1
+  moved check for symbol type of lambdaFunc to errorProc for efficiency
+
+  cleanup of unecessary defines in newlisp.h
+
+  defined 'vasprintf()' to take advantage of vasprintf() where available
+
+  'format' now checks for correct number of arguments and well formed
+  format string, it should not crash anymore on mismatch of number
+  and type of parameters
+
+  newLISP-tk is now version 1.0 with changes for multiline 'tk' statements
+  (stements containing line-breaks), this allows sending bigger Tcl/Tk
+  code portions in one 'tk' statement
+
+- 7.2.2
+  force creation of $0, $1 ... in MAIN even when used in different context
+  for the first time
+
+  supress $0, $1 ... in newlisp-tk frontend in variable listbox
+  (the $ would confuse tk)
+
+- 7.2.3
+  replace-assoc now also uses the system variable $0 for the old
+  list, which can be reused in the replacement expression, i.e:
+
+  (set 'lst '((a 1)(b 2)(c 3))) 
+  (replace-assoc 'b lst (list 'b (+ 1 (last $0))))
+  lst => ((a 1)(b 3)(c 3))
+
+  replace-nth now also uses the system variable $0 for the old element, i.e:
+
+  (set 'lst '(1 2 3 4))
+  (replace-nth 1 lst (+ $0 1))
+  lst => '(1 3 3 4)
+
+  added new module 'ftp.lsp' for get/put ftp transfers
+
+  updated module smtp.lsp and program spam-filter
+
+  symbols set with 'constant' now also gets saved with 'constant'
+
+  introduced getContext() for code savings
+
+  added error message in 'import' for win32
+  
+  eliminated win32.cmd
+
+  many documentation changes/fixes, rewritten introduction
+  added chapter about deprecated functions
+
+  changes in set/define functions for better protection and
+  error messages of protected symbols
+
+  full stack trace on error messages
+
+- 7.2.4
+  replace-assoc now returns the changed list instead of the old
+  association found (which is now in $0)
+  
+  replace-nth now return the changed list instead of the old
+  expression found (which is now in $0)
+  now checks also for missing last argument
+
+  replace now returns changed list or string
+  for changed list count of replacements in $0
+  count for string replacements is not available any more
+  (could be handled in replacement expression)
+  now checks also for missing last argument
+
+  remove now returns the changed list
+  and the number of removed elements in $0
+
+- 7.2.5
+  chop now also works on lists
+
+  coding improvements in slice/sublist() and substring()
+
+  newlisp-tk 1.02 now on Linux tmp directory is in the home
+  directory of the user running newlisp-tk
+
+  replace with expression in replacement would overflow CPU stack
+  after 2048 replacements, now no limit
+
+  cgi.lsp v.1.2 now lives in a context CGI for better isolation
+
+  httpd v.3.0 with bugfixes for big POST buffers
+
+  new module infix.lsp for parsing infix expressions
+
+  in newlisp-tk changed /tmp to tmp for Linux/UNIX
+
+- 7.2.6
+  (new CTX 'CTX2) copies context CTX to CTX2, helps using
+  contexts a objects, which can be instantiated from a template
+  context
+
+  'define' 'constant' used in contexts will always force creation
+  of the symbol in that context, never overwrite definitions in
+  MAIN. This is changed behaviour also be reflected in the documentation.
+  The old way was leading to unexpected definitions in MAIN of symbols
+  although loaded from a context. 'set' still will first look for a
+  global in MAIN.
+
+  fixed false error messaging on certain parenthesis errors
+
+  fixed wrong error message when trying to define protected
+  symbol
+
+  error message 'parameter out of range when calling 'gammai',
+ 'beta' or 'gammaln' with first parameter 0.
+
+- 7.2.7
+  contexts now can be assigned to variables and referenced
+  during runtime, i.e. 'contextVar:varName' with late binding
+  of contextVar.  New possibilities of OO programming and lexically
+  scoped programming, see new chapter in the users manual
+  about 'Programming with context objects'.
+
+  stronger separation of contexts from context MAIN, only
+  primitive symbols, context symbols, true and nil are
+  inherited
+
+  'new' now returns the new context, formerly 'true'
+
+  'set', 'setq', 'set!', 'constant' now return the value of
+  the symbol set when the rvalue is missing i.e:
+  (constant 'foo) will make foo a constant and return it's
+  curent value
+
+  protected all symbols in MAIN in newlisp-tk.tcl v 1.03
+  against accidental overwrite
+
+  cleaned up toal mess of tem pdir detection in unix mode
+
+  cleaned up init.lsp
+
+  'nth' now can take multiple indices, i.e.:
+  (nth 1 2 0 '(1 (a b (c d)))) => c
+  good for working with matrices or sparse matrices
+  out of bounds indices return the last in dimension
+
+  'set-nth' like former 'replace-nth' but multidimensional
+  like 'nth'
+  (set-nth 1 2 0 '(1 (a b (c d))) 'x) =>  (1 (a b (x d)))
+
+- 7.2.8
+  eliminated statics in lambda expression, not necessary
+  anymore as we have dynamic contexts, which also
+  create a lexically closure around vars
+
+  fix in dolist, how cleanup is done
+
+===============================================================================
+- 7.3.0 Released version 2003/11/03
+  (cpymen fromAddress toAdress nBytes), address may be integer
+  or string, only for internal use, not documented. Could be
+  used with 'dump' to hack lisp-cells and symbols-cells.
+  i.e. to unprotect a symbol :
+  (cpymem (pack "c c" 0 32) (last (dump 'sym)) 2)
+
+  fixed error message reporting in 'set-nth'
+
+- 7.3.1
+  'import' was broken in Win32 native version when working
+  inside contexts (odbc.lsp and mysql.lsp)
+
+  (pretty-print line-length indent-string)
+  experimental not documented yet, to change pretty printing
+  behaviour, without args returns current status => (64 " ")
+  64 length 1 space for indenting
+
+- 7.3.2
+  'char', 'collect', 'lookup', 'nth', 'pop', 'push', 'select', 'set-nth'
+  and 'slice' now all accept negative offset which will count from the 
+  end of a list i.e. (slice "newLISP" -4 2) => "LI"
+
+  'push' and 'pop' now can take multidimensional offsets like
+  'nth' and 'set-nth'
+
+  'collect'/'select' now return the last element for offsets to big
+  (formerly nil)
+
+  'pretty-print' now tested and documented
+
+  1.e-1 or 123. , a decimal point without following digits is
+  no an accepted number format
+
+  in newlisp-tk the windows position gets now saved when saving
+  Options/Settings
+
+  fixed bug in 'let' when returning a local var
+
+- 7.3.3
+  new 'push' changed 'nilCell'
+
+- 7.3.4
+  newlisp_manual.html with Kazemori edits
+  
+  'list' now accepts unlimited number of arguments
+
+- 7.3.5
+  'push' could not append to an empty list
+
+  handling big buffers in newlisp-tk in evaluation
+
+  common floating point exception handling on all
+  platforms (BorlandC and GCC)
+
+  block mode for remote connection starting with [cmd]
+  on a line by itself and finishing with [/cmd] on
+  a line by itself
+ 
+  sets locale environment on non-US versions of an OS
+  platform, this enables automatically correct character
+  handling (i.e. upper-case) on non-engish character sets
+ 
+- 7.3.7
+  newlisp-tk.tcl now takes advantage of new block mode (multiple
+  lines in interactive mode). This ways one of the ports in
+  communication with newlisp could be eliminated and browser-editor
+  buffers of unlimited length can be evaluated, preferrably in
+  evaluation without printing (left of the two buttons)
+
+  doc changes for 'silent'
+
+- 7.3.8
+  'let' now accepts also alternative syntax without the parenthesis
+  around var - exp pairs: (let (var1 exp1 var2 exp2 ...) body )
+
+  doc changes for 'let' and chapter 'Lambda expression'
+  doc change new function 'set-locale'
+  doc change new sub chapter 'Switching the locale' in chapter
+  'Localization and customization'
+  doc change new file LOCALIZATION
+
+  'fn' may be used instaed of 'lambda' (save typing)
+ 
+  'set-locale' changes usage: (set-locale) => return current
+  setting, (set-locale "") => switches to local locale with
+  all option turned on. (set-locale str int) switches to locale
+  in str with category option int as speicied in "locale.h" of
+  platform/OS, look for defs of LC_ALL, LC_NUNMERIC etc..
+  on  startup newLISP tries to swithc to ISO "C" locale.
+
+- 7.3.9
+  'push' and 'pop' now can take the int-offsets in a list to
+   work together with new 'ref' which reports the position of an
+   expression in a nested list
+
+   doc changes (sometimes only small changes)
+        'push', 'pop', 'symbol?' new function 'ref'
+	'save', 'set', 'Arrays and Hash Tables ...', 'close',
+	'cons', 'context', 'delete', 'explode', 'fft', 'find',
+	'format', 'intersect', 'lambda?', 'length', 'let'
+	'make-dir', 'match', 'net-receive', 'net-select',
+	'net-send', 'new'
+
+   changed options flag will trigger recompile when caching regular
+   expression patterns
+
+   'select' evaluated args in offset list
+
+   'join' evaluated args in string list
+
+   'append'' evaluated the first string arg double
+
+   all type predicates now given an error message if the
+   argument is missing, previously 'nil' ('true' on atom?)
+
+   getting an int from a 'inf' floating point crashed on  Borland Win32
+   now returns 0 like on other platforms
+
+- 7.3.10
+  'remove' didn't check for list type in second arg and bombed
+
+- 7.3.11
+  new compile for Win32 DLL with makefile_win32dll
+  see file win32dll.readme for unsolved issues
+
+- 7.3.12
+  (replace expr aList) now works like 'remove', but for removing
+  strings the empty string "" must still be specified:
+  (replace str aString "")
+  'remove' is deprecated and will not be available anymore in 8.0
+
+  new 'flat' to flatten lists complements multidimensional set
+  of list functions, example:
+  (set 'lst '(a (b (c d))))
+  (map (fn (x) (ref x lst)) (flat lst)) => ((0) (1 0) (1 1 0) (1 1 1))
+
+  newlisp.dll now runs qa suite
+
+- 7.3.14
+  DLL now suppresses pop up on FP domain error (thanks Steve)
+  DLL now also can use print statment, output will be in return
+  value.
+
+  'replace' did not work correctly when removing multiple expressions
+  at the beginning of a list
+
+  doc changes 'replace', 'flat', chapter 'Deprecated functions'
+               chapter 'DLL module ...'
+
+  error message for "string too long" now reports shorter string
+
+- 7.3.15
+  better error reporting on some string getting functions when arg
+  is missing
+
+  doc changes license change for documentation, misc. links
+
+  replace could not handle empty search string
+
+  Win32 DLL no contained in Win32 distribution
+
+  fixed error in httpd
+
+- 7.3.16
+  error messages in newlisp.dll where broken becuase of wrong makefile_win32dll
+
+  newlisp-tk.html now reformatted to manual HTML for better maintenance/conversion
+
+  slight optimixation in 'nth' and 'set-nth'
+
+  fix for 'nth' on empty string
+
+  better error messages on missing args in various functions
+
+  link.lsp now also works on win32 DLLs but is not supported anymore
+  for CYGWIN, use a win32 compiled newlisp.exe and newlisp.dll instead,
+  both work fine under CYGWIN
+
+  doc change for chapter 'Win32 DLL  ...'
+ 
+  fixed 'silent' mode for DLL
+
+  'float' conversion noe accepts leading . without zero like the
+  internal parser
+
+- 7.3.17
+  doc changes as of Sam Cox's and Nigel's postings on 
+  http://www.alh.net/newlisp/phpbb/ on 2003-12-07
+
+  new functions 'atan2' and 'irr' and documentation
+
+  eliminated compiler warnings for Linux GCC 3.3.1
+
+- 7.4.0rc1
+  'irr' now strips of digits less than precision 1e-5
+
+  'set-nth' alsow works on strings (singular index)
+
+  'swap' now works on strings, also return value changed
+  from swapped pair to changes list/string
+
+  'pretty-print' had a cell leak
+
+  in the installation for LINUX/BSD etc. the doc directory has been
+  moved from /usr/doc/newlisp to /usr/share/doc/newlisp
+  newlisp-tk.tcl 1.07 changed accordingly
+
+  upgrade to PCRE 4.5 files
+
+  'integer' didn't truncate to -MAX_LONG
+
+  'integer' did not truncate to MAX_LONG when feeding big
+  floating point numbers, but crashed on Win32
+
+  on Win32 float functions on NaN crashed
+
+  doc changes: integer, NaN?, error-event, error-text, atan2
+
+- 7.4.0rc2
+  enabled error events in Win32 DLL module
+
+  update finger example file and example in doc
+  doc change 'net-connect'
+
+- 7.4.0rc3
+  floats now work in imported fuctions (tested on x86 platforms)
+  and up to 14 parameters (previously 10) are accepted, floats
+  count as two
+
+  nth-set like set-nth but different return value, was in rc2
+  but now documented
+
+  doc changes: chapter 'Functions in groups', 'import', 'inc', 'dec'
+              arithmetik operators +,-,*,/, 'set-nth', 'nth-set'
+              'sort', '%', 'mod', '<,>,=,<=,>='
+
+  doc new file: hacking_newlisp.html with describes previously
+  undocumented features
+
+  'for', 'dotimes', 'seqence', 'series' now return a 'invalid parameter: NAN'
+  error when NaN parameters are passed
+
+===============================================================================
+- 7.4.0 release 2003/12/20
+- 7.4.1
+  commandline switch '-m N' where N is the max number of megabyte newLISP
+  is allowed to allocate for LISP cells
+
+  setq,set!, define (as set) did not work right with dynamic context vars
+
+- 7.4.2
+  %s format now recognizes precision i.e: (format "%5.2" "hello") => "   he"
+
+  various doc changes
+
+  pop3.lsp now handles pop3 servers w/o LAST command, but only on the
+  functions: get-all-mail and delete-all-mail
+
+  char did not convert the  0 correctly, now: (char 0) => "\000"
+
+- 7.4.3
+  fixed printing context name when in a context other than MAIN
+  this affected the newlisp-tk frontend since v. 7.2.7
+
+  many doc corrections, now rev 5
+
+- 7.4.4
+  (now ... ) returns an additional number 'minutes west of GMT' 
+  for the timezone offset 
+
+  the optional time ofset parameter in 'date' and 'now' must now
+  be given in minutes west of GMT, was previously in hours, 
+  standard when using time zone offsets
+
+  max cell count as specified in command line swith -m now second
+  number in 'sys-info' if not specified defaults to 0x10000000
+
+  doc addition of -m commandline switch and change in 'sys-info'
+
+- 7.4.5
+  format now can take unlimited number of parameters, before 2048
+
+  changes in stat.lsp, smtp.lsp and httpd for new 'sys-info'
+
+- 7.4.6
+  fixed problem in float -> integer conversion of big numbers
+
+  attempt to fix for last parameter of 'now' for solaris (not tested)
+
+- 7.4.7
+  updated to BWidget-1.7 in newlisp-tk (since 7.4.6)
+
+  timezone offset in return value for 'now' set to 0 on SOLARIS
+
+  plotting with stat.lsp and gnuplot was messed up on Win32, now
+  can also do multiple plot one after another using 'process' instead
+  of exec
+
+  eliminated 'gettime' example, as that service doesn't run on most
+  computers these days
+
+  'import' on Win32 now can use cdecl calling conventions with
+  additional parameter string "cdecl" when importing functions. 
+  This allows calling many third party DLLs without special wrapper DLLs
+  On LINUX etc. the extra parameter is ignored.
+  
+  mysql.lsp version 2.0, several functions changed and offsets defined
+  for MySQL v.4.0, previous versions will not work
+
+- 7.4.8
+  improved error message for missing par
+
+  sqlite.lsp - module for SQLite datavase from http://www.sqlite.org
+  
+  mysql.lsp small fixes and revised test routine, tested on MySQL v. 4.0
+
+  'transpose' now transposes any kind of matrix (previously only matrices
+  containing numbers; it also rectangualarizes matrices; speed improved
+  3 fold.
+ 
+  in 'if' and 'cond': if the last condition given is the empty listy ()
+  which evaluates to nil in a boolean context, and if no then/else actions
+  or now cond action is given, then the empty list () is returned (previusly nil) .
+
+  fix for 'date' which crashed at values overflowing int32 (2038 1 19 3:14:07)
+
+  logging has been changed to a fixed filename 'newlisp-log.txt
+
+  new command line switch -h
+
+  better pretty printing of symbols which are constant and global
+
+===============================================================================
+- 7.5.0 RELEASE 2004-01-21
+  cgi.lsp, form.html, form.cgi where missing from FILES inventory
+
+  new 'sqlite.cgi' web script for administering SQLite database in newLISP
+
+  eliminated various unused vars with -w8004
+
+  fixded bug in 'global' printing
+ 
+  changed directory structure, new dirs: doc, examples, modules 
+ 
+- 7.5.1
+  (rotate '()) crashed because of list length zero
+
+  fixed nested catch/throw
+
+  fixed lambda stack oberflow after 3000 catch
+ 
+  eliminated array.lsp instead shorter hash.lsp for hash functions
+
+  changed sqlite.lsp to version 1.6, name change for future 
+  reserved word 'array' 
+
+  dynamic context var refs now work inside contexts, this makes
+  it possible to call constructors from inside the class context
+
+  improvement of floating point speed 60% in simple arithmetik
+  and 25% in most floating point functions
+
+  (format "%d" 1.23) => "1" before this was not permitted
+  (format "%5.2f" 10) => "10.00" also allowed now
+
+- 7.5.2
+  (array i j k aList), returns a 1 to 8 dimensional array and
+  initializes optionally from flat list in aList 
+
+  (array-list myArray) returns a list conversion of myArray
+
+  (aray? expr) tests if expression is a list
+
+  all array acces modification via nth, set-nth and nth-set
+
+  also released benchmarks  comparing with Perl, Python and Guile,
+  see at: http://newlisp.org/benchmarks
+
+
+- 7.5.3
+  (seek 0) now returns numbers of characters printed to stdout,
+  works on BSD but on LINUX and Win32 will always return -1
+
+  'integer' now takes additional base parameter after the
+  default parameter, i.e:  (integer "1111" 0 2) => 15
+  note, that hex numbers still need to be prefixed with 0x
+  even when specifying base 16
+
+  added txt2pdf.lsp as a new module in the module directory
+
+  comprehensive manual edit by Brian Clausing (thanks!)
+
+  new chapter about linking LISP source and executable
+
+  all deprecated functions thrown out:
+  concat, remove, replace-nth, sublist, substring, read-process
+  read-url, write-process. All have replacements, see manual.
+
+  changed cgi.lsp, stat.lsp, spam-filter for deprecated functions
+
+  1% overall speed improvement 0.5% size reduction
+
+  nth didn't work on lambda in 7502
+
+  'format' increasing of ars beyond 2048 has been rolled back
+  because of problems when evaluation of args is deeply nested
+
+- 7.5.3a
+  changes in newlisp-tk.tcl for deprecated 'remove'
+  changes in qa for deprecated functions
+
+ 
+- 7.5.4
+  15% speedup in 'format'
+
+  writeStreamStr() and readStreamText() did not handle zeros
+
+  'source' like save on strings eliminates tmp directory in
+  new newlisp-tk v.1.09
+
+  1000+ times speedup in XML parsing of bigger files 
+  changing a strncpy() to a memcpy()
+
+- 7.5.6
+  newlisp-tk 1.10 now shows message box when trying to open
+  debugger with browsers at the same time
+
+  updated FILES inventory
+
+  logging did not work as described (was always on with -p -d)
+
+  net-listen and net-receive-udp take as an additional optional
+  parameter the address the listening socket should bind for
+  computers with multiple network adapters
+
+  optional last parameter in net-send-udp for specifying 
+  broadcast mode with 'true' (or anything not evaluating to nil), 
+  not necessary on wome Win OS where '255' on last address byte 
+  is enough to turn on broadcast mode
+
+  Ctrl-C handler simple on Win32 and with continue, exit, reset
+  menu on LINUX/BSD (somewhat unreliable?)
+
+  Broken Pipe on net-send now handled correctly on Linux/BSD
+  is handled by socket stack on Win32
+
+  (slice str 1 -1) does not crash anymore (length arg should
+  never be negative)
+
+- 7.5.7
+  signal handlers now initialized before loading commandline
+  scripts
+
+- 7.5.8
+  shorter code for swap
+  
+  defunct zombie child processes now cleaned up by 'process'
+  on UNIXs
+
+  fixed potential bug in regex replace when replacement expression
+  evaluates to no-string
+
+- 7.5.9
+  all functions changing the contents of a symbol (destructive
+  functions) will now cause an error when used on symbols protected
+  with 'constant', previously it worked only with set, set!, setq
+  and define, define-macro; loop variables in dotimes, for, dolist
+  and dotree are protected against change by user with an error 
+  message during looping and may not be constant before the looping
+  starts using them
+  
+  new manual chapter about 'Variable names and numbers syntax"
+  
+  bug fixes/additions in httpd, now version 3.3
+  
+  fixed potential memory overwrites in nl-web.c
+
+  error message length limited to 1024 characters
+
+- 7.5.10
+  rolled back symbol protection for dotree and dolist, which
+  is not necessary
+
+- 7.5.11
+  new mode for 'open' "pipe' or "p" opens a named pipe non-blocking
+  for reading
+
+- 7.5.12
+  rolled back protection for dotimes, for loop variable solving
+  crash problem in different way
+
+- 7.5.14
+  documentation fixes and compiler warnings fixes
+
+  two additional file for viewing manual in frames with index
+
+  the Win32 installer puts entries in startmenu including an uninstall
+
+  The WIn32 installer puts a newLISP icon in desktop and startmenu links
+
+  protect built-in functions from overwriting with import but the 
+  function can still be imported in a context different from MAIN
+
+  eliminated "pipe" or "p" mode in 'open' instead "non-block" or "n"
+  as additional option after "read" or "write" option
+
+  net-lookup, net-select, net-send-udp, net-peek did not clear net-error
+
+  net-select now can accept a list of sockets instead of one socket
+  net-select now has a third mode "exception" or "e" to test error
+  conditions on socket
+
+  apply works reducing a list when additional reduce count is given
+
+  load takes multiple filenames
+
+- 7.5.15
+  integer and float now return nil or the default value when type
+  other than string or number is specified, previously this
+  caused an error message
+
+  expanded chapter on Tcl/Tk Variables in:
+  "Writing applications with newLISP and Tcl/Tk"
+
+- 8.0.0rc1  
+  added more examples to newlisp-tk.html
+
+  allow [cmd] tag in -d mode
+
+  reopen mode in [cmd] section for potential memory leak after
+  error conditions or on reconnect
+
+  allow contexts to be overcopied (broke benchmarks)
+ 
+- 8.0.0rc3
+  re-fixes the memory leak for [cmd] tags
+
+- 8.0.0rc4
+  doc changes manpage
+
+  take abs() value in -m commandline option 
+
+  reorder help menu for logical sequence of options
+
+  newlisp-tk 1.12 now tolerant for not finding "Fixedsys",
+  "Lucida Console" or "fixed" fnt. Will take first font found
+  
+  newlisp-tk 1.12 now save newlisp-tk.con correctly in home directory
+  of UNIX (startup dir in Win32)
+  
+  man page for LINUX et al, thankyou Nigel Brown 
+
+- 8.0 released April 7 2004 ============================================
+  version nunbers changed from 8.0.0 to 8.0 to distinguish
+  rc versions from final version
+
+  sys-info now returns 7 as OS number of win32dll
+
+  corrections in MemoryManagement.html and newlisp_manual.html
+
+- 8.0.1
+  changed package version number to dotted form for compatibility with
+  RPM packaging
+
+  changed Makefile install option for RPM compatibility and added
+  'make rpm' for makeing rpm package
+
+  man page for newlisp-tk 
+
+  array was not serialized correctly in 'source' and 'save'
+
+  negative indices in arrays, which are too big now give out-of-bounds 
+  error (previously took first element as for lists)
+
+  now up to 16 indices can be specified, previously 8
+
+  changes in docs for array chapter and functions
+
+  in newLISP-tk under Linux/Unix file open dialog now starts
+  with /usr/share/newlisp/newlisp-tk
+
+
+- 8.0.2 Released 2004-05-02 ============================================
+
+  httpd version 3.5
+  
+  doc changes
+
+- 8.0.3
+  constant did not allow multiple args
+
+  parse now recognizes zero length token and stops parsing
+  instaed of going into a loop
+
+  fix for contextvars in tcl/tlk IDE v1.15 and p_context()
+
+  bug fixes in cgi.lsp now v.1.5
+
+  documentation corrections
+
+  a bug fix in the reset routine
+
+- 8.0.4
+  fixed the fix in reset
+ 
+  cell leaks in error messages in catch/throw situations are now avoided
+
+- 8.0.5
+  filter now filters nil symbols like nil values (like if, while, not etc)
+  this effects the function index in the same way
+
+  access system variables $0, $1 ... etc. with an index ($ 0), ($ 1) .. ($ i)
+  where i is an integer
+
+  bug fix for catch when result variable has same contents as return from
+  catch statement
+
+- 8.0.6 Released 2004-06-06 ============================================
+  new env replaces deprecated environ, getenv, putenv (still available but
+  to be eliminated in 8.1)
+
+  additional paragraph about ovewriting global symbols in the chapter
+  'Contexts' 
+
+- 8.0.7
+  net-receive-udp can take an additional timeout parameter 
+
+  doc changes for net-receive-udp
+
+  new example whitelist-filter for email filtering
+
+- 8.0.8
+  trim now can take optional second trim-character parameter:
+  (trim "---HELLO===" "-" "=") => "HELLO"
+  (trim "0001234" "0" "") => "1234"
+  allows trimming of only one side (empty string) or different
+  trimming left and right
+
+  new functions 'utf8' and 'unicode' to convert between utf8
+  and UCS-4 encoded Unicode
+
+  UTF-8 versions of: char, upper-case, lower-case, first, rest,
+                    chop, explode, last, trim, collect select,
+		    nth, set-nth, nth-set
+
+  any positions/indices in the UTF-8 versions  of char, nth
+  set-nth and nth-set refer to (multibyte)character positions
+  rather than byte positions
+
+  find and regex return byte positions, slice takes byte positions
+  reverse always works on byte level, to reverse utf8 strings use:
+  (join (reverse (explode str)))
+
+  changed parsing of octal numbers 090 now "0" "90"
+
+- 8.0.9
+  'source' now also working on context symbols
+  fix for 'trim' in utf8 version
+  fix for 'set-nth' and 'nth-set' in utf8 version
+  version 3.7 httpd fixing problems with post on IE
+
+- 8.0.10
+  'net-sessions' now registers connecting peer in -p -d modes
+  makefiles for MinGW compiler for newlisp.exe and newlisp.dll
+  MinGW will eventually replace Borland BCC 5.5 as the default
+  compiler for the Win32 binary distribution
+ 
+- 8.0.11
+  a fix for server crash in -d mode when reconnecting on Linux
+
+- 8.0.12
+  now will reset when client exits in -d demon mode (still does
+  not maintain demon mode on slackware 2.4 but Debian 2.6
+  Linux Mandrakae 9.2/2.4.22 and FreeBSD  4.7 are OK)
+
+  new function (dup expr n) repeats expression n times in
+  list or string
+  function 'pipe' works on MinGW compiled version
+
+- 8.0.13-14
+  fix of 'test-pipe' in fle qa
+  new option in Makefile: make uninstall
+  /usr/share/newlisp/init.lsp now tries to load $HOME/.init.lsp
+  as a user specific .init.lsp after the system wide init.lsp
+  $HOME gets defined as (env "HOME") or (env "USERPROFILE") 
+  or (env "DOCUMENT_ROOT")  
+  whatever is available in that sequence
+  fixes restart problem in demon mode
+
+- 8.0.15
+  makefiles for newlisp as a shared library on Linux and BSD:
+  newlisp.so, the function to import is: newlispEvalStr
+
+  'print' and 'println' in newlisp.dll now  are always
+   returned correctly in the return value of 'dllEvaStr'
+   was not working correctly before in many cirumstances
+
+  'newlispEvalStr' will replace 'dllEvalStr' in future
+   version in newlisp.dll, at the moment both work
+   this change was made for consistency over platforms
+
+   new chapter "Shared library newlisp.so on Linux/BSD" in users manual
+
+- 8.0.16
+   doc changes for 'net-receive-udp'
+   'net-receive-udp' can now receive on a specific IP address, this
+   was documented already but not working
+
+   'net-connect' and 'net-listen' ca use a "udp" option to do
+   nonblocking UDP data exchange with net-send and net-receive and
+   without immediate closing of socket as happening using
+   net-receive-udp and net-send-udp. See documenataion for
+   net-listen and net-connect in the manual
+
+   improved error message for missing parenthesis 
+
+   newlisp.vim VIM syntax file now included in source distribution
+   thanks to David from http://www.geocities.com/excaliborus/ for
+   this contribution
+  
+   updated the CREDITS file
+
+   all predicates, which ended in p when using HTML (i.e. listp for list?)
+   have been renamed to using the '?' instead of 'p' in HTML to make
+   utilities, which position in the newlisp_manual.html work
+
+- 8.1.0rc1
+   fixed memory leak in 'irr'
+  
+   new 'net-receive-from' and 'net-send-to' for non-blocking UDP
+   communications over open connections
+
+- 8.1.0rc2 
+   an almost double speed and smaller parser for pack/unpack format strings,
+   which does not need spaces in between the format specifiers
+
+   a fix in net-send-udp not closing the socket after the new changes in rc1
+
+   doc changes
+
+- 8.1.0 Released version on 2004-08-10 ========================================
+  two new example programs: udp-server.lsp and udp-client.lsp to demo
+  non-blockig UDP communications
+
+  merged bugfixes from dlcompat as of cvs 2004-07-12  Peter O'Gorman
+  this affects only Mac OSX
+
+  added -c option for suppressing the prompt
+
+  added node.lsp in modules directory for building newLISP clusters.
+
+  new versions of several modules and example files to account for
+  new version numbering
+
+- 8.1.1
+  sleep now rounds to the nearest full second on systems where nanosleep()
+  is not available.
+
+  timeout option in net-receive-udp works again
+
+- 8.1.2
+  'make install_home' and 'make uninstall_home' of installations on Linux/UNIX
+  in the home directory of the user in $HOME/bin and $HOME/share/
+
+  'search' crashed on invalid filehandles
+
+  new 'expand' for expanding variable bindings in lists
+
+- 8.1.3
+  a fix for 'get-url' on some Solaris installations
+
+- 8.1.4 released August 21st, 2004 ==========================================
+  doc changes ansd new option 'make version' for changing version numbers
+  in all affected files
+
+- 8.1.5
+  nl-sock.c missed a change for Win CE, PocketPC
+
+  qa - testfile now complete with all functions, use: ./newlisp qa to test
+  without process and test functions using process, or use: ./newlisp qa ext
+  to test for all function (only Win32 and Linux)
+
+  a fix for timeout values > 1000000 usec on BSD and Solaris in net-select
+  and net-receive-udp
+
+  in net-listen and net-connect specify "multi" or "m" instead of "udp"
+  for UDP Multicast mode
+
+- 8.1.6
+  'collect' and 'select' are collapsed into 'select' which is now also
+  type polymorph on the second parameter.
+
+  new makefile_solaris_utf8
+
+  new 'fork' function for lauching a newLISP child process thread
+  on Linux/UNIX only and CYGWIN on Win32.
+
+- 8.1.7
+  fixed rounding error in 'sleep' when compiled with NANOSLEEP
+
+  improved qa routines using 'fork' on Linux/UNIX for some tests
+
+- 8.1.8
+  new 'wait-pid'for watching the status of child threads created with 'fork'
+  and proccesses created with 'process'
+
+  upgraded to PCRE v. 5.0
+
+  more tweaks in qa file
+
+  fixed potential memory leak in 'new'
+
+- 8.2.0 Release September 21st, 2004 ======================================
+
+- 8.2.1
+  write-buffer can now take string instead of file handle to write
+  to a string in a string growing (concatenating) fashion, this is
+  much faster then doing (set 'str (append str content)) now:
+  (write-buffer str content)
+
+  'symbol' now can overwrite global symbols from MAIN (i.e. built-ins)
+  i.e. (symbol "print" 'MyContext)
+
+  'process' now ca take to addtioal pipe handle parameters, which
+  get mapped to stdin and stdout for the new process:
+  (map '(myin bcout) (pipe))
+  (map '(bcin myout) (pipe))
+  (process "bc" bcin bcout)
+  (write-buffer myout "3 + 4\n")
+  (read-line myin) => "7"
+
+  'semaphore' lets you create wait and signal semaphores
+  (set 'sid (semaphore)) ; aquire
+  (semaphore sid -1)     ; wait
+  (semaphore sid 1)      ; signal
+  (semaphore sid) => 1   ; status
+  (semaphore sid 0)      ; release/delete
+
+  'share' to create shared memrory regions
+  (share) => address off mmap share
+  (share addr exp) => sets addr to exp for integers, floats and strings
+  (share addr) => returns integer, float or string exp
+
+  added newLISP-Excel-Import.xls example to examples/ directory
+  added prodcons.lsp - demo for fork, wait-pid, semaphore and share
+
+- 8.2.2
+  'write-line' with string device like 'write-buffer', in both
+  symbol is now protected if protected with constant
+
+  share was broken for strings
+
+- 8.2.3
+
+  pipe is now also available on CGWIN and Borland compiled versions
+  on all Win32 versions pipe can now remap std I/O like on Linux/UNIX:
+
+  (map '(myin bcout) (pipe))
+  (map '(bcin myout) (pipe))
+  (process "bc" bcin bcout)
+  (write-buffer myout "3 + 4\n")
+  (read-line myin) => "7"
+
+  process on Win32 can hide or minimize window:
+  (process application 0 0 0) => hide app
+  (process application 0 0 1) => show app
+  (process application 0 0 2) => minimize app
+
+  'share' and 'semaphore' are now also available on Win32
+
+  improvements in qa file, now tests all functions by default w/o ext option
+  better syncronization on some tests with semaphores
+
+  'match' in list mode now only returns matched expressions
+
+  (map set '(x y) (match '(a (? c) d *) '(a (b c) d e f)))
+  x => b
+  y => (e f)
+
+  when using match with an optional third parameter 'true', it works
+  in the old fashion:  (map pattern aList true) => works like before
+
+  The context default function is a userdefined function with the same name
+  as the context it resides in, i.e: (define (ctx:ctx a b) (+ a b)) and can
+  be called just with the context name (ctx 3 4) => 7. 
+  Default functions should only be called rom MAIN, or have already been 
+  loaded or their context created before referred to in another context or
+  default function.  Not yet 'official' see doc/default_functions.html
+
+  fixed cell leak in 'match' on backtracking
+
+  bug fix in let which did not honor protected symbols
+
+- 8.2.4
+  deprecated collect, getenv, putenv and environ completely eliminated from
+  newlisp and examples, modules: httpd, cgi.lsp, sqlite.lsp
+
+  '+' new wildcard operator 'match': take one or more
+
+  net-error now returns error number and text separate in a list
+
+  net-connect failure did not set net-error
+
+  'now' has now the daylight-savings-flag 0 or 1 as last parameter
+
+  new 'sys-error' for reporting C-library errno values
+
+  'newlisp -e' without a command string crashed
+
+  'push' now optimized when pushing as last element with -1
+
+  (new ...) now will not overwrite existing symbols, to allow true
+  mixins of other contexts. To overwrite symbols as before version
+  8.2.4 use the true as a third parameter i.e. (new A 'B true).
+
+- 8.2.5
+  'symbol?' can now be used on dymamic context vars, i.e
+  (set 'ctx MyCTX) ; MyCTX is existing context
+  (symbol? 'ctx:x) ; true if MyCTX:x exists, nil if not  
+  This checks the xistence without inadvertantly creating it.
+  previously (symbol "x" ctx nil) had to be used.
+
+  'replace' can now take an additional option bit 0x8000 for replacing
+   only once in a string: (replace "a" "aaa" "A" 0x8000) => "Aaa"
+
+
+  'define-new' copies individual funtions from
+  other contexts with or without renaming them to a new function:.
+  (define-new 'foo:func 'bar:func) copy to different context
+  (define-new 'foo:func 'foofa) copy to current and rename
+
+  forward referece to a symbol in symbol did not work in mixin mode
+  of 'new'
+
+  the space between optioncharacter (-s,-m,-p,-d,-e) and optionvalue
+  can now be omitted, i.e. -s 10000 and -s10000, both work.
+
+  'date' without an argument returns the character string for the current
+  local time, this avoids the construct (date (apply date-value (now)))
+
+  'date-value' without and argument returns the time of seconds
+  since 1970-1-1 0:00 equivalent to (apply date-value (now))
+
+8.2.6
+  'delete' now can delete an entire context without removing conatined 
+   symbols first
+
+  serialization of contexts to a file using 'save' now is done correctly 
+  when the context context contains overwrites of global symbols.
+
+  a more flexible and faster 'symbol' function, which can take any character
+  sequence and numbers, and can be used this way for hash-like associative 
+  memory access. New module hash.lsp to show usage.
+
+  'define-new' renamed to 'def-new', for shorter typing and for not 
+   associating it to 'define' but rather to 'new' (was introduced in 8.2.5)
+
+  'letn' works similar to 'let' but incrementally uses the local variable 
+   bindings like multiple nested let when evaluating the initializer expressionsi
+   for locals.
+
+8.2.7
+  'address' (previously only documented  in 'hacking_newlisp.html') now also 
+  returns addresses to integer and double float data type, useful when passing
+  int * or double * to imported functions, now documented in main manual
+
+  'sym' is an abbreviated form of 'symbol', since 'symbol' starting in 8.2.6
+  can take any sequence of characters, including strings which are illegal
+  symbols in newLISP syntax, and is used for hash/dictionat like lookups, it
+  is used more often, therefore this shorter form 'sym' is introduced
+
+  added configuration variable in newlisp-tk.config to specify a newLISP
+  application. See newlisp-tk.html "Delievering Applications" for details
+
+  'apply' and 'map' now can be used on macros
+
+  'pack' and 'unpack' have new format specifier 'b' for unsigned 8bit numbers
+
+  'encrypt' crashed on empty strins in key
+
+8.2.8
+  'encrypt' crashed on empty key-string, now gives error message
+
+  'int' as shorter writing of 'integer'
+
+  'pack' now converts all types as needed, i.e. (unpack "b" (pack "b" -1.0)) => 255
+  from-to integer-floats, did it before only for "f" and "lf"
+
+  'flt' converts a number to a 32bit float repesented by an integer for usage
+  in calling imported library routines, which take floats.
+
+  'array' skipped wrong index types instead of giving error message
+
+8.3.0 Released Nov 21st, 2004
+
+8.3.1 Released Nov 23rd, 2004 ============================================
+  'nth-set' gave error on protected symbol in index
+
+  'apply' 'map' on macro was returned to 8.2.0 behaviour
+
+8.3.2
+   more cleanup in qa file
+
+   cleaned up makefiles -D definitions eliminating redundant -DOPSYS
+
+   eliminated 'break', which did not do anything after introduction
+   of 'debug' in version 6.3.07
+
+   overall speedup of about 5% by predefining system symbols
+   $0 -> $15, speedup of 80% to 100% in functions using system
+   symbols like set-nth, nth-set, find, parse, regex, replace
+
+   new 'do-while' and 'do-until' check condition _after_ evaluating
+   the body expressions
+
+   new 'read-key' reads nonblocking keyboard character code
+   not working on Mac OSX but all other flavors
+
+   superflous args in user defined function call caused cell leak
+   never happened, i.e.: (define (foo x) ..) and (foo a b c)
+
+   'get-url' now handles "Transfer-Encoding: chunked" correctly
+
+   'amb' picks an argument at random and evaluates it
+
+   -x command line switch for server mode with handler function 
+   'x-event' i.e: newlisp my-httpd -x 8080 
+   my-httpd is a lisp file containing the user defined handler 
+   function i.e: (define (x-event request) .....)
+   this way servers for different protocols / requests can be simply
+   programmed using 'print','read-line', etc., for IO to the specified
+   port, the connection stays up until closed by the client.
+   See chapter 'Command line options ...' in the manual
+
+   fixed a bug in 'new' and 'def-new' when the source was MAIN 
+   this fix was necessary to write a function (def-static ....)
+   for writing statically scoped functions (see int the manual
+   chapter 'Lexical, static scoping in newLISP', subchapter
+   of 'Programming with context objects'.
+
+8.3.3
+   'debug' did not handle default functions written without colon
+
+   'save' 'source' did not space symbols under sum circumstances
+
+   'dolist' now double as fast and safe to break out with 'throw'
+
+   'catch' now has an additional syntax with just one argument to write
+   easier returns from functions, loops or blocks, ie:
+   (catch (dotimes (x 1000) (if (x 500) (throw "fin"))) => "fin"
+   returns the result  or throw argument
+
+8.3.4
+  'save' 'source' spacing-fix was incomplete
+
+8.3.5
+  If the a '!' is entered as the first character on the command line immediately 
+  followed y a shell command, that command will be executed, i.e. !lsi in Unix 
+  or !dir in Win32 would show a directory listing. There should be no space 
+  between '!' and the shell command.
+
+  URL length in get-url and post-url is now unlimited
+
+8.3.6
+  manual corrections, additions and new sub-chapter about XML-RPC
+
+  BASE64 encoding and decoding with 'base64-enc' and 'base64-dec'.
+
+  new sign-on message, and different for remote modes
+
+  added 'xmlrpc-server' to examples directory
+  added 'xmlrpc-client.lsp' to modules directory
+
+  fix for 'Transfer-encoding: chunked' if 'Content-length:'
+  is given too (which should not happen but is found occasionally)
+
+8.4.0 Released 2005-01-18 ============================================
+  added xmlrpc.cgi for handling XML-RPC requests as CGI
+
+  fixed a file descriptor leak in -d -x modes
+
+  after the 'debug' fix in 8.3.3 debug did not recurse into funcs
+
+  'args' can take an index argment i.e. (args 0) (args 1) etc.
+
+8.4.1
+  fixed signon message missing 'n'ewLISP
+
+  added UTF-8 to signon message
+
+  added f-prob to stat.lsp (probability of F ratio for df1/def2)
+
+  (throw-error expr) throws an error with message printed in expr
+  error thrown this way can be handled like any other newLISP error
+  using (catch foo 'result) or with (error-event ...)
+
+  changed/added docs for catch, throw, throw-error and chapter:
+  Integer abnd Floating point ...
+
+  newlisp-tk.exe now wrapped with freewrap v.6.0 and Tcl/Tk 8.4.8
+  suppresses occasional display of tcwish console
+
+  added updated newlisp.jsf syntax file for JOE editor to distribution
+
+8.4.2
+  [cmd] tags did not work when compiled with READLINE option
+
+  (args) which previously worked only in macros now too works in
+  functions. The behaviour of (args) has changed: only unbound arguments
+  for which there is now local variable in the macro (or function) are 
+  returned in the list. This makes changes in existing macros necessary, 
+  which specify both, local variables and they use args. Most changes
+  lead to simpler macros or function, because (args) already contains
+  only the unassigned args.
+
+  changed macro definition of 'tk' in newlisp-tk.tcl to function
+
+  changed plot 'macro' in stat.lsp and 'defun' in init.lsp
+
+8.4.3 Release 2005-02-12  =================================================
+  cleanup from (args) changes, protect $args from deletion
+
+8.4.4
+  misplaced paren in conditional def of defun in init.lsp
+
+  OS number in sys-info was incrementing on every call when DLL or UTF-8
+
+  decimal point setting from locale is now used correctly when parsing source
+  i.e. after performing (set-locale "German_Germany.1252") in Germany
+  1,23 will be recognized corectly as a decimal number with comma as the 
+  decimal separator.
+
+  qa_comma QA test file for German or other locales using ',' comma as
+  decimal separator, qa renamed to qa_dot for decimal-dot locales.
+  In comma locales both, qa_dot and qa_comma should work, in decimal
+  dot countries onlz qa_dot will work.
+
+  daylights savings field in 'now' function now shows a flag 1/0 if time
+  zone may have DST at certain time of the year on Linux/UNIX. On Win32
+  it shows a 'daylight minutes bias' for timezones which may have DST.
+  Note that flag/bias is set through all the year even if DST is not
+  in effect at a given moment. May not work on all platforms.
+  
+  additional format parameter in (date num offset fmt), see GNU gcc
+  strftime() function for details
+
+  Win32 installation now to $PROGRAMFILES/newlisp, which is 
+  c:\Program Files\newlisp on English Windows. This defines a
+  fixed location for $PROGRAMFILES/newlisp/newlisp.dll for applications
+  loading newlisp.dll. 'PROGRAMFILES' is an environment variable available
+  on all MS Windows installations.
+
+  newLISP is now correctly registered in the
+  'control panel/add or remove programs' applet
+
+8.4.5
+  newlisp.exe compiled on MinGW or Borland now will look for init.lsp
+  in the same directory where newlisp.exe resides
+
+  installer now sets path on Win32, this allows to import the DLL without 
+  specifying the full path and allows to start newlisp or newlisp-tk from
+  anywhere on Win32
+
+  installer now allows installing without newlisp-tk
+
+  'nth' upgraded to 16 indices (like set-nth and nth-set)
+
+  'sort' now allows any binary operator user defined function as
+  compare funtion in third parameter
+
+  'implicit indexing' on lists, arrays and strings i.e.:
+  (lst 1 3) equivalent to (nth 1 3 lst)
+  (ary 0 -1) equivalent to (nth 0 -1 ary)
+  ("newLISP" 3) equivalent to (nth 3 "newLISP")
+  unlimited number of indices and faster than explicit form
+
+  'pack' and 'unpack' now allow switching between little and big endian
+  byte order using new format characters '<' and '>'
+
+
+8.4.6
+  'new' and 'def-new' did not replicate arrays, could cause crash
+
+8.4.7
+  added 'upload.htm', 'uplload.cgi' to examples directory
+  minor fix in xmlrpc.cgi xmlrpc-server
+
+  better handling of bad server responses in get/post/put-url avoiding
+  an ifinite loop on some types of bad server responses
+
+  fix for endian switch in 'unpack' which changed the original buffer
+
+  re-arranged arrays, hashes and indexing chapters in the manual and
+  enhanced hashing chapter, added Win32 trailing slash warning to
+  manual entries of 'directory' and 'directory?'
+
+  experimental implicit indexing with nrest: 
+  (1 '(a b c)) => (b c)
+  (1 "abc") => "bc"
+
+8.4.8
+  implicit indexing with slice:
+  (3 2 '(a b c d e f g)) => (d e)
+  (-4 2 "abcdefg") => "de"
+
+  updated infix.lsp to version 1.4/5 was broken after newLISP 8.2.0
+  because of change in 'symbol' functioanality
+
+  possibility to check legality of a string as a newLISP source symbol
+  with (symbol? string), i.e: (symbol? "a b") => nil
+
+  illegal symbols are now serialized correctly in 'save' using a
+  set expression with (sym str context)
+
+  the Win32 installer now will correctly change settings in
+  newlisp-tk.config when chaning the install path during installation
+  will only work Windows 2000 and later
+
+8.4.9
+  did not evaluate length in implicit slice-length
+
+8.4.10
+  separated legal symbol? functionality into 'legal?' function. 'symbol?'
+  back to pre 8.4.8 functionality
+
+8.5.0 Released April 8, 2005
+  '=' fixed problem when comparing strings and binary buffers
+
+  'args' with negative index did hang
+
+  'main-args' nor can be indexed like args, both accept negative indices
+
+8.5.1
+  newlisp-tk tripped over file spec "", changed to "." in lastLoadedFile
+  on MacOSX. Changed Demo.lsp to work with TLCKAqua on MacOSX.
+
+  new function 'factor' for factoring numbers up to 15 digits 
+  (must give floats for numbers bigger max int)
+
+  in newlisp.so and newlisp.dll main-args was initilized to nil instead of
+  the empty list ()
+
+  list in 'dolist' now safe to modify (back to 8.3.2 behaviour), but can
+  leave with 'throw' without leaking cells
+
+  signalling SIGUSR1 will perform a 'reset' but not kill newLISP
+
+  'timer' start a one shot timer event and registers a user defined
+  event handler, i.e: (define (ticker) (println (date)) (timer 'ticker 1))
+  defines a self starting and retriggering ticker.
+
+8.5.2
+  added debug option to SIGINT handler, eliminated SIGUSR1 handler, because
+  is redundant
+
+8.5.3
+  added 'signal' for userdefined signal handlers: (signal sig-no symbol)
+
+  args was not reset to '() when left unused in recursion levels
+ 
+8.5.4
+  signal handler can pass the signal number as an argument (see manual)
+
+  new makefiles for OSX/Darwin UTF-8: make 'osx_utf8' and make 'darwin_osx_utf8'
+  (Darwin means: OSX + readline support)
+
+  when compiled with readline support newLISP will now exit pressing Ctrl-D
+  (Linux/UNIX)
+
+  'net-select' crashed on an empty list
+
+8.5.5
+  fixed UTF-8 problems in file names in newlisp-tk.tcl (thanks Norman)
+
+  UTF-8 symbols where not treated as legal symbols in 'save' , 'legal?'
+  This prevented UTF-8 symbols to show up in the editor/browser listbox.
+  This is now fine on all UTF-8 and non-UTF-8 version.
+
+  UTF-8 now handled correctly in hostnames in net-xxx routines
+
+  UTF-8 now handled correctly in 'float' and 'integer', took some
+  UTF-8 characters for numbers.
+
+  'net-connect' and 'net-select' did not accept/convert floats for 
+  portnumbers/sockets
+
+  sqlite3.lsp v.1.3 now handles FLOAT and BLOB datatypes and finds the correct
+  library/location depending on the OS platform
+
+  newlisp-tk did not save pathnames correctly in newlisp-tk.conf. New
+
+  version newLISP-tk 1.26 now works correctly when installing on MacOSX
+  use 'sudo make install' after build with 'make darwin' or 'make osx'
+  needs TclTk Aqua installed with darwin port tools
+
+8.5.6
+  fixed potential problem in 'net-connect' with multicast option on
+  big-endian CPUs (MacOSX)
+
+  added broadcast option to 'net-connect' as udp mode plus broadcast specified
+  with "b" or "broadcast" instead od "udp". Broadcast mode was already possible
+  in 'net-send-udp'. Now broadcast can be set up in non-blocking mode on the 
+  receiver side.
+
+
+8.5.7
+  big speedup of 'replace' with strings on a file of 100k about 30x on
+  500k about 500x times speedup.
+
+  added example/tcltk.lsp for showing how to make GUIs without newlisp-tk
+  controlled from a newlisp script
+
+
+8.5.8 
+  added true/nil as allowed data in memory shares
+
+  added new make flavor osx_lib for shared library newlisp.so
+
+  MacOSX binary are smaller now because since 10.3 osx-dlfcn.o
+  is not required anymore, but extra makefile_osx_10.2 for older
+  Mac's
+
+  flushing stdio after output if not in terminal mode lets newLISP
+  now serve as a UNIX inetd handler 
+
+8.5.9
+  'timer' now can take fractions of a second, i.e. (timer 'alarm 0.1)
+  for 100 millisec
+
+  'read-buffer' now can take an optional wait string as 4th parameter
+  similar to 'net-receive' with wait string
+
+  added Mac OSX package preperation to Makefile
+
+  dropped cygwin support. MinGW and Borland remain as Win32 options
+  #ifdef's for cygwin are still there but have not been tested for
+  several versions
+
+8.5.10
+  fixed a crash when hitting cursor-up inbetween [cmd]...[/cmd] tags
+
+  'timer' now avalailable on Win32
+
+  fixed a regex error, when expression found is of length 0
+  only one replacement was made
+
+  implicit indexing did not accept indices after a var-index, if
+  var-index was the first.
+
+8.6.0
+ a bug fix for unpack when passing a number as an address on
+ OpenBSD where virtual memory pointers may be > 0x7fffffff
+
+ new function crc32, version: http://www.w3.org
+
+ share on Win32 leaked memory
+
+8.6.1
+ 'sql3:open' now returns nil and sets error the message when trying
+ to sql3:open twice.
+
+ 'timer' now returns the elapsed time when calling just with the
+  event symbol, useful for checking timer progress or programming
+  timelines/schedules.
+
+  'source' now works like 'save' and can take multiple symbols;
+  context symbols are serialized including all of the contained
+  symbols.
+
+  Files are now created without execution permission with rw-rw-rw
+  which results in rw-r--r-- on UNIX systems assuming a user mask
+  of 0022.
+
+  'peek' similar to 'net-peek' but for any file descriptor, returns
+  number of bytes ready to read works also on std I/O 0/1. Only UNIX.
+
+  Added gmp.lsp for GNU Multi Precision library, contains
+  integer functions for arithmetik, see header of file gmp.lsp
+  for details.
+
+  optional parameter 'true' in 'difference' and 'intersect' puts
+  these functions in list-mode (versus normally set-mode).
+
+  new function 'title-case' upper-cases first character and
+  optionally lowercases the rest characters
+
+8.6.2
+  changed  makefile_darwin_utf8 to work on standard 10.4 installation
+
+  a parameter in utf8 version of upper/lower was evaluated twice 
+  caused by new title-case code in 8.6.1
+
+  fixed append mode in file 'open' which created file with ------ 
+  permissions when file did not exists
+ 
+  optional 'true' flag in net-lookup to force hostbyname() lookup
+  for strings like "216.16.84.66.sbl-xbl.spamhaus.org"
+
+  huge speedup for 'difference' and 'intersect'. On a 10000 elment
+  list about 100 times speedup, both functions now scale linearly
+  with n+m instead of n*m, when n an m are the lenghts of the two
+  lists
+
+  speedup of 'count' for big item lists now scales m+n instead m*n
+  when m is the list of items to count in list with length n
+
+8.6.3
+  'difference' did sometimes not unique, 'nil' treated incorrectly
+
+8.6.4
+  fixed problems in  'count' and 'sort' caused by changes in 'sort'
+  necessary in new version of 'count', 'difference', 'intersect' and
+  'unique'
+
+8.6.5
+  'catch' did not respect protection of symbols in the catch symbol
+   
+   make version with sed finally working on UNIX previously only
+   cygwin
+ 
+   new function 'randomize' shuffles the elements of a list
+
+   new function 'net-eval' evaluates a batch of functions remotely
+   on newlisp servers, manages Tcp/Ip communications and data collection
+   with multiple servers started with: newlisp -c -d <portno>
+   timeout and optional callback/idle function
+
+   'array' with 0 length dimension crashed, now ignores 0-length
+
+   -d mode would exit when loss of communication in multiline [cmd] mode
+   now just cycles to restart
+
+   'error-event' only worked in programs loaded interactively, now works
+    also defined in scripts started on the command line
+
+   -l and -L now usable for logging in normal console mode, -l logs only
+   user input -L logs both user input and newLISP output (without prompt)
+   new chapter for logging in users manual
+
+   when evaluating multiple expressions on the command line or a batch
+   of expressions enclosed in [cmd],[/cmd] tags multiple results are now 
+   separated by one space.
+
+8.6.5-7
+   'ramdomize' looped on listlen 1
+
+   'load' now throws an eror when the file cannot be found or returns
+   the value of the last expression in the file evaluated. Before 'load'
+   returned 'nil' when file was not found and else 'true'. Note that this
+   required a change in init.lsp to catch error when trying to load
+   $HOME/.init.lsp
+
+   eliminated all sprintf() to avoid security warnings on openBSD compiles
+
+   'erf' and 'sgn' new functions
+
+   took out txt2pdf which is broken, will come back when fixed
+
+   fixed leak in evluateStream introduced with 'net-eval'
+
+8.7.0-rc1 released October 10th 2005
+   'get-url' now acccepts https:// pages in main url or moved location
+
+   'sgn' extended with optional triconditional functionality
+
+   fixed result stack leak in 'net-eval'
+
+   'get-url', 'post-url' and 'put-url' now can take a timeout parameter
+
+   'read-buffer' with wait string now will put bytes read in buffer
+    including when the wait string was not found. When no bytes are
+    read buffer is nil.
+
+   'date-value' returned negative numbers on dates earlier 1970, now returns
+    0 on dates previous to 1970
+ 
+    'net-eval' would loop on connection errors, more detailed error messages
+
+8.7.0 released October 15th
+    'append-file' like 'write-file' but appends
+
+    'select' on lists with an empty selection list now returns the empty list
+    previously nil.
+
+8.7.1 RELEASE Nov 7th, 2005
+    fixed bug for push -1 optimization and various doc corrections
+
+    replaced 'integer' with 'int', 'get-integer' with 'get-int' and 'symbol'
+    with 'sym' in several examples/ and modules/ files
+
+    (nth <list> <list>) now throws error (list index only allowed in
+    push/pop and implicit indexing)
+
+8.7.2 development Release November 20th
+    new (net-ping host wait-time) returns ip-no or multiple ip-no for multiple
+    addresses in batch-mode or broadcast. Must have root privileges to use, or 
+    set the newlisp executable set-user-ID with: chmod u+s /usr/bin/newlisp or: 
+    chmod 4755 /usr/bin/newlisp; only on UNIX
+
+    'time' now safe for midnight wrap
+
+    'dup' with optional 'true' flag now can force list return  when a string argument
+    is given; by default 'dup' concatenates the string
+
+    sys-error now reset after readline(), which caused it set to 22
+
+    'transpose' on empty lists segfaulted when on zero length dimension in the
+    first row, now an error message will be issued if the first row is empty
+
+    imnplicit rest failed strings when n was >= length of string
+
+    'count', 'difference' and 'intersect' crashed when handling  identical lists
+
+8.7.3 development release November 27th
+   added "list" flag to 'get-url', which permits capturing header and page in a list.
+
+   added custom header option to get-url, post-url and put-url
+
+   string display translation for char > 126 to \nnn format
+
+8.7.4 development release December 5th, 2005
+   expanded functionality for 'context': (context 'CTX "symstr" value)
+   adds symbol to context CTX, (context 'CTX "symstr") returns value
+   this is a short form for: (set (sym "symstr" 'CTX) 123)
+
+   expanded form of 'context?' for checking existence of a symbol
+
+   'time' takes an additional parameter for the number of times the
+   expression should be evaluated for timing
+
+   cleanup format, file and directory routines (less code)
+
+   the terminating character from an expression returned in the console has been
+   changed from a space to a line feed
+
+8.7.5 Development release December 23rd
+   added util/newlisp.plist syntax file for OSX BBEdit or TextWrangler editors
+
+   raw mode in 'net-eval' now documented
+
+   recognize simple path-href in 'location:' header spec in get/post/put -url
+
+   in 'process' on UNIX an optional pipe handle for standard error can be specified
+   if not present standard error gets redirected to stdout
+
+   allow default functions to be defined as primitives
+
+   shortened symbol param loop in evaluateLambda and evlaluateMacro
+
+   getContext() now safe for debug mode
+
+   'replace-assoc' gets additional (long overdue) syntax to remove associations 
+
+   help-option in context console menu on newlisp-tk (not working on OS X)
+
+8.7.6 
+   Help buttons now work on MacOS X in newlisp-tk
+
+   fixed and issue with 'case' when a 'true' clause was assembled from an
+   evaluated 'true
+
+   handle some cases of self reference in set-nth/nth-set, i.e: the replacement sub
+   expression itlself changes the place its supposed to be assigned:
+   (set-nth i L (set-nth i L 99)) ) 
+ 
+   : (colon) now will be returned as token even if attached to other following chars
+
+   'parse' without regex parameter couild overrun string when it ended in \
+
+8.7.7
+   regular expression support in 'directory'
+
+   new 'number?' works like (or (float? x) (integer? x))
+
+   in newlisp-tk help on hightlighted reserved word now works on MacOS X bringing
+   up browser with manual on right spot.   (Ctrl-Left-Button for context menu)
+
+   new (bayes-train list-A list-B [list-C ...] context-symbol) lists contain
+   string tokens; and  (bayes-query list-query context), not documented yet, 
+   still testing and modifying
+
+   memory error fix in 'get-url' for chunked pages
+
+8.7.8 development release January 16th 2006
+   'apply' now works on lists with unlimited length, no stack limit
+
+    both Bayesan modes: Chain Bayesian and R.A. Fisher CHi2, are now supported with 
+    new 'bayes-train' and 'bayes-query', working and tested, see manual for
+    details
+
+    moved 'prob-chi2' and 'pob-z' in manual to "Simulation and modelling" group
+    together with 'bayes-train' and 'bayes-query'
+
+    ATTENTION:
+
+    calling into a context now changes the current run-time context:
+
+    (context 'FOO)
+    (define (foo) (context))
+    (context MAIN)
+
+    (FOO:foo) => MAIN ; old behaviour
+
+    (FOO:foo) => FOO  ; new behaviour
+
+    The new behaviour is more intuitive and is what most programmers would expect.
+    Only applications using 'eval-string' or 'sym' (w/o specifying a context) are 
+    effected. From all apps published by newlisp.org (blog, wiki, ide) only the file
+    cgi.lsp packaged with these applications is affected and should be changed to
+    the new cgi.lsp v.1.9 packaged with 8.7.8.
+
+    Users should check all applications using 'eval-string' and 'sym' (or the
+    deprecated 'symbol'). Pre 8.7.8 'eval-string' and 'sym' work with the runtime-
+    context beeing MAIN, the context where the program was started. Now both functions
+    work with the context they are part of:
+    
+    (context 'FOO)
+    (set 'x 999)
+    (define (foo s) (eval-string s))
+    (define (bar s) (eval (sym s)))
+    (context MAIN)
+    (set 'x 123)
+
+    (FOO:foo "x") => 123    ; old behaviour
+    (FOO:bar "x") => 123    ; old behaviour
+
+    (FOO:foo "x") => 999    ; new behaviour
+    (FOO:bar "x") => 999    ; new behaviour 
+
+    Changes to old code:
+
+    (1) Replace all cgi.lsp in newlisp-ide, newlisp-blog and newlisp-wiki apps.
+    the replacement will also work with newLISP versions previous to 8.7.8.
+
+    (2) Change old apps by preceding the 'eval-string' statement with (context MAIN)
+    or other required context change. Most of the time it's MAIN, the context where
+    th whole program was started.
+
+    (3) Change old apps adding explicitly the desired context in 'sym' as a
+    second parameter, i.e. (sym s 'MAIN) or (sym s ctx) where 'ctx' is a context
+    variable.
+
+    The new behaviour is more intuitive and will make OO based programming based
+    on contexts easier, it also increases isoloation of contexts because the current
+    run-time context is not dependend from where the program was started originally,
+    but only on the situation internal to that context.
+    
+8.7.9
+    added a configure script for compatibility with the popular autoconf/configure
+    system. An installation of autoconf is not required but the same sequence
+    of commands as on autoconf systems will work to make newLISP. newLISP's old
+    ways of making newLISP will also still work:
+
+    ./configure will just try to discover the platform and give a message
+    make will try to discover the platform and make it
+
+    if make cannot discover the platform it will give a message
+
+    the module/context is now reported in error messages
+
+    'load' will never cause the runtime context changed, but the same run-time
+     context that was valid before the call to 'load' will be valid when 'load'
+     returns
+
+    'eval-string' now can specify the context under which it's string argument
+    should be parsed and evaluated.
+
+    'log' can be specify an additional parameter for a different base than the
+    default natural log
+
+    fixed a problem with reading very long UTF-8 source string constants
+
+    big speedup of parse with regular expression, now scaling linear
+    this enables tokenizing big documents in one piece
+
+    args in functions should be evaluated in callers context
+    (for: sym, context, eval-string)
+
+8.7.10
+    raw string ouput (upper ascii in \nnn codes) in the newLISP commandline shell
+    return value only when locale is the default "C" locale.
+
+    'trim' was changing the original string in UTF-8 mode
+
+    'find', 'replace' and 'search' now do binary in both regex and non-regex modes
+     searched buffer, key/patterns string and replacement string can all contain 
+     binary 0s
+
+8.7.11
+    'string' now optimized double fast on string arguments
+
+    getCreateContext() checking symbol protection
+
+     'load' switches to context MAIN when loading file except if different
+     context is specified in file, on return 'load' switches back to callers
+     context (8.7.9)
+
+     'reset' adds an additional parameter for restarting newLISP with same
+     command line parameters with fresh memory in a new process space.
+
+     many security improvements for OpenBSD compiles
+
+     'reset' with optional 'true' (or non 'nil') parameter will restart
+     newLISP with the same commandline parameters, reloading files etc.
+     Not available on Win32 (execv() leave the system unstable when compiling
+     with MinGW.
+
+8.8.0-p1 pre-release 1
+     'reset' was always exiting on UNIX after the change in 8.7.11
+
+     text buffers returned in 'net-eval' > 2048 characters and containing zero
+     characters where throwing  a 'string too long error' 
+
+8.8.0-p2 pre-rlease 2
+     Many doc corrections
+
+	 system symbols in set-nth was broken in 8.7.6
+
+     self refs in set-nth now safe
+
+     added  and changed some cases to qa_dot and qa_comma, now safe again
+	 for memory leak tests.
+
+8.8.0 released February 20th, 2006
+     large file system support for files > 2 GB can now be turned on in newlisp.h 
+     specifying #define LFS. File positions > 2^31 must then be specified as
+     floats up to 999999999999999.0 for 999 terabyte (TB). 'seek' will always 
+     return a float, file positions should be handled as floats using
+     add, sub, mul, div instead +,-,*,/
+
+	 Documentation corrections (thanks Ryon, Nigel et al.)
+
+     moved sql.c and types.c into the util directory
+
+     updated newlisp.vim (v1.27) and newlisp.jsf (v.1.9)
+
+     bug fix in cgi.lsp for '=' in key value strings
+
+8.8.1
+     realloc compiler warning fix in nl-filesys.c/readBuffer()
+
+     error-event, net-eval (edited 4/13/20060), signal and timer can now take 
+     a function or lambda expression, previously only  a symbol holding a lambda: 
+     (signal 2 exit) 
+     (timer (fn () (println "hello")) 5)
+	 The old syntax still works too.
+
+     Could not compile to a library (also fixed in re-release of 8.8.0)
+
+     code cleanup for allocMemory() + memset() => callocMemory()
+
+	 now memory cleanup after exception in functor passed by:
+     'filter', 'index', 'net-eval' and 'replace'. 
+
+     implicit n-rest and slice on default lists and strings:
+     (set 'foo:foo '(a s d f g h j))
+     (2 foo) => (d f g h j)
+     (-3 2 foo) => (g h)
+
+     'save' and 'source' will always serialize from context MAIN perspective 
+     (like 'load') (source reverted back in 8.8.2)
+
+	 fixed odd/even problem for 'rand' on FreeBSD, NetBSD, OpenBSD
+
+8.8.2
+     'source' reverted back to 8.8.0 behaviour: serialize to current context
+
+8.8.3
+     'signal' fixed format of internal symbol when passing functions
+
+     suppress saving/sourcing system symbols starting with '$' unless specified
+     specifically
+
+     new built-in function 'real-path' translates a relative path into an
+     absolute path. (read-path) same as (real-path ".") returns the current
+     working directory
+
+8.8.4
+    'real-path' now also in Win32
+
+    handle self reference of result of while expression in condition
+
+    allow (sys-info 3) or (sys-info -1) as with 'args' and 'main-args'
+
+    'dup' will assume 0 for negative values
+
+    when entering multiline expressions/definitions bracketed by [cmd] ... [/cmd]
+    tags (each on a separate line] and hitting <enter><up-arrow> after the closing 
+    [/cmd], newLISP compiled with lib readline support segfaulted, this long standing
+    bug as finallly been fixed
+
+    in 'xml-parse' when a closing CDATA tag was preceded by a forward slash, then
+    an extra text element containing part of the closing tag was emmitted, 
+    this is fixed
+
+    support for MySQL v. 5.0 was added with mysql5.lsp
+
+8.8.5
+    'read-key' now also works on MacOS X
+
+    a bug in the second syntax of 'context' has been fixed now can do:
+    (push i (context 'CTX "foo")) which now works if CTX:foo is a list
+
+    'load' now can take http:// (and file://) URL prefixes in filnames to retrieve/load 
+    files via HTTP from remote servers
+
+    'xml-parse' now can take a context to place symbols/tags from SXML conversion
+
+    zlib.lsp: new module for in memory and .gz compatible file compression 
+
+    'net-eval' idle loop did not pass parameter (broken in 8.8.1)
+
+    fixed a cell leak caused by 'while' self ref handling in 8.8.4
+
+8.8.6
+ 
+    fix for error reporting of strings, which are too long
+
+    an optional break condition in all looping constructs allows early return:
+        (for (i from to step condition) ...)
+        (dotimes (i N condition) ...)
+        (dolist (i lst conditon) ...)
+    When condition returns non-nil the loop returns with the value of the condition.
+    When loop comes to end end the result of the last body expression gets returned.
+
+    describing the effects of non-rectangular matrices in the "Data types" chapter
+    and for the functions 'multiply', 'invert' and 'transpose'.
+
+    sqlite.lsp vor SQLite v.2.x has been discontinued, use sqlite3.lsp and SQLite3
+
+    error message was printed for each catch level where error was not caught,
+    should only be printed on top level if uncatched
+
+    new 'letex': let expression with expansion of let vars into body expressions
+    before evaluation
+
+    file open for append now atomic
+
+8.8.7
+    new 'clean':
+    (clean predicate? aList) works like:
+    (filter (fn (x) (not (predicate? x))) aList)
+
+    "Transfer-Encoding: chunked" did not trigger chunked decoding
+    when more than one space after the ':' before 'chunked'
+
+    $0 counter did not count first element when in remove mode of 
+    'replace'
+
+    'unify' does Prolog like unification with occur-check
+    (unify '(f (g A) A) '(f B xyz)) => ((B (g xyz)) (A xyz))
+
+    'unify' can take additional assoc params list:
+	(unify '(A (B) X) '(A (A) Z) '((A 1) (Z 4)))
+    => ((A 1) (Z 4) (B 1) (X 4))
+	this is useful when chanining/nesting 'unify' to pass on
+    a newly bound environment
+
+    new mode in 'expand' with parameter assoc list:
+    (expand '(a (B (c) (d a B))) '((a 1) (B 2) (c 3) (d 4))) =>
+	(1 (2 (3) (4 1 2))) 
+    
+    new mode in 'expand' without symbol or assoc list:
+	(set 'X 2)
+	(expand '(a ((X)) b)) => (a ((2)) b))
+	expands only uppercase variables for use with the new Prolog like
+    'unify' function
+
+    added file syntax.cgi for syntax highlighting in HTML of newLISP source
+    to examples directory
+
+8.8.8
+	eliminates several cell leaks in unify
+
+	'pop' can be used on strings (pop str [pos] [len]) pos can be negative
+    'push' can be used on strings (push str [pos]) pos can be negative
+    'push' now will only do list mode when lst is list  or nil:
+    (push new lst) lst has to be list  or nil, previous to string mode of push
+    any existing datatype non-list was initializeed to () now only nil is allowed
+
+    system var $idx contains the offset in dolist:
+		 (dolist (e '(a b c d e)) (println $idx "->" e))
+	0->a
+	1->b etc.
+
+    indexing mode of 'args' now works with multiple indices, i.e (args 3 -1)
+    and is much faster
+
+	implicit indexing syntax now allowed in 'nth-set' and 'set-nth':
+	(set 'd '(a b c d e f g))
+    (nth-set (d 3) 99) => d
+    d => (a b c 99 e f g)
+    or with default functor:
+    (set 'db:db '(a b c d e f g))
+    (nth-set (db -1) 99) => g
+    db:db => (a b c d e f 99)
+    This also works for strings and arrays
+    
+    many fixes/changes/additions in the manual and reference
+
+8.8.9
+    'net-ping' didn't work on localhost
+
+    'nth-set/nth-set' bugfix for new feature breaking old
+
+     complete manual pass of the first 3 chapters by Michael - thanks
+
+8.8.10
+    rotate works also on strings
+
+    (cons item lst -1) for consing at the end of the list (undocumented)
+
+    allow 0 length in chunked pages happening on put-url
+
+    give error message for unterminated [text] in interactive console
+
+8.9.0 Release June 25th
+    complete pass through Users Manual by Michael Michaels
+
+    example programs in Appendix are now syntax highlighted
+
+    dolist $idx safe for nested loops
+
+    member works for strings
+
+    (starts-with s k true) should behave like the default (starts-with s k)
+    same with ends-with. This bug never surfaced because nobody specified
+    anything for the default of case sensitivity
+
+8.9.1
+    (rand x n) returned n+1 after fix in 8.9.0, also looped on n=-1
+
+    new 'zero?' was broken for floats with fractional parts
+
+    newlisp -c -d <portno> and newlisp -c controlled by inetd now understand 
+    simple HTTP GET requests. This feature is mainly intended for use with
+    (get-url "http://...) and (load "http://...) for retrieving or loading
+    files from remote newlisp/inetd worker nodes in a distributed computing
+    environment. 
+
+    manual reviewed/edited up to and including the letter C
+
+8.9.2
+
+    new (find-all pattern string [func [options]]) finds all regex-patterns in a 
+    string and returns a list of matching strings:
+    (find-all {\d+} "asdf2kjh44hgfhgf890") 
+    => ("2" "44" "890")
+    (find-all {(new)(lisp)} "newLISPisNEWLISP" (append $2 $1) 1) 
+    => ("LISPnew" "LISPNEW")
+
+    the parameters in 'format' after the format string can now also be
+    given in a list: (format "%d %s" '(123 "hello"))
+
+    'read-key' did not work on SUSE Linux
+
+8.9.3
+     default values in function and macro parameters: (define (foo (a 1) (b 2)) (list a b))
+    (foo) => (1 2)
+    (foo 3) => (3 2)
+    (foo 3 4) => (3 4)
+    no performance loss for normal syntax without defaults
+
+    format partly rewritten for better portability, 
+    no tru64.c or ffi required after removing TRU64 for p_format in nl-string.c
+
+8.9.4
+    removed tru64.c and changed makefile_true64
+
+    starts-with and ends-with can do reguluar expressions and take a regex option number, 
+    the old nil-option for case insensitivity still works and is translated to regex 
+    option = 1, but is deprecated and will be eliminated in the future
+
+    member for strings can take regular expressions, the old case insensitivity option
+    will not work (member for strings was introduced only recently
+
+    'symbol' the old writing for 'sym' has been eliminated
+
+    fixed create context bug in newlisp-tk.tcl
+
+    (<< num) works like (<< num 1), (>> num) like (>> num 1), (div num) like (div 1.0 num)
+
+    function 'uuid' for creating Universal Unique IDs type 1 and 4 (RFC 4122)
+
+    -C command option for Emacs forces prompt even if in pipe mode
+
+    manual edits up to letter J, thanks Michael
+
+8.9.5
+    type 4 UUID now closer to RFC 4122 specification
+
+    trying to use set-nth or nth-set on an empty list corrupted the list
+
+8.9.6
+    UUID type 1 got timestamp wrong, UUID 4 always started the same sequence
+
+
+-------------------------- 64 Bit Integers  ------------------------------------
+
+
+8.9.7
+    all integer arithmetik 64 bit
+
+    'factor' now takes integers with  max 64 bits and is 4x faster than previously
+
+    'import', 'pack', still take ints as 32bit, taking the least significant 32 bits
+	to pack 64bits do: (pack "ldld" int64 (>> int64 32)) for little endian
+	for big endian do: (pack "ldls" (>> int64 32) int64)
+    
+    'format' has new 64 bit formats "%lld", "%llu" "%llx" for 64bit decimals and
+    hex numbers on UNIX on Win32 use "%I64d", "%I64u", "%I64x"
+
+    'format' now also recognises 'e' and 'E' scientific folating point formatting
+
+    32 bit format strings "%d" "%u" "%x" will truncate on int64 numbers
+
+    in float->int conversions floats out of range are converted to min/max 64 bit int
+    -9223372036854775808, 9223372036854775807 and 18446744073709551615 for unsigned
+
+	if an int32/uint32 is required by a function int64 values overflow to 
+    min/max 32 bit int -2147483648/2147483647 and 4294967295 for unsignde int
+
+    LFS (large file support) in file operations for files opened with 'open'
+    now full 64 Bits (before 40 Bits)
+
+    (for (i from to step)...) has float in i, only when optional step value is specified 
+    (sequence from to step) produces float only when optional step value is specified 
+    (dotimes (i N)...) always has integer in i
+    this is consistend with 'inc' and 'dec'
+
+    net-select now can go to 68 :) years waiting time specifying 64bit  higher timeout
+    values and a timeout of -1 waits forever
+
+	'net-close' with optional parameter: (net-close sock true) will suppress shutdown()
+    before closing the socket. In this case net-close will wait for undergoing traffic
+    to finish
+
+    new function (gcd x y ...) for greatest common deviser of n arguments
+
+    (pow x) defaults to (pow x 2)
+
+    wrong format could segfault (this bug was introduced in 8.9.3)
+
+    when replacing the first element in an association list with 'replace-assoc' and 
+    an error occured when evaluating the replacement expression a segfault occured
+    (thanks to Ingo for catching this)
+
+    Note that bits shifts <<,>> now work on 64-bit integers too (added 2006-09-12)
+
+8.9.8
+    'net-eval' now evaluates node parameters, before constants where required
+    (set 'host "localhost" 'port 4711 'cmd "(+ 3 4)")
+    (net-eval '((host port cmd)) 1000) = (7)
+
+    'net-eval' if no timeout specified waits forever
+
+    'net-eval' short form for one node: (net-eval host port cmd [timeout idle-loop])
+    timeout an idle loop are optional: (net-eval host port cmd)
+
+    Similar as for (load "http:// ...) and (get-url "http//..) in 8.9.1;
+    server mode: newlisp -c with -p or -d, now understands HTTP PUT requests
+    for saving/writing text files to a newLISP server node on UNIX using:
+    (save "http://..." ...) and (put-url "http://...") ...)
+    The server mode together with the beefed up 'net-eval', 'load', 'save'
+    'get-url' and 'put-url' assemble a nice toolset for distributed applications
+    with newLISP. The server node can also be started by inetd or xinetd. 
+    (See manual). Must give full path-file-name in URLs i.e:
+    (put-url "http://localhost:50001//Myfiles/afile.txt" (read-file "somefile"))
+
+    newLISP server mode with HTTP capabilities in not yet available on Win32.
+
+    target context MAIN is now disabled in 'def-new' and 'new' because it would
+    cause ambigous situations when copying context vars after fixing a related
+    bug: def-new and new on context-vars
+
+    on UNIX a shared memory address obtained with 'share' can be unmapped using
+    (share nil <address>)
+
+	'put-url' with "Pragma: append\r\n" in header option appends when talking
+    to newLISP server
+
+    'read-file', 'write-file' and 'append-file' accept "http:// ..." and
+    for HTTP mode and "file://..." for normal file mode.
+    in HTTP mode they work exactly like 'get-url', 'put-url' and 'put-url'
+    with "Pragma: append" in the header option.
+ 
+    new QA file qa-net for testing newLISP server modes with:
+    net-eval, load, save, read-file, write-file, append-file
+
+    new QA file qa-utf8 to display UTF8 characters, this is not a test for 
+    newLISP but rather the UTF8 display capabilities of the platform running on 
+
+8.9.9
+    matrix operations now can be performed on arrays (previously only lists)
+    matrix operations will return the type (list or arrray) which was given
+    as input. In case of mixed input (i.e. in multiply), array type is
+    returned.
+
+    new function 'det' returns the determinant of a square matrix expressed
+    as a list or array.
+
+    fixed cell leak in define-macro when exercising default values
+
+    64-bit integers where not displayed correctly in Win32 MinGW
+
+8.9.10
+    'append', 'first', 'last', 'rest', 'slice' (and implicit slicing) now also
+     available for arrays 
+
+    (timer 'event 0) did not stop on Win32
+
+    a fix in Curl_base64_decode() for bad base64 strings
+
+    20% speed up for append on strings and join
+
+8.9.11
+    'append' did not append correctly to lambda lists, which lost lambda attribute
+
+    'qa-net' fixed (this file only tests on UNIX)
+
+8.9.12
+    'int' did a signed instead of unsigned conversion
+
+     'save' did not save global protected symbols in a way they
+     could be reloaded
+
+8.9.13
+     'local' like 'let' but no initialization of locals (all nil): 
+     (local (x b x) body)
+
+     'swap' has a third syntax pattern to swap the contents of symbols: (swap x y)
+
+8.9.14
+     speedup and memory savings on 'apply'
+
+     fixed INT64->string conversion in sym for True64/WINCC
+ 
+     error checking on all reallocs()
+
+     changed to realloc() in writeStream() routines
+
+8.9.15
+	(join '(1 2 3)) was hanging, instead of wrong datatype error message
+	
+	support "\x41\x42\xff" in string hex format equivalent to "\065\066\255"
+
+	new 'ref-all' returns a list of index vectors for all ref's of an expression
+	(ref-all 'a '(a b c (d a f (a h a)) (k a (m n a) (x))))
+	=> ((0) (3 1) (3 3 0) (3 3 2) (4 1) (4 2 2))
+
+9.0.0 Release October 15th, 2006
+
+9.0.1
+    'read-file' did not read extended http:// mode parameters correctly
+
+    new 'doargs' works like 'dolist' iterates through (args)
+	(define (foo) (doargs (i) (println i)))
+    (foo 1 2 3) => prints 1 2 3
+    implemented on top of 'dolist' also does $idx and break-expressions	
+
+    'explode' takes extra parameter for # of characters (works on UTF-8 too):
+    (explode "newlisp" 2) => ("ne" "wl" "is" "p")
+
+    new 'utf8len' length of a string in UTF-8 characters
+
+    new scalar matrix operations (matrix is a 2 dimensional list or array): 
+    (set 'A '((1 2 3) (4 5 6))
+    (set 'B A)
+    (mat + A B) => ((2 4 6) (8 10 12))
+    (mat - A B) => ((0 0 0) (0 0 0))
+    (mat * A B) => ((1 4 9) (16 25 36))
+    (mat / A B) => ((1 1 1) (1 1 1))
+    Note that all matrix operations are in floating point
+
+9.0.2
+    explode works on lists: 
+    (explode '(a b c d e)) => '((a) (b) (c) (d) (e))
+    (explode '(a b c d e) 2) => '((a b) (c d) (e))
+    many structural transformations can be done combining 'explode' and 'transpose'
+
+    fixed cell-leak in 'ref-all'
+
+    in (mat <op> A B) B can be a single number: 
+    (mat + '((1 2 3) (4 5 6)) 2) => ((3 4 5) (6 7 8))
+
+    some fixes for HTTP mode on UNIX
+
+    HTTP mode now working on Win32 but with some timing issues,
+    see header of file qa-net for details
+
+9.0.3
+    $idx was broken after 9.0 starting with 1 instead of 0
+
+9.0.4
+    fixed midnight rollover in 'timer' on Win32
+
+    new (round <number> <precision>) rounds a number to precision digits
+    left (positive) or rigt (negative) of the decimal point
+
+    new hyperbolic functions sinh cosh tanh
+
+    fixed push -1 optimization when popping only remaining element in list
+
+    new 'ostype' symbol holds os type string
+
+    new 'delete-url', needs to be enabled on target www server (most aren't)
+    else => "ERR: server code 405: HTTP/1.1 405 Method Not Allowed\r\n"
+    and must have file permissions set accordingly on target file;
+    additional parameters like timeout and custom headers are available
+    exactly as in 'get-url', the feature is also available in:
+    (delete-file "http://......"), similar to HTTP mode in 'read-file', 
+    'write-file' and 'append-file' and is also implemented in newlisp
+    server mode (not working on Win32 newlisp server mode)
+
+    GET queries are now supported in newlisp server mode (not yet Win32)
+
+9.0.5
+    'and' and 'or' now () when failing and last evaluation was ()
+
+     GET and POST cgi now working on UNIX and Win32 (9.0.6)
+
+     new -w <working-directory> commandline switch 
+     useful for changing working directory after newlisp startup:
+         newlisp -c -d 8080 -w /Users/lutz/ide
+     this is the same as going into the directory and starting newlisp
+         newlisp -c -d 8080
+
+     newlisp can now run as a webserver doing newlisp based CGI. It runs both
+     newlisp-ide-x.x.tgz and newlisp-wiki-x.x.tgz, to run the ide on the local
+     machine:
+         newlisp -c -d 8080 -w /usr/home/www/ide
+     then in a webbrowser enter the URL http://localhost:8080/
+     index.cgi and index.html are looked for by default if no filename is
+     specified in URL
+
+     httpd example programm has been eliminated, because httpd mode now built-in
+     into newLISP
+
+     'file-info' now correctly reports filesizes > 2G (2147483647) bytes
+     now also can index: (file-info <path-name> 0) => filesize
+
+     the -x commandlne switch has been disabled, use newlisp server modes instead
+
+     fixed problems with break-condition in dolist/doargs introduced in 9.0.1
+     fixed problem when break-condition is the loop symbol itself 
+
+9.0.6
+     'nth' now with similar syntax options as 'net-set/set-nth'
+     new in 'nth':
+        (nth (L <idx1> <idx2> ...))
+        (nth (L <aref>)) ; where <aref> is a list of indices
+     new in 'set=nth', 'nth-set'
+        (set-nth (L <aref>) <newval>)
+        (nth-set (L <aref>) <newval>)
+
+     'file-info' now distinguishes in the mode field (12th bit) between links 
+     and normal files: 
+        (define (link? fname) (= 0x2000 (& (file-info fname 1) 0x2000)))
+     not on Win32, who knows the correct Win32 function for lstat() on MinGW gcc?A
+
+9.0.7
+     HTTP server mode looks for procedure httpd-conf for processing/transforming
+     the path-file-name of the request. This way security checks, remappings etc
+     can be performed. In this case a file httpd.conf containing the definition
+     of httpd-conf can be loaded when starting the server:
+        newlisp httpd.conf -c -d 8080 -w www/httpddocs
+     if the file httpd.conf contains:
+        (define (httpd-conf request) 
+            (if (ends-with request ".exe") "errorpage.html" request))
+     now any request for a file which finishes in .exe will be transformed into a
+     request for errorpage.html containing an error message for the client.
+
+     fixed HTTP server mode crash on LINUX
+
+     fixed 'nth' which failed on old mode when indices where expressions
+
+9.0.8
+    new syntax of 'nth' should work on protected symbols
+
+    new syntax of 'set-nth/nth-set' did not check for index maximum of 16
+
+    make httpd-conf safe for non-string returns
+
+    server mode now correctly remaps directory paths when performing CGI
+    in directories not web root, i.e. http://ahost.com:/ide/ will work with CGI,
+    note that directories need to end with "/" to make the resolve to index.html
+    or iondex.cgi work correctly
+    
+    new -http flag like -c (suppressing prompts) but only allow HTTP commands
+    no newLISP statements (-c allows both), this is a 'safe' HTTP mode not
+    allowing 'net-eva' or other commandline protocols.
+    The following configurations can be used:
+	
+    (1) serve HTTP requests only
+        newlisp -http -d <portno> -w <www-root>
+        newlisp -http -w <www-root> # started vi INIX inetd or xinetd
+
+    (2) serve 'net-eval', HTTP and command line without prompt
+        newlisp -c -d <portno> -w <www-root>
+        newlisp -c -w <www-root> # started via UNIX inetd or xinetd
+    this mode is useful when running newLISP server in a controlled environment
+    behind a secured firewall in a distributed computing environment where 
+    newLISP server must answer to both: net-eval and HTTP requests.
+
+    Note that on Win32 a \tmp directory must be created on the same drive
+    which is current for CGI processes for newLISP HTTP mode to work correctly
+    for CGI processing. On UNIX /tmp is standard.
+
+    fixed 'invert' crash (since v.9.0.2) on not-invertible matrices
+
+    upgraded to better random number generation in 'rand' and 'random'
+	(not available on Win32)
+
+    fixed (rotate '(1) -1)
+
+9.0.9
+    another fix for 'nth' and protected symbols
+	
+    if 'httpd-conf' returns 'nil' nothing will be processed, this can be
+    used to completely hand off CGI request processing to httpd-conf
+
+9.0.10
+    moved env variable creation of DOCOUMENT_ROOT earlier, so it is available
+    in httpd-conf.lsp
+
+    added httpd-conf.lspi to the examples directory in the source distribution,
+    now filters csertain file extensions and does not allow access to files 
+    outside the web directory tree specified with the -w option:
+        newlisp httpd-conf.lsp -http -d 8080 -w /wwwdocs
+    or outside the startup directory if no -w is given, also takes care
+    of request for directories when no trailing '/' is present
+
+    cleaned up nthArray  and implicitIndexList/array code
+
+    trying to 'set-nth' and empty list should return the empty list not nil
+
+    more tests in qa-dot and qa-comma for symbol protection and 'nth'
+
+9.0.11
+    rework of whole indexing area, now correctly honors symbol protection in
+    all modes if symbol is nested inside an expression. The old flat mode: 
+      (nth i j alist)
+    is much slower, instead use one of the following modes:
+      (nth (alist i j)) or (alist i j) or (nth (alist aref)) or (alist aref)
+	ehere aref is a list of nymbers, i.e.: (1 2), same modes in set-nth,nth-set
+
+    reworked nil and empty list detection throughout all files. 'nil' and the
+    empty list '() are logic false, things work like this:
+        (map true? '(nil () 0 "")) => (nil nil true true)
+        (map nil? '(nil () 0 "")) => (true nil nil nil)
+        (map not '(nil () 0 "")) => (true true nil nil)
+        (map null? '(nil () 0 "")) => (true true true true)
+    in v9.0.0:
+        (true? '()) => true, which was wrong because also 
+        (true? (not '()) => true, which is correct
+    this affects filter and index usage with true? as predicate, but does not
+    affect: if, unless, while, until, do-while, do-until, which always worked
+    correctly assuming '() as logical false
+
+    'name' also can take contexts i.e.: 
+        (set 'L:L '(a b cd)) (set 'x L) (name x) => "L"
+
+    now when evaluating a context by itself it returns the default symbol
+    if the default symbol does not exists it gets created:
+          (set 'foo:foo '(a b c d e f g))
+          (foo) => foo:foo
+          (eval (foo)) => '(a b c d e f g)
+    this can be used for reference passing:
+          (define (mysort ctx func) 
+              (sort (eval (ctx)) func))
+          (mysort foo >) => (g f e d c b a)
+          foo:foo => (g f e d c b a)
+    previously a passed context could only be used for functions using
+    index lists and implicit indexing as in (nth-set (ctx idx) value) etc.
+    now functions working on the entire list can be used with reference passed
+    data. THIS FUNCTIONALITY HAS BEEN DISABLED IN 9.0.14, as a workaround
+    use (sym (name ctx) ctx) to retrieve the functor
+
+9.0.12
+    the newLISP-tk installer now contains a file md5-checksums.txt with
+    checksums for newlisp-tk.exe, newlisp.exe and newlisp.dll
+    
+    bit not ~ was still on 32 bits now 64 like all integer arithmetik since 9.0
+    
+    all buffer variables moved to size_t and ssize_t type in preparation for
+    64-bit model LP64 compile for 64-bit memory addressing.
+    
+    get-char, get-int, get-float and get-string failed when using on 64-bit
+    addresses, which where not truncated correctly on little-endian CPUs.
+    This affected the mysql.lsp and mysql5.lsp modules when using with newLISP
+    versions 8.9.7 and later and on Intel CPUs. On Mac PPC and other big-endian
+    architectures this problem did not occur. All other modules where not affected
+    on any architecture.
+    
+    <,>,<=,>=,= when given only one argument compare agains 0, "" or (),
+    all other data types return true as before
+       (< 1) =>nil, (= 0) =>true, (> "abc") => true, (= "") =>true etc.
+
+    64-bit file poisitioning fixed under Win32 (now runs qa-lfs)
+
+9.0.13
+    fixed problems in the new <,>,<=,>=,= single argument feature
+ 
+9.0.14
+    further fix in 64-bit ~ function
+
+    a context feature intoduced in 9.0.11 to extract the default functor from an 
+    unknown context has been disabled, instead use the workaround:
+        (set 'foo:foo '(a b c d e f g))
+        (set 'ctx foo)
+        (sym (name ctx) ctx) => foo:foo
+        (sort (eval (sym (name ctx) ctx)) >) => (g f e d c b a)
+        foo:foo => (g f e d c b a)
+    a more elegant way will be supplied in the future
+
+    both string and list versions of 'explode' now return an empty list if optional
+    length <= 0
+
+    'nt-set/set-nth' did not honor constant protection of default functors
+
+	now compiles for LP64 64-bit memory model on 64-bit LINUX using the makefile:
+       make -f makefile_linux64LP64
+    or simply:
+       make linux64LP64
+
+    the old makefile for making a ILP32 32-bit newlisp on 64-bit LINUX has been
+    renamed:
+       make -f makefile_linux64ILP32
+    or simply:
+       make linux64ILP32
+
+    tested on a AMD64 CPU with LINUX 2.6 64-bit Fedora 3
+
+    enjoy up to 17,179,869,184 gigabytes or 16 exabytes of RAM, on AMD64
+    the LP64 compiled version is 12 to 25% faster than the ILP32 version
+
+    avoid sign extension when unpacking signed 32bit into unsigned 32bit displayed
+    in 64-bit: (unpack "lu" (pack "ld" -1)) => (4294967295) ; not (-1)
+
+    added 'get-long' and "Ld", "Lu" 64-bit packing formats 
+
+    new 'parse-date' for parsing date strings (not yet working for Win32)
+
+9.0.15
+    more manual additions and changes, moved all predicates into own group
+
+    fixed dynamic symbols compare
+
+    fixed warnings fo missing -Wno-strict-alasing GCC message on older Solaris
+    and BSD GCC versions
+
+    fixed parsing of [text] tag on 64-bit compiles
+
+    fixed 'flt' for TRU64 compile
+
+    tried Linux debian package, Ok on Ubuntu, will be included from now on
+    in newlisp.org releases, but appreciate help in getting it into Ubunto
+    and Debian for inclusion into their lists
+
+    The Tru64UNIX compile using makefile_tru64 is now a large pointer model LP64
+    compile, thanks to Peter for porting and testing on an Alpha CPU
+
+    added makefile_darwin_LP64 for 64-bit compile/link, but cannot test it
+    on my  PPC-G4 (I believe I need a G5 for this)
+
+    fixed 'char' on UTF-8, bug due to 64-bit changes
+
+    LP64 mode for Solaris workng, use makefile_solarisLP64
+
+    new 'make test' to run qa-dot, qa-net, qa-xml
+
+9.0.16
+    OS/2 compile flavor now part of distribution
+
+    fix for Solaris in some networking routines broken in 9.0.2 !
+
+    fixed: (dup x -1), which was broken since 9.0.14
+
+    'make test' now does qa-dot, qa-xml, qa-setsig, qa-net all one after
+     another. The qa-setsig script will drop out on Win32 with a message.
+
+     A small change in the 'test-process' routine in the qa-dot script will 
+     cause less failure message for 'process' on slow computers.
+
+     qa-dot now will set to locale "en_US' when testing an UTF-8 version,
+     this has been done to suppress failure messages for UTF-8 'upper-case'
+     and 'lower-case' which do not work in the default 'C' locale in
+     UTF-8 mode on some platforms.
+     qa-comma always sets to "de_DE"
+
+     'asinh', 'acosh', 'atanh' complete the triginometric functions
+
+     up to 8 'callback' routines cain be defined to be called by an imported
+     library, example for Glut lib:
+        (glutDisplayFunc (callback 0 'draw))
+        (glutKeyboardFunc (callback 1 'keyboard))
+        (glutMouseFunc (callback 2 'mouse))
+     up to four parameters (32-bit ints) are received by the user-defined
+     callback handlers. See the file newlisp-9.0.16/examples/opengl-demo.lsp
+     for details. Note that OpenGL passes floating point data, which are only
+     handled correctly on x86 based platforms. On the Mac PPC this file will
+     not work (although the callback interface itself does work, but no
+     drawing will be visible).
+
+9.0.17
+     fixed 'non-blocking' bug for write on Linux, thanks Peter!
+
+     number of maximum cells was not reported correctly in 64-bit newLISP
+
+     'ref' and 'ref-all' now can take a comparison functor (like 'sort') for
+     comparison: (ref-all key List func), if no func is specified
+     assumes = (equal), ref-all now much faster on big lists with  many finds.
+
+     'find' and 'replace' (both in their list forms) can take a comparison
+     functor like 'sort', 'ref', 'ref-all'.
+     'replace' for lists now also processes $0 (old entry) in replacement 
+     expression. 
+
+     using replace for lists with 'match' or 'unify' as comparison functor 
+     makes 'replace' as powerful as 'replace for strings with regular expressions.
+     This is an important new feature with many applications.  It also gives
+     the much overlooked 'match' and 'unify' the more frequent usage they deserve.
+
+     new logic functions 'exists' and 'for-all' apply a condition to each
+     element in a list and return the result.
+
+     match now will accept atoms in the entry expressions to make it usable 
+     for 'ref' and 'ref-all'
+
+9.0.18
+     fixed a bug in (pop <string> <idx>)
+
+9.0.19
+     (find <str> <str> [<option>]) will do both: regex if option is a number
+     (as before) and function comparison if option is a funtor or user-defined
+     function.
+
+     fixed 'pop' on an empty string
+
+     fixed newlisp -h where new options didm't show
+
+     'file-info' was hanging on name pipes now shows 0 for file size
+
+     trying to start server mode with no or zero port will fail
+
+     'array' will give error message on negative parameters, before
+     they where simply skippped
+
+     Ctrl-C signal handler crashed on Linux when in -d mode
+
+     'explode' will take optionl 'true' to omit chunksize too short when
+      chunk size is given (strings and lists)
+      (explode "newlisp" 3) => ("new" "lis" "p")
+      (explode "newlisp" 3 true) => ("new" "lis")
+
+9.0.20
+     -l and -L mode now always must specify a path-name for the
+     log file (either attached or detached):
+         newlisp -l /usr/home/www/logfile.txt
+     logging is allowed in all modes. -l will only log network connections
+     or commandline or net-eval requests input. -L will log also HTTP requests 
+     and newLISP output from commandline and net-eval
+
+     doc installation directory changes from /usr/share/newlisp/doc to
+     /usr/share/doc/newlisp
+
+     CodePatterns.html ammended with chapter for HTTP only server mode
+     MemoryManagement.html ammended with implementation chapter
+
+     newLISPdoc.html and inewLISP-X.x-Release.html added to install 
+     in /usr/share/doc/newlisp, this file will only change on mayor
+     releases
+
+    
+9.0.21
+     a crash bug in 'match' introduced in 9.0.17 was fixed
+
+     new 'curry' (curry f x) => (lambda (y) (f x y)), makes a unary opearator
+     out of a binary operator, useful when using 'match' 'unify' and other 
+     binary ops in: 'filter', 'clean', 'index' etc., i.e:
+     (filter (curry match '(a *)) '((a 10) (b 5) (a 3) (c 8) (a 9)))
+     => ((a 10) (a 3) (a 9))
+
+9.0.22
+     integrated syntax highlighting into newlispdoc, which now is part of
+     installation in /usr/bin/ and with man page in /usr/share/man/man1 
+
+     added media types for .pdf .mov. .mpg  and .mp3 in HTTP request handling
+     additionally to .jpg .png .gif
+
+     protect stack from overflow when loading huge contexts in sysEvalString()
+
+
+9.1.0 Release February 15th
+
+9.1.1 Release March 15t
+     safer memory allocation for net-ping when using wildcard *
+
+     new module crypto.lsp with md5 and sha1 hash functions
+
+     fixed bug in Win32 version when stdout of more than 2048 chars
+     in shell window
+
+9.1.2
+    net-peer, net-local and net-receive-from where dropping the third digit of the
+    least siginificant IP group in the IP-string return value on 12 digit IP numbers
+
+9.1.3
+    makefile_osxLP64 produces a 64-Bit version on intel core 2 duo which passes
+    'make test'. Use: make osxLP64 or: make -f makefile_osxLP64
+
+    some cleanup in nl-sock.c
+
+    newlisp-tk.tcl now detects default browser in Debian LINUX
+
+9.1.4
+    passed all rand() to newer, better random() in nl-math.c
+
+    local domain UNIX sockets using: (NOTE THAT SYNTAX CHANGES IN 9.1.5)
+		 (net-listen <str-path> "local") and (net-connect <str-path> "local")
+    then use 'net-accept', 'net-select, 'net-send' and 'net-receive' as usual
+    see also file qa-local-domain
+
+    fixed many problems with 'net-ping' which did not work correctly on
+    machines rejecting out of sequence errors in ICMP packets. Now will handle
+    EHOSTDOWN and EHOSTUNREACH errors correctly
+
+    'net-ping' now also can accept ranges, e.g: (net-ping 192.168.1.120-150) 
+    additionally to the '*' star, i.e: (net-ping 102.168.1.*)
+    superuser permission are required for net-ping
+
+    added MySQL:escape to mysql.lsp (v.4) and mysql5.lsp, thanks to Jeff
+    for submitting this addition
+
+    added HTTP_COOKIE to environemnt variables set by newLISP HTTP server
+    mode
+
+    leading and trailing white space now gets removed from environment variables
+    set by newLISP server mode, specifically in HTTP_HOST, HTTP_USER_AGENT and 
+    HTTP_COOKIE
+
+9.1.5
+	changed the way of specifying local-domain UNIX sockets in net-connect and net-listen:
+    (net-connect <local-socket-path>) ; don't specify a port
+    (net-listen <local-socket-path>) ; specify socket-name instead of port)
+
+	local domain UNIX socket support in newlisp -d server mode and net-eval:
+    server mode: newlisp -d /tmp/mysocket
+	client: (net-eval "/tmp/mysocket"  0 "(+ 3 4)") => 7
+
+    speedup utf8_wlen()
+
+    load and save do not use lisp source anymore but call getPutPostDeleteUrl() directly
+    this increases speed and leaves get-url/put-url to be renamed if required
+
+    guard against partial send()'s in net-eval and HTTP mode on Win32
+
+    'net-eval', 'net-ping', 'net-receive-from' and 'net-receive-udp' now set
+    timeout error for retrieval with 'net-error'
+
+    'net-ping' will stop waiting for response when the number of responses
+    reaches the number of pings even if no max count was not specified.
+
+    a fix for local-domain UNIX sockets on OS/2
+
+    reorderd "3. Functions in groups" subchapters adding group "Pattern recognition"
+
+    now any keystroke/mouse-button will close the about windows in newLISP-tk.
+    Before only <esc> worked
+
+9.1.6
+    newlisp-x.x.x/util/nclocal.c utility program similar to nc/netcat but for
+    local domain UNIX sockets. 
+
+    When deleting contexts the context symbol now will stay and not be deleted 
+    but demoted to a normal unprotected symbol.
+
+    It is now possible to create contexts on local variables in 'define', 
+    'lambda' or 'local' expressions without error messages on usage of these 
+    symbols/variables subsequently. After leaving the 'define', 'lambda' or 
+    'local' the variable symbols will be returned to their previous status in 
+    the upper scope. Before this version they staid protected. 
+    Note: For efficiency reasons this coding practice is not recommended but 
+    will not cause an error anymore.
+
+	use strncmp() instead of strcmp() in netReieive() to avoid buffer overflows
+
+    read empty [text][/text] tagged text correctly
+
+    newlisp doc v.1.1 fixes formatting of the syntax line when parenthesized 
+    expressions are part of the syntax line.
+
+9.1.7
+    a fix for ends-with when using with regular expression option (did not anchor
+    correctly to the end)
+
+    net-listen didn't evaluate the port parameter since 9.1.4 when local domain 
+    sockets where introduced
+
+9.1.8
+    fixed a crash bug on Win32 when using a permission mask in make-dir
+
+	'%%' as a last spec in format was not translated correctly
+
+9.1.9
+    when a system wide error handler defined with error-event contained 'nil
+    newLISP would go into a loop caused by an error invoked by the error handler
+    now an error-event defined with a symbol containing nil will simply to
+    nothing.
+
+    xml-parse now can take an optional callback functor (see manual for detail)
+
+    on the Win32 UTF-8 versions UTF-16 file-path names now are processed
+    correctly, thanks to Michael Sabin for contributing the file win32-path.c
+
+    this is the first release containing the source of Java based GUI-server 
+	in the guiserver subdirectory of the distribution. guiserver.jar is
+    already prebuilt contained in the source distributin and installed
+    drng the normal newlisp install. It also can be installed individually
+    descending into newlisp-x.x.x/guiserver (read README.txt found there)
+
+    new global? property function checks if a symbol is global
+    new protected? property function checks if a symbol s protected
+
+    a bug in push on strings when the index was > the length of the string
+    and a fix for utf8
+
+9.1.10
+    this development release was made for additions in newLISP-GS
+
+9.1.11
+    fixed a bug in explode when specifying N > length of string
+
+    negative second length in slicing now interpreted as offset
+    from the right: (2 3 "abcdefg") => "cde", (2 -3 "abcdefg") => "cd"
+    before negative length would be interpreted as going to the end
+
+    implicit n-resting on strings was UTF-8 sensitive which it should
+    not be, all implicit indexing and slice on strings is on byte borders,
+    only first,last,rest are UTF-8 sensitive.
+
+    fixed crash when net-select was interrrupted by timer, traceExit()
+    was not protected from entry when signal handlers where defined
+
+9.1.12
+    newlisp invoked on the command line can take URLs for filespecs to execute
+    remote programs: newlisp http://newlisp.org/example.lsp
+
+    join now can take an extra flag to force a joint string after the last element:
+    (join '("A" "B" "C") "-" true) => "A-B-C-"
+
+9.2.0 Release August 15th, 2007
+
+9.2.1
+    rewritten 'count is about 3-4 times faster than before when counting 100 
+    in 1,000,000 elements. Only on Mac OS X and other UNIX. On the older
+    MinGW GCC C library the required functions tsearch() and tfind() are not
+    available.
+    
+    fix for special characters in cookies cookies in cgi.lsp
+
+    'pack' now can take lists for data:
+    (set 'lst '("A" "B" "C"))
+    (set 'adr (pack "lululu" lst))
+    (map get-string (unpack "lululu" adr)) => ("A" "B" "C")
+    This was imnplemented in response to a request for a (address <list-of-strings>).
+    Note that the lst should not be changed and be referenced directly in 'pack'
+    so the pointers passed by 'adr' are valid. 'adr' would be a 'char * adr[]' in the 
+    C-programming language
+
+    fixed cell leak in indexed sys-info and indexed file-info
+
+    new 'dostring' iterates over a string with character values in loop variable. 
+    On UTF-8 compiled newLISP UTF8 character values are returned by the loop variable
+
+    documented 'bind' : 
+    (bind '((a 1) (b 2) (c 3))) same as  (map set '(a b c) '(1 2 3))
+    This function was already in earlier versions, but not documented.
+
+    on startup NEWLISPDIR will be registered as either: /usr/share/newlisp
+    on Mac OS X / UNIX as: PROGRAMFILES/newlisp on Win32, where ROGRAMFILES
+    is an exisiting Windows environmnt variable. (env "NEWLISPDIR") =>
+
+    additions in guisserver.lsp and newlisp-edit.lsp, see guiserver/CHANGES
+
+9.2.2
+    iterators segfaulted when evaluating the iterator variable was the last
+    statement in the iterator body: dostring, dolist, dotree. 
+    Added test-cases for this situation.
+
+    (main-args) could be pop'ed which was due to an implementaion error, main-args
+    cannot be popped any more, if necessary, assign to another variable first:
+    (set 'margs (main-args)), (pop margs) etc.
+
+    additions in guisserver.lsp and newlisp-edit.lsp, see guiserver/CHANGES
+
+9.2.3
+    addtions, changes in guiserver.lsp and newlisp-edit.lsp, see guiserver/CHANGES
+    for details
+
+    misc. code cleanups in core
+
+9.2.4
+    in 'set-nth/nth-set' when no replacement arg is given, the old value should
+    be returned only as in 'set'. Was replacing with nil.
+
+    fixed a cell-leak in 'set' when using mutliple arg pairs.
+
+    allow symbols for the name in (context <ctx> <name> [<value>]), previously
+    only strings where allowed.
+
+    speedup in symbol deletion
+
+    in (signal <sig-no> <handler | flag> the nil flag now specifies SIG_IGN
+    and the true flag SIG_DFL. Before 9.2.4 nil would specifiy an empty newLISP
+    handler and the true flag was not available.
+ 
+    reworked 'process' now creates the new process without the previous
+    time and memory overhaead (on UNIX) of an extra newlisp fork which stayed
+    in memory until the newly created process had finished.
+    In most cases the full path must be given for the command in 'process'.
+
+    new 'destroy' to destroy  processes created with 'process' or 'fork'	
+    see reworked docmentation for 'fork' and 'process'
+
+    fixed a bug when sorting (ordered compare) mixed  boolean values/symbols
+
+9.2.5
+    'dup' without the repetition number parameter will assume 2, i.e:
+     (dup 'x) == (dup 'x 2) => (x x) ;  Thanks to Lance Bradley for this idea.
+
+    'find-all' will return an empty list '() when nothing is found, previously
+    nil was returned.
+    
+	':' now also works like a function and can be attached to symbol following
+    it. The colon operator forms a context symbol from the symbol following it
+    and the context symbol found as the first element of the list contained
+    in the next argument.
+
+    (define (rectangle:area p)
+	    (mul (p 3) (p 4)))
+
+    (define (circle:area c)
+	    (mul (pow (c 3) 2) (acos 0) 2))
+
+    (set 'myrect '(rectangle 5 5 10 20)) ; x y width height
+    (set 'mycircle '(circle 1 2 10)) ; x y radius
+
+    (:area myrect) => 200 ; same as (rectangle:area myrect)
+    (:area mycircle) => 314.1592654 ; same as (circle:area mycircle)
+
+    This can be used for simple OO programming where objects are represented 
+    as lists and methods are packaged contexts / namespaces serving as object
+    classes. The colon ':' operator implements polymorphism by looking up
+    the class / context of the object as the first symbol in the object list.
+
+    'integer' the long writing of 'int' will be eliminated in the next
+     development version!!!
+     new versions newlisp-ide-4.1.tgz and newisp-wiki-4.2.tgz have changed
+    'integer' to 'int'
+
+    better platform independent library detection routines in modules:
+    crypto.lsp, gmp.lsp, sqlite3.lsp and zlib.lsp
+
+    crypto.lsp has new 'crypto:hmac' as of RFC 2104 used for Amazon REST API
+
+    new util/newlisp.vim, for matching .vimrc see http://newlisp.org/code/vimrc.txt
+
+9.2.6
+    Moved to MinGW 5.1.3 with gcc v.3.4.5 and eliminated declarations for
+    struct timezone and gettimeofday(). Changed sleep() to Sleep().
+    -> grep 3\.4\.5 *.c <- shows all changes 
+
+    Improved random number generation with 'rand' now gives better integer quality
+    random numbers on Win32, which only does 16 bits in 'C' random(), even for
+    ranges close to or > 16bit.
+
+    newLISP GS 1.07 now automatically restarts monitor shell, if required by run-command.
+
+    newLISP GS 1.07 now loads, saves and displays UTF-8 correctly in editor and 
+    interactive monitor area
+
+    new manual chapter: "Object Oriented Programming in newLISP" explaining
+    newLISP object format and how to use the new : (colon) operator.
+
+9.2.7
+    changes in newLISP-GS to automatically detect and switch to UTF-8 mode, depending
+    on the newLISP executable. Edited chapter "17. Object-Oriented Programming in newLISP"
+    (thanks Michael Michaels)
+
+	In Guiserver 1.08:
+    new gs:window-moved and gs:window-resized. See new demo file move-resize-demo.lsp
+
+9.2.8
+	get-url, post-url, put-url and delete-url have been extended and reworked:
+
+    - now return extended error information if supplied by the server, before only 
+    the error cocd was reported.
+
+    - now can take a trailing "debug" in the option string, i.e."list debug" or 
+    "header debug" or simply "debug" when neither "list" or "header" applies. The 
+    debug option will print all outgoing info onto the console screen.
+
+    in some situations an empty document returned was reported as "ERR: empty document"
+    when ist was not an error but intended by the server.
+
+    in some situations customheaders were only taken when the option string was
+    present too. The manual showed the option-string optional, which it is.
+
+    the server response code 204 is now handled correctly
+   
+    when using a custom header "Content-type:" must be defined for put-url, before
+    "Content-type: text/html\r\n" was assumed. 
+
+9.2.9
+    last element speed optimization for 'last', 'nth', 'nth-set', 'set-nth' and
+    implicit indexing with index -1. 
+
+    'sort' can now be used on arrays too
+
+    changes in newLISP-GS for editor keyboard short cuts and list-boxes, see
+    guiserver/CHANGES file
+
+    the newlispdoc utility has improved pager headers and a feature to point to
+    other module collections from the index page.
+
+9.2.10
+    new functions to modify nested lists by reference via a key:
+
+    (set-ref (L key) value)
+    (ref-set (L key) value)
+    (set-ref-all (L key) value)
+
+    basically 'set-ref' and 'ref-aset' are shortcuts for doing a ref and
+    using set-nth/nth-set on the result:
+
+    (set-ref (L key) value)) equivalent to (set-nth (L (ref key L)) value)
+    (ref-set (L key) value)) equivalent to (nth-set (L (ref key L)) value)
+
+    all ref functions support either:
+           (<func> (L key) [...]) or (<func> key L [...]) 
+    syntax similar to nth functions working with indices instead of keys
+
+	like with 'set-nth' and 'nth-set' L can be the context of the default
+    functor L:L containing the list for passing lists by reference
+
+    all 8 'nth' and 'ref' functions together now constitute a complete set of
+    functions for indexing, referencing, accessing, modifying and search and
+    replace on nested lists. All 8 functions are also capable of receiving
+    lists passed by reference via context default functors, passed only by
+    their context name. All functions now offer the same two syntax patterns
+    with either one index and the key followed by the list:
+        (<function> <idx>|<key> <list> ...)
+    or the parethesized formi, which also can take contexts as default functors:
+        (<function> (<list> <idx>|<key>) ...)
+
+    on Win32 function 'directory?' now will accept training slahes '\' or '/'
+    before it would always fails on trailing slashes
+
+9.2.11
+   'ends-with' with regex options failed when alternative pattersn where used
+    and the succeeding pattern was last
+
+    fixed directory? for drives on Win32
+
+    define MY_RAND_MAX as 0x7FFFFFFF for TRU64 flavor
+
+    added mysql51.lsp module for MySQL v.5.1
+
+9.2.12
+    indices overshooting the list at the end (too big positive index) and
+    indices overshooting the list at the beginning (too big negative index)
+    now cause a "list index out of bounds" error. Before the last or
+    first element of a list was returned instead.
+
+    This affects the functions: nth, set-nth, nth-set, push and pop
+
+    If more indices are present than nesting levels, these are discarded as before.
+    Popping an empty list will return nil.
+
+    Fixed a stack overflow in the new 'set-ref-all'
+
+    Changes in the newlisp-edit.lsp GS editor, see guiserver/CHANGES
+
+    The environment variable NEWLISPDIR will only be created and set if it does
+    not exist. An exisiting definition of NEWLISPDIR will not be overwritten.
+
+9.2.13
+    a bug fix in set-nth, nth-set, ser-ref, ref-set (in getList() ) when first 
+    element in an implicit index parameter list evaluates to a context
+
+9.2.15
+    assoc, set-assoc (old replace-assoc) and new assoc-set all take mutiple keys
+    for multilevel association lists
+
+    fixed stack overflow in ref, set-ref, ref-set
+
+9.2.16
+    set-assoc and assoc-set redone, fixes for set-ref, ref-set, set-ref-all
+	newlisop_manual.html updates
+
+9.2.17
+    Fixes for 'set-assoc' and 'set-ref' when using the wrong syntax
+
+    new 'pop-assoc' for removing associations
+
+    'find' and 'ref' put their last found expression into $0 when used with a
+    cpmparison functor as parameter 
+
+    'find-all' has two additional syntax patterns
+
+    'process' now parses commands and args delimited by single or double quotes.
+    This is necessary when using file name or argumemnts containing spaces.
+    On Win32 do: (process {newlisp '"test prog.lsp"'}) 
+    On Unix do: (process {newlisp 'test prog.lsp'}) ; single or double quotes work
+
+    The octal format spcecifier (format "%o" 8) => "10" will work on many
+    platforms compilers. This is now documented and useful when inspecting
+    the mode number from the 'file-info' function.
+
+9.3.0 prerelease January 28th, 2008
+    fix in 'sys-info' for some 64-bit compilations, and other int -> size_t
+
+    reset -w base directory after http requests, this is important in -c mode
+    when both, http and net-eval requests may come in, so that http requests
+    cannot change the current directory of the server for net-eval requests
+
+9.3.0 final release February 1st, 2008
+    a fix for newlisp server mode when using IE explorer on Win32
+
+    documentation changes
+
+9.3.1
+    doc changes
+
+    fixes for guiserver v.115 (see guiserver/CHANGES)
+
+    fixed error message for unclosed curl brace
+
+	'pop-assoc' should not set $0 as do 'set-assoc', 'assoc-set' 
+
+	: colon operator should not evaluate args after the object
+
+    the description - read - has been deleted, the function originally introduced
+    here in 9.3.1 has been taken out in 9.3.3
+
+9.3.2
+    new compile flavor for IPv6 with the following makefiles:
+      makefile_darwin_utf8_IPv6
+      makefile_linux_IPv6
+      makefile_bsd_IPv6
+
+    elimnate quirky symbol syntax in 'net-send'
+
+    functions called by dynamic symbols now switch to the dynamic
+    context:
+        (define (foo:foo) (context))
+        (set 'ctx foo)
+        (ctx) => foo
+        (ctx:foo) => foo ; previously MAIN
+
+    changed report format in 'net-ping' now includes roundtrip time in 
+    micro-seconds
+
+9.3.3
+    fixed display of signon banner, which made newlisp-tk.tcl not work. Also, in order
+    to make newlisp-tk.tcl work on 9.3.0 and after, the line in newlisp-tk.tcl:
+		(net-send SYS:tk-sock 'result)
+	should be changed
+		(net-send SYS:tk-sock result)	
+
+    in the runtk.lsp utility (see http://www.newlisp.org/index.cgi?page=Tk_and_newLISP)
+    the line: 
+		(process "wish" tcin tcout)
+	changed to:
+		(process "/usr/bin/wish" tcin tcout)
+	to make it work on v9.3.0 and after
+
+    'search' has a new flag parameter to put the filepointer after the seach to either
+     the beginnin (nil) or the end (true) of the searched string.
+
+    added <hr> as a legal tag in v.1.5 newlispdoc formatted documentation 
+
+    'xml-parse' crashed when not passing a valid symbol or context
+
+    extra boolean flag in 'bind' forces evaluation of bound parameters:
+
+    (bind assocList true) same as: (apply set (flat assocList))
+    this enables an efficient way to define functions with names parameters:
+
+        (define-macro (foo)
+	      (local (len width height)
+		  (bind (args) true)
+		  (println "len: " len " width:" width " height:" height)
+	    ))
+
+        (foo (width 20) (height (+ 5 25)) (len 10))
+
+      outputs -> len: 10 width:20 height:30
+
+    a fix for 'expand' when expanding upper-case characters, now limited to 65->90
+    to prevent expansion of symbils starting with special characters
+
+    took out the 'read' from 9.3.1. Just couldn't see the benefit of it. Everything
+    which can be done eoth it can be done by redefining 'define', or create other
+    special def- functions which transform toplevel expressions.
+
+    'env' now removes an enviroment variable when setting it to an empty string
+	except when on Solaris, where it stays as an empty string.
+    (env "VAR" "value") (env "VAR") => "value" (env "VAR" "") (env "VAR") => nil
+    On Solaris (env "VAR") = ""
+
+    fixed a memory leak on Won32 and Solaris when repeatedly setting the same 
+    environment variable
+
+    9.3.2 did not compile on Solaris, 9.3.3 now compiles on Solaris
+
diff --git a/doc/COPYING b/doc/COPYING
new file mode 100644
index 0000000..c0643ed
--- /dev/null
+++ b/doc/COPYING
@@ -0,0 +1,1157 @@
+Copyright information
+---------------------
+
+Documentation found in this package is licensed under the
+"GNU Free Documentation License Version 1.2, November 2002".
+The text of this license is contained in this file.
+
+Source code for this package copyright (c) Lutz Mueller is
+licensed under the "GNU GENERAL PUBLIC LICENSE Version 3, June 2007".
+The text of this license is contained in this file.
+
+All icons and images are copyright (c) Michael Michaels
+under the "GNU GENERAL PUBLIC LICENSE Version 3, June 2007".
+
+Files starting with the letters "pcre" are copyright (c) University 
+of Cambridge. The text of this license is contained in this file.
+
+The files osx-dlfcn.c and osx-dlfcn.h are copyright 
+(c) Jorge Acereda and Peter O'Gorman.  The text of this license 
+is contained in this file.
+
+Code for base-64 conversions from the cURL project is included 
+in nl-web.c and copyright (c) Daniel Stenberg, <daniel@haxx.se>. 
+The text of this license is contained in this file.
+
+The Red-Black Binary Tree in nl-symbol.c is adapted from
+Thomas Niemann: Sorting and Searching Algorithms.
+The text of this license is contained in this file.
+
+Following:
+
+- GNU General Public License v. 3
+- GNU Free Documentation License
+- Universiy of Cambridge License
+- Acereda and Gorman License
+- Daniel Stenbers / cURL license
+- Thomas Niemann license
+
+---------------------------------------------------------------------
+
+
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+ 
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+  
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+		     END OF TERMS AND CONDITIONS
+
+
+-----------------------------------------------------------------------------
+
+		GNU Free Documentation License
+		  Version 1.2, November 2002
+
+
+ Copyright (C) 2000,2001,2002  Free Software Foundation, Inc.
+     51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+0. PREAMBLE
+
+The purpose of this License is to make a manual, textbook, or other
+functional and useful document "free" in the sense of freedom: to
+assure everyone the effective freedom to copy and redistribute it,
+with or without modifying it, either commercially or noncommercially.
+Secondarily, this License preserves for the author and publisher a way
+to get credit for their work, while not being considered responsible
+for modifications made by others.
+
+This License is a kind of "copyleft", which means that derivative
+works of the document must themselves be free in the same sense.  It
+complements the GNU General Public License, which is a copyleft
+license designed for free software.
+
+We have designed this License in order to use it for manuals for free
+software, because free software needs free documentation: a free
+program should come with manuals providing the same freedoms that the
+software does.  But this License is not limited to software manuals;
+it can be used for any textual work, regardless of subject matter or
+whether it is published as a printed book.  We recommend this License
+principally for works whose purpose is instruction or reference.
+
+
+1. APPLICABILITY AND DEFINITIONS
+
+This License applies to any manual or other work, in any medium, that
+contains a notice placed by the copyright holder saying it can be
+distributed under the terms of this License.  Such a notice grants a
+world-wide, royalty-free license, unlimited in duration, to use that
+work under the conditions stated herein.  The "Document", below,
+refers to any such manual or work.  Any member of the public is a
+licensee, and is addressed as "you".  You accept the license if you
+copy, modify or distribute the work in a way requiring permission
+under copyright law.
+
+A "Modified Version" of the Document means any work containing the
+Document or a portion of it, either copied verbatim, or with
+modifications and/or translated into another language.
+
+A "Secondary Section" is a named appendix or a front-matter section of
+the Document that deals exclusively with the relationship of the
+publishers or authors of the Document to the Document's overall subject
+(or to related matters) and contains nothing that could fall directly
+within that overall subject.  (Thus, if the Document is in part a
+textbook of mathematics, a Secondary Section may not explain any
+mathematics.)  The relationship could be a matter of historical
+connection with the subject or with related matters, or of legal,
+commercial, philosophical, ethical or political position regarding
+them.
+
+The "Invariant Sections" are certain Secondary Sections whose titles
+are designated, as being those of Invariant Sections, in the notice
+that says that the Document is released under this License.  If a
+section does not fit the above definition of Secondary then it is not
+allowed to be designated as Invariant.  The Document may contain zero
+Invariant Sections.  If the Document does not identify any Invariant
+Sections then there are none.
+
+The "Cover Texts" are certain short passages of text that are listed,
+as Front-Cover Texts or Back-Cover Texts, in the notice that says that
+the Document is released under this License.  A Front-Cover Text may
+be at most 5 words, and a Back-Cover Text may be at most 25 words.
+
+A "Transparent" copy of the Document means a machine-readable copy,
+represented in a format whose specification is available to the
+general public, that is suitable for revising the document
+straightforwardly with generic text editors or (for images composed of
+pixels) generic paint programs or (for drawings) some widely available
+drawing editor, and that is suitable for input to text formatters or
+for automatic translation to a variety of formats suitable for input
+to text formatters.  A copy made in an otherwise Transparent file
+format whose markup, or absence of markup, has been arranged to thwart
+or discourage subsequent modification by readers is not Transparent.
+An image format is not Transparent if used for any substantial amount
+of text.  A copy that is not "Transparent" is called "Opaque".
+
+Examples of suitable formats for Transparent copies include plain
+ASCII without markup, Texinfo input format, LaTeX input format, SGML
+or XML using a publicly available DTD, and standard-conforming simple
+HTML, PostScript or PDF designed for human modification.  Examples of
+transparent image formats include PNG, XCF and JPG.  Opaque formats
+include proprietary formats that can be read and edited only by
+proprietary word processors, SGML or XML for which the DTD and/or
+processing tools are not generally available, and the
+machine-generated HTML, PostScript or PDF produced by some word
+processors for output purposes only.
+
+The "Title Page" means, for a printed book, the title page itself,
+plus such following pages as are needed to hold, legibly, the material
+this License requires to appear in the title page.  For works in
+formats which do not have any title page as such, "Title Page" means
+the text near the most prominent appearance of the work's title,
+preceding the beginning of the body of the text.
+
+A section "Entitled XYZ" means a named subunit of the Document whose
+title either is precisely XYZ or contains XYZ in parentheses following
+text that translates XYZ in another language.  (Here XYZ stands for a
+specific section name mentioned below, such as "Acknowledgements",
+"Dedications", "Endorsements", or "History".)  To "Preserve the Title"
+of such a section when you modify the Document means that it remains a
+section "Entitled XYZ" according to this definition.
+
+The Document may include Warranty Disclaimers next to the notice which
+states that this License applies to the Document.  These Warranty
+Disclaimers are considered to be included by reference in this
+License, but only as regards disclaiming warranties: any other
+implication that these Warranty Disclaimers may have is void and has
+no effect on the meaning of this License.
+
+
+2. VERBATIM COPYING
+
+You may copy and distribute the Document in any medium, either
+commercially or noncommercially, provided that this License, the
+copyright notices, and the license notice saying this License applies
+to the Document are reproduced in all copies, and that you add no other
+conditions whatsoever to those of this License.  You may not use
+technical measures to obstruct or control the reading or further
+copying of the copies you make or distribute.  However, you may accept
+compensation in exchange for copies.  If you distribute a large enough
+number of copies you must also follow the conditions in section 3.
+
+You may also lend copies, under the same conditions stated above, and
+you may publicly display copies.
+
+
+3. COPYING IN QUANTITY
+
+If you publish printed copies (or copies in media that commonly have
+printed covers) of the Document, numbering more than 100, and the
+Document's license notice requires Cover Texts, you must enclose the
+copies in covers that carry, clearly and legibly, all these Cover
+Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
+the back cover.  Both covers must also clearly and legibly identify
+you as the publisher of these copies.  The front cover must present
+the full title with all words of the title equally prominent and
+visible.  You may add other material on the covers in addition.
+Copying with changes limited to the covers, as long as they preserve
+the title of the Document and satisfy these conditions, can be treated
+as verbatim copying in other respects.
+
+If the required texts for either cover are too voluminous to fit
+legibly, you should put the first ones listed (as many as fit
+reasonably) on the actual cover, and continue the rest onto adjacent
+pages.
+
+If you publish or distribute Opaque copies of the Document numbering
+more than 100, you must either include a machine-readable Transparent
+copy along with each Opaque copy, or state in or with each Opaque copy
+a computer-network location from which the general network-using
+public has access to download using public-standard network protocols
+a complete Transparent copy of the Document, free of added material.
+If you use the latter option, you must take reasonably prudent steps,
+when you begin distribution of Opaque copies in quantity, to ensure
+that this Transparent copy will remain thus accessible at the stated
+location until at least one year after the last time you distribute an
+Opaque copy (directly or through your agents or retailers) of that
+edition to the public.
+
+It is requested, but not required, that you contact the authors of the
+Document well before redistributing any large number of copies, to give
+them a chance to provide you with an updated version of the Document.
+
+
+4. MODIFICATIONS
+
+You may copy and distribute a Modified Version of the Document under
+the conditions of sections 2 and 3 above, provided that you release
+the Modified Version under precisely this License, with the Modified
+Version filling the role of the Document, thus licensing distribution
+and modification of the Modified Version to whoever possesses a copy
+of it.  In addition, you must do these things in the Modified Version:
+
+A. Use in the Title Page (and on the covers, if any) a title distinct
+   from that of the Document, and from those of previous versions
+   (which should, if there were any, be listed in the History section
+   of the Document).  You may use the same title as a previous version
+   if the original publisher of that version gives permission.
+B. List on the Title Page, as authors, one or more persons or entities
+   responsible for authorship of the modifications in the Modified
+   Version, together with at least five of the principal authors of the
+   Document (all of its principal authors, if it has fewer than five),
+   unless they release you from this requirement.
+C. State on the Title page the name of the publisher of the
+   Modified Version, as the publisher.
+D. Preserve all the copyright notices of the Document.
+E. Add an appropriate copyright notice for your modifications
+   adjacent to the other copyright notices.
+F. Include, immediately after the copyright notices, a license notice
+   giving the public permission to use the Modified Version under the
+   terms of this License, in the form shown in the Addendum below.
+G. Preserve in that license notice the full lists of Invariant Sections
+   and required Cover Texts given in the Document's license notice.
+H. Include an unaltered copy of this License.
+I. Preserve the section Entitled "History", Preserve its Title, and add
+   to it an item stating at least the title, year, new authors, and
+   publisher of the Modified Version as given on the Title Page.  If
+   there is no section Entitled "History" in the Document, create one
+   stating the title, year, authors, and publisher of the Document as
+   given on its Title Page, then add an item describing the Modified
+   Version as stated in the previous sentence.
+J. Preserve the network location, if any, given in the Document for
+   public access to a Transparent copy of the Document, and likewise
+   the network locations given in the Document for previous versions
+   it was based on.  These may be placed in the "History" section.
+   You may omit a network location for a work that was published at
+   least four years before the Document itself, or if the original
+   publisher of the version it refers to gives permission.
+K. For any section Entitled "Acknowledgements" or "Dedications",
+   Preserve the Title of the section, and preserve in the section all
+   the substance and tone of each of the contributor acknowledgements
+   and/or dedications given therein.
+L. Preserve all the Invariant Sections of the Document,
+   unaltered in their text and in their titles.  Section numbers
+   or the equivalent are not considered part of the section titles.
+M. Delete any section Entitled "Endorsements".  Such a section
+   may not be included in the Modified Version.
+N. Do not retitle any existing section to be Entitled "Endorsements"
+   or to conflict in title with any Invariant Section.
+O. Preserve any Warranty Disclaimers.
+
+If the Modified Version includes new front-matter sections or
+appendices that qualify as Secondary Sections and contain no material
+copied from the Document, you may at your option designate some or all
+of these sections as invariant.  To do this, add their titles to the
+list of Invariant Sections in the Modified Version's license notice.
+These titles must be distinct from any other section titles.
+
+You may add a section Entitled "Endorsements", provided it contains
+nothing but endorsements of your Modified Version by various
+parties--for example, statements of peer review or that the text has
+been approved by an organization as the authoritative definition of a
+standard.
+
+You may add a passage of up to five words as a Front-Cover Text, and a
+passage of up to 25 words as a Back-Cover Text, to the end of the list
+of Cover Texts in the Modified Version.  Only one passage of
+Front-Cover Text and one of Back-Cover Text may be added by (or
+through arrangements made by) any one entity.  If the Document already
+includes a cover text for the same cover, previously added by you or
+by arrangement made by the same entity you are acting on behalf of,
+you may not add another; but you may replace the old one, on explicit
+permission from the previous publisher that added the old one.
+
+The author(s) and publisher(s) of the Document do not by this License
+give permission to use their names for publicity for or to assert or
+imply endorsement of any Modified Version.
+
+
+5. COMBINING DOCUMENTS
+
+You may combine the Document with other documents released under this
+License, under the terms defined in section 4 above for modified
+versions, provided that you include in the combination all of the
+Invariant Sections of all of the original documents, unmodified, and
+list them all as Invariant Sections of your combined work in its
+license notice, and that you preserve all their Warranty Disclaimers.
+
+The combined work need only contain one copy of this License, and
+multiple identical Invariant Sections may be replaced with a single
+copy.  If there are multiple Invariant Sections with the same name but
+different contents, make the title of each such section unique by
+adding at the end of it, in parentheses, the name of the original
+author or publisher of that section if known, or else a unique number.
+Make the same adjustment to the section titles in the list of
+Invariant Sections in the license notice of the combined work.
+
+In the combination, you must combine any sections Entitled "History"
+in the various original documents, forming one section Entitled
+"History"; likewise combine any sections Entitled "Acknowledgements",
+and any sections Entitled "Dedications".  You must delete all sections
+Entitled "Endorsements".
+
+
+6. COLLECTIONS OF DOCUMENTS
+
+You may make a collection consisting of the Document and other documents
+released under this License, and replace the individual copies of this
+License in the various documents with a single copy that is included in
+the collection, provided that you follow the rules of this License for
+verbatim copying of each of the documents in all other respects.
+
+You may extract a single document from such a collection, and distribute
+it individually under this License, provided you insert a copy of this
+License into the extracted document, and follow this License in all
+other respects regarding verbatim copying of that document.
+
+
+7. AGGREGATION WITH INDEPENDENT WORKS
+
+A compilation of the Document or its derivatives with other separate
+and independent documents or works, in or on a volume of a storage or
+distribution medium, is called an "aggregate" if the copyright
+resulting from the compilation is not used to limit the legal rights
+of the compilation's users beyond what the individual works permit.
+When the Document is included in an aggregate, this License does not
+apply to the other works in the aggregate which are not themselves
+derivative works of the Document.
+
+If the Cover Text requirement of section 3 is applicable to these
+copies of the Document, then if the Document is less than one half of
+the entire aggregate, the Document's Cover Texts may be placed on
+covers that bracket the Document within the aggregate, or the
+electronic equivalent of covers if the Document is in electronic form.
+Otherwise they must appear on printed covers that bracket the whole
+aggregate.
+
+
+8. TRANSLATION
+
+Translation is considered a kind of modification, so you may
+distribute translations of the Document under the terms of section 4.
+Replacing Invariant Sections with translations requires special
+permission from their copyright holders, but you may include
+translations of some or all Invariant Sections in addition to the
+original versions of these Invariant Sections.  You may include a
+translation of this License, and all the license notices in the
+Document, and any Warranty Disclaimers, provided that you also include
+the original English version of this License and the original versions
+of those notices and disclaimers.  In case of a disagreement between
+the translation and the original version of this License or a notice
+or disclaimer, the original version will prevail.
+
+If a section in the Document is Entitled "Acknowledgements",
+"Dedications", or "History", the requirement (section 4) to Preserve
+its Title (section 1) will typically require changing the actual
+title.
+
+
+9. TERMINATION
+
+You may not copy, modify, sublicense, or distribute the Document except
+as expressly provided for under this License.  Any other attempt to
+copy, modify, sublicense or distribute the Document is void, and will
+automatically terminate your rights under this License.  However,
+parties who have received copies, or rights, from you under this
+License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+
+10. FUTURE REVISIONS OF THIS LICENSE
+
+The Free Software Foundation may publish new, revised versions
+of the GNU Free Documentation License from time to time.  Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.  See
+http://www.gnu.org/copyleft/.
+
+Each version of the License is given a distinguishing version number.
+If the Document specifies that a particular numbered version of this
+License "or any later version" applies to it, you have the option of
+following the terms and conditions either of that specified version or
+of any later version that has been published (not as a draft) by the
+Free Software Foundation.  If the Document does not specify a version
+number of this License, you may choose any version ever published (not
+as a draft) by the Free Software Foundation.
+
+
+ADDENDUM: How to use this License for your documents
+
+To use this License in a document you have written, include a copy of
+the License in the document and put the following copyright and
+license notices just after the title page:
+
+    Copyright (c)  YEAR  YOUR NAME.
+    Permission is granted to copy, distribute and/or modify this document
+    under the terms of the GNU Free Documentation License, Version 1.2
+    or any later version published by the Free Software Foundation;
+    with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
+    A copy of the license is included in the section entitled "GNU
+    Free Documentation License".
+
+If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
+replace the "with...Texts." line with this:
+
+    with the Invariant Sections being LIST THEIR TITLES, with the
+    Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST.
+
+If you have Invariant Sections without Cover Texts, or some other
+combination of the three, merge those two alternatives to suit the
+situation.
+
+If your document contains nontrivial examples of program code, we
+recommend releasing these examples in parallel under your choice of
+free software license, such as the GNU General Public License,
+to permit their use in free software.
+
+---------------------------------------------------------------------
+
+           Copyright (c) 1997-2004 University of Cambridge
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice,
+      this list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+    * Neither the name of the University of Cambridge nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+
+-----------------------------------------------------------------------------
+
+Copyright (c) 2002 Jorge Acereda  <jacereda@users.sourceforge.net> &
+                   Peter O'Gorman <ogorman@users.sourceforge.net>
+                   
+Portions may be copyright others, see the AUTHORS file included with this
+distribution.                  
+
+Maintained by Peter O'Gorman <ogorman@users.sourceforge.net>
+
+Bug Reports and other queries should go to <ogorman@users.sourceforge.net>
+
+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.
+
+-----------------------------------------------------------------------------
+
+Copyright (C) 1998 - 2004, Daniel Stenberg, <daniel@haxx.se>, et al.
+
+This software is licensed as described in the file COPYING, which
+you should have received as part of this distribution. The terms
+are also available at http://curl.haxx.se/docs/copyright.html.
+
+You may opt to use, copy, modify, merge, publish, distribute and/or sell
+copies of the Software, and permit persons to whom the Software is
+furnished to do so, under the terms of the COPYING file.
+
+This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
+KIND, either express or implied.
+
+$Id: base64.c,v 1.32 2004/12/15 01:38:25 danf Exp $
+
+-----------------------------------------------------------------------------
+
+Thomas Niemann: Sorting and Searching Algorithms
+
+http://epaperpress.com/sortsearch/index.html
+
+Permission to reproduce portions of this document is given provided the web 
+site listed below is referenced, and no additional restrictions apply. Source 
+code, when part of a software project, may be used freely without reference 
+to the author. 
+  
+Thomas Niemann 
+Portland,  Oregon 
+epaperpress.com
+-----------------------------------------------------------------------------
diff --git a/doc/CREDITS b/doc/CREDITS
new file mode 100644
index 0000000..78f9520
--- /dev/null
+++ b/doc/CREDITS
@@ -0,0 +1,150 @@
+CREDITS
+-------
+
+Over the years many users have contributed to newLISP with, suggestions,
+critiques and code. They where crucial in making newLISP what it is today.
+I want to thank everybody and encourage them to continue
+to contribute with code and comments. My special thanks go to
+(in historical order):
+
+Steve Adams 
+  Did the first CYGWIN port and the new native Win32 ports, suggested many
+  other features and functions found today in newLISP.
+
+Stellan Borg 
+  Some of the string functions where suggested by him, discovered and
+  prompted the fixing of many shortcomings in newLISP, built first
+  commercial product (the knowledge manager SUCCEED tm) based on newLISP.
+
+Lars Hard
+  Many insights and ideas (where are you?, I want to contact you).
+
+Ryon Root
+  Set up and maintains the web board for discussing newLISP at
+  http://www.alh.net/newlisp/phpbb/index.php .
+
+Eddie Rucker
+  His comments, insights and ideas have prompted many changes and additions
+  since the Unix versions of newLISP have appeared in 2001.
+
+Hans Peter Wickern
+  Many usability suggestions and newlisp-tk.tcl improvements. Hans-Peter
+  also introduced newLISP to many NeoBook and PowerBasic users and has
+  written various DLLs which can be imported by newLISP on the Win32
+  platform http://hpwickern.bei.t-online.de/anmeldung/html1/newLISP/newLISP.html.
+
+Nigel Brown
+  Helped making floating point behaviour consistent across platforms, 
+  researched the use of setlocale(), triggered bugfixes and changes in
+  math functions and contributed many other suggestions, which
+  helped to improve newLISP.
+
+Keith Trenton
+  Helps initiated the documentation thread on the discussion board, since
+  then many useres have pointed out errors in the documentation and
+  suggested improvements.
+
+Samuel CoX
+  Pointed out many flaws in the documentation , prompted addition of atan2
+  and contributed code examples.
+
+Brian Clausing
+  did the first complete pass through the manual taking care not only of
+  spelling and punctuation but also improving style.
+
+Norman Deppenbroek and Peter van Eerten, http://gtk-server.org
+  both from the GTK-server project helped improving networking functions.
+  Peter's GTK-server is an alternative to Tcl/Tk when doing platform
+  independent GUIs or graphics with newLISP.
+  Norman has contributed many useful newISP command line utilities
+  for the Internet and other usages http://www.nodep.nl/newlisp/.  
+
+David S. de Lis from http://www.geocities.com/excaliborus/
+  contributed the newlisp.vim file for VIM editor syntax highlighting
+  now part of the newLISP source distribution
+
+Luis Carvalho (Kozure) ported newLISP to the PocketPC running Win CE
+  using Alexander Mamaich's pocket gcc, a port of gcc for ARM cpu based
+  PocketPC, http://mamaich.kasone.com/fr_pocket.htm.
+
+John Small
+  initiated the advancement of logical programming in newLISP and contributed
+  many scripts showing how to use newLISP macros. He also wrote the popular
+  introduction "newLISP in 21 minutes"
+
+Greg Ben
+  contributed an account and space on a Sun Sparc workstation for better
+  development and testing on the Sun Solaris platform.
+
+Lucas Wix
+  developed the first newlisp.jsf syntax file for the Joe editor
+  now part of the newLISP source distribution
+
+Tim Johnson
+  developed a syntax file for Emacs http://www.johnsons-web.com/demo/newlisp/ 
+
+John DeSanto, Gordon Fischer, John Flowers, Martin Quiroga (alphabetical order)
+  from Kozoru.com for their ideas and suggestions for improvements and enhancements
+  of the newLISP language and improvements and work-out of the database libraries
+  sqlite.lsp (Flowers) and mysql.lsp (Fischer). In June 2006 Kozoru released
+  http://byoms.com, a distributed application almost entirely built with newLISP. 
+
+Cormullion cormullion@mac.com, http://newlisper.blogspot.com
+  for evangelizing newLISP on the MacOS X platform and publishing many ideas
+  how to use newLISP on that platform and writing the "Introduction to newLISP"
+
+Michael and Melissa Michaels, http://www.neglook.com
+  for a complete review of the Users Manual and evangelizing efforts for newLISP
+  and other good ideas, i.e. defaults in argument lists: (define (foo x (y 1)) ...) 
+  Michael also designed the icons for newLISP-GS in v9.2 and much of the FOOP system 
+  released in 9.3.
+
+Bob Bae (aka frontera000, http://sparebandwidth.blogspot.com/)
+  bringing many ideas to the advancement of newLISP and actively advocating for
+  newLISP on his and other peoples blogs
+
+Jeremy Dunn
+  introduced the idea of default args for several operators i.e. (> x) => (> x 0)
+  and for (>> x) => (>> x 1), (div x) => (div 1 x) ... and suggestions
+
+Michael Sabin
+  contributed UTF-16 capabe file and directory routines for the Win32 versions.
+
+Dmitri Cherniak from http://en.feautec.pp.ru/
+  many ideas for the newLISP API and main contributor of newLISP expansion
+  modules.
+
+Cyril Slobin from http://wagner.pp.ru/~slobin/
+  contributed a new newlisp.vim syntax-highlighing file for the vim editor.
+
+------------------------- other contributors, sources ----------------------------
+Phillip Hazel
+  wrote the PCRE (Perl Regular Expressions) library, it is an essential
+  part of newLISP and many other scripting languages and Open Source applications
+  (i.e. Apache)
+
+Jorge Acereda and Peter O'Gorman
+  wrote dyna link library functions for OSX which are used in this project,
+  their files osx-dlfcn.c/.h were necessary on pre 10.3 versions of MacOSX
+  (functionality/code? now part of OX X since 10.3)
+
+Daniel Stenberg
+  from the cURL project newLISP adapted the base64 encoding and decoding routines
+
+Thomas Niemannn
+  wrote a red-black binary tree algorithm used in newLISP with modifications
+
+Sourceforge.net
+  Has helped newLISP and many other Open Source projects to get more visibility,
+  the newLISP project enjoys their compile farm to port newLISP to other platforms
+
+Richard M. Stallman
+  GCC and many other GNU - tools make it possible to write platform independent
+  software for many OSs and hardware platforms. The GNU Public License is the 
+  strongest force in the open source movement from which newLISP has benefitted.
+
+
+My apologies to anybody, who was forgotten on this list (let me know).
+
+                                  +++
+
diff --git a/doc/CodePatterns.html b/doc/CodePatterns.html
new file mode 100644
index 0000000..99737ca
--- /dev/null
+++ b/doc/CodePatterns.html
@@ -0,0 +1,3573 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+   <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
+   <meta name="author" content="Lutz Mueller">
+   <meta name="keywords" 
+         content="newLISP LISP SCHEME programming language manual reference Artificial Intelligence AI NUEVATEC">
+   <meta name="description" content="newLISP Code Patterns">
+   <title>newLISP Code Patterns</title>
+
+<style type="text/css" media="screen">
+
+<!--
+
+.divider {
+	margin-top: 2em; 
+	margin-bottom: 1em;
+	font-family: Times New Roman, Times, serif;
+	color: #ffAA28;
+	}
+
+.title {
+	font-family:Optima, Georgia, Times New Roman, Times, serif; 
+	font-size:300%;
+	font-weight: 500;
+	}
+
+.trade {
+	font-family:Optima, Georgia, Times New Roman, Times, serif;
+	font-size:100%;
+	padding-top:16px;
+	}
+
+span.arw {
+	color:#666666;
+	font-size: 100%;
+	}
+	
+body, h1, h2, h3, h4, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+	line-height: 120%;
+ 	}
+
+table.list {
+	border-width: 0px;
+	padding: 3px;
+	}
+	
+th.list {
+	font-family:Georgia, Times New Roman, Times, serif;
+	font-size:0.8em;
+	font-weight: 700;
+	}
+	
+td.left {
+	font-family: Andale Mono, Bitstream Vera Sans Mono, Monaco, Courier New;
+   	font-size: 100%;
+	}
+	
+td.right {
+	font-family:Georgia, Times New Roman, Times, serif;
+   	font-size: 100%;
+   	font-style: italic;
+	}
+	
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+   	font-size: 100%;
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	font-size: 100%;
+	}
+	
+-->
+
+</style>
+</head>
+<body style="margin: 20px;" text="#000000" bgcolor="#FFFFFF" link="#376590" vlink="#551A8B" alink="#ffAA28">
+
+<br><br>
+
+<center>
+<h1 class="title">Code Patterns in newLISP<sup><font size="-2">TM</font></sup></h1>
+Version 2008 March 2nd<sup>th</sup><br>
+<a href="http://newlisp.org">newLISP</a> v.9.3 and after 
+</center>
+
+<br><br><br>
+
+<center>
+<span style="line-height:80%;">
+<font size="-2">
+Copyright &copy; 2008 Lutz Mueller, <a href="http://www.nuevatec.com">www.nuevatec.com</a>. All rights reserved.<br>
+Permission is granted to copy, distribute and/or modify this document under the terms of the <a href="#GFDL">GNU Free Documentation License</a>,<br>
+Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts,<br>
+and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.<br>
+<br>
+newLISP is a trademark of Lutz Mueller.
+</font>
+</span>
+</center>
+
+<br><br>
+
+<blockquote>
+<center><h2>Contents</h2></center>
+<ol>
+<li><a href="#intro">Introduction</a></li>
+<li><a href="#scripts">newLISP script files</a></li>
+<ul>
+	<li>Specifying command line options in script files</li>
+	<li>Scripts as pipes</li>
+	<li>File filters</li>
+</ul>
+<li><a href="#modules">Writing software in modules</a></li>
+<ul>
+	<li>Sructuring an application</li>
+	<li>More than one context per file</li>
+	<li>Simple context objects and the default function</li>
+	<li>Packaging data with contexts</li>
+	<li>Passing context objects by reference</li>
+</ul> 
+<li><a href="#locals">Local variables</a></li>
+<ul>
+	<li>Locals in looping functions</li>
+	<li>Local symbols using <tt>let</tt>, <tt>letn</tt> and <tt>local</tt></li>
+	<li>Unused parameters as local symbols</li>
+	<li>Using <tt>args</tt> as local substitute</li>
+</ul>
+<li><a href="#walking">Walking through lists</a></li>
+<ul>
+	<li>Recursion or not?</li>
+	<li>Generators</li>
+	<li>Speed up with memoization</li>
+	<li>Walking a tree</li>
+	<li>Walking a directory tree</li>
+</ul>
+<li><a href="#creating">Creating, accessing, modifying and searching lists</a></li>
+<ul>
+	<li><tt>push</tt> and <tt>pop</tt></li> 
+	<li>Accessing lists</li>
+	<li>Selecting more than one element</li>
+    <li>Filtering and differencing lists</li>
+	<li>Changing list elements</li>
+	<li>The new element as a function of the replaced</li>
+	<li>Search and replace in simple lists</li>
+	<li>Search and replace in nested lists</li>
+	<li>Passing lists by reference using the default functor</li> 
+</ul>
+<li><a href="#flow">Program flow</a></li>
+<ul>
+	<li>Loops</li>
+	<li>Blocks</li>
+	<li>Branching</li>
+	<li>Fuzzy flow</li>
+	<li>Change flow with <tt>catch</tt> and <tt>throw</tt></li>
+	<li>Leave loops with a break condition</li>
+	<li>Change flow with <tt>and</tt> or <tt>or</tt></li>
+</ul>	
+<li><a href="#error">Error handling</a></li>
+<ul>
+	<li>System errors</li>
+	<li>User defined errors</li>
+	<li>Error event handlers</li>
+	<li>Catching errors</li>
+</ul>
+<li><a href="#functions">Functions as data</a></li>
+<ul>
+	<li>Manipulate functions after definition</li>
+	<li>Mapping and applying functions</li>
+	<li>Function currying: functions making functions</li>
+</ul>
+<li><a href="#text">Text processing</a></li>
+<ul>
+	<li>Regular expressions</li>
+	<li>Scanning text</li>
+	<li>Appending strings</li>
+	<li>Growing strings in place</li>
+	<li>Rearranging strings</li>
+</ul>
+<li><a href="#dicts">Dictionaries</a></li>
+<ul>
+    <li>Creating and modifying symbols</li>
+    <li>Iterating through dictionaries</li>
+	<li>Object oriented implementation of a dictionary</li>
+</ul>
+<li><a href="#tcpip">TCP/IP client server communications</a></li>
+<ul>
+	<li>Client - server TCP/IP - open connection</li>
+	<li>Client - server TCP/IP - closed connection</li>
+</ul>
+<li><a href="#udp">UDP communications</a></li>
+<ul>
+	<li>Open communications with UDP</li>
+	<li>Closed transaction oriented UDP</li>
+	<li>UDP multi-cast communications</li>
+</ul>
+<li><a href="#nonblock">Non-blocking communications</a></li>
+<ul>
+	<li>Using net-select</li>
+	<li>Using net-peek</li>
+</ul>
+<li><a href="#controlling">Controlling other apps</a></li>
+<ul>
+	<li>Communications via STD I/O</li>
+	<li>Communications via TCP/IP</li>
+	<li>Communicate via named FIFO</li>
+	<li>Communicate via UDP</li>
+</ul>
+<li><a href="#launch">Launching applications blocking</a></li>
+<ul>
+	<li>Shell execution</li> 
+	<li>Execution capturing std-out in a list</li>
+	<li>Execution feeding std-in</li>
+</ul>
+<li><a href="#threads">Threads, semaphores and shared memory</a></li>
+<li><a href="#databases">Databases, lookup tables</a></li>
+<ul>
+	<li>Association lists</li>
+	<li>Nested associations</li>
+	<li>Updating nested associations</li>
+	<li>Symbol creation and lookup</li>
+</ul>
+<li><a href="#distributed">Distributed computing</a></li>
+<ul>
+	<li>Setting up a newLISP server node</li>
+	<li>Evaluating multiple expressions remotely</li>
+	<li>Transferring files to and from remote nodes</li>
+	<li>Loading and saving code from and to remote nodes</li>
+    <li>HTTPD-only mode, newLISP as a webserver</li>
+    <li>Media types in HTTP modes</li>
+	<li>Environment variables set</li>
+	<li>Local domain UNIX sockets</li>
+</ul>
+<li><a href="#extending">Extending newLISP</a></li>
+<ul>
+	<li>Compile a shared library on Linux/UNIX/MacOSX</li>
+	<li>Compile a DLL on Win32</li>
+	<li>Using data structures in imported libraries</li>
+	<li>Unevenly aligned data structures</li>
+	<li>Passing parameters in library calls</li>
+	<li>Extracting return values from library calls</li>
+</ul>
+<li><a href="#appendix">Appendix</a></li>
+<ul>
+	<li>GNU Free Documentation License</li>
+</ul>
+</ol>
+</blockquote>
+
+<br>
+<center>&sect;</center>
+<a name="intro"></a>
+<h2>1. Introduction</h2>
+<p>When programming in newLISP certain functions and usage patterns occur repeatedly. For some problems an optimal way to solve them evolves over time. The following chapters present example code and explanations for the solution of specific problems when programming in newLISP.</p>
+
+<p>Some content is overlapping with material covered in the newLISP Users Manual and Reference or presented here with a different slant.</p>
+
+<p>Only a subset of newLISP's total function repertoire is used here. Some functions demonstrated have additional calling patterns or applications not mentioned on these pages.</p>
+
+<p>This collection of patterns and solutions is a work in progress. Over time material will be added or existing material improved.</p>
+<center>&sect;</center>
+<br>
+
+<a name="scripts"></a>
+<h2>2. newLISP script files</h2>
+
+<h3>Specifying command line options in script files</h3>
+<p>On Linux/UNIX put the following in the first line of the script/program file:</p>
+
+<pre>
+	#!/usr/bin/newlisp
+</pre>
+
+<p>specifying a bigger stack: </p>
+
+<pre>
+	#!/usr/bin/newlisp -s 100000
+</pre>
+
+<p>or</p>
+
+<pre>
+	#!/usr/bin/newlisp -s100000
+</pre>
+
+<p>Operating systems shells behave differently when parsing the first line and extract parameters. newLISP takes both, attached or detached parameters. Put the following lines in small script to test the behavior of the underlying OS and platform. The script changes the stack size allocated to 100,000 and limits LISP cell memory to about 10 M bytes.</p>
+
+<pre>
+	#!/usr/bin/newlisp -s 100000 -m 10
+
+	(println (main-args))
+	(println (sys-info))
+</pre>
+
+<p>A typical output executing the script from the system shell would be:</p>
+
+<pre>
+	./arg-test
+	
+	("/usr/bin/newlisp" "-s" "100000" "-m" "10" "./arg-test")	
+	(308 655360 299 2 0 100000 8410 2)
+</pre>
+
+<p>Note that few programs in newLISP need a bigger stack configured, most programs run on the internal default of 2048. Each stack position takes an average of 80 bytes. Other options are available to start newLISP. See the Users Manual for details.</p>
+
+<h3>Scripts as pipes</h3>
+
+<pre>
+	The following examples shows how a file can be piped into a newLISP script.
+	#!/usr/bin/newlisp
+	#
+	# uppercase - demo filter script as pipe
+	#
+	# usage: 
+	#          ./uppercase &lt; file-spec
+	#
+	# example: 
+	#          ./uppercase &lt; my-text
+	#
+	#
+
+	(while (read-line) (println (upper-case (current-line))))
+
+	(exit)
+</pre>
+
+
+<p>The file will be printed to stdout translated to uppercase.</p>
+
+<h3>File filters</h3>
+
+<p>The following script works like a Unix grep utility iterating through files and filtering each line in a file using a regular expression pattern.</p>
+
+<pre>
+	#!/usr/bin/newlisp
+	#
+	# nlgrep - grep utility on newLISP
+	#
+	# usage: 
+	#          ./nlgrep "regex-pattern" file-spec
+	#
+	# file spec can contain globbing characters
+	#
+	# example: 
+	#          ./nlgrep "this|that" *.c
+	#
+	# will print all line containing 'this' or 'that' in *.c files
+	#
+
+	(dolist (file-name (3 (main-args))) 
+		(set 'file (open file-name "read"))
+		(println "file ---> " file-name)
+		(while (read-line file)
+			(if (find (main-args 2) (current-line) 0)
+			(write-line)))
+		(close file))
+                
+	(exit)
+</pre>
+
+<p>The expression:</p>
+<pre>
+	(3 (main-args))
+</pre>
+
+<p>is a short form of writing:</p>
+
+<pre>
+	(rest (rest (rest (main-args))))
+</pre>
+
+<p>It returns a list of all the filenames. This form of specifying indices for rest is called implicit indexing. See the Users Manual for implicit indexing with other functions.
+The expression <tt>(main-args 2)</tt> extracts the 3rd argument from the commandline containing the regular expression pattern.</p>
+<center>&sect;</center>
+
+<br>
+<a name="modules"></a>
+<h2>3. Writing software in modules</h2>
+
+
+<h3>Structuring an application</h3>
+
+<p>When writing bigger applications or when several programmers are working on the same code base it is necessary to divide the code base into modules. Modules in newLISP are implemented using contexts, which are namespaces. Namespaces allow lexical isolation between modules. Variables of the same name in one module cannot clash with variables of the same name in another module.</p>
+
+<p>Typically moudules will be organized in one context per file. One file module may contain database access routines.</p>
+
+<pre>
+	; database.lsp
+	;
+	(context 'db)
+	
+	
+	(define (update x y z)
+	...
+	)
+	
+	(define (erase x y z)
+	...
+	)
+</pre>
+
+<p>Another module may contain various utilities</p>
+
+<pre>
+	; auxiliary.lsp
+	;
+	(context 'aux)
+	
+	(define (getval a b)
+	...
+	)
+</pre>
+
+<p>Typically there will be one MAIN module loading and controlling all others:</p>
+
+<pre>
+	; application.lsp
+	;
+	
+	(load "auxiliary.lsp")
+	(load "database.lsp")
+	
+	(define (run)
+		(db:update ....)
+		(aux:putval ...)
+		...
+		...
+	)
+	
+	(run)
+</pre>
+
+<h3>More than one context per file</h3>
+
+<p>When using more than one context per file, each context section should be closed with a <tt>(context MAIN)</tt> statement:</p>
+
+<pre>
+	; myapp.lsp
+	;
+	(context 'A)
+	
+	(define (foo ...)
+	...
+	)
+	
+	(context MAIN)
+	
+	(context 'B)
+	
+	(define (bar ...)
+	...
+	)
+	
+	(context MAIN)
+	
+	(define (main-func)
+	    (A:foo ...)
+	    (B:bar ...)
+	...
+	)
+</pre>
+
+<p>Note that in the namespace statements for contexts <tt>A</tt> and <tt>B</tt> the context names are quoted because they are newly created, while <tt>MAIN</tt> already exists when newLISP starts up and can stay unquoted, although quoting it would not represent a problem.</p>
+
+<h3>Simple objects and the default function</h3>
+
+<p>A function in a context may have the same name as the host context itself. This function has special characteristics:</p>
+
+<pre>
+	(context 'foo)
+	
+	(define (foo:foo a b c)
+	...
+	)
+</pre>
+
+<p>The function <tt>foo:foo</tt> is called the <em>default function</em>, because when using the context name <tt>foo</tt> like a function it will default to <tt>foo:foo</tt>:</p>
+
+<pre>
+	(foo x y z)
+	; same as
+	(foo:foo x y z)
+</pre>
+
+<p>The default function make is possible to write functions which look like normal functions but carry their own lexical namespace. We can use this to write functions which keep state:</p>
+
+<pre>
+	(context 'generator)
+	
+	(set 'acc 0)
+	
+	(define (generator:generator)
+		(inc 'acc))
+	
+	(context MAIN)
+	
+	(generator) &rarr; 1
+	(generator) &rarr; 2
+	(generator) &rarr; 3
+</pre>
+
+<p>The following is a more complex example for a function generating a fibonacci sequence:</p>
+
+<pre>
+	(define (fibo:fibo)
+		(if (not fibo:mem) (set 'fibo:mem '(0 1)))
+		(push (+ (fibo:mem -1) (fibo:mem -2)) fibo:mem -1))
+	
+	(fibo) &rarr; 1
+	(fibo) &rarr; 2
+	(fibo) &rarr; 3
+	(fibo) &rarr; 5
+	(fibo) &rarr; 8
+	...
+</pre>
+
+<p>This example also shows how a default function is defined <i>on the fly</i> wihtout the need of explicit <tt>context</tt> statements. As an alternative the function could also have been written creating the context explicitely:</p>
+
+<pre>
+	(context 'fibo)
+	(define (fibo:fibo)
+			(if (not mem) (set 'mem '(0 1)))
+			(push (+ (mem -1) (mem -2)) mem -1))
+	(context MAIN)
+	
+	(fibo) &rarr; 1
+	(fibo) &rarr; 2
+	(fibo) &rarr; 3
+	(fibo) &rarr; 5
+	(fibo) &rarr; 8
+</pre>
+
+<p>while the first form is shorter, the second form is more readable.</p>
+
+<h3>Packaging data with contexts</h3>
+
+<p>The previous examples already presented functions packaged with data in a namespace. In the <tt>generator</tt> example the <tt>acc</tt> variable kept state. In the <tt>fibo</tt> example the variable <tt>mem</tt> kept a growing list. In both cases functions and data are living together in a namespace. The follwing example shows how a namespace just holds data only in a  default functor:</p>
+
+<pre>
+	(set 'db:db '(a "b" (c d) 1 2 3 x y z))
+</pre>
+
+<p>Just like we used the default function to refer to <tt>fibo</tt> and <tt>generator</tt> we can refer to the list in <tt>db:db</tt> by only using <tt>db</tt>. This will work in all situations wher we do list indexing:</p>
+
+<pre>
+	(db 0)    &rarr; a
+	(db 1)    &rarr; "b"
+	(db 2 1)  &rarr; d
+	(db -z)   &rarr; p
+	(db -x)   &rarr; o
+ 
+	(3 db)    &rarr; (1 2 3 x y z)
+	(2 1 db)  &rarr; ((c d))
+	(-6 2 db) &rarr; (1 2)
+</pre>
+
+<h3>Passing context objects by reference</h3>
+
+<p>The default functor when used as an argument in a user defined function, is passed by reference. That means that no copy of the list or string is passed but a reference to the original contents. This is useful when handling large lists or strings:</p>
+
+<pre>
+	(define (update data idx expr)
+		(if (not (or (lambda? expr) (primitive? expr)))
+			(nth-set (data idx) expr)
+			(nth-set (data idx) (expr $0))))
+		
+	(update db 0 99) &rarr; a
+	db:db &rarr; (99 "b" (c d) 1 2 3 x y z)
+	
+	(update db 1 upper-case) &rarr; "b"
+	db:db &rarr; (99 "B" (c d) 1 2 3 x y z)
+	
+	(update db 4 (fn (x) (mul 1.1 x))) &rarr;
+	db:db &rarr; (99 "B" (c d) 1 2.2 3 x y z)
+</pre>
+
+<p>The data in <tt>db:db</tt> is passed via the <tt>update</tt> function parameter <tt>data</tt>, which now holds a reference to the context <tt>db</tt>. The <tt>expr</tt> parameter passed is checked if a built-in function, operator or a user defined lambda expression and than works on <tt>$0</tt>, the system variable containing the old content referenced by <tt>(data idx)</tt>.</p>
+
+<p>The function <tt>update</tt> is also a good example how to pass operators or functions as function argument. Read more about thois in chapter <a href="#functions">9. Functions as data</a>.</p>
+
+<p>when using destructive functions which take the un-indexed list like <tt>replace</tt>, <tt>rotate</tt>, <tt>sort</tt> and <tt>swap</tt> the function <tt>default</tt> can be used to extract the default functor and access the list or string in it by reference:</p>
+
+<pre>
+	(set 'foo:foo '( 6 3 5 8 6 7 4 1))
+
+	(define (my-sort clist)
+		(sort (eval (default clist))))
+
+	(my-sort foo) 
+
+	foo:foo  &rarr; (1 3 4 5 6 6 7 8)
+</pre>
+
+<center>&sect;</center>
+<br>
+
+<a name="locals"></a>
+<h2>4. Local variables</h2> 
+
+<h3>Locals in looping functions</h3>
+
+<p>All looping functions like <tt>dolist</tt>, <tt>dotimes</tt>, <tt>dotree</tt> and <tt>for</tt>, use local variables. During loop execution the variable takes different values, but after leaving the looping function the variable regains its old value. <tt>let</tt>, <tt>define</tt>, and <tt>lambda</tt> expressions are another method for making variables local:</p>
+
+<h3>Local symbols using <tt>let</tt>, <tt>letn</tt> and <tt>local</tt></h3>
+
+<p><tt>let</tt> is the usual way in LISP to declare symbols as local to a block.</p>
+<pre>
+	(define (sum-sq a b)
+    	(let ((x (* a a)) (y (* b b)))
+        	(+ x y)))
+
+	(sum-sq 3 4) &rarr; 25
+
+	; alternative syntax
+	(define (sum-sq a b)         
+    	(let (x (* a a) y (* b b))
+        	(+ x y)))
+
+	; using local
+	(define (sum-sq a b)
+		(local (x y)
+			(set 'x (* a a))
+			(set 'y (* b b))
+			(+ x y)))
+</pre>
+
+<p>The variables x and y are initialized, then the expression (+ x y) is evaluated. The <tt>let</tt> form is just an optimized version and syntactic convenience for writing:</p>
+
+<pre>
+	((lambda (sym1 [sym2 ...]) exp-body ) exp-init1 [ exp-init2 ...])
+</pre>
+
+<p>When initializing several parameters, a nested <tt>let</tt>, <tt>letn</tt> can be used to reference previously initialized variables in subsequent initializer expressions:</p>
+
+<pre>
+	(letn ((x 1) (y (+ x 1))) 
+	    (list x y))          	&rarr; (1 2)
+</pre>
+
+<p>The function <tt>local</tt> works like a <tt>let</tt> but initializing all variables to <tt>nil</tt>.</p>
+
+<h3>Unused parameters as local symbols</h3>
+
+<p>In newLISP all parameters in user defined functions are optional. Unused parameters are filled with <tt>nil</tt> and local to the dynamic scope of the function. Defining a user function with more parameters than required is a convenient method to create local variable symbols:</p>
+
+<pre>
+	(define (sum-sq a b , x y)
+		(set 'x (* a a))
+		(set 'y (* b b))
+		(+ x y))
+</pre>
+
+<p>The comma is not a special syntax feature but only a visual helper to separate normal parameters from local variable symbols.</p>
+
+<h3>Using <tt>args</tt> as local substitute</h3>
+
+<p>Using the <tt>args</tt> function no parameter symbols need to be used at all and <tt>args</tt> returns a list of all parameters passed but not taken by declared parameters:</p>
+
+<pre>
+	(define (foo)
+		(args))
+    
+	(foo 1 2 3)   &rarr; (1 2 3)
+	
+	
+	(define (foo a b)
+		(args))
+    
+	(foo 1 2 3 4 5)   &rarr; (3 4 5)
+</pre>
+
+<p>The second example shows how <tt>args</tt> only contains the list of arguments not bound by the variable symbols <tt>a</tt> and <tt>b</tt>.</p>
+
+<p>Indices can be used to access members of the <tt>(args)</tt> list:</p>
+
+<pre>
+	(define (foo) 
+	  	(+ (args 0) (args 1)))
+	  
+	(foo 3 4)   &rarr; 7 
+</pre>
+
+<center>&sect;</center>
+<br>
+
+<a name="walking"></a>
+<h2>5. Walking through lists</h2>
+
+<h3>Recursion or iteration?</h3>
+
+<p>Although recursion is a powerful feature to express many algorithms in a readable form, they are also inefficient in some instances. newLISP has many iterative constructs and high level functions like <tt>flat</tt> or the built-in XML functions, which use recursion internally. In many cases this makes defining a recursive algorithm not necessary.</p>
+
+
+<p>Some times a non-recursive solution can be much faster and lighter on system resources.</p>
+
+<pre>
+	;; classic recursion
+	;; slow and resource hungry
+	 (define (fib n)
+		(if (< n 2) 1
+  			(+  (fib (- n 1))
+	  			(fib (- n 2)))))
+</pre>
+
+<p>The recursive solution is slow because of frequent calling overhead incurred. The recursive solution uses also a lot of memory for holding intermediate results.</p>
+
+<pre>	
+	;; iteration
+	;; fast and also returns the whole list
+	(define (fibo n , f)
+		(set 'f '(1 0))
+		(dotimes (i n)
+ 			(push (+ (f 0) (f 1)) f) -1)
+		(rest f))
+</pre>
+
+<p>The iterative solution is fast and uses very little memory.</p>
+
+<h3>Generators</h3>
+
+<p>A generator is a function which keeps and changed state between invocations and returns a new value on each call:</p>
+
+<pre>
+	;; generator uses a namespace to keep state
+	;; the default funcion (fibo) gets called repeatedly
+	;;
+	;; (fibo) &rarr; 1
+	;; (fibo) &rarr; 2
+	;; (fibo) &rarr; 3, 5, 8, 13, 21 ...
+	;;
+	;; fibo:mem &rarr; (0 1 1 2 3 5 8 13 21 ...)
+	(define (fibo:fibo)
+		(if (not fibo:mem) (set 'fibo:mem '(0 1))) 
+		(push (+ (fibo:mem -2) (fibo:mem -1)) fibo:mem -1))
+</pre>
+
+<p>Namespaces in newLISP together with default functions are a convenient method to 
+package a function with local static variables. <tt>mem</tt> is used in the <tt>fibo</tt> 
+name space to keep the Fibonacci sequence.</p>
+
+<h3>Speed up with memoization</h3>
+
+<p>A memoizing function caches results for faster retrieval when called with the 
+same parameters again. The following function makes a memoizing function
+from any built-in or user defined function with an arbitrary number of arguments:<p>
+
+<blockquote><pre>
+;; speed up a recursive function using memoization
+(define-macro (memoize mem-func func) 
+  (set (sym mem-func mem-func) 
+    (letex (f func  c mem-func) 
+      (lambda () 
+        (or (context c (string (args))) 
+            (context c (string (args)) (apply f (args))))))))
+
+(memoize fibo-m fibo)
+
+(time (fibo-m 25)) &rarr; 148
+(time (fibo-m 25)) &rarr; 0
+</pre></blockquote>
+
+<p>The function  creates a context and <em>default</em> function for the original
+function with a new name and stores all results in symbols in the same context.</p>
+
+<p>When memoizing recursive functions, include the the raw lambda specification
+of the function so recursive calls are memoized too:</p>
+
+<blockquote><pre>
+(memoize fibo
+  (lambda (n)
+    (if(< n 2) 1
+      (+  (fibo (- n 1))
+          (fibo (- n 2))))))
+
+(time (fibo 100)) &rarr; 1
+(fibo 80)         &rarr; 37889062373143906
+</pre></blockquote>
+
+<p>The <tt>fibo</tt> function in the last example would take hours to calculate
+without memoization. The memoized version takes only about a milli second for
+an argument of <tt>100</tt>.</p>
+
+<h3>Walking a tree</h3>
+
+<p>Tree walks are a typical pattern in traditional LISP and in newLISP as well for walking through a nested list. But many times a tree walk is only used to iterate through all elements of an existing tree or nested list. In this case the built-in <tt>flat</tt> function is much faster than using recursion:</p>
+
+<pre>
+	(set 'L '(a b c (d e (f g) h i) j k))
+
+	;; classic car/cdr and recursion
+	;; 
+	(define (walk-tree tree)
+		(cond ((= tree '()) true)
+   			((atom? (first tree))
+	 			(println (first tree)) 
+	 			(walk-tree (rest tree)))
+   			(true
+	 			(walk-tree (first tree)) 
+	 			(walk-tree (rest tree)))))
+
+	;; classic recursion
+	;; 3 times faster
+	;;
+	(define (walk-tree tree)
+		(dolist (elmnt tree)
+  			(if (list? elmnt) 
+	  		(walk-tree elmnt)
+	  		(println elmnt))))
+	  
+	(walk-tree L) &rarr;
+	a
+	b
+	c
+	d
+	e
+	...
+</pre>
+
+<p>Using the built-in <tt>flat</tt> in newLISP a nested list can be transformed int a flat list. Now the list can be processed with a <tt>dolist</tt> or <tt>map</tt>:</p>
+
+<pre>
+	;; fast and short using 'flat'
+	;; 30 times faster with map
+	;;
+	(map println (flat L))
+
+	(dolist (item (flat L)) (println item)
+</pre>
+
+
+<h3>Walking a directory tree</h3>
+<p>Walking a directory tree is a task where recursion works well:</p>
+
+<pre>
+	; walks a disk directory and prints all path-file names
+	;
+	(define (show-tree dir)
+	(if (directory dir)
+		(dolist (nde (directory dir))
+		   (if (and (directory? (append dir "/" nde)) 
+					(!= nde ".") (!= nde ".."))
+				 (show-tree (append dir "/" nde))
+				 (println (append dir "/" nde))))))
+</pre>
+
+<p>In this example recursion is the only solution, because the entire nested list off files is not available when the function is called but gets created recursively during function execution.</p>
+
+<center>&sect;</center>
+<br>
+<a name="creating"></a>
+<h2>6. Creating, accessing, modifying and searchung lists</h2>
+
+<p>newLISP has facilities for multidimensional indexing into nested lists. There are 
+<i>destructive</i> functions like <tt>push</tt>, <tt>pop</tt>, <tt>set-nth</tt>, 
+<tt>nth-set</tt>, <tt>ref-set</tt>, <tt>set-ref</tt>, <tt>set-ref-all</tt>, 
+<tt>sort</tt> and <tt>reverse</tt> and many others for 
+<i>non-destructive</i> operations, like <tt>nth</tt>, <tt>ref</tt>, <tt>ref-all</tt>,
+<tt>first</tt>, <tt>last</tt> and <tt>rest</tt> etc.. 
+Many of the list functions in newLISP also work on strings.</p>
+
+<p>Note that any list or string index in newLISP can be negative starting with -1 
+from the right side of a list:</p>
+
+<pre>
+	(set 'L '(a b c d))
+	(L -1)   &rarr; d
+	(L -2)   &rarr; c
+	(-3 2 L) &rarr; (b c)
+
+	(set 'S  "abcd")
+
+	(S -1)   &rarr; d
+	(S -2)   &rarr; c
+	(-3 2 S) &rarr; "bc")
+</pre>
+
+
+<h3><tt>push</tt> and <tt>pop</tt></h3>
+
+<p>To add to a list use <tt>push</tt>, to eliminate an element from a list use <tt>pop</tt>. 
+Both functions are destructive, changing the contents of a list:</p>
+
+<pre>
+	(set 'L '(b c d e f))
+
+	(push 'a L)
+	(push 'g L -1) ;; push at the end with negative index
+	(pop L) ; pop first
+	(pop L -1) ; pop last
+	(pop L -2) ; pop second to last
+	(pop L 1)  ; pop second
+	; multidimensional push / pop
+	(set 'L '(a b (c d (e f) g) h i))
+	(push 'x L 2 1)
+	L &rarr; (a b (c x d (e f) g) h i)
+	(pop L 2 1) &rarr; x 
+</pre>
+
+<p>Pushing to the end of a list repeatedly is optimized in newLISP and as fast as pushing in front of a list.</p>
+
+<p>When pushing an element with index vector V it can be popped with the same index vector V:</p>
+
+<pre>
+	(set 'L '(a b (c d (e f) g) h i))
+	(set 'V '(2 1))
+	(push 'x L V)
+	L &rarr; (a b (c x d (e f) g) h i))
+	(ref 'x L) &rarr; (2 1) ; search for a nested member
+	(pop L V) &rarr; 'v
+</pre>
+
+<h3>Accessing lists</h3>
+
+<p>Multiple indexes can be specified to access elements in a nested list structure:</p>
+
+<pre>
+	(set 'L '(a b (c d (e f) g) h i))
+
+	; old syntax only for one index
+	(nth 2 L) &rarr; (c d (e f) g)
+
+	; use new syntax for multiple indices
+	(nth (L 2 2 1)) &rarr; f
+	(nth (L 2 2)) &rarr; (e f)
+
+	; implicit indexing
+	(L 2 2 1) &rarr; f
+	(L 2 2)   &rarr; (e f)
+
+	; implicit indexing with vector
+	(set 'vec '(2 2 1))
+	(L vec)   &rarr; f
+</pre>
+
+<p>When using the <tt>(nth (L idx))</tt> syntax, <tt>L</tt> may be a context representing a 
+default functor for passing a list by reference.</p>
+
+<p>Implicit indexing shown in the last example makes code more readable. Implicit indexing also allows an unlimited number of indices, while nth is limited to 16. Indices after a list select list elements. Indices before a list select subsections of a list, which in turn are always lists.</p>
+
+<p>Implicit indexing is also available for rest and slice </p>
+
+<pre>
+	(rest '(a b c d e))      &rarr; (b c d e)
+	(rest (rest '(a b c d e) &rarr; (c d e)
+	; same as
+	(1 '(a b c d e)) &rarr; (b c d e)
+	(2 '(a b c d e)) &rarr; (c d e)
+	; negative indices
+	(-2 '(a b c d e)) &rarr; (d e)
+	; slicing
+	(2 2 '(a b c d e f g))   &rarr; (c d)
+	(-5 3 '(a b c d e f g)) &rarr; (c d e)
+</pre>
+
+<h3>Selecting more than one element</h3>
+<p>Sometimes more than one element must be selected from a list.
+This is done using select:</p>
+
+<pre>
+	;; pick several elements from a list
+	(set 'L '(a b c d e f g))
+	(select L 1 2 4 -1) &rarr; (b c e g)
+
+	;; The indices can be delivered in an index vector:
+	(set 'vec '(1 2 4 -1))
+	(select L vec) &rarr; (b c e g)
+</pre>
+
+<p>The selecting process can re-arrange or double elements at the same time:</p>
+
+<pre>
+	(select L 2 2 1 1) &rarr; (c c b b)
+</pre>
+
+<h3>Filtering and differencing lists</h3>
+
+<p>Sometimes lists need to be filterer for a specific conditions applied to its elements:</p>
+
+<pre>
+	(filter (fn(x) (&lt; 5 x)) '(1 6 3 7 8))    &rarr; (6 7 8)
+	(filter symbol? '(a b 3 c 4 "hello" g)) &rarr; (a b c g)
+	(difference '(1 3 2 5 5 7) '(3 7)) &rarr; (1 2 5)
+</pre>
+
+<p>The first example could be rewritten shorter as follows:</p>
+
+<pre>
+	(filter (curry &lt; 5) '(1 6 3 7 8))
+</pre>
+
+<p>The <tt>curry</tt> function makes a one-argument function out of a two argument
+function:</p>
+
+<pre>
+	(curry &lt; 5) &rarr; (lambda (_x) (&lt; 5 _x))
+</pre>
+
+<p>Using <tt>curry</tt> a function taking two arguments quickly is converted into
+a predicate taking one argument.</p> 
+
+<h3>Changing list elements</h3>
+
+<p>set-nth and nth-set have the same effect on the list they are working on but the first returns the whole list while nth-set returns the changed old element:</p>
+
+<pre>
+	(set 'L '(a b (c d (e f) g) h i))
+	; return the changed list (old deprecated syntax)
+	(set-nth (L 2 2 1) 'x) &rarr; (a b (c d (e x) g) h i)
+
+	; return the old replaced element
+	(nth-set (L 2 2 1) 'z) &rarr; z
+</pre>
+
+<h3>The new element as a function of the replaced</h3>
+
+<p>An internal system variable $0 in newLISP holds the old list element. This can be used to configure the new one:</p>
+
+<pre>
+	(set 'L '(0 0 0))
+	(nth-set (L 1) (+ $0 1)) &rarr; 0 ; the old value
+	(nth-set (L 1) (+ $0 1)) &rarr; 1
+	(nth-set (L 1) (+ $0 1)) &rarr; 2
+	L &rarr; '(0 3 0)
+	</pre>
+
+<h3>Search and replace in simple lists</h3>
+
+<p>Replace, which can also be used on strings, can search for and replace
+multiple elements in a list at once. Together with <tt>match</tt> and <tt>unify</tt>
+complex search pattersn can be specified. Like with <tt>set-nth</tt> and <tt>nth-set</tt>,
+the replacement expression can use the old elelement contents to form the replacement.</p>
+
+<pre>
+	(set 'aList '(a b c d e a b c d))
+
+	(replace 'b aList 'B) &rarr; (a B c d e a B c d)
+</pre>
+
+<p>The function <tt>replace</tt> can take a comparison function for picking
+list elements:</p>
+ 
+<pre>
+	; replace all numbers where 10 &lt; number
+	(set 'L '(1 4 22 5 6 89 2 3 24))
+
+	(replace 10 L 10 &lt;) &rarr; (1 4 10 5 6 10 2 3 10)
+</pre>
+
+<p>Using the built-in functions <tt>match</tt> and <tt>unify</tt> more complex selection
+criteria can be defined:</p>
+
+<pre>
+	; replace only sublists starting with 'mary'
+
+	(replace '(mary *)  AL (list 'mary (apply + (rest $0))) match)
+	&rarr; ((john 5 6 4) (mary 14) (bob 4 2 7 9) (jane 3))
+
+	; make sum in all expressions
+
+	(set 'AL '((john 5 6 4) (mary 3 4 7) (bob 4 2 7 9) (jane 3)))
+
+	(replace '(*) AL (list ($0 0) (apply + (rest $0))) match)
+	&rarr; ((john 15) (mary 14) (bob 22) (jane 3))
+
+	$0 &rarr; 4  ; replacements made
+
+	; change only sublists where both elements are the same
+
+	(replace '(X X) '((3 10) (2 5) (4 4) (6 7) (8 8)) (list ($0 0) 'double ($0 1)) unify)
+	&rarr; ((3 10) (2 5) (4 double 4) (6 7) (8 double 8))
+
+	$0 &rarr; 2  ; replacements made
+</pre>
+
+<p>After a replacement statement is executed the newLISP system variable <tt>$0</tt>
+contains the number of replacements made.</p>
+
+<h3>Search and replace in nested lists</h3>
+
+<p>Sometimes lists are nested, e.g. the SXML results fropm parsing XML. The functions
+<tt>ref-set</tt>, <tt>set-ref</tt> and <tt>set-ref-all</tt> can be used to find and
+replace a single or all elelent in a nested list and replace it or all.</p>
+
+<pre>
+	(set 'data '((monday (apples 20 30) (oranges 2 4 9)) (tuesday (apples 5) (oranges 32 1))))
+
+	(set-ref (data 'monday) tuesday) 
+	&rarr; ((tuesday (apples 20 30) (oranges 2 4 9)) (tuesday (apples 5) (oranges 32 1)))
+</pre>
+
+<p>The function <tt>ref-set</tt> works just like <tt>set-ref</tt> but instead of the 
+whole changed version of the list, only the old element is returned</p>
+
+<pre>
+	(set 'data '((monday (apples 20 30) (oranges 2 4 9)) (tuesday (apples 5) (oranges 32 1))))
+
+	(ref-set  (data 'monday) 'tuesday) &rarr; monday
+</pre>
+
+<p>The function <tt>set-ref-all</tt> does a <tt>set-ref</tt> multiple times, replacing all
+found occurrences of and element.</p>
+
+<pre>
+	(set 'data '((monday (apples 20 30) (oranges 2 4 9)) (tuesday (apples 5) (oranges 32 1))))
+
+	(set-ref-all (data 'apples) "Apples") 
+	&rarr; ((monday ("Apples" 20 30) (oranges 2 4 9)) (tuesday ("Apples" 5) (oranges 32 1)))
+</pre>
+
+<p>Like <tt>find</tt>, <tt>replace</tt>, <tt>ref</tt> and <tt>ref-all</tt>, more
+complex searches can be expressed using <tt>match</tt> or <tt>unify</tt>:</p>
+
+<pre>
+	(set 'data '((monday (apples 20 30) (oranges 2 4 9)) (tuesday (apples 5) (oranges 32 1))))
+
+	(set-ref-all (data '(oranges *)) (list (first $0) (apply + (rest $0))) match)
+	&rarr; ((monday (apples 20 30) (oranges 15)) (tuesday (apples 5) (oranges 33)))
+</pre>
+
+<p>The last exampls shows how <tt>$0</tt> can be used to access the old list element
+in the updating expression. In this case the numbers for <tt>oranges</tt> records
+have been summed up.</p>
+
+<h3>Passing lists by reference using the default functor</h3>
+
+<p>Sometimes a larger list (more than a few hundred elements) must passed to a function 
+for changing elemements in it. Normally newLISP passes all parameters to user-defined
+functions by value. The following snipped shows a technique that can be used to pass a 
+bigger list or string object by reference:</p>
+
+<pre>
+	(set 'data:data '(a b c d e f g h))
+
+	(define (change db i value)
+	    (nth-set (db i) value))
+
+	(change data 3 999) &rarr; d
+	data:data &rarr; '(a b c 999 d e f g h)
+</pre>
+
+<p>In this example the list is encapsulated in a context named <tt>data</tt> holding a variable <tt>data</tt> with the same name.</p>
+
+<p>Wheneve the syntactic form <tt>(<em>func</em> (L x) ...)</tt> is encounterd in newLISP as in the
+functions: <tt>nth</tt>, <tt>nth-set</tt>, <tt>set-nth</tt>, <tt>set-ref</tt>, <tt>set-ref-all</tt>, 
+<tt>ref-set</tt>,<tt>-set-assoc</tt> and <tt>assoc-set</tt> the same techinique of reference passing 
+can be employed.</p>
+
+<center>&sect;</center>
+<br>
+<a name="flow"></a>
+<h2>7. Program flow</h2>
+
+<p>Program flow in newLISP is mostly functional but it also has looping and branching constructs and a catch and throw to break out of normal flow.</p>
+
+<p>Looping expressions as a whole behave like a function or block returning the last expression evaluated inside. </p>
+
+<h3>Loops</h3>
+<p>Most of the traditional looping patterns are supported. Whenever there is a looping variable, it is local in scope to the loop, behaving according the rules of dynamic scoping inside the current name-space or context:</p>
+
+
+<pre>
+	; loop a number of times
+	; i goes from 0 to N - 1
+	(dotimes (i N)
+	   ....
+	)
+	
+	; demonstrate locality of i
+	(dotimes (i 3) 
+	    (print i ":") 
+	    (dotimes (i 3) (print i))
+	    (println))
+	
+	&rarr; ; will output
+	0:012
+	1:012
+	2:012
+	
+	; loop through a list
+	; takes the value of each top level element in aList
+	(dolist (e aList)
+	   ...
+	)
+
+	; loop through a sring
+	; takes the ASCII or UTF-8 value of each character in aString
+	(dostring (e aString)
+	   ...
+	)
+	
+	; loop through the symbols of a context in
+	; alphabetical order of the symbol name
+	(dotree (s CTX)
+	   ...
+	)
+	
+	; loop from to with optional step size
+	; i goes from init to <= N inclusive with step size step
+	; Note that the sign in step is irrelevant, N can be greater
+	; or less then init.
+	(for i init N step)
+	   ...
+	)
+	
+	; loop while a condition is true
+	; first test condition then perform body
+	(while condition
+	   ...
+	)
+	
+	; loop while a condition is false
+	; first test condition then perform body
+	(until condition
+	   ....
+	)
+	
+	; loop while a condition is true
+	; first perform body then test
+	; body is performed at least once
+	(do-while condition
+	  ...
+	)
+	
+	; loop while a condition is false
+	; first perform body then test
+	; body is performed at least once
+	(do-until condition
+	  ...
+	)
+</pre>
+
+<p>Note that the looping functions <tt>dolist</tt>, <tt>dotimes</tt> and <tt>for</tt> can also
+take a break condition as an additional argument. When the break condition evaluates to true
+the loop finishes:</p>
+
+<pre>
+	(dolist (x '(a b c d e f g) (= x 'e)) 
+    	(print x))
+	&rarr; ; will output
+	abcd
+</pre>
+
+<h3>Blocks</H3>
+<p>Blocks are collections of s-expressions evaluated sequentially. All looping constructs may have expression blocks after the condition expression as a body.</p>
+
+<p>Blocks can also be constructed by enclosing them in a begin expression:</p>
+
+ <pre>
+	(begin
+	    s-exp1
+	    s-exp2
+	    .....
+	    s-expN)
+</pre>
+
+<p>Looping constructs do not need to use an explicit begin after the looping conditions. <tt>begin</tt>
+is mostly used to block expressions in <tt>if</tt> and <tt>cond</tt> statements.</p>
+
+<p>The functions <tt>and</tt>, <tt>or</tt>, <tt>let</tt>, <tt>letn</tt> and <tt>local</tt> 
+can also be used to form blocks and do not require <tt>begin</tt> for blocking statements.</p>
+
+<H3>Branching</H3>
+
+<pre>
+	(if condition true-expr false-expr)
+	 
+	;or
+	(if condition true-expr)
+	
+	;or unary if for (filter if '(...))
+	(if condition)  
+	
+	;; more then one statement in the true or false
+	;; part must be blocked with (begin ...)
+	(if (= x Y)
+	   (begin
+	      (some-func x)
+	      (some-func y)
+	   (begin
+	      (do-this x y)
+	      (do-that x y)))
+</pre>
+
+<p>Depending on condition the true-expr or false-expr part is evaluated and returned.</p>
+
+<p>More then one condition true-expr pair can occur in an if expression, making it look like a cond:</p>
+
+<pre>
+	(if condition-1 true-expr-1 
+	    condition-2 true-expr-2 
+	          .....
+	    condition-n true-expr-n
+	    false-expr)
+</pre>
+
+<p>The first true-expr-i of which the condition-i is not nil is evaluated and returned or the false-expr if none of the condition-i is true.</p>
+
+<p>cond works like the multiple condition form of if but each part of condition-i true-expr-i must be braced in parenthesis:</p>
+
+ <pre>
+	(cond 
+	     (condition-1 true-expr-1 )
+	     (condition-2 true-expr-2 )
+	           .....
+	     (condition-n true-expr-n )
+	     (true true-expr))
+</pre>
+
+<H3>Fuzzy flow</H3>
+
+<p>Using amb the program flow can be regulated in a probabilistic fashion:</p>
+
+<pre>
+	(amb
+	    expr-1
+	    expr-2
+	    .....
+	    expr-n)
+</pre>
+<p>One of the alternative expressions expr-1 to expr-n is evaluated with a probability of 1 / n and the result is returned from the amb expression.</p>
+
+<h3>Change flow with <tt>catch</tt> and <tt>throw</tt></h3>
+
+<p>Any loop or other expression block can be enclosed in a catch expression. The moment a throw expression is evaluated, the whole catch expression returns the value of the throw expression.</p>
+<pre>
+	(catch 
+	   (dotimes (i 10)
+	       (if (= i 5) (throw "The End"))
+	        (print i " ")))
+	; will output
+	 
+	0 1 2 3 4
+	; and the return value will be
+	&rarr; "The End"
+</pre>
+<p>Several catch may be nested.</p>
+
+<h3>Leave loops with a break condition</h3>
+
+<p>Loops built using <tt>dotimes</tt>, <tt>dolist</tt> of <tt>for</tt> can specify a break condition 
+under which the loop is left early:</p>
+
+<pre>
+	(dotimes (x 10 (&gt; (* x x) 9)) 
+	    (println x))
+	&rarr;
+	0
+	1
+	2
+	3
+	
+	(dolist (i '(a b c nil d e) (not i))
+	    (println i))
+	&rarr;
+	a
+	b
+	c
+</pre>
+<h3>Change flow with <tt>and</tt> or <tt>or</tt></h3>
+
+<p>Similar to programming in Prolog the logical and and or can be used to control program flow depending on the outcome of expressions logically connected:</p>
+
+<pre>
+	(and
+	   expr-1
+	   expr-2
+	    ...
+	   expr-n)
+</pre>
+<p>Expressions are evaluated sequentially until one expr-i evaluates to nil or the empty list'() or until all expr-i are exhausted. The last expression evaluated is the return value of the whole and expression.</p>
+
+<pre>
+	(or
+	   expr-1
+	   expr-2
+	    ...
+	   expr-n)
+</pre>
+
+<p>Expressions are evaluated sequentially until one expr-i evaluates to not nil and not '() or until all expr-i are exhausted. The last expression evaluated is the return value of the whole or expression.</p>
+<center>&sect;</center>
+<br>
+
+<a name="error"></a>
+<h2>8. Error handling</h2>
+
+<p>Several conditions during evaluation of a newLISP expression can cause error exceptions. For a complete list of errors see the newLISP Reference Manual Appendix.</p>
+
+<h3>System errors</h3>
+
+<p>System errors are caused by wrong syntax, of function invocation, not supplying the right amount of parameters, or supplying parameters with the wrong data type. Other system errors are caused by trying to evaluate non existing functions.</p>
+
+<pre>
+	 ; examples of system errors
+	 ;
+	 (foo foo)   &rarr; invalid function : (foo foo)
+	 (+ "hello") &rarr; value expected in function + : "hello"
+</pre>
+
+<h3>User defined errors</h3>
+
+<p>User errors are error exceptions thrown using the function throw-error:</p>
+
+<pre>
+	; user defined error
+	;
+	(define (double x)
+	    (if (= x 99) (throw-error "illegal number"))
+	    (+ x x))
+
+	(double 8)   &rarr; 16
+	(double 10)  &rarr; 20
+	(double 99) 
+	&rarr;
+	user error : illegal number
+	called from user defined function double
+</pre>
+
+<h3>Error event handlers</h3>
+<p>System and user defined errors can be caught using the function error-event to define an event handler.</p>
+
+<pre>
+	; define an error event handler
+	;
+	(define (MyHandler)
+	   (println "An error #" (error-number) " has occurred"))
+
+	(error-event 'MyHandler)
+
+	(foo) &rarr; An error #23 has occurred
+</pre>
+
+<h3>Catching errors</h3>
+<p>A fine grainier, more specific error exception handling can be achieved using a special syntax of the function catch.</p>
+
+<pre>
+	(define (double x)
+	    (if (= x 99) (throw-error "illegal number"))
+	    (+ x x))
+</pre>
+
+<p>catch with a second parameter can be used to catch both, system and user defined errors:</p>
+
+<pre>
+	(catch (double 8) 'result) &rarr; true
+	result &rarr; 16
+	(catch (double 99) 'result) &rarr; nil
+	(print result) 
+	&rarr; 
+	user error : illegal number
+	called from user defined function double
+
+	(catch (double "hi") 'result) &rarr; nil
+	(print result)  
+	&rarr; 
+	value expected in function + : x
+	called from user defined function double
+</pre>
+
+<p>The catch expression returns true when no error exception occurred and the result of the expression is found in the symbol result specified as a second parameter.</p>
+
+<p>If an error exception occurs, it is caught and the catch clause returns nil. In this case the symbol result contains the error message.</p>
+<center>&sect;</center>
+<br>
+
+<a name="functions"></a>
+<h2>9. Functions as data</h2>
+<h3>Manipulate functions after definition</h3>
+
+<pre>
+	(define (double x) (+ x x)) 
+	&rarr; (lambda (x) (+ x x))
+	
+	(first double) &rarr; (x)
+	(last double) &rarr; (+ x x)
+	
+	;; make a ''fuzzy'' double
+	(nth-set (double 1) '(mul (normal x (div x 10)) 2))
+	
+	(double 10) &rarr; 20.31445313
+	(double 10) &rarr; 19.60351563
+</pre>
+
+<p>lambda in newLISP is not an operator or symbol, but rather a special s-expression or list attribute:</p>
+
+<pre>
+	(first double) &rarr; (x)   ; not lambda
+</pre>
+
+<p>The lambda attribute of an s-expression is right-associative in append:</p>
+
+<pre>
+	(append (lambda) '((x) (+ x x))) &rarr; (lambda (x) (+ x x))
+	(set 'double (append (lambda) '((x) (+ x x)))
+	
+	(double 10) &rarr; 20
+</pre>
+
+<p>and left-associative when using cons:</p>
+
+<pre>
+	(cons '(x) (lambda) &rarr; (lambda (x))
+</pre>
+
+<p>Lambda expressions in newLISP never loose their first class object property.</p>
+
+<h3>Mapping and applying functions</h3>
+
+<p>Functions or operators can be applied to a list of data at once and all results are returned in a list</p>
+
+<pre>
+	(define (double (x) (+ x x))
+	  (map double '(1 2 3 4 5)) &rarr; (2 4 6 8 10)
+</pre>
+  
+  
+<p>Functions can be applied to parameters occurring in a list:</p>
+
+<pre>
+	(apply + (sequence 1 10)) &rarr; 55
+</pre>
+
+<a name="functions"></a>
+  
+<h3>Function currying: functions making functions</h3>
+
+<p>Here and expression is passed as a parameter:</p>
+
+<pre>
+	(define (raise-to power)
+	   (expand (fn (base) (pow base power)) 'power))
+
+	(define square (raise-to 2))
+
+	(define cube (raise-to 3))
+
+	(square 5) &rarr; 25
+	(cube 5)   &rarr; 125
+</pre>
+
+<p>The built-in function <tt>curry</tt> can be used to make a function taking
+one argument from a function taking two arguments.</p>
+
+<pre>
+	(define add-one (curry add 1))  &rarr; (lambda (_x) (add 1 _x))
+
+	(define by-ten (curry mul 10))  &rarr; (lambda (_x) (mul 10 _x))
+
+	(add-one 5)  &rarr; 6
+
+	(by-ten 1.23)  &rarr; 12.3
+</pre>
+
+<p>Note that the <em>curried</em> parameter is always the first (left) one.</p>
+
+<center>&sect;</center>
+<br>
+
+<a name="text"></a>
+<h2>10. Text processing</h2>
+<h3>Regular expressions</h3>
+
+<p>Regular expression in newLISP can be used together with a variety of functions:</p>
+
+<center>
+<table border="0" width="90%" cellpadding="5">
+
+<tr><td><tt>directory</tt></td><td>Returns a list of files, can use a regex patterns for filtering</td></tr>
+
+<tr><td><tt>find</tt></td><td>is used to find the position / offset of a pattern.</td></tr>
+
+<tr><td><tt>find-all</tt></td><td>Assemble a list of all patterns found.</td></tr>
+
+<tr><td><tt>parse</tt></td><td>breaks a string into token at patterns found between tokens.</td></tr>
+
+<tr><td><tt>regex</tt></td><td>finds patterns and lists all sub patterns with offset and length found</td></tr>.
+
+<tr><td><tt>replace</tt></td><td>replaces found patterns with a user defined function, which can take the as input the patterns itself.</td></tr>
+
+<tr><td><tt>search</tt></td><td>searches for a pattern in a file.</td></tr>
+</table>
+</center>
+
+<p>The functions find, regex, replace and search store pattern matching results in the system variable $0 to $15. See the newLISP Users Manual for details.</p>
+
+<p>The following paragraphs show frequently used algorithms for scanning and tokenizing text.</p>
+
+<h3>Scanning text</h3>
+
+<p>replace together with a regular expression pattern can be used to scan text. The pattern in this case describes the tokens scanned for. As each token is found it is pushed on a list. The work is done in the replacement expression part of replace. This example saves all files linked on a web page:</p>
+
+<pre>
+	; tokenize using replace with regular expressions
+	
+	(set 'page (get-url "http://www.nodep.nl/newlisp/index.html"))
+	
+	(replace {href="(http://.*lsp)"} page (push $1 links) 0)
+	
+	(dolist (link links)
+	   (set 'file (last (parse link "/")))
+	   (write-file file (get-url link))
+	   (println "-&gt;" file))
+</pre>
+
+<p>Curly braces <tt>{</tt>,<tt>}</tt> are used in the regular expression pattern to avoid escaping the quotes <tt>"</tt>.</p>
+
+<p>The following technique is better but could not be used before version 8.9.0 of newLISP. The new
+<tt>find-all</tt> function puts all pattern matching strings into a list:</p>
+
+<pre>
+	(set 'links (find-all {href="(http://.*lsp)"} page))
+
+	(dolist (link links)
+	   (set 'file (last (parse link "/")))
+	   (write-file file (get-url link))
+	   (println "-&gt;" file))
+</pre>
+
+<p><tt>find-all</tt> works in this example similar to <tt>replace</tt> with the <tt>push</tt> expression,
+but the <tt>find-all</tt> approach is more readable.</p>
+	
+
+<p>In an additional expressions <tt>find-all</tt> can be directed to do additional
+work with subexpressions found:</p>
+
+<pre>
+	(find-all {(new)(lisp)} "newLISPisNEWLISP" (append $2 $1) 1)
+	
+	&rarr; ("LISPnew" "LISPNEW")
+</pre>
+
+<p>In the last example <tt>find-all</tt> appends the sub expressions found in reverse
+order before returning them in the result list.</p>
+
+<p>Another technique for tokenizing text uses <tt>parse</tt>. While with <tt>replace</tt> 
+and <tt>find-all</tt> the regular expression defined the token, when using <tt>parse</tt>
+the regex pattern describes the space between the tokens:</p>
+
+<pre>
+	; tokenize using parse
+	(set 'str "1 2,3,4 5, 6 7  8"
+	(parse str {,\ *|\ +,*} 0) 
+	&rarr; ("1" "2" "3" "4" "5" "6" "7" "8")
+</pre>
+
+<p>Without the curly braces <tt>{</tt>,<tt>}</tt> in the parse pattern the backslashes would need to be doubled.</p>
+
+<h3>Appending strings</h3>
+
+<p>When appending strings append and join can be used to form a new string:</p>
+
+<pre>
+	(set 'lstr (map string (rand 1000 100))) 
+	&rarr; ("976" "329" ... "692" "425")
+
+	;; the wrong slowest way
+	(dolist (s lstr) 
+	    (set 'bigStr (append bigStr s)))
+
+	;; smarter way - 50 times faster
+	;;
+	(apply append lstr)
+</pre>
+
+<p>Sometimes strings are not readily available in a list like in the above examples. In this case push can be used to push strings on a list while they get produced. The list then can be used as an argument for join, making the fastest method for putting strings together from existing pieces:</p>
+
+<pre>
+	;; smartest way - 300 times faster
+	;; join an existing list of strings
+	;;
+	(join lstr) &rarr; "97632936869242555543 ...."
+
+	;; join can specify a string between the elements
+	;; to be joined	 
+	(join lstr "-") &rarr; "976-329-368-692-425-555-43 ...." 
+</pre>
+
+<h3>Growing strings in place</h3>
+
+<p>Very often the best method is to grow a string in place. The functions <tt>write-buffer</tt>,
+<tt>write-line</tt> and <tt>push</tt> can be used not only to write to file handles or push on
+lists but also to write/append to existing strings:</p>
+
+<pre>
+	;; smartest way - 150 times faster
+	;; grow a string in place
+	;;
+	;; using write-buffer
+	(set 'bigStr "")
+	(dolist (s lstr) (write-buffer bigStr s))
+	
+	;; using push
+	(set 'bigStr "")
+	(dolist (s lstr) (push s bigStr -1))
+</pre>
+
+<h3>Rearranging strings</h3>
+
+<p>The function select for selecting elements from lists can also be used to select and re-arrange characters from strings:</p>
+
+<pre>
+	(set 'str "eilnpsw")
+	(select str '(3 0 -1 2 1 -2 -3)) &rarr; "newlisp"
+	
+	; alternative syntax
+	(select str 3 0 -1 2 1 -2 -3) &rarr; "newlisp"
+</pre>
+
+<p>The second syntax is useful when ineces are specied not as constants but occur as variables.
+</p>
+
+<center>&sect;</center>
+<br>
+
+<a name="dicts"></a>
+<h2>11. Dictionaries</h2>
+
+<h3>Creating and modifying symbols</h3>
+
+<p>After scanning and tokenizing text frequently dictionaries are built to store tokens together with their frequencies or other statistics or attributes. </p>
+
+<pre>
+	; create a symbol from a string and set it to a value
+	;
+	(set 'token "hello")
+	(set (sym token 'Words) '(0 0 0 0))
+	
+	; a shorter method since 8.7.4
+	(context 'Words token '(0 0 0 0))
+	
+	; read contents of a word in dictionary
+	;
+	(eval (sym token 'Words)) &rarr; (0 0 0 0)
+	
+	; a shorter method since 8.7.4
+	(context 'Words token)    &rarr; (0 0 0 0)
+	
+	; update a word, using the old data
+	; incrementing a counter by one
+	;
+	(nth-set 0 (eval (sym token 'Words)) (+ $0 1)) &rarr; 0  ; the old value
+	(nth-set 0 (eval (sym token 'Words)) (+ $0 1)) &rarr; 1
+	(nth-set 0 (eval (sym token 'Words)) (+ $0 1)) &rarr; 2
+	; same as previous, but alternative shorter syntax
+	(nth-set ((context 'Word token) 0) (+ $0 1)) &rarr; 3
+	(nth-set ((context 'Word token) 0) (+ $0 1)) &rarr; 4
+	
+	(eval (sym token 'Words)) &rarr; (5 0 0 0)
+	; same in alternative shorter syntax
+	(context 'Words token) &rarr; (5 0 0 0)
+</pre>
+
+<p>The dictionary can be easily saved to a file by serializing the context Words:</p>
+
+<pre>
+	; save the dictionary to a file
+	;
+	(save "words.db" 'Words)
+	Just as easy you can reload the dictionary:
+	; load dictionary from a file
+	;
+	(load "words.db")
+</pre>
+
+<p>Test if a symbol exist in a namespace:</p>
+
+<pre>
+	(context 'foo "abc" 123)
+
+	(context? 'foo "abc") &rarr; true
+	(context? 'foo "def") &rarr; nil
+</pre>
+
+<h3>Iterating through dictionaries</h3>
+
+<p>Dictionaries are a collection of symbols in a namespace, constructed via a binary tree.
+Yhe functions <tt>symbols</tt> or <tt>dotree</tt> can be used to iterate through all
+symbols in a namespace in alphabbetical fashion:</p>
+
+<pre>
+	; make a dictionary 
+	(context 'foo "sdfg" 111) 
+	(context 'foo "yete" 222) 
+	(context 'foo "asdf" 333) 
+
+	; display all key value pairs in alphabetical order 
+
+	(dotree (s foo) 
+		(println s "-&gt;" (eval s))) 
+
+	; or an alternative method 
+
+	(dolist (s (symbols foo)) 
+		(println s "-&gt;" (eval s))) 
+
+	; generates the output 
+
+	foo:asdf-&gt;333 
+	foo:sdfg-&gt;111 
+	foo:yete-&gt;222 
+</pre>
+
+<p>The first method using <tt>dotree</tt> is really only a faster shortcut
+od the second method using symbols.</p>
+
+
+<h3>Object oriented implementation of a dictionary</h3>
+
+<p>The quickest shortest way to define and handle dictionaries is the folllowing function definition
+using a default functor for the dictionary:</p>
+
+<pre>
+	(define (myhash:myhash key value) 
+		(if value 
+			(context 'myhash key value) 
+		(context 'myhash key)))
+       
+	(myhash "hello" 123)
+
+	(myhash "hello")     &rarr; 123
+</pre>
+
+<p>The default functor is the getter/setter function and namespace identifier for the
+dictionary at the same time.</p>
+
+<center>&sect;</center>
+<br>
+
+<a name="tcpip"></a>
+<h2>12. TCP/IP client server communications</h2>
+
+<h3>Client - server TCP/IP - open connection</h3>
+
+<p>In this pattern the server keeps the connection open until the client closes the connection, then the server loops into a new listen:</p>
+
+<pre>
+	;;;;;;;;;;;;;;;;;;;;;; the server
+	; maximum bytes to receive
+	(constant 'max-bytes 1024)
+	(if (not (set 'listen (net-listen 123)))
+	    (print (net-error)))
+	(while (not (net-error))
+	    (set 'connection (net-accept listen)) ;; blocking here
+	    (while (not (net-error))
+	         (net-receive connection 'message-from-client max-bytes)
+	         .... process message from client ...
+	         .... configure message to client ...
+	         (net-send connection message-to-client)) )
+	         
+	;;;;;;;;;;;;;;;;;;;;; the client
+	; client connect
+	(if (not (set 'connection (net-connect "host.com" 123)))
+	    (println (net-error)))
+	; maximum bytes to receive
+	(constant 'max-bytes 1024)
+	; message send-receive loop
+	(while (not (net-error))
+	  .... configure message to server ...
+	  (net-send connection message-to-server)
+	  (net-receive connection 'message-from-server max-bytes)
+	  .... process message-from-server ...
+	  )
+</pre>
+
+<h3>Client - server TCP/IP - closed transaction</h3>
+
+<p>In this pattern the server closes the connection after each transaction exchange of messages.</p>
+
+<pre>
+	;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; server
+	(while (not (net-error))
+	    (set 'connection (net-accept listen)) ;; blocking here
+	    (net-receive connection 'message-from-client max-bytes)
+	         .... process message from client ...
+	         .... configure message to client ...
+	    (net-send connection message-to-client)
+	    (close connection))
+	    
+	;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; client 
+	(if (not (set 'connection (net-connect "host.com" 123)))
+	    (println (net-error)))
+	; maximum bytes to receive
+	(constant 'max-bytes 1024)
+	  .... configure message to server ...
+	(net-send connection message-to-server)
+	(net-receive connection 'message-from-server max-bytes)
+	  .... process message-from-server ...
+</pre>
+
+<p>There are many different ways to set up a client/server connection, see also the examples in the newLISP manual.</p>
+
+<center>&sect;</center>
+<br>
+<a name="udp"></a>
+
+<h2>13. UDP communications</h2>
+
+<p>They are fast and need less setup than TCP/IP and offer ''multi casting''. UDP is also less reliable because the protocol does less checking, i.e. of correct packet sequence or if all packets are received. This is normally no problem when not working on the Internet but in a well controlled local network or when doing machine control. A simple more specific protocol could be made part of the message.</p>
+
+<h3>Open communications with UDP</h3>
+
+<p>In this example the server keeps the connection open. UDP communications with net-listen, net-receive-from and net-send-to can block on receiving.</p>
+
+<pre>
+	;;;;;;;;;;;;;;;;;; server
+	(set 'socket (net-listen 10001 "" "udp"))
+	(if socket (println "server listening on port " 10001)
+	   (println (net-error)))
+	(while (not (net-error))
+	   (set 'msg (net-receive-from socket 255))
+	   (println "->" msg)
+	   (net-send-to (nth 1 msg) (nth 2 msg) 
+	   (upper-case (first msg)) socket))
+
+	;;;;;;;;;;;;;;;;;; client
+	(set 'socket (net-listen 10002 "" "udp"))
+	(if (not socket) (println (net-error)))
+	(while (not (net-error))
+	   (print "->")
+	   (net-send-to "127.0.0.1" 10001 (read-line) socket)
+	   (net-receive socket 'buff 255)
+	   (println "&rarr;" buff))
+	closed transaction oriented UDP
+</pre>
+
+<h3>Closed transaction oriented UDP</h3>
+
+<p>This form is some times used for controlling hardware or equipment. No setup is required, just one function for sending, another one for receiving:</p>
+
+<pre>
+	;;;;;;;;;;;;;;;;;; server
+	;; wait for data gram with maximum 20 bytes 
+	(net-receive-udp 1001 20) 
+	;; or
+	(net-receive-udp 1001 20 5000000)  ;; wait for max 5 seconds
+
+	;;;;;;;;;;;;;;;;;; client
+	(net-send-udp "host.com" 1001 "Hello")
+</pre>
+
+<p>Win32 and Linux show different behavior when sending less or more bytes then specified on the receiving end.</p>
+
+<h3>UDP multi-cast communications</h3>
+
+<p>In this scheme the server subscribes to one of a range of multi cast addresses using the net-listen function.</p>
+
+<pre>
+	;; example server
+	(net-listen 4096 "226.0.0.1" "multi") &rarr; 5
+	(net-receive-from 5 20)             
+	;; example client
+	(net-connect "226.0.0.1" 4096 "multi") &rarr; 3
+	(net-send-to "226.0.0.1" 4096 "hello" 3)
+</pre>
+
+<p>The connection in the example is blocking on <tt>net-receive</tt> but could be de-blocked using <tt>net-select</tt> or <tt>net-peek</tt></p>
+
+<center>&sect;</center>
+<br>
+
+<a name="nonblock"></a>
+<h2>14. Non-blocking communications</h2>
+
+<h3>Using net-select</h3>
+
+<p>In all previous patterns the client blocks when in receive. The net-select call can be used to unblock communications:</p>
+
+<pre>
+	;; optionally poll for arriving data with 100ms timeout
+	(while (not (net-select connection "r" 100000)) 
+	    (do-something-while-waiting ...))
+	
+	(net-receive...)
+</pre>
+
+<p><tt>connection</tt> can be a single number for a connection socket or a list of numbers to wait on various sockets.</p>
+
+
+<h3>Using net-peek</h3>
+
+
+<pre>
+	(while ( = (net-peek aSock) 0) 
+	   (do-something-while-waiting ...))
+	(net-receive...)
+</pre>
+
+<center>&sect;</center>
+<br>
+
+<a name="controlling"></a>
+<h2>15. Controlling other apps.</h2>
+
+<p>In this chapter all external applications are launched using process. This function returns immediately after launching the other application and does not block.</p>
+
+<p>In all of the following patterns the server is not independent but controlled by the client, which launches the server and then communicated via a line oriented protocol:</p>
+
+<pre>
+	-&gt; launch server
+	-&gt; talk to server
+	&lt;- wait for response from server
+	-&gt; talk to server
+	&lt;- wait for response from server
+	    .....
+</pre>
+
+<p>Often a sleep time is necessary on the client side to wait for the server to be ready loading. Most of these examples are condensed snippets from GTK-Server from www.gtk-server.org.</p>
+
+<h3>Communications via STD I/O </h3>
+
+<p>process allows specifying 2 pipes for communications with the launched application.</p>
+
+<pre>
+	# Define communication function
+	(define (gtk str)
+	   (write-line str myout)
+	   (if (!= str "gtk_exit 0") 
+	       (read-line myin)))
+	       
+	# Launch gtk-server
+	(map set '(myin gtkout) (pipe))
+	(map set '(gtkin myout) (pipe))
+	(process "gtk-server stdin" gtkin gtkout)
+	(gtk "gtk_init NULL NULL")
+	(gtk "gtk_window_new 0")
+	          .....
+</pre>
+
+<h3>communications via TCP/IP</h3>
+
+<pre>
+	; Define communication function
+	(define (gtk str , tmp)
+	    (net-send connection str)
+	    (net-receive connection 'tmp 64)
+	    tmp)
+	
+	; Start the gtk-server
+	(process "gtk-server tcp localhost:50000")
+	(sleep 1000)
+
+	; Connect to the GTK-server
+	(set 'connection (net-connect "localhost" 50000))
+	(set 'result (gtk "gtk_init NULL NULL"))
+	(set 'result (gtk "gtk_window_new 0"))
+	          .....
+</pre>
+
+
+<h3>Communicate via named FIFO</h3>
+
+<p>Make a FIFO first (looks like a special file node):</p>
+
+<pre>
+	 (exec "mkfifo myfifo")
+
+	;; or alternatively
+	
+	(import "/lib/libc.so.6" "mkfifo")
+	(mkfifo "/tmp/myfifo" 0777)
+	
+	; Define communication function
+	(define (gtk str)
+	    (set 'handle (open "myfifo" "write"))
+	    (write-buffer handle str)
+	    (close handle)
+	    (set 'handle (open "myfifo" "read"))
+	    (read-buffer handle 'tmp 20)
+	    (close handle)
+	    tmp)
+</pre>
+
+<h3>Communicate via UDP</h3>
+
+<p>Note that the listen function with "udp" option just binds the sockets to a address/hardware but not actually listens as in TCP/IP.</p>
+
+<pre>
+	; Define communication function
+	(define (gtk str , tmp)
+	   (net-send-to "localhost" 50000 str socket)
+	   (net-receive socket 'tmp net-buffer)
+	   tmp)
+	   
+	; Start the gtk-server
+	(define (start)
+	   (process "gtk-server udp localhost:50000")
+	   (sleep 500)
+	   (set 'socket (net-listen 50001 "localhost" "udp")) )
+	
+	(set 'result (gtk "gtk_init NULL NULL"))
+	
+	(set 'result (gtk "gtk_window_new 0"))
+	         .....
+</pre>
+
+<center>&sect;</center>
+<br>
+
+<a name="launching"></a>
+<h2>16. Launching applications blocking</h2>
+
+<h3>Shell execution</h3>
+
+<p>This is frequently used from newLISP's interactive command line to execute processes in a blocking fashion, which need a shell to run:</p>
+
+<pre>
+	(! "ls -ltr")
+</pre>
+
+<p>There is an interesting variant of this form working not inside a newLISP expression, but only on the command line:</p>
+
+<pre>
+	!ls -ltr
+</pre>
+
+<p>The <tt>!</tt> should be the first character on the command line. This form works like as shell escape like in the VI editor. It is useful for invoking an editor or doing quick shell work without completely leaving the newLISP console.</p>
+
+<h3>Execution capturing std-out in a list</h3>
+
+<pre>
+	(exec "ls /") &rarr; ("bin" "etc" "home" "lib")
+</pre>
+
+
+<h3>Execution feeding std-in</h3>
+
+<pre>
+	(exec "script.cgi" cgi-input)
+</pre>
+
+<p>In this example cgi-input contains a string feeding. i.e.: a query input, normally coming from a web server. Note that output in this case is written directly to the screen, and cannot be returned to newLISP. Use process and pipe for two way std i/o communications with other applications.</p>
+
+<center>&sect;</center>
+<br>
+
+<a name="threads"></a>
+
+<h2>17. Threads, semaphores and shared memory</h2>
+
+<p>Shared memory, semaphores and threads work frequently together. Semaphores can synchronize tasks in different threads and shared memory can be used to communicate between threads.</p>
+
+<p>The following is a more complex example showing the working of all three mechanisms at the same time.</p>
+
+<p>The producer loops through all n values from i = 0 to n - 1 and puts each value into shared memory where it is picked up by the consumer thread. Semaphores are used to signal that a data value is ready for reading.</p>
+
+<pre>
+	#!/usr/bin/newlisp
+	# prodcons.lsp -  Producer/consumer
+	#
+	# usage of 'fork', 'wait-pid', 'semaphore' and 'share'
+	
+	(if (> (& (last (sys-info)) 0xF) 4) 
+	   (begin
+	       (println "this will not run on Win32")
+	       (exit)))
+	       
+	(constant 'wait -1 'signal 1 'release 0)
+	
+	(define (consumer n)
+	    (set 'i 0)
+	    (while (< i n)
+	       (semaphore cons-sem wait)
+	       (println (set 'i (share data)) " <-")
+	       (semaphore prod-sem signal))  
+	       (exit))
+	                
+	(define (producer n)
+	    (for (i 1 n)
+	       (semaphore prod-sem wait)
+	       (println "-> " (share data i))
+	       (semaphore cons-sem signal))   
+	       (exit))
+	       
+	(define (run n)
+	    (set 'data (share)) 
+	    (share data 0)
+	    (set 'prod-sem (semaphore)) ; get semaphores
+	    (set 'cons-sem (semaphore))
+	    (set 'prod-pid (fork (producer n))) ; start threads
+	    (set 'cons-pid (fork (consumer n)))
+	    (semaphore prod-sem signal) ; get producer started
+	    (wait-pid prod-pid) ; wait for threads to finish
+	    (wait-pid cons-pid) ; 
+	    (semaphore cons-sem release) ; release semaphores
+	    (semaphore prod-sem release))
+	    
+	(run 10)
+	
+	(exit)
+</pre>
+
+<center>&sect;</center>
+<br>
+
+<a name="databases"></a>
+<h2>18. Databases and lookup tables</h2>
+
+<p>While association lists are the traditional means for associative data access in LISP and newLISP, other modern scripting languages use hashing to build memory based associative data tables. A hash is a table position calculated from a association key.</p>
+
+<p>newLISP uses symbols instead of hashes. Symbols in name spaces can also be serialized to a file, as will be shown in the chapter about symbol creation and lookup.</p>
+
+<h3>Association lists</h3>
+
+<p>The association list is a classic LISP data structure for storing information for associative retrieval:</p>
+
+<pre>
+	;; creating association lists
+	;; pushing at the end with -1 is optimized and 
+	;; as fast as pushing in front
+	
+	(push '("John Doe" "123-5555" 1200.00) Persons -1)
+	(push '("Jane Doe" "456-7777" 2000.00) Persons -1)
+	    .....
+	
+	Persons &rarr;  (
+	    ("John Doe" "123-5555" 1200.00) 
+	    ("Jane Doe" "456-7777" 2000.00) ...)
+	    
+	;; access/lookup data records
+	(assoc "John Doe" Persons) 
+	
+	&rarr; ("John Doe" "123-5555" 1200.00 male)
+	
+	(assoc "Jane Doe" Persons) 
+	 
+	&rarr; ("Jane Doe" "456-7777" 2000.00 female)
+</pre>
+
+<p>newLISP has a lookup function similar to what is used in spreadsheet software. This function which works like a combination of assoc and nth can find the association and pick a specific member of the data record at the same time:</p>
+
+<pre>
+	(lookup "John Doe" Persons 0)   &rarr; "123-555"
+	(lookup "John Doe" Persons -1)  &rarr; make
+	(lookup "Jane Doe" Persons 1)   &rarr; 2000.00
+	(lookup "Jane Doe" Persons -2)  &rarr; 2000.00
+	
+	;; update data records
+	(replace-assoc "John Doe" Persons 
+	               '("John Doe" "123-5555" 900.00 male))
+	
+	;; replace as a function of existing/replaced data
+	(replace-assoc "John Doe" Persons (update-person $0))
+	
+	;; delete data records
+	(replace (assoc "John Doe" Persons) Persons)
+</pre>
+
+<h3>Nested associations</h3>
+
+<p>If the data part of an association is itself an association llist, we have a nested association:</p>
+
+<pre>
+	(set 'persons '(
+		("Anne" (address (country "USA") (city "New York")))
+		("Jean" (address (country "France") (city "Paris")))
+	))
+</pre>
+
+<p>A different syntax of the <tt>assoc</tt> function can be used to specify multiple ketys:</p>
+
+<pre>
+	; one key
+	(assoc (persons "Anne")) &rarr; ("Anne" (address (country "USA") (city "New York")))
+
+	; two keys
+	(assoc (persons "Anne" 'address)) &rarr; (address (country "USA") (city "New York"))
+
+	; three keys
+	(assoc (persons "Anne" 'address 'city)) &rarr; (city "New York")
+</pre>
+
+<p>When all keys are symbols, as is in <tt>address</tt>, <tt>country</tt>
+and <tt>city</tt>, simple and nested associations in newLISP have the same format as newLISP
+<tt>FOOP</tt> (Functional Object Oriented Programming) objects. See the users manual chapter
+"17. Object Oriented Programming in newLISP" for details.</p>
+
+<h3>Updating nested associations</h3>
+
+<p>The functions <tt>set-assoc</tt> and <tt>assoc-set</tt> can be used to update simple
+or nested associations:</p>
+
+<pre>
+	(assoc-set (persons "Anne" 'address 'city) '(city "Boston")) &rarr; (city "New York")
+</pre>
+
+<p>The function <tt>assoc-set</tt> returns the old association element. When usinf <tt>set-assoc</tt>, the while <tt>persons</tt> list would be returned.</p>
+
+<h3>Symbol creation and lookup</h3>
+
+<p><tt>lookup</tt> and <tt>assoc</tt> are fine for small tables and databases with only a few hundred data records, but are too slow for look-ups in thousands or millions of records.</p>
+
+<p>newLISP has a fast and highly scalable symbol implementation. Together with name spaces and object serialization symbols can be used to maintain large data sets in memory and on disk with associative access.</p>
+
+<pre>
+	;; creating the database
+	(set (sym "John Doe" 'Persons) '("123-5555" 1200.00 male))
+	(set (sym "Jane Doe" 'Persons) '("456-7777" 2000.00 female))
+	;; alternative shorter syntax
+	
+	(context 'Persons "John Doe") '("123-5555" 1200.00 male))
+	(context 'Persons "Jane Doe") '("456-7777" 2000.00 female))
+	     .....
+	;; save the database to a file (serialization of context Persons)
+	(save "persons.db" 'Persons)
+	
+	;; load database from a file
+	(load "persons.db")
+	
+	;; access data records
+	(eval (sym "John Doe" 'Persons)) &rarr; '("123-5555" 1200.00 male)
+	
+	;; alternative shorter syntax to access data records
+	(context 'Persons "John Doe") &rarr; '("123-5555" 1200.00 male)
+	
+	;; update data records
+	(set (sym "John Doe" 'Persons) '("John Doe" "123-5555" 900.00 male))
+	
+	;; update using alternative syntax
+	(context 'Persons "John Doe") &rarr; '("John Doe" "123-5555" 900.00 male))
+	
+	;; delete data records
+	(delete (sym "John Doe" 'Persons))
+</pre>
+
+<center>&sect;</center>
+<br>
+
+<a name="distributed"></a>
+<h2>19. Distributed computing</h2>
+
+<p>Many of todays applications are distributed on to several computers on the 
+network or distibuted on to several processes on one CPU. Often both methods
+of distributing an application are used at the same time.</p>
+
+<p>newLISP has facilities to evaluate many expressions in parallel 
+on different network nodes or processes running newLISP. The <tt>net-eval</tt> function
+does all the work necessary to communicate to other nodes, distribute expressions
+for evaluation and collect results in either a blocking or event driven fashion.</p>
+
+<p>The functions <tt>read-file</tt>, <tt>write-file</tt>, <tt>append-file</tt>
+and <tt>delete-file</tt> can also be used to access with files on remote nodes when using
+URLs in file specifications. In a similar way the functions <tt>load</tt> and
+<tt>save</tt> can be used to load and save code from and to remote nodes.</p>
+
+<p>newLISP uses existing HTTP protocols and newLISP commandline behaviour to implement
+this functionality. This means that programs can be debugged and tested using standard
+UNIX applications like terminal, telnet or a web browser. This also enables 
+easy integration of other tools and programs into distributed applications built with newLISP. 
+For example the UNIX utility <i>netcat</i>, <tt>nc</tt> could be used to evaluate expressions
+remotely or a web browser could be used to retrieve webpages from nodes running a newLISP 
+server.</p>
+
+
+<h3>Setting up a newLISP server node</h3>
+
+<p>A newLISP server node is essentially a newLISP process listening to a network
+port and behaving like a newLISP commandline console and HTTP server for HTTP 
+<tt>GET</tt>, <tt>PUT</tt>, <tt>POST</tt> and <tt>DELETE</tt> requests. Since version 9.1 newLISP
+server mode also answers <tt>CGI</tt> queries received by either <tt>GET</tt>
+or <tt>POST</tt> request.</p>
+
+<p>Two methods are used to start a newLISP server node. One results in a stateful
+server, maintaining state in between communications with different clients, the other
+method a server with no state, reloading for every new client connection.</p>
+
+<b>Start a newLISP stateful server</b>
+
+<pre>
+	newlisp -c -d 4711 &amp;
+
+	newlisp myprog.lsp -c -d 4711 &amp;
+
+	newlisp myprog.lsp -c -w /home/node25 -d 4711 &amp;
+</pre>
+
+<p>newLISP is now listening on port 4711, the &amp; (ampersand) sign tells
+newLISP to run in the background (UNIX only). The <tt>-c</tt> switch suppresses command line
+prompts. newLISP now behaves like a newLISP console without prompts listening on port
+4711 for command line like input. Any other available port could have been chosen. Note that 
+on UNIX ports below 1024 need administrator access rights.</p>
+
+<p>The second example also preloads code. The third example also specifies a working
+directory using the <tt>-w</tt> option. If no working directory is specified using <tt>-w</tt>
+the startup directoruy is assumed to be the working directory.</p>
+
+<b>Start a newLISP <tt>inetd</tt> stateless server</b>
+
+<p>On UNIX the <i>inetd</i> or <i>xindetd</i> facility can be used to start a stateless
+server. In this case the TCP/IP net connections are managed by a special UNIX utility
+with the ability to handle multiple requests at the same time. For each connection
+made by a client the <i>inetd</i> or <i>xinetd</i> utility will start a fresh newLISP
+process. After the connection is closed the newLISP process will shut down.</p>
+
+<p>When nodes are not required to keep state, this is the preferred method for a 
+newLISP server node, for handeling multiple connections at the same time.</p>
+
+<p>The <i>inetd</i> or <i>xinetd</i> process needs to be configured using configuration
+files found in the <tt>/etc</tt> directory of most UNIX installations.</p>
+
+<p>For both the <i>inetd</i> and <i>xinetd</i> configurations add the following line
+to the <tt>/etc/services</tt> file:</p>
+
+<pre>
+	net-eval        4711/tcp     # newLISP net-eval requests
+</pre>
+
+<p>Note that any other port than <tt>4711</tt> could be supplied.</p>
+
+<p>When configuring <i>inetd</i> add also the following lines to the <tt>/etc/inetd.conf</tt>
+file:</p>
+
+<pre>
+	net-eval  stream  tcp  nowait  root  /usr/bin/newlisp -c
+											 
+	# as an alternative, a program can also be preloaded
+											 
+	net-eval  stream  tcp  nowait  root  /usr/bin/newlisp myprog.lsp -c
+
+	# a working directory can also be specified
+
+	net-eval  stream  tcp  nowait  newlisp  /usr/bin/newlisp -c -w /usr/home/newlisp
+</pre>
+
+<p>The last line also specified a working directory and a user <tt>newlisp</tt>
+instead of the <tt>root</tt> user. This is a more secure mode limiting newLISP
+server node access to a specific user account with restricted permissions.</p>
+
+<p>On Mac OS X and some other UNIX system a modern flavor of <i>inetd</i>: the 
+<i>xinetd</i> facility is used. Add the following configuration to a file 
+<tt>/etc/xinet.d/net-eval</tt>:</p>
+
+<pre>
+	service net-eval
+	{
+    	socket_type = stream
+    	wait = no
+    	user = root
+    	server = /usr/bin/newlisp
+    	port = 4711
+    	server_args = -c -w /home/node
+	}
+</pre>
+
+<p>Note that a variety of parameter combinations are possible to restrict access from
+different places or limit access to certain users. Consult the manpages for <i>inetd</i> 
+and <i>xinetd</i> for details.</p>
+
+<p>After condiguring <i>inetd</i> or <i>xinetd</i> either process must be restarted
+to re-read the configuration files. This can be accomplished by sending the 
+UNIX <tt>HUP</tt> signal to either the <i>inetd</i> or <i>xinetd</i> process using
+the UNIX <i>kill</i> or UNIX <i>nohup</i> utility.</p>
+
+
+<b>Testing the server using <i>telnet</i></b>
+
+<p>A newLISP server node can be tested using the UNIX <i>telnet</i> utility:</p>
+
+<pre>
+	telnet localhost 4711
+
+	; or when running on a different computer i.e. ip 192.168.1.100
+
+	telnet 192.168.1.100 4711
+</pre>
+
+<p>Multi-line expressions can be entered by enclosing them in <tt>[cmd]</tt>, <tt>[/cmd]</tt>
+tags, each tag on a separate line. Both, the openeing and closing tags should be on separate lines.</p>
+
+
+<b>Testing the server using <i>netcat</i> (named <tt>nc</tt> on most UNIX)</b>
+
+<pre>
+	echo '(symbols) (exit)' | nc localhost 4711
+</pre>
+
+<p>Or talking to a remote node:</p>
+
+<pre>
+	echo '(symbols) (exit)' | nc 192.168.1.100 4711
+</pre>
+
+<p>In both examples <i>netcat</i> will echo back the result of evaluating the
+<tt>(symbols)</tt> expression.</p>
+
+<p>Multi-line expressions can be entered by enclosing them in <tt>[cmd]</tt>, <tt>[/cmd]</tt>
+tags, each tag on a separate line.</p>
+
+<b>Testing the server from a newLISP commandline</b>
+
+<p>The <tt>net-eval</tt> function as a syntax form for connecting to only one remote
+server node. This mode is practical for quick testing from the newLISP command line:</p>
+
+<pre>
+	(net-eval "localhost" 4711 "(+ 3 4)" 1000) &rarr; 7
+
+	; to a remote node
+
+	(net-eval "192.168.1.100" 4711 {(upper-case "newlisp")} 1000) &rarr; "NEWLISP"
+</pre>
+
+<p>In the second example curly braces <tt>{,}</tt> are used to limit the program string
+for evaluation. This way quotes can be used to limit a string inside the expression.</p>
+
+<p>No <tt>[cmd]</tt>, <tt>[/cmd]</tt> tags are required when sending multi-line expressions.
+<tt>net-eval</tt> supplies these tags automatically.</p>
+
+<b>Testing the server HTTP mode using a web browser</b>
+
+<p>A newLISP server also understands simple HTTP <tt>GET</tt> and <tt>PUT</tt>
+requests (currently UNIX only). Enter the full path of a file 
+in the addressbar of the browser:</p>
+
+<pre>
+	http://localhost:4711//usr/share/newlisp/doc/newlisp_manual.html
+</pre>
+
+<p>The manual file is almost 800 Kbyte in size and will take a few seconds to load into
+the browser. Specify the portnumber with a colon separated from the hostname or host IP.
+Note the double slash <tt>//</tt> necessary to specify a file address relative to the root
+directory.</p>
+
+<h3>Evaluating multiple expressions remotely</h3>
+
+<p>When testing the correct installation of newLISP server nodes, we were already
+sending expressions to remote node for evaluation. Many times remote evlaluation is
+used to split up a lengthy task into shorter subtasks for remote evaluation on different
+nodes.</p>
+
+<p>The first example is trivial, because it only evaluates several very simple
+expressions remotely, but it shows the principles involved in a way easy to
+understand:</p>
+
+<pre>
+	#!/usr/bin/newlisp
+
+	(set 'result (net-eval '(	
+		("192.168.1.100" 4711 {(+ 3 4)})
+		("192.168.1.101" 4711 {(+ 5 6)})
+		("192.168.1.102" 4711 {(+ 7 8)})
+		("192.168.1.103" 4711 {(+ 9 10)})
+		("192.168.1.104" 4711 {(+ 11 12)})  
+	) 1000))
+
+
+	(println "result: " result)
+
+	(exit)
+</pre>
+
+<p>Running this program will produce the following output:</p>
+
+<pre>
+	result: (7 11 15 19 23)
+</pre>
+
+<p>When running UNIX and using an <i>inetd</i> or <i>xinetd</i> configured newLISP
+server, the servers and programs can be run on just one CPU replacing all IP numbers with 
+<tt>"localhost"</tt> or the same local IP number. The <i>indetd</i> or <i>xinetd</i>
+daemon will then start 5 independent newLISP processes. On Win32 5 statefull
+newLISP servers could be started on different port numbers to accomplish the same.</p>
+
+<p>Instead of collecting all results at one on the return of <tt>net-eval</tt>, a
+call back function can be used to receive and process results as they become available:</p>
+
+<pre>
+	#!/usr/bin/newlisp
+
+	(define (idle-loop p)
+		(if p (println p)))
+
+	(set 'result (net-eval '(	
+		("192.168.1.100" 4711 {(+ 3 4)})
+		("192.168.1.101" 4711 {(+ 5 6)})
+		("192.168.1.102" 4711 {(+ 7 8)})
+		("192.168.1.103" 4711 {(+ 9 10)})
+		("192.168.1.104" 4711 {(+ 11 12)})  
+	) 1000 idle-loop))
+
+	(exit)
+</pre>
+
+<p>While <tt>net-eval</tt> is waiting for results it calls the function <tt>idle-loop</tt>
+repeatedly with parameter <tt>p</tt>. The parameter <tt>p</tt> is <tt>nil</tt> when no result
+was received during the last 100 micro seconds or <tt>p</tt> contains a list sent back 
+from the remote node. The list contains the remote address and port and the evaluation result. 
+The example shown would generate the following output:</p>
+
+<pre>
+	("192.168.1.100" 4711 7)
+	("192.168.1.101" 4711 11)
+	("192.168.1.102" 4711 15)
+	("192.168.1.103" 4711 19)
+	("192.168.1.104" 4711 23)
+</pre>
+
+<p>For testing on just one CPU replace addresses with <tt>"localhost"</tt>
+the UNIX <i>inetd</i> or <i>xinetd</i> daemon will start a separate process
+for each connection made and all listening on port <tt>4711</tt>. When using
+a stateful server on the same Win32 CPU specify a different port number for 
+each server</p>
+
+<b>Setting up the <tt>net-eval</tt> parameter structure</b>
+
+<p>In a networked environment where an application gets moved around, or server
+nodes with changing IP nubers are used, it is necessary to set up the node
+parameters in the <tt>net-eval</tt> parameter list as variables. The following 
+more complex example shows how this can be done. The example also shows how
+a bigger piece of program text can be transferred to a remote node for evaluation
+and how this program piece can be customized for each node differently:</p>
+
+<pre>
+	#!/usr/bin/newlisp
+
+	; node parameters
+	(set 'nodes '(
+		("192.168.1.100" 4711)
+		("192.168.1.101" 4711)
+		("192.168.1.102" 4711)
+		("192.168.1.103" 4711)
+		("192.168.1.104" 4711)
+	))
+
+	; program template for nodes
+	(set 'program [text]
+	(begin
+		(map set '(from to node) '(%d %d %d))
+		(for (x from to)
+			(if (= 1 (length (factor x)))
+			(push x primes -1)))
+		primes)
+	[/text])
+
+	; call back routine for net-eval
+	(define (idle-loop p)
+		(if p
+			(begin
+				(println (p 0) ":" (p 1))
+				(push (p 2) primes))))
+
+	(println "Sending request to nodes, and waiting ...")
+
+	; machines could be on different IP addresses.
+	; For this test 5 nodes are started on localhost
+	(set 'result (net-eval '(
+		((nodes 0 0) (nodes 0 1) (format program 0 99999 1))
+		((nodes 1 0) (nodes 1 1) (format program 100000 199999 2))
+		((nodes 2 0) (nodes 2 1) (format program 200000 299999 3))
+		((nodes 3 0) (nodes 3 1) (format program 300000 399999 4))
+		((nodes 4 0) (nodes 4 1) (format program 400000 499999 5))
+	) 20000 idle-loop))
+
+	(set 'primes (sort (flat primes)))
+	(save "primes" 'primes)
+
+	(exit)
+</pre>
+
+<p>At the beginning of the program a <tt>nodes</tt> list structure
+contains all the relevant node information for hostname and port.</p>
+
+<p>The <tt>program</tt> calculates all prime numbers in a given
+range. The <tt>from</tt>, <tt>to</tt> and <tt>node</tt> variables
+are configured into the program text using <tt>format</tt>. All
+instructions are placed into a <tt>begin</tt> expression block, so
+only one expression result will be send back from the remote node.</p>
+
+<p>Many other schemes to configure a <tt>net-eval</tt> paramneter list 
+are possible. The example shows, that <tt>net-eval</tt> evaluates
+the node parameter specifications inside the quoted list. The following
+scheme would give the same resuls:</p> 
+
+<pre>
+	(set 'node-eval-list '(
+		((nodes 0 0) (nodes 0 1) (format program 0 99999 1))
+		((nodes 1 0) (nodes 1 1) (format program 100000 199999 2))
+		((nodes 2 0) (nodes 2 1) (format program 200000 299999 3))
+		((nodes 3 0) (nodes 3 1) (format program 300000 399999 4))
+		((nodes 4 0) (nodes 4 1) (format program 400000 499999 5))
+	))
+
+	(set 'result (net-eval node-eval-list  20000 idle-loop))
+</pre>
+
+<p>The function <tt>idle-loop</tt> aggregates all lists of primes
+received and generates the following output:</p>
+
+<pre>
+	192.168.1.100:4711
+	192.168.1.101:4711
+	192.168.1.102:4711
+	192.168.1.103:4711
+	192.168.1.104:4711
+</pre>
+
+<p>As with the previous examples all IP numbers could be replaced
+with <tt>"localhost"</tt> or any other hostname or IP number to test a distributed 
+application on a single host before deployment in a distributed environment 
+with many networked hosts.</p>
+
+<h3>Transferring files to and from remote nodes</h3>
+
+<p>Files can be read from or written to remote nodes with the same functions
+used to read and write files to a local file system. This functionality is
+currently only available on UNIX systems when talking to newLISP servers. As
+functions are based on standard <tt>GET</tt> and <tt>PUT</tt> HTTP protocols
+they can also be used communicating with web servers. Note that few Apache
+webserver installations have enabled the <tt>PUT</tt> protocol by default.</p>
+
+<p>The functions <tt>read-file</tt>, <tt>write-file</tt> and <tt>append-file</tt>
+can all take URLs in their filename specifications for reading from and
+writing to remote nodes running a newLISP server or a webserver:</p>
+
+<pre>
+	(write-file "http://127.0.0.1:4711//Users/newlisp/afile.txt" "The message - ")
+	&rarr; "14 bytes transferred for /Users/lutz/afile.txt\r\n"
+
+	(append-file "http://127.0.0.1:4711//Users/newlisp/afile.txt" "more text")
+	&rarr; "9 bytes transferred for /Users/lutz/afile.txt\r\n"
+
+	(read-file "http://127.0.0.1:4711//Users/newlisp/afile.txt")
+	&rarr; "The message - more text"
+</pre>
+
+<p>The first two function return a message starting with the numbers of bytes
+transferred and the name of the remote file affected. The <tt>-read-file</tt>
+function returns the contents received.</p>
+
+<p>Under all error conditions an error message startriong with the characters
+<tt>ERR:</tt> would be returned:</p>
+
+<pre>
+	(read-file "http://127.0.0.1:4711//Users/newlisp/somefile.txt")
+	&rarr; "ERR:404 File not found: /Users/newlisp/somefile.txt\r\n"
+</pre>
+
+<p>Note the double backslash necessary to reference files relative to root on the server
+node.</p>
+
+<p>All functions can be used to transfer binary non-ascii contents containing zero
+characters. Internally newLISP uses the functions <tt>get-url</tt> and <tt>put-url</tt>,
+which could be used instead of the functions <tt>read-file</tt>, <tt>write-file</tt> and
+<tt>append-file</tt>. Additional options like used with <tt>get-url</tt> and <tt>put-url</tt>
+could be used with the functions <tt>read-file</tt>, <tt>write-file</tt> and
+<tt>append-file</tt> as well. For more detail see the newLISP function reference for these
+functions.</p>
+
+
+<h3>Loading and saving data from and to remote nodes</h3>
+
+<p>The same <tt>load</tt> and <tt>save</tt> fuctions used to load program or LISP data
+from a local file system can be used to load or save programs and LISP data from or
+to remote nodes.</p>
+
+<p>By using URLs in the file specifications of <tt>load</tt> and <tt>save</tt> these
+functions can work over the network commuicating with a newLISP server node.:</p>
+
+<pre>
+	(load "http://192.168.1.2:4711//usr/share/newlisp/mysql5.lsp")
+
+	(save "http://192.168.1.2:4711//home/newlisp/data.lsp" 'db-data)
+</pre>
+
+<p>Although the <tt>load</tt> and <tt>save</tt> functions inernally use <tt>get-url</tt> and <tt>put-url</tt> to perform its works they behave  exactly as when used on a local filesystem, but instead of a 
+file path URLs are specified. Both function will timeout after 60 seconds if a connection could
+not be established. When finer control is necessary use the functions <tt>get-url</tt> and 
+<tt>put-url</tt> together with <tt>eval-string</tt> and <tt>source</tt> to realize a similar
+result as when using the <tt>load</tt> and <tt>save</tt> in HTTP mode.</p>
+
+<h3>HTTPD-only mode, newLISP as a webserver</h3>
+
+<p>In all previous chapters the <tt>-c</tt> server mode was used. This mode can act as
+a <tt>net-eval</tt> server and at the same time answer <tt>HTTP</tt> requests for serving
+web pages or transfer of files and programs. The <tt>-c</tt> mode is the preferred mode
+for secure operation behind a firewall. newLISP also has a <tt>-http</tt> mode which works
+like a resticted <tt>-c</tt> mode. In <tt>-http</tt> mode only <tt>HTTP</tt> requests are
+served and commandline like formatted requests and <tt>net-eval</tt> requests are not answered.
+In this mode newLISP can act like a web server answering HTTP <tt>GET</tt>, <tt>PUT</tt>, 
+<tt>POST</tt> and <tt>DELETE</tt> requests as well as <tt>CGI</tt> requests, but additional
+efforts should be made to restrict the access to aunauthorized files and directories to secure
+the server when exposed to the internet.</p>
+
+<p>When newLISP server answers any <tt>HTTP</tt> request, it first calls a function
+<tt>httpd-conf</tt>. This function can be supplied in a startup file:</p>
+
+<pre>
+    server_args = httpd-conf.lsp -http -w /home/node
+</pre>
+
+<p>The above snippet shows part of a <i>xinetd</i> configuration file. A startup
+program <tt>httpd-conf.lsp</tt> has been added which will be loaded upon invocation
+of newLISP. The <tt>-c</tt> options has been replaced with the <tt>-http</tt> option.
+Now neither <tt>net-eval</tt> nor commandline requests will be answered but only
+HTTP requests.</p> 
+
+<p>The file <tt>httpd-conf.lsp</tt> contains a user-defined function
+<tt>http-conf</tt> which takes as arguments the HTTP path-name string of the request and the
+query string part of the request string. If the <tt>http-conf</tt> function
+returns <tt>nil</tt> the request will be aborted, else whatever string is returned will
+be taken as the path-name for further processing. This can be used to transform or
+redirect requested file names. <tt>http-conf</tt> can also be used to analyze headers for
+redirection or to respond with customized error pages. The function does not need to
+process the query string but must either return a valid path-name
+for further processing or <tt>nil</tt> to abort request processing.</p>
+
+<p>The following small <tt>httpd-conf.lsp</tt> file will transform the path-name
+into a request for <tt>errorpage.html</tt> if the original path-name ends
+either with <tt>.exe</tt> or starts with <tt>/</tt> trying to access the root
+directory of the server, or tries the access any other directory outside
+the current directory:</p>
+
+<pre>
+	(define (httpd-conf path-name query)
+		(if (or
+				(ends-with path-name ".exe")
+				(starts-with path-name "/")
+				(find ".." path-name)
+			)
+		"errorpage.html"
+		; else
+		path-name
+))
+</pre>
+
+<p>The following requests would all be rejected:</p>
+
+<pre>
+	http://asite.com/cgi-bin/prog.exe   ; trying to access prog.exe
+	http://asite.com//usr/etc/passwd    ; trying to access path from / root
+	http://asite.com/../../var/log      ; trying to hop out of web directory
+</pre>
+
+<p>A more elaborate <tt>httpd-conf</tt> file can be found in the source
+distribution of newLISP in the example directory. On UNIX systems this
+file is also installed as <tt>/usr/share/newlisp/httpd-conf.lsp</tt>.
+This fille contains a <tt>httpd-conf</tt> function which also sends back a
+<tt>Location:</tt> response with appended forward slash (<tt>/</tt>) for directory
+requests without a trailing <tt>/</tt>. When a directory is requested,
+newLISP HTTP mode will try to access either <tt>index.html</tt> or 
+<tt>index.cgi</tt> in that directory.</p>
+    
+<h3>Media types in HTTP modes</h3>
+
+<p>In both the <tt>-c</tt> and <tt>-http</tt> HTTP modes the following file types are
+recognized and a correctly formatted <tt>Content-Type:</tt> header is sent back:</p>
+
+<center>
+<table border="1" cellpadding="3"  width="50%">
+<tr align="left"><th>file extension</th><th>media type</th></tr>
+<tr><td><tt>.jpg</tt></td><td><tt>image/jpg</tt></td></tr>
+<tr><td><tt>.pgn</tt></td><td><tt>image/png</tt></td></tr>
+<tr><td><tt>.gif</tt></td><td><tt>image/gif</tt></td></tr>
+<tr><td><tt>.pdf</tt></td><td><tt>application/pdf</tt></td></tr>
+<tr><td><tt>.mp3</tt></td><td><tt>image/mpeg</tt></td></tr>
+<tr><td><tt>.mov</tt></td><td><tt>image/quicktime</tt></td></tr>
+<tr><td><tt>.mpg</tt></td><td><tt>image/mpeg</tt></td></tr>
+<tr><td><em>any other</em></td><td><tt>text/html</tt></td></tr>
+</table>
+<p><font size="-1">media types in newLISP HTTP request handling</font></p>
+</center>
+
+<h3>Environment variables set</h3>
+
+<p>When receiving HTTP requests newLISP server mode will extract information from the HTTP request header and configure <tt>HTTP_HOST</tt>, <tt>HTTP_USER_AGENT</tt> and <tt>HTTP_COOKIE</tt> (v.9.1.4) in the environment of the host operating system. If a <tt>httpd-conf</tt> functions was loaded on newLISP server startup header processing will happen afer processing <tt>httpd-conf</tt>. The environment variables can be accessed by a CGI process.</p>
+
+<h3>Local domain UNIX sockets</h3>
+
+<p>newLISP supports named local domain sockets in newLISP server mode and using the built-in functions <tt>net-eval</tt>, <tt>net-listen</tt>, <tt>net-connect</tt> together with the functions <tt>net-accept</tt>, <tt>net-receive</tt>, <tt>net-select</tt> and <tt>net-send</tt>.</p>
+
+<p>Using local domain sockets fast communications between processes on the same file system and with newLISP servers is possible. See the Users Manual for more details.</p>
+
+<br /><br />
+
+<center>&sect;</center>
+
+<a name="extending"></a>
+<h2>20. Extending newLISP</h2>
+
+
+<p>newLISP has an import function, which allows importing function from DLLs (Dynamic Link Libraries) on Win32 or shared libraries on Linux/UNIX (ending in .so).</p>
+
+<p>This chapter shows how to compile and use libraries on both, Win32 and Linux/UNIX platforms. We will compile a DLL and a Linux/UNIX shared library from the following 'C' program:</p>
+
+<pre>
+	#include &lt;stdio.h&gt;
+	#include &lt;stdlib.h&gt;
+	#include &lt;ctype.h>&gt;
+	
+	int foo1(char * ptr, int number)
+	{
+	printf("the string: %s the number: %d\n", ptr, number);
+	return(10 * number);
+	}
+	
+	char * foo2(char * ptr, int number)
+	{
+	char * upper;
+	printf("the string: %s the number: %d\n", ptr, number);
+	upper = ptr;
+	while(*ptr) { *ptr = toupper(*ptr); ptr++; }
+	return(upper);
+	}
+	
+	/* eof */ 
+</pre>
+
+<p>Both functions foo1 and foo2 print their arguments, but while foo1 returns the number multiplied 10 times, foo2 returns the uppercase of a string to show how to return strings from 'C' functions.</p>
+
+<h3>Compile a shared library on Linux/UNIX/MacOSX</h3>
+
+<p>On Linux/UNIX we can compile and link testlib.so in one step:</p>
+
+<pre>
+	gcc testlib.c -shared -o testlib.so
+</pre>
+
+<p>Or On Mac OSX/darwin do:</p>
+
+<pre>
+	gcc -bundle -o testlib.so
+</pre>
+
+<p>The library testlib.so will be built with Linux/UNIX default cdecl conventions. Importing the library is very similar on both Linux and Win32 platforms, but on Win32 the library can be found in the current directory. You may have to specify the full path or put the library in the library path of the os:</p>
+
+<pre>
+	 newLISP v.8.4.3 on Linux, execute 'newlisp -h' for more info.
+	
+	&gt; (import "/home/newlisp/testlib.so" "foo1")
+	foo1 &lt;6710118F&gt;
+	
+	&gt; (import "/home/newlisp/testlib.so" "foo2")
+	foo2 &lt;671011B9&gt;
+	
+	&gt; (foo1 "hello" 123)
+	the string: hello the number: 123
+	1230
+	
+	&gt; (foo2 "hello" 123)
+	the string: hello the number: 123
+	4054088
+	
+	&gt; (get-string (foo2 "hello" 123))
+	the string: hello the number: 123
+	"HELLO"
+	&gt;	
+</pre>
+
+<p>Again, the number returned from foo2 is the string address pointer and get-string can be used to access the string. When using get-string only character up to a zero byte are returned. When returning the addresses to binary buffers different techniques using unpack are used to access the information.</p>
+
+<h3>Compile a DLL on Win32</h3>
+
+<p>DLLs on Win32 can be made using the MinGW, Borland or CYGWIN compilers. This example shows, how to do it using the MinGW compiler.</p>
+
+<p>Compile it:</p>
+
+<pre>
+	gcc -c testlib.c -o testlib.o
+</pre>
+
+<p>Before we can transform testlib.o into a DLL we need a testlib.def declaring the exported functions:</p>
+
+<pre>
+	LIBRARY    testlib.dll 
+	EXPORTS
+	    foo1 @1 foo1
+	    foo2 @2 foo2
+</pre>
+
+<p>Now wrap the DLL:</p>
+
+<pre>
+	dllwrap testlib.o --def testlib.def -o testlib.dll -lws2_32
+</pre>
+
+<p>The library testlib.dll will be built with default Win32 stdcall conventions. The following shows an interactive session, importing the library and using the functions:</p>
+
+<pre>
+	 newLISP v.8.4.3 on Win32 MinGW, execute 'newlisp -h' for more info.
+	&gt; (import "testlib.dll" "foo1")
+	foo1 &lt;6710118F&gt;
+
+	&gt; (import "testlib.dll" "foo2")
+	foo2 &lt;671011B9&gt;
+
+	&gt; (foo1 "hello" 123)
+	the string: hello the number: 123
+	1230
+
+	&gt; (foo2 "hello" 123)
+	the string: hello the number: 123
+	4054088
+
+	&gt; (get-string (foo2 "hello" 123))
+	the string: hello the number: 123
+	"HELLO"
+
+	&gt;
+	; import a library compiled for cdecl
+	; calling conventsions
+	&gt; (import "foo.dll" "func" "cdecl")
+</pre>
+
+<p>Note that the first time using foo2 the return value 4054088 is the memory address of the string returned. Using get-string the string belonging to it can be accessed. If the library is compiled using cdecl calling conventions, the cdecl keyword must be used in the import expression.</p>
+
+<h3>Using data structures in imported libraries</h3>
+
+<p>Just like 'C' strings are returned using string pointers, 'C' structures can be returned using structure pointers and functions like get-string, get-int or get-char can be used to access the members. The following example illustrates this:</p>
+
+<pre>
+	typedef struct mystruc 
+	   {
+	   int number;
+	   char * ptr;
+	   } MYSTRUC;
+	
+	MYSTRUC * foo3(char * ptr, int num )
+	   {
+	   MYSTRUC * astruc;
+	   astruc = malloc(sizeof(MYSTRUC));
+	   astruc-&gt;ptr = malloc(strlen(ptr) + 1);
+	   strcpy(astruc-&gt;ptr, ptr);
+	   astruc-&gt;number = num;
+	   return(astruc);
+	   }
+</pre>
+
+<p>The newLISP program would access the structure members as follows:</p>
+
+<pre>
+	&gt; (set 'astruc (foo3 "hello world" 123))
+	4054280
+
+	&gt; (get-string (get-integer (+ astruc 4)))
+	"hello world"
+
+	&gt; (get-integer astruc)
+	123
+	&gt;
+</pre>
+
+<p>The return value from foo is the address to the structure astruc. To access the string pointer, 4 must be added as the size of an integer type in the 'C' programming language. The string in the string pointer then gets accessed using get-string.</p>
+
+<h3>Unevenly aligned data structures</h3>
+
+<p>Sometimes data structures contain data types of different length than the normal CPU register word:</p>
+
+<pre>
+	sruct mystruct 
+	   {
+	   short int x;
+	   int z;
+	   short int y;
+	   } data;
+	
+	struct mystruct * foo(void)
+	   {
+	   data.x = 123;
+	   data.y = 456;
+	   data.z = sizeof(data);
+	   return(&amp;data);
+	   }
+</pre>
+
+<p>The x and y variables are 16 bit wide and only z takes 32 bit. When a compiler on a 32bit CPU packs this structure the variables x and y will each fill up 32 bits instead of the 16 bit each. This is necessary so the 32 bit variable z can be aligned properly. The following code would be necessary to access the structure members:</p>
+
+<pre>
+	&gt; (import "/usr/home/nuevatec/test.so" "foo")
+	   foo &lt;281A1588&gt;
+
+	&gt; (unpack "lu lu lu" (foo))
+	   (123 12 456)
+</pre>
+<p>The whole structure consumes 3 by 4 = 12 bytes, because all members have to be aligned to 32 bit borders in memory.</p>
+<p>The following data structure packs the short 16 bit variables next to each other. This time only 8 bytes are required: 2 each for x and y and 4 bytes or z. Because x and y are together in one 32 bit word, none of the variables needs to cross a 32 bit boundary: </p>
+
+<pre>
+	struct mystruct 
+	    {
+	    short int x;
+	    short int y;
+	    int z;
+	    } data;
+	
+	struct mystruct * foo(void)
+	   {
+	   data.x = 123;
+	   data.y = 456;
+	   data.z = sizeof(data);
+	   return(&amp;data);
+	   }
+</pre>
+
+<p>This time the access code in newLISP reflects the size of the structure members:</p>
+
+<pre>
+	&gt; (import "/usr/home/nuevatec/test.so" "foo")
+	   foo &lt;281A1588&gt;
+
+	&gt; (unpack "u u lu" (foo))
+	   (123 456 8)
+</pre>
+
+<br>
+
+<h3>Passing parameters in library calls</h3>
+
+<center>
+<table border="1" cellpadding="3" width="95%">
+<tr><th>Data Type</th><th>newLISP call</th><th>C Function call</th></tr>
+<tr><td><em>integer</em></td><td><tt>(foo 123)</tt></td><td><tt>foo(int number)</tt></td></tr>
+<tr><td><em>double float</em></td><td><tt>(foo 1.234)</tt></td><td><tt>foo(double number)</tt></td></tr>
+<tr><td><em>float</em></td><td><tt>(foo (flt 1.234))</tt></td><td><tt>foo(float number)</tt></td></tr>
+<tr><td><em>string</em></td><td><tt>(foo "Hello World!")</tt></td><td><tt>foo(char * string)</tt></td></tr>
+<tr><td><em>integer array</em></td><td><tt>(foo (pack "d d d" 123 456 789))</tt></td><td><tt>foo(int numbers[])</tt></td></tr>
+<tr><td><em>float array</em></td><td><tt>(foo (pack "f f f" 1.23 4.56 7.89))</tt></td><td><tt>foo(float[])</tt></td></tr>
+<tr><td><em>double array</em></td><td><tt>(foo (pack "lf lf lf) 1.23 4.56 7.89)</tt></td><td><tt>foo(double[])</tt></td></tr>
+<tr><td><em>string array</em></td><td><tt>(foo (pack "lu lu lu" "one" "two" "three")))</tt></td><td><tt>foo(char * string[])</tt></td></tr>
+</table>
+</center>
+<br>
+
+<p>Note that <em>floats</em> and <em>double floats</em> are only passed correctly on x86 platforms 
+with <em>cdecl</em> calling conventions or when passed by pointer reference as in variable argument
+functions, i.e: <em>printf()</em>.</p>
+
+<br />
+
+<h3>Extracting return values from library calls</h3>
+<center>
+<table border="1" cellpadding="3" width="95%">
+<tr><th>Data Type</th><th>newLISP to extract return value</th><th>C return</th></tr>
+<tr><td><em>integer</em></td><td><tt>(set 'number (foo x y z))</tt></td><td><tt>return(int number)</tt></td></tr>
+<tr><td><em>double float</em></td><td>n/a - only 32bit returns, use double float pointer instead</td><td>not available</td></tr>
+<tr><td><em>double float ptr</em></td><td><tt>(set 'number (get-float (foo x y z)))</tt></td><td><tt>return(double * numPtr)</tt></td></tr>
+<tr><td><em>float</em></td><td>not available</td><td>not available</td></tr>
+<tr><td><em>string</em></td><td><tt>(set 'string (get-string (foo x y z)</tt></td><td><tt>return(char * string)</tt></td></tr>
+<tr><td><em>integer array</em></td><td><tt>(set 'numList (unpack "ld ld ld" (foo x y z)))</tt></td><td><tt>return(int numList[])</tt></td></tr>
+<tr><td><em>float array</em></td><td><tt>(set 'numList (unpack "f f f" (foo x y z)))</tt></td><td><tt>return(float numList[])</tt></td></tr>
+<tr><td><em>double array</em></td><td><tt>(set 'numList (unpack "lf lf lf") (foo x y z)))</tt></td><td><tt>return(double numList[])</tt></td></tr>
+<tr><td><em>string array</em></td><td><tt>(set 'stringList (map get-string (unpack "ld ld ld" (foo x y z))))</tt>
+</td><td><tt>return(char * string[])</tt></td></tr>
+</table>
+</center>
+
+<p><em>Floats</em> and <em>doubles</em> can only be returned via address pointer references.</p>
+
+<p>When returning array types the number of elements in the array must be known. The examples always assume 3 elements.</p>
+
+<p>All pack and unpack and formats can also be given without spaces, but are spaced in the examples for better readability.</p>
+
+<p>The formats "ld" and "lu" are interchangeable, but the 16 bit formats "u" and "d" may produce different results, because of sign expansion from 16 to 32 bits.</p>
+
+<p>Flags are available for changing endian byte order during <tt>pack</tt> and <tt>unpack</tt>.</p>
+
+<center>&part;</center>
+
+<br><br><br><br>
+
+<hr>
+
+<br><br>
+
+<a NAME="appendix"></a>
+<a NAME="GFDL"></a>
+<center>
+<h2><font color="#EE0000">GNU Free Documentation License</font></h2>
+<p>Version 1.2, November 2002</p>
+
+<p>
+Copyright (C) 2000,2001,2002  Free Software Foundation, Inc.
+59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+Everyone is permitted to copy and distribute verbatim copies
+of this license document, but changing it is not allowed.</p>
+</center>
+
+<br><br>
+
+<b>0. PREAMBLE</b>
+
+<p>The purpose of this License is to make a manual, textbook, or other
+functional and useful document "free" in the sense of freedom: to
+assure everyone the effective freedom to copy and redistribute it,
+with or without modifying it, either commercially or noncommercially.
+Secondarily, this License preserves for the author and publisher a way
+to get credit for their work, while not being considered responsible
+for modifications made by others.
+</p>
+<p>This License is a kind of "copyleft", which means that derivative
+works of the document must themselves be free in the same sense. It
+complements the GNU General Public License, which is a copyleft
+license designed for free software.
+</p>
+<p>We have designed this License in order to use it for manuals for
+free
+software, because free software needs free documentation: a free
+program should come with manuals providing the same freedoms that the
+software does. But this License is not limited to software manuals;
+it can be used for any textual work, regardless of subject matter or
+whether it is published as a printed book. We recommend this License
+principally for works whose purpose is instruction or reference.
+</p>
+<p><b>1. APPLICABILITY AND DEFINITIONS</b>
+</p>
+<p>This License applies to any manual or other work, in any medium,
+that
+contains a notice placed by the copyright holder saying it can be
+distributed under the terms of this License. Such a notice grants a
+world-wide, royalty-free license, unlimited in duration, to use that
+work under the conditions stated herein. The "Document", below,
+refers to any such manual or work. Any member of the public is a
+licensee, and is addressed as "you". You accept the license if you
+copy, modify or distribute the work in a way requiring permission
+under copyright law.
+</p>
+<p>A "Modified Version" of the Document means any work containing the
+Document or a portion of it, either copied verbatim, or with
+modifications and/or translated into another language.
+</p>
+<p>A "Secondary Section" is a named appendix or a front-matter section
+of
+the Document that deals exclusively with the relationship of the
+publishers or authors of the Document to the Document's overall subject
+(or to related matters) and contains nothing that could fall directly
+within that overall subject. (Thus, if the Document is in part a
+textbook of mathematics, a Secondary Section may not explain any
+mathematics.) The relationship could be a matter of historical
+connection with the subject or with related matters, or of legal,
+commercial, philosophical, ethical or political position regarding
+them.
+</p>
+<p>The "Invariant Sections" are certain Secondary Sections whose titles
+are designated, as being those of Invariant Sections, in the notice
+that says that the Document is released under this License. If a
+section does not fit the above definition of Secondary then it is not
+allowed to be designated as Invariant. The Document may contain zero
+Invariant Sections. If the Document does not identify any Invariant
+Sections then there are none.
+</p>
+<p>The "Cover Texts" are certain short passages of text that are
+listed,
+as Front-Cover Texts or Back-Cover Texts, in the notice that says that
+the Document is released under this License. A Front-Cover Text may
+be at most 5 words, and a Back-Cover Text may be at most 25 words.
+</p>
+<p>A "Transparent" copy of the Document means a machine-readable copy,
+represented in a format whose specification is available to the
+general public, that is suitable for revising the document
+straightforwardly with generic text editors or (for images composed of
+pixels) generic paint programs or (for drawings) some widely available
+drawing editor, and that is suitable for input to text formatters or
+for automatic translation to a variety of formats suitable for input
+to text formatters. A copy made in an otherwise Transparent file
+format whose markup, or absence of markup, has been arranged to thwart
+or discourage subsequent modification by readers is not Transparent.
+An image format is not Transparent if used for any substantial amount
+of text. A copy that is not "Transparent" is called "Opaque".
+</p>
+<p>Examples of suitable formats for Transparent copies include plain
+ASCII without markup, Texinfo input format, LaTeX input format, SGML
+or XML using a publicly available DTD, and standard-conforming simple
+HTML, PostScript or PDF designed for human modification. Examples of
+transparent image formats include PNG, XCF and JPG. Opaque formats
+include proprietary formats that can be read and edited only by
+proprietary word processors, SGML or XML for which the DTD and/or
+processing tools are not generally available, and the
+machine-generated HTML, PostScript or PDF produced by some word
+processors for output purposes only.
+</p>
+<p>The "Title Page" means, for a printed book, the title page itself,
+plus such following pages as are needed to hold, legibly, the material
+this License requires to appear in the title page. For works in
+formats which do not have any title page as such, "Title Page" means
+the text near the most prominent appearance of the work's title,
+preceding the beginning of the body of the text.
+</p>
+<p>A section "Entitled XYZ" means a named subunit of the Document whose
+title either is precisely XYZ or contains XYZ in parentheses following
+text that translates XYZ in another language. (Here XYZ stands for a
+specific section name mentioned below, such as "Acknowledgements",
+"Dedications", "Endorsements", or "History".) To "Preserve the Title"
+of such a section when you modify the Document means that it remains a
+section "Entitled XYZ" according to this definition.
+</p>
+<p>The Document may include Warranty Disclaimers next to the notice
+which
+states that this License applies to the Document. These Warranty
+Disclaimers are considered to be included by reference in this
+License, but only as regards disclaiming warranties: any other
+implication that these Warranty Disclaimers may have is void and has
+no effect on the meaning of this License.
+</p>
+<p><b>2. VERBATIM COPYING</b>
+</p>
+<p>You may copy and distribute the Document in any medium, either
+commercially or noncommercially, provided that this License, the
+copyright notices, and the license notice saying this License applies
+to the Document are reproduced in all copies, and that you add no other
+conditions whatsoever to those of this License. You may not use
+technical measures to obstruct or control the reading or further
+copying of the copies you make or distribute. However, you may accept
+compensation in exchange for copies. If you distribute a large enough
+number of copies you must also follow the conditions in section 3.
+</p>
+<p>You may also lend copies, under the same conditions stated above,
+and
+you may publicly display copies.
+</p>
+<p><b>3. COPYING IN QUANTITY</b>
+</p>
+<p>If you publish printed copies (or copies in media that commonly have
+printed covers) of the Document, numbering more than 100, and the
+Document's license notice requires Cover Texts, you must enclose the
+copies in covers that carry, clearly and legibly, all these Cover
+Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
+the back cover. Both covers must also clearly and legibly identify
+you as the publisher of these copies. The front cover must present
+the full title with all words of the title equally prominent and
+visible. You may add other material on the covers in addition.
+Copying with changes limited to the covers, as long as they preserve
+the title of the Document and satisfy these conditions, can be treated
+as verbatim copying in other respects.
+</p>
+<p>If the required texts for either cover are too voluminous to fit
+legibly, you should put the first ones listed (as many as fit
+reasonably) on the actual cover, and continue the rest onto adjacent
+pages.
+</p>
+<p>If you publish or distribute Opaque copies of the Document numbering
+more than 100, you must either include a machine-readable Transparent
+copy along with each Opaque copy, or state in or with each Opaque copy
+a computer-network location from which the general network-using
+public has access to download using public-standard network protocols
+a complete Transparent copy of the Document, free of added material.
+If you use the latter option, you must take reasonably prudent steps,
+when you begin distribution of Opaque copies in quantity, to ensure
+that this Transparent copy will remain thus accessible at the stated
+location until at least one year after the last time you distribute an
+Opaque copy (directly or through your agents or retailers) of that
+edition to the public.
+</p>
+<p>It is requested, but not required, that you contact the authors of
+the
+Document well before redistributing any large number of copies, to give
+them a chance to provide you with an updated version of the Document.
+</p>
+<p><b>4. MODIFICATIONS</b>
+</p>
+<p>You may copy and distribute a Modified Version of the Document under
+the conditions of sections 2 and 3 above, provided that you release
+the Modified Version under precisely this License, with the Modified
+Version filling the role of the Document, thus licensing distribution
+and modification of the Modified Version to whoever possesses a copy
+of it. In addition, you must do these things in the Modified Version:
+</p>
+<ul>
+  <li><b>A.</b> Use in the Title Page (and on the covers, if
+any) a title distinct from that of the Document, and from those of
+previous versions (which should, if there were any, be listed in the
+History section of the Document). You may use the same title as a
+previous version if the original publisher of that version gives
+permission.
+  </li>
+  <li><b>B.</b> List on the Title Page, as authors, one or
+more persons or entities responsible for authorship of the
+modifications in the Modified Version, together with at least five of
+the principal authors of the Document (all of its principal authors, if
+it has fewer than five), unless they release you from this requirement.
+  </li>
+  <li><b>C.</b> State on the Title page the name of the
+publisher of the Modified Version, as the publisher.
+  </li>
+  <li><b>D.</b> Preserve all the copyright notices of the
+Document.
+  </li>
+  <li><b>E.</b> Add an appropriate copyright notice for your
+modifications adjacent to the other copyright notices.
+  </li>
+  <li><b>F.</b> Include, immediately after the copyright
+notices, a license notice giving the public permission to use the
+Modified Version under the terms of this License, in the form shown in
+the Addendum below.
+  </li>
+  <li><b>G.</b> Preserve in that license notice the full
+lists of Invariant Sections and required Cover Texts given in the
+Document's license notice.
+  </li>
+  <li><b>H.</b> Include an unaltered copy of this License.
+  </li>
+  <li><b>I.</b> Preserve the section Entitled "History",
+Preserve its Title, and add to it an item stating at least the title,
+year, new authors, and publisher of the Modified Version as given on
+the Title Page. If there is no section Entitled "History" in the
+Document, create one stating the title, year, authors, and publisher of
+the Document as given on its Title Page, then add an item describing
+the Modified Version as stated in the previous sentence.
+  </li>
+  <li><b>J.</b> Preserve the network location, if any, given
+in the Document for public access to a Transparent copy of the
+Document, and likewise the network locations given in the Document for
+previous versions it was based on. These may be placed in the "History"
+section. You may omit a network location for a work that was published
+at least four years before the Document itself, or if the original
+publisher of the version it refers to gives permission.
+  </li>
+  <li><b>K.</b> For any section Entitled "Acknowledgements"
+or "Dedications", Preserve the Title of the section, and preserve in
+the section all the substance and tone of each of the contributor
+acknowledgements and/or dedications given therein.
+  </li>
+  <li><b>L.</b> Preserve all the Invariant Sections of the
+Document, unaltered in their text and in their titles. Section numbers
+or the equivalent are not considered part of the section titles.
+  </li>
+  <li><b>M.</b> Delete any section Entitled "Endorsements".
+Such a section may not be included in the Modified Version.
+  </li>
+  <li><b>N.</b> Do not retitle any existing section to be
+Entitled "Endorsements" or to conflict in title with any Invariant
+Section.
+  </li>
+  <li><b>O.</b> Preserve any Warranty Disclaimers.
+  </li>
+</ul>
+<p>
+If the Modified Version includes new front-matter sections or
+appendices that qualify as Secondary Sections and contain no material
+copied from the Document, you may at your option designate some or all
+of these sections as invariant. To do this, add their titles to the
+list of Invariant Sections in the Modified Version's license notice.
+These titles must be distinct from any other section titles.
+</p>
+<p>You may add a section Entitled "Endorsements", provided it contains
+nothing but endorsements of your Modified Version by various
+parties--for example, statements of peer review or that the text has
+been approved by an organization as the authoritative definition of a
+standard.
+</p>
+<p>You may add a passage of up to five words as a Front-Cover Text, and
+a
+passage of up to 25 words as a Back-Cover Text, to the end of the list
+of Cover Texts in the Modified Version. Only one passage of
+Front-Cover Text and one of Back-Cover Text may be added by (or
+through arrangements made by) any one entity. If the Document already
+includes a cover text for the same cover, previously added by you or
+by arrangement made by the same entity you are acting on behalf of,
+you may not add another; but you may replace the old one, on explicit
+permission from the previous publisher that added the old one.
+</p>
+<p>The author(s) and publisher(s) of the Document do not by this
+License
+give permission to use their names for publicity for or to assert or
+imply endorsement of any Modified Version.
+</p>
+<p><b>5. COMBINING DOCUMENTS</b>
+</p>
+<p>You may combine the Document with other documents released under
+this
+License, under the terms defined in section 4 above for modified
+versions, provided that you include in the combination all of the
+Invariant Sections of all of the original documents, unmodified, and
+list them all as Invariant Sections of your combined work in its
+license notice, and that you preserve all their Warranty Disclaimers.
+</p>
+<p>The combined work need only contain one copy of this License, and
+multiple identical Invariant Sections may be replaced with a single
+copy. If there are multiple Invariant Sections with the same name but
+different contents, make the title of each such section unique by
+adding at the end of it, in parentheses, the name of the original
+author or publisher of that section if known, or else a unique number.
+Make the same adjustment to the section titles in the list of
+Invariant Sections in the license notice of the combined work.
+</p>
+<p>In the combination, you must combine any sections Entitled "History"
+in the various original documents, forming one section Entitled
+"History"; likewise combine any sections Entitled "Acknowledgements",
+and any sections Entitled "Dedications". You must delete all sections
+Entitled "Endorsements."
+</p>
+<p><b>6. COLLECTIONS OF DOCUMENTS</b>
+</p>
+<p>You may make a collection consisting of the Document and other
+documents
+released under this License, and replace the individual copies of this
+License in the various documents with a single copy that is included in
+the collection, provided that you follow the rules of this License for
+verbatim copying of each of the documents in all other respects.
+</p>
+<p>You may extract a single document from such a collection, and
+distribute
+it individually under this License, provided you insert a copy of this
+License into the extracted document, and follow this License in all
+other respects regarding verbatim copying of that document.
+</p>
+<p><b>7. AGGREGATION WITH INDEPENDENT WORKS</b>
+</p>
+<p>A compilation of the Document or its derivatives with other separate
+and independent documents or works, in or on a volume of a storage or
+distribution medium, is called an "aggregate" if the copyright
+resulting from the compilation is not used to limit the legal rights
+of the compilation's users beyond what the individual works permit.
+When the Document is included in an aggregate, this License does not
+apply to the other works in the aggregate which are not themselves
+derivative works of the Document.
+</p>
+<p>If the Cover Text requirement of section 3 is applicable to these
+copies of the Document, then if the Document is less than one half of
+the entire aggregate, the Document's Cover Texts may be placed on
+covers that bracket the Document within the aggregate, or the
+electronic equivalent of covers if the Document is in electronic form.
+Otherwise they must appear on printed covers that bracket the whole
+aggregate.
+</p>
+<p><b>8. TRANSLATION</b>
+</p>
+<p>Translation is considered a kind of modification, so you may
+distribute translations of the Document under the terms of section 4.
+Replacing Invariant Sections with translations requires special
+permission from their copyright holders, but you may include
+translations of some or all Invariant Sections in addition to the
+original versions of these Invariant Sections. You may include a
+translation of this License, and all the license notices in the
+Document, and any Warranty Disclaimers, provided that you also include
+the original English version of this License and the original versions
+of those notices and disclaimers. In case of a disagreement between
+the translation and the original version of this License or a notice
+or disclaimer, the original version will prevail.
+</p>
+<p>If a section in the Document is Entitled "Acknowledgements",
+"Dedications", or "History", the requirement (section 4) to Preserve
+its Title (section 1) will typically require changing the actual
+title.
+</p>
+<p><b>9. TERMINATION</b>
+</p>
+<p>You may not copy, modify, sublicense, or distribute the Document
+except
+as expressly provided for under this License. Any other attempt to
+copy, modify, sublicense or distribute the Document is void, and will
+automatically terminate your rights under this License. However,
+parties who have received copies, or rights, from you under this
+License will not have their licenses terminated so long as such
+parties remain in full compliance.
+</p>
+<p><b>10. FUTURE REVISIONS OF THIS LICENSE</b>
+</p>
+<p>The Free Software Foundation may publish new, revised versions
+of the GNU Free Documentation License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns. See
+http://www.gnu.org/copyleft/.
+</p>
+<p>Each version of the License is given a distinguishing version
+number.
+If the Document specifies that a particular numbered version of this
+License "or any later version" applies to it, you have the option of
+following the terms and conditions either of that specified version or
+of any later version that has been published (not as a draft) by the
+Free Software Foundation. If the Document does not specify a version
+number of this License, you may choose any version ever published (not
+as a draft) by the Free Software Foundation.
+</p>
+<br><br>
+
+
+<center>&part;</center>
+
+
+
+
+</body>
+</html>
diff --git a/doc/ExpressionEvaluation.html b/doc/ExpressionEvaluation.html
new file mode 100644
index 0000000..bf80385
--- /dev/null
+++ b/doc/ExpressionEvaluation.html
@@ -0,0 +1,404 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+<style type="text/css" media="screen">
+<!--
+body, h1, h2, h3, h4, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+	line-height: 120%;
+ 	}
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+   	font-size: 100%;
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	font-size: 100%;
+	}
+-->
+</style>
+</head>
+
+<body text="#000000" bgcolor="#FFFFFF" link="#376590" vlink="#551A8B" alink="#ffAA28">
+
+<br />
+<blockquote>
+<center><h2>Expression evaluation, Implicit Indexing, Contexts and Default Functors in the newLISP Scripting Language</h2></center>
+<center><font size="-1">Lutz Mueller, November 8th 2007, rev 4<br>
+</font></center>
+
+<center><blockquote><blockquote><i>
+Implicit indexing and Default Functors in newLISP are an extension of normal LISP expression evaluation rules. Contexts provide lexically closed state-full namespaces in a dynamically scoped programming language.
+</i></blockquote></blockquote></center>
+<br />
+
+<h3>S-expression evaluation and implicit indexing</h3>
+
+<p>In an earlier paper it was explained how s-expression evaluation in newLISP relates to ORO (One Reference Only) automatic memory management [1]. The following pseudo code of the expression evaluation function in newLISP shows how implicit indexing is an extension of Lisp s-expression evaluation rules:
+
+<blockquote><pre>
+function evaluateExpression(expr)
+    {
+    if typeOf(expr) is constant (BOOLEAN, NUMBER, STRING, CONTEXT)
+        return(expr)
+
+    if typeOf(expr) is SYMBOL
+        return(symbolContents(expr))
+
+    if typeOf(expr) is QUOTED
+        return(unQuotedContents(expr))
+
+    if typeOf(expr) is LIST
+        {    
+        func = evaluateExpression(firstOf(expr))
+        args = rest(expr)
+        if typeOf(func) is BUILTIN_FUNCTION
+            result = evaluateFunc(func, args)
+        else if typeOf(func) = LAMBDA_FUNCTION
+            result = evaluateLambda(func, args)
+        /* extensions for implicit indexing */
+        else if typeOf(func) = LIST
+            result = implicitIndexList(func, args)
+        else if typeOf(func) = STRING
+            result = implicitIndexString(func, args)
+        else if typeOf(func) = ARRAY
+            result = implicitIndexArray(func, args)
+        else if typeOf(func) = NUMBER
+            result = implicitNrestSlice(func, args)
+        }
+    }
+
+    return(result)
+    }
+</pre></blockquote>
+
+<p>The general working of the function reflects the general structure of the <i>eval</i> function as described by <i>John McCarthy</i> in 1960, [2].</p> 
+
+<p>The function first processes atomic expression types. Constants evaluate to themselves and are returned. Symbols evaluate to their contents.</p> 
+
+<p>If the expression is a list the first element gets applied to the rest elements. As in Scheme, newLISP evaluates the first element before applying it the result to its arguments.</p>
+
+<p>Traditional Lisp or Scheme only permit a built-in function, operator or user defined lambda expression in the first, functor position of the s-expression list for evaluation. In newLISP the context symbol type, list, array and number type also act as functions when in the functor position.</p>
+
+<p>Built-in functions are evaluated calling <i>evaluateFunc(func, args)</i>, functors which are lambda expressions call the <i>evaluateLambda(func, args)</i> function. Both functions in turn will call <i>evaluateExpression(expr)</i> again for evaluation of function arguments.</p>
+
+<p>The working of a context symbol in the functor position of an s-expression will be explained further down in the chapter about <i>namespaces and default functors</i>.</p>
+
+<p>The list type causes newLISP to evaluate the whole s-expression to the element indexed by the number(s) following the list and interpreted as index or indices (in newLISP elements in nested lists can be addressed using multiple indices):</p>
+
+<blockquote><pre>
+(set 'lst '(a b (c d e) f g))
+(lst 2) => (c d e)
+(lst 2 1) => d
+
+(set 'str "abcdefg")
+(str 2) => "c"
+</pre></blockquote>
+
+<p>A number in the functor position will assume slicing functionality and slice the following list at the offset expressed by the number. When the number is followed by a second number, the second number specifies the size or length of the sliced part of the list:</p>
+
+<blockquote><pre>
+(1 lst) => (b (c d e) f g)
+(1 2 lst) => (b (c d e))
+
+(1 2 str) => "bc"
+</pre></blockquote>
+
+<p>On first sight it seems logical to extend the same principle to the boolean data type. A ternary conditional expressions could be constructed without the necessity of the <tt>if</tt> operator, but in practical programming this leads to difficulties when reading code and causes too much ambiguity in error messages. Most of the time implicit indexing leads to better readable code, because the data object is grouped together with it's indices. Implicit indexing performs faster, but is also optional. The keywords <tt>nth</tt>, <tt>set-nth</tt> and <tt>nth-set</tt> can be used in the few cases where readability is better when using the explicit form of indexing.</p>
+
+<h3>The environment stack and dynamic scoping</h3>
+
+<p>In the original Lisp <i>eval</i> function a <i>variable environment</i> is implemented as an association list of symbols and their values. In newLISP a symbol is implemented as a data structure with one value slot and the environment is not an association list but a binary tree structure of symbols and an <i>environment stack</i> storing previous values of symbols in higher evaluation levels.</p>
+
+<p>When entering a lambda function, the parameter symbols and their current values are pushed on to the environment stack. When leaving the function, the symbols are restored to their previous values when popping the environment stack. Any other function called will see symbol values as currently defined in the scope of the calling function. The variable environment changes dynamically while calling and returning from functions. The scope of a variable extends dynamically into lower call levels.<p>
+
+<p>The following example sets two variables and defines two lambda functions. After the function definitions the functions are used in a nested fashion. The changing parts of the variable environment are shown in bold type face:</p>
+
+<blockquote><pre>
+; x -> nil, y -> nil;
+; foo -> nil
+; double -> nil
+; environment stack: [ ]
+
+(define (foo x y)       
+	(+ (double (+ x 1)) y))
+
+; x -> nil, y -> nil, 
+<b>; foo -> (lambda (x y) (+ (double (+ x 1)) y))</b>
+; double -> nil
+; environment stack: [ ]
+
+(define (double x)
+	(* 2 x))
+
+; x -> nil, y -> nil
+; foo -> (lambda (x y) (+ (double (+ x 1)) y))
+<b>; double -> (lambda (x) (* 2 x)))</b>
+; environment stack: [ ]
+
+(set 'x 10) (set 'y 20)
+
+<b>; x -> 10, y -> 20</b>
+; foo -> (lambda (x y) (+ (double (+ x 1)) y))
+; double -> (lambda (x) (* 2 x)))
+; environment stack: [ ]
+</pre></blockquote>
+
+<p>Similar to Scheme newLISP uses the same namespace for variable symbols and symbols holding user-defined lambda functions. The <tt>define</tt> function is just a short-cut for writing:</p>
+
+<blockquote><pre>
+(set 'foo (lambda (x y) (+ (double (+ x 1)) y)))
+</pre></blockquote>
+
+<p>During all these operations the environment stack stays empty <tt>[ ]</tt>. Symbol variables holding lambda expressions are part of the same namespace and treated the same way as variables holding data. Now the the first function  <tt>foo</tt> gets called:</p>
+
+<blockquote><pre>
+(foo 2 4)
+
+; after entering the function foo
+<b>; x -> 2, y -> 4</b>
+; foo -> (lambda (x y) (+ (double (+ x 1)) y))
+; double -> (lambda (x) (* 2 x)))
+<b>; environment stack: [x -> 10, y -> 20]</b>
+</pre></blockquote>
+
+<p>After entering the functions, the old values of <tt>x</tt> and <tt>y</tt> are pushed on the environment stack. This push-operation is initiated by the function <i>evaluateLambda(func, args)</i>, discussed later in this paper. Inside <tt>foo</tt> the second function <tt>double</tt> is called:</p>
+
+<blockquote><pre>
+(double 3)
+; after entering the function double
+<b>; x -> 3, y -> 4</b>
+; foo -> (lambda (x y) (+ (double (+ x 1)) y))
+; double -> (lambda (x) (* 2 x)))
+<b>; environment stack: [x -> 10, y -> 20, x -> 2]</b>
+
+; after return from double
+<b>; x -> 2, y -> 4</b>
+; foo -> (lambda (x y) (+ (double (+ x 1)) y))
+; double -> (lambda (x) (* 2 x)))
+<b>; environment stack: [x -> 10, y -> 20]</b>
+
+; after return from foo
+<b>; x -> 10, y -> 20</b>
+; foo -> (lambda (x y) (+ (double (+ x 1)) y))
+; double -> (lambda (x) (* 2 x)))
+<b>; environment stack: [ ]</b>
+</pre></blockquote>
+
+<p>Note that in newLISP dynamic scoping of parameter symbols in lambda expressions does not create lexical state-full closures around those symbols as in the Scheme dialect of Lisp. On return from the lambda function the symbol contents gets destroyed and memory is reclaimed. The parameter symbols regain their old values on exit from the lambda function by popping them from the environment stack. <p>
+
+<p>In newLISP lexical state-full closures are not realized using lambda closures but using lexical namespaces. Lambda functions in newLISP do not create closures but can create a new scope and new temporary content for existing symbols during lambda function execution.</p>
+
+<h3>Lambda function evaluation</h3>
+
+<p>All of the processing just described happens in <tt>evaluateLambda(func, args)</tt>. The following pseudo code shows more detail:</p>
+
+<blockquote><pre>
+function evaluateLambda(lambda-func, args)
+    {
+    for each parameter symbol in lambda-func
+        pushEnvironmentStack(symbol, value)
+
+    for each arg in args and the symbol belonging to arg
+        ; evaluation of arg happens in old symbol environment
+        assignSymbolValue(symbol, evaluateExpression(arg))
+
+    for each body expression expr in lambda-func
+        result = evaluateExpression(expr)
+
+    for each parameter symbol in lambda-func
+        popEnvironmentStack()
+
+    return(result)
+    }	
+</pre></blockquote>
+
+<p>The <tt>evaluateExpression(args)</tt> function and <tt>evaluateLambda(func, args)</tt> call each other in a recursive cycle.</p>
+
+<p>Note that arguments to lambda functions are evaluated in the variable environment as defined previous to the lambda function call. Assignments to parameters symbols do happen after all argument evaluations. Only the arguments are evaluated which have a corresponding parameter symbol. If there are more parameter symbols than arguments passed, then parameter symbols are assigned <tt>nil</tt> or a default value.</p>
+
+<h3>Namespaces and the translation and evaluation cycle</h3>
+
+<p>All memory data objects in newLISP are bound directly or indirectly to a symbol. Either memory objects are directly referenced by a symbol or they are part of an enclosing s-expression memory object referenced by a symbol. Unbound objects only exist as transient objects as returned values from evaluations and are referenced on the result stack for later deletion [1].</p> 
+
+<p>Except for symbols, all data and program objects are referenced only once. Symbols are created and organized in a binary tree structure. Namespaces, called <i>contexts</i> in newLISP, are sub-branches in this binary tree. A context is bound to a symbol in the root context <tt>MAIN</tt>, which itself is a symbol in the root context.</p>
+
+<p>With few exceptions all symbols are created during the code loading and translation phase of the newLISP interpreter. Only the functions <tt>load</tt>, <tt>sym</tt>, <tt>eval-string</tt> and a special syntax of <tt>context</tt> create symbols during runtime execution.<p>
+
+<p>The two symbols <tt>MAIN:x</tt> and <tt>CTX:x</tt> are two different symbols at all times. A symbol under no circumstances can change it's context after it was created. A context, e.g <tt>CTX</tt>, itself is a symbol in <tt>MAIN</tt> containing the root pointer to a sub-branch in the symbol tree.</p>
+
+<p>The working of context switching is explained using the following two code pieces:</p>
+
+<blockquote><pre>
+(set 'var 123)
+(define (foo x y)
+    (context 'CTX)
+    (println var " " x " " y))
+</pre></blockquote>
+
+<p>The <tt>(context 'CTX)</tt> statement only has been included here to show, it has no effect in this position. A switch to a different namespace context will only have influence on subsequent symbol creation using <tt>sym</tt> or <tt>eval-string</tt>. By the time <tt>(context 'CTX)</tt> is executed <tt>foo</tt> has already been defined and all symbols used in it have been looked up and translated. Only when using <tt>(context ...)</tt> on the top level it will influence the symbol creation of code following it:</p>
+
+<blockquote><pre>
+(context 'CTX)
+(set 'var 123)
+(define (foo x y)
+    (println var " " x " " y))
+(context MAIN)
+</pre></blockquote>
+
+<p>Now the context is created and switched to on the top-level. When newLISP translates the subsequent set-statement and function definition, all symbols will be part of <tt>CTX</tt> as <tt>CTX:var</tt>, <tt>CTX:foo</tt>, <tt>CTX:x</tt> and <tt>CTX:y</tt>.
+
+<p>When loading code newLISP reads a top-level expression translating then evaluating it. This cycle is repeated until all top-level expression are read and evaluated.</p>
+
+<blockquote><pre>
+(set 'var 123)
+(define (foo x y)
+    (println var " " x " " y))
+</pre></blockquote>
+
+<p>In the previous code snippet two top-level expressions are translated and evaluated resulting in the creation of the three symbols: <tt>MAIN:var</tt>, <tt>MAIN:foo</tt>, <tt>MAIN:x</tt>, <tt>MAIN:y</tt> and <tt>MAIN:CTX</tt>.</p> 
+
+<p>The symbol <tt>MAIN:var</tt> will contain the number <tt>123</tt> and the <tt>MAIN:foo</tt> symbols will contain the lambda expression <tt>(lambda (x y) (println var " " x " " y))</tt>. The symbols <tt>MAIN:x</tt> and <tt>MAIN:y</tt> both will contain <tt>nil</tt>. The <tt>var</tt> inside the definition of <tt>foo</tt> is the same as the <tt>var</tt> previously set to <tt>123</tt> and will be printed as <tt>123</tt> during execution of <tt>foo</tt>.</p>
+
+<p>In detail the following steps are happening:</p>
+
+<ol>
+<li> current context is <tt>MAIN</tt>
+<li> read the opening top-level parenthesis <tt>I</tt> and create a Lisp cell of type <tt>EXPRESSION</tt>. 
+<li> read and lookup <tt>set</tt> in <tt>MAIN</tt> and find it to be a built-in primitive in <tt>MAIN</tt>, translate it to the address of this primitive function in memory. Create a Lisp cell of type <tt>PRIMITIVE</tt> containing the functions address in its contents slot.
+<li> read the quote <tt>'</tt> and create a Lisp cell of type <tt>QUOTE</tt>.
+<li> read and lookup lookup <tt>var</tt> in <tt>MAIN</tt>, it is not found in <tt>MAIN</tt>, create it in <tt>MAIN</tt> and translate it to the address in the binary symbol tree. Create a Lisp cell of type <tt>SYMBOL</tt> containing the symbols address in its contents slot. The previously created quote cell serves as an envelop for the symbols cell.
+<li> read <tt>123</tt> and create a Lisp cell of type <tt>INTEGER</tt> with <tt>123</tt> in its contents slot.
+<li> read the closing top-level parenthesis finish the following list structure in memory:<br />
+
+
+<blockquote><pre>
+[ ]                             ; cell of type: EXPRESSION
+  \
+ [MAIN:set] -> ['] -> [123]     ; three cells of type: PRIMITIVE, QUOTE, INTEGER
+                 \
+               [MAIN:var]       ; cell of type: SYMBOL
+</pre></blockquote>
+
+<p>The above list diagram shows the five Lisp cells, which are created. List and quote cells are envelope cells containing a list or a quoted expression.</p>
+
+<p>The statement <tt>(set 'var 123)</tt> is not executed yet, but symbol translation and creation have finished and the statement exists as a list structure in memory. The whole list structure can be referenced with one memory address, the address of the first created cell of type <tt>EXPRESSION</tt>.</p>
+
+<li>Evaluate the statement
+</ol>
+
+<p>In similar fashion newLISP will read and translate the next top-level expression, which is the function definition of <tt>foo</tt>. Evaluating this top-level expression will result in an assignment of a lambda expression to the <tt>foo</tt> symbol.
+
+<p>In the above code snippet both instances of <tt>var</tt> refer to <tt>MAIN:var</tt>. The <tt>(context  'CTX)</tt> statement only changes the context, namespaces for newly created symbols. The symbol <tt>var</tt> was created during loading translating the <tt>foo</tt> function. By the time <tt>foo</tt> is called and executed <tt>var</tt> already exists inside the <tt>foo</tt> function as <tt>MAIN:var</tt>. The <tt>(context 'CTX)</tt> statement doesn't have any effect of the subsequent execution of <tt>(println var)</tt>.</p>
+
+<p>Context statements like <tt>(context 'CTX)</tt> above, change the current context for symbol creation during the loading and translation phase. The current context defines under which branch in the symbol tree new symbols are created. This affects only the the functions <tt>sym</tt>, <tt>eval-string</tt> and a special syntax of <tt>context</tt> to create symbols. Once a symbol belongs to a context it stays there.</p>
+
+<h3>Namespaces and the default functor</h3>
+
+<p>In newLISP a symbol is a <i>default functor</i> if it has the same name as the context it belongs too, e.g. <tt>Foo:Foo</tt> is the default functor symbol in the context <tt>Foo</tt>. In newLISP when using a context symbol in the functor position, it is taken as the default functor:</p>
+
+<blockquote><pre>
+(define (double:double x) (* 2 x))
+(double 3) => 6
+
+(set 'my-list:my-list '(a b c d e f))
+(my-list 3) => d
+</pre></blockquote>
+
+<p>The second example combines implicit indexing with usage of a default functor.</p>
+
+<p>Default functors can be applied and mapped using <tt>apply</tt> and <tt>map</tt> like any other function or functor symbol:</p>
+
+<blockquote><pre>
+(map my-list '(3 2 1 2)) => (d c b c)
+
+(apply double '(10)) => 20
+</pre></blockquote>
+
+<p>Default functors are a convenient way in newLISP to pass lists or other big data objects by reference:</p>
+
+<blockquote><pre>
+(set 'my-list:my-list '(a b c d e f))
+
+(define (set-last ctx val) 
+	(nth-set (ctx -1) val))
+
+(set-last my-list 99) => f
+
+my-list:my-list => (a b c d e 99)
+</pre></blockquote>
+
+<p>Default functors are also a convenient way to define functions with a closed state-full
+name space:</p>
+
+<blockquote><pre>
+(context 'accumulator)
+(define (accumulator:accumulator x) 
+	(if (not value) 
+		(set 'value x)
+		(inc 'value x)))
+(context MAIN)
+
+(accumulator 10) => 10
+(accumulator 2) => 12
+(accumulator 3) => 15
+</pre></blockquote>
+
+<p>Note that the symbols <tt>x</tt> and <tt>value</tt> both belong to the namespace <tt>accumulator</tt>. Because <tt>(context 'accumulator)</tt> is at the top level, the translation of following function definition for <tt>accumulator:accumulator</tt> happens inside the current namespace <tt>accumulator</tt>.</p>
+
+<p>Namespaces in newLISP can be passed by reference and can be used to create state-full lexical closures.</p>
+
+<h3>Namespace context switching</h3>
+
+<p>Previous chapters showed how to use context switching on the top-level of a newLISP source file to influence symbol creation and translation during the source loading process. Once different namespaces exist, calling a function which belongs to different context, will cause a context switch to the namespace the called lambda function resides in. If the called function doesn't execute any <tt>sym</tt> or <tt>eval-string</tt> statements, then these context switches don't have any effect. Even the <tt>load</tt> command will always start file loading relative to context <tt>MAIN</tt> unless a different context is specified as a special parameter in <tt>load</tt>. Inside the file loaded context switches will have an effect of symbol creation during the load process as explained previously.</p>
+
+<p>What causes the context switch is the symbol holding the lambda function. In the following code examples bold face is used for output generated by <tt>println</tt> statements:</p>
+
+<blockquote><pre>
+(context 'Foo)
+(set 'var 123)
+(define (func) 
+    (println "current context: " (context))
+    (println "var: " var))
+(context 'MAIN)
+
+(Foo:func)
+<b>current context: Foo</b>
+<b>var: 123</b>
+
+(set 'aFunc Foo:func)
+(set 'var 999)
+
+(aFunc)
+<b>current context: MAIN</b>
+<b>var: 123</b>
+</pre></blockquote>
+
+<p>Note that the call to <tt>aFunc</tt> causes the current context to be shown as <tt>MAIN</tt>, because the symbol <tt>aFunc</tt> belongs to context <tt>MAIN</tt>. In both cases <tt>var</tt> is printed as <tt>123</tt>. The symbol <tt>var</tt> was put into the <tt>Foo</tt> namespace during translation of <tt>func</tt> and will always stay there, even if a copy of the lambda function is made and assigned to a symbol in a different context.</p>
+
+<p>This context switching behaviour follows the same rules when applying or mapping functions:</p>
+
+<blockquote><pre>
+(apply 'Foo:func)
+<b>current context: Foo
+var: 123</b>
+
+(apply Foo:func)
+<b>current context: MAIN
+var: 123</b>
+</pre></blockquote>
+
+<p>The first time <tt>Foo:func</tt> is applied as a symbol &ndash; quoted, the second time the lambda function contained in <tt>Foo:func</tt> is applied directly, because <tt>apply</tt> evaluates it's first argument first.</p> 
+
+<h3>References</h3>
+[1] <i>Lutz Mueller</i>, 2004<br /> 
+<a href="http://newlisp.org/MemoryManagement.html">Automatic Memory Management in newLISP</a>.
+<br /><br />
+
+[2] <i>John McCarthy</i>, 1960<br />
+<a href="http://www-formal.stanford.edu/jmc/recursive.html">Recursive Functions of Symbolic Expressions and their Computation by Machine</a>.
+<br /><br />
+</blockquote>
+</body>
+</html>
diff --git a/doc/FILES b/doc/FILES
new file mode 100644
index 0000000..6866c32
--- /dev/null
+++ b/doc/FILES
@@ -0,0 +1,161 @@
+LIST OF FILES IN DISTRIBUTION in newLISP version 9.0
+----------------------------------------------------
+
+doc/             documentation directory
+
+COPYING          text of GNU GPL, also conatined in the manual
+CREDITS          people who helped developing or documenting newLISP
+INSTALL          install procedure
+LOCALIZATION     how to localize newLISP builds
+TRUE64BUILD      comments on building for the true64 CPU flavor
+newlisp.1        man page for LINUX/BSD/UNIX
+newlispdoc.1     man page for newlispdoc
+
+manual_frame.html         for viewing the manual in a frame with index
+newlisp_manual.html       newLISP for LINUX, Users manual and Reference
+newlisp-index.html        index for frame viewing of manual
+newLISPdoc.html           documentation for newlispdoc utility
+newLISP-9.2-Release.html  release notes for mayor release 
+
+CodePatterns.html      frequently used patterns in newLISP programming
+MemoryManagement.html  how newLISP manages memory
+
+
+util/          various utility files
+
+http-conf.lsp  configuration file for newLISP HTTP server mode
+link.lsp       for 'linking' a source file together with a newlisp executeable
+nclocal.c       nc/netcat like utility for loal domain sockets
+newlisp.vim	    syntax file for VIM editor syntax highlighting
+newlispdoc      utility to generate HTML docs from newLISP source
+preparepdf      preprocessese newlisp_manual.html for PDF conversion
+syntax.cgi      syntax highlighting in HTML for newLISP source
+syntax-help     function for inclusion in init.lsp for command line syntax help
+sql.c           program to disply MySQL include file offsets
+type.c          program to show type sizes for porting newLISP
+
+newlisp-x.x.x/   main distribution directory containing all source
+
+README           general info and install
+newlisp.c        newLISP VM and core primitives and auxiilary functions
+newlisp.h        main header file
+primes.h         header file containing table of all primitives 
+protos.h         header file containing function prototypes
+nl-list.c        functions working on lists
+nl-liststr.c     functions working on lists and striong alike
+nl-string.c      string handling primitives
+nl-filesys.c     I/O primitives, process control, time date
+nl-import.c      shared library interface
+nl-math.c        floating point API
+nl-matrix.c      matrix functions
+nl-sock.c        networking API
+nl-symbol.c      symbol creation manipulation Red/Black tree
+nl-xml.c         xml functions
+nl-web.c         special web functions
+nl-debug.c       debugging functions
+nl-utf8.c        UTF-8 versions of some newLISP string functions
+unix-lib.c       for compiling newlisp.so shared lib under Linux/UNIX
+osx-dlfcn.c      Mac OSX/Darwin dylib library interface
+osx-dlfcn.h      Mac OSX/Darwin dylib library interface
+win32-util.c     Win32 specific functions also used in CYGWIN, MinGW
+win32dll.c       for compiling a Win32 DLL also used in CYGWIN, MinGW
+win32dll.def     for compiling a Win32 DLL also used in CYGWIN, MinGW
+win32-path.c     routines for UTF-16 file and directory access
+init.lsp.example initialization file loaded from /usr/share/newlisp/init.lsp
+
+pcre.h            PCRE Perl Compatible Regular Expression header file
+pcre-config.h     PCRE config file
+pcre-internal.h   PCRE headerfile
+pcre.c            PCRE main source
+pcre-chartables.c PCRE standrad character table
+
+Makefile          main makefile
+build             script called discovering the OS platform and making newlisp
+configure         discovery of OS platform only without actually making newlisp
+
+makefile_*        See the file Makefile for explanation
+
+qa-dot            test suite for countries with decimal point
+qa-comma          test suite for countries with decimal comma
+qa-lfs            test suite for large file system support
+qa-local-domain   test suite for local-dmain UNIX sockets
+qa-net            test suite for distributed networking functions (UNIX only)
+qa-setsig         test suite for signals
+qa-utf16path.lsp  test suite for UTF-16 pathnames on Win32
+qa-utf8           displays a sentence in many language alphabets
+qa-xml            test suite for xml functions
+
+modules/          modules to be loaded which implement a specific interface
+
+For all modules HTML documentation can be generated using newlispoc
+inside the modules directory execute: newlisp -s *.lsp
+The module for GUI-Server guiserver.lsp can be found in the
+guiserver subdirectory newlisp-x.x.x/guiserver/
+
+cgi.lsp		    functions for CGI with Apache or compatible web servers
+crypto.lsp      OpenSSL crypto library module
+ftp.lsp		    functions for file transfer with FTP	
+gmp.lsp         functions for GNU Multiplem Precision Library support
+infix.lsp	    parses infix, postfix and reverse polish to s-expressions
+mysql.lsp	    MySQL version 4.0 database access
+mysql5.lsp	    MySQL version 5.0 database access
+mysql51.lsp	    MySQL version 5.0 database access
+odbc.lsp	    ODBC database access
+pop3.lsp	    mailbox access with POP3
+postsrcipt.lsp  functions for generating Postscript files
+smtp.lsp	    sending mail with SMTP
+sqlite3.lsp	    SQLite3 database access for SQLite 3.0 and later
+stat.lsp	    multivariate statistics and plotting (requires gnuplot)
+unix.lsp        functions for importing common libc UNIX utility functions
+xmlrpc-client.lsp   cient module for XML-RPC
+zlisp.lsp       Zlib compression/de-compression support
+
+examples/      various code examples and utilities
+
+finger         sample script for a finger client
+client         client/server networking sample
+form.html      sample html form for processing with form.cgi
+form.cgi       newLISP CGI processing sample script
+newLISP-Excel-Import.xls  example how to call newlisp.dll from VB for applications
+opengl-demo.lsp  OpenGL demo using Glut, see file header for libs required
+prodcons.lsp   demo for fork, wait-pid, semaphore and share on Linux/UNIX
+server         client/server networking sample
+sqlite.cgi     simple script to call sqlite from a websever
+sqlite3.cgi    simple script to call sqlite from a websever
+tcltk.lsp      run Tcl/Tk apps without newlisp-tk frontend
+udp-client.lsp example for UDP client
+udp-server.lsp example for UDP server
+upload.html    file upload example with multipart POST request
+upload.cgi     CGI to handle upload.html
+xmlrpc.cgi     newISP XML-RPC service as a CGI request
+
+guiserver/
+
+All of the following files are also installed when executing:
+    sudo make install
+
+guiserver.lsp       module file to talk to guiserver.jar
+guiserver.jar       compiled GUI-Server Java executable
+guiserver.lsp.html  HTML doc generated from guiserver.lsp
+index.html          index page for guiserver.lsp.html
+newlisp-edit.lsp    GUI-Server application
+
+*.lsp          various demos for GUI-Server
+
+CHANGES             changes notes for guiserver
+guisserver.lsp.html guiserver module file
+guisserver.lsp.html guiserver docs generated from guiserver.lsp
+index.html          index of guiserver functions generated from guiserver.lsp
+Makefile            used for guisever development
+Manifest            used by the Java compiler
+
+/guiserver/images
+
+*.png          various icons and images built into guiserver.jar
+
+/guiserver/java/
+
+*.java         Java source for GUI-Server
+
+                              +++
+
diff --git a/doc/INSTALL b/doc/INSTALL
new file mode 100644
index 0000000..5c1d4ab
--- /dev/null
+++ b/doc/INSTALL
@@ -0,0 +1,169 @@
+BINARY INSTALL, BUILD, TOOLS, LOCALIZING  (last updated 2007-02-15)
+-------------------------------------------------------------------
+
+CONTENTS
+
+(1) WIN32 BINARY DISTRIBUTION INSTALLATION
+(2) BUILD newLISP FROM SOURCE for LINUX, free/net/openBSD, MacOSX, Solaris
+(3) COMMENTS FOR COMPILING AND LINKING
+(4) TOOLS
+(5) LOCALIZATION
+(6) INSTALLING AFTER BUILDING FROM SOURCE
+(7) UNINSTALL
+(8) RUNNING newLISP IN A SHELL OR CONSOLE WINDOW
+(9) RUNNING THE newLISP-GS GRAPHICAL FRONTEND
+
+
+(1) WIN32 BINARY DISTRIBUTION INSTALLATION
+------------------------------------------
+
+The Win32 binary distribution comes packed asa Win32 installer
+application. After downloading a file:
+
+    newlisp-xxxx-win-gs-xxx.exe
+
+douuble click on it and follow instructtions. xxxx and xxx are
+the version numbers for newLISP and the newLISP-tk the GUI frontend.
+
+
+(2) BUILD newLISP FROM SOURCE for LINUX, free/net/openBSD, MacOSX, Solaris
+---------------------------------------------------------------------------
+
+Un-tar/gunzip the distribution file newlisp_9.x.x.tgz :
+
+    tar xzvf newlisp_9.x.x.tgz
+
+Change the current directory in to newlisp_x.x.x/
+From the command line do:
+
+    make
+
+this will automatically detect one of the platforms Linus, MacOS X, FreeBSD,
+OpenBSD, NetBSD and SunOS/Solaris.
+
+To just check what OS flavor make would detect, type:
+
+    ./configure
+
+ther are many other flavors for different OS and compilers type
+make with help to see all options: 
+
+    make help
+
+If 'make' comes back with error messages try gmake, or any other 
+make compatible with gmake.
+
+to remove objects and before switching make flavors:
+
+    make clean
+
+Since version 9.0.14 newLISP can also be compiled for 64-bit Linux
+with 64-bit memory pointers. See the file: Makefile for details.
+
+
+(3) COMMENTS FOR COMPILING AND LINKING
+--------------------------------------
+
+Some OS's and installations may not support 'readline' or support for
+milli seconds resolution in the time functions or library import functionality.
+See the options NANOSLEEP, READLINE and NOIMPORT in the makefile_xxx
+for your platform and compilation flavor. When using the READLINE option
+on some OSs the library options -lreadline and -lncurses or -ltermcap have
+to be replaced. Study the makefile of your platorm.
+
+On MacOSX the flavor 'osx' is without readline support the flavor 'darwin'
+is with readline support.
+
+On some platforms the warning message "ANSI does not support long long" will be
+issued for every file compiled. This message can be discarded and does not occur
+on newer versions of GCC. The 'long long' data type is not used anywhere in the 
+newLISP source but part of some header files of the GCC installation.
+
+The Linux version is without readline support by default, because readline
+support does not come in the default install of many Linux distributions.
+
+When creating Win32 versions read the file README_WIN32 first.
+
+
+(4) TOOLS
+---------
+
+Besides gcc for the 'C' compiler, several other tools are used for packaging
+the installer for Win32, configuring PCRE etc. These tools can be found at: 
+http://newlisp.org/download/Tools/
+
+For a normal installation from the source distribution only the GCC or
+compatible compiler is required.
+
+
+(5) LOCALIZATION
+----------------
+
+The PCRE Regular Expressions code can be localized to your country/language 
+(see comments in file 'makefile'), it comes with default character tables for
+English. For correct working of other string functions in your country/language
+a localizable 'C' library/OS may have to be used. The names of newLISP functions can
+be localized during runtime without performance loss, (see newlisp_manual.html).
+
+There are also UTF-8 versions/makefiles available in the source distribution.
+See the chapter about 'Customization, localization and UTF-8' in the manual.
+
+
+(6) INSTALLING AFTER BUILDING FROM SOURCE
+-----------------------------------------
+
+To install log in as super user or root and do:
+
+    make install
+
+On Mac OSX when not running as superuser (but with admin rights):
+
+    sudo make install
+
+If you cannot get super user or root privileges, newslisp can be installed
+in yur home directory in $HOME/bin and $HOME/share instead of /usr/bin
+and /usr/share
+
+    make install_home
+
+This will create /usr/share/newlisp  or $HOME/bin and $HOME/share/newlisp and
+/usr/share/doc/newlisp or $HOME/share/doc/newlisp
+
+(7) UNINSTALL
+--------------
+
+sto uninstall if installed with make install do:
+
+    make uninstall
+
+or if installed with install_home
+
+    make uninstall_home
+
+    
+make and executables are tested on Mandrake Linux, FreeBSD, Solaris
+Darwin/Mac OSX and WinXP Home
+
+(8) RUNNING newLISP IN A SHELL OR CONSOLE WINDOW
+-------------------------------------------------
+
+On all platforms simply execute:
+ 
+ newlisp <enter>
+
+on the command line. On Win32 the execution path of newlisp.exe was added
+to the environment during installation. On all other platforms the newlisp
+binary is in /usr/bin/newlisp or when using the home install in $HOME/bin
+where $HOME is the the home directory of the user taken from the environment
+variable HOME.
+
+
+(9) RUNNING THE newLISP-GS GRAPHICAL FRONTEND
+
+On Win32 and Mac OS X a Java based syntaxhighlighting editor is installed in
+in the Applications menus. The editor needs a Java runtime environment JRE
+versin 1.5 as a minimum. In case it is not installed it can be obtained from
+http://java.sun.com .
+
+                                 +++
+
diff --git a/doc/LOCALIZATION b/doc/LOCALIZATION
new file mode 100644
index 0000000..a05fef0
--- /dev/null
+++ b/doc/LOCALIZATION
@@ -0,0 +1,41 @@
+LOCALIZATION
+============
+
+See chapter 'Customization Localizattion and UTF-8' in the 
+Users Manual and the usage of 'set-locale' function in the 
+Function Reference.
+
+The 'set-locale' function will not influence the behaviour of
+PCRE (Perl Compatible Regular Expressions) in newLISP, but a
+special option flag number  can be set to support UTF-8 in all
+functions supporting regular expressions like: regex, find,
+replace, parse and search.
+
+To further localize the behaviour of regular expressions in newLISP
+the file 'pcre-chartables.c' must be replaced with a localized
+version. To obtain this file for your locale, follow these steps:
+
+(1) get the pcre source distribution from http://www.pcre.org
+
+(2) follow the instruction in it's README file to 'configure'
+    and  'make' it. An installation is not necessary. Just using
+    the 'configure' and 'make' steps will create a file called
+    'chartables.c' suitable for the locale on your computer
+    system. Rename this file to 'pcre-chartables.c', which it
+    replaces in the newLISP source distribution.
+
+(3) recompile newLISP
+
+newLISP will now show regular expression behaviour in functions
+like 'regex', 'find', 'replace' and 'parse' appropiate to your
+locale. The function 'set-locale' should still be used to change
+all other aspects of newLISP to your locale.
+
+newLISP can be used with multi-byte character languages when
+compiled with UTF-8 options. For some OS flavors UTF-8 enabled
+makefile are shipped in the source distribution.
+
+When compiled with UTF-8 character handling some newLISP functions
+will work on multibyte characters instead of single bytes. See
+the manual for details.
+                               +++
diff --git a/doc/License.html b/doc/License.html
new file mode 100644
index 0000000..6addcf6
--- /dev/null
+++ b/doc/License.html
@@ -0,0 +1,778 @@
+<html>
+<center>
+<h2><span class="function">GNU GENERAL PUBLIC LICENSE</span></H2>
+		      <p>Version 3, 29 June 2007</p>
+</center>
+
+<p>
+ Copyright (C) 2007 Free Software Foundation, Inc. http://fsf.org/
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.i
+</p>
+
+<center><b>Preamble</b></center>
+
+<p>
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+</p>
+<p>
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+</p>
+<p>
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+</p>
+<p>
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+</p>
+<p>
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+</p>
+<p>
+  Developers that use the GNU GPL protect your rights with two steps:
+</p>
+<p>
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+</p>
+<p>
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+</p>
+<p>
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+</p>
+<p>
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+</p>
+<p>
+  The precise terms and conditions for copying, distribution and
+modification follow.
+</p>
+<p>
+<center><b>TERMS AND CONDITIONS</b></center>
+
+<p><b>0. Definitions.</b></p>
+
+</p>
+<p>
+  "This License" refers to version 3 of the GNU General Public License.
+</p>
+<p>
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+</p>
+<p>
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+</p>
+<p>
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+</p>
+<p>
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+</p>
+<p>
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+</p>
+<p>
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+</p>
+<p>
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+<p><b>1. Source Code.</b></p>
+
+</p>
+<p>
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+</p>
+<p>
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+</p>
+<p>
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+</p>
+<p>
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+</p>
+<p>
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+</p>
+<p>
+  The Corresponding Source for a work in source code form is that
+same work.
+</p>
+<p>
+<b>2. Basic Permissions.</b>
+
+</p>
+<p>
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+</p>
+<p>
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+</p>
+<p>
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+</p>
+<p>
+<b>3. Protecting Users' Legal Rights From Anti-Circumvention Law.</b>
+
+</p>
+<p>
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+</p>
+<p>
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+</p>
+<p>
+<b>4. Conveying Verbatim Copies.</b>
+</p>
+<p>
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+</p>
+<p>
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+</p>
+<p>
+<b>5. Conveying Modified Source Versions.</b>
+</p>
+<p>
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+</p>
+<p>
+<blockquote>
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+</blockquote>
+</p>
+<p>
+<blockquote>
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+</blockquote>
+</p>
+<p>
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+</p>
+<p>
+<b>6. Conveying Non-Source Forms.</b>
+
+</p>
+<p>
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+</p>
+<p>
+<blockquote>
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+</blockquote>
+</p>
+<p>
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+</p>
+<p>
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+</p>
+<p>
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+</p>
+<p>
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+</p>
+<p>
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+</p>
+<p>
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+</p>
+<p>
+<b>7. Additional Terms.</b>
+</p>
+<p>
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+</p>
+<p>
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+</p>
+<p>
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+</p>
+<p>
+<blockquote>
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+</blockquote>
+</p>
+<p>
+<blockquote>
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+</blockquote>
+</p>
+<p>
+<blockquote>
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+</blockquote>
+</p>
+<p>
+<blockquote>
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+</blockquote>
+</p>
+<p>
+<blockquote>
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+</blockquote>
+</p>
+<p>
+<blockquote>
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+</blockquote>
+</p>
+<p>
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+</p>
+<p>
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+</p>
+<p>
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+</p>
+<p>
+<b>8. Termination.</b>
+</p>
+<p>
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+</p>
+<p>
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+</p>
+<p>
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+</p>
+<p>
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+</p>
+<p>
+<b>9. Acceptance Not Required for Having Copies.</b>
+</p>
+<p>
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+</p>
+<p>
+<b>10. Automatic Licensing of Downstream Recipients.</b>
+</p>
+<p>
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+</p>
+<p>
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+</p>
+<p>
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+</p>
+<p>
+<b>11. Patents.</b>
+</p>
+<p>
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+</p>
+<p>
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+</p>
+<p>
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+</p>
+<p>
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+</p>
+<p>
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+</p>
+<p>
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+</p>
+<p>
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+</p>
+<p>
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+</p>
+<p>
+<b>12. No Surrender of Others' Freedom.</b>
+</p>
+<p>
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+</p>
+<p>
+<b>13. Use with the GNU Affero General Public License.</b>
+</p>
+<p>
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+</p>
+<p>
+<b>14. Revised Versions of this License.</b>
+</p>
+<p>
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+</p>
+<p>
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+</p>
+<p>
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+</p>
+<p>
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+</p>
+<p>
+<b>15. Disclaimer of Warranty.</b>
+</p>
+<p>
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+</p>
+<p>
+<b>16. Limitation of Liability.</b>
+</p>
+<p>
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+</p>
+<p>
+<b>17. Interpretation of Sections 15 and 16.</b>
+</p>
+<p>
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+</p>
+<p>
+<center><b>END OF TERMS AND CONDITIONS</b></center>
+</p>
+</blockquote>
+</td>
+</tr>
+</table>
+
+<br /><br />
+<center style="font-size: 150%">
+<span class="divider">(&nbsp;<font color="#7ba9d4">&part;</font>&nbsp;)</span>
+</center>
+</html>
diff --git a/doc/MemoryManagement.html b/doc/MemoryManagement.html
new file mode 100644
index 0000000..7d44f23
--- /dev/null
+++ b/doc/MemoryManagement.html
@@ -0,0 +1,242 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+<style type="text/css" media="screen">
+<!--
+body, h1, h2, h3, h4, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+	line-height: 120%;
+ 	}
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+   	font-size: 100%;
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	font-size: 100%;
+	}
+-->
+</style>
+</head>
+
+<body text="#000000" bgcolor="#FFFFFF" link="#376590" vlink="#551A8B" alink="#ffAA28">
+
+<br>
+<blockquote>
+<center><h2>Automatic Memory Management in newLISP</h2></center>
+<center><font size="-1">Lutz Mueller, 2004-2007. Last edit 2007-8-28 rev 19<br>
+</font></center>
+
+<center><blockquote><blockquote><i>
+ORO (One Reference Only) automatic memory management developed for newLISP is a fast and resources saving alternative to classic garbage collection algorithms in dynamic, interactive programming languages. This article explains how ORO memory management works</i>
+</blockquote></blockquote></center>
+
+<p>newLISP and any other interactive language system will constantly generate new memory objects during expression evaluation. The new memory objects are intermediate evaluation results, reassigned memory objects, or memory objects whose content was changed. If newLISP did not delete these objects, it would eventually run out of available memory.</p>
+
+<p>In order to understand newLISP's automatic memory management, it is necessary to first review the traditional methods employed by other languages.</p>
+
+<h3>Traditional automatic memory management (Garbage Collection)</h3>
+
+<p>In most programming languages, a process registers allocated memory, and another process finds and recycles the unused parts of the allocated memory pool. The recycling process can be triggered by some memory allocation limit or can be scheduled to happen between evaluation steps. This form of automatic memory management is called <i>Garbage Collection</i>.</p>
+
+<p>Traditional garbage collection schemes developed for LISP employed one of two algorithms&sup1;:</p>
+
+<p>(1) The <i>mark-and-sweep</i> algorithm registers each allocated memory object. A mark phase periodically flags each object in the allocated memory pool. A named object (a variable) directly or indirectly references each memory object in the system. The sweep phase frees the memory of the marked objects when they are no longer in use.</p>
+
+<p>(2) A <i>reference-counting</i> scheme registers each allocated memory object together with a count of references to the object. This reference count gets incremented or decremented during expression evaluation. Whenever an object's reference count reaches zero, the object's allocated memory is freed.</p>
+
+<p>Over time, many elaborate garbage collection schemes have been attempted using these algorithms. The first garbage collection algorithms appeared in LISP. The inventors of the Smalltalk language used more elaborate garbage collection schemes. The history of Smalltalk-80 is an exciting account of the challenges of implementing memory management in an interactive programming language; see [Glenn Krasner, 1983: <i>Smalltalk-80, Bits of History, Words of Advice</i>]. A more recent overview of garbage collection methods can be found in [Richard Jones, Rafael Lins, 1996: <i>Garbage Collection, Algorithms for Automatic Dynamic Memory Management</i>].</p>
+
+
+<h3>One reference only, (ORO) memory management</h3>
+
+<p>Memory management in newLISP does not rely on a garbage collection algorithm. Memory is not marked or reference-counted. Instead, a decision whether to delete a newly created memory object is made right after the memory object is created.</p>
+
+<p>Empirical studies of LISP have shown that most LISP cells are not shared and so can be reclaimed during the evaluation process. Aside from some optimizations for primitives like <tt>set</tt>, <tt>define</tt>, and <tt>eval</tt>, newLISP deletes memory objects containing intermediate evaluation results once it reaches a higher evaluation level. newLISP does this by pushing a reference to each created memory object onto a result stack. When newLISP reaches a higher evaluation level, it removes the last evaluation result's reference from the result stack and deletes the evaluation result's memory object. This should not be confused with one-bit reference counting. ORO memory management does not set bits to mark objects as <i>sticky</i>.</p>
+
+<p>newLISP follows a one reference only (ORO) rule. Every memory object not referenced by a symbol or context reference is obsolete once newLISP reaches a higher evaluation level during expression evaluation. Objects in newLISP (excluding symbols and contexts) are passed by value to other functions. As a result, each newLISP object only requires one reference.</p>
+
+<p>newLISP's ORO rule has advantages. It simplifies not only memory management but also other aspects of the newLISP language. For example, while users of traditional LISP have to distinguish between equality of copied memory objects and equality of references to memory objects, newLISP users do not.</p>
+
+<p>newLISP's ORO rule forces newLISP to constantly allocate and then free LISP cells. newLISP optimizes this process by allocating large chunks of cell memory from the host operating system. newLISP will request LISP cells from a free cell list and then recycle those cells back into that list. As a result, only a few CPU instructions (pointer assignments) are needed to unlink a free cell or to re-insert a deleted cell.</p>
+
+<p>The overall effect of ORO memory management is a faster evaluation time and a smaller memory and disk footprint than traditional interpreted LISP's can offer. The lack of garbage collection in newLISP more than compensates for its high frequency of cell creation/deletion. Note that under error conditions, newLISP will employ a mark and sweep algorithm to free un-referenced cells.</p>
+
+<h3>Performance considerations with value-passing</h3>
+
+<p>Passing parameters by value (memory copying) instead of by reference poses a potential disadvantage when dealing with large lists. For practical purposes, however, the overhead needed to copy a large list is negligible compared to the processing done on the list. Nevertheless, to achieve maximum performance, newLISP offers a group of destructive functions that can efficiently create and modify large lists. While <trt>cons</tt> and <tt>set-nth</tt> return a new memory object of the changed list, <tt>push</tt>, <tt>pop</tt> and <tt>nth-set</tt> change the existing list and only return a copy of the list elements that they added or removed. In order for any user defined function to operate destructively on a large list, the large list must be passed by reference. If a list is packaged in a context (a namespace) in newLISP, then newLISP can pass the list by reference.  newLISP contexts are the best choice when passing big lists or string buffers by reference. </p>
+
+<p>In most cases where lists are less than a few hundred elements long, the speed of ORO memory management more than compensates for the overhead required to pass parameters by value.</p>
+
+<h3>Memory and datatypes in newLISP</h3>
+
+<p>The memory objects of newLISP strings are allocated from and freed to the host's OS whenever newLISP recycles the cells from its allocated chunks of cell memory. This means that newLISP handles cell memory more efficiently than string memory. As a result, it is often better to use symbols than strings for efficient text processing. For example, when handling natural language it is more efficient to handle natural language words as individual symbols in a separated name-space, rather than as a single string. 
+The <tt>bayes-train</tt> function in newLISP uses this method. newLISP can handle millions of symbols without degrading performance.</p>
+
+<p>Programmers coming from other programming languages frequently overlook that symbols in LISP can act as more than just variables or object references. The symbol is a useful data type in itself, which in many cases can replace the string data type.</p>
+
+<p>Integer numbers and double floating-point numbers are stored directly in newLISP's LISP cells and do not need a separate memory allocation cycle.</p>
+
+<p>For efficiency during matrix operations like matrix multiplication or inversion, newLISP allocates non-cell memory objects for matrices, converts the results to LISP cells, and then frees the matrix memory objects.</p>
+
+<p>newLISP allocates an array as a group of LISP cells. The LISP cells are allocated linearly. As a result, array indices have faster random access to the LISP cells. Only a subset of newLISP list functions can be used on arrays. Automatic memory management in newLISP handles arrays in a manner similar to how it handles lists.</p>
+
+<h3>Implementing ORO memory management <font size="-1">&sup2;</font></h3>
+
+<p>The following pseudo code illustrates the algorithm implemented in newLISP in the context of LISP expression evaluation. Only two functions and one data structure are necessary to implement ORO memory management:</p>
+
+<blockquote><pre>
+function pushResultStack(evalationResult)
+
+function popResultStack() ; implies deleting
+
+array resultStack[] ; preallocated stack area
+</pre></blockquote>
+
+<p>The first two functions <tt>pushResultStack</tt> and <tt>popResultStack</tt> push or pop a LISP object handle on or off a stack. <tt>pushResultStack</tt> increases the value <tt>resultStackIndex</tt> while <tt>popResultStack</tt> decreases it. In newLISP every object is contained in a LISP cell structure. The object handle of that structure is simply the memory pointer to the cell structure. The cell itself may contain pointer addresses to other memory objects like string buffers or other LISP cells linked to the original object. Small objects like numbers are stored directly. In this paper function <tt>popResultStack()</tt> also implies that the popped object gets deleted.</p> 
+
+<p>The two <tt>resultStack</tt> management functions described are called by newLISP's <tt>evaluateExpression</tt> function:</p>
+
+<blockquote><pre>
+function evaluateExpression(expr)
+    {
+    resultStackIndexSave = resultStackIndex
+
+    if typeOf(expr) is BOOLEAN or NUMBER or STRING
+		return(expr)
+
+    if typeOf(expr) is SYMBOL
+        return(symbolContents(expr))
+
+    if typeOf(expr) is QUOTE
+        return(quoteContents(expr))
+
+    if typeOf(expr) is LIST
+        {    
+        func = evaluateExpression(firstOf(expr))
+        args = rest(expr)
+        if typeOf(func) is BUILTIN_FUNCTION
+                result = evaluateFunc(func, args)
+        else if typeOf(func) = LAMBDA_FUNCTION
+                result = evaluateLambda(func, args)
+        }
+    }
+
+    while (resultStackIndex > resultStackIndexSave)
+        deleteList(popResultStack())
+
+    pushResultStack(result)
+
+    return(result)
+    }
+</pre></blockquote>
+
+<p>The function <tt>evaluateExpression</tt> introduces the two variables <tt>resultStackIndexSave</tt> and <tt>resultStackIndex</tt> and a few other functions:</p>
+
+<ul>
+<li>
+<tt>resultStackIndex</tt> is an index pointing to the top element in the <tt>resultStack</tt>. The deeper the level of evaluation the higher the value of <tt>resultStackIndex</tt>.
+</li>
+<br />
+<li>
+<tt>resultStackIndexSave</tt> serves as a temporary storage for the value of <tt>resultStackIndex</tt> upon entry of the <tt>evaluateExpression(func, args)</tt> function. Before exit the <tt>resultStack</tt> is popped to the saved level of <tt>resultStackIndex</tt>. Popping the <tt>resultStack</tt> implies deleting the memory objects pointed to by entries in the <tt>resultStack</tt>.
+</li>
+<br />
+<li>
+<tt>resultStack[]</tt> is a preallocated stack area for saving pointers to LISP cells and indexed by <tt>resultStackIndex</tt>.
+</li>
+<br />
+<li>
+<tt>symbolContents(expr)</tt> and <tt>quoteContents(expr)</tt> extract contents from symbols or quote-envelope cells.
+</li>
+<br />
+<li>
+<tt>typeOf(expr)</tt> extracts the type of an expression, which is either a <tt>BOOLEAN</tt> constant like <tt>nil</tt> or <tt>true</tt> or a <tt>NUMBER</tt> or <tt>STRING</tt>, or is a variable <tt>SYMBOL</tt> holding some contents, or a <tt>QUOTE</tt> serving as an envelope to some other <tt>LIST</tt> expression <tt>expr</tt>.
+</li>
+<br />
+<li>
+<tt>evaluateFunc(func, args)</tt> is the application of a built-in function to its arguments. The built-in  function is the evaluated first member of a list in <tt>expr</tt> and the arguments are the <tt>rest</tt> of the list in <tt>expr</tt>. The function <tt>func</tt> is extracted calling <tt>evaluateExpression(first(expr))</tt> recursively. For example if the expression (<tt>expr</tt> is <tt>(foo x y)</tt> than <tt>foo</tt> is a built-in function and <tt>x</tt> and <tt>y</tt> are the function arguments or parameters.</li>
+<br />
+<li>
+<tt>evaluateLambda(func, args)</tt> works simlar to <tt>evaluateFunc(func, args)</tt>, applying a user-defined function <tt>first(expr)</tt> to its arguments in <tt>rest(expr)</tt>. In case of a user-defined function we have two types of arguments in <tt>rest(expr)</tt>, a list of local parameters followed by one or more body expressions evaluated in sequence.
+</li>
+</ul>
+
+<p>Both, <tt>evaluateFunc(func, args)</tt> and <tt>evaluateLambda(func, args)</tt> will return a newly created LISP cell object, which may be any type of the above mentioned expressions. The <tt>result</tt> values from these functions will always be newly created LISP cell objects destined to be destroyed on the next higher evaluation level, after the current <tt>evaluateExpression(expr)</tt> function excution returned.</p>
+
+<p>Both functions will recursively call <tt>evaluateExpression(expr)</tt> to evaluate their arguments. As recursion deepens it increases the recursion level of the function.</p>
+
+<p>Before <tt>evaluateExpression(func, args)</tt> returns it will pop the <tt>resultStack</tt> deleting the <tt>result</tt> values from deeper level of evaluation and returned by one of the two functions, either <tt>evaluateFunc</tt> or <tt>evaluateLambda</tt>.</p>
+
+<p>Any <tt>result</tt> expression is destined to be destroyed later but its deletion is delayed at a lower level of evaluation. This permits results to be used or copied by calling functions.</tt>
+
+<p>The following example shows the evaluation of a small user-defined LISP function <tt>sum-of-squares</tt> and the creation and deletion of associated memory objects:</p>
+
+<blockquote><pre>
+(define (sum-of-squares x y)
+	(+ (* x x) (* y y)))
+
+(sum-of-squares 3 4) =&gt; 25
+</pre></blockquote>
+
+<p><tt>sum-of-squares</tt> is a user-define <em>lambda-function</em> calling to <em>built-in</em> functions <tt>+</tt> and <tt>*</tt>.</p>
+
+<p>The following trace shows the relevant steps when defining the <tt>sum-of-squares</tt> function and when executing it with the arguments <tt>3</tt> and <tt>4</tt>.</p>
+
+<blockquote><pre>
+> (define (sum-of-squares x y) (+ (* x x) (* y y)))
+
+level 0: evaluateExpression( (define (sum-of-squares x y) 
+ (+ (* x x) (* y y))) )
+level 1: evaluateFunc( define <6598> )
+level 1: return( (lambda (x y) (+ (* x x) (* y y))) )
+
+<b>&rarr; (lambda (x y) (+ (* x x) (* y y)))</b>
+
+> (sum-of-squares 3 4)
+level 0: evaluateExpression( (sum-of-squares 3 4) )
+level 1:   evaluateLambda( (lambda (x y) (+ (* x x) (* y y))), (3 4) )
+level 1:   evaluateExpression( (+ (* x x) (* y y)) )
+level 2:     evaluateFunc( +, ((* x x) (* y y)) )
+level 2:     evaluateExpression( (* x x) )
+level 3:       evaluateFunc( *, (x x) )
+level 3:       pushResultStack( 9 )
+level 3:       return( 9 )
+level 2:     evaluateExpression( (* y y) )
+level 3:       evaluateFunc( *, (y y) )
+level 3:       pushResultStack( 16 )
+level 3:       return( 16 )
+level 2:     popResultStack() ->16
+level 2:     popResultStack() ->9
+level 2:     pushResultStack( 25 )
+level 2:     return( 25 )
+level 1:   return( 25 )
+
+<b>&rarr; 25</b> 
+</pre></blockquote>
+
+<p>The actual C-language implementation is optimized in some places to avoid pushing the <tt>resultStack</tt> and avoid calling <tt>evaluateExpression(expr)</tt>. Only the most relevant steps are shown. The function <tt>evaluateLambda(func, args)</tt> does not need to evaluate its arguments <tt>3</tt> and <tt>4</tt> becuase they are constants, but <tt>evaluateLambda(func, args)</tt> will call <tt>evaluateExpression(expr)</tt> twice to evaluate the two body expressions <tt>(+ (* x x)</tt> and <tt>(+ (* x x)</tt>. Lines preceded by the prompt <tt>&gt;</tt> show the command-line entry.</p>
+
+<p><tt>evaluateLambda(func, args)</tt> also saves the environment for the variable symbols <tt>x</tt> and <tt>y</tt>, copies parameters into local variables and restores the old environment upon exit. These actions too involve creation and deletion of memory objects. Details are omitted, becuase they are similar to to methods in other dynamic languages.</p>
+<br />
+
+<h3>References</h3>
+&ndash; Glenn Krasner, 1983: <i>Smalltalk-80, Bits of History, Words of
+Advice</i><br>
+Addison Wesley Publishing Company<br>
+  <br>
+&ndash; Richard Jones, Rafael Lins, 1996: <i>Garbage Collection, Algorithms
+for Automatic Dynamic Memory Management</i><br>
+John Wiley &amp; Sons <br>
+<br>
+&sup1; <font size="-1">Reference counting and mark-and-sweep algorithms where specifically developed for LISP. Other schemes like copying or generational algorithms where developed for other languages like Smalltalk and later also used in LISP.</font>
+<br /><br />
+&sup2; <font size="-1">This chapter was added in January 2007.</font>
+<br><br>
+<center><font size="-1">Copyright &copy; 2004-2007, Lutz Mueller 
+<a href="http://newlisp.org">http://newlisp.org</a>. All rights reserved. </font></center>
+</blockquote>
+</font>
+</body>
+</html>
diff --git a/doc/TRU64BUILD b/doc/TRU64BUILD
new file mode 100644
index 0000000..62dbe10
--- /dev/null
+++ b/doc/TRU64BUILD
@@ -0,0 +1,14 @@
+Building newLISP for HP's Tru64 OS
+==================================
+
+The following now will make newLISP for the tru64 OS and using the Compaq
+C compiler for the Alpha CPU:
+
+	make
+
+Note that since version 8.9.4 ffi libraries are not required anymore.
+
+Note that since version 9.0.14 newLisp compiles in 64-bit completely.
+
+Please contact Peter van Eerten (peter AT gtk-server DOT org) for any 
+remaining questions.
diff --git a/doc/manual_frame.html b/doc/manual_frame.html
new file mode 100644
index 0000000..95174f3
--- /dev/null
+++ b/doc/manual_frame.html
@@ -0,0 +1,15 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Frameset//EN"
+  "http://www.w3.org/TR/xhrml1/DTD/xhtml1-frameset.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+   <meta name="author" content="Lutz Mueller">
+   <meta name="keywords" content="newLISP LISP SCHEME manual reference help artificial intelligence AI NUEVATEC">
+   <meta name="description" content="newLISP Users Manual and Reference">
+   <title>newLISP Manual and Reference</title> 
+</head>
+<frameset cols="150px,*">
+   <frame  name="index" src="newlisp_index.html" noresize="noresize" border="0" frameborder="0" />
+   <frame  name="body" src="newlisp_manual.html" noresize="noresize" border="0" frameborder="0"/>
+</frameset>
+</html>
diff --git a/doc/newLISP-9.3-Release.html b/doc/newLISP-9.3-Release.html
new file mode 100644
index 0000000..b374b2f
--- /dev/null
+++ b/doc/newLISP-9.3-Release.html
@@ -0,0 +1,208 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<HTML>
+<HEAD>
+	<META HTTP-EQUIV="CONTENT-TYPE" CONTENT="text/html; charset=utf-8">
+	<TITLE></TITLE>
+	<META NAME="GENERATOR" CONTENT="NeoOffice 2.2  (Unix)">
+	<META NAME="CREATED" CONTENT="20070718;17381700">
+	<META NAME="CHANGED" CONTENT="20080130;10321700">
+	<STYLE TYPE="text/css">
+	<!--
+		H1 { font-family: "Georgia", "Times New Roman", "Times", serif; line-height: 120% }
+		P { font-family: "Georgia", "Times New Roman", "Times", serif; line-height: 120% }
+		H3 { font-family: "Georgia", "Times New Roman", "Times", serif; line-height: 120% }
+		BLOCKQUOTE { font-family: "Georgia", "Times New Roman", "Times", serif; line-height: 120% }
+	-->
+	</STYLE>
+</HEAD>
+<BODY LANG="en-US" DIR="LTR">
+<H1 STYLE="margin-left: 0.2in; margin-top: 0in">newLISP<FONT SIZE=2>tm</FONT>
+v.9.3 Release Notes <FONT SIZE=2>February 1st, 2008, rev 4</FONT></H1>
+<H3 STYLE="margin-left: 0.2in; margin-top: 0in">Improved newLISP-GS
+Graphics Server module and editor</H3>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in">This is the
+second release with the new Java based graphical user interface (GUI)
+server for newLISP. Since newLISP-GS appeared for the first time in
+release 9.2 new functions have been added, many bugs where fixed, and
+the newLISP-GS based multi tab editor has much improved behavior when
+launching applications. The monitor area at the bottom of the editor
+now works as an interactive newLISP shell. 
+</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in">The new way
+of doing Graphics and GUIs in newLISP using the Java based newLISP-GS
+module has been well received by the community. newLISP can also
+still be used with <A HREF="http://www.gtk-server.org/">GTK-Server</A>
+or Tcl/Tk.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in; text-decoration: none">
+As in previous releases, most new functionality and changes where
+asked for or contributed by the community of newLISP users.</BLOCKQUOTE>
+<H3 STYLE="margin-left: 0.2in">Full support for nested association
+lists</H3>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in; text-decoration: none">
+This version has a new set of functions for managing nested
+association lists. Nested association lists are frequently the result
+from converting XML into Lisp s-expressions. XML has established
+itself as a format for data interchange on the internet. The new
+functions permit access, modification and deletion of associations in
+nested association lists. These functions also work together with
+FOOP, which represents objects as associations.</BLOCKQUOTE>
+<H3 STYLE="margin-left: 0.2in; margin-top: 0in">FOOP – Functional
+Object Oriented Programming</H3>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in">Using the <FONT FACE="Lucida Sans Regular, sans-serif">:
+</FONT>colon operator to implement <SPAN STYLE="font-style: normal">polymorphism</SPAN>
+in method application and using context namespaces to encapsulate all
+methods of an object class, an object oriented programming system for
+newLISP has been designed. Thanks to <I>Michael Michaels</I> from
+<A HREF="http://www.neglook.com/">neglOOk</A> for designing most of
+this new way of object oriented programming in newLISP and for
+creating the training video series: “Towards FOOP”. FOOP melts
+contexts, the new colon operator <FONT FACE="Lucida Sans Regular, sans-serif">:
+</FONT>and functional programming into a simple and efficient way of
+<SPAN STYLE="font-style: normal">object oriented programming</SPAN>
+in newLISP. The system features polymorphism and inheritance and can
+have anonymous objects, which are memory managed automatically by
+newLISP.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in">A very
+short description of FOOP can be found in the Users Manual. For a
+more in depth treatment of this topic see <I>Michael Michaels</I>'s
+video series accessible from the <A HREF="http://newlisp.org/index.cgi?Documentation">newLISP
+documentation </A>page and the <A HREF="http://www.neglook.com/">neglOOk</A>
+website.</BLOCKQUOTE>
+<H3 STYLE="margin-left: 0.2in; margin-top: 0in">New functions</H3>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">assoc-set,
+set-assoc, pop-assoc</FONT> – change or delete an association,
+handle nested associations.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">bind</FONT>
+– the function binds expressions to symbols from an association
+list and is normally used in logic programming together with <FONT FACE="Lucida Sans Regular, sans-serif">unify</FONT>.
+This function was already persent in earlier versions, but was not
+documented.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">destroy</FONT>
+– destroys a process addressed by the process id returned by yhr
+newLISP functions <FONT FACE="Lucida Sans Regular, sans-serif">process</FONT>
+or <FONT FACE="Lucida Sans Regular, sans-serif">fork</FONT>.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">dostring</FONT>
+– iterates over a string with the character value in the loop
+variable. On UTF-8 compiled newLISP UTF8 character values are
+returned by the loop variable.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">NEWLISPDIR</FONT>
+- this environment variable will be registered on startup as
+<FONT FACE="Lucida Sans Regular, sans-serif">/usr/share/newlisp</FONT>
+on Unix and Unix like OSs and as <FONT FACE="Lucida Sans Regular, sans-serif">%PROGRAMFILES%/newlisp</FONT>
+on Win32. This allows writing platform independent code for loading
+modules. An already existing definition of <FONT FACE="Lucida Sans Regular, sans-serif">NEWLISPDIR</FONT>
+will not be overwritten during startup.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">ref-set,
+set-ref, ref-set-all</FONT> – these functions modify one or all
+elements in a list searched by a key. The key can be any type of
+expression and <FONT FACE="Lucida Sans Regular, sans-serif">unify</FONT>,
+<FONT FACE="Lucida Sans Regular, sans-serif">match</FONT> or a
+user-defined function can be specified as comparison function. Like
+the <FONT FACE="Lucida Sans Regular, sans-serif">nth</FONT>, <FONT FACE="Lucida Sans Regular, sans-serif">set-nth</FONT>
+and <FONT FACE="Lucida Sans Regular, sans-serif">nth-set</FONT>
+family of functions these new list search-and-replace functions can
+pass lists by reference using a context name which is interpreted as
+a <I>default functor</I>.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">when</FONT>
+– works like <FONT FACE="Lucida Sans Regular, sans-serif">if
+</FONT>without the <I>else </I>clause evaluating a block
+conditionally and without the necessity of <FONT FACE="Lucida Sans Regular, sans-serif">begin</FONT>.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in">The <FONT FACE="Lucida Sans Regular, sans-serif">:
+</FONT>(colon) now also works as a function and can be attached to a
+symbol following it. The operator forms a context symbol from the
+symbol following it and the context symbol found as the first element
+of the list contained in the next argument. The colon operator is
+used to implement polymorphism in FOOP.</BLOCKQUOTE>
+<H3 STYLE="margin-left: 0.2in; margin-top: 0in">Enhancements and
+changes to existing functionality</H3>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">assoc</FONT>
+– now handles nested multilevel associations.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">count</FONT>
+– has been rewritten to be many times faster on Unix and Unix like
+OSs.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">dup</FONT>
+- without the repetition parameter will assume 2.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">find</FONT>
+– when used with a comparison functor puts the last found
+expression into <FONT FACE="Lucida Sans Regular, sans-serif">$0.</FONT></BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">find-all</FONT>
+– can now be used on lists too.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">get-url,
+post-url, put-url, delete-url</FONT> - have been extended and
+reworked to return more error information as supplied by the server
+and have improved debugging support.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">last,
+nth, nth-set, set-nth</FONT> – now have last element speed
+optimization as previously only present in <FONT FACE="Lucida Sans Regular, sans-serif">push</FONT>
+and <FONT FACE="Lucida Sans Regular, sans-serif">pop</FONT>.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">nth,
+set-nth, nth-set, push, pop</FONT> – when used on lists, indices
+overshooting the beginning or the end of the list now will cause an
+error to be thrown. Before, out of range indices would pick the first
+or last element in a list. The new behavior is consistent with the
+behavior of indexing arrays.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">pack</FONT>
+– now can take lists for data.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">process</FONT>
+– this reworked function now creates the new process without the
+previous time and memory overhead on Unix. No extra newLISP fork will
+be created to launch the new process. In most cases the full path
+must now be given for the command in <FONT FACE="Lucida Sans Regular, sans-serif">process</FONT>.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">rand</FONT>
+– integer random number generation with better statistical quality
+on Win32.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">ref</FONT>
+– when used with a comparison function puts the last found
+expression into <FONT FACE="Lucida Sans Regular, sans-serif">$0.</FONT></BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">set-assoc</FONT>
+– renamed <FONT FACE="Lucida Sans Regular, sans-serif">replace-assoc</FONT>
+changes an association, handles nested associations.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">set-nth,
+nth-set </FONT>– now return the old list or value when the second
+argument is not present. They behave now like <FONT FACE="Lucida Sans Regular, sans-serif">set</FONT>
+without the value argument. Before both, <FONT FACE="Lucida Sans Regular, sans-serif">set-nth</FONT>
+and <FONT FACE="Lucida Sans Regular, sans-serif">nth-set </FONT>returned
+<FONT FACE="Lucida Sans Regular, sans-serif">nil</FONT> when the
+value argument was missing.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in"><FONT FACE="Lucida Sans Regular, sans-serif">signal</FONT>
+– the <FONT FACE="Lucida Sans Regular, sans-serif">nil</FONT> flag
+now specifies <FONT FACE="Lucida Sans Regular, sans-serif">SIG_IGN
+</FONT>and the <FONT FACE="Lucida Sans Regular, sans-serif">true</FONT>
+flag <FONT FACE="Lucida Sans Regular, sans-serif">SIG_DFL</FONT>.
+Before 9.3 <FONT FACE="Lucida Sans Regular, sans-serif">nil</FONT>
+would specify an empty newLISP handler and the <FONT FACE="Lucida Sans Regular, sans-serif">true</FONT>
+flag was not available. This allows to reset the signal handler for a
+specific signal to its OS default.</BLOCKQUOTE>
+<H3 STYLE="margin-left: 0.2in">Other additions and changes</H3>
+<P STYLE="margin-left: 0.2in"><FONT FACE="Lucida Sans Regular, sans-serif">newlisp.vim</FONT>
+– the syntax highlighting and editing control file for the <A HREF="http://www.vim.org/">VIM</A>
+text editor has been much improved by <A HREF="http://wagner.pp.ru/~slobin/"><I>Cyril
+Slobin</I></A>.</P>
+<P STYLE="margin-left: 0.2in"><FONT FACE="Lucida Sans Regular, sans-serif">crypto.lsp</FONT>
+– this module has been expanded to offer <FONT FACE="Lucida Sans Regular, sans-serif">hmac</FONT>
+encryption using MD5 or SHA-1 hashing.</P>
+<P STYLE="margin-left: 0.2in"><FONT FACE="Lucida Sans Regular, sans-serif">amazon.lsp</FONT>
+– this new module interfaces to the Amazon Web Services, S3 storage
+API.</P>
+<P STYLE="margin-left: 0.2in"><FONT FACE="Lucida Sans Regular, sans-serif">newlispdoc</FONT>
+– this utility has been improved to handle indices and links to
+external <A HREF="http://newlisp.org/modules">module collections</A>.</P>
+<P STYLE="margin-left: 0.2in"><FONT FACE="Lucida Sans Regular, sans-serif">wordnet.lsp</FONT>
+- this new module interfaces to the WordNet 3.o datebase</P>
+<P STYLE="margin-left: 0.2in">The amazon.lsp and wordet.lsp modules
+are not part of the distribution, but can be accessed in the new
+<A HREF="http://newlisp.org/modules">http://newlisp.org/modules</A>
+section.</P>
+<H3 STYLE="margin-left: 0.2in; margin-top: 0in">Bug fixes and
+documentation corrections</H3>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in">Many bugs
+have been fixed in this release stabilizing some of the new features
+in the previous 9.2 release and fixing older previously undetected
+bugs. For more detail on bug fixes and changes see the CHANGES file
+in the source distribution of newLISP v.9.3.0 in
+newlisp-9.3.0/doc/CHANGES. This file details fixes changes for the
+development versions between 9.2.0 and to 9.3.0.</BLOCKQUOTE>
+<BLOCKQUOTE STYLE="margin-left: 0.2in; margin-right: 0in; text-align: center">
+&sect;</BLOCKQUOTE>
+</BODY>
+</HTML>
diff --git a/doc/newLISPdoc.html b/doc/newLISPdoc.html
new file mode 100644
index 0000000..d2c25ee
--- /dev/null
+++ b/doc/newLISPdoc.html
@@ -0,0 +1,314 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+<META http-equiv="Content-Type" content="text/html; charset=utf-8">
+<title>newLISPdoc</title>
+
+<style type="text/css" media="screen">
+<!--
+span.arw {
+	color:#666666;
+	font-size: 100%;
+	}
+	
+body, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+	line-height: 115%;
+ 	}
+
+h1 {
+	font-family: Georgia, Times New Roman, Times, serif;
+   	font-size: 130%;
+	}
+
+h2, h3, h4 {
+	font-family: Georgia, Times New Roman, Times, serif;
+   	font-size: 110%;
+	}
+
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+   	font-size: 100%;
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	font-size: 100%;
+	}
+-->
+</style>
+</head>
+<body style="margin: 20px;" text="#222222" bgcolor="#FFFFFF" 
+			link="#376592" vlink="#551A8B" alink="#ffAA28">
+
+<center>
+<h1>newLISPdoc - the newLISP documentation program</h1>
+<font size="-1">last edited 2008-02-27</font>
+</center>
+
+<p>Comments in newLISP source files can be converted
+to HTML documentation using only a few tags in comments. The newLISPdoc system 
+is designed to use a minimum of tags and leave the tagged comments still readable.</p>
+
+<p>newLISPdoc also generates an index page for all newLISP source files
+generated.</p>
+
+<p>See here for the <a href="http://newlisp.org/syntax.cgi?code/newlispdoc.txt">source of newLISPdoc</a> .
+The program and this documentation are also part of the
+source distribution of newLISP since version 9.0. Since newLISP version 9.1 syntax
+highlighting is built into <tt>newlispdoc</tt> which is installed
+in the same directory as the main newLISP executable program. The script
+<tt>syntax.cgi</tt> is still available for web site installations, but is not
+required anymore for <tt>newlispdoc</tt>.</p>
+
+<h3>Usage</h3>
+<p>From within the directory where the modules are, execute with all module filenames 
+to process on the commandline. For example to process the files <tt>mysql.lsp</tt>, 
+<tt>odbc.lsp</tt> and <tt>sqlite3.lsp</tt> do:</p>
+
+<blockquote><pre>
+newlispdoc mysql.lsp odbc.lsp sqlite.lsp
+</pre></blockquote>
+
+<p>Or on Win32:</p>
+
+<blockquote><pre>
+newlisp newlispdoc mysql.lsp odbc.lsp sqlite.lsp
+</pre></blockquote>
+
+<p>This will generate <tt>index.html</tt>, <tt>mysql.lsp.html</tt>, <tt>odbc.lsp.html</tt>
+and <tt>sqlite.lsp.html</tt> all in the same directory, where the command was executed.
+ The page <tt>index.html</tt> contains links to all other pages.</p>
+
+<p>The command line flag <tt>-s</tt> can be supplied to additionally
+generate syntax highlighted HTML versions of the source files and put a link
+to the highlighted version of the source file on the documentation page:</p>
+
+<blockquote><pre>
+newlispdoc -s mysql.lsp odbc.lsp sqlite.lsp
+newlispdoc -s *.lsp
+</pre></blockquote>
+
+<p>Or on Win32:</p>
+    
+<blockquote><pre>
+newlisp newlispdoc -s mysql.lsp odbc.lsp sqlite.lsp
+</pre></blockquote>
+
+<p>Since version 1.3 of newLISPdoc a file containing URLs of source file locations
+can be specified. This allows indexing and documenting of newLISP source code distributed
+on different sites:</p>
+
+<blockquote><pre>
+newlispdoc -url file-with-urls.txt 
+newlispdoc -s -url file-with-urls.txt 
+</pre></blockquote>
+
+<p>Or on Win32:</p>
+
+<blockquote><pre>
+newlisp newlispdoc -url file-with-urls.txt 
+newlisp newlispdoc -s -url file-with-urls.txt 
+</pre></blockquote>
+
+<p><tt>http://</tt> and <tt>file://</tt> URLs can be used. Like with individual files,
+the <tt>-s</tt> switch can be specified to generate also syntax highlighted source files.
+A URL file contains one URL per line. No other information is allowed in the file. The
+following is a sample URL file:</p>
+
+<blockquote><pre>
+http://asite.com/code/afile.lsp
+http://othersite.org/somefile.lsp
+file:///usr/home/joe/program.lsp
+</pre></blockquote>
+
+<p>The last line shows a file URL from the local filesystem.</p>
+
+<p>All generated files will be written to the current directory.</p>
+
+<h3>Tags</h3>
+
+<p>The following tags start at the beginning of a line with
+2 semicolons and one space before the tag:</p>
+
+<blockquote><pre>
+;; @module one word for module name
+;; @index Title and URL for index page
+;; @description one line description of the module
+;; @location the original URL location of the source file
+;; @version one line version info
+;; @author one line for author info
+;; @syntax one line syntax pattern
+;; @param name description on one line
+;; @return description on one line
+;; @example multiline code example starting on next line
+</pre></blockquote>
+
+<p>The only required tag is either the <tt>@module</tt> tag or alternatively
+the <tt>@index</tt> tag. If neither one tag is present in the file, it will 
+not be processed. All other tags are optional. Only lines starting with ;; 
+(2 semicolons) are processed. Program comment text which should not appear 
+in the documentation should start with only one semicolon.</p>
+
+<p>The one line description of the <tt>@description</tt> tag will be put under the module
+name on the index and module doc page. This and the <tt>@location</tt> where added in
+June 2007, and are not part of the newlispdoc program in the newLISP v. 9.1 release.</p>
+
+<p>A function may have multiple <tt>@syntax</tt> tags each on consecutive lines.</tt>
+
+<p>The following is the only tag, which can be embedded anywhere in
+the text. Between the tag link specificaton and description is exactly on
+space:</p>
+
+<blockquote><pre>
+@link link description
+</pre></blockquote>
+
+<p>All words between <tt>&lt;...&gt;</tt> angle braces are displayed in italic. 
+Internally newLISPdoc uses <tt>&lt;em&gt;,&lt;/em&gt;</tt> tags for formatting. They
+should be used for parameter specs after the @param tag and in text referring
+to those parameters..</p>
+
+<p>All words between single quotes <tt>' ... '</tt> are printed in monospace.
+Internally newLISPdoc uses <tt>&lt;tt&gt;,&lt;/tt&gt;</tt> tags for formatting.</p>
+
+<p>All other lines starting with 2 semicolons contain descriptive
+text. An empty line with only 2 semicolons at the beginning
+is a break between paragraphs of text.</p>
+
+<p>Lines not starting with 2 semicolons are ignored by newLISPdoc. This
+allows doing code comments with just one semicolon.</p>
+
+<p>If more formatting is required than what is offered by newLISPdoc, the
+following simple HTML tags and their closing forms may also be used: 
+<tt>&lt;h1&gt;</tt>,<tt>&lt;h2&gt;</tt>,<tt>&lt;h3&gt;</tt>,<tt>&lt;h4&gt;</tt>,
+<tt>&lt;i&gt;</tt>,<tt>&lt;em&gt;</tt>,<tt>&lt;b&gt;</tt>,<tt>&lt;tt&gt;</tt>,<tt>&lt;p&gt;</tt>,
+<tt>&lt;br&gt;</tt>,<tt>&lt;pre&gt;</tt>,<tt>&lt;center&gt;</tt>,<tt>&lt;blockquote&gt;</tt>
+and <tt>&lt;hr&gt;</tt>.</p>
+<h3>Linking to other module collections</h3>
+<p>newLISPdoc generates and index page for all modules documented. A special tag <tt>@index</tt>
+can be used to show a link on the index page to an index of other module collections. This way 
+multilevel indices of modules can be created. To display a link to another module collection
+ on the index page, create a file containing a <tt>@index</tt> and a <tt>@descrption</tt> link:</p>
+
+<blockquote><pre>
+; - other-collection.txt -
+;; @index OtherCollection http://example.com/modules
+;; @description Modules from OtherCollection
+</pre></blockquote>
+
+<p>Use one or more of these files on the newLISPdoc command line as any other 
+source file:</p>
+
+<blockquote><pre>
+newlispdoc -s other-collection.txt *.lsp
+</pre></blockquote>
+
+<p>This will show the index entry for OtherCollection on the module index before listing
+all modules in <tt>*.lsp</tt>.</p>
+
+<hr>
+
+<a name="source"></a>
+<h3>Examples</h3>
+
+<p>The following is the commented source of and example program
+followed by the pages generated in HTML:</p>
+
+<blockquote><pre>
+;; @module example.lsp
+;; @author John Doe, johndoe@example.com
+;; @version 1.0
+;; 
+;; This module is an example module for the newlispdoc
+;; program, which generates automatic newLISP module
+;; documentation.
+
+
+;; @syntax (example:foo &lt;num-repeat&gt; &lt;str-message&gt;)
+;; @param &lt;num-repeat&gt; The number of times to repeat.
+;; @param &lt;str-message&gt; The messsage string to be printed.
+;; @return Returns the message in &lt;str-message&gt;
+;;
+;; The function 'foo' repeatedly prints a string to 
+;; standard out terminated by a line feed.
+;;
+;; @example
+;; (example:foo 5 "hello world")
+;; =&gt;
+;; "hello world"
+;; "hello world"
+;; "hello world"
+;; "hello world"
+;; "hello world"
+
+(context 'example)
+
+(define (foo n msg)
+	(dotimes (i n)
+		(println msg))
+)
+
+;; See the @link http://example.com/example.lsp source .
+</pre></blockquote>
+
+<p>Below the <tt>example.lsp.html</tt> and <tt>index.html</tt>  page generated:</p>
+
+<hr>
+<a name="example"></a>
+<p><a href="#index">Module index</a></p><h2>Module:&nbsp;example.lsp</h2><b>Author: </b>John Doe, johndoe@example.com<br/>
+<b>Version: </b>1.0<br/>
+<p></p>
+ This module is an example module for the newlispdoc
+ program, which generates automatic newLISP module
+ documentation.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="example_foo"></a><h3>Syntax: (<font color=#CC0000>example:foo</font> <em>num-repeat</em> <em>str-message</em>)</h3>
+<b>parameter: </b><em>num-repeat</em> - The number of times to repeat.<br/>
+<b>parameter: </b><em>str-message</em> - The messsage string to be printed.<br/>
+<p><b>return: </b>Returns the message in <em>str-message</em></p>
+<p></p>
+ The function <tt>foo</tt> repeatedly prints a string to 
+ standard out terminated by a line feed.
+<p></p>
+<p></p><b>example:</b><blockquote><pre>
+ (example:foo 5 "hello world")
+ =&gt;
+ "hello world"
+ "hello world"
+ "hello world"
+ "hello world"
+ "hello world"</pre></blockquote>
+ See the <a href="#source">source</a>.
+<p></p><center>- &part; -</center><br/>
+<center><font face='Arial' size='-2' color='#444444'>
+generated with <a href="http://newlisp.org">newLISP</a>&nbsp;
+and <a href="http://newlisp.org/newLISPdoc.html">newlispdoc</a>
+</font></center>
+</blockquote>
+
+<hr>
+
+<p>Below the index page <tt>index.html</tt> which was generated. When more than one module is
+specified on the command line, the index page will show one link line for
+each module.</p>
+
+<hr>
+
+<a name="index"></a>
+<blockquote>
+<a href="#example"><h2>Module:&nbsp;example.lsp</h2></a>
+<a href="#example_foo">foo</a>&nbsp; &nbsp; 
+<p></p><center>- &part; -</center><br/>
+<center><font face='Arial' size='-2' color='#444444'>
+generated with <a href="http://newlisp.org">newLISP</a>&nbsp;
+and <a href="http://newlisp.org/newLISPdoc.html">newlispdoc</a>
+</font></center>
+</blockquote>
+
+<hr>
+
+</body>
+</html>
diff --git a/doc/newlisp.1 b/doc/newlisp.1
new file mode 100644
index 0000000..1a146ca
--- /dev/null
+++ b/doc/newlisp.1
@@ -0,0 +1,102 @@
+.TH newlisp 1 "January 2008" "version 9.3" "Commandline Parameters"
+.SH NAME
+newlisp \- lisp like programming language
+.SH SYNOPSIS
+.B newlisp
+[\-h] [\-c | \-C | \-http] [\-s stacksize] [\-m max\-mem\-megabyte] [[\-l path\-file | \-L path\-file] [\-p port\-number | \-d port\-number]] [\-w diectory] [lisp\-files ...] [\-e programtext]
+.SH DESCRIPTION
+Invokes newLISP which first loads init.lsp if present. Then one or more options and one or more newLISP source files can be specified. The options and source files are executed in the sequence they appear. For some options is makes sense to have source files loaded first like for the \-p and \-d options. For other options like \-s and \-m it is logical to specify these before the source files to be loaded. If a \-e switch is used the programtext is evaluated and then newlisp exits otherwise evaluation continues interactively (unless an exit occurs during lisp\-file interpretation).
+.SH OPTIONS
+.TP
+\-h
+Display a short help text.
+.TP
+\-c
+Suppress the commandline prompt.
+.TP
+\-C
+Force prompt when running newLISP in pipe I/O mode for Emacs.
+.TP
+\-http
+only accept HTTP commands
+.TP
+\-s stacksize
+Stack size to use when starting newLISP. When no stack size is specified the stack defaults to 1024.
+.TP
+\-m max\-mem\-megabyte
+Limits memory to max\-mem\-megabyte megabytes for LISP cell memory.
+.TP
+lisp\-files
+Load and evaluate the specified lisp source files in sequence. Source files can be specified using URLs. If an (exit) is executed by one of the source files then newlisp exits and all processing ceases.
+.TP
+\-e programtext
+Programtext is an expression enclosed in quotation marks which is evaluated and the result printed to standard out device (STDOUT). In most UNIX system shells apostrophes can also be used to delimit the expression. newLISP exits after evaluation of programtext is complete.
+.TP
+\-w directory
+Directory is the start up directory for newLISP. Any file reference in a program will refer to this directory by default as the current directory. This can be used to define a web root directory when in server mode.
+.TP
+\-l \-L path\-file
+Log network connections and newLISP I/O to the file in path\-file. \-l will only log network connections or commandline input or net\-eval requests. \-L will additionally log HTTP requests and newLISP output from commandline and net\-eval input.
+.TP
+\-p port\-number
+Listen for commands on a TCP/IP socket connection. In this case standard I/O is redirected to the port specified in the \-p option. Any specified lisp\-files will be loaded the first time a connection is made, that is, before text is accepted from the port connection.
+.TP
+\-d port\-number
+Run in demon mode. As for the \-p option, but newLISP does not exit after a closed connection and stays in memory listening for a new connection.
+
+.SH EXAMPLES
+.TP
+Start interactive session
+.B newlisp
+.PP
+.TP
+Excute a program
+.B newlisp myprog.lsp
+.PP
+.TP
+Excute a remote program
+.B newlisp http://newlisp.org/example.lsp
+.PP
+.TP
+Add 3 and 4, 7 prints on standard output
+.B newlisp
+\-e "(+ 3 4)"
+.PP
+.TP
+newLISP is started as a server (the & indicates to LINUX to run the process in the background) and can be connected to with telnet by issuing telnet localhost 1234
+.B newlisp
+\-p 1234 &
+.PP
+.TP
+newLISP is started as a server for another newlisp process connecting with the net\-eval function or HTTP requests
+.B newlisp
+\-c \-d 4711 &
+.PP
+.TP
+newLISP is started as a server handling HTTP requests only. Connections are logged to the file /usr/home/www/log.txt
+.B newlisp
+\-l /usr/home/www/log.txt \-http \-d 8080 &
+.PP
+.TP
+newLISP is started as a server handling HTTP requests and defining the startup/web root directory
+.B newlisp
+\-http \-d 8080 \-w /usr/home/www/httpdocs &
+.TP
+When accepting HTTP commands a file httpd.conf can be loaded, which will preprocess the path\-name in the HTTP request
+.B newlisp
+httpd.conf \-http \-d 8080 \-w /usr/home/www/httpdocs &
+.PP
+If the file httpd.conf contains:
+
+(define (httpd\-conf path\-name)
+    (if (ends\-with path\-name ".exe") "errorpage.html" path\-name))
+
+then all files ending in .exe will translate the request in to a request for an error page, else the original request string is returned.
+.PP
+.SH EXIT STATUS
+newLISP returns a zero exit status for normal termination unless an exit command specifies a code to be returned. Non zero is returned in case of abnormal exit.
+.SH AUTHOR
+Lutz Mueller <lutz@nuevatec.com>
+
+http://newlisp.org/ \- the newLISP home page
+
diff --git a/doc/newlisp_index.html b/doc/newlisp_index.html
new file mode 100644
index 0000000..b86e6c6
--- /dev/null
+++ b/doc/newlisp_index.html
@@ -0,0 +1,510 @@
+<!doctype html public "-//w3c//dtd html 4.0 transitional//en">
+<html>
+<head>
+   <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+   <meta name="author" content="Lutz Mueller">
+   <meta name="keywords" content="newLISP LISP SCHEME manual reference help artificial intelligence AI NUEVATEC">
+   <meta name="description" content="newLISP Users Manual and Reference Index">
+   <title>newLISP Manual and Reference Index</title>
+
+<style type="text/css" media="screen">
+<!--
+
+body, h1, h2, h3, h4, p {
+   font-family: Georgia, Verdana, Arial, Helvetica, sanserif;
+ }
+
+pre, tt {
+   font-family: Lucida Console, Courier;
+}
+
+-->
+</style>
+
+</head>
+<body text="#000000" bgcolor="#FFFFFF" link="#376590" vlink="#551A8B" alink="#ffAA28">
+<h3>Functions in alphabetical order</h3>
+
+<b>
+<a href="newlisp_manual.html#shell" target="body">!</a>&nbsp;
+<a href="newlisp_manual.html#arithmetic" target="body">+-*/%</a>&nbsp;
+<a href="newlisp_manual.html#abs" target="body">Ab</a>&nbsp;
+<a href="newlisp_manual.html#append" target="body">Ap</a>&nbsp;
+<a href="newlisp_manual.html#base64-dec" target="body">B</a>&nbsp; 
+<a href="newlisp_manual.html#case" target="body">Ca</a>&nbsp;
+<a href="newlisp_manual.html#cons" target="body">Co</a>&nbsp;
+<a href="newlisp_manual.html#date" target="body">Da</a>&nbsp;
+<a href="newlisp_manual.html#difference" target="body">Di</a>&nbsp;
+<a href="newlisp_manual.html#emptyp" target="body">Em</a>&nbsp; 
+<a href="newlisp_manual.html#eval" target="body">Ev</a>&nbsp;
+<a href="newlisp_manual.html#factor" target="body">Fa</a>&nbsp; 
+<a href="newlisp_manual.html#fn" target="body">Fn</a>&nbsp;
+<a href="newlisp_manual.html#gammai" target="body">G</a>&nbsp;
+<a href="newlisp_manual.html#if" target="body">I</a>&nbsp; 
+<a href="newlisp_manual.html#join" target="body">J</a>&nbsp; 
+<a href="newlisp_manual.html#lambda" target="body">La</a>&nbsp;
+<a href="newlisp_manual.html#list" target="body">Li</a>&nbsp;
+<a href="newlisp_manual.html#macrop" target="body">Ma</a>&nbsp; 
+<a href="newlisp_manual.html#member" target="body">Me</a>&nbsp;
+<a href="newlisp_manual.html#name" target="body">Na</a> &nbsp; 
+<a href="newlisp_manual.html#net-accept" target="body">Ne</a>&nbsp;
+<a href="newlisp_manual.html#not" target="body">No</a>&nbsp;
+<a href="newlisp_manual.html#open" target="body">O</a>&nbsp;
+<a href="newlisp_manual.html#pack" target="body">Pa</a>&nbsp; 
+<a href="newlisp_manual.html#pretty-print" target="body">Pr</a>&nbsp;
+<a href="newlisp_manual.html#quote" target="body">Q</a>&nbsp; 
+<a href="newlisp_manual.html#rand" target="body">Ra</a>&nbsp;
+<a href="newlisp_manual.html#regex" target="body">Reg</a>&nbsp;
+<a href="newlisp_manual.html#save" target="body">Sa</a>&nbsp; 
+<a href="newlisp_manual.html#share" target="body">Sh</a>&nbsp;
+<a href="newlisp_manual.html#starts-with" target="body">St</a>&nbsp;
+<a href="newlisp_manual.html#tan" target="body">T</a>&nbsp; 
+<a href="newlisp_manual.html#unicode" target="body">U</a>&nbsp;
+<a href="newlisp_manual.html#wait-pid" target="body">W</a>&nbsp;
+<a href="newlisp_manual.html#xml-error" target="body">X</a>&nbsp;
+</b>
+
+
+<h3>List processing, flow control and integer arithmetic</h3>
+
+<a href="newlisp_manual.html#arithmetic" target="body">+, -, *, /,%</a><br />
+<a href="newlisp_manual.html#logical" target="body">&lt;, >, =,</a><br />
+<a href="newlisp_manual.html#logical" target="body">&lt;=, >=, !=</a><br />
+<a href="newlisp_manual.html#colon" target="body">:</a><br />
+<a href="newlisp_manual.html#and" target="body">and</a><br />
+<a href="newlisp_manual.html#append" target="body">append</a><br />
+<a href="newlisp_manual.html#apply" target="body">apply</a><br />
+<a href="newlisp_manual.html#args" target="body">args</a><br />
+<a href="newlisp_manual.html#assoc" target="body">assoc</a><br />
+<a href="newlisp_manual.html#assoc-set" target="body">assoc-set</a><br />
+<a href="newlisp_manual.html#begin" target="body">begin</a><br />
+<a href="newlisp_manual.html#bind" target="body">bind</a><br />
+<a href="newlisp_manual.html#case" target="body">case</a><br />
+<a href="newlisp_manual.html#catch" target="body">catch</a><br />
+<a href="newlisp_manual.html#chop" target="body">chop</a><br />
+<a href="newlisp_manual.html#clean" target="body">clean</a><br />
+<a href="newlisp_manual.html#cond" target="body">cond</a><br />
+<a href="newlisp_manual.html#cons" target="body">cons</a><br />
+<a href="newlisp_manual.html#constant" target="body">constant</a><br />
+<a href="newlisp_manual.html#count" target="body">count</a><br />
+<a href="newlisp_manual.html#curry" target="body">curry</a><br />
+<a href="newlisp_manual.html#define" target="body">define</a><br />
+<a href="newlisp_manual.html#define-macro" target="body">define-macro</a><br />
+<a href="newlisp_manual.html#def-new" target="body">def-new</a><br />
+<a href="newlisp_manual.html#difference" target="body">difference</a><br />
+<a href="newlisp_manual.html#doargs" target="body">doargs</a><br />
+<a href="newlisp_manual.html#dolist" target="body">dolist</a><br />
+<a href="newlisp_manual.html#dostring" target="body">dostring</a><br />
+<a href="newlisp_manual.html#dotimes" target="body">dotimes</a><br />
+<a href="newlisp_manual.html#dotree" target="body">dotree</a><br />
+<a href="newlisp_manual.html#do-until" target="body">do-until</a><br />
+<a href="newlisp_manual.html#do-while" target="body">do-while</a><br />
+<a href="newlisp_manual.html#dup" target="body">dup</a><br />
+<a href="newlisp_manual.html#ends-with" target="body">ends-with</a><br />
+<a href="newlisp_manual.html#exists" target="body">exists</a><br />
+<a href="newlisp_manual.html#eval" target="body">eval</a><br />
+<a href="newlisp_manual.html#expand" target="body">expand</a><br />
+<a href="newlisp_manual.html#first" target="body">first</a><br />
+<a href="newlisp_manual.html#filter" target="body">filter</a><br />
+<a href="newlisp_manual.html#find" target="body">find</a><br />
+<a href="newlisp_manual.html#find-all" target="body">find-all</a><br />
+<a href="newlisp_manual.html#flat" target="body">flat</a><br />
+<a href="newlisp_manual.html#fn" target="body">fn</a><br />
+<a href="newlisp_manual.html#for" target="body">for</a><br />
+<a href="newlisp_manual.html#for-all" target="body">for-all</a><br />
+<a href="newlisp_manual.html#if" target="body">if</a><br />
+<a href="newlisp_manual.html#index" target="body">index</a><br />
+<a href="newlisp_manual.html#intersect" target="body">intersect</a><br />
+<a href="newlisp_manual.html#lambda" target="body">lambda</a><br />
+<a href="newlisp_manual.html#lambda-macro" target="body">lambda-macro</a><br />
+<a href="newlisp_manual.html#last" target="body">last</a><br />
+<a href="newlisp_manual.html#length" target="body">length</a><br />
+<a href="newlisp_manual.html#let" target="body">let</a><br />
+<a href="newlisp_manual.html#letex" target="body">letex</a><br />
+<a href="newlisp_manual.html#letn" target="body">letn</a><br />
+<a href="newlisp_manual.html#list" target="body">list</a><br />
+<a href="newlisp_manual.html#local" target="body">local</a><br />
+<a href="newlisp_manual.html#lookup" target="body">lookup</a><br />
+<a href="newlisp_manual.html#map" target="body">map</a><br />
+<a href="newlisp_manual.html#match" target="body">match</a><br />
+<a href="newlisp_manual.html#member" target="body">member</a><br />
+<a href="newlisp_manual.html#not" target="body">not</a><br />
+<a href="newlisp_manual.html#nth" target="body">nth</a><br />
+<a href="newlisp_manual.html#nth-set" target="body">nth-set</a><br />
+<a href="newlisp_manual.html#or" target="body">or</a><br />
+<a href="newlisp_manual.html#pop" target="body">pop</a><br />
+<a href="newlisp_manual.html#pop-assoc" target="body">pop-assoc</a><br />
+<a href="newlisp_manual.html#push" target="body">push</a><br />
+<a href="newlisp_manual.html#quote" target="body">quote</a><br />
+<a href="newlisp_manual.html#ref" target="body">ref</a><br />
+<a href="newlisp_manual.html#ref-all" target="body">ref-all</a><br />
+<a href="newlisp_manual.html#ref-set" target="body">ref-set</a><br />
+<a href="newlisp_manual.html#rest" target="body">rest</a><br />
+<a href="newlisp_manual.html#replace" target="body">replace</a><br />
+<a href="newlisp_manual.html#set-assoc" target="body">replace-assoc</a><br />
+<a href="newlisp_manual.html#reverse" target="body">reverse</a><br />
+<a href="newlisp_manual.html#rotate" target="body">rotate</a><br />
+<a href="newlisp_manual.html#select" target="body">select</a><br />
+<a href="newlisp_manual.html#set" target="body">set</a><br />
+<a href="newlisp_manual.html#setq" target="body">setq</a><br />
+<a href="newlisp_manual.html#set-assoc" target="body">set-assoc</a><br />
+<a href="newlisp_manual.html#set-nth" target="body">set-nth</a><br />
+<a href="newlisp_manual.html#set-ref" target="body">set-ref</a><br />
+<a href="newlisp_manual.html#set-ref-all" target="body">set-ref-all</a><br />
+<a href="newlisp_manual.html#silent" target="body">silent</a><br />
+<a href="newlisp_manual.html#slice" target="body">slice</a><br />
+<a href="newlisp_manual.html#sort" target="body">sort</a><br />
+<a href="newlisp_manual.html#starts-with" target="body">starts-with</a><br />
+<a href="newlisp_manual.html#swap" target="body">swap</a><br />
+<a href="newlisp_manual.html#unify" target="body">unify</a><br />
+<a href="newlisp_manual.html#unique" target="body">unique</a><br />
+<a href="newlisp_manual.html#unless" target="body">unless</a><br />
+<a href="newlisp_manual.html#until" target="body">until</a><br />
+<a href="newlisp_manual.html#when" target="body">when</a><br />
+<a href="newlisp_manual.html#while" target="body">while</a><br />
+
+<h3>String and conversion functions</h3>
+
+<a href="newlisp_manual.html#address" target="body">address</a><br />
+<a href="newlisp_manual.html#append" target="body">append</a><br />
+<a href="newlisp_manual.html#char" target="body">char</a><br />
+<a href="newlisp_manual.html#chop" target="body">chop</a><br />
+<a href="newlisp_manual.html#dup" target="body">dup</a><br />
+<a href="newlisp_manual.html#ends-with" target="body">ends-with</a><br />
+<a href="newlisp_manual.html#encrypt" target="body">encrypt</a><br />
+<a href="newlisp_manual.html#eval-string" target="body">eval-string</a><br />
+<a href="newlisp_manual.html#explode" target="body">explode</a><br />
+<a href="newlisp_manual.html#find" target="body">find</a><br />
+<a href="newlisp_manual.html#first" target="body">first</a><br />
+<a href="newlisp_manual.html#float" target="body">float</a><br />
+<a href="newlisp_manual.html#format" target="body">format</a><br />
+<a href="newlisp_manual.html#get-char" target="body">get-char</a><br />
+<a href="newlisp_manual.html#get-float" target="body">get-float</a><br />
+<a href="newlisp_manual.html#get-int" target="body">get-int</a><br />
+<a href="newlisp_manual.html#get-long" target="body">get-long</a><br />
+<a href="newlisp_manual.html#get-string" target="body">get-string</a><br />
+<a href="newlisp_manual.html#int" target="body">int</a><br />
+<a href="newlisp_manual.html#join" target="body">join</a><br />
+<a href="newlisp_manual.html#last" target="body">last</a><br />
+<a href="newlisp_manual.html#lower-case" target="body">lower-case</a><br />
+<a href="newlisp_manual.html#member" target="body">member</a><br />
+<a href="newlisp_manual.html#name" target="body">name</a><br />
+<a href="newlisp_manual.html#nth" target="body">nth</a><br />
+<a href="newlisp_manual.html#nth-set" target="body">nth-set</a><br/>
+<a href="newlisp_manual.html#pack" target="body">pack</a><br />
+<a href="newlisp_manual.html#parse" target="body">parse</a><br />
+<a href="newlisp_manual.html#pop" target="body">pop</a><br />
+<a href="newlisp_manual.html#push" target="body">push</a><br />
+<a href="newlisp_manual.html#regex" target="body">regex</a><br />
+<a href="newlisp_manual.html#replace" target="body">replace</a><br />
+<a href="newlisp_manual.html#rest" target="body">rest</a><br />
+<a href="newlisp_manual.html#reverse" target="body">reverse</a><br />
+<a href="newlisp_manual.html#rotate" target="body">rotate</a><br />
+<a href="newlisp_manual.html#select" target="body">select</a><br />
+<a href="newlisp_manual.html#set-nth" target="body">set-nth</a><br/>
+<a href="newlisp_manual.html#slice" target="body">slice</a><br />
+<a href="newlisp_manual.html#source" target="body">source</a><br/>
+<a href="newlisp_manual.html#starts-with" target="body">starts-with</a><br />
+<a href="newlisp_manual.html#string" target="body">string</a><br />
+<a href="newlisp_manual.html#sym" target="body">sym</a><br />
+<a href="newlisp_manual.html#title-case" target="body">title-case</a><br />
+<a href="newlisp_manual.html#trim" target="body">trim</a><br />
+<a href="newlisp_manual.html#unicode" target="body">unicode</a><br />
+<a href="newlisp_manual.html#unpack" target="body">unpack</a><br />
+<a href="newlisp_manual.html#upper-case" target="body">upper-case</a><br />
+<a href="newlisp_manual.html#utf8" target="body">utf8</a><br />
+<a href="newlisp_manual.html#utf8len" target="body">utf8len</a><br />
+
+<h3>Floating point math and special functions</h3>
+
+<a href="newlisp_manual.html#abs" target="body">abs</a><br />
+<a href="newlisp_manual.html#acos" target="body">acos</a><br />
+<a href="newlisp_manual.html#acosh" target="body">acosh</a><br />
+<a href="newlisp_manual.html#add" target="body">add</a><br />
+<a href="newlisp_manual.html#asin" target="body">asin</a><br />
+<a href="newlisp_manual.html#asinh" target="body">asinh</a><br />
+<a href="newlisp_manual.html#atan" target="body">atan</a><br />
+<a href="newlisp_manual.html#atanh" target="body">atanh</a><br />
+<a href="newlisp_manual.html#atan2" target="body">atan2</a><br />
+<a href="newlisp_manual.html#beta" target="body">beta</a><br />
+<a href="newlisp_manual.html#betai" target="body">betai</a><br />
+<a href="newlisp_manual.html#binomial" target="body">binomial</a><br />
+<a href="newlisp_manual.html#ceil" target="body">ceil</a><br />
+<a href="newlisp_manual.html#cos" target="body">cos</a><br />
+<a href="newlisp_manual.html#cosh" target="body">cosh</a><br />
+<a href="newlisp_manual.html#crc32" target="body">crc32</a><br />
+<a href="newlisp_manual.html#crit-chi2" target="body">crit-chi2</a><br />
+<a href="newlisp_manual.html#crit-z" target="body">crit-z</a><br />
+<a href="newlisp_manual.html#dec" target="body">dec</a><br />
+<a href="newlisp_manual.html#div" target="body">div</a><br />
+<a href="newlisp_manual.html#erf" target="body">erf</a><br />
+<a href="newlisp_manual.html#exp" target="body">exp</a><br />
+<a href="newlisp_manual.html#factor" target="body">factor</a><br />
+<a href="newlisp_manual.html#fft" target="body">fft</a><br />
+<a href="newlisp_manual.html#floor" target="body">floor</a><br />
+<a href="newlisp_manual.html#flt" target="body">flt</a><br />
+<a href="newlisp_manual.html#gammai" target="body">gammai</a><br />
+<a href="newlisp_manual.html#gammaln" target="body">atan</a><br />
+<a href="newlisp_manual.html#gcd" target="body">gcd</a><br />
+<a href="newlisp_manual.html#ifft" target="body">ifft</a><br />
+<a href="newlisp_manual.html#inc" target="body">inc</a><br />
+<a href="newlisp_manual.html#log" target="body">log</a><br />
+<a href="newlisp_manual.html#min" target="body">min</a><br />
+<a href="newlisp_manual.html#max" target="body">max</a><br />
+<a href="newlisp_manual.html#mod" target="body">mod</a><br />
+<a href="newlisp_manual.html#mul" target="body">mul</a><br />
+<a href="newlisp_manual.html#pow" target="body">pow</a><br />
+<a href="newlisp_manual.html#round" target="body">round</a><br />
+<a href="newlisp_manual.html#sequence" target="body">sequence</a><br />
+<a href="newlisp_manual.html#series" target="body">series</a><br />
+<a href="newlisp_manual.html#sgn" target="body">sgn</a><br />
+<a href="newlisp_manual.html#sin" target="body">sin</a><br />
+<a href="newlisp_manual.html#sinh" target="body">sinh</a><br />
+<a href="newlisp_manual.html#sqrt" target="body">sqrt</a><br />
+<a href="newlisp_manual.html#sub" target="body">sub</a><br />
+<a href="newlisp_manual.html#tan" target="body">tan</a><br />
+<a href="newlisp_manual.html#tanh" target="body">tanh</a><br />
+
+<h3>Matrix functions</h3>
+
+<a href="newlisp_manual.html#det" target="body">det</a><br />
+<a href="newlisp_manual.html#invert" target="body">invert</a><br />
+<a href="newlisp_manual.html#mat" target="body">mat</a><br />
+<a href="newlisp_manual.html#multiply" target="body">multiply</a><br />
+<a href="newlisp_manual.html#transpose" target="body">transpose</a><br />
+
+<h3>Array functions</h3>
+
+<a href="newlisp_manual.html#append" target="body">append</a><br/>
+<a href="newlisp_manual.html#array" target="body">array</a><br/>
+<a href="newlisp_manual.html#array-list" target="body">array-list</a><br/>
+<a href="newlisp_manual.html#arrayp" target="body">array?</a><br/>
+<a href="newlisp_manual.html#det" target="body">det</a><br/>
+<a href="newlisp_manual.html#first" target="body">first</a><br/>
+<a href="newlisp_manual.html#invert" target="body">invert</a><br/>
+<a href="newlisp_manual.html#last" target="body">last</a><br/>
+<a href="newlisp_manual.html#mat" target="body">mat</a><br />
+<a href="newlisp_manual.html#multiply" target="body">multiply</a><br/>
+<a href="newlisp_manual.html#nth" target="body">nth</a><br/>
+<a href="newlisp_manual.html#nth-set" target="body">nth-set</a><br/>
+<a href="newlisp_manual.html#rest" target="body">rest</a><br/>
+<a href="newlisp_manual.html#set-nth" target="body">set-nth</a><br/>
+<a href="newlisp_manual.html#transpose" target="body">transpose</a><br/>
+
+<h3>Bit operators</h3>
+
+<a href="newlisp_manual.html#bit_shift" target="body">&lt;&lt;, >></a><br />
+<a href="newlisp_manual.html#bit_and" target="body">&amp;</a><br />
+<a href="newlisp_manual.html#bit_inclusive" target="body">|</a><br />
+<a href="newlisp_manual.html#bit_exclusive" target="body">^</a><br />
+<a href="newlisp_manual.html#bit_not" target="body">~</a><br />
+
+<h3>Predicates</h3>
+<a href="newlisp_manual.html#arrayp" target="body">array?</a><br />
+<a href="newlisp_manual.html#atomp" target="body">atom?</a><br />
+<a href="newlisp_manual.html#contextp" target="body">context?</a><br />
+<a href="newlisp_manual.html#directoryp" target="body">directory?</a><br />
+<a href="newlisp_manual.html#emptyp" target="body">empty?</a><br />
+<a href="newlisp_manual.html#filep" target="body">file?</a><br />
+<a href="newlisp_manual.html#floatp" target="body">float?</a><br />
+<a href="newlisp_manual.html#globalp" target="body">global?</a><br />
+<a href="newlisp_manual.html#integerp" target="body">integer?</a><br />
+<a href="newlisp_manual.html#lambdap" target="body">lambda?</a><br />
+<a href="newlisp_manual.html#legalp" target="body">legal?</a><br />
+<a href="newlisp_manual.html#listp" target="body">list?</a><br />
+<a href="newlisp_manual.html#macrop" target="body">macro?</a><br />
+<a href="newlisp_manual.html#NaNp" target="body">NaN?</a><br />
+<a href="newlisp_manual.html#nilp" target="body">nil?</a><br />
+<a href="newlisp_manual.html#nullp" target="body">null?</a><br />
+<a href="newlisp_manual.html#numberp" target="body">number?</a><br />
+<a href="newlisp_manual.html#primitivep" target="body">primitive?</a><br />
+<a href="newlisp_manual.html#protectedp" target="body">protected?</a><br />
+<a href="newlisp_manual.html#quotep" target="body">quote?</a><br />
+<a href="newlisp_manual.html#stringp" target="body">string?</a><br />
+<a href="newlisp_manual.html#symbolp" target="body">symbol?</a><br />
+<a href="newlisp_manual.html#truep" target="body">true?</a><br />
+<a href="newlisp_manual.html#zerop" target="body">zero?</a><br />
+
+<h3>Time and date functions</h3>
+ 
+<a href="newlisp_manual.html#date" target="body">date</a><br />
+<a href="newlisp_manual.html#date-value" target="body">date-value</a><br />
+<a href="newlisp_manual.html#parse-date" target="body">parse-date</a><br />
+<a href="newlisp_manual.html#now" target="body">now</a><br />
+<a href="newlisp_manual.html#time" target="body">time</a><br />
+<a href="newlisp_manual.html#time-of-day" target="body">time-of-day</a><br />
+
+<h3>Simulation and modelling math functions</h3>
+
+<a href="newlisp_manual.html#amb" target="body">amb</a><br />
+<a href="newlisp_manual.html#bayes-query" target="body">bayes-query</a><br />
+<a href="newlisp_manual.html#bayes-train" target="body">bayes-train</a><br />
+<a href="newlisp_manual.html#normal" target="body">normal</a><br />
+<a href="newlisp_manual.html#prob-chi2" target="body">prob-chi2</a><br />
+<a href="newlisp_manual.html#prob-z" target="body">prob-z</a><br />
+<a href="newlisp_manual.html#rand" target="body">rand</a><br />
+<a href="newlisp_manual.html#random" target="body">random</a><br />
+<a href="newlisp_manual.html#randomize" target="body">randomize</a><br />
+<a href="newlisp_manual.html#seed" target="body">seed</a><br />
+
+<h3>Pattern recognition</h3>
+
+<a href="newlisp_manual.html#ends-with" target="body">ends-with</a><br />
+<a href="newlisp_manual.html#find" target="body">find</a><br />
+<a href="newlisp_manual.html#find-all" target="body">find-all</a><br />
+<a href="newlisp_manual.html#match" target="body">match</a><br />
+<a href="newlisp_manual.html#parse" target="body">parse</a><br />
+<a href="newlisp_manual.html#regex" target="body">regex</a><br />
+<a href="newlisp_manual.html#replace" target="body">replace</a><br />
+<a href="newlisp_manual.html#search" target="body">search</a><br />
+<a href="newlisp_manual.html#starts-with" target="body">starts-with</a><br />
+<a href="newlisp_manual.html#unify" target="body">unify</a><br />
+
+<h3>Financial math functions</h3>
+ 
+<a href="newlisp_manual.html#fv" target="body">fv</a><br />
+<a href="newlisp_manual.html#irr" target="body">irr</a><br />
+<a href="newlisp_manual.html#nper" target="body">nper</a><br />
+<a href="newlisp_manual.html#npv" target="body">npv</a><br />
+<a href="newlisp_manual.html#pv" target="body">pv</a><br />
+<a href="newlisp_manual.html#pmt" target="body">pmt</a><br />
+
+<h3>Input/output and file operations</h3>
+
+<a href="newlisp_manual.html#append-file" target="body">append-file</a><br />
+<a href="newlisp_manual.html#close" target="body">close</a><br />
+<a href="newlisp_manual.html#command-line" target="body">command-line</a><br />
+<a href="newlisp_manual.html#device" target="body">device</a><br />
+<a href="newlisp_manual.html#exec" target="body">exec</a><br />
+<a href="newlisp_manual.html#load" target="body">load</a><br />
+<a href="newlisp_manual.html#open" target="body">open</a><br />
+<a href="newlisp_manual.html#peek" target="body">peek</a><br />
+<a href="newlisp_manual.html#print" target="body">print</a><br />
+<a href="newlisp_manual.html#println" target="body">println</a><br />
+<a href="newlisp_manual.html#read-buffer" target="body">read-buffer</a><br />
+<a href="newlisp_manual.html#read-char" target="body">read-char</a><br />
+<a href="newlisp_manual.html#read-file" target="body">read-file</a><br />
+<a href="newlisp_manual.html#read-key" target="body">read-key</a><br />
+<a href="newlisp_manual.html#read-line" target="body">read-line</a><br />
+<a href="newlisp_manual.html#save" target="body">save</a><br />
+<a href="newlisp_manual.html#search" target="body">search</a><br />
+<a href="newlisp_manual.html#seek" target="body">seek</a><br />
+<a href="newlisp_manual.html#write-buffer" target="body">write-buffer</a><br />
+<a href="newlisp_manual.html#write-char" target="body">write-char</a><br />
+<a href="newlisp_manual.html#write-file" target="body">write-file</a><br />
+<a href="newlisp_manual.html#write-line" target="body">write-line</a><br />
+
+<h3>Processes, pipes and threads</h3>
+<a href="newlisp_manual.html#shell" target="body">!</a><br />
+<a href="newlisp_manual.html#destroy" target="body">destroy</a><br />
+<a href="newlisp_manual.html#exec" target="body">exec</a><br />
+<a href="newlisp_manual.html#fork" target="body">fork</a><br />
+<a href="newlisp_manual.html#pipe" target="body">pipe</a><br />
+<a href="newlisp_manual.html#process" target="body">process</a><br />
+<a href="newlisp_manual.html#semaphore" target="body">semaphore</a><br />
+<a href="newlisp_manual.html#share" target="body">share</a><br />
+<a href="newlisp_manual.html#wait-pid" target="body">wait-pid</a><br />
+
+<h3>File and directory management</h3>
+
+<a href="newlisp_manual.html#change-dir" target="body">change-dir</a><br />
+<a href="newlisp_manual.html#copy-file" target="body">copy-file</a><br />
+<a href="newlisp_manual.html#delete-file" target="body">delete-file</a><br />
+<a href="newlisp_manual.html#directory" target="body">directory</a><br />
+<a href="newlisp_manual.html#file-info" target="body">file-info</a><br />
+<a href="newlisp_manual.html#make-dir" target="body">make-dir</a><br />
+<a href="newlisp_manual.html#real-path" target="body">real-path</a><br />
+<a href="newlisp_manual.html#remove-dir" target="body">remove-dir</a><br />
+<a href="newlisp_manual.html#rename-file" target="body">rename-file</a><br />
+
+<h3>HTTP network API</h3>
+
+<a href="newlisp_manual.html#base64-enc" target="body">base64-enc</a><br />
+<a href="newlisp_manual.html#base64-dec" target="body">base64-dec</a><br />
+<a href="newlisp_manual.html#delete-url" target="body">delete-url</a><br />
+<a href="newlisp_manual.html#get-url" target="body">get-url</a><br />
+<a href="newlisp_manual.html#put-url" target="body">put-url</a><br />
+<a href="newlisp_manual.html#post-url" target="body">post-url</a><br />
+<a href="newlisp_manual.html#xml-error" target="body">xml-error</a><br />
+<a href="newlisp_manual.html#xml-parse" target="body">xml-parse</a><br />
+<a href="newlisp_manual.html#xml-type-tags" target="body">xml-type-tags</a><br />
+
+<h3>Socket TCP/IP network API</h3>
+
+<a href="newlisp_manual.html#net-accept" target="body">net-accept</a><br />
+<a href="newlisp_manual.html#net-close" target="body">net-close</a><br />
+<a href="newlisp_manual.html#net-connect" target="body">net-connect</a><br />
+<a href="newlisp_manual.html#net-error" target="body">net-error</a><br />
+<a href="newlisp_manual.html#net-eval" target="body">net-eval</a><br />
+<a href="newlisp_manual.html#net-listen" target="body">net-listen</a><br />
+<a href="newlisp_manual.html#net-local" target="body">net-local</a><br />
+<a href="newlisp_manual.html#net-lookup" target="body">net-lookup</a><br />
+<a href="newlisp_manual.html#net-peer" target="body">net-peer</a><br />
+<a href="newlisp_manual.html#net-peek" target="body">net-peek</a><br />
+<a href="newlisp_manual.html#net-ping" target="body">net-ping</a><br />
+<a href="newlisp_manual.html#net-receive" target="body">net-receive</a><br />
+<a href="newlisp_manual.html#net-receive-from" target="body">net-receive-from</a><br />
+<a href="newlisp_manual.html#net-receive-udp" target="body">net-receive-udp</a><br />
+<a href="newlisp_manual.html#net-select" target="body">net-select</a><br />
+<a href="newlisp_manual.html#net-send" target="body">net-send</a><br />
+<a href="newlisp_manual.html#net-send-to" target="body">net-send-to</a><br />
+<a href="newlisp_manual.html#net-send-udp" target="body">net-send-udp</a><br />
+<a href="newlisp_manual.html#net-service" target="body">net-service</a><br />
+<a href="newlisp_manual.html#net-sessions" target="body">net-sessions</a><br />
+
+<h3>System functions</h3>
+
+<a href="newlisp_manual.html#systemsymbol" target="body">$</a><br />
+<a href="newlisp_manual.html#callback" target="body">callback</a><br />
+<a href="newlisp_manual.html#catch" target="body">catch</a><br />
+<a href="newlisp_manual.html#context" target="body">context</a><br />
+<a href="newlisp_manual.html#debug" target="body">debug</a><br />
+<a href="newlisp_manual.html#default" target="body">default</a><br />
+<a href="newlisp_manual.html#delete" target="body">delete</a><br />
+<a href="newlisp_manual.html#env" target="body">env</a><br />
+<a href="newlisp_manual.html#error-event" target="body">error-event</a><br />
+<a href="newlisp_manual.html#error-number" target="body">error-number</a><br />
+<a href="newlisp_manual.html#exit" target="body">exit</a><br />
+<a href="newlisp_manual.html#global" target="body">global</a><br />
+<a href="newlisp_manual.html#import" target="body">import</a><br />
+<a href="newlisp_manual.html#main-args" target="body">main-args</a><br />
+<a href="newlisp_manual.html#new" target="body">new</a><br />
+<a href="newlisp_manual.html#ostype" target="body">ostype</a><br />
+<a href="newlisp_manual.html#pretty-print" target="body">pretty-print</a><br />
+<a href="newlisp_manual.html#reset" target="body">reset</a><br />
+<a href="newlisp_manual.html#set-locale" target="body">set-locale</a><br />
+<a href="newlisp_manual.html#signal" target="body">signal</a><br />
+<a href="newlisp_manual.html#sleep" target="body">sleep</a><br />
+<a href="newlisp_manual.html#sym" target="body">sym</a><br />
+<a href="newlisp_manual.html#symbols" target="body">symbols</a><br />
+<a href="newlisp_manual.html#sys-error" target="body">sys-error</a><br />
+<a href="newlisp_manual.html#sys-info" target="body">sys-info</a><br />
+<a href="newlisp_manual.html#timer" target="body">timer</a><br />
+<a href="newlisp_manual.html#throw" target="body">throw</a><br />
+<a href="newlisp_manual.html#throw-error" target="body">throw-error</a><br />
+<a href="newlisp_manual.html#trace" target="body">trace</a><br />
+<a href="newlisp_manual.html#trace-highlight" target="body">trace-highlight</a><br />
+
+
+<h3>Importing Libraries</h3>
+
+<a href="newlisp_manual.html#address" target="body">address</a><br />
+<a href="newlisp_manual.html#flt" target="body">flt</a><br />
+<a href="newlisp_manual.html#float" target="body">float</a><br />
+<a href="newlisp_manual.html#get-char" target="body">get-char</a><br />
+<a href="newlisp_manual.html#get-float" target="body">get-float</a><br />
+<a href="newlisp_manual.html#get-int" target="body">get-int</a><br />
+<a href="newlisp_manual.html#get-long" target="body">get-long</a><br />
+<a href="newlisp_manual.html#get-string" target="body">get-string</a><br />
+<a href="newlisp_manual.html#import" target="body">import</a><br />
+<a href="newlisp_manual.html#int" target="body">int</a><br />
+<a href="newlisp_manual.html#pack" target="body">pack</a><br />
+<a href="newlisp_manual.html#unpack" target="body">unpack</a><br />
+
+<h3>newLISP internals API</h3>
+
+<a href="newlisp_manual.html#cpymem" target="body">cpymem</a><br />
+<a href="newlisp_manual.html#dump" target="body">dump</a><br />
+
+</body>
+</html>
diff --git a/doc/newlisp_manual.html b/doc/newlisp_manual.html
new file mode 100644
index 0000000..8c3af36
--- /dev/null
+++ b/doc/newlisp_manual.html
@@ -0,0 +1,27373 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html>
+<head>
+   <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
+   <meta name="author" content="Lutz Mueller">
+   <meta name="keywords" content="newLISP LISP SCHEME programming language manual reference Artificial Intelligence AI NUEVATEC">
+   <meta name="description" content="newLISP Users Manual and Reference">
+   <title>newLISP v.9.3.3 Manual and Reference</title>
+
+<style type="text/css" media="screen">
+
+
+.divider {
+	margin-top: 2em; 
+	margin-bottom: 1em;
+	font-family: Times New Roman, Times, serif;
+	color: #ffAA28;
+	}
+
+.title {
+	font-family:Optima, Georgia, Times New Roman, Times, serif; 
+	font-size:456%;
+	}
+
+.trade {
+	font-family:Optima, Georgia, Times New Roman, Times, serif;
+	font-size:100%;
+	padding-top:16px;
+	}
+
+span.arw {
+	color:#303030;
+	font-size: 100%;
+	font-weight: bold;
+	}
+	
+span.err {
+	color:#cc0000;
+	}
+
+span.comment {
+	color:#555555;
+	}
+	
+span.operator {
+	color:#aa0000;
+	}
+
+span.keyword {
+	color:#0000aa;
+	}
+
+span.number {
+	color:#665500;
+	}
+
+span.string {
+	color:#008800;
+	}
+
+span.function {
+	color:#dd0000;
+	}
+<!--
+span.plus1 {
+	font-size:"+1";
+	}
+-->
+
+body, h1, h2, h3, h4, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+	line-height: 120%;
+ 	}
+
+b { 
+    color: #303030;
+    }
+
+table.list {
+	border-width: 0px;
+	padding: 3px;
+	}
+	
+th.list {
+	font-family:Georgia, Times New Roman, Times, serif;
+	font-size:0.8em;
+	font-weight: 700;
+	}
+	
+td.left {
+	font-family: Andale Mono, Bitstream Vera Sans Mono, Monaco, Courier New;
+   	font-size: 100%;
+	}
+	
+td.right {
+	font-family:Georgia, Times New Roman, Times, serif;
+   	font-size: 100%;
+   	font-style: italic;
+	}
+	
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+   	font-size: 100%;
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	font-size: 100%;
+	}
+	
+-->
+</style>
+
+</head>
+<body text="#000000" bgcolor="#FFFFFF" link="#376590" vlink="#551A8B" alink="#ffAA28">
+
+<br /><br /><br /><br /><br /><br /><br /><br /><br />
+
+
+<table align="center"><tr>
+<td  class="title">newLISP</td>
+<td valign="top" class="trade">&trade;</td>
+</tr></table>
+
+<br />
+
+<center>
+<b>For BSDs, Linux, Mac OS X, Solaris and Win32</b>
+</center>
+
+<center>
+<h2>Users Manual and Reference v.9.3.3</h2>
+</center>
+
+<br /><br /><br /><br />
+<center>
+<span style="line-height:80%;">
+<font size=-2>
+<br />Copyright &copy; 2008 Lutz Mueller.&nbsp; <a href="http://www.nuevatec.com">www.nuevatec.com</a>. All rights reserved.<br /><br />
+Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License,<br /> Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts,<br /> and no Back-Cover Texts. A copy of the license is included in the section entitled 
+<a href="#GNUFDL">GNU Free Documentation License</a>.<br /><br />
+
+The accompanying software is protected by the <a href="#GNUGPL">GNU General Public License</a> V.3, June 2008.<br /><br />
+newLISP is a registered trademark of Lutz Mueller.
+
+</font>
+</span>
+</center>
+<br /><br /><br />
+
+<center><h1>Contents</h1></center>
+
+<h3>Users Manual</h3>
+
+<ol>
+<li><a href="#introduction">Introduction</a></li>
+<li><a href="#deprecated">Deprecated functions and future changes</a></li>
+<li><a href="#options">Command line options, startup and directories</a>
+  <ul>
+  <li><a href="#url_files">Specifying files as URLs</a></li>
+  <li><a href="#stack_size">Stack size</a></li>
+  <li><a href="#max_mem">Maximum memory usage</a></li>
+  <li><a href="#working_dir">Specifiying the working directory</a></li>
+  <li><a href="#prompt">Suppressing the prompt and HTTP processing</a></li>
+  <li><a href="#http_mode">HTTP only server mode</a></li>
+  <li><a href="#tcpip_server">newLISP as a TCP/IP server</a></li>
+  <li><a href="#daemon">TCP/IP daemon mode</a></li>
+  <li><a href="#local_domain_server">Local domain UNIX socket server</a></li>
+  <li><a href="#inetd_daemon"><tt>inetd</tt> daemon mode</a></li>
+  <li><a href="#direct_exec">Direct execution mode</a></li>
+  <li><a href="#logging">Logging I/O</a></li>
+  <li><a href="#cmd_help">Command line help summary</a></li>
+  <li><a href="#initialization">The initialization file <tt>init.lsp</tt></a></li>
+  <li><a href="#directories_unix">Directories on Linux, BSD, Mac OS X</a></li>
+  <li><a href="#directories_win32">Directories on Win32</a></li>
+  <li><a href="#environment">Environment variable NEWLISPDIR</a></li>
+  </ul>
+
+</li>
+<li><a href="#shared-lib">Shared library module for Linux/BSD</a></li>
+<li><a href="#dll">DLL module for Win32 versions</a></li>
+<li><a href="#expressions">Evaluating newLISP expressions</a>
+  <ul>
+  <li><a href="#int_float">Integer and floating point data types and operators</a></li>
+  <li><a href="#eval_rules">Evaluation rules and data types</a></li>
+  </ul>
+
+</li>
+<li><a href="#lambda_expressions">Lambda expressions in newLISP</a></li>
+<li><a href="#nil_and_true"><tt>nil</tt>, <tt>true</tt>, <tt>cons</tt> and <tt>()</tt> in newLISP</a></li>
+<li><a href="#arrays">Arrays</a></li>
+<li><a href="#hash">Dictionaries or Hash tables</a></li>
+<li><a href="#indexing">Indexing elements of strings, lists and arrays</a>
+  <ul>
+
+  <li><a href="#implicit_indexing">Implicit indexing for <tt>nth</tt></a></li>
+  <li><a href="#implicit_default">Implicit indexing and the default function</a>
+  <li><a href="#implicit_rest_slice">Implicit indexing for <tt>rest</tt> and <tt>slice</tt></a>
+  <li><a href="#implicit_nth-set">Implicit indexing for <tt>nth-set</tt> and <tt>set-nth</tt></a>
+
+  </ul>
+</li>  
+<li><a href="#destructive">Destructive versus non-destructive functions</a></li>
+<ul>
+	<li><a href="#make_nondestructive">Make a destructive function non-destructive</a></li>
+</ul>
+<li><a href="#scoping">Dynamic and lexical scoping</a></li>
+<li><a href="#return">Early return from functions, loops, blocks</a>
+
+  <ul>
+  <li><a href="#flow_catch_throw">Using <tt>catch</tt> and <tt>throw</tt></a></li>
+  <li><a href="#flow_and_or">Using <tt>and</tt> and <tt>or</tt></a></li>
+  </ul>
+
+</li>
+<li><a href="#contexts">Contexts</a>
+  <ul>
+  <li><a href="#context_rules">Symbol creation in contexts</a></li>
+  <li><a href="#scope_context">Scoping rules for contexts</a></li>
+  <li><a href="#scope_change">Changing scoping</a></li>
+  <li><a href="#protection">Symbol protection</a></li>
+  <li><a href="#overwrite">Overwriting global symbols and built-ins</a></li>
+  <li><a href="#context_vars">Variables holding contexts</a></li>
+  <li><a href="#loading_contexts">Sequence of creating or loading contexts</a></li>
+  </ul>
+</li>
+<li><a href="#context_objects">Programming with contexts</a>
+  <ul>
+  <li><a href="#context_modules">Contexts as programming modules</a></li>
+  <li><a href="#context_data">Contexts as data containers</a></li>
+  <li><a href="#loading_contexts">Loading and declaring contexts</a></li>
+  <li><a href="#default_function">The context default functor</a></li>
+  <li><a href="#pass_big">Passing data by reference</a></li>
+  <li><a href="#serializing">Serializing context objects</a></li>
+  </ul>
+<li><a href="#oo_programming">Object-Oriented Programming in newLISP</a>
+  <ul>
+  <li><a href="#newlisp_classes">Classes and constructors</a></li>
+  <li><a href="#newlisp_objects">Objects</a></li>
+  <li><a href="#colon_operator">The colon <tt>:</tt> operator and polymorphism</a></li>
+  </ul>
+</li>
+
+
+</li>
+<li><a href="#XML">XML, SXML and XML-RPC</a></li>
+<li><a href="#internationalization">Customization, localization and UTF-8</a>
+  <ul>
+  <li><a href="#switching">Switching the locale</a></li>
+  <li><a href="#decimal_point">Decimal point and decimal comma</a></li>
+  <li><a href="#unicode_utf8">Unicode and UTF-8 encoding</a></li>
+  </ul>
+
+</li>
+<li><a href="#commas">Commas in parameter lists</a></li>
+<li><a href="#linking">Linking newLISP source and executable</a></li>
+</ol>
+
+<h3>Function Reference</h3>
+<ol>
+<li><a href="#symbol_names">Syntax of symbol variables and numbers</a></li>
+<li><a href="#type_ids">Data types and names in the reference</a></li>
+<li><a href="#functions">Functions in groups</a>
+  <ul>
+  <li><a href="#list_processing">List processing, flow control and integer arithmetic</a></li>
+  <li><a href="#string_operators">String and conversion functions</a></li>
+  <li><a href="#floating_point">Floating point math and special functions</a></li>
+  <li><a href="#matrices">Matrix functions</a></li>
+  <li><a href="#array-funcs">Array functions</a></li>
+  <li><a href="#bit_operators">Bit operators</a></li>
+  <li><a href="#predicates">Predicates</a></li>
+  <li><a href="#timedate">Time and date functions</a></li>
+  <li><a href="#montecarlo">Simulation and modeling math functions</a></li>
+  <li><a href="#pattern">Pattern matching</a></li>
+  <li><a href="#financial">Financial math functions</a></li>
+  <li><a href="#input_output">File and I/O operations</a></li>
+  <li><a href="#process_threads">Processes, pipes and threads</a></li>
+  <li><a href="#directory_management">File and directory management</a></li>
+  <li><a href="#http_api">HTTP networking API</a></li>
+  <li><a href="#socket_tcpip">Socket TCP/IP and UDP network API</a></li>
+  <li><a href="#system_functions">System functions</a></li>
+  <li><a href="#importing_libraries">Importing libraries</a></li>
+  <li><a href="#internals">newLISP internals API</a></li>
+  </ul>
+
+</li>  
+</ol>
+
+<h3><a href="#functions_alphabetical">Functions in alphabetical order</a></h3>
+
+
+<b>
+<a href="#shell">!</a>&nbsp;
+<a href="#arithmetic">+-*/%</a>&nbsp;
+<a href="#colon">:</a>&nbsp;
+<a href="#abs">Ab</a>&nbsp;
+<a href="#append">Ap</a>&nbsp;
+<a href="#base64-dec">B</a>&nbsp; 
+
+<a href="#callback">Ca</a>&nbsp;
+<a href="#command-line">Co</a>&nbsp;
+<a href="#date">Da</a>&nbsp;
+<a href="#difference">Di</a>&nbsp;
+<a href="#emptyp">Em</a>&nbsp; 
+<a href="#eval">Ev</a>&nbsp;
+<a href="#factor">Fa</a>&nbsp; 
+<a href="#fn">Fn</a>&nbsp;
+<a href="#gammai">G</a>&nbsp;
+
+<a href="#if">I</a>&nbsp; 
+<a href="#join">J</a>&nbsp; 
+<a href="#lambda">La</a>&nbsp;
+<a href="#list">Li</a>&nbsp;
+<br />
+<a href="#macrop">Ma</a>&nbsp; 
+<a href="#member">Me</a>&nbsp;
+<a href="#name">Na</a> &nbsp; 
+<a href="#net-accept">Ne</a>&nbsp;
+
+<a href="#not">No</a>&nbsp;
+<a href="#open">O</a>&nbsp;
+<a href="#pack">Pa</a>&nbsp; 
+<a href="#pretty-print">Pr</a>&nbsp;
+<a href="#quote">Q</a>&nbsp; 
+<a href="#rand">Ra</a>&nbsp;
+<a href="#regex">Reg</a>&nbsp;
+<a href="#save">Sa</a>&nbsp; 
+<a href="#share">Sh</a>&nbsp;
+
+<a href="#starts-with">St</a>&nbsp;
+<a href="#tan">T</a>&nbsp; 
+<a href="#unicode">U</a>&nbsp;
+<a href="#wait-pid">W</a>&nbsp;
+<a href="#xml-error">X</a>&nbsp;
+</b>
+
+<h3>Appendix</h3>
+
+<ul>
+<li><a href="#error_codes">Error Codes</a></li>
+<li><a href="#GNUFDL">GNU Free Documentation License</a></li>
+<li><a href="#GNUGPL">GNU General Public License</a></li>
+</ul>
+<br />
+<br />
+
+
+<a NAME="introduction"></a>
+
+<center style="font-size: 150%">
+<span class="divider">(&nbsp;<font color="#7ba9d4">&part;</font>&nbsp;)</span>
+</center>
+
+<CENTER><H1>newLISP Users Manual</H1></CENTER>
+
+
+<h2>1. Introduction</h2>
+
+		<p>
+			newLISP focuses on the core components of LISP:
+			<em>lists</em>, <em>symbols</em>, and <em>lambda expressions</em>.
+			To these, newLISP adds <em>arrays</em>,
+			<em>implicit indexing</em> on lists and arrays,
+			and <em>dynamic</em> and <em>lexical scoping</em>.
+			Lexical scoping is implemented using separate namespaces called <em>contexts</em>.
+		</p>
+		<p>
+			The result is an easier-to-learn LISP
+			that is even smaller than most Scheme implementations,
+			but which still has about 350 built-in functions.
+			Approximately 200k in size,
+			newLISP is built for high portability
+			using only the most common UNIX system C-libraries.
+			It loads quickly and has a small memory footprint.
+			newLISP is as fast or faster than other popular scripting languages
+			and uses very few resources.
+		</p>
+		<p>
+			newLISP is dynamically scoped inside lexically separated contexts (namespaces).
+			Contexts can be used to create isolated protected expansion packages
+			and to write <em>prototype</em>-based <em>object-oriented</em> programs.
+		</p>
+		<p>
+			Both built-in and user-defined functions, along with variables,
+			share the same namespace and are manipulated by the same functions.
+			Lambda expressions and user-defined functions can be handled
+			like any other list expression.
+		</p>
+		<p>
+		Contexts in newLISP facilitate the development
+		of larger applications comprising independently developed modules
+		with their own separate namespaces.
+		They can be copied,
+		dynamically assigned to variables,
+		and passed by reference to functions as arguments.
+		In this way, contexts can serve as dynamically created objects
+		packaging symbols and methods.
+		Lexical separation of namespaces
+		also enables the definition of statically scoped functions.
+		</p>
+		<p>
+			newLISP's efficient <em>red-black tree</em> implementation
+			can handle millions of symbols without degrading performance.
+			Contexts can hold symbol-value pairs,
+			allowing them to be used as hash-tables.
+			Functions are also available
+			to iteratively access symbols inside contexts.
+		</p>
+		<p>
+			newLISP allocates and reclaims memory automatically,
+			without using traditional asynchronous garbage collection
+			(except under error conditions).
+			All objects &mdash; except for contexts, built-in primitives, and symbols &mdash;
+			are passed by value and are referenced only once.
+			When objects are no longer referenced,
+			their memory is automatically deallocated.
+			This results in predictable processing times,
+			without the pauses found in traditional garbage collection.
+			newLISP's unique automatic memory management
+			makes it the fastest interactive LISP available.
+		</p>
+		<p>
+			Many of newLISP's built-in functions are polymorphic
+			and accept a variety of data types and optional parameters.
+			This greatly reduces the number of functions
+			and syntactic forms it is necessary to learn and implement.
+			High-level functions are available for distributed computing,
+			financial math, statistics, and AI.
+		</p>
+		<p>
+			newLISP has functions to modify, insert, or delete elements inside 
+            complex <em>nested</em> lists or <em>multidimensional</em> array structures.
+		</p>
+		<p>
+			Since strings can contain null characters in newLISP,
+			they can be used to process binary data.
+		</p>
+		<p>
+			newLISP can also be extended with a shared library interface
+			to import functions that access data in foreign binary data structures.
+			The distribution contains a module for importing popular database APIs.
+		</p>
+		<p>
+			newLISP's HTTP, TCP/IP, and UDP socket interfaces
+			make it easy to write distributed networked applications.
+			Its built-in XML interface,
+			along with its text-processing features
+			&mdash; Perl Compatible Regular Expressions (PCRE) and text-parsing functions &mdash;
+			make newLISP a useful tool for CGI processing.
+			The source distribution includes examples of HTML forms processing.
+			newLISP can be run a as a CGI capable web server using its built-in http mode option.
+		</p>
+		<p>
+			The source distribution can be compiled for Linux, BSDs, Mac OS X/Darwin, Solaris, and Win32.
+            On 64-bit Linux, SUN Solaris and True64Unix newLISP can be compiled as a 64-bit LP64 application 
+            for full 64-bit memory addressing.
+		</p>
+		<br />
+		<h3>
+			newLISP-GS
+		</h3>
+		<p>
+			newLISP-GS is a graphical user interface front-end
+			written in newLISP and a Java based library server
+			using the standard Java runtime environment
+			installed on all Windows and Mac OS X platforms.
+			Applications built with newLISP-GS can have the host operating system's 
+			native look and feel.
+			Interfaces to GTK, Tcl/Tk and OpenGL graphics libraries
+			are also available.
+		</p>
+		<p>
+			newLISP and Java are available for most operating systems. 
+            This makes newLISP-GS is a platform-independent solution
+			for writing GUI applications.
+		</p>
+		<p>
+			For more information on newLISP-GS,
+			see <a HREF="http://newlisp.org/guiserver">newLISP-GS</a>.
+		</p>
+		<br />
+		<h3>
+			Licensing
+		</h3>
+		<p>
+			newLISP and newLISP-GS are licensed under version 3
+			of the <a HREF="#GNUGPL">GPL (General Public License)</a>.
+			Both the newLISP and other documentation packaged with newLISP
+			are licensed under the <a href="#GNUFDL">GNU Free Documentation License</a>.
+		</p>
+
+<br />
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+<a NAME="deprecated"></a>
+<h2>2. Deprecated functions and future changes</h2>
+
+<p>The new <a href="#set-assoc">set-assoc</a>  or <a href="#pop-assoc">pop-assoc</a> should 
+be used instead of <a href="#replace-assoc">replace-assoc</a>, to replace or remove an association
+in an association list. The new <tt>set-assoc</tt> and <tt>pop-assoc</tt>  handle multiple key 
+expressions for nested association lists. The old <tt>replace-assoc</tt> will be removed in
+a future version.</p>
+
+<br /><br />
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+		
+<a NAME="options"></a>
+<h2>3. Command-line options startup and directories</h2>
+
+<p>When starting newLISP from the command line several switches and options and source files
+can be specified. The options and source files are executed. For options such as <tt>-p</tt> and <tt>-d</tt>,
+it makes sense to load source files <em>first</em>; other options, like <tt>-m</tt> and <tt>-s</tt>,
+should be specified <em>before</em> the source files. The <tt>-e</tt> switch is used to evaluate 
+the program text and then exit; otherwise, evaluation continues interactively 
+(unless an exit occurs while the files are loading).</p>
+
+<br />
+
+<a name="url_files"></a>
+<h3>Specifying files as URLs</h3>
+
+<p>newLISP will load and execute files specified on the command line. Files are specified with either their
+pathname on the local filesystem or with a <tt>http://</tt> or <tt>file://</tt> URL:</p>
+
+<blockquote><pre>
+newlisp aprog.lsp bprog.lsp prog.lsp
+newlisp http://newlisp.org/example.lsp
+newlisp file:///usr/home/newlisp/demo.lsp
+</pre></blockquote>
+
+		<br />
+		<a name="stack_size"></a>
+		<h3>
+			Stack size
+		</h3>
+<blockquote><pre>
+newlisp -s 4000
+newlisp -s 100000 aprog bprog
+newlisp -s 6000 myprog
+newlisp -s 6000 http://asite.com/example.lsp
+</pre></blockquote>		
+		<p>
+			The above examples show starting newLISP with different stack sizes using 
+			the <tt>-s</tt> option, as well as loading one or more newLISP source files
+			and loading files specified by an URL. When no stack size is specified, 
+			the stack defaults to 2048.
+		</p>
+		<br />
+		<a name="max_mem"></a>
+		<h3>
+			Maximum memory usage
+		</h3>
+<blockquote><pre>
+newlisp -m 128
+</pre></blockquote>		
+		<p>
+			This example limits LISP cell memory to 128 megabytes. In 32-bit newLISP, each LISP cell consumes 16 bytes, so the argument <tt>128</tt> would represent a maximum of 8,388,608 LISP cells. This information is returned by <a href="#sys-info">sys-info</a> as the list's second element. Although LISP cell memory is not the only memory consumed by newLISP, it is a good estimate of overall memory usage.
+		</p>
+		<br />
+
+<a name="working_dir"></a>
+<h3>
+Specifiying the working directory
+</h3>
+
+<p>The <tt>-w</tt> option specifies the initial working directory for newLISP after startup:
+</p>
+
+<blockquote><pre>
+newlisp -w /usr/home/newlisp
+</pre></blockquote>
+
+<p>All file requests without a directory path will now be directed to the path specified with the <tt>-w</tt> option.</p>
+
+<br />
+
+		<a name="prompt"></a>
+		<h3>
+			Suppressing the prompt and HTTP processing
+		</h3>
+		<p>
+			The command-line prompt 
+			and initial copyright banner 
+			can be suppressed:
+		</p>
+<blockquote><pre>
+newlisp -c
+</pre></blockquote>
+<p>
+	Listen and connection messages  
+	are suppressed if logging is not enabled. 
+	The <tt>-c</tt> option is useful 
+	when controlling newLISP 
+	from other programs; 
+	it is mandatory when setting it up 
+	as a <a href="#net-eval">net-eval</a> server.
+</p>
+<p>
+	The <tt>-c</tt> option also enables newLISP server nodes to answer
+	<tt>HTTP GET</tt>, <tt>PUT</tt>, <tt>POST</tt> and <tt>DELETE</tt> requests, as well as
+	perform CGI processing. Using the <tt>-c</tt> option,
+	together with the <tt>-w</tt> and <tt>-d</tt> options,
+	newLISP can serve as a standalone <tt>httpd</tt> webserver:
+</p>
+<blockquote><pre>
+newlisp -c -d 8080 -w /usr/home/www
+</pre></blockquote>
+
+<p>
+When running newLISP as a <tt>inetd</tt> or <tt>xinetd</tt> enabled
+server on UNIX machines, use:
+</p>
+
+<blockquote><pre>
+newlisp -c -w /usr/home/www
+</pre></blockquote>
+
+<p>
+   In <tt>-c</tt> mode, newLISP processes command-line requests as well as
+   HTTP and <a href="#net-eval">net-eval</a> requests. Running
+   newLISP in this mode is only recommended on a machine behind
+   a firewall. This mode should not be run on machines open and accessible
+   through the Internet. 
+   To suppress the processing of <a href="#net-eval">net-eval</a> and command-line&ndash;like requests, 
+   use the safer <tt>-http</tt> option.
+</p>
+<br />
+
+<a name="http_mode"></a>
+
+	<h3>
+	HTTP-only server mode
+	</h3>
+<p>
+   newLISP can be limited to HTTP processing using the <tt>-http</tt> option.
+   With this mode, a secure <tt>httpd</tt> web server daemon can be configured:
+</p>
+<blockquote><pre>
+newlisp -http -d 8080 -w /usr/home/www
+</pre></blockquote>
+<p>
+When running newLISP as an <tt>inetd</tt> or <tt>xinetd</tt>-enabled
+server on UNIX machines, use:
+</p>
+<blockquote><pre>
+newlisp -http -w /usr/home/www
+</pre></blockquote>
+
+<p>To further enhance security and HTTP processing, load a program during startup when using this mode:
+</p>
+<blockquote><pre>
+newlisp http-conf.lsp -http -w /usr/home/www
+</pre></blockquote>
+
+<p>Defining a function named <tt>httpd-conf</tt>
+in a source file called <tt>httpd-conf.lsp</tt>
+can be used to customize HTTP request processing. 
+The newLISP distribution contains an example 
+<tt>httpd-conf.lsp</tt> file. 
+This file shows how to configure redirects 
+and filter unauthorized requests.</p>
+
+<p>In the HTTP modes enabled by either <tt>-c</tt> or <tt>-http</tt>, the following file types are
+recognized, and a correctly formatted <tt>Content-Type:</tt> header is sent back:</p>
+
+<br />
+<blockquote>
+<table class="list" width="50%">
+<tr align="left"><th>file extension</th><th>media type</th></tr>
+<tr><td class="left">.jpg</td><td class="left">image/jpg</td></tr>
+<tr><td class="left">.pgn</td><td class="left">image/png</td></tr>
+<tr><td class="left">.gif</td><td class="left">image/gif</td></tr>
+<tr><td class="left">.pdf</td><td class="left">application/pdf</td></tr>
+<tr><td class="left">.mp3</td><td class="left">image/mpeg</td></tr>
+<tr><td class="left">.mov</td><td class="left">image/quicktime</td></tr>
+<tr><td class="left">.mpg</td><td class="left">image/mpeg</td></tr>
+<tr><td><em>any other</em></td><td class="left">text/html</td></tr>
+</table>
+</blockquote>
+
+<br />
+<h3>Forcing prompts in pipe I/O mode</h3>
+
+<p>
+	A capital <tt>C</tt> forces prompts when running newLISP in pipe I/O mode
+    inside the Emacs editor:
+</p>
+
+<blockquote><pre>
+newlisp -C
+</pre></blockquote>
+
+<p>
+	To suppress return values from evaluations, 
+	use <a href="#silent">silent</a>.
+</p>
+<br />
+
+		<a name="tcpip_server"></a>
+		<h3>
+			newLISP as a TCP/IP server
+		</h3>
+<blockquote><pre>
+newlisp some.lsp -p 9090
+</pre></blockquote>		
+
+<p>
+This example shows how newLISP can listen for commands on a TCP/IP socket connection. 
+In this case, standard I/O is redirected to the port specified with the <tt>-p</tt> 
+option. <tt>some.lsp</tt> is an optional file loaded during startup, before listening 
+for a connection begins.
+</p>
+
+<p>
+The <tt>-p</tt> option is also used to control newLISP from another application, 
+such as a newLISP GUI front-end or a program written in another language.
+</p>
+
+<p>
+A telnet application can be used to test running newLISP as a server. First enter:
+</p>
+
+<blockquote><pre>
+newlisp -p 4711 &amp;
+</pre></blockquote>		
+
+<p>
+The <tt>&amp;</tt> indicates to a UNIX shell to run the process in the background. 
+Now connect with a telnet application:
+</p>
+
+<blockquote><pre>
+telnet localhost 4711
+</pre></blockquote>	
+
+<p>
+If connected, the newLISP sign-on banner and prompt appear. Instead of <tt>4711</tt>, 
+any other port number could be used.
+</p>
+
+<p>
+When the client application closes the connection, newLISP will exit, too.
+</p>
+
+	<br />
+		<a NAME="daemon"></a>
+		<h3>
+			TCP/IP daemon mode
+		</h3>
+
+<p>When the connection to the client is closed in <tt>-p</tt> mode, newLISP exits. 
+To avoid this, use the <tt>-d</tt> option instead of the <tt>-p</tt> option:
+</p>
+
+<blockquote><pre>
+newlisp -d 4711 &amp;
+</pre></blockquote>		
+
+<p>
+This works like the <tt>-p</tt> option, but newLISP does not exit after a 
+connection closes. Instead, it stays in memory, listening for a new connection 
+and preserving its state. An <a HREF="#exit">exit</a> issued from a client 
+application closes the network connection, and the newLISP daemon remains resident, 
+waiting for a new connection. Any port number could be used in place of <tt>4711</tt>.
+</p>
+
+<p>
+When running in <tt>-p</tt> or <tt>-d</tt> mode, the opening and closing tags 
+<tt>[cmd]</tt> and <tt>[/cmd]</tt> must be used to enclose multiline statements. 
+They must each appear on separate lines. This makes it possible to transfer larger 
+portions of code from controlling applications. 
+</p>
+
+<p>
+The following variant of the <tt>-d</tt> mode is frequently used in a distributed 
+computing environment, together with <a href="#net-eval">net-eval</a> on the client side:
+</p>
+
+<blockquote><pre>
+newlisp -c -d 4711 &amp;
+</pre></blockquote>		
+
+<p>
+The <tt>-c</tt> spec suppresses prompts, making this mode suitable 
+for receiving requests from the <a href="#net-eval">net-eval</a> function.
+</p>
+
+<p>
+	newLISP server nodes running on UNIX like operating systems, 
+	will also answer <tt>HTTP GET</tt>, <tt>PUT</tt> and <tt>DELETE</tt> requests. 
+	This can be used to retrieve and store files 
+	with <a href="#get-url">get-url</a>, <a href="#put-url">put-url</a>,
+    <a href="#delete-url">delet-url</a>,
+	<a href="#read-file">read-file</a>, <a href="#write-file">write-file</a>
+	and <a href="#append-file">append-file</a>,
+	or to load and save programs using <a href="#load">load</a> 
+	and <a href="#save">save</a> from and to remote server nodes.
+    See the chapters for the <tt>-c</tt> and <tt>-http</tt> options
+    for more details.
+</p>
+	
+	
+<br />
+
+<a name="local_domain_server"></a>
+<h3>Local domain UNIX socket server</h3>
+
+<p>Instead of a port a local domain UNIX socket path can be specified in
+the <tt>-d</tt> or <tt>-p</tt> server modes.</p>
+
+<blockquote><pre>
+newlisp -c -d /tmp/mysocket &amp;
+</pre></blockquote>		
+
+<p>This mode will work together with local domain socket modes of
+<a href="#net-connect">net-connect</a>, <a href="#net-listen">net-listen</a>,
+and <a href="#net-eval">net-eval</a>. Local domain sockets opened with
+with <tt>net-connect</tt> and <tt>net-listen</tt> can be served using
+<a href="#net-accept">net-accept</a>, <a href="#net-receive">net-receive</a>,
+and <a href="#net-send">net-send</a>. Local domain socket connections
+can be monitored using <a href="#net-peek">net-peek</a> and 
+<a href="#net-select">net-select</a>.</p>
+
+<p>Local domain socket connections are much faster than normal Tcp/Ip network
+connections and preferred for communications between processes on
+the same local file system in distributed applications. This mode is not
+available on Win32.</p>
+
+<br />
+
+		<a name="inetd_daemon"></a>
+		<h3><tt>inetd</tt>	 daemon mode</h3>
+<p>
+The <tt>inetd</tt> server running on virtually all Linux/UNIX OSes can function 
+as a proxy for newLISP. The server accepts TCP/IP or UDP connections and passes 
+on requests via standard I/O to newLISP. <tt>inetd</tt> starts a newLISP process 
+for each client connection. When a client disconnects, the connection is closed 
+and the newLISP process exits.
+</p>
+
+<p>
+<tt>inetd</tt> and newLISP together can handle multiple connections efficiently 
+because of newLISP's small memory footprint, fast executable, and short program load 
+times. When working with <a href="#net-eval">net-eval</a>, this mode is preferred 
+for efficiently handling multiple requests in a distributed computing environment.
+</p>
+
+<p>
+Two files must be configured: <tt>services</tt> and <tt>inetd.conf</tt>. 
+Both are ASCII-editable and can usually be found at <tt>/etc/services</tt> and 
+<tt>/etc/inetd.conf</tt>.
+</p>
+
+<p>
+Put one of the following lines into <tt>inetd.conf:</tt>
+</p>
+
+<blockquote><pre>
+net-eval  stream  tcp  nowait  root  /usr/bin/newlisp -c
+											 
+# as an alternative, a program can also be preloaded
+											 
+net-eval  stream  tcp  nowait  root  /usr/bin/newlisp -c myprog.lsp
+</pre></blockquote>
+
+<p>
+Instead of <tt>root</tt>, another user and optional group can be specified. 
+For details, see the UNIX man page for <tt>inetd</tt>.
+</p>
+
+<p>
+The following line is put into the <tt>services</tt> file:
+</p>
+
+<blockquote><pre>
+net-eval        4711/tcp     # newLISP net-eval requests
+</pre></blockquote>		
+
+<p>
+On Mac OS X and some UNIX systems, <tt>xinetd</tt> can be used instead of 
+<tt>inetd</tt>. Save the following to a file named <tt>net-eval</tt> in the 
+<tt>/etc/xinetd.d/</tt> directory:
+</p>
+
+<blockquote><pre>
+service net-eval
+{
+    socket_type = stream
+    wait = no
+    user = root
+    server = /usr/bin/newlisp
+    port = 4711
+    server_args = -c
+    only_from = localhost
+}
+</pre></blockquote>		
+<p>
+For security reasons, <tt>root</tt> should be changed to a different user,
+when traffic is accepted from other places than <tt>localhost</tt>.
+The <tt>only_from</tt> spec can be left out to permit remote access.
+</p>
+
+<p>
+See the man pages for <tt>xinetd</tt> and <tt>xinetd.conf</tt> 
+for other configuration options.
+</p>
+
+<p>
+After configuring the daemon, <tt>inetd</tt> or 
+<tt>xinetd</tt> must be restarted to 
+allow the new or changed configuration files to be read:
+</p>
+
+<blockquote><pre>
+kill -HUP &lt;pid&gt;
+</pre></blockquote>	
+<p>
+Replace <tt>&lt;pid&gt;</tt> with the process ID of the 
+running <tt>xinetd</tt> process.
+</p>
+
+<p>
+A number or network protocol other than 4711 or TCP can be specified.
+</p>
+
+<p>
+newLISP handles everything as if the input were being entered 
+on a newLISP command line without a prompt. To test the 
+<tt>inetd</tt> setup, the <tt>telnet</tt> program can be used:
+</p>
+
+<blockquote><pre>
+telnet localhost 4711
+</pre></blockquote>		
+
+<p>
+newLISP expressions can now be entered, and <tt>inetd</tt> will 
+automatically handle the startup and communications of a newLISP 
+process. Multiline expressions can be entered by bracketing them 
+with <tt>[cmd]</tt> and <tt>[/cmd]</tt> tags, each on separate lines.
+</p>
+
+<p>
+<p>
+	newLISP server nodes running on UNIX like operating systems, 
+	will also answer simple <tt>HTTP GET</tt> and <tt>PUT</tt> requests. 
+	This can be used to retrieve and store files 
+	with <a href="#get-url">get-url</a>, <a href="#put-url">put-url</a>,
+	<a href="#read-file">read-file</a>, <a href="#write-file">write-file</a>
+	and <a href="#append-file">append-file</a>,
+	or to load and save programs using <a href="#load">load</a> 
+	and <a href="#save">save</a> from and to remote server nodes.
+	On Win32 newLISP server nodes do not
+	answer HTTP requests.
+</p>
+		
+		<br />
+		<a name="direct_exec"></a>
+		<h3>
+			Direct execution mode
+		</h3>
+		Small pieces of newLISP code can be executed directly from the command line:
+<blockquote><pre>
+newlisp -e "(+ 3 4)"&nbsp;&nbsp;<span class="arw">&rarr;</span> 7
+</pre></blockquote>		<p>
+			The expression enclosed in quotation marks is evaluated, and the result is printed to standard out (STDOUT). In most UNIX system shells, single quotes can also be used as command-line delimiters. Note that there is a space between <tt>-e</tt> and the quoted command string.
+		</p>
+		<br />
+
+<a name="logging"></a>
+<h3>Logging I/O</h3>
+
+<p>
+In any mode newLISP can write a log when started with the <tt>-l</tt> or <tt>-L</tt> option.
+Depending on the mode newLISP is running, different output is written to the logfile. Both options always must
+specify the  path of a log-file. The path may be a relative path and can be either attached or detached to the
+<tt>-l</tt> or <tt>-L</tt> option.
+</p>
+
+<blockquote><pre>
+newlisp -l./logfile.txt -c
+
+newlisp -L /usr/home/www/log.txt -http -w /usr/home/www/htpdocs
+</pre></blockquote>
+
+<center>
+<table class="list" width="95%" summary="logging formats">
+<tr align="left"><th>logging mode</th><th>command line and net-eval with <tt>-c</tt></th><th>HTTP server with <tt>-http</tt></th></tr>
+<tr><td><tt>newlisp -l</tt></td>
+    <td>log only input and network connections</td>
+    <td>log only net-work connections</td></tr>
+<tr><td><tt>newlisp -L</tt></td>
+    <td>log also newLISP output (w/o prompts)</td>
+    <td>log also HTTP requests</td></tr>
+</table>
+</center>
+<br />
+		<p>
+			All logging output is written to the file specified after the <tt>-l</tt> or <tt>-L</tt> option.
+		</p>
+		<br />
+		<a name="cmd_help"></a>
+		<h3>
+			Command line help summary
+		</h3>
+		<p>The <tt>-h</tt> command-line switch prints a copyright notice and summary of options:
+		</p>
+<blockquote><pre>
+newlisp -h
+</pre></blockquote>		<p>
+			On Linux and other UNIX systems, a <tt>newlisp</tt> <em>man page</em> can be found:
+		</p>
+<blockquote><pre>
+man newlisp
+</pre></blockquote>		<p>
+			This will display a man page in the Linux/UNIX shell.
+		</p>
+<br />
+
+<a name="initialization"></a>
+<h3> The initialization file <tt>init.lsp</tt></h3>
+<p> On Linux, BSDs, Mac OS X and other UNIXs the initialization file is installed and expected in <tt>/usr/share/newlisp/init.lsp</tt>. newLISP on Win32 compiled with MinGW looks for <tt>init.lsp</tt> in the same directory where <tt>newlisp.exe</tt> is installed. Along with any files specified on the command line, <tt>init.lsp</tt> is loaded before the banner and prompt are shown. When newLISP is executed or launched by a program or process other than a shell, the banner and prompt are not shown, and newLISP  communicates by standard I/O. <tt>init.lsp</tt>, however, is still loaded and evaluated if present.
+</p>
+
+<p> While newLISP does not require <tt>init.lsp</tt> to run, it is convenient for defining functions and systemwide variables.</p>
+<p>
+The last part of <tt>init.lsp</tt> contains OS-specific code, which loads a  second <tt>.init.lsp</tt> (starting with a dot). On Linux/UNIX, this file is expected in the directory specified by the <tt>HOME</tt> environment variable. On Win32, this file is expected in the directory specified by the <tt>USERPROFILE</tt> or <tt>DOCUMENT_ROOT</tt> environment variable.
+</p>
+
+<br />
+
+<a name="directories_unix"></a>
+<h3> Directories on Linux, BSD, Mac OS X and other UNIX </h3>
+<p>
+The directory <tt>/usr/share/newlisp/modules</tt> contains modules with useful functions 
+for a variety of tasks, such as database management with MySQL, procedures for statistics, 
+POP3 mail, etc. The directory <tt>/usr/share/newlisp/guiserver</tt> contains sample programs
+for writing GUI aplications with newLISP-GS.
+The directory <tt>/usr/share/doc/newlisp/</tt> contains documentation in HTML format.
+		</p>
+		<br />
+		<a name="directories_win32"></a>
+		<h3>
+			Directories on Win32
+		</h3>
+		<p>
+On Win32 systems, all files are installed in the default directory <tt>$PROGRAMFILES\newlisp</tt>. 
+<tt>$PROGRAMFILES</tt> is a Win32 environment variable that resolves to 
+<tt>C:\Program files\newlisp\</tt> in English language installations. The subdirectories 
+<tt>$PROGRAMFILES\newlisp\modules</tt> and <tt>$PROGRAMFILES\newlisp\guiserver</tt>
+contain modules for interfacing to external libraries and sample programs written for
+newLISP-GS.</p>
+<br />
+
+<a name="environment"></a>
+<h3>Environment variable NEWLISPDIR</h3>
+<p>During startup newLISP sets the environment variable NEWLISPDIR, if it is not set already. On Linux, BSDs, Mac OS X and other UNIXs the variable is set to <tt>/usr/share/newlisp</tt>. On Win32 the variable is set to <tt>%PROGRAMFILES%/newlisp</tt>.</p>
+
+<p>The environment variable <tt>NEWLISPDIR</tt> is useful when loading files installed with 
+newLISP:</p>
+
+<blockquote><pre>
+(load (append (env "NEWLISPDIR") "/guiserver.lsp"))
+
+(load (append (env "NEWLISPDIR") "/modules/mysql51.lsp"))
+</pre></blockquote>
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="shared-lib"></a>
+		<h2>
+			4. Shared library module for Linux/BSD versions
+		</h2>
+		<p>
+			newLISP can be compiled as a UNIX shared library called <tt>newlisp.dylib</tt> on Mac OS X and as <tt>newlisp.so</tt> on Linux and BSDs. A newLISP shared library can be used like any other UNIX shared library.
+		</p>
+		<p>
+			To use <tt>newlisp.so</tt> or <tt>newlisp.dylib</tt>, import the function <tt>newlispEvalStr</tt>. Like <a href="#eval-string">eval-string</a>, this function takes a string containing a newLISP expression and stores the result in a string address. The result can be converted using <a href="#get-string">get-string</a>. The returned string is formatted like output from a command-line session. It contains terminating line-feed characters, but without the prompt strings.
+		</p>
+		<p>
+			The first example shows how <tt>newlisp.so</tt> is imported from newLISP itself.
+		</p>
+<blockquote><pre>
+(import "/usr/lib/newlisp.so" "newlispEvalStr")
+(get-string (newlispEvalStr "(+ 3 4)"))&nbsp;&nbsp;<span class=arw>&rarr;</span> "7\n"
+</pre></blockquote>		<p>
+			The second example shows how to import <tt>newlisp.so</tt> into a program written in C:
+		</p>
+<blockquote><pre>
+/* libdemo.c - demo for importing newlisp.so
+ * 
+ * compile using: 
+ *    gcc -ldl libdemo.c -o libdemo
+ *
+ * use:
+ *
+ *    ./libdemo '(+ 3 4)'
+ *    ./libdemo '(symbols)'
+ *
+ */
+#include &lt;stdio.h&gt;
+#include &lt;dlfcn.h&gt;
+ 
+int main(int argc, char * argv[])
+{
+void * hLibrary;
+char * result;
+char * (*func)(char *);
+char * error;
+ 
+if((hLibrary = dlopen("/usr/lib/newlisp.so",
+                       RTLD_GLOBAL | RTLD_LAZY)) == 0)
+    {
+    printf("cannot import library\n");
+    exit(-1);
+    }
+ 
+func = dlsym(hLibrary, "newlispEvalStr");
+if((error = dlerror()) != NULL)
+    {
+    printf("error: %s\n", error);
+    exit(-1);
+    }
+ 
+printf("%s\n", (*func)(argv[1]));
+ 
+return(0);
+}
+
+/* eof */
+</pre></blockquote>		<p>
+			This program will accept quoted newLISP expressions and print the evaluated results.
+		</p>
+		<p>
+			When calling <tt>newlisp.so</tt>'s  function <tt>newlispEvalStr</tt>, output normally directed to the console (e.g., return values or <a href="#print">print</a> statements) is returned in the form of an integer string pointer. The output can be accessed by passing this pointer to the <tt>get-string</tt> function. To silence the output from return values, use the <a href="#silent">silent</a> function.
+		</p>
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="dll"></a>
+		<h2>
+			5. DLL module for Win32 versions
+		</h2>
+		<p>
+			On the Win32 platforms, newLISP can be compiled as a DLL (Dynamic Link Library). In this way, newLISP functions can be made available to other programs (e.g., MS Excel, Visual Basic, Borland Delphi, or even newLISP itself).
+		</p>
+		<p>
+			When the DLL is loaded, it looks for the file <tt>init.lsp</tt> in the current directory of the calling process.
+		</p>
+		<p>
+			To access the functionality of the DLL, use <tt>newlispEvalStr</tt>, which takes a string containing a valid newLISP expression and returns a string of the result:
+		</p>
+<blockquote><pre>
+(import "newlisp.dll" "newlispEvalStr")
+(get-string (newlispEvalStr "(+ 3 4)"))  <span class=arw>&rarr;</span> "7"
+</pre></blockquote>		<p>
+			The above example shows the loading of a DLL using newLISP. The <a href="#get-string">get-string</a> function is necessary to access the string being returned. Other applications running on Win32 allow the returned data type to be declared when importing the function.
+		</p>
+		<p>
+			When using <tt>newlisp.so</tt>, output normally directed to the console &mdash; like <a href="#print">print</a> statements or return values &mdash; will be returned in a string pointed to by the call to <tt>newlispEvalStr</tt>. To silence the output from return values, use the <a href="#silent">silent</a> directive.
+		</p>
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="expressions"></a>
+		<h2>
+			6. Evaluating newLISP expressions
+		</h2>
+		<p>
+			The following is a short introduction to LISP statement evaluation and the role of integer and floating point arithmetic in newLISP.
+		</p>
+		<p>
+			Top-level expressions are evaluated when using the <a href="#load"> load</a> function or when entering expressions in console mode on the command line. As shown in the following snippet from an interactive session, multiline expressions can be entered by enclosing them between <tt>[cmd]</tt> and <tt>[/cmd]</tt> tags:
+		</p>
+<blockquote><pre>
+&gt; [cmd]
+(define (foo x y)
+(+ x y))
+[/cmd]
+<strong>(lambda (x y) (+ x y))</strong>
+&gt; (foo 3 4)
+<strong>7</strong>
+&gt; _
+</pre></blockquote>		<p>
+			Each <tt>[cmd]</tt> and <tt>[/cmd]</tt> tag is entered on a separate line. This mode is useful for pasting multiline code into the interactive console.
+		</p>
+		<br />
+		<a name="int_float"></a>
+		<h3>
+			Integer data, floating point data, and operators
+		</h3>
+		<p>
+			newLISP functions and operators accept integer and floating point numbers, converting them into the needed format. For example, a bit-manipulating operator converts a floating point number into an integer by omitting the fractional part. In the same fashion, a trigonometric function will internally convert an integer into a floating point number before performing its calculation.
+		</p>
+		<p>
+			The symbol operators (<tt>+</tt> <tt>-</tt> <tt>*</tt> <tt>/</tt> <tt>%</tt> <tt>$</tt> <tt>~</tt> <tt>|</tt> <tt>^</tt> <tt>&lt;&lt;</tt> <tt>&gt;&gt;</tt>) return values of type integer. Functions and operators named with a word instead of a symbol (e.g., <tt>add</tt> rather than <tt>+</tt>) return floating point numbers. Integer operators truncate floating point numbers to integers, discarding the fractional parts.
+		</p>
+		<p>
+			newLISP has two types of basic arithmetic operators: integer (<tt>+</tt> <tt>-</tt> <tt>*</tt> <tt>/</tt>) and floating point (<tt>add</tt> <tt>sub</tt> <tt>mul</tt> <tt>div</tt>). The arithmetic functions convert their arguments into types compatible with the function's own type: integer function arguments into integers, floating point function arguments into floating points. To make newLISP behave more like other scripting languages, the integer operators <tt>+</tt>, <tt>-</tt>, <tt>*</tt>, and <tt>/</tt> can be redefined to perform the floating point operators <tt>add</tt>, <tt>sub</tt>, <tt>mul</tt>, and <tt>div</tt>:
+		</p>
+<blockquote><pre>
+(constant '+ add)
+(constant '- sub)
+(constant '* mul)
+(constant '/ div)
+ 
+;; or all 4 operators at once
+(constant '+ add '- sub '* mul '/ div)
+</pre></blockquote>		<p>
+			Now the common arithmetic operators <tt>+</tt>, <tt>-</tt>, <tt>*</tt>, and <tt>/</tt> accept both integer and floating point numbers and return floating point results.
+		</p>
+		<p>
+			Note that the looping variables in <a href="#dotimes">dotimes</a> and <a href="#for">for</a>, as well as the result of <a href="#sequence">sequence</a>, use floating point numbers for their values.
+		</p>
+		<p>
+			Care must be taken when importing from libraries that use functions expecting integers. After redefining <tt>+, -, *</tt>, and <tt>/</tt>, a double floating point number may be unintentionally passed to an imported function instead of an integer. In this case, floating point numbers can be converted into integers by using the function <a href="#int">int</a>. Likewise, integers can be transformed into floating point numbers using the <a href="#float">float</a> function:
+		</p>
+<blockquote><pre>
+(import "mylib.dll" "foo")  ; importing int foo(int x) from C
+(foo (int x))               ; passed argument as integer
+(import "mylib.dll" "bar")  ; importing C int bar(double y)
+(bar (float y))             ; force double float
+</pre></blockquote>		<p>
+			Some of the modules shipping with newLISP are written assuming the default implementations of <tt>+</tt>, <tt>-</tt>, <tt>*</tt>, and <tt>/</tt>. This gives imported library functions maximum speed when performing address calculations.
+		</p>
+		<p>
+			The newLISP preference is to leave <tt>+</tt>, <tt>-</tt>, <tt>*</tt>, and <tt>/</tt> defined as integer operators and use <tt>add</tt>, <tt>sub</tt>, <tt>mul</tt>, and <tt>div</tt> when explicitly required.
+Since version 8.9.7 integer operations in newLISP are 64 bit operations, while 64 bit double floating
+point numbers only offer 52 bits of resolution in the integer part of the number.
+		</p>
+		
+		
+		
+		
+		
+		<br />
+		<a name="eval_rules"></a>
+		<h3>
+			Evaluation rules and data types
+		</h3>
+		<p>
+			Evaluate expressions by entering and editing them on the command line. More complicated programs can be entered using editors like Emacs and VI, which have modes to show matching parentheses while typing. Load a saved file back into a console session by using the <a href="#load">load</a> function.
+		</p>
+		<p>
+			A line comment begins with a <tt>;</tt> (semicolon) or a <tt>#</tt> (number sign) and extends to the end of the line. newLISP ignores this line during evaluation. The <tt>#</tt> is useful when using newLISP as a scripting language in Linux/UNIX environments, where the <tt>#</tt> is commonly used as a line comment in scripts and shells.
+		</p>
+		<p>
+			When evaluation occurs from the command line, the result is printed to the console window.
+		</p>
+		<p>
+			The following examples can be entered on the command line by typing the code to the left of the &nbsp;&nbsp;<span class=arw>&rarr;</span> symbol. The result that appears on the next line should match the code to the right of the &nbsp;&nbsp;<span class=arw>&rarr;</span> symbol.
+		</p>
+		<p>
+			<strong>nil</strong> and <strong>true</strong> are boolean data types that evaluate to themselves:
+		</p>
+<blockquote><pre>
+nil    <span class=arw>&rarr;</span> nil
+true   <span class=arw>&rarr;</span> true
+</pre></blockquote>		<p>
+			<strong>Integers</strong> and <strong>floating point</strong> numbers evaluate to themselves:
+		</p>
+<blockquote><pre>
+123    <span class=arw>&rarr;</span> 123
+0xE8   <span class=arw>&rarr;</span> 232    ; hexadecimal prefixed by 0x
+055    <span class=arw>&rarr;</span> 45     ; octal prefixed by 0 (zero)
+1.23   <span class=arw>&rarr;</span> 1.23
+123e-3 <span class=arw>&rarr;</span> 0.123  ; scientific notation
+</pre></blockquote>		
+         <p>
+			Integers are 64-bit numbers (including the sign bit, 32-bit before version 8.9.7). 
+            Valid integers are numbers between -9,223,372,036,854,775,808 and
+            +9,223,372,036,854,775,807.
+            Larger numbers converted from floating point numbers are truncated 
+            to one of the two limits. Integers internal to newLISP, which
+            are limited to 32-bit numbers overflow to either +2,147,483,647 or
+            -2,147,483,648. Floating point numbers are IEEE 754 64-bit doubles.
+            Unsigned numbers up to 18,446,744,073,709,551,615 can be displayed
+            using special formatting characters for <a href="#format">format</a>.
+		</p>
+
+		<p>
+			<strong>Strings</strong> may contain null characters and can have different delimiters. They evaluate to themselves.
+		</p>
+<blockquote><pre>
+"hello"             <span class=arw>&rarr;</span>"hello"  
+"\032\032\065\032"  <span class=arw>&rarr;</span>"  A " 
+"\x20\x20\x41\x20"  <span class=arw>&rarr;</span>"  A "
+"\t\r\n"            <span class=arw>&rarr;</span>"\t\r\n" 
+"\x09\x0d\x0a"      <span class=arw>&rarr;</span>"\t\r\n"
+
+;; null characters are legal in strings:
+"\000\001\002"       <span class=arw>&rarr;</span> "\000\001\002"
+{this "is" a string} <span class=arw>&rarr;</span> "this \"is\" a string"
+ 
+;; use [text] tags for text longer than 2048 bytes:
+[text]this is a string, too[/text]
+<span class=arw>&rarr;</span> "this is a string, too"
+			
+</pre></blockquote>		<p>
+			Strings delimited by <tt>"</tt> (double quotes) will also process the following characters escaped with a <tt>\</tt> (backslash):
+		</p>
+<br />
+<center>
+<table class="list" width="95%" summary="special characters in strings">
+<tr align="left"><th>escaped<br />character</th><th>description</th></tr>
+<tr><td class="left"><tt>\"</tt></td><td class="right">for a double quote inside a quoted string</td></tr>
+<tr><td class="left"><tt>\n</tt></td><td class="right">for a line-feed character (ASCII 10)</td></tr>
+<tr><td class="left"><tt>\r</tt></td><td class="right">for a return character (ASCII 13)</td></tr>
+<tr><td class="left"><tt>\t</tt></td><td class="right">for a TAB character (ASCII 9)</td></tr>
+<tr><td class="left"><tt>\nnn</tt></td><td class="right">for a three-digit ASCII number (nnn format between 000 and 255)</td></tr>
+<tr><td class="left"><tt>\xnn</tt></td><td class="right">for a two-hex-digit ASCII number (xnn format between x00 and xff)</td></tr>
+</table>
+</center>
+<br />
+		<p>
+			Quoted strings cannot exceed 2,048 characters. Longer strings should use the <tt>[text]</tt> and <tt>[/text]</tt> tag delimiters. newLISP automatically uses these tags for string output longer than 2,048 characters.
+		</p>
+		<p>
+			The <tt>{</tt> (left curly bracket), <tt>}</tt> (right curly bracket), and <tt>[text], [/text]</tt> delimiters do not perform escape character processing.
+		</p>
+		<p>
+			<strong>Lambda and lambda-macro expressions</strong> evaluate to themselves:
+		</p>
+<blockquote><pre>
+(lambda (x) (* x x))                   <span class=arw>&rarr;</span> (lambda (x) (* x x))
+(lambda-macro (a b) (set (eval a) b))  <span class=arw>&rarr;</span> (lambda (x) (* x x))
+(fn (x) (* x x))                       <span class=arw>&rarr;</span> (lambda (x) (* x x))  ; an alternative syntax
+</pre></blockquote>		<p>
+			<strong>Symbols</strong> evaluate to their contents:
+		</p>
+<blockquote><pre>
+(set 'something 123)  <span class=arw>&rarr;</span> 123
+something             <span class=arw>&rarr;</span> 123
+</pre></blockquote>		<p>
+			<strong>Contexts</strong> evaluate to themselves:
+		</p>
+<blockquote><pre>
+(context 'CTX)  <span class=arw>&rarr;</span> CTX
+CTX             <span class=arw>&rarr;</span> CTX
+</pre></blockquote>		<p>
+			<strong>Built-in functions</strong> also evaluate to themselves:
+		</p>
+<blockquote><pre>
+add                <span class=arw>&rarr;</span> add &lt;B845770D&gt;
+(eval (eval add))  <span class=arw>&rarr;</span> add &lt;B845770D&gt;
+(constant '+ add)  <span class=arw>&rarr;</span> add &lt;B845770D&gt;
++                  <span class=arw>&rarr;</span> add &lt;B845770D&gt;
+</pre></blockquote>		<p>
+			In the above example, the number between the &lt; &gt; (angle brackets) is the hexadecimal memory address (machine-dependent) of the <tt>add</tt> function. It is displayed when printing a built-in primitive.
+		</p>
+		<p>
+			<strong>Quoted expressions</strong> lose one ' (single quote) when evaluated:
+		</p>
+<blockquote><pre>
+'something  <span class=arw>&rarr;</span> something
+''''any     <span class=arw>&rarr;</span> '''any
+'(a b c d)  <span class=arw>&rarr;</span> (a b c d)
+</pre></blockquote>		<p>
+			A single quote is often used to <em>protect</em> an expression from evaluation (e.g., when referring to the symbol itself instead of its contents or to a list representing data instead of a function).
+		</p>
+		
+<p>In newLISP, a <strong>list</strong>'s first element is evaluated 
+before the rest of the expression (as in Scheme). The result of the 
+evaluation is applied to the remaining elements in the list and must 
+be one of the following: a <em>lambda</em> expression, <em>lambda-macro</em> 
+expression, or <em>primitive</em> (built-in) function.
+</p>
+
+<blockquote><pre>
+(+ 1 2 3 4)                  <span class=arw>&rarr;</span> 10
+(define (double x) (+ x x))  <span class=arw>&rarr;</span> (lambda (x) (+ x x))
+</pre></blockquote>		<p>
+			or
+		</p>
+<blockquote><pre>
+(set 'double (lambda (x) (+ x x)))
+(double 20)               <span class=arw>&rarr;</span> 40
+((lambda (x) (* x x)) 5)  <span class=arw>&rarr;</span> 25
+</pre></blockquote>		<p>
+			For a user-defined lambda expression, newLISP evaluates the arguments from left to right and binds the results to the parameters (also from left to right), before using the results in the body of the expression.
+		</p>
+		<p>
+			Like Scheme, newLISP evaluates the <em>functor</em> (function object) part of an expression before applying the result to its arguments. For example:
+		</p>
+<blockquote><pre>
+((if (&gt; X 10) * +) X Y)
+</pre></blockquote>		
+
+<p>Depending on the value of X, this expression applies the <tt>*</tt> 
+(product) or <tt>+</tt> (sum) function to X and Y.
+</p>
+
+<p>Because their arguments are not evaluated, <strong>lambda-macro</strong> 
+expressions are useful for extending the syntax of the language. Most 
+built-in functions evaluate their arguments from left to right (as needed) 
+when executed. Some exceptions to this rule are indicated in the reference 
+section of this manual. LISP functions that do not evaluate all or some of 
+their arguments are called <em>special forms</em>.
+</p>
+
+<p><strong>Arrays</strong> evaluate to themselves:</p>
+
+<blockquote><pre>
+(set 'A (array 2 2 '(1 2 3 4))) <span class=arw>&rarr;</span> ((1 2) (3 4))
+(eval A)                        <span class=arw>&rarr;</span> ((1 2) (3 4))
+</pre></blockquote></blockquote
+
+
+<p><strong>Shell commands</strong>: If an <tt>!</tt> (exclamation mark) 
+is entered as the first character on the command line followed by a shell 
+command, the command will be executed. For example, <tt>!ls</tt> on Unix or 
+<tt>!dir</tt> on Win32 will display a listing of the present working directory. 
+No spaces are permitted between the <tt>!</tt> and the shell command. Symbols 
+beginning with an <tt>!</tt> are still allowed inside expressions or  on the 
+command line when preceded by a space. Note: This mode only works when running 
+in the shell and does not work when controlling newLISP from another 
+application.
+</p>
+		
+<p>To exit the newLISP shell on Linux/UNIX, press <tt>Ctrl-D</tt>; on Win32, 
+type <tt>(exit)</tt> or <tt>Ctrl-C</tt>, then the x key.
+</p>
+
+<p>Use the <a href="#exec">exec</a> function to access shell commands from 
+other applications or to pass results back to newLISP.
+</p>
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="lambda_expressions"></a>
+		<h2>
+			7. Lambda expressions in newLISP
+		</h2>
+		<p>
+		Lambda expressions in newLISP evaluate to themselves and can be treated
+		just like regular lists:
+<blockquote><pre>
+(set 'double (lambda (x) (+ x x))
+(set 'double (fn (x) (+ x x))      ; alternative syntax
+ 
+(last double)  <span class=arw>&rarr;</span> (+ x x)          ; treat lambda as a list
+			
+</pre></blockquote>		<p>
+			Note: No <tt>'</tt> is necessary before the lambda expression since lambda expressions evaluate to themselves in newLISP.
+		</p>
+		<p>
+			The second line uses the keyword <tt>fn</tt>, an alternative syntax first suggested by Paul Graham for his Arc language project.
+		</p>
+		<p>
+			A lambda expression is a <em>lambda list</em>, a subtype of <em>list</em>, and its arguments can associate from left to right or right to left. When using <a HREF="#append">append</a>, for example, the arguments associate from left to right:
+		</p>
+<blockquote><pre>
+(append (lambda (x)) '((+ x x)))  <span class=arw>&rarr;</span> (lambda (x) (+ x x))
+</pre></blockquote>		<p>
+			<a HREF="#cons">cons</a>, on the other hand, associates the arguments from right to left:
+		</p>
+<blockquote><pre>
+(cons '(x) (lambda (+ x x)))  <span class=arw>&rarr;</span> (lambda (x) (+ x x))
+</pre></blockquote>		<p>
+			Note that the <tt>lambda</tt> keyword is not a symbol in a list, but a
+			designator of a special <em>type</em> of list: the <em>lambda list</em>.
+		</p>
+<blockquote><pre>
+(length (lambda (x) (+ x x)))  <span class=arw>&rarr;</span> 2
+(first (lambda (x) (+ x x)))   <span class=arw>&rarr;</span> (x)
+</pre></blockquote>		<p>
+			Lambda expressions can be mapped or applied onto arguments to work as user-defined, anonymous functions:
+		</p>
+<blockquote><pre>
+((lambda (x) (+ x x)) 123)           <span class=arw>&rarr;</span> 246
+(apply (lambda (x) (+ x x)) '(123))  <span class=arw>&rarr;</span> 246
+(map (lambda (x) (+ x x)) '(1 2 3))  <span class=arw>&rarr;</span> (2 4 6)
+</pre></blockquote>		<p>
+			A lambda expression can be assigned to a symbol, which in turn can be used as a function:
+		</p>
+<blockquote><pre>
+(set 'double (lambda (x) (+ x x)))  <span class=arw>&rarr;</span> 246
+(double 123)                        <span class=arw>&rarr;</span> (lambda (x) (+ x x))
+</pre></blockquote>		<p>
+			The <a href="#define">define</a> function is just a shorter way of
+			assigning a lambda expression to a symbol:
+		</p>
+<blockquote><pre>
+(define (double x) (+ x x)))  <span class=arw>&rarr;</span> (lambda (x) (+ x x))
+(double 123)                  <span class=arw>&rarr;</span> 246
+</pre></blockquote>		<p>
+			In the above example, the expressions inside the lambda list are still accessible within <tt>double</tt>:
+		</p>
+<blockquote><pre>
+(set 'double (lambda (x) (+ x x)))  <span class=arw>&rarr;</span> (lambda (x) (+ x x))
+(last double)                       <span class=arw>&rarr;</span> (+ x x)
+</pre></blockquote>		<p>
+			A lambda list can be manipulated as a first-class object using any function that operates on lists:
+		</p>
+<blockquote><pre>
+(set-nth (double 1) '(mul 2 x))  <span class=arw>&rarr;</span> (lambda (x) (mul 2 x))
+double                         <span class=arw>&rarr;</span> (lambda (x) (mul 2 x))
+(double 123)                   <span class=arw>&rarr;</span> 246
+</pre></blockquote>		<p>
+			All arguments are optional when applying lambda expressions and default to <tt>nil</tt> when not supplied by the user. This makes it possible to write functions with multiple parameter signatures.
+		</p>
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="nil_and_true"></a>
+		<h2>
+			8. <tt>nil</tt>, <tt>true</tt>, <tt>cons</tt>, and <tt>()</tt>
+		</h2>
+		<p>
+			In newLISP, <tt>nil</tt> and <tt>true</tt> represent both the symbols and the boolean values <em>true</em> and <em>false</em>. Depending on their context, <tt>nil</tt> and <tt>true</tt> are treated differently. The following examples use <tt>nil</tt>, but they can be applied to <tt>true</tt> by simply reversing the logic.
+		</p>
+		<p>
+			Evaluation of <tt>nil</tt> yields a boolean false and is treated as such inside control flow expressions, such as <tt>if</tt>, <tt>unless</tt>, <tt>while</tt>, <tt>until</tt>, and <tt>not</tt>. Likewise, evaluating <tt>true</tt> yields true.
+		</p>
+<blockquote><pre>
+(set 'lst '(nil nil nil))  <span class=arw>&rarr;</span> (nil nil nil)
+(map symbol? lst)          <span class=arw>&rarr;</span> (true true true)
+</pre></blockquote>		<p>
+			In the above example, <tt>nil</tt> represents a symbol. In the following example, <tt>nil</tt> and <tt>true</tt> are evaluated and represent boolean values:
+		</p>
+<blockquote><pre>
+(if nil "no" "yes")  <span class=arw>&rarr;</span> "yes"
+(if true "yes" "no") <span class=arw>&rarr;</span> "yes"
+(map not lst)        <span class=arw>&rarr;</span> (true true true)
+</pre></blockquote>		<p>
+			In newLISP, <tt>nil</tt> and the empty list <tt>()</tt> are not the same as in some other LISPs. Only in conditional expressions are they treated as a boolean false, as in <tt>and</tt>, <tt>or</tt>, <tt>if</tt>, <tt>while</tt>, <tt>unless</tt>, <tt>until</tt>, and <tt>cond</tt>.
+		</p>
+		<p>
+			The expression <tt>(list? '())</tt> is true, but <tt>(list? nil)</tt> is not. This is because in newLISP, <tt>nil</tt> results in a boolean false when evaluated.
+		</p>
+		<p>
+			Evaluation of <tt>(cons x '())</tt> yields <tt>(x)</tt>, but <tt>(cons x nil)</tt> yields <tt>(x nil)</tt> because <tt>nil</tt> is treated as a boolean value when evaluated instead of as an empty list. The <tt>cons</tt> of two atoms in newLISP does not yield a dotted pair, but rather a two-element list. The predicate <tt>atom?</tt> is true for <tt>nil</tt>, but false for the empty list. The empty list in newLISP is only an empty list and not equal to <tt>nil</tt>.
+		</p>
+		<p>
+			A list in newLISP is a LISP cell of type list. It acts like a container for the linked list of elements making up the list cell's contents. There is no <em>dotted pair</em> in newLISP because the <em>cdr</em> (tail) part of a LISP cell always points to another LISP cell and never to a basic data type, such as a number or a symbol. Only the <em>car</em> (head) part may contain a basic data type. Early LISP implementations used car and cdr for the names <em>head</em> and <em>tail</em>.
+		</p>
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="arrays"></a>
+		<h2>
+			9. Arrays
+		</h2>
+		<p>
+			newLISP's arrays enable fast element access within large lists. New arrays can be constructed and initialized with the contents of an existing list using the function <a href="#array">array</a>. Lists can be converted into arrays, and vice versa. Some of the same functions used for modifying and accessing lists can be applied to arrays, as well. Arrays can hold any type of data or combination thereof.
+		</p>
+		<p>
+			In particular, the following functions can be used for creating, accessing, and modifying arrays:
+		</p>
+		<br />
+		
+<center>
+<table class="list" width="95%" summary="functions using arrays">
+<tr align="left"><th>function</th><th>description</th></tr>
+
+<tr>
+<td class="left"><a href="#append">append</a></td>
+<td class="right">appends arrays</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#array">array</a></td>
+<td class="right">creates and initializes an array with up to 16 dimensions</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#array-list">array-list</a></td>
+<td class="right">converts an array into a list</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#arrayp">array?</a></td>
+<td class="right">checks if expression is an array</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#det">det</a></td>
+<td class="right">returns the determinant of a matrix</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#first">first</a></td>
+<td class="right">returns the first row of an array</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#invert">invert</a></td>
+<td class="right">returns the inversion of a matrix</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#last">last</a></td>
+<td class="right">returns the last row of an array</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#multiply">multiply</a></td>
+<td class="right">multiplies two matrices</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#nth">nth</a></td>
+<td class="right">returns an element of and array</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#nth-set">nth-set</a></td>
+<td class="right">changes the element, returning the old; significantly faster than <tt>set-nth</tt></td>
+</tr>
+
+<tr>
+<td class="left"><a href="#rest">rest</a></td>
+<td class="right">returns all but the first row of an array</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#set-nth">set-nth</a></td>
+<td class="right">changes the element and returns the changed array</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#slice">slice</a></td>
+<td class="right">returns a slice of an array</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#sort">sort</a></td>
+<td class="right">sort the elements in an array</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#transpose">transpose</a></td>
+<td class="right">transposes a matrix</td>
+</tr>
+</table>
+</center>
+
+		<br />
+		<p>
+			newLISP represents multidimensional arrays with an array of arrays (i.e., the elements of the array are themselves arrays).
+		</p>
+		<p>
+			When used interactively, newLISP prints and displays arrays as lists, with no way of distinguishing between them.
+		</p>
+		<p>
+			Use the <a href="#source">source</a> or <a href="#save">save</a> functions to serialize arrays (or the variables containing them). The <a href="#array">array</a> statement is included as part of the definition when serializing arrays.
+		</p>
+		<p>
+			Like lists, negative indices can be used to enumerate the elements of an array, starting from the last element.
+		</p>
+		<p>
+			An out-of-bounds index will cause an error message on an array.  In contrast, lists pick the last or first element when an out-of-bounds occurs.
+		</p>
+		<p>
+			Arrays can be non-rectangular, but they are made rectangular during serialization when using <a href="#source">source</a> or <a href="#save">save</a>. The <a href="#array">array</a> function always constructs arrays in rectangular form.
+		</p>
+		<p>
+			The matrix functions <a href="#det">det</a>, <a href="#transpose">transpose</a>, <a href="#multiply">multiply</a>, and <a href="#invert">invert</a> can be used on matrices built with nested
+lists or arrays built with <a href="#array">array</a>.
+		</p>
+		<p>
+			For more details, see <a href="#array">array</a>, <a href="#arrayp">array?</a>, and <a href="#array-list">array-list</a> in the reference section of this manual.
+		</p>
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+<a NAME="hash"></a>
+<h2>
+10. Dictionaries (hash tables)
+</h2>
+
+<p>newLISP has no built-in <em>hash table</em> data type. Instead, it uses symbols for associative memory access. Symbols in newLISP are implemented using an efficient <em>red-black tree</em> algorithm. This algorithm balances the binary symbol tree for faster symbol access. In newLISP, symbol trees are represented as namespaces called <em>contexts</em>, which are themselves part of the <tt>MAIN</tt> namespace.
+</p>
+
+<p>For a more detailed introduction to <em>namespaces</em>, see the chapter on
+<a href="#contexts">Contexts</a>.
+</p>
+
+<p>The <a href="#context">context</a> function can be used to make associations. It can also be used to create and switch contexts.
+</p>
+
+<blockquote><pre>
+;; create a symbol and store data into it
+(context 'MyHash "John Doe" 123)         <span class=arw>&rarr;</span> 123
+(context 'MyHash "@#$%^" "hello world")  <span class=arw>&rarr;</span> "hello world"
+					 
+;; retrieve contents from the symbol
+(context 'MyHash "John Doe")  <span class=arw>&rarr;</span> 123
+(context 'MyHash "@#$%^")     <span class=arw>&rarr;</span> "hello world"
+</pre></blockquote>		
+
+<p>The first two statements create the symbols <tt>"John Doe"</tt> and <tt>"@#$^"</tt>, storing the values <tt>123</tt> and <tt>"hello world"</tt> into them. The hash context named <tt>MyHash</tt> is created in the first statement, while the second merely adds the new association to the existing one.
+</p>
+
+<p>
+Note that hash symbols can contain spaces or other special characters
+not typically allowed in variable names.
+</p>
+
+<p>Internally, <a href="#context">context</a> is just a shorter
+and faster form of:
+</p>
+
+<blockquote><pre>
+;; create a symbol and store the data in it
+(set (sym "John Doe" 'MyHash) 123)  <span class=arw>&rarr;</span> 123
+ 
+;; retrieve contents from the symbol
+(eval (sym "John Doe" MyHash))  <span class=arw>&rarr;</span> 123
+</pre></blockquote>		
+
+<p>The context <a href="#default_function">default function</a> can be used for a
+very short definition of a hash function:
+</p>
+
+<blockquote><pre>
+(define (myhash:myhash key value) 
+   (if value 
+       (context myhash key value) 
+       (context myhash key)))
+       
+;; create a dictionary key value pair
+(myhash "hello" 123) 	<span class=arw>&rarr;</span> 123
+
+;; retrieve the key value
+(myhash "hello")        <span class=arw>&rarr;</span> 123
+</pre></blockquote>
+
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+<a NAME="indexing"></a>
+<h2>11. Indexing elements of strings, lists, and arrays</h2>
+
+<p>Some functions take array, list, or string elements (characters) specified by one or more <em>int-index</em> (integer index). The positive indices run <tt>0, 1, &hellip;, N-2, N-1</tt>, where <tt>N</tt> is the number of elements in the list. If int-index is negative, the sequence is <tt>-N, -N+1, &hellip;, -2, -1</tt>. Adding <tt>N</tt> to the negative index of an element yields the positive index. Unless a function does otherwise, an index greater than <tt>N-1</tt> returns the last element in a list; it returns the first element for indices less than <tt>-N</tt>. An error message is produced for any indexing occurring outside an array's boundaries.</p>
+
+<br />
+<a NAME="implicit_indexing"></a>
+<h3>Implicit indexing for <tt>nth</tt></h3>
+	
+<p>Implicit indexing can be used instead of <a href="#nth">nth</a> to retrieve the elements of a list or array or the characters of a string:</p>
+
+<blockquote><pre>
+(set 'lst '(a b c (d e) (f g)))
+ 
+(lst 0)    <span class=arw>&rarr;</span> a      ; same as (nth (lst 0))
+(lst 3)    <span class=arw>&rarr;</span> (d e)
+(lst 3 1)  <span class=arw>&rarr;</span> e      ; same as (nth (lst 3 1))
+(lst -1)   <span class=arw>&rarr;</span> (f g)
+ 
+(set 'myarray (array 3 2 (sequence 1 6)))
+ 
+(myarray 1)     <span class=arw>&rarr;</span> (3 4)
+(myarray 1 0)   <span class=arw>&rarr;</span> 3
+(myarray 0 -1)  <span class=arw>&rarr;</span> 2
+                
+("newLISP" 3)   <span class=arw>&rarr;</span> "L"
+</pre></blockquote>		
+
+<p>Indices may also be supplied from a list. In this way, implicit indexing works together with functions that take or produce index vectors, such as <a href="#push">push</a>, <a href="#pop">pop</a>, <a href="#ref">ref</a>
+and <a href="#ref-all">ref-all</a>.</p>
+
+<blockquote><pre>
+(lst '(3 1))             <span class=arw>&rarr;</span> e
+(set 'vec (ref 'e lst))  <span class=arw>&rarr;</span> (3 1)
+(lst vec)                <span class=arw>&rarr;</span> e
+</pre></blockquote>		
+
+<p>Note that implicit indexing is not breaking Lisp
+syntax rules but is merely an expansion of existing rules to
+other data types in the functor position of an s-expression. 
+In original Lisp the first element in an s-expression list
+is applied as a function to the rest elements as arguments. In newLISP a list 
+in the functor position of an s-expression assumes self-indexing functionality 
+using the index arguments following it.</p>
+
+<p>Implicit indexing is faster than the explicit forms, but the explicit forms
+may be more readable depending on context.</p>
+
+<p>Note that in the UTF-8&ndash;enabled version of newLISP, implicit indexing of strings using the <a href="#nth">nth</a> function works on character rather than byte boundaries.</p>
+
+<br />
+		
+
+<a NAME="implicit_default"></a>
+<h3>Implicit indexing and the default functor</h3>
+
+<p>The <em>default functor</em> is a functor inside a context with the same name as the context itself. See <a href="#default_function">The context default function</a> chapter. A default functor can be used together with implicit indexing to serve as a mechanism for referencing lists:</p>
+
+<blockquote><pre>
+(set 'MyList:MyList '(a b c d e f g))
+
+(MyList 0)   <span class=arw>&rarr;</span> a
+(MyList 3)   <span class=arw>&rarr;</span> d
+(MyList -1)  <span class=arw>&rarr;</span> g
+
+(3 2 MyList) <span class=arw>&rarr;</span> (d e)
+(-3 MyList)  <span class=arw>&rarr;</span> (e f g)
+ 
+(set 'aList MyList)
+ 
+(aList 3)  <span class=arw>&rarr;</span> d
+</pre></blockquote>		
+
+<p>In this example, <tt>aList</tt> references <tt>MyList:MyList</tt>, not a copy of it. For more information about contexts, see <a href="#context_objects">Programming with contexts</a>.</p>
+
+<p>The default functor can also be used with <a href="#nth-set">nht-set</a> as shown in the following
+example:</p>
+
+<blockquote><pre>
+(set 'MyList:MyList '(a b c d e f g))
+
+(nth-set (MyList 3) 999)   <span class=arw>&rarr;</span> d
+(MyList 3)                 <span class=arw>&rarr;</span> 999
+</pre></blockquote>
+
+<br />
+<a NAME="implicit_rest_slice"></a>
+<h3>Implicit indexing for <tt>rest</tt> and <tt>slice</tt> </h3>
+
+<p> Implicit forms of <a href="#rest">rest</a> and <a href="#slice">slice</a> 
+can be created by prepending a list with one or two numbers for offset and length.
+If the length is negative it counts from the end of the list or string:</p>
+
+<blockquote><pre>
+(set 'lst '(a b c d e f g))
+; or as array
+(set 'lst (array 7 '(a b c d e f g)))
+
+(1 lst)      <span class=arw>&rarr;</span> (b c d e f g)
+(2 lst)      <span class=arw>&rarr;</span> (c d e f g)
+(2 3 lst)    <span class=arw>&rarr;</span> (c d e)
+(-3 2 lst)   <span class=arw>&rarr;</span> (e f)
+(2 -2 lst)   <span class=arw>&rarr;</span> (d e)
+
+(set 'str "abcdefg")
+
+(1 str)      <span class=arw>&rarr;</span> "bcdefg"
+(2 str)      <span class=arw>&rarr;</span> "cdefg"
+(2 3 str)    <span class=arw>&rarr;</span> "cde"
+(-3 2 str)   <span class=arw>&rarr;</span> "ef"
+(2 -2 str)   <span class=arw>&rarr;</span> "de"
+</pre></blockquote>	
+
+<p>Implicit indexing for <a href="#rest">rest</a> works on
+character rather than byte boundaries when using the UTF-8&ndash;enabled version 
+of newLISP, whereas implicit indexing for <a href="#slice">slice</a> will always
+work on byte boundaries and can be used for binary content.</p>
+
+<br />		
+		
+<a NAME="implicit_nth-set"></a>
+
+<h3>Implicit indexing for <tt>nth-set</tt> and <tt>set-nth</tt></h3>
+
+<blockquote>
+<pre>
+
+(set 'aList '(a b c (d e (f g) h i) j k))
+
+(nth-set (aList 0) 1) <span class=arw>&rarr;</span> a
+
+(nth-set (aList 3 2) '(1 2 3 4)) <span class=arw>&rarr;</span> (f g)
+
+(set 'i 3 'j 2 'k 2)
+
+(nth-set (aList i j k) 99) <span class=arw>&rarr;</span> 3
+
+aList 
+<span class=arw>&rarr;</span> (1 b c (d e (1 2 99 4) h i) j k)
+
+(set-nth (aList -3 -3 2) 999) 
+<span class=arw>&rarr;</span> (1 b c (d e (1 2 999 4) h i) j k)
+</pre>
+</blockquote>
+
+<p>As with <a href="#nth">nth</a>, indices can be supplied in a vector list to work together with
+functions handling index vectors such as <a href="#push">push</a>, <a href="#pop">pop</a>, <a href="#ref">ref</a>
+and <a href="#ref-all">ref-all</a>.<p>
+
+<blockquote>
+<pre>
+
+(set 'aList '(a b c (d e (f g) h i) j k))
+
+(set 'vec (ref 'f aList))   <span class=arw>&rarr;</span> (3 2 0)
+
+(set-nth (aList vec) 999)
+
+(set-nth (aList vec) 999)   <span class=arw>&rarr;</span> (a b c (d e (999 g) h i) j k)
+
+(nth-set (aList vec) 'Z)   <span class=arw>&rarr;</span> 999 ; old value
+
+aList   <span class=arw>&rarr;</span> (a b c (d e (Z g) h i) j k)
+</pre>
+</blockquote>
+
+<br />
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		
+		<a NAME="destructive"></a>
+		<h2>
+			12. Destructive versus nondestructive functions
+		</h2>
+		<p>
+			Most of the primitives in newLISP are nondestructive (no <em>side effects</em>) and leave existing objects untouched, although they may create new ones. There are a few destructive functions, however, that <em>do</em> change the contents of a list, string, or variable:
+		</p>
+<br />
+<center>
+<table class="list" width="95%" summary="destructive functions">
+<tr align="left"><th>function</th><th>description</th></tr>
+
+<tr>
+<td class="left"><a href="#bind">bind</a></td>
+<td class="right">binds variable associations in a list</td>
+</tr>
+<tr>
+<td class="left"><a href="#constant">constant</a></td>
+<td class="right">sets the contents of a variable and protects it</td>
+</tr>
+<tr>
+<td class="left"><a href="#dec">dec</a></td>
+<td class="right">decrements the value in a variable</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#inc">inc</a></td>
+<td class="right">increments the value in a variable</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#net-receive">net-receive</a></td>
+<td class="right">reads into a buffer variable</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#pop">pop</a></td>
+<td class="right">pops an element from a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#pop-assoc">pop-assoc</a></td>
+<td class="right">remove an association from an association list</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#push">push</a></td>
+<td class="right">pushes a new element onto a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#push-assoc">push-assoc</a></td>
+<td class="right">remove an association from an association list</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#read-buffer">read-buffer</a></td>
+<td class="right">reads into a buffer variable</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#replace">replace</a></td>
+<td class="right">replaces elements in a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#replace-assoc">replace-assoc</a></td>
+<td class="right">replace an element in an association list</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#reverse">reverse</a></td>
+<td class="right">reverses a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#rotate">rotate</a></td>
+<td class="right">rotates the elements of a list or characters of a string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#set">set, setq</a></td>
+<td class="right">sets the contents of a variable</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#set-assoc">set-assoc</a>, <a href="#assoc-set">assoc-set</a></td>
+<td class="right">replaces an element in an association list</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#set-nth">set-nth</a>, <a href="#nth-set">nth-set</a></td>
+<td class="right">changes an element in a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#set-ref">set-ref</a>, <a href="#ref-set">ref-set</a></td>
+<td class="right">searches for an element in a nested list and replaces it</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#set-ref-all">set-ref-all</a></td>
+<td class="right">searches for an element in a nested list and replaces all instances</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#sort">sort</a></td>
+<td class="right">sorts the elements of a list or array</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#swap">swap</a></td>
+<td class="right">swaps two elements inside a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#write-buffer">write-buffer</a></td>
+<td class="right">writes to a string buffer or file</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#write-line">write-line</a></td>
+<td class="right">writes to a string buffer or file</td>
+</tr>
+
+</table></center>
+<br />
+
+<p>Note that the last two functions, <a href="#write-buffer">write-buffer</a> and <a href="#write-line"> write-line</a>, are only destructive in one of their syntactic forms: when taking a string buffer instead of a file handle.</p>
+
+<br />
+
+<a NAME="make_nondestructive"></a>
+<h3>Make a destructive function non-destructive</h3>
+
+<p>Some destructive functions can be made non-destruvtive by wrapping the target object into a <a href="#begin">begin</a>
+block. A block returns a copy of the last evaluation in the block and the destructive function will work on the
+copy instead of the original.</p>
+
+<blockquote><pre>
+(set 'aList '(a b c d e f))
+
+(replace 'c (begin aList)) <span class=arw>&rarr;</span> (a b d e f)
+
+aList <span class=arw>&rarr;</span> (a b c d e f)
+
+(set 'str "newLISP") <span class=arw>&rarr;</span> "newLISP"
+
+(rotate (begin str)) <span class=arw>&rarr;</span> "PnewLIS"
+
+str <span class=arw>&rarr;</span> "newLISP" 
+</pre></blockquote>
+
+<br />
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="scoping"></a>
+		<h2>
+			13. Dynamic and lexical scoping
+		</h2>
+		<p>
+			newLISP uses dynamic scoping <em>inside</em> contexts. A context is a lexically closed namespace. In this way, parts of a newLISP program can live in different namespaces taking advantage of <em>lexical scoping</em>.
+		</p>
+		<p>
+			When the parameter symbols of a lambda expression are bound to its arguments, the old bindings are pushed on a stack. newLISP automatically restores the original variable bindings when leaving the lambda function.
+		</p>
+		<p>
+			The following example illustrates the <em>dynamic scoping</em> mechanism. The text in bold is the output from newLISP:
+		</p>
+<blockquote><pre>
+&gt; (set 'x 1)
+<b>1</b>
+&gt; (define (f) x)
+<b>(lambda () x)</b>
+&gt; (f)
+<b>1</b>
+&gt; (define (g x) (f))
+<b>(lambda (x) (f))</b>
+&gt; (g 0)
+<b>0</b>
+&gt; (f)
+<b>1</b> 
+&gt; _
+</pre></blockquote>	
+	
+<p>The variable <tt>x</tt> is first set to <tt>1</tt>, but when <tt>(g 0)</tt> is called <tt>x</tt> is
+bound to <tt>0</tt> and <tt>x</tt> is reported by <tt>(f)</tt> as <tt>0</tt> during execution of <tt>(g 0)</tt>. After execution of <tt>(g 0)</tt> the call to <tt>(f)</tt> will report <tt>x</tt> as <tt>1</tt> again.</p>
+
+<p>This is different from the <em>lexical scoping</em> mechanisms found in languages like C or Java, where the binding of local parameters occurs inside the function only. In lexically scoped languages like C, <tt>(f)</tt> would always print the global bindings of the symbol <tt>x</tt> with <tt>1</tt>.
+		</p>
+		<p>
+			Be aware that passing quoted symbols to a user-defined function causes a name clash if the same variable name is used as a function parameter:
+		</p>
+<blockquote><pre>
+(define (inc-symbol x y) (inc x y))
+(set 'y 200)
+(inc-symbol 'y 123)  <span class=arw>&rarr;</span> 246
+y                    <span class=arw>&rarr;</span> 200  ; y is still 200
+</pre></blockquote>		<p>
+			Since <tt>'y</tt> shares the same name as the function's second parameter, <tt>inc-symbol</tt> returns 246 (123 + 123), leaving <tt>'y</tt> unaffected. Dynamic scoping's <em>variable capture</em> can be a disadvantage when passing symbol references to user-defined functions.
+		</p>
+		<p>
+			The problem is avoided entirely by grouping related user-defined functions into a <a href="#contexts">context</a>. A symbol name clash cannot occur when accessing symbols and calling functions from <em>outside</em> of the defining context.
+		</p>
+		<p>
+			Contexts should be used to group related functions when creating interfaces or function libraries. This surrounds the functions with a lexical "fence," thus avoiding variable name clashes with the calling functions.
+		</p>
+		<p>
+			newLISP uses contexts for different forms of lexical scoping. See the chapters <a href="#contexts">Contexts</a> and <a href="#context_objects">Programming with contexts</a>, as well as the section <a href="#default_function">default functions</a> for more information.
+		</p>
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="return"></a>
+		<h2>
+			14. Early return from functions, loops, and blocks
+		</h2>
+		<p>
+			What follows are methods of interrupting the control flow inside both loops and the <a href="#begin">begin</a> expression.
+		</p>
+		
+		<p>The looping functions <a href="#dolist">dolist</a> and <a href="#dotimes">
+dotimes</a> can take optional conditional expressions to leave the loop
+early. <a href="#catch">catch</a> and <a href="#throw">throw</a> are a more
+general form to break out of a loop body and are also applicable to other
+forms or statement blocks.
+</p>
+
+		<br />
+		<a NAME="flow_catch_throw"></a>
+		<h3>
+			Using <tt>catch</tt> and <tt>throw</tt>
+		</h3>
+		<p>
+			Because newLISP is a functional language, it uses no <tt>break</tt> or <tt>return</tt> statements to exit functions or iterations. Instead, a block or function can be exited at any point using the functions <a href="#catch">catch</a> and <a href="#throw">throw</a>:
+		</p>
+<blockquote><pre>
+(define (foo x)
+    (&hellip;)
+    (if condition (throw 123))
+    (&hellip;)
+    456)
+											 
+;; if condition is true
+
+(catch (foo p))  <span class=arw>&rarr;</span> 123
+											 
+;; if condition is not true
+											 
+(catch (foo p))  <span class=arw>&rarr;</span> 456
+</pre></blockquote>		<p>
+			Breaking out of loops works in a similar way:
+		</p>
+<blockquote><pre>
+(catch
+    (dotimes (i N)
+        (if (= (foo i) 100) (throw i))))
+<span class=arw>&rarr;</span> value of i when foo(i) equals 100
+</pre></blockquote>		<p>
+			The example shows how an iteration can be exited before executing <tt>N</tt> times.
+		</p>
+		<p>
+			Multiple points of return can be coded using <a href="#throw">throw</a>:
+		</p>
+<blockquote><pre>
+(catch (begin
+    (foo1)
+    (foo2)
+    (if condition-A (throw 'x))
+    (foo3)
+    (if condition-B (throw 'y))
+    (foo4)
+    (foo5)))
+</pre></blockquote>		<p>
+			If <tt>condition-A</tt> is true, <tt>x</tt> will be returned from the <tt>catch</tt> expression; if <tt>condition-B</tt> is true, the value returned is <tt>y</tt>. Otherwise, the result from <tt>foo5</tt> will be used as the return value.
+		</p>
+		<p>
+			As an alternative to <a href="#catch">catch</a>, the <a href="#throw-error">throw-error</a> function can be used
+			to catch errors caused by faulty code 
+			or user-initiated exceptions.
+		</p>
+		<br />
+		<a name="flow_and_or"></a>
+		<h3>
+			Using <tt>and</tt> and <tt>or</tt>
+		</h3>
+		<p>
+			Using the logical functions <a href="#and">and</a> and <a href="#or">or</a>, blocks of statements can be built that are exited depending on the boolean result of the enclosed functions:
+		</p>
+<blockquote><pre>
+(and
+    (func-a)
+    (func-b)
+    (func-c)
+    (func-d))
+</pre></blockquote>		<p>
+			The <a href="#and">and</a> expression will return as soon as one of the block's functions returns <tt>nil</tt> or an <tt>()</tt> (empty list). If none of the preceding functions causes an exit from the block, the result of the last function is returned.
+		</p>
+ 		<p>
+			<a href="#or">or</a> can be used in a similar fashion:
+		</p>
+<blockquote><pre>
+(or
+    (func-a)
+    (func-b)
+    (func-c)
+    (func-d))
+</pre></blockquote>		<p>
+			The result of the <a href="#or">or</a> expression will be the first function that returns a value which is <em>not</em> <tt>nil</tt> or <tt>()</tt>.
+		</p>
+		
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+<a name="contexts"></a>
+<h2>15. Contexts</h2>
+
+<p>In newLISP, symbols can be separated into namespaces called <em>contexts</em>. Each context has a private symbol table lexically separate from all other contexts. Symbols known in one context are unknown in others, so the same name may be used in different contexts without conflict.</p>
+
+<p>Contexts are used to build modules of isolated variable and function definitions. They can also be copied and dynamically assigned to variables or passed as arguments. Because contexts in newLISP have lexically separated namespaces, they allow programming with <em>lexical scoping</em> and software object styles of programming.</p>
+
+<p>Contexts are identified by symbols that are part of the root or <tt>MAIN</tt> context. While context symbols are uppercased in this chapter, lowercase symbols may also be used.</p>
+
+<p>In addition to context names, <tt>MAIN</tt> contains the symbols for built-in functions and special symbols such as <tt>true</tt> and <tt>nil</tt>. The <tt>MAIN</tt> context is created automatically each time newLISP is run. To see all the symbols in <tt>MAIN</tt>, enter the following expression after starting newLISP:</p>
+
+<blockquote><pre>
+(symbols)
+</pre></blockquote>
+
+<br />
+
+<a name="context_rules"></a>
+<h3>Symbol creation in contexts</h3>
+
+<p>The following rules should simplify the process of understanding contexts by 
+identifying which ones the created symbols are being assigned to.</p>
+
+<ol>
+<li>
+<p>newLISP first parses and translates each top level expression. The symbols 
+are created during the parsing and translation phase. After the expression 
+is translated it gets evaluated.</p>
+</li>
+
+<li>
+<p>A symbol is created when newLISP first <em>sees</em> it, when calling the 
+<a href="#load">load</a>, <a href="#sym">sym</a>, 
+or <a href="#eval-string">eval-string</a> functions. When newLISP reads 
+a source file, symbols are created <em>before</em> evaluation occurs.</p>
+</li>
+
+<li>
+<p>When an unknown symbol is encountered during code translation, 
+a search for its definition begins inside the current context. 
+Failing that, the search continues inside <tt>MAIN</tt> for a 
+built-in function, context, or global symbol. If no definition 
+is found, the symbol is created locally inside the current context.</p>
+</li>
+
+<li>
+<p>Once a symbol is created and assigned to a specific context, 
+it will belong to that context permanently.</p>
+</li>
+
+<li>
+<p>A user-defined function is evaluated in the context of the symbol it is called with.</p>
+</li>
+
+</ol>
+<br />
+<a name="scope_context"></a>
+<h3>Scoping rules for contexts</h3>
+<p>
+Special symbols like <tt>nil</tt> and <tt>true</tt>, as well as context and built-in function symbols, are global (visible to all contexts). Any symbol in the <tt>MAIN</tt> context can be made global by using the <a href="#global">global</a> function.</p>
+
+<p>The following simulates a command-line session in newLISP:</p>
+
+<blockquote><pre>
+&gt; (context 'FOO)
+<strong>FOO</strong>
+FOO&gt; _
+</pre></blockquote>		<p>
+			If the <tt>FOO</tt> context already exists, newLISP switches to it. Otherwise, the context is created before the switch occurs. All symbols now read from the command line are created and known only within the context <tt>FOO</tt>. Note that the symbol used for the context name must be quoted (<tt>'FOO</tt> in this example) the first time a context is created. Subsequent uses of <tt>context</tt> do not require the quote. After the switch, the command-line prompt changes to <tt>FOO&gt;</tt> :
+		</p>
+<blockquote><pre>
+FOO&gt; (set 'x 123)
+<strong>123</strong>
+FOO&gt; (set 'y 456)
+<strong>456</strong>
+FOO&gt; (symbols)
+<strong>(x y)</strong>
+FOO&gt; _
+</pre></blockquote>		<p>
+			To switch back to the <tt>MAIN</tt> context, use:
+		</p>
+<blockquote><pre>
+FOO&gt; (context MAIN)
+MAIN
+&gt; _
+</pre></blockquote>		<p>
+			A symbol can be referenced from outside its defining context by prepending a context name and a colon to it:
+		</p>
+<blockquote><pre>
+&gt; FOO:x
+<strong>123</strong>
+&gt; _
+</pre></blockquote>		<p>
+			The same symbol may also be used in another context:
+		</p>
+<blockquote><pre>
+&gt; (context 'FOO-B)
+<strong>FOO-B</strong>
+FOO-B&gt; (set 'x 777)
+<strong>777</strong>
+FOO-B&gt; FOO:x
+<strong>123</strong>
+&gt; _
+</pre></blockquote>		<p>
+			When quoting a fully qualified symbol (<tt>context:symbol</tt>), the quote precedes the context name:
+		</p>
+<blockquote><pre>
+&gt; (set 'FOO-B:x 555)
+<strong>555</strong>
+&gt; _
+</pre></blockquote>		<p>
+			A context is implicitly created when referring to one that does not yet exist. Unlike the <tt>context</tt> function, the context is not switched. The following statements are all executed inside the <tt>MAIN</tt> context:
+		</p>
+<blockquote><pre>
+&gt; (set 'ACTX:var "hello")
+<strong>"hello"</strong>
+&gt; ACTX:var
+<strong>"hello"</strong>
+&gt; _
+</pre></blockquote>		<p>
+			The same symbol (<tt>x</tt> in this case) used in a context can also be used in MAIN. Now we have three versions of <tt>x</tt>, all in a different context:
+		</p>
+<blockquote><pre>
+&gt; (set 'x "I belong to MAIN")
+<strong>"I belong to MAIN"</strong>
+&gt; FOO:x
+<strong>123</strong>
+&gt; FOO-B:x
+<strong>555</strong>
+&gt; x
+<strong>"I belong to MAIN"</strong>
+&gt; _
+</pre></blockquote>		<p>
+			Symbols owned by a context (or <tt>MAIN</tt>) are <em>not</em> accessible unless prefixed by the context name:
+		</p>
+<blockquote><pre>
+FOO&gt; MAIN:x
+<strong>"I belong to MAIN"</strong>
+FOO&gt; FOO-B:x
+<strong>555</strong>
+FOO&gt; x
+<strong>123</strong>
+&gt; _
+</pre></blockquote>		<p>
+			When loading source files on the command line with <a href="#load">load</a>, or when executing the functions <a href="#eval-string">eval-string</a> or <a href="#sym">sym</a>, the <tt>context</tt> function tells newLISP where to put all of the symbols and definitions:
+		</p>
+<blockquote><pre>
+;;; file MY_PROG.LSP
+;;
+;; everything from here on goes into GRAPH
+(context 'GRAPH)
+						 
+(define (draw-triangle x y z)
+    (&hellip;))
+(define (draw-circle)
+    (&hellip;))
+											 
+;; show the runtime context, which is GRAPH
+    (define (foo)
+        (context))
+											 
+;; switch back to MAIN
+(context 'MAIN)
+						 
+;; end of file					
+</pre></blockquote>		<p>
+			The <tt>draw-triangle</tt> and <tt>draw-circle</tt> functions &mdash; along with their <tt>x</tt>, <tt>y</tt>, and <tt>z</tt> parameters &mdash; are now part of the <tt>GRAPH</tt> context. These symbols are known only to <tt>GRAPH</tt>. To call these functions from another context, prefix them with
+			<tt>GRAPH:</tt>
+		</p>
+<blockquote><pre>
+(GRAPH:draw-triangle 1 2 3)
+(GRAPH:foo)  <span class=arw>&rarr;</span> GRAPH										
+</pre></blockquote>		<p>
+			The last statement shows how the runtime context has changed to <tt>GRAPH</tt> (<tt>foo</tt>'s context).
+		</p>
+		<p>
+			A symbol's name and context are used when comparing symbols from different contexts. The <a
+ href="#name">name</a> function can be used to extract the name part from a fully qualified symbol.
+		</p>
+<blockquote><pre>
+;; same symbol name, but different context name
+(= 'A:val 'B:val)                <span class=arw>&rarr;</span> nil
+(= (name 'A:val) (name 'B:val))  <span class=arw>&rarr;</span> true
+</pre></blockquote>		<p>
+			Note: The symbols are quoted with a <tt>'</tt> (single quote) because we are interested in the symbol itself, not in the contents of the symbol.
+		</p>
+		<br />
+		<a name="scope_change"></a>
+		<h3>
+			Changing scoping
+		</h3>
+		<p>
+			By default, only built-in functions and symbols like <tt>nil</tt> and
+			<tt>true</tt> are visible inside contexts other than <tt>MAIN</tt>. To make a symbol visible to every context, use the <a href="#global">global</a> function:
+		</p>
+<blockquote><pre>
+(set 'aVar 123) <span class=arw>&rarr;</span> 123
+(global 'aVar)  <span class=arw>&rarr;</span> aVar
+ 
+(context 'FOO)  <span class=arw>&rarr;</span> FOO
+ 
+aVar            <span class=arw>&rarr;</span> 123
+</pre></blockquote>		<p>
+			Without the <tt>global</tt> statement, the second <tt>aVar</tt> would have returned <tt>nil</tt> instead of <tt>123</tt>. If <tt>FOO</tt> had a previously defined symbol (<tt>aVar</tt> in this example) <em>that</em> symbol's value &mdash; and not the global's &mdash; would be returned instead. Note that only symbols from the <tt>MAIN</tt> context can be made global.
+		</p>
+		<p>
+			Once it is made visible to contexts through the <a href="#global">global</a> function, a symbol cannot be hidden from them again.
+		</p>
+		<br />
+		<a name="protection"></a>
+		<h3>
+			Symbol protection
+		</h3>
+		<p>
+			By using the <a href="#constant">constant</a> function, symbols can be both set and protected from change at the same time:
+		</p>
+<blockquote><pre>
+&gt; (constant 'aVar 123)  <span class=arw>&rarr;</span> 123
+&gt; (set 'aVar 999)
+<span class=err>symbol is protected in function set : aVar</span>
+&gt;_
+</pre></blockquote>		<p>
+			A symbol needing to be both a constant and a global can be defined simultaneously:
+		</p>
+<blockquote><pre>
+(constant (global 'aVar) 123)
+</pre></blockquote>		<p>
+			In the current context, symbols protected by <tt>constant</tt> can be overwritten by using the <tt>constant</tt> function again. This protects the symbols from being overwritten by code in other contexts.
+		</p>
+		<br />
+		<a name="overwrite"></a>
+		<h3>
+			Overwriting global symbols and built-ins
+		</h3>
+		<p>
+			Global and built-in function symbols can be overwritten inside a
+			context by prefixing them with their <em>own</em> context symbol:
+		</p>
+<blockquote><pre>
+(context 'Account)
+ 
+(define (Account:new &hellip;)
+    (&hellip;))
+(context 'MAIN)
+</pre></blockquote>		<p>
+			In this example, the built-in function <a href="#new">new</a> is overwritten by <tt>Account:new</tt>, a different function that is private to the <tt>Account</tt> context.
+		</p>
+		<br />
+		<a name="context_vars"></a>
+		<h3>
+			Variables containing contexts
+		</h3>
+		<p>
+			Variables can be used to refer to contexts:
+		</p>
+<blockquote><pre>
+(set 'FOO:x 123)
+ 
+(set 'ctx FOO)    <span class=arw>&rarr;</span> FOO
+ 
+ctx:x             <span class=arw>&rarr;</span> 123
+ 
+(set 'ctx:x 999)  <span class=arw>&rarr;</span> 999
+ 
+FOO:x             <span class=arw>&rarr;</span> 999
+</pre></blockquote>		<p>
+			Context variables are used when creating contexts with the <a href="#new">new</a> function (<em>objects</em>), as well as when writing functions for uninstantiated contexts.
+		</p>
+		<p>
+			They also allow for <em>pass-by-reference</em> of large data objects when contained inside contexts and passed to functions as context variables.
+		</p>
+		<br />
+		<a name="loading_contexts"></a>
+		<h3>
+			Sequence of creating or loading contexts
+		</h3>
+		<p>
+			The sequence in which contexts are created or loaded can lead to unexpected results. Enter the following code into a file called <tt>demo</tt>:
+		</p>
+<blockquote><pre>
+;; demo - file for loading contexts
+(context 'FOO)
+    (set 'ABC 123)
+(context MAIN)
+ 
+(context 'ABC)
+    (set 'FOO 456)
+(context 'MAIN)
+</pre></blockquote>		<p>
+			Now load the file into the newlisp shell:
+		</p>
+<blockquote><pre>
+&gt; (load "demo")
+<span class=err>symbol is protected in function set : FOO</span
+>
+&gt; _
+</pre></blockquote>		<p>
+			Loading the file causes an error message for <tt>FOO</tt>, but not for <tt>ABC</tt>. When the first context <tt>FOO</tt> is loaded, the context <tt>ABC</tt> does not exist yet, so a local variable <tt>FOO:ABC</tt> gets created. When <tt>ABC</tt> loads, <tt>FOO</tt> already exists as a global protected symbol and will be correctly flagged as protected.
+		</p>
+		<p>
+			<tt>FOO</tt> could still be used as a local variable in the <tt>ABC</tt> context by explicitly prefixing it, as in <tt>ABC:FOO</tt>.
+		</p>
+		<p>
+			The following pattern can be applied to avoid unexpected behavior when loading contexts being used as modules to build larger applications:
+		</p>
+<blockquote><pre>
+;; begin of file - MyModule.lsp
+(load "This.lsp")
+(load "That.lsp")
+(load "Other.lsp")
+ 
+(context 'MyModule)
+ 
+ &hellip;
+ 
+(define (func x y z) (&hellip;))
+ 
+ &hellip;
+ 
+(context 'MAIN)
+ 
+(MyModule:func 1 2 3)
+ 
+(exit)
+ 
+;; end of file					
+</pre></blockquote>		
+<p>
+Always load the modules required by a context <em>before</em> 
+the module's <tt>context</tt> statement. Always finish by switching 
+back to the <tt>MAIN</tt> context, where the module's functions and 
+values can be safely accessed.
+</p>
+<br />
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+<a NAME="context_objects"></a>
+<h2>16. Programming with contexts</h2>
+
+<p>Contexts are used in newLISP in different ways. Most frequently they
+are used for partioning code into modules, but they also can be
+used for simple object-oriented programming when using the <a href="#colon">: (colon)</a>
+operator to handle <em>polymorphism</em> in function application.</p>
+
+<a NAME="context_modules"></a>
+<h3>Contexts as programming modules</h3>
+
+<p>Contexts in newLISP are mainly used for partitioning source into 
+modules. Because each module lives in a different namespace, modules
+are lexically separated and the names of symbols cannot clash with
+identical names in other modules.</p>
+
+<p>The <a href="http://newlisp.org/code/modules/">modules</a>, which are
+part of the newLISP distribution, are a good example how to put related
+functions into a module file, and how to document modules using
+the <a href="http://newlisp.org/newLISPdoc.html">newLISPdoc</a> utility.</p> 
+
+<p>For best programming practice a file should only contain one module and 
+the filename should be similar if not identical to the context name used:</p>
+
+<blockquote><pre>
+;; file db.lsp, commonly used database functions
+
+(context 'db)
+
+;; Variables used throughout this namespace
+
+(define db:handle)
+(define db:host "http://loalhost)
+
+;; Constants
+
+(constant 'Max_N 1000000)
+(constant 'Path "/usr/data/")
+
+;; Functions
+
+(define (db:open ...)
+...)
+
+(define (db:close ...)
+...)
+
+(define (db:update ...)
+...
+)
+</pre></blockquote>
+
+
+<p>The example shows a good practice of predefining variables, which are global
+inside the namespace and defining as constants variables, which will not change.</p>
+
+<p>If a file contains more then one context, then the end of the context
+should be marked with a switch back to <tt>MAIN</tt>:</p>
+
+<blockquote><pre>
+;; Multi context file multi.lsp
+
+(context 'A-ctx)
+...
+(context MAIN)
+
+(context 'B-ctx)
+...
+(context MAIN)
+
+(context 'C-ctx)
+...
+(context MAIN)
+</pre></blockquote>
+
+<br />
+
+<a name="context_data"></a>
+<h3>Contexts as data containers</h3>
+
+<p>Contexts are frequently uses as data containers, e.g. for hash-like dictionaries
+and configuration data:</p>
+
+<blockquote><pre>
+;; Config.lsp - configuration setup
+
+(context 'Config)
+
+(set 'user-name "admin")
+(set 'password "secret")
+(set 'db-name "/usr/data/db.lsp")
+...
+
+;; eof
+</pre></blockquote>
+
+<p>Loading the <tt>Config</tt> namespace will now load a whole variable set into
+memory at once:</p>
+
+<blockquote><pre>
+(load "Config.lsp")
+
+(set 'file (open Config:db-name "read"))
+...
+...
+</pre></blockquote>
+
+<p>In a similar fashion a whole data set can be saved:</p>
+
+<blockquote><pre>
+(save "Config.lsp" 'Config)
+</pre></blockquote>
+
+<p>Read more about this in the section <a href="#serializing">Serializing contexts</a>.</p>
+
+<br />
+
+<a name="loading_contexts"></a>
+<h3>Loading and declaring contexts</h3>
+
+<p>Module files are loaded using the <a href="#load">load</a> function.
+If a programming project contains numerous modules which are referring
+to each other, they should be pre-declared to avoid problems due to context forward 
+references before loading of that context.</p>
+
+<blockquote><pre>
+;; predeclaring contexts
+(map context '(Utilities Config Aquisition Analysis SysLog))
+
+;; loading context module files
+(load "Utilities.lsp" "Aquisition.lsp")
+(load "http://192.168.1.34/Config.lsp") ; load module from remote location
+(load "Analysis.lsp" "SysLog.lsp")
+
+(define (run)
+...)
+
+(run)
+
+;; end of file
+</pre></blockquote>
+
+<p>When pre-declaring and loading modules as shown in the example, the sequence
+of declaration or loading can be neglected. All forward references to variables
+and definitions in modules not loaded yet will be translated correctly.</p>
+
+<p>Modules not starting with a context switch are loaded always into <tt>MAIN</tt>
+except when the <a href="#load">load</a> statement specifies a target context
+as the last parameter. The <a href="#load">load</a> function can take <tt>URL</tt>s
+to load modules from remote locations, via <tt>HTTP</tt>.</p>
+
+
+<br />
+<a name="default_function"></a>
+<h3>The context default functor</h3>
+		<p>
+			A <em>default functor</em> or <em>default function</em>
+			is a symbol or user-defined function or macro
+			with the same name as its namespace.
+			When the context is used
+			as the name of a function or in the functor position of an s-expression,
+			newLISP executes the default function or refers to the contents of the 
+            default functor.
+		</p>
+<blockquote><pre>
+;; the default function
+
+(define (foo:foo a b c) (+ a b c))
+
+(foo 1 2 3)  <span class=arw>&rarr;</span> 6
+
+;; the default functor
+
+(define mylist:mylist '(a b c d e f g))
+
+(mylist 3) <span class=arw>&rarr;</span> d 
+
+(nth-set (mylist 3) 'D) <span class=arw>&rarr;</span> d ; returns old contents
+
+mylist:mylist <span class=arw>&rarr;</span> (a b c D e f g)
+</pre></blockquote>
+
+<p>This allows the default function defined inside a context
+to be called whenever the context is applied as a function.
+A default function could update the lexically isolated static variables
+contained inside its context:</p>
+
+<blockquote><pre>
+(define (gen:gen x)
+    (if gen:acc
+        (inc 'gen:acc x)
+        (set 'gen:acc x)))
+ 
+(gen 1)  <span class=arw>&rarr;</span> 1
+(gen 1)  <span class=arw>&rarr;</span> 2
+(gen 2)  <span class=arw>&rarr;</span> 4
+(gen 3)  <span class=arw>&rarr;</span> 7
+        
+gen:acc  <span class=arw>&rarr;</span> 7
+</pre></blockquote>		
+
+<p>The first time the <tt>gen</tt> function is called,
+its accumulator is set to the value of the argument.
+Each successive call increments <tt>gen</tt>'s accumulator
+by the argument's value.</p>
+
+<p>If a default function is called
+from a context other than <tt>MAIN</tt>,
+the context must already exist
+or be declared with a <em>forward declaration</em>,
+which creates the context and the function symbol:</p>
+
+<blockquote><pre>
+;; forward declaration of a default function
+(define fubar:fubar)    
+        
+(context 'foo)
+(define (foo:foo a b c)
+     &hellip;
+    (fubar a b)         ; forward reference
+    (&hellip;))                ; to default function
+ 
+(context MAIN)
+ 
+;; definition of previously declared default function
+ 
+(context 'fubar)
+(define (fubar:fubar x y)
+    (&hellip;))
+ 
+(context MAIN)
+</pre></blockquote>		
+
+<p>Default functions work like global functions,
+but they are lexically separate from the context in which they are called.
+The arguments in a default function macro are safe from variable capture.</p>
+
+<p>Like a lambda or lambda-macro function, default functions can be used 
+with <a href="#map">map</a> or <a href="#apply">apply</a>.
+</p>
+
+
+<br />
+
+<a name="pass_big"></a>
+<h3>Passing data by reference</h3>
+<p>
+In newLISP, all parameters are passed <em>by value</em>.
+This poses a potential problem when passing large lists or strings
+to user-defined functions or macros.
+Symbols and context objects can also be passed by reference.
+This allows memory-intensive objects to be passed
+without the overhead of copying the entire list or string.
+</p>
+
+<p>Any data can be passed by reference by passing the symbol holding it:</p>
+
+<blockquote><pre>
+(define (change-list aList) (push 999 (eval aList)))
+
+(set 'data '(1 2 3 4 5))
+
+; note the quote ' in front of data
+(change-list 'data)  <span class=arw>&rarr;</span> (999 1 2 3 4 5)
+
+data  <span class=arw>&rarr;</span>  (999 1 2 3 4 5)
+</pre></blockquote>
+
+<p>Although this method is simple to understand and use, it poses the potential 
+problem of <em>variable capture</em> when passing the same symbol as used in 
+the function as a parameter:</p>
+
+<blockquote><pre>
+;; pass data by symbol reference
+
+&gt; (set 'aList '(a b c d))
+(a b c d)
+&gt; (change-list 'aList)
+
+<span class=err>list or string expected : (eval aList)
+called from user defined function change-list</span>
+&gt; 
+</pre></blockquote>
+
+<p>Because of the danger of variable capture, passing an object by its symbol
+should only be used in small scripts or programs where each function and its
+parameters are well-known. A safer method would be to package the object in 
+a context (namespace) and pass the context ID:</p>
+
+<blockquote><pre>
+;; pass data by context reference
+ 
+(set 'mydb:data (sequence 1 100000))
+ 
+(define (change-db obj idx value)
+    (nth-set (obj:data idx) value))
+ 
+(change-db mydb 1234 "abcdefg")
+ 
+(nth (mydb:data 1234))  <span class=arw>&rarr;</span> "abcdefg"
+</pre></blockquote>
+	
+<p>
+This example shows how objects can be passed <em>by reference</em>
+to a user-defined function using <a href="#context_vars">context variables</a>,
+without the overhead of passing them by value.
+String buffers or data objects enclosed in a context
+can also be passed using this technique.
+</p>
+
+<p>
+As shown in the following variation, using <a href="#default_function">default 
+functor</a> can further simplify the syntax:
+</p>
+
+<blockquote><pre>
+;; pass a context containing a default functor
+
+(set 'mydb:mydb (sequence 1 100000))
+
+(define (change-db obj idx value)
+    (nth-set (obj idx) value))
+
+(change-db mydb 1234 "abcdefg")
+
+(mydb 1234)  <span class=arw>&rarr;</span> "abcdefg"
+</pre></blockquote>		
+<p>
+The <tt>change-db</tt> function does not need to know 
+the name of the variable inside the context.
+All functions which use a syntax <tt>(<em>functor</em> (L idx) ...)</tt> like:
+like 
+<a href="#assoc-set">assoc-set</a>,
+<a href="#nth">nth</a>,
+<a href="#nth-set">nth-set</a>, 
+<a href="#pop-assoc">pop-assoc</a>,
+<a href="#push">push</a>, and <a href="#pop">pop</a> and functions
+which use a syntax <tt>(<em>functor</em> (L key) ...)</tt> like:
+<a href="#ref">ref</a>,
+<a href="#ref-all">ref-all</a>,
+<a href="#ref-set">ref-set</a>,
+<a href="#set-assoc">set-assoc</a>, 
+<a href="#set-nth">set-nth</a>, 
+<a href="#set-ref">set-ref</a>,
+and <a href="#set-ref-all">set-ref-all</a>
+know how to extract the default functor from the context <tt>L</tt>.
+This technique works for arrays and strings, as well.
+</p>
+
+<p>For destructive functions like <a href="#replace">replace</a>,
+<a href="#reverse">reverse</a>, 
+<a href="#rotate">rotate</a>, 
+<a href="#sort">sort</a>, and <a href="#swap">swap</a>, 
+which refer to the un-indexed list, the function <a href="#default">default</a> 
+can be used to extract the <a href="#default_function">default functor</a> symbol:</p>
+
+<blockquote><pre>
+(set 'foo:foo '( 6 3 5 8 6 7 4 1))
+
+(define (my-sort clist)
+	(sort (eval (default clist))))
+
+(my-sort foo) 
+
+foo:foo  <span class=arw>&rarr;</span> (1 3 4 5 6 6 7 8)
+</pre></blockquote>
+
+<p>In this example, 
+the list in foo:foo is passed by context reference.
+<a href="#default">default</a> is used to acces the 
+<a href="#default_function">default functor</a> symbol, 
+the contents of which is access by <a href="#eval">eval</a>.</p>
+
+<br />
+
+<a name="serializing"></a>
+<h3>Serializing contexts</h3>
+
+<p>Serialization makes a software object <em>persistent</em>
+by converting it into a character stream,
+which is then saved to a file or string in memory.
+In newLISP, anything referenced by a symbol can be serialized to a file
+by using the <a href="#save">save</a> function.
+Like other symbols, contexts are saved just by using their names:
+</p>
+
+<blockquote><pre>
+(save "mycontext.lsp" 'MyCtx)              ; save MyCtx to mycontext.lsp
+ 
+(load "mycontext.lsp")                     ; loads MyCtx into memory
+ 
+(save "mycontexts.lsp" 'Ctx1 'Ctx2 'Ctx3)  ; save multiple contexts at once
+</pre></blockquote>		
+
+<p>
+For details, see the functions <a href="#save">save</a> (mentioned above)
+and <a href="#source">source</a> (for serializing to a newLISP string).
+</p>
+		
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+
+<a name="oo_programming"></a>
+<h2>17. Object-Oriented Programming in newLISP</h2>
+
+<p>Any object-oriented programming (OOP) system built in newLISP is based on the following 
+three principles:</p>
+
+<ul>
+	<li>Class attributes and methods are stored in the namespace of the object class.</li><br />
+
+	<li>The namespace default functor is used to hold the object constructor method.</li><br />
+
+	<li>An object is constructed using a list, the first element of which is the 
+    context symbol describing the class of the object.</li><br />
+
+	<li>Polymorphism is implemented using the : (colon) operator, which selects the appropriate 
+     class from the object.</li>
+</ul>
+
+<p>The following paragraphs are a short introduction to FOOP: Functional Object-Oriented Programming
+as designed by <em>Michael Michaels</em>. This description covers only very basic elements.
+For more details see the Michael Michaels's FOOP training videos on 
+<a href="http://newlisp.org">newlisp.org</a> or <a href="http://neglook.com">neglook.com</a>.
+</p>
+
+
+<br />
+
+<a name="newlisp_classes"></a>
+<h3>Classes and constructors</h3>
+
+<p>Class attributes and methods are stored in the namespace of the object class. 
+No object instance data is stored in this namespace/context. Data variables in
+the class namespace only desecribe the class of objects as a whole but don't contain
+any object specific information. A generic FOOP object constructor can be used
+as a template for specific object constructors when creating new object classes
+with <tt>new</tt>:</p>
+
+<blockquote><pre>
+; generic FOOP object constructor
+(define (Class:Class) 
+	(cons (context) (args)))
+
+(new Class 'Rectangle)
+(new Class 'Circle)
+</pre></blockquote>
+
+<p>Creating the namespace classes using <a href="#new">new</a>, reserves the class name as a context
+in newLISP and facilitates forward references. At the same time a simple
+constructor is defined for the new class for instantiating new objects. As a convention it is 
+recommended to start class names in upper-case to signal that the name stands for a namespace.</p>
+
+<p>In some cases it may be useful to overwrite the simple constructor, which was created during class creation
+with <tt>new</tt>:</p>
+
+<blockquote><pre>
+; overwrite simple constructor 
+(define (Circle:Circle x y radius)
+    (list Circle x y radius))
+</pre></blockquote>
+
+<p>A constructor can also specify defaults:</p>
+
+<blockquote><pre>
+; constructor with defaults
+(define (Circle:Circle (x 10) (y 10) (radius 3))
+    (list Circle x y radius))
+</pre></blockquote>
+
+<p>In many cases the constructor as created when using <tt>new</tt> is sufficient and overwriting
+it is not necessary.</p>
+
+<br />
+<a name="newlisp_objects"></a>
+<h3>Objects and associations</h3>
+
+<p>FOOP represents objects as lists. The first element of the list indicates the object's kind or class, while the remaining elements contain the data. The following statements define two <em>objects</em> using any of the contructors defined previously:</p>
+
+<blockquote><pre>
+(set 'myrect (Rectangle 5 5 10 20)) <span class=arw>&rarr;</span> (Rectangle 5 5 10 20)
+(set 'mycircle (Circle 1 2 10)) <span class=arw>&rarr;</span> (Circle 1 2 10)
+</pre></blockquote>
+
+<p>An object created is identical to the function necessary to create it. Nested objects can be 
+created in a similar manner:</p>
+
+<blockquote><pre>
+; create classes
+(new Class 'Person)
+(new Class 'Address)
+(new Class 'City)
+(new Class 'Street)
+
+; create an object containing other objects
+(set 'JohnDoe (Person (Address (City "Boston") (Street 123 "Main Street"))))
+<span class=arw>&rarr;</span> (Person (Address (City "Boston") (Street 123 "Main Street")))
+</pre></blockquote>
+
+<p>Objects in FOOP not only resemble functions they also resemble associations. The
+<a href="#assoc">assoc</a> function can be used to acess object data by name:</p>
+
+<blockquote><pre>
+(assoc (JohnDoe Address)) <span class=arw>&rarr;</span> (Address (City "Boston") (Street 123 "Main Street"))
+
+(assoc (JohnDoe Address Street)) <span class=arw>&rarr;</span> (Street 123 "Main Street")
+</pre></blockquote>
+
+<p>In a similar manner <a href="#set-assoc">set-assoc</a> could be used to modify object data:</p>
+
+<blockquote><pre>
+(set-assoc (JohnDoe Address Street) (Street 456 "Main Street"))
+<span class=arw>&rarr;</span> (Person (Address (City "Boston") (Street 456 "Main Street")))
+</pre></blockquote>
+
+<p>The street number has been changes from <tt>123</tt> to <tt>456</tt>.</p>
+
+<br />
+<a name="colon_operator"></a>
+<h3>The colon <tt>:</tt> operator and polymorphism</h3>
+
+<p>In newLISP, the colon character <tt>:</tt> is primarily used to
+connect the context symbol with the symbol it is qualifying. 
+Secondly, the colon function is used in OOP to resolve a function's 
+application <em>polymorphic</em>ally.</p>
+
+<p>The following code defines two functions called <tt>area</tt>, 
+each belonging to a different namespace. Both functions could
+have been defined in different modules, but in this case they are
+defined in the same file and without bracketing 
+<a href="#context">context</a> statements. Here, only
+the symbols <tt>rectangle:area</tt> and <tt>circle:area</tt> belong
+to different namespaces. The local parameters <tt>p</tt>, <tt>c</tt>, <tt>dx</tt>, and <tt>dy</tt> are all part of <tt>MAIN</tt>,
+but this is of no concern.</p>
+
+<blockquote><pre>
+;; class methods for rectangles
+
+(define (Rectangle:area p)
+	(mul (p 3) (p 4)))
+
+(define (Rectangle:move p dx dy)
+	(list Rectangle (add (p 1) dx) (add (p 2) dy) (p 3) (p 4))) 
+
+;; class methods for circles
+
+(define (Circle:area c)
+	(mul (pow (c 3) 2) (acos 0) 2))
+
+(define (Circle:move p dx dy)
+	(list Circle (add (p 1) dx) (add (p 2) dy) (p 3))) 
+</pre></blockquote>
+
+<p>By prefixing the <tt>area</tt> or <tt>move</tt> symbol with the <tt>:</tt> (colon), we can call these functions for each class of object. Although there is no space between the colon and the symbol following it, newLISP parses them as distinct entities. The colon works as a function that processes parameters:</p> 
+
+<blockquote><pre>
+(:area myrect) <span class=arw>&rarr;</span> 200 ; same as (Rectangle:area myrect)
+(:area mycircle) <span class=arw>&rarr;</span> 314.1592654 ; same as (Circle:area mycircle)
+
+(set 'myrect (:move myrect 2 3))      <span class=arw>&rarr;</span> (Rectangle 7 8 10 20)
+(set 'mycircle (:move mycircle 4 5))  <span class=arw>&rarr;</span> (Circle 5 7 10)
+</pre></blockquote>
+
+<p>In this example, the correct qualified symbol (<tt>rectangle:area</tt> or <tt>circle:area</tt>) is constructed and applied to the object data based on the symbol following the colon and the context name (the first element of the object list).</p>
+
+<p>Note that moving the shapes is done in a <em>functional</em> manner. 
+Rather than changing the <tt>x</tt> and <tt>y</tt> coordinates directly in <tt>myrect</tt> and <tt>mycircle</tt>, newLISP constructs and then reassigns the moved shapes.</p>
+
+
+<br />
+<a NAME="XML"></a>
+<h2>18. XML, S-XML, and XML-RPC</h2>
+<p>
+newLISP's built-in support for XML-encoded data or documents
+comprises three functions:
+<a href="#xml-parse">xml-parse</a>,
+<a href="#xml-type-tags">xml-type-tags</a>, and <a href="#xml-error">xml-error</a>.
+</p>
+
+<p>
+Use the <a href="#xml-parse">xml-parse</a> function
+to parse XML-encoded strings.
+When <tt>xml-parse</tt> encounters an error,
+<tt>nil</tt> is returned.
+To diagnose syntax errors caused by incorrectly formatted XML,
+use the function <a href="#xml-error">xml-error</a>.
+The <a href="#xml-type-tags">xml-type-tags</a> function can be used
+to control or suppress the appearance of XML type tags.
+These tags classify XML into one of four categories:
+text, raw string data, comments, and element data.</p>
+
+
+<strong>XML source:</strong>
+<blockquote><pre>
+&lt;?xml version="1.0"?&gt;
+&lt;DATABASE name="example.xml"&gt;
+&lt;!--This is a database of fruits--&gt;
+    &lt;FRUIT&gt;
+        &lt;NAME&gt;apple&lt;/NAME&gt;
+    	&lt;COLOR&gt;red&lt;/COLOR&gt;
+    	&lt;PRICE&gt;0.80&lt;/PRICE&gt;
+    &lt;/FRUIT&gt;
+&lt;/DATABASE&gt;
+</pre></blockquote>		<br />
+		<strong>Parsing without options:</strong>
+<blockquote><pre>
+(xml-parse (read-file "example.xml"))
+<span class=arw>&rarr;</span>  (("ELEMENT" "DATABASE" (("name" "example.xml")) (("TEXT" "\r\n")
+        ("COMMENT" "This is a database of fruits")
+        ("TEXT" "\r\n        ")
+        ("ELEMENT" "FRUIT" () (
+            ("TEXT" "\r\n\t        ")
+            ("ELEMENT" "NAME" () (("TEXT" "apple")))
+            ("TEXT" "\r\n\t\t")
+            ("ELEMENT" "COLOR" () (("TEXT" "red")))
+            ("TEXT" "\r\n\t\t")
+            ("ELEMENT" "PRICE" () (("TEXT" "0.80")))
+            ("TEXT" "\r\n\t")))
+        ("TEXT" "\r\n"))))
+</pre></blockquote>		<p>
+			S-XML can be generated directly from XML
+			using <a href="#xml-type-tags">xml-type-tags</a>
+			and the special option parameters
+			of the <a href="#xml-parse">xml-parse</a> function:
+		</p>
+		<br />
+		<strong>S-XML generation using all options:</strong>
+<blockquote><pre>
+(xml-type-tags nil nil nil nil)
+(xml-parse (read-file "example.xml") (+ 1 2 4 8 16))
+<span class=arw>&rarr;</span>  ((DATABASE (@ (name "example.xml"))
+          (FRUIT (NAME "apple")
+              (COLOR "red")
+              (PRICE "0.80"))))
+			
+</pre></blockquote>		<p>
+			S-XML is XML
+			reformatted as LISP <em>S-expressions</em>.
+			The <tt>@</tt> (at symbol) denotes
+			an XML attribute specification.
+		</p>
+		<p>
+			See <a href="#xml-parse">xml-parse</a> in
+			the reference section of the manual
+			for details on parsing and option numbers,
+			as well as for a longer example.
+		</p>
+		<br />
+		<strong>XML-RPC</strong>
+		<br />
+		<p>
+			The remote procedure calling protocol XML-RPC uses
+			HTTP post requests as a transport and
+			XML for the encoding of method names, parameters, and parameter types.
+			XML-RPC client libraries and servers have been implemented
+			for most popular compiled and scripting languages.
+		</p>
+		<p>
+			For more information about XML,
+			visit <a href="http://www.xmlrpc.com/">www.xmlrpc.com</a>.
+		</p>
+		<p>
+			XML-RPC clients and servers are easy to write
+			using newLISP's built-in network and XML support.
+			A stateless XML-RPC server implemented as a CGI service,
+			can be found in the file <tt>examples/xmlrpc.cgi</tt>. This
+			script can be used together with a web server, like Apache.
+			This XML-RPC service scripts implement
+			the following methods:
+		</p>
+<br />
+<center>
+<table class="list" width="98%" summary="XMPRPC methods for newLISP server">
+<tr align="left"><th>method</th><th>description</th></tr>
+<tr>
+<td class="left"><tt>system.listMethods</tt></td>
+<td class="right">Returns a list of all method names</td>
+</tr>
+<tr>
+<td class="left"><tt>system.methodHelp</tt></td>
+<td class="right">Returns help for a specific method</td>
+</tr>
+<tr>
+<td class="left"><tt>system.methodSignature</tt></td>
+<td class="right">Returns a list of return/calling signatures for a specific method </td>
+</tr>
+<tr>
+<td class="left"><tt>newLISP.evalString</tt></td>
+<td class="right">Evaluates a Base64 newLISP expression string</td></tr>
+</table>
+</center>
+
+		<br />
+		<p>
+			The first three methods
+			are <em>discovery</em> methods
+			implemented by most XML-RPC servers.
+			The last one is specific
+			to the newLISP XML-RPC server script and
+			implements remote evaluation of
+			a Base64-encoded string of newLISP source code.
+			newLISP's <a href="#base64-enc">base64-enc</a>
+			and <a href="#base64-dec">base64-dec</a> functions
+			can be used to encode and decode
+			Base64-encoded information.
+		</p>
+		<p>
+			In the <tt>modules</tt> directory
+			of the source distribution,
+			the file <tt>xmlrpc-client.lsp</tt> implements
+			a specific client interface for
+			all of the above methods.
+		</p>
+<blockquote><pre>
+(load "xmlrpc-client.lsp")  ; load XML-RPC client routines						 
+
+(XMLRPC:newLISP.evalString
+    "http://localhost:8080"
+    "(+ 3 4)")  <span class=arw>&rarr;</span> "7"
+</pre></blockquote>		<p>
+			In a similar fashion,
+			standard <tt>system.xxx</tt> calls can be issued.
+		</p>
+		<p>
+			All functions return either a result if successful,
+			or <tt>nil</tt> if a request fails.
+			In case of failure,
+			<tt>XMLRPC:error</tt> can be evaluated
+			to return an error message.
+		</p>
+		<p>
+			For more information,
+			please consult the header
+			of the file <tt>modules/xmlrpc-client.lsp</tt>.
+		</p>
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="internationalization"></a>
+		<h2>
+			19. Customization, localization, and UTF-8
+		</h2>
+		<p>
+			All built-in primitives
+			in newLISP can be easily renamed:
+		</p>
+<blockquote><pre>
+(constant 'plus +)
+</pre></blockquote>		<p>
+			Now, <tt>plus</tt> is functionally equivalent to <tt>+</tt>
+			and runs at the same speed.
+			As with many scripting languages,
+			this allows for double precision floating point arithmetic
+			to be used throughout newLISP.
+		</p>
+		<p>
+			The <a href="#constant">constant</a> function,
+			rather than the <tt>set</tt> function,
+			must be used to rename built-in primitive symbols.
+			By default, all built-in function symbols
+			are protected against accidental overwriting.
+		</p>
+<blockquote><pre>
+(constant '+ add)
+(constant '- sub)
+(constant '* mul)
+(constant '/ div)
+</pre></blockquote>		<p>
+			All operations using <tt>+</tt>, <tt>-</tt>, <tt>*</tt>, and <tt>/</tt>
+			are now performed as floating point operations.
+		</p>
+		<p>
+			Using the same mechanism,
+			the names of built-in functions
+			can be translated into languages
+			other than English:
+		</p>
+<blockquote><pre>
+(constant 'wurzel sqrt)    ; German for 'square-root'
+(constant 'imprime print)  ; Spanish for 'print'
+ &hellip;
+</pre></blockquote>		<br />
+		<a name="switching"></a>
+		<h3>
+			Switching the locale
+		</h3>
+		<p>
+			newLISP can switch locales
+			based on the platform and operating system.
+			On startup, newLISP attempts to
+			set the ISO C standard default POSIX locale,
+			available for most platforms and locales.
+			Use the <a href="#set-locale">set-locale</a> function
+			to switch to the default locale:
+		</p>
+<blockquote><pre>
+(set-locale "")
+</pre></blockquote>		<p>
+			This switches to the default locale
+			used on your platform/operating system
+			and ensures character handling
+			(e.g., <a href="#upper-case">upper-case</a>)
+			work correctly.
+		</p>
+		<p>
+			Many Unix systems have
+			a variety of locales available.
+			To find out which ones are available on
+			a particular Linux/UNIX/BSD system,
+			execute the following command
+			in a system shell:
+		</p>
+<blockquote><pre>
+locale -a
+</pre></blockquote>		<p>
+			This command prints a list of
+			all the locales available on your system.
+			Any of these may be
+			used as arguments to <a href="#set-locale">set-locale</a>:
+		</p>
+<blockquote><pre>
+(set-locale "es_US")
+</pre></blockquote>		<p>
+			This would switch to a U.S. Spanish locale.
+			Accents or other characters
+			used in a U.S. Spanish environment
+			would be correctly converted.
+		</p>
+		<p>
+			See the manual description for more details
+			on the usage of <a href="#set-locale">set-locale</a>.
+		</p>
+		<br />
+		<a name="decimal_point"></a>
+		<h3>
+			Decimal point and decimal comma
+		</h3>
+		<p>
+			Many countries use a comma instead of a period
+			as a decimal separator in numbers.
+			newLISP correctly parses numbers
+			depending on the locale set:
+		</p>
+<blockquote><pre>
+;; switch to German locale on a Linux system
+(set-locale "de_DE")
+ 
+;; newLISP source and output use a decimal comma
+(div 1,2 3)  <span class=arw>&rarr;</span> 0,4
+</pre></blockquote>		<p>
+			The default POSIX C locale,
+			which is set when newLISP starts up,
+			uses a period as a decimal separator.
+		</p>
+		<p>
+			The following countries
+			use a period as a decimal separator:
+		</p>
+		<blockquote>Australia, Botswana, Canada (English-speaking), China, Costa Rica, Dominican Republic, El Salvador, Guatemala, Honduras, Hong Kong, India, Ireland, Israel, Japan, Korea (both North and South), Malaysia, Mexico, Nicaragua, New Zealand, Panama, Philippines, Puerto Rico, Saudi Arabia, Singapore, Thailand, United Kingdom, and United States
+		</blockquote>
+		<p>
+			The following countries use
+			a comma as a decimal separator:
+		</p>
+		<blockquote>Albania, Andorra, Argentina, Austria, Belarus, Belgium, Bolivia, Brazil, Bulgaria, Canada (French-speaking), Croatia, Cuba, Chile, Colombia, Czech Republic, Denmark, Ecuador, Estonia, Faroes, Finland, France, Germany, Greece, Greenland, Hungary, Indonesia, Iceland, Italy, Latvia, Lithuania, Luxembourg, Macedonia, Moldova, Netherlands, Norway, Paraguay, Peru, Poland, Portugal, Romania, Russia, Serbia, Slovakia, Slovenia, Spain, South Africa, Sweden, Switzerland, Ukraine, Uruguay, Venezuela, and Zimbabwe
+		</blockquote>
+		<br />
+		<a name="unicode_utf8"></a>
+		<h3>
+			Unicode and UTF-8 encoding
+		</h3>
+		<p>
+			Note that for many European languages,
+			the <a href="#set-locale">set-locale</a> mechanism
+			is sufficient to display
+			non-ASCII character sets,
+			as long as each character is presented
+			as <em>one</em> byte internally.
+			UTF-8 encoding is only necessary for
+			multibyte character sets as described in
+			this chapter.
+		</p>
+		<p>
+			newLISP can be compiled
+			as a UTF-8&ndash;enabled application.
+			UTF-8 is a multibyte encoding
+			of the international Unicode character set.
+			A UTF-8&ndash;enabled newLISP
+			running on an operating system with UTF-8 enabled
+			can handle any character of the installed locale.
+		</p>
+		<p>
+			The following steps
+			make UTF-8 work with newLISP
+			on a specific operating system and platform:
+		</p>
+		<p>
+			<tt>(1)</tt> Use one of the makefiles
+			ending in <tt>utf8</tt>
+			to compile newLISP as
+			a UTF-8 application.
+			If no UTF-8 makefile
+			is available for your platform,
+			the normal makefile
+			for your operating system
+			contains instructions
+			on how to change it
+			for UTF-8.
+		</p>
+		<p>
+			The Mac OS X binary installer contains
+			a UTF-8&ndash;enabled version by default.
+		</p>
+		<p>
+			<tt>(2)</tt> Enable the UTF-8 locale
+			on your operating system.
+			Check and set a UTF-8 locale
+			on Unix and Unix-like OSes
+			by using the <tt>locale</tt> command
+			or the <tt>set-locale</tt> function within newLISP.
+			On Linux, the locale can be changed by setting
+			the appropriate environment variable.
+			The following example uses <tt>bash</tt>
+			to set the U.S. locale:
+		</p>
+<blockquote><pre>
+export LC_CTYPE=en_US.UTF-8
+</pre></blockquote>		<p>
+			<tt>(3)</tt> The UTF-8&ndash;enabled newLISP
+			automatically switches to the locale found
+			on the operating system.
+			Make sure the command shell
+			is UTF-8&ndash;enabled.
+			When using the Tcl/Tk front-end on Linux/UNIX,
+			Tcl/Tk will automatically switch to UTF-8 display
+			as long as the UNIX environment variable
+			is set correctly.
+			The U.S. version of WinXP's <tt>notepad.exe</tt>
+			can display Unicode UTF-8&ndash;encoded characters,
+			but the command shell and the Tcl/Tk front-end cannot.
+			On Linux and other UNIXes,
+			the Xterm shell can be used
+			when started as follows:
+		</p>
+<blockquote><pre>
+LC_CTYPE=en_US.UTF-8 xterm
+</pre></blockquote>		<p>
+			The following procedure can now be used
+			to check for UTF-8 support.
+			After starting newLISP, type:
+		</p>
+<blockquote><pre>
+(println (char 937))               ; displays Greek uppercase omega
+(println (lower-case (char 937)))  ; displays lowercase omega
+</pre></blockquote>		<p>
+			While the uppercase omega (&Omega;) looks
+			like a big O on two tiny legs,
+			the lowercase omega (&omega;) has
+			a shape similar to a small <tt>w</tt>
+			in the Latin alphabet.
+		</p>
+		<p>
+			Note: Only the output of <tt>println</tt>
+			will be displayed as a character;
+			<tt>println</tt>'s return value
+			will appear on the console
+			as a multibyte ASCII character.
+		</p>
+		<p>
+			When UTF-8&ndash;enabled newLISP
+			is used on a non-UTF-8&ndash;enabled display,
+			both the output and the return value
+			will be two characters.
+			These are the two bytes necessary
+			to encode the omega character.
+		</p>
+		<p>
+			When UTF-8&ndash;enabled newLISP is used,
+			the following string functions work
+			on character rather than byte boundaries:
+		</p>
+<br />
+<center>
+<table class="list" width="95%" summary="functions working on character boundaries in UTF-8">
+<tr align="left"><th>function</th><th>description</th></tr>
+
+<tr>
+<td class="left"><a href="#bind">bind</a></td>
+<td class="right">binds variable associations in a list</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#char">char</a></td>
+<td class="right">translates between characters and ASCII/Unicode</td>
+</tr>
+
+<tr>
+
+<td class="left"><a href="#chop">chop</a></td>
+<td class="right">chops characters from the end of a string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#date">date</a></td>
+<td class="right">converts date number to string (when used with the third argument)</td>
+
+</tr>
+
+<tr>
+<td class="left"><a href="#explode">explode</a></td>
+<td class="right">transforms a string into a list of characters</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#first">first</a></td>
+<td class="right">gets first element in a list (car, head) or string</td>
+</tr>
+
+<tr>
+
+<td class="left"><a href="#last">last</a></td>
+<td class="right">returns the last element of a list or string</td>
+</tr>
+
+
+<tr>
+<td class="left"><a href="#lower-case">lower-case</a></td>
+<td class="right">converts a string to lowercase characters</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#nth">nth</a></td>
+<td class="right">gets the <em>nth</em> element of a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#nth-set">nth-set</a></td>
+<td class="right">changes the <em>nth</em> element of a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#pop">pop</a></td>
+<td class="right">deletes an element from a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#push">push</a></td>
+<td class="right">inserts a new element in a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#rest">rest</a></td>
+<td class="right">gets all but the first element of a list (cdr, tail) or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#select">select</a></td>
+<td class="right">selects and permutes elements from a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#set-nth">set-nth</a></td>
+<td class="right">changes an element in a list or string</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#title-case">title-case</a></td>
+<td class="right">converts the first character of a string to uppercase</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#trim">trim</a></td>
+<td class="right">trims a string from both sides</td>
+</tr>
+
+<tr>
+<td class="left"><a href="#upper-case">upper-case</a></td>
+<td class="right">converts a string to uppercase characters</td>
+</tr>
+
+</table></center>
+
+		<br />
+		<p>
+			All other string functions work on bytes.
+			When positions are returned,
+			as in <a href="#find">find</a> or <a href="#regex">regex</a>,
+			they are byte positions rather than character positions.
+			The <a href="#slice">slice</a> function
+			takes not character offset, but byte offsets.
+			The <a href="#reverse">reverse</a> function reverses
+			a byte vector, not a character vector.
+			The last two functions can still be used to manipulate
+			binary non-textual data in the UTF-8&ndash;enabled version of newLISP.
+		</p>
+		<p>
+			To enable UTF-8 in Perl Compatible Regular Expressions (PCRE)
+			&mdash; used by <a href="#directory">directory</a>, <a href="#find">find</a>, <a href="#parse">parse</a>, <a href="#regex">regex</a>, and
+			<a href="#replace">replace</a> &mdash;
+			set the option number accordingly (2048).
+			See the <a href="#regex">regex</a> documentation for details.
+		</p>
+		<p>
+			Use <a href="#explode">explode</a> to obtain an array
+			of UTF-8 characters and to manipulate characters rather than bytes
+			when a UTF-8&ndash;enabled function is unavailable:
+		</p>
+<blockquote><pre>
+(join (reverse (explode str)))  ; reverse UTF-8 characters
+</pre></blockquote>		<p>
+			The above string functions
+			(often used to manipulate non-textual binary data)
+			now work on character,
+			rather than byte, boundaries,
+			so care must be exercised
+			when using the UTF-8&ndash;enabled version.
+			The size of the first 127 ASCII characters &mdash;
+			along with the characters in popular code pages such as ISO 8859 &mdash;
+			is one byte long.
+			When working exclusively within these code pages,
+			UTF-8&ndash;enabled newLISP is not required. 
+			The <a href="#set-locale">set-locale</a> function alone
+			is sufficient for localized behavior.
+		</p>
+		<p>
+			Two new functions are available
+			for converting between four-byte Unicode (UCS-4)
+			and multibyte UTF-8 code.
+			The <a href="#utf8">UTF-8</a> function converts UCS-4
+			to UTF-8, and the <a href="#unicode">unicode</a> function converts UTF-8
+			or ASCII strings into USC-4 Unicode.
+		</p>
+		<p>
+			These functions are rarely used in practice,
+			as most Unicode text files
+			are already UTF-8&ndash;encoded
+			(rather than UCS-4,
+			which uses four-byte integer characters).
+			Unicode can be displayed directly
+			when using the <tt>"%ls"</tt> <a href="#format">format</a> specifier.
+		</p>
+		<p>
+		For further details on UTF-8 and Unicode,
+		consult <a href="http://www.cl.cam.ac.uk/~mgk25/unicode.html"><em>UTF-8 and Unicode FAQ for Unix/Linux</em></a> by Markus Kuhn.
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="commas"></a>
+		<h2>
+			20. Commas in parameter lists
+		</h2>
+		<p>
+			Some of the example programs contain functions
+			that use a comma to separate the parameters into two groups.
+			This is not a special syntax of newLISP,
+			but rather a visual trick.
+			The comma is a symbol just like any other symbol.
+			The parameters after the comma are not required
+			when calling the function;
+			they simply declare local variables in a convenient way.
+			This is possible in newLISP because parameter variables in lambda expressions
+			are local and arguments are optional:
+		</p>
+<blockquote><pre>
+(define (my-func a b c , x y z)
+    (set 'x &hellip;)
+    (&hellip;))
+</pre></blockquote>		<p>
+			When calling this function,
+			only <tt>a, b</tt>, and <tt>c</tt> are used as parameters.
+			The others (<tt>x, y</tt>, and <tt>z</tt>)
+			are initialized to nil
+			and are local to the function.
+			After execution, the function's contents are forgotten
+			and the environment's symbols are restored
+			to their previous values.
+		</p>
+		<p>
+			For other ways of declaring and initializing local variables,
+			see <a HREF="#let">let</a>, <a href="#letex">letex</a>, 
+			<a href="#letn">letn</a> and <a href="#local">local</a>.
+		</p>
+
+<center>
+<span class="divider">(&nbsp;<font color="#7ba9d4">&sect;</font>&nbsp;)</span>
+</center>
+
+		<a NAME="linking"></a>
+		<h2>
+			21. Linking newLISP source and executable
+		</h2>
+		<p>
+			Source code and the newLISP executable
+			can be linked together to build
+			a self-contained application
+			by using <tt>link.lsp</tt>. This program is located in the <tt>newlisp/util</tt> directory of the distributions.
+			As an example,
+			the following code is linked to the newLISP executable
+			to form a simple, self-contained application:
+		</p>
+<blockquote><pre>
+;; uppercase.lsp - Link example
+(println (upper-case (main-args 1)))
+(exit)
+</pre></blockquote>		<p>
+			This program, which resides in the file <tt>uppercase.lsp</tt>, takes the first word on the command line and converts it to uppercase.
+		</p>
+		<p>
+			To build this program as a self-contained executable,
+			follow these four steps:
+		</p>
+		<p>
+			<tt>(1)</tt> Put the following files into the same directory:
+			(a) a copy of the newLISP executable; (b) <tt>newlisp</tt>
+			(or <tt>newlisp.exe</tt> on Win32); (c) <tt>link.lsp</tt>; and (d) the program to link with (<tt>uppercase.lsp</tt> in this example).
+		</p>
+		<p>
+			<tt>(2)</tt> In a shell,
+			go to the directory referred to in step 1
+			and load <tt>link.lsp</tt>:
+		</p>
+<blockquote><pre>
+newlisp link.lsp
+</pre></blockquote>		<p>
+			<tt>(3)</tt> In the newLISP shell, type one of the following:
+		</p>
+<blockquote><pre>
+(link "newlisp.exe" "uppercase.exe" "uppercase.lsp")  ; Win32
+(link "newlisp" "uppercase" "uppercase.lsp")          ; Linux/BSD
+</pre></blockquote>		<p>
+			<tt>(4)</tt> Exit the newLISP shell and type:
+		</p>
+<blockquote><pre>
+uppercase "convert me to uppercase"
+</pre></blockquote>		<p>
+			The console should print:
+		</p>
+<blockquote><pre>
+CONVERT ME TO UPPERCASE
+</pre></blockquote>		<p>
+			Note: On Linux/BSD, the new file must be marked
+			executable for the operating system to recognize it:
+		</p>
+<blockquote><pre>
+chmod 755 uppercase
+</pre></blockquote>		<p>
+			This gives the file executable permission
+			(this step is unnecessary on Win32).
+		</p>
+		<br />
+
+<br /><br /><br />
+
+<a NAME="symbol_names"></a>
+
+<center style="font-size: 150%">
+<span class="divider">(&nbsp;<font color="#7ba9d4">&part;</font>&nbsp;)</span>
+</center>
+
+
+<CENTER><H1>newLISP Function Reference</H1></CENTER>
+
+<br /><br />
+
+
+<h2>1. Syntax of symbol variables and numbers</h2>
+<p>
+	Source code in newLISP is parsed according the rules outlined here. 
+	When in doubt, verify the behavior of newLISP's internal parser
+	by calling <a href="#parse">parse</a> without optional arguments.
+</p>
+
+
+<h3>Symbols for variable names</h3>
+<p>
+	The following rules apply to the naming of symbols 
+	used as variables or functions:
+</p>
+
+<blockquote>
+<ol>
+<li>Variable symbols may not start with any of the following characters:<br />
+<tt># ; " ' ( )  { } . , 0 1 2 3 4 5 6 7 8 9</tt><br /><br /></li>
+
+<li>Variable symbols starting with a <tt>+</tt> or <tt>-</tt> cannot have a number as the second character.<br /><br /></li>
+
+<li>Any character is allowed inside a variable name, except for:<br />
+ <tt>" ' ( ) : ,</tt> and the space character. These mark the end of a variable symbol.<br /><br /></li>
+
+<li>A symbol name starting with <tt>[</tt> (left square bracket) and ending with <tt>]</tt> (right square bracket) may contain any character except the right square bracket.</li>
+
+</ol>
+</blockquote>
+
+
+<p>
+	All of the following symbols are legal variable names in newLISP:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+myvar
+A-name
+X34-zz
+[* 7 5 ()};]
+*111*
+</pre>
+</blockquote>
+
+<p>
+	Sometimes it is useful to create hash-like <a href="#hash">lookup dictionaries</a>
+	with keys containing characters that are illegal in newLISP variables. 
+	The functions <a href="#sym">sym</a> and <a href="#context">context</a> 
+	can be used to create symbols containing these characters:
+</p>
+
+
+<blockquote>
+<pre>
+(set (sym "(#:L*") 456)  <span class=arw>&rarr;</span> 456
+
+(eval (sym "(#:L*"))  <span class=arw>&rarr;</span> 456
+
+(set (sym 1) 123)  <span class=arw>&rarr;</span> 123
+
+(eval (sym 1))  <span class=arw>&rarr;</span> 123
+
+1        <span class=arw>&rarr;</span> 1
+(+ 1 2)  <span class=arw>&rarr;</span> 3
+</pre>
+</blockquote>
+
+<p>
+	The last example creates the symbol <tt>1</tt> 
+	containing the value <tt>123</tt>. 
+	Also note that creating such a symbol does not alter newLISP's normal operations, 
+	since <tt>1</tt> is still parsed as the number one.
+</p>
+
+<br />
+
+<h3>Numbers</h3>
+
+<p>
+	newLISP recognizes the following number formats:
+</p>
+
+<p>
+	<b>Integers</b> are one or more digits long, 
+	optionally preceded by a <tt>+</tt> or <tt>-</tt> sign. 
+	Any other character marks the end of the integer 
+	or may be part of the sequence 
+	if parsed as a float (see float syntax below).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+123
++4567
+-999
+</pre>
+</blockquote>
+
+<p>
+	<b>Hexadecimals</b> start with a <tt>0x</tt> (or <tt>0X</tt>)  
+	followed by any combination of the hexadecimal digits: 
+	<tt>0123456789abcdefABCDEF</tt>. 
+	Any other character ends the hexadecimal number.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+0xFF    <span class=arw>&rarr;</span>  255
+0x10ab  <span class=arw>&rarr;</span> 4267
+0X10CC  <span class=arw>&rarr;</span> 4300
+</pre>
+</blockquote>
+
+<p>
+	<b>Octals</b> start with an optional <tt>+</tt> (plus) or <tt>-</tt> (minus) sign and a <tt>0</tt> (zero), 
+	followed by any combination of the octal digits: <tt>01234567</tt>. 
+	Any other character ends the octal number.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+012   <span class=arw>&rarr;</span>  10
+010   <span class=arw>&rarr;</span>   8
+077   <span class=arw>&rarr;</span>  63
+-077  <span class=arw>&rarr;</span> -63
+</pre>
+</blockquote>
+
+
+<p>
+	<b>Floating point</b> numbers can start 
+	with an optional <tt>+</tt> (plus) or <tt>-</tt> (minus) sign, 
+	but they cannot be followed by a <tt>0</tt> (zero) if they are. 
+	This would make them octal numbers instead of floating points. 
+	A single <tt>.</tt> (decimal point) can appear anywhere within
+	a floating point number, including at the beginning.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+1.23     <span class=arw>&rarr;</span>  1.23
+-1.23    <span class=arw>&rarr;</span> -1.23
++2.3456  <span class=arw>&rarr;</span>  2.3456
+.506     <span class=arw>&rarr;</span>  0.506
+</pre>
+</blockquote>
+
+<p>
+	As described above, <b>scientific notation</b> 
+	starts with a floating point number
+	called the <em>significand</em> (or <em>mantissa</em>),
+	followed by the letter <tt>e</tt> or <tt>E</tt> 
+	and an integer <em>exponent</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+1.23e3    <span class=arw>&rarr;</span>  1230
+-1.23E3   <span class=arw>&rarr;</span> -1230
++2.34e-2  <span class=arw>&rarr;</span>     0.0234
+.506E3    <span class=arw>&rarr;</span>   506
+</pre>
+</blockquote>
+
+
+<br /><br /><br />
+
+<a NAME="type_ids"></a>
+<h2>2. Data types and names in the reference</h2>
+
+<p>
+	To describe the types and names 
+	of a function's parameters, 
+	the following naming convention
+	is used throughout the reference section:
+</p>
+
+<blockquote>
+<b>syntax: (format <em>str-format</em> <em>exp-data-1</em> [<em>exp-data-i</em> ... ])</b>
+
+</blockquote>
+
+<p>
+	Arguments are represented by symbols 
+	formed by the argument's type and name, 
+	separated by a <tt>-</tt> (hyphen).
+	Here, <em>str-format</em> (a string) and <em>exp-data-1</em> (an expression) 
+	are named "format" and "data-1", respectively.
+</p>
+
+<h3>bool</h3>
+
+<p>
+	<tt>true</tt>, <tt>nil</tt>, 
+	or an expression evaluating to 
+	one of these two.
+</p>
+
+<blockquote>
+<pre>
+true, nil, (&lt;= X 10)
+</pre>
+</blockquote>
+
+<h3>int</h3>
+
+<p>
+	An integer or an expression evaluating to an integer. 
+	Generally, if a floating point number is used 
+	when an int is expected, 
+	the value is truncated to an integer.
+</p>
+
+<blockquote>
+<pre>
+123, 5, (* X 5)
+</pre>
+</blockquote>
+
+<h3>num</h3>
+<p>
+	An integer, a floating point number, 
+	or an expression evaluating to one of these two. 
+	If an integer is passed, 
+	it is converted to a floating point number.
+</p>
+<blockquote>
+<pre>
+1.234, (div 10 3), (sin 1)
+</pre>
+</blockquote>
+
+<h3>matrix</h3>
+<p>
+	A list in which each row element is itself a list 
+	or an array in which each row element is itself an array.
+	All element lists or arrays (rows) are of the same length.
+	When using <a href="#det">det</a>, 
+	<A HREF="#multiply">multiply</A>, 
+	or <A HREF="#invert">invert</A>, 
+	all numbers must be floats or integers.
+</p>
+
+<p>
+	The dimensions of a matrix are defined 
+	by indicating the number of rows
+	and the number of column elements per row. 
+	Functions working on matrices 
+	ignore superfluous columns in a row. 
+	For missing row elements, 
+	<tt>0.0</tt> is assumed by the functions 
+	<a href="#det">det</a>, <a href="#multiply">multiply</a>, 
+	and <a href="#invert">invert</a>, 
+	while <a href="#transpose">transpose</a> assumes <tt>nil</tt>.
+	Special rules apply for <a href="#transpose">transpose</a> 
+	when a whole row is not a list or an array, 
+	but some other data type.
+</p>
+
+<blockquote>
+<pre>
+((1  2  3  4)
+ (5  6  7  8)
+ (9 10 11 12))       ; 3 rows 4 columns
+                   
+((1 2) (3 4) (5 6))  ; 3 rows 2 columns
+</pre>
+</blockquote>
+
+<h3>str</h3>
+<p>
+	A string or an expression that evaluates to a string.
+</p>
+<blockquote>
+<pre>
+"Hello", (append first-name  " Miller")
+</pre>
+</blockquote>
+
+<p>
+	Special characters can be included in quoted strings 
+	by placing a <tt>\</tt> (backslash) before the character
+	or digits to escape them:
+</p>
+<br />
+<center>
+<table border="0" cellpadding="1" width="95%" summary="escaping special characters in strings">
+<tr align="left" valign="bottom"><th>escaped<br />character</th><th>description</th></tr>
+<tr>
+<td><tt>\n</tt></td>
+<td>the line feed character (ASCII 10)</td>
+</tr>
+
+<tr>
+<td><tt>\r</tt></td>
+<td>the carriage return character (ASCII 13)</td>
+</tr>
+
+<tr>
+<td><tt>\t</tt></td>
+<td>the tab character (ASCII 9)</td>
+</tr>
+
+<tr>
+<td><tt>\nnn</tt></td>
+<td>a decimal ASCII code where nnn is between 000 and 255</td>
+</tr>
+
+<tr>
+<td><tt>\xnn</tt></td>
+<td>a hexadecimal code where nn is between 00 and FF</td>
+</tr>
+
+</table>
+</center>
+<br />
+
+<blockquote>
+<pre>
+"\065\066\067" <span class=arw>&rarr;</span> "ABC"
+"\x41\x42\x43" <span class=arw>&rarr;</span> "ABC"
+</pre>
+</blockquote>
+
+<p>
+	Instead of a <tt>"</tt> (double quote),
+	a <tt>{</tt> (left curly bracket) 
+	and <tt>}</tt> (right curly bracket) 
+	can be used to delimit strings.
+	This is useful when quotation marks need to occur inside strings. 
+	Quoting with the curly brackets
+	suppresses the backslash escape effect for special characters. 
+	Balanced nested curly brackets may be used within a string.
+	This aids in writing regular expressions or short sections of HTML.
+</p>
+
+<blockquote>
+<pre>
+(print "&lt;A HREF=\"http://mysite.com\"&gt;" ) ; the cryptic way
+
+(print {&lt;A HREF="http://mysite.com"&gt;} )   ; the readable way
+
+;; also possible because the inner brackets are balanced
+(regex {abc{1,2}} line) 
+
+(print [text]
+  this could be
+  a very long (&gt; 2048 characters) text,
+  i.e. HTML.
+[/text])
+</pre>
+</blockquote>
+
+<p>
+	The tags <tt>[text]</tt> and <tt>[/text]</tt> 
+	can be used to delimit long strings 
+	and suppress escape character translation. 
+	This is useful for delimiting long HTML passages 
+	in CGI files written in newLISP 
+	or for situations where character translation 
+	should be completely suppressed. 
+	Always use the <tt>[text]</tt> tags 
+	for strings longer than 2048 characters.
+</p>
+
+<h3>sym</h3>
+
+<p>
+	A symbol or expression evaluating to a symbol.
+</p>
+
+<blockquote>
+<pre>
+'xyz, (first '(+ - /)), '*, '- , 'someSymbol,
+</pre>
+</blockquote>
+
+<h3>context</h3>
+
+<p>
+	An expression evaluating to a context (namespace) 
+	or a variable symbol holding a context.
+</p>
+
+<blockquote>
+<pre>
+MyContext, aCtx, TheCTX
+</pre>
+</blockquote>
+
+<p>
+	Most of the context symbols in this manual 
+	start with an uppercase letter 
+	to distinguish them from other symbols.
+</p>
+
+<h3>sym-context</h3>
+<p>
+	A symbol, an existing context, 
+	or an expression evaluating to a symbol 
+	from which a context will be created. 
+	If a context does not already exist, 
+	many functions implicitly create them 
+	(e.g., <a href="#bayes-train">bayes-train</a>, <a Href="#context">context</a>, <a href="#eval-string">eval-string</a>, 
+<a href="#load">load</a>, <a href="#sym">sym</a>, and <a href="#xml-parse">xml-parse</a>).
+	The context must be specified 
+	when these functions are used 
+	on an existing context.
+	Even if a context already exists, 
+	some functions may continue to take symbols
+	(e.g., <a href="#context">context</a>).
+	For other functions, 
+	such as <a href="#contextp">context?</a>, 
+	the distinction is critical.
+</p>
+
+<h3>func</h3>
+
+<p>
+	A symbol or an expression evaluating to 
+	an operator symbol or lambda expression.
+</p>
+
+<blockquote>
+<pre>
++, add, (first '(add sub)), (lambda (x) (+ x x))
+</pre>
+</blockquote>
+
+<h3>list</h3>
+<p>
+	A list of elements (any type) 
+	or an expression evaluating to a list.
+</p>
+<blockquote>
+<pre>
+
+(a b c "hello" (+ 3 4))
+</pre>
+</blockquote>
+
+
+<h3>array</h3>
+<p>
+	An array 
+	(constructed with the 
+	<a href="#array">array</a> function).
+</p>
+
+<h3>exp</h3>
+
+<p>
+	Any of the above.
+</p>
+
+<h3>body</h3>
+
+<p>
+	One or more expressions that can be evaluated. 
+	The expressions are evaluated sequentially 
+	if there is more than one.
+</p>
+
+<blockquote>
+<pre>
+1 7.8
+nil
+(+ 3 4)
+"Hi" (+ a b)(print result)
+(do-this)(do-that) 123
+</pre>
+</blockquote>
+<br />
+
+
+
+<br /><br /><br />
+
+<a NAME="functions"></a>
+<h2>3. Functions in groups</h2>
+
+<p>
+	Some functions appear in more than one group.
+</p>
+
+<a NAME="list_processing"></a>
+<h3>List processing, flow control, and integer arithmetic</h3>
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="List processing, flow control and integer
+arithmetic">
+
+<tr>
+<td WIDTH="16%"><a href="#arithmetic">+, -, *, /, %</a></td>
+<td WIDTH="80%">integer arithmetic</td>
+</tr>
+
+<tr>
+<td><a href="#logical">&lt;, &gt;, =</a></td>
+<td>compares any data type: less, greater, equal</td>
+</tr>
+
+<tr>
+<td><a href="#logical">&lt;=, &gt;=, !=</a></td>
+<td>compares any data type: less-equal, greater-equal, not-equal</td>
+</tr>
+
+<tr>
+<td><a href="#colon">:</a></td>
+<td>constructs a context symbol and applies it to an object.</td>
+</tr>
+
+<tr>
+<td><a href="#and">and</a></td>
+<td>logical <tt>and</tt></td>
+</tr>
+
+<tr>
+<td><a href="#append">append</a></td>
+<td>appends lists ,arrays or strings to form a new list, array or string</td>
+</tr>
+
+<tr>
+<td><a href="#apply">apply</a></td>
+<td>applies a function or primitive to a list of arguments</td>
+</tr>
+
+<tr>
+<td><a href="#args">args</a></td>
+<td>retrieves the argument list of a macro expression</td>
+</tr>
+
+<tr>
+<td><a href="#assoc">assoc</a></td>
+<td>searches for keyword associations in a list</td>
+</tr>
+
+<tr>
+<td><a href="#assoc-set">assoc-set</a></td>
+<td>replaces an association in a list</td>
+</tr>
+
+<tr>
+<td><a href="#begin">begin</a></td>
+<td>begins a block of functions</td>
+</tr>
+
+<tr>
+<td><a href="#case">case</a></td>
+<td>branches depending on contents of control variable</td>
+</tr>
+
+<tr>
+<td><a href="#catch">catch</a></td>
+<td>evaluates an expression, possibly catching errors</td>
+</tr>
+
+<tr>
+<td><a href="#chop">chop</a></td>
+<td>chops elements from the end of a list</td>
+</tr>
+
+<tr>
+<td><a href="#clean">clean</a></td>
+<td>cleans elements from a list</td>
+</tr>
+
+<tr>
+<td><a href="#cond">cond</a></td>
+<td>branches conditionally to expressions</td>
+</tr>
+
+<tr>
+<td><a href="#cons">cons</a></td>
+<td>prepends an element to a list, making a new list</td>
+</tr>
+
+<tr>
+<td><a href="#constant">constant</a></td>
+<td>defines a constant symbol</td>
+</tr>
+
+<tr>
+<td><a href="#count">count</a></td>
+<td>counts elements of one list that occur in another list</td>
+</tr>
+
+<tr>
+<td><a href="#curry">curry</a></td>
+<td>Transforms a function f(x, y) into a function fx(y)</td>
+</tr>
+
+<tr>
+<td><a href="#define">define</a></td>
+<td>defines a new function or lambda expression</td>
+</tr>
+
+<tr>
+<td><a href="#define-macro">define-macro</a></td>
+<td>defines a macro or lambda-macro expression</td>
+</tr>
+
+<tr>
+<td><a href="#def-new">def-new</a></td>
+<td>copies a symbol to a different context (namespace)</td>
+</tr>
+
+<tr>
+<td><a href="#difference">difference</a></td>
+<td>returns the difference between two lists</td>
+</tr>
+
+<tr>
+<td><a href="#doargs">doargs</a></td>
+<td>iterates through the arguments of a function</td>
+</tr>
+
+<tr>
+<td><a href="#dolist">dolist</a></td>
+<td>evaluates once for each element in a list</td>
+</tr>
+
+<tr>
+<td><a href="#dolist">dostring</a></td>
+<td>evaluates once for each character in a string</td>
+</tr>
+
+<tr>
+<td><a href="#dotimes">dotimes</a></td>
+<td>evaluates once for each number in a range</td>
+</tr>
+
+<tr>
+<td><a href="#dotree">dotree</a></td>
+<td>iterates through the symbols of a context</td>
+</tr>
+
+<tr>
+<td><a href="#do-until">do-until</a></td>
+<td>repeats evaluation of an expression until the condition is met</td>
+</tr>
+
+<tr>
+<td><a href="#do-while">do-while</a></td>
+<td>repeats evaluation of an expression while the condition is true</td>
+</tr>
+
+<tr>
+<td><a href="#dup">dup</a></td>
+<td>duplicates a list or string a specified number of times</td>
+</tr>
+
+<tr>
+<td><a href="#ends-with">ends-with</a></td>
+<td>checks the end of a string or list against a key of the same type</td>
+</tr>
+
+<tr>
+<td><a href="#eval">eval</a></td>
+<td>evaluates an expression</td>
+
+</tr>
+<tr>
+<td><a href="#exists">exists</a></td>
+<td>checks for the existens of a condition in a list</td>
+</tr>
+
+<tr>
+<td><a href="#expand">expand</a></td>
+<td>replaces a symbol in a nested list</td>
+</tr>
+
+<tr>
+<td><a href="#first">first</a></td>
+<td>gets the first element of a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#filter">filter</a></td>
+<td>filters a list</td>
+</tr>
+
+<tr>
+<td><a href="#find">find</a></td>
+<td>searches for an element in a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#flat">flat</a></td>
+<td>returns the flattened list</td>
+</tr>
+
+<tr>
+<td><a href="#define">fn</a></td>
+<td>defines a new function or lambda expression</td>
+</tr>
+
+<tr>
+<td><a href="#for">for</a></td>
+<td>evaluates once for each number in a range</td>
+</tr>
+
+<tr>
+<td><a href="#for-all">for-all</a></td>
+<td>checks if all elements in a list meet a condition</td>
+</tr>
+
+<tr>
+<td><a href="#if">if</a></td>
+<td>evaluates an expression conditionally</td>
+</tr>
+
+<tr>
+<td><a href="#index">index</a></td>
+<td>filters elements from a list and returns their indices</td>
+</tr>
+
+
+<tr>
+<td><a href="#intersect">intersect</a></td>
+<td>returns the intersection of two lists</td>
+</tr>
+
+<tr>
+<td><a href="#define">lambda</a></td>
+<td>defines a new function or lambda expression</td>
+</tr>
+
+<tr>
+<td><a href="#last">last</a></td>
+<td>returns the last element of a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#length">length</a></td>
+<td>calculates the length of a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#let">let</a></td>
+<td>declares and initializes local variables</td>
+</tr>
+
+<tr>
+<td><a href="#letex">letex</a></td>
+<td>expands local variables into an expression, then evaluates</td>
+</tr>
+
+<tr>
+<td><a href="#letn">letn</a></td>
+<td>initializes local variables incrementally, like <em>nested lets</em></td>
+</tr>
+
+<tr>
+<td><a href="#list">list</a></td>
+<td>makes a list</td>
+</tr>
+
+<tr>
+<td><a href="#local">local</a></td>
+<td>declares local variables</td>
+</tr>
+
+<tr>
+<td><a href="#lookup">lookup</a></td>
+<td>looks up members in an association list</td>
+</tr>
+
+<tr>
+<td><a href="#map">map</a></td>
+<td>maps a function over members of a list, collecting the results</td>
+</tr>
+
+<tr>
+<td><a href="#match">match</a></td>
+<td>matches patterns against lists; for matching against strings, see <a href="#find">find</a> and <a href="#regex">regex</a></td>
+</tr>
+
+<tr>
+<td><a href="#member">member</a></td>
+<td>finds a member of a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#name">name</a></td>
+<td>returns the name of a symbol or its context as a string</td>
+</tr>
+
+<tr>
+<td><a href="#not">not</a></td>
+<td>logical <tt>not</tt></td>
+</tr>
+
+<tr>
+<td><a href="#nth">nth</a></td>
+<td>gets the <em>nth</em> element of a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#nth-set">nth-set</a></td>
+<td>changes the <em>nth</em> element of a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#or">or</a></td>
+<td>logical <tt>or</tt></td>
+</tr>
+
+<tr>
+<td><a href="#pop">pop</a></td>
+<td>deletes and returns an element from a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#push">push</a></td>
+<td>inserts a new element into a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#quote">quote</a></td>
+<td>quotes an expression</td>
+</tr>
+
+<tr>
+<td><a href="#ref">ref</a></td>
+<td>returns the position of an element inside a nested list</td>
+</tr>
+
+<tr>
+<td><a href="#ref-all">ref-all</a></td>
+<td>returns a list of index vectors of element inside a nested list</td>
+</tr>
+
+<tr>
+<td><a href="#ref-set">ref-set</a></td>
+<td>searches for an element in a nested list and replaces it</td>
+</tr>
+
+<tr>
+<td><a href="#rest">rest</a></td>
+<td>returns all but the first element of a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#replace">replace</a></td>
+<td>replaces elements inside a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#reverse">reverse</a></td>
+<td>reverses a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#rotate">rotate</a></td>
+<td>rotates a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#select">select</a></td>
+<td>selects and permutes elements from a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#set">set</a></td>
+<td>sets the binding or contents of a symbol</td>
+</tr>
+
+<tr>
+<td><a href="#setq">setq</a></td>
+<td>sets the binding or contents of an unquoted symbol</td>
+</tr>
+
+<tr>
+<td><a href="#set-assoc">set-assoc</a></td>
+<td>replaces an association within a list</td>
+</tr>
+
+<tr>
+<td><a href="#set-nth">set-nth</a></td>
+<td>changes the <em>nth</em> element of a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#set-ref">set-ref</a></td>
+<td>searches for an element in a nested list and replaces it</td>
+</tr>
+
+<tr>
+<td><a href="#set-ref-all">set-ref-all</a></td>
+<td>searches for an element in a nested list and replaces all instances</td>
+</tr>
+
+<tr>
+<td><a href="#silent">silent</a></td>
+<td>works like <a HREF="#begin">begin</a> but suppresses console output of the return value</td>
+</tr>
+
+<tr>
+<td><a href="#slice">slice</a></td>
+<td>extracts a sublist or substring</td>
+</tr>
+
+<tr>
+<td><a href="#sort">sort</a></td>
+<td>sorts the members of a list</td>
+</tr>
+
+<tr>
+<td><a href="#starts-with">starts-with</a></td>
+<td>checks the beginning of a string or list against a key of the same type</td>
+</tr>
+
+<tr>
+<td><a href="#swap">swap</a></td>
+<td>swaps two elements inside a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#unify">unify</a></td>
+<td>unifies two expressions</td>
+</tr>
+
+<tr>
+<td><a href="#unique">unique</a></td>
+<td>returns a list without duplicates</td>
+</tr>
+
+<tr>
+<td><a href="#unless">unless</a></td>
+<td>evaluates an expression conditionally</td>
+</tr>
+
+<tr>
+<td><a href="#until">until</a></td>
+<td>repeats evaluation of an expression until the condition is met</td>
+</tr>
+
+<tr>
+<td><a href="#when">when</a></td>
+<td>evaluate a block of statements conditionally</td>
+</tr>
+
+<tr>
+<td><a href="#while">while</a></td>
+<td>repeats evaluation of an expression while the condition is true</td>
+</tr>
+</table>
+</blockquote>
+
+<a NAME="string_operators"></a>
+<h3>String and conversion functions</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="String and conversion functions">
+
+
+<tr>
+<td WIDTH="16%"><a href="#address">address</a></td>
+<td WIDTH="84%">gets the memory address of a number or string</td>
+</tr>
+
+
+<tr>
+<td><a href="#append">append</a></td>
+<td>appends lists, arrays or strings to form a new list, array  or string</td>
+</tr>
+
+
+<tr>
+<td><a href="#char">char</a></td>
+<td>translates between characters and ASCII codes</td>
+</tr>
+
+<tr>
+<td><a href="#chop">chop</a></td>
+
+<td>chops off characters from the end of a string</td>
+</tr>
+
+<tr>
+<td><a href="#dup">dup</a></td>
+<td>duplicates a list or string a specified number of times</td>
+</tr>
+
+<tr>
+<td><a href="#ends-with">ends-with</a></td>
+<td>checks the end of a string or list against a key of the same type</td>
+</tr>
+
+<tr>
+<td><a href="#encrypt">encrypt</a></td>
+<td>does a one-time&ndash;pad encryption and decryption of a string</td>
+</tr>
+
+<tr>
+<td><a href="#eval-string">eval-string</a></td>
+<td>compiles, then evaluates a string</td>
+</tr>
+
+<tr>
+<td><a href="#explode">explode</a></td>
+
+<td>transforms a string into a list of characters</td>
+</tr>
+
+<tr>
+<td><a href="#find">find</a></td>
+<td>searches for an element in a list or string</td>
+</tr>
+
+<!-- 8.9.4 -->
+<tr>
+<td><a href="#find-all">find-all</a></td>
+<td>returns a list of all pattern matches found in string</td>
+</tr>
+
+<tr>
+<td><a href="#first">first</a></td>
+<td>gets the first element in a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#float">float</a></td>
+<td>translates a string or integer into a floating point number</td>
+</tr>
+
+<tr>
+<td><a href="#format">format</a></td>
+<td>formats numbers and strings as in the C language</td>
+</tr>
+
+<tr>
+<td><a href="#get-char">get-char</a></td>
+
+<td>gets a character from a memory address</td>
+</tr>
+
+<tr>
+<td><a href="#get-float">get-float</a></td>
+<td>gets a double float from a memory address</td>
+</tr>
+
+<tr>
+<td><a href="#get-int">get-int</a>&nbsp;&nbsp;</td>
+<td>gets an 32-bitinteger from a memory address</td>
+</tr>
+
+<tr>
+<td><a href="#get-long">get-long</a>&nbsp;&nbsp;</td>
+<td>gets a long 64-bit integer from a memory address</td>
+</tr>
+
+<tr>
+<td><a href="#get-string">get-string</a></td>
+<td>gets a string from a memory address</td>
+</tr>
+
+<tr>
+<td><a href="#int">int</a></td>
+<td>translates a string or float into an integer</td>
+</tr>
+
+<tr>
+<td><a href="#join">join</a></td>
+<td>joins a list of strings</td>
+</tr>
+
+<tr>
+<td><a href="#last">last</a></td>
+<td>returns the last element of a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#lower-case">lower-case</a></td>
+<td>converts a string to lowercase characters</td>
+</tr>
+
+<tr>
+<td><a href="#member">member</a></td>
+<td>finds a list or string member</td>
+</tr>
+
+<tr>
+<td><a href="#name">name</a></td>
+<td>returns the name of a symbol or its context as a string</td>
+</tr>
+
+<tr>
+<td><a href="#nth">nth</a></td>
+<td>gets the <em>nth</em> element in a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#nth-set">nth-set</a></td>
+<td>changes the <em>nth</em> element of a list or string</td>
+</tr>
+
+
+<tr>
+<td><a href="#pack">pack</a></td>
+<td>packs LISP expressions into a binary structure</td>
+</tr>
+
+<tr>
+<td><a href="#parse">parse</a></td>
+<td>breaks a string into tokens</td>
+</tr>
+
+<tr>
+<td><a href="#pop">pop</a></td>
+<td>pops from a string</td>
+</tr>
+
+<tr>
+<td><a href="#push">push</a></td>
+<td>pushes onto a string</td>
+</tr>
+
+<tr>
+<td><a href="#regex">regex</a></td>
+<td>performs a Perl-compatible regular expression search</td>
+</tr>
+
+<tr>
+<td><a href="#replace">replace</a></td>
+<td>replaces elements in a list or string</td>
+
+</tr>
+
+<tr>
+<td><a href="#rest">rest</a></td>
+<td>gets all but the first element of a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#reverse">reverse</a></td>
+<td>reverses a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#rotate">rotate</a></td>
+<td>rotates a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#select">select</a></td>
+<td>selects and permutes elements from a list or string</td>
+</tr>
+
+
+<tr>
+<td><a href="#set-nth">set-nth</a></td>
+<td>changes the element in a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#slice">slice</a></td>
+
+<td>extracts a substring or sublist</td>
+</tr>
+
+<tr>
+<td><a href="#source">source</a></td>
+<td>returns the source required to bind a symbol to a string</td>
+</tr>
+
+<tr>
+<td><a href="#starts-with">starts-with</a></td>
+<td>checks the start of the string or list against a key string or list</td>
+</tr>
+
+<tr>
+<td><a href="#string">string</a></td>
+<td>transforms anything into a string</td>
+</tr>
+
+<tr>
+<td><a href="#sym">sym</a></td>
+<td>translates a string into a symbol</td>
+</tr>
+
+<tr>
+<td><a href="#title-case">title-case</a></td>
+
+<td>converts the first character of a string to uppercase</td>
+</tr>
+
+<tr>
+<td><a href="#trim">trim</a></td>
+<td>trims a string of one or both sides</td>
+</tr>
+
+<tr>
+<td><a href="#unicode">unicode</a></td>
+<td>converts ASCII or UTF-8 to UCS-4 Unicode</td>
+</tr>
+
+<tr>
+<td><a href="#utf8">utf8</a></td>
+<td>converts UCS-4 Unicode to UTF-8</td>
+</tr>
+
+<tr>
+<td><a href="#utf8len">utf8</a></td>
+<td>returns length of an UTF-8 string in UTF-8 characters</td>
+</tr>
+
+
+<tr>
+<td><a href="#unpack">unpack</a></td>
+<td>unpacks a binary structure into LISP expressions</td>
+</tr>
+
+<tr>
+
+<td><a href="#upper-case">upper-case</a></td>
+<td>converts a string to uppercase characters</td>
+</tr>
+
+</table>
+</blockquote>
+
+
+<a NAME="floating_point"></a>
+<h3>Floating point math and special functions</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Floating point math and special functions">
+
+
+<tr>
+<td WIDTH="16%"><a href="#abs">abs</a></td>
+<td WIDTH="84%">calculates the absolute value of a number</td>
+</tr>
+
+<tr>
+<td><a href="#acos">acos</a></td>
+<td>calculates the arccosine of a number</td>
+</tr>
+
+<tr>
+<td><a href="#acosh">acosh</a></td>
+<td>calculates the inverse hyperbolic cosine of a number</td>
+</tr>
+
+<tr>
+<td><a href="#add">add</a></td>
+<td>adds floating point or integer numbers</td>
+</tr>
+
+<tr>
+<td><a href="#array">array</a></td>
+<td>creates an array</td>
+</tr>
+
+<tr>
+<td><a href="#array-list">array-list</a></td>
+<td>returns a list conversion from an array</td>
+</tr>
+
+<tr>
+<td><a href="#asin">asin</a></td>
+<td>calculates the arcsine of a number</td>
+</tr>
+
+<tr>
+<td><a href="#asinh">asinh</a></td>
+<td>calculates the inverse hyperbolic sine of a number</td>
+</tr>
+
+
+<tr>
+<td><a href="#atan">atan</a></td>
+<td>calculates the arctangent of a number</td>
+</tr>
+
+<tr>
+<td><a href="#atanh">atanh</a></td>
+<td>calculates the inverse hyperbolic tangent of a number</td>
+</tr>
+
+<tr>
+<td><a href="#atan2">atan2</a></td>
+<td>computes the principal value of the arctangent of Y / X in radians</td>
+</tr>
+
+<tr>
+<td><a href="#beta">beta</a></td>
+<td>calculates the beta function</td>
+</tr>
+
+<tr>
+<td><a href="#betai">betai</a></td>
+<td>calculates the incomplete beta function</td>
+</tr>
+
+<tr>
+<td><a href="#binomial">binomial</a></td>
+<td>calculates the binomial function</td>
+</tr>
+
+<tr>
+<td><a href="#ceil">ceil</a></td>
+
+<td>rounds up to the next integer</td>
+</tr>
+
+<tr>
+<td><a href="#cos">cos</a></td>
+<td>calculates the cosine of a number</td>
+
+</tr>
+<tr>
+<td><a href="#cosh">cosh</a></td>
+<td>calculates the hyperbolic cosine of a number</td>
+</tr>
+
+<tr>
+<td><a href="#crc32">crc32</a></td>
+<td>calculates a 32-bit CRC for a data buffer</td>
+</tr>
+
+<tr>
+<td><a href="#crit-chi2">crit-chi2</a></td>
+<td>calculates the Chi&sup2; for a given probability</td>
+</tr>
+
+<tr>
+<td><a href="#crit-z">crit-z</a></td>
+<td>calculates the normal distributed Z for a given probability</td>
+</tr>
+<tr>
+<td><a href="#dec">dec</a></td>
+
+<td>decrements a number</td>
+</tr>
+
+<tr>
+<td><a href="#div">div</a></td>
+<td>divides floating point or integer numbers</td>
+</tr>
+
+<tr>
+<td><a href="#erf">erf</a></td>
+<td>calculates the error function of a number</td>
+</tr>
+
+<tr>
+<td><a href="#exp">exp</a></td>
+<td>calculates the exponential <em>e</em> of a number</td>
+</tr>
+
+<tr>
+<td><a href="#factor">factor</a></td>
+<td>factors a number into primes</td>
+</tr>
+
+
+<tr>
+<td><a href="#fft">fft</a></td>
+<td>performs a fast Fourier transform (FFT)</td>
+</tr>
+
+<tr>
+<td><a href="#floor">floor</a></td>
+<td>rounds down to the next integer</td>
+</tr>
+
+<tr>
+
+<td><a href="#flt">flt</a></td>
+<td>converts a number to a 32-bit integer representing a float</td>
+</tr>
+
+<tr>
+<td><a href="#gammai">gammai</a></td>
+<td>calculates the incomplete Gamma function</td>
+</tr>
+
+<tr>
+<td><a href="#gammaln">gammaln</a></td>
+<td>calculates the log Gamma function</td>
+</tr>
+
+<tr>
+<td><a href="#gcd">gcd</a></td>
+<td>calculates the greates common divisor of a group of integers</td>
+</tr>
+
+<tr>
+<td><a href="#ifft">ifft</a></td>
+<td>performs an inverse fast Fourier transform (IFFT)</td>
+</tr>
+
+<tr>
+<td><a href="#inc">inc</a></td>
+<td>increments a number</td>
+</tr>
+
+<tr>
+
+<td><a href="#log">log</a></td>
+<td>calculates the natural or other logarithm of a number</td>
+</tr>
+
+<tr>
+<td><a href="#min">min</a></td>
+<td>finds the smallest value in a series of values</td>
+</tr>
+
+<tr>
+<td><a href="#max">max</a></td>
+<td>finds the largest value in a series of values</td>
+
+</tr>
+
+<tr>
+<td><a href="#mod">mod</a></td>
+<td>calculates the modulo of two numbers</td>
+</tr>
+
+<tr>
+<td><a href="#mul">mul</a></td>
+<td>multiplies floating point or integer numbers</td>
+</tr>
+
+<tr>
+<td><a href="#round">round</a></td>
+<td>rounds a number</td>
+</tr>
+
+<tr>
+<td><a href="#pow">pow</a></td>
+<td>calculates <em>x</em> to the power of <em>y</em></td>
+</tr>
+
+<tr>
+<td><a href="#sequence">sequence</a></td>
+<td>generates a list sequence of numbers</td>
+</tr>
+
+<tr>
+<td><a href="#series">series</a></td>
+
+<td>creates a geometric sequence of numbers</td>
+</tr>
+
+<tr>
+<td><a href="#sgn">sgn</a></td>
+<td>calculates the signum function of a number</td>
+</tr>
+
+<tr>
+<td><a href="#sin">sin</a></td>
+<td>calculates the sine of a number</td>
+</tr>
+
+<tr>
+<td><a href="#sinh">sinh</a></td>
+<td>calculates the hyperbolic sine of a number</td>
+</tr>
+
+<tr>
+<td><a href="#sqrt">sqrt</a></td>
+<td>calculates the square root of a number</td>
+</tr>
+
+<tr>
+<td><a href="#sub">sub</a></td>
+<td>subtracts floating point or integer numbers</td>
+</tr>
+
+<tr>
+<td><a href="#tanh">tanh</a></td>
+<td>calculates the hyperbolic tangent of a number</td>
+</tr>
+
+<tr>
+<td><a href="#uuid">uuid</a>&nbsp;</td>
+<td>returns a UUID (Universal Unique IDentifier)</td>
+</tr>
+
+</table>
+</blockquote>
+
+
+<a NAME="matrices"></a>
+<h3>Matrix functions</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Matrix functions">
+
+<tr>
+<td  WIDTH="16%"><a href="#det">det</a></td>
+<td  WIDTH="84%">return the determinant of a matrix</td>
+</tr>
+
+<tr>
+<td><a href="#invert">invert</a></td>
+<td>return the inversion of a matrix</td>
+</tr>
+
+<tr>
+<td><a href="#mat">mat</a></td>
+<td>perform scalar operations on matrices</td>
+</tr>
+
+<tr>
+<td><a href="#multiply">multiply</a></td>
+<td>multiplies two matrices</td>
+</tr>
+
+<tr>
+<td><a href="#transpose">transpose</a>&nbsp;</td>
+<td>returns the transposition of a matrix</td>
+</tr>
+
+</table>
+</blockquote>
+
+<a NAME="array-funcs"></a>
+<h3>Array functions</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Array functions">
+
+<tr>
+<td width="16%" ><a href="#append">append</a></td>
+<td width="84%">appends arrays</td>
+</tr>
+
+<tr>
+<td><a href="#array">array</a></td>
+<td>creates and initializes an array with up to 16 dimensions</td>
+</tr>
+
+<tr>
+<td><a href="#array-list">array-list</a></td>
+<td>converts an array into a list</td>
+</tr>
+
+<tr>
+<td><a href="#arrayp">array?</a></td>
+<td>checks if expression is an array</td>
+</tr>
+
+<tr>
+<td ><a href="#det">det</a></td>
+<td>returns the determinant of a matrix</td>
+</tr>
+
+<tr>
+<td ><a href="#first">first</a></td>
+<td>returns the first row of an array</td>
+</tr>
+
+<tr>
+<td ><a href="#invert">invert</a></td>
+<td>returns the inversion of a matrix</td>
+</tr>
+
+<tr>
+<td ><a href="#last">last</a></td>
+<td>returns the last row of an array</td>
+</tr>
+
+<tr>
+<td><a href="#mat">mat</a></td>
+<td>perform scalar operations on matrices</td>
+</tr>
+
+
+<tr>
+<td ><a href="#multiply">multiply</a></td>
+<td>multiplies two matrices</td>
+</tr>
+
+<tr>
+<td ><a href="#nth">nth</a></td>
+<td>returns an element of and array</td>
+</tr>
+
+<tr>
+<td ><a href="#nth-set">nth-set</a></td>
+<td>changes the element, returning the old; significantly faster than <tt>set-nth</tt></td>
+</tr>
+
+<tr>
+<td ><a href="#rest">rest</a></td>
+<td>returns all but the first row of an array</td>
+</tr>
+
+<tr>
+<td ><a href="#set-nth">set-nth</a></td>
+<td>changes the element and returns the changed array</td>
+</tr>
+
+<tr>
+<td ><a href="#slice">slice</a></td>
+<td>returns a slice of an array</td>
+</tr>
+
+<tr>
+<td ><a href="#transpose">transpose</a></td>
+<td>transposes a matrix</td>
+</tr>
+</table>
+</blockquote>
+
+<a NAME="bit_operators"></a>
+<h3>Bit operators</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="bit operators">
+
+
+<tr>
+<td WIDTH="16%"><a href="#bit_shift">&lt;&lt;, &gt;&gt;</a>&nbsp;&nbsp;&nbsp;</td>
+<td WIDTH="84%">bit shift left, bit shift right</td>
+</tr>
+
+<tr>
+<td><a href="#bit_and">&amp;</a></td>
+<td>bitwise and</td>
+</tr>
+
+<tr>
+<td><a href="#bit_inclusive">|</a></td>
+<td>bitwise inclusive or</td>
+
+</tr>
+
+<tr>
+<td><a href="#bit_exclusive">^</a></td>
+<td>bitwise exclusive or</td>
+</tr>
+
+<tr>
+<td><a href="#bit_not">~</a></td>
+<td>bitwise not</td>
+</tr>
+</table>
+</blockquote>
+
+<a NAME="predicates"></a>
+<h3>Predicates</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Predicates">
+
+<tr>
+<td width="16%"><a href="#atomp">atom?</a></td>
+<td width="84%">checks if an expression is an atom</td>
+</tr>
+
+<tr>
+<td><a href="#arrayp">array?</a></td>
+<td>checks if an expression is an array</td>
+</tr>
+
+<tr>
+<td><a href="#contextp">context?</a></td>
+<td>checks if an expression is a context</td>
+</tr>
+
+<tr>
+<td><a href="#directoryp">directory?</a></td>
+<td>checks if a disk node is a directory</td>
+</tr>
+
+<tr>
+<td><a href="#emptyp">empty?</a></td>
+<td>checks if a list or string is empty</td>
+</tr>
+
+<tr>
+<td><a href="#filep">file?</a></td>
+<td>checks for the existence of a file</td>
+</tr>
+
+<tr>
+<td><a href="#floatp">float?</a></td>
+<td>checks if an expression is a float</td>
+</tr>
+
+<tr>
+<td><a href="#globalp">global?</a></td>
+<td>checks if a symbol is global</td>
+</tr>
+
+<tr>
+<td><a href="#integerp">integer?</a></td>
+<td>checks if an expression is an integer</td>
+</tr>
+
+<tr>
+<td><a href="#lambdap">lambda?</a></td>
+<td>checks if an expression is a lambda expression</td>
+</tr>
+
+<tr>
+<td><a href="#legalp">legal?</a></td>
+<td>checks if a string contains a legal symbol</td>
+</tr>
+
+<tr>
+<td><a href="#listp">list?</a></td>
+<td>checks if an expression is a list</td>
+</tr>
+
+<tr>
+<td><a href="#macrop">macro?</a></td>
+<td>checks if an expression is a lambda-macro expression</td>
+</tr>
+
+<tr>
+<td><a href="#NaNp">NaN?</a></td>
+<td>checks if a float is NaN (not a number)</td>
+</tr>
+
+<tr>
+<td><a href="#nilp">nil?</a></td>
+<td>checks if an expression is <tt>nil</tt></td>
+</tr>
+
+<tr>
+<td><a href="#nullp">null?</a></td>
+<td>checks if an expression is <tt>nil</tt>, <tt>""</tt>, <tt>()</tt> or <tt>0</tt>.</td>
+</tr>
+
+<tr>
+<td><a href="#numberp">number?</a></td>
+<td>checks if an expression is a float or an integer</td>
+</tr>
+
+<tr>
+<td><a href="#protectedp">protected?</a></td>
+<td>checks if a symbol is protected</td>
+</tr>
+
+<tr>
+<td><a href="#primitivep">primitive?</a></td>
+<td>checks if an expression is a primitive</td>
+</tr>
+
+<tr>
+<td><a href="#quotep">quote?</a></td>
+<td>checks if an expression is quoted</td>
+</tr>
+
+<tr>
+<td><a href="#stringp">string?</a></td>
+<td>checks if an expression is a string</td>
+</tr>
+
+<tr>
+<td><a href="#symbolp">symbol?</a></td>
+<td>checks if an expression is a symbol</td>
+</tr>
+
+<tr>
+<td><a href="#truep">true?</a></td>
+<td>checks if an expression is not <tt>nil</tt></td>
+</tr>
+
+<tr>
+<td><a href="#zerop">zero?</a></td>
+<td>checks if an expression is <tt>0</tt> or <tt>0.0</tt></td>
+</tr>
+
+</table>
+</blockquote>
+
+
+<a NAME="timedate"></a>
+<h3>Time and date functions</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Time and date functions">
+
+
+<tr>
+<td WIDTH="16%"><a href="#date">date</a></td>
+<td WIDTH="84%">converts a date-time value to a string</td>
+</tr>
+
+<tr>
+<td><a href="#date-value">date-value</a></td>
+<td>calculates the time in seconds since January 1, 1970 for a date and time</td>
+</tr>
+
+<tr>
+<td><a href="#parse-date">parse-date</a></td>
+<td>parse a data string</td>
+</tr>
+
+<tr>
+<td><a href="#now">now</a></td>
+<td>returns a list of current date-time information</td>
+</tr>
+
+<tr>
+<td><a href="#time">time</a></td>
+<td>calculates the time it takes to evaluate an expression in milliseconds</td>
+</tr>
+
+<tr>
+<td><a href="#time-of-day">time-of-day</a></td>
+<td>calculates the number of milliseconds elapsed since the day started</td>
+</tr>
+
+</table>
+</blockquote>
+
+<a NAME="montecarlo"></a>
+<h3>Simulation and modeling math functions</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Simulation and modelling math functions">
+
+
+<tr>
+<td width="16%"><a href="#amb">amb</a></td>
+<td width="84%">randomly picks an argument and evaluates it</td>
+</tr>
+
+<tr>
+<td width="16%"><a href="#bayes-query">bayes-query</a></td>
+<td width="84%">calculates Bayesian probabilities for a data set</td>
+</tr>
+
+<tr>
+<td width="16%"><a href="#bayes-train">bayes-train</a></td>
+<td width="84%">counts items in lists for Bayesian or frequency analysis</td>
+</tr>
+
+<tr>
+<td><a href="#normal">normal</a></td>
+<td>makes a list of normal distributed floating point numbers</td>
+</tr>
+
+<tr>
+<td><a href="#prob-chi2">prob-chi2</a></td>
+
+<td>calculates the cumulated probability of Chi&sup2;</td>
+</tr>
+
+<tr>
+<td><a href="#prob-z">prob-z</a></td>
+<td>calculates the cumulated probability of a Z-value</td>
+</tr>
+
+<tr>
+<td><a href="#rand">rand</a></td>
+<td>generates random numbers in a range</td>
+</tr>
+
+<tr>
+<td><a href="#random">random</a></td>
+<td>generates a list of evenly distributed floats</td>
+</tr>
+
+<tr>
+<td><a href="#randomize">randomize</a></td>
+<td>shuffles all of the elements in a list</td>
+</tr>
+
+<tr>
+<td><a href="#seed">seed</a></td>
+
+<td>seeds the internal random number generator</td>
+</tr>
+
+</table>
+</blockquote>
+
+<a NAME="pattern"></a>
+<h3>Pattern matching</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Time and date functions">
+
+<tr>
+<td><a href="#ends-with">ends-with</a></td>
+<td>Test if a list or string ends with a pattern</td>
+</tr>
+
+<tr>
+<td WIDTH="16%"><a href="#find">find</a></td>
+<td WIDTH="84%">Search for a pattern in a list or string</td>
+</tr>
+
+<tr>
+<td><a href="#find-all">find-all</a></td>
+<td>Find all ocurrences of a pattern in a string</td>
+</tr>
+
+<tr>
+<td><a href="#match">match</a></td>
+<td>Match list patterns</td>
+</tr>
+
+<tr>
+<td><a href="#parse">parse</a></td>
+<td>Break a string along around patterns</td>
+</tr>
+
+<tr>
+<td><a href="#regex">regex</a></td>
+<td>Find patterns in a string</td>
+</tr>
+
+<tr>
+<td><a href="#replace">replace</a></td>
+<td>Replace patterns in a string</td>
+</tr>
+
+<tr>
+<td><a href="#search">search</a></td>
+<td>Search for a pattern in a file</td>
+</tr>
+
+<tr>
+<td><a href="#starts-with">starts-with</a></td>
+<td>Test if a list or string starts with a pattern</td>
+</tr>
+
+<tr>
+<td><a href="#unify">unify</a></td>
+<td>Logical unification of patterns</td>
+</tr>
+
+</table>
+</blockquote>
+
+
+<a NAME="financial"></a>
+<h3>Financial math functions</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Financial math functions">
+
+<tr>
+<td WIDTH="16%"><a href="#fv">fv</a></td>
+<td WIDTH="84%">returns the future value of an investment</td>
+</tr>
+
+<tr>
+<td><a href="#irr">irr</a></td>
+<td>calculates the internal rate of return</td>
+</tr>
+
+<tr>
+<td><a href="#nper">nper</a></td>
+<td>calculates the number of periods for an investment</td>
+</tr>
+
+<tr>
+<td><a href="#npv">npv</a></td>
+<td>calculates the net present value of an investment</td>
+</tr>
+
+<tr>
+<td><a href="#pv">pv</a></td>
+
+<td>calculates the present value of an investment</td>
+</tr>
+
+<tr>
+<td><a href="#pmt">pmt</a></td>
+<td>calculates the payment for a loan</td>
+</tr>
+
+</table>
+</blockquote>
+
+
+<a NAME="input_output"></a>
+<h3>Input/output and file operations</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Input/output and file operations">
+
+
+<tr>
+<td WIDTH="16%"><a href="#append-file">append-file</a></td>
+<td WIDTH="84%">appends data to a file</td>
+</tr>
+
+<tr>
+<td><a href="#close">close</a></td>
+<td>closes a file</td>
+</tr>
+
+<tr>
+<td><a href="#command-line">command-line</a>&nbsp;&nbsp;&nbsp;</td>
+<td>enables or disables interactive command line</td>
+
+</tr>
+
+<tr>
+<td><a href="#current-line">current-line</a></td>
+<td>retrieves contents of last read-line buffer</td>
+</tr>
+
+<tr>
+<td><a href="#device">device</a></td>
+<td>sets or inquires about current print device</td>
+</tr>
+
+<tr>
+
+<td><a href="#exec">exec</a></td>
+<td>launches another program, then reads from or writes to it</td>
+</tr>
+
+<tr>
+<td><a href="#load">load</a></td>
+<td>loads and evaluates a file of LISP code</td>
+</tr>
+
+<tr>
+<td><a href="#open">open</a></td>
+<td>opens a file for reading or writing</td>
+
+</tr>
+
+<tr>
+<td><a href="#peek">peek</a></td>
+<td>checks file descriptor for number of bytes ready for reading</td>
+</tr>
+
+<tr>
+<td><a href="#print">print</a></td>
+<td>prints to the console or a device</td>
+</tr>
+
+<tr>
+
+<td><a href="#println">println</a></td>
+<td>prints to the console or a device with a line feed</td>
+</tr>
+
+<tr>
+<td><a href="#read-buffer">read-buffer</a></td>
+<td>reads binary data from a file</td>
+</tr>
+
+<tr>
+<td><a href="#read-char">read-char</a></td>
+<td>reads an 8-bit character from a file</td>
+
+</tr>
+
+<tr>
+<td><a href="#read-file">read-file</a></td>
+<td>reads a whole file in one operation</td>
+</tr>
+
+<tr>
+<td><a href="#read-key">read-key</a></td>
+<td>reads a keyboard key</td>
+</tr>
+
+<tr>
+<td><a href="#read-line">read-line</a></td>
+<td>reads a line from the console or file</td>
+</tr>
+
+<tr>
+<td><a href="#save">save</a></td>
+<td>saves a workspace, context, or symbol to a file</td>
+</tr>
+
+<tr>
+<td><a href="#search">search</a></td>
+<td>searches a file for a string</td>
+
+</tr>
+
+<tr>
+<td><a href="#seek">seek</a></td>
+<td>sets or reads a file position</td>
+</tr>
+
+<tr>
+<td><a href="#write-buffer">write-buffer</a></td>
+<td>writes binary data to a file or string</td>
+</tr>
+
+<tr>
+
+<td><a href="#write-char">write-char</a></td>
+<td>writes a character to a file</td>
+</tr>
+
+<tr>
+<td><a href="#write-file">write-file</a></td>
+<td>writes a file in one operation</td>
+</tr>
+
+<tr>
+<td><a href="#write-line">write-line</a></td>
+<td>writes a line to the console or a file</td>
+</tr>
+
+</table>
+</blockquote>
+
+
+<a NAME="process_threads"></a>
+<h3>Processes, pipes and threads</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Processes, pipes and threads">
+
+<tr>
+<td WIDTH="16%"><a href="#shell">!</a></td>
+<td WIDTH="84%">shells out to the operating system</td>
+</tr>
+
+<tr>
+<td><a href="#destroy">destroy</a></td>
+<td>Destroys a process created with with <tt>fork</tt> or <tt>process</tt></td>
+</tr>
+
+<tr>
+<td><a href="#exec">exec</a></td>
+<td>runs a process, then reads from or writes to it</td>
+</tr>
+
+<tr>
+<td><a href="#fork">fork</a></td>
+<td>launches a newLISP child process thread</td>
+</tr>
+
+<tr>
+<td><a href="#pipe">pipe</a></td>
+
+<td>creates a pipe for interprocess communication</td>
+</tr>
+
+<tr>
+<td><a href="#process">process</a></td>
+<td>launches a child process, remapping standard I/O and standard error</td>
+</tr>
+
+<tr>
+<td><a href="#semaphore">semaphore</a></td>
+<td>creates and controls semaphores</td>
+</tr>
+
+<tr>
+<td><a href="#share">share</a></td>
+<td>shares memory with other processes and threads</td>
+</tr>
+
+<tr>
+<td><a href="#wait-pid">wait-pid</a></td>
+<td>waits for a child process to end</td>
+</tr>
+
+</table>
+</blockquote>
+
+
+<a NAME="directory_management"></a>
+<h3>File and directory management</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="File and directory management">
+
+<tr>
+<td WIDTH="16%"><a href="#change-dir">change-dir</a>&nbsp;</td>
+<td WIDTH="84%">changes to a different drive and directory</td>
+</tr>
+
+<tr>
+<td><a href="#copy-file">copy-file</a></td>
+<td>copies a file</td>
+</tr>
+
+<tr>
+<td><a href="#delete-file">delete-file</a></td>
+<td>deletes a file</td>
+</tr>
+
+<tr>
+<td><a href="#directory">directory</a></td>
+<td>returns a list of directory entries</td>
+</tr>
+
+<tr>
+<td><a href="#file-info">file-info</a></td>
+<td>gets file size, date, time, and attributes</td>
+</tr>
+
+<tr>
+<td><a href="#make-dir">make-dir</a></td>
+<td>makes a new directory</td>
+</tr>
+
+<tr>
+<td><a href="#real-path">real-path</a></td>
+<td>returns the full path of the relative file path</td>
+</tr>
+
+<tr>
+<td><a href="#remove-dir">remove-dir</a></td>
+<td>removes an empty directory</td>
+</tr>
+
+<tr>
+<td><a href="#rename-file">rename-file</a></td>
+<td>renames a file or directory</td>
+</tr>
+
+</table>
+</blockquote>
+
+<a NAME="http_api"></a>
+<h3>HTTP networking API</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="HTTP networking API">
+
+
+<tr>
+<td width="16%"><a href="#base64-enc">base64-enc</a></td>
+<td width="84%">encodes a string into BASE64 format</td>
+</tr>
+
+<tr>
+<td><a href="#base64-dec">base64-dec</a></td>
+
+<td>decodes a string from BASE64 format</td>
+</tr>
+
+<tr>
+<td><a href="#delete-url">delete-url</a></td>
+<td>deletes a file or page from the web</td>
+</tr>
+
+<tr>
+<td><a href="#get-url">get-url</a></td>
+<td>reads a file or page from the web</td>
+</tr>
+
+<tr>
+<td><a href="#post-url">post-url</a></td>
+<td>posts info to a URL address</td>
+</tr>
+
+<tr>
+<td><a href="#put-url">put-url</a></td>
+<td>uploads a page to a URL address</td>
+</tr>
+
+<tr>
+<td><a href="#xml-error">xml-error</a></td>
+<td>returns last XML parse error</td>
+</tr>
+
+<tr>
+<td><a href="#xml-parse">xml-parse</a></td>
+
+<td>parses an XML document</td>
+</tr>
+
+<tr>
+<td><a href="#xml-type-tags">xml-type-tags</a>&nbsp;</td>
+<td>shows or modifies XML type tags</td>
+</tr>
+
+</table>
+</blockquote>
+
+<a NAME="socket_tcpip"></a>
+<h3>Socket TCP/IP and UDP network API</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Socket TCP/IP and UDP network API">
+
+
+<tr>
+<td WIDTH="16%"><a href="#net-accept">net-accept</a></td>
+<td WIDTH="84%">accepts a new incoming connection</td>
+</tr>
+
+<tr>
+<td><a href="#net-close">net-close</a></td>
+<td>closes a socket connection</td>
+</tr>
+
+<tr>
+<td><a href="#net-connect">net-connect</a></td>
+<td>connects to a remote host</td>
+</tr>
+
+<tr>
+<td><a href="#net-error">net-error</a></td>
+<td>returns the last error</td>
+</tr>
+
+<tr>
+<td><a href="#net-eval">net-eval</a></td>
+<td>evaluates expressions on multiple remote newLISP servers</td>
+</tr>
+
+<tr>
+<td><a href="#net-listen">net-listen</a></td>
+<td>listens for connections to a local socket</td>
+</tr>
+
+<tr>
+<td><a href="#net-local">net-local</a></td>
+<td>returns the local IP and port number for a connection</td>
+</tr>
+
+<tr>
+<td><a href="#net-lookup">net-lookup</a></td>
+<td>returns the name for an IP number</td>
+</tr>
+
+<tr>
+<td><a href="#net-peer">net-peer</a></td>
+<td>returns the remote IP and port for a net connect</td>
+</tr>
+
+<tr>
+<td><a href="#net-peek">net-peek</a></td>
+
+<td>returns the number of characters ready to be read</td>
+</tr>
+
+<tr>
+<td><a href="#net-ping">net-ping</a></td>
+<td>sends a ping packet (ICMP echo request) to one or more addresses</td>
+</tr>
+
+<tr>
+<td><a href="#net-receive">net-receive</a></td>
+<td>reads data on a socket connection</td>
+</tr>
+
+<tr>
+<td><a href="#net-receive-from">net-receive-from</a>&nbsp;</td>
+<td>reads a UDP on an open connection</td>
+</tr>
+
+<tr>
+<td><a href="#net-receive-udp">net-receive-udp</a></td>
+<td>reads a UDP and closes the connection</td>
+</tr>
+
+<tr>
+<td><a href="#net-select">net-select</a></td>
+
+<td>checks a socket or list of sockets for status</td>
+</tr>
+
+<tr>
+<td><a href="#net-send">net-send</a></td>
+<td>sends data on a socket connection</td>
+</tr>
+
+<tr>
+<td><a href="#net-send-to">net-send-to</a></td>
+<td>sends a UDP on an open connection</td>
+</tr>
+
+<tr>
+<td><a href="#net-send-udp">net-send-udp</a></td>
+<td>sends a UDP and closes the connection</td>
+</tr>
+
+<tr>
+<td><a href="#net-service">net-service</a></td>
+<td>translates a service name into a port number</td>
+</tr>
+
+<tr>
+<td><a href="#net-sessions">net-sessions</a></td>
+
+<td>returns a list of currently open connections </td>
+</tr>
+</table>
+</blockquote>
+
+
+<a NAME="system_functions"></a>
+<h3>System functions</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="System functions">
+
+<tr>
+<td width="16%"><a href="#systemsymbol">$</a></td>
+<td width="84%">accesses system variables $0 -&gt; $15</td>
+</tr>
+
+<tr>
+<td><a href="#catch">catch</a></td>
+<td>evaluates an expression, catching errors and early returns</td>
+</tr>
+
+<tr>
+<td><a href="#context">context</a></td>
+<td>creates or switches to a different namespace</td>
+</tr>
+
+<tr>
+<td><a href="#debug">debug</a></td>
+<td>debugs a user-defined function</td>
+</tr>
+
+
+<tr>
+<td><a href="#default">default</a></td>
+<td>returns the default functor of a context</td>
+</tr>
+
+
+<tr>
+<td><a href="#delete">delete</a></td>
+<td>deletes symbols from the symbol table</td>
+</tr>
+
+<tr>
+<td><a href="#env">env</a></td>
+<td>gets or sets the operating system's environment</td>
+</tr>
+
+<tr>
+<td><a href="#error-event">error-event</a></td>
+<td>defines an error handler</td>
+</tr>
+
+<tr>
+<td><a href="#error-number">error-number</a></td>
+<td>gets the last error number</td>
+</tr>
+
+<tr>
+<td><a href="#error-text">error-text</a></td>
+<td>gets the error text for an error number</td>
+</tr>
+
+<tr>
+<td><a href="#exit">exit</a></td>
+<td>exits newLISP, setting the exit value</td>
+</tr>
+
+<tr>
+<td><a href="#global">global</a></td>
+<td>makes a symbol accessible outside MAIN</td>
+</tr>
+
+<tr>
+<td><a href="#import">import</a></td>
+<td>imports a function from a shared library</td>
+</tr>
+
+<tr>
+<td><a href="#main-args">main-args</a></td>
+<td>gets command-line arguments</td>
+</tr>
+
+<tr>
+<td><a href="#new">new</a></td>
+<td>creates a copy of a context</td>
+</tr>
+
+<tr>
+<td><a href="#ostype">ostype</a></td>
+<td>contains a string describing the OS platform</td>
+</tr>
+
+<tr>
+<td><a href="#pretty-print">pretty-print</a></td>
+<td>changes the pretty-printing characteristics</td>
+</tr>
+
+
+<tr>
+<td><a href="#reset">reset</a></td>
+<td>goes to the top level</td>
+</tr>
+
+<tr>
+<td><a href="#set-locale">set-locale</a></td>
+<td>switches to a different locale</td>
+</tr>
+
+<tr>
+<td><a href="#signal">signal</a></td>
+<td>sets a signal handler</td>
+</tr>
+
+<tr>
+<td><a href="#sleep">sleep</a></td>
+<td>suspends processing for specified milliseconds</td>
+</tr>
+
+<tr>
+<td><a href="#symbols">symbols</a></td>
+<td>returns a list of all symbols in the system</td>
+</tr>
+
+<tr>
+<td><a href="#sys-error">sys-error</a></td>
+<td>reports OS system error numbers</td>
+</tr>
+
+<tr>
+<td><a href="#sys-info">sys-info</a></td>
+<td>gives information about system resources</td>
+</tr>
+
+
+<tr>
+<td><a href="#throw">throw</a></td>
+<td>causes a previous <a href="#catch">catch</a> to return</td>
+</tr>
+
+<tr>
+<td><a href="#throw-error">throw-error</a></td>
+<td>throws a user-defined error</td>
+</tr>
+
+<tr>
+<td><a href="#timer">timer</a></td>
+<td>starts a one-shot timer, firing an event</td>
+</tr>
+
+<tr>
+<td><a href="#trace">trace</a></td>
+<td>sets or inquires about trace mode</td>
+</tr>
+
+<tr>
+<td><a href="#trace-highlight">trace-highlight</a></td>
+<td>sets highlighting strings in trace mode</td>
+</tr>
+
+</table>
+</blockquote>
+
+<a NAME="importing_libraries"></a>
+<h3>Importing libraries</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="Importing libraries<">
+
+
+<tr>
+<td WIDTH="16%"><a href="#address">address</a></td>
+<td WIDTH="84%">gets the memory address of a number or string</td>
+
+</tr>
+
+<tr>
+<td><a href="#flt">flt</a></td>
+<td>converts a number to a 32-bit integer representing a float</td>
+</tr>
+
+<tr>
+<td><a href="#float">float</a></td>
+<td>translates a string or integer into a floating point number</td>
+</tr>
+
+<tr>
+
+<td><a href="#get-char">get-char</a></td>
+<td>gets a character from a memory address</td>
+</tr>
+
+<tr>
+<td><a href="#get-float">get-float</a></td>
+<td>gets a double float from a memory address</td>
+</tr>
+
+<tr>
+<td><a href="#get-int">get-int</a>&nbsp;&nbsp;</td>
+<td>gets an integer from a memory address</td>
+</tr>
+
+<tr>
+<td><a href="#get-long">get-int</a>&nbsp;&nbsp;</td>
+<td>gets an integer from a memory address</td>
+</tr>
+
+<tr>
+<td><a href="#get-string">get-string</a></td>
+<td>gets a string from a memory address</td>
+</tr>
+
+<tr>
+<td><a href="#import">import</a></td>
+<td>imports a function from a shared library</td>
+</tr>
+
+<tr>
+
+<td><a href="#int">int</a></td>
+<td>translates a string or float into an integer</td>
+</tr>
+
+<tr>
+<td><a href="#pack">pack</a></td>
+<td>packs LISP expressions into a binary structure</td>
+</tr>
+
+<tr>
+<td><a href="#unpack">unpack</a></td>
+<td>unpacks a binary structure into LISP expressions</td>
+
+</tr>
+</table>
+</blockquote>
+
+
+<a NAME="internals"></a>
+<h3>newLISP internals API</h3>
+
+<blockquote>
+<table border="0" cellpadding="1" width="95%" align="center" summary="newLISP internals API">
+
+
+<tr>
+<td WIDTH="16%"><a href="#cpymem">cpymem</a></td>
+<td WIDTH="84%">copies memory between addresses</td>
+
+</tr>
+
+<tr>
+<td><a href="#dump">dump</a></td>
+<td>shows memory address and contents of newLISP cells</td>
+</tr>
+</table>
+</blockquote>
+
+<br /><br /><br />
+
+<a NAME="functions_alphabetical"></a>
+
+<center style="font-size: 150%">
+<span class="divider">(&nbsp;<font color="#7ba9d4">&part;</font>&nbsp;)</span>
+</center>
+
+
+<center><h1>Functions in alphabetical order</h1></center>
+
+<a NAME="shell"></a>
+<h2><span class="function">!</span></h2>
+<b>syntax: (! <em>str-command</em>)</b>
+
+<p>
+	Executes the command in <em>str-command</em>
+	by shelling out to the operating system 
+	and executing.
+	This function returns a different value
+	depending on the host operating system.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(! "vi")  
+(! "ls -ltr")
+</pre>
+</blockquote>
+
+<p>
+	Use the <a href="#exec">exec</a> function 
+	to execute a shell command 
+	and capture the standard output 
+	or to feed standard input. 
+	The <a href="#process">process</a> function
+	may be used to launch a non-blocking child process 
+	and redirect std I/O and std error to pipes.
+</p>
+
+<p>
+	Note that <tt>!</tt> (exclamation mark) can be also be used as 
+	a command-line shell operator 
+	by omitting the parenthesis and space after the <tt>!</tt>:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+<b>&gt;</b> !ls -ltr    ; executed in the newLISP shell window
+</pre>
+</blockquote>
+
+<p>
+	Used in this way, 
+	the <tt>!</tt> operator 
+	is not a newLISP function at all, 
+	but rather a special feature of 
+	the newLISP command shell. 
+	The <tt>!</tt> must be entered 
+	as the first character
+	on the command line.
+</p>
+
+<br /><br />
+
+<a NAME="systemsymbol"></a>
+<h2><span class="function">$</span></h2>
+<b>syntax: ($ <em>int-idx</em>)</b>
+
+<p>
+	The functions that use regular expressions 
+	(<a href="#directory">directory</a>,
+<a href="#find">find</a>, <a href="#parse">parse</a>, <a href="#regex">regex</a>, <a href="#search">search</a>, and <a href="#replace">replace</a>)
+	all bind their results to
+	the predefined system variables 
+	<tt>$0</tt>, <tt>$1</tt>, <tt>$2</tt>&ndash;<tt>$15</tt> 
+	after or during the function's execution.
+	Both <a href="#nth-set">nth-set</a> and <a href="#set-nth">set-nth</a>
+	store the replaced expression in <tt>$0</tt>. 
+	System variables can be treated 
+	the same as any other symbol.
+	As an alternative, 
+	the contents of these variables may also be accessed 
+	by using <tt>($ 0)</tt>, <tt>($ 1)</tt>, <tt>($ 2)</tt>, etc. 
+	This method allows indexed access 
+	(i.e., <tt>($ i)</tt>, where <tt>i</tt> is an integer).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'str  "http://newlisp.org:80")
+(find "http://(.*):(.*)" str 0)  <span class=arw>&rarr;</span> 0
+                                 
+$0  <span class=arw>&rarr;</span> "http://newlisp.org:80"
+$1  <span class=arw>&rarr;</span> "newlisp.org"
+$2  <span class=arw>&rarr;</span> "80"
+                                 
+($ 0)  <span class=arw>&rarr;</span> "http://newlisp.org:80"
+($ 1)  <span class=arw>&rarr;</span> "newlisp.org"
+($ 2)  <span class=arw>&rarr;</span> "80"
+                             
+(set 'L '(a b c d e f g))    
+(set-nth (L 2) 'x)  <span class=arw>&rarr;</span> (a b x d e f g)
+                                 
+$0     <span class=arw>&rarr;</span> c
+($ 0)  <span class=arw>&rarr;</span> c
+</pre>
+</blockquote>
+
+<p>
+	For using captures within substitutions,
+	the <tt>$</tt> system variables 
+	can be accessed from within the functions
+	<a href="#nth-set">nth-set</a>, <a href="#set-nth">set-nth</a>, and <a href="#replace">replace</a>:
+</p>
+
+<blockquote>
+<pre>
+(set 'lst '(1 2 3 4))
+(nth-set (lst 3) (* $0 3))  <span class=arw>&rarr;</span> 4
+lst                         <span class=arw>&rarr;</span> (1 2 3 12)
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="arithmetic"></a>
+<h2><span class="function">+, -, *, / ,%</span></h2>
+<b>syntax: (+ <em>int-1</em> [<em>int-2</em> ... ])</b>
+
+<p>
+	Returns the sum of all numbers 
+	in <em>int-1</em> &mdash;.
+</p>
+
+<b>syntax: (- <em>int-1</em> [<em>int-2</em> ... ])</b>
+
+<p>
+	Subtracts <em>int-2</em> from <em>int-1</em>, 
+	then the next <em>int-i</em> 
+	from the previous result. 
+	If only one argument is given, 
+	its sign is reversed.
+</p>
+
+<b>syntax: (* <em>int-1</em> [<em>int-2</em> ... ])</b>
+
+<p>
+	The product is calculated for 
+	<em>int-1</em> to <em>int-i</em>.
+</p>
+
+<b>syntax: (/ <em>int-1</em> [<em>int-2</em> ... ])</b>
+
+<p>
+	Each result is divided successively 
+	until the end of the list is reached. 
+	Division by zero causes an error.
+</p>
+
+<b>syntax: (% <em>int-1</em> [<em>int-2</em> ... ])</b>
+
+<p>
+	Each result is divided successively 
+	by the next <em>int</em>, 
+	then the rest (modulo operation) is returned. 
+	Division by zero causes an error. 
+	For floating point numbers, 
+	use the <a href="#mod">mod</a> function.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(+ 1 2 3 4 5)        <span class=arw>&rarr;</span> 15
+(+ 1 2 (- 5 2) 8)    <span class=arw>&rarr;</span> 14
+(- 10 3 2 1)         <span class=arw>&rarr;</span> 4
+(- (* 3 4) 6 1 2)    <span class=arw>&rarr;</span> 3
+(- 123)              <span class=arw>&rarr;</span> -123
+(map - '(10 20 30))  <span class=arw>&rarr;</span> (-10 -20 -30)
+(* 1 2 3)            <span class=arw>&rarr;</span> 6
+(* 10 (- 8 2))       <span class=arw>&rarr;</span> 60
+(/ 12 3)             <span class=arw>&rarr;</span> 4
+(/ 120 3 20 2)       <span class=arw>&rarr;</span> 1
+(% 10 3)             <span class=arw>&rarr;</span> 1
+(% -10 3)            <span class=arw>&rarr;</span> -1
+(+ 1.2 3.9)          <span class=arw>&rarr;</span> 4
+</pre>
+</blockquote>
+
+<p>
+	Floating point values in arguments to 
+	<tt>+</tt>, <tt>-</tt>, <tt>*</tt>, <tt>/</tt>, and <tt>%</tt> 
+	are truncated to their floor value.
+</p>
+
+<p>
+	Floating point values larger or smaller than
+	the maximum (<tt>9,223,372,036,854,775,807</tt>)
+	or minimum (<tt>-9,223,372,036,854,775,808</tt>) integer values 
+	are truncated to those values.
+</p>
+
+<p>
+	Calculations resulting in values 
+	larger than <tt>9,223,372,036,854,775,807</tt> 
+	or smaller than <tt>-9,223,372,036,854,775,808</tt> 
+	wrap around from positive to negative 
+	or negative to positive.
+</p>
+
+<p>
+	For floating point values that evaluate to <tt>NaN</tt> (Not a Number), 
+	both <tt>+INF</tt> and <tt>-INF</tt> are treated as <tt>0</tt> (zero).
+</p>
+
+<br /><br />
+
+<a NAME="logical"></a>
+<h2><span class="function">&lt;, &gt;, =, &lt;=, &gt;=, !=</span></h2>
+
+<b>syntax: (&lt; <em>exp-1</em> [<em>exp-2 exp-3</em> ... ])</b><br />
+
+<b>syntax: (&gt; <em>exp-1</em> [<em>exp-2 exp-3</em> ... ])</b><br />
+<b>syntax: (= <em>exp-1</em> [<em>exp-2 exp-3</em> ... ])</b><br />
+<b>syntax: (&lt;= <em>exp-1</em> [<em>exp-2 exp-3</em> ... ])</b><br />
+
+<b>syntax: (&gt;= <em>exp-1</em> [<em>exp-2 exp-3</em> ... ])</b><br />
+<b>syntax: (!= <em>exp-1</em> [<em>exp-2 exp-3</em> ... ])</b>
+
+<p>
+	Expressions are evaluated and the results are compared successively. 
+	As long as the comparisons conform to the comparison operators, 
+	evaluation and comparison will continue 
+	until all arguments are tested 
+	and the result is <tt>true</tt>.
+	As soon as one comparison fails, 
+	<tt>nil</tt> is returned.
+</p>
+
+<p>If only one argument is supplied, 
+all comparison operators assume <tt>0</tt> (zero)
+as a second argument.</p>
+
+
+<p>
+	All types of expressions can be compared: 
+	atoms, numbers, symbols, and strings. 
+	List expressions can also be compared 
+	(list elements are compared recursively).
+</p>
+
+<p>
+	When comparing lists, 
+	elements at the beginning of the list 
+	are considered more significant than the elements following 
+	(similar to characters in a string). 
+	When comparing lists of different lengths but equal elements, 
+	the longer list is considered greater (see examples).
+</p>
+
+<p>
+	In mixed-type expressions, 
+	the types are compared from lowest to highest. 
+	Floats and integers are compared by first
+	converting them to the needed type, 
+	then comparing them as numbers.
+</p>
+
+<pre>
+  Atoms: nil, true, integer or float, string, symbol, primitive
+  Lists: quoted list/expression, list/expression, lambda, lambda-macro
+</pre>
+<br />
+<b>example:</b>
+<blockquote>
+<pre>
+(&lt; 3 5 8 9)                     <span class=arw>&rarr;</span> true
+(&gt; 4 2 3 6)                     <span class=arw>&rarr;</span> nil
+(&lt; "a" "c" "d")                 <span class=arw>&rarr;</span> true
+(&gt;= duba aba)                   <span class=arw>&rarr;</span> true
+(&lt; '(3 4) '(1 5))               <span class=arw>&rarr;</span> nil
+(&gt; '(1 2 3) '(1 2))             <span class=arw>&rarr;</span> true
+(= '(5 7 8) '(5 7 8))           <span class=arw>&rarr;</span> true
+(!= 1 4 3 7 3)                  <span class=arw>&rarr;</span> true
+(&lt; 1.2 6 "Hello" 'any '(1 2 3))           <span class=arw>&rarr;</span> true
+(&lt; nil true)                              <span class=arw>&rarr;</span> true
+(&lt; '(((a b))) '(((b c))))                 <span class=arw>&rarr;</span> true
+(&lt; '((a (b c)) '(a (b d)) '(a (b (d)))))  <span class=arw>&rarr;</span> true
+
+; with single argument copares against 0
+
+(&gt; 1)    <span class=arw>&rarr;</span> true ; checks for positive
+(&gt; -1)   <span class=arw>&rarr;</span> nil ; checks for negative
+(= 123)  <span class=arw>&rarr;</span> nil ; checks for zero
+
+(map &gt; '(1 3 -4 -3 1 2))   <span class=arw>&rarr;</span> (true true nil nil true true)
+</pre>
+</blockquote>
+
+
+<br /><br />
+
+<a NAME="bit_shift"></a>
+<h2><span class="function">&lt;&lt;, &gt;&gt;</span></h2>
+
+<b>syntax: (&lt;&lt; <em>int-1 int-2</em> [<em>int-3</em> ... ])</b><br />
+
+<b>syntax: (&gt;&gt; <em>int-1 int-2</em> [<em>int-3</em> ... ])</b><br />
+
+<b>syntax: (&lt;&lt; <em>int-1</em>)</b><br />
+<b>syntax: (&gt;&gt; <em>int-1</em>)</b>
+
+<p>
+	The number <em>int-1</em> is arithmetically shifted 
+	to the left or right by the number of bits given as <em>int-2</em>, 
+	then shifted by <em>int-3</em> and so on. 
+	For example, 64-bit integers may be shifted up to 63 positions. 
+	When shifting right, 
+	the most significant bit is duplicated 
+	(<em>arithmetic shift</em>):
+</p>
+
+<blockquote>
+<pre>
+(&gt;&gt; 0x800000000000000 1)  <span class=arw>&rarr;</span> 0xC00000000000000   ; not 0x040000000000000!
+</pre>
+</blockquote>
+<br />
+<b>example:</b>
+<blockquote>
+<pre>
+(&lt;&lt; 1 3)      <span class=arw>&rarr;</span>  8
+(&lt;&lt; 1 2 1)    <span class=arw>&rarr;</span>  8
+(&gt;&gt; 1024 10)  <span class=arw>&rarr;</span>  1
+(&gt;&gt; 160 2 2)  <span class=arw>&rarr;</span> 10
+
+(&lt;&lt; 3)        <span class=arw>&rarr;</span>  6
+(&gt;&gt; 8)        <span class=arw>&rarr;</span>  4
+</pre>
+</blockquote>
+
+<p>When <em>int-1</em> is the only argument <tt>&lt;&lt;</tt>
+and <tt>&gt;&gt;</tt> shift by one bit.
+</p>
+
+<br /><br />
+
+<a NAME="bit_and"></a>
+<h2><span class="function">&amp;</span></h2>
+<b>syntax: (&amp; <em>int-1</em> <em>int-2</em> [<em>int-3</em> ... ])</b>
+
+<p>
+	A bitwise <tt>and</tt> operation is performed 
+	on the number in <em>int-1</em> with the number in <em>int-2</em>, 
+	then successively with <em>int-3</em>, etc.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(&amp; 0xAABB 0x000F)  <span class=arw>&rarr;</span> 11  ; which is 0xB
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="bit_inclusive"></a>
+<h2><span class="function">|</span></h2>
+<b>syntax: (| <em>int-1</em> <em>int-2</em> [<em>int-3</em> ... ])</b>
+
+<p>
+	A bitwise <tt>or</tt> operation is performed 
+	on the number in <em>int-1</em> with the number in <em>int-2</em>, 
+	then successively with <em>int-3</em>, etc.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(| 0x10 0x80 2 1)  <span class=arw>&rarr;</span> 147
+</pre>
+
+</blockquote>
+<br /><br />
+
+<a NAME="bit_exclusive"></a>
+<h2><span class="function">^</span></h2>
+
+<b>syntax: (^ <em>int-1</em> <em> int-2</em> [<em>int-3</em> ... ])</b>
+
+<p>
+	A bitwise <tt>xor</tt> operation is performed 
+	on the number in <em>int-1</em> with the number in <em>int-2</em>, 
+	then successively with <em>int-3</em>, etc.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(^ 0xAA 0x55)  <span class=arw>&rarr;</span> 255
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="bit_not"></a>
+<h2><span class="function">~</span></h2>
+<b>syntax: (~ <em>int</em>)</b>
+
+<p>
+	A bitwise <tt>not</tt> operation is performed 
+	on the number in <em>int</em>,
+	reversing all of the bits.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(format "%X" (~ 0xFFFFFFAA))  <span class=arw>&rarr;</span> "55"
+(~ 0xFFFFFFFF)                <span class=arw>&rarr;</span> 0
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="colon"></a>
+<h2><span class="function">:</span></h2>
+<b>syntax: (: <em>sym-function</em> <em>list-object</em> [...])</b>
+
+<p>When used as an operator, the colon <tt>:</tt> constructs a context symbol from the context name in the object list and the symbol following the colon. The object list in <em>list-object</em> can be followed by other parameters.</p>
+
+<p>The <tt>:</tt> operator implements <em>polymorphism</em> of object methods, which are part of different object classes represented by contexts (namespaces). In newLISP, an object is represented by a list, the first element of which is the symbol (name) of its class context.
+The class context implements the functions applicable to the object. No space is required between the colon and the symbol following it.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (Rectangle:area p)
+	(mul (p 3) (p 4)))
+
+(define (Circle:area c)
+	(mul (pow (c 3) 2) (acos 0) 2))
+
+(define (Rectangle:move p dx dy)
+	(list rectangle (add (p 1) dx) (add (p 2) dy) (p 3) (p 4))) 
+
+(define (Circle:move p dx dy)
+	(list circle (add (p 1) dx) (add (p 2) dy) (p 3))) 
+
+(set 'myrect '(Rectangle 5 5 10 20)) ; x y width height
+(set 'mycircle '(Circle 1 2 10)) ; x y radius
+
+;; explicit naming of the context methods
+
+(Rectangle:area myrect) 
+(Circle:area mycircle)
+
+(set 'myrect (Rectangle:move myrect 2 3)) 
+(set 'mycircle ((Circle:move mycircle 4 5))
+
+;; using the : (colon) operator to polymorphically 
+;; resolve to a specific context
+
+(:area myrect)     <span class=arw>&rarr;</span> 200
+(:area mycircle)   <span class=arw>&rarr;</span> 314.1592654
+
+;; change object attributes using a function and re-assigning
+;; to the objects name
+
+(set 'myrect (:move myrect 2 3))       <span class=arw>&rarr;</span> (Rectangle 7 8 10 20)
+(set 'mycircle (:move mycircle 4 5))   <span class=arw>&rarr;</span> (Circle 5 7 10)
+</pre>
+</blockquote>
+
+<p>Using the colon <tt>:</tt> operator does not prohibit naming the method context explicitly when it is known.</p>
+
+<p>In the first usage, the <tt>:</tt> is part of the syntax for qualifying a symbol with its context. The second usage of the <tt>:</tt> as an operator implements polymorphism by resolving the context at runtime.</p>
+
+<p>Note that in the above example, the <tt>:move</tt> methods are implemented in a <em>functional</em> way, reassigning shapes with changed <tt>x</tt> and <tt>y</tt> coordinates to <tt>myrect</tt> and <tt>mycircle</tt>.
+</p> 
+
+<br /><br />
+
+<a NAME="abs"></a>
+<h2><span class="function">abs</span></h2>
+
+<b>syntax: (abs <em>num</em>)</b>
+
+<p>
+	Returns the absolute value of the number in <em>num</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(abs -3.5)  <span class=arw>&rarr;</span> 3.5
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="acos"></a>
+<h2><span class="function">acos</span></h2>
+<b>syntax: (acos <em>num</em>)</b>
+
+<p>
+	The arccosine function is calculated 
+	from the number in <em>num-radians</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(acos 1)  <span class=arw>&rarr;</span> 0
+(cos (acos 1)) <span class=arw>&rarr;</span> 1
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="acosh"></a>
+<h2><span class="function">acosh</span></h2>
+<b>syntax: (acosh <em>num-radians</em>)</b>
+
+<p>Calculates the inverse hyperbolic cosine of <em>num-radians</em>, 
+the value whose hyperbolic cosine is <em>num-radians</em>. 
+If <em>num-radians</em> is less than 1, 
+<tt>acosh</tt> returns <tt>NaN</tt>.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(acosh 2)  <span class=arw>&rarr;</span> 1.316957897
+(cosh (acosh 2)) <span class=arw>&rarr;</span> 2
+(acosh 0.5) <span class=arw>&rarr;</span> NaN
+</pre>
+</blockquote>
+
+<br /><br />
+
+
+<a NAME="add"></a>
+<h2><span class="function">add</span></h2>
+<b>syntax: (add <em>num-1</em> [<em>num-2</em> ... ])</b>
+
+<p>
+	All of the numbers in <em>num-1</em>, <em>num-2</em>, and on 
+	are summed.
+	<tt>add</tt> accepts float or integer operands, 
+	but it always returns a floating point number. 
+	Any floating point calculation with <tt>NaN</tt> 
+	also returns <tt>NaN</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(add 2 3.25 9)   <span class=arw>&rarr;</span> 14.25
+(add 1 2 3 4 5)  <span class=arw>&rarr;</span> 15
+</pre>
+</blockquote>
+
+<br /><br />
+
+
+<a name="address"></a>
+<h2><span class="function">address</span></h2>
+<b>syntax: (address <em>int</em>)</b> <br />
+
+<b>syntax: (address <em>float</em>)</b> <br />
+<b>syntax: (address <em>str</em>)</b>
+
+<p>
+	Returns the memory address of the integer in <em>int</em>, 
+	the double floating point number in <em>float</em>, 
+	or the string in <em>str</em>. 
+	This function is used for passing parameters to library functions 
+	that have been imported using the <a href="#import">import</a> function.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 's "\001\002\003\004")
+
+(get-char (+ (address s) 3))   <span class=arw>&rarr;</span> 4
+
+(set 'x 12345)
+
+; on a big-endian CPU, i.e. PPC or SPARC
+(get-int (+ (address x) 4))    <span class=arw>&rarr;</span> 12345
+
+; on a little-endian CPU, i.e. Intel i386
+(get-int (address x))          <span class=arw>&rarr;</span> 12345
+
+; on both architectures (integers are 64 bit in newLISP)
+(set 'x 1234567890)
+(get-long (address x))         <span class=arw>&rarr;</span>  1234567890
+
+</pre>
+</blockquote>
+
+<p>
+	When a string is passed,
+	the address of the string is automatically used. 
+	As the example shows, 
+	<tt>address</tt> can be used to do pointer arithmetic 
+	on the string's address.
+</p>
+
+<p><tt>address</tt> should only be used on persistent addresses from
+data objects referred to by a variable symbol, not from volatile intermediate
+expression objects.</p>
+
+<p>
+	See also the <a href="#get-char">get-char</a>, <a href="#get-int">get-int</a>, 
+	<a href="#get-long">get-long</a> and <a href="#get-float">get-float</a> functions.
+</p>
+
+<br /> <br />
+
+<a NAME="amb"></a>
+<h2><span class="function">amb</span></h2>
+
+<b>syntax: (amb <em>exp-1 exp-2</em> [<em>exp-3</em>... ])</b>
+
+<p>
+	One of the expressions <em>exp-1 ... n</em> is selected at random, 
+	and the evaluation result is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(amb 'a 'b 'c 'd 'e)  <span class=arw>&rarr;</span> one of: a, b, c, d, or e at random
+
+(dotimes (x 10) (print (amb 3 5 7)))  <span class=arw>&rarr;</span> 35777535755
+</pre>
+</blockquote>
+
+<p>
+	Internally, newLISP uses the same function as <a href="#rand">rand</a> to pick a random number. 
+	To generate random floating point numbers, 
+	use <a href="#random">random</a>, 
+	<a href="#randomize">randomize</a>, or <a href="#normal">normal</a>. 
+	To initialize the pseudo random number generating process 
+	at a specific starting point,
+	use the <a href="#seed">seed</a> function.
+</p>
+
+<br /> <br />
+
+<a NAME="and"></a>
+<h2><span class="function">and</span></h2>
+<b>syntax: (and <em>exp-1 exp-2</em> [<em>exp-3</em>... ])</b>
+
+<p>
+	The expressions <em>exp-1</em>, <em>exp-2</em>, <em>etc.</em> are evaluated in order,
+	returning the result of the last expression.
+	If any of the expressions yield <tt>nil</tt> or the empty list <tt>()</tt>, 
+	evaluation is terminated and <tt>nil</tt> or the empty list <tt>()</tt> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 10)                       <span class=arw>&rarr;</span> 10
+(and (&lt; x 100) (&gt; x 2))           <span class=arw>&rarr;</span> true
+(and (&lt; x 100) (&gt; x 2) "passed")  <span class=arw>&rarr;</span> "passed"
+(and '())                         <span class=arw>&rarr;</span> ()
+(and true)                        <span class=arw>&rarr;</span> true
+(and)                             <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="append"></a>
+<h2><span class="function">append</span></h2>
+<b>syntax: (append <em>list-1</em> [<em>list-2</em> ... ])</b><br />
+<b>syntax: (append <em>array-1</em> [<em>array-2</em> ... ])</b> <br />
+<b>syntax: (append <em>str-1</em> [<em>str-2</em> ... ])</b>
+
+<p>
+	In the first form, 
+	<tt>append</tt> works with lists, 
+	appending <em>list-1</em> through <em>list-n</em> to form a new list. 
+	The original lists are left unchanged.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(append '(1 2 3) '(4 5 6) '(a b))  <span class=arw>&rarr;</span> (1 2 3 4 5 6 a b)
+
+(set 'aList '("hello" "world"))    <span class=arw>&rarr;</span> ("hello" "world")
+
+(append aList '("here" "I am"))    <span class=arw>&rarr;</span> ("hello" "world" "here" "I am")
+</pre>
+</blockquote>
+
+<p>In the second form <tt>append</tt> works on arrays:</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'A (array 3 2 (sequence 1 6)))
+<span class=arw>&rarr;</span> ((1 2) (3 4) (5 6))
+(set 'B (array 2 2 (sequence 7 10)))
+<span class=arw>&rarr;</span> ((7 8) (9 10))
+
+(append A B)
+<span class=arw>&rarr;</span> ((1 2) (3 4) (5 6) (7 8) (9 10))
+
+(append B B B)
+<span class=arw>&rarr;</span> ((7 8) (9 10) (7 8) (9 10) (7 8) (9 10))
+
+</pre>
+</blockquote>
+
+<p>
+	In the third form, 
+	<tt>append</tt> works on strings. 
+	The strings in <em>str-n</em> are concatenated into 
+	a new string and returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'more " how are you")       <span class=arw>&rarr;</span> " how are you"
+
+(append "Hello " "world," more)  <span class=arw>&rarr;</span> "Hello world, how are you"
+</pre>
+</blockquote>
+
+<p>
+	<tt>append</tt> is also suitable 
+	for processing binary strings 
+	containing zeroes.
+</p>
+
+<p>
+	Linkage characters or strings can be specified
+	using the <a HREF="#join">join</a> function. 
+	Use the <a HREF="#string">string</a> function
+	to convert arguments to strings and append in one step.
+</p>
+
+<p>
+	Use the functions <a href="#push">push</a> or 
+	<a href="#write-buffer">write-buffer</a>
+	(with its special syntax) 
+	to append to an existing string <em>in place</em>.
+</p>
+<br /><br />
+
+<a NAME="append-file"></a>
+<h2><span class="function">append-file</span></h2>
+<b>syntax: (append-file <em>str-filename</em> <em>str-buffer</em>)</b>
+
+<p>
+	Works similarly to <a href="#write-file">write-file</a>, 
+	but the content in <em>str-buffer</em> is appended
+	if the file in <em>str-filename</em> exists. 
+	If the file does not exist, it is created 
+	(in this case, <tt>append-file</tt> works identically to <a href="#write-file">write-file</a>). 
+	This function returns the number of bytes written.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(write-file "myfile.txt" "ABC") 
+(append-file "myfile.txt" "DEF")
+
+(read-file "myfile.txt")  <span class=arw>&rarr;</span> "ABCDEF"
+</pre>
+</blockquote>
+
+<p><tt>append-file</tt> can take a <tt>http://</tt> or <tt>file://</tt> URL
+in <em>str-file-name</em>. In this case <tt>append-file</tt> works exactly like
+<a href="#put-url">put-url</a> with <tt>"Pragma: append\r\n"</tt>
+in the header option and can take the same additional parameters. The 
+<tt>"Pragma: append\r\n"</tt> option is supplied automatically.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(append-file "http://asite.com/message.txt" "More message text.")
+</pre>
+</blockquote>
+
+<p>The file <tt>message.txt</tt> is appended at a remote
+location <tt>http://asite.com</tt> with the contents of 
+<em>str-buffer</em>. If the file does not yet exist, it
+will be created. In this mode, <tt>append-file</tt> can also be used
+to transfer files to remote newLISP server nodes.
+</p>
+
+
+
+<p>See also <a href="#read-file">read-file</a> and
+<a href="#write-file">write-file</a>.
+</p>
+
+
+
+<br /><br />
+
+<a NAME="apply"></a>
+<h2><span class="function">apply</span></h2>
+<b>syntax: (apply <em>func list</em> [<em>int-reduce</em>])</b>
+
+<p>
+	Applies the contents of <em>func</em> 
+	(primitive, user-defined function, or lambda expression)  
+	to the arguments in <em>list</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(apply + '(1 2 3 4))                   <span class=arw>&rarr;</span> 10
+(set 'aList '(3 4 5))                  <span class=arw>&rarr;</span> (3 4 5)
+(apply * aList)                        <span class=arw>&rarr;</span> 60
+(apply sqrt '(25))                     <span class=arw>&rarr;</span> 5
+(apply (lambda (x y) (* x y)) '(3 4))  <span class=arw>&rarr;</span> 12
+</pre>
+</blockquote>
+
+
+<p>
+	The <em>int-reduce</em> parameter can optionally contain 
+	the number of arguments taken by the function in <em>func</em>. 
+	In this case, 
+	<em>func</em> will be repeatedly applied using the previous result 
+	as the first argument and taking the other arguments required 
+	successively from <em>list</em> 
+	(in left-associative order). 
+	For example, if <tt>op</tt> takes two arguments, then:
+</p>
+
+<blockquote>
+<pre>
+(apply op '(1 2 3 4 5) 2)
+
+;; is equivalent to
+
+(op (op (op (op 1 2) 3) 4) 5)
+
+;; find the greatest common divisor 
+;; of two or more integers 
+;; note that newLISP already has a gcd function
+
+(define (gcd_ a b)
+(let (r (% b a))
+    (if (= r 0) a (gcd_ r a))))
+
+(define-macro (my-gcd)
+    (apply gcd_ (args) 2))
+
+(my-gcd 12 18 6)    <span class=arw>&rarr;</span> 6
+(my-gcd 12 18 6 4)  <span class=arw>&rarr;</span> 2
+</pre>
+</blockquote>
+
+<p>
+	The last example shows how <tt>apply</tt>'s <em>reduce</em> functionality 
+	can be used to convert a two-argument function 
+	into one that takes multiple arguments.
+</p>
+
+<p>
+	<tt>apply</tt> should only be used on functions and operators 
+	that evaluate all of their arguments,  
+	not on <em>special forms</em> 
+	like <a href="#setq">setq</a> or <a href="#case">case</a>, 
+	which evaluate only some of their arguments. 
+	Doing so will cause the function to fail.
+</p>
+
+<br /><br />
+
+<a NAME="args"></a>
+<h2><span class="function">args</span></h2>
+<b>syntax: (args)</b><br />
+<b>syntax: (args <em>int-idx-1</em> [<em>int-idx-2 ...</em>])</b>
+
+<p>
+	Accesses a list of all unbound arguments 
+	passed to the currently evaluating 
+	<a href="#define">define</a>, <a HREF="#define-macro">define-macro</a> 
+	lambda, or lambda-macro expression. 
+	Only the arguments of the current function or macro 
+	that remain after local variable binding has occurred
+	are available. 
+	The <tt>args</tt> function is useful for defining functions or macros 
+	with a variable number of parameters.
+</p>
+
+<p>
+	<tt>args</tt> can be used to define hygienic macros 
+	that avoid the danger of variable capture. 
+	See <a href="#define-macro">define-macro</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define-macro (print-line)
+    (dolist (x (args))
+        (print x "\n")))
+                        
+(print-line "hello" "World")
+</pre>
+</blockquote>
+<p>
+	This example prints a line feed after each argument. 
+	The macro mimics the effect of the built-in function 
+	<a HREF="#println">println</a>.
+</p>
+
+<p>
+	In the second syntax, 
+	<tt>args</tt> can take one or more indices (<em>int-idx-n</em>).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define-macro (foo)
+  (print (args 2) (args 1) (args 0)))
+
+(foo x y z) 
+<b>zyx</b> 
+
+(define (bar)
+	(args 0 2 -1))
+
+(bar '(1 2 (3 4)))  <span class=arw>&rarr;</span> 4
+</pre>
+</blockquote>
+
+<p>
+	The function <tt>foo</tt> 
+	prints out the arguments in reverse order. 
+	The <tt>bar</tt> function 
+	shows <tt>args</tt> being used 
+	with multiple indices
+	to access nested lists.
+</p>
+
+<p>
+	Remember that <tt>(args)</tt> only contains the arguments 
+	not already bound to local variables 
+	of the current function or macro:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (foo a b) (args))
+  
+(foo 1 2)        <span class=arw>&rarr;</span> ()
+                 
+(foo 1 2 3 4 5)  <span class=arw>&rarr;</span> (3 4 5)
+</pre>
+</blockquote>
+
+<p>
+	In the first example, 
+	an empty list is returned because 
+	the arguments are bound to the 
+	two local symbols, <tt>a</tt> and <tt>b</tt>.
+	The second example demonstrates that, 
+	after the first two arguments are bound 
+	(as in the first example), three arguments remain 
+	and are then returned by <tt>args</tt>.
+</p>
+
+<p>
+	<tt>(args)</tt> can be used as an argument 
+	to a built-in or user-defined function call, 
+	but it should not be used as an argument to another macro, 
+	in which case <tt>(args)</tt> would not be evaluated 
+	and would therefore have the wrong
+	contents in the new macro environment.
+</p>
+
+<br /><br />
+
+
+<a NAME="array"></a>
+<h2><span class="function">array</span></h2>
+
+<b>syntax: (array <em>int-n1</em> [<em>int-n2</em> ... ] [<em>list-init</em>])</b>
+
+<p>
+	Creates an array with <em>int-n1</em> elements, 
+	optionally initializing it with the contents of <em>list-init</em>. 
+	Up to sixteen dimensions may be specified for multidimensional arrays.
+</p>
+
+<p>
+	Internally, 
+	newLISP builds multidimensional arrays 
+	by using arrays as the elements of an array. 
+	newLISP arrays should be used 
+	whenever random indexing into a large list 
+	becomes too slow. 
+	Only a subset of the list functions 
+	may be used on arrays. 
+	For a more detailed discussion, 
+	see the chapter on <a href="#arrays">arrays</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(array 5)                  <span class=arw>&rarr;</span> (nil nil nil nil nil)
+
+(array 5 (sequence 1  5))  <span class=arw>&rarr;</span> (1 2 3 4 5)
+
+(array 10 '(1 2))          <span class=arw>&rarr;</span> (1 2 1 2 1 2 1 2 1 2)
+</pre>
+</blockquote>
+
+
+<P>
+	Arrays can be initialized with objects of any type. 
+	If fewer initializers than elements are provided, 
+	the list is repeated until all elements of the array are initialized.
+</p>
+
+<blockquote>
+<pre>
+
+(set 'myarray (array 3 4 (sequence 1 12)))
+<span class=arw>&rarr;</span> ((1 2 3 4) (5 6 7 8) (9 10 11 12))
+</pre>
+</blockquote>
+
+<P>
+	Arrays are modified and accessed 
+	using the same list functions:
+</p>
+
+<blockquote>
+<pre>
+(set-nth (myarray 2 3) 99) 
+<span class=arw>&rarr;</span> ((1 2 3 4) (5 6 7 8) (9 10 11 99))
+
+(nth-set (myarray 1 1) "hello")  <span class=arw>&rarr;</span> 6
+
+myarray
+<span class=arw>&rarr;</span> ((1 2 3 4) (5 "hello" 7 8) (9 10 11 99))
+
+(set-nth (myarray 1) (array 4 '(a b c d)))
+<span class=arw>&rarr;</span> ((1 2 3 4) (a b c d) (9 10 11 99))
+
+(nth 1 myarray)     <span class=arw>&rarr;</span> (a b c d)  ; access a whole row
+                    
+(nth (myarray 0 -1))  <span class=arw>&rarr;</span> 4
+                    
+;; use implicit indexing and slicing on arrays
+                    
+(myarray 1)     <span class=arw>&rarr;</span> (a b c d)
+                    
+(myarray 0 -1)  <span class=arw>&rarr;</span> 4
+
+(2 myarray)     <span class=arw>&rarr;</span> (c d)
+
+(-3 2 myarray)  <span class=arw>&rarr;</span> (b c)
+</pre>
+</blockquote>
+
+<P>
+	Care must be taken to use an array
+	when replacing a whole row.
+</p>
+
+<p>
+	<a href="#array-list">array-list</a> can be used 
+	to convert arrays back into lists:
+</p>
+
+<blockquote>
+<pre>
+(array-list myarray)  <span class=arw>&rarr;</span> ((1 2 3 4) (a b c d) (1 2 3 99))
+</pre>
+</blockquote>
+
+<p>
+	To convert a list back into an array, 
+	apply <a href="#flat">flat</a> to the list:
+</p>
+
+<blockquote>
+<pre>
+(set 'aList '((1 2) (3 4)))             <span class=arw>&rarr;</span> ((1 2) (3 4))
+
+(set 'aArray (array 2 2 (flat aList)))  <span class=arw>&rarr;</span> ((1 2) (3 4))
+</pre>
+</blockquote>
+
+<p>The <a href="#arrayp">array?</a> function 
+can be used to check if an expression is an array:
+</p>
+
+<blockquote>
+<pre>
+(array? myarray)               <span class=arw>&rarr;</span> true
+                               
+(array? (array-list myarray))  <span class=arw>&rarr;</span> nil
+</pre>
+
+</blockquote>
+
+<p>
+	When serializing arrays using the  function
+	<a href="#source">source</a> or <a href="#save">save</a>, 
+	the code includes the <tt>array</tt> statement 
+	necessary to create them. 
+	This way, 
+	variables containing arrays are correctly serialized 
+	when saving with <a href="#save">save</a> or creating source strings 
+	using <a href="#source">source</a>.
+
+
+<blockquote>
+<pre>
+(set 'myarray (array 3 4 (sequence 1 12)))
+
+(save "array.lsp" 'myarray)
+
+;; contents of file arraylsp ;;
+
+(set 'myarray (array 3 4 (flat '(
+  (1 2 3 4) 
+  (5 6 7 8) 
+  (9 10 11 12)))))
+</pre>
+</blockquote>
+
+
+<br /><br />
+
+
+<a NAME="array-list"></a>
+<h2><span class="function">array-list</span></h2>
+<b>syntax: (array-list <em>array</em>)</b>
+
+<P>
+	Returns a list conversion from <em>array</em>, 
+	leaving the original array unchanged:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'myarray (array 3 4 (sequence 1 12)))
+<span class=arw>&rarr;</span> ((1 2 3 4) (5 6 7 8) (9 10 11 12))
+
+(set 'mylist (array-list myarray))
+<span class=arw>&rarr;</span> ((1 2 3 4) (5 6 7 8) (9 10 11 12))
+
+(list (array? myarray) (list? mylist))
+<span class=arw>&rarr;</span> (true true)
+</pre>
+
+</blockquote>
+
+<br /><br />
+
+
+<a NAME="arrayp"></a>
+<h2><span class="function">array?</span></h2>
+<b>syntax: (array? <em>expr</em>)</b>
+
+<p>
+	Checks if <em>expr</em> is an array:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'M (array 3 4 (sequence 1 4)))   
+<span class=arw>&rarr;</span> ((1 2 3 4) (1 2 3 4) (1 2 3 4)))
+
+
+(array? M)               <span class=arw>&rarr;</span> true
+
+(array? (array-list M))  <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+
+<br /><br />
+
+<a NAME="asin"></a>
+<h2><span class="function">asin</span></h2>
+<b>syntax: (asin <em>num-radians</em>)</b>
+
+<p>
+	Calculates the arcsine function from the number in <em>num-radians</em> 
+	and returns the result.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(asin 1)  <span class=arw>&rarr;</span> 1.570796327
+(sin (asin 1)) <span class=arw>&rarr;</span> 1
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="asinh"></a>
+<h2><span class="function">asinh</span></h2>
+<b>syntax: (asinh <em>num-radians</em>)</b>
+
+<p>Calculates the inverse hyperbolic sine of <em>num-radians</em>, 
+the value whose hyperbolic sine is <em>num-radians</em>.</p
+
+<b>example:</b>
+<blockquote>
+<pre>
+(asinh 2)  <span class=arw>&rarr;</span> 1.443635475
+(sinh (asinh 2)) <span class=arw>&rarr;</span> 2
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="assoc"></a>
+<h2><span class="function">assoc</span></h2>
+<b>syntax: (assoc <em>exp-key</em> <em>list-alist</em>)</b><br/>
+<b>syntax: (assoc (<em>list-alist</em> <em>exp-key-1</em> [<em>exp-key-2</em> ...]))</b>
+
+
+<p>
+In the first syntax the value of <em>exp-key</em> is used 
+to search <em>list-alist</em> for a <em>member-list</em> 
+whose first element matches the key value. 
+If found, the <em>member-list</em> is returned;
+otherwise, the result will be <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(assoc 1 '((3 4) (1 2)))  <span class=arw>&rarr;</span> (1 2)
+
+(set 'data '((apples 123) (bananas 123 45) (pears 7)))
+
+(assoc 'bananas data)  <span class=arw>&rarr;</span> (bananas 123 45)
+(assoc 'oranges data)  <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<p>In the second syntax more then one key expressions can be specified
+to search in nested, multilevel association lists:</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'persons '(
+    (id001 (name "Anne") (address (country "USA") (city "New York")))
+    (id002 (name "Jean") (address (country "France") (city "Paris")))
+))
+
+(assoc (persons 'id001 'address)) <span class=arw>&rarr;</span> (address (country "USA") (city "New York"))
+(assoc (persons 'id001 'address 'city)) <span class=arw>&rarr;</span> (city "New York")
+</pre>
+</blockquote>
+
+<p>The list in <em>list-aList</em> can be a context which will be interpreted
+as its <em>default functor</em>. This way very big lists can be passed by reference
+for speedier access and less memory usage:</p>
+
+<blockquote>
+<pre>
+(set 'persons:persons '(
+    (id001 (name "Anne") (address (country "USA") (city "New York")))
+    (id002 (name "Jean") (address (country "France") (city "Paris")))
+))
+
+(define (get-city db id)
+	(last (assoc (db id 'address 'city)))
+)
+
+(get-city persons 'id001) <span class=arw>&rarr;</span> "New York"
+</pre>
+</blockquote>
+
+<p>
+For making replacements in association lists, use the 
+<a HREF="#set-assoc">set-assoc</a> function.
+The <a href="#lookup">lookup</a> function is used to perform association lookup 
+and element extraction in one step and on single level association lists.
+</p>
+
+<br /><br />
+
+<a NAME="assoc-set"></a>
+<h2><span class="function">assoc-set</span></h2>
+
+<b>syntax: (assoc-set <em>exp-key</em> <em>list-alist</em> <em>exp-replacement</em>)</b><br/>
+<b>syntax: (assoc-set (<em>list-alist</em> <em>exp-key-1</em> [<em>exp-key-2</em> ...]) <em>exp-replacement</em>)</b>
+
+<p>This function works like <a href="#set-assoc">set-assoc</a> but returns the replaced
+association instead of the entire changed association list.</p>
+
+
+<br /><br />
+
+<a NAME="atan"></a>
+<h2><span class="function">atan</span></h2>
+<b>5,900,000
+ (atan <em>num-radians</em>)</b>
+
+<p>
+	The arctangent of <em>num-radians</em> 
+	is calculated and returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(atan 1)  <span class=arw>&rarr;</span> 0.7853981634
+(tan (atan 1)) <span class=arw>&rarr;</span> 1
+</pre>
+</blockquote>
+<br /><br />
+
+
+<a NAME="atan2"></a>
+<h2><span class="function">atan2</span></h2>
+<b>syntax: (atan2 <em>num-Y-radians</em> <em>num-X-radians</em>)</b>
+
+<p>
+	The <tt>atan2</tt> function computes 
+	the principal value of 
+	the arctangent of Y / X in radians. 
+	It uses the signs of both arguments 
+	to determine the quadrant of
+	the return value. 
+	<tt>atan2</tt> is useful for converting 
+	Cartesian coordinates 
+	into polar coordinates.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(atan2 1 1)                       <span class=arw>&rarr;</span> 0.7853981634
+(div (acos 0) (atan2 1 1))        <span class=arw>&rarr;</span> 2
+(atan2 0 -1)                      <span class=arw>&rarr;</span> 3.141592654
+(= (atan2 1 2) (atan (div 1 2)))  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="atanh"></a>
+<h2><span class="function">atanh</span></h2>
+<b>syntax: (atanh <em>num-radians</em>)</b>
+
+<p>Calculates the inverse hyperbolic tangent of <em>num-radians</em>, the value whose hyperbolic tangent is <em>num-radians</em>. If the absolute value of <em>num-radians</em> is greater than 1, <tt>atanh</tt> returns <tt>NaN</tt>; if it is equal to 1, <tt>atanh</tt> returns infinity.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(atanh 0.5) <span class=arw>&rarr;</span> 0.5493061443
+(tanh (atanh 0.5)) <span class=arw>&rarr;</span> 0.5
+(atanh 1.1) <span class=arw>&rarr;</span> NaN
+(atanh 1) <span class=arw>&rarr;</span> inf
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="atomp"></a>
+<h2><span class="function">atom?</span></h2>
+<b>syntax: (atom? <em>exp</em>)</b>
+
+<p>
+	Returns <tt>true</tt> if the value of <em>exp</em> is an atom, 
+	otherwise <tt>nil</tt>.
+	An expression is an atom, if it evaluates to nil, 
+	true, an integer, a float, a string, a symbol or a primitive. 
+	Lists, lambda or lambda-macro expressions, 
+	and quoted expressions are not atoms.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(atom? '(1 2 3))      <span class=arw>&rarr;</span> nil
+(and (atom? 123)
+     (atom? "hello")
+     (atom? 'foo))    <span class=arw>&rarr;</span> true
+(atom? ''foo)         <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="base64-dec"></a>
+<h2><span class="function">base64-dec</span></h2>
+<b>syntax: (base64-dec <em>str</em>)</b>
+
+<p>
+	The BASE64 string in <em>str</em> is decoded. 
+	Note that <em>str</em> is not verified
+	to be a valid BASE64 string. 
+	The decoded string is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(base64-dec "SGVsbG8gV29ybGQ=")  <span class=arw>&rarr;</span> "Hello World"
+</pre>
+</blockquote>
+
+<p>
+	For encoding,
+	use the <a href="#base64-enc">base64-enc</a> function.
+</p>
+	
+<p> 
+	newLISP's BASE64 handling is derived from 
+	routines found in the UNIX <a href="http://curl.haxx.se/">curl</a> utility.
+</p>
+
+<br /><br />
+
+
+<a NAME="base64-enc"></a>
+<h2><span class="function">base64-enc</span></h2>
+<b>syntax: (base64-enc <em>str</em>)</b>
+
+<p>
+	The string in <em>str</em> is encoded into BASE64 format. 
+	This format encodes groups of 3 * 8 = 24 input bits 
+	into 4 * 8 = 32 output bits, 
+	where each 8-bit output group 
+	represents 6 bits from the input string. 
+	The 6 bits are encoded into 64 possibilities
+	from the letters A&ndash;Z and a&ndash;z; 
+	the numbers 0&ndash;9; 
+	and the characters + (plus sign) and / (slash). 
+	The = (equals sign) is used as a filler 
+	in unused 3- to 4-byte translations. 
+	This function is helpful for converting binary content 
+	into printable characters.
+</p>
+
+<p>
+	The encoded string is returned.
+</p>
+
+<p>
+	BASE64 encoding is used with many Internet protocols 
+	to encode binary data for inclusion in text-based messages
+	(e.g., XML-RPC).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(base64-enc "Hello World")  <span class=arw>&rarr;</span> "SGVsbG8gV29ybGQ="
+</pre>
+</blockquote>
+
+<p>
+	Note that <tt>base64-enc</tt> does not insert 
+	carriage-return/line-feed pairs in longer BASE64 sequences 
+	but instead returns a pure BASE64-encoded string.
+</p>
+
+
+<p>
+	For decoding, 
+	use the <a href="#base64-dec">base64-dec</a> function.
+</p>
+	
+<p>
+	newLISP's BASE64 handling is derived from routines 
+	found in the UNIX <a href="http://curl.haxx.se/">curl</a> utility.
+</p>
+
+<br /><br />
+
+<a NAME="bayes-query"></a>
+<h2><span class="function">bayes-query</span></h2>
+<b>syntax: (bayes-query <em>list-L</em> <em>context-D</em> [<em>bool-chain</em> [<em>bool-probs</em>]])</b>
+
+<p>
+	Takes a list of tokens (<em>list-L</em>) 
+	and a trained dictionary (<em>context-D</em>) 
+	and returns a list of the combined probabilities 
+	of the tokens in one category 
+	(<em>A</em> or <em>Mc</em>)
+	versus a category (<em>B</em>) 
+	against all other categories (<em>Mi</em>). 
+	All tokens in <em>list-L</em> 
+	should occur in <em>context-D</em>. 
+	When using the default <em>R.A. Fisher Chi&sup2;</em> mode, 
+	nonexistent tokens will skew results 
+	toward equal probability in all categories.
+</p>
+
+<p>
+	Non-existing tokens will not have any influence 
+	on the result when using the true <em>Chain Bayesian</em> mode 
+	with <em>bool-chain</em> set to <tt>true</tt>. 
+	The optional last flag, <em>bool-probs</em>, 
+	indicates whether frequencies or probability values 
+	are used in the data set.
+	The <a href="#bayes-train">bayes-train</a> function
+	is typically used to generate
+	a data set's frequencies.
+</p>
+
+<p>
+	Tokens can be strings or symbols. 
+	If strings are used, 
+	they are prepended with an underscore 
+	before being looked up in <em>context-D</em>. 
+	If <a href="#bayes-train">bayes-train</a> was used 
+	to generate <em>context-D</em>'s frequencies, 
+	the underscore was automatically prepended 
+	during the learning process.
+</p>
+
+<p>
+	Depending on the flag specified in <em>bool-probs</em>, 
+	<a href="#bayes-query">bayes-query</a> employs either the 
+	R. A. Fisher Chi&sup2; method of compounding probabilities 
+	or the Chain Bayesian method. 
+	By default, when no flag or <tt>nil</tt> is specified in <em>bool-probs</em>,
+	the <em>Chi&sup2;</em> method of compounding probabilities is used. 
+	When specifying <tt>true</tt> in <em>bool-probs</em>, 
+	the Chain Bayesian method is used.
+</p>
+
+<p>
+	If the R.A. Fisher Chi&sup2; method is used, 
+	the total number of tokens 
+	in the different training set's categories 
+	should be equal or similar. 
+	Uneven frequencies in categories 
+	will skew the results.
+</p>
+
+<p>
+	For two categories <em>A</em> and <em>B</em>, 
+	<tt>bayes-query</tt> uses the following formula:
+</p>
+
+<blockquote>
+<b><em>p(A|tkn) = p(tkn|A) * p(A) / p(tkn|A) * p(A) + p(tkn|B) * p(B)</em></b>
+</blockquote>
+   
+<p>
+	For <em>N</em> categories, 
+	this formula is used:
+</p>
+   
+<blockquote>
+<b><em>p(Mc|tkn) = p(tkn|Mc) * p(Mc) / sum-i-N( p(tkn|Mi) * p(Mi) )</em></b>
+</blockquote> 
+
+<p>
+	The probabilities (<em>p(Mi)</em> or <em>p(A)</em>, along with <em>p(B)</em>) 
+	represent the <em>Bayesian prior probabilities</em>. 
+	<em>p(Mx|tkn)</em> and <em>p(A|tkn)</em> are the 
+	<em>posterior Bayesian</em> probabilities of a category or model.
+</p>
+
+<p>
+	Priors are handled differently, 
+	depending on whether the R.A. Fisher Chi&sup2; 
+	or the Chain Bayesian method is used. 
+	While in Chain Bayesian mode, 
+	posteriors from one token calculation get the priors in the next calculation. 
+	In the default R.A. Fisher method, 
+	priors are not passed on via chaining, 
+	but probabilities are compounded using the Chi&sup2; method.
+</p>
+
+<p>
+	In Chain Bayes mode, 
+	tokens with zero frequency in one category 
+	will effectively put the probability of that category to 0 (zero). 
+	This also causes all posterior priors to be set to 0
+	and the category to be completely suppressed in the result. 
+	Queries resulting in zero probabilities for all categories 
+	yield <em>NaN</em> values.
+</p>
+
+<p>
+	The default R.A. Fisher Chi&sup2; method 
+	is less sensitive about zero frequencies 
+	and still maintains a low probability for that token. 
+	This may be an important feature in natural language processing 
+	when using <em>Bayesian statistics</em>. 
+	Imagine that five different language <em>corpus</em> categories have been trained, 
+	but some words occurring in one category are not present in another. 
+	When the pure Chain Bayesian method is used, 
+	a sentence could never be classified into its correct category
+	because the zero-count of just one word token could effectively exclude it 
+	from the category to which it belongs.
+</p>
+
+<p>
+	On the other hand, 
+	the Chain Bayesian method offers exact results 
+	for specific proportions in the data. 
+	When using Chain Bayesian mode for natural language data,
+	all zero frequencies should be removed from the trained dictionary first.
+</p>
+
+<p>
+	The return value of <tt>bayes-query</tt> 
+	is a list of probability values, 
+	one for each category. 
+	Following are two examples: 
+	the first for the default R.A. Fisher mode,
+	the second for a data set processed with the Chain Bayesian method.
+</p>
+
+<br />
+<h3>R.A. Fisher Chi&sup2; method</h3>
+
+<p>
+	In the following example, 
+	the two data sets are books from Project Gutenberg.
+	We assume that different authors 
+	use certain words with different frequencies 
+	and want to determine if a sentence is more likely to occur in one 
+	or the other author's writing.
+	A similar method is frequently used to differentiate between spam 
+	and legitimate email.
+</p>
+
+<blockquote>
+<pre>
+;; from Project Gutenberg: http://www.gutenberg.org/catalog/
+;; The Adventures of Sherlock Holmes - Sir Arthur Conan Doyle
+
+(bayes-train (parse (lower-case (read-file "Doyle.txt")) 
+                    "[^a-z]+" 0) '() 'DoyleDowson)
+
+;; A Comedy of Masks - Ernest Dowson and Arthur Moore
+
+(bayes-train '() (parse (lower-case (read-file "Dowson.txt")) 
+                    "[^a-z]+" 0) 'DoyleDowson)
+
+(save "DoyleDowson.lsp" 'DoyleDowson)
+</pre>
+</blockquote>
+
+<p>
+	The two training sets are loaded, split into tokens, 
+	and processed by the <a href="#bayes-train">bayes-train</a> function. 
+	In the end, the <tt>DoyleDowson</tt> dictionary is saved to a file, 
+	which will be used later with the <tt>bayes-query</tt> function.
+</p>
+
+<p>
+	The following code illustrates how <tt>bayes-query</tt> is used 
+	to classify a sentence as <em>Doyle</em> or <em>Dowson</em>:
+</p>
+
+<blockquote>
+<pre>
+(load "DoyleDowson.lsp")
+(bayes-query (parse "he was putting the last touches to a picture") 
+    'DoyleDowson)
+<span class=arw>&rarr;</span> (0.03801673331 0.9619832667)
+
+(bayes-query (parse "immense faculties and extraordinary powers of observation") 
+    'DoyleDowson)
+<span class=arw>&rarr;</span> (0.9851075608 0.01489243923)
+</pre>
+</blockquote>
+
+<p>
+	The queries correctly identify the first sentence as a <em>Dowson</em> sentence,
+	and the second one as a <em>Doyle</em> sentence.
+</p>
+      
+<br />
+      
+<h3>Chain Bayesian method</h3>
+
+<p>
+	The second example is frequently found 
+	in introductory literature on Bayesian statistics. 
+	It shows the Chain Bayesian method of 
+	using <tt>bayes-query</tt> on the data of a previously processed data set:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'Data:test-positive '(8 18))
+(set 'Data:test-negative '(2 72))
+(set 'Data:total '(10 90))
+</pre>
+</blockquote>
+   
+<p>
+	A disease occurs in 10 percent of the population. 
+	A blood test developed to detect this disease 
+	produces a false positive rate of 20 percent in the healthy population 
+	and a false negative rate of 20 percent in the sick. 
+	What is the probability of a person carrying 
+	the disease after testing positive?</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(bayes-query '(test-positive) Data true)
+<span class=arw>&rarr;</span> (0.3076923077 0.6923076923)
+
+(bayes-query '(test-positive test-positive) Data true)
+<span class=arw>&rarr;</span> (0.64 0.36)
+
+(bayes-query '(test-positive test-positive test-positive) Data true)
+<span class=arw>&rarr;</span> (0.8767123288 0.1232876712)
+</pre>
+</blockquote>
+
+<p>
+	Note that the Bayesian formulas used 
+	assume statistical independence of events 
+	for the <tt>bayes-query</tt> to work correctly.
+</p>
+
+<p>
+	The example shows that a person must test positive several times 
+	before they can be confidently classified as sick.
+</p>
+
+<p>
+	Calculating the same example using the R.A. Fisher Chi&sup2; method
+	will give less-distinguished results.
+</p> 
+
+<br>
+<h3>Specifying probabilities instead of counts</h3>
+
+<p>
+	Often, data is already available as probability values 
+	and would require additional work to reverse them into frequencies. 
+	In the last example, the data were originally defined as percentages. 
+	The additional optional <em>bool-probs</em> flag 
+	allows probabilities to be entered directly 
+	and should be used together with the Chain Bayesian mode 
+	for maximum performance:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'Data:test-positive '(0.8 0.2))
+(set 'Data:test-negative '(0.2 0.8))
+(set 'Data:total '(0.1 0.9))
+
+(bayes-query '(test-positive) Data true true)
+<span class=arw>&rarr;</span> (0.3076923077 0.6923076923)
+
+(bayes-query '(test-positive test-positive) Data true true)
+<span class=arw>&rarr;</span> (0.64 0.36)
+
+(bayes-query '(test-positive test-positive test-positive) Data true true)
+<span class=arw>&rarr;</span> (0.8767123288 0.1232876712)
+</pre>
+</blockquote>
+
+<p>
+	As expected, the results are the same for probabilities 
+	as they are for frequencies.
+</p>
+
+<br /><br />
+
+<a NAME="bayes-train"></a>
+<h2><span class="function">bayes-train</span></h2>
+<b>syntax: (bayes-train <em>list-M1</em> [<em>list-M2 ... </em>] <em>sym-context-D</em>)</b>
+
+<p>
+	Takes one or more lists of tokens (<em>M1</em>, <em>M2&mdash;</em>) 
+	from a joint set of tokens. 
+	In newLISP, tokens can be symbols or strings 
+	(other data types are ignored).
+	Tokens are placed in a common dictionary 
+	in <em>sym-context-D</em>, 
+	and the frequency is counted  for each token 
+	in each category <em>Mi</em>. 
+	If the context does not yet exist, 
+	it must be quoted.
+</p>
+   
+<p>
+	The <em>M</em> categories represent data models 
+	for which sequences of tokens can be classified 
+	(see <a href="#bayes-query">bayes-query</a>). 
+	Each token in <em>D</em> is a content-addressable symbol 
+	containing a list of the frequencies 
+	for this token within each category. 
+	String tokens are prepended with an <tt>_</tt> (underscore) 
+	before being converted into symbols. 
+	A symbol named <tt>total</tt> is created
+	containing the total of each category. 
+	The <tt>total</tt> symbol cannot be part 
+	of the symbols passed as an <em>Mi</em> category.
+</p>
+
+<p>
+	The function returns a list of token frequencies 
+	found in the different categories or models.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(bayes-train '(A A B C C) '(A B B C C C) 'L)  <span class=arw>&rarr;</span> (5 6)
+
+L:A      <span class=arw>&rarr;</span> (2 1)
+L:B      <span class=arw>&rarr;</span> (1 2)
+L:C      <span class=arw>&rarr;</span> (2 3)
+L:total  <span class=arw>&rarr;</span> (5 6)
+
+(bayes-train '("one" "two" "two" "three")
+             '("three" "one" "three") 
+             '("one" "two" "three") 'S)       
+<span class=arw>&rarr;</span> (4 3 3)
+
+S:_one    <span class=arw>&rarr;</span> (1 1 1)
+S:_two    <span class=arw>&rarr;</span> (2 0 1)
+S:_three  <span class=arw>&rarr;</span> (1 2 1)
+S:total   <span class=arw>&rarr;</span> (4 3 3)
+</pre>
+</blockquote>
+
+<p>
+	The first example shows training with two lists of symbols. 
+	The second example illustrates how an <tt>_</tt> is prepended 
+	when training with strings.
+</p>
+	
+<p>
+	Note that these examples are just for demonstration purposes. 
+	In reality, training sets may contain thousands or millions of words, 
+	especially when training natural language models. 
+	But small data sets may be used when then the frequency of symbols 
+	just describe already-known proportions. 
+	In this case, it may be better to describe the model data set explicitly, 
+	without the <tt>bayes-train</tt> function:
+</p>
+
+<blockquote>
+<pre>
+(set 'Data:tested-positive '(8 18))
+(set 'Data:tested-negative '(2 72))
+(set 'Data:total '(10 90))
+</pre>
+</blockquote>
+
+<p>
+	The last data are from a popular example used 
+	to describe the <a href="#bayes-query">bayes-query</a> function 
+	in introductory papers and books about <em>bayesian networks</em>.
+</p>
+
+<p>
+	Training can be done in different stages 
+	by using <tt>bayes-train</tt> on an existing trained context 
+	with the same number of categories. 
+	The new symbols will be added, 
+	then counts and totals will be correctly updated.
+</p>
+
+<p>
+	Training in multiple batches may be necessary 
+	on big text corpora or documents 
+	that must be tokenized first. 
+	These corpora can be tokenized in small portions, 
+	then fed into <tt>bayes-train</tt> in multiple stages. 
+	Categories can also be singularly trained
+	by specifying an empty list for the absent corpus:
+</p>
+
+<blockquote>
+<pre>
+(bayes-train shakespeare1 '() 'data)
+(bayes-train shakespeare2 '() 'data)
+(bayes-train '() hemingway1 'data)
+(bayes-train '() hemingway2 'data)
+(bayes-train shakepeare-rest hemingway-rest 'data)
+</pre>
+</blockquote>
+
+<p>
+	<tt>bayes-train</tt> will correctly update word counts and totals.
+</p>
+
+<p>
+	Using <tt>bayes-train</tt> inside a context other than <tt>MAIN</tt> 
+	requires the training contexts to have been created previously within 
+	the <tt>MAIN</tt> context via the <a href="#context">context</a> function.
+</p>
+
+<p>
+	<tt>bayes-train</tt> is not only useful with the <a href="#bayes-query">bayes-query</a> function, 
+	but also as a function for counting in general.
+	For instance, the resulting frequencies 
+	could be analyzed using <a href="#prob-chi2">prob-chi2</a> 
+	against a <em>null hypothesis</em> of proportional distribution 
+	of items across categories.
+</p>
+
+<br /><br />
+
+<a NAME="begin"></a>
+<h2><span class="function">begin</span></h2>
+<b>syntax: (begin <em>body</em>)</b>
+
+<p>
+	The <tt>begin</tt> function is used to group a block of expressions. 
+	The expressions in <em>body</em> are evaluated in sequence, and 
+	the value of the last expression in <em>body</em> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(begin
+  (print "This is a block of 2 expressions\n")
+  (print "================================"))
+</pre>
+</blockquote>
+
+<p>
+	Some built-in functions like <a HREF="#cond">cond</a>, <a HREF="#define">define</a>,
+	<a HREF="#dolist">dolist</a>, <a HREF="#dotimes">dotimes</a>, and <a HREF="#while">while</a> 
+	already allow multiple expressions in their bodies,
+	but <tt>begin</tt> is often used in an <a HREF="#if">if</a> expression.
+</p>
+
+<p>
+	The <a HREF="#silent">silent</a> function works like <tt>begin</tt>, 
+	but suppresses console output on return.
+</p>
+
+<br /><br />
+
+<a NAME="beta"></a>
+<h2><span class="function">beta</span></h2>
+<b>syntax: (beta <em>cum-a</em> <em>num-b</em>)</b>
+
+<p>
+	The <em>Beta</em> function, <tt>beta</tt>,  
+	is derived from the <em>log Gamma</em> 
+	<tt>gammaln</tt> function as follows:
+</p>
+
+<blockquote>
+<em><b>
+beta = exp(gammaln(a) + gammaln(b) - gammaln(a + b))
+</b></em>
+</blockquote>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(beta 1 2)  <span class=arw>&rarr;</span> 0.5
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="betai"></a>
+<h2><span class="function">betai</span></h2>
+
+<b>syntax: (betai <em>num-x</em> <em>num-a</em> <em>num-b</em>)</b>
+
+<p>
+	The <em>Incomplete Beta</em> function, <tt>betai</tt>, 
+	equals the cumulative probability of the <em>Beta</em> distribution, <tt>betai</tt>, 
+	at <em>x</em> in <em>num-x</em>. 
+	The cumulative binomial distribution is defined as the probability of an event, <em>pev</em>, 
+	with probability <em>p</em> to occur <em>k</em> or more times in <em>N</em> trials:
+</p>
+
+<blockquote>
+<em><b> pev = Betai(p, k, N - k + 1) </b></em>
+</blockquote>
+<b>example:</b>
+<blockquote>
+<pre>
+(betai 0.5 3 8)  <span class=arw>&rarr;</span> 0.9453125
+
+;; probability of F ratio for df1/df2
+;;
+(define (f-prob f df1 df2)
+  (let (prob (mul 2 (betai (div df2 (add df2 (mul df1 f))) 
+                           (mul 0.5 df2) 
+                           (mul 0.5 df1)))) 
+    (div (if (&gt; prob 1) (sub 2 prob) prob) 2)))
+</pre>
+</blockquote>
+
+<p>
+	The first example calculates the probability for an event, 
+	with a probability of 0.5 to occur 3 or more times in 10 trials (8 = 10 - 3 + 1). 
+	The incomplete Beta distribution can be used to derive a variety of other functions 
+	in mathematics and statistics. 
+	The second example calculates the one-tailed probability of a variance, <em>F ratio</em>. 
+	In similar fashion, <em>students t</em> could be calculated using <tt>betai</tt>. 
+	See also the <a HREF="#binomial">binomial</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="bind"></a>
+
+<h2><span class="function">bind</span></h2>
+<b>syntax: (bind <em>list-variable-associations</em> [<em>boolean_eval</em>])</b>
+
+<p><em>list-variable-associations</em> contains an association list of 
+symbols and their values. <tt>bind</tt> sets all symbols
+to their associated values.</p>
+
+<p>Depending or the presence and value of the <em>boolean-eval</em> flag the
+associated values are evaluated:</p>
+
+<blockquote><pre>
+(set 'lst '((a (+ 3 4)) (b "hello")))
+
+(bind lst)         <span class=arw>&rarr;</span> "hello"
+
+a    <span class=arw>&rarr;</span> (+ 3 4)
+b    <span class=arw>&rarr;</span> "hello"
+
+(bind lst true)    <span class=arw>&rarr;</span> "hello"
+
+a    <span class=arw>&rarr;</span> 7
+</pre></blockquote>
+
+<p>The return value of bind is the value of the last association.</p>
+
+<p><tt>bind</tt> is often used to bind association lists returned
+by <a href="#unify">unify</a>.</p>
+
+<blockquote><pre>
+(bind (unify '(p X Y a) '(p Y X X)))    <span class=arw>&rarr;</span> a
+
+X    <span class=arw>&rarr;</span> a
+Y    <span class=arw>&rarr;</span> a
+</pre></blockquote>
+
+<p>The return value of bind is the value of the last association.</p>
+
+<br /><br />
+
+<a NAME="binomial"></a>
+
+<h2><span class="function">binomial</span></h2>
+<b>syntax: (binomial <em>int-n</em> <em>int-k</em> <em>float-p</em>)</b>
+
+<p>
+	The binomial distribution function is defined as 
+	the probability for an event to occur <em>int-k</em> times in <em>int-n</em> trials 
+	if that event has a probability of <em>float-p</em> 
+	and all trials are independent of one another:
+</p>
+
+<blockquote>
+<em><b>binomial = n! / (k! * (n - k)!) * pow(p, k) * pow(1.0 - p, n - k)</b></em>
+</blockquote>
+
+<p>
+	where <em>x!</em> is the factorial of <em>x</em> 
+	and <em>pow(x, y)</em> is <em>x</em> raised to the power of <em>y</em>.
+</p>
+
+<br />
+
+<b>example:</b>
+<blockquote>
+<pre>
+(binomial 10 3 0.5)  <span class=arw>&rarr;</span> 0.1171875
+</pre>
+</blockquote>
+
+<p>
+	The example calculates the probability for an event 
+	with a probability of 0.5 to occur 3 times in 10 trials. 
+	For a cumulated distribution, 
+	see the <a HREF="#betai">betai</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="callback"></a>
+<h2><span class="function"> callback </span></h2>
+<b>syntax: (callback <em>int-index</em> <em>sym-function</em>)</b>
+
+<p>Up to eight <em>callback</em> functions 
+can be registered with imported libraries.
+The <tt>callback</tt> function returns a procedure address 
+that invokes a user-defined function in <em>sym-function</em>. 
+The following example shows the usage of callback functions 
+when importing the 
+<a href="http://www.opengl.org">OpenGL</a> graphics library:</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+...
+(define (draw)
+    (glClear GL_COLOR_BUFFER_BIT )
+    (glRotated rotx 0.0 1.0 0.0)
+    (glRotated roty 1.0 0.0 0.0)
+    (glutWireTeapot 0.5)
+    (glutSwapBuffers))
+
+(define (keyboard key x y)
+    (if (= (&amp; key 0xFF) 27) (exit)) ; exit program with ESC
+    (println "key:" (&amp; key 0xFF) " x:" x  " y:" y))
+
+(define (mouse button state x y)
+    (if (= state 0)
+        (glutIdleFunc 0) ; stop rotation on button press
+        (glutIdleFunc (callback 4 'rotation)))
+    (println "button: " button " state:" state " x:" x " y:" y))
+
+(glutDisplayFunc (callback 0 'draw))
+(glutKeyboardFunc (callback 1 'keyboard))
+(glutMouseFunc (callback 2 'mouse))
+...
+</pre>
+</blockquote>
+
+<p>The address returned by <tt>callback</tt> 
+is registered with the <a href="http://www.opengl.org/documentation/specs/glut/spec3/spec3.html">Glut</a> library. 
+The above code is a snippet from the file <tt>opengl-demo.lsp</tt>, 
+in the <tt>examples/</tt> directory of the source distribution of newLISP.</p>
+
+<br /><br />
+
+<a NAME="case"></a>
+<h2><span class="function">case</span></h2>
+<b>syntax: (case exp-switch (<em>exp-1</em> <em>body-1</em>) [ (<em>exp-2</em> <em>body-2</em>) ... ] )</b>
+
+<p>
+	The result of evaluating <em>exp-switch</em> 
+	is compared to each of the <em>unevaluated</em> expressions 
+	<em>exp-1, exp-2,</em> &mdash;. 
+	If a match is found, 
+	the corresponding expressions in <em>body</em> are evaluated.
+	The result of the last match is returned 
+	as the result for the entire <tt>case</tt> expression. </p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (translate n)
+  (case n
+    (1 "one")
+    (2 "two")          
+    (3 "three")
+    (4 "four")
+    (true "Can't translate this")))
+(translate 3)   <span class=arw>&rarr;</span> "three"
+(translate 10)  <span class=arw>&rarr;</span> "Can't translate this"
+</pre>
+</blockquote>
+
+<p>
+	The example shows how, 
+	if no match is found, 
+	the last expression in the body of a <tt>case</tt> function
+	can be evaluated.
+</p>
+
+<br /><br />
+
+<a NAME="catch"></a>
+<h2><span class="function">catch</span></h2>
+
+<b>syntax: (catch <em>exp</em>)</b><br />
+<b>syntax: (catch <em>exp</em> <em>symbol</em> )</b>
+
+<p>
+	In the first syntax, 
+	<tt>catch</tt> will return the result of the evaluation of <em>exp</em> 
+	or the evaluated argument of a <a href="#throw">throw</a> 
+	executed during the evaluation of <em>exp</em>:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(catch (dotimes (x 1000) 
+  (if (= x 500) (throw x))))  <span class=arw>&rarr;</span> 500
+</pre>
+</blockquote>
+
+<p>
+	This form is useful for breaking out of iteration loops 
+	and for forcing an early return 
+	from a function or expression block:
+</p>
+
+<blockquote>
+<pre>
+(define (foo x)
+   &hellip;
+  (if condition (throw 123))
+    &hellip;
+  456)
+
+;; if condition is true
+
+(catch (foo p))  <span class=arw>&rarr;</span> 123
+
+;; if condition is not true
+
+(catch (foo p))  <span class=arw>&rarr;</span> 456
+</pre>
+</blockquote>
+
+
+<p>
+	In the second syntax, 
+	<tt>catch</tt> evaluates the expression <em>exp</em>, 
+	stores the result in <em>symbol</em>, 
+	and returns <tt>true</tt>.  
+	If an error occurs during evaluation, 
+	<tt>catch</tt> returns <tt>nil</tt> 
+	and stores the error message in <em>symbol</em>. 
+	This form can be useful when errors are expected 
+	as a normal potential outcome of a function 
+	and are dealt with during program execution.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(catch (func 3 4) 'result)  <span class=arw>&rarr;</span> nil
+result  
+<span class=arw>&rarr;</span> "invalid function in function catch : (func 3 4)"
+
+(constant 'func +)          <span class=arw>&rarr;</span> add &lt;4068A6&gt;
+(catch (func 3 4) 'result)  <span class=arw>&rarr;</span> true
+result                      <span class=arw>&rarr;</span> 7
+</pre>
+</blockquote>
+
+<p>
+	When a <a href="#throw">throw</a> is executed during the evaluation of <em>expr</em>,
+	<tt>catch</tt> will return <tt>true</tt>, 
+	and the <tt>throw</tt> argument will be stored in <em>symbol</em>:
+</p>
+
+<blockquote>
+<pre>
+(catch (dotimes (x 100) 
+  (if (= x 50) (throw "fin")) 'result)  <span class=arw>&rarr;</span> true
+
+result  <span class=arw>&rarr;</span> "fin"
+</pre>
+</blockquote>
+
+<p>
+	As well as being used for early returns from functions and 
+	for breaking out of iteration loops (as in the first syntax), 
+	the second syntax of <tt>catch</tt> can also be used to catch errors. 
+	The <a href="#throw-error">throw-error</a> function may be used 
+	to throw user-defined errors.
+</p>
+
+
+<br /><br />
+
+<a NAME="ceil"></a>
+<h2><span class="function">ceil</span></h2>
+<b>syntax: (ceil <em>number</em> )</b>
+
+<p>
+	Returns the next highest integer above <em>number</em> 
+	as a floating point.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(ceil -1.5)  <span class=arw>&rarr;</span> -1
+(ceil 3.4)   <span class=arw>&rarr;</span> 4
+</pre>
+</blockquote>
+
+<p>See also the <a HREF="#floor">floor</a> function.
+</p>
+
+<br /><br />
+
+
+<a NAME="change-dir"></a>
+<h2><span class="function">change-dir</span></h2>
+<b>syntax: (change-dir <em>str-path</em>)</b>
+
+<p>
+	Changes the current directory to be the one given in <em>str-path</em>.
+	If successful, <tt>true</tt> is returned; otherwise <tt>nil</tt> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(change-dir "/etc")
+</pre>
+</blockquote>
+
+<p>
+	Makes <tt>/etc</tt> the current directory.
+</p>
+
+<br /><br />
+
+<a NAME="char"></a>
+<h2><span class="function">char</span></h2>
+<b>syntax: (char <em>str</em> [<em>int-index</em>] )</b><br />
+<b>syntax: (char <em>int</em>)</b>
+
+<p>
+	Given a string argument, 
+	extracts the character at <em>int-index</em> from <em>str</em>, 
+	returning the ASCII value of that character. 
+	If <em>int-index</em> is omitted, 
+	0 (zero) is assumed.
+</p>
+
+<p>
+	See <a HREF="#indexing">Indexing elements of strings and lists</a>.
+</p>
+
+<p>
+	Given an integer argument, 
+	<tt>char</tt> returns a string containing the ASCII character 
+	with value <em>int</em>.
+</p>
+
+<p>
+	On UTF-8&ndash;enabled versions of newLISP, 
+	the value in <em>int</em> is taken as Unicode
+	and a UTF-8 character is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(char "ABC")     <span class=arw>&rarr;</span> 65  ; ASCII code for "A"
+(char "ABC" 1)   <span class=arw>&rarr;</span> 66  ; ASCII code for "B"
+(char "ABC" -1)  <span class=arw>&rarr;</span> 67  ; ASCII code for "C"
+(char "B")       <span class=arw>&rarr;</span> 66  ; ASCII code for "B"
+
+(char 65)  <span class=arw>&rarr;</span> "A"
+(char 66)  <span class=arw>&rarr;</span> "B"
+
+(char (char 65))  <span class=arw>&rarr;</span> 65      ; two inverse applications
+
+(map char (sequence 1 255))  ; returns current character set
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="chop"></a>
+<h2><span class="function">chop</span></h2>
+<b>syntax: (chop <em>str</em> [<em>int-chars</em>] )</b><br />
+<b>syntax: (chop <em>list</em> [<em>int-elements</em>] )</b>
+
+<p>
+	If the first argument evaluates to a string, 
+	<tt>chop</tt> returns a copy of <em>str</em> 
+	with the last <em>int-char</em> characters omitted.
+	If the <em>int-char</em> argument is absent, 
+	one character is omitted.
+	<tt>chop</tt> does not alter <em>str</em>.
+
+
+<p>
+	If the first argument evaluates to a list, 
+	a copy of <em>list</em> is returned 
+	with <em>int-elements</em> omitted 
+	(same as for strings).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'str "newLISP")  <span class=arw>&rarr;</span> "newLISP"
+                      
+(chop str)    <span class=arw>&rarr;</span> "newLIS"
+(chop str 2)  <span class=arw>&rarr;</span> "newLI"
+                      
+str  <span class=arw>&rarr;</span> "newLISP"
+
+(set 'lst '(a b (c d) e))
+
+(chop lst)    <span class=arw>&rarr;</span> (a b (c d))
+(chop lst 2)  <span class=arw>&rarr;</span> (a b)
+                      
+lst  <span class=arw>&rarr;</span> (a b (c d) e)
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="clean"></a>
+<h2><span class="function">clean</span></h2>
+<b>syntax: (clean <em>exp-predicate</em> <em>list</em>)</b>
+
+<p>
+	The predicate <em>exp-predicate</em> is applied 
+	to each element of <em>list</em>. 
+	In the returned list, 
+	all elements for which <em>exp-predicate</em> is <tt>true</tt> 
+	are eliminated.
+</p>
+
+<p>
+	<tt>clean</tt> works like <a href="#filter">filter</a> 
+	with a negated predicate.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(clean symbol? '(1 2 d 4 f g 5 h))   <span class=arw>&rarr;</span> (1 2 4 5)
+
+(filter symbol? '(1 2 d 4 f g 5 h))  <span class=arw>&rarr;</span> (d f g h)
+
+(define (big? x) (&gt; x 5))        <span class=arw>&rarr;</span> (lambda (x) (&gt; x 5))
+
+(clean big? '(1 10 3 6 4 5 11))  <span class=arw>&rarr;</span> (1 3 4 5)
+
+(clean &lt;= '(3 4 -6 0 2 -3 0))  <span class=arw>&rarr;</span> (3 4 2)
+
+(clean (curry match '(a *)) '((a 10) (b 5) (a 3) (c 8) (a 9)))
+<span class=arw>&rarr;</span>  ((b 5) (c 8))
+</pre>
+</blockquote>
+
+<p>
+	The predicate may be a built-in predicate 
+	or a user-defined function or lambda expression.
+</p>
+
+<p>
+	For cleaning numbers from one list 
+	using numbers from another, 
+	use <a href="#difference">difference</a> 
+	or <a href="#intersect">intersect</a> 
+	(with the <em>list</em> option).
+</p>
+
+<p>
+	See also the related function <a HREF="#index">index</a>, 
+	which returns the indices of the remaining elements, 
+	and <a href="#filter">filter</a>, 
+	which returns all elements for which a predicate returns true.
+</p>
+
+<br /><br />
+
+<a NAME="close"></a>
+<h2><span class="function">close</span></h2>
+<b>syntax: (close <em>int-file</em>)</b>
+
+<p>
+	Closes the file specified by the file handle in <em>int-file</em>. 
+	The handle would have been obtained 
+	from a previous <a HREF="#open">open</a> operation. 
+	If successful, <tt>close</tt> returns <tt>true</tt>; otherwise  <tt>nil</tt> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(close (device))  <span class=arw>&rarr;</span> true
+(close 7)         <span class=arw>&rarr;</span> true
+(close aHandle)   <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<p>
+	Note that using <tt>close</tt> on <a href="#device">device</a> 
+	automatically resets it to 0 (zero, the screen device).
+</p>
+	
+<br /><br />
+
+<a NAME="command-line"></a>
+<h2><span class="function">command-line</span></h2>
+<b>syntax: (command-line [<em>bool</em>])</b>
+
+<p>
+	Enables or disables the console's 
+	interactive command-line mode.
+	The command line is switched off 
+	if <em>bool</em> evaluates to <tt>nil</tt>, 
+	and on for anything else. 
+	The command line is also switched on 
+	if reset or an error condition occurs.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(command-line nil)
+</pre>
+</blockquote>
+
+<p>
+	On Linux/UNIX, 
+	this will also disable the Ctrl-C handler.
+</p>
+<br /><br />
+
+
+<a NAME="cond"></a>
+<h2><span class="function">cond</span></h2>
+
+<b>syntax: (cond (<em>exp-condition-1</em> <em>body-1</em>) [(<em>exp-condition-2</em> <em>body-2</em>) ... ]</b>
+
+<p>
+	Like <tt>if</tt>, <tt>cond</tt> conditionally evaluates the expressions 
+	within its body. 
+	The <em>exp-condition</em>s are evaluated in turn, 
+	until some <em>exp-condition-i</em> is found 
+	that evaluates to anything other than <tt>nil</tt> 
+	or an empty list <tt>()</tt>.
+	The result of evaluating <em>body-i</em> 
+	is then returned as the result of the entire <em>cond-expression</em>. 
+	If all conditions evaluate to <tt>nil</tt> 
+	or an empty list,
+	<em>cond</em> returns the value of the last <em>cond-expression</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (classify x)
+  (cond
+    ((&lt; x 0) "negative")
+    ((&lt; x 10) "small")
+    ((&lt; x 20) "medium")
+    ((&gt;= x 30) "big")))
+
+(classify 15)   <span class=arw>&rarr;</span> "medium"
+(classify 22)   <span class=arw>&rarr;</span> "nil"
+(classify 100)  <span class=arw>&rarr;</span> "big"
+(classify -10)  <span class=arw>&rarr;</span> "negative"
+</pre>
+</blockquote>
+
+<p>
+	When a <em>body-n</em> is missing, 
+	the value of the last <em>cond-expression</em> evaluated 
+	is returned. 
+	If no condition evaluates to <tt>true</tt>, 
+	the value of the last conditional expression is returned
+	(i.e., <tt>nil</tt> or an empty list).
+</p>
+
+<blockquote>
+<pre>
+(cond ((+ 3 4)))  <span class=arw>&rarr;</span> 7
+</pre>
+</blockquote>
+
+<p>
+	When used with multiple arguments, 
+	the function <a href="#if">if</a> 
+	behaves like <tt>cond</tt>, 
+	except it does not need extra parentheses 
+	to enclose the condition-body pair 
+	of expressions.
+</p>
+
+<br /><br />
+
+<a NAME="cons"></a>
+<h2><span class="function">cons</span></h2>
+<b>syntax: (cons <em>exp-1</em> <em>exp-2</em>)</b>
+
+<p>
+	If <em>exp-2</em> evaluates to a list, 
+	then a list is returned with the result of evaluating <em>exp-1</em> 
+	inserted as the first element. 
+	If <em>exp-2 </em>evaluates to anything other than a list, 
+	the results of evaluating <em>exp-1</em> and <em>exp-2</em> 
+	are returned in a list. 
+	Note that there is no <em>dotted pair</em> in newLISP:
+	<em>consing</em> two atoms constructs a list, not a dotted pair.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(cons 'a 'b)            <span class=arw>&rarr;</span> (a b)
+(cons 'a '(b c))        <span class=arw>&rarr;</span> (a b c)
+(cons (+ 3 4) (* 5 5))  <span class=arw>&rarr;</span> (7 25)
+(cons '(1 2) '(3 4))    <span class=arw>&rarr;</span> ((1 2) 3 4)
+(cons nil 1)            <span class=arw>&rarr;</span> (nil 1)
+(cons 1 nil)            <span class=arw>&rarr;</span> (1 nil)
+(cons 1)                <span class=arw>&rarr;</span> (1)
+(cons)			<span class=arw>&rarr;</span> ()
+</pre>
+</blockquote>
+
+<p>
+	Unlike other LISPs that return <tt>(s)</tt>
+	as the result of the expression <tt>(cons 's nil)</tt>, 
+	newLISP's <tt>cons</tt> returns <tt>(s nil)</tt>. 
+	In newLISP, <tt>nil</tt> is a boolean value 
+	and is not equivalent to an empty list, 
+	and a LISP cell holds only one value.
+</p>
+
+<p>
+	<tt>cons</tt> behaves like the inverse operation of <a href="#first">first</a>
+and <a href="#rest">rest</a> 
+	(or <a href="#first">first</a> and <a href="#last">last</a> if the list is a pair):
+</p>
+
+<blockquote>
+<pre>
+(cons (first '(a b c)) (rest '(a b c)))  <span class=arw>&rarr;</span> (a b c)
+
+(cons (first '(x y)) (last '(x y)))      <span class=arw>&rarr;</span> (x y)
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="constant"></a>
+<h2><span class="function">constant</span></h2>
+<b>syntax: (constant <em>sym-1</em> <em>exp-1</em> [<em>sym-2</em> <em>exp-2</em> ... ])</b>
+
+<p>
+	Identical to <a href="#set">set</a> in functionality,
+	<tt>constant</tt> further protects the symbols from subsequent modification. 
+	A symbol set with <tt>constant</tt> can only be modified 
+	using the <tt>constant</tt> function again.  
+	When an attempt is made to modify the contents of a symbol protected with <tt>constant</tt>, 
+	newLISP generates an error message. 
+	Only symbols from the current context can be used with <tt>constant</tt>. 
+	This prevents the overwriting of symbols 
+	that have been protected in their home context.
+</p>
+
+<p>
+	Symbols initialized with <a href="#set">set</a>, <a href="#define">define</a>, or <a href="#define-macro"> define-macro</a>
+can still be protected by using the <tt>constant</tt> function:
+</p>
+<blockquote>
+<pre>
+
+(constant 'aVar 123)  <span class=arw>&rarr;</span> 123
+(set 'aVar 999) 
+<span class=err>error: symbol is protected in function set: aVar</span>
+
+(define (double x) (+ x x))
+
+(constant 'double)
+
+;; equivalent to
+
+(constant 'double (fn (x) (+ x x)))
+</pre>
+</blockquote>
+
+<p>
+	The first example defines a constant, <tt>aVar</tt>, 
+	which can only be changed by using another <tt>constant</tt> statement. 
+	The second example protects <tt>double</tt> from being changed
+	(except by <tt>constant</tt>). 
+	Because a function definition in newLISP 
+	is equivalent to an assignment of a lambda function, 
+	both steps can be collapsed into one, 
+	as shown in the last statement line. 
+	This could be an important technique 
+	for avoiding protection errors 
+	when a file is loaded multiple times.
+</p>
+
+<p>
+	The last value to be assigned can be omitted. 
+	<tt>constant</tt> returns the contents of
+	the last symbol set and protected.
+</p>
+
+<p>
+	Built-in functions can be assigned to symbols 
+	or to the names of other built-in functions, 
+	effectively redefining them as different functions.
+	There is no performance loss when renaming functions.
+</p>
+
+<blockquote>
+<pre>
+(constant 'squareroot sqrt)  <span class=arw>&rarr;</span> sqrt &lt;406C2E&gt;
+(constant '+ add)            <span class=arw>&rarr;</span> add &lt;4068A6&gt;
+</pre>
+</blockquote>
+
+<p>
+	<tt>squareroot</tt> will behave like <tt>sqrt</tt>. 
+	The <tt>+</tt> (plus sign) is redefined 
+	to use the mixed type floating point mode of <tt>add</tt>. 
+	The hexadecimal number displayed in the result 
+	is the binary address of the built-in function 
+	and varies on different platforms and OSes.
+</p>
+
+<br /><br />
+
+<a NAME="context"></a>
+<h2><span class="function">context</span></h2>
+<b>syntax: (context [<em>sym-context</em>])</b><br /><br />
+<b>syntax: (context <em>sym-context</em> <em>str|sym</em> <em>exp-value</em>)</b><br />
+<b>syntax: (context <em>sym-context</em> <em>str|sym</em>)</b>
+
+<p>
+	In the first syntax, <tt>context</tt> is used 
+	to switch to a different context namespace. 
+	Subsequent <a href="#load">load</a>s of newLISP source 
+	or functions like <a href="#eval-string">eval-string</a> 
+	will put newly created symbols and 
+	function definitions in the new context.
+</p>
+
+<p>
+	If the context still needs to be created, 
+	the symbol for the new context should be specified. 
+	When no argument is passed to <tt>context</tt>, then 
+	the symbol for the current context is returned. </p>
+
+<p>
+	Because contexts evaluate to themselves, 
+	a quote is not necessary 
+	to switch to a different context 
+	if that context already exists.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(context 'GRAPH)          ; create / switch context GRAPH
+
+(define (foo-draw x y z)  ; function resides in GRAPH
+  (&hellip;))
+                                
+(set 'var 12345)
+(symbols)  <span class=arw>&rarr;</span> (foo-draw var)  ; GRAPH has now two symbols
+
+(context MAIN)                ; switch back to MAIN (quote not required)
+
+(print GRAPH:var) <span class=arw>&rarr;</span> 12345    ; contents of symbol in GRAPH
+
+(GRAPH:foo-draw 10 20 30)     ; execute function in GRAPH
+(set 'GRAPH:var 6789)         ; assign to a symbol in GRAPH
+</pre>
+</blockquote>
+
+<p>
+	If a context symbol is referred to before the context exists, 
+	the context will be created implicitly.
+</p>
+
+<blockquote>
+<pre>
+(set 'person:age 0)       ; no need to create context first
+(set 'person:address "")  ; useful for quickly defining data structures
+</pre>
+</blockquote>
+
+<p>
+	Contexts can be copied:
+</p>
+
+<blockquote>
+<pre>
+(new person 'JohnDoe)  <span class=arw>&rarr;</span>  JohnDoe
+
+(set 'JohnDoe:age 99)
+</pre>
+</blockquote>
+
+<p>
+	Contexts can be referred to by a variable:
+</p>
+
+<blockquote>
+<pre>
+(set 'human JohnDoe)
+
+human:age  <span class=arw>&rarr;</span> 99
+
+(set 'human:address "1 Main Street")
+
+JohnDoe:address  <span class=arw>&rarr;</span> "1 Main Street"
+</pre>
+</blockquote>
+
+
+<p>An evaluated context (no quote) can be given as an argument:
+</p>
+
+<blockquote>
+<pre>
+<b>></b> (context 'FOO)
+<b>FOO</b>
+<b>FOO></b> (context MAIN)
+<b>MAIN</b>
+<b>></b> (set 'old FOO)
+FOO
+<b>></b> (context 'BAR)
+<b>BAR</b>
+<b>BAR></b> (context MAIN:old)
+<b>FOO</b>
+<b>FOO></b> 
+</pre>
+</blockquote>
+
+
+<p>
+	If an identifier with the same symbol already exists, 
+	it is redefined to be a context.
+</p>
+
+<p>
+	Symbols within the current context 
+	are referred to simply by their names, 
+	as are built-in functions and special symbols 
+	like <tt>nil</tt> and <tt>true</tt>. 
+	Symbols outside the current context 
+	are referenced by prefixing the symbol name 
+	with the context name and a <tt>:</tt> (colon). 
+	To quote a symbol in a different context, 
+	prefix the context name with a <tt>'</tt> (single quote).
+</p>
+
+<p>
+	Within a given context, symbols may be created 
+	with the same name as built-in functions 
+	or context symbols in MAIN.
+	This overwrites the symbols in MAIN 
+	when they are prefixed with a context:
+</p>
+
+<blockquote>
+<pre>
+(context 'CTX)
+(define (CTX:new var)
+    (&hellip;))
+    
+(context 'MAIN)
+</pre>
+</blockquote>
+
+<p>
+	<tt>CTX:new</tt> will overwrite new in MAIN.
+</p>
+
+<p>
+	In the second syntax, 
+	<tt>context</tt> is used to create <em>dictionaries</em> 
+	for <em>hash</em>-like associative memory access:
+</p>
+
+<blockquote>
+<pre>
+;; create a symbol and store data in it
+(context 'MyHash "John Doe" 123)         <span class=arw>&rarr;</span> 123
+(context 'MyHash "@#$%^" "hello world")  <span class=arw>&rarr;</span> "hello world"
+(context 'myHash 'xyz 999)               <span class=arw>&rarr;</span> 999
+
+;; retrieve contents from  symbol
+(context 'MyHash "john Doe")  <span class=arw>&rarr;</span> 123
+(context 'MyHash "@#$%^")     <span class=arw>&rarr;</span> "hello world"
+(context 'MyHash 'xyz)        <span class=arw>&rarr;</span> 999
+MyHash:xyz                    <span class=arw>&rarr;</span> 999
+</pre>
+</blockquote>
+
+<p>
+	The first three statements create a symbol 
+	and store a value of any data type inside. 
+	The first statement also creates 
+	the hash context named <tt>MyHash</tt>.
+When a symbol is specified for the name, the name is taken
+from the symbol and creates a symbol with the same name
+in the context <tt>MyHash</tt>.
+</p>
+
+<p>
+	Hash symbols can contain spaces 
+	or any other special characters 
+	not typically allowed in newLISP symbols 
+	being used as variable names. 
+	This second syntax of <tt>context</tt> 
+	only creates the new symbol 
+	and returns the value contained in it. 
+	It does not switch to the new namespace.
+</p>
+	
+<p>The following function definition can be used as a comfortable shorter
+method to handle dictionaries:
+</p>
+
+<blockquote>
+<pre>
+(define (myhash:myhash key value) 
+   (if value 
+       (context 'myhash key value) 
+       (context 'myhash key)))
+       
+(myhash "hello" 123)
+
+(myhash "hello")  <span class=arw>&rarr;</span> 123
+</pre>
+</blockquote>
+
+<p>Note that <tt>context</tt> cannot be used to modify the 
+<a href="#default_function">default functor</a>. This protects a function
+like the previous against modifying itself.
+</p>
+
+<br /><br />
+
+<a NAME="contextp"></a>
+<h2><span class="function">context?</span></h2>
+
+<b>syntax: (context? <em>exp</em>)</b><br />
+<b>syntax: (context? <em>exp</em> <em>str-sym</em>)</b>
+
+<p>
+	In the first syntax, 
+	<em>context?</em> is a predicate that returns <tt>true</tt> 
+	only if <em>exp</em> evaluates to a context; 
+	otherwise, it returns <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(context? MAIN)  <span class=arw>&rarr;</span> true
+(set 'x 123)
+(context? x)     <span class=arw>&rarr;</span> nil
+
+(set 'FOO:q "hola")  <span class=arw>&rarr;</span> "hola"
+(set 'ctx FOO)
+(context? ctx)       <span class=arw>&rarr;</span> true  ; ctx contains context foo
+</pre>
+</blockquote>
+
+<p>
+	The second syntax checks for the existence of a symbol in a context. 
+	The symbol is specified by its name string in <em>str-sym</em>.
+</p>
+
+<blockquote>
+<pre>
+(context? FOO "q")  <span class=arw>&rarr;</span> true
+(context? FOO "p")  <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<p>
+	Use <a href="#context">context</a> to change and create namespaces 
+	and to create hash symbols in contexts.
+</p>
+
+<br /><br />
+
+<a NAME="copy-file"></a>
+<h2><span class="function">copy-file</span></h2>
+<b>syntax: (copy-file <em>str-from-name</em> <em>str-to-name</em>)</b>
+
+<p>
+	Copies a file from a path-file-name given in <em>str-from-name</em> 
+	to a path-file-name given in <em>str-to-name</em>. 
+	Returns <tt>true</tt> or <tt>nil</tt>, 
+	depending on if the copy was successful or not.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(copy-file "/home/me/newlisp/data.lsp" "/tmp/data.lsp")
+</pre>
+</blockquote>
+
+<br /><br />
+
+
+<a NAME="cos"></a>
+<h2><span class="function">cos</span></h2>
+<b>syntax: (cos <em>num-radians</em>)</b>
+
+<p>
+	The cosine function is calculated from <em>num</em>, 
+	and the result is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(cos 1)                     <span class=arw>&rarr;</span> 0.5403023059
+(set 'pi (mul 2 (acos 0)))  <span class=arw>&rarr;</span> 3.141592654
+(cos pi)                    <span class=arw>&rarr;</span> -1
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="cosh"></a>
+<h2><span class="function">cosh</span></h2>
+<b>syntax: (cosh <em>num-radians</em>)</b>
+
+<p>Calculates the hyperbolic cosine of <em>num-radians</em>. 
+The hyperbolic sine is defined mathematically as: 
+<em>(exp (x) + exp (-x)) / 2</em>.
+An overflow to <tt>inf</tt> may occur 
+if <em>num-radians</em> is too large.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(cosh 1)     <span class=arw>&rarr;</span> 1.543080635
+(cosh 10)    <span class=arw>&rarr;</span> 11013.23292
+(cosh 1000)  <span class=arw>&rarr;</span> inf
+(= (cosh 1) (div (add (exp 1) (exp -1)) 2))  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="count"></a>
+<h2><span class="function">count</span></h2>
+<b>syntax: (count <em>list-1</em> <em>list-2</em>)</b>
+
+<p>
+	Counts elements of <em>list-1</em> in <em>list-2</em> 
+	and returns a list of those counts.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(count '(1 2 3) '(3 2 1 4 2 3 1 1 2 2))  <span class=arw>&rarr;</span> (3 4 2)
+(count '(z a) '(z d z b a z y a))        <span class=arw>&rarr;</span> (3 2)
+
+(set 'lst (explode (read-file "myFile.txt")))
+(set 'letter-counts (count (unique lst) lst))
+</pre>
+</blockquote>
+<p>
+	The second example counts all occurrences 
+	of different letters in <tt>myFile.txt</tt>.
+</p>
+
+<p>
+	The first list in <tt>count</tt>, 
+	which specifies the items to be counted in the second list, 
+	should be unique. 
+	For items that are not unique, 
+	only the first instance will carry a count; 
+	all other instances will display <tt>0</tt> (zero).
+</p>
+
+<br /><br />
+
+<a name="cpymem"></a>
+<h2><span class="function">cpymem</span></h2>
+<b>syntax: (cpymem <em>int-from-address</em> <em>int-to-address</em> <em>int-bytes</em>)</b>
+
+<p>
+	Copies <em>int-bytes</em> of memory 
+	from <em>int-from-address</em> 
+	to <em>int-to-address</em>. 
+	This function can be used for 
+	direct memory writing/reading 
+	or for hacking newLISP internals
+	(e.g., type bits in LISP cells, 
+	or building functions with binary executable code on the fly).
+</p>
+
+<p>
+	Note that this function should only be used 
+	when familiar with newLISP internals.
+	<tt>cpymem</tt> can crash the system 
+	or make it unstable if used incorrectly.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(cpymem (pack "c c" 0 32) (last (dump 'sym)) 2)
+
+(set 's "0123456789")
+
+(cpymem "xxx" (+ (address s) 5) 3)
+
+s  <span class=arw>&rarr;</span> "01234xxx89")
+</pre>
+</blockquote>
+
+<p>
+	The first example would remove 
+	the protection bit in symbol <tt>sym</tt>. 
+	The second example copies a string directly 
+	into a string variable.
+</p>
+
+<p>
+	The following example creates a new function from scratch, 
+	runs a piece of binary code, and adds up two numbers. 
+	This assembly language snippet shows the x86 code 
+	to add up two numbers and return the result:
+</p>
+
+<blockquote>
+<pre>
+ 55       push epb
+ 8B EC    mov  ebp, esp
+ 8B 45 08 mov  eax, [ebp+08]
+ 03 45 0C add  eax, [ebp+0c]
+ 5D       pop  ebp
+ C3       ret
+</pre>
+</blockquote>
+
+<p>
+	The binary representation is attached 
+	to a new function created in newLISP:
+</p>
+
+<blockquote>
+<pre>
+;; set code
+(set 'bindata (pack "ccccccccccc" 
+    0x55 0x8B 0xEC 0x8B 0x45 0x08 0x03 0x45 0x0C 0x5D 0xC3))
+
+;; get function template
+(set 'foo print)
+
+;; change type to library import and OS calling conventions
+;(cpymem (pack "ld" 265) (first (dump foo)) 4) ; Win32 stdcall
+(cpymem (pack "ld" 264) (first (dump foo)) 4)  ; Linux cdecl
+
+;; set code pointer
+(cpymem (pack "ld" (address bindata)) (+ (first (dump foo)) 12) 4)
+
+;; execute
+(foo 3 4) <span class=arw>&rarr;</span> 7
+</pre>
+</blockquote>
+
+<p>
+	Use the <a href="#dump">dump</a> function 
+	to retrieve binary addresses 
+	and the contents from newLISP cells.
+</p>
+
+<br /><br />
+
+<a name="crc32"></a>
+<h2><span class="function">crc32</span></h2>
+<b>syntax: (crc32 <em>str-data</em>)</b>
+
+<p>
+	Calculates a running 32-bit CRC (Circular Redundancy Check) sum 
+	from the buffer in <em>str-data</em>, 
+	starting with a CRC of <tt>0xffffffff</tt> for the first byte. 
+	<tt>crc32</tt> uses an algorithm published 
+	by <a href="http://www.w3.org">www.w3.org</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(crc32 "abcdefghijklmnopqrstuvwxyz")  <span class=arw>&rarr;</span> 1277644989
+</pre>
+</blockquote>
+
+<p>
+	<tt>crc32</tt> is often used to verify data integrity 
+	in unsafe data transmissions.
+</p>
+
+<br /><br />
+
+<a NAME="crit-chi2"></a>
+<h2><span class="function">crit-chi2</span></h2>
+
+<b>syntax: (crit-chi2 <em>num-probability</em> <em>num-df</em>)</b>
+
+<p>
+	Calculates the critical minimum Chi&sup2; 
+	for a given confidence probability <em>num-probability</em> 
+	and the degrees of freedom <em>num-df</em> 
+	for testing the significance of a statistical null hypothesis.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(crit-chi2 0.99 4)  <span class=arw>&rarr;</span> 13.27670443
+</pre>
+</blockquote>
+
+<p>
+	See also the inverse function <a href="#prob-chi2">prob-chi2</a>.
+</p> 
+
+<br /><br />
+
+<a NAME="crit-z"></a>
+<h2><span class="function">crit-z</span></h2>
+<b>syntax: (crit-z <em>num-probability</em>)</b>
+
+<p>
+	Calculates the critical normal distributed Z value 
+	of a given cumulated probability (<em>num-probability</em>) 
+	for testing of statistical significance and confidence intervals.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(crit-z 0.999)  <span class=arw>&rarr;</span> 3.090232372
+</pre>
+</blockquote>
+
+<p>
+	See also the inverse function <a href="#prob-z">prob-z</a>.
+</p> 
+
+<br /><br />
+
+<a NAME="current-line"></a>
+<h2><span class="function">current-line</span></h2>
+<b>syntax: (current-line)</b>
+
+<p>
+	Retrieves the contents of the last 
+	<a HREF="#read-line">read-line</a> operation. 
+	<tt>current-line</tt>'s contents are also implicitly used 
+	when <a HREF="#write-line">write-line</a> 
+	is called without a string parameter.
+</p>
+
+<p>
+	The following source shows the typical code pattern 
+	for creating a UNIX command-line filter:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+#!/usr/bin/newlisp
+ 
+(set 'inFile (open (main-args 2) "read"))
+(while (read-line inFile) 
+  (if (starts-with (current-line) ";;")
+    (write-line)))
+(exit)
+</pre>
+</blockquote>
+
+<p>
+	The program is invoked:
+</p>
+
+<blockquote>
+<pre>
+./filter myfile.lsp
+</pre>
+</blockquote>
+
+<p>
+	This displays all comment lines starting with <tt>;;</tt> 
+	from a file given as a command-line argument 
+	when invoking the script <tt>filter</tt>.
+</p>
+
+<br /><br />
+
+<a NAME="curry"></a>
+
+<h2><span class="function">curry</span></h2>
+<b>syntax: (curry <em>func</em> <em>expr</em>)</b>
+
+<p>Transforms <em>func</em> from a function <em>f(x, y)</em> that takes two arguments into a function <em>fx(y)</em> that takes a single argument. <tt>curry</tt> works like a
+macro in that it does not evaluate its arguments. Instead, they are
+evaluated during the application of <em>func</em>.</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'f (curry + 10))  <span class=arw>&rarr;</span> (lambda (_x) (+ 10 _x))
+
+(f 7)  <span class=arw>&rarr;</span> 17
+
+(filter (curry match '(a *)) '((a 10) (b 5) (a 3) (c 8) (a 9)))
+<span class=arw>&rarr;</span>  ((a 10) (a 3) (a 9))
+
+(clean (curry match '(a *)) '((a 10) (b 5) (a 3) (c 8) (a 9)))
+<span class=arw>&rarr;</span>  ((b 5) (c 8))
+
+(map (curry list 'x) (sequence 1 5))
+<span class=arw>&rarr;</span>  ((x 1) (x 2) (x 3) (x 4) (x 5))
+</pre>
+</blockquote>
+
+<p><tt>curry</tt> can be used on all functions taking two arguments.</p>
+
+<br /><br />
+
+<a NAME="date"></a>
+
+<h2><span class="function">date</span></h2>
+<b>syntax: (date)</b><br />
+<b>syntax: (date <em>int-secs</em> [<em>int-offset</em>])</b><br />
+<b>syntax: (date <em>int-secs</em> <em>int-offset</em> <em>str-format</em>)</b>
+
+<p>
+	The first syntax returns the local time zone's 
+	current date and time as a string representation.
+</p>
+
+<p>
+	In the second syntax, <tt>date</tt> translates the number of seconds 
+	in <em>int-secs</em> into its date/time string representation 
+	for the local time zone. 
+	The number in <em>int-secs</em> is usually retrieved from the system 
+	using <a HREF="#date-value">date-value</a>. 
+	Optionally, a time-zone offset (in minutes) can be specified 
+	in <em>int-offset</em>, which is added 
+	or subtracted before conversion of <em>int-sec</em> to a string.
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(date)                   <span class=arw>&rarr;</span> "Fri Oct 29 09:56:58 2004"
+
+(date (date-value))      <span class=arw>&rarr;</span> "Sat May 20 11:37:15 2006" 
+(date (date-value) 300)  <span class=arw>&rarr;</span> "Sat May 20 16:37:19 2006"  ; 5 hours offset
+(date 0)                 <span class=arw>&rarr;</span> "Wed Dec 31 16:00:00 1969"
+</pre>
+</blockquote>
+
+<p>
+	Note that on some Win32-compiled versions, 
+	values resulting in dates earlier than 
+	January 1, 1970, 00:00:00 
+	return <tt>nil</tt>. 
+	But the MinGW compiled version will also work 
+	with values that result in dates up to 24 hours 
+	prior to 1/1/1970, returning a date-time string for 12/31/1969.
+</p>
+
+<p>
+	The way the date and time are presented in a string 
+	depends on the underlying operating system.
+</p>
+
+<p> 
+	The second example would show 1-1-1970 0:0 
+	when in the Greenwich time zone, 
+	but it displays a time lag of 8 hours when 
+	in Pacific Standard Time (PST).
+	<tt>date</tt> assumes the <em>int-secs</em> given are in 
+	Coordinated Universal Time (UCT; formerly Greenwich Mean Time (GMT)) 
+	and converts it according to the local time-zone.
+</p>
+
+<p>
+	The third syntax makes the date string fully customizable
+	by using a format specified in <em>str-format</em>.
+	This allows the day and month names to be translated into 
+	results appropriate for the current locale:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set-locale "german") <span class=arw>&rarr;</span> "de_DE"      
+
+(date (date-value) 0 "%A %-d. %B %Y")
+<span class=arw>&rarr;</span> "Montag  7. M&auml;rz 2005" 
+; on Linux - suppresses the leading 0
+
+(set-locale "C")  ; default POSIX
+
+(date (date-value) 0 "%A %B %d %Y")
+<span class=arw>&rarr;</span> "Monday March 07 2005"
+
+(date (date-value) 0 "%a %#d %b %Y")
+<span class=arw>&rarr;</span> "Mon 7 Mar 2005" 
+; suppressing leading 0 on Win32 using #
+
+(set-locale "german")
+
+(date (date-value) 0 "%x")
+<span class=arw>&rarr;</span> "07.03.2005"   ; day month year
+
+(set-locale "C")
+
+(date (date-value) 0 "%x")
+
+<span class=arw>&rarr;</span> "03/07/05"     ; month day year
+</pre>
+</blockquote>
+
+<p>
+	The following table summarizes all format specifiers available 
+	on both Win32 and Linux/UNIX platforms. 
+	More format options are available on Linux/UNIX. 
+	For details, consult the documentation for the C function 
+	<tt>strftime()</tt> in the individual platform's C library.
+</p>
+<br />
+<center>
+<table border="0" cellpadding="1" width="95%" summary="date formatting">
+<tr align="left"><th>format</th><th>description</th></tr>
+<tr><td>%a</td><td>abbreviated weekday name according to the current locale</td></tr>
+
+<tr><td>%A</td><td>full weekday name according to the current locale</td></tr>
+<tr><td>%b</td><td>abbreviated month name according to the current locale</td></tr>
+<tr><td>%B</td><td>full month name according to the current locale</td></tr>
+<tr><td>%c</td><td>preferred date and time representation for the current locale</td></tr>
+<tr><td>%d</td><td>day of the month as a decimal number (range 01&ndash;31)</td></tr>
+<tr><td>%H</td><td>hour as a decimal number using a 24-hour clock (range 00&ndash;23)</td></tr>
+
+<tr><td>%I</td><td>hour as a decimal number using a 12-hour clock (range 01&ndash;12)</td></tr>
+<tr><td>%j</td><td>day of the year as a decimal number (range 001&ndash;366)</td></tr>
+<tr><td>%m</td><td>month as a decimal number (range 01&ndash;12)</td></tr>
+<tr><td>%M</td><td>minute as a decimal number</td></tr>
+<tr><td>%p</td><td>either 'am' or 'pm' according to the given time value or
+the corresponding strings for the current locale</td></tr>
+<tr><td>%S</td><td>second as a decimal number 0&ndash;61 (60 and 61 to account
+for occasional leap seconds)</td></tr>
+
+<tr><td>%U</td><td>week number of the current year as a decimal number,
+starting with the first Sunday as the first day of the first week</td></tr>
+<tr><td>%w</td><td>day of the week as a decimal, Sunday being 0</td></tr>
+<tr><td>%W</td><td>week number of the current year as a decimal number,
+starting with the first Monday as the first day of the first week</td></tr>
+<tr><td>%x</td><td>preferred date representation for the current locale
+without the time</td></tr>
+<tr><td>%X</td><td>preferred time representation for the current locale
+without the date</td></tr>
+<tr><td>%y</td><td>year as a decimal number without a century (range 00&ndash;99)</td></tr>
+
+<tr><td>%Y</td><td>year as a decimal number including the century</td></tr>
+<tr><td>%z</td><td>time zone or name or abbreviation (same as %Z on Win32,
+different on Linux/UNIX)</td></tr>
+<tr><td>%Z</td><td>time zone or name or abbreviation (same as %z on Win32,
+different on Linux/UNIX)</td></tr>
+<tr><td>%%</td><td>a literal '%' character</td></tr>
+</table></center>
+<br />
+<p>
+	Leading zeroes in the display of decimal numbers can be suppressed 
+	using <tt>-</tt> (minus) on Linux/UNIX and <tt>#</tt> (number sign) on Win32.
+</p>
+
+<p>
+	See also <a HREF="#date-value">date-value</a>,
+    <a href="#parse-date">parse-date</a>, 
+	<a HREF="#time-of-day">time-of-day</a>, 
+	<a HREF="#time">time</a>, and <a HREF="#now">now</a>.
+</p>
+
+<br /><br />
+
+<a NAME="date-value"></a>
+<h2><span class="function">date-value</span></h2>
+
+<b>syntax: (date-value <em>int-year</em> <em>int-month</em> <em>int-day</em> [<em>int-hour</em> <em>int-min</em> <em>int-sec</em>])</b><br /> 
+<b>syntax: (date-value)</b>
+
+<p>
+	In the first syntax, <tt>date-value</tt> returns the time 
+	in seconds since 1970-1-1 00:00:00 for a given date and time.  
+	The parameters for the hour, minutes, and seconds are optional. 
+	The time is assumed to be Coordinated Universal Time (UCT), 
+	not adjusted for the current time zone.
+</p>
+
+<p>
+	In the second syntax, <tt>date-value</tt> returns the time value 
+	in seconds for the current time.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(date-value 2002 2 28)       <span class=arw>&rarr;</span> 1014854400
+(date-value 1970 1 1 0 0 0)  <span class=arw>&rarr;</span> 0
+                                 
+(date (apply date-value (now)))  <span class=arw>&rarr;</span> "Wed May 24 10:02:47 2006" 
+(date (date-value))              <span class=arw>&rarr;</span> "Wed May 24 10:02:47 2006"
+(date)                           <span class=arw>&rarr;</span> "Wed May 24 10:02:47 2006"
+</pre>
+</blockquote>
+
+<p>
+	The following function can be used 
+	to transform a <tt>date-value</tt>
+	back into a list:
+</p>
+
+<blockquote>
+<pre>
+(define (value-date val)
+  (append
+    (slice (now (+ (/ (date-value) -60) (/ val 60))) 0 5)
+    (list (% val 60)))) 
+
+(value-date 1014854400)  <span class=arw>&rarr;</span> (2002 2 28 0 0 0)
+</pre>
+</blockquote>
+
+<p>
+	See also <a HREF="#date">date</a>, <a HREF="#time-of-day">time-of-day</a>, 
+	<a HREF="#time">time</a>, and <a HREF="#now">now</a>.
+</p>
+
+<br /><br />
+
+<a NAME="debug"></a>
+<h2><span class="function">debug</span></h2>
+<b>syntax: (debug <em>func</em>)</b>
+
+<p>
+	Calls <a HREF="#trace">trace</a> and begins evaluating 
+	the user-defined function in <em>func</em>. 
+	<tt>debug</tt> is a shortcut for executing <tt>(trace true)</tt>, 
+	then entering the function to be debugged.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; instead of doing
+(trace true)
+(my-func a b c)
+(trace nil)
+
+;; use debug as a shortcut
+(debug (my-func a b c))
+</pre>
+</blockquote>
+
+<p>
+	See also the <a HREF="#trace">trace</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="dec"></a>
+<h2><span class="function">dec</span></h2>
+<b>syntax: (dec <em>sym</em> [<em>num</em>])</b>
+
+<p>
+	The number in <em>sym</em> is decremented by one 
+	(or the optional number <em>num</em>) and returned. 
+	<tt>dec</tt> performs mixed integer and floating point 
+	arithmetic according to the rules outlined below.
+</p>
+
+<p>
+	If <em>sym</em> contains a float and <tt>num</tt> is absent, 
+	the input argument is truncated to an integer.
+</p>
+
+<p>
+	Integer calculations (without <em>num</em>) resulting in numbers 
+	greater than 9,223,372,036,854,775,807 wrap around to negative numbers. 
+	Results smaller than -9,223,372,036,854,775,808 wrap around to positive numbers.
+</p>
+
+<p>
+	If <em>num</em> is supplied, <tt>dec</tt> 
+	always returns the result as a floating point number
+	(even for integer arguments).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 10)    <span class=arw>&rarr;</span> 10
+(dec 'x)       <span class=arw>&rarr;</span> 9
+x              <span class=arw>&rarr;</span> 9
+(dec 'x 0.25)  <span class=arw>&rarr;</span> 8.75
+x              <span class=arw>&rarr;</span> 8.75
+</pre>
+</blockquote>
+
+<p>
+	Use the <a HREF="#inc">inc</a> function to increment numbers.
+</p>
+
+<br /><br />
+
+<a NAME="define"></a>
+<h2><span class="function">define</span></h2>
+<b>syntax: (define (<em>sym-name</em> [<em>sym-param-1</em> ... ]) [<em>body-1</em> ... ])</b><br />
+<!-- 8.9.4 -->
+<b>syntax: (define (<em>sym-name</em> [(<em>sym-param-1</em> <em>exp-default</em>) ... ]) [<em>body-1</em> ... ])</b>
+<br />
+
+
+<b>syntax: (define <em>sym-name</em> <em>exp</em> )</b>
+
+<p>
+	Defines the new function <em>sym-name</em>, 
+	with optional parameters <em>sym-param-1</em>&mdash;. 
+	<tt>define</tt> is equivalent to assigning 
+	a lambda expression to <em>sym-name</em>. 
+	When calling a defined function, 
+	all arguments are evaluated and assigned 
+	to the variables in <em>sym-param-1</em>&mdash;, 
+	then the <em>body-1&mdash;	</em> expressions are evaluated. 
+	When a function is defined, the lambda expression 
+	bound to <em>sym-name</em> is returned.
+</p>
+
+<p>
+	All parameters defined are optional. 
+	When a user-defined function is called without arguments, 
+	those parameters assume the value <tt>nil</tt>. 
+<!-- 8.9.4 -->If those parameters have a default value 
+	specified in <em>exp-default</em>,
+	they assume that value.
+</p>
+
+<p>
+	The return value of <tt>define</tt> 
+	is the assigned <em>lambda</em> expression. 
+	When calling a user-defined function, 
+	the return value is the last expression evaluated 
+	in the function body.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (area x y) (* x y))  <span class=arw>&rarr;</span> (lambda (x y) (* x y))
+(area 2 3)                   <span class=arw>&rarr;</span> 6
+</pre>
+</blockquote>
+
+<p>
+	As an alternative, <tt>area</tt> could be defined 
+	as a function without using <tt>define</tt>.
+</p>
+
+<blockquote>
+<pre>
+(set 'area (lambda (x y) (* x y))
+</pre>
+</blockquote>
+
+<p>
+	<em>lambda</em> or <em>fn</em> expressions may be used by themselves 
+	as <em>anonymous</em> functions without being defined as a symbol:
+</p>
+
+<blockquote>
+<pre>
+((lambda ( x y) (* x y)) 2 3)  <span class=arw>&rarr;</span> 6
+((fn ( x y) (* x y)) 2 3)      <span class=arw>&rarr;</span> 6
+</pre>
+</blockquote>
+
+<p>
+	<tt>fn</tt> is just a shorter form of writing <tt>lambda</tt>.
+</p>
+	
+<!-- 8.9.4 -->
+<p>
+	Parameters can have default values specified:
+</p>
+
+<blockquote>
+<pre>
+(define (foo (a 1) (b 2))
+  (list a b))
+    
+(foo)      <span class=arw>&rarr;</span> (1 2)
+(foo 3)    <span class=arw>&rarr;</span> (3 2)
+(foo 3 4)  <span class=arw>&rarr;</span> (3 4)
+</pre>
+</blockquote>
+
+<p>
+	Expressions in <em>exp-default</em> 
+	are evaluated in the function's
+	current environment.
+</p>
+
+<blockquote>
+<pre>
+(define-macro (foo (a 10) (b (div a 2))) 
+  (list a b))
+
+(foo)      <span class=arw>&rarr;</span> (10 5)
+(foo 30)   <span class=arw>&rarr;</span> (30 15)
+(foo 3 4)  <span class=arw>&rarr;</span> (3 4)
+</pre>
+</blockquote>
+
+<p>
+	The second version of <tt>define</tt> 
+	works like the <a HREF="#set">set</a> function.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define x 123)  <span class=arw>&rarr;</span>   123
+;; is equivalent to
+(set 'x 123)    <span class=arw>&rarr;</span>   123
+
+(define area (lambda ( x y) (* x y)))
+;; is equivalent to
+(set 'area (lambda ( x y) (* x y)))
+;; is equivalent to
+(define (area x y) (* x y))
+</pre>
+</blockquote>
+
+<p>
+	Trying to redefine a protected symbol will cause an error message.
+</p>
+
+<br /><br />
+
+
+<a NAME="define-macro"></a>
+<h2><span class="function">define-macro</span></h2>
+<b>syntax: (define-macro (<em>sym-name</em> [<em>sym-param-1</em> ... ]) <em>body</em>)</b><!-- 8.9.4 --><br />
+<b>syntax: (define-macro (<em>sym-name</em> [(<em>sym-param-1</em> <em>expr-default</em>) ... ]) <em>body</em>)</b>
+<p>
+	Defines the new macro <em>sym-name</em>, 
+	with optional arguments <em>sym-param-1</em>&mdash;. 
+	<tt>define-macro</tt> is equivalent to assigning 
+	a lambda-macro expression to a symbol. 
+	When a macro-defined function is called, 
+	arguments are assigned to the variables 
+	in <em>sym-param-1</em>&mdash;, 
+	without evaluating the arguments first. 
+	Then the <em>body</em> expressions are evaluated. 
+	When evaluating the <tt>define-macro</tt> function, 
+	the lambda-macro expression is returned.
+</p>
+	
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; use underscores on symbols
+(define-macro (my-setq _x _y) (set _x (eval _y))) 
+<span class=arw>&rarr;</span> (lambda-macro (_x _y) (set _x (eval _y)))
+
+(my-setq x 123)  <span class=arw>&rarr;</span> 123
+</pre>
+</blockquote>
+
+<p>
+	Macros in newLISP are similar to <tt>define</tt> functions, 
+	but they do <em>not</em> evaluate their arguments. 
+	New functions can be created to behave like built-in functions
+	that delay the evaluation of certain arguments. 
+	Since macros can access the arguments inside a parameter list, 
+	they can be used to create flow-control functions 
+	like those already built into newLISP.
+</p>
+<p>
+	All parameters defined are optional. 
+	When a macro is called without arguments, 
+	those parameters assume the value <tt>nil</tt>. 
+	<!-- 8.9.4 -->If those parameters have a default value 
+	specified in <em>exp-default</em>,
+	they assume that default value.
+</p>
+	
+<blockquote>
+<pre>
+(define-macro (foo (a 1) (b 2))
+  (list a b))
+    
+(foo)      <span class=arw>&rarr;</span> (1 2)
+(foo 3)    <span class=arw>&rarr;</span> (3 2)
+(foo 3 4)  <span class=arw>&rarr;</span> (3 4)
+</pre>
+</blockquote>
+
+<p>
+	Expressions in <em>exp-default</em> are evaluated 
+	in the function's current environment.
+</p>
+
+<blockquote>
+<pre>
+(define-macro (foo (a 10) (b (div a 2))) 
+  (list a b))
+
+(foo)      <span class=arw>&rarr;</span> (10 5)
+(foo 30)   <span class=arw>&rarr;</span> (30 15)
+(foo 3 4)  <span class=arw>&rarr;</span> (3 4)
+</pre>
+</blockquote>
+
+<p>
+	Note that in macros, the danger exists of passing a parameter 
+	with the same variable name as used in the macro definition. 
+	In this case, the macro internal variable would end up 
+	receiving <tt>nil</tt> instead of the intended value:
+</p>
+
+<blockquote>
+<pre>
+;; not a good definition!
+
+(define-macro (my-setq x y) (set x (eval y)))  
+
+;; symbol name clash for x
+
+(my-setq x 123)  <span class=arw>&rarr;</span> 123
+x                <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<p>
+	There are several methods that can be used 
+	to avoid this problem, known as <em>variable capture</em>,
+	and to write <em>hygienic</em> macros:
+</p>
+
+<ul>
+<li>
+	Prefix all macro variable names with an underscore character. 
+	Using this or a similar convention, 
+	the danger of symbol name clashes can be avoided.</li>
+
+<li>
+	Put the macro into its own lexically closed namespace context. 
+	If the function has the same name as the context, 
+	it can be called by using the context name alone. 
+	A function with this characteristic is called a 
+	<a href="#default_function"><em>default function</em></a>.
+</li>
+
+<li>
+	Use <a href="#args">args</a> to access 
+	arguments passed by the function.</li>
+
+</ul>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; a macro as a lexically isolated function
+;; avoiding variable capture in passed parameters
+
+(context 'my-setq)
+
+(define-macro (my-setq:my-setq x y) (set x (eval y)))  
+
+(context MAIN)
+
+(my-setq x 123)  <span class=arw>&rarr;</span> 123  ; no symbol clash
+</pre>
+</blockquote>
+
+<p>
+	The macro in the example is lexically isolated, 
+	and no variable capture can occur. 
+	Instead of the macro being called using <tt>(my-setq:my-setq &hellip;)</tt>, 
+	it can be called with just <tt>(my-setq &hellip;)</tt> 
+	because it is a <a href="#default_function"><em>default function</em></a>.
+</p>
+
+<p>
+	A third possibility is to refer to passed parameters 
+	using <a href="#args">args</a>:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; avoid variable capture in macros using the args function
+
+(define-macro (my-setq) (set (args 0) (eval (args 1))))
+</pre>
+</blockquote>
+
+<p>
+	The last example shows how <a href="#letex">letex</a> can be combined with 
+	<tt>define-macro</tt> to expand macro variables into an expression to be evaluated: </p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define-macro (dolist-while)
+  (letex (var (args 0 0)
+          lst (args 0 1)
+          cnd (args 0 2)
+          body (cons 'begin (1 (args))))
+    (let (res)
+      (catch (dolist (var lst)
+               (if (set 'res cnd) body (throw res)))))))
+
+&gt; (dolist-while (x '(a b c d e f) (!= x 'd)) (println x))
+<strong>a
+b
+c
+nil</strong>
+&gt;
+</pre>
+</blockquote>
+
+<p>
+	<tt>dolist-while</tt> loops through a list 
+	while the condition is true. 
+	Note that a similar feature is already built into 
+	<a href="#dolust">dolist</a> as a <em>break condition</em> 
+	optional parameter.
+</p>
+
+<p>
+	Also, the <a href="#expand">expand</a> function performs variable
+	expansion explicitly, without evaluating the expanded expression.
+</p>
+
+<br /><br />
+
+<a NAME="def-new"></a>
+<h2><span class="function">def-new</span></h2>
+<b>syntax: (def-new <em>sym-source</em> [<em>sym-target</em>])</b>
+
+<p>
+	This function works similarly to <a href="#new">new</a>, 
+	but it only creates a copy of one symbol 
+	and its contents from the symbol in <em>sym-source</em>. 
+	When <em>sym-target</em> is not given, 
+	a symbol with the same name is created 
+	in the current context. 
+	All symbols referenced inside <em>sym-source</em> 
+	will be translated into symbol references into the current context,
+    which must not be MAIN.</p>
+<p>
+	If an argument is present in <em>sym-target</em>, 
+	the copy will be made into a symbol and context 
+	as referenced by the symbol in <em>sym-target</em>. 
+	In addition to allowing renaming of the function while copying, 
+	this also enables the copy to be placed in a different context. 
+	All symbol references will be translated into symbol references 
+	of the target context.
+</p>
+
+<p>
+	<tt>def-new</tt> returns the symbol created:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+> (set 'foo:var '(foo:x foo:y))
+<b>(foo:x foo:y)</b>
+
+> (def-new 'foo:var 'ct:myvar)
+<b>ct:myvar</b>
+
+> ct:myvar
+<b>(ct:x ct:y)</b>
+
+> (context 'K)
+
+K> (def-new 'foo:var)
+<b>var</b>
+
+K> var
+<b>(x y)</b>
+</pre>
+</blockquote>
+
+<p>
+	The function <tt>def-new</tt> can be used to configure contexts 
+	or context objects in a more granular fashion than is possible 
+	with <a href="#new">new</a>, which copies a whole context.
+</p>
+
+<br /><br />
+
+<a NAME="default"></a>
+<h2><span class="function">default</span></h2>
+<b>syntax: (default <em>context</em>)</b> <br />
+
+<p>Returns the default functor of a context. The <em>default functor</em> is the
+symbol which carries the same name as the context it belongs to:</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'foo:foo '(a b c d e f))
+
+(set 'ctx foo)
+
+(default foo) <span class=arw>&rarr;</span> foo:foo
+(default ctx) <span class=arw>&rarr;</span> foo:foo
+
+(sort (eval (default ctx)) >) 
+
+foo:foo <span class=arw>&rarr;</span> (f e d c b a)
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="delete"></a>
+<h2><span class="function">delete</span></h2>
+<b>syntax: (delete <em>symbol</em> [<em>bool</em>])</b> <br />
+
+<b>syntax: (delete <em>sym-context</em> [<em>bool</em>])</b>
+
+<p>
+	Deletes a symbol, <em>symbol</em>, or a context in <em>sym-context</em> 
+	with all contained symbols from newLISP's symbol table. 
+	References to the symbol will be changed to <tt>nil</tt>. 
+	When the expression in <em>bool</em> evaluates 
+	to <tt>true</tt> or anything other than <tt>nil</tt>, 
+	symbols are only deleted when they are not referenced.
+</p>
+
+<p>
+	Protected symbols of built-in functions and special symbols 
+	like <tt>nil</tt> and <tt>true</tt> cannot be deleted.
+</p>
+
+<p>
+	<tt>delete</tt> returns <tt>true</tt> if the symbol was deleted, 
+	else it returns <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'lst '(a b aVar c d))
+
+(delete 'aVar)  ; aVar deleted, references marked nil
+
+lst  <span class=arw>&rarr;</span> (a b nil c d)
+
+(set 'lst '(a b aVar c d))
+
+(delete 'aVar true)  
+<span class=arw>&rarr;</span> nil ; protect aVar if referenced
+
+lst  <span class=arw>&rarr;</span> (a b aVar c d)
+
+(set 'foo:x 123)
+(set 'foo:y "hello")
+
+;; in contexts, the quote may be omitted
+(delete foo)  <span class=arw>&rarr;</span> foo:x, foo:y deleted
+</pre>
+</blockquote>
+
+<p>In the last example only the symbols inside context <tt>foo</tt>
+will be deleted but not the context symbol <tt>foo</tt> itself. It
+will be converted to a normal unprotected symbol and contain <tt>nil</tt>.
+</p>
+
+<p>
+	Note that deleting a symbol that is part of a function 
+	which is currently executing can crash the system 
+	or have other unforeseen effects.
+</p>
+
+
+<br /><br />
+
+
+<a NAME="delete-file"></a>
+<h2><span class="function">delete-file</span></h2>
+<b>syntax: (delete-file <em>str-file-name</em>)</b>
+
+<p>
+	Deletes a file given in <em>str-file-name</em>. 
+	Returns <tt>true</tt> or <tt>nil</tt> depending 
+	on the outcome of the delete operation.
+</p>
+
+<p>The file name can be given as a URL.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(delete-file "junk")
+
+(delete-file "http://asite.com/example.html")
+</pre>
+</blockquote>
+<p>
+The first example deletes the file <tt>junk</tt> in the current directory.
+The second example shows how to use a URL to specify the file. 
+In this form, additional parameters can be given. 
+See <a href="#delete-url">delete-url</a> for details.
+</p>
+
+<br /><br />
+
+<a NAME="destroy"></a>
+<h2><span class="function">destroy</span></h2>
+<b>syntax: (destroy <em>int-pid</em>)</b>
+
+<p>Destroys a process with process id in <em>int-pid</em> and returns <tt>true</tt>
+on success or <tt>nil</tt> on failure. The process id is obtained from a previous 
+call to <a href="#fork">fork</a> on Mac OS X and other UNIX or <a href="#process">process</a>.
+on all platforms.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'pid (process "/usr/bin/bc" bcin bcout)) 
+(destroy pid)
+
+(set 'pid (fork (dotimes (i 1000) (println i) (sleep 10))))
+(sleep 100) (destroy pid)
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="det"></a>
+<h2><span class="function">det</span></h2>
+<b>syntax: (det <em>matrix</em>)</b>
+
+<p>
+	Returns the determinant of a square matrix.
+	A matrix can either be a nested list 
+	or an <a href="#array">array</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'A '((-1 1 1) (1 4 -5) (1 -2 0)))
+
+(det A)  <span class=arw>&rarr;</span> -1
+</pre>
+</blockquote>
+
+<p>
+	If the matrix is singular, 
+	<tt>nil</tt> is returned.
+</p>
+
+
+<p>See also the other matrix operations 
+<a href="#invert">invert</a>, <a href="#mat">mat</a>, 
+<a href="#multiply">multiply</a> and <a href="#transpose">transpose</a>.
+</p>
+
+<br />
+
+<a NAME="device"></a>
+<h2><span class="function">device</span></h2>
+<b>syntax: (device [<em>int</em>])</b>
+
+<p>
+	<em>int</em> is an I/O device number, which is 0 (zero) 
+	for the default STD I/O console window. 
+	<em>int</em> may also be a file handle 
+	previously obtained using <a href="#open">open</a>. 
+	When no argument is supplied, 
+	the current I/O device number is returned. 
+	The I/O channel specified by <tt>device</tt> 
+	is used internally by the functions 
+	<a HREF="#print">print</a> and <a HREF="#read-line">read-line</a>. 
+	When the current I/O device is 0 (zero), <a HREF="#print">print</a> 
+	sends output to the console window and <a HREF="#read-line">read-line</a> 
+	accepts input from the keyboard. 
+	If the current I/O device has been set by opening a file, 
+	then <a HREF="#print">print</a> and <a HREF="#read-line">read-line</a> work on that file.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(device (open "myfile" "write"))  <span class=arw>&rarr;</span> 5
+(print "This goes in myfile")     <span class=arw>&rarr;</span> "This goes in myfile"
+(close (device))                  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<p>
+	Note that using <a HREF="#close">close</a> on <tt>device</tt> 
+	automatically resets <tt>device</tt> to 0 (zero).
+</p>
+
+<br /><br />
+
+<a NAME="delete-url"></a>
+<h2><span class="function">delete-url</span></h2>
+<b>syntax: (delete-file <em>str-url</em>)</b>
+
+<p>This function deletes the file 
+on a remote HTTP server 
+specified in <em>str-url</em>.
+The HTTP <tt>DELETE</tt> protocol 
+must be enabled on the target web server, 
+or an error message string may be returned. 
+The target file must also have  
+access permissions set accordingly.
+Additional parameters such as timeout and custom headers 
+are available exactly as in the 
+<a href="#get-url">get-url</a> function.</p>
+
+<p>This feature is also available when the <a href="#delete-file">delete-file</a>
+function is used and a URL is specified for the filename.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(delete-url "http://www.aserver.com/somefile.txt")
+(delete-url "http://site.org:8080/page.html" 5000)
+</pre>
+</blockquote>
+
+<p>The second example configures a timeout option of five seconds. 
+Other options such as special HTTP protocol headers 
+can be specified, as well. 
+See the <a href="#get-url">get-url</a> function for details.</p>
+
+<br /><br />
+
+<a NAME="difference"></a>
+<h2><span class="function">difference</span></h2>
+<b>syntax: (difference <em>list-A</em> <em>list-B</em>)</b><br />
+<b>syntax: (difference <em>list-A</em> <em>list-B</em> <em>bool</em>)</b>
+
+<p>
+	In the first syntax, <tt>difference</tt> returns 
+	the <em>set</em> difference between <em>list-A</em> and <em>list-B</em>. 
+	The resulting list only has elements occurring in <em>list-A</em>, 
+	but not in <em>list-B</em>. 
+	All elements in the resulting list are unique, 
+	but <em>list-A</em> and <em>list-B</em> need not be unique. 
+	Elements in the lists can be any type of LISP expression.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(difference '(2 5 6 0 3 5 0 2) '(1 2 3 3 2 1))  <span class=arw>&rarr;</span> (5 6 0)
+</pre>
+</blockquote>
+
+<p>
+	In the second syntax, <tt>difference</tt> works in <em>list</em> mode. 
+	<em>bool</em> specifies <tt>true</tt> 
+	or an expression not evaluating to <tt>nil</tt>. 
+	In the resulting list, all elements of <em>list-B</em> 
+	are eliminated in <em>list-A</em>, 
+	but duplicates of other elements in <em>list-A</em> are left.
+</p>
+<b>example:</b>
+<blockquote>
+<pre>
+(difference '(2 5 6 0 3 5 0 2) '(1 2 3 3 2 1) true)  <span class=arw>&rarr;</span> (5 6 0 5 0)
+</pre>
+</blockquote>
+
+
+<p>
+	See also the set functions <a HREF="#intersect">intersect</a> 
+	and <a HREF="#unique">unique</a>.
+</p>
+
+<br /><br />
+
+<a NAME="directory"></a>
+<h2><span class="function">directory</span></h2>
+<b>syntax: (directory [<em>str-path</em>])</b><br />
+<b>syntax: (directory <em>str-path</em> <em>str-pattern</em> [<em>int-option</em>])</b>
+
+<p>
+	A list of directory entry names is returned 
+	for the directory path given in <em>str-path</em>. 
+	On failure, <tt>nil</tt> is returned. 
+	When <em>str-path</em> is omitted, 
+	the list of entries in the current directory is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(directory "/bin")
+
+(directory "c:/")
+</pre>
+</blockquote>
+
+<p>
+	The first example returns the directory of <tt>/bin</tt>, 
+	the second line returns a list of directory entries 
+	in the root directory of drive C:. 
+	Note that on Win32 systems, 
+	a forward slash (<tt>/</tt>) can be included in path names. 
+	When used, a backslash (<tt>\</tt>) must be 
+	preceded by a second backslash.
+</p>
+
+<p>
+	In the second syntax, <tt>directory</tt> can take 
+	a regular expression pattern in <em>str-pattern</em>. 
+	Only filenames matching the pattern will be returned 
+	in the list of directory entries. 
+	In <em>int-options</em>, special regular expression options 
+	can be specified; see <a href="#regex">regex</a> for details.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(directory "." "\\.c")  <span class=arw>&rarr;</span> ("foo.c" "bar.c")
+;; or using braces as string pattern delimiters
+(directory "." {\.c})  <span class=arw>&rarr;</span> ("foo.c" "bar.c")
+
+; show only hidden files (starting with dot)
+(directory "." "^[.]")   <span class=arw>&rarr;</span> ("." ".." ".profile" ".rnd" ".ssh")</pre>
+</blockquote>
+
+<p>
+	The regular expression forces <tt>directory</tt> 
+	to return only file names containing the string <tt>".c"</tt>.
+</p>
+
+<p>
+	Other functions that use regular expressions 
+	are <a href="#find">find</a>, <!-- 8.9.4 --><a href="#find-all">find-all</a>,
+	<a href="#parse">parse</a>, 
+	<a HREF="#regex">regex</a>, <a href="#replace">replace</a>, 
+	and <a href="#search">search</a>.
+</p>
+
+
+<br /><br />
+
+<a NAME="directoryp"></a>
+<h2><span class="function">directory?</span></h2>
+<b>syntax: (directory? <em>str-path</em>)</b>
+
+<p>
+	Checks if <em>str-path</em> is a directory. 
+	Returns <tt>true</tt> or <tt>nil</tt> depending on the outcome.
+</p>
+
+<blockquote>
+<pre>
+(directory? "/etc")            <span class=arw>&rarr;</span> true
+(directory? "/usr/bin/emacs/")  <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="div"></a>
+<h2><span class="function">div</span></h2>
+<b>syntax: (div <em>num-1</em> <em>num-2</em> [<em>num-3</em> ... ])</b><br />
+<b>syntax: (div <em>num-1</em>)</b>
+
+<p>
+	Successively divides <em>num-1</em>
+	by the number in <em>num-2&mdash;</em>. 
+	<tt>div</tt> can perform mixed-type arithmetic, 
+	but it always returns floating point numbers. 
+	Any floating point calculation 
+	with <tt>NaN</tt> also returns <tt>NaN</tt>.
+</p>
+	
+
+<b>example:</b>
+<blockquote>
+<pre>
+(div 10 3)                 <span class=arw>&rarr;</span> 3.333333333
+(div 120 (sub 9.0 6) 100)  <span class=arw>&rarr;</span> 0.4
+
+(div 10)                   <span class=arw>&rarr;</span> 0.1
+</pre>
+</blockquote>
+
+<p>
+	When <em>num-1</em> is the only argument,
+	<tt>div</tt> calculates the inverse of <em>num-1</em>.
+</p>
+
+<br /><br />
+
+<a NAME="doargs"></a>
+<h2><span class="function">doargs</span></h2>
+<b>syntax: (doargs (<em>sym</em> [<em>exp-break</em>])<em> body</em>)</b>
+
+<p>Iterates through all members of the argument list 
+inside a user-defined function or macro. This function or macro can be defined using <a href="#define">define</a>, 
+<a href="#define-macro">define-macro</a>, <a href="#lambda">lambda</a>, or
+<a href="#lambda-macro">lambda-macro</a>.
+The variable in <em>sym</em> 
+is set sequentially to all members in the argument list 
+until the list is exhausted 
+or an optional break expression 
+(defined in <em>exp-break</em>) 
+evaluates to <tt>true</tt> or a logical true value. 
+The <tt>doargs</tt> expression always returns 
+the result of the last evaluation.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (foo)
+    (doargs (i) (println i)))
+
+<b>&gt;</b> (foo 1 2 3 4 5)
+<b>1
+2
+3
+4
+5</b>
+</pre>
+</blockquote>
+
+<p>The optional break expression causes <tt>doargs</tt> 
+to interrupt processing of the arguments:</p>
+
+<blockquote>
+<pre>
+(define-macro (foo)
+    (doargs (i (= i 'x)) 
+        (println i)))
+
+<b>&gt;</b> (foo a b c x e f g)
+<b>a
+b
+c
+true</b>
+</pre>
+</blockquote>
+
+<p>Use the <a href="#args">args</a> function 
+to access the entire argument list at once.</p>
+
+<br /><br />
+
+<a NAME="dolist"></a>
+<h2><span class="function">dolist</span></h2>
+<b>syntax: (dolist (<em>sym  list</em> [<em>exp-break</em>])<em> body</em>)</b>
+
+<p>
+	The expressions in <em>body</em> are evaluated 
+	for each element in <em>list</em>. 
+	The variable in <em>sym</em> is set to each of the elements 
+	before evaluation of the body expressions. 
+	The variable used as loop index is local 
+	and behaves according to the rules of dynamic scoping.
+</p>
+
+<p>
+	Optionally, a condition for early loop exit 
+	may be defined in <em>exp-break</em>. 
+	If the break expression evaluates to any non-<tt>nil</tt> value, 
+	the <tt>dolist</tt> loop returns with the value of <em>exp-break</em>. 
+	The break condition is tested before evaluating <em>body.</em></p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 123)
+(dolist (x '(a b c d e f g))  ; prints: abcdefg
+    (print x))  <span class=arw>&rarr;</span> g          ; return value
+
+(dolist (x '(a b c d e f g) (= x 'e))  ; prints: abcd
+    (print x))
+
+;; x is local in dolist
+;; x has still its old value outside the loop
+
+x  <span class=arw>&rarr;</span> 123  ; x has still its old value
+</pre>
+</blockquote>
+
+<p>
+	This example prints <tt>abcdefg</tt> in the console window. 
+	After the execution of <tt>dolist</tt>,
+	the value for <tt>x</tt> remains unchanged 
+	because the <tt>x</tt> in <tt>dolist</tt> has local scope. 
+	The return value of <tt>dolist</tt> is the result 
+	of the last evaluated expression.
+</p>
+
+<p>
+	The internal system variable <tt>$idx</tt> 
+	keeps track of the current offset 
+	into the list passed to <tt>dolist</tt>,
+	and it can be accessed during its execution:
+</p>
+
+<blockquote>
+<pre>
+(dolist (x '(a b d e f g))
+  (println $idx ":" x))  <span class=arw>&rarr;</span> g
+
+<b>0:a
+1:b
+2:d
+3:e
+4:f
+5:g</b>
+</pre>
+</blockquote>
+
+<p>
+	The console output is shown in boldface. 
+	<tt>$idx</tt> is protected and cannot be changed by the user.
+</p>
+
+<br /><br />
+
+<a NAME="dostring"></a>
+<h2><span class="function">dostring</span></h2>
+<b>syntax: (dostring (<em>sym  string</em> [<em>exp-break</em>])<em>body</em>)</b>
+
+<p>
+	The expressions in <em>body</em> are evaluated 
+	for each character in <em>string</em>. 
+	The variable in <em>sym</em> is set to each ASCII or UTF-8 integer value of the characters 
+	before evaluation of the body expressions. 
+	The variable used as loop index is local 
+	and behaves according to the rules of dynamic scoping.
+</p>
+
+<p>
+	Optionally, a condition for early loop exit 
+	may be defined in <em>exp-break</em>. 
+	If the break expression evaluates to any non-<tt>nil</tt> value, 
+	the <tt>dolist</tt> loop returns with the value of <em>exp-break</em>. 
+	The break condition is tested before evaluating <em>body.</em>
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'str "abcdefg")
+(dostring (c str) 
+	(println i))
+<b>97
+98
+99
+100
+101
+102
+103</b>
+</pre>
+</blockquote>
+
+<p>
+	This example prints prints the value of each character
+    in the console window. In UTF-8 enabled versions of newLISP
+    individual characters may be longer than one byte and the
+    number in the loop variable may exceed 255.
+	The return value of <tt>dostring</tt> is the result 
+	of the last evaluated expression.
+</p>
+
+<p>
+	The internal system variable <tt>$idx</tt> 
+	keeps track of the current offset 
+	into the list passed to <tt>dostring</tt>,
+	and it can be accessed during its execution.
+</p>
+<br></br>
+
+<a NAME="dotimes"></a>
+<h2><span class="function">dotimes</span></h2>
+<b>syntax: (dotimes (<em>sym-var</em> <em>int-count</em> [<em>exp-break</em>]) <em>body</em>)</b>
+
+<p>
+	The expressions in <em>body</em> are evaluated <em>int</em> times. 
+	The variable in <em>sym</em> is set from 0 (zero) to (<em>int</em> - 1) 
+	each time before evaluating the body expression(s). 
+	The variable used as the loop index is local to the <tt>dotimes</tt> 
+	expression and behaves according the rules of dynamic scoping. 
+	The loop index is of integer type. 
+	<tt>dotimes</tt> returns the result of 
+	the last expression evaluated in <em>body</em>.
+</p>
+
+<p>
+	Optionally, a condition for early loop exit 
+	may be defined in <em>exp-break</em>. 
+	If the break expression evaluates to any non-<tt>nil</tt> value, 
+	the <tt>dotimes</tt> loop returns with the value of <em>exp-break</em>. 
+	The break condition is tested before evaluating <em>body</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(dotimes (x 10)
+  (print x))  <span class=arw>&rarr;</span> 9  ; return value
+</pre>
+</blockquote>
+
+<p>
+	This prints <tt>0123456789</tt> to the console window.
+</p>
+
+<br /><br />
+
+<a NAME="dotree"></a>
+<h2><span class="function">dotree</span></h2>
+<b>syntax: (dotree (<em>sym-context</em>) <em>body</em>)</b>
+
+<p>
+	The expressions in <em>body</em> are evaluated 
+	for all symbols in <em>sym-context</em>. 
+	The symbols are accessed in a sorted order.
+	Before each evaluation of the body expression(s),
+	the variable in <em>sym</em> is set 
+	to the next symbol from <em>sym-context</em>. 
+	The variable used as the loop index is local 
+	to the <tt>dotree</tt> expression 
+	and behaves according the rules of dynamic scoping. 
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; faster and less memory overhead
+(dotree (s 'SomeCTX) (print s " ")) 
+
+;; the quote can be omitted
+(dotree (s SomeCTX) (print s " "))
+
+;; slower and more memory usage
+(dolist (s (symbols 'SomeCTX)) (print s " "))
+</pre>
+</blockquote>
+
+<p>
+	This example prints the names of all symbols inside SomeCTX to the console window.
+</p>
+
+<br /><br />
+
+<a NAME="do-until"></a>
+
+<h2><span class="function">do-until</span></h2>
+<b>syntax: (do-until <em>exp-condition body</em>)</b>
+
+<p>
+	The expressions in <em>body</em> are evaluated 
+	before <em>exp-condition</em> is evaluated. 
+	If the evaluation of <em>exp-condition</em> is not <tt>nil</tt>, 
+	then the <tt>do-until</tt> expression is finished; 
+	otherwise, the expressions in <em>body</em> get evaluated again. 
+	Note that <tt>do-until</tt> evaluates the conditional expression 
+	<em>after</em> evaluating the body expressions, 
+	whereas <a href="#until">until</a> checks the condition 
+	<em>before</em> evaluating the body. 
+	The return value of the <tt>do-until</tt> expression 
+	is the last evaluation of the <em>body</em> expression.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 1)
+(do-until (= x 1) (inc 'x))
+x  <span class=arw>&rarr;</span> 2
+
+(set 'x 1)
+(until (= x 1) (inc 'x))
+x  <span class=arw>&rarr;</span> 1
+</pre>
+</blockquote>
+
+<p>
+	While <tt>do-until</tt> goes through the loop at least once, 
+	<a href="#until">until</a> never enters the loop.
+</p>
+
+<p>
+	See also the functions <a href="#while">while</a> 
+	and <a href="#do-while">do-while</a>.
+</p>
+
+<br /><br />
+
+<a NAME="do-while"></a>
+<h2><span class="function">do-while</span></h2>
+<b>syntax: (do-while <em>exp-condition body</em>)</b>
+
+<p>
+	The expressions in <em>body</em> are evaluated 
+	before <em>exp-condition</em> is evaluated. 
+	If the evaluation of <em>exp-condition</em> is <tt>nil</tt>, 
+	then the <tt>do-while</tt> expression is finished; 
+	otherwise the expressions in <em>body</em> get evaluated again. 
+	Note that <tt>do-while</tt> evaluates the conditional expression 
+	<em>after</em> evaluating the body expressions, 
+	whereas <a href="#while">while</a> checks the condition 
+	<em>before</em> evaluating the body. 
+	The return value of the <tt>do-while</tt> expression 
+	is the last evaluation of the <em>body</em> expression.
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 10)
+(do-while (&lt; x 10) (inc 'x))
+x  <span class=arw>&rarr;</span> 11
+
+(set 'x 10)
+(while (&lt; x 10) (inc 'x)) 
+x  <span class=arw>&rarr;</span> 10
+</pre>
+</blockquote>
+
+<p>
+	While <tt>do-while</tt> goes through the loop at least once, 
+	<a href="#while">while</a> never enters the loop.
+</p>
+
+<p>
+	See also the functions <a href="#until">until</a> 
+	and <a  href="#do-until">do-until</a>.
+</p>
+
+<br /><br />
+
+<a name="dump"></a>
+<h2><span class="function">dump</span></h2>
+<b>syntax: (dump [<em>exp</em>])</b>
+
+<p>
+	Shows the binary contents of a newLISP cell. 
+	Without an argument, this function outputs 
+	a listing of all LISP cells to the console. 
+	When <em>exp</em> is given, 
+	it is evaluated and the contents 
+	of a LISP cell are returned in a list.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(dump 'a)   <span class=arw>&rarr;</span> (9586996 5 9578692 9578692 9759280)
+
+(dump 999)  <span class=arw>&rarr;</span> (9586996 130 9578692 9578692 999)
+</pre>
+</blockquote>
+
+<p>
+	The list contains the following memory addresses and information:
+</p>
+
+<pre>
+    (0) memory address of the LISP cell
+    (1) cell-&gt;type: mayor/minor type, see newlisp.h for details
+    (2) cell-&gt;next: linked list ptr
+    (3) cell-&gt;aux: 
+                    string length+1 or 
+                    low (little endian) or high (big endian) word of 64-bit integer or
+                    low word of IEEE 754 double float
+    (4) cell-&gt;contents: 
+                    string/symbol address or 
+                    high (little endian) or low (big endian) word of 64-bit integer or
+                    high word of IEEE 754 double float
+</pre>
+
+<p>
+	This function is valuable for changing type bits in cells 
+	or hacking other parts of newLISP internals. 
+	See the function <a href="#cpymem">cpymem</a> 
+	for a comprehensive example.
+</p>
+
+<br /><br />
+
+
+<a NAME="dup"></a>
+<h2><span class="function">dup</span></h2>
+
+<b>syntax: (dup <em>exp</em> <em>int-n</em> [<em>bool</em>])</b><br/>
+<b>syntax: (dup <em>exp</em>)</b>
+
+<p>
+	If the expression in <em>exp</em> evaluates to a string, 
+	it will be replicated <em>int-n</em> times within a string and returned. 
+	When specifying an expression evaluating 
+	to anything other than <tt>nil</tt> in <em>bool</em>, 
+	the string will not be concatenated 
+	but replicated in a list like any other data type.
+</p>
+
+<p>
+	If <em>exp</em> contains any data type other than string, 
+	the returned list will contain <em>int-n</em> evaluations of <em>exp</em>.
+</p>
+
+<p>Without the repetition parameter <tt>dup</tt> assumes 2.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(dup "A" 6)       <span class=arw>&rarr;</span> "AAAAAA"
+(dup "A" 6 true)  <span class=arw>&rarr;</span> ("A" "A" "A" "A" "A" "A")
+(dup "A" 0)       <span class=arw>&rarr;</span> ""
+(dup "AB" 5)      <span class=arw>&rarr;</span> "ABABABABAB"
+(dup 9 7)         <span class=arw>&rarr;</span> (9 9 9 9 9 9 9)
+(dup 9 0)         <span class=arw>&rarr;</span> ()
+(dup 'x 8)        <span class=arw>&rarr;</span> (x x x x x x x x)
+(dup '(1 2) 3)    <span class=arw>&rarr;</span> ((1 2) (1 2) (1 2))
+(dup "\000" 4)    <span class=arw>&rarr;</span> "\000\000\000\000"
+
+(dup "*")         <span class=arw>&rarr;</span> "**"
+</pre>
+</blockquote>
+
+<p>
+	The last example shows handling of binary information, 
+	creating a string filled with four binary zeroes.
+</p>
+
+<p>
+	See also the functions <a href="#sequence">sequence</a> 
+	and <a href="#series">series</a>.
+</p>
+
+<br /><br />
+
+<a NAME="emptyp"></a>
+<h2><span class="function">empty?</span></h2>
+<b>syntax: (empty? <em>exp</em>)</b><br />
+<b>syntax: (empty? <em>str</em>)</b>
+
+
+<p>
+	<em>exp</em> is tested for an empty list 
+	(or <em>str</em> for an empty string). 
+	Depending on whether the argument contains elements, 
+	<tt>true</tt> or <tt>nil</tt> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'var '())
+(empty? var)         <span class=arw>&rarr;</span> true
+(empty? '(1 2 3 4))  <span class=arw>&rarr;</span> nil
+(empty? "hello")     <span class=arw>&rarr;</span> nil
+(empty? "")          <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<p>
+	The first example checks a list, 
+	while the second two examples check a string.
+</p>
+
+<br /><br />
+
+<a NAME="encrypt"></a>
+<h2><span class="function">encrypt</span></h2>
+<b>syntax: (encrypt <em>str-source</em> <em>str-pad</em>)</b>
+
+<p>
+	Performs a one-time&ndash;pad encryption of <em>str-source</em> 
+	using the encryption pad in <em>str-pad</em>. 
+	The longer <em>str-pad</em> is 
+	and the more random the bytes are, 
+	the safer the encryption. 
+	If the pad is as long as the source text, 
+	is fully random, and is used only once, 
+	then one-time&ndash;pad encryption 
+	is virtually impossible to break, 
+	since the encryption seems to contain only random data. 
+	To retrieve the original, 
+	the same function and pad 
+	are applied again to the encrypted text:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'secret 
+  (encrypt "A secret message" "my secret key")) 
+<span class=arw>&rarr;</span> ",YS\022\006\017\023\017TM\014\022\n\012\030E"
+
+(encrypt secret "my secret key")  <span class=arw>&rarr;</span> "A secret message"
+</pre>
+</blockquote>
+
+<p>
+	The second example encrypts a whole file:
+</p>
+
+<blockquote>
+
+<pre>
+(write-file "myfile.enc" 
+  (encrypt (read-file "myfile") "29kH67*"))
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="ends-with"></a>
+<h2><span class="function">ends-with</span></h2>
+<!-- 8.9.4 -->
+<b>syntax: (ends-with <em>str-data</em> <em>str-key</em> [<em>option</em>] )</b><br />
+<!-- 8.9.0
+<b>syntax: (ends-with <em>str-data str-key</em> [<em>bool</em>] )</b><br /> -->
+<b>syntax: (ends-with <em>list</em> <em>exp</em>)</b>
+
+<p>
+	In the first syntax, <tt>ends-with</tt> tests 
+	the string in <em>str-data</em> to see if it
+	ends with the string specified in <em>str-key</em>. 
+	It returns <tt>true</tt> or <tt>nil</tt> 
+	depending on the outcome. </p>
+<p>
+	When <tt>nil</tt> or any expression evaluating to nil 
+	as a third parameter in <em>bool</em> is specified, 
+	the comparison is case-insensitive.
+</p>
+	
+<!-- 8.9.4 -->
+<p>If a regular expression <em>option</em> number is 
+specified <em>str-key</em> contains a regular expression pattern. See
+<a href="#regex">regex</a> for valid numbers for <em>option</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(ends-with "newLISP" "LISP")         <span class=arw>&rarr;</span> true
+(ends-with "newLISP" "lisp")         <span class=arw>&rarr;</span> nil
+(ends-with "newLISP" "lisp" nil)     <span class=arw>&rarr;</span> true
+<!-- 8.9.4 -->;; use regular espressions
+(ends-with "newLISP" "lisp|york" 1)  <span class=arw>&rarr;</span> true
+
+</pre>
+</blockquote>
+
+<p>
+	In the second syntax, 
+	<tt>ends-with</tt> checks if a list 
+	ends with the list element in <em>exp</em>. 
+	<tt>true</tt> or <tt>nil</tt> is returned depending on outcome.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(ends-with '(1 2 3 4 5) 5)             <span class=arw>&rarr;</span> true
+(ends-with '(a b c d e) 'b)            <span class=arw>&rarr;</span> nil
+(ends-with '(a b c (+ 3 4)) '(+ 3 4))  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<p>
+	The last example shows that <em>exp</em> could be a list by itself.
+</p>
+
+<p>
+	See also the <a HREF="#starts-with">starts-with</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="env"></a>
+
+<h2><span class="function">env</span></h2>
+<b>syntax: (env)</b><br />
+<b>syntax: (env <em>var-str</em>)</b><br />
+<b>syntax: (env <em>var-str</em> <em>value-str</em>)</b>
+
+<p>
+	In the first syntax (without arguments), 
+	the operating system's environment is 
+	retrieved as a list in which each entry is a string.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(env)  <span class=arw>&rarr;</span> ("PATH=/bin:/usr/bin:/sbin" "USER=LUTZ")
+</pre>
+</blockquote>
+
+<p>
+	In the second syntax, 
+	the name of an environment variable 
+	is given in <em>var-str</em>. 
+	<tt>env</tt> returns the value 
+	of the variable or <tt>nil</tt> 
+	if the variable does not exist 
+	in the environment.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(env "PATH")  <span class=arw>&rarr;</span> "/bin:/usr/bin:/usr/local/bin"
+</pre>
+</blockquote>
+
+<p>
+The third syntax (variable name in <em>var-str</em> 
+and value pair in <em>value-str</em>) sets or creates 
+an environment variable. If <em>value-str</em> is the 
+empty string <tt>""</tt>, then the variable is completely
+removed from the environment except when running on Solaris,
+wjere the variable stays with an empty string.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(env "NEWLISPBIN" "/usr/bin/")  <span class=arw>&rarr;</span> true
+(env "NEWLISPBIN")              <span class=arw>&rarr;</span> "/usr/bin/"
+(env "NEWLISPBIN" "")           <span class=arw>&rarr;</span> true
+(env "NEWLISPBIN")              <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<p>
+	<tt>env</tt> replaces the deprecated <tt>environ</tt>, 
+	<tt>getenv</tt>, and <tt>putenv</tt> functions.
+</p>
+
+<br /><br />
+
+<a NAME="erf"></a>
+<h2><span class="function">erf</span></h2>
+<b>syntax: (erf <em>num</em>)</b>
+
+<p>
+	<tt>erf</tt> calculates the error function 
+	of a number in <em>num</em>. 
+	The error function is defined as:
+</p>
+
+<blockquote>
+<b><em>erf (x) = 2/sqrt(pi) * integral from 0 to x of exp(-t^2) dt</em></b>
+</blockquote>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(map erf (sequence 0.0 6.0 0.5))
+<span class=arw>&rarr;</span> 
+(0 0.5204998778 0.8427007929 0.9661051465 0.995322265 0.999593048 
+ 0.9999779095 0.9999992569 0.9999999846 0.9999999998 1 1 1) 
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="error-event"></a>
+<h2><span class="function">error-event</span></h2>
+<b>syntax: (error-event <em>sym</em>)</b><br />
+<b>syntax: (error-event <em>func</em>)</b>
+
+<p>
+	<em>sym</em> contains a user-defined function for handling errors. 
+	Whenever an error occurs, 
+	the system performs a <a HREF="#reset">reset</a> 
+	and executes the user-defined error handler. 
+	The error handler can use the built-in function 
+	<a HREF="#error-number">error-number</a> 
+	to retrieve the number of the error.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (my-handler)    
+  (print "error # " (error-number) " has occurred\n")
+  (restart-program))
+
+(error-event 'my-handler)  <span class=arw>&rarr;</span> my-handler
+
+;; specify a function directly
+
+(error-event my-handler)  <span class=arw>&rarr;</span> $error-event
+
+(error-event 
+  (fn () (print "error # " (error-number) " has occurred\n")))
+
+(error-event exit)  <span class=arw>&rarr;</span> $error-event
+</pre>
+</blockquote>
+
+<p>
+	For a different way of handling errors, 
+	see the <a href="#catch">catch</a> function. 
+	Use <a href="#throw-error">throw-error</a> 
+	to throw user-defined errors.
+</p>
+
+<br /><br />
+
+<a NAME="error-number"></a>
+<h2><span class="function">error-number</span></h2>
+<b>syntax: (error-number)</b>
+
+<p>
+	Returns the number of the last error.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (my-handler)    
+  (print "error # " (error-number) " has occurred\n")
+  (restart-program))
+
+(error-event 'my-handler)
+</pre>
+</blockquote>
+
+<p>
+	See also the functions <a href="#sys-error">sys-error</a>, 
+	<a href="#throw-error">throw-error</a>, 
+	<a HREF="#error-event">error-event</a>, 
+	and <a HREF="#error_codes">error codes</a> 
+	in the appendix.
+</p> 
+
+<br /><br />
+
+<a NAME="error-text"></a>
+<h2><span class="function">error-text</span></h2>
+<b>syntax: (error-text [<em>int-error</em>])</b>
+
+<p>
+	Returns a descriptive text for 
+	the error number in <em>int-error</em>:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(error-text 5)  <span class=arw>&rarr;</span> "Not an expression"
+</pre>
+</blockquote>
+
+<p>
+	If no <em>int-error</em> is given, 
+	the last error is assumed.
+</p>
+
+<p>
+	See also the list of <a HREF="#error_codes">error codes</a>
+	in the appendix and the functions 
+	<a HREF="#error-event">error-event</a>, 
+	<a href="#catch">catch</a>, 
+	<a href="#sys-error">sys-error</a>, 
+	and <a href="#throw-error">throw-error</a>.
+</p>
+
+<br /><br />
+
+<a NAME="eval"></a>
+<h2><span class="function">eval</span></h2>
+<b>syntax: (eval <em>exp</em>)</b>
+
+<p>
+	<em>eval</em> evaluates the result of evaluating <em>exp</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'expr '(+ 3 4))  <span class=arw>&rarr;</span> (+ 3 4)
+(eval expr)           <span class=arw>&rarr;</span> 7
+(eval (list + 3 4))   <span class=arw>&rarr;</span> 7
+(eval ''x)            <span class=arw>&rarr;</span> x
+(set 'y 123)          
+(set 'x 'y)           
+x            <span class=arw>&rarr;</span> y
+(eval x)     <span class=arw>&rarr;</span> 123
+</pre>
+</blockquote>
+
+<p>
+	newLISP passes all arguments by value. 
+	Using a quoted symbol, 
+	expressions can be passed 
+	by reference through the symbol. 
+	<tt>eval</tt> can be used 
+	to access the original contents of the symbol:
+</p>
+
+<blockquote>
+<pre>
+(define (change-list aList) (push 999 (eval aList)))
+
+(set 'data '(1 2 3 4 5))
+
+(change-list 'data)  <span class=arw>&rarr;</span> (999 1 2 3 4 5)
+</pre>
+</blockquote>
+
+<p>
+	In the example, the parameter <tt>'data </tt> is quoted, 
+	so <tt>push</tt> can work on the original list.
+</p>
+
+<p>
+	It is also possible to pass arguments by reference in newLISP 
+	by enclosing the data inside context objects. 
+	See the chapter <a href="#context_objects">Programming 
+	with context objects</a> and the sub-chapter <a href="#pass_big">
+	Passing objects by reference</a>.
+</p>
+
+<br /><br />
+
+<a NAME="eval-string"></a>
+<h2><span class="function">eval-string</span></h2>
+<b>syntax: (eval-string <em>str</em> [<em>expr</em> [<em>sym-context</em>]])</b>
+
+<p>
+	Before being evaluated, 
+	the result of <em>str</em> is compiled 
+	into newLISP's internal format, and 
+	the result of the evaluation is returned. 
+	If the string contains more than one expression, 
+	the result of the last evaluation is returned.
+</p>
+
+<p>
+	A second optional argument, <em>expr</em>, 
+	can be passed that is evaluated 
+	and returned in case of an error. 
+	This permits programmatic control to be maintained
+	if the evaluation of <em>str</em> produces errors. 
+	An optional third argument can be used to specify 
+	the context in which the string should be parsed and evaluated. 
+	When <em>sym-context</em> is specified, 
+	the failure expression in <em>expr</em> 
+	must be specified, as well.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(eval-string "(+ 3 4)")  <span class=arw>&rarr;</span> 7
+(set 'X 123)             <span class=arw>&rarr;</span> 123
+(eval-string "X")        <span class=arw>&rarr;</span> 123
+
+(define (lisp)
+  (while true
+    (print "\n=&gt;" (eval-string (read-line) "syntax error"))))
+
+(set 'a 10)
+(set 'b 20)
+(set 'foo:a 11)
+(set 'foo:b 22)
+
+(eval-string "(+ a b)")           <span class=arw>&rarr;</span> 30
+(eval-string "(+ a b)" nil 'foo)  <span class=arw>&rarr;</span> 33
+</pre>
+</blockquote>
+
+<p>
+	The second example shows 
+	a simple LISP interpreter eval loop.
+</p> 
+	
+<p>
+	Use the <a href="#catch">catch</a> function 
+	to catch errors resulting from the evaluation
+	of expressions, as opposed to strings.
+</p>
+
+<p>
+	The last example shows how to specify a target context for evaluation. 
+	The symbols <tt>a</tt> and <tt>b</tt> now refer to the 
+	values in context <tt>foo</tt> instead of <tt>MAIN</tt>.
+</p>
+
+<br /><br />
+
+<a NAME="exec"></a>
+<h2><span class="function">exec</span></h2>
+<b>syntax: (exec <em>str-process</em>)</b><br />
+<b>syntax: (exec <em>str-process</em> [<em>str-stdin</em>])</b>
+
+<p>
+	In the first form, 
+	<tt>exec</tt> launches a process described in <em>str-process</em>
+	and returns all standard output as an array of strings 
+	(one for each line in <em>stdout</em>). 
+	<tt>exec</tt> returns <tt>nil</tt>
+	if the process could not be launched.
+</p> 
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(exec "ls *.c")  <span class=arw>&rarr;</span> ("newlisp.c" "nl-math.c" "nl-string.c")
+</pre>
+</blockquote>
+
+<p>
+	The example starts a process and performs the shell command <tt>ls</tt>,
+	capturing the output in an array of strings.
+</p>
+
+<p>
+	In the second form, 
+	<tt>exec</tt> creates a process pipe, 
+	starts the process in <em>str-process</em>, 
+	and receives from <em>str-stdin</em> 
+	standard input for this process.
+	The return value is <tt>true</tt> 
+	if the process was successfully launched; 
+	otherwise it is <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(exec "cgiProc" query)
+</pre>
+</blockquote>
+
+<p>
+	In this example, 
+	cgiProc could be a cgi processor (e.g., Perl or newLISP) 
+	that receives and processes standard input supplied by a string 
+	contained in the variable query.
+</p>
+
+<br /><br />
+
+<a NAME="exit"></a>
+<h2><span class="function">exit</span></h2>
+<b>syntax: (exit [<em>int</em>])</b>
+
+<p>
+	Exits newLISP. 
+	An optional exit code, <em>int</em>, may be supplied. 
+	This code can be tested by the host operating system. 
+	When newLISP is run in <a HREF="#daemon">daemon server mode</a> 
+ 	using <tt>-d</tt> as a command-line option, 
+	only the network connection is closed, 
+	while newLISP stays resident, 
+	listening for a new connection.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(exit 5)
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="exists"></a>
+<h2><span class="function">exists</span></h2>
+
+<b>syntax: (exists <em>func-condition</em> <em>list</em>)</b><br />
+
+<p>Successively applies <em>func-condition</em> 
+to the elements of <em>list</em> 
+and returns the first element 
+that meets the condition in <em>func-condition</em>. 
+If no element meets the condition, 
+<tt>nil</tt> is returned.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(exists string? '(2 3 4 6 "hello" 7))       <span class=arw>&rarr;</span> "hello"
+
+(exists string? '(3 4 2 -7 3 0))            <span class=arw>&rarr;</span> nil
+
+(exists zero? '(3 4 2 -7 3 0))              <span class=arw>&rarr;</span> 0 ; check for 0 or 0.0
+
+(exists &lt; '(3 4 2 -7 3 0))                  <span class=arw>&rarr;</span> -7 ; check for negative
+
+(exists (fn (x) (&gt; x 3)) '(3 4 2 -7 3 0))   <span class=arw>&rarr;</span> 4
+
+(exists (fn (x) (= x 10)) '(3 4 2 -7 3 0))  <span class=arw>&rarr;</span> nil 
+</pre>
+</blockquote>
+
+<p>Use the <a href="#for-all">for-all</a> function 
+to check if a condition is met for all elements in a list.</p>
+
+<br /><br />
+
+<a NAME="exp"></a>
+<h2><span class="function">exp</span></h2>
+<b>syntax: (exp <em>num</em>)</b>
+
+<p>
+	The expression in <em>num</em> is evaluated, 
+	and the exponential function is calculated based on the result. 
+	<tt>exp</tt> is the inverse function of <tt>log</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(exp 1)        <span class=arw>&rarr;</span> 2.718281828
+(exp (log 1))  <span class=arw>&rarr;</span> 1
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="expand"></a>
+<h2><span class="function">expand</span></h2>
+
+<b>syntax: (expand <em>list</em> <em>sym</em> [<em>sym_2</em> ... ])</b><br />
+<b>syntax: (expand <em>list</em> <em>list-assoc</em>)</b><br />
+<b>syntax: (expand <em>list</em>)</b>
+
+<p>
+	In the first syntax, 
+	one symbol in <em>sym</em> 
+	(or more in <em>sym_2</em> through <em>sym_n</em>) 
+	is looked up in a simple or nested <em>list</em>. 
+	They are then expanded 
+	to the current binding of the symbol, 
+	and the expanded list is returned.  
+	The original list remains unchanged.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 2 'a '(d e))
+(expand '(a x b) 'x)           <span class=arw>&rarr;</span> (a 2 b)
+(expand '(a x (b c x)) 'x)     <span class=arw>&rarr;</span> (a 2 (b c 2))
+(expand '(a x (b c x)) 'x 'a)  <span class=arw>&rarr;</span> ((d e) 2 (b c 2))
+</pre>
+</blockquote>
+
+<p>
+	<tt>expand</tt> is useful when composing lambda expressions 
+	or doing variable expansion inside macros.
+</p>
+
+<blockquote>
+<pre>
+(define (raise-to power)
+  (expand (fn (base) (pow base power)) 'power))
+
+(define square (raise-to 2))
+(define cube (raise-to 3))
+
+(square 5)  <span class=arw>&rarr;</span> 25
+(cube 5)    <span class=arw>&rarr;</span> 125
+</pre>
+</blockquote>
+
+<p>
+	If more than one symbol is present, 
+	<tt>expand</tt> will work in an incremental fashion:
+</p>
+
+<blockquote>
+<pre>
+(set 'a '(b c))
+(set 'b 1)
+
+(expand '(a b c) 'a 'b)  <span class=arw>&rarr;</span> ((1 c) 1 c) 
+</pre>
+</blockquote>
+
+<p>
+	Like the <a href="#apply">apply</a> function, 
+	<tt>expand</tt> <em>reduces</em> its argument list.
+</p>
+
+<br />
+<b>syntax: (expand <em>list</em> <em>list-assoc</em>)</b>
+
+<p>
+	The second syntax of <tt>expand</tt> allows 
+	expansion bindings to be specified on the fly, 
+	without performing a <a href="#set">set</a> 
+	on the participating variables:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(expand '(a b c) '((a 1) (b 2)))              <span class=arw>&rarr;</span> (1 2 c)
+(expand '(a b c) '((a 1) (b 2) (c (x y z))))  <span class=arw>&rarr;</span> (1 2 (x y z))
+</pre>
+</blockquote>
+
+<p>
+	Note that the contents of the variables 
+	in the association list will not change. 
+	This is different from the <a href="#letex">letex</a> function, 
+	where variables are set by evaluating 
+	and assigning their association parts.
+</p>
+
+<p>
+	This form of <tt>expand</tt> is frequently used 
+	in logic programming, 
+	together with the <a href="#unify">unify</a> function.
+</p>
+
+<br />
+<b>syntax: (expand <em>list</em>)</b>
+
+<p>
+	A third syntax is used to expand only the contents 
+	of variables starting with an uppercase character. 
+	This PROLOG mode may also be used 
+	in the context of logic programming. 
+	As in the first syntax of <tt>expand</tt>, 
+	symbols must be preset. 
+	Only uppercase variables and those bound 
+	to anything other than <tt>nil</tt> 
+	will be expanded:
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'A 1 'Bvar 2 'C nil 'd 5 'e 6)
+(expand '(A (Bvar) C d e f))  <span class=arw>&rarr;</span> (1 (2) C d e f)
+</pre>
+</blockquote>
+
+<p>
+	Only the symbols <tt>A</tt> and <tt>Bvar</tt> are expanded, 
+	since they have capitalized names 
+	and non-<tt>nil</tt> contents.
+</p>
+
+<p>
+	The <em>currying</em> function in the example 
+	demonstrating the first syntax of <tt>expand</tt> 
+	can now be written even more simply 
+	using an uppercase variable:
+</p>
+
+<blockquote>
+<pre>
+(define (raise-to Power) 
+  (expand (fn (base) (pow base Power))))
+
+&gt; (define cube (raise-to 3))
+<strong>(lambda (base) (pow base 3))</strong>
+
+&gt; (cube 4)
+<strong>64</strong>
+
+&gt; _
+</pre>
+</blockquote>
+
+<p>
+	See the <a href="#letex">letex</a> function, 
+	which also provides an expansion mechanism, 
+	and the function <a href="#unify">unify</a>, 
+	which is frequently used together with <tt>expand</tt>.
+</p>
+
+<br /><br />
+
+<a NAME="explode"></a>
+<h2><span class="function">explode</span></h2>
+<b>syntax: (explode <em>str</em> [<em>int-chunk</em> [<em>bool</em>] ])</b><br />
+<b>syntax: (explode <em>list</em> [<em>int-chunk</em> [<em>bool</em>] ])</b>
+
+<p>
+In the first syntax, 
+<tt>explode</tt> transforms the string (<em>str</em>)
+into a list of single-character strings. 
+Optionally, a chunk size can be specified in <em>int-chunk</em> 
+to break the string into multi-character chunks. 
+When specifying a value for <em>bool</em> other than <tt>nil</tt>,
+the last chunk will be omitted 
+if it does not have the full length specified 
+in <em>int-chunk</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(explode "newLISP")  <span class=arw>&rarr;</span> ("n" "e" "w" "L" "I" "S" "P")
+
+(join (explode "keep it together"))  <span class=arw>&rarr;</span> "keep it together"
+
+(explode "newLISP" 2)    <span class=arw>&rarr;</span> ("ne" "wL" "IS" "P")
+
+(explode "newLISP" 3)    <span class=arw>&rarr;</span> ("new" "LIS" "P")
+
+; omit last chunk if too short
+(explode "newLISP" 3 true)    <span class=arw>&rarr;</span> ("new" "LIS")
+
+</pre>
+</blockquote>
+
+<p>
+	<tt>explode</tt> also works on binary content:
+</p>
+
+<blockquote>
+<pre>
+(explode "\000\001\002\003") 
+<span class=arw>&rarr;</span> ("\000" "\001" "\002" "\003")
+</pre>
+</blockquote>
+
+<p>
+	When called in UTF-8&ndash;enabled versions of newLISP, 
+	<tt>explode</tt> will work on character boundaries 
+	rather than byte boundaries. 
+	In UTF-8&ndash;encoded strings, 
+	characters may contain more than one byte.
+</p>
+
+<p>
+In the second syntax, 
+<tt>explode</tt> explodes a list (<em>list</em>)
+into sublists of chunk size <em>int-chunk</em>, 
+which is 1 (one) by default.
+</p>
+
+<p>
+The following shows an example of the last chunk being omitted 
+when the value for <em>bool</em> is other than <tt>nil</tt>,
+and the chunk does not have the full length specified 
+in <em>int-chunk</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(explode '(a b c d e f g h))    <span class=arw>&rarr;</span> ((a) (b) (c) (d) (e) (f) (g) (h))
+(explode '(a b c d e f g h) 2)  <span class=arw>&rarr;</span> ((a b) (c d) (e f) (g))
+
+; omit last chunk if too short
+(explode '(a b c d e f g h) 2 true)  <span class=arw>&rarr;</span> ((a b) (c d) (e f))
+
+(transpose (explode '(a b c d e f g h) 2)) 
+<span class=arw>&rarr;</span> ((a c e g) (b d f h))
+</pre>
+</blockquote>
+
+<p>
+The <a HREF="#join">join</a> and <a HREF="#append">append</a> functions
+are inverse operations of <tt>explode</tt>.
+</p>
+
+<br /><br />
+
+<a NAME="factor"></a>
+<h2><span class="function">factor</span></h2>
+<b>syntax: (factor <em>int</em>)</b>
+
+<p>
+	Factors the number in <em>int</em> 
+	into its prime components. 
+	Floating point numbers in <em>num</em> 
+	are truncated to their integer part.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(factor 123456789123456789)  <span class=arw>&rarr;</span> (3 3 7 11 13 19 3607 3803 52579)
+
+;; check correctness of factoring
+(= (apply * (factor 123456789123456789)) 123456789123456789)
+<span class=arw>&rarr;</span> true
+
+;; factor the biggest integer
+(factor 9223372036854775807)  <span class=arw>&rarr;</span> (7 7 73 127 337 92737 649657)
+
+;; primes.lsp - return all primes in a list, up to n 
+
+(define (primes n , p)
+  (dotimes (e n) 
+    (if (= (length (factor e)) 1) 
+      (push e p -1))) p)
+           
+(primes 20)  <span class=arw>&rarr;</span> (2 3 5 7 11 13 17 19)         
+</pre>
+</blockquote>
+
+<p>
+	<tt>factor</tt> returns <tt>nil</tt> 
+	for numbers smaller than <tt>2</tt>.
+	For numbers larger than 9,223,372,036,854,775,807
+	(the largest 64-bit integer)
+	converted from floating point numbers, 
+	the largest integer is factored.
+</p>
+
+<br /><br />
+
+<a NAME="fft"></a>
+<h2><span class="function">fft</span></h2>
+<b>syntax: (fft <em>list-num</em>)</b>
+
+<p>
+	Calculates the discrete Fourier transform 
+	on the list of complex numbers in <em>list-num</em> 
+	using the FFT method (Fast Fourier Transform). 
+	Each complex number is specified by its real part, 
+	followed by its imaginary part. 
+	If only real numbers are used, 
+	the imaginary part is set to <tt>0.0</tt> (zero). 
+	When the number of elements in <em>list-num</em> 
+	is not a power of 2, 
+	<tt>fft</tt> increases the number of elements 
+	by padding the list with zeroes. 
+	When the imaginary part of a complex number is 0, 
+	simple numbers can be used instead.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(ifft (fft '((1 0) (2 0) (3 0) (4 0)))) 
+<span class=arw>&rarr;</span> ((1 0) (2 0) (3 0) (4 0))
+
+;; when imaginary part is 0, plain numbers work, too
+;; complex numbers can be intermixed
+
+(fft '(1 2 3 4))      <span class=arw>&rarr;</span> ((10 0) (-2 -2) (-2 0) (-2 2))
+(fft '(1 2 (3 0) 4))  <span class=arw>&rarr;</span> ((10 0) (-2 -2) (-2 0) (-2 2))
+
+</pre>
+</blockquote>
+
+<p>
+	The inverse operation of <tt>fft</tt> 
+	is the <a HREF="#ifft">ifft</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="file-info"></a>
+<h2><span class="function">file-info</span></h2>
+<b>syntax: (file-info <em>str_name</em>)</b>
+
+<p>
+	Returns a list of information about 
+	the file or directory in <em>str_name</em>. 
+	newLISP uses the POSIX system call <tt>lstat()</tt> 
+	to get the following information:
+</p>
+<br />
+<blockquote>
+<table border="0" cellpadding="1">
+<tr align="left"><th>offset</th><th>contents</th></tr>
+<tr><td>0</td><td>size</td></tr>
+<tr><td>1</td><td>mode</td></tr>
+<tr><td>2</td><td>device mode</td></tr>
+<tr><td>3</td><td>user ID</td></tr>
+
+<tr><td>4</td><td>group ID</td></tr>
+<tr><td>5</td><td>access time</td></tr>
+<tr><td>6</td><td>modification time</td></tr>
+<tr><td>7</td><td>status change time</td></tr>
+</table>
+</blockquote>
+
+<br />
+
+<b>example:</b>
+<blockquote>
+<pre>
+(file-info ".bashrc")   
+<span class=arw>&rarr;</span> (124 33188 0 500 0 920951022 920951022 920953074)
+
+(date (last (file-info "/etc")))   
+<span class=arw>&rarr;</span> "Mon Mar 8 18:23:17 1999"
+</pre>
+</blockquote>
+
+<p>
+	In the second example, 
+	the last status change date 
+	for the directory <em>/etc</em> 
+	is retrieved.
+</p>
+
+<p><tt>file-info</tt> gives file statistics (size) for a linked file,
+not the link, except for the <em>mode</em> field.</p>
+
+<br /><br />
+
+<a NAME="filep"></a>
+<h2><span class="function">file?</span></h2>
+
+<b>syntax: (file? <em>str-name</em>)</b>
+
+<p>
+	Checks for the existence of 
+	a file in <em>str-name</em>. 
+	Returns <tt>true</tt> 
+	if the file exists; 
+	otherwise, it returns <tt>nil</tt>. 
+	This function will also return 
+	<tt>true</tt> for directories. 
+	The existence of a file 
+	does not imply anything about 
+	its read or write permissions. 
+	A file may exist while not having the permissions 
+	to read from or write to it by the current user.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(if (file? "afile") (set 'fileNo (open "afile" "read")))
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="filter"></a>
+<h2><span class="function">filter</span></h2>
+<b>syntax: (filter <em>exp-predicate</em> <em>exp-list</em>)</b>
+
+<p>
+	The predicate <em>exp-predicate</em> is applied 
+	to each element of the list <em>exp-list</em>. 
+	A list is returned containing the elements 
+	for which <em>exp-predicate</em> is true. 
+	<tt>filter</tt> works like <a href="#clean">clean</a>, 
+	but with a negated predicate.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(filter symbol? '(1 2 d 4 f g 5 h))  <span class=arw>&rarr;</span> (d f g h)
+
+(define (big? x) (&gt; x 5))  <span class=arw>&rarr;</span> (lambda (x) (&gt; x 5))
+
+(filter big? '(1 10 3 6 4 5 11))  <span class=arw>&rarr;</span> (10 6 11)
+
+; filter with comparison functor
+
+(set 'L '((a 10 2 7) (b 5) (a 8 3) (c 8) (a 9)))
+
+(filter (curry match '(a *)) L)   <span class=arw>&rarr;</span> ((a 10 2 7) (a 8 3) (a 9))
+
+(filter (curry match '(? ?)) L)   <span class=arw>&rarr;</span> ((b 5) (c 8) (a 9))
+
+(filter (curry match '(* 8 *)) L) <span class=arw>&rarr;</span> ((a 8 3) (c 8))
+
+<span class=arw>&rarr;</span>  ((a 10) (a 3) (a 9))
+</pre>
+</blockquote>
+
+<p>
+	The predicate may be a built-in predicate, 
+	a user-defined function, 
+	or a lambda expression.
+</p>
+
+<p>
+	For filtering a list of elements 
+	with the elements from another list, 
+	use the <a href="#difference"> difference</a> function or 
+	<a href="#intersect">intersect</a> 
+	(with the <em>list</em> option).
+</p>
+
+<p>
+	See also the related function <a HREF="#index">index</a>, 
+	which returns the indices of the filtered elements 
+	and <a href="#clean">clean</a>, 
+	which returns all elements of a list 
+	for which a predicate is false.
+</p>
+
+<br /><br />
+
+<a NAME="find"></a>
+<h2><span class="function">find</span></h2>
+<b>syntax: (find <em>exp-key list</em> [<em>func-compare</em> | <em>int-option</em>])</b><br />
+<b>syntax: (find <em>str-key str-data</em> [<em>int-option</em>])</b>
+
+<h4>Find an expressions in a list</h4>
+<p>
+	If the second argument evaluates to a <em>list</em>, 
+	then <tt>find</tt> returns the index position (offset) 
+	of the element derived from evaluating <em>exp-key</em>.
+</p>
+
+<p>
+Optionally, an operator or user-defined function 
+can be specified in <em>func-compare</em>. 
+If <em>exp-key</em> is a string, 
+a regular expression option 
+can be specified with <em>int-option</em> instead.</p>
+
+<p>When using regular expressions or comparison functors the system
+variable <tt>$0</tt> is set to the last element found.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+; find an expression in a list
+(find '(1 2) '((1 4) 5 6 (1 2) (8 9)))  <span class=arw>&rarr;</span> 3
+
+(find "world" '("hello" "world"))       <span class=arw>&rarr;</span> 1
+(find "hi" '("hello" "world"))          <span class=arw>&rarr;</span> nil
+
+(find "newlisp" '("Perl" "Python" "newLISP") 1)  <span class=arw>&rarr;</span> 2
+
+; use the comparison functor
+(find 3 '(8 4 3  7 2 6) &gt;)  <span class=arw>&rarr;</span> 4
+$0 <span class=arw>&rarr;</span> 2
+
+(find "newlisp" '("Perl" "Python" "newLISP") 
+                 (fn (x y) (regex x y 1))) <span class=arw>&rarr;</span> 2
+$0 <span class=arw>&rarr;</span> "newLISP"
+
+(find 5 '((l 3) (k 5) (a 10) (z 22)) 
+         (fn (x y) (= x (last y))))  <span class=arw>&rarr;</span> 1
+$0 <span class=arw>&rarr;</span> (k 5)
+
+(find '(a ?) '((l 3) (k 5) (a 10) (z 22)) match)  <span class=arw>&rarr;</span> 2
+$0 <span class=arw>&rarr;</span> (a 10)
+
+(find '(X X) '((a b) (c d) (e e) (f g)) unify)  <span class=arw>&rarr;</span> 2
+$0 <span class=arw>&rarr;</span> (e e)
+
+; define the comparsion functor first for better readability
+(define (has-it-as-last x y) (= x (last y)))
+
+(find 22 '((l 3) (k 5) (a 10) (z 22)) has-it-as-last)  <span class=arw>&rarr;</span> 3
+$0 <span class=arw>&rarr;</span> (z 22)
+</pre>
+</blockquote>
+
+<p>
+Using <a href="#match">match</a> and <a href="#unify">unify</a>, 
+list searches can be formulated which are as powerful 
+as regular expression searches are for strings.
+</p>
+
+<br />
+
+<h4>Find a string in a string</h4>
+<p>
+	If the second argument, 
+	<em>str-data</em>, 
+	evaluates to a string, 
+	then the offset position 
+	of the string <em>str-key</em> 
+	(found in the first argument, 
+	<em>str-data</em>)
+	is returned. 
+	In this case, 
+	<tt>find</tt> also works 
+	on binary <em>str-data</em>.
+</p>
+
+<p>
+	The presence of a third parameter specifies a search 
+	using the regular expression pattern specified in <em>str-pattern</em>, 
+	as well as an option number specified in <em>int-option</em>
+	(i.e., 1 (one) for case-insensitive search or 0 (zero) 
+	for no special options).
+</p>
+
+<p>
+	In newLISP, regular expressions are standard 
+	Perl Compatible Regular Expression (PCRE) searches. 
+	Found expressions or subexpressions are returned 
+	in the system variables <tt>$0</tt>, <tt>$1</tt>, <tt>$2</tt>, etc., 
+	which can be used like any other symbol. 
+	As an alternative, 
+	the contents of these variables 
+	can also be accessed 
+	by using <tt>($ 0)</tt>, <tt>($ 1)</tt>, <tt>($ 2)</tt>, etc. 
+	This method allows indexed access 
+	(i.e., <tt>($ i)</tt>, where <tt>i</tt> is an integer).
+</p> 
+	
+<p>
+	See <a HREF="#regex">regex</a> 
+	for the meaning of the  
+	option numbers and more information 
+	on regular expression searching.
+</p> 
+	
+<b>example:</b>
+<blockquote>
+<pre>
+; simple string search
+(find "world" "Hello world")  <span class=arw>&rarr;</span> 6
+(find "WORLD" "Hello woRLd")  <span class=arw>&rarr;</span> nil
+
+; case-insensitive regex
+
+(find "WorlD" "Hello woRLd" 1)  <span class=arw>&rarr;</span> 6   
+                                
+(find "hi" "hello world")       <span class=arw>&rarr;</span> nil
+(find "Hello" "Hello world")    <span class=arw>&rarr;</span> 0
+
+; regex with default options
+
+(find "cat|dog" "I have a cat" 0)  <span class=arw>&rarr;</span> 9 
+$0                                 <span class=arw>&rarr;</span> "cat"
+(find "cat|dog" "my dog" 0)        <span class=arw>&rarr;</span> 3
+$0                                 <span class=arw>&rarr;</span> "dog"
+(find "cat|dog" "MY DOG" 1)        <span class=arw>&rarr;</span> 3
+$0                                 <span class=arw>&rarr;</span> "DOG"
+
+;; find with subexpressions in regular expression
+;; and access with system variables
+
+(set 'str  "http://nuevatec.com:80")
+
+(find "http://(.*):(.*)" str 0)  <span class=arw>&rarr;</span> 0
+                                 
+$0  <span class=arw>&rarr;</span> "http://nuevatec.com:80"
+$1  <span class=arw>&rarr;</span> "nuevatec.com"
+$2  <span class=arw>&rarr;</span> "80"
+
+;; system variables as an indexed expression (since 8.0.5)
+($ 0)  <span class=arw>&rarr;</span> "http://nuevatec.com:80"
+($ 1)  <span class=arw>&rarr;</span> "nuevatec.com"
+($ 2)  <span class=arw>&rarr;</span> "80"
+</pre>
+</blockquote>
+
+<p>
+	For other functions using regular expressions, 
+	see <a href="#directory">directory</a>, 
+    <a href="#find-all">find-all</a>,
+	<a href="#parse">parse</a>, 
+	<a HREF="#regex">regex</a>, 
+	<a href="#replace">replace</a>, 
+	and <a href="#search">search</a>.
+
+<p>
+	To find expressions in nested 
+	or multidimensional lists, 
+	use the <a href="#ref">ref</a> and <a href="#ref-all">ref-all</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="find-all"></a>
+<h2><span class="function">find-all</span></h2>
+<b>syntax: (find-all <em>str-pattern</em> <em>str-text</em> [<em>expr</em> [<em>int-option</em>]])</b><br />
+<b>syntax: (find-all <em>list-pattern</em> <em>list-lists</em> [<em>expr</em>])</b><br />
+<b>syntax: (find-all <em>expr-key</em> <em>list</em> <em>expr</em> <em>func-compare</em>)</b>
+
+<p>
+	In the first syntax <tt>find-all</tt> Finds all occurrences of <em>str-pattern</em> 
+	in the text <em>str-text</em>, 
+	returning a list containing all matching strings. 
+	The empty list <tt>()</tt> is returned
+	if no matches are found.
+</p>
+
+<p>
+	Optionally, an expression can be specified 
+	to process the found string or regular subexpressions 
+	before placing them into the returned list.
+	An additional option, <em>int-option</em>, 
+	specifies special regular expression options 
+	(see <a href="#regex">regex</a> for further details).
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(find-all {\d+} "lkjhkljh34ghfdhgfd678gfdhfgd9")
+<span class=arw>&rarr;</span> ("34" "678" "9")
+
+(find-all {(new)(lisp)} "newLISPisNEWLISP" (append $2 $1) 1)
+<span class=arw>&rarr;</span> ("LISPnew" "LISPNEW")
+
+(unique (sort 
+    (find-all {[a-zA-Z]+} 
+        (replace "&lt;[^&gt;]+&gt;" (get-url "http://newlisp.org") "" 0) )
+))
+<span class=arw>&rarr;</span> ("A" "ACC" "AI" "API" "About" "All" "Amazing" "Apps"
+...
+"where" "whole" "width" "wiki" "will" "with" "work" "written")
+</pre>
+</blockquote>
+
+<p>
+	The first example discovers all numbers in a text. 
+	The second example shows how an optional expression in <em>expr</em> 
+	can work on subexpressions found by the regular expression pattern 
+	in <em>str-pattern</em>. 
+	The last example retrieves a web page, 
+	cleans out all HTML tags, 
+	and then collects all words 
+	into a unique and sorted list.
+</p>
+
+<p>
+	Note that <tt>find-all</tt> with strings
+	always performs a regular expression search, 
+	even if the option in <em>int-option</em> 
+	is omitted.
+</p>
+
+<p>In the second syntax <tt>find-all</tt> searches for all list <a href="#match">match</a>
+patterns <em>list-pattern</em> in <em>list-lists</em>. As in <tt>find-all</tt> for
+strings an expression can be specified in <em>expr</em> to further process the matched
+sublist:</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(find-all '(? 2) '((a 1) (b 2) (a 2) (c 4))) <span class=arw>&rarr;</span> ((b 2) (a 2))
+
+(find-all '(? 2) '((a 1) (b 2) (a 2) (c 4)) (first $0)) <span class=arw>&rarr;</span> (b a)
+</pre>
+</blockquote>
+
+<p><tt>find-all</tt> for list matches always uses <a href="#match">match</a> to compare when
+searching for sublists and always needs a list for the pattern expression.</p>
+
+<p>In the third syntax <tt>find-all</tt> can speficy a built-in or user-defined
+function used for comparing list elements with the key expression in <em>expr-keyM</em>:</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(find-all 5 '(2 7 4 5 9 2 4 9 7 4 8) $0 &lt;) <span class=arw>&rarr;</span> (7 9 9 7 8)
+
+; process the found element
+
+(find-all 5 '(2 7 4 5 9 2 4 9 7 4 8) (* 3 $0) &lt;) <span class=arw>&rarr;</span> (21 27 27 21 24)
+
+(find-all 5 '(2 7 4 5 9 2 4 9 7 4 8) ("abcdefghijk" $0) &lt;) <span class=arw>&rarr;</span> ("h" "j" "j" "h" "i")
+</pre>
+</blockquote>
+
+<p>Any type of expression can be searched for or can be contained in the list. <tt>find-all</tt>
+in this syntax works similar to <a href="#filter">filter</a> but with the added benefit of
+beeing able to define a processing expression for the found element.</p>
+
+<br /><br />
+
+
+<a NAME="first"></a>
+<h2><span class="function">first</span></h2>
+<b>syntax: (first <em>list</em>)</b><br />
+<b>syntax: (first <em>array</em>)</b><br />
+<b>syntax: (first <em>str</em>)</b>
+
+<p>
+	Returns the first element of a list 
+	or the first character of a string.
+	The operand is not changed. 
+	This function is equivalent to <em>car</em>
+	or <em>head</em> in other LISP dialects.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(first '(1 2 3 4 5))       <span class=arw>&rarr;</span> 1
+(first '((a b) c d))       <span class=arw>&rarr;</span> (a b)
+(set 'aList '(a b c d e))  <span class=arw>&rarr;</span> (a b c d e)
+(first aList)              <span class=arw>&rarr;</span> a
+aList                      <span class=arw>&rarr;</span> (a b c d e)
+
+(set 'A (array 3 2 (sequence 1 6)))
+<span class=arw>&rarr;</span>  ((1 2) (3 4) (5 6))
+(first A)                  <span class=arw>&rarr;</span> (1 2)
+</pre>
+</blockquote>
+
+<p>
+	In the second syntax, 
+	the first character is returned 
+	from the string in <em>str</em> 
+	as a string.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(first "newLISP")         <span class=arw>&rarr;</span> "n"
+(first (rest "newLISP"))  <span class=arw>&rarr;</span> "e"
+</pre>
+</blockquote>
+
+<p>
+	Note that <a href="#first">first</a> works on character boundaries 
+	rather than byte boundaries 
+	when the UTF-8&ndash;enabled version of newLISP is used.
+	See also the functions <a HREF="#last">last</a> 
+	and <a HREF="#rest">rest</a>.
+</p>
+
+<br /><br />
+
+<a NAME="flat"></a>
+<h2><span class="function">flat</span></h2>
+<b>syntax: (flat <em>list</em>)</b><br />
+
+<p>
+	Returns the flattened form of a list:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'lst '(a (b (c d))))
+(flat lst)  <span class=arw>&rarr;</span> (a b c d)
+
+(map (fn (x) (ref x lst)) (flat lst))
+<span class=arw>&rarr;</span> ((0) (1 0) (1 1 0) (1 1 1))
+</pre>
+</blockquote>
+
+<p>
+	<tt>flat</tt> can be used 
+	to iterate through nested lists.
+</p>
+
+<br /><br />
+
+<a NAME="fn"></a>
+<h2><span class="function">fn</span></h2> 
+<b>syntax: (fn (<em>list-parameters</em>) <em>exp-body</em>)</b>
+
+<p>
+	<tt>fn</tt> is used to define anonymous functions, 
+	which are frequently used in <a href="#map">map</a>,
+	<a href="#sort">sort</a>, 
+	and anywhere functions can be used as a argument.
+</p>
+
+<p>
+	Using an anonymous function 
+	eliminates the need to define 
+	a new function with <a href="#define">define</a>.
+	Instead, a function is defined on the fly:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(map (fn (x) (+ x x)) '(1 2 3 4 5)) <span class=arw>&rarr;</span> (2 4 6 8 10)
+
+(sort '(".." "..." "." ".....") (fn (x y) (&gt; (length x) (length y))))
+<span class=arw>&rarr;</span> ("....." "..." ".." ".")
+</pre>
+</blockquote>
+
+<p>
+	The example defines the function <em>fn(x)</em>, 
+	which takes an integer (<em>x</em>) and doubles it. 
+	The function is <em>mapped</em> onto a list of arguments 
+	using <a href="#map">map</a>. 
+	The second example shows strings being sorted by length.
+</p>
+
+<p>
+	The <a href="#lambda">lambda</a> function 
+	(the longer, traditional form)
+	can be used in place of <tt>fn</tt>.
+</p>
+
+<br /> <br />
+
+<a NAME="float"></a>
+<h2><span class="function">float</span></h2>
+<b>syntax: (float <em>exp</em> [<em>exp-default</em>] )</b>
+
+<p>
+	If the expression in <em>exp</em> 
+	evaluates to a number or a string, 
+	the argument is converted to a float 
+	and returned. 
+	If <em>exp</em> cannot be converted to a float 
+	then <tt>nil</tt> or, if specified, 
+	the evaluation of <em>exp-default</em> 
+	will be returned.
+	This function is mostly used to convert strings 
+	from user input or when reading and parsing text. 
+	The string must start with a digit 
+	or the <tt>+</tt> (plus sign), <tt>-</tt> (minus sign), 
+	or <tt>.</tt> (period). 
+	If <em>str</em> is invalid,
+	<tt>float</tt> returns <tt>nil</tt> 
+	as a default value.
+</p>
+
+<p>
+	Floats with exponents larger than 1e308 
+	or smaller than -1e308 
+	are converted to +INF or -INF, respectively. 
+	The display of +INF and -INF 
+	differs on different platforms and compilers.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(float "1.23")       <span class=arw>&rarr;</span> 1.23
+(float " 1.23")      <span class=arw>&rarr;</span> 1.23
+(float ".5")         <span class=arw>&rarr;</span> 0.50
+(float "-1.23")      <span class=arw>&rarr;</span> -1.23
+(float "-.5")        <span class=arw>&rarr;</span> nil
+(float "#1.23")      <span class=arw>&rarr;</span> nil
+(float "#1.23" 0.0)  <span class=arw>&rarr;</span> 0
+
+(float? 123)          <span class=arw>&rarr;</span> nil
+(float? (float 123))  <span class=arw>&rarr;</span> true
+
+(float '(a b c))    <span class=arw>&rarr;</span> nil
+(float '(a b c) 0)  <span class=arw>&rarr;</span> 0
+(float nil 0)       <span class=arw>&rarr;</span> 0
+
+(float "abc" "not a number")  <span class=arw>&rarr;</span> "not a number"
+(float "1e500")               <span class=arw>&rarr;</span> inf
+(float "-1e500")              <span class=arw>&rarr;</span> -inf
+
+(print "Enter a float num:")
+(set 'f-num (float (read-line)))
+</pre>
+</blockquote>
+
+<p>
+	Use the <a HREF="#int">int</a> function 
+	to parse integer numbers.
+</p>
+
+<br /><br />
+
+<a NAME="floatp"></a>
+<h2><span class="function">float?</span></h2>
+<b>syntax: (float? <em>exp</em>)</b>
+
+<p>
+	<tt>true</tt> is returned only 
+	if <em>exp</em> evaluates to a floating point number;
+	otherwise, <tt>nil</tt> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'num 1.23)
+(float? num)  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="floor"></a>
+<h2><span class="function">floor</span></h2>
+<b>syntax: (floor <em>number</em> )</b>
+
+<p>
+	Returns the next lowest integer below <em>number</em> 
+	as a floating point.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(floor -1.5)  <span class=arw>&rarr;</span> -2
+(floor 3.4)   <span class=arw>&rarr;</span> 3
+</pre>
+</blockquote>
+
+<p>
+	See also the <a HREF="#ceil">ceil</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="flt"></a>
+<h2><span class="function">flt</span></h2>
+<b>syntax: (flt <em>number</em> )</b>
+
+<p>
+	Converts <em>number</em> to a 32-bit float 
+	represented by an integer. 
+	This function is used when passing 32-bit floats 
+	to library routines.
+	newLISP floating point numbers 
+	are 64-bit and are passed as 64-bit floats 
+	when calling imported C library routines.
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(flt 1.23)  <span class=arw>&rarr;</span> 1067282596
+
+;; pass 32-bit float to C-function: foo(float value) 
+(import "mylib.so" "foo")
+(foo (flt 1.23))
+
+(get-int (pack "f" 1.23))  <span class=arw>&rarr;</span> 1067282596
+
+(unpack "f" (pack "ld" (flt 1.2345)))  <span class=arw>&rarr;</span> (1.234500051)
+</pre>
+</blockquote>
+
+<p>
+	The last two statements illustrate 
+	the inner workings of <tt>flt</tt>.
+</p>
+
+<p>
+	Use the <a href="#import">import</a> function 
+	to import libraries.
+</p>
+
+<br /><br />
+
+<a NAME="for"></a>
+<h2><span class="function">for</span></h2>
+<b>syntax: (for (<em>sym</em> <em>num-from</em> <em>num-to</em> [<em>num-step</em> [<em>exp-break</em>]]) <em>body</em>)</b>
+
+<p>
+	Repeatedly evaluates the expressions in <em>body</em> 
+	for a range of values specified
+	in <em>num-from</em> and <em>num-to</em>, inclusive.  
+	A step size may be specified with <em>num-step</em>.  
+	If no step size is specified, <tt>1.0</tt> is assumed.
+</p>
+
+<p>
+	Optionally, a condition for early loop exit
+	may be defined in <em>exp-break</em>. 
+	If the break expression evaluates 
+	to any non-<tt>nil</tt> value, 
+	the <tt>for</tt> loop returns with 
+	the value of <em>exp-break</em>. 
+	The break condition is tested 
+	before evaluating <em>body</em>. If a
+	break condition is defined <em>num-step</em>
+	must be defined too.
+</p>
+
+<p>
+	The symbol <em>sym</em> 
+	is local in dynamic scope 
+	to the <tt>for</tt> expression.
+	It takes on each value successively 
+	in the specified range as an integer value 
+	if no step size is specified, or
+	as a floating point value when a step size is
+	present.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre> 
+&gt; (for (x 1 10 2) (println x))
+<b>1
+3
+5
+7
+9</b>
+
+&gt; (for (x 8 6 0.5) (println x))
+<b>8
+7.5
+7
+6.5
+6</b>
+
+&gt; (for (x 1 100 2 (&gt; (* x x) 30)) (println x))
+<b>1
+3
+5
+true</b>
+&gt; _
+</pre>
+</blockquote>
+
+<p>
+	The second example uses 
+	a range of numbers 
+	from highest to lowest. 
+	Note that the step size 
+	is always a positive number. 
+	In the third example, 
+	a break condition is tested.
+</p>
+
+<p>
+	Use the <a HREF="#sequence">sequence</a> function
+	to make a sequence of numbers.
+</p>
+
+<br /><br />
+
+<a NAME="for-all"></a>
+<h2><span class="function">for-all</span></h2>
+
+<b>syntax: (for-all <em>func-condition</em> <em>list</em>)</b>
+
+<p>Applies the function in <em>func-condition</em> 
+to all elements in <em>list</em>.
+If all elements meet the condition in <em>func-condition</em>,
+the result is <tt>true</tt>;
+otherwise, <tt>nil</tt> is returned.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(for-all number? '(2 3 4 6 7))                 <span class=arw>&rarr;</span> true
+
+(for-all number? '(2 3 4 6 "hello" 7))         <span class=arw>&rarr;</span> nil
+
+(for-all (fn (x) (= x 10)) '(10 10 10 10 10))  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<p>Use the <a href="#exists">exists</a> function
+to check if at least one element in a list 
+meets a condition.</p>
+
+<br /><br />
+
+<a NAME="fork"></a>
+<h2><span class="function">fork</span></h2>
+
+<b>syntax: (fork <em>exp</em>)</b>
+
+<p>
+	The expression in <em>exp</em> is launched 
+	as a newLISP child process thread 
+	of the platforms OS.
+	The new process inherits 
+	the entire address space, 
+	but runs independently, 
+	so symbol or variable contents 
+	changed in the child thread 
+	will not affect the parent process 
+	or vice versa. 
+	The child process ends 
+	when the evaluation of <em>exp</em> finishes.
+</p>
+
+<p>
+	On success, <tt>fork</tt> returns with the child process ID; 
+	on failure, <tt>nil</tt> is returned. 
+	See also the <a href="#wait-pid">wait-pid</a> function, 
+	which waits for a child process to finish.
+</p>
+
+<p>
+	This function is only available 
+	on Linux/UNIX versions of newLISP 
+	and is based on the <tt>fork()</tt> 
+	implementation of the underlying OS. </p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+&gt; (set 'x 0)
+<b>0</b>
+&gt; (fork (while (&lt; x 20) (println (inc 'x)) (sleep 1000)))
+<b>176</b>
+
+&gt; <b>1
+2
+3
+4
+5
+6</b>
+</pre>
+</blockquote>
+
+
+<p>
+	The example illustrates 
+	how the child process thread 
+	inherits the symbol space 
+	and how it is independent of
+	the parent process. 
+	The <tt>fork</tt> statement 
+	returns immediately with 
+	the process ID <tt>176</tt>. 
+	The child process increments 
+	the variable <tt>x</tt> 
+	by one each second and prints it 
+	to standard out (boldface). 
+	In the parent process, 
+	commands can still be entered. 
+	Type <tt>x</tt> to see that 
+	the symbol <tt>x</tt> still 
+	has the value <tt>0</tt> (zero)
+	in the parent process. 
+	Although statements entered 
+	will mix with the display 
+	of the child process output, 
+	they will be correctly input 
+	to the parent process.
+</p>
+
+<p>
+	The second example illustrates 
+	how <a href="#pipe">pipe</a> can be used 
+	to communicate between threads.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+#!/usr/bin/newlisp
+
+(define (count-down-thread x channel)
+  (while (!= x 0)
+    (begin
+      (write-line (string x) channel)
+      (dec 'x))))
+
+(define (observer-thread channel)
+  (do-until (= i "1")
+    (println "thread " (setq i (read-line channel)))))
+
+(map set '(in out) (pipe))
+(set 'observer (fork (observer-thread in)))
+(set 'counter (fork (count-down-thread 5 out)))
+
+; avoid zombies
+(wait-pid observer)
+(wait-pid counter)
+
+(exit)
+</pre>
+</blockquote>
+
+<p>The following output is generated by observer-thread</p>
+
+<blockquote>
+<pre>
+thread 5
+thread 4
+thread 3
+thread 2
+thread 1
+</pre>
+</blockquote>
+
+<p>
+	The <tt>count-down-thread</tt> writes 
+	numbers to the communication pipe, 
+	where they are picked up by 
+	the <tt>observer-thread</tt> 
+	and displayed.
+</p>
+
+<p>A forked process can either exit by itself or it can be destroyed using
+the <a href="#destroy">destroy</a> function.</p<
+
+<blockquote>
+<pre>
+(define (fork-destroy-demo)
+	(set 'pid (fork (dotimes (i 1000) (println i) (sleep 10))))
+	(sleep 50)
+	(destroy pid)
+)
+
+&gt; (fork-destroy-demo)
+<b>0
+1
+2
+3
+4
+true</b>
+&gt; 
+</pre>
+</blockquote>
+
+<p>The process started by <tt>fork-destroy-demo</tt> will not finishe but is
+destroyed 50 milli seconds after start by a call to <a href="#destroy">destroy</a>.
+</p> 
+
+<p>
+	Use the <a href="#semaphore">semaphore</a> 
+	function for synchronizing threads 
+	and <a href="#share">share</a> 
+	for sharing memory between threads.
+</p>
+
+<br /><br />
+
+<a NAME="format"></a>
+<h2><span class="function">format</span></h2>
+<b>syntax: (format <em>str-format exp-data-1</em> [<em>exp-data-i</em> ... ] )</b><br>
+<b>syntax: (format <em>str-format</em> <em>list-data</em>)</b>
+
+<p>
+	Constructs a formatted string 
+	from <em>exp-data-1</em> 
+	using the format specified
+	in the evaluation of <em>str-format</em>. 
+	The format specified is identical 
+	to the format used for the <tt>printf()</tt> 
+	function in the ANSI C language. 
+	Two or more <em>exp-data</em> arguments 
+	can be specified for more than one 
+	format specifier in <em>str-format</em>.
+</p>
+
+<p>
+	In an alternative syntax, 
+	the data to be formatted 
+	can be passed inside a list 
+	in <em>list-data</em>.
+</p>
+
+<p>
+	<tt>format</tt> checks for a valid format string, 
+	matching data type, and the correct number of arguments. 
+	Wrong formats or data types result in error messages. 
+	<a href="#int">int</a>, <a href="#float">float</a>, 
+	or <a href="#string">string</a> can be used 
+	to ensure correct data types and to avoid error messages.
+</p>
+
+<p>
+	The format string has the following general format:
+</p>
+
+<blockquote>
+
+<pre><font size="+1">"%w.pf"</font></pre>
+</blockquote>
+
+<p>
+	The <tt>%</tt> (percent sign) 
+	starts a format specification. 
+	To display a <tt>%</tt> inside a 
+	format string, double it: <tt>%%</tt></p>
+
+<p>
+	The <tt>w</tt> represents the width field. 
+	Data is right-aligned, 
+	except when preceded 
+	by a minus sign,
+	in which case it is left-aligned. 
+	When preceded by a zero, 
+	the unused space is filled 
+	with leading zeroes. 
+	The width field is optional 
+	and serves all data types.
+</p>
+
+<p>
+	The <tt>p</tt> represents the precision number 
+	of decimals (floating point only) 
+	or strings and is separated 
+	from the width field by a period. 
+	Precision is optional. 
+	If preceded by a <tt>+</tt> (plus sign), 
+	positive numbers are displayed with a <tt>+</tt>. 
+	When using the precision field on strings, 
+	the number of characters displayed 
+	is limited to the number in <tt>p</tt>.
+</p>
+
+<p>
+	The <tt>f</tt> represents 
+	a type flag and is essential; 
+	it cannot be omitted.
+</p>
+
+<p>
+	Below are the types in <tt>f</tt>:
+</p>
+
+<blockquote>
+<pre>
+s       text string
+c       character (value 1 - 255)
+d       decimal (32-bit)
+u       unsigned decimal (32-bit)
+x       hexadecimal lowercase
+X       hexadecimal uppercase
+o       octal (32-bits) (not supported on all compilers)
+f       floating point
+e       scientific floating point
+E       scientific floating point
+g       general floating point
+</pre>
+</blockquote>
+
+<p>Formatting 64-bit numbers using 32-bit format specifiers will truncate and
+format the lower 32 bits of the number.
+</p>
+
+<p>For 64-bit numbers (since version 8.9.7) use the following format 
+strings on UNIX like operating systems:
+</p>
+
+<blockquote>
+<pre>
+lld     decimal (64-bit)
+llu     unsigned decimal (64-bit)
+llx     hexadecimal (64-bit)
+llX     hexadecimal uppercase(64-bit)
+</pre>
+</blockquote>
+
+<p>For 64-bit numbers (since version 8.9.7) use the following format 
+strings on Tru64 UNIX:
+</p>
+
+<blockquote>
+<pre>
+ld     decimal (64-bit)
+lu     unsigned decimal (64-bit)
+lx     hexadecimal (64-bit)
+lX     hexadecimal uppercase(64-bit)
+</pre>
+</blockquote>
+
+<p>On Win32 platforms the following characters apply for 64 bit numbers:
+</p>
+
+<blockquote>
+<pre>
+I64d    decimal (64-bit)
+I64u    unsigned decimal (64-bit)
+I64x    hexadecimal (64-bit)
+I64X    hexadecimal uppercase(64-bit)
+</pre>
+</blockquote>
+
+<p>
+	Other text may occur between, 
+	before, or after the format specs.
+</p>
+	
+<p>Note that on Tru64 UNIX the format character <tt>i</tt> can be used instead
+of <tt>d</tt>.
+</p>
+
+<br /><br />
+<b>example:</b>
+<blockquote>
+<pre>
+(format "&gt;&gt;&gt;%6.2f&lt;&lt;&lt;" 1.2345)     <span class=arw>&rarr;</span> "&gt;&gt;&gt;  1.23&lt;&lt;&lt;"
+(format "&gt;&gt;&gt;%-6.2f&lt;&lt;&lt;" 1.2345)    <span class=arw>&rarr;</span> "&gt;&gt;&gt;1.23  &lt;&lt;&lt;"
+(format "&gt;&gt;&gt;%+6.2f&lt;&lt;&lt;" 1.2345)    <span class=arw>&rarr;</span> "&gt;&gt;&gt; +1.23&lt;&lt;&lt;"
+(format "&gt;&gt;&gt;%+6.2f&lt;&lt;&lt;" -1.2345)   <span class=arw>&rarr;</span> "&gt;&gt;&gt; -1.23&lt;&lt;&lt;"
+(format "&gt;&gt;&gt;%-+6.2f&lt;&lt;&lt;" -1.2345)  <span class=arw>&rarr;</span> "&gt;&gt;&gt;-1.23 &lt;&lt;&lt;"
+
+(format "%e" 123456789)        <span class=arw>&rarr;</span> "1.234568e+08"
+(format "%12.10E" 123456789)   <span class=arw>&rarr;</span> "1.2345678900E+08"
+
+(format "%10g" 1.23)   <span class=arw>&rarr;</span> "      1.23"
+(format "%10g" 1.234)  <span class=arw>&rarr;</span> "     1.234"
+
+(format "Result = %05d" 2)  <span class=arw>&rarr;</span> "Result = 00002"
+
+(format "%-15s" "hello")        <span class=arw>&rarr;</span> "hello          "
+(format "%15s %d" "hello" 123)  <span class=arw>&rarr;</span> "          hello 123"
+(format "%5.2s" "hello")        <span class=arw>&rarr;</span> "   he"
+(format "%-5.2s" "hello")       <span class=arw>&rarr;</span> "he   "
+
+(format "%o" 80)    <span class=arw>&rarr;</span> "120"
+                                
+(format "%x %X" -1 -1)  <span class=arw>&rarr;</span> "ffffffff FFFFFFFF"
+                                
+(format "%c" 65)  <span class=arw>&rarr;</span> "A"
+</pre>
+</blockquote>
+
+<p>
+	The data to be formatted 
+	can be passed inside a list:
+</p>
+
+<blockquote>
+<pre>
+(set 'L '("hello" 123))
+(format "%15s %d" L)  <span class=arw>&rarr;</span> "          hello 123"
+</pre>
+</blockquote>
+
+<p>
+	If the format string requires it, 
+	newLISP's <tt>format</tt> will 
+	automatically convert integers 
+	into floating points 
+	or floating points into integers:
+</p>
+
+<blockquote>
+<pre>
+(format "%f" 123)      <span class=arw>&rarr;</span> 123.000000
+                       
+(format "%d" 123.456)  <span class=arw>&rarr;</span> 123
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="fv"></a>
+<h2><span class="function">fv</span></h2>
+<b>syntax: (fv <em>num-rate</em> <em>num-nper</em> <em>num-pmt</em> <em>num-pv</em> [<em>int-type</em>])</b>
+
+<p>
+	Calculates the future value of a loan 
+	with constant payment <em>num-pmt</em> 
+	and constant interest rate <em>num-rate</em> 
+	after <em>num-nper</em> period of time and 
+	a beginning principal value of <em>num-pv</em>. 
+	If payment is at the end of the period, 
+	<em>int-type</em> is 0 (zero); for payment 
+	at the end of each period, <em>int-type</em> is 1. 
+	If <em>num-type</em> is omitted, payment 
+	at the end of each period is assumed.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(fv (div 0.07 12) 240 775.30 -100000)  <span class=arw>&rarr;</span> -0.5544645052
+</pre>
+</blockquote>
+
+<p>
+	The example illustrates 
+	how a loan of $100,000 
+	is paid down to a residual of $0.55 
+	after 240 monthly payments 
+	at a yearly interest rate of 7 percent.
+</p>
+
+<p>
+	See also the functions <a href="#irr">irr</a>, 
+	<a HREF="#nper">nper</a>, <a HREF="#npv">npv</a>, 
+	<a HREF="#pmt">pmt</a>, and <a HREF="#pv">pv</a>.
+</p>
+
+<br /><br />
+
+<a NAME="gammai"></a>
+<h2><span class="function">gammai</span></h2>
+<b>syntax: (gammai <em>num-a</em> <em>num-b</em>)</b>
+
+<p>
+	Calculates the incomplete Gamma function 
+	of values <em>a</em> and <em>b</em> in <em>num-a</em> and <em>num-b</em>,
+	respectively.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(gammai 4 5)  <span class=arw>&rarr;</span> 0.7349740847
+</pre>
+</blockquote>
+
+<p>
+	The incomplete Gamma function is used to derive 
+	the probability of Chi&sup2; to exceed a 
+	given value for a degree of freedom, df, as follows:
+</p>
+
+<BLOCKQUOTE>
+<em><b>Q(Chi&sup2;|df) = Q(df/2, Chi&sup2;/2) = gammai(df/2, Chi&sup2;/2)</b></em>
+</BLOCKQUOTE>
+
+<p>
+	See also the <a HREF="#prob-chi2">prob-chi2</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="gammaln"></a>
+<h2><span class="function">gammaln</span></h2>
+<b>syntax: (gammaln <em>num-x</em>)</b>
+
+<p>
+	Calculates the log Gamma function of the value <em>x</em> in <em>num-x</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(exp (gammaln 6))  <span class=arw>&rarr;</span> 120
+</pre>
+</blockquote>
+
+<p>
+	The example uses the equality of <em>n! = gamma(n + 1)</em> 
+	to calculate the factorial value of 5.
+</p>
+
+<p>
+	The log Gamma function is also related to the Beta function, 
+	which can be derived from it:
+</p>
+
+<BLOCKQUOTE>
+<em><b>Beta(z,w) = Exp(Gammaln(z) + Gammaln(w) - Gammaln(z+w))</b></em>
+
+</BLOCKQUOTE>
+<br /><br />
+
+
+<a NAME="gcd"></a>
+<h2><span class="function">gcd</span></h2>
+<b>syntax: (gcd <em>int_1</em> [<em>int-2 ...</em>])</b>
+<a NAME="gcd"></a>
+
+<p>
+	Calculates the greatest common divisor 
+	of a group of integers.
+	The greatest common divisor of two integers 
+	that are not both zero 
+	is the largest integer that divides both numbers.
+	<tt>gcd</tt> will calculate the greatest common divisor 
+	for the first two integers in <em>int-i</em> 
+	and then further reduce the argument list 
+	by calculating the greatest common divisor of the result 
+	and the next argument in the parameter list.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(gcd 0)        <span class=arw>&rarr;</span> 0
+(gcd 0 0)      <span class=arw>&rarr;</span> 0
+(gcd 10)       <span class=arw>&rarr;</span> 10
+(gcd 12 36)    <span class=arw>&rarr;</span> 12
+(gcd 15 36 6)  <span class=arw>&rarr;</span> 3 
+</pre>
+</blockquote>
+
+<p>
+	See 
+	<a href="http://en.wikipedia.org/wiki/Greatest_common_divisor">Wikipedia</a>
+	for details and theory about gcd numbers in mathematics.
+</p>
+
+<br /><br />
+
+<a NAME="get-char"></a>
+<h2><span class="function">get-char</span></h2>
+<b>syntax: (get-char <em>int-address</em>)</b>
+
+<p>
+	Gets a character from an address 
+	specified in <em>int-address</em>. 
+	This function is useful when using 
+	imported shared library functions 
+	with <a HREF="#import">import</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+char * foo(void)
+        {
+        char * result;
+        result = "ABCDEFG";
+        return(result);
+        }
+</pre>
+</blockquote>
+
+<p>
+	Consider the above C function 
+	from a shared library, which returns a 
+	character pointer (address to a string).
+</p>
+
+<blockquote>
+<pre>
+(import "mylib.so" "foo")
+(print (get-char (foo) ))       <span class=arw>&rarr;</span>  65
+(print (get-char (+ (foo) 1)))  <span class=arw>&rarr;</span>  66
+</pre>
+
+</blockquote>
+
+<p>
+	Note that it is unsafe to use the <tt>get-char</tt> function 
+	with an incorrect address in <em>int-address</em>. Doing so 
+	could result in the system crashing or becoming unstable.
+</p>
+
+<p>
+	See also the <a href="#address">address</a>, 
+	<a HREF="#get-int">get-int</a>, 
+    <a HREF="#get-long">get-long</a>, 
+	<a HREF="#get-float">get-float</a>, 
+	<a HREF="#get-string">get-string</a>, 
+	<a HREF="#pack">pack</a>, and <a HREF="#unpack">unpack</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="get-float"></a>
+<h2><span class="function">get-float</span></h2>
+<b>syntax: (get-float <em>int-address</em>)</b>
+
+<p>
+	Gets a 64-bit double float from an address 
+	specified in <em>int-address</em>.
+	This function is helpful when using 
+	imported shared library functions (with <tt>import</tt>)
+	that return an address pointer to a double float 
+	or a pointer to a structure containing double floats.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+double float * foo(void)
+        {
+        double float * result;
+        &hellip;
+        *result = 123.456;
+        return(result);
+        }
+</pre>
+</blockquote>
+
+<p>
+	The previous C function is compiled 
+	into a shared library.
+</p>
+
+<blockquote>
+<pre>
+(import "mylib.so" "foo")
+(get-float (foo))  <span class=arw>&rarr;</span> 123.456
+</pre>
+</blockquote>
+
+<p>
+	<tt>foo</tt> is imported and returns a pointer 
+	to a double float when called.
+	Note that <tt>get-float</tt> is unsafe when used 
+	with an incorrect address in <em>int-address</em> 
+	and may result in the system crashing or becoming unstable.
+</p>
+
+<p>
+	See also the <a href="#address">address</a>, 
+	<a HREF="#get-int">get-int</a>, 
+    <a HREF="#get-long">get-long</a>,
+	<a HREF="#get-char">get-char</a>, 
+	<a HREF="#get-string">get-string</a>,
+	<a HREF="#pack">pack</a>, 
+	and <a HREF="#unpack">unpack</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="get-int"></a>
+<h2><span class="function">get-int</span></h2>
+<b>syntax: (get-int <em>int-address</em>)</b>
+
+<p>
+	Gets a 32-bit integer from 
+	the address specified in <em>int-address</em>.
+	This function is handy when using 
+	imported shared library functions with <tt>import</tt>,
+	a function returning an address pointer 
+	to an integer, or a pointer to a structure containing integers.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+int * foo(void)
+        {
+        int * result;
+        &hellip;
+        *result = 123;
+        return(result);
+        }
+
+int foo-b(void)
+        {
+        int result;
+        &hellip;
+        result = 456;
+        return(result);
+        }
+</pre>
+</blockquote>
+
+<p>
+	Consider the C function <tt>foo</tt> (from a shared library), 
+	which returns an integer pointer (address of an integer).
+</p>
+
+<blockquote>
+<pre>
+(import "mylib.so" "foo")
+(get-int (foo))  <span class=arw>&rarr;</span> 123
+(foo-b)          <span class=arw>&rarr;</span> 456
+</pre>
+</blockquote>
+
+<p>
+	Note that using <tt>get-int</tt> with an incorrect address 
+	in <em>int-address</em> is unsafe and could result 
+	in the system crashing or becoming unstable.
+</p>
+
+<p>
+	See also the <a href="#address">address</a>, 
+	<a HREF="#get-char">get-char</a>, 
+	<a HREF="#get-float">get-float</a>, 
+    <a HREF="#get-long">get-long</a>,
+	<a HREF="#get-string">get-string</a>,
+	<a HREF="#pack">pack</a>, 
+	and <a HREF="#unpack">unpack</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="get-long"></a>
+<h2><span class="function">get-long</span></h2>
+<b>syntax: (get-long <em>int-address</em>)</b>
+
+<p>
+	Gets a 64-bit integer from 
+	the address specified in <em>int-address</em>.
+	This function is handy when using <tt>import</tt>
+	to import shared library functions, 
+	a function returning an address pointer to a long integer, 
+	or a pointer to a structure containing long integers.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+long long int * foo(void)
+        {
+        int * result;
+        &hellip;
+        *result = 123;
+        return(result);
+        }
+
+long long int foo-b(void)
+        {
+        int result;
+        &hellip;
+        result = 456;
+        return(result);
+        }
+</pre>
+</blockquote>
+
+<p>
+	Consider the C function <tt>foo</tt> (from a shared library), 
+	which returns an integer pointer (address of an integer).
+</p>
+
+<blockquote>
+<pre>
+(import "mylib.so" "foo")
+(get-int (foo))  <span class=arw>&rarr;</span> 123
+(foo-b)          <span class=arw>&rarr;</span> 456
+</pre>
+</blockquote>
+
+<p>
+	Note that using <tt>get-long</tt> with an incorrect address 
+	in <em>int-address</em> is unsafe and could result 
+	in the system crashing or becoming unstable.
+</p>
+
+<p>
+	See also the <a href="#address">address</a>, 
+	<a HREF="#get-char">get-char</a>, 
+	<a HREF="#get-float">get-float</a>, 
+    <a HREF="#get-int">get-int</a>,
+	<a HREF="#get-string">get-string</a>,
+	<a HREF="#pack">pack</a>, 
+	and <a HREF="#unpack">unpack</a> functions.
+</p>
+
+<br /><br />
+
+
+<a NAME="get-string"></a>
+<h2><span class="function">get-string</span></h2>
+<b>syntax: (get-string <em>int-address</em>)</b>
+
+<p>
+	Gets a character string from the address 
+	specified in <em>int-address</em>.
+	This function is helpful when 
+	using imported shared library functions 
+	with <a HREF="#import">import</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+char * foo(void)
+        {
+        char * result;
+        result = "ABCDEFG";
+        return(result);
+        }
+</pre>
+</blockquote>
+
+<p>
+	Consider the above C function from a shared library, 
+	which returns a character pointer (address to a string).
+</p>
+
+<blockquote>
+<pre>
+(import "mylib.so" "foo")
+(print (get-string (foo)))  <span class=arw>&rarr;</span> "ABCDEFG"
+</pre>
+</blockquote>
+
+<p>
+	When a string is passed as an argument, 
+	<tt>get-string</tt> will take its address as the argument. 
+	Because <tt>get-string</tt> always breaks off 
+	at the first first <tt>\000</tt> (null character) it encounters, 
+	it can be used to retrieve a string from a buffer:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'buff "ABC\000\000\000")  <span class=arw>&rarr;</span> "ABC\000\000\000"
+
+(length buff)  <span class=arw>&rarr;</span> 6
+
+(get-string buff)  <span class=arw>&rarr;</span> "ABC"
+
+(length (get-string buff))  <span class=arw>&rarr;</span> 3
+</pre>
+</blockquote>
+
+<p>
+	See also the <a HREF="#get-char">get-char</a>, 
+	<a HREF="#get-int">get-int</a>,
+	<a HREF="#get-float">get-float</a>,
+	<a HREF="#pack">pack</a>,
+	and <a HREF="#unpack">unpack</a> functions.
+</p>
+
+<p>
+	Note that <tt>get-string</tt> can crash the system 
+	or make it unstable if the wrong address is specified.
+</p>
+
+<br /><br />
+
+<a NAME="get-url"></a>
+<h2><span class="function">get-url</span></h2>
+<b>syntax: (get-url <em>str-url</em> [<em>str-option</em>] [<em>int-timeout</em> [<em>str-header</em>]])</b>
+
+<p>Reads a web page or file specified by the URL in <em>str-url</em> using 
+the HTTP GET protocol.  Both <tt>http://</tt> and <tt>file://</tt>
+URLs are handled.  <tt>"header"</tt> can be optionally specified 
+to retrieve only the header.  An  option, <tt>"list"</tt>, 
+causes header and page information to be returned as separate strings in a list. </p>
+
+<p>A <tt>"debug"</tt> option can be specified either alone or after the
+<tt>"header"</tt> or <tt>"list"</tt> option separated by one character, 
+i.e. <tt>"header debug"</tt> or <tt>"list debug"</tt>. This option
+outputs all outgoing information to the console window.</p>
+
+<p>
+	The optional argument <em>int-timeout</em> 
+	can specify a value in milliseconds.
+	If no data is available from the host 
+	after the specified timeout, 
+	<tt>get-url</tt> returns the string <tt>ERR: timeout</tt>.
+	When other error conditions occur, 
+	<tt>get-url</tt> returns a string starting with <tt>ERR:</tt> 
+	and the description of the error.
+</p>
+	
+<p><tt>get-url</tt> requests are also understood by newLISP server nodes.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(get-url "http://www.nuevatec.com")
+(get-url "http://www.nuevatec.com" 3000)
+(get-url "http://www.nuevatec.com" "header")
+(get-url "http://www.nuevatec.com" "header" 5000)
+(get-url "http://www.nuevatec.com" "list")
+
+(get-url "file:///home/db/data.txt") ; access local file system
+
+(env "HTTP_PROXY" "http://ourproxy:8080")
+(get-url "http://www.nuevatec.com/newlisp/")
+</pre>
+</blockquote>
+
+<p>
+	The index page from the site specified 
+	in <em>str-url</em> is returned as a string.
+	In the third line, 
+	only the HTTP header 
+	is returned in a string. 
+	Lines 2 and 4 show a 
+	timeout value being used.
+</p>
+
+<p> The second example shows usage of a <tt>file://</tt> URL
+to acces <tt>/home/db/data.txt</tt> on the local file system.</p>
+
+<p>
+	The third example illustrates 
+	the use of a proxy server. 
+	The proxy server's URL must be 
+	in the operating system's environment. 
+	As shown in the example, 
+	this can be added using 
+	the <a HREF="#env">env</a> 
+	function.
+</p>
+
+<p>
+	The <em>int-timeout</em> can be followed 
+	by an optional custom header in <em>str-header</em>:
+</p>
+
+<b>Custom header</b>
+ 
+	<p>The custom header may contain options 
+	for browser cookies or other directives to the server. 
+	When no <em>str-header</em> is specified, 
+	newLISP sends certain header information by default. 
+	After the following request:
+</p>
+
+<blockquote>
+<pre>
+(get-url "http://somehost.com" 5000)
+</pre>
+</blockquote>
+
+<p>
+	newLISP will configure and send 
+	the request and header below:
+</p>
+
+<blockquote>
+<pre>
+GET / HTTP/1.1        
+Host: somehost.com
+User-Agent: newLISP v8800
+Connection: close
+</pre>
+</blockquote> 
+
+<p>
+	As an alternative, the <em>str-header</em> 
+	option could be used:
+</p>
+
+<blockquote>
+<pre>
+(get-url "http://somehost.com" 5000 
+    "User-Agent: Mozilla/4.0\r\nCookie: name=fred\r\n")
+</pre>
+</blockquote>
+
+<p>
+	newLISP will now send the 
+	following request and header:
+</p>
+
+<blockquote>
+<pre>
+GET / HTTP/1.1        
+Host: somehost.com
+User-Agent: Mozilla/4.o
+Cookie: name=fred
+Connection: close
+</pre>
+</blockquote>
+
+<p>
+	Note that when using a custom header, 
+	newLISP will only supply the <tt>GET</tt> request line, 
+	as well as the <tt>Host:</tt> and <tt>Connection:</tt> header entries. 
+	newLISP inserts all other entries supplied in the custom header 
+	between the <tt>Host:</tt> and <tt>Connection:</tt> entries. 
+	Each entry must end with a carriage return 
+	line-feed pair: <tt>\r\n</tt>.
+
+</p>
+
+<p>
+	See an HTTP transactions reference 
+	for valid header entries.
+</p>
+
+<p>
+	Custom headers can also be used 
+	in the <a HREF="#put-url">put-url</a> 
+	and <a HREF="#post-url">post-url</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="global"></a>
+<h2><span class="function">global</span></h2>
+
+<b>syntax: (global <em>sym-1</em> [<em>sym-2 ...</em>])</b>
+
+<p>
+	One or more symbols in <em>sym-1</em> [<em>sym-2 ...</em>] 
+	can be made globally accessible from contexts other than MAIN. 
+	The statement has to be executed in the MAIN context, 
+	and only symbols belonging to MAIN can be made global. 
+	<tt>global</tt> returns the last symbol made global.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(global 'aVar 'x 'y 'z)  <span class=arw>&rarr;</span> z
+
+(define (foo x) 
+  (&hellip;))
+
+(constant (global 'foo))
+</pre>
+</blockquote>
+
+<p>
+	The second example shows how <a href="#constant">constant</a> 
+	and <tt>global</tt> can be combined into one statement, 
+	protecting and making a previous function definition global.
+</p>
+
+
+<br /><br />
+
+<a NAME="globalp"></a>
+<h2><span class="function">global?</span></h2>
+
+<b>syntax: (global? <em>sym</em>)</b>
+
+<p>Checks if symbol in <em>sym</em> is global. Bult-in functions context
+symbols and all symbols made global using the function <a href="#global">global</a>
+are global:</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+global? 'print)   <span class=arw>&rarr;</span> true
+(global 'var)     <span class=arw>&rarr;</span> var
+(global? 'var)    <span class=arw>&rarr;</span> true
+
+(constant (global 'foo))
+
+(global? 'foo)    <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="if"></a>
+<h2><span class="function">if</span></h2>
+
+<b>syntax: (if <em>exp-condition</em> <em>exp-1</em> [<em>exp-2</em>])</b><br />
+
+<b>syntax: (if <em>exp-cond-1</em> <em>exp-1</em>  <em>exp-cond-2</em> <em>exp-2</em> [... ])</b>
+<p>
+	If the value of <em>exp-condition</em> is not nil or an empty list, 
+	the result of evaluating <em>exp-1</em> is returned; 
+	otherwise, the value of <em>exp-2</em> is returned. 
+	If <em>exp-2</em> is absent, the value of 
+	<em>exp-condition</em> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 50)                   <span class=arw>&rarr;</span> 50
+(if (&lt; x 100) "small" "big")  <span class=arw>&rarr;</span> "small"
+(set 'x 1000)                 <span class=arw>&rarr;</span> 1000
+(if (&lt; x 100) "small" "big")  <span class=arw>&rarr;</span> "big"
+(if (&gt; x 2000) "big")         <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<p>
+	The second form of <tt>if</tt> works similarly 
+	to <a href="#cond">cond</a>, except it does not take 
+	parentheses around the condition-body pair of expressions. 
+	In this form, <tt>if</tt> can have 
+	an unlimited number of arguments.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (classify x)
+    (if
+        (&lt; x 0) "negative"
+        (&lt; x 10) "small"
+        (&lt; x 20) "medium"
+        (&gt;= x 30) "big"
+        "n/a"))
+
+(classify 15)   <span class=arw>&rarr;</span> "medium"
+(classify 100)  <span class=arw>&rarr;</span> "big"
+(classify 22)   <span class=arw>&rarr;</span> "n/a"
+(classify -10)  <span class=arw>&rarr;</span> "negative"
+</pre>
+</blockquote>
+
+<p>
+	The last expression, <tt>"n/a"</tt>, is optional. 
+	When this option is omitted, 
+	the evaluation of <tt>(&gt;= x 30)</tt> 
+	is returned, behaving exactly like a traditional 
+	<a href="#cond">cond</a> but without requiring 
+	parentheses around the condition-expression pairs.
+</p>
+
+<p>
+	In any case, the whole <tt>if</tt> expression 
+	always returns the last expression or condition evaluated.
+</p>
+
+<p>
+	See also the <a HREF="#unless">unless</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="ifft"></a>
+<h2><span class="function">ifft</span></h2>
+<b>syntax: (ifft <em>list-num</em>)</b>
+
+<p>
+	Calculates the inverse discrete Fourier transform 
+	on a list of complex numbers in <em>list-num</em> 
+	using the FFT method (Fast Fourier Transform). 
+	Each complex number is specified by its real part, 
+	followed by its imaginary part. 
+	In case only real numbers are used, 
+	the imaginary part is set to <tt>0.0</tt> (zero). 
+	When the number of elements in <em>list-num</em> 
+	is not an integer power of 2, 
+	<tt>ifft</tt> increases the number of elements 
+	by padding the list with zeroes. 
+	When complex numbers are 0 in the imaginary part, 
+	simple numbers can be used.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(ifft (fft '((1 0) (2 0) (3 0) (4 0)))) 
+<span class=arw>&rarr;</span> ((1 0) (2 0) (3 0) (4 0))
+
+;; when imaginary part is 0, plain numbers work too
+
+(ifft (fft '(1 2 3 4))) 
+<span class=arw>&rarr;</span> ((1 0) (2 0) (3 0) (4 0))
+</pre>
+</blockquote>
+
+<p>
+	The inverse operation of <tt>ifft</tt> 
+	is the <a HREF="#fft">fft</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="import"></a>
+<h2><span class="function">import</span></h2>
+<b>syntax: (import <em>str-lib-name</em> <em>str-function-name</em> ["cdecl"])</b>
+
+<p>
+	Imports the function specified in <em>str-function-name</em> 
+	from a shared library named in <em>str-lib-name</em>. 
+	The functions <a HREF="#address">address</a>, 
+	<a HREF="#get-char">get-char</a>, 
+	<a HREF="#get-int">get-int</a>, 
+	<a HREF="#get-float">get-float</a>, 
+	<a HREF="#get-string">get-string</a>, 
+	<a HREF="#pack">pack</a>, and 
+	<a HREF="#unpack">unpack</a> 
+	can be used to retrieve return values 
+	or to unpack data from returned structure addresses. 
+	If the library is not located 
+	in the normal library search path, 
+	<em>str-lib-name</em> must contain 
+	the full path name.
+</p>
+
+<p>
+	To transform newLISP data types into the data types 
+	needed by the imported function, use the functions 
+	<a href="#float">float</a> for 64-bit double floats, 
+	<a href="#flt">flt</a> for 32-bit floats, 
+	and <a href="#int">int</a> for 32-bit integers. 
+	By default, newLISP passes 
+	floating point numbers 
+	as 64-bit double floats, 
+	integers as 32-bit integers, 
+	and strings as 32-bit integers 
+	for string addresses.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; import in Linux
+
+(import "libc.so.6" "printf")  <span class=arw>&rarr;</span> printf &lt;400862A0&gt;
+
+;; import in Mac OS X
+
+(import "libc.dylib" "printf")  <span class=arw>&rarr;</span> printf &lt;90022080&gt;
+
+;; import in CYGWIN
+
+(import "cygwin1.dll" "printf")  <span class=arw>&rarr;</span> printf &lt;6106B108&gt;
+
+(printf "%g %s %d %c\n" 1.23 "hello" 999 65)
+<b>1.23 hello 999 A</b>
+<span class=arw>&rarr;</span> 17 ; return value
+
+;; import Win32 DLLs in Win32 or CYGWIN version
+
+(import "kernel32.dll" "GetTickCount")  <span class=arw>&rarr;</span> GetTickCount
+(import "user32.dll" "MessageBoxA")     <span class=arw>&rarr;</span> MessageBoxA
+(GetTickCount)                          <span class=arw>&rarr;</span> 3328896
+</pre>
+</blockquote>
+
+
+<p>
+	In the first example, 
+	the string "1.23 hello 999 A" 
+	is printed as a side effect, 
+	and the value 17 (number of 
+	characters printed) is returned. 
+	Any C function can be imported 
+	from any shared library in this way.
+</p>
+
+<p>
+	The message box example pops up 
+	a Windows dialog box, which may be hidden 
+	behind the console window. 
+	The console prompt does not return until the 
+	'OK' button is pressed in the message box.
+</p>
+
+<blockquote>
+<pre>
+;;this pops up a message box
+
+(MessageBoxA 0 "This is the body" "Caption" 1) 
+</pre>
+</blockquote>
+
+
+<p>
+	The other examples show several imports 
+	of Win32 DLL functions and the details of passing values 
+	<em>by value</em> or <em>by reference</em>. 
+	Whenever strings or numbers are passed by reference, 
+	space must be reserved beforehand.
+</p>
+
+<blockquote>
+<pre>
+;; allocating space for a string return value
+
+(import "kernel32.dll" "GetWindowsDirectoryA")
+(set 'str (dup "\000" 64)  ; reserve space and initialize
+
+(GetWindowsDirectoryA str (length str))
+
+str  <span class=arw>&rarr;</span> "C:\\WINDOWS\000                     "
+
+(slice str 0 (find "\000" str))  <span class=arw>&rarr;</span> "C:\\WINDOWS"
+
+;; or use trim
+(trim str)  <span class=arw>&rarr;</span> "C:\\WINDOWS"
+
+;; passing an integer parameter by reference
+
+(import "kernel32.dll" "GetComputerNameA")
+
+(set 'str (dup "\000" 64)  ; reserve space, initialize
+
+;; get size in a buffer lpNum
+(set 'lpNum (pack "lu" (length str)))  
+
+;; call the function
+(GetComputerNameA str lpNum) 
+
+str  <span class=arw>&rarr;</span> "LUTZ-PC\000                        "
+
+(slice str 0 (find "\000" str))  <span class=arw>&rarr;</span> "LUTZ-PC"
+
+;; or use trim
+(trim str)  <span class=arw>&rarr;</span> "LUTZ-PC"
+</pre>
+</blockquote>
+
+<p>
+	<tt>import</tt> returns the address of the function, 
+	which can be used to assign a different name 
+	to the imported function.
+</p>
+
+<blockquote>
+<pre>
+(set 'imprime (import "libc.so.6" "printf")) 
+<span class=arw>&rarr;</span> printf &lt;400862A0&gt;
+
+(imprime "%s %d" "hola" 123)                 
+<span class=arw>&rarr;</span> "hola 123"
+</pre>
+</blockquote>
+
+<p>
+	Note that the Win32 version of newLISP 
+	uses standard call <em>stdcall</em> conventions 
+	to call DLL library routines. 
+	This is necessary for calling DLLs that belong 
+	to the Win32 operating system (e.g., odbc32.dll). 
+	Most third-party DLLs are compiled for 
+	C declaration <em>cdecl</em> calling conventions 
+	and may need to specify the string <tt>"cdecl"</tt> 
+	as an additional last argument when importing functions. 
+	newLISP compiled for Linux and other UNIX systems 
+	uses the <em>cdecl</em> calling conventions by default 
+	and ignores any additional string.
+</p>
+
+<blockquote>
+<pre>
+;; force cdecl calling conventions on Win32
+(import "sqlite.dll" "sqlite_open" "cdecl")  <span class=arw>&rarr;</span> sqlite_open &lt;673D4888&gt;
+</pre>
+</blockquote>
+
+
+<p>
+	Imported functions may take up to fourteen arguments. 
+	Note that floating point arguments 
+	take up two spaces each
+	(e.g., passing five floats takes up 
+	ten of the fourteen parameters).
+</p>
+
+
+<br /><br />
+
+<a NAME="inc"></a>
+<h2><span class="function">inc</span></h2>
+<b>syntax: (inc <em>sym</em> [<em>num</em>])</b>
+
+<p>
+	Increments the number in <em>sym</em> by 1 
+	or by the optional number <em>num</em> 
+	and returns the result. 
+	<tt>inc</tt> performs mixed int 
+	and float arithmetic according 
+	to the rules outlined below.
+</p>
+
+<p>
+	If <em>num</em> is absent, 
+	<tt>inc</tt> always returns 
+	an integer in <em>sym</em>. 
+	If the input arguments are floats and <tt>num</tt> is absent, 
+	the input arguments are truncated to integers.
+</p>
+
+<p>
+	Integer calculations (without <em>num</em>) 
+	resulting in numbers greater than 
+	9,223,372,036,854,775,807 wrap around to negative numbers. 
+	Results smaller than -9,223,372,036,854,775,808 
+	wrap around to positive numbers.
+</p>
+
+<p>
+	If <em>num</em> is supplied, 
+	<tt>inc</tt> always returns 
+	the result as floating point, 
+	even for integer input arguments.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 0)     <span class=arw>&rarr;</span> 0
+(inc 'x)       <span class=arw>&rarr;</span> 1
+x              <span class=arw>&rarr;</span> 1
+(inc 'x 0.25)  <span class=arw>&rarr;</span> 1.25
+x              <span class=arw>&rarr;</span> 1.25
+
+(inc 'x)  <span class=arw>&rarr;</span> 2  ; gets truncated
+</pre>
+</blockquote>
+
+<p>
+	Use the <a href="#dec">dec</a> function for decrementing.
+</p>
+
+
+<br /><br />
+
+<a NAME="index"></a>
+<h2><span class="function">index</span></h2>
+<b>syntax: (index <em>exp-predicate</em> <em>exp-list</em>)</b>
+
+<p>
+	Applies the predicate <em>exp-predicate</em> 
+	to each element of the list <em>exp-list</em> 
+	and returns a list containing the indices of the elements 
+	for which <em>exp-predicate</em> is true.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(index symbol? '(1 2 d 4 f g 5 h))  <span class=arw>&rarr;</span> (2 4 5 7)
+
+(define (big? x) (&gt; x 5))  <span class=arw>&rarr;</span> (lambda (x) (&gt; x 5))
+
+(index big? '(1 10 3 6 4 5 11))  <span class=arw>&rarr;</span> (1 3 6)
+</pre>
+</blockquote>
+
+<p>
+	The predicate may be a built-in predicate, 
+	a user-defined function, or a lambda expression.
+</p>
+
+<p>
+	Use the <a HREF="#filter">filter</a> function 
+	to return the elements themselves.
+</p>
+
+<br /><br />
+
+<a NAME="int"></a>
+<h2><span class="function">int</span></h2>
+
+<b>syntax: (int <em>exp</em> [<em>exp-default</em>] [<em>int-base</em>])</b>
+
+<p>
+	If the expression in <em>exp</em> evaluates to a number or a string, 
+	the result is converted to an integer and returned. 
+	If <em>exp</em> cannot be converted to an integer, 
+	then <tt>nil</tt> or the evaluation of 
+	<em>exp-default</em> will be returned. 
+	This function is mostly used when translating strings 
+	from user input or from parsing text. 
+	If <em>exp</em> evaluates to a string, 
+	the string must start with a digit; one or more spaces; 
+	or the <tt>+</tt> or <tt>-</tt> sign.
+	The string must begin with '<tt>0x</tt>' 
+	for hexadecimal strings or 
+	'<tt>0</tt>' (zero) for octal strings. 
+	If <em>str</em> is invalid, 
+	<tt>int</tt> returns <tt>nil</tt> 
+	as a default value if not otherwise specified.
+</p>
+
+<p>
+	A second optional parameter 
+	can be used to force the number base 
+	of conversion to a specific value.
+</p>
+
+<p>
+	Integers larger than 9,223,372,036,854,775,807 
+	are truncated to 9,223,372,036,854,775,807. 
+	Integers smaller than -9,223,372,036,854,775,808 
+	are truncated to -9,223,372,036,854,775,808.
+</p>
+
+<p>
+	When converting from a float 
+	(as in the second form of <tt>int</tt>), 
+	floating point values larger or smaller 
+	than the integer maximum or minimum 
+	are also truncated. 
+	A floating point expression evaluating to <tt>NaN</tt> 
+	is converted to 0 (zero).
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(int "123")          <span class=arw>&rarr;</span> 123
+(int " 123")         <span class=arw>&rarr;</span> 123
+(int "a123" 0)       <span class=arw>&rarr;</span> 0
+(int (trim " 123"))  <span class=arw>&rarr;</span> 123
+(int "0xFF")         <span class=arw>&rarr;</span> 255
+(int "055")          <span class=arw>&rarr;</span> 45
+(int "1.567")        <span class=arw>&rarr;</span> 1
+(int 1.567)          <span class=arw>&rarr;</span> 1
+
+(integer? 1.00)        <span class=arw>&rarr;</span> nil
+(integer? (int 1.00))  <span class=arw>&rarr;</span> true
+
+(int "1111" 0 2)  <span class=arw>&rarr;</span> 15   ; base 2 conversion
+(int "0FF" 0 16)  <span class=arw>&rarr;</span> 255  ; base 16 conversion
+
+(int 'xyz)     <span class=arw>&rarr;</span> nil
+(int 'xyz 0)   <span class=arw>&rarr;</span> 0
+(int nil 123)  <span class=arw>&rarr;</span> 123
+
+(int "abc" "not a number")  <span class=arw>&rarr;</span> "not a number"
+
+(print "Enter a num:")
+(set 'num (int (read-line)))
+</pre>
+</blockquote>
+
+<p>
+	Use the <a HREF="#float">float</a> function 
+	to convert arguments to floating point numbers.
+</p>
+
+<br /><br />
+
+<a NAME="integerp"></a>
+<h2><span class="function">integer?</span></h2>
+<b>syntax: (integer? <em>exp</em>)</b>
+
+<p>
+	Returns <tt>true</tt> only if the value 
+	of <em>exp</em> is an integer; 
+	otherwise, it returns <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'num 123)  <span class=arw>&rarr;</span> 123
+(integer? num)  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="intersect"></a>
+<h2><span class="function">intersect</span></h2>
+<b>syntax: (intersect <em>list-A</em> <em>list-B</em>)</b><br />
+
+<b>syntax: (intersect <em>list-A</em> <em>list-B</em> <em>bool</em>)</b>
+
+<p>
+	In the first syntax, 
+	<tt>intersect</tt> returns a list 
+	containing one copy of each element 
+	found both in <em>list-A</em> and <em>list-B</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(intersect '(3 0 1 3 2 3 4 2 1) '(1 4 2 5))  
+<span class=arw>&rarr;</span> (2 4 1)
+</pre>
+</blockquote>
+
+<p>
+	In the second syntax, 
+	<tt>intersect</tt> returns a list of all elements 
+	in <em>list-A</em> that are also in <em>list-B</em>, 
+	without eliminating duplicates in <em>list-A</em>. 
+	<em>bool</em> is an expression evaluating to <tt>true</tt> 
+	or any other value not <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(intersect '(3 0 1 3 2 3 4 2 1) '(1 4 2 5) true)
+<span class=arw>&rarr;</span> (1 2 4 2 1)
+</pre>
+</blockquote>
+
+<p>
+	See also the set functions 
+	<a HREF="#difference">difference</a> and 
+	<a HREF="#unique">unique</a>.
+</p>
+
+<br /><br />
+
+<a NAME="invert"></a>
+<h2><span class="function">invert</span></h2>
+<b>syntax: (invert <em>matrix</em>)</b>
+
+<p>
+	Returns the inversion of a 
+	two-dimensional matrix in <em>matrix</em>. 
+	The matrix must be square, with the same number 
+	of rows and columns, and <em>non-singular</em> (invertible). 
+	Matrix inversion can be used 
+	to solve systems of linear equations 
+	(e.g., multiple regression in statistics). 
+	newLISP uses LU-decomposition of 
+	the matrix to find the inverse.
+</p>
+
+<p>
+	The dimensions of a matrix 
+	are defined by the number of rows 
+	times the number of elements 
+	in the first row. 
+	For missing elements in non-rectangular matrices, 
+	<tt>0.0</tt> (zero) is assumed. 
+	A matrix can either be a nested list 
+	or an <a href="#array">array</a>.
+</p> 
+	
+<p>
+	<tt>invert</tt> will return <tt>nil</tt> 
+	if the matrix is <i>singular</i> and cannot be inverted.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'A '((-1 1 1) (1 4 -5) (1 -2 0)))
+(invert A)  <span class=arw>&rarr;</span> ((10 2 9) (5 1 4) (6 1 5))
+</pre>
+</blockquote>
+
+<p>
+	All operations shown here on lists 
+	can be performed on arrays, as well.
+</p>
+
+<p>
+	See also the matrix functions <a href="#det">det</a>,
+	<a href="#mat">mat</a>, <a HREF="#multiply">multiply</a>
+    and <a HREF="#transpose">transpose</a>.
+</p>
+
+<br /><br />
+
+
+<a NAME="irr"></a>
+<h2><span class="function">irr</span></h2>
+<b>syntax: (irr <em>list-amounts</em> [<em>list-times</em> [<em>num-guess</em>]])</b>
+
+<p>
+	Calculate the internal rate of return 
+	of a cash flow per time period. 
+	The internal rate of return is the interest rate 
+	that makes the present value of a cash flow equal to 0.0 (zero). 
+	In-flowing (negative values) and out-flowing (positive values) 
+	amounts are specified in  <em>list-amounts</em>. 
+	If no time periods are specified in <em>list-times</em>, 
+	amounts in <em>list-amounts</em> correspond to 
+	consecutive time periods increasing by 1 (1, 2, 3&mdash;). 
+	The algorithm used is iterative, 
+	with an initial guess of 0.5 (50 percent). 
+	Optionally, a different 
+	initial guess can be specified. 
+	The algorithm returns when a precision 
+	of 0.000001 (0.0001 percent) is reached. 
+	<tt>nil</tt> is returned if the algorithm 
+	cannot converge after 50 iterations.
+</p>
+
+<p>
+	<em>irr</em> is often used to decide 
+	between different types of investments.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(irr '(-1000 500 400 300 200 100))  
+<span class=arw>&rarr;</span> 0.2027
+
+(npv 0.2027 '(500 400 300 200 100)) 
+<span class=arw>&rarr;</span> 1000.033848 ; ~ 1000
+
+(irr '(-1000 500 400 300 200 100) '(0 3 4 5 6 7)) 
+<span class=arw>&rarr;</span> 0.0998
+
+(irr '(-5000 -2000 5000 6000) '(0 3 12 18)) 
+<span class=arw>&rarr;</span> 0.0321
+</pre>
+</blockquote>
+
+<p>
+	If an initial investment of 1,000 
+	yields 500 after the first year, 
+	400 after two years, and so on, 
+	finally reaching 0.0 (zero) after five years, 
+	then that corresponds to a yearly return 
+	of about 20.2 percent. 
+	The next line demonstrates the relation 
+	between <tt>irr</tt> and <a href="#npv">npv</a>. 
+	Only 9.9 percent returns are necessary when making 
+	the first withdrawal after three years.
+</p>
+
+<p>
+	In the last example, securities 
+	were initially purchased for 5,000, 
+	then for another 2,000 three months later. 
+	After a year, securities for 5,000 are sold. 
+	Selling the remaining securities 
+	after 18 months renders 6,000. 
+	The internal rate of return is 3.2 percent per month, 
+	or about 57 percent in 18 months.
+</p>
+
+<p>
+	See also the <a HREF="#fv">fv</a>, 
+	<a HREF="#nper">nper</a>, 
+	<a HREF="#npv">npv</a>, 
+	<a HREF="#pmt">pmt</a>, 
+	and <a href="#pv">pv</a> functions.
+</p> 
+
+<br /><br />
+
+
+
+<a NAME="join"></a>
+<h2><span class="function">join</span></h2>
+<b>syntax: (join <em>list-of-strings</em> [<em>str-joint</em> [<em>boool-trail-joint</em>]])</b>
+
+<p>
+	Concatenates the given   
+	list of strings 
+	in <em>list-of-strings</em>. 
+	If <em>str-joint</em> is present, 
+	it is inserted between each string in the join.
+	If <em>bool-trail-joint</em> is <tt>true</tt>
+	then a joint string is also appended to the last string.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'lst '("this" "is" "a" "sentence"))
+
+(join lst " ")  <span class=arw>&rarr;</span> "this is a sentence"
+
+(join (map string (slice (now) 0 3)) "-")  <span class=arw>&rarr;</span> "2003-11-26"
+
+(join (explode "keep it together"))  <span class=arw>&rarr;</span> "keep it together"
+
+(join '("A" "B" "C") "-")         <span class=arw>&rarr;</span> "A-B-C"
+(join '("A" "B" "C") "-" true)    <span class=arw>&rarr;</span> "A-B-C-"
+</pre>
+</blockquote>
+
+<p>
+	See also the <a HREF="#append">append</a>, 
+	<a HREF="#string">string</a>, 
+	and <a HREF="#explode">explode</a> functions, 
+	which are the inverse of the <tt>join</tt> operation.
+</p>
+
+<br /><br />
+
+<a NAME="lambda"></a>
+
+<h2><span class="function">lambda</span></h2>
+
+<p>See the description of <a href="#fn">fn</a> which is a shorter form of writing <tt>lambda</tt>.</p
+
+<br /><br />
+
+<a NAME="lambda-macro"></a>
+
+<h2><span class="function">lambda-macro</span></h2>
+
+<p>See the description of <a href="#define-macro">define-macro</a>.</p
+
+<br /><br />
+
+<a NAME="lambdap"></a>
+<h2><span class="function">lambda?</span></h2>
+<b>syntax: (lambda? <em>exp</em>)</b>
+
+<p>Returns <tt>true</tt> only if the value of <em>exp</em> is a lambda expression
+and otherwise <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (square x) (* x x))
+(lambda? square)  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<p>See <a href="#define">define</a> and <a href="#define-macro">define-macro</a> for
+more information about <em>lambda</em> expressions.
+</p>
+<br /><br />
+
+<a NAME="last"></a>
+
+<h2><span class="function">last</span></h2>
+<b>syntax: (last <em>list</em>)</b><br />
+<b>syntax: (last <em>array</em>)</b><br />
+<b>syntax: (last <em>str</em>)</b>
+
+<p>Returns the last element of a list or a string.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(last '(1 2 3 4 5))  <span class=arw>&rarr;</span> 5
+(last '(a b (c d)))  <span class=arw>&rarr;</span> (c d)
+
+(set 'A (array 3 2 (sequence 1 6)))
+<span class=arw>&rarr;</span> ((1 2) (3 4) (5 6))
+(last A)             <span class=arw>&rarr;</span> (5 6)
+</pre>
+</blockquote>
+
+<p>In the second version the last character in the string <em>str</em> is returned as a
+string.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(last "newLISP")  <span class=arw>&rarr;</span> "P"
+</pre>
+</blockquote>
+
+<p>
+Note that <a href="#last">last</a> works on character boundaries 
+rather than byte boundaries 
+when the UTF-8&ndash;enabled version of newLISP is used.
+See also <a HREF="#first">first</a>, <a HREF="#rest">rest</a> and <a href="#nth">nth</a>.
+</p>
+
+<br /><br />
+
+<a NAME="legalp"></a>
+<h2><span class="function">legal?</span></h2>
+<b>syntax: (legal? <em>str</em>)</b><br />
+
+<p>
+The token in <em>str</em> is verified as a legal newLISP symbol. 
+Non legal symbols can be created using the <a href="#sym">sym</a> function
+(e.g. symbols containing spaces, quotes, or other characters not normally allowed). 
+Non legal symbols are created frequently 
+when using them for associative data access:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(symbol? (sym "one two"))  <span class=arw>&rarr;</span> true
+
+(legal? "one two")  <span class=arw>&rarr;</span> nil  ; contains a space
+
+(set (sym "one two") 123)  <span class=arw>&rarr;</span> 123
+
+(eval (sym "one two"))  <span class=arw>&rarr;</span> 123
+</pre>
+</blockquote>
+
+<p>The example shows that the string <tt>"one two"</tt> does not contain a legal
+symbol although a symbol can be created from this string and treated like a
+variable.
+</p>
+
+<br /><br />
+
+<a NAME="length"></a>
+<h2><span class="function">length</span></h2>
+<b>syntax: (length <em>expr</em>)</b><br />
+
+<p>Returns the number of elements in a list, the number of rows in
+an array or the number of characters in a string.
+</p>
+
+<p><tt>length</tt> applied to a symbol returns the length of the symbol name.
+Applied to a number, <tt>length</tt> returns the number of
+bytes needed in memory to store that number: 4 for integers and 8 for floating point numbers.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(length '(a b (c d) e))         <span class=arw>&rarr;</span> 4
+(length '())                    <span class=arw>&rarr;</span> 0
+(set 'someList '(q w e r t y))  <span class=arw>&rarr;</span> (q w e r t y)
+(length someList)               <span class=arw>&rarr;</span> 6
+
+(set 'ary (array 2 4 '(0)))  <span class=arw>&rarr;</span> ((1 2 3 4) (5 6 7 8))
+(length ary)                 <span class=arw>&rarr;</span> 2
+
+(length "Hello World")  <span class=arw>&rarr;</span> 11
+(length "")             <span class=arw>&rarr;</span> 0
+
+(length 'someVar)  <span class=arw>&rarr;</span> 7
+(length 123)       <span class=arw>&rarr;</span> 8
+(length 1.23)      <span class=arw>&rarr;</span> 8
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="let"></a>
+<h2><span class="function">let</span></h2>
+<b>syntax: (let ((<em>sym1</em> <em>exp-init1</em>) [ (<em>sym2</em> <em>exp-init2</em>) ... ] ) <em>body</em>)</b><br />
+<b>syntax: (let (<em>sym1</em> <em>exp-init1</em> [<em>sym2</em> <em>exp-init2</em> ... ] ) <em>body</em>)</b>
+
+<p>One or more variables <em>sym1</em>, <em>sym2</em>, ... are declared locally and
+initialized with expressions in <em>exp-init1</em>, <em>exp-init2</em>, etc.
+When the local variables are initialized the initializer expressions evaluate
+using symbol bindings as before the <tt>let</tt> statement. To incrementally use
+symbol bindings as evaluated during the initialization of locals in <tt>let</tt>,
+use <a href="#letn">letn</a>.
+One or more expressions in <em>exp-body</em> are evaluated using the local
+definitions of <em>sym1</em>, <em>sym2</em> etc. <tt>let</tt> is useful for
+breaking up complex expressions by defining local variables close to the
+place where they are used. The second form omits the parenthesis around the
+variable expression pairs but functions identical.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (sum-sq a b)
+(let ((x (* a a)) (y (* b b)))
+(+ x y)))
+
+(sum-sq 3 4) <span class=arw>&rarr;</span> 25
+
+(define (sum-sq a b)           ; alternative syntax
+(let (x (* a a) y (* b b))
+(+ x y)))
+</pre>
+</blockquote>
+
+<p>The variables <tt>x</tt> and <tt>y</tt> are initialized, then the expression
+
+<tt>(+ x y)</tt> is evaluated. The let form is just an optimized version and syntactic
+convenience for writing:
+</p>
+
+<blockquote>
+<pre>
+((lambda (<em>sym1</em> [<em>sym2</em> ... ]) <em>exp-body</em> ) <em>exp-init1</em> [ <em>exp-init2</em> ])
+</pre>
+</blockquote>
+
+<p>See also <a href="#letn">letn</a> for an incremental or nested form of
+<tt>let</tt>.
+</p>
+
+<br /><br />
+
+<a NAME="letex"></a>
+<h2><span class="function">letex</span></h2>
+<b>syntax: (letex ((<em>sym1</em> <em>exp-init1</em>) [ (<em>sym2</em> <em>exp-init2</em>) ... ] ) <em>body</em>)</b><br />
+
+<b>syntax: (letex (<em>sym1</em> <em>exp-init1</em> [<em>sym2</em> <em>exp-init2</em> ... ] ) <em>body</em>)</b>
+
+<p>This functions combines <a href="#let">let</a> and <a href="#expand">expand</a> to 
+expand local variables into an expression before evaluating it.
+</p>
+
+<p>Both forms provide the same functionality, but in the second form the parentheses around the initializers can be omitted.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(letex '(x 1 y 2 z 3) '(x y z))    <span class=arw>&rarr;</span> (1 2 3)
+</pre>
+</blockquote>
+
+<p>Before the expression <tt>'(x y z)</tt> gets evaluated, <tt>x, y</tt> and <tt>z</tt>
+
+are literally replaced with the initializers from the <tt>letex</tt> initializer list.
+The final expression which gets evaluated is <tt>'(1 2 3)</tt>.
+</p>
+
+<p>The following is a more complex realistic example. <tt>letex</tt> and 
+<a href="#define-macro">define-macro</a> are used together to define a <tt>dolist-while</tt>,
+which loops through a list while certain condition is true:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define-macro (dolist-while)
+(letex (var (args 0 0)
+lst (args 0 1)
+cnd (args 0 2)
+body (cons 'begin (1 (args))))
+(let (res)
+(catch (dolist (var lst)
+(if (set 'res cnd) body (throw res)))))))
+
+&gt; (dolist-while (x '(a b c d e f) (!= x 'd)) (println x))
+a
+b
+c
+nil
+&gt;
+</pre>
+</blockquote>
+
+<p>The <a href="#args">args</a> function is used to access the unevaluated argument list from 
+<a href="#define-macro">define-macro</a>.
+</p>
+
+<br /><br />
+
+<a NAME="letn"></a>
+<h2><span class="function">letn</span></h2>
+<b>syntax: (letn ((<em>sym1</em> <em>exp-init1</em>) [ (<em>sym2</em> <em>exp-init2</em>) ... ] ) <em>body</em>)</b><br />
+<b>syntax: (letn (<em>sym1</em> <em>exp-init1</em> [<em>sym2</em> <em>exp-init2</em> ... ] ) <em>body</em>)</b>
+
+<p><tt>letn</tt> is like a <em>nested let</em> and works similar to <a href="#let">let</a>, but will 
+incrementally use the new symbol bindings when evaluating the initializer expressions as
+if several <a href="#let">let</a> were nested. The following comparison
+of <a href="#let">let</a> and <tt>letn</tt> show the difference:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 10)
+(let ((x 1) (y (+ x 1))) 
+(list x y))           <span class=arw>&rarr;</span> (1 11)
+
+(letn ((x 1) (y (+ x 1))) 
+(list x y))          <span class=arw>&rarr;</span> (1 2)
+</pre>
+</blockquote>
+
+<p>While in the first example using <a href="#let">let</a> the variable <tt>y</tt> is
+calculated using the binding of <tt>x</tt> before the <a href="#let">let</a> expression,
+in the second example using <tt>letn</tt> the variable <tt>y</tt> is calculated using 
+the new local binding of <tt>x</tt>.
+</p>
+
+<blockquote>
+<pre>
+(letn  (x 1 y x) 
+(+ x y))             <span class=arw>&rarr;</span>  2
+
+;; same as nested let's
+
+(let (x 1)
+(let (y x)
+(+ x y)))       <span class=arw>&rarr;</span>  2
+</pre>
+</blockquote>
+
+<p><tt>letn</tt> works like several <em>nested</em> <a href="#let">let</a>. The parenthesis
+around the initializer expressions can be omitted.
+</p>
+
+<br /><br />
+
+<a NAME="list"></a>
+<h2><span class="function">list</span></h2>
+<b>syntax: (list <em>exp-1</em> [<em>exp-2</em> ... ])</b>
+
+<p>The <em>exp</em> are evaluated and the values used to construct a new list.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(list 1 2 3 4 5)                <span class=arw>&rarr;</span> (1 2 3 4 5)
+(list 'a '(b c) (+ 3 4) '() '*) <span class=arw>&rarr;</span> (a (b c) 7 () *)
+</pre>
+</blockquote>
+
+<p>See also <a href="#cons">cons</a> and <a href="#push">push</a> for other
+forms of building lists.
+</p>
+
+<br /><br />
+
+<a NAME="listp"></a>
+<h2><span class="function">list?</span></h2>
+<b>syntax: (list? <em>exp</em>)</b>
+
+<p>Returns <tt>true</tt> only if the value of <em>exp</em> is a list; otherwise
+returns <tt>nil</tt>.  Note that lambda and lambda-macro
+expressions are also recognized as special instances of a list expression.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'var '(1 2 3 4))    <span class=arw>&rarr;</span> (1 2 3 4)
+(list? var)              <span class=arw>&rarr;</span> true
+
+(define (double x) (+ x x))
+
+(list? double)           <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="load"></a>
+
+<h2><span class="function">load</span></h2>
+<b>syntax: (load <em>str-file-name</em> [<em>str-file-name-2 ...</em>] [<em>sym-context</em>])</b>
+
+<p>Loads and translates newLISP from a source file specified in one or more <em>str-file-name</em> 
+and evaluates the expressions contained in the file(s). When loading is successful
+<tt>load</tt> returns the result of the last expression in the last file evaluated. If a file 
+cannot be loaded <tt>load</tt> throws an error.
+</p>
+
+<p>
+An optional <em>sym-context</em> can be specified, 
+which becomes the context of evaluation, 
+unless such a context switch is already present 
+in the file being loaded. 
+By default, 
+files which do not contain <a href="#context">context</a> switches 
+will be loaded into the <tt>MAIN</tt> context.
+</p>
+
+<p>The <em>str-file-name</em> specs can contain URLs. Both <tt>http://</tt> and <tt> file://</tt>
+URLs are supported.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(load "myfile.lsp")    
+
+(load "a-file.lsp" "b-file.lsp") 
+
+(load "file.lsp" "http://mysite.org/mypro")
+
+(load "http://192.168.0.21:6000//home/test/program.lsp")
+
+(load "a-file.lsp" "b-file.lsp" 'MyCTX)
+
+(load "file:///usr/share/newlisp/mysql5.lsp")
+</pre>
+</blockquote>
+
+<p>In case expressions evaluated during the <tt>load</tt> are changing the 
+<a href="#context">context</a>, this will not influence the programming
+module doing the <tt>load</tt>. The current <a href="#context">context</a>
+after the <tt>load</tt> statement will always be the same as before in the 
+<tt>load</tt>.
+</p>
+
+<p>Normal file specs and URLs can be mixed in the same load command.
+</p>
+
+<p><tt>load</tt> with <tt>HTTP</tt> URLs can also be used to load code
+remotely from newLISP server nodes running on UNIX like operating system. 
+In this mode, <tt>load</tt> will issue
+an HTTP GET request to the target URL. Note that a double backslash is required 
+when path names are specified relative to the root directory. <tt>load</tt>
+in <tt>HTTP</tt> mode will observe a 60-second timeout.</p>
+</p></p>
+
+<p>The second to last line causes the files to be loaded in to the context <tt>MyCTX</tt>.
+The quote forces the context to be created if it did not exist.
+</p>
+
+<p>The <tt>file://</tt> URL is followed by a third <tt>/</tt> for the directory spec.
+</p>
+
+<br /><br />
+
+<a NAME="local"></a>
+<h2><span class="function">local</span></h2>
+<b>syntax: (local (<em>sym-1</em> [<em>sym-2 ...</em>]) <em>body</em>)</b>
+
+<p>
+Initializes one or more symbols 
+in <em>sym-1&mdash;</em> to <tt>nil</tt>, 
+evaluates the expressions in <em>body</em>, 
+and returns the result of the last evaluation.
+</p>
+
+<p>
+<tt>local</tt> works similarly to <a href="#let">let</a>,
+but local variables are all initialized to <tt>nil</tt>.
+</p>
+
+<p>
+<tt>local</tt> provides a simple way 
+to localize variables 
+without explicit initialization.
+</p>
+
+
+<br>
+
+<a NAME="log"></a>
+<h2><span class="function">log</span></h2>
+<b>syntax: (log <em>num</em>)</b><br />
+
+<b>syntax: (log <em>num</em> <em>num-base</em>)</b>
+
+<p>In the first syntax the expression in <em>num</em> is evaluated and the natural
+logarithmic function is calculated from the result.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(log 1)         <span class=arw>&rarr;</span> 0
+(log (exp 1))   <span class=arw>&rarr;</span> 1
+</pre>
+</blockquote>
+
+<p>In the second syntax an arbitrary base can be specified in <em>num-base</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(log 1024 2)             <span class=arw>&rarr;</span> 10
+(log (exp 1) (exp 1))    <span class=arw>&rarr;</span>  1
+</pre>
+</blockquote>
+
+<p>See also <a HREF="#exp">exp</a>, which is the inverse function to <tt>log</tt> with
+base <b><em>e</em></b>.
+</p>
+
+<br /><br />
+
+<a NAME="lookup"></a>
+<h2><span class="function">lookup</span></h2>
+<b>syntax: (lookup <em>exp</em> <em>assoc-list</em> [<em>int-index</em>])</b>
+
+<p>Finds in <em>assoc-list</em> an <em>association</em> the <em>key</em> element of which
+has the same value as <em>exp</em> and returns the <em>int-index</em> element of
+
+<em>association</em> (or the last element if <em>int-index</em> is absent).
+See also <a HREF="#indexing">Indexing elements of strings and lists</a>.
+</p>
+
+<p><tt>lookup</tt> is similar to <a href="#assoc">assoc</a> but goes one step further 
+by extracting specific element found in the list.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'params '(
+(name "John Doe") 
+(age 35) 
+(gender "M") 
+(balance 12.34)))
+
+(lookup 'age params)    <span class=arw>&rarr;</span> 35
+
+(set 'persons '(
+("John Doe" 35 "M" 12.34) 
+("Mickey Mouse" 65 "N" 12345678)))
+
+(lookup "Mickey Mouse" persons 2)    <span class=arw>&rarr;</span> "N"
+(lookup "Mickey Mouse" persons -3)   <span class=arw>&rarr;</span> 65
+(lookup "John Doe" persons 1)        <span class=arw>&rarr;</span> 35 
+(lookup "John Doe" persons -2)       <span class=arw>&rarr;</span> "M"
+</pre>
+</blockquote>
+
+<p>See also <a href="#assoc">assoc</a></p>
+<br /><br />
+
+
+<a NAME="lower-case"></a>
+<h2><span class="function">lower-case</span></h2>
+<b>syntax: (lower-case <em>str</em>)</b>
+
+<p>
+Converts the characters of the string 
+in <em>str</em> to lowercase. 
+A new string is created, 
+and the original is left untouched.
+</p> 
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(lower-case "HELLO WORLD")  <span class=arw>&rarr;</span> "hello world"
+(set 'Str "ABC")
+(lower-case Str)  <span class=arw>&rarr;</span> "abc"
+Str               <span class=arw>&rarr;</span> "ABC"
+</pre>
+</blockquote>
+
+<p>
+See also the <a HREF="#upper-case">upper-case</a> and 
+<a href="#title-case">title-case</a> functions.
+</p>
+
+<br /><br />
+
+
+<a NAME="macrop"></a>
+<h2><span class="function">macro?</span></h2>
+<b>syntax: (macro? <em>exp</em>)</b>
+
+<p>
+returns <tt>true</tt> if <em>exp</em> evaluates 
+to a lambda-macro expression; 
+otherwise, <tt>nil</tt> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define-macro (mysetq lv rv) (set lv (eval rv)))
+(macro? mysetq)  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="main-args"></a>
+<h2><span class="function">main-args</span></h2>
+<b>syntax: (main-args)</b><br />
+
+<b>syntax: (main-args <em>int-index</em>)</b>
+
+<p>
+<tt>main-args</tt> returns a list 
+with several string members, 
+one for program invocation 
+and one for each of 
+the command-line arguments.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+newlisp 1 2 3
+
+&gt; (main-args)
+<b>("/usr/bin/newlisp" "1" "2" "3")</b>
+</pre>
+</blockquote>
+
+<p>
+After <tt>newlisp 1 2 3</tt> is executed at the command prompt, 
+<tt>main-args</tt> returns a list containing the name of 
+the invoking program and three command-line arguments.
+</p>
+
+<p>
+Optionally, <tt>main-args</tt> can take 
+an <em>int-index</em> for indexing into the list.
+Note that an index out of range will cause <tt>nil</tt>
+to be returned, not the last elements of the list like
+in list-indexing.
+</p>
+
+<blockquote>
+<pre>
+newlisp a b c
+
+&gt; (main-args 0)   
+<b>"/usr/bin/newlisp"</b>
+&gt; (main-args -1)  
+<b>"c"</b>
+&gt; (main-args 2)   
+<b>"b"</b>
+&gt; (main-args 10)
+<b>nil</b>
+</pre>
+</blockquote>
+
+<p>
+Note that when newLISP is executed from a script, 
+<tt>main-args</tt> also returns the <em>name</em> 
+of the script as the second argument:
+</p>
+
+<blockquote>
+<pre>
+#!/usr/bin/newlisp
+# 
+# script to show the effect of 'main-args' in script file
+
+(print (main-args) "\n")
+(exit)
+
+# end of script file
+
+;; execute script in the OS shell:
+
+script 1 2 3
+
+<b>("/usr/bin/newlisp" "./script" "1" "2" "3")</b>
+</pre>
+</blockquote>
+
+<p>
+Try executing this script with different 
+command-line parameters.
+</p>
+
+<br /><br />
+
+<a NAME="make-dir"></a>
+<h2><span class="function">make-dir</span></h2>
+<b>syntax: (make-dir <em>str-dir-name</em> [<em>int-mode</em>])</b>
+
+<p>
+Creates a directory as specified in <em>str-dir-name</em>, 
+with the optional access mode <em>int-mode</em>. 
+Returns <tt>true</tt> or <tt>nil</tt> 
+depending on the outcome. 
+If no access mode is specified, 
+most UNIX systems default to <tt>drwxr-xr-x</tt>.
+</p>
+
+<p>
+On UNIX systems, the access mode specified 
+will also be masked by the OS's <em>user-mask</em> 
+set by the system administrator. 
+The <em>user-mask</em> can be retrieved 
+on UNIX systems using the command <tt>umask</tt> 
+and is usually <tt>0022</tt> (octal),
+which masks write (and creation) permission 
+for non-owners of the file.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; 0 (zero) in front of 750 makes it an octal number
+
+(make-dir "adir" 0750)  
+</pre>
+</blockquote>
+
+<p>
+This example creates a directory named <tt>adir</tt> 
+in the current directory with an access mode of 
+<tt>0750</tt> (octal 750 = <tt>drwxr-x---</tt>).
+</p>
+<br /><br />
+
+<a NAME="map"></a>
+
+<h2><span class="function">map</span></h2>
+<b>syntax: (map <em>exp-functor</em> <em>list-args-1</em> [<em>list-args-2</em> ... ])</b>
+
+<p>
+Successively applies the primitive function, 
+defined function, or lambda expression 
+<em>exp-functor</em> to the arguments specified in 
+<em>list-args-1, list-args-2&mdash;</em>, 
+returning all results in a list. </p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(map + '(1 2 3) '(50 60 70))  <span class=arw>&rarr;</span> (51 62 73)
+
+(map if '(true nil true nil true) '(1 2 3 4 5) '(6 7 8 9 10))
+<span class=arw>&rarr;</span> '(1 7 3 9 5)
+
+(map (fn (x y) (* x y)) '(3 4) '(20 10))
+<span class=arw>&rarr;</span> (60 40)
+</pre>
+
+</blockquote>
+
+<p>
+The second example shows how to dynamically 
+create a function for <tt>map</tt>:
+</p>
+
+<blockquote>
+<pre>
+(define (foo op p) 
+(append (lambda (x)) (list (list op p 'x))))
+</pre>
+</blockquote>
+
+<p>We can also use the shorter <tt>fn</tt>:</p>
+
+<blockquote>
+<pre>
+(define (foo op p) 
+(append (fn (x)) (list (list op p 'x))))
+</pre>
+</blockquote>
+
+<p><tt>foo</tt> now works like a function-maker:</p>
+
+<blockquote>
+<pre>
+(foo 'add 2)  <span class=arw>&rarr;</span> (lambda (x) (add 2 x))
+
+(map (foo add 2) '(1 2 3 4 5))  <span class=arw>&rarr;</span> (3 4 5 6 7 8)
+
+(map (foo mul 3) '(1 2 3 4 5))  <span class=arw>&rarr;</span> (3 6 9 12 15)
+</pre>
+</blockquote>
+
+<p>
+Note that the quote before the operand can be omitted, 
+since primitives evaluate to themselves in newLISP.
+</p>
+
+<p>
+By incorporating <tt>map</tt> 
+into the function definition, 
+we can do the following:
+</p>
+
+<blockquote>
+<pre>
+(define (list-map op p lst) 
+(map (lambda (x) (op p x)) lst))
+
+(list-map + 2 '(1 2 3 4))  <span class=arw>&rarr;</span> (3 4 5 6)
+
+(list-map mul 1.5 '(1 2 3 4))  <span class=arw>&rarr;</span> (1.5 3 4.5 6)
+</pre>
+</blockquote>
+
+<p>
+The number of arguments used is determined 
+by the length of the first argument list. 
+Arguments missing in other argument lists 
+cause an error message. 
+If an argument list contains too many elements, 
+the extra ones will be ignored.
+</p>
+
+<p>
+Note that only functions with <em>applicative 
+order of evaluation</em> can be mapped. 
+Functions with conditional or delayed evaluation 
+of their arguments (e.g., <a href="#if">if</a> 
+or <a href="#case">case</a>) cannot be mapped.
+</p>
+
+<br /><br />
+
+<a NAME="mat"></a>
+<h2><span class="function">mat</span></h2>
+<b>syntax: (mat <em>+</em>|<em>-</em>|<em>*</em>|<em>/</em> <em>matrix-A matrix-B</em>)</b><br />
+<b>syntax: (mat <em>+</em>|<em>-</em>|<em>*</em>|<em>/</em> <em>matrix-A number</em>)</b>
+
+<p>Using the first syntax, 
+this function performs fast floating point 
+scalar operations on two-dimensional matrices 
+in <em>matrix-A</em> or <em>matrix-B</em>. 
+The type of operation is specified 
+by one of the four arithmetic operators 
+<tt>+</tt>, <tt>-</tt>, <tt>*</tt>, or <tt>/</tt>. 
+This type of arithmetic operator is typically used for integer 
+operations in newLISP. In the case of <tt>mat</tt>, however,
+all operations will be performed as floating point operations
+(<tt>add</tt>, <tt>sub</tt>, <tt>mul</tt>, <tt>div</tt>).</p>
+
+<p>Matrices in newLISP are two-dimensional lists or arrays. 
+Internally, newLISP translates lists and arrays into fast, accessible 
+C-language data objects. 
+This makes matrix operations in newLISP 
+as fast as those coded directly in C. 
+The same is true for the matrix operations 
+<a href="#multiply">multiply</a> and <a href="#invert">invert</a>.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'A '((1 2 3) (4 5 6)))
+(set 'B A)
+
+(mat + A B)    <span class=arw>&rarr;</span> ((2 4 6) (8 10 12))
+(mat - A B)    <span class=arw>&rarr;</span> ((0 0 0) (0 0 0))
+(mat * A B)    <span class=arw>&rarr;</span> ((1 4 9) (16 25 36))
+(mat / A B)    <span class=arw>&rarr;</span> ((1 1 1) (1 1 1))
+
+; specify the operator in a variable
+
+(set 'op +)
+(mat op A B)    <span class=arw>&rarr;</span> ((2 4 6) (8 10 12)) 
+</pre>
+</blockquote>
+
+<p>Using the second syntax, 
+all cells in <em>matrix-A</em> 
+are multiplied with a scalar 
+in <em>number</em>:</p>
+
+<blockquote>
+<pre>
+(mat + A 5)    <span class=arw>&rarr;</span> ((6 7 8) (9 10 11))
+(mat - A 2)    <span class=arw>&rarr;</span> ((-1 0 1) (2 3 4))
+(mat * A 3)    <span class=arw>&rarr;</span> ((3 6 9) (12 15 18))
+(mat / A 10)   <span class=arw>&rarr;</span> ((.1 .2 .3) (.4 .5 .6))
+</pre>
+</blockquote>
+
+<p>See also the other matrix operations <a href="#det">det</a>, 
+<a href="#invert">invert</a>, <a href="#multiply">multiply</a>,
+and <a href="#transpose">transpose</a>.</p>
+
+<br /><br />
+
+<a NAME="match"></a>
+<h2><span class="function">match</span></h2>
+<b>syntax: (match <em>list-pattern</em> <em>list-match</em> [<em>bool</em>])</b>
+
+<p>
+The pattern in <em>list-pattern</em> is matched 
+against the list in <em>list-match</em>, 
+and the matching expressions are returned in a list. 
+The three wildcard characters <tt>?</tt>, <tt>+</tt>, 
+and <tt>*</tt> can be used in <em>list-pattern</em>.
+</p>
+
+<p>
+Wildcard characters may be nested. 
+<tt>match</tt> returns a 
+list of matched expressions. 
+For each <tt>?</tt> (question mark), 
+a matching expression element is returned. 
+For each <tt>+</tt> (plus sign) or 
+<tt>*</tt> (asterisk), a list containing 
+the matched elements is returned. 
+If the pattern cannot be matched 
+against the list in <em>list-match</em>, 
+<tt>match</tt> returns <tt>nil</tt>.
+If no wildcard characters are present
+in the pattern an empty list is returned.
+</p>
+
+<p>
+Optionally, the boolean value <tt>true</tt> 
+(or any other expression not evaluating to <tt>nil</tt>) 
+can be supplied as a third argument.
+This causes <tt>match</tt> work as it did in 
+versions prior to 8.2.3, showing all list 
+elements in the returned result.
+</p>
+
+<p>
+<tt>match</tt> is frequently employed as a functor parameter
+in <a href="#find">find</a>, <a href="#ref">ref</a>,
+<a href="#ref-all">ref-all</a> and <a href="#replace">replace</a> and
+is internally used by <a href="#find-all">find-all</a> for lists.</p>
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(match '(a ? c) '(a b c))  <span class=arw>&rarr;</span> (b)
+
+(match '(a ? ?) '(a b c))  <span class=arw>&rarr;</span> (b c)
+
+(match '(a ? c) '(a (x y z) c))  <span class=arw>&rarr;</span> ((x y z))
+
+(match '(a ? c) '(a x y z c))  <span class=arw>&rarr;</span> nil
+
+
+(match '(a * c) '(a x y z c))  <span class=arw>&rarr;</span> ((x y z))
+
+(match '(a (b c ?) x y z) '(a (b c d) x y z))  <span class=arw>&rarr;</span> (d)
+
+(match '(a (*) x ? z) '(a (b c d) x y z))  <span class=arw>&rarr;</span> ((b c d) y)
+
+(match '(+) '())  <span class=arw>&rarr;</span> nil
+
+(match '(+) '(a))  <span class=arw>&rarr;</span> ((a))
+
+(match '(+) '(a b))  <span class=arw>&rarr;</span> ((a b))
+
+(match '(a (*) x ? z) '(a () x y z))  <span class=arw>&rarr;</span> (() y)
+(match '(a (+) x ? z) '(a () x y z))  <span class=arw>&rarr;</span> nil 
+</pre>
+</blockquote>
+
+<p>
+Note that the <tt>*</tt> operator tries to grab 
+the fewest number of elements possible, 
+but <tt>match</tt> backtracks and grabs more elements 
+if a match cannot be found.
+</p>
+
+<p>
+The <tt>+</tt> operator works similarly 
+to the <tt>*</tt> operator, 
+but it requires at least one list element.
+</p>
+
+<p>
+The following example shows 
+how the matched expressions 
+can be bound to variables.
+</p>
+
+<blockquote>
+<pre>
+(map set '(x y) (match '(a (? c) d *) '(a (b c) d e f)))
+
+x  <span class=arw>&rarr;</span> b
+y  <span class=arw>&rarr;</span> (e f)
+</pre>
+</blockquote>
+
+<p>
+Note that <tt>match</tt> for strings has been eliminated. 
+For more powerful string matching, use <a href="#regex">regex</a>, 
+<a href="#find">find</a>, <a href="#find-all">find-all</a> 
+or <a href="#parse">parse</a>.
+</p>
+
+<p> <a href="#unify">unify</a> is another function for matching 
+expressions in a PROLOG like manner.</p>
+
+<br /><br />
+
+<a NAME="max"></a>
+<h2><span class="function">max</span></h2>
+<b>syntax: (max <em>num-1</em> [<em>num-2</em> ... ])</b>
+
+<p>
+Evaluates the expressions <em>num-1</em>&mdash; 
+and returns the largest number.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(max 4 6 2 3.54 7.1)  <span class=arw>&rarr;</span> 7.1
+</pre>
+</blockquote>
+
+<p>
+See also the <a HREF="#min">min</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="member"></a>
+<h2><span class="function">member</span></h2>
+<b>syntax: (member <em>exp</em> <em>list</em>)</b><br />
+<b>syntax: (member <em>str</em> <em>str-key</em> [<em>num-option</em>])</b>
+<p>
+In the first syntax, 
+<tt>member</tt> searches 
+for the element <em>exp</em> 
+in the list <em>list</em>. 
+If the element is a member of the list, 
+a new list starting with the element found 
+and the rest of the original list 
+is constructed and returned. 
+If nothing is found, 
+<tt>nil</tt> is returned. 
+When specifying <em>num-option</em>
+<tt>member</tt> performs a regular expression search.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'aList '(a b c d e f g h))  <span class=arw>&rarr;</span> (a b c d e f g h)
+(member 'd aList)                <span class=arw>&rarr;</span> (d e f g h)
+(member 55 aList)                <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<p>
+In the second syntax, 
+<tt>member</tt> searches 
+for <em>str-key</em> in <em>str</em>. 
+If <em>str-key</em> is found, all of <em>str</em> 
+(starting with <em>str-key</em>) is returned. 
+<tt>nil</tt> is returned if nothing is found.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(member "LISP" "newLISP")  <span class=arw>&rarr;</span> "LISP"
+(member "LI" "newLISP")    <span class=arw>&rarr;</span> "LISP"
+(member "" "newLISP")      <span class=arw>&rarr;</span> "newLISP"
+(member "xyz" "newLISP")   <span class=arw>&rarr;</span> nil
+(member "li" "newLISP" 1)  <span class=arw>&rarr;</span> "LISP"
+</pre>
+</blockquote>
+
+<p>
+See also the related functions 
+<a href="#slice">slice</a> and 
+<a href="#find">find</a>.
+</p>
+
+<br /><br />
+
+<a NAME="min"></a>
+<h2><span class="function">min</span></h2>
+<b>syntax: (min <em>num-1</em> [<em>num-2</em> ... ])</b>
+
+<p>
+Evaluates the expressions <em>num-1</em>&mdash; 
+and returns the smallest number.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(min 4 6 2 3.54 7.1)  <span class=arw>&rarr;</span> 2
+</pre>
+</blockquote>
+
+<p>
+See also the <a HREF="#max">max</a> function.
+</p>
+<br /><br />
+
+<a NAME="mod"></a>
+<h2><span class="function">mod</span></h2>
+<b>syntax: (mod <em>num-1</em> <em>num-2</em> [<em>num-3</em> ... ])</b>
+
+<p>
+Calculates the modular value of the 
+numbers in <em>num-1</em> and <em>num-2</em>. 
+<tt>mod</tt> computes the remainder 
+from the division of the numerator <em>num-i</em> 
+by the denominator <em>num-i + 1</em>. 
+Specifically, the return value is 
+<em>numerator - n * denominator</em>, 
+where <tt>n</tt> is the quotient 
+of the numerator divided by the denominator, 
+rounded towards zero to an integer. 
+The result has the same sign as 
+the numerator and its magnitude 
+is less than the magnitude 
+of the denominator.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(mod 10.5 3.3)   <span class=arw>&rarr;</span>  0.6
+(mod -10.5 3.3)  <span class=arw>&rarr;</span> -0.6
+</pre>
+</blockquote>
+
+<p>
+Use the <a HREF="#arithmetic">%</a> (percent sign) 
+function when working with integers only.
+</p>
+
+<br /><br />
+
+<a NAME="mul"></a>
+<h2><span class="function">mul</span></h2>
+<b>syntax: (mul <em>num-1</em> <em>num-2</em> [<em>num-3</em> ... ])</b>
+
+<p>
+Evaluates all expressions <em>num-1</em>&mdash;, 
+calculating and returning the product. 
+<tt>mul</tt> can perform mixed-type arithmetic, 
+but it always returns floating point numbers. 
+Any floating point calculation with 
+<tt>NaN</tt> also returns <tt>NaN</tt>.
+</p>
+
+<b>example:</b>
+
+<blockquote>
+<pre>
+(mul 1 2 3 4 5 1.1)  <span class=arw>&rarr;</span> 132
+(mul 0.5 0.5)        <span class=arw>&rarr;</span> 0.25
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="multiply"></a>
+<h2><span class="function">multiply</span></h2>
+<b>syntax: (multiply <em>matrix-A</em> <em>matrix-B</em>)</b>
+
+<p>
+Returns the matrix multiplication of matrices 
+in <em>matrix-A</em> and <em>matrix-B</em>. 
+If <em>matrix-A</em> has the dimensions <em>n</em> by <em>m</em> 
+and <em>matrix-B</em> the dimensions <em>k</em> by <em>l</em> 
+(<em>m</em> and <em>k</em> must be equal), 
+the result is an <em>n</em> by <em>l</em> matrix. 
+<tt> multiply</tt> can perform mixed-type arithmetic, 
+but the results are always double precision floating points, 
+even if all input values are integers.
+</p>
+
+<p>
+The dimensions of a matrix are determined 
+by the number of rows and the number 
+of elements in the first row. 
+For missing elements 
+in non-rectangular matrices, 
+<tt>0.0</tt> is assumed. 
+A matrix can either be a nested list 
+or <a href="#array">array</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'A '((1 2 3) (4 5 6)))
+(set 'B '((1 2) (1 2) (1 2)))
+(multiply A B)  <span class=arw>&rarr;</span> ((6 12) (15 30))
+</pre>
+</blockquote>
+
+<p>
+All operations shown here on lists 
+can be performed on arrays, as well.
+</p>
+
+<p>
+See also the matrix operations <a href="#det">det</a>,
+<a HREF="#invert">invert</a>, <a HREF="#mat">mat</a> 
+and <a HREF="#transpose">transpose</a>.
+</p>
+
+<br /><br />
+
+<a NAME="name"></a>
+<h2><span class="function">name</span></h2>
+<b>syntax: (name <em>symbol</em> [<em>bool</em>])</b><br />
+<b>syntax: (name <em>context</em>)</b>
+
+<p>
+Returns as a string, the name of a <em>symbol</em>
+without the context prefix. 
+If the expression in <em>bool</em> 
+evaluates to anything other than <tt>nil</tt>, 
+the name of the symbol's context is returned instead.
+</p>
+
+<p>
+When <em>context</em> is supplied, 
+then <tt>name</tt> returns the name of the context.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'ACTX:var 123)
+(set 'sm 'ACTX:var)
+(string sm)     <span class=arw>&rarr;</span> "ACTX:var"
+(name sm)       <span class=arw>&rarr;</span> "var"
+(name sm true)  <span class=arw>&rarr;</span> "ACTX"
+
+; name from context
+
+(set 'ctx ACTX)
+(name ctx)      <span class=arw>&rarr;</span> "ACTX"
+</pre>
+</blockquote>
+
+<br /><br />
+<a NAME="NaNp"></a>
+<h2><span class="function">NaN?</span></h2>
+<b>syntax: (NaN? <em>number</em> )</b>
+
+<p>
+Tests if the result of a 
+floating point math operation 
+is a <tt>NaN</tt>. 
+Certain floating point operations 
+return a special IEEE 754 number format 
+called a <tt>NaN</tt> for 'Not a Number'.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x (sqrt -1))  <span class=arw>&rarr;</span> NaN
+(add x 123)         <span class=arw>&rarr;</span> NaN
+(mul x 123)         <span class=arw>&rarr;</span> NaN
+
+(+ x 123)  <span class=arw>&rarr;</span> 123
+(* x 123)  <span class=arw>&rarr;</span> 0
+
+(&gt; x 0)   <span class=arw>&rarr;</span> nil
+(&lt;= x 0)  <span class=arw>&rarr;</span> nil
+(= x x)   <span class=arw>&rarr;</span> true
+(NaN? x)  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<p>
+Note that all floating point arithmetic operations 
+with a <tt>NaN</tt> yield a <tt>NaN</tt>. 
+All comparisons with <tt>NaN</tt> return <tt>nil</tt>, 
+but <tt>true</tt> when comparing to itself. 
+Comparison with itself, however, 
+would result in <em>not</em> <tt>true</tt> when using ANSI C.
+</p>
+
+<p>
+Integer operations treat <tt>NaN</tt> as <tt>0</tt> (zero) values.
+</p>
+
+<br /><br />
+
+<a NAME="net-accept"></a>
+<h2><span class="function">net-accept</span></h2>
+<b>syntax: (net-accept <em>int-socket</em>)</b>
+
+<p>
+Accepts a connection on a socket 
+previously put into listening mode. 
+Returns a newly created socket handle 
+for receiving and sending data 
+on this connection.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'socket (net-listen 1234))
+(net-accept socket)
+</pre>
+</blockquote>
+
+<p>
+Note that for ports less than 1024, 
+newLISP must be started in superuser mode
+on UNIX-like operating systems.
+</p>
+
+<p>
+See also the <a HREF="#example_server_tcp">server</a> 
+and <a HREF="#example_client_tcp">client</a> examples
+in the <tt>examples/</tt> directory of the source
+distribution.
+</p>
+
+<br /><br />
+
+<a NAME="net-close"></a>
+<h2><span class="function">net-close</span></h2>
+<b>syntax: (net-close <em>int-socket</em> [<em>true</em>)</b>
+
+<p>
+Closes a network socket in <em>int-socket</em> that 
+was previously created by a 
+<a HREF="#net-connect">net-connect</a> 
+or <a HREF="#net-accept">net-accept</a> function. 
+Returns <tt>true</tt> on success and 
+<tt>nil</tt> on failure.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-close aSock)
+</pre>
+</blockquote>
+
+<p>The optional <em>true</em> flag suppresses immediate shutdown
+of sockets waiting for pending data transmissions to finish.</p>
+
+<br /><br />
+
+
+<a NAME="net-connect"></a>
+<h2><span class="function">net-connect</span></h2>
+<b>syntax: (net-connect <em>str-remote-host</em> <em>int-port</em> [<em>str-mode</em> [<em> int-ttl</em>] ])</b><br />
+<b>syntax: (net-connect <em>str-file-path</em>)</b>
+
+<p>
+In the first syntax connects to a remote host computer 
+specified in <em>str-remote-host</em>
+and a port specified in <em>int-port</em>. 
+Returns a socket handle 
+after having connected successfully; 
+else it returns <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (finger nameSite , socket buffer user site)
+(set 'user ((parse nameSite "@") 0))
+(set 'site ((parse nameSite "@") 1))
+(set 'socket (net-connect site 79))
+(if socket
+(net-send socket (append user "\r\n")) 
+"no connection")
+(net-receive socket 'str 512)
+(print "\n" str "\n"))
+</pre>
+</blockquote>
+
+<p>
+The above program 
+uses the <em>finger</em> service 
+on a remote computer.
+This service returns information 
+about an account holder 
+on this computer.
+Some ISP and UNIX installations 
+provide this service.
+</p>
+
+<p>When executing:</p>
+
+<blockquote>
+<pre>
+(finger "johnDoe@someSite.com")
+</pre>
+</blockquote>
+
+<p>
+the program tries to connect 
+to a server named "someSite.com" 
+and sends the string "johnDoe". 
+If "someSite.com" is running a finger service, 
+it sends back information about the account 
+"johnDoe" on this server.
+In case a connection cannot be made, 
+the function returns the string "no connection."
+</p>
+
+<p>
+<tt>nameSite</tt> is split up into 
+the account name and host name parts. 
+<tt>net-connect</tt> is used to 
+connect to <tt>someSite.com</tt> 
+and returns the socket handle, 
+which processes incoming data.
+</p>
+
+<h3>Local domain UNIX sockets</h3>
+
+<p>In the second syntax <tt>net-connect</tt> connects to a server on the 
+local file system via a <em>local domain UNIX socket</em> named using 
+<em>str-file-path</em>.	Returns a socket handle after having connected 
+successfully; else it returns <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-connect "/tmp/mysocket")  <span class=arw>&rarr;</span> 3
+
+; on OS/2 use "\\socket\\" prefix
+
+(net-connect "\\socket\\mysocket")
+
+</pre>
+</blockquote>
+
+<p>A <em>local domain</em> file system socket is created and returned.
+On the server side <em>local domain</em> sockets have been created
+using <a href="#net-listen">net-listen</a> and <a href="#net-accept">net-accept</a>.
+After the connection has been established the functions <a href="#net-select">net-select</a>,
+<a href="#net-send">net-send</a> and <a href="#net-receive">net-receive</a> can be used
+as usual for TCP/IP stream communications. This type of connnection can be used as a fast
+bi-directional communications channel between processes on the same file system.
+This type of connection is not available on Win32 platforms.</p>
+
+<h3>UDP communications</h3>
+
+<p>
+As a third parameter, 
+the string <tt>"udp"</tt>
+or <tt>"u"</tt> can be specified 
+in the optional <em>str-mode</em> 
+to create a socket suited for 
+UDP (User Datagram Protocol) communications.
+In UDP mode, <tt>net-connect</tt> 
+does <em>not</em> try to connect 
+to the remote host, 
+but only binds the socket 
+to the remote address. 
+A subsequent <a href="#net-send">net-send</a>
+will send a UDP packet 
+containing that target address. 
+Using <a href="#net-send-to">net-send-to</a>
+causes that address to be overwritten.
+</p>
+
+<p>
+The functions <a href="#net-receive">net-receive</a> 
+and <a href="#net-receive-from">net-receive-from</a>
+can also be used 
+and will perform UDP communications. 
+<a href="#net-select">net-select</a>
+and <a href="#net-peek">net-peek</a> 
+can be used to check 
+for received data 
+in a non-blocking fashion.
+</p>
+
+<p>
+If data is never received when 
+opening a client connection 
+using <tt>net-connect</tt>, 
+then calling <a href="#net-listen">net-listen</a> 
+with the <tt>"udp"</tt> option 
+may be preferable for starting 
+the client side of the connection.
+<a href="#net-listen">net-listen</a> binds a specific 
+local address and port to the socket.
+When <tt>net-connect</tt> is used,
+the local address and port 
+will be picked by the socket-stack 
+functions of the host OS.
+</p>
+
+<h3>UDP multicast communications</h3>
+<p>
+When specifying <tt>"multi"</tt> 
+or <tt>"m"</tt> as a third parameter for <em>str-mode</em>,
+a socket for UDP multicast communications 
+will be created. 
+Optionally, the fourth parameter
+<tt>int-ttl</tt> can be specified 
+as a TTL (time to live) value. 
+If no <em>int-ttl</em> value is specified, 
+a value of 3 is assumed.
+</p>
+
+<p>
+Note that specifying UDP multicast mode 
+in <tt>net-connect</tt> does not actually establish 
+a connection to the target multicast address 
+but only puts the socket into UDP multicasting mode. 
+On the receiving side, 
+use <a href="#net-listen">net-listen</a> 
+together with the UDP multicast option.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; example client
+
+(net-connect "226.0.0.1" 4096 "multi")  <span class=arw>&rarr;</span> 3
+
+(net-send-to "226.0.0.1" 4096 "hello" 3)
+
+;; example server
+
+(net-listen 4096 "226.0.0.1" "multi")  <span class=arw>&rarr;</span> 5
+
+(net-receive-from 5 20)               
+<span class=arw>&rarr;</span> ("hello" "192.168.1.94" 32769)
+</pre>
+</blockquote>
+
+<p>
+On the server side, 
+<a href="#net-peek">net-peek</a> or <a href="#net-select">net-select</a>
+can be used for non-blocking communications. 
+In the above example, the server would block
+until a datagram is received.
+</p>
+
+<p>
+The address <tt>226.0.0.1</tt> 
+is just one multicast address 
+in the Class D range of multicast addresses 
+from <tt>224.0.0.0</tt> to <tt>239.255.255.255</tt>.
+</p>
+
+<p>
+The <a href="#net-send">net-send</a> and 
+<a href="#net-receive">net-receive</a> functions
+can also be used instead of <a href="#net-send-to">net-send-to</a> 
+and <a href="#net-receive-from">net-receive-from</a>.
+</p>
+
+
+<h3>UDP broadcast communications</h3>
+
+<p>
+Specifying the string <tt>"broadcast"</tt> or <tt>"b"</tt> 
+in the third parameter, <em>str-mode</em>, causes
+UDP broadcast communications to be set up. 
+In this case, the broadcast address 
+ending in 255 is used.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; example client
+
+(net-connect "192.168.2.255" 3000 "broadcast")  <span class=arw>&rarr;</span> 3
+
+(net-send 3 "hello")
+
+;; example server
+
+(net-listen 3000 "" "udp")  <span class=arw>&rarr;</span> 5
+
+(net-receive 5 'buff 10)
+
+buff  <span class=arw>&rarr;</span> "hello"
+
+;; or
+
+(net-receive-from 5 10)
+<span class=arw>&rarr;</span> ("hello" "192.168.2.1" 46620)
+</pre>
+</blockquote>
+
+<p>
+Note that on the receiving side, 
+<a href="#net-listen">net-listen</a> should be used 
+with the default address 
+specified with an <tt>""</tt> (empty string). 
+Broadcasts will not be received 
+when specifying an address. 
+As with all UDP communications, 
+<a href="#net-listen">net-listen</a> does not actually put 
+the receiving side in listen mode, 
+but rather sets up the sockets 
+for the specific UDP mode.
+</p>
+
+<p>
+The <a href="#net-select">net-select</a> 
+or <a href="#net-peek">net-peek</a> functions 
+can be used to check for 
+incoming communications 
+in a non-blocking fashion.
+</p>
+
+<br /><br />
+
+<a NAME="net-error"></a>
+<h2><span class="function">net-error</span></h2>
+<b>syntax: (net-error)</b>
+
+<p>
+Retrieves the last error that occurred 
+when calling a <a HREF="#socket_tcpip">net-*</a> function. 
+When any of the following functions return <tt>nil</tt>, 
+<tt>net-error</tt> can be called to get more information: 
+<a HREF="#net-accept">net-accept</a>,
+<a HREF="#net-connect">net-connect</a>,
+<a HREF="#net-eval">net-eval</a>,
+<a HREF="#net-listen">net-listen</a>,
+<a HREF="#net-lookup">net-lookup</a>,
+<a HREF="#net-receive">net-receive</a>,
+<a HREF="#net-receive-udp">net-receive-udp</a>,
+<a HREF="#net-select">net-select</a>,
+<a HREF="#net-send">net-send</a>,
+<a HREF="#net-send-udp">net-send-udp</a>,
+and <a HREF="#net-service">net-service</a>. 
+Functions that communicate using sockets 
+close the socket automatically 
+and remove it from the 
+<a HREF="#net-sessions">net-sessions</a> list. 
+This makes for a very robust API 
+in situations of unreliable net connections. 
+Calling any of these functions 
+successfully clears the last error.
+</p>
+
+<p>The following messages are returned:</p>
+
+<blockquote>
+<pre> 1: Cannot open socket
+2: Host name not known
+3: Not a valid service
+4: Connection failed
+5: Accept failed
+6: Connection closed
+7: Connection broken
+8: Socket send() failed
+9: Socket recv() failed
+10: Cannot bind socket
+11: Too many sockets in net-select
+12: Listen failed
+13: Badly formed IP
+14: Select failed
+15: Peek failed
+16: Not a valid socket
+</pre>
+</blockquote>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-connect "jhghjgkjhg" 80)  <span class=arw>&rarr;</span>  nil
+
+(net-error)  <span class=arw>&rarr;</span>  (2 "ERR: Host name not known") 
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="net-eval"></a>
+<h2><span class="function">net-eval</span></h2> 
+<b>syntax: (net-eval <em>str-host</em> <em>int-port</em> <em>str-expr</em> [<em>int-timeout</em> [<em>func-handler</em>] ])</b><br />
+<b>syntax: (net-eval '((<em>str-host</em> <em>int-port</em> <em>str-expr</em>) [( ... ) ... ]) [<em>int-timeout</em>])</b><br />
+<b>syntax: (net-eval '((<em>str-host</em> <em>int-port</em> <em>str-expr</em>) ...)  <em>int-timeout</em> <em>func-handler</em>)</b>
+
+<p>
+Can be used to evaluate source remotely 
+on one or more newLISP servers. 
+This function handles all communications necessary 
+to connect to the remote servers, 
+send source for evaluation, and 
+wait and collect responses.
+</p>
+
+<p>
+Beginning with version 8.9.8, 
+<em>str-host</em>, <em>int-port</em>, and 
+<em>str-expr</em> are evaluated.
+It is no longer necessary to specify them as constant. 
+<tt>net-eval</tt> will evaluate 
+these arguments.
+</p>
+
+<p>
+The remote TCP/IP servers 
+are started in the following way:
+</p>
+
+<blockquote>
+<pre>
+newlisp -c -d 4711 &amp;
+
+;; or with logging connections
+
+newlisp -l -c -d 4711 &amp;
+</pre>
+</blockquote>
+
+<p>
+Instead of <tt>4711</tt>, 
+any other port number can be used. 
+Multiple nodes can be started on different hosts 
+and with the same or different port numbers. 
+The <tt>-l</tt> or <tt>-L</tt> logging options
+can be specified to log connections 
+and remote commands.
+</p>
+
+<p>
+The <tt>-d</tt> daemon mode 
+allows newLISP to maintain state between connections. 
+When keeping state between connections is not desired, 
+the <a href="#inetd_daemon">inetd daemon mode</a> 
+offers more advantages. 
+The Internet <tt>inetd</tt> or <tt>xinetd</tt> services daemon 
+will start a new newLISP process 
+for each client connection. 
+This makes for much faster servicing 
+of multiple connections. 
+In <tt>-d</tt> daemon mode, 
+each new client request 
+would have to wait for the previous request to be finished. 
+See the chapter <a href="#inetd_daemon">inetd daemon mode</a> 
+on how to configure this mode correctly.
+</p>
+
+<p>
+In the first syntax, 
+<tt>net-eval</tt> talks to only one 
+remote newLISP server node,
+sending the host in <em>str-host</em>
+on port <em>int-port</em> 
+a request to evaluate the expression 
+<em>str-expr</em>.
+If <em>int-timeout</em> is not given, 
+<tt>net-eval</tt> will wait indefinitely for a response. 
+Otherwise, if the timeout in milliseconds has expired, 
+<tt>nil</tt> is returned;
+else, the evaluation result of <em>str-expr</em> 
+is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-eval "192.168.1.94" 4711 "(+ 3 4)")       <span class=arw>&rarr;</span> 7
+(net-eval "192.168.1.94" 4711 "(+ 3 4)" 1)     <span class=arw>&rarr;</span> nil  ; timeout to short
+(net-eval "192.168.1.94" 4711 "(+ 3 4)" 1000)  <span class=arw>&rarr;</span> 7
+
+; specify a local-domain UNIX socket (not on Win32)
+(net-eval "/tmp/mysocket" 0 "(+ 3 4)")    <span class=arw>&rarr;</span> 7
+</pre>
+</blockquote>
+
+<p>
+The second syntax of <tt>net-eval</tt>
+returns a list of the results
+after all of the responses are collected
+or timeout occurs.
+Responses that time out 
+return <tt>nil</tt>.
+The last example line shows how to specify
+a local-domain UNIX socket specifying the socket path
+and a port number of <tt>0</tt>.
+Connection errors or errors 
+that occur when sending information to nodes 
+are returned as a list of error numbers
+and descriptive error strings. 
+See the function <a href="#net-error">net-error</a> 
+for a list of potential error messages.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-eval '(
+("192.168.1.94" 4711 "(+ 3 4)") 
+("192.168.1.95" 4711 "(+ 5 6)")
+) 5000)
+<span class=arw>&rarr;</span> (7 11)
+
+(net-eval '(
+("localhost" 8081 {(foo "abc")}) 
+("localhost" 8082 "(myfunc 123)")
+) 3000)
+
+;; inetd or xinetd nodes on the same server and port
+
+(net-eval '(
+("localhost" 2000 {(foo "abc")}) 
+("localhost" 2000 "(myfunc 123)")
+) 3000)
+</pre>
+</blockquote>
+
+<p>
+The first example shows two expressions 
+evaluated on two different remote nodes. 
+In the second example, 
+both nodes run on the local computer. 
+This may be useful when debugging 
+or taking advantage of multiple CPUs 
+on the same computer.
+When specifying <tt>0</tt> for the portnumber
+<tt>net-eval</tt> takes the hostname as
+file path to the local-domain UNIX socket.
+</p>
+
+<p>
+When nodes are inetd or xinetd-controlled, 
+several nodes may have the same node 
+for the IP address and port number. 
+In this case, the UNIX daemon inetd or xinetd 
+will start multiple newLISP servers. 
+This is useful when testing distributed programs
+on just one machine. 
+The last example illustrates this case.
+</p>
+
+<p>
+The source sent for evaluation 
+can consist of entire multiline programs. 
+This way, remote nodes can be loaded with programs first, 
+then specific functions can be called. 
+For large program files, the functions 
+<a href="#put-url">put-url</a> or 
+<a href="#save">save</a> (with a URL file name) 
+can be used to transfer programs.
+</p>
+
+<p>
+Optionally, a handler function can be specified. 
+This function will be repeatedly called while waiting
+and once for every remote evaluation completion.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (myhandler param)
+(if param
+(println param))
+)
+
+(set 'Nodes '(
+("192.168.1.94" 4711)
+("192.168.1.95" 4711)
+))
+
+(set 'Progs '(
+{(+ 3 4)}
+{(+ 5 6)}
+))
+
+(net-eval (map (fn (n p) (list (n 0) (n 1) p)) Nodes Progs) 
+5000 myhandler)
+<span class=arw>&rarr;</span>
+("192.168.1.94" 4711 7)
+("192.168.1.95" 4711 11)
+</pre>
+</blockquote>
+
+<p>
+The example shows how the list of node specs 
+can be assembled from a list of nodes 
+and sources to evaluate. 
+This may be useful 
+when connecting to a larger number of remote nodes.
+Since version 8.9.7, <tt>net-eval</tt> 
+has also been able to evaluate 
+the spec given in the node lists. 
+This allows the following code:
+</p>
+
+<blockquote>
+<pre>
+(net-eval '(
+((Nodes 0 0) (Nodes 0 1) (Progs 0)) 
+((Nodes 1 0) (Nodes 1 1) (Progs 1)) 
+) 3000 myhandler)
+</pre>
+</blockquote>
+
+<p>
+While waiting for input from remote hosts, 
+<tt>myhandler</tt> will be called with <tt>nil</tt>
+as the argument to <tt>param</tt>. 
+When a remote node result is completely received, 
+<tt>myhandler</tt> will be called with <tt>param</tt> 
+set to a list containing the remote host name 
+or IP number, the port, and the resulting expression. 
+<tt>net-eval</tt> will return <tt>true</tt> before a timeout
+or <tt>nil</tt> if the timeout was reached or exceeded. 
+All remote hosts that exceeded the timeout limit 
+will contain a <tt>nil</tt> 
+in their results list.
+</p>
+
+<p>
+Unless operating in raw mode, 
+each piece of code sent to a remote node 
+for evaluation should be one expression. 
+This can be achieved by putting several statements 
+into a <a href="#begin">begin</a> block.
+</p>
+
+<h3>Raw mode</h3>
+<p>
+An additional parameter in each node specification 
+can control whether the returned result 
+is evaluated (the default behavior) or returned as a string 
+as it comes over the communications channel. 
+The following example 
+illustrates the difference between 
+the default <em>evaluated</em> and <em>raw</em> modes 
+of <tt>net-eval</tt>:
+</p>
+
+<blockquote>
+<pre>
+(net-eval '(("localhost" 4711 {(+ 3 4)})) 1000)  <span class=arw>&rarr;</span> (7)
+
+(net-eval '(("localhost" 4711 {(+ 3 4)} true)) 1000)  <span class=arw>&rarr;</span> ("7\n")
+
+(net-eval '(("localhost" 4711 {(+ 3 4) (+ 5 6)})) 1000)  <span class=arw>&rarr;</span> (11)
+
+(net-eval '(("localhost" 4711 {(+ 3 4) (+ 5 6)} true)) 1000)  <span class=arw>&rarr;</span> ("7\n11\n")
+</pre>
+</blockquote>
+
+<p>
+While the evaluated mode 
+always returns an evaluated expression, 
+raw mode returns a string 
+terminated by a line-feed. 
+The last two statements reveal 
+that in the default evaluated mode, 
+only the result of the last expression evaluation 
+is returned, 
+while in raw mode, 
+both results are visible, 
+each terminated by a line-feed.
+</p>
+
+<p>
+Raw mode returns the same string 
+as would be observed when entering expressions 
+on the command line, 
+while the evaluated mode returns LISP expressions 
+ready for further newLISP processing. 
+newLISP's <tt>net-eval</tt> 
+protects the expression returned 
+with a single quote before evaluating, 
+thus ensuring that the expression string received
+is parsed in the receiving environment, 
+but the resulting expression itself 
+stays in the original form 
+sent by the remote node. 
+Only one quote gets prepended. 
+For that reason, 
+only one expression should be sent back 
+when working in non-raw mode.
+</p>
+
+<p>The following example shows this effect:</p>
+
+<blockquote>
+<pre>
+(set 'prog [text]
+(list 1 2 3 4)
+(list 'a 'b 'c)
+[/text])
+
+; raw mode
+(net-eval '((host port prog true) ...)) 
+<span class=arw>&rarr;</span> ("(1 2 3 4)\n(a b c)\n")
+
+; normal mode
+(net-eval '((host port prog) ...)) 
+<span class=err>invalid function in function net-eval : (a b c)</span>
+
+; brace statments with (begin ...)
+(set 'prog [text]
+(begin
+(list 1 2 3 4)
+(list 'a 'b 'c))
+[/text])
+
+; normal mode
+(net-eval '((host port prog) ...)) 
+<span class=arw>&rarr;</span> ((a b c))
+</pre>
+</blockquote>
+
+<p>
+The <tt>begin</tt> in the definition of <tt>prog</tt> 
+forces the return of only one expression, 
+which then gets converted correctly 
+by the receiving <tt>net-eval</tt>.
+</p>
+
+<p>
+Note that <em>raw</em> mode 
+has always been part of <tt>net-eval</tt>, 
+but it was not documented
+prior to version 8.7.5.
+</p>
+
+<br /><br />
+
+
+<a NAME="net-listen"></a>
+<h2><span class="function">net-listen</span></h2>
+<b>syntax: (net-listen <em>int-port</em> [<em>str-ip-addr</em>] [<em>str-mode</em>])</b><br />
+<b>syntax: (net-listen <em>str-file-path</em>)</b>
+
+<p>
+Listens on a port specified in <em>int-port</em>. 
+A call to <tt>net-listen</tt>
+returns immediately with a socket number, 
+which is then used by 
+the blocking <a HREF="#net-accept">net-accept</a> function 
+to wait for a connection. 
+As soon as a connection is accepted, 
+<a href="#net-accept">net-accept</a> returns a socket number 
+that can be used to communicate with 
+the connecting client.
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'port 1234)
+(set 'listen (net-listen port))
+(unless listen (begin
+(print "listening failed\n")
+(exit)))
+(print "Waiting for connection on: " port "\n")
+(set 'connection (net-accept listen))
+(if connection
+(while (net-receive connection 'buff 1024 "\n")
+(print buff)
+(if (= buff "\r\n") (exit)))
+(print "Could not connect\n"))
+</pre>
+</blockquote>
+
+<p>
+The example waits for a connection on port 1234, 
+then reads incoming lines until 
+an empty line is received.
+Note that listening on ports lower than 1024
+may require superuser access on UNIX systems.
+</p>
+
+<p>
+On computers with more than one interface card,
+specifying an optional interface IP address or name  
+in <em>str-ip-addr</em> directs <tt>net-listen</tt> 
+to listen on the specified address.
+</p>
+
+<blockquote>
+<pre>
+;; listen on a specific address
+(net-listen port "192.168.1.54") 
+</pre>
+</blockquote>
+
+<h3>Local domain UNIX sockets</h3>
+
+<p>In the second syntax <tt>net-listen</tt> listens for a client on the 
+local file system via a <em>local domain UNIX socket</em> named using 
+<em>str-file-path</em>.	If successful returns a socket handle which can be used with
+<a href="#net-accept">net-accept</a> to accept a client connection; else it returns <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-listen "/tmp/mysocket")  <span class=arw>&rarr;</span> 5
+
+; on OS/2 use "\\socket\\" prefix
+
+(net-listen "\\socket\\mysocket")
+
+(net-accept 5)
+</pre>
+</blockquote>
+
+<p>A <em>local domain</em> file system socket is created and listened on.
+A client will try to connect using the same <em>str-file-path</em>.
+After a connection has been accepted the functions <a href="#net-select">net-select</a>,
+<a href="#net-send">net-send</a> and <a href="#net-receive">net-receive</a> can be used
+as usual for TCP/IP stream communications. This type of connnection can be used as a fast
+bi-directional communications channel between processes on the same file system.
+This type of connection is not available on Win32 platforms.</p>
+
+
+<h3>UDP communications</h3>
+
+<p>
+As a third parameter, 
+the optional string <tt>"udp"</tt> or <tt>"u"</tt> 
+can be specified in <em>str-mode</em> 
+to create a socket suited for UDP 
+(User Datagram Protocol) communications.
+A socket created in this way 
+can be used directly with 
+<a href="#net-receive-from">net-receive-from</a>
+to await incoming UDP data 
+<em>without</em> using <tt>net-accept</tt>, 
+which is only used in TCP communications. 
+The <a href="#net-receive-from">net-receive-from</a> call 
+will block until a UDP data packet is received. 
+Alternatively, <a href="#net-select">net-select</a> 
+or <a href="#net-peek">net-peek</a> can be used 
+to check for ready data in a non-blocking fashion. 
+To send data back to the address and port received 
+with <a href="#net-receive-from">net-receive-from</a>, 
+use <a href="#net-send-to">net-send-to</a>.
+</p>
+
+<p>
+Note that <a href="#net-peer">net-peer</a> will not work, 
+as UDP communications do not maintain 
+a connected socket with address information.
+</p>
+
+<blockquote>
+<pre>
+(net-listen 1002 "192.168.1.120" "udp") 
+
+(net-listen 1002 "" "udp") 
+</pre>
+</blockquote>
+
+<p>
+The first example listens on a specific network adapter, 
+while the second example listens on the default adapter. 
+Both calls return a socket number 
+that can be used in subsequent <a href="#net-receive">net-receive</a>,
+<a href="#net-receive-from">net-receive-from</a>, 
+<a href="#net-send-to">net-send-to</a>,
+<a href="#net-select">net-select</a>, 
+or <a href="#net-peek">net-peek</a> function calls.
+</p>
+
+<p>
+Both a UDP server <em>and</em> UDP client 
+can be set up using <tt>net-listen</tt> 
+with the <tt>"udp"</tt> option. 
+In this mode, <tt>net-listen</tt> 
+does not really <em>listen</em>
+as in TCP/IP communications; 
+it just binds the socket 
+to the local interface address and port.
+</p>
+
+<p>
+For a working example, see the files 
+<tt>examples/client</tt> and <tt>examples/server</tt>
+in the newLISP source distribution.
+</p>
+
+<p>
+Instead of <tt>net-listen</tt> 
+and the <tt>"udp"</tt> option,
+the functions <a href="#net-receive-udp">net-receive-udp</a>  
+and <a href="#net-send-udp">net-send-udp</a>
+can be used for short transactions 
+consisting only of one data packet.
+</p>
+
+<p>
+<tt>net-listen</tt>, <a href="#net-select">net-select</a>, 
+and <a href="#net-peek">net-peek</a> can be used 
+to facilitate non-blocking reading. 
+The listening/reading socket is not closed 
+but is used again for subsequent reads. 
+In contrast, when the 
+<a href="#net-receive-udp">net-receive-udp</a> 
+and <a href="#net-send-udp">net-send-udp</a> pair is used, 
+both sides close the sockets after sending and receiving.
+</p>
+
+
+<h3>UDP multicast communications</h3>
+
+<p>
+If the optional string <em>str-mode</em> is specified as 
+<tt>"multi"</tt> or <tt>"m"</tt>, 
+<tt>net-listen</tt> returns a socket suitable for multicasting. 
+In this case, <em>str-ip-addr</em> contains one 
+of the multicast addresses in the range <tt>224.0.0.0</tt> 
+to <tt>239.255.255.255</tt>.
+<tt>net-listen</tt> will register <em>str-ip-addr</em> 
+as an address on which to receive multicast transmissions. 
+This address should not be confused with the IP address 
+of the server host.
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; example client
+
+(net-connect "226.0.0.1" 4096 "multi")  <span class=arw>&rarr;</span> 3
+
+(net-send-to "226.0.0.1" 4096 "hello" 3)
+
+
+;; example server
+
+(net-listen 4096 "226.0.0.1" "multi")  <span class=arw>&rarr;</span> 5
+
+(net-receive-from 5 20)               
+<span class=arw>&rarr;</span> ("hello" "192.168.1.94" 32769)
+</pre>
+</blockquote>
+
+<p>
+On the server side, 
+<a href="#net-peek">net-peek</a> 
+or <a href="#net-select">net-select</a>
+can be used for non-blocking communications. 
+In the example above,
+the server would block
+until a datagram is received.
+</p>
+
+<p>
+The <a href="#net-send">net-send</a> 
+and <a href="#net-receive">net-receive</a> functions 
+can be used instead of <a href="#net-send-to">net-send-to</a> 
+and <a href="#net-receive-from">net-receive-from</a>.
+</p>
+
+<br /><br />
+
+<a NAME="net-local"></a>
+<h2><span class="function">net-local</span></h2>
+<b>syntax: (net-local <em>int-socket</em>)</b>
+
+<p>
+Returns the IP number and port 
+of the local computer 
+for a connection on
+a specific <em>int-socket</em>.
+</p>
+
+<b>example:</b>
+
+<blockquote>
+<pre>
+(net-local 16)  <span class=arw>&rarr;</span> ("204.179.131.73" 1689)
+</pre>
+</blockquote>
+<p>
+Use the <a HREF="#net-peer">net-peer</a> 
+function to access the remote computer's 
+IP number and port.
+</p>
+<br /><br />
+
+<a NAME="net-lookup"></a>
+<h2><span class="function">net-lookup</span></h2>
+
+<b>syntax: (net-lookup <em>str-ip-number</em>)</b><br />
+<b>syntax: (net-lookup <em>str-hostname</em> [<em>bool</em>])</b>
+
+
+<p>
+Returns either a hostname string 
+from <em>str-ip-number</em> 
+in IP dot format or the IP number 
+in dot format from <em>str-hostname</em>:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-lookup "209.24.120.224")    <span class=arw>&rarr;</span> "www.nuevatec.com"
+(net-lookup "www.nuevatec.com")  <span class=arw>&rarr;</span> "209.24.120.224"
+
+(net-lookup "216.16.84.66.sbl-xbl.spamhaus.org" true)
+<span class=arw>&rarr;</span> "127.0.0.2"
+</pre>
+</blockquote>
+
+<p>
+Optionally,	a <em>bool</em> flag 
+can be specified in the second syntax. 
+If the expression in <em>bool</em> 
+evaluates to anything other than <tt>nil</tt>,
+host-by-name lookup will be forced, 
+even if the name string starts 
+with an IP number.
+</p>
+
+<br /><br />
+
+<a NAME="net-peek"></a>
+<h2><span class="function">net-peek</span></h2>
+<b>syntax: (net-peek <em>int-socket</em>)</b>
+
+<p>
+Returns the number of bytes 
+ready for reading 
+on the network socket <em>int-socket</em>.
+If an error occurs 
+or the connection is closed,
+<tt>nil</tt> is Returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'aSock (net-connect "aserver.com" 123))
+(while ( = (net-peek aSock) 0) (do-something-else))
+(net-receive aSock 'buff 1024)
+</pre>
+</blockquote>
+
+<p>
+After connecting, the program 
+waits in a while loop 
+until <tt>aSock</tt> can be read.
+</p>
+
+<p>
+Use the <a href="#peek">peek</a> function
+to check file descriptors and <tt>stdin</tt>.
+</p>
+
+<br /><br />
+
+<a NAME="net-peer"></a>
+<h2><span class="function">net-peer</span></h2>
+<b>syntax: (net-peer <em>int-socket</em>)</b>
+
+<p>
+Returns the IP number and port 
+of the remote computer 
+for a connection on <em>int-socket</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-peer 16)  <span class=arw>&rarr;</span> ("192.100.81.100" 13)
+</pre>
+</blockquote>
+
+<p>
+Use the <a HREF="#net-local">net-local</a> function
+to access the local computer's IP number and port.
+</p>
+
+<br /><br />
+
+<a NAME="net-ping"></a>
+
+<h2><span class="function">net-ping</span></h2>
+<b>syntax: (net-ping <em>str-address</em> [<em>int-timeout</em> [<em>int-count</em>]])</b><br />
+<b>syntax: (net-ping <em>list-addresses</em> [<em>int-timeout</em> [<em>int-count</em>]])</b>
+
+<p> This function is only available on UNIX-based systems 
+and must be run in superuser mode, i.e. using: <tt>sudo newlisp</tt> to
+start newLISP on Mac OS X or other BSD's, or as the root user on Linux.
+Broadcast mode and specifying ranges with with the <tt>-</tt> (hyphen) or
+<em>*</em> (star) are not available on IPv6 address mode.</p>
+
+<p> In the first syntax, <tt>net-ping</tt> sends a ping 
+ICMP 64-byte echo request to the address specified in <em>str-address</em>. 
+If it is a broadcast address, the ICMP packet will be received 
+by all addresses on the subnet.  Note that for security reasons, 
+many computers do not answer ICMP broadcast ping (ICMP_ECHO) requests. 
+An optional timeout parameter can be specified in <em>int-timeout</em>.
+If no timeout is specified, a waiting time of 1000 milliseconds 
+(one second) is assumed.</p> 
+
+<p> <tt>net-ping</tt> returns either a list of lists of IP strings 
+and round-trip time in micro seconds for which a response was received 
+or an empty list if no response was received.</p>
+
+<p>
+A return value of <tt>nil</tt> 
+indicates a failure. 
+Use the <a href="#net-error">net-error</a> function 
+to retrieve the error message.  If the message reads <tt>Cannot open socket</tt>, 
+it is probably because newLISP is running without root permissions. 
+newLISP can be started using:
+</p>
+<blockquote>
+<pre>
+sudo newlisp
+</pre>
+</blockquote>
+<p>
+Alternatively, newLISP can be installed 
+with the set-user-ID bit set to run 
+in superuser mode.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-ping "newlisp.org")     <span class=arw>&rarr;</span> (("66.235.209.72" 634080))
+(net-ping "127.0.0.1")       <span class=arw>&rarr;</span> (("127.0.0.1" 115))
+(net-ping "yahoo.com" 3000)  <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<p>
+In the second syntax, <tt>net-ping</tt> is run in <em>batch mode</em>. 
+Only one socket is opened in this mode, but multiple ICMP packets are sent out&mdash;one 
+each to multiple addresses specified in a list or specified by range.
+Packets are sent out as fast as possible.  In this case, multiple answers can be received.
+If the same address is specified multiple times, thr receiving IP address will be flooded
+with ICMP packets.</p>
+
+<p>
+To limit the number of responses to be waited for in broadcast or batch mode,
+an additional argument indicating the maximum number of responses to receive
+can be specified in <em>int-count</em>.  Usage of this parameter can cause 
+the function to return sooner than the specified timeout. 
+When a given number of responses has been received, <tt>net-ping</tt> will return  
+before the timeout has occurred. Not specifying <em>int-count</em> or specifying <tt>0</tt>
+assumes an <em>int-count</em> equal to the number of packets sent out.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-ping '("newlisp.org" "192.168.1.255") 2000 20)
+<span class=arw>&rarr;</span> (("66.235.209.72" 826420) ("192.168.1.1" 124) ("192.168.1.254" 210))
+
+(net-ping "192.168.1.*" 500) ; from 1 to 254
+<span class=arw>&rarr;</span> (("192.168.1.1" 120) ("192.168.1.2" 245) ("192.168.2.3" 180) ("192.168.2.254" 234))
+
+(net-ping "192.168.1.*" 500 2) ; returns after 2 responses
+<span class=arw>&rarr;</span> (("192.168.1.3" 115) ("192.168.1.1" 145))
+
+(net-ping "192.168.1.1-10" 1000) ; returns after 1 second
+<span class=arw>&rarr;</span> (("192.168.1.3" 196) ("192.168.1.1" 205))
+
+(net-ping '("192.168.1.100-120" "192.168.1.124-132") 2000) ; returns after 2 seconds
+<span class=arw>&rarr;</span> ()
+</pre>
+</blockquote>
+
+
+<p>
+Broadcast or batch mode&mdash;as well as normal addresses 
+and IP numbers or hostnames&mdash; can be mixed in one <tt>net-ping</tt> statement by 
+putting all of the IP specs into a list.</p> 
+
+<p>
+The second and third line show how the batch mode of <tt>net-ping</tt> 
+can be initiated by specifying the <tt>*</tt> (asterisk) 
+as a wildcard character for the last subnet octet
+in the IP number. The fourth and fifth line show how an IP
+range can be specified for the last subnet octet in the IP number.
+<tt>net-ping</tt> will iterate through all numbers 
+from either 1 to 254 for the star <tt>*</tt> or the range specified, 
+sending an ICMP packet to each address. 
+Note that this is different from the <em>broadcast</em> mode 
+specified with an IP octet of <tt>255</tt>. 
+While in broadcast mode, <tt>net-ping</tt> sends out only one packet, 
+which is received by multiple addresses.  Batch mode explicitly generates 
+multiple packets, one for each target address. When specifying broadcast
+mode, <em>int-count</em> should be specified too.</p>
+
+<p>
+When sending larger lists of IPs in batch mode over one socket, 
+a longer timeout may be necessary to allow enough time for all of the packets 
+to be sent out over one socket.  If the timeout is too short, 
+the function <tt>net-ping</tt> may return an incomplete list or the empty list <tt>()</tt>.
+In this case <a href="#net-error">net-error</a> will return a timeout error.
+On error <tt>nil</tt> is returned and  <a href="#net-error">net-error</a>
+can be used to retrieve an error message.</p>
+
+<p>
+On some systems only lists up to a specific length can be handled
+regardless of the timeout specified. In this case the range should
+be broken up in subranges used with multiple <tt>net-ping</tt>
+invocations. In any case, <tt>net-ping</tt> will send out packages 
+as quickly as possible.
+</p>
+
+<br /><br />
+
+<a NAME="net-receive"></a>
+<h2><span class="function">net-receive</span></h2>
+<b>syntax: (net-receive <em>int-socket</em> <em>sym-buffer</em> <em>int-max-bytes</em> [<em>wait-string</em>])</b>
+
+<p>
+Receives data on the socket <em>int-socket</em> 
+into a string contained in <em>sym-buffer</em>. 
+A maximum of <em>int-max-bytes</em> is received. 
+<tt>net-receive</tt> returns the number of bytes read. 
+If there is a break in the connection,
+<tt>nil</tt> is returned. 
+The space reserved in <em>sym-buffer</em> 
+is exactly the size of bytes read.
+</p>
+
+<p>
+Note that <tt>net-receive</tt> is a blocking call 
+and does not return until the data arrives at <em>int-socket</em>. 
+Use <a HREF="#net-peek">net-peek</a> 
+or <a HREF="#net-select">net-select</a> to find out 
+if a socket is ready for reading.
+</p>
+
+<p>
+Optionally, a <em>wait-string</em> 
+can be specified 
+as a fourth parameter. 
+<tt>net-receive</tt> then returns after 
+a character or string of characters 
+matching <em>wait-string</em>
+is received. 
+The <em>wait-string</em> will be part 
+of the data contained in <em>sym-buffer</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (gettime)
+(net-connect "netcom.com" 13)
+(net-receive socket 'buf 256)
+(print buf "\n")
+(net-close socket))
+</pre>
+</blockquote>
+
+<p>
+When calling <tt>gettime</tt>, 
+the program connects to port 13 
+of the server netcom.com. 
+Port 13 is a date-time service 
+on most server installations. 
+Upon connection, the server sends 
+a string containing the date and time of day.
+</p>
+
+<blockquote>
+<pre>
+(define (net-receive-line socket sBuff)
+(net-receive socket sBuff 256 "\n"))
+
+(set 'bytesReceived (net-receive-line socket 'sm))
+</pre>
+</blockquote>
+
+<p>
+The second example defines a new function 
+<tt>net-receive-line</tt>, 
+which returns after receiving a newline character 
+(a string containing one character in this example) 
+or 256 characters. 
+The "\n" string is part of the contents of sBuff.
+</p>
+
+<p>
+Note that when the fourth parameter is specified, 
+<tt>net-receive</tt> is slower than the normal version 
+because information is read character by character. 
+In most situations, the speed difference can be neglected.
+</p>
+
+<br /><br />
+
+<A NAME="net-receive-from"></a>
+<h2><span class="function">net-receive-from</span></h2>
+<b>syntax: (net-receive-from <em>int-socket</em> <em>int-max-size</em>)</b>
+
+<p>
+<tt>net-receive-from</tt> can be used to set up 
+non-blocking UDP communications. 
+The socket in <em>int-socket</em> 
+must previously have been opened 
+by either <a href="#net-listen">net-listen</a> 
+or <a href="#net-connect">net-connect</a> 
+(both using the <tt>"udp"</tt> option).
+<em>int-max-size</em> specifies 
+the maximum number of bytes that will be received. 
+On Linux/BSD, if more bytes are received, 
+those will be discarded. 
+On Win32, <tt>net-receive-from</tt> will return <tt>nil</tt> 
+and close the socket.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; listen on port 1001 on the default address
+(net-listen 1001 "" "udp")  <span class=arw>&rarr;</span> 1980 
+
+;; optionally poll for arriving data with 100ms timeout
+(while (not (net-select 1980 "r" 100000)) (do-something ...))
+
+(net-receive-from 1980 20)  <span class=arw>&rarr;</span> ("hello" "192.168.0.5" 3240)
+
+;; send answer back to sender
+(net-send-to "192.168.0.5" 3240 "hello to you" 1980)
+
+(net-close 1980) ; close socket
+</pre>
+</blockquote>
+
+<p>
+The second line in this example is optional. 
+Without it, the <tt>net-receive-from</tt> call 
+would block until data arrives. 
+A UDP server could be set up 
+by listening and polling several ports 
+serving them as they receive data.
+</p>
+
+<p>
+Note that <tt>net-receive</tt> 
+could not be used in this case 
+because it does not return 
+the sender's address and port information, 
+which are required to talk back.
+In UDP communications, 
+the data packet itself 
+contains the address of the sender,
+<em>not</em> the socket over which 
+communication takes place.
+</p>
+
+<p>
+See also the <a href="#net-connect">net-connect</a> function 
+with the <tt>"udp"</tt> option and the 
+<a href="#net-send-to">net-send-to</a> function 
+for sending UDP data packets over open connections.
+</p>
+
+<p>
+For blocking short UDP transactions, 
+see the <a href="#net-send-udp">net-send-udp</a> 
+and <a href="#net-receive-udp">net-receive-udp</a> functions.
+</p>
+
+<br /><br />
+
+
+<a NAME="net-receive-udp"></a>
+<h2><span class="function">net-receive-udp</span></h2>
+<b>syntax: (net-receive-udp <em>int-port</em> <em>int-maxsize</em> [<em>int-microsec</em> [<em>str-addr-if</em>]])</b>
+
+<p>
+Receives a User Datagram Protocol (UDP) packet on port <em>int-port</em>,
+reading <em>int-maxsize</em> bytes. 
+If more than <em>int-maxsize</em> bytes are received,
+bytes over <em>int-maxsize</em> are discarded on Linux/BSD; 
+on Win32, <tt>net-receive-udp</tt> returns <tt>nil</tt>.
+<tt>net-receive-udp</tt> blocks until a datagram arrives 
+or the optional timeout value in <em>int-microsec</em> expires. 
+When setting up communications between datagram sender and receiver, 
+the <tt>net-receive-udp</tt> statement must be set up first.
+</p>
+
+
+<p>
+No previous setup using <tt>net-listen</tt> 
+or <tt>net-connect</tt> is necessary.
+</p>
+
+<p>
+<tt>net-receive-udp</tt> returns a list 
+containing a string of the UDP packet 
+followed by a string containing 
+the sender's IP number and the port used.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; wait for datagram with maximum 20 bytes 
+(net-receive-udp 1001 20) 
+
+;; or
+(net-receive-udp 1001 20 5000000)  ; wait for max 5 seconds
+		  
+;; executed on remote computer
+(net-send-udp "nuevatec.com" 1001 "Hello")  <span class=arw>&rarr;</span> 4 
+
+;; returned from the net-receive-udp statement
+<span class=arw>&rarr;</span> ("Hello" "128.121.96.1" 3312)  
+
+;; sending binary information
+(net-send-udp "ahost.com" 2222 (pack "c c c c" 0 1 2 3))  
+<span class=arw>&rarr;</span> 4 
+
+;; extracting the received info
+(set 'buff (first (net-receive-udp 2222 10)))   
+
+(print (unpack "c c c c" buff))  <span class=arw>&rarr;</span> (0 1 2 3)
+</pre>
+</blockquote>
+
+<p>
+See also the <a href="#net-send-udp">net-send-udp</a> 
+function for sending datagrams and 
+the <a href="#pack">pack</a> and <a href="#unpack">unpack</a> 
+functions for packing and unpacking binary information.
+</p>
+
+<p>
+To listen on a specified address 
+on computers with more than one interface card, 
+an interface IP address or name can be 
+optionally specified in <em>str-addr-if</em>. 
+When specifying <em>str-addr-if</em>, 
+a timeout must also be specified
+in <em>int-wait</em>.
+</p>
+
+<p>
+As an alternative, UDP communication 
+can be set up using <a href="#net-listen">net-listen</a>, 
+or <a href="#net-connect">net-connect</a> 
+together with the <tt>"udp"</tt> option 
+to make non-blocking data exchange possible 
+with <a href="#net-receive-from">net-receive-from</a> 
+and <a href="#net-send-to">net-send-to</a>.
+</p>
+
+<br /><br />
+
+
+<a NAME="net-select"></a>
+<h2><span class="function">net-select</span></h2>
+<b>syntax: (net-select <em>int-socket</em> <em>str-mode</em> <em>int-micro-seconds</em>)</b><br />
+<b>syntax: (net-select <em>list-sockets</em> <em>str-mode</em> <em>int-micro-seconds</em>)</b>
+
+<p>
+In the first form, 
+<tt>net-select</tt> finds out about the status 
+of one socket specified in  <em>int-socket</em>. 
+Depending on <em>str-mode</em>, 
+the socket can be checked 
+if it is ready for reading or writing,
+or if the socket has an error condition. 
+A timeout value is specified in <em>int-micro-seconds</em>.
+</p>
+
+<p>
+In the second syntax, 
+<tt>net-select</tt> can check for a list of sockets 
+in <em>list-sockets</em>.
+</p>
+
+<p>
+The following value can be given for <em>str-mode</em>:
+</p>
+
+<blockquote>
+<tt>"read"</tt> or <tt>"r"</tt> to check if ready for reading or accepting.<br />
+
+<tt>"write"</tt> or <tt>"w"</tt> to check if ready for writing.<br />
+<tt>"exception"</tt> or <tt>"e"</tt> to check for an error condition.<br />
+</blockquote>
+
+<p>
+Read, send, or accept operations 
+can be handled without blocking
+by using the <tt>net-select</tt> function. 
+<tt>net-select</tt> waits 
+for a socket to be ready 
+for the value given in <em>int-micro-seconds</em>, 
+then returns <tt>true</tt> or <tt>nil</tt>
+depending on the readiness of the socket.
+During the select loop, 
+other portions of the program can run. 
+On error, 
+<a href="#net-error">net-error</a> is set. 
+When <tt>-1</tt> is specified for <em>int-micro-seconds</em>, 
+<tt>net-select</tt> will never time out.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'listen-socket (net-listen 1001))
+
+;; wait for connection
+(while (not (net-select listen-socket "read" 1000))
+(if (net-error) (print (net-error))))
+(set 'connection (net-accept listen-socket))
+(net-send connection "hello")
+
+;; wait for incoming message
+(while (not (net-select connection "read" 1000))
+(do-something)) 
+(net-receive connection 'buff 1024)
+</pre>
+</blockquote>
+
+<p>
+When <tt>net-select</tt> is used, 
+several listen and connection sockets can be watched, 
+and multiple connections can be handled. 
+When used with a list of sockets, 
+<tt>net-select</tt> will return a list of ready sockets. 
+The following example would listen on two sockets 
+and continue accepting and servicing connections:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'listen-list '(1001 1002))
+
+(while (not (net-error))
+(dolist (conn (net-select listen-list "r" 1000))
+(accept-connection conn))  ; build and accept-list
+
+(dolist (conn (net-select accept-list "r" 1000))
+(read-connection conn))    ; read on conn socket
+
+(dolist (conn (net-select accept-list "w" 1000))
+(write-connection conn)))  ; write on conn socket
+</pre>
+</blockquote>
+
+<p>
+In the second syntax, 
+a list  is returned 
+containing all the sockets 
+that passed the test;
+if timeout occurred, 
+an empty list is returned. 
+An error causes 
+<a href="#net-error">net-error</a> to be set.
+</p>
+
+<p>
+Note that supplying a nonexistent socket to <tt>net-select</tt> 
+will cause an error to be set in <a href="#net-error">net-error</a>.
+</p>
+
+<br /><br />
+
+<a NAME="net-send"></a>
+<h2><span class="function">net-send</span></h2>
+<b>syntax: (net-send <em>int-socket</em> <em>str-buffer</em> [<em>int-num-bytes</em>])</b>
+
+<p>
+Sends the contents of <em>str-buffer</em> on the connection specified by <em>int-socket</em>. 
+If <em>int-num-bytes</em> is specified, up to <em>int-num-bytes</em> are sent. 
+If <em>int-num-bytes</em> is not specified, the entire contents will be sent.
+<tt>net-send</tt> returns the number of bytes sent or <tt>nil</tt> on failure.
+</p>
+
+<tt>On failure use <a href="#net-error">net-error</a> to get more error information.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'buf "hello there")
+
+(net-send sock buf)       <span class=arw>&rarr;</span> 11
+(net-send sock buf 5)     <span class=arw>&rarr;</span> 5
+
+(net-send sock "bye bye") <span class=arw>&rarr;</span> 7
+</pre>
+</blockquote>
+
+<p>
+The first <tt>net-send</tt> sends the string <tt>"hello there"</tt>, while
+the second <tt>net-send</tt> sends only the string <tt>"hello"</tt>.
+</p>
+
+<br /><br />
+
+<a NAME="net-send-to"></a>
+<h2><span class="function">net-send-to</span></h2>
+<b>syntax: (net-send-to <em>str-remotehost</em> <em>int-remoteport</em> <em>str-buffer</em> <em>int-socket</em>)</b>
+
+<p>
+Sends UDP data packets on open connections. 
+The socket in <em>int-socket</em> 
+must have previously been opened with a <a href="#net-connect">net-connect</a> 
+or <a href="#net-listen">net-listen</a> function. 
+Both functions must be opened 
+with their <tt>"udp"</tt> option. 
+The host in <em>str-remotehost</em> 
+can be specified either as a hostname 
+or as an IP-number string.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-connect "asite.com" 1010 "udp") 
+<span class=arw>&rarr;</span> 2058  ; get a UDP socket
+
+(net-send-to "asite.com" 1010 "hello" 2058)
+
+;; optionally poll for answer
+(while (not (net-select 2058 "r" 100000)) 
+(do-something &hellip;))
+
+;; receive answering data from UDP server
+(net-receive-from 2058 20) 
+<span class=arw>&rarr;</span> ("hello to you" "10.20.30.40" 1010)
+
+(net-close 2058)
+</pre>
+</blockquote>
+
+<p>
+The second line in the example is optional. 
+Without it, 
+the <a href="#net-receive-from"> net-receive-from</a> call 
+would block until data arrives. 
+Using polling, 
+a client could maintain conversations with several UDP servers 
+at the same time.
+</p>
+
+<p>
+See also the <a href="#net-receive-from">net-receive-from</a> function
+and the <a href="#net-listen">net-listen</a> function 
+with the <tt>"udp"</tt> option.
+</p>
+
+<p>
+For blocking short UDP transactions, 
+see <a href="#net-send-udp">net-send-udp"</a> 
+and <a href="#net-receive-udp">net-receive-udp</a>.
+</p>
+
+<br /><br />
+
+<a NAME="net-send-udp"></a>
+<h2><span class="function">net-send-udp</span></h2>
+<b>syntax: (net-send-udp <em>str-remotehost</em> <em>int-remoteport</em> <em>str-buffer</em> [<em>bool</em>])</b>
+
+<p>
+Sends a User Datagram Protocol (UDP) 
+to the host specified in <em>str-remotehost</em> 
+and to the port in <em>int-remoteport</em>. 
+The data sent is in <em>str-buffer</em>.
+</p>
+
+<p>
+No previous setup using <tt>net-connect</tt> 
+or <tt>net-listen</tt> is necessary. 
+<tt>net-send-udp</tt> returns immediately 
+with the number of bytes sent 
+and closes the socket used. 
+If no <tt>net-receive-udp</tt> statement 
+is waiting at the receiving side, 
+the datagram sent is lost. 
+When using datagram communications over insecure connections, 
+setting up a simple protocol between sender and receiver 
+is recommended for ensuring delivery. 
+UDP communication by itself 
+does not guarantee reliable delivery 
+as TCP/IP does.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-send-udp "somehost.com" 3333 "Hello")  <span class=arw>&rarr;</span> 5
+</pre>
+</blockquote>
+
+<p>
+<tt>net-send-udp</tt> is also suitable 
+for sending binary information 
+(e.g., the zero character or other nonvisible bytes). 
+For a more comprehensive example, 
+see <a href="#net-receive-udp">net-receive-udp</a>.
+</p>
+
+<p>
+Optionally, the sending socket 
+can be put in broadcast mode 
+by specifying <tt>true</tt> 
+or any expression 
+not evaluating to <tt>nil</tt> 
+in <em>bool</em>:
+</p>
+
+<blockquote>
+<pre>
+(net-send-udp "192.168.1.255" 2000 "Hello" true)  <span class=arw>&rarr;</span> 5
+</pre>
+</blockquote>
+
+<p>
+The UDP will be sent to all nodes 
+on the <tt>192.168.1</tt> network. 
+Note that on some operating systems, 
+sending the network mask <tt>255</tt> 
+without the <em>bool</em> <tt>true</tt> option 
+will enable broadcast mode.
+</p>
+
+<p>
+As an alternative, 
+the <a href="#net-connect">net-connect</a> function 
+using the <tt>"udp"</tt> option&mdash;together with 
+the <a href="#net-send-to">net-send-to</a> function&mdash;can 
+be used to talk to a UDP listener 
+in a non-blocking fashion.
+</p>
+
+<br /><br />
+
+<a NAME="net-service"></a>
+<h2><span class="function">net-service</span></h2>
+<b>syntax: (net-service <em>str-service</em> <em>str-protocol</em>)</b>
+
+<p>
+Makes a lookup in the <em>services</em> database 
+and returns the standard port number for this service. 
+Returns <tt>nil</tt> on failure.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(net-service "ftp" "tcp")       <span class=arw>&rarr;</span> 21
+(net-service "finger" "tcp")    <span class=arw>&rarr;</span> 79
+(net-service "net-eval" "tcp")  <span class=arw>&rarr;</span> 4711  ; if configured
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="net-sessions"></a>
+<h2><span class="function">net-sessions</span></h2>
+<b>syntax: (net-sessions)</b>
+
+<p>
+Returns a list of active listening and connection sockets.
+</p>
+
+<br /><br />
+
+<a name="new"></a>
+<h2><span class="function">new</span></h2>
+<b>syntax: (new <em>context-source</em> <em>sym-context-target</em> [<em>bool</em>])</b><br />
+<b>syntax: (new <em>context-source</em>)</b>
+
+<p>
+In the first syntax, 
+<em>context-source</em> is the name of an existing context, 
+and <em>sym-context-target</em> is the name of a new context 
+to be created just like the original, 
+with the same variable names and user-defined functions. 
+If the context in <em>sym-context-target</em> already exists, 
+then new symbols and definitions are added. 
+Existing symbols are overwritten 
+when the expression in <em>bool</em> 
+evaluates to anything besides <tt>nil</tt>; 
+otherwise, the content of existing symbols 
+will remain. 
+This makes <em>mixins</em> of context objects possible. 
+<tt>new</tt> returns the target context, 
+which cannot be MAIN.
+</p>
+
+<p>
+In the second syntax, 
+the existing context in <em>context-source</em> 
+gets copied into the current context 
+as the target context.
+</p>
+
+<p>
+All references to symbols in the originating context 
+will be translated to references in the target context. 
+This way, all functions and data structures referring to symbols
+in the original context will now refer to symbols in the target context.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(new CTX 'CTX-2)  <span class=arw>&rarr;</span> CTX-2   
+
+;; force overwrite of existing symbols
+(new CTX MyCTX true)  <span class=arw>&rarr;</span> MyCTX   
+
+(set 'CTX:x 123)
+(new CTX)  <span class=arw>&rarr;</span> MAIN  ; copies x into MAIN
+x          <span class=arw>&rarr;</span> 123
+
+(map new '(Ct-a Ct-b Ct-c))  ; merge into current context
+</pre>
+</blockquote>
+
+<p>
+The first line in the example creates a new context 
+called <tt>CTX-2</tt> that has the exact same structure 
+as the original one. 
+Note that <tt>CTX</tt> is not quoted 
+because contexts evaluate to themselves, 
+but CTX-2 must be quoted because it does not exist yet.
+</p>
+
+<p>
+The second line merges the context <tt>CTX</tt> into <tt>MyCTX</tt>. 
+Any existing symbols of same name in <tt>MyCTX</tt> 
+will be overwritten. 
+Because <tt>MyCTX</tt> already exists, 
+the quote before the context symbol can be omitted.
+</p>
+
+<p>
+The last lines show how a foreign context 
+gets merged into the current one 
+and how <a href="#map">map</a> can be used 
+to merge a list of contexts.
+</p>
+
+<p>
+Context symbols need not be mentioned explicitly, 
+but they can be contained in variables:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'foo:x 123)
+(set 'bar:y 999)
+
+(set 'ctxa foo)
+(set 'ctxb bar)
+
+(new ctxa ctxb)  ; from foo to bar
+
+bar:x  <span class=arw>&rarr;</span> 123  ; x has been added to bar
+bar:y  <span class=arw>&rarr;</span> 999)
+</pre>
+</blockquote>
+
+<p>
+The example refers to contexts in variables 
+and merges context <tt>foo</tt> into <tt>bar</tt>.
+</p>
+
+
+<p>
+See also the function <a href="#def-new">def-new</a> 
+for moving and merging single functions 
+instead of entire contexts. 
+See the <a href="#context">context</a> function 
+for a more comprehensive example of <tt>new</tt>.
+</p>
+
+<br /><br />
+
+<a name="nilp"></a>
+<h2><span class="function">nil?</span></h2>
+<b>syntax: (nil? <em>expr</em>)</b>
+
+<p>
+If the expression in <em>expr</em> evaluates to <tt>nil</tt>, 
+then <tt>nil?</tt> returns <tt>true</tt>; 
+otherwise, it returns <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(map nil? '(x nil  1 nil "hi" ()))
+<span class=arw>&rarr;</span> (nil true nil true nil nil)
+
+(nil? nil)  <span class=arw>&rarr;</span> true
+(nil? '())  <span class=arw>&rarr;</span> nil
+
+; nil? means strictly nil
+(nil? (not '()))  <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<p>
+The <tt>nil?</tt> predicate 
+is useful for distinguishing between 
+<tt>nil</tt> and the empty list <tt>()</tt>.
+</p>
+
+<p>Note that <tt>nil?</tt> means <em>strictly</em> <tt>nil</tt>
+while <tt>true?</tt> means everything not <tt>nil</tt> or the
+empty list <tt>()</tt>.</p>
+
+<br /><br /> 
+
+<a NAME="not"></a>
+<h2><span class="function">not</span></h2>
+
+<b>syntax: (not <em>exp</em>)</b>
+
+<p>
+If <em>exp</em> evaluates to <tt>nil</tt>, 
+then <tt>true</tt> is returned; 
+otherwise, <tt>nil</tt> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(not true)            <span class=arw>&rarr;</span> nil
+(not nil)             <span class=arw>&rarr;</span> true
+(not '())             <span class=arw>&rarr;</span> true
+(not (&lt; 1 10))        <span class=arw>&rarr;</span> nil
+(not (not (&lt; 1 10)))  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="normal"></a>
+<h2><span class="function">normal</span></h2>
+<b>syntax: (normal <em>float-mean</em> <em>float-stdev</em> <em>int-n</em>)</b><br />
+<b>syntax: (normal <em>float-mean</em> <em>float-stdev</em>)</b>
+
+<p>
+In the first form, <tt>normal</tt> returns a list of length <em>int-n</em> 
+of random, continuously distributed floating point numbers 
+with a mean of <em>float-mean</em> 
+and a standard deviation of <em>float-stdev</em>. 
+The random generator used internally 
+can be seeded using the <a HREF="#seed">seed</a> function.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(normal 10 3 10)
+<span class=arw>&rarr;</span> (7 6.563476562 11.93945312 6.153320312 9.98828125
+7.984375 10.17871094 6.58984375 9.42578125 12.11230469)
+</pre>
+</blockquote>
+
+<p>
+In the second form, 
+<tt>normal</tt> returns a single 
+normal distributed floating point number:
+</p>
+
+<blockquote>
+<pre>
+(normal 0 1)  <span class=arw>&rarr;</span> 0.6630859375
+</pre>
+</blockquote>
+
+<p>
+See also the <a HREF="#random">random</a> 
+and <a href="#rand">rand</a> functions 
+for evenly distributed numbers, 
+<a href="#amb">amb</a> for randomizing evaluation 
+in a list of expressions, 
+and <a href="#seed">seed</a> for setting a different start point 
+for pseudo random number generation.
+</p>
+
+<br /><br />
+
+<a NAME="now"></a>
+<h2><span class="function">now</span></h2>
+<b>syntax: (now [<em>int-offset</em>])</b>
+<p>
+Returns information about 
+the current date and time 
+as a list of integers. 
+An optional time-zone offset 
+can be specified in minutes in <em>int-offset</em>. 
+This causes the time to be shifted 
+forward or backward in time,
+before being split into separate date values.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(now)  <span class=arw>&rarr;</span> (2002 2 27 18 21 30 140000 57 3 300 0)
+
+(apply date-value (now))  <span class=arw>&rarr;</span> 1014834090
+</pre>
+</blockquote>
+
+<p>
+The numbers represent the following date-time fields:
+</p>
+<br />
+<blockquote>
+<table border="0" cellpadding="1" width="90%" summary="date formatting">
+<tr align="left"><th>format</th><th>description</th></tr>
+
+<tr><td>year</td><td>Gregorian calendar</td></tr>
+<tr><td>month</td><td>               (1&ndash;12)</td></tr>
+<tr><td>day</td><td>                 (1&ndash;31)</td></tr>
+<tr><td>hour</td><td>                (0&ndash;23) UCT</td></tr>
+<tr><td>minute</td><td>              (0&ndash;59)</td></tr>
+<tr><td>second</td><td>              (0&ndash;59)</td></tr>
+<tr><td>microsecond</td><td>         (0&ndash;999999) 
+		OS-specific, millisecond resolution</td></tr>
+		
+<tr><td>day of current year</td><td>Jan 1st is 1</td></tr>
+<tr><td>day of current week</td><td> (1&ndash;7) starting Sunday</td></tr>
+<tr><td>time zone offset in minutes</td><td> west of GMT</td></tr>
+<tr><td>daylight savings time flag</td><td> (0&ndash;1) on Linux/UNIX
+				bias and in minutes on Win32</td></tr>
+</table>
+</blockquote>
+
+<br />
+
+<p>
+The second example returns the UCT time value of seconds 
+after January 1, 1970.
+</p>
+
+<p>
+Ranging from 0 to 23, 
+hours are given in Coordinated Universal Time (UCT) 
+and are not adjusted for the local time zone. 
+The resolution of the microsecond field 
+depends on the operating system and platform. 
+On some platforms, 
+the last three digits of the <tt>microseconds</tt> field 
+are always 0 (zero).
+</p>
+
+<p>
+See also the <a HREF="#date">date</a>, 
+<a href="#date-value">date-value</a>, 
+<a href="#time">time</a>, 
+and <a href="#time-of-day">time-of-day</a> functions.
+</p>
+
+<p>
+Note that on Solaris, 
+the returned time offset value 
+is not working correctly in some versions/platforms 
+and may contain garbage values.
+</p>
+
+<p>
+On many platforms, 
+the daylight savings flag 
+is not active 
+and returns 0 (zero) 
+even during daylight savings time.
+</p>
+
+<br /><br />
+
+<a name="nullp"></a>
+<h2><span class="function">null?</span></h2>
+<b>syntax: (null? <em>expr</em>)</b>
+
+<p>
+Checks if an expression evaluates to <tt>nil</tt>,
+the empty list <tt>()</tt>,
+the empty string <tt>""</tt>,
+<tt>NaN</tt> (not a number),
+or 0 (zero),
+in which case it returns <tt>true</tt>.
+In all other cases,
+<tt>null?</tt> returns <tt>nil</tt>.
+The predicate <tt>null?</tt> is useful in conjunction with the functions <a href="#filter">filter</a> or <a href="#clean">clean</a> to check the outcome of other newLISP operations.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(map null? '(1 0 0.0 2 NaN "hello" "" (a b c) () nil true))
+<span class=arw>&rarr;</span> (nil true true true nil true nil true nil true true nil)
+
+(filter null? '(1 0 2 0.0 NaN "hello" "" (a b c) () nil true)) 
+<span class=arw>&rarr;</span> (0 0 NaN "" () nil)
+
+(clean null? '(1 0 2 0.0 NaN "hello" "" (a b c) () nil true))
+<span class=arw>&rarr;</span> (1 2 "hello" (a b c) true)
+</pre>
+</blockquote>
+
+<p>
+See also the predicates <a href="#emptyp">empty?</a>,
+<a href="#nilp">nil?</a>
+and <a href="#zerop">zero?</a>.
+</p>
+
+<br /><br />
+
+<a NAME="nper"></a>
+<h2><span class="function">nper</span></h2>
+<b>syntax: (nper <em>num-interest</em> <em>num-pmt</em> <em>num-pv</em> [<em>num-fv</em> <em>int-type</em>])</b>
+
+<p>
+Calculates the number of payments required to pay a loan of <em>num-pv</em> with a constant interest rate of <em>num-interest</em> and payment <em>num-pmt</em>.
+If <em>num-fv</em> is omitted,
+the future value of the loan is assumed to be 0.0.
+If payment is at the end of the period,
+<em>int-type</em> is 0;
+else it is 1.
+If <em>int-type</em> is omitted,
+0 is assumed.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(nper (div 0.07 12) 775.30 -100000)  <span class=arw>&rarr;</span> 239.9992828
+</pre>
+</blockquote>
+
+<p>
+The example calculates the number of monthly payments required to pay a loan of $100,000 at a yearly interest rate of 7 percent with payments of $775.30.
+</p>
+
+<p>
+See also the <a HREF="#fv">fv</a>,
+<a href="#irr">irr</a>,
+<a HREF="#npv">npv</a>,
+<a HREF="#pmt">pmt</a>,
+and <a HREF="#pv">pv</a> functions.
+</p>
+<br /><br />
+
+<a NAME="npv"></a>
+<h2><span class="function">npv</span></h2>
+<b>syntax: (npv <em>num-interest</em> <em>list-values</em>)</b>
+
+<p>
+Calculates the net present value of an investment with a fixed interest rate <em>num-interest</em> and a series of future payments and income in <em>list-values</em>.
+Payments are represented by negative values in <em>list-values</em>,
+while income is represented by positive values in <em>list-values</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(npv 0.1 '(1000 1000 1000)) 
+<span class=arw>&rarr;</span> 2486.851991
+
+(npv 0.1 '(-2486.851991 1000 1000 1000)) 
+<span class=arw>&rarr;</span> -1.434386832e-08  ; ~ 0.0 (zero)
+</pre>
+</blockquote>
+
+<p>
+In the example,
+an initial investment of $2,481.85 would allow for an income of $1,000 after the end of the first,
+second,
+and third years.
+</p>
+
+<p>
+See also the <a HREF="#fv">fv</a>,
+<a href="#irr">irr</a>,
+<a HREF="#nper">nper</a>,
+<a HREF="#pmt">pmt</a>,
+and <a HREF="#pv">pv</a> functions.
+</p> 
+
+
+<br /><br />
+
+
+<a NAME="nth"></a>
+<h2><span class="function">nth</span></h2>
+<b>syntax: (nth int-index <em>list</em>)</b><br /><br />
+<b>syntax: (nth (<em>list</em> <em>int-index-1</em> [<em>int-index-2 ...</em>]))</b><br /><br />
+<b>syntax: (nth (<em>array</em> <em>int-index-1</em> [<em>int-index-2 ...</em>]))</b><br /><br />
+<b>syntax: (nth (<em>str</em> <em>int-offset</em>))</b>
+
+<p>
+In the first version, 
+<tt>nth</tt> evaluates <em>int-index</em> 
+and uses it as an index 
+into <em>list</em>,
+returning the element found 
+at that index.
+See also <a HREF="#indexing">Indexing elements of strings and lists</a>.
+Multiple indices may be specified 
+to recursively access elements in nested lists.
+If there are more indices than nesting levels, 
+the extra indices are ignored.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'L '(a b c))
+(nth 0 L)    <span class=arw>&rarr;</span> a
+(nth (L 0))  <span class=arw>&rarr;</span> a
+; or simply
+(L 0) <span class=arw>&rarr;</span> a
+
+(set 'names '(john martha robert alex)) 
+<span class=arw>&rarr;</span> (john martha robert alex)
+
+(nth (names 2))  <span class=arw>&rarr;</span> robert
+; or simpy
+(names 2) <span class=arw>&rarr;</span> robert
+
+(names -1)  <span class=arw>&rarr;</span> alex
+
+(set 'persons '((john 30) (martha 120) ((john doe) 17)))
+
+(persons 1 1)  <span class=arw>&rarr;</span> 120
+
+(nth (persons 2 0 1))  <span class=arw>&rarr;</span> doe
+; or simply
+(persons 2 0 1)  <span class=arw>&rarr;</span> doe
+
+; multiple indices in a vector
+(set 'v '(2 0 1))
+(persons v)      <span class=arw>&rarr;</span> doe
+
+(persons -2 0)  <span class=arw>&rarr;</span> martha
+
+(persons 10)  <span class=arw>&rarr;</span> ((john doe) 17))  ; out of bounds
+(person -5)  <span class=arw>&rarr;</span> (john 30)          ; out of bounds
+</pre>
+</blockquote>
+
+<p>When using a syntax with parenthesized list and indices <tt>(L idx)</tt> then
+<tt>L</tt> can be the context of the default functor <tt>L:L</tt>. This allows lists
+passed by reference:</p>
+
+<blockquote><pre>
+(set 'L:L '(a b c d e f g))
+
+(define (second ctx)
+	(nth (ctx 1)))
+
+;; passing the list in L:L by reference
+(second L)   <span class=arw>&rarr;</span> b
+
+;; passing the list in L:L by value
+(second L:L) <span class=arw>&rarr;</span> b
+</pre></blockquote>
+
+<p>Reference passing is faster and uses less memory in big lists and should
+be used on lists with more than a few hundred items.</p>
+
+<p>Note that the <i>implicit indexing</i> version of <tt>nth</tt> is not breaking Lisp
+syntax rules but should be understood as a logical expansion of Lisp syntax rules to
+other data types than built-in functions or lambda expressions. A list in the functor
+position of an s-expression assumes self-indexing functionality using the index
+arguments following.</p>
+
+<p>
+The implicit indexed syntax forms are faster but the other form with an explicit
+<tt>nth</tt> may be more readable in some situations.
+</p>
+
+<p>
+In the second version,
+<tt>nth</tt> works on <a href="#array">arrays</a> just like it does on lists,
+but out-of-bounds indices will cause an error message.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'aArray (array 2 3 '(a b c d e f))) 
+<span class=arw>&rarr;</span> ((a b c) (d e f))
+(nth (aArray 1))    <span class=arw>&rarr;</span>  (d e f)
+(aArray 1)          <span class=arw>&rarr;</span>  (d e f)
+
+(nth (aArray 1 0))     <span class=arw>&rarr;</span> d
+(nth (aArray '(1 0)))  <span class=arw>&rarr;</span> d
+
+(aArray 1 0)           <span class=arw>&rarr;</span> d
+(aArray '(1 0))        <span class=arw>&rarr;</span> d
+</pre>
+</blockquote>
+
+<p>
+In the third version,
+<tt>nth</tt> returns the character found at the position <em>int-index</em> in <em>str</em> and returns it as a string.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(nth ("newLISP" 0)) <span class=arw>&rarr;</span> "n"
+
+("newLISP" 0)       <span class=arw>&rarr;</span> "n"
+`
+("newLISP" -1)      <span class=arw>&rarr;</span> "P"
+</pre>
+</blockquote>
+
+<p>
+See also the <a HREF="#set-nth">set-nth</a> function for accessing multidimensional nested lists and arrays.
+See the <a href="#push">push</a> and <a href="#pop">pop</a> functions for accessing multidimensional lists.
+</p>
+
+<p>
+Note also that <a href="#nth">nth</a> works on character boundaries rather than byte boundaries when using the UTF-8&ndash;enabled version of newLISP.
+</p>
+
+
+<br /><br />
+
+<a NAME="nth-set"></a>
+
+<h2><span class="function">nth-set</span></h2>
+<b>syntax: (nth-set <em>int-index</em> <em>list</em> <em>exp-replacement</em>)</b><br /><br />
+<b>syntax: (nth-set (<em>list</em> <em>int-nth-1</em> [ <em>int-nth-2 ...</em>]) <em>exp-replacement</em>)</b><br /><br />
+<b>syntax: (nth-set (<em>array</em> <em>int-nth-1</em> [ <em>int-nth-2 ...</em>]) <em>exp-replacement</em>)</b><br /><br />
+<b>syntax: (nth-set (<em>str</em> <em>int-nth-1</em>) <em>str</em> <em> str-replacement</em>)</b>
+
+<p>
+Sets the <em>int-nth</em> element of a list or array with the evaluation of <em>exp-replacement</em> 
+and returns the old element. As shown in the last two syntax lines, 
+<a href="#implicit_indexing">implicit indexing</a> syntax can be used 
+for specifying indices. Implicit indexing is the preferred form in 
+<tt>nth-set</tt> and <a href="#set-nth">set-nth</a>, but both forms remain valid.
+</p>
+
+<p>
+<tt>nth-set</tt> performs a destructive operation, changing the original list or array. 
+More than one index can be specified to recursively traverse nested list structures 
+or multidimensional arrays. An out-of-bounds index always returns the last or first element 
+when indexing a list, but it causes an out-of-bound error when indexing an array. 
+</p>
+
+<p>
+When replacing in lists, the old element is also contained in the system variable $0 and 
+can be used in the replacement expression itself.
+</p>
+
+<blockquote>
+<pre>
+(set 'aList '(a b c d e f g))   
+
+;; plain syntax for on level index
+(nth-set 4 aList (list $0 'z))     <span class=arw>&rarr;</span> e ; old value
+
+;; modern syntax and preferred for multiple indices
+(nth-set (aList 4) (list $0 'z))   <span class=arw>&rarr;</span> e ; old value
+
+aList <span class=arw>&rarr;</span> (a b c d (e z) f g)
+</pre>
+</blockquote>
+
+<p>
+<P>In the second form,
+the <em>int-nth</em> character in <em>str</em> is replaced with the string in <em>str-replacement</em>.
+Out-of-bounds indices will pick the first or last character for replacement,
+and the system variable <tt>$0</tt> is set to the old, replaced character.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;;;;;;;;;;; usage on lists ;;;;;;;;;;;;
+
+(set 'aList '(a b c d e f g))
+
+(nth-set (aList 2) "I am the replacement")  <span class=arw>&rarr;</span> c  ; new syntax
+
+aList  <span class=arw>&rarr;</span> (a b "I am the replacement" d e f g)
+
+$0  <span class=arw>&rarr;</span> c
+
+(set 'aList '(a b (c d (e f g) h) i))
+(nth-set (aList 2 2 0) 'x)  <span class=arw>&rarr;</span> e
+
+aList  <span class=arw>&rarr;</span> (a b (c d (x f g) h) i)
+$0     <span class=arw>&rarr;</span> e
+
+(nth-set (aList -2 2 -1) 99)  <span class=arw>&rarr;</span> g
+
+aList  <span class=arw>&rarr;</span> (a b (c d (x f 99) h) i)
+
+;; use indices in a vector
+
+(set 'aList '(a b (c d (e f g) h) i))
+
+(set 'vec (ref 'f aList))  <span class=arw>&rarr;</span> (2 2 1)
+
+(nth-set (aList vec) 'Z)  <span class=arw>&rarr;</span> f ; old value
+
+aList  <span class=arw>&rarr;</span> (a b (c d (e Z g) h) i)
+
+;; usage on default functors
+
+(set 'db:db '(a b c d e f g))
+
+(nth-set (db 3) 99)  <span class=arw>&rarr;</span> d
+
+db:db  <span class=arw>&rarr;</span> (a b c 99 e f g)
+</pre>
+</blockquote>
+
+<p>
+The following examples use <tt>nth-set</tt> to change the contents of <a href="#array">arrays</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;;;;;;;;;;; usage on arrays ;;;;;;;;;;;;
+
+(set 'myarray (array 3 4 (sequence 1 12)))
+<span class=arw>&rarr;</span> ((1 2 3 4) (5 6 7 8) (9 10 11 12))
+
+(nth-set (myarray 2 3) 99)  <span class=arw>&rarr;</span> 12        
+myarray  
+<span class=arw>&rarr;</span> ((1 2 3 4) (5 6 7 8) (9 10 11 99))
+
+(nth-set (myarray -2 1) "hello")  <span class=arw>&rarr;</span> 6  
+myarray
+<span class=arw>&rarr;</span> ((1 2 3 4) (5 "hello" 7 8) (9 10 11 99))
+
+(nth-set (myarray 1) (array 4 '(a b c d)))
+<span class=arw>&rarr;</span> (5 "hello" 7 8)    
+myarray
+<span class=arw>&rarr;</span> ((1 2 3 4) (a b c d) (9 10 11 99))
+
+;; usage on default functors
+(set 'myarray:myarray (array 7 '(a b c d e f g)))
+
+(nth-set (myarray 3) 99)  <span class=arw>&rarr;</span> d
+myarray:myarray           <span class=arw>&rarr;</span> (a b c 99 e f g)
+</pre>
+</blockquote>
+
+<p>
+<P>When replacing whole rows as in the third example,
+care must be taken to replace it as an array.
+See also the array functions <a href="#array">array</a>,
+<a href="#arrayp">array?</a>,
+and <a href="#array-list">array-list</a>.
+</p>
+
+<p>
+<P>In second form,
+the <em>int-nth</em> character in <em>str</em> is replaced with the string in <em>str-replacement</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;;;;;;;;;;; usage on strings ;;;;;;;;;;;;
+(set 's "abcd")
+
+(nth-set (s 0) "xyz")  <span class=arw>&rarr;</span> "a"   
+s   <span class=arw>&rarr;</span> "xyzbcd"
+$0  <span class=arw>&rarr;</span> "a"
+</pre>
+</blockquote>
+
+
+<p>
+<tt>nth-set</tt> uses the system variable <tt>$0</tt> for the element found in lists and strings.
+This can be used in the replacement expression:
+</p>
+
+<blockquote>
+<pre>
+(set 'lst '(1 2 3 4))
+
+(nth-set (lst 1) (+ $0 1))  <span class=arw>&rarr;</span> 2
+
+lst  <span class=arw>&rarr;</span> '(1 3 3 4)
+</pre>
+</blockquote>
+
+<p>
+See the <a href="#set-nth">set-nth</a> function, 
+which works like <tt>nth-set</tt> 
+but returns the whole changed expression 
+instead of the replaced element. 
+<tt>set-nth</tt> is also slower when doing replacements 
+in larger lists or string buffers.
+</p>
+
+<P>
+Use the <A HREF="#nth">nth</A>, 
+<a href="#push">push</a>, 
+and <a href="#pop">pop</a> functions 
+to access multidimensional nested lists.
+The <A HREF="#nth">nth</A> function
+will also work 
+with multidimensional nested arrays.
+</p>
+
+
+<p>
+<tt>nth-set</tt> works exactly like <a HREF="#set-nth">set-nth</a> but returns the replaced element instead of the whole changed list expression.
+<tt>nth-set</tt> is much faster when replacing elements in larger lists or arrays.
+</p>
+
+<br /><br />
+
+<a NAME="numberp"></a>
+<h2><span class="function">number?</span></h2>
+<b>syntax: (number? <em>exp</em>)</b>
+
+<p>
+<tt>true</tt> is returned only if <em>exp</em> evaluates to a floating point number or an integer;
+otherwise,
+<tt>nil</tt> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 1.23)
+(set 'y 456)
+(number? x)      <span class=arw>&rarr;</span> true
+(number? y)      <span class=arw>&rarr;</span> true
+(number? "678")  <span class=arw>&rarr;</span> nil  
+</pre>
+</blockquote>
+
+<p>
+See the functions <a href="#floatp">float?</a> and <a href="#integerp">integer?</a> to test for a specific number type.
+</p>
+
+<br /><br />
+
+<a NAME="open"></a>
+<h2><span class="function">open</span></h2>
+
+<b>syntax: (open <em>str-path-file</em> <em>str-access-mode</em> [<em>str-option</em>])</b>
+
+<p>
+The <em>str-path-file</em> is a file name,
+and <em>str-access-mode</em> is a string specifying the file access mode.
+<tt>open</tt> returns an integer,
+which is a file handle to be used on subsequent read or write operations on the file.
+On failure,
+<tt>open</tt> returns <tt>nil</tt>.
+The access mode <tt>"write"</tt> creates the file if it doesn't exist,
+or it truncates an existing file to 0 (zero) bytes in length.
+</p>
+
+<p>
+The following strings are legal access modes:
+</p>
+
+<blockquote>
+<tt>"read"</tt> or <tt>"r"</tt> for read only access<br />
+
+<tt>"write"</tt> or <tt>"w"</tt> for write only access<br />
+<tt>"update"</tt> or <tt>"u"</tt> for read/write access<br />
+<tt>"append"</tt> or <tt>"a"</tt> for append read/write access<br />
+
+</blockquote>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(device (open "newfile.data" "write"))  <span class=arw>&rarr;</span> 5
+(print "hello world\n")  <span class=arw>&rarr;</span> "hello world"
+(close (device))         <span class=arw>&rarr;</span> 5
+
+(set 'aFile (open "newfile.data" "read"))
+(seek aFile 6)
+(set 'inChar (read-char aFile))
+(print inChar "\n")
+(close aFile)
+</pre>
+</blockquote>
+
+<p>
+The first example uses <tt>open</tt> to set the device for <a HREF="#print">print</a> and writes the word <tt>"hello world"</tt> into the file <tt>newfile.data</tt>.
+The second example reads a byte value at offset 6 in the same file (the ASCII value of <tt>'w'</tt> is 119).
+Note that using <tt>close</tt> on <a HREF="#device">(device)</a> automatically resets <a HREF="#device">device</a> to 0 (zero).
+</p>
+
+<p>
+As an additional <em>str-option</em>,
+<tt>"non-block"</tt> or <tt>"n"</tt> can be specified after the <tt>"read"</tt> or <tt>"write"</tt> option.
+Only available on UNIX systems,
+non-blocking mode can be useful when opening <em>named pipes</em> but is not required to perform I/O on named pipes.
+</p>
+
+<p>
+To create a named pipe in newLISP,
+use the <a href="#exec">exec</a> or <a href="#import">import</a> function:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(exec "mkfifo myfifo")
+
+;; or alternatively
+
+(import "/lib/libc.so.6" "mkfifo")
+(mkfifo "/tmp/myfifo" 0777)
+</pre>
+
+</blockquote>
+
+<p>
+The named pipe can now be used like a file with <a href="#open">open</a>,
+<a href="#read-buffer">read-buffer</a>,
+and <a href="#write-buffer">write-buffer</a>.
+</p>
+
+<br /><br />
+
+<a NAME="or"></a>
+<h2><span class="function">or</span></h2>
+
+<b>syntax: (or <em>exp-1</em> [<em>exp-2</em> ... ])</b>
+
+<p>
+Evaluates expressions <em>exp-x</em> from left to right until finding a result that does not evaluate to <tt>nil</tt> or the empty list <tt>()</tt>.
+The result is the return value of the <tt>or</tt> expression.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 10)
+(or (&gt; x 100) (= x 10))          <span class=arw>&rarr;</span> true
+(or "hello" (&gt; x 100) (= x 10))  <span class=arw>&rarr;</span> "hello"
+(or '())                         <span class=arw>&rarr;</span> nil
+(or true)                        <span class=arw>&rarr;</span> true
+(or)                             <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="ostype"></a>
+<h2><span class="function">ostype</span></h2>
+<b>syntax: ostype</b>
+
+<p><tt>ostype</tt> is a built-in system constant 
+containing the name of the operating system 
+newLISP is running on.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+ostype  <span class=arw>&rarr;</span> "Win32"
+</pre>
+</blockquote>
+
+<p>One of the following strings is returned: <tt>"Linux", "BSD", "OSX", "Tru64Unix", "Solaris", "Win32", or "OS/2"</tt>.
+</p>
+
+
+<p><tt>ostype</tt> can be used to write platform-independent code:</p>
+<blockquote>
+<pre>
+(if 
+(= ostype "Linux") (import "libz.so")
+(= ostype "BSD") (import "libz.so")
+(= ostype "OSX") (import "libz.dylib")
+...
+(println "cannot import libz on this platform")
+)
+</pre>
+</blockquote>
+
+<p>Use <a href="#sys-info">sys-info</a> to learn more
+about the current flavor of newLISP running.</p>
+
+<br /><br />
+
+<a NAME="pack"></a>
+<h2><span class="function">pack</span></h2>
+<b>syntax: (pack <em>str-format</em> <em>exp-1</em> [<em>exp-2</em> ... ])</b><br />
+<b>syntax: (pack <em>str-format</em> <em>list-expr</em>)</b>
+
+<p>
+Packs one or more expressions (<em>exp-1</em> to <em>exp-n</em>) 
+into a binary format specified in the format string <em>str-format</em>,
+returning the binary structure in a string buffer.
+The symmetrical <a HREF="#unpack">unpack</a> function is used 
+for unpacking. The expression arguments can also be given in a list.
+<tt>pack</tt> and <tt>unpack</tt> are useful 
+when reading and writing binary files 
+(see <a HREF="#read-buffer">read-buffer</a> and 
+<a HREF="#write-buffer">write-buffer</a>) 
+or when unpacking binary structures 
+from return values of imported C functions 
+using <tt>import</tt>.
+</p>
+
+<p>
+The following characters are used in <em>str-format</em>:
+</p>
+
+<blockquote> 
+<br />
+<table border="0" cellpadding="1" width="95%" summary="format characters">
+<tr align="left"><th>format</th><th>description</th></tr>
+
+<tr>
+<td WIDTH="20%"><tt>c </tt></td>
+
+<td WIDTH="80%">a signed 8-bit number</td>
+</tr>
+
+<tr>
+<td><tt>b </tt></td>
+<td>an unsigned 8-bit number</td>
+</tr>
+
+<tr>
+<td><tt>d </tt></td>
+<td>a signed 16-bit short number</td>
+</tr>
+
+<tr>
+<td><tt>u </tt></td>
+<td>an unsigned 16-bit short number</td>
+</tr>
+
+<tr>
+<td><tt>ld</tt></td>
+<td>a signed 32-bit long number</td>
+</tr>
+
+<tr>
+<td><tt>lu</tt></td>
+<td>an unsigned 32-bit long number</td>
+</tr>
+
+<tr>
+<td><tt>Ld</tt></td>
+<td>a signed 64-bit long number</td>
+</tr>
+
+<tr>
+<td><tt>Lu</tt></td>
+<td>an unsigned 64-bit long number</td>
+</tr>
+
+<tr>
+<td><tt>f </tt></td>
+<td>a float in 32-bit representation</td>
+</tr>
+
+<tr>
+<td><tt>lf</tt></td>
+<td>a double float in 64-bit representation</td>
+</tr>
+
+<tr>
+<td><tt>sn</tt></td>
+<td>a string of <em>n</em> null padded ASCII characters</td>
+</tr>
+
+<tr>
+<td><tt>nn</tt></td>
+<td><em>n</em> null characters</td>
+</tr>
+
+<tr>
+<td><tt>&gt;</tt></td>
+
+<td>switch to big endian byte order</td>
+</tr>
+
+<tr>
+<td><tt>&lt;</tt></td>
+<td>switch to little endian byte order</td>
+</tr>
+
+</table>
+</blockquote>
+<br />
+
+<p>
+Note that newLISP only supports 32-bit, signed integers 
+and treats <tt>lu</tt> and <tt>ld</tt> the same way internally.
+</p>
+
+<p>
+<tt>pack</tt> will convert all floats into integers 
+when passed to <tt>b</tt>, <tt>c</tt>, <tt>d</tt>, <tt>ld</tt>,
+or <tt>lu</tt> formats.
+It will also convert integers into floats
+when passing them to <tt>f</tt> and <tt>lf</tt> formats.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(pack "c c c" 65 66 67)  <span class=arw>&rarr;</span> "ABC"
+(unpack "c c c" "ABC")   <span class=arw>&rarr;</span> (65 66 67)
+
+(pack "c c c" 0 1 2)             <span class=arw>&rarr;</span> "\000\001\002"
+(unpack "c c c" "\000\001\002")  <span class=arw>&rarr;</span> (0 1 2)
+
+(set 's (pack "c d u" 10 12345 56789))
+(unpack "c d u" s)  <span class=arw>&rarr;</span> (10 12345 56789)
+
+(set 's (pack "s10 f" "result" 1.23))
+(unpack "s10 f" s)
+<span class=arw>&rarr;</span> ("result\000\000\000\000" 1.230000019)
+
+(set 's (pack "s3 lf" "result" 1.23))
+(unpack "s3 f" s)  <span class=arw>&rarr;</span> ("res" 1.23)
+
+(set 's (pack "c n7 c" 11 22))
+(unpack "c n7 c" s)  <span class=arw>&rarr;</span> (11 22))
+
+(unpack "b" (pack "b" -1.0))  <span class=arw>&rarr;</span> (255)
+(unpack "f" (pack "f" 123))   <span class=arw>&rarr;</span> (123)
+</pre>
+</blockquote>
+
+<p>
+The last two statements show 
+how floating point numbers are converted 
+into integers when required by the format specification.
+</p>
+
+<p>The expressions to pack can also be given in a list:</p>
+
+<blockquote>
+<pre>
+(set 'lst '("A" "B" "C"))
+(set 'adr (pack "lululu" lst))
+(map get-string (unpack "lululu" adr))    <span class=arw>&rarr;</span> ("A" "B" "C")
+</pre>
+</blockquote>
+
+<p>Note that the list should be referenced directly in <tt>pack</tt>,
+so the pointers passed by <tt>adr</tt> are valid. <tt>adr</tt> would be written 
+as <tt>char * adr[]</tt> in the C-programming language and represents a 32-bit pointer to an
+array of 32-bit string pointers.
+</p>
+
+<p>
+The <tt>&gt;</tt> and <tt>&lt;</tt> specifiers 
+can be used to switch between <em>little endian</em> 
+and <em>big endian</em> byte order 
+when packing or unpacking:
+</p>
+
+<blockquote>
+<pre>
+(pack "d" 1)   <span class=arw>&rarr;</span> "\001\000"  ;; on little endian CPU
+(pack "&gt;d" 1)  <span class=arw>&rarr;</span> "\000\001"  ;; force big endian
+
+(pack "ld" 1)   <span class=arw>&rarr;</span> "\001\000\000\000" ;; on little endian CPU
+(pack "&lt;ld" 1)  <span class=arw>&rarr;</span> "\000\000\000\001" ;; force big endian
+</pre>
+</blockquote>
+
+<p>
+Switching the byte order will affect all number formats with 16-,
+32-,
+or 64-bit sizes.
+</p>
+
+<p>
+The pack and unpack format need not be the same:
+</p>
+
+<blockquote>
+<pre>
+(set 's (pack "s3" "ABC"))
+(unpack "c c c" s)  <span class=arw>&rarr;</span> (65 66 67)
+</pre>
+</blockquote>
+
+<p>
+The examples show spaces between the format specifiers.
+These are not required but can be used to improve readability.
+</p> 
+
+<p>
+See also the <a href="#address">address</a>,
+<a HREF="#get-int">get-int</a>,
+<a HREF="#get-long">get-long</a>
+<a HREF="#get-char">get-char</a>,
+<a HREF="#get-string">get-string</a>,
+and <a HREF="#unpack">unpack</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="parse"></a>
+
+<h2><span class="function">parse</span></h2>
+<b>syntax: (parse <em>str-data</em> [<em>str-break</em>  [<em>int-option</em>]])</b>
+
+<p>
+Breaks the string that results from evaluating <em>str-data</em> into string tokens,
+which are then returned in a list.
+When no <em>str-break</em> is given,
+<tt>parse</tt> tokenizes according to newLISP's internal parsing rules.
+A string may be specified in <em>str-break</em> for tokenizing only at the occurrence of a string.
+If an <em>int-option</em> number is specified,
+a regular expression pattern may be used in <em>str-break</em>.
+</p>
+
+<p>
+When <em>str-break</em> is not specified,
+the maximum token size is 2048 for quoted strings and 256 for identifiers.
+In this case,
+newLISP uses the same faster tokenizer it uses for parsing LISP source.
+If <em>str-data</em> is specified,
+there is no limitation on the length of tokens.
+A different algorithm is used that splits the source string <em>str-data</em> at the string in <em>str-break</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(parse "hello how are you")  <span class=arw>&rarr;</span> ("hello" "how" "are" "you")
+
+(parse "one:two:three" ":")  <span class=arw>&rarr;</span> ("one" "two" "three")
+
+(parse "one--two--three" "--")  
+<span class=arw>&rarr;</span> ("one" "two" "three")
+
+(parse "one-two--three---four" "-+" 0)
+<span class=arw>&rarr;</span> ("one" "two" "three" "four")
+
+(parse "hello regular   expression 1, 2, 3" {,\s*|\s+} 0)
+<span class=arw>&rarr;</span> ("hello" "regular" "expression" "1" "2" "3")
+</pre>
+</blockquote>
+
+<p>
+The last two examples show a regular expression 
+as the break string with the default option <tt>0</tt> (zero). 
+Instead of <tt>{</tt> and <tt>}</tt> (left and right curly brackets), 
+quotes can be used to limit the pattern. 
+In this case, 
+double backslashes must be used 
+inside the pattern. 
+The last pattern could be used 
+for parsing CVS files. 
+For the regular expression option numbers, 
+see <a HREF="#regex">regex</a>.
+</p>
+
+<p>
+<tt>parse</tt> will return empty fields 
+around separators 
+as empty strings:
+</p>
+
+<blockquote>
+<pre>
+(parse "1,2,3," ",") <span class=arw>&rarr;</span> ("1" "2" "3" "")
+(parse "1,,,4" ",")  <span class=arw>&rarr;</span> ("1" "" "" "4")
+(parse "," ",")      <span class=arw>&rarr;</span> ("" "")
+
+(parse "")      <span class=arw>&rarr;</span> ()
+(parse "" " ")  <span class=arw>&rarr;</span> ()
+</pre>
+</blockquote>
+
+<p>
+This behavior is needed 
+when parsing records 
+with empty fields.
+</p>
+
+<p>
+Parsing an empty string 
+will always result 
+in an empty list.
+</p>
+
+<p>
+Use the <a HREF="#regex">regex</a> function 
+to break strings up 
+and the <a href="#directory">directory</a>, 
+<a href="#find">find</a>, 
+<a href="#find-all">find-all</a>,
+<a href="#regex">regex</a>, 
+<a href="#replace">replace</a>, 
+and <a href="#search">search</a> functions 
+for using regular expressions.
+</p>
+
+<br /><br />
+
+<a NAME="parse-date"></a>
+<h2><span class="function">parse-date</span></h2>
+<b>syntax: (parse-date <em>str-date</em> <em>str-format</em>)</b>
+
+<p>Parses a date from a text string in <em>str-date</em> 
+using a format as defined in <em>str-format</em>, which uses 
+the same formatting rules found in <a href="#date">date</a>. 
+The function <tt>parse-date</tt> returns the number of seconds passed 
+since January 1, 1900.</p>
+
+<p>This function is not available on Win32 platforms.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(parse-date "2007.1.3" "%Y.%m.%d")    <span class=arw>&rarr;</span> 1167782400
+(parse-date "January 10, 07" "%B %d, %y")    <span class=arw>&rarr;</span> 1168387200
+</pre>
+</blockquote>
+
+<p>See the <a href="#date">date</a> function for all possible format descriptors.</p>
+
+<br /><br />
+
+<a NAME="peek"></a>
+<h2><span class="function">peek</span></h2>
+<b>syntax: (peek <em>int-handle</em>)</b>
+
+<p>
+Returns the number of bytes ready to be read on a file descriptor;
+otherwise,
+it returns <tt>nil</tt> if the file descriptor is invalid.
+<tt>peek</tt> can also be used to check <tt>stdin</tt>.
+This function is only available on UNIX-like operating systems.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(peek 0)  ; check # of bytes ready on stdin
+</pre>
+</blockquote>
+
+<p>
+Use the <a href="#net-peek">net-peek</a> function 
+to check for network sockets, 
+or for the number of available bytes on them. 
+On UNIX systems, 
+<a href="#net-peek">net-peek</a> can be used 
+to check file descriptors. 
+The difference is that 
+<a href="#net-peek">net-peek</a> also sets 
+<a href="#net-error">net-error</a>.
+</p>
+
+<br /><br />
+
+<a NAME="pipe"></a>
+<h2><span class="function">pipe</span></h2>
+<b>syntax: (pipe)</b>
+
+<p>
+Creates an inter-process communications pipe and returns the <tt>read</tt> and <tt>write</tt> handles to it within a list.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(pipe)  <span class=arw>&rarr;</span> (3 4)  ; 3 for read, 4 for writing
+</pre>
+</blockquote>
+
+<p>
+The pipe handles can be passed to a child process or thread launched via <a href="#process"> process</a> or to <a href="#fork">fork</a> for inter-process communications.
+</p>
+
+<p>
+Note that the pipe does not block when being written to,
+but it does block reading until bytes are available.
+A <a href="#read-line">read-line</a> blocks until a newline character is received.
+A <a href="#read-buffer"> read-buffer</a> blocks when fewer characters than specified are available from a pipe that has not had the writing end closed by all processes.
+</p>
+
+<p>
+More than one pipe can be opened if required.
+</p>
+
+<p>
+newLISP can also use <em>named pipes</em>.
+See the <a href="#open">open</a> function for further information.
+</p>
+
+<br /><br />
+
+<a NAME="pmt"></a>
+<h2><span class="function">pmt</span></h2>
+
+<b>syntax: (pmt <em>num-interest</em> <em>num-periods</em> <em>num-principal</em> [<em>num-future-value</em> <em>int-type</em>])</b>
+
+<p>
+Calculates the payment for a loan based on a constant interest of <em>num-interest</em> and constant payments over <em>num-periods</em> of time.
+<em>num-future-value</em> is the value of the loan at the end (typically 0.0).
+When paying at the end of each period,
+<em>num-type</em> is 0 (zero);
+otherwise,
+it is 1.
+If omitted,
+<em>int-type</em> is assumed to be 0 (zero) for payment at the end of a period.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(pmt (div 0.07 12) 240 100000)  <span class=arw>&rarr;</span> -775.2989356
+</pre>
+</blockquote>
+
+<p>
+The above example calculates a payment of $775.30 for a loan of $100,000 at a yearly interest rate of 7 percent.
+It is calculated monthly and paid over 20 years (20 * 12 = 240 monthly periods).
+This illustrates the typical way payment is calculated for mortgages.
+</p>
+
+<p>
+See also the <a HREF="#fv">fv</a>,
+<a href="#irr">irr</a>,
+<a HREF="#nper">nper</a>,
+<a HREF="#npv">npv</a>,
+and <a HREF="#pv">pv</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="pop"></a>
+<h2><span class="function">pop</span></h2>
+<b>syntax: (pop <em>list</em> [<em>int-index-1</em> [<em>int-index-2</em> ... ]])</b><br />
+<b>syntax: (pop <em>list</em> [<em>list-indexes</em>])</b><br /><br />
+
+<b>syntax: (pop <em>str</em>&nbsp;[<em>int-index</em> [<em>int-length</em>]])</b>
+
+<p>Using <tt>pop</tt> elements can be removed from lists and characters from strings.</p>
+
+<p>
+In the first syntax <tt>pop</tt> extracts an element from the list found 
+by evaluating <em>list</em>.
+If a second parameter is present,
+the element at <em>int-index</em> is extracted and returned.
+See also <a HREF="#indexing">Indexing elements of strings and lists</a>.
+</p>
+
+<p>
+In the second version,
+indices are specified in the list <em>list-indexes</em>.
+This way,
+<tt>pop</tt> works easily together with <a href="#ref">ref</a>
+and <a href="#ref-all">ref-all</a>,
+which return lists of indices.
+</p> 
+
+<p>
+<tt>pop</tt> changes the contents of the target list.
+The popped element is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'pList '((f g) a b c "hello" d e 10))
+
+(pop pList)  <span class=arw>&rarr;</span> (f g)
+(pop pList)  <span class=arw>&rarr;</span> a
+plist        <span class=arw>&rarr;</span> (b c "hello" d e 10)
+
+(pop pList 3)    <span class=arw>&rarr;</span> d
+(pop pList 100)  <span class=arw>&rarr;</span> 10
+pList            <span class=arw>&rarr;</span> (b c "hello" e)
+
+(pop pList -1)  <span class=arw>&rarr;</span> e
+pList           <span class=arw>&rarr;</span> (b c "hello")
+
+(pop pList -2)  <span class=arw>&rarr;</span> c
+pList           <span class=arw>&rarr;</span> (b "hello")
+
+(set 'pList '(a 2 (x y (p q) z)))
+
+(pop pList -1 2 0)  <span class=arw>&rarr;</span> p
+
+;; use indices in a list
+(set 'pList '(a b (c d () e)))
+
+(push 'x pList '(2 2 0))  <span class=arw>&rarr;</span> x
+pList
+<span class=arw>&rarr;</span> (a b (c d (x) e))
+
+(ref 'x pList)  <span class=arw>&rarr;</span> (2 2 0)
+
+(pop pList '(2 2 0))  <span class=arw>&rarr;</span> x
+</pre>
+</blockquote>
+
+<p><tt>pop</tt> can also be used on strings with one index:</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; use pop on strings
+
+(set 'str "newLISP")
+
+(pop str -4 4)  <span class=arw>&rarr;</span> "LISP"
+
+str  <span class=arw>&rarr;</span> "new"
+
+(pop str 1)  <span class=arw>&rarr;</span> "e"
+
+str  <span class=arw>&rarr;</span> "nw"
+
+(set 'str "x")
+
+(pop str)  <span class=arw>&rarr;</span> "x"
+(pop str)  <span class=arw>&rarr;</span> ""
+</pre>
+</blockquote>
+
+<p>Popping an empty string will return an empty string.</p>
+
+<p>
+See also the <a HREF="#push">push</a> function,
+the inverse operation to <tt>pop</tt>,
+and the <a href="#set-nth">set-nth</a> and <a href="#nth">nth</a> functions,
+which can take multidimensional indices into lists.
+</p>
+
+<br /><br />
+
+<a NAME="pop-assoc"></a>
+<h2><span class="function">pop-assoc</span></h2>
+<b>syntax: (pop (<em>list-alist</em> <em>expr-key-1</em> [<em>expr-key-2</em> ... ])</b>
+
+<p>Removes and association referred to by the key in <em>expr-key</em> from
+th association list in <em>list-alist</em>.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'L '((a (b 1) (c (d 2)))))
+(pop-assoc (L 'a)) <span class=arw>&rarr;</span> (a (b 1) (c (d 2)))
+L <span class=arw>&rarr;</span> '()
+
+(set 'L '((a (b 1) (c (d 2)))))
+(pop-assoc (L 'a 'b))  <span class=arw>&rarr;</span> (b 1)
+L <span class=arw>&rarr;</span>  '((a (c (d 2))))
+
+(set 'L '((a (b 1) (c (d 2)))))
+(pop-assoc (L 'a 'c))  <span class=arw>&rarr;</span> (c (d 2))
+L <span class=arw>&rarr;</span> '((a (b 1))))
+</pre>
+</blockquote>
+
+<p>See also <a href="#assoc">assoc</a> for retrieving associations and <a href="#set-assoc">set-assoc</a>
+ans <a href="#assoc-set">assoc-set</a> for changing associations.</p>
+
+<br /><br />
+
+<a NAME="post-url"></a>
+<h2><span class="function">post-url</span></h2>
+<b>syntax: (post-url <em>str-url</em> <em>str-content</em> [<em>str-content-type</em> [<em>str-option</em>] [<em>int-timeout</em> [ <em>str-header</em>]]])</b>
+
+<p>
+Sends an HTTP POST request to the URL in <em>str-url</em>.
+POST requests are used to post information collected from web entry forms to a web site.
+Most of the time,
+the function <tt>post-url</tt> mimics what a web browser would do when sending information collected in an HTML form to a server,
+but it can also be used to upload files (see an HTTP reference).
+The function returns the page returned from the server in a string.
+</p>
+
+<p>
+When <tt>post-url</tt> encounters an error,
+it returns a string description of the error beginning with <tt>ERR:</tt>.
+</p>
+
+<p>
+The last parameter,
+<em>int-timeout</em>,
+is for an optional timeout value,
+which is specified in milliseconds.
+When no response from the host is received before the timeout has expired,
+the string <tt>ERR:
+timeout</tt> is returned. 
+</p>
+<b>example:</b>
+<blockquote>
+<pre>
+(post-url "http://somesite.com/form.pl" 
+"name=johnDoe&amp;city=New%20York" 
+"application/x-www-form-urlencoded")
+
+(post-url "http://somesite.com/form.pl" 
+"name=johnDoe&amp;city=New%20York" 
+"application/x-www-form-urlencoded" 8000)
+
+;; assumes default content type
+(post-url "http://somesite.com/form.pl"
+"name=johnDoe&amp;city=New%20York" 
+</pre>
+</blockquote>
+
+<p>
+The above example uploads a user name and city using a special format called <tt>application/x-www-form-urlencoded</tt>.
+<tt>post-url</tt> can be used to post other content types such as files or binary data.
+See an HTTP reference for other content-type specifications and data encoding formats.
+When the content-type parameter is omitted,
+<tt>post-url</tt> assumes <tt>application/x-www-form-urlencoded</tt> as the default content type.
+</p>
+
+<h3>Additional parameters</h3>
+<p>
+When <em>str-content-type</em> is specified,
+the <em>str-option</em> <tt>"header"</tt> or <tt>"list"</tt> can be specified as the return page.
+If the <em>int-timeout</em> option is specified,
+the custom header option <em>str-header</em> can be specified,
+as well.
+See the function <a href="#get-url">get-url</a> for details on both of these options.
+</p>
+
+<p>
+See also the <a HREF="#get-url">get-url</a> and <a HREF="#put-url">put-url</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="pow"></a>
+<h2><span class="function">pow</span></h2>
+<b>syntax: (pow <em>num-1</em> <em>num-2 </em> [<em>num-3</em> ... ])</b><br>
+<b>syntax: (pow <em>num-1</em>)</b>
+
+<p>
+Calculates <em>num-1</em> to the power of <em>num-2</em> and so forth.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(pow 100 2)      <span class=arw>&rarr;</span> 10000
+(pow 100 0.5)    <span class=arw>&rarr;</span> 10
+(pow 100 0.5 3)  <span class=arw>&rarr;</span> 1000
+
+(pow 3)  <span class=arw>&rarr;</span> 9
+</pre>
+</blockquote>
+
+<p>
+When <em>num-1</em> is the only argument,
+<tt>pow</tt> assumes 2 for the exponent.
+</p>
+<br /><br />
+
+<a NAME="pretty-print"></a>
+
+<h2><span class="function">pretty-print</span></h2>
+<b>syntax: (pretty-print [<em>int-length</em> [<em>str-tab</em>]])</b>
+
+<p>
+Reformats expressions for <a href="#print">print</a>,
+<a href="#save">save</a>,
+or <a href="#source">source</a>.
+The first parameter,
+<em>int-length</em>,
+specifies the maximum line length,
+and <em>str-tab</em> specifies the string used to indent lines.
+All parameters are optional.
+<tt>pretty-print</tt> returns the current settings or the new settings when one or both parameters are specified.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(pretty-print)  <span class=arw>&rarr;</span> (64 " ")  ; default setting
+
+(pretty-print 90 "\t")  <span class=arw>&rarr;</span> (90 "\t")
+
+(pretty-print 100)  <span class=arw>&rarr;</span> (100 "\t") 
+</pre>
+</blockquote>
+
+<p>
+The first example reports the default settings of 64 for the maximum line length and a <tt>TAB</tt> character for indenting.
+The third example changes the line length only.
+</p>
+
+<p>
+Note that <tt>pretty-print</tt> cannot be used to prevent line breaks from being printed.
+To completely suppress pretty printing,
+use the function <a href="#string">string</a> to convert the expression to a raw unformatted string as follows:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; print without formatting
+
+(print (string my-expression))	
+</pre>
+</blockquote>
+
+<br /><br />
+
+
+<a NAME="primitivep"></a>
+<h2><span class="function">primitive?</span></h2>
+<b>syntax: (primitive? <em>exp</em>)</b>
+
+<p>
+Evaluates and tests if <em>exp</em> is a primitive symbol and returns <tt>true</tt> or <tt>nil</tt> depending on the result.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'var define)
+(primitive? var)  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="print"></a>
+<h2><span class="function">print</span></h2>
+<b>syntax: (print <em>exp-1</em> [<em>exp-2</em> ... ])</b>
+
+<p>
+Evaluates and prints <em>exp-1</em>&mdash;
+to the current I/O device,
+which defaults to the console window.
+See the built-in function <a HREF="#device">device</a> for details on how to specify a different I/O device.
+</p>
+
+<p>
+List expressions are indented by the nesting levels of their opening parentheses.
+</p>
+
+<p>
+Several special characters may be included in strings encoded with the escape character <tt>\</tt>:
+</p>
+<br />
+<blockquote> 
+<table border="0" cellpadding="1" width="95%" summary="escape characters in print">
+<tr align="left" valign="bottom"><th>escaped<br />character</th><th>description</th></tr>
+
+<tr>
+<td><tt>\n</tt></td>
+<td>the line-feed character (ASCII 10)</td>
+
+</tr>
+
+<tr>
+<td><tt>\r</tt></td>
+<td>the carriage-return character (ASCII 13)</td>
+</tr>
+
+<tr>
+<td><tt>\t</tt></td>
+<td>the tab character (ASCII 9)</td>
+</tr>
+
+<tr>
+
+<td><tt>\nnn</tt></td>
+<td>where <em>nnn</em> is a decimal ASCII code between 000 and 255</td>
+</tr>
+
+</table>
+</blockquote>
+
+<br />
+
+<b>example:</b>
+<blockquote>
+<pre>
+(print (set 'res (+ 1 2 3))) 
+(print "the result is" res "\n")
+
+"\065\066\067"  <span class=arw>&rarr;</span> "ABC"
+</pre>
+</blockquote>
+
+<p>
+	To finish printing with a line feed,
+	use <a HREF="#println">println</a>.
+</p>
+
+<br /><br />
+
+<a NAME="println"></a>
+<h2><span class="function">println</span></h2>
+<b>syntax: (println <em>exp-1</em> [<em>exp-2</em> ... ])</b>
+
+<p>
+	Evaluates and prints <em>exp-1</em>&mdash;
+	to the current I/O device,
+	which defaults to the console window.
+	A line feed is printed at the end.
+	See the built-in function <a HREF="#device">device</a> for details on how to specify a different I/O device.
+	<tt>println</tt> works exactly like <a HREF="#print">print</a> but emits a line-feed character at the end.
+</p>
+
+<p>
+	See also the <a HREF="#write-line">write-line</a> and <a HREF="#print">print</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="prob-chi2"></a>
+<h2><span class="function">prob-chi2</span></h2>
+<b>syntax: (prob-chi2 <em>num-chi2</em> <em>num-df</em>)</b>
+
+<p>
+	Returns the probability Q of an observed Chi&sup2;
+	statistic in <em>num-chi2</em> with <em>num-df</em> degrees of freedom to be equal to or greater than.
+	<tt>prob-chi2</tt> is derived from the incomplete Gamma function <a HREF="#gammai">gammai</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(prob-chi2 10 6)  <span class=arw>&rarr;</span> 0.1246520195
+</pre>
+</blockquote>
+
+<p>
+	See also the inverse function <a href="#crit-chi2">crit-chi2</a>.
+</p> 
+
+<br /><br />
+
+<a NAME="prob-z"></a>
+<h2><span class="function">prob-z</span></h2>
+<b>syntax: (prob-z <em>num-z</em>)</b>
+
+<p>
+	Returns the probability of <em>num-z</em>,
+	not to exceed the observed value where <em>num-z</em> is a normal distributed value with a mean of 0.0 and a standard deviation of 1.0.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(prob-z 0.0)  <span class=arw>&rarr;</span> 0.5
+</pre>
+</blockquote>
+
+
+<p>
+	See also the inverse function <a href="#crit-z">crit-z</a>.
+</p> 
+
+<br /><br />
+
+<a NAME="process"></a>
+<h2><span class="function">process</span></h2>
+<b>syntax: (process <em>str-command</em>)</b><br />
+<b>syntax: (process <em>str-command</em> <em>int-pipe-in</em> <em>int-pipe-out</em> [<em>int-win32-option</em>])</b><br />
+<b>syntax: (process <em>str-command</em> <em>int-pipe-in</em> <em>int-pipe-out</em> [<em>int-pipe-error</em>])</b>
+
+<p>
+	In the first syntax,
+	<tt>process</tt> launches a  process specified in <em>str-command</em> and immediately returns with the
+    process ID or <tt>nil</tt> if a the process could not be created. On Mac OS X and other UNIX, the application
+    or script must be specified with its full path-name. The new process inherits the OS envrionment from the
+    parent process.
+</p>
+
+<p> Command line arguments are parsed out at spaces. Arguments containing spaces must be delimited using 
+    single quotes on Mac OS X and other UNIX. On Win32 double quotes are used. The process id returned
+    can be used to destroy the running process using <a href="#destroy">destroy</a>, if the process does 
+	not exit by itself.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(process "notepad")  <span class=arw>&rarr;</span> 1894 ; on Win32
+</pre>
+</blockquote>
+
+<p>
+	In the second syntax,
+	standard input and output of the created process can be redirected to pipe handles.
+	When remapping standard I/O of the launched application to a pipe,
+	it is possible to communicate with the other application via <a href="#write-line">write-line</a> and <a href="#read-line">read-line</a>  or <a href="#write-buffer">write-buffer</a> and <a href="#read-buffer">read-buffer</a> statements:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; Linux/UNIX
+;; create pipes
+(map set '(myin bcout) (pipe))
+(map set '(bcin myout) (pipe))   
+
+;; launch UNIX 'bc' calculator application
+(process "/usr/bin/bc" bcin bcout) <span class=arw>&rarr;</span> 7916
+
+(write-buffer myout "3 + 4\n")  ; bc expects a linefeed
+
+(read-line myin)  <span class=arw>&rarr;</span> "7"
+
+
+;; bc can use bignums with arbitrary precision
+
+(write-buffer myout "123456789012345 * 123456789012345\n")
+
+(read-line myin)  <span class=arw>&rarr;</span> "15241578753238669120562399025"
+
+;; destroy the process
+(destroy 7916)
+
+;; Win32
+(map set '(myin cmdout) (pipe))
+(map set '(cmdin myout) (pipe))
+
+(process "cmd" cmdin cmdout)  ; Win32 command shell
+
+(write-line "dir c:\\*.bat" myout)
+
+(read-buffer myin 'buff 2000)
+
+(println buff)  ; directory listing
+</pre>
+</blockquote>
+
+<p>
+	On Win32 versions of newLISP,
+	a fourth optional parameter of <em>int-win32-option</em> can be specified to control the display status of the application.
+	This option defaults to <tt>1</tt> for showing the application's window,
+	<tt>0</tt> for hiding it,
+	and <tt>2</tt> for showing it minimized on the Windows launch bar.
+</p>
+
+<p>
+	On both Win32 and Linux/UNIX systems,
+	standard error will be redirected to standard out by default.
+	On Linux/UNIX,
+	an optional pipe handle for standard error output can be defined.
+	In this case,
+	<a href="#peek">peek</a> can be used to check for information on the pipe handles:
+</p>
+
+<blockquote>
+<pre>
+;; create pipes
+(map set '(myin bcout) (pipe))
+(map set '(bcin myout) (pipe))   
+(map set '(errin errout) (pipe))   
+
+;; launch UNIX 'bc' calculator application
+(process "bc" bcin bcout errout)
+
+(write-buffer myout command)
+
+;; wait for bc sending result or error info
+(while (and (= (peek myin) 0)
+            (= (peek errin) 0)) (sleep 10))
+
+(if (&gt; (peek errin) 0)
+	(println (read-line errin)))
+	
+(if (&gt; (peek myin) 0)
+	(println (read-line myin)))
+</pre>
+</blockquote>
+
+<p>
+	 Not all interactive console applications can have their standard I/O channels remapped.
+	Sometimes only one channel,
+	<em>in</em> or <em>out</em>,
+	can be remapped.
+	In this case,
+	specify <tt>0</tt> (zero) for the unused channel.
+	The following statement uses only the launched application's output:
+</p>
+
+<blockquote>
+<pre>
+(process "app" 0 myout)
+</pre>
+</blockquote>
+
+<p>
+	Normally,
+	two pipes are used:
+	one for communications to the child process and the other one for communications from the child process.
+</p>
+
+<p>
+	See also the <a href="#pipe">pipe</a> and <a href="#share">share</a> functions for inter-process communications and the <a href="#semaphore">semaphore</a> function for synchronization of several processes.
+	See the <a href="#fork">fork</a> function for starting separate newLISP threads on Linux/UNIX.
+</p>
+
+<br /><br />
+
+<a NAME="protectedp"></a>
+<h2><span class="function">protected?</span></h2>
+
+<b>syntax: (protected? <em>sym</em>)</b>
+
+<p>Checks checks if a symbol in <em>sym</em> is protected. Protected symbols are built-in
+functions, context symbols and all symbols made constant using the <a href="#constant">constant</a>
+function:</p>
+
+<blockquote>
+<pre>
+(protected? 'println)    <span class=arw>&rarr;</span> true
+(constant 'aVar 123)
+(protected? 'aVar)       <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="push"></a>
+<h2><span class="function">push</span></h2>
+<b>syntax: (push <em>exp</em>i <em>list</em> [<em>int-index-1</em> [<em>int-index-2 ...</em>]])</b><br />
+<b>syntax: (push <em>exp</em> <em>list</em> [<em>list-indexes</em>])</b><br /><br />
+
+<b>syntax: (push <em>str-1</em> <em>str-2</em> [<em>int-index</em>])</b>
+
+<p>
+	Inserts the value of <em>exp</em> into the list <em>list</em>.
+	If <em>int-index</em> is present,
+	the element is inserted at that index.
+	If the index is absent,
+	the element is inserted at index 0 (zero),
+	the first element.
+	<tt>push</tt> is a destructive operation that changes the contents of the target list.
+	The element inserted is returned.
+	See also <a HREF="#indexing">Indexing elements of strings and lists</a>.
+</p>
+
+<p>
+	If more than one <em>int-index</em> is present,
+	the indices are used to access a nested list structure.
+	Improper indices (those not matching list elements) are discarded.
+</p>
+
+<p>
+	The second version takes a list of <em>list-indexes</em> but is otherwise identical to the first.
+	In this way,
+	<tt>push</tt> works easily together with <a href="#ref">ref</a>
+	and <a href="#ref-all">ref-all</a>,
+	which return lists of indices.
+</p>
+
+<p>
+	If <em>list</em> does not contain a list,
+	<em>list</em> must contain a <tt>nil</tt> and will be initialized to the empty list.
+</p>
+
+<p>
+	Repeatedly using <tt>push</tt> to the end of a list 
+	using <tt>-1</tt> as the <em>int-index</em>
+	is optimized and as fast as pushing 
+	to the front of a list 
+	with no index at all.
+	This can be used to efficiently grow a list.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+; inserting in front
+(set 'pList '(b c))  <span class=arw>&rarr;</span> (b c)
+(push 'a pList)      <span class=arw>&rarr;</span> a
+pList                <span class=arw>&rarr;</span> (a b c)
+
+; insert at index
+(push "hello" pList 2)  <span class=arw>&rarr;</span> "hello"
+pList                   <span class=arw>&rarr;</span> (a b "hello" c)
+
+; optimized appending at the end
+(push 'z pList -1)  <span class=arw>&rarr;</span> z    
+pList               <span class=arw>&rarr;</span> (a b "hello" c z)
+
+; inserting lists in lists
+(push '(f g) pList)  <span class=arw>&rarr;</span> (f g)
+pList                <span class=arw>&rarr;</span> ((f g) a b "hello" c z)
+
+; inserting at negative index
+(push 'x pList -3)  <span class=arw>&rarr;</span> x
+pList               <span class=arw>&rarr;</span> ((f g) a b "hello" x c z)
+
+; using multiple indices
+(push 'h pList 0 -1)  <span class=arw>&rarr;</span> h
+pList                 <span class=arw>&rarr;</span> ((f g h) a b "hello" x c z)
+
+; use indices in a list
+(set 'pList '(a b (c d () e)))
+
+(push 'x pList '(2 2 0))  <span class=arw>&rarr;</span> x
+pList                     <span class=arw>&rarr;</span> (a b (c d (x) e))
+
+(ref 'x pList)  <span class=arw>&rarr;</span> (2 2 0)
+
+(pop pList '(2 2 0))  <span class=arw>&rarr;</span> x
+
+;; push on strings
+
+(set 'str "abcdefg")
+
+(push "hijk" str -1)  <span class=arw>&rarr;</span> "hijk"
+str                   <span class=arw>&rarr;</span> "abcdefghijk"
+
+(push "123" str)  <span class=arw>&rarr;</span> "123"
+str               <span class=arw>&rarr;</span> "123abcdefghijk"
+
+(push "4" str 3)  <span class=arw>&rarr;</span> "4"
+str               <span class=arw>&rarr;</span> "1234abcdefghijk"
+
+; push on uninitialized symbol
+aVar  <span class=arw>&rarr;</span> nil 
+
+(push 999 aVar)  <span class=arw>&rarr;</span> 999 
+
+aVar  <span class=arw>&rarr;</span> (999)
+</pre>
+</blockquote>
+
+<p>
+	See also the <a HREF="#pop">pop</a> function,
+	which is the inverse operation to <tt>push</tt>,
+	and the <a href="#set-nth">set-nth</a>,
+	<a href="#nth-set">nth-set</a>,
+	and <a href="#nth">nth</a> functions,
+	which can all take multidimensional indices into lists.
+</p>
+
+<br /><br />
+
+<a NAME="put-url"></a>
+<h2><span class="function">put-url</span></h2>
+<b>syntax: (put-url <em>str-url</em> <em>str-content</em> [<em>str-option</em>] [<em>int-timeout</em> [<em>str-header</em>]])</b>
+
+<p>
+	The HTTP PUT protocol is used to transfer information in <em>str-content</em> to a file specified in <em>str-url</em>.
+	The lesser-known HTTP PUT mode is frequently used for transferring web pages from HTML editors to Web servers.
+	In order to use PUT mode,
+	the web server's software must be configured correctly.
+	On the Apache web server,
+	use the <tt>'Script PUT'</tt> directive in the section where directory access rights are configured.
+</p>
+
+<p>
+	Optionally,
+	an <em>int-timeout</em> value can be specified in milliseconds as the last parameter.
+	<tt>put-url</tt> will return <tt>ERR:
+	timeout</tt> when the host gives no response and the timeout expires.
+	On other error conditions,
+	<tt>put-url</tt> returns a string starting with <tt>ERR:</tt> and the description of the error.
+</p>
+
+<p>
+	<tt>put-url</tt> requests are also understood by newLISP server nodes.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(put-url "http://asite.com/myFile.txt" "Hi there")
+(put-url "http://asite.com/myFile.txt" "Hi there" 2000)
+
+(put-url "http://asite.com/webpage.html" 
+    (read-file "webpage.html"))
+</pre>
+</blockquote>
+
+<p>
+	The first example creates a file called <tt>myFile.txt</tt> on the target server and stores the text string <tt>'Hi there'</tt> in it.
+	In the second example,
+	the local file <tt>webpage.html</tt> is transferred to <tt>asite.com</tt>.
+</p>
+
+<p>
+	On an Apache web server,
+	the following could be configured in <tt>httpd.conf</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+&lt;directory /www/htdocs&gt;
+Options All
+Script PUT /cgi-bin/put.cgi
+&lt;/directory&gt;
+</pre>
+</blockquote>
+
+<p>
+	 The script <tt>put.cgi</tt> would contain code to receive content from the web server via STDIN.
+	The following is a working <tt>put.cgi</tt> written in newLISP for the Apache web server:
+</p>
+
+<b>example:</b>
+<pre>
+#!/usr/home/johndoe/bin/newlisp
+#
+#
+# get PUT method data from CGI STDIN 
+# and write data to a file specified
+# int the PUT request
+# 
+#
+
+
+(print "Content-type: text/html\n\n")
+
+(set 'cnt 0)
+(set 'result "")
+
+(if (= "PUT" (env "REQUEST_METHOD"))
+    (begin
+      (set 'len (integer (env "CONTENT_LENGTH")))
+
+      (while (&lt; cnt len)
+          (set 'n (read-buffer (device) 'buffer len))
+          (if (not n) 
+            (set 'cnt len) 
+            (begin 
+              (inc 'cnt n)
+              (write-buffer result buffer))))
+              
+      (set 'path (append 
+              "/usr/home/johndoe" 
+              (env "PATH_TRANSLATED")))
+
+      (write-file path result)
+    )
+)
+
+(exit)
+</pre>
+
+
+<p>
+	Note that the script appends ".txt" to the path to avoid the CGI execution of uploaded malicious scripts.
+	Note also that the two lines where the file path is composed may work differently in your web server environment.
+	Check environment variables passed by your web server for composition of the right file path.
+</p>
+
+<p>
+	<tt>put-url</tt> returns content returned by the <tt>put.cgi</tt> script.
+</p>
+
+<h3>Additional parameters</h3>
+<p>
+	In <em>str-option</em>,
+	<tt>"header"</tt> or <tt>"list"</tt> can be specified for the returned page.
+	If the <em>int-timeout</em> option is specified,
+	the custom header option <em>str-header</em> can be specified,
+	as well.
+	See the function <a href="#get-url">get-url</a> for details on both of these options.
+</p>
+
+<p>
+	See also the functions <a HREF="#get-url">get-url</a> and <a HREF="#post-url">post-url</a>,
+	which can be used to upload files when formatting form data as <tt>multipart/form-data</tt>.
+</p>
+
+<br /><br />
+
+
+<a NAME="pv"></a>
+<h2><span class="function">pv</span></h2>
+<b>syntax: (pv <em>num-int</em> <em>num-nper</em> <em>num-pmt</em> [<em>num-fv int-type</em>])</b>
+
+<p>
+	Calculates the present value of a loan with the constant interest rate <em>num-interest</em> and the constant payment <em>num-pmt</em> after <em>num-nper</em> number of payments.
+	The future value <em>num-pmt</em> is assumed to be 0.0 if omitted.
+	If payment is at the end of each period,
+	0 (zero) is assumed for <em>int-type</em>;
+	otherwise 1 is assumed.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(pv (div 0.07 12) 240 775.30)  <span class=arw>&rarr;</span> -100000.1373
+</pre>
+</blockquote>
+<p>
+	In the example,
+	a loan that would be paid off (future value = 0.0) in 240 payments of $775.30 at a constant interest rate of 7 percent per year would start out at $100,000.14.
+</p>
+
+<p>
+	See also the <a HREF="#fv">fv</a>,
+	<a href="#irr">irr</a>,
+	<a HREF="#nper">nper</a>,
+	<a HREF="#npv">npv</a>,
+	and <a HREF="#pmt">pmt</a> functions.
+</p>
+
+<br /><br />
+
+
+<a NAME="quote"></a>
+<h2><span class="function">quote</span></h2>
+<b>syntax: (quote <em>exp</em>)</b>
+
+<p>
+	Returns <em>exp</em> without evaluating it.
+	The same effect can be obtained by prepending a <tt>'</tt> (single quote) to <em>exp</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(quote x)         <span class=arw>&rarr;</span> x
+(quote 123)       <span class=arw>&rarr;</span> 123
+(quote (a b c))   <span class=arw>&rarr;</span> (a b c)
+(= (quote x) 'x)  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="quotep"></a>
+<h2><span class="function">quote?</span></h2>
+<b>syntax: (quote? <em>exp</em>)</b>
+
+<p>
+	 Evaluates and tests whether <em>exp</em> is quoted.
+	Returns <tt>true</tt> or <tt>nil</tt> depending on the result.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'var ''x)  <span class=arw>&rarr;</span> 'x
+(quote? var)    <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+<p>
+	 Note that in the <tt>set</tt> statement,
+	<tt> ''x</tt> is quoted twice because the first quote is lost during the evaluation of the <tt>set</tt> assignment.
+</p>
+
+<br /><br />
+
+<a NAME="rand"></a>
+<h2><span class="function">rand</span></h2>
+<b>syntax: (rand <em>int-range</em> [<em>int-N</em>])</b>
+
+<p>
+	Evaluates the expression in <em>int-range</em> 
+	and generates a random number in the range of 
+	0 (zero) to (<em>int-range</em> - 1). 
+	When <tt>0</tt> (zero) is passed, 
+	the internal random generator 
+	is initialized using 
+	the current value returned by 
+	the C <tt>time()</tt> function. 
+	Optionally, a second parameter 
+	can be specified to return 
+	a list of length <em>int-N</em> 
+	of random numbers.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(dotimes (x 100) (print (rand 2))) =&gt;
+11100000110100111100111101 ... 10111101011101111101001100001000
+
+(rand 3 100)  <span class=arw>&rarr;</span> (2 0 1 1 2 0 &hellip;)
+</pre>
+</blockquote>
+
+<p>
+	The first line in the example 
+	prints equally distributed <tt>0</tt>'s and <tt>1</tt>'s, 
+	while the second line produces a list 
+	of 100 integers with 
+	<tt>0</tt>, <tt>1</tt>, and <tt>2</tt> equally distributed. 
+	Use the <a HREF="#random">random</a> 
+	and <a HREF="#normal">normal</a> functions
+	to generate floating point
+	random numbers, 
+	and use <a href="#seed">seed</a> to vary 
+	the initial seed 
+	for random number generation.
+</p>
+
+<br /><br />
+
+<a NAME="random"></a>
+<h2><span class="function">random</span></h2>
+<b>syntax: (random <em>float-offset</em> <em>float-scale</em> <em>int-n</em>)</b><br />
+<b>syntax: (random <em>float-offset</em> <em>float-scale</em>)</b>
+
+<p>
+	In the first form, 
+	<tt>random</tt> returns a list of <em>int-n</em> 
+	evenly distributed floating point numbers 
+	scaled (multiplied) by <em>float-scale</em>, 
+	with an added offset of <em>float-offset</em>. 
+	The starting point of the internal random generator 
+	can be seeded using <a HREF="#seed">seed</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(random 0 1 10)
+<span class=arw>&rarr;</span> (0.10898973 0.69823783 0.56434872 0.041507289 0.16516733
+    0.81540917 0.68553784 0.76471068 0.82314585 0.95924564)
+</pre>
+</blockquote>
+
+<p>
+	When used in the second form, 
+	<tt>random</tt> returns a single 
+	evenly distributed number:
+</p>
+
+<blockquote>
+<pre>
+(random 10 5)  <span class=arw>&rarr;</span> 11.0971
+</pre>
+</blockquote>
+
+<p>
+	See also the <a HREF="#normal">normal</a> 
+	and <a HREF="#rand">rand</a> functions.
+</p>
+<br /><br />
+
+<a NAME="randomize"></a>
+<h2><span class="function">randomize</span></h2>
+<b>syntax: (randomize <em>list</em> [<em>bool</em>])</b>
+
+<p>
+	Rearranges the order of elements in <em>list</em> 
+	into a random order.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(randomize '(a b c d e f g))  <span class=arw>&rarr;</span> (b a c g d e f)
+(randomize (sequence 1 5))    <span class=arw>&rarr;</span> (3 5 4 1 2)
+</pre>
+</blockquote>
+
+<p>
+	<tt>randomize</tt> will always return 
+	a sequence different from the previous one 
+	without the optional <em>bool</em> flag. 
+	This may require the function to calculate 
+	several sets of reordered elements, 
+	which in turn may lead to different processing times 
+	with different invocations of the function 
+	on the same input list length. 
+	To allow for the output to be equal 
+	to the input, <tt>true</tt> 
+	or any expression evaluating to 
+	not <tt>nil</tt> 
+	must be specified in <em>bool</em>.
+</p>
+
+<p>
+	<tt>randomize</tt> uses 
+	an internal <em>pseudo random sequence</em> generator 
+	that returns the same series of results 
+	each time newLISP is started. 
+	Use the <a href="#seed">seed</a> function to 
+	change this sequence.
+</p> 
+
+<br /><br />
+
+
+<a NAME="read-buffer"></a>
+<h2><span class="function">read-buffer</span></h2>
+
+<b>syntax: (read-buffer <em>int-file</em> <em>sym-buffer</em> <em>int-size</em> [<em>str-wait</em>])</b>
+
+<p>
+	Reads a maximum of <em>int-size</em> bytes 
+	from a file specified in <em>int-file</em> 
+	into a buffer in <em>sym-buffer</em>. 
+	Any data referenced by the symbol <em>sym-buffer</em> 
+	prior to the reading is deleted. 
+	The handle in <em>int-file</em> 
+	is obtained from a previous <a HREF="#open">open</a> statement. 
+	The symbol <em>sym-buffer</em> contains data 
+	of type string after the read operation.
+</p>
+
+<p>
+	Optionally, 
+	a string to be waited for 
+	can be specified in <em>str-wait</em>. 
+	<tt>read-buffer</tt> will read 
+	a maximum amount of bytes 
+	specified in <em>int-size</em> 
+	or return earlier 
+	if <em>str-wait</em> was found 
+	in the data. 
+	The wait-string is part
+	of the returned data and must
+    not contain binary <tt>0</tt> (zero)
+    characters.
+</p>
+
+<p>
+	Returns the number of bytes read or <tt>nil</tt> 
+	when the wait-string was not found. 
+	In any case, 
+	the bytes read are put into the buffer 
+	pointed to by <em>sym-buffer</em>, 
+	and the file pointer of the file read 
+	is moved forward. 
+	If no new bytes have been read, 
+	<em>sym-buffer</em> will contain <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'handle (open "aFile.ext" "read"))
+(read-buffer handle 'buff 200)
+</pre>
+</blockquote>
+
+<p>
+	Reads 200 bytes into the symbol <tt>buff</tt> 
+	from the file <tt>aFile.ext</tt>.
+</p>
+
+<blockquote>
+<pre>
+(read-buffer handle 'buff 1000 "password:")
+</pre>
+</blockquote>
+
+<p>
+	Reads 1000 bytes or until 
+	the string <tt>password:</tt> is encountered. 
+	The string <tt>password:</tt> 
+	will be part of the data returned.
+</p>
+
+<p>
+	See also the <a HREF="#write-buffer">write-buffer</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="read-char"></a>
+<h2><span class="function">read-char</span></h2>
+
+<b>syntax: (read-char <em>int-file</em>)</b>
+
+<p>
+	Reads a byte from a file specified 
+	by the file handle in <em>int-file</em>. 
+	The file handle is obtained from 
+	a previous <a HREF="#open">open</a> operation. 
+	Each <tt>read-char</tt> advances 
+	the file pointer by one byte. 
+	Once the end of the file is reached, 
+	<tt>nil</tt> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (slow-file-copy from-file to-file)
+(set 'in-file (open from-file "read"))
+(set 'out-file (open to-file "write"))
+(while (set 'chr (read-char in-file))
+    (write-char out-file chr))
+    (close in-file)
+    (close out-file)
+    "finished")
+</pre>
+</blockquote>
+
+<p>
+	Use <a HREF="#read-line">read-line</a> 
+	and <a HREF="#device">device</a> to read 
+	whole text lines at a time. 
+	Note that newLISP supplies 
+	a fast built-in function 
+	called <a HREF="#copy-file">copy-file</a> 
+	for copying files.
+</p>
+
+<p>
+	See also the <a HREF="#write-char">write-char</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="read-file"></a>
+<h2><span class="function">read-file</span></h2>
+<b>syntax: (read-file <em>str-file-name</em>)</b>
+
+<p>
+	Reads a file in <em>str-file-name</em> 
+	in one swoop and returns a string buffer 
+	containing the data.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(write-file "myfile.enc" 
+    (encrypt (read-file "/home/lisp/myFile") "secret"))
+</pre>
+</blockquote>
+
+<p>
+	The file <tt>myfile</tt> is read, 
+	then encrypted using the password <tt>"secret"</tt> 
+	before being written back into a new file titled <tt>"myfile.enc"</tt> 
+	in the current directory.
+</p>
+
+<p>
+	<tt>read-file</tt> can take an <tt>http://</tt> 
+	or <tt>file://</tt> URL in <em>str-file-name</em>. 
+	In this case, <tt>read-file</tt> works exactly like 
+	<a href="#get-url">get-url</a> and can take 
+	the same additional parameters.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(read-file "http://asite.com/somefile.tgz" 10000)
+</pre>
+</blockquote>
+
+<p>
+	The file <tt>somefile.tgz</tt> is retrieved from 
+	the remote location <tt>http://asite.com</tt>. 
+	The file transfer will time out after 10 seconds 
+	if it is not finished. 
+	In this mode, <tt>read-file</tt> can also be used 
+	to transfer files from remote newLISP server nodes.</p>
+
+<p>See also the <a HREF="#write-file">write-file</a> and 
+<a HREF="#append-file">append-file</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="read-key"></a>
+<h2><span class="function">read-key</span></h2>
+<b>syntax: (read-key)</b>
+
+<p>
+	Reads a key from the keyboard 
+	and returns an integer value. 
+	For navigation keys, 
+	more than one <tt>read-key</tt> call 
+	must be made. 
+	For keys representing ASCII characters, 
+	the return value is the same 
+	on all OSes, except for navigation keys 
+	and other control sequences like function keys, 
+	in which case the return values may vary 
+	on different OSes and configurations.
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(read-key)  <span class=arw>&rarr;</span> 97  ; after hitting the A key
+(read-key)  <span class=arw>&rarr;</span> 65  ; after hitting the shifted A key
+(read-key)  <span class=arw>&rarr;</span> 10  ; after hitting [enter] on Linux
+(read-key)  <span class=arw>&rarr;</span> 13  ; after hitting [enter] on Win32
+
+(while (!= (set 'c (read-key)) 1) (println c))
+</pre>
+</blockquote>
+
+<p>
+	The last example can be used 
+	to check return sequences 
+	from navigation and function keys. 
+	To break out of the loop, 
+	press <tt>Ctrl-A</tt>.
+</p>
+
+<p>
+	Note that <tt>read-key</tt> will not work 
+	from the newLISP-GS front-end 
+	or any other application running 
+	newLISP over a TCP/IP port connection.
+</p>
+
+<br /><br />
+
+<a NAME="read-line"></a>
+
+<h2><span class="function">read-line</span></h2>
+<b>syntax: (read-line [<em>int-file</em>])</b>
+
+<p>
+	Reads from the current I/O device a string 
+	delimited by a line-feed character (ASCII 10). 
+	There is no limit 
+	to the length of the string 
+	that can be read. 
+	The line-feed character is not part of the returned string. 
+	The line always breaks on a line feed, 
+	which is then swallowed. 
+	A line breaks on a carriage return (ASCII 13) 
+	only if followed by a line feed, 
+	in which case both characters are discarded. 
+	A carriage return alone only breaks and is swallowed 
+	if it is the last character in the stream.
+</p>
+
+<p>
+	By default, 
+	the current <a HREF="#device">device</a> 
+	is the keyboard (<a HREF="#device">device</a> 0). 
+	Use the built-in function <a HREF="#device">device</a> 
+	to specify a different I/O device (e.g., a file). 
+	Optionally, 
+	a file handle can be specified 
+	in the <em>int-file</em> obtained 
+	from a previous <a HREF="#open">open</a> statement.
+</p>
+
+<p>
+	The last buffer contents 
+	from a read-line operation 
+	can be retrieved using <a HREF="#current-line">current-line</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(print "Enter a num:")
+(set 'num (integer (read-line)))
+
+(set 'in-file (open "afile.dat" "read"))
+(while (read-line in-file)
+        (write-line))   
+(close in-file)
+</pre>
+</blockquote>
+
+<p>
+	The first example reads input from the keyboard 
+	and converts it to a number. 
+	In the second example, 
+	a file is read line by line 
+	and displayed on the screen. 
+	The <tt>write-line</tt> statement 
+	takes advantage of the fact 
+	that the result from the last 
+	<tt>read-line</tt> operation 
+	is stored in a system internal buffer. 
+	When <a HREF="#write-line">write-line</a> 
+	is used without argument, 
+	it writes the contents 
+	of the last <tt>read-line</tt> buffer 
+	to the screen.
+</p>
+
+<p>
+	See also the <a HREF="#current-line">current-line</a> function
+	for retrieving this buffer.
+</p>
+
+<br /><br />
+<a NAME="real-path"></a>
+<h2><span class="function">real-path</span></h2>
+<b>syntax: (real-path [<em>str-path</em>])</b>
+
+<p>
+	Returns the full path 
+	from the relative file path 
+	given in <em>str-path</em>. 
+	If a path is not given, 
+	<tt>"."</tt> (the current directory) is assumed.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(real-path)  <span class=arw>&rarr;</span> "/usr/home/fred"  ; current directory
+(real-path "./somefile.txt")
+<span class=arw>&rarr;</span> "/usr/home/fred/somefile.txt"
+</pre>
+</blockquote>
+
+<p>
+	The output length is limited 
+	by the OS's maximum allowed path length. 
+	If <tt>real-path</tt> fails 
+	(e.g., because of a nonexistent path), 
+	<tt>nil</tt> is returned.
+</p>
+
+
+
+<br /><br />
+
+<a NAME="ref"></a>
+<h2><span class="function">ref</span></h2>
+<b>syntax: (ref <em>exp-key</em> <em>list</em> [<em>func-compare</em>])</b>
+<b>syntax: (ref (<em>list</em> <em>exp-key</em>) [<em>func-compare</em>])</b>
+
+<p>
+	<tt>ref</tt> searches for the key expression <em>exp-key</em> 
+	in <em>list</em> and returns a list of integer indices 
+	or an empty list if <em>exp-key</em> cannot be found. 
+	<tt>ref</tt> can work together with <a href="#push">push</a> 
+	and <a href="pop">pop</a>, 
+	both of which can also take lists of indices.
+</p>
+
+</p>
+The optional <em>func-compare</em> 
+contains a comparison operator 
+or function. In this case the system variable <tt>$0</tt> contains
+the last expression found.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'pList '(a b (c d () e)))
+
+(push 'x pList '(2 2 0))  <span class=arw>&rarr;</span> x
+
+pList  <span class=arw>&rarr;</span> (a b (c d (x) e))
+
+(ref 'x pList)    <span class=arw>&rarr;</span> (2 2 0)
+
+; or form suitable for context default functors
+(ref (pList 'x)    <span class=arw>&rarr;</span> (2 2 0)
+
+(ref '(x) pList)  <span class=arw>&rarr;</span> (2 2)
+
+(set 'v (ref '(x) pList)) <span class=arw>&rarr;</span> (2 2)
+
+(pList v) <span class=arw>&rarr;</span> (x)
+
+(ref '(c d (x) e) pList)  <span class=arw>&rarr;</span> (2)
+
+(ref 'foo pList)  <span class=arw>&rarr;</span> ()
+
+(pop pList '(2 2 0))  <span class=arw>&rarr;</span> x
+
+; with optional comparison function
+
+(ref 'e '(a b (c d (e) f)))    <span class=arw>&rarr;</span> (2 2 0)
+
+(ref 'e '(a b (c d (e) f)) =)  <span class=arw>&rarr;</span> (2 2 0)
+$0 <span class=arw>&rarr;</span> e
+
+(ref 'e '(a b (c d (e) f)) &gt;)  <span class=arw>&rarr;</span> (0)
+$0 <span class=arw>&rarr;</span> a
+
+(ref 'e '(a b (c d (e) f)) (fn (x y) (or (= x y) (= y 'd)))) <span class=arw>&rarr;</span> (2 1)
+$0 <span class=arw>&rarr;</span> d
+
+; define the comparison function first
+(define (is-it-or-d x y) (or (= x y) (= y 'd)))
+
+(ref 'e '(a b (c d (e) f)) is-it-or-d)  <span class=arw>&rarr;</span> (2 1)
+$0 <span class=arw>&rarr;</span> d
+</pre>
+</blockquote>
+
+<p>
+The following example shows the use of 
+<a href="#match">match</a> and <a href="#unify">unify</a> 
+to formulate searches that are as powerful as regular expressions are 
+for strings:
+</p>
+
+<blockquote>
+<pre>
+(ref '(a ?) '((l 3) (a 12) (k 5) (a 10) (z 22)) match) <span class=arw>&rarr;</span> (1)
+$0 <span class=arw>&rarr;</span> (a 12)
+
+(ref '(X X) '( ((a b) (c d)) ((e e) (f g)) ) unify) <span class=arw>&rarr;</span> (1 0)
+$0 <span class=arw>&rarr;</span> (e e)
+
+(ref '(X g) '( ((a b) (c d)) ((e e) (f g)) ) unify) <span class=arw>&rarr;</span> (1 1)
+$0 <span class=arw>&rarr;</span> (f g)
+</pre>
+</blockquote>
+
+<p>
+The first line searches for a list pair 
+where the two elements are equal.
+The second searches for a list pair 
+with the symbol <tt>g</tt> as the second member.
+</p>
+
+<p>When using the second syntax, the list can be passed by a context
+identifying a default functor:</p>
+
+<blockquote>
+<pre>
+(set 'L:L '(a b (c d) e f))
+
+(ref (L 'd))  <span class=arw>&rarr;</span> (2 1)
+</pre>
+</blockquote>
+
+<p>This is suitable when passing lists by reference using a context.</p>
+<p>
+See also the <a href="#ref-all">ref-all</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="ref-all"></a>
+<h2><span class="function">ref-all</span></h2>
+<b>syntax: (ref-all <em>exp list</em> [<em>func-compare</em>])</b>
+
+<p>
+	Works similarly to <a href="#ref">ref</a>,
+	but returns a list of all index vectors found 
+	for <em>exp</em> in <em>list</em>.
+</p>
+
+<p>
+By default, <tt>ref-all</tt> checks if expressions are equal.
+With <em>func-compare</em>, more complex comparison functions 
+can be defined.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'L '(a b c (d a f (a h a)) (k a (m n a) (x))))
+
+(ref-all 'a L) <span class=arw>&rarr;</span> ((0) (3 1) (3 3 0) (3 3 2) (4 1) (4 2 2))
+
+(L '(3 1)) <span class=arw>&rarr;</span> a
+
+(map 'L (ref-all 'a L)) <span class=arw>&rarr;</span> (a a a a a a)
+
+; with comparison operator
+
+(set 'L '(a b c (d f (h l a)) (k a (m n) (x))))
+
+(ref-all 'c L)    <span class=arw>&rarr;</span> ((2))
+
+(ref-all 'c L &gt;)  <span class=arw>&rarr;</span> ((0) (1) (3 2 2) (4 1))
+
+(ref-all 'a L (fn (x y) (or (= x y) (= y 'k))))  
+<span class=arw>&rarr;</span> ((0) (3 2 2) (4 0) (4 1))
+
+(ref-all nil L (fn (x y) (&gt; (length y) 2)))      
+<span class=arw>&rarr;</span> ((3) (3 2) (4))
+
+; define the comparison functions first
+(define (is-long? x y) (&gt; (length y) 2)) ; the x gets occupied by 'nil
+
+(ref-all nil L is-long?) <span class=arw>&rarr;</span>  ((3) (3 2) (4))
+
+(define (is-it-or-d x y) (or (= x y) (= y 'd)))
+
+(ref-all 'e '(a b (c d (e) f)) is-it-or-d)  <span class=arw>&rarr;</span> ((2 1) (2 2 0))
+</pre>
+</blockquote>
+
+<p>
+The comparison function can be a previously defined function. 
+Note that the comparison function always takes two arguments, 
+even if only the second argument is used 
+inside the function (as in the example using <tt>long?</tt>).
+</p>
+
+<p>
+Using the <a href="#match">match</a> 
+and <a href="#unify">unify</a> functions, 
+list searches can be formulated that are as powerful 
+as regular expression searches are for strings.
+</p>
+
+<blockquote>
+<pre>
+(ref-all '(a ?) '((l 3) (a 12) (k 5) (a 10) (z 22)) match)          
+<span class=arw>&rarr;</span> ((1) (3))
+
+(ref-all '(X X) '( ((a b) (c d)) ((e e) (f g)) ((z) (z))) unify)    
+<span class=arw>&rarr;</span> ((1 0) (2))
+
+(ref-all '(X g) '( ((x y z) g) ((a b) (c d)) ((e e) (f g))) unify)  
+<span class=arw>&rarr;</span> ((0) (2 1))
+</pre>
+</blockquote>
+
+<p>
+	See also the <a href="#ref">ref</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="ref-set"></a>
+<h2><span class="function">ref-set</span></h2>
+<b>syntax: (ref-set (<em>list</em> <em>exp-key</em>) <em>exp-replacement</em> [<em>func-compare</em>])</b><br />
+
+<p>Searches for <em>exp-key</em> in <em>list</em> and replaces the found element with <em>exp-replacement</em>.
+The <em>list</em> can be nested. The system variable <tt>$0</tt> contains the expression found
+and can be used in <em>exp-replacement</em>. The function returns the old replaced element.</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'data '(fruits (apples 123 44) (oranges 1 5 3)))
+
+(ref-set (data 'apples) 'Apples)  <span class=arw>&rarr;</span> apples
+</pre>
+</blockquote>
+
+<p><tt>data</tt> could be the context identifier of a default function for passing lists by reference:</p>
+
+<blockquote>
+<pre>
+(set 'data:data '(fruits (apples 123 44) (oranges 1 5 3)))
+
+(define (update ct key value)
+	(ref-set (ct key) value))
+
+(update data 'apples 'Apples)  <span class=arw>&rarr;</span> apples
+(update data 'oranges 'Oranges)  <span class=arw>&rarr;</span> oranges
+
+data:data <span class=arw>&rarr;</span> (fruits (Apples 123 44) (oranges 1 5 3))
+</pre>
+</blockquote>
+
+<p>For examples on how to use <em>func-compare</em> see <a href="#set-ref-all">set-ref-all</a></p>
+
+<p>See also <a href="#set-ref">set-ref</a> which returns the whole changed list
+instead of the old element, but else works identical. For changing all
+occurences of an element in a list use <a href="#set-ref-all">set-ref-all</a>.</p>
+
+<br /><br />
+
+<a NAME="regex"></a>
+
+<h2><span class="function">regex</span></h2>
+<b>syntax: (regex <em>str-pattern</em> <em>str-text</em> [<em>int-option</em>])</b>
+
+<p>
+	Performs a Perl Compatible Regular Expression (PCRE) search 
+	on <em>str-text</em> with the pattern specified in <em>str-pattern</em>. 
+	The same regular expression pattern matching 
+	is also supported in the functions <a href="#directory">directory</a>, 
+	<a HREF="#find">find</a>, <a href="#find-all">find-all</a>, 
+	<a href="#parse">parse</a>, <a HREF="#replace">replace</a>, 
+	and <a HREF="#search">search</a> when using these functions on strings.
+</p>
+
+<p>
+	<tt>regex</tt> returns a list with the matched strings and substrings 
+	and the beginning and length of each string inside the text. 
+	If no match is found, it returns <tt>nil</tt>.
+	The offset numbers can be used for subsequent processing.
+</p>
+
+<p>
+	<tt>regex</tt> also sets the variables <tt>$0, $1,</tt> 
+	and <tt>$2&mdash;</tt> 
+	to the expression and subexpressions found. 
+	Just like any other symbol in newLISP, 
+	these variables or their equivalent expressions 
+	<tt>$0, $1,</tt> and <tt>$2&mdash;</tt> can be used in other 
+	LISP expressions for further processing.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(regex "b+" "aaaabbbaaaa")  <span class=arw>&rarr;</span> ("bbb" 4 3)
+
+; case-insensitive search option 1
+(regex "b+" "AAAABBBAAAA" 1)  <span class=arw>&rarr;</span> ("BBB" 4 3) 
+
+(regex "[bB]+" "AAAABbBAAAA" )  <span class=arw>&rarr;</span> ("BbB" 4 3)
+
+(regex "http://(.*):(.*)" "http://nuevatec.com:80") 
+<span class=arw>&rarr;</span> ("http://nuevatec.com:80" 0 22 "nuevatec.com" 7 12 "80" 20 2)
+
+$0  <span class=arw>&rarr;</span> "http://nuevatec.com:80"
+$1  <span class=arw>&rarr;</span> "nuevatec.com"
+$2  <span class=arw>&rarr;</span> "80"
+
+(dotimes (i 3) (println ($ i)))
+<b>http://nuevatec.com:80
+nuevatec.com
+80</b>
+<span class=arw>&rarr;</span> "80"
+</pre>
+</blockquote>
+
+<p>
+	 The second example shows the usage of extra options,
+	while the third example demonstrates more complex parsing of two subexpressions,
+	which where marked by parentheses in the search pattern.
+	In the last example,
+	the expression and subexpressions are retrieved using the system variables <tt>$0</tt> to <tt>$2</tt> or their equivalent expression <tt>($ 0)</tt> to <tt>($ 2)</tt>.
+</p>
+
+<p>
+	When <tt>""</tt> (quotes) are used 
+	to delimit strings 
+	that include literal backslashes, 
+	the backslash must be doubled in the regular expression pattern.
+	As an alternative, <tt>{ }</tt> (curly brackets) 
+	or <tt>[text]</tt> and <tt>[/text]</tt> (text tags) 
+	can be used to delimit text strings.
+	In these cases, no extra backslashes are required.
+</p>
+
+<p>
+	Characters escaped by a backslash in newLISP 
+	(e.g., the quote <tt>\"</tt> or <tt>\n</tt>) 
+	need not to be doubled in a regular expression pattern, 
+	which itself is delimited by quotes.
+</p>
+
+<blockquote>
+<pre>
+;; double backslash for parentheses (special char in regex)
+(regex "\\(abc\\)" "xyz(abc)xyz")  <span class=arw>&rarr;</span> ("(abc)" 3 5)  
+
+;; one backslash for quotes (special char in newLISP)
+(regex "\"" "abc\"def")  <span class=arw>&rarr;</span> ("\"" 3 1)     
+
+;; brackets as delimiters
+(regex {\(abc\)} "xyz(abc)xyz")  <span class=arw>&rarr;</span> ("(abc)" 3 5)  
+
+;; brackets as delimiters and quote in pattern
+(regex {"} "abc\"def")  <span class=arw>&rarr;</span> ("\"" 3 1)     
+
+;; text tags as delimiters, good for multiline text in CGI
+(regex [text]\(abc\)[/text] "xyz(abc)xyz")  <span class=arw>&rarr;</span> ("(abc)" 3 5)  
+(regex [text]"[/text] "abc\"def")           <span class=arw>&rarr;</span> ("\"" 3 1) 
+</pre>
+</blockquote>
+
+<p>
+	When curly brackets or text tags 
+	are used to delimit the pattern string 
+	instead of quotes, 
+	a simple backslash is sufficient. 
+	The pattern and string are then passed in raw form 
+	to the regular expression routines.
+	When curly brackets are used inside a pattern 
+	itself delimited by curly brackets,
+	the inner brackets must be balanced, as follows:
+</p>
+
+<blockquote>
+<pre>
+;; brackets inside brackets are balanced
+(regex {\d{1,3}} "qwerty567asdfg")  <span class=arw>&rarr;</span> ("567" 6 3) 
+</pre>
+</blockquote>
+
+
+<p>
+	 The following constants can be used for <em>int-option</em>.
+	Several options can be combined using a binary or <tt>|</tt> (pipe).
+	The uppercase names are used in the PCRE regex documentation and could be predefined in <tt>init.lsp</tt>.
+	The last option is a newLISP custom option only to be used in <a href="#replace">replace</a>;
+	it can be combined with PCRE options.
+</p>
+
+<pre>
+  PCRE_CASELESS        1   ; treat uppercase like lowercase
+  PCRE_MULTILINE       2   ; limit search at a newline like Perl's /m
+  PCRE_DOTALL          4   ; . (dot) also matches newline
+  PCRE_EXTENDED        8   ; ignore whitespace except inside char class
+  PCRE_ANCHORED       16   ; anchor at the start
+  PCRE_DOLLAR_ENDONLY 32   ; $ matches at end of string, not before newline
+  PCRE_EXTRA          64   ; additional functionality currently not used
+  PCRE_NOTBOL        128   ; first ch, not start of line; ^ shouldn't match
+  PCRE_NOTEOL        256   ; last char, not end of line; $ shouldn't match
+  PCRE_UNGREEDY      512   ; invert greediness of quantifiers
+  PCRE_NOTEMPTY     1024   ; empty string considered invalid
+  PCRE_UTF8         2048   ; pattern and strings as UTF-8 characters
+                           
+  REPLACE_ONCE    0x8000   ; replace only one occurrence
+                           ; only for use in <a href="#replace">replace</a>
+</pre>
+
+<p>
+	Note that regular expression syntax is very complex 
+	and feature-rich with many special characters and forms.
+	Please consult a book or the PCRE manual pages for more detail.
+	Most PERL books or introductions to Linux or UNIX 
+	also contain chapters about regular expressions.
+	See also <a HREF="http://www.pcre.org">http://www.pcre.org</a> 
+	for further references and manual pages.
+</p>
+
+<br /><br />
+
+
+<a NAME="remove-dir"></a>
+<h2><span class="function">remove-dir</span></h2>
+<b>syntax: (remove-dir <em>str-path</em>)</b>
+
+<p>
+	Removes the directory
+	whose path name is specified in <em>str-path</em>.
+	The directory must be empty for <tt>remove-dir</tt> to succeed.
+	Returns <tt>nil</tt> on failure.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(remove-dir "temp")
+</pre>
+</blockquote>
+
+<p>
+	Removes the directory <tt>temp</tt> 
+	in the current directory.
+</p>
+
+<br /><br />
+
+<a NAME="rename-file"></a>
+<h2><span class="function">rename-file</span></h2>
+<b>syntax: (rename-file <em>str-path-old</em> <em>str-path-new</em>)</b>
+
+<p>
+	Renames a file or directory entry 
+	given in the path name <em>str-path-old</em> 
+	to the name given in <em>str-path-new</em>.
+	Returns <tt>nil</tt> or <tt>true</tt> 
+	depending on the operation's success.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(rename-file "data.lisp" "data.backup")
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="replace"></a>
+<h2><span class="function">replace</span></h2>
+<b>syntax: (replace <em>exp-key</em> <em>list</em> <em>exp-replacement</em> [<em>func-compare</em>])</b><br />
+<b>syntax: (replace <em>exp list</em>)</b><br /><br />
+
+<b>syntax: (replace <em>str-key</em> <em>str-data</em> <em>exp-replacement</em>)</b><br />
+<b>syntax: (replace <em>str-pattern</em> <em>str-data</em> <em>exp-replacement</em> <em>int-option</em>)</b><br />
+
+<h4>List replacement</h4>
+<p>
+	If the second argument is a list, 
+	<tt>replace</tt> replaces all elements in the list <em>list</em> 
+	that are equal to the expression in <em>exp-key</em>.
+	The element is replaced with <em>exp-replacement</em>.
+	Note that <tt>replace</tt> is destructive. It 
+	changes the list passed to it and 
+	returns the changed list.
+	The number of replacements made 
+	is contained in the system variable $0 when the function returns.
+  During executions of the replacement expression, 
+  the system variable $0
+  is set to the expression to be replaced.
+</p>
+
+<p>
+Optionally, <em>func-compare</em> can specify a comparison operator 
+or user-defined function. 
+By default, <em>func-compare</em> is the <tt>=</tt> (equals sign).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; list replacement
+
+(set 'aList '(a b c d e a b c d))
+
+(replace 'b aList 'B)  <span class=arw>&rarr;</span> (a B c d e a B c d)
+aList  <span class=arw>&rarr;</span> (a B c d e a B c d)
+$0     <span class=arw>&rarr;</span> 2  ; number of replacements
+
+;; list replacement with special compare functor/function
+
+; replace all numbers where 10 &lt; number
+(set 'L '(1 4 22 5 6 89 2 3 24))
+
+(replace 10 L 10 &lt;) <span class=arw>&rarr;</span> (1 4 10 5 6 10 2 3 10)
+
+; same as:
+
+(replace 10 L 10 (fn (x y) (&lt; x y))) <span class=arw>&rarr;</span> (1 4 10 5 6 10 2 3 10)
+
+; change name-string to symbol, x is ignored as nil
+
+(set 'AL '((john 5 6 4) ("mary" 3 4 7) (bob 4 2 7 9) ("jane" 3)))
+
+(replace nil AL (cons (sym ($0 0)) (rest $0)) 
+                (fn (x y) (string? (y 0))))
+<span class=arw>&rarr;</span> ((john 5 6 4) (mary 3 4 7) (bob 4 2 7 9) (jane 3))
+</pre>
+</blockquote>
+
+<p>
+Using the <a href="#match">match</a> and <a href="#unify">unify</a> functions,
+list searches can be formulated that are as powerful as regular expression string searches:</p>
+
+<blockquote>
+<pre>
+; calculate the sum in all associations with 'mary
+
+(set 'AL '((john 5 6 4) (mary 3 4 7) (bob 4 2 7 9) (jane 3)))
+
+(replace '(mary *)  AL (list 'mary (apply + (rest $0))) match)
+<span class=arw>&rarr;</span> ((john 5 6 4) (mary 14) (bob 4 2 7 9) (jane 3))
+
+; make sum in all expressions
+
+(set 'AL '((john 5 6 4) (mary 3 4 7) (bob 4 2 7 9) (jane 3)))
+
+(replace '(*) AL (list ($0 0) (apply + (rest $0))) match)
+<span class=arw>&rarr;</span> ((john 15) (mary 14) (bob 22) (jane 3))
+
+; using unify 
+
+(replace '(X X) '((3 10) (2 5) (4 4) (6 7) (8 8)) (list ($0 0) 'double ($0 1)) unify)
+<span class=arw>&rarr;</span> ((3 10) (2 5) (4 double 4) (6 7) (8 double 8))
+</pre>
+</blockquote>
+
+<br />
+
+<h4>List removal</h4>
+<p>
+	The last form of <tt>replace</tt> has only two arguments:
+	the expression <em>expr</em> and <em>list</em>.
+	This form removes all <em>expr</em>s found in <em>list</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; removing elements from a list
+
+(set 'lst '(a b a a c d a f g))
+(replace 'a lst)  <span class=arw>&rarr;</span> (b c d f g)
+lst               <span class=arw>&rarr;</span> (b c d f g)
+
+$0  <span class=arw>&rarr;</span> 4
+</pre>
+</blockquote>
+
+<br />
+
+<h4>String replacement without regular expression</h4>
+<p>
+	If all arguments are strings,
+	<tt>replace</tt> replaces all occurrences 
+	of <em>str-key</em> in <em>str-data</em> 
+	with the evaluated <em>exp-replacement</em>, 
+	returning the changed string.
+	The expression in <em>exp-replacement</em> 
+	is evaluated for every replacement.
+	The number of replacements made 
+	is contained in the system variable $0.
+  This form of <tt>replace</tt> 
+  can also process binary <tt>0</tt>s (zeros).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; string replacement
+(set 'str "this isa sentence")
+(replace "isa" str "is a")  <span class=arw>&rarr;</span> "this is a sentence"
+</pre>
+</blockquote>
+
+<br />
+
+<h4>Regular expression replacement</h4>
+<p>
+	The presence of a fourth parameter 
+	indicates that a regular expression search 
+	should be performed with a regular expression pattern 
+	specified in <em>str-pattern</em> 
+	and an option number specified in <em>int-option</em> 
+	(e.g., <tt>1</tt> (one) for case-insensitive searching 
+	or <tt>0</tt> (zero) for a standard 
+	Perl Compatible Regular Expression (PCRE) search).
+	See <a HREF="#regex">regex</a> above for details.
+</p>
+
+<p>
+	By default, <tt>replace</tt> replaces all occurrences 
+	of a search string even if a beginning-of-line specification 
+	is included in the search pattern. 
+	After each replace, 
+	a new search is started at a new position in <em>str-data</em>.
+	Setting the option bit to <tt>0x8000</tt> in <em>int-option</em> 
+	will force <tt>replace</tt> to replace only the first occurrence.
+	The changed string is returned.
+</p>
+
+<p>
+	<tt>replace</tt> with regular expressions 
+	also sets the internal variables 
+	<tt>$0, $1,</tt> and <tt>$2&mdash;</tt> 
+	with the contents of the expressions 
+	and subexpressions found.
+	These can be used to perform replacements 
+	that depend on the content found during replacement.
+	The symbols <tt>$0, $1,</tt> and <tt>$2&mdash;</tt> can be used 
+	in expressions just like any other symbols.
+	If the replacement expression 
+	evaluates to something other than a string,
+	no replacement is made.
+	As an alternative, 
+	the contents of these variables can also be accessed 
+	by using <tt>($ 0), ($ 1), ($ 2),</tt> and so forth.
+	This method allows indexed access
+	(e.g., <tt>($ i)</tt>,
+	where <tt>i</tt> is an integer).
+</p>
+
+<p>After all replacements are made, the number of replacements 
+is contained in the system variable <tt>$0</tt>.</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; using the option parameter to employ regular expressions
+
+(set 'str "ZZZZZxZZZZyy")     <span class=arw>&rarr;</span> "ZZZZZxZZZZyy"
+(replace "[x|y]" str "PP" 0)  <span class=arw>&rarr;</span> "ZZZZZPPZZZZPPPP"
+str                           <span class=arw>&rarr;</span> "ZZZZZPPZZZZPPPP"
+
+;; using system variables for dynamic replacement
+
+(set 'str "---axb---ayb---")
+(replace "(a)(.)(b)" str (append $3 $2 $1) 0) 
+<span class=arw>&rarr;</span> "---bxa---bya---"
+
+str  <span class=arw>&rarr;</span> "---bxa---bya---"
+
+;; using the 'replace once' option bit 0x8000
+
+(replace "a" "aaa" "X" 0)  <span class=arw>&rarr;</span> "XXX"
+
+(replace "a" "aaa" "X" 0x8000)  <span class=arw>&rarr;</span> "Xaa"
+
+;; URL translation of hex codes with dynamic replacement
+
+(set 'str "xxx%41xxx%42")
+(replace "%([0-9A-F][0-9A-F])" str 
+               (char (integer (append "0x" $1))) 1)
+
+str  <span class=arw>&rarr;</span> "xxxAxxxB"
+
+$0   <span class=arw>&rarr;</span> 2
+</pre>
+</blockquote>
+
+<p>
+	The <a HREF="#set-nth">set-nth</a> and 
+	<a HREF="#set-assoc">set-assoc</a> functions 
+	can also be used to change an element in a list.
+</p>
+
+<p>
+	See <a href="#directory">directory</a>,
+	<a href="#find">find</a>,
+	<a href="#find-all">find-all</a>,
+	<a href="#parse">parse</a>,
+	<a href="#regex">regex</a>, 
+	and <a href="#search">search</a> 
+	for other functions using regular expressions.
+</p>
+
+<br /><br />
+
+<a NAME="set-assoc"></a>
+<h2><span class="function">set-assoc</span></h2>
+<b>syntax: (set-assoc (<em>list-assoc</em> <em>exp-key-1</em> [<em>exp-key2</em> ...]) <em>exp-replacement</em>)</b>
+
+<p>The function <tt>set-assoc</tt> behaves like the older <tt>replace-assoc</tt>
+replacing an association with <em>exp-key</em> in the association list <em>list-assoc</em> 
+with <em>exp-replacement</em>.  An association list is a list 
+whose elements are in turn lists, the first element serving as a key.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'aList '((a 1 2 3) (b 4 5 6) (c 7 8 9)))
+
+(set-assoc (aList 'b) '(q "the replacement")) 
+<span class=arw>&rarr;</span> ((a 1 2 3) (q "the replacement") (c 7 8 9))
+
+aList  <span class=arw>&rarr;</span> ((a 1 2 3) (q "I am the replacement") (c 7 8 9))
+</pre>
+</blockquote>
+
+<p><tt>set-assoc</tt> uses the system variable <tt>$0</tt> for the association found.
+This can be used in the replacement expression: </p>
+
+<blockquote>
+<pre>
+(set 'lst '((a 1)(b 2)(c 3))) 
+
+(set-assoc (lst 'b) (list 'b (+ 1 (last $0))))
+
+lst <span class=arw>&rarr;</span> ((a 1)(b 3)(c 3))
+</pre>
+</blockquote>
+
+<p>
+
+<p><tt>set-assoc</tt> returns the changed list or <tt>nil</tt> if no association is found. 
+A destructive operation, <tt>set-assoc</tt> changes the contents of the list.</p>
+
+<p>Like with <a href="#assoc">assoc</a>, association lists can be nested and multiple
+keys can be used for access.</p>
+
+<blockquote>
+<pre>
+(set 'aList '((a 1) (b (c 2)) (d 3)))
+
+(set-assoc (aList 'b 'c) '(c 3))
+<span class=arw>&rarr;</span> ((a 1) (b (c 3)) (d 3))
+</pre>
+</blockquote>
+
+<p>
+See also the <a HREF="#assoc">assoc</a> function 
+for accessing association lists. <a href="#assoc-set">assoc-set</a>  works like <tt>set-assoc</tt>
+but returns the old association element instead of the entire list. To remove associations
+use <a href="#pop-assoc">pop-assoc</a>.
+</p>
+
+<br /><br />
+
+<a NAME="replace-assoc"></a>
+<h2><span class="function">replace-assoc</span></h2>
+<b>syntax: (replace-assoc <em>exp-key</em> <em>list-assoc</em> <em>exp-replacement</em>)</b><br />
+
+<b>syntax: (replace-assoc <em>exp-key</em> <em>list-assoc</em>)</b>
+
+<p>Note that this function is deprecated and will be removed in a future version. Use
+<a href="#set-assoc">set-assoc</a> or <a href="#pop-assoc">pop-assoc</a> instead. This 
+new functions also handle multiple keys for accessing elements in nested association
+lists.</p>
+
+<p>
+In the first syntax, <tt>replace-assoc</tt> replaces an association element with <em>exp-key</em> 
+in the association <em>list-assoc</em> with <em>exp-replacement</em>.
+In the second syntax, <tt>replace-assoc</tt> removes an association from the list and returns it.
+</p>
+
+<br /><br />
+
+<a NAME="reset"></a>
+<h2><span class="function">reset</span></h2>
+<b>syntax: (reset)</b><br />
+<b>syntax: (reset true)</b>
+
+<p>
+	In the first syntax, 
+	<tt>reset</tt> returns to the top level of evaluation,
+	switches the <a HREF="#trace">trace</a> mode off,
+	turns the <a HREF="#command-line">command-line</a> mode on, 
+	and switches to the MAIN context/namespace.
+	<tt>reset</tt> restores the top-level variable environment 
+	using the saved variable environments on the stack.
+	It also fires an error "user reset - no error".
+	This behavior can be used when writing error handlers.
+</p>
+
+<p>
+	<tt>reset</tt> may return memory
+	that was claimed by newLISP
+	to the operating system.
+	<tt>reset</tt> walks through the entire cell space, 
+	which may take a few seconds in a heavily loaded system.
+</p>
+
+<p>
+	<tt>reset</tt> occurs automatically after an error condition.
+</p>
+
+<p>
+	In the second syntax, 
+	<tt>reset</tt> will stop the current process 
+	and start a new clean newLISP process 
+	with the same command-line parameters.
+	This mode will only work when newLISP was started
+	using its full path-name, e.g. <tt>/usr/bin/newlisp</tt>
+    instead of only <tt>newlisp</tt>.
+	This mode is not available on Win32.
+</p>
+
+<br /><br />
+
+<a NAME="rest"></a>
+<h2><span class="function">rest</span></h2>
+
+<b>syntax: (rest <em>list</em>)</b><br />
+<b>syntax: (rest <em>array</em>)</b><br />
+<b>syntax: (rest <em>str</em>)</b>
+
+<p>
+	Returns all of the items in a list or a string, 
+	except for the first.
+	<tt>rest</tt> is equivalent to <em>cdr</em> 
+	or <em>tail</em> in other LISP dialects.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(rest '(1 2 3 4))            <span class=arw>&rarr;</span> (2 3 4)
+(rest '((a b) c d))          <span class=arw>&rarr;</span> (c d)
+(set 'aList '(a b c d e))    <span class=arw>&rarr;</span> (a b c d e)
+(rest aList)                 <span class=arw>&rarr;</span> (b c d e)
+(first (rest aList))         <span class=arw>&rarr;</span> b
+(rest (rest aList))          <span class=arw>&rarr;</span> (d e)
+(rest (first '((a b) c d)))  <span class=arw>&rarr;</span> (b)
+
+(set 'A (array 2 3 (sequence 1 6)))
+<span class=arw>&rarr;</span> ((1 2) (3 4) (5 6))
+
+(rest A)  <span class=arw>&rarr;</span> ((3 4) (5 6))
+</pre>
+</blockquote>
+
+<p>
+	In the second version, 
+	<tt>rest</tt> returns all but the first character 
+	of the string <em>str</em> in a string.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(rest "newLISP")          <span class=arw>&rarr;</span> "ewLISP"
+(first (rest "newLISP"))  <span class=arw>&rarr;</span> "e"
+</pre>
+</blockquote>
+
+
+<p>
+	See also the <a HREF="#first">first</a> 
+	and <a HREF="#last">last</a> functions.
+</p>
+
+<p>
+	Note that an <em>implicit rest</em> 
+	is available for lists.
+	See the chapter <a href="#implicit_rest_slice">Implicit rest and slice</a>.
+</p>
+
+<p>
+	Note that <a href="#rest">rest</a> works on character boundaries 
+	rather than byte boundaries 
+	when the UTF-8&ndash;enabled version of newLISP is used.
+</p>
+
+
+<br /><br />
+
+<a NAME="reverse"></a>
+<h2><span class="function">reverse</span></h2>
+<b>syntax: (reverse <em>list</em>)</b><br />
+
+<b>syntax: (reverse <em>string</em>)</b>
+
+<p>
+	In the first form, 
+	<tt>reverse</tt> reverses and returns the <em>list</em>.
+	Note that <tt>reverse</tt> is destructive and 
+	changes the original list.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'l '(1 2 3 4 5 6 7 8 9))
+
+(reverse l)  <span class=arw>&rarr;</span> (9 8 7 6 5 4 3 2 1)
+l            <span class=arw>&rarr;</span> (9 8 7 6 5 4 3 2 1)
+</pre>
+</blockquote>
+
+<p>
+	In the second form, 
+	<tt>reverse</tt> is used to reverse the order 
+	of characters in a string.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'str "newLISP")
+
+(reverse str)  <span class=arw>&rarr;</span> "PSILwen"
+str            <span class=arw>&rarr;</span> "PSILwen"
+</pre>
+</blockquote>
+
+<p>
+	See also the <a HREF="#sort">sort</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="rotate"></a>
+<h2><span class="function">rotate</span></h2>
+<b>syntax: (rotate <em>list</em> [<em>int-count</em>])</b><br />
+<b>syntax: (rotate <em>str</em> [<em>int-count</em>])</b>
+
+<p>
+	Rotates and returns
+	the <em>list</em> or string in <em>str</em>.
+	A count can be optionally specified in <em>int-count</em> 
+	to rotate more than one position.
+	If <em>int-count</em> is positive, 
+	the rotation is to the right;
+	if <em>int-count</em> is negative, 
+	the rotation is to the left.
+	If no <em>int-count</em> is specified, 
+	<tt>rotate</tt> rotates 1 to the right.
+	<tt>rotate</tt> is a destructive function 
+	that changes the contents of 
+	the original list or string. 
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'l '(1 2 3 4 5 6 7 8 9))
+
+(rotate l)    <span class=arw>&rarr;</span> (9 1 2 3 4 5 6 7 8)
+(rotate l 2)  <span class=arw>&rarr;</span> (7 8 9 1 2 3 4 5 6)
+
+l  <span class=arw>&rarr;</span> (7 8 9 1 2 3 4 5 6)
+
+(rotate l -3)  <span class=arw>&rarr;</span> (1 2 3 4 5 6 7 8 9)
+
+(set 'str "newLISP")
+
+(rotate str)     <span class=arw>&rarr;</span> "PnewLIS"
+(rotate str 3)   <span class=arw>&rarr;</span> "LISPnew"
+(rotate str -4)  <span class=arw>&rarr;</span> "newLISP"
+</pre>
+</blockquote>
+
+<p>
+	When working on a string, 
+	<tt>rotate</tt> works on byte boundaries 
+	rather than character boundaries.
+</p>
+
+<br /><br />
+
+<a NAME="round"></a>
+<h2><span class="function">round</span></h2>
+<b>syntax: (round <em>number</em> [<em>int-digits</em>])</b>
+
+<p>Rounds the number in <em>number</em> 
+to the number of digits given in <em>int-digits</em>. 
+When decimals are being rounded, <em>int-digits</em> is negative. 
+It is positive when the integer part of a number is being rounded.</p>
+
+<p>If <em>int-digits</em> is omitted, the function rounds to <tt>0</tt> decimal
+digits.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(round 123.49 2)    <span class=arw>&rarr;</span> 100
+(round 123.49 1)    <span class=arw>&rarr;</span> 120
+(round 123.49 0)    <span class=arw>&rarr;</span> 123
+(round 123.49)      <span class=arw>&rarr;</span> 123
+(round 123.49 -1)   <span class=arw>&rarr;</span> 123.5
+(round 123.49 -2)   <span class=arw>&rarr;</span> 123.49
+</pre>
+</blockquote>
+
+<p>Note that rounding for display purposes is better accomplished using 
+<a href="#format">format</a>.</p>
+
+
+<br /><br />
+
+<a NAME="save"></a>
+<h2><span class="function">save</span></h2>
+<b>syntax: (save <em>str-file</em>)</b><br />
+<b>syntax: (save <em>str-file</em> <em>sym-1</em> [<em>sym-2</em> ... ])</b>
+
+<p>
+	In the first syntax, 
+	the <tt>save</tt> function writes 
+	the contents of the newLISP workspace 
+	(in textual form) to the file <em>str-file</em>.
+	<tt>save</tt> is the inverse function of <tt>load</tt>. 
+	Using <tt>load</tt> on files 
+	created with <tt>save</tt> causes 
+	newLISP to return to the same state 
+	as when <tt>save</tt> was originally invoked.
+	System symbols starting with the <tt>$</tt> character 
+	(e.g., <tt>$0</tt> from regular expressions 
+	or <tt>$main-args</tt> from the command line)
+	are not saved.
+</p>
+
+<p>
+	In the second syntax, 
+	symbols can be supplied as arguments.
+	If <em>sym-n</em> is supplied, 
+	only the definition of that symbol is saved.
+	If <em>sym-n</em> evaluates to a context,
+	all symbols in that context are saved.
+	More than one symbol can be specified,
+	and symbols and context symbols can be mixed.
+	When contexts are saved,
+	system variables and symbols starting with the <tt>$</tt> character 
+	are not saved.
+	Specifying system symbols explicitly 
+	causes them to be saved.
+</p>
+
+<p>
+	Each symbol is saved 
+	by means of a <a HREF="#set">set</a> statement or&mdash;if 
+	the symbol contains a lambda or lambda-macro function&mdash;by 
+	means of <a HREF="#define">define</a> 
+	or <a HREF="#define-macro">define-macro</a> statements.
+</p>
+
+<p>
+	Symbols containing <tt>nil</tt> will not be saved.
+</p>
+
+<p>
+	<tt>save</tt> returns <tt>true</tt> on completion.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(save "save.lsp")
+
+(save "/home/myself/myfunc.LSP" 'my-func) 
+(save "file:///home/myself/myfunc.LSP" 'my-func) 
+
+(save "http://asite.com:8080//home/myself/myfunc.LSP" 'my-func)
+
+(save "mycontext.lsp" 'mycontext) 
+
+;; multiple args
+(save "stuff.lsp" 'aContext 'myFunc '$main-args 'Acontext)
+</pre>
+</blockquote>
+
+<p>
+	Since all context symbols are part of the context <tt>MAIN</tt>,
+	saving <tt>MAIN</tt> saves all contexts.
+</p>
+
+<p>
+	Saving to a URL 
+	will cause an HTTP PUT request send to the URL.
+	In this mode, 
+	<tt>save</tt> can also be used 
+	to push program source 
+	to remote newLISP server nodes.
+	Note that a double backslash is required 
+	when path names are specified 
+	relative to the root directory.
+	<tt>save</tt> in <tt>HTTP</tt>  mode will 
+	observe a 60-second timeout.</p>
+</p>
+
+<p>
+	Symbols made using <a href="#sym">sym</a>
+	that are incompatible with the normal syntax rules for symbols
+	are serialized using a <a href="#sym">sym</a> statement 
+	instead of a <a href="#set">set</a> statement.
+</p>
+
+<p>
+	<tt>save</tt> serializes contexts and symbols 
+	as if the current context is <tt>MAIN</tt>.
+	Regardless of the current context,
+	<tt>save</tt> will always generate the same output.
+</p>
+
+<p>
+	See also the functions <a HREF="#load">load</a> 
+	(the inverse operation of <tt>save</tt>) 
+	and <a href="#source">source</a>,
+	which saves symbols and contexts to a string 
+	instead of a file.
+</p>
+
+<br /><br />
+
+<a NAME="search"></a>
+<h2><span class="function">search</span></h2>
+<b>syntax: (search <em>int-file</em> <em>str-search</em> [<em>bool-flag</em>] [<em>int-options</em>])</b>
+
+<p>
+Searches a file specified by its handle in <em>int-file</em> for a string in <em>str-search</em>.
+<em>int-file</em> can be obtained from a previous <a HREF="#open">open</a> file.  After the search, 
+the file pointer is positioned at the beginning  or the end of the searched string or at the end 
+of the file if nothing is found.</p>
+
+<p> If <em>bool-flag</em> evaluates to <tt>nil</tt> or if <em>bool-flag</em> is missing,
+then the filepointer is positioned at the beginning of the searched string, else at the end
+of the searched string.</p>
+<p> In <em>int-options</em>,  the options flags can be specified to perform 
+a PCRE regular expression search.  See the function <a href="#regex">regex</a> for details.
+If <em>int-options</em> is mot specified a faster, plain string search is performed.
+<tt>search</tt> returns the new file position or <tt>nil</tt> if nothing is found.
+</p>
+
+<p> When using the regular expression options flag, patterns found are stored in the system variables 
+<tt>$0</tt> to <tt>$15</tt>.  </p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'file (open "init.lsp" "read"))
+(search file "define")
+(print (read-line file) "\n")
+(close file)
+
+
+(set 'file (open "program.c" "r"))
+(while (search file "#define (.*)" true 0) (println $1))
+(close file)
+</pre>
+</blockquote>
+
+<p> The file <tt>init.lsp</tt> is opened and searched for the string <tt>define</tt> and the
+line in which the string occurs is printed. </p>
+
+<p>The second example looks for all lines in the file <tt>program.c</tt> which start with
+the string <tt>#define</tt> and prints the rest of the line after the string "#define ".</p>
+
+<p>
+	For other functions using regular expressions, 
+	see <a href="#directory">directory</a>,
+	<a href="#find">find</a>,
+	<a href="#find-all">find-all</a>, 
+	<a href="#parse">parse</a>,
+	<a HREF="#regex">regex</a>, 
+	and <a href="#replace">replace</a>.
+</p>
+
+<br /><br />
+
+<a NAME="seed"></a>
+<h2><span class="function">seed</span></h2>
+<b>syntax: (seed <em>int-seed</em>)</b>
+
+<p>
+	Seeds the internal random generator 
+	that generates numbers for <a href="#amb">amb</a>,
+	<a href="#normal">normal</a>,
+	<a HREF="#rand">rand</a>, 
+	and <a HREF="#random">random</a> 
+	with the number specified in <em>int-seed</em>.
+	Note that the random generator used in newLISP 
+	is the C-library function <em>rand()</em>.
+	All randomizing functions in newLISP 
+	are based on this function.
+</p>
+
+<p>
+	Note that the maximum value for <em>int-seed</em> 
+	is limited to 16 or 32 bits, 
+	depending on the operating system used.
+	Internally, 
+	only the 32 least significant bits are passed 
+	to the random seed function of the OS.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(seed 12345)
+
+(seed (date-value))
+</pre>
+</blockquote>
+
+<p>
+	After using <tt>seed</tt> with the same number,
+	the random generator starts the same sequence of numbers.
+	This facilitates debugging 
+	when randomized data are involved.
+	Using <tt>seed</tt>, 
+	the same random sequences can be generated 
+	over and over again.
+</p>
+
+<p>
+	The second example is useful for guaranteeing 
+	a different seed any time the program starts.
+</p>
+
+<br /><br />
+
+<a NAME="seek"></a>
+<h2><span class="function">seek</span></h2>
+<b>syntax: (seek <em>int-file</em> [<em>int-position</em>])</b>
+
+<p>
+	Sets the file pointer to the new position <em>int-position</em> 
+	in the file specified by <em>int-file</em>.
+	The new position is expressed as an offset from 
+	the beginning of the file,
+	0 (zero) meaning the beginning of the file.
+	If no <em>int-position</em> is specified, 
+	<tt>seek</tt> returns the current position in the file.
+	If <em>int-file</em> is 0 (zero), 
+	on BSD, <tt>seek</tt> will return 
+	the number of characters 
+	printed to <tt>STDOUT</tt>, 
+	and on Linux and Win32, 
+	it will return <tt>-1</tt>.
+	On failure, 
+	<tt>seek</tt> returns <tt>nil</tt>.
+	When <em>int-position</em> is set to <tt>-1</tt>,
+	<tt>seek</tt> sets the file pointer 
+	to the end of the file.
+</p>
+
+<p><tt>seek</tt> can set the file position past the current end of the file. Subsequent
+writing to this position will extend the file and fill unused positions with zero's.
+The blocks of zeros are not actually allocated on disk, so the file takes up less
+space and is called a <em>sparse file</em>.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'file (open "myfile" "read"))  <span class=arw>&rarr;</span> 5 
+(seek file 100)                     <span class=arw>&rarr;</span> 100
+(seek file)                         <span class=arw>&rarr;</span> 100
+
+(open "newlisp_manual.html" "read")
+(seek file -1)  ; seek to EOF
+<span class=arw>&rarr;</span> 593816     
+
+(set 'fle (open "large-file" "read") 
+(seek file 30000000000)  <span class=arw>&rarr;</span> 30000000000
+</pre>
+</blockquote>
+
+<p>
+	newLISP supports file position numbers up to 
+	9,223,372,036,854,775,807.
+</p>
+
+<br /><br />
+
+<a NAME="select"></a>
+<h2><span class="function">select</span></h2>
+
+<b>syntax: (select <em>list</em> <em>list-selection</em>)</b><br />
+<b>syntax: (select <em>list</em> [<em>int-index_i</em> ... ])</b><br /><br />
+
+<b>syntax: (select <em>string</em> <em>list-selection</em>)</b><br />
+
+<b>syntax: (select <em>string</em> [<em>int-index_i</em> ... ])</b>
+
+<p>
+	In the first two forms,
+	<tt>select</tt> picks one or more elements 
+	from <em>list</em> using one or more indices 
+	specified in <em>list-selection</em> or the <em>int-index_i</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'lst '(a b c d e f g))
+
+(select lst '(0 3 2 5 3))  <span class=arw>&rarr;</span> (a d c f d)
+
+(select lst '(-2 -1 0))  <span class=arw>&rarr;</span> (f g a)
+
+(select lst -2 -1 0)  <span class=arw>&rarr;</span> (f g a)
+</pre>
+</blockquote>
+
+<p>
+	In the second two forms,
+	<tt>select</tt> picks one or more characters 
+	from <em>string</em> 
+	using one or more indices specified in <em>list-selection</em> 
+	or the <em>int-index_i</em>.
+</p> 
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'str "abcdefg") 
+
+(select str '(0 3 2 5 3))  <span class=arw>&rarr;</span> "adcfd"
+
+(select str '(-2 -1 0))  <span class=arw>&rarr;</span> "fga"
+
+(select str -2 -1 0)  <span class=arw>&rarr;</span> "fga"
+</pre>
+</blockquote>
+
+<p>
+	Selected elements can be repeated and do not have to appear in order,
+	although this speeds up processing.
+	The order in <em>list-selection</em> or <em>int-index_i</em> 
+	can be changed to rearrange elements.
+</p>
+
+<br /><br />
+
+
+<a NAME="semaphore"></a>
+<h2><span class="function">semaphore</span></h2>
+
+<b>syntax: (semaphore)</b><br />
+<b>syntax: (semaphore <em>int-id</em>)</b><br />
+<b>syntax: (semaphore <em>int-id</em> <em>int-wait</em>)</b><br />
+<b>syntax: (semaphore <em>int-id</em> <em>int-signal</em>)</b><br />
+
+<b>syntax: (semaphore <em>int-id</em> <em>0</em>)</b>
+
+<p>
+	A semaphore is an interprocess synchronization object 
+	that maintains a count between 0 (zero) and some maximum value.
+	Useful in controlling 
+	access to a shared resource, 
+	a semaphore is set to signaled 
+	when its count is greater than zero 
+	and to non-signaled
+	when its count is zero.
+</p>
+
+<p>
+	A semaphore is created using the first syntax. 
+	This returns the semaphore ID, 
+	an integer used subsequently as <em>int-id</em> 
+	when the <em>semaphore</em> function is called.
+	Initially, the semaphore has a value of zero, which 
+	represents the non-signaled state.
+</p>
+
+<p>
+	If calling <tt>semaphore</tt> with a negative value in <em>int-wait</em> 
+	causes it to be decremented below zero,
+	the function call will block until another process or thread 
+	signals the semaphore with a positive value in <em>int-signal</em>.
+	Calls to the semaphore with <em>int-wait</em> or <em>int-signal</em>
+	effectively try to increment or decrement the semaphore value 
+	by a positive or negative value specified in <em>int-signal</em> 
+	or <em>int-wait</em>.
+	Because the value of a semaphore must never fall below zero,
+	the function call will block when this is attempted
+	(i.e., a semaphore with a value of zero 
+	will block until another process or thread 
+	increases the value with a positive <em>int-signal</em>).
+</p>
+
+<p>
+	The second syntax is used to inquire about the value of a semaphore
+ 	by calling <tt>semaphore</tt> with the <em>int-id</em> only.
+	This form is not available on Win32.
+</p>
+
+<p>
+	Supplying <tt>0</tt> (zero) as the last argument 
+	will release system resources for the semaphore,
+	which then becomes unavailable.
+	Any pending waits on this semaphore 
+	in other child threads or processes 
+	will be released.
+</p>
+
+<p>
+	On Win32, only parent and child processes can share a semaphore.
+	On Linux/UNIX, independent processes can share a semaphore.
+</p>
+
+<p>
+	The following code examples summarize the different syntax forms:
+</p>
+
+<blockquote>
+<pre>
+;; init semaphores 
+(semaphore) 
+
+;; assign a semaphore to sid 
+(set 'sid (semaphore))
+
+;; inquire the state of a semaphore (not on Win32)
+(semaphore sid)
+
+;; put sid semaphore in wait state (-1) 
+(semaphore sid -1) 
+
+;; run sid semaphore previously put in wait (always 1) 
+(semaphore sid 1) 
+
+;; run sid semaphore with X times a skip (backward or forward) on the function 
+(semaphore sid X) 
+
+;; release sid semaphore systemwide (always 0) 
+(semaphore sid 0) 
+</pre>
+</blockquote>
+
+<p>
+	The following example shows semaphores controlling a child process:
+</p> 
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; counter thread output in bold
+
+(define (counter n)
+	(println "counter started")
+	(dotimes (x n)
+		(semaphore sid -1)
+		(println x)))
+
+;; hit extra &lt;enter&gt; to make the prompt come back
+;; after output to the console from counter thread
+
+&gt; (set 'sid (semaphore))
+
+&gt; (semaphore sid)
+<b>0</b>
+
+&gt; (fork (counter 100))
+
+<b>counter started</b>
+&gt; (semaphore sid 1)
+<b>0</b>
+&gt; (semaphore sid 3)
+<b>1</b>
+<b>2</b>
+<b>3</b>
+&gt; (semaphore sid 2)
+<b>4</b>
+
+<b>5</b>
+&gt; _
+</pre>
+</blockquote>
+
+<p>
+	After the semaphore is acquired in <tt>sid</tt>, 
+	it has a value of <tt>0</tt>
+	(the non-signaled state).
+	When starting the thread <tt>counter</tt>,
+	the semaphore will block after the initial start message 
+	and will wait in the semaphore call.
+	The <tt>-1</tt> is trying to decrement the semaphore,
+	which is not possible because its value is already zero.
+	In the interactive, main parent process,
+	the semaphore is signaled by raising its value by <tt>1</tt>.
+	This unblocks the semaphore call in the <tt>counter</tt> thread,
+	which can now decrement the semaphore from <tt>1</tt> to <tt>0</tt> 
+	and execute the <tt>print</tt> statement.
+	When the semaphore call is reached again,
+	it will block because the semaphore is already in the wait 
+	(<tt>0</tt>) state.
+</p>
+
+<p>
+	Subsequent calls to <tt>semaphore</tt> 
+	with numbers greater than <tt>1</tt> 
+	give the <tt>counter</tt> thread an opportunity 
+	to decrement the semaphore several times before blocking.
+</p>
+
+<p>
+	More than one thread can participate in controlling the semaphore, 
+	just as more than one semaphore can be created.
+	The maximum number of semaphores is controlled 
+	by a systemwide kernel setting on UNIX-like operating systems.
+</p>
+
+<p>
+	Use the <a href="#fork">fork</a> function
+	to start a new thread 
+	and the <a href="#share">share</a> function
+	to share information between threads.
+	For a more comprehensive example of 
+	using <tt>semaphore</tt> to synchronize threads,
+	see the <a href="#example_prodcons">prodcons.lsp</a> example 
+	in the <tt>examples/</tt> directory 
+	in the source distribution, 
+	as well as the examples and modules 
+	distributed with newLISP.
+</p>
+
+<br /><br />
+
+<a NAME="sequence"></a>
+<h2><span class="function">sequence</span></h2>
+<b>syntax: (sequence <em>num-start</em> <em>num-end</em> [<em>num-step</em>])</b>
+
+<p>
+	Generates a sequence of numbers 
+	from <em>num-start</em> to <em>num-end</em> 
+	with an optional step size of <em>num-step</em>.
+	When <em>num-step</em> is omitted,
+	the value <tt>1</tt> (one) is assumed.
+	The generated numbers are of type integer 
+	(when no optional step size is specified) 
+	or floating point 
+	(when the optional step size is present).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sequence 10 5)     <span class=arw>&rarr;</span> (10 9 8 7 6 5)
+(sequence 0 1 0.2)  <span class=arw>&rarr;</span> (0 0.2 0.4 0.6 0.8 1)
+(sequence 2 0 0.3)  <span class=arw>&rarr;</span> (2 1.7 1.4 1.1 0.8 0.5 0.2)
+</pre>
+</blockquote>
+
+<p>
+	Note that the step size must be a positive number,
+	even if sequencing from a higher to a lower number.
+</p>
+
+<p>
+	Use the <a HREF="#series">series</a> function
+	to generate geometric sequences.
+</p>
+
+<br /><br />
+
+<a NAME="series"></a>
+<h2><span class="function">series</span></h2>
+
+<b>syntax: (series <em>num-start</em> <em>num-factor</em> <em>num-count</em>)</b>
+
+<p>
+	Creates a geometric sequence 
+	with <em>num-count</em> elements 
+	starting with the element in <em>num-start</em>.
+	Each subsequent element 
+	is multiplied by <em>num-factor</em>.
+	The generated numbers 
+	are always floating point numbers.
+</p>
+
+<p>When <em>num-count</em> is less then <tt>1</tt> then <tt>series</tt>
+returns an empty list.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(series 2 2 5)     <span class=arw>&rarr;</span> (2 4 8 16 32)
+(series 1 1.2 6)   <span class=arw>&rarr;</span> (1 1.2 1.44 1.728 2.0736 2.48832)
+(series 10 0.9 4)  <span class=arw>&rarr;</span> (10 9 8.1 7.29)
+(series 0 0 10)    <span class=arw>&rarr;</span> (0 0 0 0 0 0 0 0 0 0)
+(series 99 1 5)    <span class=arw>&rarr;</span> (99 99 99 99 99)
+</pre>
+</blockquote>
+
+<p>
+	Use the <a HREF="#sequence">sequence</a> function 
+	to generate arithmetic sequences.
+</p>
+
+<br /><br />
+
+<a NAME="set"></a>
+<h2><span class="function">set</span></h2>
+<b>syntax: (set <em>sym-1</em> <em>exp-1</em> [<em>sym-2</em> <em>exp-2</em> ... ])</b>
+
+<p>
+	Evaluates both arguments and 
+	then assigns the result of <em>exp</em> 
+	to the symbol found in <em>sym</em>.
+	The <tt>set</tt> expression 
+	returns the result of the assignment.
+	The assignment is performed by copying 
+	the contents of the right side 
+	into the symbol.
+	The old contents of the symbol 
+	are deleted.
+	An error message results
+	when trying to change the contents 
+	of the symbols <tt>nil</tt>, <tt>true</tt>,
+	or a context symbol.
+	<tt>set</tt> can take multiple argument pairs.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 123)     <span class=arw>&rarr;</span> 123
+(set 'x 'y)      <span class=arw>&rarr;</span> y
+(set x "hello")  <span class=arw>&rarr;</span> "hello"
+
+y  <span class=arw>&rarr;</span> "hello"
+
+(set 'alist '(1 2 3))  <span class=arw>&rarr;</span> (1 2 3)
+
+
+(set 'x 1 'y "hello")  <span class=arw>&rarr;</span> "hello"  ; multiple arguments
+
+x  <span class=arw>&rarr;</span> 1
+y  <span class=arw>&rarr;</span> "hello"
+</pre>
+</blockquote>
+
+<p>
+	The symbol for assignment 
+	could be the result 
+	from another newLISP expression:
+</p>
+
+<blockquote>
+<pre>
+(set 'lst '(x y z))  <span class=arw>&rarr;</span> (x y z)
+
+(set (first lst) 123)  <span class=arw>&rarr;</span> 123
+
+x  <span class=arw>&rarr;</span> 123
+</pre>
+</blockquote>
+
+<p>
+	Symbols can be set to 
+	lambda or lambda-macro expressions.
+	This operation is equivalent 
+	to using <a HREF="#define">define</a> 
+	or <a HREF="#define-macro">define-macro</a>.
+</p>
+
+<blockquote>
+<pre>
+(set 'double (lambda (x) (+ x x)))
+<span class=arw>&rarr;</span> (lambda (x) (+ x x))
+</pre>
+</blockquote>
+
+<p>
+	is equivalent to:
+</p>
+
+<blockquote>
+<pre>
+(define (double x) (+ x x))
+<span class=arw>&rarr;</span> (lambda (x) (+ x x))
+</pre>
+</blockquote>
+
+<p>
+	is equivalent to:
+</p>
+
+<blockquote>
+<pre>
+(define double (lambda (x) (+ x x)))
+<span class=arw>&rarr;</span> (lambda (x) (+ x x))
+</pre>
+</blockquote>
+
+<p>
+	Use the <a href="#constant">constant</a> function
+	(which works like <tt>set</tt>)
+	to protect the symbol from subsequent alteration.
+	Using the <a href="#setq">setq</a> function
+	eliminates the need to quote the variable symbol.
+</p>
+
+<br /><br />
+
+<a NAME="setq"></a>
+<h2><span class="function">setq</span></h2>
+<b>syntax: (setq <em>sym-1</em> <em>exp-1</em>&nbsp;[<em>sym-2</em> <em>exp-2</em> ... ])</b>
+
+<p>
+	Works just like <a href="#set">set</a>,
+	except the symbol in <em>sym</em> 
+	is not quoted.
+	Like <a href="#set">set</a>, 
+	<tt>setq</tt> can take multiple arguments.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(setq x 123)  <span class=arw>&rarr;</span> 123
+
+; multiple args
+
+(setq x 1 y 2 z 3)  <span class=arw>&rarr;</span> 3 
+
+x  <span class=arw>&rarr;</span> 1
+y  <span class=arw>&rarr;</span> 2
+z  <span class=arw>&rarr;</span> 3
+</pre>
+</blockquote>
+
+<br /><br />
+
+
+<a NAME="set-locale"></a>
+<h2><span class="function">set-locale</span></h2>
+<b>syntax: (set-locale [<em>str-locale</em> [<em>int-category</em>]])</b>
+
+<p>
+	Reports or switches to a different locale 
+	on your operating system or platform.
+	When used without arguments, 
+	<em>set-locale</em> reports 
+	the current locale being used.
+	When <em>str-locale</em> is specified, 
+	<em>set-locale</em> switches to the locale 
+	with all category options turned on 
+	(<tt>LC_ALL</tt>).
+	Placing an empty string in <em>str-locale</em> 
+	switches to the default locale 
+	used on the current platform.
+	<tt>set-locale</tt> returns either the current settings 
+	or <tt>nil</tt> if the requested change 
+	could not be performed.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set-locale)     ; report current locale
+
+(set-locale "")  ; set default locale of your platform
+</pre>
+</blockquote>
+
+<p>
+	By default, 
+	newLISP starts up with the POSIX C default locale.
+	This guarantees that newLISP's behavior will be identical
+	on any platform locale:
+</p>
+
+<blockquote>
+<pre>
+;; after newLISP start up
+
+(set-locale)  <span class=arw>&rarr;</span> "C"
+</pre>
+</blockquote>
+
+<p>
+	In <em>int-category</em>, 
+	integer numbers may be specified 
+	as <em>category options</em> 
+	for fine-tuning certain aspects 
+	of the locale,
+	such as number display,
+	date display, and so forth.
+	The numbers used vary from system to system.
+	The options valid on your platform 
+	can be found in the C include file <tt>locale.h</tt>.
+	This file defines constants like 
+	<tt>LC_ALL, LC_NUMERIC,</tt> and <tt>LC_MONETARY</tt>.
+	When <tt>set-locale</tt> is used without the option number,
+	it assumes the <tt>LC_ALL</tt> option,
+	which turns on all options for that locale.
+</p>
+
+<p>
+	Note that the locale also controls 
+	the decimal separator in numbers.
+	The default C locale uses the decimal dot,
+	but most others use a decimal comma.
+	Since version 8.4.4,
+	newLISP has been parsing decimal comma numbers correctly.
+</p>
+
+<p>
+	Note that using <tt>set-locale</tt> 
+	does not change the behavior 
+	of regular expressions in newLISP.
+	To localize the behavior of PCRE 
+	(Perl Compatible Regular Expressions),
+	newLISP must be compiled 
+	with different character tables.
+	See the file, LOCALIZATION, 
+	in the newLISP source distribution 
+	for details.
+</p>
+
+<p>
+	See also the chapter <a href="#switching">Switching the locale</a>.
+</p>
+
+<br /><br />
+
+
+<a NAME="set-nth"></a>
+<h2><span class="function">set-nth</span></h2>
+
+<b>syntax: (set-nth <em>int-nth-1</em> [ <em>int-nth-2</em> ... ] <em>list</em>|<em>array</em> <em>exp-replacement</em>)</b><br />
+
+<b>syntax: (set-nth <em>int-nth-1</em> <em>str</em> <em>str-replacement</em>)</b><br /><br />
+
+<b>syntax: (set-nth (<em>list|array</em> <em>int-nth-1</em> [ <em>int-nth-2</em> ... ]) <em>exp-replacement</em>)</b><br />
+
+<b>syntax: (set-nth (<em>str int-nth-1</em>) <em>str</em> <em>str-replacement</em>)</b>
+
+<p>
+	<tt>set-nth</tt> works like <a href="#nth-set">nth-set</a>,
+	except instead of returning the replaced element,
+	it returns the entire changed expression.
+	For this reason,
+	<tt>set-nth</tt> is slower on larger data objects.
+	
+</p>
+
+<br /><br />
+
+
+<a NAME="set-ref"></a>
+<h2><span class="function">set-ref</span></h2>
+<b>syntax: (set-ref (<em>list</em> <em>exp-key</em>) <em>exp-replacement</em> [<em>func-compare</em>])</b><br />
+
+<p>Searches for <em>exp-key</em> in <em>list</em> and replaces the found element with <em>exp-replacement</em>.
+The <em>list</em> can be nested. The system variable <tt>$0</tt> contains the expression found
+and can be used in <em>exp-replacement</em>. The function works like <a href="#ref-set">ref-set</a> but returns
+the whole list changed instead of the old element.</p>
+
+<br /><br />
+
+
+<a NAME="set-ref-all"></a>
+<h2><span class="function">set-ref-all</span></h2>
+<b>syntax: (set-ref-all (<em>list</em> <em>exp-key</em>) <em>exp-replacement</em> [<em>func-compare</em>])</b><br />
+
+<p>Searches for <em>exp-key</em> in <em>list</em> and replaces each instance of the found element with <em>exp-replacement</em>.
+The <em>list</em> can be nested. The system variable <tt>$0</tt> contains the expression found
+and can be used in <em>exp-replacement</em>. The function works like <a href="#ref-set">ref-set</a> but returns
+the whole list changed:</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'data '((monday (apples 20 30) (oranges 2 4 9)) (tuesday (apples 5) (oranges 32 1))))
+
+(set-ref-all (data 'apples) "Apples")
+    <span class=arw>&rarr;</span> ((monday ("Apples" 20 30) ...  (tuesday ("Apples" 5) ...)))
+</pre>
+</blockquote>
+
+<p>Using the default functor in the <tt>(<em>list</em> <em>key</em>)</tt> pattern allows the
+list to be passed by reference to a userdefined function containing a <tt>set-ref-all</tt>
+statemen. This would result in less memory usage and higher speeds in when doing replacements
+in large lists:</p>
+
+<blockquote>
+<pre>
+(set 'data:data '((monday (apples 20 30) (oranges 2 4 9)) (tuesday (apples 5) (oranges 32 1))))
+
+(define (foo ctx)
+	...
+	(set-ref-all (ctx 'apples) "Apples")
+	...
+)
+
+(foo data)
+</pre>
+</blockquote>
+
+<p>When evaluating <tt>(foo data)</tt>, the list in <tt>data:data</tt> will be passed
+by reference and <tt>set-ref-all</tt> will make the changes on the original, not on
+a copy of <tt>data:data</tt>.</p>
+
+<p>Like <a href="#find">find</a>, <a href="#replace">replace</a>, 
+<a href="#ref">ref</a> and <a href="#ref-all">ref-all</a>, 
+complex searches can be expressed using 
+<a href="#match">match</a> or <a href="#unify">unify</a> in <em>func-compare</em>:</p>
+
+<blockquote>
+<pre>
+(set 'data '((monday (apples 20 30) (oranges 2 4 9)) (tuesday (apples 5) (oranges 32 1))))
+
+(set-ref-all (date '(oranges *)) (list (first $0) (apply + (rest $0))) match)
+    <span class=arw>&rarr;</span> (... (oranges 15) ... (oranges 33) ...) 
+</pre>
+</blockquote>
+
+<p>The example sums all numbers found in records starting with the symbol <tt>oranges</tt>.
+
+<p>See also <a href="#ref-set">ref-set</a> and <a href="#set-ref">set-ref</a> which replace
+only the first element found.</p>
+
+<br /><br />
+
+<a NAME="sgn"></a>
+<h2><span class="function">sgn</span></h2>
+<b>syntax: (sgn <em>num</em>)</b><br />
+<b>syntax: (sgn <em>num</em> <em>expr-1</em> [<em>expr-2</em>] [<em>expr-3</em>])</b>
+
+<p>
+	In the first syntax,
+	the <tt>sgn</tt> function is a logical function 
+	that extracts the sign of a real number 
+	according to the following rules:
+</p>
+
+<blockquote><b><em>
+x &gt; 0 : sgn(x) = 1<br />
+x &lt; 0 : sgn(x) = -1<br />
+x = 0 : sgn(x) = 0<br /> 
+</em></b></blockquote>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sgn -3.5)  <span class=arw>&rarr;</span> -1
+(sgn 0)     <span class=arw>&rarr;</span> 0
+(sgn 123)   <span class=arw>&rarr;</span> 1
+</pre>
+</blockquote>
+
+<p>
+	In the second syntax, the result of evaluating 
+	one of the optional expressions 
+	<em>expr-1</em>, <em>expr-2</em>, or <em>expr-3</em> is returned, 
+	instead of <tt>-1</tt>, <tt>0</tt>, or <tt>1</tt>. 
+	In absence of expression <em>expr-2</em> or <em>expr-3</em>,
+	<tt>nil</tt> is returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sgn x -1 0 1)         ; works like (sgn x)
+(sgn x -1 1 1)         ; return -1 for negative x all others 1
+(sgn x nil true true)  ; return nil for negative else true
+(sgn x (abs x) 0)      ; return (abs x) for negative x, 0 for x = 0, else nil
+</pre>
+</blockquote>
+
+<p>
+	Any expression or constant can be used for 
+	<em>expr-1</em>, <em>expr-2</em>, or <em>expr-3</em>.
+</p>
+
+<br /><br />
+
+
+<a NAME="share"></a>
+<h2><span class="function">share</span></h2>
+<b>syntax: (share)</b><br />
+<b>syntax: (share <em>int-address-or-handle</em>)</b><br />
+<b>syntax: (share <em>int-address-or-handle</em> <em>exp-value</em>)</b><br /><br />
+<b>syntax: (share <em>nil</em> <em>int-address</em>)</b>
+
+<p>
+	Accesses shared memory 
+	for communicating between 
+	several newLISP processes or threads.
+	When called without arguments, 
+	 <tt>share</tt> requests a page of shared memory 
+	(the page is 4k on Win32 but may differ on Linux/UNIX)
+	from the operating system. 
+	This returns a memory address on Linux/UNIX 
+	and a handle on Win32, 
+	which can then be 
+	assigned to a variable 
+	for later reference.
+    This function is not available on OS/2.
+</p>
+
+<p>
+	To set the contents of shared memory,
+	use the third syntax of <tt>share</tt>. 
+	Supply a shared memory address on Linux/UNIX 
+	or a handle on Win32 in <em>int-address-or-handle</em>, 
+	along with an integer, float, or string expression 
+	in <em>exp-value</em>.
+	Using this syntax, 
+	the value supplied in <em>exp-value</em> 
+	is also the return value.
+</p>
+
+<p>
+	To access the contents of shared memory, 
+	use the second syntax of <tt>share</tt>, 
+	supplying only the shared memory address or handle.
+	The return value will be an integer or floating point number,
+	a string, or <tt>nil</tt> or <tt>true</tt>.
+	If the memory has not been previously set to a value, 
+	<tt>nil</tt> will be returned.
+</p>
+
+<p>
+	Only available on UNIX-like operating systems, 
+	the last syntax unmaps a shared memory address.
+	Note that using a shared address after unmapping it 
+	will crash the system.
+</p>
+
+<p>
+	Memory can be shared between 
+	parent and child processes or threads,
+	but not between independent processes.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'num (share))
+(set 'str (share))
+
+(share num 123)  <span class=arw>&rarr;</span> 123
+
+(share str "hello world") <span class=arw>&rarr;</span> "hello world"
+(share str)               <span class=arw>&rarr;</span> "hello world"
+
+(share mVar 123)  <span class=arw>&rarr;</span> 123
+(share mVar)      <span class=arw>&rarr;</span> 123
+
+(share mVar true)  <span class=arw>&rarr;</span> true
+(share mVar)       <span class=arw>&rarr;</span> true
+
+(share nil mVar)  <span class=arw>&rarr;</span> true  ; unmap only on UNIX
+</pre>
+</blockquote>
+
+<p>
+	For a more comprehensive example of using shared memory 
+	in a multithreaded Linux/UNIX application, 
+	see the file <tt>example/prodcons.lsp</tt> in the
+	newLISP source distribution.
+</p>
+
+<p>
+	Note that shared memory access 
+	between different threads or processes 
+	should be synchronized using a <a href="#semaphore">semaphore</a>.
+	Simultaneous access to shared memory 
+	can crash the running process/thread.
+</p>
+
+<p>
+	To find out the maximum length of a string buffer 
+	that could be stored in a shared memory address, 
+	execute the following:
+</p>
+
+<blockquote>
+<pre>
+(length (share (share) (dup " " 1000000))) 
+<span class=arw>&rarr;</span> 4087
+</pre>
+</blockquote>
+
+<p>
+	The statement above tries to initialize 
+	a shared memory address to 100,000 bytes,
+	but only <tt>4087</tt> will be initialized 
+	as a string buffer.
+	The page size of this platform is 
+	<tt>4096 bytes</tt>&mdash;<tt>4087</tt> plus <tt>8 bytes</tt> 
+	of header information for type and size, 
+	as well as 1 terminating byte for displayable strings.
+</p>
+
+<p>
+	On Linux/UNIX systems, 
+	more than one number or string 
+	can be stored in one memory page 
+	by using offsets added to the main segment address:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; Linux/UNIX only
+
+(set 'num-1 (share))
+(set 'num-2 (+ num-1 12))
+(set 'num-3 (+ num-2 12))
+(set 'str-1 (+ num-3 12))
+
+(share num-1 123)
+(share num-2 123.456)
+ &hellip;
+
+(share num-1)  <span class=arw>&rarr;</span> 123
+(share num-3)  <span class=arw>&rarr;</span> 123.456
+ &hellip;
+
+;; etc.
+</pre>
+</blockquote>
+
+<p>
+	For numbers, reserve 12 bytes; 
+	for strings, reserve 12 bytes, 
+	plus the length of the string, 
+	as well as 1 for the terminating zero-byte.
+	For the boolean values <tt>nil</tt> and <tt>true</tt>, 
+	4 bytes should be reserved.
+</p>
+
+<p>
+	Note that a shorter string 
+	could accidentally be overwritten 
+	with a longer one.
+	Therefore,
+	shared strings should be stored 
+	after other shared number fields 
+	or should reside on their own shared memory page.
+</p>
+
+<p>
+	The functions <a href="#get-int">get-int</a>,
+	<a href="#get-float">get-float</a>,
+	<a href="#get-string">get-string</a>,
+	and <a href="#get-char">get-char</a>&mdash;as 
+	well as <a href="#pack">pack</a> 
+	and <a href="#unpack">unpack</a>&mdash;could 
+	also be used to access contents 
+	from a shared memory page.
+	This low-level address 
+	requires precise knowledge 
+	of the type of information stored,
+	but it allows for very compact storage 
+	of information without type/header information 
+	in a string buffer.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; Linux/UNIX and Win32
+
+(set 'mem (share))
+
+(mem share (pack "s5 ld lf" "hello" 123 123.456))
+(unpack "s10 ls lf" (mem share))
+<span class=arw>&rarr;</span> ("hello" 123 123.456)
+</pre>
+</blockquote>
+
+<p>
+	On Linux/UNIX,
+	supplying a wrong or unmapped share address 
+	can cause newLISP to crash.
+</p>
+
+<br /><br />
+
+
+<a NAME="signal"></a>
+<h2><span class="function">signal</span></h2>
+<b>syntax: (signal <em>int-signal</em> <em>sym-handler</em>)</b> <br />
+<b>syntax: (signal <em>int-signal</em> <em>func-handler</em>)</b> <br />
+
+<b>syntax: (signal <em>int-signal</em>&nbsp;&nbsp;nil | true)</b> <br />
+<b>syntax: (signal <em>int-signal</em>)</b>
+
+<p>
+	Sets a user-defined handler in <em>sym-handler</em> for a signal specified in <em>int-signal</em>
+	or sets to a function expression in <em>func-handler</em>.</p>
+<p>
+	If <tt>nil</tt> is specified, 
+	the signal handler  will be set to <tt>SIG_IGN</tt>, and the signal will be ignored.
+	Specifying <tt>true</tt> will set the signal handler to <tt>SIG_DFL</tt>, the default handler
+    of the underlying platform OS. On startup newLISP either specifies an empty
+    newLISP handler or a Ctrl-C handler for <tt>SIGINT</tt> and a <tt>waitpipd(-1, 0, WNOHANG)</tt>
+    C-call for <tt>SIGCHLD</tt>.
+</p>
+
+<p>
+	Different signals are available 
+	on different OS platforms 
+	and Linux/UNIX flavors.
+	The numbers to specify in <em>int-signal</em> 
+	also differ from platform to platform.
+	Valid values can normally be extracted from a file found in <tt>/usr/include/sys/signal.h</tt> or <tt>/usr/include/signal.h</tt>.
+</p>
+
+<p>
+	Some signals make newLISP exit 
+	even after a user-defined handler 
+	has been specified and executed 
+	(e.g., signal SIGKILL).
+	This behavior may also be different 
+	on different platforms.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(constant 'SIGINT 2)
+(define (ctrlC-handler) (println "ctrl-C has been pressed"))
+
+(signal SIGINT 'ctrlC-handler)
+
+; now press ctrl-C
+; the following line will appear
+; this will only work in an interactive terminal window
+; and will not work in the newLISP-GS editor
+
+ctrl-C has been pressed
+</pre>
+</blockquote>
+
+<p>
+	On Win32,
+	the above example would 
+	execute the handler
+	before exiting newLISP.
+	On most Linux/UNIX systems,
+	newLISP would stay loaded 
+	and the prompt would appear 
+	after hitting the [enter] key.
+</p>
+
+<p>
+	Instead of specifying a symbol containing the signal handler,
+	a function can be specified directly. 
+	The signal number is passed as a parameter:
+</p>
+
+<blockquote>
+<pre>
+(signal SIGINT exit)  <span class=arw>&rarr;</span> $signal-2
+
+(sginal SIGINT (fn (s) (println "signal " s " occurred")))
+</pre>
+</blockquote>
+
+<p>
+	Note that the signal SIGKILL 
+	(9 on most platforms) 
+	will always terminate the application 
+	regardless of an existing signal handler.
+</p>
+
+<p>
+	The signal could have been sent 
+	from another shell on the same computer:
+</p>
+
+<blockquote>
+<pre>
+kill -s SIGINT 2035
+</pre>
+</blockquote>
+
+<p>
+	In this example,
+	<tt>2035</tt> is the process ID 
+	of the running newLISP.
+</p>
+
+<p>
+	The signal could also have been sent 
+	from another newLISP application:
+</p>
+
+<blockquote>
+<pre>
+(constant 'SIGINT 2)
+(import "libc.so" "kill")
+
+(kill 2035 SIGINT)
+</pre>
+</blockquote>
+
+<p>
+	When importing <tt>kill</tt>, 
+	make sure it always receives an integer
+	for the signal number. 
+	If needed, 
+	use the <a href="#int">int</a> function
+	to first convert the number.
+</p>
+
+<p>
+	If newLISP receives a signal 
+	while evaluating another function,
+	it will still accept the signal 
+	and the handler function will be executed:
+</p>
+
+<blockquote>
+<pre>
+(constant 'SIGINT 2)
+(define (ctrlC-handler) (println "ctrl-C has been pressed"))
+
+(signal SIGINT 'ctrlC-handler)
+;; or
+(signal SIGINT ctrlC-handler)
+
+
+(while true (sleep 300) (println "busy"))
+
+;; generates following output
+busy
+busy
+busy
+ctrl-C has been pressed
+busy
+busy
+&hellip;
+</pre>
+</blockquote>
+
+<p>
+	Specifying only a signal number 
+	will return either the name of 
+	the current defined handler function 
+	or <tt>nil</tt>.
+</p>
+
+<p>
+	The user-defined signal handler 
+	can pass the the signal number 
+	as a parameter.
+</p>
+
+<blockquote>
+<pre>
+(define (signal-handler sig)
+	(println "received signal: " sig))
+
+;; set all signals from 1 to 8 to the same handler	
+(for (s 1 8) 
+	(signal s 'signal-handler))
+</pre>
+</blockquote>
+
+<p>
+	In this example, 
+	all signals from 1 to 8 are set 
+	to the same handler.
+</p>
+
+
+<br /><br />
+
+
+<a NAME="silent"></a>
+<h2><span class="function">silent</span></h2>
+
+<b>syntax: (silent [<em>expr-1</em> [<em>expr-2</em> ... ]])</b>
+
+<p>
+	Evaluates one or more expressions in <em>expr-1</em>&mdash;.
+	<tt>silent</tt> is similar to <a HREF="#begin">begin</a>,
+	but it suppresses console output 
+	of the return value 
+	and the following prompt.
+	It is often used 
+	when communicating from 
+	a remote application with newLISP 
+	(e.g., GUI front-ends 
+	or other applications controlling newLISP), 
+	and the return value is of no interest.
+</p>
+
+<p>
+	Silent mode is reset when returning to a prompt.
+	This way, 
+	it can also be used without arguments 
+	in a batch of expressions.
+	When in interactive mode, 
+	hit [enter] twice after a statement 
+	using <tt>silent</tt> 
+	to get the prompt back.
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(silent (my-func))  ; same as next
+
+(silent) (my-func)  ; same effect as previous
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="sin"></a>
+<h2><span class="function">sin</span></h2>
+<b>syntax: (sin <em>num-radians</em>)</b>
+
+<p>
+	Calculates the sine function 
+	from <em>num-radians</em> 
+	and returns the result.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sin 1)                     <span class=arw>&rarr;</span> 0.8414709838
+(set 'pi (mul 2 (acos 0)))  <span class=arw>&rarr;</span> 3.141592654
+(sin (div pi 2))            <span class=arw>&rarr;</span> 1
+</pre>
+</blockquote>
+
+<br /><br />
+
+<br /><br />
+
+<a NAME="sinh"></a>
+<h2><span class="function">sinh</span></h2>
+<b>syntax: (sinh <em>num-radians</em>)</b>
+
+<p>Calculates the hyperbolic sine of <em>num-radians</em>. 
+The hyperbolic sine is defined mathematically as: <em>(exp (x) - exp (-x)) / 2</em>.
+An overflow to <tt>inf</tt> may occur if <em>num-radians</em> is too large.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sinh 1)     <span class=arw>&rarr;</span> 1.175201194
+(sinh 10)    <span class=arw>&rarr;</span> 11013.23287
+(sinh 1000)  <span class=arw>&rarr;</span> inf
+(sub (tanh 1) (div (sinh 1) (cosh 1))) <span class=arw>&rarr;</span> 0
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="sleep"></a>
+<h2><span class="function">sleep</span></h2>
+
+<b>syntax: (sleep <em>int-milli-seconds</em>)</b>
+
+<p>
+	Gives up CPU time 
+	to other processes 
+	for the amount of milliseconds specified 
+	in <em>int-milli-seconds</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sleep 1000)  ; sleeps 1 second
+</pre>
+</blockquote>
+
+<p>
+	On some platforms,
+	<tt>sleep</tt> is only available 
+	with a resolution of one second.
+	In this case,
+	the parameter <em>int-milli-seconds</em> 
+	will be rounded to the nearest 
+	full second.
+</p>
+
+<br /><br />
+
+<a NAME="slice"></a>
+<h2><span class="function">slice</span></h2>
+
+<b>syntax: (slice <em>list</em> <em>int-index</em> [<em>int-length</em>])</b><br />
+<b>syntax: (slice <em>array</em> <em>int-index</em> [<em>int-length</em>])</b><br />
+<b>syntax: (slice <em>str</em> <em>int-index</em> [<em>int-length</em>])</b>
+
+<p>
+	In the first form,
+	<tt>slice</tt> copies a sublist 
+	from a <em>list</em>.
+	The original list is left unchanged.
+	The sublist extracted 
+	starts at index <em>int-index</em> 
+	and has a length of <em>int-length</em>.
+	If <em>int-length</em> is negative
+	<tt>slice</tt> will take the parameter
+	as offset counting from the end and copy
+    up to that offset.
+	If the parameter is omitted, 
+	<tt>slice</tt> copies all of the elements 
+	to the end of the list.
+</p>
+
+<p>
+	See also <a HREF="#indexing">Indexing elements of strings and lists</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(slice '(a b c d e f) 3 2)   <span class=arw>&rarr;</span> (d e)
+(slice '(a b c d e f) 2 -2)  <span class=arw>&rarr;</span> (c d)
+(slice '(a b c d e f) 2)  <span class=arw>&rarr;</span> (c d e f)
+(slice '(a b c d e f) -4 3)  <span class=arw>&rarr;</span> (c d e)
+
+(set 'A (array 3 2 (sequence 1 6))) <span class=arw>&rarr;</span> ((1 2) (3 4) (5 6))
+(slice A 1 2) <span class=arw>&rarr;</span> ((3 4) (5 6))
+</pre>
+</blockquote>
+
+<p>
+	In the second form,
+	a part of the string in <em>str</em> 
+	is extracted.
+	<em>int-index</em> contains the start index
+	and <em>int-length</em> contains the length 
+	of the substring.
+	If <em>int-length</em> is not specified,
+	everything to the end of the string is extracted.
+	<tt>slice</tt> also works on string buffers 
+	containing binary data like 0's (zeroes). 
+	It operates on byte boundaries 
+	rather than character boundaries.
+	See also <a HREF="#indexing">Indexing elements of strings and lists</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(slice "Hello World" 6 2)  <span class=arw>&rarr;</span> "Wo"
+(slice "Hello World" 0 5)  <span class=arw>&rarr;</span> "Hello"
+(slice "Hello World" 6)    <span class=arw>&rarr;</span> "World"
+(slice "newLISP" -4 2)     <span class=arw>&rarr;</span> "LI"
+</pre>
+</blockquote>
+
+<p>
+	Note that an <em>implicit slice</em> 
+	is available for lists.
+	See the chapter <a href="#implicit_rest_slice">Implicit rest and slice</a>.
+</p>
+
+<p>
+	Be aware that <a href="#slice">rest</a> 
+	always works on byte boundaries 
+	rather than character boundaries 
+	in the UTF-8&ndash;enabled version of newLISP.
+	As a result, 
+	<a href="#slice">slice</a> can be used 
+	to manipulate binary content.
+</p>
+
+<br /><br />
+
+<a NAME="sort"></a>
+<h2><span class="function">sort</span></h2>
+<b>syntax: (sort <em>list</em> [<em>func-compare</em>])</b><br />
+
+<p>
+	All members in <em>list</em> 
+	are sorted in ascending order.
+	Anything may be sorted, 
+	regardless of the types.
+	When members are themselves lists,
+	each list element 
+	is recursively compared.
+	If two expressions 
+	of different types are compared,
+	the lower type is sorted 
+	before the higher type 
+	in the following order:
+</p>
+
+<pre>
+  Atoms: nil, true, integer or float, string, symbol, primitive
+
+  Lists: quoted expression, list, lambda, lambda-macro
+</pre>
+
+<p>
+	The sort is destructive,
+	changing the order of the elements in the original list.
+	The return value of <tt>sort</tt> is a copy of the sorted list.
+</p>
+
+<p>
+	An optional comparison operator, 
+	user-defined function, 
+	or anonymous function 
+	can be supplied.
+	The functor or operator 
+	can be given with or without 
+	a preceding quote.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sort '(v f r t h n m j))     <span class=arw>&rarr;</span> (f h j m n r t v)
+(sort '((3 4) (2 1) (1 10)))  <span class=arw>&rarr;</span> ((1 10) (2 1) (3 4))
+(sort '((3 4) "hi" 2.8 8 b))  <span class=arw>&rarr;</span> (2.8 8 "hi" b (3 4))
+
+(set 's '(k a l s))
+(sort s)  <span class=arw>&rarr;</span> (a k l s)  
+
+(sort '(v f r t h n m j) '&gt;)
+<span class=arw>&rarr;</span> (v t r n m j h f)
+;; the quote can be omitted beginning with version 8.4.5
+(sort '(v f r t h n m j) &gt;)
+<span class=arw>&rarr;</span> (v t r n m j h f)
+(sort s &lt;)  <span class=arw>&rarr;</span> (a k l s)
+(sort s &gt;)  <span class=arw>&rarr;</span> (s l k a)  
+s           <span class=arw>&rarr;</span> (s l k a)
+
+;; define a comparison function
+(define (comp x y) 
+    (&gt; (last x) (last y)))
+    
+(set 'db '((a 3) (g 2) (c 5)))
+
+(sort db comp)  <span class=arw>&rarr;</span>  ((c 5) (a 3) (g 2))
+
+;; use an anonymous function
+(sort db (fn (x y) (&gt; (last x) (last y))))
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="source"></a>
+<h2><span class="function">source</span></h2>
+<b>syntax: (source)</b><br />
+<b>syntax: (source <em>sym-1</em> [<em>sym-2</em> ... ])</b>
+
+<p>
+	Works almost identically to <a href="#save">save</a>,
+	except symbols and contexts get serialized to a string 
+	instead of being written to a file.
+	Multiple variable symbols,
+	definitions, and contexts 
+	can be specified.
+	If no argument is given,
+	<tt>source</tt> serializes the entire 
+	newLISP workspace.
+	When context symbols are serialized,
+	any symbols contained within that context 
+	will be serialized, as well.
+	Symbols containing <tt>nil</tt> 
+	are not serialized.
+	System symbols beginning with the <tt>$</tt> (dollar sign) character 
+	are only serialized when mentioned explicitly.
+</p>
+
+<p>
+	Symbols not belonging to the current context
+	are written out with their context prefix.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (double x) (+ x x))
+
+(source 'double)  <span class=arw>&rarr;</span> "(define (double x)\n  (+ x x))\n\n"
+</pre>
+</blockquote>
+
+<p>
+	As with <a href="#save">save</a>,
+	the formatting of line breaks 
+	and leading spaces or tabs 
+	can be controlled using the 
+	<a href="#pretty-print">pretty-print</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="sqrt"></a>
+<h2><span class="function">sqrt</span></h2>
+<b>syntax: (sqrt <em>num</em>)</b>
+
+<p>
+	Calculates the square root from 
+	the expression in <em>num</em> 
+	and returns the result.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sqrt 10)  <span class=arw>&rarr;</span> 3.16227766
+(sqrt 25)  <span class=arw>&rarr;</span> 5
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="starts-with"></a>
+<h2><span class="function">starts-with</span></h2>
+<b>syntax: (starts-with <em>str str-key</em> [<em>num-option</em>] )</b><br>
+<b>syntax: (starts-with <em>list</em> [<em>expr</em>] )</b>
+
+<p>
+	In the first version,
+	<tt>starts-with</tt> checks if the string <em>str</em> 
+	starts with a key string in <em>str-key</em> and 
+	returns <tt>true</tt> or <tt>nil</tt> 
+	depending on the outcome.
+</p>
+
+<p>
+	If a regular expression number is specified in <em>num-option</em>,
+	<em>str-key</em> contains a regular expression pattern.
+	See <a href="#regex">regex</a> for valid <em>option</em> numbers.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(starts-with "this is useful" "this")      <span class=arw>&rarr;</span> true
+(starts-with "this is useful" "THIS")      <span class=arw>&rarr;</span> nil
+(starts-with "this is useful" "THIS" nil)  <span class=arw>&rarr;</span> true
+;; use regular expressions
+(starts-with "this is useful" "this|that" 1)  <span class=arw>&rarr;</span> true
+
+</pre>
+</blockquote>
+
+<p>
+	In the second version,
+	<tt>starts-with</tt> checks to see if a list 
+	starts with the list element in <em>expr</em>.
+	<tt>true</tt> or <tt>nil</tt> is returned 
+	depending on outcome.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(starts-with '(1 2 3 4 5) 1)             <span class=arw>&rarr;</span> true
+(starts-with '(a b c d e) 'b)            <span class=arw>&rarr;</span> nil
+(starts-with '((+ 3 4) b c d) '(+ 3 4))  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+
+<p>
+	See also the <a HREF="#ends-with">ends-with</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="string"></a>
+<h2><span class="function">string</span></h2>
+<b>syntax: (string <em>exp-1</em> [ <em>exp-2</em> ... ])</b>
+
+<p>
+	Translates into a string anything that results 
+	from evaluating <em>exp-1</em>&mdash;.
+	If more than one expression is specified, 
+	the resulting strings are concatenated.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(string 'hello)          <span class=arw>&rarr;</span> "hello"
+(string 1234)            <span class=arw>&rarr;</span> "1234"
+(string '(+ 3 4))        <span class=arw>&rarr;</span> "(+ 3 4)"
+(string (+ 3 4) 8)       <span class=arw>&rarr;</span> "78"
+(string 'hello " " 123)  <span class=arw>&rarr;</span> "hello 123"
+</pre>
+</blockquote>
+
+<p>
+	If a buffer passed to <tt>string</tt> 
+	contains <tt>\000</tt>,
+	only the string up to the first terminating zero will be copied:
+</p>
+
+<blockquote>
+<pre>
+(set 'buff "ABC\000\000\000")  <span class=arw>&rarr;</span> "ABC\000\000\000"
+
+(length buff)  <span class=arw>&rarr;</span> 6
+
+(string buff)  <span class=arw>&rarr;</span> "ABC"
+
+(length (string buff))  <span class=arw>&rarr;</span> 3
+</pre>
+</blockquote>
+
+<p>
+	Use the <a HREF="#append">append</a> 
+	and <a HREF="#join">join</a> 
+	(allows the joining string 
+	to be specified) functions 
+	to concatenate strings. 
+	Use the <a href="#source">source</a> function 
+	to convert a lambda expression 
+	into its newLISP source string representation.
+</p>
+
+<br /><br />
+
+<a NAME="stringp"></a>
+<h2><span class="function">string?</span></h2>
+<b>syntax: (string? <em>exp</em>)</b>
+
+<p>
+	Evaluates <em>exp</em> and tests 
+	to see if it is a string.
+	Returns <tt>true</tt> or <tt>nil</tt>
+	depending on the result.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'var "hello")
+(string? var)  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="sub"></a>
+<h2><span class="function">sub</span></h2>
+<b>syntax: (sub <em>num-1</em> [<em>num-2</em> ... ])</b>
+
+<p>
+	Successively subtracts
+	the expressions in <em>num-1</em>,
+	<em>num-2</em>&mdash;.
+	<tt>sub</tt> performs mixed-type arithmetic 
+	and handles integers or floating points,
+	but it will always return 
+	a floating point number.
+	If only one argument is supplied,
+	its sign is reversed.
+	Any floating point calculation 
+	with <tt>NaN</tt> also returns <tt>NaN</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sub 10 8 0.25)  <span class=arw>&rarr;</span> 1.75
+(sub 123)        <span class=arw>&rarr;</span> -123
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="swap"></a>
+<h2><span class="function">swap</span></h2>
+<b>syntax: (swap <em>num-1</em> <em>num-2</em> <em>list</em>)</b><br>
+<b>syntax: (swap <em>num-1</em> <em>num-2</em> <em>str</em>)</b><br>
+<b>syntax: (swap <em>sym-1</em> <em>sym-2</em>)</b>
+
+<p>
+	In the first form, 
+	<tt>swap</tt> switches the elements in <em>list</em> 
+	at indices <em>num-1 and num-2</em> 
+	and returns the changed list.
+</p>
+
+<p>
+	In the second form,
+	the characters in <em>str</em> at indices <em>num-1 and num-2</em> 
+	are swapped and the changed string is returned.
+</p>
+
+<p>
+	In the third form,
+	the contents of the two unquoted symbols in 
+	<em>sym-1 and sym-2</em> are swapped.
+</p>
+
+<p>
+	<tt>swap</tt> is a destructive operation 
+	that changes the contents of the list, string, 
+	or symbols involved.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'lst '(a b c d e f))
+
+(swap 0 5 lst)  <span class=arw>&rarr;</span> '(f b c d e a)
+lst             <span class=arw>&rarr;</span> '(f b c d e a)
+
+(swap 0 -1 lst)  <span class=arw>&rarr;</span> '(a b c d e f)
+lst              <span class=arw>&rarr;</span> '(a b c d e f)
+
+(swap 3 4 "abcdef")  <span class=arw>&rarr;</span> "abcedf"
+
+(set 'x 1 'y 2)
+
+(swap x y)  <span class=arw>&rarr;</span> 1
+
+x  <span class=arw>&rarr;</span> 2
+y  <span class=arw>&rarr;</span> 1
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="sym"></a>
+<h2><span class="function">sym</span></h2>
+<b>syntax: (sym <em>string</em> [<em>sym-context</em> <em>nil-flag</em>] )</b><br />
+<b>syntax: (sym <em>number</em> [<em>sym-context</em> <em>nil-flag</em>] )</b><br />
+
+<b>syntax: (sym <em>symbol</em> [<em>sym-context</em> <em>nil-flag</em>] )</b>
+
+<p>
+	Translates the first argument in <em>string</em>, 
+	<em>number</em>, or <em>symbol</em> 
+	into a symbol and returns it.
+	If the optional context is not specified 
+	in <em>sym-context</em>, 
+	the current context is used 
+	when doing symbol lookup or creation.
+	Symbols will be created 
+	if they do not already exist.
+	When the context does not exist
+	and the context is specified by a quoted symbol, 
+	the symbol also gets created.
+	If the context specification is unquoted, 
+	the context is the specified name 
+	or the context specification is a variable 
+	containing the context.
+</p>
+
+<p>
+	<tt>sym</tt> can create symbols within the symbol table
+	that are not legal symbols in newLISP source code
+	(e.g., numbers or names containing special characters
+	such as parentheses, colons, etc.).
+	This makes <tt>sym</tt> usable 
+	as a function for associative memory access, 
+	much like <em>hash table</em> access 
+	in other scripting languages. 
+</p>
+
+<p>
+	As a third optional argument,
+	<tt>nil</tt> can be specified 
+	to suppress symbol creation 
+	if the symbol is not found.
+	In this case,
+	<tt>sym</tt> returns <tt>nil</tt> 
+	if the symbol looked up does not exist.
+	Using this last form,
+	<tt>sym</tt> can be used 
+	to check for the existence 
+	of a symbol.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sym "some")           <span class=arw>&rarr;</span> some
+(set (sym "var") 345)  <span class=arw>&rarr;</span> 345
+var                    <span class=arw>&rarr;</span> 345
+(sym "aSym" 'MyCTX)    <span class=arw>&rarr;</span> MyCTX:aSym
+(sym "aSym" MyCTX)     <span class=arw>&rarr;</span> MyCTX:aSym  ; unquoted context
+
+(sym "foo" MyCTX nil)  <span class=arw>&rarr;</span> nil  ; 'foo does not exist
+(sym "foo" MyCTX)      <span class=arw>&rarr;</span> foo  ; 'foo is created
+(sym "foo" MyCTX nil)  <span class=arw>&rarr;</span> foo  ; foo now exists
+</pre>
+</blockquote>
+
+<p>
+	Because the function <tt>sym</tt> 
+	returns the symbol looked up or created,
+	expressions with <tt>sym</tt> can be embedded 
+	directly in other expressions 
+	that use symbols as arguments.
+	The following example shows 
+	the use of <tt>sym</tt> 
+	as a hash-like function 
+	for associative memory access, 
+	as well as symbol configurations 
+	that are not legal newLISP symbols:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; using sym for simulating hash tables
+
+(set (sym "John Doe" 'MyDB') 1.234)
+(set (sym "(" 'MyDB) "parenthesis open")
+(set (sym 12 'MyDB) "twelve")
+
+(eval (sym "John Doe" 'MyDB))  <span class=arw>&rarr;</span> 1.234
+(eval (sym "(" 'MyDB))         <span class=arw>&rarr;</span> "parenthesis open"
+(eval (sym 12 'MyDB))          <span class=arw>&rarr;</span> "twelve"
+
+;; delete a symbol from a symbol table or hash
+(delete (sym "John Doe" 'MyDB))  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<p>
+	The last statement shows 
+	how a symbol can be eliminated 
+	using <a href="#delete">delete</a>.
+</p>
+
+<p>
+	The third syntax allows symbols to be used 
+	instead of strings for the symbol name 
+	in the target context.
+	In this case,
+	<tt>sym</tt> will extract the name from the symbol 
+	and use it as the name string 
+	for the symbol in the target context:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sym 'myVar 'FOO)  <span class=arw>&rarr;</span> FOO:myVar
+
+(define-macro (def-context)
+  (dolist (s (rest (args)))
+    (sym s (first (args)))))
+
+(def-context foo x y z)
+
+(symbols foo)  <span class=arw>&rarr;</span> (foo:x foo:y foo:z)
+</pre>
+</blockquote>
+
+<p>
+	The <tt>def-context</tt> macro 
+	shows how this could be used 
+	to create a macro that creates 
+	contexts and their variables 
+	in a dynamic fashion.
+</p>
+
+<p>
+	Available since version 8.7.4, 
+	one syntax of the <a href="#context">context</a> function 
+	can be used to create, set, and evaluate symbols 
+	in a shorter, faster way.
+</p>
+
+<br /><br />
+
+
+<a NAME="symbolp"></a>
+<h2><span class="function">symbol?</span></h2>
+<b>syntax: (symbol? <em>exp</em>)</b><br />
+
+<p>
+	Evaluates the <em>exp</em> expression 
+	and returns <tt>true</tt> if the value is a symbol;
+	otherwise, it returns <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'x 'y)  <span class=arw>&rarr;</span> y
+
+(symbol? x)  <span class=arw>&rarr;</span> true 
+
+(symbol? 123)  <span class=arw>&rarr;</span> nil
+
+(symbol? (first '(var x y z)))  <span class=arw>&rarr;</span> true
+
+</pre>
+</blockquote>
+
+<p>
+	The first statement sets the contents of <tt>x</tt> 
+	to the symbol <tt>y</tt>.
+	The second statement then checks the contents of <tt>x</tt>.
+	The last example checks the first element of a list.
+</p>
+
+<br /><br />
+
+<a NAME="symbols"></a>
+<h2><span class="function">symbols</span></h2>
+<b>syntax: (symbols [<em>context</em>])</b>
+
+<p>
+	Returns a sorted list of all symbols 
+	in the current context 
+	when called without an argument.
+	If a context symbol is specified, 
+	symbols defined in that context are returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(symbols)       ; list of all symbols in current context
+(symbols 'CTX)  ; list of symbols in context CTX
+(symbols CTX)   ; omitting the quote
+(set 'ct CTX)   ; assigning context to a variable
+(symbols ct)    ; list of symbols in context CTX
+</pre>
+</blockquote>
+
+<p>
+	The quote can be omitted 
+	because contexts evaluate to themselves.
+</p>
+
+<br /><br />
+
+<a NAME="sys-error"></a>
+<h2><span class="function">sys-error</span></h2>
+<b>syntax: (sys-error)</b>
+
+<p>
+	Reports error numbers generated 
+	by the underlying OS 
+	newLISP is running on.
+	The error numbers reported 
+	may differ on the platforms 
+	newLISP has been compiled for.
+	Consult the platform's C library information,
+	(e.g., the GNU <tt>libc</tt> reference).
+	Most errors reported 
+	refer to system resources such as files and semaphores.
+</p>
+
+<p>
+	Whenever a function in newLISP 
+	within the system resources area
+	returns <tt>nil</tt>, 
+	<tt>sys-error</tt> can be checked 
+	for the underlying reason.
+	For file operations, 
+	<tt>sys-error</tt> may be set 
+	for nonexistent files 
+	or wrong permissions 
+	when accessing the resource.
+	Another cause of error 
+	could be the exhaustion of certain system resources 
+	like file handles or semaphores.
+</p>
+
+<br /><br /> 
+<b>example:</b>
+<blockquote>
+<pre>
+;; trying to open a nonexistent file
+(open "blahbla" "r")  <span class=arw>&rarr;</span> nil
+
+(sys-error)  <span class=arw>&rarr;</span> 2
+
+(sys-error 0)  <span class=arw>&rarr;</span> 0  ; clear errno
+</pre>
+</blockquote>
+
+<p>
+	The error number can be cleared
+	by giving a <tt>0</tt> (zero) 
+	for the optional argument.
+</p>
+
+<br /><br />
+
+<a NAME="sys-info"></a>
+<h2><span class="function">sys-info</span></h2>
+<b>syntax: (sys-info [<em>int-idx</em>])</b>
+
+<p>
+	Calling <tt>sys-info</tt> 
+	without <em>int-idx</em> 
+	returns a list of internal resource statistics.
+	Eight integers report the following status:
+</p>
+
+<pre>
+  0 - Number of LISP cells
+  1 - Maximum number of LISP cells constant
+  2 - Number of symbols
+  3 - Evaluation/recursion level
+  4 - Environment stack level
+  5 - Maximum call stack constant
+  6 - Version number as an integer constant
+  7 - Operating system constant:
+      linux=1, bsd=2, osx=3, solaris=4, cygwin=5, win32=6,
+      os/2=7, tru64unix=9 
+      the highest bit 7 will be set for UTF-8 versions (add 128)
+      bit 6 will be added for library versions (add 64)
+</pre>
+
+<p>
+	The numbers from <tt>0</tt> to <tt>7</tt> 
+	indicate the optional offset 
+	in the returned list.
+</p>
+
+<p>
+	When using <em>int-idx</em>, 
+	one element of the list will be returned.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(sys-info)     <span class=arw>&rarr;</span> (348 268435456 269 1 0 1024 8404 6)
+(sys-info 3)   <span class=arw>&rarr;</span> 1 
+(sys-info -2)  <span class=arw>&rarr;</span> 8404
+</pre>
+</blockquote>
+
+<p>
+	The number for the maximum of LISP cells 
+	can be changed via the <tt>-m</tt> 
+	command-line switch.
+	For each megabyte of LISP cell memory, 
+	64k memory cells can be allocated.
+	The maximum call stack depth 
+	can be changed using the <tt>-s</tt> 
+	command-line switch.
+</p>
+
+<br /><br />
+
+<a NAME="tan"></a>
+<h2><span class="function">tan</span></h2>
+<b>syntax: (tan <em>num-radians</em>)</b>
+
+<p>
+	Calculates the tangent function from <em>num-radians</em> 
+	and returns the result.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(tan 1)                     <span class=arw>&rarr;</span> 1.557407725
+(set 'pi (mul 2 (asin 1)))  <span class=arw>&rarr;</span> 3.141592654
+(tan (div pi 4))            <span class=arw>&rarr;</span> 1
+</pre>
+</blockquote>
+<br /><br />
+
+<a NAME="tanh"></a>
+<h2><span class="function">tanh</span></h2>
+<b>syntax: (tanh <em>num-radians</em>)</b>
+
+<p>Calculates the hyperbolic cosine of <em>num-radians</em>. 
+The hyperbolic sine is defined mathematically as: <em>sinh (x) / cosh (x)</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(tanh 1)     <span class=arw>&rarr;</span> 0.761594156
+(tanh 10)    <span class=arw>&rarr;</span> 0.9999999959
+(tanh 1000)  <span class=arw>&rarr;</span> 1
+(= (tanh 1) (div (sinh 1) (cosh 1)))  <span class=arw>&rarr;</span> true
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="throw"></a>
+<h2><span class="function">throw</span></h2>
+<b>syntax: (throw <em>exp</em>)</b>
+
+<p>
+	Works together with 
+	the <a href="#catch">catch</a> function.
+	<tt>throw</tt> forces the return of a previous <tt>catch</tt> statement 
+	and puts the <em>exp</em> into the result symbol of <tt>catch</tt>.
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (throw-test)
+    (dotimes (x 1000) 
+        (if (= x 500) (throw "interrupted"))))
+
+(catch (throw-test) 'result)  <span class=arw>&rarr;</span> true
+
+result  <span class=arw>&rarr;</span> "interrupted"
+
+(catch (throw-text))  <span class=arw>&rarr;</span> "interrupted"
+</pre>
+</blockquote>
+
+<p>
+	The last example shows a shorter form of <a href="#catch">catch</a>,
+	which returns the <tt>throw</tt> result directly.
+</p>
+
+<p>
+	<tt>throw</tt> is useful for breaking out of a loop 
+	or for early return from user-defined functions 
+	or expression blocks.
+	In the following example,
+	the <tt>begin</tt> block will return <tt>X</tt> 
+	if <tt>(foo X)</tt> is <tt>true</tt>; 
+	else <tt>Y</tt> will be returned:
+</p>
+
+<blockquote>
+<pre>
+(catch (begin
+    &hellip;
+    (if (foo X) (throw X) Y)
+    &hellip;
+))
+</pre>
+</blockquote>
+
+<p>
+	<tt>throw</tt> will <em>not</em> cause an error exception.
+	Use <a href="#throw-error">throw-error</a>
+	to throw user error exceptions.
+</p> 
+
+
+<br /><br />
+
+<a NAME="throw-error"></a>
+<h2><span class="function">throw-error</span></h2>
+<b>syntax: (throw-error expr)</b>
+
+<p>
+	Causes a user-defined error exception 
+	with text provided by evaluating <em>expr</em>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (foo x y)
+	(if (= x 0) (throw-error "first argument cannot be 0"))
+	(+ x y))
+
+(foo 1 2)  <span class=arw>&rarr;</span> 3
+
+(foo 0 2)  ; causes a user error exception
+<span class=err>user error : first argument cannot be 0
+called from user-defined function foo</span>
+</pre>
+</blockquote>
+
+<p>
+	The user error can be handled 
+	like any other error exception 
+	using user-defined error handlers 
+	and the <a href="#error-event">error-event</a> function, 
+	or the form of <a href="#catch">catch</a> 
+	that can capture error exceptions.
+</p>
+
+<br /><br />
+
+<a NAME="time"></a>
+<h2><span class="function">time</span></h2>
+<b>syntax: (time <em>exp</em> [<em>int-count</em>)</b>
+
+<p>
+	Evaluates the expression in <em>exp</em> 
+	and returns the time spent on evaluation 
+	in milliseconds.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(time (myprog x y z))  <span class=arw>&rarr;</span> 450
+
+(time (myprog x y z) 10)  <span class=arw>&rarr;</span> 4420
+</pre>
+</blockquote>
+
+<p>
+	In first the example,
+	450 milliseconds elapsed 
+	while evaluating <tt>(myprog x y z)</tt>.
+	The second example returns the time 
+	for ten evaluations of  <tt>(myprog x y z)</tt>.
+	See also <a HREF="#date">date</a>,
+	<a HREF="#date-value">date-value</a>,
+	<a HREF="#time-of-day">time-of-day</a>, 
+	and <a HREF="#now">now</a>.
+</p>
+
+<br /><br />
+
+<a NAME="time-of-day"></a>
+<h2><span class="function">time-of-day</span></h2>
+
+<b>syntax: (time-of-day)</b>
+
+<p>
+	Returns the time in milliseconds 
+	since the start of the current day. 
+</p>
+
+<p>
+	See also the <a HREF="#date">date</a>,
+	<a HREF="#date-value">date-value</a>,
+	<a HREF="#time">time</a>, 
+	and <a HREF="#now">now</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="timer"></a>
+<h2><span class="function">timer</span></h2>
+<b>syntax: (timer <em>sym-event-handler</em> <em>num-seconds</em> [<em>int-option</em>])</b><br />
+<b>syntax: (timer <em>func-event-handler</em> <em>num-seconds</em> [<em>int-option</em>])</b><br />
+
+<b>syntax: (timer <em>sym-event-handler</em>)</b><br />
+<b>syntax: (timer <em>func-event-handler</em>)</b><br />
+<b>syntax: (timer)</b>
+
+<p>
+	Starts a one-shot timer 
+	firing off the Unix signal <tt>SIGALRM</tt>, <tt>SIGVTALRM</tt>, 
+	or <tt>SIGPROF</tt> after the time in seconds 
+	(specified in <em>num-seconds</em>) has elapsed.
+	When the timer fires, 
+	it calls the user-defined function 
+	in <em>sym-event-handler</em>.
+</p>
+
+<p>
+	On Linux/UNIX,
+	an optional <tt>0</tt>, <tt>1</tt>, 
+	or <tt>2</tt> can be specified 
+	to control how the timer counts.
+	With default option <tt>0</tt>,
+	real time is measured.
+	Option <tt>1</tt> measures the time 
+	the CPU spends processing in the thread or process 
+	owning the timer.
+	Option <tt>3</tt> is a combination of both 
+	called <em>profiling time</em>.
+	See the UNIX man page <tt>setitimer()</tt> 
+	for details.
+</p>
+
+<p>
+	The event handler 
+	can start the timer again 
+	to achieve a continuous flow of events.
+	Starting with version 8.5.9,
+	seconds can be defined 
+	as floating point numbers 
+	with a fractional part
+	(e.g., <tt>0.25</tt> for 250 milliseconds).
+</p>
+
+<p>
+	Defining <tt>0</tt> (zero) as time 
+	shuts the running timer down 
+	and prevents it from firing.
+</p>
+
+<p>
+	When called with <em>sym-event-handler</em>, 
+	<tt>timer</tt> returns the elapsed time 
+	of the timer in progress.
+	This can be used to program 
+	timelines or schedules.
+</p>
+
+<p>
+	<tt>timer</tt> called without arguments 
+	returns the symbol of the current event handler.
+</p> 
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (ticker) 
+    (println (date)) (timer 'ticker 1.0))
+
+&gt; (ticker)
+<b>Tue Apr 12 20:44:48 2005</b>	; first execution of ticker
+<span class=arw>&rarr;</span> ticker			; return value from ticker
+&gt; <b>Tue Apr 12 20:44:49 2005</b>	; first timer event
+<b>Tue Apr 12 20:44:50 2005</b>	; second timer event ...
+<b>Tue Apr 12 20:44:51 2005
+Tue Apr 12 20:44:52 2005
+Tue Apr 12 20:44:53 2005
+Tue Apr 12 20:44:54 2005
+Tue Apr 12 20:44:55 2005</b>
+</pre>
+</blockquote>
+
+<p>
+	The example shows an event handler, <tt>ticker</tt>,
+	which starts the timer again after each event.
+</p>
+
+<p>
+	Note that a timer cannot interrupt an 
+	ongoing built-in function.
+	The timer interrupt gets registered by newLISP,
+	but a timer handler cannot run 
+	until one expression is evaluated 
+	and the next one starts.
+	To interrupt an ongoing I/O operation with <tt>timer</tt>,
+	use the following pattern, 
+	which calls <a href="#net-select">net-select</a> 
+	to test if a socket is ready for reading:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+define (interrupt)
+    (set 'timeout true))
+        
+(set 'listen (net-listen 30001))
+(set 'socket (net-accept listen))
+        
+(timer 'interrupt 10)
+;; or specifying the function directly
+(timer (fn () (set 'timeout true)) 10)
+        
+(until (or timeout done)
+    (if (net-select socket "read" 100000)
+        (begin
+            (read-buffer socket 'buffer 1024)
+            (set 'done true)))
+)
+                                                                                
+(if timeout
+    (println "timeout")
+    (println buffer))
+                                                                              
+(exit)
+</pre>
+</blockquote>
+
+<p>
+	In this example,
+	the <tt>until</tt> loop will run 
+	until something can be read from <tt>socket</tt>, 
+	or until ten seconds have passed 
+	and the <tt>timeout</tt> variable is set.
+</p>
+
+<br /><br />
+
+<a NAME="title-case"></a>
+<h2><span class="function">title-case</span></h2>
+<b>syntax: (title-case <em>str</em>)</b><br />
+<b>syntax: (title-case <em>str</em> <em>bool</em>)</b>
+
+<p>
+	Returns a copy of the string in <em>str</em> 
+	with the first character converted to uppercase.
+	When the optional <em>bool</em> parameter 
+	evaluates to any value other than <tt>nil</tt>,
+	the rest of the string is converted to lowercase.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(title-case "hello")       <span class=arw>&rarr;</span> "Hello"
+(title-case "hELLO" true)  <span class=arw>&rarr;</span> "Hello"
+</pre>
+</blockquote>
+
+<p>
+	See also the <a href="#lower-case">lower-case</a> 
+	and <a href="#upper-case">upper-case</a> functions.
+</p>
+
+<br /><br />
+
+
+<a NAME="trace"></a>
+<h2><span class="function">trace</span></h2>
+
+<b>syntax: (trace [<em>exp</em>])</b>
+
+<p>
+	Tracing is switched on when <em>exp</em> evaluates to anything 
+	besides <tt>nil</tt> or an empty list <tt>()</tt>.
+	When no argument is supplied,
+	<tt>trace</tt> evaluates to <tt>true</tt> or <tt>nil</tt> 
+	depending on the current trace mode.
+	If trace mode is switched on,
+	newLISP goes into debugging mode after entering
+    the next user defined function, 
+	displaying the function and highlighting the current expression 
+	upon entry and exit.</p>
+
+<p>
+	Highlighting is done by bracketing the expression 
+	between two # (number sign) characters.
+	This can be changed to a different character 
+	using <a HREF="#trace-highlight">trace-highlight</a>. 
+	Upon exit from the expression, 
+	the result of its evaluation 
+	is also reported.
+</p>
+
+<p>
+	If an expression occurs more than once in a function, 
+	the first occurrence of the executing function 
+	will always be highlighted (bracketed).
+</p>
+
+<p>
+	newLISP execution stops with a prompt line 
+	at each entry and exit of an expression.
+</p>
+
+<blockquote>
+<pre>
+[-&gt; 2] s|tep n|ext c|ont q|uit &gt;
+</pre>
+</blockquote>
+
+<p>
+	At the prompt,
+	an <tt>s</tt>, <tt>n</tt>, <tt>c</tt>, 
+	or <tt>q</tt> can be entered 
+	to step into or 
+	merely execute the next expression.
+	Any expression can be entered 
+	at the prompt for evaluation.
+	Entering the name of a variable,
+	for example,  
+	would evaluate to its contents.
+	In this way,
+	a variable's contents 
+	can be checked during debugging
+	or set to different values.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; switches newLISP into debugging mode
+(trace true)  <span class=arw>&rarr;</span> true 
+
+;; the debugger will show each step
+(my-func a b c)
+
+;; switched newLISP out of debugging mode
+(trace nil)  <span class=arw>&rarr;</span> nil 
+</pre>
+</blockquote>
+<p>
+	To set break points 
+	where newLISP should interrupt 
+	normal execution 
+	and go into debugging mode,
+	put <tt>(trace true)</tt> statements 
+	into the LISP code where execution 
+	should switch on the debugger.
+</p>
+
+<p>
+	Use the <a HREF="#debug">debug</a> function
+	as a shortcut for the above example.
+</p>
+
+<br /><br />
+
+<a NAME="trace-highlight"></a>
+<h2><span class="function">trace-highlight</span></h2>
+<b>syntax: (trace-highlight <em>str-pre</em> <em>str-post</em> [<em>str-header</em> <em>str-footer </em>] )</b>
+
+<p>
+	Sets the characters or string of characters 
+	used to enclose expressions 
+	during <a HREF="#trace">trace</a>.
+	By default, 
+	the # (number sign) is used 
+	to enclose the expression highlighted 
+	in <a HREF="#trace">trace</a> mode.
+	This can be changed to different characters 
+	or strings of up to seven characters.
+	If the console window accepts terminal control characters,
+	this can be used to display the expression in a different color,
+	bold, reverse, and so forth.
+</p>
+
+<p>
+	Two more strings can optionally be specified 
+	for <em>str-header and str-footer</em>,
+	which control the separator and prompt.
+	A maximum of 15 characters is allowed 
+	for the header and 31 for the footer.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; active expressions are enclosed in &gt;&gt; and &lt;&lt;
+
+(trace-highlight "&gt;&gt;" "&lt;&lt;") 
+             
+;; 'bright' color on a VT100 or similar terminal window
+
+(trace-highlight "\027[1m" "\027[0m")   
+
+</pre>
+</blockquote>
+
+<p>
+	The first example replaces the default <tt>#</tt> (number sign) 
+	with a <tt>&gt;&gt;</tt> and <tt>&lt;&lt;</tt>.
+	The second example works on most Linux shells.
+	It may not, however, work in console windows 
+	under Win32 or CYGWIN,
+	depending on the configuration of the terminal.
+</p>
+
+<br /><br />
+
+
+
+<a NAME="transpose"></a>
+<h2><span class="function">transpose</span></h2>
+<b>syntax: (transpose <em>matrix</em>)</b>
+
+<p>
+	Transposes a <em>matrix</em> 
+	by reversing the rows and columns 
+	and converting all of the cells 
+	to floating point numbers.
+	Any kind of list-matrix 
+	can be transposed.
+	Matrices are made rectangular 
+	by filling in <tt>nil</tt> for missing elements,
+	omitting elements where appropriate, 
+	or expanding atoms in rows into lists.
+	Matrix dimensions are calculated 
+	using the number of rows in the original matrix 
+	for columns and the number of elements in the first row 
+	as number of rows for the transposed matrix.
+</p>
+
+<p>
+	The dimensions of a matrix 
+	are defined by the number of rows 
+	and the number of elements in the first row.
+	A matrix can either be a nested list 
+	or an <a href="#array">array</a>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'A '((1 2 3) (4 5 6)))
+(transpose A)                      <span class=arw>&rarr;</span> ((1 4) (2 5) (3 6))
+(transpose (list (sequence 1 5)))  <span class=arw>&rarr;</span> ((1) (2) (3) (4) (5))
+
+(transpose '((a b) (c d) (e f)))  <span class=arw>&rarr;</span> ((a c e) (b d f))
+</pre>
+</blockquote>
+
+<p>
+	The number of columns in a matrix 
+	is defined by the number of elements 
+	in the first row of the matrix.
+	If other rows have fewer elements, 
+	<tt>transpose</tt> will assume <tt>nil</tt> 
+	for those missing elements.
+	Superfluous elements in a row will be ignored.
+</p>
+
+<blockquote>
+<pre>
+(set 'A '((1 2 3) (4 5) (7 8 9)))
+
+(transpose A)  <span class=arw>&rarr;</span> ((1 4 7) (2 5 8) (3 nil 9))
+</pre>
+</blockquote>
+
+<p>
+	If a row is any other data type
+	besides a list,
+	the transposition treats it 
+	like an entire row of elements 
+	of that data type:
+</p>
+
+<blockquote>
+<pre>
+(set 'A '((1 2 3) X (7 8 9)))
+
+(transpose A)  <span class=arw>&rarr;</span> ((1 X 7) (2 X 8) (3 X 9))
+</pre>
+</blockquote>
+
+<p>
+	All operations shown here on lists 
+	can also be performed on arrays.
+</p>
+
+<p>
+	See also the matrix operations 
+	<a href="#det">det</a>, <a HREF="#invert">invert</a>,
+    <a href="#mat">mat</a> and <a HREF="#multiply">multiply</a>.
+</p>
+
+<br /><br />
+
+
+<a NAME="trim"></a>
+<h2><span class="function">trim</span></h2>
+<b>syntax: (trim <em>str</em> [ <em>str-char</em> ])</b><br />
+<b>syntax: (trim <em>str</em> [ <em>str-left-char</em>] [<em>str-right-char</em> ])</b>
+
+<p>
+	The first syntax trims the string <em>str</em> from both sides, 
+	stripping the leading and trailing characters as given 
+	in <em>str-char</em>.
+	If <em>str-char</em> contains no character,
+	the space character is assumed.
+	<tt>trim</tt> returns the new string.
+</p>
+
+<p>
+	The second syntax can either trim 
+	different characters from both sides 
+	or trim only one side 
+	if an empty string is specified 
+	for the other.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(trim "   hello  ")              <span class=arw>&rarr;</span> "hello"
+(trim "----hello-----" "-")      <span class=arw>&rarr;</span> "hello"
+(trim "00012340" "0" "")         <span class=arw>&rarr;</span> "12340"
+(trim "1234000" "" "0")          <span class=arw>&rarr;</span> "1234"
+(trim "----hello=====" "-" "=")  <span class=arw>&rarr;</span> "hello"
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a name="truep"></a>
+<h2><span class="function">true?</span></h2>
+<b>syntax: (true? <em>expr</em>)</b>
+
+<p>
+	If the expression in <em>expr</em> 
+	evaluates to anything other than <tt>nil</tt>,
+    or the empty list <tt>()</tt> 
+	<tt>true?</tt> returns <tt>true</tt>; 
+	else it returns <tt>nil</tt>.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(map true? '(x 1 "hi" (a b c) nil ()))
+<span class=arw>&rarr;</span> (true true true true nil nil)
+(true? nil)  <span class=arw>&rarr;</span> nil
+(true? '())  <span class=arw>&rarr;</span> nil
+</pre>
+</blockquote>
+
+<p>Since version 9.1 <tt>true?</tt> behaves like <a href="#if">if</a>
+rejecting the empty list <tt>()</tt></p>
+
+<br /><br /> 
+
+
+<a NAME="unicode"></a>
+<h2><span class="function">unicode</span></h2>
+
+<b>syntax: (unicode <em>str</em>)</b>
+
+<p>
+	Converts ASCII/UTF-8 character strings in <em>str</em> 
+	to UCS-4&ndash;encoded Unicode of 4-byte integers per character.
+	This function is only available 
+	on UTF-8&ndash;enabled versions of newLISP.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(unicode "new") 
+<span class=arw>&rarr;</span> "n\000\000\000e\000\000\000w\000\000\000\000\000\000\000"
+
+
+(utf8 (unicode "new"))  <span class=arw>&rarr;</span> "new"
+</pre>
+</blockquote>
+
+<p>
+	On <em>big endian</em> CPU architectures, 
+	the byte order will be reversed from high to low.
+	The <tt>unicode</tt> and <a href="#utf8">utf8</a> functions 
+	are the inverse of each other.
+	These functions are only necessary 
+	if UCS-4 Unicode is in use.
+	Most systems use UTF-8 encoding only.
+</p>
+
+<br /><br />
+
+<a NAME="unify"></a>
+<h2><span class="function">unify</span></h2>
+<b>syntax: (unify <em>expr-1</em> <em>expr-2</em> [<em>list-env</em>])</b>
+
+<p>
+	Evaluates and matches 
+	<em>expr-1</em> and <em>expr-2</em>.
+	Expressions match if they are equal 
+	or if one of the expressions is 
+	an unbound variable 
+	(which would then be bound to the other expression).
+	If expressions are lists,
+	they are matched by comparing subexpressions.
+	Unbound variables start with an uppercase character 
+	to distinguish them from symbols.
+	<tt>unify</tt> returns <tt>nil</tt> 
+	when the unification process fails,
+	or it returns a list of variable associations on success.
+	When no variables were bound, 
+	but the match is still successful,
+	<tt>unify</tt> returns an empty list.
+    newLISP uses a modified <em>J. Alan Robinson</em> unification algorithm
+    with <em>occurs check</em>.
+</p>
+
+<p>
+    Like <a href="#match">match</a> <tt>unify</tt> is frequently 
+    employed as a parameter functor in <a href="#find">find</a>,
+    <a href="#ref">ref</a>,  <a href="#ref-all">ref-all</a> and 
+    <a href="#replace">replace</a>.
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+(unify 'A 'A)  <span class=arw>&rarr;</span> ()  ; tautology
+
+(unify 'A 123)  <span class=arw>&rarr;</span> ((A 123))  ; A bound to 123
+
+(unify '(A B) '(x y))  <span class=arw>&rarr;</span> ((A x) (B y))  ; A bound to x, B bound to y
+
+(unify '(A B) '(B abc))  <span class=arw>&rarr;</span> ((A abc) (B abc))  ; B is alias for A
+
+(unify 'abc 'xyz)  <span class=arw>&rarr;</span> nil  ; fails because symbols are different
+
+(unify '(A A) '(123 456))  <span class=arw>&rarr;</span> nil  ; fails because A cannot be bound to different values
+
+(unify '(f A) '(f B))  <span class=arw>&rarr;</span> ((A B))  ; A and B are aliases
+
+(unify '(f A) '(g B))  <span class=arw>&rarr;</span> nil  ; fails because heads of terms are different
+
+(unify '(f A) '(f A B))  <span class=arw>&rarr;</span> nil  ; fails because terms are of different arity
+
+(unify '(f (g A)) '(f B))  <span class=arw>&rarr;</span> ((B (g A)))  ; B bound to (g A)
+
+(unify '(f (g A) A) '(f B xyz))  <span class=arw>&rarr;</span> ((B (g xyz)) (A xyz))  ; B bound to (g xyz) A to xyz
+
+(unify '(f A) 'A)  <span class=arw>&rarr;</span> nil  ; fails because of infinite unification (f(f(f &hellip;)))
+
+(unify '(A xyz A) '(abc X X))  <span class=arw>&rarr;</span>  nil ; indirect alias A to X doesn't match bound terms
+
+(unify '(p X Y a) '(p Y X X))  <span class=arw>&rarr;</span> '((Y a) (X a)))  ; X alias Y and binding to 'a
+
+(unify '(q (p X Y) (p Y X)) '(q Z Z))  <span class=arw>&rarr;</span> ((Y X) (Z (p X X)))  ; indirect alias
+
+;; some examples taken from <a href="http://en.wikipedia.org/wiki/Unification">http://en.wikipedia.org/wiki/Unification</a>
+</pre>
+</blockquote>
+
+<p>
+	<tt>unify</tt> can take an optional binding 
+	or association list in <em>list-env</em>.
+	This is useful when chaining <tt>unify</tt> expressions 
+	and the results of previous <tt>unify</tt> bindings 
+	must be included:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(unify '(f X) '(f 123))  <span class=arw>&rarr;</span> ((X 123))
+
+(unify '(A B) '(X A) '((X 123)))
+<span class=arw>&rarr;</span> ((X 123) (A 123) (B 123))
+</pre>
+</blockquote>
+
+<p>
+	In the previous example,
+	<tt>X</tt> was bound to <tt>123</tt> earlier 
+	and is included in the second statement 
+	to pre-bind <tt>X</tt>.
+</p> 
+
+<p>
+	Note that variables are not actually bound 
+	as a newLISP assignment. Rather,
+	an association list is returned 
+	showing the logical binding.
+	A special syntax of <a href="#expand">expand</a> 
+	can be used to actually replace bound variables 
+	with their terms:
+</p>
+
+<blockquote>
+<pre>
+(set 'bindings (unify '(f (g A) A) '(f B xyz)))
+<span class=arw>&rarr;</span> ((B (g xyz)) (A xyz))
+
+(expand '(f (g A) A) bindings)  <span class=arw>&rarr;</span> (f (g xyz) xyz)
+
+; or in one statement
+(expand '(f (g A) A) (unify '(f (g A) A) '(f B xyz)))
+<span class=arw>&rarr;</span> (f (g xyz) xyz)
+</pre>
+</blockquote>
+
+<p>The function <a href="#bind">bind</a> can be used to set unified
+variables:</p>
+
+<blockquote>
+<pre>
+(bind (unify '(f (g A) A) '(f B xyz)))
+
+A <span class=arw>&rarr;</span> xyz 
+B <span class=arw>&rarr;</span> (g xyz)
+</pre>
+</blockquote>
+ 
+
+
+<p>
+	The following example shows how propositional logic 
+	can be modeled using <tt>unify</tt> 
+	and <a href="#expand">expand</a>:
+</p>
+
+<blockquote>
+<pre>
+; if somebody is human, he is mortal -&gt; (X human) :- (X mortal)
+; socrates is human -&gt; (socrates human)
+; is socrates mortal? -&gt; ?  (socrates mortal)
+
+(expand '(X mortal) 
+         (unify '(X human) '(socrates human))) 
+<span class=arw>&rarr;</span> (socrates mortal)
+</pre>
+</blockquote>
+
+<p>
+	The following is a more complex example 
+	showing a small, working PROLOG (Programming in Logic) 
+	implementation.
+</p>
+
+<blockquote>
+<pre>
+;; a small PROLOG implementation
+
+(set 'facts '(
+    (socrates philosopher)
+    (socrates greek)
+    (socrates human)
+    (einstein german)
+    (einstein (studied physics))
+    (einstein human)
+))
+
+(set 'rules '(
+    ((X mortal) &lt;- (X human))
+    ((X (knows physics)) &lt;- (X physicist))
+    ((X physicist) &lt;- (X (studied physics)))
+))
+
+
+(define (query term)
+    (or  (if (find term facts) true) (catch (prove-rule term))))
+
+(define (prove-rule term)
+    (dolist (r rules)
+        (if (list? (set 'e (unify term (first r))))
+            (if (query (expand (last r) e))
+                (throw true))))
+    nil
+)
+
+; try it
+
+&gt; (query '(socrates human))
+<b>true</b>
+&gt; (query '(socrates (knows physics)))
+<b>nil</b>
+&gt; (query '(einstein (knows physics)))
+<b>true</b>
+</pre>
+</blockquote>
+
+<p>
+	The program handles a database of <tt>facts</tt> 
+	and a database of simple 
+	<em>A is a fact if B is a fact</em> <tt>rules</tt>.
+	A fact is proven true 
+	if it either can be found in the <tt>facts</tt> database 
+	or if it can be proven using a rule.
+	Rules can be nested:
+	for example, to prove that somebody <tt>(knows physics)</tt>, 
+	it must be proved true that somebody is a <tt>physicist</tt>.
+	But somebody is only a physicist 
+	if that person <tt>studied physics</tt>.
+	The <tt>&lt;-</tt> symbol 
+	separating the left and right terms of the rules 
+	is not required 
+	and is only added to make the rules database 
+	more readable.
+</p>
+
+<p>
+	This implementation does not handle multiple terms 
+	in the right premise part of the rules,
+	but it does handle backtracking of the <tt>rules</tt> database 
+	to try out different matches.
+	It does not handle backtracking 
+	in multiple premises of the rule.
+	For example,
+	if in the following rule <tt>A if B and C and D</tt>, 
+	the premises <tt>B</tt> and <tt>C</tt> succeed 
+	and <tt>D</tt> fails,
+	a backtracking mechanism might need to go back 
+	and reunify the <tt>B</tt> or <tt>A</tt> terms 
+	with different facts or rules 
+	to make <tt>D</tt> succeed.
+</p>
+
+<p>
+	The above algorithm could be written differently 
+	by omitting <a href="#expand">expand</a> 
+	from the definition of <tt>prove-rule</tt>
+	and by passing the environment, <tt>e</tt>,
+	as an argument to the <tt>unify</tt> and <tt>query</tt> functions.
+</p>
+
+<p>
+	A <em>learning</em> of proven facts 
+	can be implemented by appending them 
+	to the <tt>facts</tt> database 
+	once they are proven.
+	This would speed up subsequent queries.
+</p>
+
+<p>
+	Larger PROLOG implementations 
+	also allow the evaluation of terms in rules. 
+	This makes it possible to implement functions
+	for doing other work 
+	while processing rule terms.
+	<tt>prove-rule</tt> could accomplish this testing 
+	for the symbol <tt>eval</tt> in each rule term.
+</p>
+
+<br /><br />
+
+<a NAME="unique"></a>
+<h2><span class="function">unique</span></h2>
+<b>syntax: (unique <em>list</em>)</b>
+
+<p>
+	Returns a unique version of <em>list</em> 
+	with all duplicates removed.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(unique '(2 3 4 4 6 7 8 7))  <span class=arw>&rarr;</span> (2 3 4 6 7 8)
+</pre>
+</blockquote>
+
+<p>
+	Note that the list does not need to be sorted,
+	but a sorted list makes <tt>unique</tt> perform faster.
+</p>
+
+<p>
+	The functions <a HREF="#difference">difference</a> 
+	and <a HREF="#intersect">intersect</a> work with sets.
+</p>
+
+<br /><br />
+
+<a NAME="unless"></a>
+<h2><span class="function">unless</span></h2>
+<b>syntax: (unless <em>exp-condition</em> <em>exp-1</em> [<em>exp-2</em>])</b>
+
+<p>
+	<tt>unless</tt> is equivalent to 
+	(<a HREF="#if">if</a> (<a HREF="#not">not</a> 
+	<em>exp-condition</em> <em>exp-1</em> [<em>exp-2</em>])).
+	If the value of <em>exp-condition</em> is <tt>nil</tt> 
+	or the empty list <tt>()</tt>,
+	<em>exp-1</em> is evaluated;
+	otherwise, <em>exp-2</em> is evaluated.
+</p>	
+
+<b>example:</b> 
+<blockquote> 
+<pre>
+(set 'x 50)                       <span class=arw>&rarr;</span> 50 
+(unless (&lt; x 100) "big" "small")  <span class=arw>&rarr;</span> "small"
+(set 'x 1000)                     <span class=arw>&rarr;</span> 1000 
+(unless (&lt; x 100) "big" "small")  <span class=arw>&rarr;</span> "big" 
+</pre>
+</blockquote>
+
+<br /><br />
+
+<a NAME="unpack"></a> 
+
+<h2><span class="function">unpack</span></h2> 
+
+<b>syntax: (unpack <em>str-format</em> <em>str-addr-packed</em>)</b> 
+
+<p>
+	Unpacks a binary structure 
+	in <em>str-addr-packed</em> 
+	into LISP variables 
+	using the format in <em>str-format</em>.
+	<tt>unpack</tt> is the reverse operation of <tt>pack</tt>.
+	Note that <em>str-addr-packed</em> 
+	may also be an integer representing a memory address.
+	This facilitates the unpacking of structures 
+	returned from imported, shared library functions.
+</p>
+
+<p>
+	The following characters may define a format:
+</p>
+<br />
+<blockquote> 
+<table border="0" cellpadding="1" width="95%" summary="format chracters in pack">
+
+<tr align="left" valign="bottom"><th>format</th><th>description</th></tr>
+
+<tr>
+<td WIDTH="10%"><tt>c </tt></td>
+<td WIDTH="90%">a signed 8-bit number</td>
+</tr>
+
+<tr>
+<td><tt>b </tt></td>
+<td>an unsigned 8-bit number</td>
+</tr>
+
+<tr>
+<td><tt>d </tt></td>
+<td>a signed 16-bit short number</td>
+</tr>
+
+<tr>
+<td><tt>u </tt></td>
+<td>an unsigned 16-bit short number</td>
+</tr>
+
+<tr>
+<td><tt>ld</tt></td>
+<td>a signed 32-bit long number</td>
+</tr>
+
+<tr>
+<td><tt>lu</tt></td>
+<td>an unsigned 32-bit long number</td>
+</tr>
+
+<tr>
+<td><tt>Ld</tt></td>
+<td>a signed 64-bit long number</td>
+</tr>
+
+<tr>
+<td><tt>Lu</tt></td>
+<td>an unsigned 64-bit long number</td>
+</tr>
+
+<tr>
+<td><tt>f </tt></td>
+<td>a float in 32-bit representation</td>
+
+</tr>
+
+<tr>
+<td><tt>lf</tt></td>
+<td>a double float in 64-bit representation</td>
+</tr>
+
+<tr>
+<td><tt>sn</tt></td>
+<td>a string of <em>n</em> null padded ASCII characters</td>
+</tr>
+
+<tr>
+
+<td><tt>nn</tt></td>
+<td><em>n</em> null characters</td>
+</tr>
+
+<tr>
+<td><tt>&gt;</tt></td>
+<td>switches to big endian byte order</td>
+</tr>
+
+<tr>
+<td><tt>&lt;</tt></td>
+<td>switches to little endian byte order</td>
+</tr>
+
+
+</table>
+
+</blockquote>
+<br />
+<b>example:</b>
+<blockquote>
+<pre>
+(pack "c c c" 65 66 67)  <span class=arw>&rarr;</span> "ABC"
+(unpack "c c c" "ABC")   <span class=arw>&rarr;</span> (65 66 67)
+
+(set 's (pack "c d u" 10 12345 56789))
+(unpack "c d u" s)  <span class=arw>&rarr;</span> (10 12345 56789)
+
+(set 's (pack "s10 f" "result" 1.23))
+(unpack "s10 f" s)  <span class=arw>&rarr;</span> ("result\000\000\000\000" 1.230000019)
+
+(set 's (pack "s3 lf" "result" 1.23))
+(unpack "s3 f" s)  <span class=arw>&rarr;</span> ("res" 1.23)
+
+(set 's (pack "c n7 c" 11 22))
+(unpack "c n7 c" s)  <span class=arw>&rarr;</span> (11 22))
+</pre>
+</blockquote>
+
+<p>
+	The <tt>&gt;</tt> and <tt>&lt;</tt> specifiers 
+	can be used to switch between 
+	<em>little endian</em> and <em>big endian</em> byte order 
+	when packing or unpacking:
+</p>
+
+<blockquote>
+
+<pre>
+;; on a little endian system (e.g., Intel CPUs)
+(set 'buff (pack "d" 1))  <span class=arw>&rarr;</span> "\001\000" 
+
+(unpack "d" buff)   <span class=arw>&rarr;</span> (1)
+(unpack "&gt;d" buff)  <span class=arw>&rarr;</span> (256)
+</pre>
+</blockquote>
+
+
+<p>
+	Switching the byte order 
+	will affect all number formats 
+	with 16-, 32-, or 64-bit sizes.
+</p>
+
+
+<p>
+	The <tt>pack</tt> and <tt>unpack</tt> format 
+	need not be the same,
+	as in the following example:
+</p>
+
+<blockquote>
+<pre>
+(set 's (pack "s3" "ABC"))
+(unpack "c c c" s)  <span class=arw>&rarr;</span> (65 66 67)
+</pre>
+</blockquote>
+
+<p>
+	The examples show spaces between the format specifiers.
+	Although not required, they can improve readability.
+</p>
+
+<p>
+If the buffer's size at a memory address 
+is smaller than the formatting string specifies, 
+some formatting characters may be left unused.</p>
+
+<p>
+	See also the <a href="#address">address</a>,
+	<a HREF="#get-int">get-int</a>,
+	<a HREF="#get-long">get-long</a>,
+	<a HREF="#get-char">get-char</a>,
+	<a HREF="#get-string">get-string</a>, 
+	and <a HREF="#pack">pack</a> functions.
+</p>
+
+<br /><br />
+
+
+<a NAME="until"></a>
+<h2><span class="function">until</span></h2>
+<b>syntax: (until <em>exp-condition</em> <em>body</em>)</b>
+
+<p>
+	Evaluates the condition 
+	in <em>exp-condition body</em>.
+	If the result is <tt>nil</tt> or the empty list <tt>()</tt>, 
+	the expressions in <em>body</em> are evaluated.
+	Evaluation is repeated until the exp-condition results in a value 
+	other than <tt>nil</tt> or the empty list.
+	The result of the last expression evaluated 
+	is the return value of the <tt>until</tt> expression.
+	<tt>until</tt> works like 
+	(<a HREF="#while">while</a> (<a HREF="#not">not</a> &hellip;)).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(device (open "somefile.txt" "read"))
+(set 'line-count 0)
+(until (not (read-line)) (inc 'line-count))
+(close (device))
+(print "the file has " line-count " lines\n")
+</pre>
+</blockquote>
+
+<p>
+	Use the <a href="#do-until">do-until</a> function 
+	to test the condition <em>after</em> evaluation 
+	of the body expressions.
+</p>
+
+<br /><br />
+
+<a NAME="upper-case"></a>
+<h2><span class="function">upper-case</span></h2>
+<b>syntax: (upper-case <em>str</em>)</b>
+
+<p>
+	Returns a copy of the string in <em>str</em> 
+	converted to uppercase.
+	International characters are converted correctly.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(upper-case "hello world")  <span class=arw>&rarr;</span> "HELLO WORLD"
+</pre>
+</blockquote>
+
+<p>
+	See also the <a HREF="#lower-case">lower-case</a> 
+	and <a href="#title-case">title-case</a> functions.
+</p>
+
+<br /><br />
+
+
+<a NAME="utf8"></a>
+<h2><span class="function">utf8</span></h2>
+<b>syntax: (utf8 <em>str</em>)</b>
+
+<p>
+	Converts a UCS-4,
+	4-byte,
+	Unicode-encoded string (<em>str</em>)
+	into UTF-8.
+	This function is only available 
+	on UTF-8&ndash;enabled versions of newLISP.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(unicode "new") 
+<span class=arw>&rarr;</span> "n\000\000\000e\000\000\000w\000\000\000\000\000\000\000"
+
+(utf8 (unicode "new"))  <span class=arw>&rarr;</span> "new"
+</pre>
+</blockquote>
+
+<p>
+	The <tt>utf8</tt> function can also be used 
+	to test for the presence of UTF-8&ndash;enabled newLISP:
+</p>
+
+<blockquote>
+<pre>
+(if utf8 (do-utf8-version-of-code) (do-ascii-version-of-code))
+</pre>
+</blockquote>
+
+<p>
+	On <em>big endian</em> CPU architectures, 
+	the byte order will be reversed 
+	from highest to lowest.
+	The <tt>utf8</tt> 
+	and <a href="#unicode">unicode</a> functions 
+	are the inverse of each other.
+	These functions are only necessary 
+	if UCS-4 Unicode is in use.
+	Most systems use UTF-8 Unicode encoding only.
+</p>
+
+<br /><br />
+
+<a NAME="utf8len"></a>
+<h2><span class="function">utf8len</span></h2>
+<b>syntax: (utf8len <em>str</em>)</b>
+
+<p>Returns the number of characters in a UTF-8&ndash;encoded string. 
+UTF-8 characters can be encoded in more than one 8-bit byte. 
+<tt>utf8len</tt> returns the number of UTF-8 characters in a string. 
+This function is only available on UTF-8&ndash;enabled versions of newLISP.</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(utf8-len "我能吞下玻璃而不伤身体。")    <span class=arw>&rarr;</span> 12
+(length "我能吞下玻璃而不伤身体。")      <span class=arw>&rarr;</span> 36
+</pre>
+</blockquote>
+
+<p>See also the <a href="#unicode">unicode</a> and <a href="#utf8">utf8</a> functions.</p>
+<p></p>
+
+<br /><br />
+<!-- 8.9.4 -->
+<a NAME="uuid"></a>
+<h2><span class="function">uuid</span></h2>
+<b>syntax: (uuid [<em>str-node</em>])</b>
+
+<p>
+	Constructs and returns
+	a UUID (Universally Unique IDentifier).
+	Without a node spec in <em>str-node</em>, 
+	a type 4 UUID random generated byte number 
+	is returned.
+	When the optional <em>str-node</em> parameter is used, 
+	a type 1 UUID is returned.
+	The string in <em>str-node</em> 
+	specifies a valid MAC (Media Access Code) 
+	from a network adapter installed on the node
+	or a random node ID.
+	When a random node ID is specified,
+	the least significant bit of the first node byte 
+	should be set to 1 
+	to avoid clashes with real MAC identifiers.
+	UUIDs of type 1 with node ID 
+	are generated from a timestamp and other data.
+	See <a href="http://www.ietf.org/rfc/rfc4122.txt">RFC 4122</a> 
+	for details on UUID generation.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; type 4 UUID for any system
+
+(uuid)  <span class=arw>&rarr;</span> "493AAD61-266F-48A9-B99A-33941BEE3607"
+
+;; type 1 UUID preferred for distributed systems
+
+;; configure node ID for ether 00:14:51:0a:e0:bc
+(set 'id (pack "cccccc" 0x00 0x14 0x51 0x0a 0xe0 0xbc))
+
+(uuid  id)  <span class=arw>&rarr;</span> "0749161C-2EC2-11DB-BBB2-0014510AE0BC"
+</pre>
+</blockquote>
+
+<p>
+	Each invocation of the <tt>uuid</tt> function 
+	will yield a new unique UUID.
+	The UUIDs are generated without systemwide 
+	shared stable store (see RFC 4122).
+	If the system generating the UUIDs 
+	is distributed over several nodes, 
+	then type 1 generation should be used 
+	with a different node ID on each node.
+	For several processes on the same node, 
+	valid UUIDs are guaranteed 
+	even if requested at the same time.
+	This is because the process ID 
+	of the generating newLISP process 
+	is part of the seed 
+	for the random number generator.
+	When type 4 IDs are used on a distributed system, 
+	two identical UUID's are still highly unlikely 
+	and impossible for type 1 IDs 
+	if real MAC addresses are used.
+</p>
+
+<br><br>
+
+
+<a NAME="wait-pid"></a>
+<h2><span class="function">wait-pid</span></h2>
+<b>syntax: (wait-pid <em>int-pid</em> [<em>int-options</em>])</b>
+
+<p>
+	Waits for a child process specified in <em>int-pid</em> to end.
+	The child process was previously started 
+	with <a href="#process">process</a> or <a href="#fork">fork</a>.
+	When the child process specified in <em>int-pid</em> ends,
+	a status value describing the reason for termination 
+	of the child process or thread is returned.
+	The interpretation of the returned status value 
+	differs between Linux and other flavors of UNIX.
+	Consult the Linux/UNIX man pages 
+	for the <tt>waitpid</tt> command 
+	(without the hyphen used in newLISP) 
+	for further information.
+</p>
+
+<p>
+	When <tt>-1</tt> is specified for <em>int-pid</em>, 
+	the status information of any child process started is returned.
+	When <tt>0</tt> is specified, 
+	<tt>wait-pid</tt> only watches 
+	child processes in the same process group 
+	as the calling process.
+	Any other negative value for <em>int-pid</em> 
+	reports child processes in the same process group 
+	as specified with a negative sign in <em>int-pid</em>.
+</p>
+
+<p>
+	This function is only available on Linux 
+	and other UNIX-like operating systems 
+	or on a CYGWIN compiled version of newLISP 
+	on Win32.
+	An option can be specified in <em>int-option</em>.
+	See Linux/UNIX documentation 
+	for details on options.
+</p>
+
+<b>example:</b>
+<blockquote><pre>
+(set 'pid (fork (my-thread)))
+
+(set 'status (wait-pid pid))  ; wait until my-thread ends
+
+(println "thread: " pid " has finished with status: " status)
+</pre></blockquote>
+
+<p>
+	The process <tt>my-thread</tt> is started, 
+	then the main program blocks 
+	in the <tt>wait-pid</tt> call 
+	until <tt>my-thread</tt> has finished.
+</p>
+
+<br /><br />
+
+<a NAME="when"></a>
+<h2><span class="function">when</span></h2>
+<b>syntax: (when <em>exp-condition</em> <em>body</em>)</b>
+
+<p>The statements in <em>body</em> are only evaluated if <em>exp-condition</em>
+evalutes to <tt>true</tt></p>
+
+<p>Because <tt>when</tt> does not have an <em>else</em> condition as in
+<a href="#if">if</a>, the statements in <em>body</em> need not to be grouped with
+<a href="#begin">begin</a>:</p>
+
+<blockquote><pre>
+(when (read-line)
+	(set 'result (analyze (current-line)))
+	(report result
+	(finish)
+)	
+</pre></blockquote>
+<br /><br />
+
+<a NAME="while"></a>
+<h2><span class="function">while</span></h2>
+<b>syntax: (while <em>exp-condition</em> <em>body</em>)</b>
+
+<p>
+	Evaluates the condition 
+	in <em>exp-condition</em>.
+	If the result is not <tt>nil</tt> or the empty list <tt>()</tt>, 
+	the expressions in <em>body</em> are evaluated.
+	Evaluation is repeated until an <em>exp-condition</em> results 
+	in <tt>nil</tt> or the empty list <tt>()</tt>.
+	The result of the body's last expression
+	is the return value of 
+	the <tt>while</tt> expression.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(device (open "somefile.txt" "read"))
+(set 'line-count 0)
+(while (read-line) (inc 'line-count))
+(close (device))
+(print "the file has " line-count " lines\n")
+</pre>
+</blockquote>
+
+<p>
+	Use the <a href="#do-while">do-while</a> function
+	to evaluate the condition 
+	<em>after</em> evaluating the body of expressions.
+</p>
+
+<br /><br />
+
+<a NAME="write-buffer"></a>
+
+<h2><span class="function">write-buffer</span></h2>
+<b>syntax: (write-buffer <em>int-file</em> <em>sym-buffer</em> [<em>int-size</em>])</b><br />
+<b>syntax: (write-buffer <em>int-file</em> <em>str-buffer</em> [<em>int-size</em>])</b><br /><br />
+
+<b>syntax: (write-buffer <em>str-device</em> <em>sym-buffer</em> [<em>int-size</em>])</b><br />
+<b>syntax: (write-buffer <em>str-device</em> <em>str-buffer</em> [<em>int-size</em>])</b>
+
+
+<p>
+	Using the first syntax,
+	<tt>write-buffer</tt> writes <em>int-size</em> bytes 
+	from a buffer in <em>sym-buffer</em> or <em>str-buffer</em> 
+	to a file specified in <em>int-file</em>,
+	previously obtained from a file <tt>open</tt> operation.
+	If <em>int-size</em> is not specified,
+	all data in <em>sym-buffer</em> or <em>str-buffer</em> 
+	is written.
+	<tt>write-buffer</tt> returns the number of bytes written 
+	or <tt>nil</tt> on failure.
+</p>
+
+<p>
+	The string buffer symbol can be used 
+	with or without quoting a symbol.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'handle (open "myfile.ext" "write"))
+(write-buffer handle 'data 100)
+
+;; string buffer w/o quote
+(write-buffer handle data 100)   
+(write-buffer handle "a quick message\n")
+</pre>
+</blockquote>
+<p>
+	The code in the example writes 100 bytes 
+	to the file <tt>myfile.ext</tt> 
+	from the contents in <tt>data</tt>.
+</p>
+
+<p>
+	Using the second syntax,
+	<tt>write-buffer</tt> appends contents from a string 
+	specified in <em>sym-buffer</em> or <em>str-buffer</em> 
+	to the string specified in <em>str-device</em>,
+	which acts like a stream device.
+</p>
+
+
+<b>example:</b>
+<blockquote>
+<pre>
+;; fast in-place string appending
+(set 'str "")
+(dotimes (x 5) (write-buffer str "hello"))
+
+str  <span class=arw>&rarr;</span> "HelloHelloHelloHelloHello")
+
+;; much slower method of string concatenation
+(dotimes (x 5) (set 'str (append str "hello")))
+</pre>
+</blockquote>
+
+<p>
+	The above example appends a string to <tt>str</tt> five times. 
+	This method is much faster than 
+	using <a href="#append">append</a> 
+	when concatenating to a string in place.
+</p>
+
+<p>
+	See also the <a HREF="#read-buffer">read-buffer</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="write-char"></a>
+<h2><span class="function">write-char</span></h2>
+<b>syntax: (write-char <em>int-file int-byte</em>)</b>
+
+<p>
+	Writes a byte specified in <em>int-byte</em> 
+	to a file specified by the file handle in <em>int-file</em>.
+	The file handle is obtained 
+	from a previous <tt>open</tt> operation.
+	Each <tt>write-char</tt> advances the file pointer 
+	by one byte.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(define (slow-file-copy from-file to-file)
+    (set 'in-file (open from-file "read"))
+    (set 'out-file (open to-file "write"))
+    (while (set 'chr (read-file in-file))
+        (write-char out-file chr))
+     (close in-file)
+    (close out-file)
+    "finished")
+</pre>
+</blockquote>
+
+<p>
+	Use the <a HREF="#print">print</a> 
+	and <a HREF="#device">device</a> functions 
+	to write larger portions of data at a time.
+	Note that newLISP already supplies a faster 
+	built-in function called 
+	<a HREF="#copy-file">copy-file</a>.
+</p>
+
+<p>
+	See also the <a HREF="#read-char">read-char</a> function.
+</p>
+
+<br /><br />
+
+<a NAME="write-file"></a>
+<h2><span class="function">write-file</span></h2>
+<b>syntax: (write-file <em>str-file-name</em> <em>str-buffer</em>)</b>
+
+<p>
+	Writes a file in <em>str-file-name</em> 
+	with contents in <em>str-buffer</em> 
+	in one swoop and returns 
+	the number of bytes written.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(write-file "myfile.enc"
+    (encrypt (read-file "/home/lisp/myFile") "secret"))
+</pre>
+</blockquote>
+
+<p>
+	The file <tt>myfile</tt> is read,
+	<a HREF="#encrypt">encrypted</a> using the password <tt>secret</tt>, 
+	and written back into the new file <tt>myfile.enc</tt>
+	in the current directory.
+</p>
+
+<p>
+	<tt>write-file</tt> can take an 
+	<tt>http://</tt> or <tt>file://</tt> URL 
+	in <em>str-file-name</em>.
+	In this case, 
+	<tt>write-file</tt> works exactly like <a href="#put-url">put-url</a> 
+	and can take the same additional parameters:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(write-file "http://asite.com/message.txt" "This is a message" )
+</pre>
+</blockquote>
+
+<p>
+	The file <tt>message.txt</tt> is created 
+	and written at a remote location, <tt>http://asite.com</tt>, 
+	with the contents of <em>str-buffer</em>.
+	In this mode, 
+	<tt>write-file</tt> can also be used to transfer files 
+	to remote newLISP server nodes.
+</p>
+
+<p>
+	See also the <a HREF="#append-file">append-file</a> 
+	and <a HREF="#read-file">read-file</a> functions.
+</p>
+
+<br /><br />
+
+<a NAME="write-line"></a>
+<h2><span class="function">write-line</span></h2>
+<b>syntax: (write-line [<em>str</em>] [<em>int-file</em>])</b><br />
+
+<b>syntax: (write-line [<em>str</em>] [<em>str-device</em>])</b>
+
+<p>
+	The string in <em>str</em> 
+	and the line termination character(s) 
+	are written to the console or a file.
+	If no file handle is specified in <em>int-file</em>,
+	<tt>write-line</tt> writes to the current device, 
+	normally the console screen.
+	When all arguments are omitted,
+	<tt>write-line</tt> writes the contents 
+	of the last <a HREF="#read-line">read-line</a> to the screen.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(write-line "hello there")
+
+(set 'out-file (open "myfile" "write"))
+(write-line "hello there" out-file)
+(close out-file)
+
+(set 'myFile (open "init.lsp" "read")
+(while (read-line myFile) (write-line))
+
+;; using a string device:
+
+(set 'str "")
+(dotimes (x 4) (write-line "hello" str))
+
+str  <span class=arw>&rarr;</span> "hello\r\nhello\r\nhello\r\nhello\r\n"  ; on Win32
+
+str  <span class=arw>&rarr;</span> "hello\nhello\nhello\nhello\n"  ; on Linux/UNIX
+</pre>
+</blockquote>
+
+<p>
+	The first example puts a string out on the current <a HREF="#device">device</a>,
+	which is probably the console window <tt>(device 0)</tt>.
+	The second example opens/creates a file,
+	writes a line to it, 
+	and closes the file.
+	The third example shows the usage of <tt>write-line</tt> 
+	without arguments.
+	The contents of <tt>init.lsp</tt> 
+	are written to the console screen.
+</p>
+
+<p>
+	In the second syntax,
+	a string can be specified 
+	as a device in <em>str-device</em>
+	(like the <a href="#write-buffer">write-buffer</a> function).
+	When a string device is written to, 
+	the string in <em>str-device</em> gets appended with <em>str</em> 
+	and the line termination character(s).
+</p>
+
+<br /><br />
+
+
+<a NAME="xml-error"></a>
+<h2><span class="function">xml-error</span></h2>
+<b>syntax: (xml-error)</b>
+
+<p>
+	Returns a list of error information 
+	from the last <a HREF="#xml-parse">xml-parse</a> operation; 
+	otherwise, returns <tt>nil</tt>
+	if no error occurred.
+	The first element contains text 
+	describing the error, 
+	and the second element is a number indicating 
+	the last scan position in the source XML text, 
+	starting at 0 (zero).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(xml-parse "&lt;atag&gt;hello&lt;/atag&gt;&lt;fin")  <span class=arw>&rarr;</span> nil
+
+(xml-error)  <span class=arw>&rarr;</span> ("expected closing tag: &gt;" 18)
+</pre>
+</blockquote>
+
+<br /><br />
+
+
+<a NAME="xml-parse"></a>
+<h2><span class="function">xml-parse</span></h2>
+<b>syntax: (xml-parse <em>string-xml</em> [<em>int-options</em> [<em>sym-context</em> [<em>func-callback</em>]])</b>
+
+<p>
+	Parses a string containing XML 1.0 compliant, 
+	<em>well-formed</em> XML.
+	<tt>xml-parse</tt> does not perform DTD validation. 
+	It skips DTDs (Document Type Declarations) 
+	and processing instructions.
+	Nodes of type ELEMENT, TEXT, CDATA, 
+	and COMMENT are parsed, and 
+	a newLISP list structure is returned.
+	When an element node does not have 
+	attributes or child nodes,
+	it instead contains an empty list.
+	Attributes are returned as association lists, 
+	which can be accessed using <a HREF="#assoc">assoc</a>.
+	When <tt>xml-parse</tt> fails 
+	due to malformed XML,
+	<tt>nil</tt> is returned 
+	and <a HREF="#xml-error">xml-error</a> can be used 
+	to access error information.
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'xml 
+  "&lt;person name='John Doe' tel='555-1212'&gt;nice guy&lt;/person&gt;")
+
+(xml-parse xml) 
+<span class=arw>&rarr;</span> (("ELEMENT" "person" 
+    (("name" "John Doe") 
+     ("tel" "555-1212"))
+    (("TEXT" "nice guy"))))
+</pre>
+</blockquote>
+
+<br />
+<b>Modifying the translation process.</b>
+<p>
+	Optionally, the <em>int-options</em> parameter
+	can be specified 
+	to suppress whitespace,
+	empty attribute lists, 
+	and comments.
+	It can also be used 
+	to transform tags 
+	from strings into symbols.
+	Another function, <a HREF="#xml-type-tags">xml-type-tags</a>, 
+	serves for translating the XML tags.
+	The following option numbers can be used:
+</p>
+
+<br />
+
+<blockquote>
+<table border="0" cellpadding="1" summary="option numbers for xml-parse">
+<tr align="left" valign="bottom"><th>option</th><th>description</th></tr>
+<tr><td>1</td><td>suppress whitespace text tags</td></tr>
+<tr><td>2</td><td>suppress empty attribute lists</td></tr>
+<tr><td>4</td><td>suppress comment tags</td></tr>
+<tr><td>8</td><td>translate string tags into symbols</td></tr>
+
+<tr><td>16</td><td>add SXML (S-expression XML) attribute tags</td></tr>
+</table>
+</blockquote>
+<br />
+<p>
+	Options can be combined 
+	by adding the numbers
+	(e.g., <tt>3</tt> would combine the options 
+	for suppressing whitespace text tags/info 
+	and empty attribute lists).
+</p>
+ 
+<p>
+	The following examples 
+	show how the different options can be used:
+</p>
+<br />
+<b>XML source:</b>
+
+<blockquote>
+<pre>
+&lt;?xml version="1.0" ?&gt;
+&lt;DATABASE name="example.xml"&gt;
+&lt;!--This is a database of fruits--&gt;
+    &lt;FRUIT&gt;
+        &lt;NAME&gt;apple&lt;/NAME&gt;
+        &lt;COLOR&gt;red&lt;/COLOR&gt;
+        &lt;PRICE&gt;0.80&lt;/PRICE&gt;
+    &lt;/FRUIT&gt;
+
+    &lt;FRUIT&gt;
+        &lt;NAME&gt;orange&lt;/NAME&gt;
+        &lt;COLOR&gt;orange&lt;/COLOR&gt;
+        &lt;PRICE&gt;1.00&lt;/PRICE&gt;
+    &lt;/FRUIT&gt;
+
+    &lt;FRUIT&gt;
+       &lt;NAME&gt;banana&lt;/NAME&gt;
+       &lt;COLOR&gt;yellow&lt;/COLOR&gt;
+       &lt;PRICE&gt;0.60&lt;/PRICE&gt;
+    &lt;/FRUIT&gt;
+&lt;/DATABASE&gt;
+</pre>
+</blockquote>
+
+<br />
+<b>Parsing without any options:</b>
+
+<blockquote>
+<pre>
+(xml-parse (read-file "example.xml"))
+<span class=arw>&rarr;</span> (("ELEMENT" "DATABASE" (("name" "example.xml")) (("TEXT" "\r\n\t") 
+    ("COMMENT" "This is a database of fruits") 
+    ("TEXT" "\r\n\t") 
+    ("ELEMENT" "FRUIT" () (("TEXT" "\r\n\t\t") ("ELEMENT" "NAME" () 
+       (("TEXT" "apple"))) 
+      ("TEXT" "\r\n\t\t") 
+      ("ELEMENT" "COLOR" () (("TEXT" "red"))) 
+      ("TEXT" "\r\n\t\t") 
+      ("ELEMENT" "PRICE" () (("TEXT" "0.80"))) 
+      ("TEXT" "\r\n\t"))) 
+    ("TEXT" "\r\n\r\n\t") 
+    ("ELEMENT" "FRUIT" () (("TEXT" "\r\n\t\t") ("ELEMENT" "NAME" () 
+       (("TEXT" "orange"))) 
+      ("TEXT" "\r\n\t\t") 
+      ("ELEMENT" "COLOR" () (("TEXT" "orange"))) 
+      ("TEXT" "\r\n\t\t") 
+      ("ELEMENT" "PRICE" () (("TEXT" "1.00"))) 
+      ("TEXT" "\r\n\t"))) 
+    ("TEXT" "\r\n\r\n\t") 
+    ("ELEMENT" "FRUIT" () (("TEXT" "\r\n\t\t") ("ELEMENT" "NAME" () 
+       (("TEXT" "banana"))) 
+      ("TEXT" "\r\n\t\t") 
+      ("ELEMENT" "COLOR" () (("TEXT" "yellow"))) 
+      ("TEXT" "\r\n\t\t") 
+      ("ELEMENT" "PRICE" () (("TEXT" "0.60"))) 
+      ("TEXT" "\r\n\t"))) 
+    ("TEXT" "\r\n"))))
+</pre>
+</blockquote>
+
+<p>
+	The <tt>TEXT</tt> elements containing only whitespace 
+	make the output very confusing.
+	As the database in <tt>example.xml</tt> only contains data,
+	we can suppress whitespace and comments 
+	with option <tt>(+ 1 3)</tt>:
+</p>
+
+<br />
+
+<b>Filtering whitespace TEXT, COMMENT tags, and empty attribute lists:</b>
+
+<blockquote>
+<pre>
+(xml-parse (read-file "example.xml") (+ 1 2 4))
+<span class=arw>&rarr;</span> (("ELEMENT" "DATABASE" (("name" "example.xml")) ( 
+     ("ELEMENT" "FRUIT" (
+       ("ELEMENT" "NAME" (("TEXT" "apple"))) 
+       ("ELEMENT" "COLOR" (("TEXT" "red"))) 
+       ("ELEMENT" "PRICE" (("TEXT" "0.80"))))) 
+     ("ELEMENT" "FRUIT" (
+       ("ELEMENT" "NAME" (("TEXT" "orange"))) 
+       ("ELEMENT" "COLOR" (("TEXT" "orange"))) 
+       ("ELEMENT" "PRICE" (("TEXT" "1.00"))))) 
+     ("ELEMENT" "FRUIT" (
+       ("ELEMENT" "NAME" (("TEXT" "banana"))) 
+       ("ELEMENT" "COLOR" (("TEXT" "yellow"))) 
+       ("ELEMENT" "PRICE" (("TEXT" "0.60"))))))))
+</pre>
+</blockquote>
+
+<p>
+	The resulting output looks much more readable,
+	but it can still be improved 
+	by using symbols instead of strings 
+	for the tags "FRUIT", "NAME", "COLOR", and "PRICE",
+	as well as by suppressing the XML type tags 
+	"ELEMENT" and "TEXT" completely 
+	using the <a HREF="#xml-type-tags">xml-type-tags</a> directive.
+</p>
+
+<br />
+
+<b>Suppressing XML type tags with <a HREF="#xml-type-tags">xml-type-tags</a> and translating string tags into symbol tags:</b>
+
+<blockquote>
+<pre>
+;; suppress all XML type tags for TEXT and ELEMENT
+;; instead of "CDATA", use cdata and instead of "COMMENT", use !--
+
+(xml-type-tags nil 'cdata '!-- nil) 
+
+;; turn on all options for suppressing whitespace and empty
+;; attributes, translate tags to symbols
+
+(xml-parse (read-file "example.xml") (+ 1 2 8))
+<span class=arw>&rarr;</span> ((DATABASE (("name" "example.xml")) 
+     (!-- "This is a database of fruits") 
+     (FRUIT (NAME "apple") (COLOR "red") (PRICE "0.80")) 
+     (FRUIT (NAME "orange") (COLOR "orange") (PRICE "1.00")) 
+     (FRUIT (NAME "banana") (COLOR "yellow") (PRICE "0.60"))))
+</pre>
+</blockquote>
+
+<p>
+	When tags are translated into symbols by using option <tt>8</tt>, 
+	a context can be specified in <em>sym-context</em>. 
+	If no context is specified, 
+	all symbols will be created inside the current context.
+</p>
+
+<blockquote>
+<pre>
+(xml-type-tags nil nil nil nil)
+(xml-parse "&lt;msg&gt;Hello World&lt;/msg&gt;" (+ 1 2 4 8 16) 'CTX)
+<span class=arw>&rarr;</span> ((CTX:msg "Hello World"))
+</pre>
+</blockquote>
+
+<p>
+	Specifying <tt>nil</tt> for the XML type tags TEXT and ELEMENT 
+	makes them disappear.
+	At the same time, 
+	parentheses of the child node list 
+	are removed so that 
+	child nodes now appear as members of the list, 
+	starting with the tag symbol 
+	translated from the string tags 
+	"FRUIT", "NAME", etcetera.
+</p>
+
+<br />
+<b>Parsing into SXML (S-expressions XML) format:</b>
+<p>
+	Using <a href="#xml-type-tags">xml-type-tags</a> to suppress 
+	all XML-type tags&mdash;along with the option numbers 
+	<tt>1</tt>, <tt>4</tt>, <tt>8</tt>, and <tt>16</tt>&mdash;SXML 
+	formatted output can be generated:
+</p>
+
+<blockquote>
+<pre>
+(xml-type-tags nil nil nil nil)
+(xml-parse (read-file "example.xml") (+ 1 2 4 8 16))
+<span class=arw>&rarr;</span> ((DATABASE (@ (name "example.xml")) 
+    (FRUIT (NAME "apple") (COLOR "red") (PRICE "0.80")) 
+    (FRUIT (NAME "orange") (COLOR "orange") (PRICE "1.00")) 
+    (FRUIT (NAME "banana") (COLOR "yellow") (PRICE "0.60"))))
+</pre>
+</blockquote>
+
+<p>
+	Note that using option number <tt>16</tt> 
+	causes an <tt>@</tt> (at symbol) to be added to attribute lists.
+</p>
+
+<p>
+	See also the <a HREF="#xml-type-tags">xml-type-tags</a> function 
+	for further information on XML parsing.
+</p>
+<br />
+<b>Parsing into a specified context</b>
+<p>When parsing XML expressions XML tags are translated into newLISP symbols.
+The <i>sym-context</i> option specifies the target context for the symbol
+creation:
+<blockquote>
+<pre>
+(xml-type-tags nil nil nil nil)
+(xml-parse (read-file "example.xml") (+ 1 2 4 8 16) 'CTX)
+<span class=arw>&rarr;</span>((CTX:DATABASE (@ (name "example.xml")) 
+    (CTX:FRUIT (CTX:NAME "apple") (CTX:COLOR "red") (CTX:PRICE "0.80")) 
+    (CTX:FRUIT (CTX:NAME "orange") (CTX:COLOR "orange") (CTX:PRICE "1.00")) 
+    (CTX:FRUIT (CTX:NAME "banana") (CTX:COLOR "yellow") (CTX:PRICE "0.60"))))
+</pre>
+</blockquote>
+
+<p>If the context does not exist, it will be created. If it exists, the quote can 
+be omitted or the context can be referred to by a variable.</p>
+
+<blockquote>
+<pre>
+</pre>
+</blockquote>
+
+
+<br />
+<b>Using a call back function</b>
+<p>Normally <tt>xml-parse</tt> will not return until all parsing has finished.
+Using the <em>func-callback</em> option <tt>xml-parse</tt> will call back after
+each tag closing with the generated S-expression and a start position and
+length in the source XML:</p>
+
+<blockquote>
+<pre>
+;; demo callback feature
+(define (xml-callback s-expr start size)
+    (if (or (= (s-expr 0) 'NAME) (= (s-expr 0) 'COLOR) (= (s-expr 0) 'PRICE))
+        (begin
+            (print "parsed expresson:" s-expr)
+            (println ", source:" (start size example-xml))
+        )
+    )
+)
+
+(xml-type-tags nil 'cdata '!-- nil)
+(xml-parse  (read-file "example.xml") (+ 1 2 8) MAIN xml-callback)
+</pre>
+</blockquote>
+
+<p>THe following output will be generated by the callback function <tt>xml-callback</tt>:</p>
+<blockquote>
+<pre>
+parsed expresson:(NAME "apple"), source:&lt;NAME&gt;apple&lt;/NAME&gt;
+parsed expresson:(COLOR "red"), source:&lt;COLOR&gt;red&lt;/COLOR&gt;
+parsed expresson:(PRICE "0.80"), source:&lt;PRICE&gt;0.80&lt;/PRICE&gt;
+parsed expresson:(NAME "orange"), source:&lt;NAME&gt;orange&lt;/NAME&gt;
+parsed expresson:(COLOR "orange"), source:&lt;COLOR&gt;orange&lt;/COLOR&gt;
+parsed expresson:(PRICE "1.00"), source:&lt;PRICE&gt;1.00&lt;/PRICE&gt;
+parsed expresson:(NAME "banana"), source:&lt;NAME&gt;banana&lt;/NAME&gt;
+parsed expresson:(COLOR "yellow"), source:&lt;COLOR&gt;yellow&lt;/COLOR&gt;
+parsed expresson:(PRICE "0.60"), source:&lt;PRICE&gt;0.60&lt;/PRICE&gt;
+</pre>
+</blockquote>
+
+<p>The example callback handler function filters the tags of interest and processes
+them as they occur.</p>
+
+<br /><br />
+
+<a NAME="xml-type-tags"></a>
+<h2><span class="function">xml-type-tags</span></h2>
+
+<b>syntax: (xml-type-tags [<em>expr-text-tag</em> <em>expr-cdata-tag</em> <em>expr-comment-tag</em> <em>expr-element-tags</em>])</b>
+
+<p>
+	Can suppress completely
+	or replace the XML type tags 
+	"TEXT", "CDATA", "COMMENT", and "ELEMENT"
+	with something else specified 
+	in the parameters.
+</p>
+
+<p>
+	Note that <tt>xml-type-tags</tt> 
+	only suppresses or translates the tags themselves 
+	but does not suppress or modify the tagged information.
+	The latter would be done 
+	using option numbers in <a HREF="#xml-parse">xml-parse</a>.
+</p>
+
+<p>
+	Using <tt>xml-type-tags</tt> without arguments 
+	returns the current type tags:
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(xml-type-tags)  <span class=arw>&rarr;</span> ("TEXT" "CDATA" "COMMENT" "ELEMENT")
+
+(xml-type-tags nil 'cdata '!-- nil)
+</pre>
+</blockquote>
+
+<p>
+	The first example just shows the currently used type tags.
+	The second example specifies suppression of the "TEXT" and "ELEMENT" tags 
+	and shows <tt>cdata</tt> and <tt>!--</tt> instead of 
+	"CDATA" and "COMMENT".
+</p>
+
+<br /><br />
+
+<a NAME="zerop"></a>
+<h2><span class="function">zero?</span></h2>
+<b>syntax: (zero? <em>expr</em>)</b>
+
+<p>
+	Checks the evaluation of <em>expr</em> 
+	to see if it equals <tt>0</tt> (zero).
+</p>
+
+<b>example:</b>
+<blockquote>
+<pre>
+(set 'value 1.2)
+(set 'var 0)
+(zero? value)  <span class=arw>&rarr;</span> nil
+(zero? var)    <span class=arw>&rarr;</span> true
+
+(map zero? '(0 0.0 3.4 4))  <span class=arw>&rarr;</span> (true true nil nil)
+</pre>
+</blockquote>
+
+<p>
+	<tt>zero?</tt> will return <tt>nil</tt> 
+	on data types other than numbers.
+</p>
+
+<br /><br />
+
+
+<center style="font-size: 150%">
+<span class="divider">(&nbsp;<font color="#7ba9d4">&part;</font>&nbsp;)</span>
+</center>
+
+<br /><br />
+
+<a NAME="error_codes"></a>
+<center><h1>newLISP APPENDIX</h1></center>
+
+<h2>Error codes</h2>
+
+<blockquote>
+<pre>
+    not enough memory                  1
+    environment stack overflow         2
+    call stack overflow                3
+    problem accessing file             4
+    not an expression                  5
+    missing parenthesis                6
+    string token too long              7
+    missing argument                   8
+    number or string expected          9
+    value expected                    10
+    string expected                   11
+    symbol expected                   12
+    context expected                  13
+    symbol or context expected        14
+    list expected                     15
+    list or array expected            16
+    list or symbol expected           17
+    list or string expected           18
+    list or number expected           19
+    array expected                    20
+    array, list or string expected    21
+    lambda expected                   22
+    lambda-macro expected             23
+    invalid function                  24
+    invalid lambda expression         25
+    invalid macro expression          26
+    invalid let parameter list        27
+    problem saving file               28
+    division by zero                  29
+    matrix expected                   30
+    wrong dimensions                  31
+    matrix is singular                32
+    syntax in regular expression      33
+    throw without catch               34
+    problem loading library           35
+    import function not found         36
+    symbol is protected               37
+    error number too high             38
+    regular expression                39
+    missing end of text [/text]       40
+    mismatch in number of arguments   41
+    problem in format string          42
+    data type and format don't match  43
+    invalid parameter                 44
+    invalid parameter: 0.0            45
+    invalid parameter: NaN            46
+    illegal parameter type            47
+    symbol not in MAIN context        48
+    symbol not in current context     49
+    target cannot be MAIN             50
+    list index out of bounds          51
+    array index out of bounds         52
+    string index out of bounds        53
+    nesting level too deep            54
+    user error                        55
+    user reset -                      56
+    received SIGINT -                 57
+    function is not reentrant         58
+</pre>
+</blockquote>
+
+
+<br /><br /><br />
+
+<a NAME="tcpip_error_codes"></a>
+<h2>TCP/IP and UDP Error Codes</h2>
+
+<blockquote>
+<pre>
+ 0: No error
+ 1: Cannot open socket
+ 2: Host name not known
+ 3: Not a valid service
+ 4: Connection failed
+ 5: Accept failed
+ 6: Connection closed
+ 7: Connection broken
+ 8: Socket send() failed
+ 9: Socket recv() failed
+10: Cannot bind socket
+11: Too much sockets in net-select
+12: Listen failed
+13: Badly formed IP
+14: Select failed
+15: Peek failed
+16: Not a valid socket
+</pre>
+</blockquote>
+
+<br /><br />
+<center style="font-size: 150%">
+<span class="divider">(&nbsp;<font color="#7ba9d4">&part;</font>&nbsp;)</span>
+</center>
+<br /><br />
+
+<table BORDER=0 summary="GNUFDL">
+<tr>
+<td>
+
+<blockquote>
+<a NAME="GNUFDL"></a>
+<center>
+<h2><span class="function">GNU Free Documentation License</span></h2>
+<p>Version 1.2, November 2002</p>
+
+<p>
+Copyright (C) 2000,2001,2002  Free Software Foundation, Inc.
+59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+Everyone is permitted to copy and distribute verbatim copies
+of this license document, but changing it is not allowed.
+</p>
+</center>
+
+<br><br>
+
+<b>0. PREAMBLE</b>
+
+<p>The purpose of this License is to make a manual, textbook, or other
+functional and useful document "free" in the sense of freedom: to
+assure everyone the effective freedom to copy and redistribute it,
+with or without modifying it, either commercially or noncommercially.
+Secondarily, this License preserves for the author and publisher a way
+to get credit for their work, while not being considered responsible
+for modifications made by others.
+</p>
+<p>This License is a kind of "copyleft", which means that derivative
+works of the document must themselves be free in the same sense. It
+complements the GNU General Public License, which is a copyleft
+license designed for free software.
+</p>
+<p>We have designed this License in order to use it for manuals for
+free
+software, because free software needs free documentation: a free
+program should come with manuals providing the same freedoms that the
+software does. But this License is not limited to software manuals;
+it can be used for any textual work, regardless of subject matter or
+whether it is published as a printed book. We recommend this License
+principally for works whose purpose is instruction or reference.
+</p>
+<p><b>1. APPLICABILITY AND DEFINITIONS</b>
+</p>
+<p>This License applies to any manual or other work, in any medium,
+that
+contains a notice placed by the copyright holder saying it can be
+distributed under the terms of this License. Such a notice grants a
+world-wide, royalty-free license, unlimited in duration, to use that
+work under the conditions stated herein. The "Document", below,
+refers to any such manual or work. Any member of the public is a
+licensee, and is addressed as "you". You accept the license if you
+copy, modify or distribute the work in a way requiring permission
+under copyright law.
+</p>
+<p>A "Modified Version" of the Document means any work containing the
+Document or a portion of it, either copied verbatim, or with
+modifications and/or translated into another language.
+</p>
+<p>A "Secondary Section" is a named appendix or a front-matter section
+of
+the Document that deals exclusively with the relationship of the
+publishers or authors of the Document to the Document's overall subject
+(or to related matters) and contains nothing that could fall directly
+within that overall subject. (Thus, if the Document is in part a
+textbook of mathematics, a Secondary Section may not explain any
+mathematics.) The relationship could be a matter of historical
+connection with the subject or with related matters, or of legal,
+commercial, philosophical, ethical or political position regarding
+them.
+</p>
+<p>The "Invariant Sections" are certain Secondary Sections whose titles
+are designated, as being those of Invariant Sections, in the notice
+that says that the Document is released under this License. If a
+section does not fit the above definition of Secondary then it is not
+allowed to be designated as Invariant. The Document may contain zero
+Invariant Sections. If the Document does not identify any Invariant
+Sections then there are none.
+</p>
+<p>The "Cover Texts" are certain short passages of text that are
+listed,
+as Front-Cover Texts or Back-Cover Texts, in the notice that says that
+the Document is released under this License. A Front-Cover Text may
+be at most 5 words, and a Back-Cover Text may be at most 25 words.
+</p>
+<p>A "Transparent" copy of the Document means a machine-readable copy,
+represented in a format whose specification is available to the
+general public, that is suitable for revising the document
+straightforwardly with generic text editors or (for images composed of
+pixels) generic paint programs or (for drawings) some widely available
+drawing editor, and that is suitable for input to text formatters or
+for automatic translation to a variety of formats suitable for input
+to text formatters. A copy made in an otherwise Transparent file
+format whose markup, or absence of markup, has been arranged to thwart
+or discourage subsequent modification by readers is not Transparent.
+An image format is not Transparent if used for any substantial amount
+of text. A copy that is not "Transparent" is called "Opaque".
+</p>
+<p>Examples of suitable formats for Transparent copies include plain
+ASCII without markup, Texinfo input format, LaTeX input format, SGML
+or XML using a publicly available DTD, and standard-conforming simple
+HTML, PostScript or PDF designed for human modification. Examples of
+transparent image formats include PNG, XCF and JPG. Opaque formats
+include proprietary formats that can be read and edited only by
+proprietary word processors, SGML or XML for which the DTD and/or
+processing tools are not generally available, and the
+machine-generated HTML, PostScript or PDF produced by some word
+processors for output purposes only.
+</p>
+<p>The "Title Page" means, for a printed book, the title page itself,
+plus such following pages as are needed to hold, legibly, the material
+this License requires to appear in the title page. For works in
+formats which do not have any title page as such, "Title Page" means
+the text near the most prominent appearance of the work's title,
+preceding the beginning of the body of the text.
+</p>
+<p>A section "Entitled XYZ" means a named subunit of the Document whose
+title either is precisely XYZ or contains XYZ in parentheses following
+text that translates XYZ in another language. (Here XYZ stands for a
+specific section name mentioned below, such as "Acknowledgements",
+"Dedications", "Endorsements", or "History".) To "Preserve the Title"
+of such a section when you modify the Document means that it remains a
+section "Entitled XYZ" according to this definition.
+</p>
+<p>The Document may include Warranty Disclaimers next to the notice
+which
+states that this License applies to the Document. These Warranty
+Disclaimers are considered to be included by reference in this
+License, but only as regards disclaiming warranties: any other
+implication that these Warranty Disclaimers may have is void and has
+no effect on the meaning of this License.
+</p>
+<p><b>2. VERBATIM COPYING</b>
+</p>
+<p>You may copy and distribute the Document in any medium, either
+commercially or noncommercially, provided that this License, the
+copyright notices, and the license notice saying this License applies
+to the Document are reproduced in all copies, and that you add no other
+conditions whatsoever to those of this License. You may not use
+technical measures to obstruct or control the reading or further
+copying of the copies you make or distribute. However, you may accept
+compensation in exchange for copies. If you distribute a large enough
+number of copies you must also follow the conditions in section 3.
+</p>
+<p>You may also lend copies, under the same conditions stated above,
+and
+you may publicly display copies.
+</p>
+<p><b>3. COPYING IN QUANTITY</b>
+</p>
+<p>If you publish printed copies (or copies in media that commonly have
+printed covers) of the Document, numbering more than 100, and the
+Document's license notice requires Cover Texts, you must enclose the
+copies in covers that carry, clearly and legibly, all these Cover
+Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
+the back cover. Both covers must also clearly and legibly identify
+you as the publisher of these copies. The front cover must present
+the full title with all words of the title equally prominent and
+visible. You may add other material on the covers in addition.
+Copying with changes limited to the covers, as long as they preserve
+the title of the Document and satisfy these conditions, can be treated
+as verbatim copying in other respects.
+</p>
+<p>If the required texts for either cover are too voluminous to fit
+legibly, you should put the first ones listed (as many as fit
+reasonably) on the actual cover, and continue the rest onto adjacent
+pages.
+</p>
+<p>If you publish or distribute Opaque copies of the Document numbering
+more than 100, you must either include a machine-readable Transparent
+copy along with each Opaque copy, or state in or with each Opaque copy
+a computer-network location from which the general network-using
+public has access to download using public-standard network protocols
+a complete Transparent copy of the Document, free of added material.
+If you use the latter option, you must take reasonably prudent steps,
+when you begin distribution of Opaque copies in quantity, to ensure
+that this Transparent copy will remain thus accessible at the stated
+location until at least one year after the last time you distribute an
+Opaque copy (directly or through your agents or retailers) of that
+edition to the public.
+</p>
+<p>It is requested, but not required, that you contact the authors of
+the
+Document well before redistributing any large number of copies, to give
+them a chance to provide you with an updated version of the Document.
+</p>
+<p><b>4. MODIFICATIONS</b>
+</p>
+<p>You may copy and distribute a Modified Version of the Document under
+the conditions of sections 2 and 3 above, provided that you release
+the Modified Version under precisely this License, with the Modified
+Version filling the role of the Document, thus licensing distribution
+and modification of the Modified Version to whoever possesses a copy
+of it. In addition, you must do these things in the Modified Version:
+</p>
+<blockquote>
+  <p><b>A.</b> Use in the Title Page (and on the covers, if
+any) a title distinct from that of the Document, and from those of
+previous versions (which should, if there were any, be listed in the
+History section of the Document). You may use the same title as a
+previous version if the original publisher of that version gives
+permission.</p>
+  <p><b>B.</b> List on the Title Page, as authors, one or
+more persons or entities responsible for authorship of the
+modifications in the Modified Version, together with at least five of
+the principal authors of the Document (all of its principal authors, if
+it has fewer than five), unless they release you from this requirement.</p>
+  <p><b>C.</b> State on the Title page the name of the
+publisher of the Modified Version, as the publisher.</p>
+  <p><b>D.</b> Preserve all the copyright notices of the
+Document.</p>
+  <p><b>E.</b> Add an appropriate copyright notice for your
+modifications adjacent to the other copyright notices.</p>
+  <p><b>F.</b> Include, immediately after the copyright
+notices, a license notice giving the public permission to use the
+Modified Version under the terms of this License, in the form shown in
+the Addendum below.</p>
+  <p><b>G.</b> Preserve in that license notice the full
+lists of Invariant Sections and required Cover Texts given in the
+Document's license notice.</p>
+  <p><b>H.</b> Include an unaltered copy of this License.</p>
+  <p><b>I.</b> Preserve the section Entitled "History",
+Preserve its Title, and add to it an item stating at least the title,
+year, new authors, and publisher of the Modified Version as given on
+the Title Page. If there is no section Entitled "History" in the
+Document, create one stating the title, year, authors, and publisher of
+the Document as given on its Title Page, then add an item describing
+the Modified Version as stated in the previous sentence.</p>
+  <p><b>J.</b> Preserve the network location, if any, given
+in the Document for public access to a Transparent copy of the
+Document, and likewise the network locations given in the Document for
+previous versions it was based on. These may be placed in the "History"
+section. You may omit a network location for a work that was published
+at least four years before the Document itself, or if the original
+publisher of the version it refers to gives permission.</p>
+  <p><b>K.</b> For any section Entitled "Acknowledgements"
+or "Dedications", Preserve the Title of the section, and preserve in
+the section all the substance and tone of each of the contributor
+acknowledgements and/or dedications given therein.</p>
+  <p><b>L.</b> Preserve all the Invariant Sections of the
+Document, unaltered in their text and in their titles. Section numbers
+or the equivalent are not considered part of the section titles.</p>
+  <p><b>M.</b> Delete any section Entitled "Endorsements".
+Such a section may not be included in the Modified Version.</p>
+  <p><b>N.</b> Do not retitle any existing section to be
+Entitled "Endorsements" or to conflict in title with any Invariant
+Section.</p>
+  <p><b>O.</b> Preserve any Warranty Disclaimers.</p>
+</blockquote>
+<p>
+If the Modified Version includes new front-matter sections or
+appendices that qualify as Secondary Sections and contain no material
+copied from the Document, you may at your option designate some or all
+of these sections as invariant. To do this, add their titles to the
+list of Invariant Sections in the Modified Version's license notice.
+These titles must be distinct from any other section titles.
+</p>
+<p>You may add a section Entitled "Endorsements", provided it contains
+nothing but endorsements of your Modified Version by various
+parties--for example, statements of peer review or that the text has
+been approved by an organization as the authoritative definition of a
+standard.
+</p>
+<p>You may add a passage of up to five words as a Front-Cover Text, and
+a
+passage of up to 25 words as a Back-Cover Text, to the end of the list
+of Cover Texts in the Modified Version. Only one passage of
+Front-Cover Text and one of Back-Cover Text may be added by (or
+through arrangements made by) any one entity. If the Document already
+includes a cover text for the same cover, previously added by you or
+by arrangement made by the same entity you are acting on behalf of,
+you may not add another; but you may replace the old one, on explicit
+permission from the previous publisher that added the old one.
+</p>
+<p>The author(s) and publisher(s) of the Document do not by this
+License
+give permission to use their names for publicity for or to assert or
+imply endorsement of any Modified Version.
+</p>
+<p><b>5. COMBINING DOCUMENTS</b>
+</p>
+<p>You may combine the Document with other documents released under
+this
+License, under the terms defined in section 4 above for modified
+versions, provided that you include in the combination all of the
+Invariant Sections of all of the original documents, unmodified, and
+list them all as Invariant Sections of your combined work in its
+license notice, and that you preserve all their Warranty Disclaimers.
+</p>
+<p>The combined work need only contain one copy of this License, and
+multiple identical Invariant Sections may be replaced with a single
+copy. If there are multiple Invariant Sections with the same name but
+different contents, make the title of each such section unique by
+adding at the end of it, in parentheses, the name of the original
+author or publisher of that section if known, or else a unique number.
+Make the same adjustment to the section titles in the list of
+Invariant Sections in the license notice of the combined work.
+</p>
+<p>In the combination, you must combine any sections Entitled "History"
+in the various original documents, forming one section Entitled
+"History"; likewise combine any sections Entitled "Acknowledgements",
+and any sections Entitled "Dedications". You must delete all sections
+Entitled "Endorsements."
+</p>
+<p><b>6. COLLECTIONS OF DOCUMENTS</b>
+</p>
+<p>You may make a collection consisting of the Document and other
+documents
+released under this License, and replace the individual copies of this
+License in the various documents with a single copy that is included in
+the collection, provided that you follow the rules of this License for
+verbatim copying of each of the documents in all other respects.
+</p>
+<p>You may extract a single document from such a collection, and
+distribute
+it individually under this License, provided you insert a copy of this
+License into the extracted document, and follow this License in all
+other respects regarding verbatim copying of that document.
+</p>
+<p><b>7. AGGREGATION WITH INDEPENDENT WORKS</b>
+</p>
+<p>A compilation of the Document or its derivatives with other separate
+and independent documents or works, in or on a volume of a storage or
+distribution medium, is called an "aggregate" if the copyright
+resulting from the compilation is not used to limit the legal rights
+of the compilation's users beyond what the individual works permit.
+When the Document is included in an aggregate, this License does not
+apply to the other works in the aggregate which are not themselves
+derivative works of the Document.
+</p>
+<p>If the Cover Text requirement of section 3 is applicable to these
+copies of the Document, then if the Document is less than one half of
+the entire aggregate, the Document's Cover Texts may be placed on
+covers that bracket the Document within the aggregate, or the
+electronic equivalent of covers if the Document is in electronic form.
+Otherwise they must appear on printed covers that bracket the whole
+aggregate.
+</p>
+<p><b>8. TRANSLATION</b>
+</p>
+<p>Translation is considered a kind of modification, so you may
+distribute translations of the Document under the terms of section 4.
+Replacing Invariant Sections with translations requires special
+permission from their copyright holders, but you may include
+translations of some or all Invariant Sections in addition to the
+original versions of these Invariant Sections. You may include a
+translation of this License, and all the license notices in the
+Document, and any Warranty Disclaimers, provided that you also include
+the original English version of this License and the original versions
+of those notices and disclaimers. In case of a disagreement between
+the translation and the original version of this License or a notice
+or disclaimer, the original version will prevail.
+</p>
+<p>If a section in the Document is Entitled "Acknowledgements",
+"Dedications", or "History", the requirement (section 4) to Preserve
+its Title (section 1) will typically require changing the actual
+title.
+</p>
+<p><b>9. TERMINATION</b>
+</p>
+<p>You may not copy, modify, sublicense, or distribute the Document
+except
+as expressly provided for under this License. Any other attempt to
+copy, modify, sublicense or distribute the Document is void, and will
+automatically terminate your rights under this License. However,
+parties who have received copies, or rights, from you under this
+License will not have their licenses terminated so long as such
+parties remain in full compliance.
+</p>
+<p><b>10. FUTURE REVISIONS OF THIS LICENSE</b>
+</p>
+<p>The Free Software Foundation may publish new, revised versions
+of the GNU Free Documentation License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns. See
+http://www.gnu.org/copyleft/.
+</p>
+<p>Each version of the License is given a distinguishing version
+number.
+If the Document specifies that a particular numbered version of this
+License "or any later version" applies to it, you have the option of
+following the terms and conditions either of that specified version or
+of any later version that has been published (not as a draft) by the
+Free Software Foundation. If the Document does not specify a version
+number of this License, you may choose any version ever published (not
+as a draft) by the Free Software Foundation.
+</p>
+<br><br>
+
+<hr>
+
+<br><br>
+</blockquote>
+</td>
+</tr>
+</table>
+
+<br><br>
+
+<table BORDER=0 summary="GNUGPL" >
+<tr>
+<td>
+<a NAME="GNUGPL"></a>
+<blockquote>
+<center>
+<h2><span class="function">GNU GENERAL PUBLIC LICENSE</span></H2>
+		      <p>Version 3, 29 June 2007</p>
+</center>
+
+<p>
+ Copyright (C) 2007 Free Software Foundation, Inc. http://fsf.org/
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.i
+</p>
+
+<center><b>Preamble</b></center>
+
+<p>
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+</p>
+<p>
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+</p>
+<p>
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+</p>
+<p>
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+</p>
+<p>
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+</p>
+<p>
+  Developers that use the GNU GPL protect your rights with two steps:
+</p>
+<p>
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+</p>
+<p>
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+</p>
+<p>
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+</p>
+<p>
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+</p>
+<p>
+  The precise terms and conditions for copying, distribution and
+modification follow.
+</p>
+<p>
+<center><b>TERMS AND CONDITIONS</b></center>
+
+<p><b>0. Definitions.</b></p>
+
+</p>
+<p>
+  "This License" refers to version 3 of the GNU General Public License.
+</p>
+<p>
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+</p>
+<p>
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+</p>
+<p>
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+</p>
+<p>
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+</p>
+<p>
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+</p>
+<p>
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+</p>
+<p>
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+<p><b>1. Source Code.</b></p>
+
+</p>
+<p>
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+</p>
+<p>
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+</p>
+<p>
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+</p>
+<p>
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+</p>
+<p>
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+</p>
+<p>
+  The Corresponding Source for a work in source code form is that
+same work.
+</p>
+<p>
+<b>2. Basic Permissions.</b>
+
+</p>
+<p>
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+</p>
+<p>
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+</p>
+<p>
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+</p>
+<p>
+<b>3. Protecting Users' Legal Rights From Anti-Circumvention Law.</b>
+
+</p>
+<p>
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+</p>
+<p>
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+</p>
+<p>
+<b>4. Conveying Verbatim Copies.</b>
+</p>
+<p>
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+</p>
+<p>
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+</p>
+<p>
+<b>5. Conveying Modified Source Versions.</b>
+</p>
+<p>
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+</p>
+<p>
+<blockquote>
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+</blockquote>
+</p>
+<p>
+<blockquote>
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+</blockquote>
+</p>
+<p>
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+</p>
+<p>
+<b>6. Conveying Non-Source Forms.</b>
+
+</p>
+<p>
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+</p>
+<p>
+<blockquote>
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+</blockquote>
+</p>
+<p>
+<blockquote>
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+</blockquote>
+</p>
+<p>
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+</p>
+<p>
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+</p>
+<p>
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+</p>
+<p>
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+</p>
+<p>
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+</p>
+<p>
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+</p>
+<p>
+<b>7. Additional Terms.</b>
+</p>
+<p>
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+</p>
+<p>
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+</p>
+<p>
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+</p>
+<p>
+<blockquote>
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+</blockquote>
+</p>
+<p>
+<blockquote>
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+</blockquote>
+</p>
+<p>
+<blockquote>
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+</blockquote>
+</p>
+<p>
+<blockquote>
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+</blockquote>
+</p>
+<p>
+<blockquote>
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+</blockquote>
+</p>
+<p>
+<blockquote>
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+</blockquote>
+</p>
+<p>
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+</p>
+<p>
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+</p>
+<p>
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+</p>
+<p>
+<b>8. Termination.</b>
+</p>
+<p>
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+</p>
+<p>
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+</p>
+<p>
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+</p>
+<p>
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+</p>
+<p>
+<b>9. Acceptance Not Required for Having Copies.</b>
+</p>
+<p>
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+</p>
+<p>
+<b>10. Automatic Licensing of Downstream Recipients.</b>
+</p>
+<p>
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+</p>
+<p>
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+</p>
+<p>
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+</p>
+<p>
+<b>11. Patents.</b>
+</p>
+<p>
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+</p>
+<p>
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+</p>
+<p>
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+</p>
+<p>
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+</p>
+<p>
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+</p>
+<p>
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+</p>
+<p>
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+</p>
+<p>
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+</p>
+<p>
+<b>12. No Surrender of Others' Freedom.</b>
+</p>
+<p>
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+</p>
+<p>
+<b>13. Use with the GNU Affero General Public License.</b>
+</p>
+<p>
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+</p>
+<p>
+<b>14. Revised Versions of this License.</b>
+</p>
+<p>
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+</p>
+<p>
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+</p>
+<p>
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+</p>
+<p>
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+</p>
+<p>
+<b>15. Disclaimer of Warranty.</b>
+</p>
+<p>
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+</p>
+<p>
+<b>16. Limitation of Liability.</b>
+</p>
+<p>
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+</p>
+<p>
+<b>17. Interpretation of Sections 15 and 16.</b>
+</p>
+<p>
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+</p>
+<p>
+<center><b>END OF TERMS AND CONDITIONS</b></center>
+</p>
+</blockquote>
+</td>
+</tr>
+</table>
+
+<br /><br />
+<center style="font-size: 150%">
+<span class="divider">(&nbsp;<font color="#7ba9d4">&part;</font>&nbsp;)</span>
+</center>
+<br /><br />
+
+</body>
+</html>
+
diff --git a/doc/newlispdoc-man.txt b/doc/newlispdoc-man.txt
new file mode 100644
index 0000000..4db8ecd
--- /dev/null
+++ b/doc/newlispdoc-man.txt
@@ -0,0 +1,69 @@
+newlispdoc(1)               Commandline Parameters               newlispdoc(1)
+
+
+
+NAME
+       newlispdoc - generate documentation from newLISP source comments
+
+SYNOPSIS
+       newlispdoc [-s] lisp-file1 [lisp-file2 ...]
+
+       newlispdoc [-url] urls-file
+
+DESCRIPTION
+       newlispdoc is a commandline utility written in newLISP to generate HTML
+       documentation from comments written in newLISP  source  files.  Consult
+       /usr/share/doc/newlisp/newLISPdoc.html  for  a  detailed description on
+       how to write comments usable for  newlispdoc.  The  newlispdoc  command
+       should  be  executed from inside the directory where the newLISP source
+       files can be found. The generated documetation files  will  have  .html
+       added  to the name of the source file. An index.html page is generated,
+       which is listing for each file links to all the documented functions.
+
+OPTIONS
+       -s     this option causes newlispdoc to also generate  a  syntax  high-
+              lighted  HTML  file  of  the source. A link to this file will be
+              present in the HTML documentation of this  file.  The  generated
+              file will have the added extension .src.html.
+
+       lisp-file
+              is  a  commented  newLISP source file from which a documentation
+              file will be generated.
+
+       -url   this option is used to retrieve newLISP source files  for  docu-
+              mentation from remote locations.
+
+       urls-file
+              is  a  file containing urls of newLISP source files, one url per
+              line.
+
+EXAMPLES
+       Generate all documentation form files in the current directory.
+              newlispdoc afile.lsp bfile.lsp
+
+
+       Generate documentation and syntax highlighted HTML  versions  from  all
+       lisp files in the current directory
+              newlispdoc -s *.lsp
+
+       Retrieve source files for documentation  from  remote  locations.  Each
+       file is specified on one line in urls.txt with its http:// address.
+              newlispdoc -s -url urls.txt
+
+EXIT STATUS
+       newlispdoc returns a zero exit status for normal exit or writes a usage
+       message if not enough paramneters are supplied.
+
+AUTHOR
+       Lutz Mueller <lutz@nuevatec.com>
+
+SEE ALSO
+       newlisp(1) - newlisp man page
+
+       http://www.newlisp.org/ -  the newLISP home page
+
+
+
+
+version 1.4                      January 2008                    newlispdoc(1)
+
diff --git a/doc/newlispdoc.1 b/doc/newlispdoc.1
new file mode 100644
index 0000000..4f22f30
--- /dev/null
+++ b/doc/newlispdoc.1
@@ -0,0 +1,48 @@
+.TH newlispdoc 1 "January 2008" "version 1.4" "Commandline Parameters"
+.SH NAME
+.B newlispdoc
+\- generate documentation from newLISP source comments
+.SH SYNOPSIS
+.B newlispdoc 
+[\-s] lisp\-file1 [lisp\-file2 ...]
+
+.B newlispdoc
+[\s] [\-url] urls-file
+.SH DESCRIPTION
+newlispdoc is a commandline utility written in newLISP to generate HTML documentation from comments written in newLISP source files. Consult /usr/share/doc/newlisp/newLISPdoc.html for a detailed description on how to write comments usable for newlispdoc. The newlispdoc command should be executed from inside the directory where the newLISP source files can be found. The generated documetation files will have .html added to the name of the source file. An index.html page is generated, which is listing for each file links to all the documented functions.
+.SH OPTIONS
+.TP
+\-s
+this option causes newlispdoc to also generate a syntax highlighted HTML file of the source. A link to this file will be present in the HTML documentation of this file. The generated file will have the added extension .src.html.
+.TP
+lisp\-file
+is a commented newLISP source file from which a documentation file will be generated.
+.TP
+\-url
+this option is used to retrieve newLISP source files for documentation from remote locations.
+.TP
+urls-file
+is a file containing urls of newLISP source files, one url per line.
+.SH EXAMPLES
+.TP
+Generate all documentation form files in the current directory.
+.B newlispdoc
+afile.lsp bfile.lsp
+.PP
+.TP
+Generate documentation and syntax highlighted HTML versions from all lisp files in the current directory
+.B newlispdoc
+\-s *.lsp
+.TP
+Retrieve source files for documentation from remote locations. Each file is specified on one line in urls.txt with its http:// address.
+.B newlispdoc
+\-s \-url urls.txt
+.SH EXIT STATUS
+newlispdoc returns a zero exit status for normal exit or writes a usage message if not enough paramneters are supplied.
+.SH AUTHOR
+Lutz Mueller <lutz@nuevatec.com>
+.SH SEE ALSO
+newlisp(1) \- newlisp man page
+
+http://www.newlisp.org/ \-  the newLISP home page
+
diff --git a/examples/client b/examples/client
new file mode 100755
index 0000000..9c132e5
--- /dev/null
+++ b/examples/client
@@ -0,0 +1,37 @@
+#!/usr/bin/newlisp
+
+;;  client for  client/server demo
+;;
+;;  USAGE: client hostName
+;;
+;; 'hostName' contains a string with the name or IP number
+;; of the computer running the server application
+;;
+;; The client prompts for input and sends it to the
+;; server which sends it back converted to uppercase
+;;
+;; The server has to be started first in a different
+;; terminal window or on a different computer.
+;;
+;; v 1.3
+;;
+
+(define (net-client-receive socket , buf)
+  (net-receive socket 'buf 256)
+  (print "\n" buf "\ninput:")
+  (if (= buf "bye bye!") (exit))
+  (net-send socket (read-line)))
+
+(define (client host-computer)
+  (set 'socket (net-connect host-computer 1111))
+  (if (not socket) 
+    (print "could not connect, is the server started?\n") 
+    (while true (net-client-receive socket))))
+
+(if (not (main-args 2)) 
+  (begin 
+    (print "USAGE: client hostName\n")
+    (exit)))
+
+(client (main-args 2))
+(exit)
diff --git a/examples/finger b/examples/finger
new file mode 100755
index 0000000..b68ac62
--- /dev/null
+++ b/examples/finger
@@ -0,0 +1,35 @@
+#!/usr/bin/newlisp
+#
+# v 1.1 changes for changed 'main-args'
+# v 1.2 eliminated 'net-cleanup'
+# v 1.3 replaced concat with append
+# v 1.4 direct string form of net-send, eplace name with user
+#
+
+(define (finger nameSite , socket buffer user site)
+	  (map set '(user site) (parse nameSite "@"))
+	  (set 'socket (net-connect site 79))
+	  (if (not socket)
+	  	(begin
+			(print "Could not connect\n")
+			(exit)))
+	  (if (not (net-send socket (append user "\r\n")))
+	  	(print "no connection\n")
+		(net-finger-receive socket)))
+		
+(define (net-finger-receive socket , str)
+	(if (not (net-receive socket 'str 512)) 
+		(print "Receive failed\n")
+	(print "\n" str "\n"))
+	(if socket (net-close socket)))
+
+(set 'params (main-args))
+(if (< (length params) 3) 
+  (begin 
+    (print "USAGE: finger name@host\n")
+    (exit)))
+(finger (nth 2 params))
+(exit)
+
+;eof;
+
diff --git a/examples/form.cgi b/examples/form.cgi
new file mode 100755
index 0000000..a5aab36
--- /dev/null
+++ b/examples/form.cgi
@@ -0,0 +1,36 @@
+#!/usr/bin/newlisp
+#
+# Demo of CGI 1.1 interface 
+#
+# version 1.1
+#
+# get form data from CGI STDIN parse and
+# write back to the client browser
+#
+# 
+#
+
+
+(print "Content-type: text/html\r\n\r\n")
+(println "<h3>Post or Get Variables</h3>\n")
+
+(set 'input (read-line))
+(if (not input) (set 'input (env "QUERY_STRING")))
+(if input (begin
+    (set 'vars (parse input "&"))
+    (dolist (elmnt vars) 
+	(replace "+" elmnt " ")
+	(println elmnt"<br>"))
+    (println "<p>")))
+
+#
+# command line arguments
+(print "<h3>Command line</h3>\n" (main-args) "<p>\n")
+
+#
+# print environment variables
+(println "<h3>Environment Variables</h3>")
+(dolist (e (env)) (print e "<br>"))
+(println "<br>")
+(println "CGI by newLISP v." (sys-info -2))
+(exit)
diff --git a/examples/form.html b/examples/form.html
new file mode 100644
index 0000000..fc99c8d
--- /dev/null
+++ b/examples/form.html
@@ -0,0 +1,35 @@
+<html>
+<head><title>A form to check newLISP CGI</title></head>
+<body>
+<h3>A test form for checking out the POST method in HTTP.</h3>
+<p>Change "localhost" in the action statement to the correct hostname, if trying this remotely.</p>
+<form action="form.cgi" method="POST">
+Name (text entry field) <input type="text" name="name"> <p>
+Check Me (checkbox)
+<p><input type="checkbox" name="checkMe"></p>
+<p>
+Select me (radio buttons)<br>
+<input type="radio" name=color value="Red">red<BR>
+<input type="radio" name=color value="Green">green<BR>
+<input type="radio" name=color value="Blue">blue<BR>
+</p>
+<p>
+Choose one (select)
+<select name="chooseOne">
+<option> First
+<option> Second
+<option> Third
+<option> Fourth
+</select>
+</p>
+<p>
+<p>Enter text (textarea)</p>
+<textarea name=textField rows=4 cols=40>
+</textarea>
+</p>
+<p>
+Submit It (submit) <input type="submit" value="Go">
+</p>
+</form>
+</body>
+</html>
diff --git a/examples/init.lsp.example b/examples/init.lsp.example
new file mode 100755
index 0000000..6c3feec
--- /dev/null
+++ b/examples/init.lsp.example
@@ -0,0 +1,61 @@
+;; init.lsp - newLISP initialization file
+;; gets loaded automatically on newLISP startup
+;; newLISP looks for it in: /usr/share/newlisp/init.lsp
+;;
+;; defines some useful macros, none of these
+;; are required in the other sample programs
+;; but some implement forms frequently used
+;; in other LISPs
+;;
+;; v.8.7.11
+;;
+;; fixed a wrong logic in conditional making of defun macro
+;;
+;; macro for 'defun' like in other LISPs
+;; usage: (defun foo (x y z) body1 body2 ... ) 
+;;
+;;
+(constant (global 'defun) 
+	(lambda-macro (_func-name _arguments)
+      (set _func-name (append '(lambda ) (list _arguments) (args)))))
+
+
+;; edits a function
+;;
+;; usage: (edit foo)
+;;
+;; this will open and edit window for editing
+;; a functioon called "foo". After saving and 
+;; exiting the editor newLISP will reload the
+;; function, which is also available in a file 
+;; with the same name. Only for unix like OSs
+;;
+
+(if (< (& 0xF (last (sys-info))) 5)
+  (begin
+    (define-macro (edit _func)
+	(save (string "/tmp/" _func) _func)
+	(! (string "/usr/bin/vi /tmp/" _func))
+	(load (string "/tmp/" _func)))
+    (global 'edit)))
+
+
+;; this needs an installation of lynx, a character based web browser
+;; loads very fast, quickly exit with Ctrl-C
+;;
+
+(define-macro (help func)
+   (if (primitive? (eval func))
+       (let (func-name (name func))
+            (if (ends-with func-name "?") (replace "?" func-name "p")) 
+       (!  (format "lynx /usr/share/newlisp/doc/newlisp_manual.html#%s" func-name)))
+   (format "%s is not a built-in function" (name func))))
+
+(constant (global '$HOME) (or (env "HOME") (env "USERPROFILE") (env "DOCUMENT_ROOT")))
+(if $HOME (catch (load (append $HOME "/.init.lsp")) 'error))
+
+;;;; end of file ;;;;
+
+
+          
+          
diff --git a/examples/newLISP-Excel-Import.xls b/examples/newLISP-Excel-Import.xls
new file mode 100755
index 0000000000000000000000000000000000000000..effd54b9631e099089eac3fa98082b95f9cb3969
GIT binary patch
literal 26624
zcwX&24R}=5mFK;gOeP@-LkKhwz()ueAPMsmLV`pm^AiFlB$BA8(PWZ&kda9y%uEop
z;smsdyU^l4w%THCcV#UK+Sb;s72N*lsw=Jft=evj)^>Hf+p2XxYpc$lbMJjKZzhw3
zM6}v+!kK&Dx#ynycka2r?{WN@X(#SFGW%sngR{W^AH;LOq@zg!8CU@F(UB29h{xj^
zIer>GRq#Gy9=4kS(TJFZNNt{tXhzII%tf3c+W9l+&O@BaRRE?T79vhZEJB=tI1{lL
zaS7rq#My`?h;tC<BAy{+Dd;XmEJa*^ScbR|aS`H~h~<cj1+Nv|3dBmpD#T@oHW6kQ
z?rE4ftcMW(ML_{C44@l^?JyCTi5jEHB3q!CWkx^BgB$7Rf!(h>`?-ZblnxC2=7lcj
z52XSkS~<gon0gpCLl4Wx<`MG8gF=uc(mgE?<M9(v4%bZQ{w}xxT+o1S8?1*`Sc~=G
zh7Npo!}&-V4@yCj$R<)hu#CcUV)~Sup2G6K@dcH+`Y@jQ<iU&<Su4AF6do;o%fX9A
zq@QEPT${4s{^F;zpKziVLtn-kI&3_~>gg54P8cM+uY8=~VtMdMl!v33c)eu8JjiIL
zo<+*T(o{gJ)zKG-To?*(?g@o9-+_SzXl^J%A^V-qe(z@@zQ=y+nW>rwdsYmW)w1GC
zut9b*zP;?Xl>HXquLKXVI4?1Z4UO32=*F+vC#o+?YCy#efDeKnacHrW2$fSq=Nac<
z_d}ChT2{KCV!;Ay*W$A}%e9Bj#q*5w(U{Lk3BP2$>c2FVsT8gK+$2+#HB}Bi6W5uj
zYo+O2Y0?Di3N-y_l)H$&MA1?fkDcWrVU18)S;|74T^O|rE&gJPs*jf%DJ{l1I4-PA
zO^oL)H9eL!U6SXVlN3>d!;npvs1|=j<g}P4*pLVCe{3kz;HW}$Nu$4ga&&oubod*j
zOE^p=L95TDod1vM^u?plD@LI&8HJvckxmmOmLGGHev@njOUw`_cUsKE+`^cVxzl6W
z%!L>*w<wks?`9U}I<z-GWAkhiwD+lM)JBx~({vO&QI;3#D2_ciU6bG)sTeIp0iT~~
z;N9vAu2ZjQUen%oOfthURJrbe1n;3OqbVNYWjHj4L;Xs$PgVNWfgvTL2G!oE(h&*;
zBg<NRz2Ol5jV$x}15qU!LJn2w3thpYY#bWsjRrykiY}@0#Y!Ne_|@K^FRc2p4|~-9
zkg_opRs#Klp>Q-Xut^zEuLuSrgH`@uPzem6Q17;0HHhno@}-JRu`3RxT3NmrO~+s;
z5?~4R4uvBqf_y4Qa@Xmzf*Hdkdws#6>W||z)eP@ov(R*wrmTEuv!o1dQ)Eq(_|*0{
zIFEgjEoI2!=i#p(r?%vu#(JIwWxjXt&7ZdPw4Kw%=t~%VDf`{YD6ympz(Q(ah{G_3
z95ZSY;$4jUTK3xl=OTL_4yg)a1bWf6qxG@kpMuXSv+gST#sbMW-}!Us&o=xrmMw`z
znIGM3ct0+)XTzBBKMZKnQ<j4|aP3n6F8SotJiB+B8K%H`6x2*r<{u$TVr!7U7HF;H
z6(c?M(!=BNo`%0cK)vY1nRYX-Iy&HDT<5mo3Z(O-3`GUT3Sl@+30rX$7sNGO1$Z!g
zE6NBVWh>*3j+ckia2ig-UmP+Gs-wYOv;)D0eu=G*-%sp-oH$2wCA29rO;Y57#KcEt
zL%3PCh*fnTPZZbHL^Cj&5G82F3^Y>)nmLX3K2F9cjTtO$dLrplSui~r*^@y$nb;Fe
zluS^@WD(~*V3PUX&WZO5U;zm#L(ZcvIS$!!7V+Db{|C;4pT>|jbot-eav^-%L>20U
zB+RAc%q$HFQ$U~md$#Af0%&J}?RoQg_~^69)UBQur+u6=$h+8vX<Rfpa?7&J<0hNj
zq-*k2V0FTLP91fwXaY!TU*<ZopKP7{Z{c6GP7?4j)QKY(KDE$+GmHSvAtt*II~!z)
z_8w{dd9wSj1m}r1YRB|d{EM>P{E0&WrcVpLiR}N<I{HP?vdQ%AW5yW`D1F)rptZ`$
zrcbImGJVIGaYlmzQU4PuKb7=Fon})9I+^nys%JX$qwb?W|Dm&&^z$D&C!#Z;Oy@sz
zene+L3gUbbf2{K#I!B^&qV)40IzrISfT;GW5tk#@0Pmx;#aoBC67ej=RX|(7bhZgV
zR>6tbAmY2x^&onIA6l#y^fl<NMLZX=8EE+quug=vp?e-8of5PI^(8<PLwovkt^u$C
z@gl^F5ibGSM+dkR*yam#A$BAB5PJ}Nfvtg2696_MZUWjQ0PLFpmm^Y-3?lX;4j_gQ
z2NAa*h7oDIfado@h+7e_K-`8%r#V+5UWNEs#H$f^AYKEs6NT+RlbcLfg&OcG5-g|<
zm!sc}c$-d1ZaLK5K`Ksz?{0klHu@!I7d5rh6z~sg=9cVwEwK7g_p4clpRaskR)!-X
zJ&=(5tUp%YdhWS%kNozz>y?Y&43KJ3;`**dAW3HNM1>pez#{=XV=dlf<}{j?`Cp3X
zyubL#HEFvH?akz;N@=$wd^d9+hOgp2E%y@Yq7~cL%Kq$#wb&!-u$NfHpWf#lLDT<L
zW52nY^?gc1k`7RMF@COU0g*px<VipIsaG$Aq$<d}csw&wx^>(m<K?k<I}a4eM59>y
zSUqt6X#Dittz{%JIwyJ4(;ACTy{s0J;1tt`{qlY}Q+z6w#B9%7|9OjBMh*H9@WH=P
z=1FL(W|NBrJA4=#qS0`mXDAA)a)GOBov$A~^-5_+ACB7M?8~ybG(R_YkINU4<UQ7_
ztX8Yt+E#0;s|1VHV0LFikz6R1S*_JIR}bfZc6Bh+;|og1E$xH8Ug^e0U(gs)^Zf3x
z>Wi9vJ;51gw1rjwKHA3x(;7b<F?WQA@?G9-gCS%rn$w~74+g;(RXu7ru+<<J-sl>N
zL__@n)0IY#VWOibvp;X3=P5K2&k;rDrGFOPGgIu(-t8x6e<lN`?aid^jXllEOxE5w
zVe<BdT&KqPA?<;lo}O+dK7x<S9^5mkJ-~&C6IZNc2wrm;eGxgz48c*mwbpK}1jT4B
zaHAcV!|i~4wPpwAOFz);fH|ny0ZUY~1N=OP?7%d*SF;1=kY)!UDC~e~t6V1RKwe-X
zc3=Yi|B!mR|DQrQ-T%j@r>C2VkKmKi|LuRx{eRXYr~CgYgwy?he0qAinfM4kDgEE^
zsq6pY^JBnwA~eK)zvHufgM#fe<p@sh8bl|Qv75?lrS^Ij4?iZZs=qEGY!TN7GPTz|
zz;{zn#G+Up7=!WZU@(3eZGmm+i?2d|Fc03_5bTR@iN==&<1i~2jbA2d!F};5l(ua!
z4hjYY2jfCQE@h9R8wca>ZJ>x|40Lac^UW~~EW&gvL>c%M)FM$H1Zf*;(jX$=O6PhU
z6xv0*Z}0txmr3lXFvx>c!<47<WBn9nv0oGIDqRC3panwUhat?BI;kC43-(c}c-kZ6
zN;*EwM|4f&{x1A$hxO2g?#b$m9xQCHAPM8~6Sxq=!bs@TpUe&{m7lbf9Z;NP`b~(R
zOQfIq{_)Ae>`9cr74bfyCcOU<!~_zM{_$><lul2iXGSPb^ts~zgT@i*`&bw+pxIKM
z=$U1VTYpoZsN412r4@;O>p^bw2=3bj_jglbm6k)D=mY+YiM*(1$1J@mxOZpdeqF~6
z=5iQj9@gi&jqrXN_q#f7i?s|63T}z*@TPO?Mbl0$>ywA&%yue<a}uY4_xA%5=jk?j
z*uK=ZIPF9|g#!SJi|1l><)9M2YD|uP5<6S{6D)yFSe-IzSEH6Seuz<f0lHQAv;gW5
z-LMi<;QG57e;Z&2+LBJBx1xP%!QXX)(gJIcN__2t!nI#>YlP2>zADs!X8c=#6gr_A
zV)t7V4E5ntfZc~_WT#dN#vH`IAfx&qiZ0!HNxedsCylHJ+AVc_sCuwrJ{{;<b@dR&
z)HmU;5Bgai1I)TcSotZ36dpm`$lkkXMRy~ktH_c1<b@3=)r+-Ihv~GU>%w$0N%6uq
z7Kdu6j<pR*?t#mZ*2_4WF;)-DRr)&~-^-{Wj<ouiXwBG#h9qm|LTvqY*s87QYscqy
z%tr+CreZxgke?_WEW8=ZL-9LAi8+PZc?kJK$e(OwJ>(|Z*p6}<v3)%(M{dmPa+K7F
z5-QmpDjPmkB6?8na#4~7{Np947Ib@}B({&Nja#tPt*p&7eIHN4#9NqdNbo<h2}ZOg
zCRt)uB^O<boNAu<JXW(oVmg{)pHgjplGmW4C+$!YZaI_%#iO1%7h##s#=5s-3F=Ub
zR$z(!C~<~7dK|Qe+F(ic`A!36H!tN_nZ%xxLF_C!l`kIOD{8HnL{*LuWk*pqrXT5|
zO5{|&c$_w?2&|b!IhZJ022pe6R6fk-BV1HdQdB|Oyp4)@7VEQhsI`8iSy5y>K2J{P
z#C6q`TwFJa+dGxSZ9}gl#YP!~PBk>0qI8N+ksJ-IW60}1MQOn)lJil)gZ^I}@jP!>
zbNy3We*N27FE<j6I`U;#?kT<E_$<%Cyq{Vxec{LvjsDH0-Cw%wwQsujJ-lJrjeq#r
z7LES=(-&<jU;F2EcO1EU!;4c7{Fg?5;q7nTxboj;wmkBTwd0{>^>=G@a!Dy;ywgai
zsIY1&8m>I{hCpno1q^u?xEkJh#R6Hz3j+hTnqxbJ*J01T27`?)zTO8Puz=Bsd^Lv_
zSio#-3x_UOd!x48&se~e7m4~qLG`9?3*?e45%~Q_DXewl#z3z+W5@z|dHUDNKKm;R
z<Y2Di1_`?8ZHFOT@fN>GQTQFP*JdaD_Schs$A6<gJFg|=9}23ro@o{+_(r+JZn_79
zy0<3WF)BqfuByY+e~&SY;uVSg579#~5)C)213#9iFu}ogT>1}ey7FiAv{?-gs6mIl
z>+2e$dvN=%XEC=4M%%t)`bYZ>_?TyG4*C4efu680yuG1g8BJ|z`nwD0Diytqf@>2*
zy1`G|Y}X_HJ>owIzP;#v9`Or^bW(c*;*E$mA>NF53*xPaw;}EaK41SL;+GKbK)e(2
z%ZOh=JOFfY3*f7WcO!lc@#~2HDAJ-;`a$8pSGb4Jy$|tz#KVY35FbE%5b>LWhpuux
zg!motOc(C|1!$fF@Q9#23a8&0Ca{2Hj9hN9z!YO+SXG5$%v?+KzAmKa8-=F!`3C$!
zbz48Nk`4*-rY)qv{o8|qo*iGr-WTJ2rOg-ZvtL8e&mRaTxxa40=%OR&dclUDWB)KV
zqux_TP$Q8*XyBqAQeJ#$VhJz)1@<j^912E<!k8w|zLlEyJL>UKH4?49m+qssL^ioX
z+iqJ=T}11{n~PEJq07~UourG!`W3El3yr-iJ4J8PT<J+llj23F6Ce8k*;s+%ag4sz
z7w*!Pys6y+GcyRGx0}kIv%pkQ&JN6+zN~jp4eEH^f3|>38-ChGUn&&HG{53=v_jdy
z=0mjK!b4}_{LKU<GF@z(i=nx2hHS*O`$#z)K&F|TJYpD{!uFvgc2_AKM$Y6WMlp+r
zOfy31><41}!lne)C9=FP2L_8wO$OL0ga1{d5eqa2G-JKHH=0Gayqt2;<t90|Ue3*y
z!%~qs%T$;n7qV&V&5$RrT_xwv1SuTj2LEh%7F%ZcaUv9>Sx`PsuNKOefniDK>Z`2Q
znAL8rc33OHJlAM+<BYgKDzsX08FTdldzEzo&idUeJ1<<b4i_dDws*E~kKl@>-(l};
z??6hk*Iw1p?2;FNS!o!GhWbzV=)E;u`AfUJ3L90f^|r!SH^yl4zSH}K*fi61F=^Oq
z_cYex;-uPLx!l!=s}h^l=BjjgzUEyX^ENcZ+|{uxlYO^0wtrLD*N-cVKv0czwxEn~
zC=%KjRk92<okl}Tduv^l#narpAm5^(&#JWcNDnK`fo|51V{VY9PLrR`g6TUAw;Y-!
z$#;pt4Oq`u&CXv;v>>2;!`HBd{zs_B=6oCkrt(H3yyXy09BGQrfsCvq6-l&#8IQjW
zGuZVx4TO4=+T-9ulqE8m<J~$Q8nc4xKm$OjOyNI3Ic1PshERC#;PwW}4uxa)2%t~Z
z!u10gr!0|ai1F*v(Al&Rc}k|QON&9bOuHy!m1mr1Gu0sNk@2MxObSl!OiH&CoEdoX
zbS8B?G0oC`KWS%DZ7j!U=aQd%@~R@xe8z;&EPS)gNxtGl=$wR)hiawdYJ7k#b?7z3
zZhUe|{95AV_uu$e7s#b$js70l(!xbD$u8p;H52l+aLs=JsF_Li#Z64eWBCp2Do@-$
zE0(kt!#qiv{0iC0)pShxB$DKN*y^9jm%03^5%Lub*5n6vS;tA=E>oTO$4NgX()Z(U
zYWb=Y^0gKv|Ft6il)@UB+GY1R@=u6%*^Q%!f!|{m@@o_F4H@KXXNXe@FJpWXSBX*5
z$xYDXaTD#KVE4S1_0J@Kl0%Uf$<1;_B7M?br;*P$gK=J7Mab6ZeQ};ojsCcS@3-G0
zEbh`mk1Wo8GUn5QgJ@rTGrS>leIx^vgMZnuN1}WNb~Up6P%k%UXwU9zn`DX`jVJ4i
z)7P?igYjfL@%$(<W#src?L+w|dB~S+e@y3<*h-o6q@?FemlfDmI;x(Ki9BrNH_fU1
z^qgM5@~(MuBCed2o}NxT1C;C9m-@EFkeN?|!BOnU?ny5DDa{Qsz0#D_2`%h#qo`vO
zYXfMC^R}gOvtpX~3P`h43UDBOqk8Jo@$2au(&!tqc)d1_!e6VSQ+{>}{_-@s#$TL9
zr+gCKoJJ@8683cL{-4G5i~M^1qVWB~P1l=p;irwS^!$;Y>-!;-qw^E!_2O~U_<C`w
zfzmu-;^WeZY`zlKk4G9Gl_%W}5q}I)`w7X>>xEW+R=?R?|1_XyS)`$jcSb=kPm@b9
znp~}Y$Fm<tvoqTd3jYpdZePux-fo`+D9=vjX<If;?Xp3FBshgG#nN=jEN7-`@R}hh
z!wkkm{bk}M$Y-2<uU{%-M?mY@Ap`v_$+)2`t;}$Sc52TOtMIRL)ZekrUEJ(ksGpq)
zjejCTTkLdBqGI7b>Ql%i7<=P~zZX;lO|d)>XXy#QS?9Ot{4^w%3%^1UVrIr$&iwpv
zpVYuLoX1|ewd#0kb$%!Lhs{s`i`c~l^3Q}>?Byo%7lOk3@35J@OiL>~<1l{-cwbst
zrARm7GGo8spMy<*kB<L98b5&~oxrDCi=9lpZ#8!VcaI9!$@<Q%#skc~6y7pY2f5XJ
zSk|7&IFn088yib514WkLOm?24;O{dyMPG!JGNqZ(*UB@Hz82{`w82@Sy<p4eXM#r#
zVE!Iw>GCOA2xtOItKun8zC^JvuOVEFl07K1!P$nt1Dos$l}Iy6G0=>cX6&RRM@GBf
z)e`ap?If4x=eEI6PcYD{cvN8D+EE&ZKzxqJ58CE3u)QXwIRHIMDO;VIBZE~?Q>rus
zivzxhX_0gRtyD{ua@Y0?e5lfF4_axsHljdzU|`c?Dc8~*8rTGb;lNgt5B3&pVY|^r
zb--{r+k7q#I_#!R(p+3a+Z(_a95i%D?F|E^+ZSHq9^AgavUhOp_UkKc#;OYCx*GfZ
z@)fjTkL?fpUcd$W-a6yHh;-(>&qMoAk3!4z662zq7xoP=9KLUHey+t6=vRy{_4x+O
z{-AnYetvF#?xw~ohBte1%9~@+hRy1#NJQH4WYAr{Yera|6KUF0)KC)38VW|=8J?9j
zB|EqNsT=Z2jxO~~g?feU`IY^y+%xQ1(^$ATmOE^cwm97T4FwfSqv2l{<>x;0cunl#
zT{+II0l(>?Vb^2r&I@SUZjI|`ag1*%Dr>T0rMzj6L3D9x%<Od*I;TqF9@D24{Ai`Z
z<1vi^)N%Er%6R+)I}u%?N9pfhS;vf(876c8YY*b>!j9_GpX~iN8cE4$ooxF5g!o<I
zPrdbZ1$)19B2YAm^8Yg=Z+aDH#in<_*Vxf|1AK!Wt;Y<Z^J9kDpZ|>gr73fc7Sh1u
zl59JpcN(Aq=DB1ktKzZw-5pCxUFM}OY1Ynd?R^L6C~Wm(CGE}yJJnbR9jDK3%D&aU
zF8i61%Ht(_w?9|1#Qt=N{fQF#g@eB;Iix;U;&{5m@kGg5a$YT&^~jSY*~3TA=SODH
z@uLFC5R0JId+e#<j@!*<J4`jV*6p2oe{ECwmGhlb0Pe1}NIm+g(<I=gbC>k<`<B`Y
zLQeSjyq426U)Csp>?WO*yhRt|v3E#mXvl!Fa4!_M!RQ_89Fd-Ov$H{zGs_j(b!ca2
z<L&32_vO~__uVP6TVHhh>s6jb;5Rk0K+c5`nxSc3rm&aC2zz&ouxTP^(r#bk&fr0D
z2bXv(QqrFd0daHiBGLbB;<n$*!aXPo>=P1(6OsTH3rR+hwDC9%a&&Xx6uL1peOgv#
zI<m`jK~jGbj7iFrX@2aR@?=kWa?leMM;!hdc)daL$Qi{OesAPuILcFO#N=dpsolM@
zvu%Cr>h%pfY@P1bmX_9a=xJHwUf<e|9+W{?gFoJyDo=AWR*7uj!ZD3ppRTg0%v5{V
z3)-8)O*ONWm+5J5Xrn=s=`t+kB^+W05Zd{JcKpE4%R7bR-Qe~%*HyJPlUbLkQrWRR
z<>(^ORFosO4}~x+Xm1MF33{L$S<`9<wL(4vSdQo<Mmvbn&S4VAFrpp!!4D>O4XYHP
z6_f={ajqA%p9ojK!sS_LKK{qbKV4E{dF0n<Fg?FmPnBYW2~-L@o53d1GR4U(Lq>gu
zc(YtDXzvQQJ3T|}t0k$I2auXaYN|U-BvX_(6-Jy$VD7VT*KW!uwBEv}?!Z>`OlQT7
z1CmU-qunw9jgUArA%WXPC%#Ktl%T+U83f{VP#>QiwCLlXm-y13g>7XJXkAc$%0p$#
zPot#>nx?x5e_XiK{pjlzx}zYi-t?zKdNDuIiFqSUOltMZRMlw*yvUiKhpU{V5Q<Ar
zTBoJ7p3s@de3V=+dgt<t*Yrn)%=fq1M|y-m-CoDjKzpwO8_Z0K!PWtoV>9JgyE{V9
zIl5<CI>C<FH&YQJnx_w|$4ok#daU1>T0Xsn9phs(+~}r#Er#3Pv`@Hj6P)&46=8`p
zyzQ{YQ(t;jt=DdKx!u*3j>ZO0Wp%Z~Raxt;Zme|Kme+Z`4R-4akK<}wd3i#;L;dPN
zv|gX<Ws91u0(2Za!()Wm#|U$zgz?PRi!$Wr;+jycFHMdnn6V}`IOq-yMAdCkDv%XP
z7pP&XZg;4E&=(E#1XYK<zSL3Yu-ok@6&c(utLsZwOzy3NB+&eqOepmOO~b~6Zy-8^
zA<n{<8e;o4{MPCk7=Vqe`A56sn+oOP`#1DWpOa1hTZoSfe-?OvzMV*UP}vvoCzhYu
zNzA`#7G~CFO=90_P~7F6C=^a2{qF<+#teabg}0{8+gMju(^%)xBdL3vtG=|cwz0wM
zv3k8;j!0kaM#ZUKQBz}UT+v`#VQ;V#)>4%G+)J85k*MO`7F7rQYFJq_urYLLer`ga
zZS_|<Y8`e@O|`Ys-B@R>wAtK^)Y}}DR%?URU1zgdt;-v(J_~K-S^8dplG(i+TFRq9
zeGja+Rw#*o?)+Td_cBuL8L5tRs_1L=c6)_FSYtzabq)G1&QJZ=*9UR>B>TweC^hei
z>%Q{VyRChedv7qq(lZ}?ktSZW`I9ZeoxoQZw5>+Qmiiy*aX0X{xafGFhP!Klzbi&V
zE2Ts;{dvMqUjj|{(`qI;DPc1)mR4-viO8dO{6Hc<Of|Cq3t*H9^GU;4<(Hp-`uRJm
zN-Q_shUKq#_dY8B3&2Mv3a2?2*$vuCr0+%ffq!R;-pr#i(D#g}-1OZd`lb}s1Jwtu
z->H76AM5LbcPR&(WFE-PNqiG~G<TkbU$CI|5CcrYYfpL|kZ0iu%@dIm7sMhg{)eeU
x32V?GR#oZ$cLseoE3F-sMAB?y*A>{fv6j6h$wI4GeyeKX?YalHjFMm){67l8kSzcJ

literal 0
HcwPel00001

diff --git a/examples/opengl-demo.lsp b/examples/opengl-demo.lsp
new file mode 100644
index 0000000..054552c
--- /dev/null
+++ b/examples/opengl-demo.lsp
@@ -0,0 +1,166 @@
+#!/usr/bin/newlisp
+
+# OpenGL and GLUT demo - opengl-demo.lsp
+# currently tested working only on Win32
+# Linux is untested and Mac OS X not working yet
+
+# WIn32
+# opengl32.dll - should be already on you WindowsXP installation or at www.opengl.org  
+# glut32.dll -  available here: http://www.opengl.org/resources/libraries/glut/
+# 
+# Linux/UNIX - not tested
+# libGLU.so - should be on your Linux/UNIX installation or at www.opengl.org
+# glut-3.7.so - already on your system or at:
+#     http://www.opengl.org/resources/libraries/glut/
+#
+# Mac OS X - cannot work on PPC, works well on Intel based Mac OS X
+# libGL.dylib - installed in /System/Library/Frameworks/OpenGL.Framework
+# GLUT - installed in /System/Library/Frameworks/GLUT.Framework
+#
+# for a complete function reference for OpenGL look here:
+#     http://rush3d.com/reference/opengl-bluebook-1.0/index.html
+# linked from:
+#     http://www.opengl.org/documentation/
+#
+# for descriptions and refence to GLU see here:
+#     http://www.opengl.org/resources/libraries/glut/
+#
+# Calling patterns for OpenGL functions:
+# Functions are described in the manual with the following types:
+#
+# All the following integer types are passed as is or with (int ...):
+# GLenum GLboolean GLbitfield GLbyte GLshort GLint GLsizei GLubyte GLushort GLuint
+# and types ending in: 3b, si, 3s
+#
+# The following double float types are passed as is or with (float ...):
+# GLdouble GLclampd
+# and types ending in: 3d
+#
+# The following small float types are must with (flt ...) conversion:
+# GLfloat GLclampf
+# and all types ending 3f:
+# 
+
+
+(if 
+  (= ostype "OSX") ;; drawings will be visible only on x86 based OS X (not tested)
+  (begin
+    (set 'GL_LIB "/System/Library/Frameworks/OpenGL.Framework/libraries/libGL.dylib")
+    (set 'GLUT_LIB "/System/Library/Frameworks/GLUT.Framework/GLUT")
+  )
+  (= ostype "Win32") ;; everything works
+  (begin
+    (set 'GL_LIB "opengl32.dll")
+    (set 'GLUT_LIB "glut32.dll"))
+  (= ostype "Linux") ;; not tested
+  (begin
+    (set 'GL_LIB "libGL.so")
+    (set 'GLUT_LIB "libglut.so"))
+)
+
+(import GL_LIB "glClear")
+(import GL_LIB "glClearColor")
+(import GL_LIB "glEnable")
+(import GL_LIB "glColor3d")
+(import GL_LIB "glBegin")
+(import GL_LIB "glEnd")
+(import GL_LIB "glVertex3d")
+(import GL_LIB "glFlush")
+(import GL_LIB "glFinish")
+(import GL_LIB "glRotated")
+
+(import GLUT_LIB "glutInit")
+(import GLUT_LIB "glutDisplayFunc")
+(import GLUT_LIB "glutInitWindowSize")
+(import GLUT_LIB "glutInitDisplayMode")
+(import GLUT_LIB "glutInitWindowPosition")
+(import GLUT_LIB "glutDisplayFunc")
+(import GLUT_LIB "glutKeyboardFunc")
+(import GLUT_LIB "glutMouseFunc")
+(import GLUT_LIB "glutMotionFunc")
+(import GLUT_LIB "glutIdleFunc")
+(import GLUT_LIB "glutCreateWindow")
+(import GLUT_LIB "glutCreateSubWindow")
+(import GLUT_LIB "glutMainLoop")
+(import GLUT_LIB "glutSwapBuffers")
+(import GLUT_LIB "glutPostRedisplay")
+
+(import GLUT_LIB "glutSolidCube")
+(import GLUT_LIB "glutSolidTeapot")
+(import GLUT_LIB "glutWireCube")
+(import GLUT_LIB "glutWireTeapot")
+
+(constant 'GL_COLOR_BUFFER_BIT  0x00004000)
+(constant 'GL_TRIANGLES         0x0004)
+
+(constant 'GLUT_DOUBLE 0x0002)
+(constant 'GLUT_SINGLE 0x0000)
+(constant 'GLUT_RGB 0x0000)
+(constant 'GLUT_RGBA 0x0000)
+
+(set 'argc 0)
+(set 'argv1 "")
+(set 'argv (pack "lu" argv1))
+(set 'rotx 0.0)
+(set 'roty 0.0)
+(set 'PI (mul (acos 0) 2))
+
+(define (draw) 
+	(glClear GL_COLOR_BUFFER_BIT )
+	(glRotated rotx 0.0 1.0 0.0)
+	(glRotated roty 1.0 0.0 0.0)
+	(glutWireTeapot 0.5)
+	(glutSwapBuffers)
+)
+
+(define (drawObject)
+	(glClear GL_COLOR_BUFFER_BIT )
+	(glColor3d 1.0 0.85 0.35)
+	(glBegin GL_TRIANGLES)
+	(glVertex3d 0.0 0.6 0.0)
+	(glVertex3d -0.2 -0.3 0.0)
+	(glVertex3d 0.2 -0.3 0.0)
+	(glEnd)
+)
+
+(define (rotation)
+	(set 'rotx (mod (sub rotx .01) PI))
+        (set 'roty (mod (sub roty .012) PI))
+	(sleep 30)
+	(glutPostRedisplay)
+)
+
+(define (keyboard key x y)
+	(if (= (& key 0xFF) 27) (exit)) ; 0xFF mask necessary in Win32
+	(println "key:" (& key 0xFF) " x:" x  " y:" y))
+
+(define (mouse button state x y)
+	(if (= state 0)
+		(glutIdleFunc 0) ; auto-motion off on button press
+		(glutIdleFunc (callback 4 'rotation))) ; auto-motinn on
+	(println "button: " button " state:" state " x:" x " y:" y))
+
+(define (motion x y)
+	(set 'rotx (mul (div 200 x) PI))
+	(set 'roty (mul (div 150 y) PI))
+	(glutPostRedisplay)
+	(println "x:" x  " y:" y))
+
+(glutInit (address argc) (address argv))
+(glutInitDisplayMode (| GLUT_RGB GLUT_DOUBLE ))
+(glutInitWindowSize 800 600)
+(glutInitWindowPosition 80 80)
+(set 'id (glutCreateWindow "OpenGL and newLISP - drag mouse - ESC to exit"))
+
+(glClearColor (flt 0.5) (flt 0.3) (flt 0.3) (flt 0.0))
+(glColor3d 1.0 0.85 0.35)
+
+(glutDisplayFunc (callback 0 'draw))
+;(glutDisplayFunc (callback 0 'drawObject))
+(glutKeyboardFunc (callback 1 'keyboard))
+(glutMouseFunc (callback 2 'mouse))
+(glutMotionFunc (callback 3 'motion))
+(glutIdleFunc (callback 4 'rotation))
+(glutMainLoop)
+
+;; eof
diff --git a/examples/prodcons.lsp b/examples/prodcons.lsp
new file mode 100644
index 0000000..73d0c62
--- /dev/null
+++ b/examples/prodcons.lsp
@@ -0,0 +1,53 @@
+#!/usr/bin/newlisp
+
+# prodcons.lsp -  Producer/consumer
+#
+# this program only runs on Linux/UNIX
+#
+# usage of 'fork', 'wait-pid', 'semaphore' and 'share'
+
+(if (> (& (last (sys-info)) 0xF) 4) 
+	(begin
+		(println "this will not run on Win32")
+		(exit)))
+
+
+(constant 'wait -1 'signal 1 'release 0)
+
+(define (consumer n)
+	(set 'i 0)
+	(while (< i n)
+		(semaphore cons-sem wait)
+		(println (set 'i (share data)) " <-")
+		(semaphore prod-sem signal))  
+	(exit))
+		
+(define (producer n)
+	(for (i 1 n)
+		(semaphore prod-sem wait)
+		(println "-> " (share data i))
+		(semaphore cons-sem signal))   
+	(exit))
+
+
+(define (run n)
+	(set 'data (share))	
+	(share data 0)
+
+	(set 'prod-sem (semaphore)) ; get semaphores
+	(set 'cons-sem (semaphore))
+
+	(set 'prod-pid (fork (producer n))) ; start threads
+	(set 'cons-pid (fork (consumer n)))
+	(semaphore prod-sem signal) ; get producer started
+
+	(wait-pid prod-pid) ; wait for threads to finish
+	(wait-pid cons-pid) ; 
+	(semaphore cons-sem release) ; release semaphores
+	(semaphore prod-sem release))
+
+
+(run 10)
+
+(exit)
+
diff --git a/examples/server b/examples/server
new file mode 100755
index 0000000..f85e320
--- /dev/null
+++ b/examples/server
@@ -0,0 +1,41 @@
+#!/usr/bin/newlisp
+
+;; server for client/server demo
+;;
+;; USAGE: server
+;;
+;; Start the client programm in a different
+;; terminal window or on a different computer
+;; See the 'client' file for more info.
+;;
+;; v 1.1
+;;
+
+(define (net-server-accept listenSocket)
+(while online (begin
+    (set 'connect (net-accept listenSocket)) 
+	(net-send connect "Connected!\n")
+	(while (net-server-receive connect)))))
+
+(define (net-server-receive socket , str)
+  (net-receive socket 'str 256)
+  (print "received:" str "\n")
+  (if (= str "quit") 
+   (begin 
+    (net-send socket "bye bye!") 
+    (net-close socket) nil) 
+   (net-send socket (upper-case str))))
+
+(define (server)
+  (if (not (set 'socket (net-listen 1111))) 
+   (print "Listen failed:\n" (net-error)) 
+   (begin
+	(set 'online true)
+   	(print "\nServer started\n")
+	(net-server-accept socket)
+	)))
+
+(server)
+
+; eof ;
+
diff --git a/examples/sqlite.cgi b/examples/sqlite.cgi
new file mode 100755
index 0000000..299f855
--- /dev/null
+++ b/examples/sqlite.cgi
@@ -0,0 +1,95 @@
+#!/usr/bin/newlisp
+
+;; this is a quick and dirty script for talking to your SQLite database
+;; on your webserver
+;;
+;; sqlite.cgi - version 1.0 - initial release
+;; sqlite.cgi - version 1.1 - replaced deprecated 'getenv' with 'env'
+;;
+;; requirements:
+;;
+;; (1) A 'sqlite.so' or 'sqlite.dll' library for your server platform
+;; edit the file 'sqlite.lsp' for the correct location.
+;;
+;; (2) The files 'cgi.lsp' and 'sqlite.lsp', edit the (load ...) statements
+;; below for the correct locations of these files.
+;;
+;;
+
+(print "Content-type: text/html\n\n")
+
+(load "cgi-bin/cgi.lsp")
+(load "cgi-bin/sqlite.lsp")
+
+(set 'log-file "sqlite-log.txt") 
+
+;; log access, log is only written, if log-file exists
+;;
+(set 'fle (open log-file "u"))
+(if fle (begin
+    (seek fle -1)
+    (set 'ip-no (env "REMOTE_ADDR"))
+    (unless (starts-with ip-no "99")
+      (write-line (string 
+           (date (+ (apply date-value (now)) (* 7 60 60)))
+           " - " ip-no " - " (env "HTTP_USER_AGENT")) fle))
+    (close fle)))
+
+
+(if (empty? CGI:params)
+    (set 'mode "input")
+    (set 'mode (CGI:get "mode")))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(define (display-table data)
+    (println {<table border=1>})
+    (dolist (line data)
+        (println {<tr>})
+        (dolist (cell line)
+            (println {<td>} cell {</td>}))
+        (println {</tr>}) )
+    (println {<table>}))
+
+
+
+;; get input sql ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(if (= mode "input")
+    (begin
+       (println 
+[text]
+
+<br>
+<center>
+<form action="/sqlite.cgi" method="POST">
+Enter Name of Database:&nbsp;&nbsp;<input type="text" name="database">
+<br>
+<p>Enter SQL</p>
+<textarea name="sql-str" rows=10 cols=80></textarea>
+<br>
+<input type="submit" value="Go">
+<input type="hidden" name="mode" value="sql">
+</center>
+
+[/text]
+)))
+
+(if (= mode "sql")
+    (begin
+        (println {<br>})
+	(set 'database (CGI:get "database"))
+	(set 'sql-str (CGI:get "sql-str"))
+        (SQLite:open database)
+	(set 'data (SQLite:sql sql-str))
+	(if (not data) 
+            (println (SQLite:error) {<br>}) 
+            (if (list? data)
+		(display-table data)
+		(println data)))
+
+        (println {<br>Hit the [back] button on your browser to got back<br>})))
+
+(exit)
+
+;; eof ;;
diff --git a/examples/sqlite3.cgi b/examples/sqlite3.cgi
new file mode 100755
index 0000000..edfe253
--- /dev/null
+++ b/examples/sqlite3.cgi
@@ -0,0 +1,94 @@
+#!/usr/bin/newlisp
+
+;; this is a quick and dirty script for talking to your SQLite3 database
+;; on your webserver
+;;
+;; sqlite3.cgi - version 1.0 - initial release
+;;
+;; requirements:
+;;
+;; (1) A 'libsqlite3.so' or 'sqlite3.dll' library for your server platform
+;; edit the file 'sqlite.lsp' for the correct location.
+;;
+;; (2) The files 'cgi.lsp' and 'sqlite3.lsp', edit the (load ...) statements
+;; below for the correct locations of these files.
+;;
+;;
+
+(print "Content-type: text/html\n\n")
+
+(load "cgi-bin/cgi.lsp")
+(load "cgi-bin/sqlite3.lsp")
+
+(set 'log-file "sqlite-log.txt") 
+
+;; log access, log is only written, if log-file exists
+;;
+(set 'fle (open log-file "u"))
+(if fle (begin
+    (seek fle -1)
+    (set 'ip-no (env "REMOTE_ADDR"))
+    (unless (starts-with ip-no "99")
+      (write-line (string 
+           (date (+ (apply date-value (now)) (* 7 60 60)))
+           " - " ip-no " - " (env "HTTP_USER_AGENT")) fle))
+    (close fle)))
+
+
+(if (empty? CGI:params)
+    (set 'mode "input")
+    (set 'mode (CGI:get "mode")))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(define (display-table data)
+    (println {<table border=1>})
+    (dolist (line data)
+        (println {<tr>})
+        (dolist (cell line)
+            (println {<td>} cell {</td>}))
+        (println {</tr>}) )
+    (println {<table>}))
+
+
+
+;; get input sql ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(if (= mode "input")
+    (begin
+       (println 
+[text]
+
+<br>
+<center>
+<form action="/sqlte.cgi" method="POST">
+Enter Name of Database:&nbsp;&nbsp;<input type="text" name="database">
+<br>
+<p>Enter SQL</p>
+<textarea name="sql-str" rows=10 cols=80></textarea>
+<br>
+<input type="submit" value="Go">
+<input type="hidden" name="mode" value="sql">
+</center>
+
+[/text]
+)))
+
+(if (= mode "sql")
+    (begin
+        (println {<br>})
+	(set 'database (CGI:get "database"))
+	(set 'sql-str (CGI:get "sql-str"))
+        (sql3:open database)
+	(set 'data (sql3:sql sql-str))
+	(if (not data) 
+            (println (sql3:error) {<br>}) 
+            (if (list? data)
+		(display-table data)
+		(println data)))
+
+        (println {<br>Hit the [back] button on your browser to got back<br>})))
+
+(exit)
+
+;; eof ;;
diff --git a/examples/syntax.cgi b/examples/syntax.cgi
new file mode 100755
index 0000000..aae6996
--- /dev/null
+++ b/examples/syntax.cgi
@@ -0,0 +1,193 @@
+#!/usr/bin/newlisp
+
+# comment following line out when using as CGI utilty
+# in this case files to convert which are local must end with .txt
+#(define cgi-use true)
+
+# syntax.cgi 2.1
+#
+# v.1.7 - switch for using as commandline or cgi utility
+# v.1.9 - fixed highlighting problem with escaped quotes
+# v.2.0 - fixed \r\n translation
+# v.2.1 - more compatible CGI
+#
+# formats newLISP source files with syntax highlighting in HTML
+#
+# use on the command line or as cgi file together with a webserver
+# 
+# EXAMPLE command line:
+#
+#    ./syntaxi.cgi mysource.lsp > mysource.lsp.html
+#
+# formats mysorce.lsp and redirects output to a new file mysource.lsp.html
+#
+# EXAMPLE webserver CGI (tested on Apache) local files must end in txt for security
+#
+#    http://www.mysite.com/syntax.cgi?mysource.lsp.txt
+#
+# returns mysorce.lsp HTML formatted to the requesting client (browser)
+#
+# EXAMPLE webserver CGI with other site URL
+#
+#    http://www.mysite.com/syntax.cgi?http://othersite/afile.lsp
+#
+# displays afile.lsp formateed from other site
+#
+# the following situations are not handled correctly:
+#    - nested curly braces for strings like {abd{def}ghi}
+#    - multiline quoted strings, use [text] [/text] instead
+#    - multiline braced strings, use [text] [/text] instead
+#    - comments starting with # but not starting at beginning of line
+#      use ; as comment starter when comment appears after code
+
+(if cgi-use 
+	(print "Content-type: text/html\r\n\r\n"))
+
+(define keyword-color "#0000AA")      ; newLISP keywords
+(define string-color "#008800")       ; single line quoted and braced strings
+(define long-string-color "#008800")  ; multiline for [text], [/text] tags
+(define paren-color "#AA0000")        ; parenthesis
+(define comment-color "#555555")      ; comments
+(define number-color "#665500")       ; numbers
+
+(define function-name-color "#000088")    ; not implemented yet for func in (define (func x y z) ...)
+
+(set 'keywords (map name (filter (fn (x) (primitive? (eval x))) (sort (symbols) > ))))
+(push "nil" keywords)
+(push "true" keywords)
+(set 'keyword-regex (join keywords "|"))
+(replace "?" keyword-regex "\\?")
+(replace "$" keyword-regex "\\$")
+(replace "!" keyword-regex "\\!")
+(replace "+" keyword-regex "\\+")
+(replace "*" keyword-regex "\\*")
+(replace "||" keyword-regex "|\\|")
+(set 'keyword-regex (append {(\s+|\(|\))(} keyword-regex {)(\s+|\(|\))}))
+
+(set 'file (if cgi-use 
+	(or (read-line) (env "QUERY_STRING"))
+	(main-args 2)))
+
+(if cgi-use
+  (begin 
+    (if (and (not (starts-with file "http://" nil)) (not (ends-with file ".txt")))
+	(begin
+		(println "<h3>File not allowed for viewing: " file "</h3>")
+		(exit)))
+  ))
+
+
+(if (starts-with file "http://" nil)
+	(set 'file (get-url file 10000))
+	(set 'file (read-file file )))
+
+(if (not file)
+	(begin
+		(println "<h3>Cannot find file</h3>")
+		(exit)))
+
+(define (clean-comment str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace {[text]} str "&#091&text]")
+	(replace {[/text]} str "&#091&/text]")
+)
+
+(define (format-quoted-string str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace ";" str "&#059&")
+	(replace "{" str "&#123&")
+	(replace "}" str "&#125&")
+	(replace {\} str "&#092&")
+	(replace {[text]} str "&#091&text]")
+	(replace {[/text]} str "&#091&/text]")
+	(format {<font color='%s'>%s</font>} string-color str)
+)
+
+(define (format-braced-string str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace ";" str "&#059&")
+	(replace {"} str "&#034&")
+	(replace {[text]} str "&#091&text]")
+	(replace {[/text]} str "&#091&/text]")
+	(format {<font color='%s'>%s</font>} string-color str)
+)
+
+(define (format-tagged-string str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace ";" str "&#059&")
+	(format {<font color='%s'>%s</font>} string-color str)
+)
+
+; replace special HTML characters
+(replace "\r\n" file "\n")
+(replace "&" file "&amp&")
+(replace "<(\\w)" file (append "&lt&" $1) 0)
+(replace "(\\w)>" file (append $1 "&gt&") 0)
+(replace "/>" file "/&gt&" 0)
+(replace "</" file "&lt&/" 0)
+(replace "<!" file "&lt&!" 0)
+; replace escaped quotes
+(replace  "\092\034"  file "&#092&&#034&")
+
+; color keywords
+(replace keyword-regex file (format {%s<font color='%s'>%s</font>%s} $1 keyword-color $2 $3) 0)
+
+; color numbers
+(replace {(\s+|\(|\))(0x[0-9a-fA-F]+|[+-]?\d+\.\d+|[+-]?\d+|\.\d+)} file 
+         (format {%s<font color='%s'>%s</font>} $1 number-color $2) 0)
+
+
+; color parens
+(replace "(" file (format {<font color='%s'>(</font>} paren-color))
+(replace ")" file (format {<font color='%s'>)</font>} paren-color))
+
+; color braced strings
+(replace "{.*?}" file (format-braced-string $0) 0) ; no multiline string
+; color quoted strings
+(replace {".*?"} file (format-quoted-string $0) 0) ; no multiline strings
+
+; color ;  comments
+(replace ";.*" file (clean-comment $0) 0)
+(replace ";.*" file (format {<font color='%s'>%s</font>} comment-color $0) 0)
+
+; color # comments
+(set 'buff "")
+(dolist (lne (parse file "\n"))
+	(replace "^\\s*#.*" lne  (clean-comment $0) 0)
+	(replace "^\\s*#.*" lne (format {<font color='%s'>%s</font>} comment-color $0) 0)
+	(write-line lne buff))
+(set 'file buff)
+
+; color tagged strings
+(replace {\[text\].*?\[/text\]} file (format-tagged-string $0) 4) ; handles multiline strings
+
+; xlate back special characters
+(replace "&amp&" file "&amp;")   ; ampersand
+(replace "&lt&" file "&lt;")     ; less
+(replace "&gt&" file "&gt;")     ; greater
+(replace {&#034&} file "&#034;") ; quotes
+(replace {&#059&} file "&#059;") ; semicolon
+(replace {&#123&} file "&#123;") ; left curly brace
+(replace {&#125&} file "&#125;") ; right curly brace
+(replace {&#091&} file "&#091;") ; left bracket
+(replace {&#092&} file "&#092;") ; back slash
+
+
+; add pre and post tags
+(println (append "<html><body><pre>\n" file "\n</pre>" ))
+
+(println {<center><font face='Arial' size='-2' color='#444444'>}
+         {syntax highlighting with <a href="http://newlisp.org">newLISP</a>&nbsp;}
+         {and <a href="http://newlisp.org/syntax.cgi?code/syntax-cgi.txt">syntax.cgi</a>}
+         {</font></center>})
+
+(println {</body></html>})
+
+(exit)
+
+;; eof
+
diff --git a/examples/tcltk.lsp b/examples/tcltk.lsp
new file mode 100644
index 0000000..fc6fc4e
--- /dev/null
+++ b/examples/tcltk.lsp
@@ -0,0 +1,49 @@
+#!/usr/bin/newlisp
+;
+; This demo shows how to write Tcl/Tk GUIs
+; controlled from newLISP
+;
+; newlisp-tk is not required, only newlisp
+; and a Tcl/Tk installation
+;
+
+; setup communications
+;
+(map set '(myin tcout) (pipe))
+(map set '(tcin myout) (pipe))
+(println "wait ...")
+(process "/usr/bin/wish" tcin tcout)
+
+; make GUI
+;
+(write-buffer myout 
+[text]
+wm geometry . 250x90
+wm title . "Tcl/Tk and newLISP"
+
+button .one -text {red}
+button .two -text {green}
+button .three -text {blue}
+label .colorlabel -width 25
+
+grid .one .two .three -padx 8 -row 0
+grid .colorlabel -column 0 -columnspan 3 -pady 6
+
+.one config -command {puts {(call-back "red")}}
+.two config -command {puts {(call-back "green")}}
+.three config -command {puts {(call-back "blue")}}
+
+bind . <Destroy> {puts {(exit)}}
+[/text])
+
+(define (call-back color)
+	(write-line (append ".colorlabel config -background " color) myout)
+	)
+
+
+; run event loop
+;
+(while (read-line myin)
+	(eval-string (current-line)))
+
+;; eof
diff --git a/examples/udp-client.lsp b/examples/udp-client.lsp
new file mode 100644
index 0000000..ad11f98
--- /dev/null
+++ b/examples/udp-client.lsp
@@ -0,0 +1,20 @@
+#!/usr/bin/newlisp
+
+; demo client for non-blocking UDP communications
+;
+; start the server program udp-server.lsp first
+;
+; note, that net-listen in UDP mode only binds the socket
+; to the local address, it does not 'listen' as in TCP/IP
+; v.1.0
+
+(set 'socket (net-listen 10002 "" "udp"))
+(if (not socket) (println (net-error)))
+(while (not (net-error))
+	(print "->")
+	(net-send-to "127.0.0.1" 10001 (read-line) socket)
+	(net-receive socket 'buff 255)
+	(println "=>" buff))
+
+; eof
+
diff --git a/examples/udp-server.lsp b/examples/udp-server.lsp
new file mode 100644
index 0000000..28c2b4c
--- /dev/null
+++ b/examples/udp-server.lsp
@@ -0,0 +1,22 @@
+#!/usr/bin/newlisp
+
+; demo server for non-blocking UDP communications
+;
+; start this program then start the client udp-client.lsp
+;
+; note, that net-listen in UDP mode only binds the socket
+; to the local address, it does not 'listen' as in TCP/IP
+; v.1.0
+
+(set 'socket (net-listen 10001 "localhost" "udp"))
+(if socket (println "server listening on port " 10001)
+           (println (net-error)))
+(while (not (net-error))
+	(set 'msg (net-receive-from socket 255))
+	(println "->" msg)
+        (net-send-to (nth 1 msg) (nth 2 msg) (upper-case (first msg)) socket))
+
+(exit)
+
+;; eof
+
diff --git a/examples/upload.cgi b/examples/upload.cgi
new file mode 100755
index 0000000..b0408b0
--- /dev/null
+++ b/examples/upload.cgi
@@ -0,0 +1,61 @@
+#!/usr/bin/newlisp
+#
+# Upload script v. 1.0
+# v 1.1 - changed 'integer' to 'int'
+#
+# serves POST request from upload.html
+# 
+#
+
+(define (process-upload,
+		; locals
+		len type infile outfile boundary
+		disposition filename start end size
+		bytesread buffer)
+
+	(print "Content-type: text/html\n\n")
+
+	; check for valid request header
+	(set 'len (int (env "CONTENT_LENGTH") 0))
+	(set 'type (env "CONTENT_TYPE"))
+	(if (not (find ".*multipart/form-data;.*boundary=.*" type 1))
+	      (throw-error "wrong upload format"))
+
+	; read data into intermediate file
+	(set 'infile (open "upload-file" "write"))
+	(while (!= (read-buffer (device) 'buffer 1024) 0)
+	    (write-buffer infile buffer))
+	(close infile)
+
+	; get filename and boundaries
+	(set 'infile (open "upload-file" "read"))
+	(set 'boundary (read-line infile)) ; get boundary string
+	(set 'disposition (read-line infile))
+
+	(if (not (find ".*filename=\"(.*)\".*" disposition 1))
+		(throw-error "wrong upload format"))
+	(if (= "" (set 'filename $1))
+		(throw-error "need file name")
+		(set 'filename (last (parse filename "/|\\\\" 0))))
+
+	; read from intermedeate file into permanent file
+	(while (!= "" (read-line infile)))
+	(set 'start (seek infile))
+	(set 'end (search infile boundary))
+	(set 'size (- end start 2))
+
+	(set 'outfile (open filename "write"))
+	(seek infile start)
+	(while (> size 0)
+	    (set 'bytesread (read-buffer infile 'buffer (min 1024 size)))
+	    (write-buffer outfile 'buffer bytesread)
+	    (dec 'size bytesread))
+	(close infile)
+	(close outfile)
+	(delete-file "upload-file"))
+
+(if (not (catch (process-upload) 'result))
+	(print "<h2>" (first (parse result "\\r\\n|\\n" 0)) "</h2>")
+	(print {<h2>file uploaded, click <a href="upload.html">continue</a></h2>}))
+
+(exit)
\ No newline at end of file
diff --git a/examples/upload.html b/examples/upload.html
new file mode 100644
index 0000000..5ddfa80
--- /dev/null
+++ b/examples/upload.html
@@ -0,0 +1,14 @@
+<html>
+<head><TITLE>File Upload</TITLE></head>
+
+<body>
+
+<h2>Upload File</font></h2>
+<form name="FileUpload" action="upload.cgi" 
+                        method="POST" enctype="multipart/form-data">
+<input type="file" name="uploaded_data" size="40">
+<input type="submit" value="Upload" name="submit">
+</form>
+
+</body>
+</html>
diff --git a/examples/xmlrpc.cgi b/examples/xmlrpc.cgi
new file mode 100755
index 0000000..be741ff
--- /dev/null
+++ b/examples/xmlrpc.cgi
@@ -0,0 +1,223 @@
+#!/usr/home/nuevatec/bin/newlisp
+#
+# xmlrpc.cgi - CGI script to handle XML-RPC requests
+#
+# This is similar to xmlrpc-server, but stateless as a new
+# newLISP process is invoked everytime this script is executed.
+# For a XML-RPC server maintaining state run xmlrpc-server.
+#
+# v.1.0 - 2005-01-14  Lutz Mueller
+#
+# v.1.1 - 2005-03-20
+#	method name for newLISP.evalString was listed wrong
+#
+# supports the following methods:
+#
+#    Method                   Return     Parameter
+#    ------                   ------     ---------
+#    system.listMethods       string     n/a
+#    system.methodHelp        string     string
+#    system.methodSignature   array      string
+#    newLISP.evalString       base64     base64
+#
+#
+
+(set 'version "1.0")
+
+# formatting templates for responses
+
+(set 'normal-response
+[text]<?xml version="1.0"?>
+<methodResponse>
+   <params>
+      <param>
+         <value>%s</value>
+       </param>
+    </params>
+</methodResponse>
+[/text])
+
+(set 'fault-response
+[text]<?xml version="1.0"?>
+<methodResponse>
+   <fault>
+      <value>
+         <struct>
+            <member>
+               <name>faultCode</name>
+               <value><int>%d</int></value>
+               </member>
+            <member>
+               <name>faultString</name>
+               <value><string>%s</string></value>
+            </member>
+         </struct>
+      </value>
+   </fault>
+</methodResponse>
+[/text])
+
+
+# event handler called when newLISP receives a request
+
+(define (process-post request)
+    (if (not (catch (handle request) 'page))
+	(set 'page (format fault-response 0 page)))
+    (print
+            "Content-type: text/xml\r\n"
+            "Content-length: " (length page) "\r\n\r\n"
+            page))
+
+
+(define (handle input, XML contentlength methodName params)
+    (set 'XML "")
+    (xml-type-tags nil nil nil nil)
+    (if (not (set 'XML (xml-parse input (+ 1 2 4 8 16))))
+        (begin
+            (if (not (xml-error)) 
+                (error 3 "No XML or XML is empty")
+		(error 4 (append "XML error: " 
+                                 (first (xml-error))))))
+
+        (set 'XML (first XML)))
+
+    ; get methodName and parameter section
+    (set 'm (match '(methodCall (methodName *) *) XML))
+    (if (not m)
+        (error 5 "Invalid XML-RPC format"))
+
+    (set 'methodName (first (first m)))
+    (set 'params (last m))
+
+    (case methodName
+        ("newLISP.evalString" (newLISP.evalString params))
+        ("system.listMethods" (system.listMethods))
+        ("system.methodHelp" (system.methodHelp params))
+        ("system.methodSignature" (system.methodSignature params))
+        (true (error 6 "Method name not known")))
+)
+
+(define (error no msg)
+    (throw (format fault-response no 
+        (append "newLISP XML-RPC v." version " - " msg))))
+
+
+######################### remote callable methods ##############################
+
+(define (system.listMethods)
+[text]<?xml version="1.0"?>
+<methodResponse>
+   <params>
+      <param><value><array><data>
+         <value><string>system.listMethods</string></value>
+         <value><string>system.methodHelp</string></value>
+         <value><string>system.methodSignature</string></value>
+         <value><string>newLISP.evalString</string></value>
+      </data></array></value></param>
+    </params>
+</methodResponse>
+[/text])
+    
+
+(define (system.methodHelp params, methodName)
+    (set 'methodName (nth 0 1 1 1 1 params))
+    (case methodName
+        ("system.listMethods" (format normal-response "Lists all methods implemented."))
+        ("system.methodHelp" (format normal-response "Documents a method."))
+	("system.methodSignature" (format normal-response "Shows the signatures of a method."))
+	("newLISP.evalString" (format normal-response "Evaluate a base64 encoded string."))
+        (true (error 7 "Method name in system.methodHelp not known")))
+)
+
+(define (system.methodSignature params)
+    (set 'methodName (nth 0 1 1 1 1 params))
+    (case methodName
+        ("system.listMethods" (format normal-response 
+"<array>
+  <data>
+   <value>
+    <array>
+     <data>
+      <value>array</value>
+     </data>
+    </array>
+   </value>
+ </data>
+</array>"))
+
+        ("system.methodHelp" (format normal-response 
+"<array>
+  <data>
+   <value>
+    <array>
+     <data>
+      <value>string</value>
+      <value>string</value>
+     </data>
+    </array>
+   </value>
+ </data>
+</array>"))
+
+	("system.methodSignature" (format normal-response 
+"<array>
+  <data>
+   <value>
+    <array>
+     <data>
+      <value>array</value>
+      <value>string</value>
+     </data>
+    </array>
+   </value>
+ </data>
+</array>"))
+
+	("newLISP.evalString" (format normal-response 
+"<array>
+  <data>
+   <value>
+    <array>
+     <data>
+      <value>base64</value>
+      <value>base64</value>
+     </data>
+    </array>
+   </value>
+ </data>
+</array>"))
+
+        (true (error 7 "Method name in system.methodSignature not known")))
+)
+
+(define (newLISP.evalString params, m, result)
+    (set 'm (match '((params (param (value (base64 *))))) params))
+    (if (not m) 
+        (error 8 "Invalid format for method newLISP.evalString")
+        (set 'result 
+            (string (eval-string (base64-dec (first (first m))) (error-text))))
+;;              "This function has been disabled in this demo for security reasons.")
+        (format normal-response 
+            (append "<base64>" (base64-enc result) "</base64>")) )
+)
+     
+
+########################### MAIN ENTRY POINT #######################
+
+(set 'input (read-line))
+
+(if (not input)
+    (print
+        "Content-type: text/html\r\n\r\n"
+        "<h2>newLISP XML-RPC v." version 
+        ": not a valid XML-RPC request</h2>")
+    (begin
+        (while (read-line) (write-buffer input (current-line)))
+        (process-post input))
+)
+
+
+(exit)
+
+
+# eof
diff --git a/guiserver/CHANGES b/guiserver/CHANGES
new file mode 100644
index 0000000..7eaee2b
--- /dev/null
+++ b/guiserver/CHANGES
@@ -0,0 +1,802 @@
+0.2
+    documentation corrections regarding default layout of frame and dialog
+
+    switchable look-and-feel with (gs:set-look-and-feel <str-spec>)
+    now on Windows the Windows look and feel is chosen correctly by default
+
+    speedup of interpreter 
+
+0.3
+  suppressed nullpointer error when using gs:set-look-and-feel
+
+	supppress Java error messages on Windows when shuttng down program
+
+  gs:label now can take optional width height has last parameters
+  before ann extra gs:set-size statement was necessary
+
+  width and height specified in gs:button did not work, does now
+	(note that for all other buttons/check-box an extra gs:set-size
+  must still be used to change the size, it will not be added as
+  optional parameters, as it is almost never used)
+
+	now image-button can take pressed icon path after the normal path
+	(gs:image-button 'TheButton "/local/run32.png" "/local/run32p.png")
+
+  now gs:set-color working on frames and dialogs too
+
+  font-demo.lsp showing the fonts built-in on all platforms
+
+  new gs:text-pane for HTML and RTF (future version) formatted text
+  see html-demo.lsp for a demo.
+
+0.4 
+  allow multiple re-starts from same newlisp process, this works together
+  with (gs:listen true)
+
+  parenthesis matching in text-pane and tab-size working on text-pane,
+	will only work on "text/plain" flavore of text-pane
+
+  console.lsp now remembers last directory in file dialogs save/load
+
+	console.lsp now has list boxes for browsing contexts and variables
+
+  changed split-pane syntax adding divider size, leaving out width/height
+  which can be set with extra set-size if required
+
+  combo-box and list-box life update now works and updates the screen 
+  correctly 
+
+  new gs:clear-list empties out a combo-box or list-box
+	eliminated redundant 'action' parameter on message-dialog
+
+  new confirm-dialog similar to message-dialog but 'yes', 'no' and optional 
+  'cancel' button and fires an event.
+
+0.5
+    gs:set-size now works on frames
+
+    new gs:remove-from removes one or more components from a container
+
+    new gs:select-text, gs:cut-text, gs:copy-text  and gs:paste-text
+    with suport for system clipboard, new gs:insert-text
+   
+    gs:set-background/set-color now can take a list for the r g b
+    color components
+
+    list-box now also fires event on key-entering a selection, previously only
+    on mouse-double-click
+
+    avoid Java "index out of bound messages" in parenthesis matching
+
+    restructured text-area and text-pane event:
+    (define (action-handler id code dot mark) ...)
+
+        id = name of text widget
+        code = code of character
+        dot = caret position
+        mark = selection position
+ 
+    if there is no selection then dot and mark are equal
+    if only the caret was moved then code is 65535 (16bit -1)
+
+    working logic for highlighting of cut/copy save/saveAs buttons and
+    related menu items in console.lsp
+
+    working logic of maintaining directories and filenames in commonly
+    established fashion between file operations
+
+    NOTE, console.lsp has been little tested, do not use in production,
+    no confirmation dialogs yet for overwiting files, save before new, etc.
+
+		NOTE that console.lsp is broken on Windwos because iof filepath issues
+    and CR-LF issues in parenhesis matching
+
+    many documentain fixes
+
+0.6
+    gs:set-font working on combo-box and list-box
+
+    parenthesis matching in text-pane working now on Windows too
+
+    file operations working in console.lsp on Windows
+
+    confirm dialog for new button in console when edit buffer is touched
+
+    eliminated crashes with bigger results in output area of console
+
+    context stays selected in console
+
+    console new button action will not reset current directory for file operations
+
+    request-focus now works on text-area and text-pane
+
+    eliminate Java error messages on listboxes
+
+    new gs:select-list-item selects a list box or combo box item
+
+    documentation changes for border-layout and others
+    fixed many documantatin formatting problems
+ 
+0.7
+    because of a change in gs:listen in v. 0.6 all error messages from
+    guiserver where suppresses, which made debugging difficult. Some applications
+    running in guiserver v.0.6 may fail now because error messages are enabled
+    again. E.g. misspelled or missing action handlers would cause no harm
+    in v.0.6, but will let exit an application with an error message in v.0.7.
+
+    gs:window creates a wimndow without any border and system bar. On MacOX X
+    when setting the background in such a window to 
+        (gs:set-background 'thewindow 0 0 0 0)
+    totally transparent, the window will be invisible and widgets ppaced on it
+    seem to float on the desktop (e.g. text from labels)
+
+    the second to- parameter in gs:select-text is now optional and the function
+    will select all text from the from- position to the end of the text.
+
+0.8
+	text-panes and text-areas did not scroll after ading to tab, fixed
+	added action event to gs:tabbed-pane
+    (gs:tabbed-pane <sym-id> <sym-action> <str-orientation> 
+		[<sym-widget> <sym-tab-title> ...])
+	the event reports: tabbed-pane-id tab-id tab-title.
+
+	console.lsp project renamed to  newlisp-console.lsp instead, which is a
+	multi tab lisp editor with run button and console window
+
+	in scrollable text-pane and text-area after gs:set-text will scroll
+	to the beginning, after gs:append-text will scroll to end
+
+	can use gs:set-text in the tabs of a gs:tabbed-pane	
+
+	can use gs:set-icon in the tabs of a gs:tabbed-pane
+
+	more demos: frameless-demo.lsp and clipboard-demo.lsp
+
+0.9
+    Several functions to retrieve system properties:
+    gs:get-version - gets the GUI server version number
+    gs:get-screen - gets width, height and resolution of the screen
+    gs:get-fonts - gets all fonts on the current system
+
+    The following system variables can be used after a property function has
+    been call once:
+    gs:version - the version number
+    gs:screen - list of screen parameters
+    gs:fonts - list of all fonts
+    Once a function has been callled onlyt the variables should be used
+    for efficiency
+
+    two new demos: properties-demo.lsp, allfonts-demo.lsp
+
+    increased possible text size for events from 100K to 1000M 
+    (mainly for editor)
+
+    for do-nothing buttons or or other widgets specify 'gs:no-action as 
+    action-handler
+
+0.93 First 2D canvas and mouse stuff
+   gs:set-select now working for toggle-button, radio-butoon, check-box
+
+   gs:mouse-clicked, gs:mouse-dragged, gs:mouse-moved, gs:mouse-pressed
+   and gs:mouse-released
+
+   new demos mouse-demo.lsp shapes-demo.lsp animation-demo.lsp
+
+   gs:draw-line, gs:draw-rect, gs:draw-circle
+   gs:fill-rect, gs:fill-circle (raound-rect and ellipse in next version)
+
+   gs:paint (gs:stroke for line width in next version)
+
+   gs:delete-tag to delete a tagged group of shapes
+   gs:moce-tag to move  a tagged group of shapes
+
+0.94
+   fixed message box in newlisp-edit.lsp when no c:\temp on Windows
+
+   gs:paint renamed to gs:set-paint
+
+   last gs:set-paint now gets correctly taken when now color is specified in
+   shapes or text
+ 
+   now different fonts on same canvas don't overwrite previous
+
+   documentation for draw-text had syntax in reverse
+   all graphics functions now sorted into all other Functions
+   spellchecked documentation 
+
+   lines are now movable too  
+
+   gs:set-canvas - onlye used for switching between muliple canvases
+   gs:set-translation - move coordinate origin
+   gs:set-scale - scales up or down
+   gs:set-stroke - sets drawing line width and optional cap, join and miter limit
+   gs:draw-arc - draw an arc outline
+   gs:fill-arc - paints a filled arc
+
+   new stroke-demo.lsp - shows lines and outlimes with different strokes and round
+   line ends
+
+   GUI-server signon message now contains version number. Note that in the future
+   newLISP binary installers for Mac OS X and Win32 icons will be placed in the
+   Mac OX X application folder and Win32 desktop for the newlisp-edit.lsp application.
+   Then the signon and connection messages will be unvisible. They are more thought
+   as a debugging aid duwing development.
+
+   On Mac OS X and UNIX applications can be started this way to close the terminal/shell
+   window:
+        newlisp newlisp-edit.lsp & exit
+   this places the GUI-server process into the background and closes the termonal/shell
+
+0.95
+   fixed newlisp-edit.lsp temporal directory detection (again, thanks Sleeper)
+
+   gs:move-tag did not distinguish between tags, fixed
+
+   gs:set-select can take multiple id, flag pairs, fixed
+
+   gs:split-pane divider width in split-pane did not work, fixed
+
+   new gs:draw-ellipse - draws an elllipse outline
+   new gs:fill-ellipse - fills an elllipse
+
+   new gs:set-translation of the canvas origin coordinates
+   new gs:set-rotation set the rotation of the canvas
+
+   all tag transforms below add to the affine transform matrix
+   already in the canvas 
+
+   new gs:hide-tag - hides objects of a tag group
+   new gs:scale-tag - scales an object up or down
+   new gs:translate-tag - translates the coordinate origin of a tag group
+   new gs:show-tag - shows objects of a tag group
+   new gs:rotate-tag - function for rotating objects
+   new gs:shear-tag - function for shearing objects
+
+   like gs:move-tag all other functions work on any shape, text
+   or image. 
+
+   shaped-demo.lsp modified to show funtioning of gs:hide-tag and gs:show-tag
+   via selecting or de-selecting shapes with check boxes
+
+   gs:mouse-wheel - register mouse wheel events
+
+   mouse-demo.lsp - modified to show mouse wheel events
+  
+   animaton-demo.lsp - modified to show the mouse wheel move text up/down
+
+   new rotation-demo.lsp to show rotating objects 
+   new image-demo - shows image zzomin, turning and squashing
+   new textrot-demo - shows text rotation
+
+   gs:draw-text has optional angle parameter (but can also be titled
+   using gs:rotate-tag, see sample program text-rotation.lsp)
+
+   all tag operations have optional flag to turn of screen update
+   this is recommended when using several tag commands in a batch
+   to do only one screen update at the end using gs:update
+   the default for this flag is 'true' for doing the update.
+
+   On all other systems except Mac OS X, double buffering is tried for
+   flicker free performance when animating graphics on systems other than
+   the Mac. The performance of this depends on the graphics cards used.
+   Performance was execellent on 2 Windows system I tried, one of them
+   4 years old.
+
+0.96
+   gs:scale-tag, gs:translate-tag and gs:rotate-tag add to the affine transform matrix
+   already in the canvas (it was wrongly stated before that gs:translate-tag
+   if not accumulative, but it is like all others)
+
+   Corrections in the doc about the behaviour of gs:set-translation, gs:set-scale
+   and gs:set-rotation. Again: they are all absolute, while tag operations are
+   accumulative.
+
+   rotation-demo.lsp and image-demo.lsp have been changed using gs:translate-tag
+   instead the global canvas gs:set-translation. This makes it possible to
+   rotate or scale several tags at the same time, using gs:translate-tag
+   to supply each tag group its own center (set to 0,0). This leads also
+   to better readable code. All object cooridnates to rotate or zoom are
+   best defined in reference to a 0,0 center point and then moved to their
+   pace with gs:translate-tag. See also description of gs:scale-tag in documentation.
+
+   net gs:get-font-metrics - returns width and height of a string to display
+   new gs:draw-round-rect - draw a rectangle with round corners
+   new gs:full-round-rect - fill a rectangle with round corners
+   new gs:draw-polygon - draws a polygon with 3 to N points
+   new gs:fill-polygon - fill a polygon with 3 to N points
+   new gs:set-cursor - set one of 14 cursor shapes
+
+   new cursor-demo.lsp tot show different cursor shapes
+
+0.97
+   gs:mouse-dragged fired invalid events when not defined but gs:mouse-clicked
+   was defined.
+
+   gs:mouse-pressed, gs:mouse-released and gs:mouse-clicked now take an optional
+   'true' parameter. This makes events carry a list of tags, which have been
+   affected by one of the above mouse actions. This can be used to implement
+   object dragging (see the new drag-demo.lsp) it also opens the possibility
+   of creating self-drawn custom controls on a canvas because clicks can be
+   detected on tags. The code mouse-demo.lsp has been simplified to detect
+   tags to delete by using the tag list in the mouse-clicked event.
+
+   events generated by gs:mouse-pressed, gs:mouse-released, gs:mouse-clicked
+   and gs:mouse-dragged besides the new tags spec also carry a number for
+   modifier keys, e.g. pressing ctrl or shift while clicking the mouse.
+   See the modified moused-demo.lsp.
+
+   gs:text-pane and gs:text-area now can register gs:mous-clicked events
+   in the newlisp-edit.lsp app a popup  has been implemented as a right click
+   (or ctrl-click for one-button mouse) to popup an edit menu.
+
+   new drag-demo.lsp
+
+   Point detection is implemented for closed shapes, images and text. Precise
+   deletection is done for images, text, polygons and rectangles, but for
+   circles and ellipses the whole rectangle enclosing the shape is used
+   for calculations. A precise point detection limited only to the inside
+   of the circle or ellipse will be implemented at a later time.
+
+   Images must carry width and height parameters in the gs:draw-image statement.
+   Drawn text is detected by calculating the enclosing rectangle.
+
+   new gs:draw-path - similar to polygon but the path may stay unclosed.
+   new gs:export - exports to an image file in png in RGB + alpha channel
+   format.
+
+   Note that detection will fail if scaling or translation has been used to
+   for the canvas or drawn objects involved, because mouse coordinates do
+   not sync to object coordinates in a scaled or translated coordinate
+   system.
+
+   new gs:menu-pop and gs:show-popup implements popup menus for gs:text-area,
+   gs:text-pane and gs:canvas. For a demo see newlisp-edit.lsp and
+   drag-demo.lsp
+
+   bug fixes in newlisp-edit.lsp when closing other but the last tab.
+
+0.98
+   popup menus on canvas now also working on Win32
+
+   gs:open-file had problems with file masks (changed parameter format)
+
+   new gs:frame-closed - registers an event for a closing frame or dialog
+
+   new gs:find-text - finds and selects text in a text rea or text panel widget
+
+   new gs:mouse-event - registers a general mouse-event for any component
+   see allfonts-demo.lsp, button-demo.lsp  and the Fontbook button in 
+   newlisp-edit.lsp for demo
+
+   changed some shortcut keys in newlisp-edit.lsp to be more standard conform
+
+   newlisp-edit.lsp has now text search and replace implemented
+
+   newlisp-edit.lsp now has fontselection implemented
+
+   splash screen working, see doc for new gs:dispose-splash
+
+0.99
+   gs:find-text selection now positions and highlights correctly on Win32
+
+   now showing directories on Win32 even when file view is constrained to text files:
+   .lsp .c .h .txt .java .htm .html .css .php .pl .py .rb .lisp .el .cl .cpp
+   what are other essential text formats on Win32?
+
+   graceful error recovery on most errors in GUI-server: after the error
+   message box is closed, the app will try continue and not exit as before.
+
+   better parenthesis matching performance on larger files
+   (but minor flicker on Win32)
+
+   gs:get-font-metrics got stuck on last queried value
+
+   gs:set-tab-size when used on gs:text-pane, sets the tabsize in points
+   
+   added ctrl-M to clear monitor area in newlisp-edit.lsp
+
+   find previous, undo and redo in newlisp-edit.lsp
+
+   new gs:undo-text and gs:redo-text, if no menus or code is used
+   ctrl-z and ctrl-shift-z and meta-z meta-shift-z (MacOS X) are
+   still hardwired into gs:text-pane
+
+   text widgets now also respond to the general gs:mouse-event
+
+0.991
+   Text selection was still broken on Win32 when starting out with a file containing
+   carriage returns or when entering new text. It only worked on files loded without
+   CRs even when etering new text. Now it seems to work in all situations, setting
+   a Java system property to LF only and converting text when it goes in/out.
+
+   Changed run button to auxiliary stateful newLISP process as used
+   previously in console.lsp. Now evaluation via the newLISP run button
+   is stateful unless the restart button is hit to restart the 
+   other newLISP process. If  the process exits, e.g. when closing a GUI-server
+   applications the small LED turns red. When hitting the run-newLISP button
+   and the newLISP process is down, it will get restarted automatically.
+
+   Only one GUI applocation should be started at the time from newlisp-edit.lsp
+   starting more than one is unreliable and blocked on MacOX X.
+
+   There are som unreliabilities running GUI-Server apps from newlisp-edit.lsp
+   on Win32, which have not been worked out. Text in the edit area should be saved
+   before running a GUI-server app, to be safe.
+
+ 
+0.992
+  File dialog file mask selection was broken again
+
+0.993
+
+  Eliminated flicker when matching parenthesis in bigger files.
+
+  A canvas now can be treated like any other container adding other
+  widgets to it (see demo textrot-demo.lsp).
+
+  Custom control for font coolors and size in newlisp-edit.lsp
+
+  Now newlisp-editor.lsp stays functional while a lengthy evaluation
+  process is running and outputing to the monitor area. In another tab
+  files can be edite/saved etc.
+
+  Auxiary newLISP process in newlisp-edit.lsp now starts with home directory as
+  current directory
+
+  Trying to start  a second evaluation or trying to restart the newLISP process 
+  will make the led blink in yellow for a second and output "busy" in the monitor 
+  area. 
+ 
+  Trying to quit newlisp-edit.lsp while an evaluating process is running will 
+  leave the newlisp-edit.lsp application unfunctional on the screen until the 
+  evaluating process finishes. On MacOS X the Quit option of the top screen menu
+  can be used to exit newlisp-edit.lsp in this case but on Win32 the task manager 
+  must be used to shut down newlisp-edit.lsp or the other evaluating process.
+
+0.994
+  Many fixes for running programs from the editor. There should be no possibility
+  now to hang the editor, even if a pending newLISP evaluation cannot be finished,
+  the editor should be still functional to edit and save files.
+
+  The yellow led will now stay on when a newLISP evaluation is pending to exit and
+  an attempt has been make to start a second process. When the process has finished
+  the led goes red. Attempting to start another app will do a restart automatically.
+
+  Running GUI-Server apps from newlisp-edit.lsp seems to be reliable now on MacOX X
+  and Windows XP.
+
+  new menu 'File/Save Settings' saves all font, color and current directory when
+  loading file. The settimgs file contains many more settings, which can be changed
+  to give the editor a complete diferent appearance: 
+
+  - The toolbar can be hidden completely or made floatable.
+  - The tabs can be relocated to the bottom, left or right side of the editor.
+  - The window size can be set to a desired X,Y width and height.
+
+  When newlisp-edit.lsp starts the first time and does not encounter a config file
+  it gets created in the current home directory.
+
+  File and settings saving is announced in the monitor area.
+
+  Note, the directory remembered when open the file dialog is the directory of
+  the currently open tab.
+
+  An optional icon can be added to gs:message-dialog when defining the type as "plain".
+  In this case a user supplied icon will be shown.
+
+0.995
+  newlisp-edit.lsp:
+
+  - Font size did not get saved by 'File/Save Settings'.
+
+  - settings file ion Win32 gets now written to APPDATA/newLISP/newlisp-edit.conf
+  where APPDATA is the Win32 environment variable for the applications data
+  directory. If APPDATA is not defined USERPOFILE or DOCUMENT_ROOT is assumed
+  On all other OS .newlisp-edit.conf is written to the users home directory
+  in UNIX like fashion. This may change in the future for the Mac OX X to:
+  ~/Libarary/Application Support/newLISP/newlisp-edit.conf
+
+  - The toolbar can now be detached/reattached from the View menu
+
+  - The Tool menu as a 'Save Settings' option.
+
+  - The Help menu has options to access newLISP and GUI-Server docs.
+
+  - When editing the settings file and leaving an error, the next startup
+  of newlisp-edit will give an error message box with the error.
+
+  - Ctrl-F (Win32) or meta-F (OS X) reenter the find dialog if not already
+  open (this was already in 0.994, but not mentioned).
+
+  - Pressing ESC while in find dialog text field will close the find dialog
+  this is consisten with behaviour of other Java-Swing built-in dialogs.
+  When in the edit area ctrl-D / meta-D, will still work to dispose of the 
+  find-dialog
+
+  - on Mac OS X ctrl-up will select the tab, then keys left or right will
+  let select other tabs. This is Java-Swing built-in behaviour and assumed
+  to work like this on all platforms.
+
+  New gs:menu-item-check for checked menu items (behaves like a check box)
+  
+  A new chapter about writing and debugging event handlers was added in  the 
+  guiserver.lsp.html documentation.
+
+ 0.996
+  newlisp-edit.lsp:
+
+  - settings will now remember loaction and size of newlisp-edit.lsp on the screen 
+
+  - Edit/Find marked edit buffer as dirty, which was not correct (icon and red dot)
+
+  - new menu option Edit/Goto Line
+
+  - mew menu option Files/Recent Files remembers a list of recently saved files
+  the list is automatically updated each time a file is saved and maintained in
+  the file $APPDATA/newlisp-edit-recent on Win32 or in $HOME/.newlisp-edit-recent
+  on Mac OS X and Unix
+
+  popup menus now displayed in correct position on scrollable content
+
+  gs:get-bounds was broken, now displayes on-scrren coordinates for top level windows
+
+  new gs:goto-text - positions cursor in text at row columns position
+
+  new gs:load-text, gs:save-text to directlty load/save docs in to/from gs:text-pane
+  these should not be used from Win32 because they don't work correctly with
+  CR/LF line terminated files when using Edit/Find
+
+  documentation links in the Help menu have been taken out, because browser
+  blocks guiserver.jar from exiting on Win32
+
+ 0.997
+  When using gs:load-text it now correctly filters carriage returns when
+  loading files on Win32 or any other platforms. gs:save-text will always
+  write LF line terminations. If this is not desirable, gs:get-text should
+  be used instead.
+
+  ESC in find dialog also works when cursor in replace text field. ESC will close
+  the dialog without initiaiting search action, as it did wrongly before.
+
+  demo directory accessible from the Help menu
+ 
+  Many additions and corrections to the documentaion. 
+
+0.998
+  new gs:set-syntax-selected for enabling newLISP syntax highlighting in gs:text-pane
+
+  new gs:set-caret-color for setting a caret color in in all text widgets
+
+  new gs:set-selection-color for setting a text selection color
+
+  new gs:set-syntax-colors for setting syntax colors for keywords, comments etc.
+
+  new gs:key-event to register key events for any component (except text widgets,
+  which already register keyevents by default)
+
+  syntax highlighting in newlisp-edit.lsp:
+  - 3 preconfigured themes to choose from for medium, low and high contrast
+  - alt-Y (Win32) or meta-Y (Mac OS X) toggle syntax highlighting on/off
+  - by default all files ending in .lsp are highlighted
+
+0.999
+  newlisp-edit.lsp:
+
+  - any number of syntax profiles can now be configured in the settings file and
+  loaded automatically into the View menu on startup.
+
+  - for the Tool menu scripts can be registered using the settings file. The
+  scripts are run over the content of the current edit tab. The contents of the
+  current edit tab is saved to a tmporary file, and the name of this file is passed
+  as an argument to the script. The output of the script is shown in the monitor
+  area.
+
+  - added tabulator size (in points) to settings file
+
+  - syntax on/off is remembered when switching tabs
+
+  - Edit/Get Position tells line and column positin of text cursor
+
+  - undo/redo was broken when in syntax highlighting mode. Undo/redo is now reset
+  whenever switching syntax highligthing on/off. Loading a file is not part of an
+  undoable operation anymore.
+
+  - eliminated foreground/background color options which are set as part of
+  the color theme. When syntax highlighting is tirned off, foreground and background
+  are still defined by the colors of the current theme.
+
+  - non-existing files in the recent files list are eliminated automatically
+
+  - now remembers correctly screen positions in settings file on all platforms
+
+  - eliminated black flash before splash screen display
+
+  - startup on Win32 w/o run.exe now shows hour glass cursor
+
+  - Clear Monitor disable/enable was faulty
+
+  - now highlights search text when returning to find/replace dialog
+
+  - message box when saving failed, e.g. becuase of wromg permissions
+
+  gs:set-cursor now works correctly in text widgets.
+ 
+  gs:get-bonds now works correctly for on-screen widgets
+
+1.0 feature complete for release August 15th
+
+  fixed unreliable gs:layout
+  
+  fixed occasional text blur in monitor area of newlisp-edit.lsp
+
+  new gs:get-selected-text, works like gs:get-text but retrieves selected text only
+
+  added C, C++, Java and PHP syntax highlighting, automatically selected for .c, .cpp, .h,
+  .java and .php files. When a file does not have a known extension when loading, then no 
+  syntax highlighing is selected. But when switching highlighting on via View/Syntax 
+  or meta-Y (OS X) or alt-Y (Win32), a menu pops up for selecting a highlighting mode.
+
+  some small fixes for newLISP syntax highlighting
+
+  now 2 types of scripts in Tool menu and registered in currentScripts in settings file:
+
+  - Type "content" takes the contens of the edutor and passes it as a file to the script.
+    Anything printed in the script goes to the monitor area in the editor. See the
+    program word-count.lsp for an example
+
+  - Type "selection" takes the selection of the editor and passes it as a file to the
+    script. Anyting printed from thr script replaces the selectin. If nothing
+    was selected the output og the script gets inserted at the text caret.
+
+  The selection replace/insert type of script operation can be undone using Edit/Undo.
+  In the settings file: the menu string, the script path name, the type and an
+  optional shortcut key are specified. See the settings file for an example.
+
+  The settings file gets automatically created when not present on startup
+  and registers the two scripts word-count.lsp and uppercase.lsp. The settings file
+  can be edited using the option in the Tools menu. 
+
+  before installing this version remove old settingfile on Win32:
+  $HOME/Application Data/newLISP/newlisp-edit.conf or on Mac OS X and Unix: 
+  ~/.newlisp-edit.conf
+
+1.01 August 15th release
+ 
+  In newlis-edit.lsp: changed key assignments for fonts smaller/bigger:
+	meta-minus and shift-meta-equals on Mac OS X and ctrl-minus ctrl-equals on Win32.
+  For Mac OS X this is standard, for Win32 it mimics FireFox behaviour.
+
+  The items in gs:list-box and gs:combo-box can be either given individually
+  or in a list: (gs:list-box 'TheListBox 'list-action '("a" "b" "c))
+
+  New gs:play-sound plays/streams .wav and .aif sound files.
+
+
+1.03
+  The monitor area now works also as a newLISP shell, where expressions can
+  be typed in directly and evaluated. The red/green led is not necessary
+  anymore. The shell can be restarted at any time, even if a process is running.
+  The run button will only work if the shell is present. If the shell is exited
+  by a program, hit the restart button to restart. When restarting the shell
+  while a program in it is running, the program will quit and the shell restart.
+
+  When the monitor/shell area has focus:
+    Ctrl-l clears monitor and gives shell prompt (like Meta-m/Alt-m)
+    Ctrl-p copies previous command
+  Other common readline/editing commands usual in UNIX shells may be implemented
+  in the future.
+
+  On Win32 Ctrl-l used to be "goto line" now: Alt-l
+  On Win32 Ctrl-Shift-l used to "show current line/column" now: shift-Alt-l
+
+  newLISP-edit can be exited at any time, if a process is still running in the
+  shell window it keeps on running after newLISP-edit closed.
+
+  New gs:run-shell installs a shell process in the monitor area
+  New gs:eval-shell send a string for evaluation in the shell
+  New gs:destroy-shell destroys the shell
+
+  Note that newlis-edit.lsp uses newISP as a shell process, but other shells
+  can be started using gs:run-shell.
+
+  New gs:reorder-tags reorders the stacking order of tagged images.
+  See the file drag-demo.lsp for usage (comment in gs:reorder-tags statement
+  in line 47)
+
+1.04
+  Monitor background and foreground colors are now configuable in settings file
+  do a File/Save Settings first to have the new config variables registered, then
+  Tools/Edit Settings for editing: currentMonitorBackground and currentMonitorForeground.
+
+  Fix when evaluating in shell area after Ctrl-L, Meta-M (Alt-M).
+
+  Eliminated some quirks when copying/pasting between editor and monitor/shell area, and
+  when hitting enter in the middle of an edited command.
+
+  Now full commandline history in shell-commandline when using arrow-up/down.
+
+  meta-1, meta-2 (alt-1, alt-2 on Win32) for switching between editor and shell/monitor.
+
+  More bash-shell like key bindings on UNIX: Ctrl-A beginnining of line after the
+  shell prompt , Ctrl-E end of line (in gs:text-area with shell attached).
+
+  new gs:color-tag colors all shapes with the same tag
+
+1.05
+  gs:get-text now can be called without an action handler to return the text
+  immedeately. This new synchronous mnode of gs:get-text is not recommended when
+  receiving larger text areas, as the call is blocking until all text is returned,
+  but makes coding simple data forms a lot shorter.
+
+  gs:mouse-move now can take an additional boolean parameter to indicate that
+  a list of tags are to be returned in the mouse-move event handler. The flag
+  should not be used when large amount of tags are present as it can slow down
+  performance significantly calculating and transmitting tag lists on every
+  mouse movement.
+
+  gs:key-event now also can be registered as a second key listener on text widgets.
+  This is espacially interesting on gs:text-field, where individual key action
+  could not be captured before, as the normal handler registered with gs:text-area
+  only handles the ENTER and ESC key.
+
+  fix in gs:run-shell for shells without prompts
+
+  now uses patform independent: 
+    (load (append (env "NEWLISPDIR") "/guiserver.lsp"))
+  in all demo files to load guiserver.lsp
+
+1.06
+  edit buffer did not get marked as dirty when cutting/pasting into clean buffer
+
+  when file-recent-loading->saving->file-recent-reloading the same file editor crashed
+
+  make sure shell proccesses in monitor window are destroyed when closing newlisp-edit
+
+  because of new 'process' in newlisp core full java path is needed in process statement
+  in gs:init function. Assumes /usr/bin/java
+
+1.07
+  Tcp/Ip connection between Guiserver and newLISP now goes via 127.0.0.1, not localhost
+  to avoid loss of connection when computer sleeps, while an GS application was
+  running.
+
+  when runniung editor contents and shell is dow, the shell will be restarted 
+  automatically
+
+  the editor now  loads, saves and displays UTF-8 correctly
+
+1.08
+  Guiserver now adjusts automatically to set UTF-8 on/off depending on newLISP version
+
+  The Win32 is again shipped as not UTF-8 by default.
+
+  new gs:window-moved and gs:window-resized. See new demo file move-resize-demo.lsp
+
+1.09
+  reverse "meta N" and "shift meta N" on OS X to be standard with "meta N" new window/tab
+  on OS X
+
+  gs:mouse-event now can also be used on list boxes made with gs:list-box, this makes
+  it possible to process single clicks.
+
+1.10
+  the gs:list-box event now responds on any click-count, previously only on 2 for
+  double click. Addtionally the click-count is transmitted in the event as the last
+  parameter
+
+1.11
+  replace all can now be redone, double undo not required any more for replace
+
+  new gs:undo-enable undo is currently disabled in newlisp-edit for find/replace 
+  because of instabilities
+
+1.12
+  newlisp-edit "Undo Previous" button in find dialog, this is used to undo replacements.
+  Replacements cannot be undone with normal undo when the find dialog is closed again,
+  but can only be undone from inside the find dialog
+
+1.12-13-14
+  in guiserver.lsp now checking JAVA_HOME when not Win32 or OS X
+
+1.15
+  fixed highlighing for 'pop-assoc'
diff --git a/guiserver/COPYING b/guiserver/COPYING
new file mode 100644
index 0000000..26f43a3
--- /dev/null
+++ b/guiserver/COPYING
@@ -0,0 +1,1046 @@
+Copyright information for guiserver.jar
+---------------------------------------
+
+Source code for this package copyright (c) Lutz Mueller is
+licensed under the "GNU GENERAL PUBLIC LICENSE Version 3, June 2007".
+The text of this license is contained in this file.
+
+Documentation found in this package is licensed under the
+"GNU Free Documentation License Version 1.2, November 2002".
+The text of this license is contained in this file.
+
+All icons and images are copyright (c) Michael Michaels
+under the "GNU GENERAL PUBLIC LICENSE Version 3, June 2007".
+
+Following:
+
+- GNU General Public License
+- GNU Free Documentation License
+
+---------------------------------------------------------------------
+
+
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+ 
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+  
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+		     END OF TERMS AND CONDITIONS
+
+
+-----------------------------------------------------------------------------
+
+		GNU Free Documentation License
+		  Version 1.2, November 2002
+
+
+ Copyright (C) 2000,2001,2002  Free Software Foundation, Inc.
+     51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+0. PREAMBLE
+
+The purpose of this License is to make a manual, textbook, or other
+functional and useful document "free" in the sense of freedom: to
+assure everyone the effective freedom to copy and redistribute it,
+with or without modifying it, either commercially or noncommercially.
+Secondarily, this License preserves for the author and publisher a way
+to get credit for their work, while not being considered responsible
+for modifications made by others.
+
+This License is a kind of "copyleft", which means that derivative
+works of the document must themselves be free in the same sense.  It
+complements the GNU General Public License, which is a copyleft
+license designed for free software.
+
+We have designed this License in order to use it for manuals for free
+software, because free software needs free documentation: a free
+program should come with manuals providing the same freedoms that the
+software does.  But this License is not limited to software manuals;
+it can be used for any textual work, regardless of subject matter or
+whether it is published as a printed book.  We recommend this License
+principally for works whose purpose is instruction or reference.
+
+
+1. APPLICABILITY AND DEFINITIONS
+
+This License applies to any manual or other work, in any medium, that
+contains a notice placed by the copyright holder saying it can be
+distributed under the terms of this License.  Such a notice grants a
+world-wide, royalty-free license, unlimited in duration, to use that
+work under the conditions stated herein.  The "Document", below,
+refers to any such manual or work.  Any member of the public is a
+licensee, and is addressed as "you".  You accept the license if you
+copy, modify or distribute the work in a way requiring permission
+under copyright law.
+
+A "Modified Version" of the Document means any work containing the
+Document or a portion of it, either copied verbatim, or with
+modifications and/or translated into another language.
+
+A "Secondary Section" is a named appendix or a front-matter section of
+the Document that deals exclusively with the relationship of the
+publishers or authors of the Document to the Document's overall subject
+(or to related matters) and contains nothing that could fall directly
+within that overall subject.  (Thus, if the Document is in part a
+textbook of mathematics, a Secondary Section may not explain any
+mathematics.)  The relationship could be a matter of historical
+connection with the subject or with related matters, or of legal,
+commercial, philosophical, ethical or political position regarding
+them.
+
+The "Invariant Sections" are certain Secondary Sections whose titles
+are designated, as being those of Invariant Sections, in the notice
+that says that the Document is released under this License.  If a
+section does not fit the above definition of Secondary then it is not
+allowed to be designated as Invariant.  The Document may contain zero
+Invariant Sections.  If the Document does not identify any Invariant
+Sections then there are none.
+
+The "Cover Texts" are certain short passages of text that are listed,
+as Front-Cover Texts or Back-Cover Texts, in the notice that says that
+the Document is released under this License.  A Front-Cover Text may
+be at most 5 words, and a Back-Cover Text may be at most 25 words.
+
+A "Transparent" copy of the Document means a machine-readable copy,
+represented in a format whose specification is available to the
+general public, that is suitable for revising the document
+straightforwardly with generic text editors or (for images composed of
+pixels) generic paint programs or (for drawings) some widely available
+drawing editor, and that is suitable for input to text formatters or
+for automatic translation to a variety of formats suitable for input
+to text formatters.  A copy made in an otherwise Transparent file
+format whose markup, or absence of markup, has been arranged to thwart
+or discourage subsequent modification by readers is not Transparent.
+An image format is not Transparent if used for any substantial amount
+of text.  A copy that is not "Transparent" is called "Opaque".
+
+Examples of suitable formats for Transparent copies include plain
+ASCII without markup, Texinfo input format, LaTeX input format, SGML
+or XML using a publicly available DTD, and standard-conforming simple
+HTML, PostScript or PDF designed for human modification.  Examples of
+transparent image formats include PNG, XCF and JPG.  Opaque formats
+include proprietary formats that can be read and edited only by
+proprietary word processors, SGML or XML for which the DTD and/or
+processing tools are not generally available, and the
+machine-generated HTML, PostScript or PDF produced by some word
+processors for output purposes only.
+
+The "Title Page" means, for a printed book, the title page itself,
+plus such following pages as are needed to hold, legibly, the material
+this License requires to appear in the title page.  For works in
+formats which do not have any title page as such, "Title Page" means
+the text near the most prominent appearance of the work's title,
+preceding the beginning of the body of the text.
+
+A section "Entitled XYZ" means a named subunit of the Document whose
+title either is precisely XYZ or contains XYZ in parentheses following
+text that translates XYZ in another language.  (Here XYZ stands for a
+specific section name mentioned below, such as "Acknowledgements",
+"Dedications", "Endorsements", or "History".)  To "Preserve the Title"
+of such a section when you modify the Document means that it remains a
+section "Entitled XYZ" according to this definition.
+
+The Document may include Warranty Disclaimers next to the notice which
+states that this License applies to the Document.  These Warranty
+Disclaimers are considered to be included by reference in this
+License, but only as regards disclaiming warranties: any other
+implication that these Warranty Disclaimers may have is void and has
+no effect on the meaning of this License.
+
+
+2. VERBATIM COPYING
+
+You may copy and distribute the Document in any medium, either
+commercially or noncommercially, provided that this License, the
+copyright notices, and the license notice saying this License applies
+to the Document are reproduced in all copies, and that you add no other
+conditions whatsoever to those of this License.  You may not use
+technical measures to obstruct or control the reading or further
+copying of the copies you make or distribute.  However, you may accept
+compensation in exchange for copies.  If you distribute a large enough
+number of copies you must also follow the conditions in section 3.
+
+You may also lend copies, under the same conditions stated above, and
+you may publicly display copies.
+
+
+3. COPYING IN QUANTITY
+
+If you publish printed copies (or copies in media that commonly have
+printed covers) of the Document, numbering more than 100, and the
+Document's license notice requires Cover Texts, you must enclose the
+copies in covers that carry, clearly and legibly, all these Cover
+Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
+the back cover.  Both covers must also clearly and legibly identify
+you as the publisher of these copies.  The front cover must present
+the full title with all words of the title equally prominent and
+visible.  You may add other material on the covers in addition.
+Copying with changes limited to the covers, as long as they preserve
+the title of the Document and satisfy these conditions, can be treated
+as verbatim copying in other respects.
+
+If the required texts for either cover are too voluminous to fit
+legibly, you should put the first ones listed (as many as fit
+reasonably) on the actual cover, and continue the rest onto adjacent
+pages.
+
+If you publish or distribute Opaque copies of the Document numbering
+more than 100, you must either include a machine-readable Transparent
+copy along with each Opaque copy, or state in or with each Opaque copy
+a computer-network location from which the general network-using
+public has access to download using public-standard network protocols
+a complete Transparent copy of the Document, free of added material.
+If you use the latter option, you must take reasonably prudent steps,
+when you begin distribution of Opaque copies in quantity, to ensure
+that this Transparent copy will remain thus accessible at the stated
+location until at least one year after the last time you distribute an
+Opaque copy (directly or through your agents or retailers) of that
+edition to the public.
+
+It is requested, but not required, that you contact the authors of the
+Document well before redistributing any large number of copies, to give
+them a chance to provide you with an updated version of the Document.
+
+
+4. MODIFICATIONS
+
+You may copy and distribute a Modified Version of the Document under
+the conditions of sections 2 and 3 above, provided that you release
+the Modified Version under precisely this License, with the Modified
+Version filling the role of the Document, thus licensing distribution
+and modification of the Modified Version to whoever possesses a copy
+of it.  In addition, you must do these things in the Modified Version:
+
+A. Use in the Title Page (and on the covers, if any) a title distinct
+   from that of the Document, and from those of previous versions
+   (which should, if there were any, be listed in the History section
+   of the Document).  You may use the same title as a previous version
+   if the original publisher of that version gives permission.
+B. List on the Title Page, as authors, one or more persons or entities
+   responsible for authorship of the modifications in the Modified
+   Version, together with at least five of the principal authors of the
+   Document (all of its principal authors, if it has fewer than five),
+   unless they release you from this requirement.
+C. State on the Title page the name of the publisher of the
+   Modified Version, as the publisher.
+D. Preserve all the copyright notices of the Document.
+E. Add an appropriate copyright notice for your modifications
+   adjacent to the other copyright notices.
+F. Include, immediately after the copyright notices, a license notice
+   giving the public permission to use the Modified Version under the
+   terms of this License, in the form shown in the Addendum below.
+G. Preserve in that license notice the full lists of Invariant Sections
+   and required Cover Texts given in the Document's license notice.
+H. Include an unaltered copy of this License.
+I. Preserve the section Entitled "History", Preserve its Title, and add
+   to it an item stating at least the title, year, new authors, and
+   publisher of the Modified Version as given on the Title Page.  If
+   there is no section Entitled "History" in the Document, create one
+   stating the title, year, authors, and publisher of the Document as
+   given on its Title Page, then add an item describing the Modified
+   Version as stated in the previous sentence.
+J. Preserve the network location, if any, given in the Document for
+   public access to a Transparent copy of the Document, and likewise
+   the network locations given in the Document for previous versions
+   it was based on.  These may be placed in the "History" section.
+   You may omit a network location for a work that was published at
+   least four years before the Document itself, or if the original
+   publisher of the version it refers to gives permission.
+K. For any section Entitled "Acknowledgements" or "Dedications",
+   Preserve the Title of the section, and preserve in the section all
+   the substance and tone of each of the contributor acknowledgements
+   and/or dedications given therein.
+L. Preserve all the Invariant Sections of the Document,
+   unaltered in their text and in their titles.  Section numbers
+   or the equivalent are not considered part of the section titles.
+M. Delete any section Entitled "Endorsements".  Such a section
+   may not be included in the Modified Version.
+N. Do not retitle any existing section to be Entitled "Endorsements"
+   or to conflict in title with any Invariant Section.
+O. Preserve any Warranty Disclaimers.
+
+If the Modified Version includes new front-matter sections or
+appendices that qualify as Secondary Sections and contain no material
+copied from the Document, you may at your option designate some or all
+of these sections as invariant.  To do this, add their titles to the
+list of Invariant Sections in the Modified Version's license notice.
+These titles must be distinct from any other section titles.
+
+You may add a section Entitled "Endorsements", provided it contains
+nothing but endorsements of your Modified Version by various
+parties--for example, statements of peer review or that the text has
+been approved by an organization as the authoritative definition of a
+standard.
+
+You may add a passage of up to five words as a Front-Cover Text, and a
+passage of up to 25 words as a Back-Cover Text, to the end of the list
+of Cover Texts in the Modified Version.  Only one passage of
+Front-Cover Text and one of Back-Cover Text may be added by (or
+through arrangements made by) any one entity.  If the Document already
+includes a cover text for the same cover, previously added by you or
+by arrangement made by the same entity you are acting on behalf of,
+you may not add another; but you may replace the old one, on explicit
+permission from the previous publisher that added the old one.
+
+The author(s) and publisher(s) of the Document do not by this License
+give permission to use their names for publicity for or to assert or
+imply endorsement of any Modified Version.
+
+
+5. COMBINING DOCUMENTS
+
+You may combine the Document with other documents released under this
+License, under the terms defined in section 4 above for modified
+versions, provided that you include in the combination all of the
+Invariant Sections of all of the original documents, unmodified, and
+list them all as Invariant Sections of your combined work in its
+license notice, and that you preserve all their Warranty Disclaimers.
+
+The combined work need only contain one copy of this License, and
+multiple identical Invariant Sections may be replaced with a single
+copy.  If there are multiple Invariant Sections with the same name but
+different contents, make the title of each such section unique by
+adding at the end of it, in parentheses, the name of the original
+author or publisher of that section if known, or else a unique number.
+Make the same adjustment to the section titles in the list of
+Invariant Sections in the license notice of the combined work.
+
+In the combination, you must combine any sections Entitled "History"
+in the various original documents, forming one section Entitled
+"History"; likewise combine any sections Entitled "Acknowledgements",
+and any sections Entitled "Dedications".  You must delete all sections
+Entitled "Endorsements".
+
+
+6. COLLECTIONS OF DOCUMENTS
+
+You may make a collection consisting of the Document and other documents
+released under this License, and replace the individual copies of this
+License in the various documents with a single copy that is included in
+the collection, provided that you follow the rules of this License for
+verbatim copying of each of the documents in all other respects.
+
+You may extract a single document from such a collection, and distribute
+it individually under this License, provided you insert a copy of this
+License into the extracted document, and follow this License in all
+other respects regarding verbatim copying of that document.
+
+
+7. AGGREGATION WITH INDEPENDENT WORKS
+
+A compilation of the Document or its derivatives with other separate
+and independent documents or works, in or on a volume of a storage or
+distribution medium, is called an "aggregate" if the copyright
+resulting from the compilation is not used to limit the legal rights
+of the compilation's users beyond what the individual works permit.
+When the Document is included in an aggregate, this License does not
+apply to the other works in the aggregate which are not themselves
+derivative works of the Document.
+
+If the Cover Text requirement of section 3 is applicable to these
+copies of the Document, then if the Document is less than one half of
+the entire aggregate, the Document's Cover Texts may be placed on
+covers that bracket the Document within the aggregate, or the
+electronic equivalent of covers if the Document is in electronic form.
+Otherwise they must appear on printed covers that bracket the whole
+aggregate.
+
+
+8. TRANSLATION
+
+Translation is considered a kind of modification, so you may
+distribute translations of the Document under the terms of section 4.
+Replacing Invariant Sections with translations requires special
+permission from their copyright holders, but you may include
+translations of some or all Invariant Sections in addition to the
+original versions of these Invariant Sections.  You may include a
+translation of this License, and all the license notices in the
+Document, and any Warranty Disclaimers, provided that you also include
+the original English version of this License and the original versions
+of those notices and disclaimers.  In case of a disagreement between
+the translation and the original version of this License or a notice
+or disclaimer, the original version will prevail.
+
+If a section in the Document is Entitled "Acknowledgements",
+"Dedications", or "History", the requirement (section 4) to Preserve
+its Title (section 1) will typically require changing the actual
+title.
+
+
+9. TERMINATION
+
+You may not copy, modify, sublicense, or distribute the Document except
+as expressly provided for under this License.  Any other attempt to
+copy, modify, sublicense or distribute the Document is void, and will
+automatically terminate your rights under this License.  However,
+parties who have received copies, or rights, from you under this
+License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+
+10. FUTURE REVISIONS OF THIS LICENSE
+
+The Free Software Foundation may publish new, revised versions
+of the GNU Free Documentation License from time to time.  Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.  See
+http://www.gnu.org/copyleft/.
+
+Each version of the License is given a distinguishing version number.
+If the Document specifies that a particular numbered version of this
+License "or any later version" applies to it, you have the option of
+following the terms and conditions either of that specified version or
+of any later version that has been published (not as a draft) by the
+Free Software Foundation.  If the Document does not specify a version
+number of this License, you may choose any version ever published (not
+as a draft) by the Free Software Foundation.
+
+
+ADDENDUM: How to use this License for your documents
+
+To use this License in a document you have written, include a copy of
+the License in the document and put the following copyright and
+license notices just after the title page:
+
+    Copyright (c)  YEAR  YOUR NAME.
+    Permission is granted to copy, distribute and/or modify this document
+    under the terms of the GNU Free Documentation License, Version 1.2
+    or any later version published by the Free Software Foundation;
+    with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
+    A copy of the license is included in the section entitled "GNU
+    Free Documentation License".
+
+If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
+replace the "with...Texts." line with this:
+
+    with the Invariant Sections being LIST THEIR TITLES, with the
+    Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST.
+
+If you have Invariant Sections without Cover Texts, or some other
+combination of the three, merge those two alternatives to suit the
+situation.
+
+If your document contains nontrivial examples of program code, we
+recommend releasing these examples in parallel under your choice of
+free software license, such as the GNU General Public License,
+to permit their use in free software.
+
+---------------------------------------------------------------------
diff --git a/guiserver/Makefile b/guiserver/Makefile
new file mode 100644
index 0000000..cd9b96a
--- /dev/null
+++ b/guiserver/Makefile
@@ -0,0 +1,18 @@
+# this make file is only used during development
+# the main makefile in the newlisp-x.x.x/ will
+# normally peform the installation below
+
+all:
+	javac java/*.java
+	mv java/*.class .
+	jar cmf Manifest guiserver.jar *.class images/*.png
+	rm *.class
+
+install:
+	-install -d  /usr/share/newlisp/guiserver
+	-install -d  /usr/share/doc/newlisp/guiserver
+	-install -m 644 guiserver.jar /usr/share/newlisp/
+	-install -m 644 guiserver.lsp /usr/share/newlisp/
+	-install -m 644 index.html /usr/share/doc/newlisp/guiserver/
+	-install -m 644 guiserver.lsp.html /usr/share/doc/newlisp/guiserver/
+	-install -m 755 newlisp-edit.lsp /usr/bin/newlisp-edit
diff --git a/guiserver/Manifest b/guiserver/Manifest
new file mode 100644
index 0000000..0ec706d
--- /dev/null
+++ b/guiserver/Manifest
@@ -0,0 +1 @@
+Main-Class: guiserver
diff --git a/guiserver/allfonts-demo.lsp b/guiserver/allfonts-demo.lsp
new file mode 100644
index 0000000..8e8305a
--- /dev/null
+++ b/guiserver/allfonts-demo.lsp
@@ -0,0 +1,43 @@
+#!/usr/bin/newlisp
+;;
+;; allfonts-demo.lsp - show all fonts on the system
+;; this program also demonstrates that strings can be used instead 
+;; of symbols for widget names (label in this case)
+
+;;;; initialization
+(set-locale "C")
+
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+;(gs:set-trace true)
+;;;; describe the GUI
+(gs:frame 'AllFontsDemo 100 100 500 400)
+(gs:set-background 'AllFontsDemo 1 1 1)
+(gs:get-fonts)
+(gs:panel 'FontPanel)
+(gs:set-grid-layout 'FontPanel (length gs:fonts) 1 0 0)
+(gs:set-text 'AllFontsDemo (string "All " (length gs:fonts) " fonts on this system"))
+(dolist (font gs:fonts)
+	(set 'font-label (string "label-" $idx))
+	(gs:label font-label font)
+	(gs:set-size font-label 100 30)
+	(gs:set-font font-label font 24 "plain")
+	(gs:mouse-event font-label 'mouse-action)
+	(gs:add-to 'FontPanel font-label))
+
+(gs:scroll-pane 'Scroll 'FontPanel)
+(gs:add-to 'AllFontsDemo 'Scroll)
+(gs:set-visible 'AllFontsDemo true)
+
+
+(define (mouse-action id type x y button cnt mods)
+	(gs:set-text 'AllFontsDemo 
+		(format "%s %s %d:%d button:%d count:%d mod-key:%d" id type x y button cnt mods))
+)
+;;;; listen for incoming action requests and dispatch
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/animation-demo.lsp b/guiserver/animation-demo.lsp
new file mode 100644
index 0000000..47065aa
--- /dev/null
+++ b/guiserver/animation-demo.lsp
@@ -0,0 +1,57 @@
+#!/usr/bin/newlisp
+;;
+;; animation-demo.lsp - demonstrate gs:move-tag for making animations
+;; and the mouse-wheel moving a text object
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+;;;; describe the GUI
+(gs:frame 'AnimationDemo 100 100 400 300 "Animation ~ 30 frames/sec, 5  pixel/step")
+(gs:set-resizable 'AnimationDemo nil)
+(gs:canvas 'MyCanvas)
+(gs:set-background 'MyCanvas gs:white)
+(gs:mouse-wheel 'MyCanvas 'mouse-wheel-action)
+(gs:add-to 'AnimationDemo 'MyCanvas)
+
+(set 'Ty 140)
+(gs:set-font 'MyCanvas "Lucida Sans Oblique" 16 "plain")
+(gs:draw-text 'T "turn the mouse wheel to move this text" 20 Ty)
+(gs:fill-circle 'C 50 40 25 gs:red)
+(gs:fill-circle 'C 30 20 15 gs:black)
+(gs:fill-circle 'C 70 20 15 gs:black)
+(gs:fill-circle 'C 50 48 6 gs:yellow)
+
+(gs:set-visible 'AnimationDemo true)
+
+
+(define (mouse-wheel-action x y wheel)
+        (if (= ostype "OSX")
+                (gs:move-tag 'T 0 (* wheel wheel (sgn wheel)))
+                (gs:move-tag 'T 0 (* 5 wheel)))
+)
+
+(set 'delay 33000) ;;
+
+(while (gs:check-event delay)
+	(dotimes (x 60)
+		(gs:check-event delay)
+		(gs:move-tag 'C 5 0))
+	(dotimes (x 40)
+		(gs:check-event delay)
+		(gs:move-tag 'C 0 5))
+	(dotimes (x 60)
+		(gs:check-event delay)
+		(gs:move-tag 'C -5 0))
+	(dotimes (x 40)
+		(gs:check-event delay)
+		(gs:move-tag 'C 0 -5))
+)
+
+(exit)
+
+;; eof
+
diff --git a/guiserver/border-layout-demo.lsp b/guiserver/border-layout-demo.lsp
new file mode 100644
index 0000000..89b42e6
--- /dev/null
+++ b/guiserver/border-layout-demo.lsp
@@ -0,0 +1,32 @@
+#!/usr/bin/newlisp
+;;
+;; border-demo.lsp - demonstrate the border layout
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+
+;;;; describe the GUI
+(gs:frame 'BorderDemo 100 100 400 300 "Border layout demo")
+(gs:set-border-layout 'BorderDemo 0 0)
+(gs:panel 'NorthPanel 50 50)
+(gs:set-color 'NorthPanel 0.5 0 0)
+(gs:panel 'WestPanel 50 50)
+(gs:set-color 'WestPanel 0.5 0.5 0)
+(gs:panel 'CenterPanel 50 50)
+(gs:set-color 'CenterPanel 0.0 0.5 0)
+(gs:panel 'EastPanel 50 50)
+(gs:set-color 'EastPanel 0.0 0.5 0.5)
+(gs:panel 'SouthPanel 50 50)
+(gs:set-color 'SouthPanel 0.0 0 0.5)
+(gs:add-to 'BorderDemo 'NorthPanel "north" 'WestPanel "west" 'CenterPanel "center" 
+			'EastPanel "east" 'SouthPanel "south")
+(gs:set-visible 'BorderDemo true)
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/button-demo.lsp b/guiserver/button-demo.lsp
new file mode 100644
index 0000000..7244dad
--- /dev/null
+++ b/guiserver/button-demo.lsp
@@ -0,0 +1,36 @@
+#!/usr/bin/newlisp
+;;
+; button-demo.lsp - demonstrate the button control
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+(gs:set-trace true)
+
+;;;; describe the GUI
+(gs:frame 'ButtonDemo 100 100 400 300 "Click on button or color panel")
+(gs:set-resizable 'ButtonDemo nil)
+(gs:panel 'ColorPanel 360 200)
+(gs:set-background 'ColorPanel '(0 1 0) 0.2)
+(gs:button 'aButton 'button-action "color")
+(gs:set-flow-layout 'ButtonDemo "center" 2 15)
+(gs:add-to 'ButtonDemo 'ColorPanel 'aButton)
+(gs:set-visible 'ButtonDemo true)
+
+(gs:mouse-event 'ColorPanel 'mouse-action)
+
+;;;; define actions
+(define (button-action id)
+	(gs:set-color 'ColorPanel (random) (random) (random)))
+
+(define (mouse-action id type x y button cnt mods)
+	(gs:set-text 'ButtonDemo (format "%8s  %3d:%3d %d %d %2d" type x  y button cnt mods))
+)
+
+;;;; listen for incoming action requests and dispatch
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/clipboard-demo.lsp b/guiserver/clipboard-demo.lsp
new file mode 100644
index 0000000..6e3c9f8
--- /dev/null
+++ b/guiserver/clipboard-demo.lsp
@@ -0,0 +1,27 @@
+#!/usr/bin/newlisp
+;;
+;; clipboard-demo.lsp - demonstrate the gs:paste-text function
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+(gs:frame 'Frame 200 200 400 300) 
+(gs:set-border-layout 'Frame)
+(gs:text-area 'TheText 'text-handler)
+(gs:button 'TheButton 'button-handler "get clipboard")
+(gs:add-to 'Frame 'TheText "center" 'TheButton "south")
+(gs:set-visible 'Frame true) 
+
+(define (button-handler)
+	(gs:paste-text 'TheText))
+
+(define (text-handler))
+
+;;;; listen for incoming action requests and dispatch
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/cursor-demo.lsp b/guiserver/cursor-demo.lsp
new file mode 100644
index 0000000..44a3fcb
--- /dev/null
+++ b/guiserver/cursor-demo.lsp
@@ -0,0 +1,47 @@
+#!/usr/bin/newlisp
+;;
+;; cursor-demo - demonstrate cursor shapes with gs:set-cursor
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+;(gs:set-trace true)
+
+(set 'cursor-shapes '(
+		"default"
+		"crosshair"
+		"text"
+		"wait"
+		"sw-resize"
+		"se-resize"
+		"nw-resize"
+		"ne-resize"
+		"n-resize"
+		"s-resize"
+		"w-resize"
+		"e-resize"
+		"hand"
+		"move"
+))
+
+;; describe the GUI
+(gs:frame 'CursorDemo 100 100 500 200 "Cursor shapes - move the cursor over the panels")
+(gs:set-grid-layout 'CursorDemo 2 7)
+
+(dolist (c cursor-shapes)
+	(set 'id (sym c))
+	(gs:panel id)
+	(gs:set-background id (list (random) (random) (random)))
+	(gs:set-cursor id c)
+	(gs:add-to 'CursorDemo id))
+
+;(gs:set-resizable 'CursorDemo nil)
+
+(gs:set-visible 'CursorDemo true)
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/drag-demo.lsp b/guiserver/drag-demo.lsp
new file mode 100644
index 0000000..d366b1e
--- /dev/null
+++ b/guiserver/drag-demo.lsp
@@ -0,0 +1,83 @@
+#!/usr/bin/newlisp
+;;
+;; drag-demo.lsp - demonstrate dragging of objects with the mouse
+;;
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+;(gs:set-trace true)
+
+;;;; describe the GUI
+(gs:frame 'DragDemo  100 100 600 500 "Drag demo")
+;(gs:set-resizable 'DragDemo nil)
+(gs:canvas 'MyCanvas)
+(gs:set-background 'MyCanvas gs:white)
+(gs:add-to 'DragDemo 'MyCanvas) 
+(gs:mouse-clicked 'MyCanvas 'mouse-clicked-action true)
+(gs:mouse-pressed 'MyCanvas 'mouse-pressed-action true)
+(gs:mouse-released 'MyCanvas 'mouse-released-action true)
+(gs:mouse-dragged 'MyCanvas 'mouse-dragged-action)
+
+;(gs:set-scale 0.5 0.5) ; only for testing, dragging would fail
+
+(gs:set-font 'MyCanvas "Lucida Sans Oblique" 18 "plain")
+(gs:draw-text 'T "Drag objects with the mouse, click right for popup menu" 20 250 gs:darkGray)
+(gs:fill-circle 'C 100 100 50 gs:red)
+(gs:fill-circle 'C 60 60 30 gs:black)
+(gs:fill-circle 'C 140 60 30 gs:black)
+(gs:fill-circle 'C 100 110 8 gs:yellow)
+
+
+(gs:draw-polygon 'P '(300 200 400 50 500 200) gs:blue)
+
+(gs:draw-image 'I "/local/newLISP128.png" 300 300 128 128)
+
+(gs:menu-popup 'EditMenuPopup "Edit")
+(gs:menu-item 'EditCut 'gs:no-action "Cut")
+(gs:menu-item 'EditCopy 'gs:no-action "Copy")
+(gs:menu-item 'EditPaste 'gs:no-action "Paste")
+(gs:disable 'EditCut 'EditCopy 'EditPaste)
+(gs:add-to 'EditMenuPopup 'EditCut 'EditCopy 'EditPaste)
+
+; comment out to test reorder
+;(gs:reorder-tags '(I P C T))
+
+(gs:set-visible 'DragDemo true)
+
+;(gs:update)
+
+;; actions
+(set 'mouse-down-tags '())
+
+(define (mouse-clicked-action x y button cnt  modifiers tags)
+	(gs:set-text 'DragDemo (string  x ":" y " "  button " " cnt " " tags))
+	(if (or (= 3 button) (= modifiers 18)) ; check for ctrl-button1-click on Mac
+		(gs:show-popup 'EditMenuPopup 'MyCanvas x y))	
+)
+
+(define (mouse-pressed-action x y button modifiers tags)
+		(gs:set-text 'DragDemo (string  x ":" y " "  button " " modifiers " " tags))
+		(set 'mouse-down-tags tags)
+		(set 'mouse-old-x x)
+		(set 'mouse-old-y y)
+)
+
+(define (mouse-released-action x y button modifiers tags)
+		(gs:set-text 'DragDemo (string  x ":" y " "  button " " modifiers " " tags))
+		(set 'mouse-down-tags '())
+)
+
+(define (mouse-dragged-action x y)
+	(dolist (t mouse-down-tags)
+		(gs:move-tag t (- x mouse-old-x) (- y mouse-old-y)))
+	(set 'mouse-old-x x)
+	(set 'mouse-old-y y)
+)
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/editor.txt b/guiserver/editor.txt
new file mode 100644
index 0000000..89b42e6
--- /dev/null
+++ b/guiserver/editor.txt
@@ -0,0 +1,32 @@
+#!/usr/bin/newlisp
+;;
+;; border-demo.lsp - demonstrate the border layout
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+
+;;;; describe the GUI
+(gs:frame 'BorderDemo 100 100 400 300 "Border layout demo")
+(gs:set-border-layout 'BorderDemo 0 0)
+(gs:panel 'NorthPanel 50 50)
+(gs:set-color 'NorthPanel 0.5 0 0)
+(gs:panel 'WestPanel 50 50)
+(gs:set-color 'WestPanel 0.5 0.5 0)
+(gs:panel 'CenterPanel 50 50)
+(gs:set-color 'CenterPanel 0.0 0.5 0)
+(gs:panel 'EastPanel 50 50)
+(gs:set-color 'EastPanel 0.0 0.5 0.5)
+(gs:panel 'SouthPanel 50 50)
+(gs:set-color 'SouthPanel 0.0 0 0.5)
+(gs:add-to 'BorderDemo 'NorthPanel "north" 'WestPanel "west" 'CenterPanel "center" 
+			'EastPanel "east" 'SouthPanel "south")
+(gs:set-visible 'BorderDemo true)
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/font-demo.lsp b/guiserver/font-demo.lsp
new file mode 100644
index 0000000..042958c
--- /dev/null
+++ b/guiserver/font-demo.lsp
@@ -0,0 +1,61 @@
+#!/usr/bin/newlisp
+;;
+;; font-demo.lsp - show all built-in Java fonts (available on all platforms)
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+;;;; describe the GUI
+(gs:frame 'TestFrame 100 100 480 320 "newLISP-GS built-in Font Families")
+(gs:set-background 'TestFrame 1 1 1)
+(gs:set-grid-layout 'TestFrame 12 1)
+(gs:label 'L1 "Lucida Sans Regular")
+(gs:set-font 'L1 "Lucida Sans" 20 "plain")
+(gs:label 'L2 "Lucida Sans Bold")
+(gs:set-font 'L2 "Lucida Sans" 20 "bold")
+(gs:label 'L3 "Lucida Sans Oblique")
+(gs:set-font 'L3 "Lucida Sans" 20 "italic")
+
+(gs:label 'L4 "Lucida Bright Regular")
+(gs:set-font 'L4 "Lucida Bright" 20 "plain")
+(gs:label 'L5 "Lucida Bright Bold")
+(gs:set-font 'L5 "Lucida Bright" 20 "bold")
+(gs:label 'L6 "Lucida Bright Oblique")
+(gs:set-font 'L6 "Lucida Bright" 20 "italic")
+
+(gs:label 'L7 "Lucida Sans Typewriter Regular")
+(gs:set-font 'L7 "Lucida Sans Typewriter" 20 "plain")
+(gs:label 'L8 "Lucida Sans Typewriter Bold")
+(gs:set-font 'L8 "Lucida Sans Typewriter" 20 "bold")
+(gs:label 'L9 "Lucida Sans Typewriter Oblique")
+(gs:set-font 'L9 "Lucida Sans Typewriter" 20 "italic")
+
+(gs:label 'L10 "Monospaced Regular")
+(gs:set-font 'L10 "Monospaced" 20 "plain")
+(gs:label 'L11 "Monospaced Bold")
+(gs:set-font 'L11 "Monospaced" 20 "bold")
+(gs:label 'L12 "Monospaced Oblique")
+(gs:set-font 'L12 "Monospaced" 20 "italic")
+
+(dolist (i '(L1 L2 L3 L4 L5 L6 L7 L8 L9 L10 L11 L12))
+	(gs:set-foreground i 0 0 0.4))
+
+(gs:add-to 'TestFrame 'L1 'L2 'L3 'L4 'L5 'L6 'L7 'L8 'L9 'L10 'L11 'L12)
+(gs:set-visible 'TestFrame true)
+
+;; actions
+
+(define (toggle-action id flag)
+	(if flag
+		(gs:set-icon 'aImage "/local/newLISP32.png")
+		(gs:set-icon 'aImage "/local/newLISP128.png"))
+)
+
+;;;; listen for incoming action requests and dispatch
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/frameless-demo.lsp b/guiserver/frameless-demo.lsp
new file mode 100644
index 0000000..c28a64a
--- /dev/null
+++ b/guiserver/frameless-demo.lsp
@@ -0,0 +1,28 @@
+#!/usr/bin/newlisp
+
+;; frameless-demo.lsp - frameless and transparent (on MacOS X)
+
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+(gs:window 'Window 100 100 400 100)
+(gs:set-background 'Window 0 0 0.5 0.2)
+(gs:set-border-layout 'Window)
+(gs:label 'Time " ") 
+(gs:set-font 'Time "Mono Spaced" 40 "bold")
+(gs:set-foreground 'Time 1 1 0 )
+(gs:add-to 'Window 'Time "center")
+(gs:button 'Button 'button-handler "close")
+(gs:add-to 'Window 'Button "south")
+(gs:set-visible 'Window true)
+
+(define (button-handler) (exit))
+
+(while (gs:check-event 10000)
+	(sleep 200) 
+	(gs:set-text 'Time (date (date-value) 0 "%b %d %H:%M:%S"))
+)
+
+;; eof
diff --git a/guiserver/guiserver.jar b/guiserver/guiserver.jar
new file mode 100644
index 0000000000000000000000000000000000000000..f95563e8d12b1a8e3484938ec420aeff1cab80f8
GIT binary patch
literal 281685
zcwU5iW0WRc)@9nZ%_nW!wr$(CZQIVQv~9c6R#iH)(wO({?wK|H&6@6rbyncUU2%V$
zeeT{7`zp$Sf}sIH{k5Yii*N${UmG+K7?7Npst}!&yg0+x6c7+7kfIDE)Za}Y|9V96
z|JxbuulPTm<%Hy=#Klxp>E*;9<YuO2W$5S^;brImb2IbJ%8V;4`zOxy(sHy?a*J-&
zV9=Srut#ulXe>D~(2h$1o~Pu$t?r#)Da=nVxX;KiFm<R)Gt4n6Fw)8}?ws$Of&Ve6
zJGlUImA_u8@*f9<@K*>qo2XbCIhxU%*c!RG_^DdCtcWA|-8XHbn;gYB;-WZTBHLa9
z0mC88Ih#f?A@ngG<J<tcnQg2{Cpps?Cif;7CNg}9N9ob3rVu4hILhw5X?5t~B-t8t
z`1tr5e6%0t0~o#`7=sA$@gyb($2oI`nPR!H#<><Lz$n1^kvSP0h4za%0|3+XlV>M*
z^@h^>)dOrzaxqU?A-^-7Zn>sFIKb>TJ5Kf)?O}b5N{o-<!*=N!FgR#6(P6W~f3M;;
zfm24iVa>n%DYqf68MZDqulMf5RM5eiov;5*>Fvw%lzjy2bpHBhbie7hk3jc<s?mn9
z0#~Ke;GovL#~C}v+P0%ogH)t0-HHw@{7$hySyXZR;oVk|JzI}8tJiStJi99^p(p?3
z<0(zrkVvvN6#H<s&vXi-AB)kdD0T`I%*~+;ZZnJrQ-veq1ACuxM*?`5Sgxuj3MVlm
zz)^a?Wq?^7jlfXtfS6$8Mf(8Px8@d~fZ7)kLLarV*nC*+1=tN29vtyEOv0k-&p-zw
zOOBX#d$u)Y8Y48SmP8AB9^EV%lJ1A(<3*0OM7R5$0^<ieBQk@Z^r|UMsO!`aQEquT
z{r1+3t!f`X>tsf3Wg?Pvl9CCgZVXfnK{XLM)wT50zwME_%)ciVPJrRob~^A_Lmc%Z
zyock+&o|oHg}r;s@uRrtW<}TxFd&}hYkoWxoLi38II*Bq*@qWRgO6Dk1-Rezyig)M
zY(7rK3uGmNQ&;fV=5&yulBYnHqKCA)<!iO*NTf_K%Z1Mk)UdA!uUj{$-sVR!k+b3W
z%ZWTNl6qt;N%|8~F5kLJC1dR#8Oe?fVzgb7i60>nCp4XUwAixUns`fG_L%e#1ri`U
z@g8H#9ao9wv;V-w=-ngDKUnWSKZO0z_C=`C{8d;JXHRNSSP{3YI$K(uSG}P+TUIS{
zHQ;d0kghM-y7<iV79CLhjg8Re(GtWC5yz~0Y3O-E&86vC;0gXY!plM}STx~NBihzO
z|EfQPHPyp-=9xrqlpOHetM-V*c<v*3I`$TrUzS-X*p4}e3cbLnF$6iu4<8R@V>;=e
z(Z_nEb`UROd60)XjaX&QX2KW;v`2T|D4c~bY5NHSGtr1EC?(+F_SbGD$^%zCp1|VZ
zqJaCb8C6iu2#6VG^f&0=0BtLTAvOaA0z!xQPXI;!D};?)%-C5)98Are|A|pMRUJiK
zHLS06Q-%%O2^4PtQsadfOqC$@#TtlJCmIZT)zqlfZ_A8EVQWc7TYxHDrDqlQQK16<
ziqgWtWK)}ok@kqkp0Cr`MYlrUolwE(H(60BHN#o|_u1a}``p*l-i{nl+<6kRD)D|~
zG@oa-jhk+b$Kqn)KGicTfO9NQZX4?Eh?4^zn-Yz;q!^15o%JCa10Al8d5Bpa+EG3;
zB@QH--p%}viS7+jq1K(G@d{33%Hm6A;IHgHnp3rAV)L<aoF8-Po8x*bB`MWlp6|s@
zH3Do*#^jK*NmyQ`wj#>b^lmHnzfG0BS+d!!PYfu`<bZuVy3-US__&*;ZCD9fFL?0S
zT8BYW*Cc7r6d_TnOh<mj-%tNRaG7Ej_H8rebC9YZn!}MVksD6=S#dz!;zCzw#E@Tj
zdS@vs0%@sg$r%{JdlVZ^@9Of97zoO<<88uZGZWiNIj)SVzI~k?ubJY`ij0YL-F#^B
z<Vkd=O~j)>)Sa>@$jYDf15_o83uLiMkk<%uW<V5RE<tI6!2q@Tz%vh1Ir|4ubZoX1
zyQz*$4f6??%`OFIN^!2H8oc8H<94FGfUwh8%yx4-)68S$=Ng)jW{Otbga_|TkPoTZ
z*u?z(;>23(ivA3l`>kku-g#-(W{Q*x#a3B!p(XB+(Iq7bGl>VXYM=3vDnFeRIKAqC
z0$4rSZ$`XQ;9Vaida#>9OZ<2?PKRU}LG(Ojifu_TFx`4f!qyXgF05_c2+hpxTqy+8
zl&~Ymr6ZuP$LXU(Gir>d2NePVwN_$w9{ligMly=Gj3xrp!(b}bG(#G@32Y6id>i!C
z+RJNqCaqjHRSFp^uWai3%bo-C=xe!{<(V=WQ)@DX3V4Oi6e-wbM_3dU5fQI+9vh}A
zXKWk~%ObT%Z_miX1PET9pw+tk`yRc#kc2swmP7jUa|)ojr6nKBjb5+`u9YLL=*I&y
z-U#GJ(x3;)Bd?wW%v*5%k#?*BJ-9<exJ8&}0Wj)R&??&VlpDcL;K{SDEMQywUpU)5
zsFk5`w=jIg8dactrMi#^5I2QLBb(g3VTo}TKM+rd-jl9rh&Pb7ZU0QCaO`(R9K!P7
z;5-_98kDe}d&Gx7-f}q7LFv@!1iY6yabeVNE56}FNThN>mj(pSbnc@Ghqu&CVE0p6
z+>^JV7ACyw$}XL$D~_4cOG8Pb0Dw84_3V>T_$TRJGFMD1b*JRQb7aaU7dl+ounEfP
zlTP)6BdlZ;GtZ_!tjke2wsWaRXXIpwcP&Y@^vk8J^s>$Ky+j(OZ)4FJ5SWwppO0-F
zg6bF$>g~OLxu@e$o(GcEIl+`QUZj;NM$|mU?vgQ9IDxQ09pNY)(-jZUl6dBjSdk3k
z^$qd%jq|(!-yB->L>M#%?nRM2-vNIOMZ91VA{(!RqZ7iSzlc^2SAcPUhB_;1oD^b&
z*id~|0iDf9=0p&d?^XbF8K^(D!QZiyNyO~#{#s|KH$+74H3kk2n7HZr@cR904Roh;
zqE(Mng4)@+U2?975PNeCCtRAbzi2yreo<LS(2jmsrnuNLv3P{+{+Hc!Pg+7oC;+25
z2$F|TSxyx^j$v6~Osu~+MD&`GFFhl2pkbMy{2a8QB>aaB^LPK|H}Kzead|C)b^{Cu
z=nV3|u_<9US62sn4J%U%GgmUEf0afR9R*Y&w6Aiy9e2H=RFd65ZKZZGDmCP^9J`>A
zQUJ8*;ZYm@=Ac>IM&9U1K-plj<zWfp7u8W#88TY-<4mXjUY3h_z~|Q!s3175RjlEr
zD8wr(g%f2Q$TdzT6H}-!%=4p{Ko}&qWrgC3`{W2Mfi;tb;jZB50BLyXuV_Q_AfpZ?
z*tGlOd`piG?edA}MBzH7*v;?o=o>5)w}x44aU9`$jsv5V_ip*+Rf3ALP|Ehs{+ri`
zo>@ja4uo9Nic4QrGyjn?fJRBGT%CmBX*}i|T^~8?z`0kwm!4E%&W{uCpv1g&UANx0
zpm7XmPh;X3raC%p&uDVcd0O6a*zl;xMK{xmo)X{cny?`|mx7=TjP#}<q-jjrTH~k|
z;l&}GHTa$uMX_07{2126hqxJ4tO3K`<m7j^b!ZR*M$<XVU3NrI875hM@AYsfw2bUM
z?u02uHZ1wdP##OS_4k3Ymyu6Pb|;<b;|o>nA93Ff;yKbD!pM%_l1JmciH73}%b^;(
z<#?@UuwtG#73)XI>C6@eU;uqb_;T?uCLuBEle{-<=ciFyY25D6^ucqh>9VJBhLW;(
z_^WQC1+jd6x9~AunDoi>oh6fmMS%#XdwtS6!M3N&vW*7AGSm@%5eD;M(`0$Wykoa*
ztYZ)4gnJI@al`S*?~y4?vObgZPv~T=l7tl^L2dTWb=Fp|Fi}EvLXE1@gaejxS`@Mx
z#*4CA<B(&FyY1Mn-mooKiu2)|q2TLOYjLE{uYb_z{9eOs(Z5K2Kj?qTLX`iJh5yV!
zH`Og=R3RijR1leTrE8K%4#6ETvr!s#q%bNJxLrZUUCK!;jA4q_Zsci7fdLId-vy0=
zRx(ZH6UY~(biQsSjiAzMi>~*_tn2)Zue*mW51<mwwZ#|_9E9JI`-*TrOobzbC?e8$
zi%w|cD|3n@^(&$AMtJK^Af(cn-15e%!_@e8oOQGo#+)%O+;b+f!{GQkSQ@7>I25e9
z#+Eqkw$nL=oQ9_ABd|v5d^M(XKJjLlm{ap*cD>2+%zYC`a%r&1MQkP;_u_7BlzHGu
zG)ZCw3>tYoxoxRS{Az!Ce)O86M=#+j#p3yO%q&zrG01tuMb2&jjWR`1$D`Fd>W;FG
zv&~pay38DMOF+2bain%c>EPJAY!CK?gU5Gk9%~Nq!E438dk!odoYAlGK18<y?ADc!
z{X8e`pc2@44?JOth{uy8f{Z*kr;C&z7;jtbWGK~8>S^@QX}R)?B;y$~g;0a$77Q!<
zEJ-xh-&qcDC|&B$B6~0kQ&uX{e7#zg+sfo<eZB|h%Kd$yFkuI~m;+$m5siI<>4#ns
zmD^EDJ;t|69d-I1ee;ImJOvd|QYC@PZX?C)e*K(V7G=|_-qxEQ%A?^~qICXr-?p&K
zLaFEV5a+|-j>0s}cNbzDRx+VEY8!vP+Lrp&LDLIf9a!YU!{3!cFH9>v-h5xos`VrK
zsd{g=GD&^+sh`PeD@82L(nXB3UUrKosT><8u7z+{{J0(ORhB!Rc1A@4+dFn<4f5P#
zN!QikRNYjcFPH5bT&aRvq+m1FG2={>{FSG!G09uIO8Homvm}tda}{OJnnalt)xXbQ
z{;F6p^O1qcq%;4~U{SCV<Tbd<>?@{F5U;#y8TOCK<IOOC@@J{&LL`-z02%uLN=~FH
z$3kPgCCMH5q8sbldih&5dAN<GzC>-`ua=gcVS=(*>WRCCeYVTDNQ^SJl|~*xIKYTT
zi+*hb>Qrx3o9*`(e9QX69d@2+G`aP;_NJ&u`uzqf<J!W*<h+l-B+oesmmn8nF}le4
zATpk6GdhIqh?P2mNpQF+3@K}X?DiP7sZ}gL`8@NO;vjg>80Rk1FS;d9g$F<|=m<7(
zK3N@i-pZ8+O#eTSSlX<nBK;Q%_rd=Y5^?_u5hHtdBbR^82XbEjy!<C5do_GKRacR}
z^L#iub7p5#z@U(zh^HukLD7(eiir^;kIg_r1A{Y;DLNZB;<`OV8rxc>b*xt3>YKC)
z>*5-!6?Fxxi&xtJ*tNE;Y1Fi}@>ko{F>t%w>|EMwCO#qdfA)2{oX*T-J>>j#;C~y{
zdj`s+o0ANQci}r9Yh(2#6u4cu<)t`d=?t7i^g0w)?~IJVr0EFl&nQ1&*1Z<u_8&Qh
zAwakrNt5-T`B9_k&X!Vedy8{gZ|01T*kEy8G4mNa3D5iCg%j>Xnv$dG&N6L(x3B&Y
zJZT4GuOI?_ZTKS(-Q6?to!o`TYn2CGl$UCp9plEhZijdKXi)Fx^maq$c3!-XBSZJ@
z*`QxX!KDB0aRWN<{ve30%aPC*|MA%HhhHcgf!RG)%DC1OE@J*b%H=UNNB-$(fz)`j
z=Um*`>$}dH*I*px&I`Ux-^lTE?H42k1IsIEibiJ7)G-@H1B+M4WI^V~MhM3pM#_8E
zrN(U=q|F^BMS$8Z2jbcRKH^ur2YS!h*t@;&{-D5ZQE&p<htA+Q%vZ@iDtG}*X?Cx8
zrD?jLxk&3N;ezm$xJH6KeR0+ie7})8%&{kGg|r5AM>VKkm!Nvc!FtY+AMWEmj9o|q
zS=GT8{VbVzZM#tkd!d?T&TMp<P+kA}Ih<BG^=I}0hZIZYd-r4EzzbQni#6?zt+qqh
z8frBx#G5uq`i7^2pI?<75<9$sSZ@_18w*lt<Z7QFXQ{?}?3|o;#=tRW|6AZS2Mvx_
zU%J+Gcb&m+O2pa%dqhb16p1HO8AZe}&rBnD9k+t|Fym!5p}LBQ2m+g*SXlc)>1>ua
zt8N9PS?RoJGUONv)%-sRp_T|_@ZAbdZ>lU=Lc;qk76(y=27_5F511*jcbSsP)E0~X
zoVx`X7MRmlGt^ZyZh;&aR_I$e{&GHS_Jz}_{s~qP&F@>j?}Bcy9|#}{1&|Tf43R6V
zCIQgYI;=n{NGnOeq|Y<SE>w+3Y9m?IJVm>t>6ulNsDG#?(K)Lo(Tr7+BuMpP)kHfP
z_W)orWsy+Tn4&s`DN?*R!#YWr)X+zbvjNhMg2)n8hn7m!(acKq(b&f2fOur|=*+U{
zjZ3%q7aZc%wVFS_t23v!GAU14xYW^Mk<>?>X6TOhU5q7cvM_$xt-Pr<N#Zp`j}|MV
zQ%0hqE0sl)7i*)l6|1AW8CQ{{R~75$mPVfxD<i{KTONz$WU|I!1UZ$sw3FGs)HXBp
zRC8*zps0+<<^a?iSEVUxGFxI+qt6wa)M}MRwegS=W6FKh;0&8d<dsINjPbECYm9q2
z<M=E=l%0^Hpkm=|m!sxY7e||Z%XVcwGJ^EZV9(f@+M}WpBEEZ~`m2GBU<FB$cCx;m
z->T9=dw4v!Rh=Q@!wcQ!(pyqimsx@VUKsC2aKu7YjiMbN1s8PvT&@f&b{%kl`vtY@
z+_s?+sxelB8XIaR2pMD8Aum8M+)^^a#G<hjN6ne25(xu1WpLVmiU51Ws{Q`-=hM7e
zJ|A0R%)rF2g|aIL2gqA5esnST^Ej<H4nk#h6)Y>|+IBGw+>ND{6WjyFUB?poJY}z7
zsC`~H%m0MNB@*Bno?K?1rpe$~uQO<AX=rR|@3o{ZwTH_aOLEwN7%@i&%e$?2k5$KL
zYpho;R8TN5DS_7v#KvXE?JhkYk40Ih$9z=ADB<$IF{0BC26Z=8d;7U;y{)D;zT_%1
zZ5F!O|AK}X^53*{pV4z0ut@Xxi=W=P7WR}>(5;s)7z@zf!K6>nH|EVLVXr4Xa^8`!
zQdDi&kXPrUmgP*lmQ-Z)bX};vY5$QoM)wZC1gXsynkBrqf<w29t`-ii4AB*hNc}`}
zkc&f?u2gxrs40Q7D$|7Xo7LZ0dGUkGOpltj(W?Bw_)%gH*w4LL`ibH5C}<$2=E2cB
zMhf^Kvi4uDyvNp_=rTPLf7Gd~$OxT=!Wkm<@v<9#t1d_XqXz#+&CV4By(tVxvmTYs
zmNQffT5g%7v!)tHeQm6Eor5EZ@w(G`w=s!`bk=rCAvk74gC^=Zq?ZxpLQlxfWdJ8a
zJpBjY34o$yLGIHMYY2yJfs}3a82Y^UT3fvO(7UKk!lY<60EN9~)~aGb%6}qrNB`s>
z747!G<^7ww7%U9MIoqsNd^M==E6|`F<>-1<SpFzwC=M|Vd}GBM1=#%!7^Iv<P;Kls
zqITrOCuN|W;%!K4$@`a|_sbgqG@GH8!^34SJus?7Xzt{TQLKq5YME@BOoYuXrLQcG
z!8@L#FUY33Yc>`P*lyeLjXVAv=~G|cx8I^w2?RXC_VpZW0bbiK;Jj}Vcvrz+<k9Yj
zv@4GQ|0R#w@0;~bq*>Xem^1=1X98E|+|<aub1QmEnW6GYL_>%>^~c8-Ctu%TTu?pn
z_995GXY+wJjEM(=OBbc>ZXC?_${q>QQwdT6`s?aE4rXKxZdljT>_?&H>Ofb0U4NTI
ztYJxY3kn{y2w=e`0#QOcfwC=3gg@fT=Pd{F)jy8Bog`9G_Yx^9xtJ|vpyRxQ?Nlvk
zPDea$<Mq{R<2=Z+n4;{`IjTE79w`X>`rE&!G>_Ejf2)J0{&LGtoS7?>FXP{&Qz?sQ
zxOV!EqUv<lFkv&<R=jKP%Nl6eqzJ0+Kr!{Ob=Pv^ZX*jI6{iQ{uvZU~Y=DOV9mElN
z0Qc^&e}Z5i*A5;2raah@<&_naK>nn>4u|DC4-1Mz+SvG@1Qo;p`&_<7g<r5_BYOiT
zH#_kVPQ40l0li1sHmiryH8VplWt1{2wx#3?@-H5B1YM#nm26I;m=#NBMf6%~qDsUt
z{NajME(I%<@>RuIGvlT{xdr@;v@|{CL2Q?aL7gyw`j8Es)uT?L!VPRviYkSJbEhc(
z#2WK>?<eU%n}Zz0z1bKtqy?L>BBuO?YKptmpNRGbJfC(I`ZFpPGD+*Y5!o~zs+Y+~
zy_0q;<PyqRyki?`j8od{iBcfADc&^q6Pr*dh%^gnP;_&*RNP0CGc@)dKeGo^g@h`Z
z2G;Iw1uD8>oYz7TYp}(SO6wfpcr~IVf~7GxvxqFq;F!eVz-8C%T0<L-cxiDyWemk?
z1V?O0WN>d3eJqiMCK!h{0-z4npA?nE87O3pY%ZhYRNzL{klGumThjVTofp?#=F(`e
z866?@73xZ#pVpS7@pg117yw<ABfa;>M`^bSmL>c6wcc05_akkNXz#?9sEo+$uoTK1
zp~%r(Xi6RrRcJJAqRGpP!(5E9+pi{u{fC7)n9Eb(7yB;LFV{T8c2{5uNz7v1E~tl6
z8AWovX!GQ{)Ow;>AzLTqTnS+3Xu|g4%y%T+E$Do&n5dbC?I4q9V_<N9-RmJJ3@+}G
z69R?MVqIINFs1NVz|jlp;R|Y1LLnfSye;DwF>B)cHcq-M31Vw*7hfeRmax|Lkj!L0
zWjeH|Vu23|yq&->WWEvPbd+1)C1dcIru7+V$U+Cs#S+^@dVLw1K|<UTJY$(rF7-}i
z-I82~U>CNBbh{$JVHkAj%2T#0q;@`%1dPG&^{dK#TP{}7794S2ipL5Z0Q~Y+RGXcm
zbwym$E$MtJ$-XVm{<NV^Cy^MJPC7Ss4ww6}YPL_XdBHz5;FlWosY%HviTT^;Q6^zw
z)H{`a&7?!h8*i(OvPr@l=2==H<qro!nDlSt!lk!>lBK8BqI=$=dyt}glA?Q*qI>3|
zdzhkoK+!!;(LHz3Jw(wxMbSM*(LK9XfXi{Ho_uA;dG}(x&nR-?kHY}rFw*vRSH%z1
zj!LN;#g7~1j~k^A!a|idr0_>%D_<M3vFE&*9m|IPdnjYwEY`6XxVpDr%#Tc0x2T&3
z6)nT_N|gA5F|>`^>5kd7CMB0cV$Lw(rX2Mt%Z#)>6K}M>TN|IFbJrX{o!WW24Q9J<
zD#?DB_t8*8Tq(hcFAX;gA7ar)%*~im1?EP%a^Y?`Bix_p%BDUvs?SAGB#_rNJH?~!
zaiQV&VrX_@+VH?U=uvk&!UzZ;=XNo+))J+?g$Ac$`!v;uc*p<gcG7-lguw)K;ua%&
zY(|8MY{b=H9lL`_Gl6P<n2;%mhU-T1dcjaks3-w448wJ06*gE`CMA+i)qTgIEkXQV
zC1vjGNO7gh7><<znR_SLzKGw&4)jjk^uq#DcHH4%>uFC0e@hh1@{a>;I3OS#od5Q*
z;Qy8=|67^Bdg`t^<!?Oe>+#Xbq+`%-j3Jh`+HMR%Z8)34P7c}VwAoIlgJb#9={2b9
zUrlw>YzSs!Ifh8d5S=7t3hq|n5|IUxs}Sw876qlU9waS+;oJw7f>}y#B`SkF7Wmxk
z`T;JUTMdrqS<YtozH`54vRKY8J$8N0l}NNFrNSuAwHWv+5<~L;s6_h{9Ttf4G8`6&
zeJGA3i1rX2iXnfK9FCLdquik)3!vYzAPZ=mn|X_A_unotpjVd%q|Mck_>&*9AveT$
z4$FL(FX*~F8Teetg`F-sls??}C%z+weWm!<Ea*J)%)bo;d%SgLta`605RkvRxXn=}
zSA9)OIM6)qJ;o>aGtBLxQ{GJW+|bC*ST>1-su*E*`&}l*YZwu}`_;a5jEq-j$e>%F
zF*l{ZcMMH8qiK()>F3ueR-6OEx<oZ-T7(|)!st=-N)#ns>x6T}AkluI`=twSi5Ao?
zxG%b(Z&G*37wHxMM#n+oQz#Nzd_eCKeFO=6awaz(IE&PzGERydB}tFu)DR7c6u-oW
z6r=s)oKis2Bg;Kqwn}RZ4%S<FD{YVLlpm=^GM9nK;MKW0jmh}x-Eh8SoT8m91wU%+
zT})F=p2FQ#CW0CjN+44vkYUH91DbTum~U+Xz?Qd+IC_`(Q-sE^VUN8^(Rv!CO19a9
zTkZ)W!YhK&K>^uA#YY`pSrv*QBi^b?Mz9s4_j`^Fp1D(n)LS~F`8W|{^|=)HrTB6^
z93dR_F6t+vN|=-&Pp<WKv_#y+vdqsc=@G<VvdzpQvMDnTf88NzLQC1pd>7<p8e?T(
z;jJAX&*nkIiyV3UdISojSz?M#h#OByLOX>r70g?_L!SL2Lv9X#9x<!FpOIvO!lX-&
zb`>YpW=4S}#lU3oq9mQ1_^M1Kj8P!_Q*UW{UdZ2Lq>PEFzEGk~OG^V%&Bx~`LR&_8
z8H8Sb1?5>PciPw&8h_RHiQR_pt-7A<1=@|O&1t(e1+U}ayVRzNogRd&mtdYl^TXm|
zeQ2_!|B<Y`j>N~Qyo#13%<8r_ZiJ)?q5LhpR+lAXCt)^LtbPUcDy}<ASMSb94<z<#
zlbfl{K;h9w9M10`-IY5dT<49&DqJu^$6Z?cFI7axb4Wd{YYflA0`lTYZ`6~<%y^AM
zxTakG4KFcv6qWkQXXMKu_p1uF8D%x5FAdnz?bNnYVJ>w6LN=SnF}bl*xaLui3}^Nl
zcW<-|Yk7~w@5s|WQk?WiDwaN}!CfKAK`&_}u}S|m_1g19#=;nijtQ4;SjB+XTkL0K
z<j<>op$-L^IL%rA&&XU7tMIWFMqYLDM@O<K)63b-L*M2!qE~YosZ8^;%vs(!LR&N6
zz71(zGLQHT$y(o%q`rv-qnVtgcliA|WIJ6BW`E{&<urPg&QmRDseE0XFr}t@S<<fb
zi9BO6=3EXdXEJ}zbst`)T8rVtsj0aaQDe!QC@eFQ?gjb`m*ORh4tUhlb&It6(i+t_
zBtOlv5|Vlhr?^NPF}xB1jSKI$N@<RTan-IQd*zEG5`OYS1Z0os7uKEQlT|>&fqUBe
z(yZ*NSWNHjOQ1Aisenpn$a+;zK95>oVz(-{um(}SJ68`<h0z4BCBQGVUW93)?&`2w
zr|igZ0=Hv)8ndb=Nko6Q^xk~8*qOm$bkqoslfglyGogLD*U3^?<{V^~*tlZqbNlo}
z4{&n|oc4TM7@f^?ej=mVm-@`i_1-r0VCLJI@m%$YK1O#;kZ}03Wb86QB1s@$Qd&g%
z=;Z{>#i`$*%m>>*w`v58eT-pz^Cz=!>AbPrlaV|nnmc1P;#rQxRs{DJP9p^7d$~5`
z&M)<B5tlgf(<p_CG%m97)8T{mY_rp|SfN%J!E3lq@&42>SDjzMtLm{shGK^e=jLhl
zsCUrF?a>`#Ba~vfNKQOph||00zCgH!BwVzo$h-B<p%QBR6D9ib)x2X&X-B;E_rzA@
zSUzRuXC<l^$LvQN!SMEp?<9;zZXl;jj2v%23&Y2ZG3!Z#MKf0u-}zDczlb|OOin*D
zKY5#Kuf`HJVW7!XPT-nqv5I5OJFD2n@T}ws#<pj3e&~7O2p1*F{^qk)6g11sb5pWk
zNha;x?BGR$iG><@0qbdJGp(DCRq`n+Yg!0ZPHXxjdW4fpeWXoNrIYt7d}xC0Y5!-e
z<>aoXFb7F4EBo=GYuyx1%<2Va&!TC51uLl+HQQsTFyGi4uJ^4)3(8xEmsCb!`FUN<
zu~DF8&F~wNw$+|YbP`S5GJh!gJ54)&WO$<=qwNamL6RzWEd)_$4HYfwYb;i%F^d=x
z8EmsYT$~sLn)VD`J*_OorMt)%s%H2anv)He)r3zFjzb06Jpt@6JSRj$9>jy<BArJ$
zE7*J$Jn5&_?zJZTk(T~5WWnqOhx>{rQzvd$x0!Z=myI-rM-GO^l5c!xTud^?e)|EK
z|K}`ufiC74gV44?_*j~;rLI{xzx728onKs8Lo2I2yU39>)1y;O!t~rifKY&y<+e}w
z*s8^Of)0+@^g_Glo4U-N`Gtb!TS_{=(Zv?sC-w9^etO^XQUSXwOOq~AVgc#l>hWNM
zYjM@S)#3i|F&3}f9JMp}bom6`5a|#uZ2?IER6t^dB(f5TFnm{erK+eFQlm36I*EBy
zB^-TT`G$%r`1oo_rqLYQDp*KGrFpb99e(4Z)*$4$ZEOxKh?|OP!fB6C#j;oSslsCL
z%*XRG7mzA=h1J1;AJN>S*8~`Qd}W4iOX^h92tZp1SX=7PiZJX2uXUkXOYG)?jtHhA
zPu*z0d{?BmC8=FG(w{|&O)(uS2D{<;^()uNw<NIc#!=9pJwjmD#-TULZy@3y@OttU
zmW1YC!rZZvgzQ7->1w8y)ZtE8Ev}k<mWT#&@<%cQPzxa~=MYiu<yVs(RKtoOlxgBs
z=?Ft_Wdi488LLlc-BH7{oZEQ8e;VvKFcWd%qO6xD6dR*4IPhwVU5<Xf`%<DFS4d@x
zL>Tc|@k9knVLxhbNp&@Cnzi$~Pg}I3b(fi&S5q<^t7Tq<u;Pw4AVl2g;x(jk`d)Eb
z#_CDVe{hdYo#)U>;O64bscV>-<lu(yLtCT0<0uTMM2Rm$-*<A$E2DQ!&(!1UwKosr
zZKrblys>x7E9H8!?3Z~XkTs0gsFT{-7Qd#iu5n-OP*`?0bu?$osYJQwPE9|OjQU-L
z7G{VMEl39=$QS?3e7vrW_l<z}3eS0(<21rBc*h@Ef<MfZKY;v&gm4u%mfdgL;0yBm
zNzkKQ!~P<ll{&_>Qx0WCE#z0vpjeCzT=gucK6dq4AeoVlACx0_In2TiYr%C9MHlAy
zFPoP9>*0xRTbP*Ik>^S3{Brcy&V-L5E6wXRWGT}eT<<(7YqN$Z+Y81&UKbPUS$i68
znq8~ppxJ<ViO7m7wt{<+M8uGL(!vias)E6+Z;1O7oycEDSY8QoM1kMJaV+$_3!)0b
z{-Xr$Gcecb-zJXe3-zM`X4&);GaX=6a*uwA{y3!tz*T30Z;+7>50MXu$Y+>|5DdnT
zz3e690}@!|%SkTos+C?*9e^DNHk1u~M~yb@sNZ!i1XqF%t*b8By=?09el17G?+U@*
z?}n&{KG|#1b{tVP%a1{DcWh(S-_ViYXgVJ(kNV}--r!yzGTO2Y#a~}AZWnATYwJn^
zdxd<DHZaRMl?(kr5e=I$(AupvGnE=?_(Z`uWCDJ>Lt3x+v<A&iGPJq(jCHuW-q~x2
z$0oaCmU|&5ea4ycgSwdsMv$)?(9@rzjC#Qr^aGwjcZ2tWOfwLJk7$OfhSEk{YH%(|
zhU^%I=D;e@)2d9el8iYpj4pvyL1tZ8=FNs}XohnT=Jd1`F-G3t&8<Kzgjk*L1hnBB
z6q$V>GscGL1NZHtj9cK%B|xZP=G3%^=);$2vH`&5*qP{!yt;7BGK}4@j5UE=gy|B|
zMi5}l6+q26nQV=|y;$aojF^~)+<{t<(<P&f8BnK7AhMW@JB_^RaLpQw8R&-WAgIA7
zv2hnIjBaaNm(I<)s-}d)TG$+E_ssit$4C5tvn$pNkNs&5bJzBU$nJYzkM09|pzEiB
z9iqOEo!ILZl54>I&Q)0V^!~MTM~cM;hn+{vf$a7xoyYsb5er-;?`$6%sVNm93a}|!
z`nW|X+?j}R;E2)dJN9}Nrj~`-7k7$d$`ChY<D8W5>r*To!ZAw+%0i8y*HE}Gg1Z-+
zRH()C=CZq{0PtEzZe6}L;*<dW*6o>9RZBJBGOKeqiE~|U@ghZRf1Wf*eV|V^0s`K{
z?c{SmCfxpbV9j-?)6GdARJsauwnj=$!yur(O#2HeZ+iT~w=bXjwFFH#0C!KY`^BUs
z!2#@-RL*q>RHp6&b&mbq^1$idFZVX@nqKxBHVB7?QQRBum}h8intg0uvBfSw6*RVN
zlU4eb@p!MMSeDgmV;alB_pBH5+I<YbiH;S*o;d7_yY`@mBIKS_&I^m-x7Ly&>;oqC
zqyfl1&lBK!Xj&qOU{-sy7?*v6!O+7TU*Dppf77ACq_YX3zZJn?z@ni<cC%?r`%>s5
zlW@DB`e_dDlOg0?Pj$?L^zC^;_zTdwkKdAiQ$hCu1Yg*nQ9(WQ!Y27`_}~vxMbeXi
zanxJAnrH9%<K>7_wB!!eSmjz;+gw+wtTWmA*=;rdce&NJ<}B){#&UE7@Exh<?0QqS
zL{&Ip$*XU8`aMUILV^lMK#uz@sw=jDl*u{eEA<;=0Ooncmuk1udBV-u^8Pp6i$Khd
zCqnlfuRExNz!$Rn5%}fU!_PQE6ApclU)=$K-6(;%_p|*^X3u_*-F~1Ojlp-eTYvnX
zy?>m_-KJCS32gQxlpIgIw=y&wbL#A@+UJ;*3@+L^xq|DmO9Tv@<Q5+@ah&t%wG3f3
zSbx#|><xo?U|)UUSsCfCVE4y7d$9W@PPct(82h#RO-Zx<9h^2SVjqz)g%7jJqiXG(
zs+?02%e`>pJ_ADIb?CQe?p88tU7?pSi#znPx{@<pN1U^@X2#A!zOQYLW?u9J7oDw@
z!!i<_EFRxHag!;79`9Z4K2stV58krWl(@!?p@R9QgC}DZQ3CCnPw~3*2<QJiT{q<U
zr@}J%Jm4Sy2g3<PmG}^WfL@6IllaE?TYOuZnb-(Bc>cR%B<^p=h!WD5JnT+eeQ;eQ
zNrtxK771DpDY_L6l{P)JXtBfA(*l8}`{cD2QQvvW7eqkNJRn^ZmC)~20{hGs7YY+K
z$8~P|EGH{(FQD%mj4{3p%2-kydE5{T8jjkTF8X%|vJi|Fd=?ceTsTwhZjMnbRl*|U
z4{3rJ<!BwFZS@;`cn>z-1;#<7WVZu^I40NhXgB>0s-N98#o9;C$+lcZ&|ITP3iur5
z2Fxw!R{)E1D(Dyn&m6PsS}ZdatJr9?w$_n6wylk0weTQStDT?hKgQx`?(OU+ZFfDg
zlzIwiyKH^r!{%Yqi2PeNE2GO=Sky;b^o&+dJ8QSp;1S(iO_U`t=>hZ=N66)_ykjll
zJ@FvXIQi$9gR~;;hy$#(+U{E1siphS%~SXg=}UKL^H?BJrSV*f!`jTm_z4wmyyLL&
z<oFMog+XMf>5Nj{k$7^KR8vJx5RB(8>7#kYRvq*nlNXJb#$I_EWFmW2B~;KF&N2sF
z9;^%^0XE+GXy&jV(Y=Foci}u=x53n6BC|~_BhuqOWoFjm8!5_JK7J4OYdgd;>;~>-
zB1zzT((!!XZA;mq-7|95B6ew0edduXya&z}Izot>1P52vYnbltQPI<C5|SX*K=yV{
zF(4Akl*r`@mD;ey1A&EwjV(Fe;jmRHyT=#;WwdO4Wn?J>9(n5N5bJ&B-u8L*<l^gM
z8-v_Ds~ln;n1ulx^hr<5PEyHf6xrBc5a}Bd`z$MSK9S+);Lf5Ah3zNb=t6tnBIby;
zh=T^6TgRI?mfw+43{anePu7G7nx#ToIr<}`b9j+mDDx;*`?{d`1&%lUCESR`RHZ==
z5r#fc^o(It<yF1Bemi14B|KgV5lEs1d!7Oi=XNDcx}$!ptfOQ5-(Mhqr~AQ=B<>mz
zAfPm`|7MT+_jLbvYYHxjOu7&haAzdZGZ_&wn3zziC^92(8c^`M6f-!iQAjs#q3^9y
zf6)9wvY}KO;l9EPWjbGuVlvVXHNIuO3I&65mj3Ur4{$>)T@lnxHCIc=qMZ<$4tlW)
zG(BZkn{%Ot?LShB3~K%1K*2Z=jGAG%IN?aiQ*wyN@s=H7O6VpyzE~Nj-GJ+=OhrYm
zD%>u<vcet0okJhq)Yd<)mXqvmCZzcr7~x+^nW#bN;MbBA<Y+76ZX&d%9w<Yx52D$$
zo5~b66r-{9=mw@LWbMOQA!>ZB#FxaAlMAs@;Bn3YNI#yUxLE_DO*#^&!y!E<7~>d4
zz!Fq>%`*p4!?k9ZW@PTrl+c;N!D*{K$8PZ$s3^B)V9;gYoM>5U4b?_v!r5wTJV$SF
z9MD$KEml}+fna{-8bPrnpQe-3X6@^Qdw4eNJ2UA9O$}>p&0)a+K7Jqq6wn^q&NrgV
zQPb`2OY<aDY+CC~%`G@gph7gWOGZ}<@{#6TAl4H5!TKB`q=~|3tM1I9OAW~-r^DJM
zuERMS@$<GngLs9qRY<(3I=dfJgWsGf(^OOFr|UM3)oD#&A|{+So9YX>XXu=KR1qM>
zjH#1K^>(#{3ch(wHg4-MJ(9WYp?T!d7ogIPN_eVhT9r2sMbazkPzpvz(j_-h<qt=?
z$d*cB06SL(8KP>q>IA|{&w0Q^5PMkxW3=t;CcYWUPx&m$GVaaCT>2EoS$K0fRH*{m
zyaDoF`uWmwJncxUbUK_S3n$+Kkj4pPWU8@560S=}3t+D*=QiT7lj=)fg~9y$GPhXL
zw_x?HCaQRY_;CIa?@$>qHfBa@A)s8U_=75%Y}(a`2PxXJ!Vm$0CyFT?98xZyCwSI~
zN^}Z4Tq}Md8EyH72!CoQZ|juy!+UHH;tcY@8j^E^GE6zP9}8EDGm>vaAm1)vi9(64
z4UtqHTf`)F2B6ZJVB(q1u_Q21Uql^7ExZA`mZSuj^+}M0$ldc+pkM!R7pftUQGEUd
zAJhNnCi&ZSEn?+tVr%wqD<ia2{=&{zI4SJ3V@NO+4B!-qB*H>*g$U;)nFxxClgvaj
zwtM9og6=y?f&c9=CLK(s<^%YPYC2y^mI}efrtjkV;^M2^$2{Qs^$vCbiJ5}iaZ!|z
ze)W(nm_itehPt@WU@%Y{U)5i!OuxR&ZWu-!Ef%naPOiu11ivn~Js=0p1a1OhpJh30
z2Yv)`jny%Y<S4c|<poD8G?i(l^JN!)y}y$F6L~S$!K_4Tuk~^!_(6Mf&F5lFI0jD5
ziINT*r-D{z?s(T$(nHABbW%CTeRS)%{3k_c36@yTpAtmfre3SEo&)IKesdL1mw2;x
zxYa>Xl9nMuioD#M<dk%nWwiEfRrOzjApj@|%xmmO7ukLOaWVod&xxb~()e-CQKqs&
zl|fc>PIIR5JFo|cWIR~UsisJ;cyit&P4&iLHPCr3eZ$!S?r|B#c=%GzB_a?y^3w<A
z6Ih;<v}lk)nn&i9t0M^ss<|{Fx3)PG8Htmo6CQ)#aCU==Mf_SY2Ci{RNCu`<-%2vG
zW;#PpX5wPC8yNMJsMX0=gTpz(E9y_NW6UCa=zg0{Wpg)HU8>Kgv5!acYffjOG`o@p
z;P@{N-_v@l?~$3Ebd?#}CA;|gXHG^pP!5yQD$FFwQ=Rpt@S9T$jI9BBubB9!p?xIZ
zA5qXvL{lel;HY-co};7OZlHN_bk;c<)g}BBBw4I^<st0VVUiVys*dX8kySXY1WpN6
zS^2a|*02PJr8iuiXo!nl^CCGg2+>!U@e|Bgk4Wd#R3=kRe$ICbA`D$2UkI@fdiF!o
z$=#0Gw{TX3N<xH<1iPTH68Duq#me&gORO<h&6pH1;FGQS3yJYw<2Us(3ls^zqPraS
zOVLW-^jIy6m~thSmoVjuavYJ|Lj5X-$Q{9=^r3p8On^SI$nhjn2~Lobu?BIpu;vbR
zlP&=u*_W-7FSt1Omg>z}5;55|R#;ZSffy}aT58!3mUJnWMUMk+D+>;F&`i3cSapv`
zNy5dPaMh?tuTgC$N5+_rh*x?Q51e<MXuO3nei664v*;bSn1AEzWMKS>7!(Mo=s)7?
zAJdbAow39Jn4aR)wOp3f(Y{hSlkDu>g`wberVg=!H(*Se?2><AB`2~|Q|naO?vTO6
zA4@wYFXdg+?C59{@Q4^pvr?#-zb&=Pe@lIfTyQ0G;IRyc%=eycH~T*GNF;xM-6RMA
z;|*LflANn75{kpW3IB`(#t5N3q>YcbW6eL<L5eX_ml*QIpyWI>jT}-4bHagEpKs*E
z9itla<RBR1l5Ko&A?8hxLRT?zEo6wq^yDKPaYbT)a0+6(?~atArFRLY$=xT%(9r6c
z5jIIuO;RqZNrVZewjs76uQLP3FL~H3Zo_j)hjU?fHxES&uR8$-{}U2!)iI848|BI0
zRBKael2R`hud>Ewg|lA9x8R~LWH_=!ZL?fyG<A0=th}kB%{+@icY>47MSO)lt)JKx
zT=%NGnT(qfv*c<bl0OZ->od7#)x~ekX+M+(3xi|VX-GH49Ad=1<US1-FFUQ8MVu-v
zGi$CV<heApN$s^{$Z8ihEr<J7>-x-u6x5rkw4k2`7DV*~HDfG4Fwir=R;oq|mDvc!
z>?t;2elVbxgswS~Jix4v-Vwj9+CzT}v5V#j>j2vmf(zJ1_e8vb^$kQ+^BsXXdBu_e
z@FTyV6)5rWx-a1j-ewWZ;aKTy!lXtHoV^GO&9>R2>}+X1R(4R|lJ}v!;IM$~?dt^H
zIEw81d=TA|+CzVg1p1%qu=C3T%?{SO&~qtVQvcL#rJE^c?ew(^%|Xqtn4Hw4@S^(J
zVea~o0(>nrY3EmUgic>xgROrbp?k0HeBpciQ>lYGLr<aNR&w5w+yPDBWMQCHou}&g
zOj&3+_cT_k?Gc4*myTfx3c)6x*EzEy8vw0WZg~bt^AlYwr^(tY4Pv8U;^`i#z|mo4
zmAnB_wY}~Vnx~G-#Y8)txuuo~Wk@!ilTV%8Bn`(#E;ZFqjlKOHS;1^@SY%69k+Ro9
z?iaL5#x#Lm6o_nt^pNWbtp!|{dQjt&WHCTM?&Os>pWxaA*~z6W&YNWRK0nmF8KM^*
zqgSXkv(Q~2$!L^fVl=M}ejT^Un=a*V$H9$BE7SL*lA%tT@5&&Yja75;c$n{q_Kqy~
z?-^ub>{)lyV8Y1i`jHYM;mk;6nrZu?fIm%Ukt;xplCPoPUo@H=s@P!j4U<)-9Nz$Z
z=?X26#yox*WUBKb!WTIS<+4xx$K-8^&4$V{M94yk8=<IOiP<opN<ASWoKO59^p%tK
zw~uP^=VK&YA*%jxD=iP$-><23HAq~n+g`UfdaTKGXtPCD*@#xlAGoVZNTgm!!N>Ao
zjj(c|O(BZ*<f+}zMzIU{<hJ8h9`XFc8IDlYc;yqHrLUC^D8IP1RdTr_(mmG!+T(s@
zbP<1QEN>9EN5kLG3*T*RuV#!;^TMsH{D$@-Jom(k+YK+_ZtYp3@Y;?W(+*vJs)O`G
z{~=2tj^t-8B-FziFoPqB;`G9!Ro;{cWiHE0I4n>7k#r3Vr=$?xgiLD6rz*>$VBx!I
zfcuP!f1hHT;PHxig>c?qSk#f=u_LZ$m+RKGmf}J1p;Fx(1^}vnQU@W<6@&eZi8PG;
z6^ptJeb231+byaF+7gfU3*mGyLBRb}AEfbUE~H-?s4I%iFd9e}H4qkTpM<-r^*w5k
zv_p8kUpij_T?mgzq0d*Q?+L47Cuew0`dT?vQ-Xy|D*<iTV_}L8>h0V;t#~MZhlu}l
z(mC~sjq^$1?~-b?yZD6sS2=xv{%<8!)XK=#!Q%f}5TUXxi1yV+S4wxV7EDEADI^zz
zbjv*@R)hu&TdWI+WeB1*V<O8VD~rGRBEqL-;Xe9%LBx2ol~SQ8MUKnooX6b8$JfIr
zWuTMoNTMhpo*r(@5mm%#dkmj?Cr(5}TRICX+(}_j5|0T^oC(nHjb^gMMKJ1DB@lT;
zOfY%W6if+|&&2xvK7@;7VmUnzJ?tC}ZiLY(Ae1j<1RIcDq{4F}?Z7PhBYqNl^I_<e
z=42TEx*nGYLra@xh&@kw&6(E-6C0xCBgo10Tzqu>6}jE77YXdR6i;w;J@-fV^jVnf
z4X=)ss=0DfZm&*=&goa52_RE(F+>V|r-P)78hzQbem^W4d!~BASYAkewCAyBBsf?M
zUB+{C0oAbyuDi0~m7aJmJ<QBGBghJHuSr2%W(*DsSEQ;vYEujFEIFiGQ>`_LK6On$
zSl|T3S`phiwO?cAP4I#9%W&s4!67$DSDq(fd|angeF{^vXubB`Z+jWpF%&eC%byy|
zS7|cy*FgGKdbV5<^RwDzL*TliS+p!W@ZO%^aAu>RliR8%&H@GwzkZNp(+5lI8IkoW
zzm<-sY*z(MlsRST?sK#S6!dfIfJCED4;@`6mEyZkeOXEAalQdYU%)jMWRLAwq{;13
zCz0!rsdfyjZ{koyf|HB;RGODvTgJ|p)9F*o(xsJ~BmJMv%&au!eAG9#Dgvma0tm0V
zN<?<KlZ79j_5pU^I8xM0W#svPOI$9Y^O#t1hP>HF@ExM?-{&>s0pgsIdsBEJ_@sDM
zB+95c)t2>AQw*~HVvmr<I+T%=+SQ7`5t32rzE{|*+Lo2XB+&CxmBkJNUiC?UYzx72
zM0*2)ZIQF=dWL;SoJcLp3Tg#IH+#Y=e!x%3k$C=7+sfeF1y}w>&cptzw*9wEXZ{y?
z_!mE?0Ar6L4Fv*;4vx$YL>kaRIzeN^bB^@<VH#oTxFL6C5A+Go|Ekc!sA`p#!241{
z>*Gw6A)&mr>=CfD%qHOP|A|ltNfHSmDq<;08%bk{SPZ((>Kd*XuL-30D;9F0E|xF)
zG29WKBlXQ3s6Ew@Cy+<F4|j;~k$R~C?}lbe5DD>CF-Zts1V<bj(9`0&)rAc}B~|9Q
zT1jSA9{Nox)8A6cF`$UgXB*9Dc8j<bZdfTTDI;sap&r&;*pOWcO?ed;YX?1@gIe#)
z02jVyX{@)ma`cvtiJ4;>g_z+ho|dVg*-6M@=1^U^(39tuY%E({y9x>HT4k&1vm%|{
zMpL(vdb`wCWE5KhoxnMFn0q+JMZs8gz$5{p0{6!Yt=zus@F8EsNkq#EXUND<Dc))Z
zX?cn%Mk<~%bD43zDNxLeB(OHj1UhD9gfrhrYuF_o({u7pTFtwzc-K%YWUeWiEFy@k
z)eXs0hXEApCDaVs;^&H<MhDz%0M1-tkp(Y!0-@}XV-e?kE#<5+CG3-q(PB&92kmrm
zw0Nwq>H!W!N`4ESGDSQ>kUe+il(YtCPPKYgUKxrTIEU4^#pJk-Ga0ZFPmu-lQ1RA9
zEP(<VPdNY~6T~k$xaAK>sq)uVN4J>%-K229vARoeHnE_c%7Z@l-X@rcitC}nXz;NB
zy(vI04~)0l(7ZB^01>dty96+rrJ5{FTFqMl%(nZ^&UArM>sm_J*;!4ofe{%|x{=Rn
zK1fMGvArw%xve*|msR{qi(qTf-+EL^xWv~!XR<8y2nrjvu85*3X@EYnilRqahavn7
zQuG<eY<$vt;iq<BMXf7DWsGXuH(vY(9i{npeMk6-F!j`UkNxF9Ww0wICOS>5$clss
zeH~LYd{~9&iBLhB2Fa!-jY=Vhu*xM$Wrx7lzbLv-X-yQ$b}mU8=JuoIn)F>$)EpgU
z?b_%{)U@?mSiL=jWqcs%$5+6uRw#qWPdwWJQqc^_GZ9?+<%<fAM}YWB3w1g0>mI}3
zfNFJE4MY5kjd%P<HjeT?0QFBerD;I>qMe|BE4Vi|^SnY$h6fUjWx{OKh5;GFKr2cK
zld(ez!$6dBU&^zirf0dCa{%{L+to>|5^Tb#Z+R~Q)P#Nj8z-sz1g>iPSkkqvwmsGN
z+AwTAo3nT4n7&FqKTp5!KKDKEK3_XHf7A_20MVvOqqT^@8nV4%jbJ^}EHDlHR0nsm
zg++=f8W0s8I{~I@e3?;C6pbD%3?{bCXc7^^cE8_1kJX#p2kh$4!Zh3+eZtg_y2*Y4
zP5UX1MWE%z<7PUS#O9!>cIM=~wk0sS!-nW!Z;uTT!ta~Bbi^u9Rfe68U-j%Bj8lHT
zpp|$4eunM%|3y0jHWRwN0ul(<o5SZBUuuKr5A-3PCp!w(A<<|DLwwsJn&u&I!Ffyf
zjV{eLF+n}S5|}+>+uyM+pO2jSt^x^%{Y%YaCpf8u2qJ%3Z^ueiUScUiu3r6lO0*yO
z#bE0;Avd#Vfq<P&ZnWtc&n~l5jx5qyQ$%jRxj7}N%mEKA6w%6Gk8;#iD)up=dCKgb
z9m2(*(W2h`Cr_)`A<O=J5*?*lxISA|Il*G(F;j;v#Ivrv>kmo~ow;fXW2*>9OZ`e4
zUG{2;eH5x#TdQfp|6=SNgEMQpb?r{lv2EM7I<{@ww#|->j_%mD?cA~1vC}cWex6l(
zRqb!DdiS1HbN;^m9M?I<95`F}r8I5fU`6+{tlQg!kI&t7JTk!T@L*XQl(ys(7*POo
zLX9|UIE_;&$ZpLond0I-qihHK-oa=<^yw+1WNJS=bV`g$2zGON7pj^FY~^y1eJ)d|
z2_9B6u_lh(Yeo-|UZI~!+b?+Ef||L==ECfQ*x?w2TVn@7i#&yQWxBXYZph+ce6bA@
zZ&Uh!&lRCb@EyqP5jmpJzVNxA_$Mj1Zb1&a8GTN8$+xk6oVQh>(V(ZtG5M%%NY}{E
z7<rh_9QsJl2tBkn{J#17`Ay1Mv6$fc1Bl<fZyWj$Z&|!Dt_Rm($pZ&A?G>?`htxKf
zZI^w8chTQ1N$yF42oEShYxmiM^7k!31xL?8dkr-L#v#6>cUPX{La|Y0s<=x=i*(DB
zC3jn&b3+Tya6sAJKzm0~S+<d$!SvI2Ys<G&ig{M)ZY1zZJ^<bpGQI)(KO9U2Irb7_
z1!3R81JIvwKjqzdFe^mHUolwiwLu;B2`@$k!5R8{vEEu^zo5E?p<il=c*%&-r3kd{
zV9GV`pry=rOXp-j@QM;5D$3(4Y)sq_FiQO^Y}TBmi07@L^E!A2MEzaImNT}x&3?on
zok2SxPVrgAD4O9MrZtvc!7rg(PmtuobQWthH-`^z%8`*5YKJnViw$hfnYIU491@R;
zp9M#E_2^Zvf8<&RLk^RXyzFwZU%{+&J876ovf)7FEEn`Md!Z?DCpE<6wl#HTZ`aG<
z(_e}!$JB>>hFY&_^Lpr;5g)I+U^umG32|mRkVXg^9%mUKGy{K@m$-Vt%E6pnu~!HI
z<OpMWbOgkeOA^i4Z&h(NV&PY%=u}?SI)P1Wl!+||JK|ZisFwvNmg%L7ZT$U}^`1$w
zoQJDZK%3NlV7#*d!P!_XlSNHh<$M`0FOO?>j^Tmz9ZBKsY6ao!9+W(3KZc9W09zz6
zC9g%&1sR3JX0oJ`d>UHaC))V|+g+8~xr)kdF>6RCYF0@{Z8Ybh>Bwxdj>6q9`V1fQ
zC^Iczr|C%YH?NUWSDi+PHQb-$>K)f+-S*41#N&q$G73CvcjZx`Bela_DrebKb0k6m
z3wSc7VjxSZ`q10M<Cq25FZkM<m<nsAhl@FPEp6p@gZrx9<|=bL91FZ<BP!Y+gtL(?
zzOeY*4YH>uru;74OQS3W9IsAIG{X1?$AzdO22?IpO$#;^6r>;Wha?-G>s1YOK<jB=
zj}&+<0J2V|<j@~U3bkf%IQpCl7-_YL(+M}+bCR@?B8H3|TN_yzZI#alcPcjHRv=+>
zN7JAj_fl`R6@9xl(Bxx?CENOUG4`O=L*}ZyLGkc|gaX;K#C2ukg3e`?4a>RMjJEXb
zu67mastDsg!?U9BdCCn`aUEMM2?PPe_6@fc8sgxn3}r}2LMI>m_KpAZPNw)SRSFmt
zb~qGaprnbk)<Z+MF(#wg=JABAUBW0*fG3(+_Y})4Yw(@XcW6X)42@TsBk2GfbffK3
zW;?7@GFCrK^Lk51ah%f20at+s0J96CG}a%aGw12CgMCsViAHfJZ$>ZnPUgNTRxqm^
z=4cv<+_f?;GV(a<yD&!suDC`Hrh2ZpEWcfcuqTvFDTC!cK2K!fZ*FK^Of*dS0zKzS
zap0nQkuHu5Y4eab)^sHa9LB6!a}h@mb^!u460Clnt^4v#d;YqC64Y9xDFD)x!h@7w
zm{io1j?{koWu75q+d~NBF|=eswBx~lOsooZqIV0L`I5usIZ~Z(;&aMN5C)rX4tPE#
zg353k_J7W0rY~3Ks&+67blT|SxVW42`%mGE*<C{k_jj-j6tm-z3CM^2bfPF0n!0~7
zJl$YkLCx?$g2gh(Kqo6_!#J|74wk)vs948k2In-wu^*A%6b5NS*VyCO@8Gg|({=8S
zRHroScNu-D;-YL-vA!abc2Ebfld9xuV3vSaP?l1k3|Vk~zZ!tsjAL~|%(dkskBf1^
z!BklEWVGt~$tLgvhp;$VPAd+U1!uBNUuu$$lm1w4>O>@EK7twDC(2t&-J4NtPQqq^
zJ~BMSQ^Nw`a-twkzf}z5D6vf{q)2l?=2S=eMT-YG87Lia3WWo-To0)TrX$r9FXe_k
zRz3_GwG6%(biI&(Cn%-B9`TX{zCfAXBH7|mTup0D+OYbkUyM4}WQAxlGZ#o$`Xy0a
zzXgQm75=d*)XhR)m%BZ{f^SRodjiSn<%_A&-7B1Co5d?GDd4JY(<yhiD6OYi6(7Sk
zku2eiL1%UE-%x#aik@Oc%e0_=o1L%oBtU+B5-V*<chp**;l@4&%?#3En{UP}|E^CG
z?X8S_Et-f*b_b)>lA}7rs&uG^;uTj1wI>$2KPZokIbY=xpmuflZw}4B9b_>M_3axN
z@_!11kp2yXTpW#DO)US{u9Y}VNJCY%Wr1T^FUn-8J$}W)!Zw-(2sFLnUsT@<ErS!k
zBfXj4v0!IT;hIzYxafZBcw|@wM^n52_qpC`PIp^rKG%Ls^Dv<3>+MbP+VPlaf6DW@
zYX397bKQgZtp#9UtQdArN2jS-)raz^y6dZJxHo_$>O^2t`%XX-fDpH5<mm|~>=_y+
zF>$Sgo-tH(G|SA)hx9WJWY3A2k3gaBMsy?@OCb$h!HADNymapry^c7~XfHD<hdd_N
zZjZa+!^Ld;-q=$>A1NfrllWi<i_y4ibwI{+I-Nz|eD5e$L(`M|Kn+8G+A}U}g+<?D
z?@w$Do$i!pNEj!}w&~t<Y^$ax?SUP}_DtK*KuPQ*U02AhJZw5^O`Rk8fgZ;8blb#$
z57u?_jljqoy>H;H5G<jw@9KaA7Gbj^`+*6Dz|3=Km;#G{*&Z-<R`Z$ezy(8K_Bl9=
zk)_9UZ!)%4^O@$r2BT-@8R8&2)`7Wa`WfM%GxnOfXZG1+1QAQn^gZ&{WJCc=(Cj_-
z)@6hdtJm}$@<1c@%k&-dU?uj;{5||uXXF~I*Wx|sR$?R{E5Q6c>{c+gm*sQhnfHKD
zwl7q62+bIVRV<@W76X-4jcGW8CUaj_O?F9^UA9>kEW?%}!ioq;1o)G&Y=JYSI@$yR
z441`ahBsQzutEhC$Y!&AgjulyrZZa%aYmZRfsO!VS<*~#<~Va{rZ^*<$tHB*vg|=d
zi_v=8X|3!Av)wFPo)sj(8vrfK%W^rymS|-G(957;mNU0D%o<=zEl;%40BmIdm@j9V
zAXQLRSb?qp{!HzRN8_yi#filcwqz>|pe>*~^EcDwU=t(IU-pd^zt5EjC?qQda0j5N
zKqgNvj;ENP8BZ|bPqC#_PcBZUnA~OD$=+wc$ch0_R1kr_0B~8@Oz%ttBc7B~Cct23
zydh80DHWh7Gv0_N?UV~}kSTA-lXyx7NY0cu;z>Pa0{}B;40)1I=>UzHGe$h=r+k3>
zOa{Y_gi{AuOlG|)S7=~~Y&x^vj4L=WRaS#pZ`u_e*etuktT)>fX~hhLm*r&H8ggX?
z(#y88Y>l|`0#N`ZvXdECh8@XP+&~yWs;md|)^t<!DFMJI^U9<n{}coOnMq*mopFi`
zkjPYL<sW(A0;0+)u<#E*umM?RXIc11ANYW<vWzU<rt_1|4Ks}==%I=gonZa;JY3v@
z+#K0cC8I5AFqyjEpuwpV6ft70k-L^|3e?H?ojMJxOF2_AeyuuZcRZm29VQg%)N*Le
z@Py2;#GAWrZBXoTnK``OrJY;!P2?Mm!UOo3#sXT>Zp3gnJ?_aBRaH`&R~ZwpZX?>=
zdBPKRQ)4*RfM@o$Fy;ndJRp^I<!NQ55Ko-q%5i;7_jLC8Z<dHQ@EH9#pv^;vn8VPi
zoHwk|2Rnb}X7adu8~A+w&`^PsclLG^u=62L?0WR{IwLjC9NGFU`f|;`E}Lff6wI43
z{xT!l1hT{FH9;U6IQkGJmOpaJ`l>71P&>64M$Kt3;mM6WULF>#QAQa3gI6x)(l3bV
zSO59AJKVHaNkMsVHeI_2{VR+7*RR_B2ZfY=SxmXcFBIX6l!0~jPL$Hx(;cVR@Sf(A
zPA)$M!J$(L?1p~7KNimSVvgZwduZ~a5e#D~9b}pb<8Gd?Nc)ZG8M&vDorT@`Cl;ZS
z7Q}1xSyhW2;?srrnWoD!F(fKzb7G-x0+}vib2K`KE0VM_<B#sGq{OKMFC4?gVa$=}
z_iM7_D=SUX$~84~02qA^n~7E$b$g_7iVd|!xjS66Nmojs{lLnSd~#L3klZ{y`9hd%
zMBV8h?_yFpm<t-yo(|S?dQFwBjMRA?qNPiHp<+ctq!ozdRMpV(?o!nx5yJecKr5~q
ze%5u6iRMoVHFCz>na8zNyXYs*3M5uCb`7q2q=F8i{qgOAUx~sEqz8Z4Swt4tCw;aq
z^Qak}v|cQkvz59dTWOFMvl%^4gLUXA){}*Ke+`!=CkH`Wuns5Hv{Xp-HE5fVdlW=k
zk4#TMwL&jYIqfDYQx2;l5lCH<fq<E{W}i!$O53+8a=`M*^%*jOnF))DO$nP6l9*f!
zEXY3-rv|B1*ltfg9g2z3-|5ttm#BAFC*9rUrSUPISFV4zy;eD`ImuDeqn=&0q{+<A
zN2As35(+Y0O~xm|HG6R7qy<k$&H-dBU~Ks|B+z*|n|^n=EK(|G@G=&Fn)^Mz@Y0oy
z$}-<^QetkGRor0T@GC3Hi%2SYphp;U9!9T_=je!sHS8)h^G&VCFj@;%S$~=K`<Z7*
zF}z-$Mv4}hGyTrF#w1GXOI_)q3_VEm913sbwoDZ@NK$8XnY1f#+Dgf_0+EJ?Rfti`
zSWiy3S}#gf9W8kcU>Rbna@@(?E^HZM@6fZTLAy*BSzEJUow#W%feg_cJ*&9L8C9}G
zGMAi;YZ^wB?59hMo~vJzf&^<%oQzUvO>B*pWKN1jWEX9(UUgODB*<V|EnWNwmqy|5
z`F-&N$1s${EC$<7^T0+2R7z}}){BA)<$RzyGY9LZvR9Itjgmp$urF@CeT+AoRdU+`
zl`Fyvj#!~NeASruxFHkS<HjG+yQnC}WwvBub|09;&D#*N@+%D3C|#ToynAqpQR5fW
z`opXXRZ$HCB}d-iZRx7vRB(-W`@+WEaeu4jGRf*%8pKeHRPce;`Jg#b@WP7SnRBNY
z=SUTPXPmb#CE&WTGRJytW3}*NZ6o@`n1_~eFQv1AR1~>l)RuBccq)&Q><K%Nd{I1A
zwj^}S0J<W~bRi40Ubf^n0G35a3^LTv8M{^u;>wrv{MxEx%9NUULrZQ~OIXfLFXpaR
z$mOzgggMLyMy$y4#z~iEGhS9oL4Uq}VKLBYKA)3hFUGs)dE3Jqymj+!gr!E>O!+K@
ze3vcE`Xe$Gu@2)8eBGJ5zP*7l#2JjK3B7jVd1BnD*pE)CkNo+3h(=A1Qg%c6d}Uc_
z)GUzU2C1tEc{iaNx^?P3p;8^BsLcvd>GN7Ju||ZlG_lQhW0qYKZZ{A&9%?gbt@+x=
zhFcpI64t^Fi1x5l7O!52{&g}X6K=uG%iHYy5~C6ni)id6FD+wrZYeY$my$zay{@Iv
zdgF91v6nZSFfw`pj3Ue_?Whl}$|3X2pHdiff5P%~3s;ZK8=do>4z<~1+XqxgYZHbv
zRNW%Av~IlP7_M9l^e(Sypq)U`H3+O~!K(#ona(|x7)Ro8D%=e4Wb`;o?X>-LsnPGZ
zgq5oM7i`mrX?~Rmvm8M-$%(KlYt3e7OGe980aGK?GDGBq*{E0M%f5rX3RfnVl|`sX
zwDqSCg#rspz2#LU7qmG9y`^&x++L?_ZSWYct-=mLotCA?r`7tTP}FFQXjCN2=VX?5
zliQS|>dfw(an;jQ;8oI~-D=R~WLT=<Vz@J0J}|P;7LA?8&+mrmVa_=2^jkRTMF8uT
z%(CgXjbg?D{i^%H8FJ3g-}8unwc(a$7cY-fJv1f+V@Jo_2e)aTP)U{*{R$OABZDpc
zrRt}Yz!n*-{@BiFmH#Gv>O<_*p0BNORoZZJuVVItMPq_2X-&3)iouTui~@ST_=ob^
z<)27f_dlmY7_`NjXPd%}DX$V~(e3uN%w_BlK5gB<=Zb8QFz*+2+k@dRG$cZh-^@Q3
z+5uWI$Qm|{!I~FI=XKcyM?!7`V6Am6YpSI2Z|1P9-fou;M=~EBLtLdmn-%uq$PdMr
zh~Ccv>t*2`Q=#;%kPkU?n}Y45_d&kWQTFG$k^GBxV~+A!6SY$(yAMx8Vs{R&#iu`6
z<*DtvslErA-kY(3Wnsk`(iJ97-ny0IN*+erv}J?aZRG;7hp^bqsesXDOSH>z4>FlE
zBcn}O!ZSCWs%V$yuBC{ITwj(lp(2{@QIE>T(#m)H6O##tM821<iP17e^QGkl;&AP}
z%_L!-AITi-DAju7UA8NNmg7y!qg5<ssZqra%uKr<Q^qug0A#sWY}K+dE5GUio3hTu
zEs09<t83%*Hpn*y=~aXBN3QCWx_o6k#6KcIbCV&xBxV?5Zh}dzlv^zWAJ$lP%Nsc-
z_B*VZo1xw;`<mPa`;rkG+oWgxey_dge=wE`D2r!KLmq&-Be<2yB5)nq7kNYuiDy}n
z37RVhTiPUF=yt&!ur`TU`Fl3F@=VvpA3A8|B}r_wsJxUIu75%)b5x)9jE)3OBI^7F
zo=N=Lt#6!3Vtka(hB~Kj{IZul880-Hb7~JkY;CoOm8KKEtca5Mj~Oy3JXt7Pujt>J
zZ+kao-UUB2S<_O_s^>Pn2UrSBU2GuTwyrCeLI3<c3<)fZJ_A2>J|?V3!?pZrZ$8h*
zh!mt$zD3p&EAarsx#j&VxcUlF1@3#msc6lqgj6X0GIG8k?nYME424tn?N8N$F4>#g
z^RjydHRx<(l!|Xe-|2R|z>QxPD|>R!a3NA07WO$wSCNoh<a|j<HNG(*f4eoj#Z?=i
z{{?z%te(ApTxePHd=)6S8VekJ0-c8DMzXH{$q;rURyVI4SrvSegKoIig-0VE{WVG4
zf=8nvWEo#3xJ@>pIt?9XU0sXSj8~B^G_72w2g5#T)CX4B@OooySqr-&mL8%<SRS(&
zwLfzqHm6Id0v}6bW0+8;n_5-3f-2}%nEA)eB*t(|(uAF>4y7YivDGxnw$+Q;mPxz0
zeeYq&M3I_Kyf!p0jV_FMBs1=uyB?3D+~jm>&bx9(8(z&#UAUv^^nyIbkawq4dhN~t
zqrdLg^z<v=hVFYTgAE?kV+7t*NYD)riTIF4#2ehI>^nuMe=O9UCi16~;h=jRdu)XF
ztp|*3AirTD6+bkOQA1gg)Z)T7v4YdEa!2$F2#>+5IvBtp{~QdWFfJc_<F3~#u6~H$
zuAAflWkRq+e^@?I9F(4<A{qf+EXLF@&DcKCjiXOS#6baBc=v{><S-^l`VgT_8Wyb&
zEMz!+1igg}-)0ap#7|ell>Q=oNi4pRpn3?0qrPQ`pDu>DA+2t^wGa-+eUA`7Jq#g3
z&hax0Z{iUyOm9RX-8nolAt|u=)`B2HO1YSpcEusx**!TS0oYxgU_Mxzhd&zof%vPy
zT@1)a7SC|7YKT^DCg83X!W4(61LSY4uAg9UI9>T*Z@9jJV30Vz31Cto8~Bn|d_z}t
zdSJYlO+k9@BYh#4?GWad_Fyh87KYn-7KZ%{IGPPUa5)Z)OpXOxHoL@+#1I75gyy?@
zkH`=NR)l7|^N-9B1U7^gySI<f5P6pQrn}>h)DU^r`R2Q)kJu1-R{3VTYmeLzc{ceL
zyDyL65c-w|mb*I_F>qb0Jwtsmmy>W^n>_=4w3n4|UF$s~eKwcpa9!K_rn|;(5MT~X
z4lFn3Zx~<>%?_+L?mkgLGM8o$+eSN9yUspgL9~~ha9y3VhN*r(gPzu(uswS}0)r6O
z5wV}^J|csDu2;hQPWf;4QC?8O`%d_;_gP$6!28blZ}(wdV8Z*3`>*wBTxh`iPWx~5
zab9r3`%e0A^m$x(!28bn@AUO<5Mn(Sd?W@DZscP<mw#ji<!=~ZJ(qkSg7r3hS?%^-
z)WW~Fe#8astnXkycYlNg39bubKR15F1bx*9u-|aLd4PR6BKckr@koL|b7LV$4)t69
zpo8QlLPr<@RX#Q3BT_?9hb$iHUk`+HoI{8_*zF61b9U?wth(Oa4P4}I6Z*m7>R1#Q
z8Gs9EiV7J4VX6Z8g_1Chx5-DO!^K5Mq{G9-M?{K;hn=8=5RV`^(9aBleZH#>vbNsu
z1hO{LZwGd#0oe*W_J|OVIEH|*3~3r1!V6(a2}ucIY60m1Jw^se30d6VPYsfJW@z%m
z-OaHzP}arqDez*?P~}G!ehxtbKfW#Wm_EV`lw@Uy9Z2TsZdKrvyW@4>l#^q=TWe!&
z$Q!t603>1p8JF`svtvnLH&TR%Arl@<_MlN6IvxV=0J5=%pz_6uM8A+Do9P~wCe-MF
z)Bd%VBcCn|WuGw@@>O8+E(n*_#an6Q$EWHulzd3-p6fIE%#UzZC!(A%kv&^H_~S_a
zPu(2QV<Xs{pKtx(#<jgrGLF;)(CK^Bj@)^O8oQ~E<lEmh_MF>r2t#ddtlBUPLe6i%
z+6a1s#hy{=07#oZmK;f!`sJFqH)T!sFe)N+tY|jH=^c45VP(ot(-!zN#UuLhT}d{j
zj{BTD;MC`gHKitZ89ETJ0F;L4-EdEHK8}ojAW!p8j=fy2d`K0ckRs>(A_a1Ldvlha
zWKH~hI9YI&BGWgTmJXhLDZ!M&+@36punJ-EA*CV~1FQuxduwxUH@YY8o&rrU`cT#3
zm?DgQG6k)BM{}h&(kHl{><_qI80Mb*7k#*UaeLD@P@c41^j-Md*xS(82-o2j13r5p
zyB{~Y&rE!T0x*Q|gb@lM3Imt}rF)fojW_f+UY_K>$o^P8aDuQqp*w*NgM@<~dk(vA
zH-tALWC()dXS=0iOwZg6@b4&V;Gd{g;Rd8{eGZ9i?*!ESgo#DNW>0WVP+i}t8?Z<d
zd6{v%plC^Ejp*(;)WroxJr5zPqQmQWv}4%ki8XQYqvTzE@UU`&LkfNNyyw9jKTdS<
z@bn_x<`0}gPPn<qyut19y0JN<w!=h<DxDfnWZJwQ{5DBm(Gg-kgLSkq5LzMjp=?y}
ztm68WmcQfKU4}#3P{bp9gz7r7u4?CqALR>G-t=+P-uyCC#QjC=#~GHvg3HiD8ajlU
z!Swa-wucfjF&hN5Z{IMe{%=K9F<V<JN0<M-hxqiL{`*gHBHXk+2=w8%3F2R#F_Ad6
zRO!J)+am6=7zg&&9wBKC`>4;O4bn1&C29hJh-Pd2QPAWk>X$40f1e%Kr>R+k9sh4!
z@#wf<T*jn9rnD`jW~6aNRq)Jktg%dZCg}$kd=rDH)m%|3aHZHYb(eHD$F@168F8>!
z7HwlpMtezd{<`LE#>6Ij6@lnfqx2C^;G!)8+9;8Fj{KY*RCT<}?S<+~lHATQq%KOk
z-Y;HXVUL@fJXkUeP;3^y60olF9eH^Sy}HZ&UD^yuB}>qYmF>Yai9OvIV%^c=_TMX1
z9bNWL)EWi!75A#Hy%T@PkYvjVAk`heJ0}2F^bml4)tas{1ssXt+|fe}x{Z!{`w;fh
zrcRRsc2QEYQnDtcLvVu#;X>hBn~7~P+)-Yejdeuzk#8t6ZIrj)5XlLc`9@G-70C01
zv^3Mk`V;3o84@LgewEIA)y#-ZOk%R%Q%SaQQ4y^)7AG&7ss#V!x|xMjPUHLFVKE8n
z5pBo<kPO$h$15dB9!2$;t8BsREXTO!k&ejFK)I!%uII0|QAxRB=sHw5^B(z6AU3TD
zvbj=!Y<c0Ey%!QrRs85)M25tFb--ndwpm7I?kp}VHYb~FcG5RbX{{I#TPc{1l&rz~
zo`r!``D66()$6gAdx{1~9q?bR#Bul)6xt}THpzCIk)L-kOY~L8^LVB~vf=V8I~)^X
z&N;m-Tqee`PVwHHRu(koW#=icD7aji?v&~4#NI1jSSm|FYco|9Bzh7Zh_0lo8TZ|h
zy22MlyaGRdj$pi&5BKl<N|ZxdOz4DunmYmWs+*NQgB7LG>rZ26!+t@Zwz0G-s}Hwk
zU*xi?c9>6;4hZWGZ}G5H@C$yAb;nU{j%RnpDWO#pdfJy*mosGCqaxcgVmpAcg0>Yw
zc}pBX;<vGYreuoM;SyhQLQ^<tcXo<azaq`2d5Va{zOq;-pFOGi6=9|W-c6@-(ux<1
z_2D!M2Rki3BBegJLbM=)7U&WQbXgU1*tLoUPJ!T6*`)-DS%EF=%=bRjt}cxk)VUoS
zf^TfEgp5jprb8oUdgFb<|HIwDTvQAf*tc)9|JT-iF=uB7=l|+x_%H05lmDIZ8vTmU
zckirPPzMPMhK;t>*+8!rMuNj+EH4i$mJW8<cr2!)w#eS1|1(c17!@_!gH{wp*oSDA
z1568SLF{SEp32N*Wj$_XwFvlpeFW=+S!NqzE;7QP26w>`_A}A9ZdJuv&`cO9jNYKR
zD$`tW#GIs&1-Amn4nGMe&Do_E8IvVs3ia6HvB;p}4o=^oRJ-b~uavtB{UB`}tg}sv
zzf{?<UN1CK1D!>VqZ}mAqTasMonN(Y&XS)-z|&x|L~p%ZdWMz2h!uR|Tk-k5D%YBr
zj_yj9pqjAcgvcF!+FN<mlxv>r!*f^Xx;YBNe0=X^B{+AB1P(E*$$2slrBMSX)z4dE
zY_{Y1(qj3%$$OL+EWtxyl4{gKsM{Fk2v#%!uQPDhf!vnD;~(|YlF{<9Vzdk6eeVoR
znKfINEx1UZH3p8kSMLv`j*5AG2Ei5D(OkLiBDOQBHg68|2`IUIRuODPkk5?E79RGz
z&85%eb%Is*y3P3M#YS*=Qi6*AwBL^X&Aq}7mg8D(-@2QEcFitH8{dP!h`4Tu@#{C(
zj9<Jo`A8W#Oyf4D)AJLSai%kUJqf~1WJUbPe8w3=i$o8k0}r6rEPAna0F>t&=(TGo
z{5;|u=;79mNLOSz8ZwshXZ3E_)I|p4qgmCSDTo4Y?Bc{RX|pcEq(u<}r=$IMY?5yn
z$o(j;uWB$%rwyi#P%#;RFIeDGfH4gckcPQBu|-}sd#FhSnbXn%jx*rjZT)ysF!2JQ
z-@c*!Ut80}t!!=0O#lC;8t3Y05=fs}lQUPVM4Z>rzXdvJiLkl~sA`Nkgvf%4aM-8i
zJ9*ots#rrj-;=w-6%qtribnPLf9LQ8j#^CASKwojP_UNvR@Br~e0Fr0Z-3lBI(#eg
zv^_wI=7=|;iU`4KVGc&Eiergo&M|$?Gs@XR<IVqF$I8c_J;*J~lw;A>*CMsdu-+C*
zjhn7y+&192G|&|1*EVt!64nq#2+qUF$5{g%+3*7Z=(eWEs4LP8yG=2uwh5|&p^eJo
zzJAf?qh>mps;Z#0HsyajBfWPzd07hEO?>RO;K><dgmFy)O$T+K_3X*hGtime3)bF4
z<K|Swy=Pw{@(V~3vl}8^5nd|uO0~R*j+$LoWyACoNIZ3&IC{q?VJEDLK<B@7%JN5X
zyOa+@PqxXpm-G$Fr<;=09jzLIpVE5P+NbzUj^QY}k1=TUR}_liMzJvJ$((Q}Q9K-1
z1{hJE91ZqCuB6{#q`L+bgKUIk_(Ye4<pu^ThDaC5mv><w>~fC)HAB&~Be9@S5O_gX
z0jvNQ@`kNFFv90qZ{=y<4>k^$AP~y0dP}!;VyE0+Wc3v&VYBpq04)uK=QI{m9I9BS
zEa@IU8(FCoritu<niwaA*=+=&>lcLB9j@5jYWV5F-bgd$iq)qX$p{|~D#aRh`;i%2
zimv_U6myL(dTA+NqGB?6GTF$96W&<XFih$+CsU7Zj|zCdQ%<wx0*r;}BAq)1B~Zgm
z3r(FcTg~bkq&YF|mi`Ju;$LByE#;^PbKX**@f<wN*v0u10BApDA?+5k>Ram{XA^8E
zi#XZ&{g0=Hw`8|yuISpy!S1MLt{lA%^m|4Z=~-{cL*q9dOU2`m{C-gaxkF~s4dSsk
znSol%M*_PC&|XY^5wvLfCiZ#zLtIz3`OJz;)n;Y(?22~PW~q%ocw1rnxMLI@pFcGA
z$U6*-JX}=HtqNDD{K7C^)Af-cgKD8?3$mFMD5-xGN`BQH47o>c8|4%b{v#7H%&%h#
z3!J?1YB}Pujn8o;;644V<Ky=IER?wP82SaRVIXOG^cO~JQluh-XO7T~5H4&N7>@we
zS6Ob##9^@q!)T5kS=ya`sTM4W@Cj(V7udJ7R*R#Y+WN1#Jq(2R_EZKDlnjcgWLuHF
ze@QJ*`+;ovS0;%6qpt?$f0Oz@%z6FSjN~ABHl0YD82D{8Ogq$VJPsOrw0M!|-!LuW
z0!w|6p}A9NQt)<M!oYVvSkfw$a92X>QP$WvO1qqY3kU@I0Xivn0(@T}cDW`fAe@GV
zs76Ru!`h<0CrQgtb5$7XUdmJTHfa;Y%+;g9$kT9@*p{Zcj|`E`WN}5@!?3^r;B=Xg
z2gSgF5DeIDQ%HBAW*UAFX+^^+m#h6^;eNO8u=NZJOMNxPF+mo*M_x}Qt{0pOlVliJ
zJPkGE*xq+7q}Qq%=_Q<uX|$$Mnt7gTy2v)gh#ZBH8bYrfl*{TDNdfy60)+a={{79l
zfd#C2ljH<U8DgzxsfV%E0~cgUiR#Ob(&*)ba%GBmgKfq{lTPR>T;`5jeem&k_RgCF
z_VHc8#Ne$?5hfVm@tqm0iia7a{PEyZPIUVMqe;P#o|e1Fqb7XJHz^0$RHH1?co>o5
z0m)xEbl?Nj8pVY_ZtzIq{5CWf+;AHBYp%E-W?7WW@m_f5Y{E79lxo$&lGt=v(a4a@
zjBi`3d(!BSzc*Bogs+4iPv%sd#XmoaKwC3+D(s+$aI){VoJ-~Ithkm#`k7&yZbhG?
zhf=DW{R)o%^1#r>Up|h^Xs0Nv^&Xz<^vkyhYh-vA+bA>@Emr-*Ck5G*N}ToOXYj&_
z2P6D*lJUPdq!rl`l@RtfX_S#G>U<B*I_5ktV{G_AAy@jOfV(8DxlD+jv&76&Ar2Oh
zX=M#y%uX@Bwaa;!N|rf50qga$RN30&jssqFlrdpFP@QN|nT)%EI^Q}a=syvCs4%@+
z4nc275snZHbT@fNaJ+&jB<J@hmE){)%-0-Y@NmqpDT~lA5z)V6%$r)nCdy@8&*#2}
z*1$VzFE(Gvi8e1JR~2~N76IyhI)dtj7M=8AaqWvT1|gF%#}{#lamBImPajb2ljS9Z
z83`h=jR}ZKCg;kMb0Sq2C`dJi`;+sYveE@7s6RND6j9q?Stg#8KJ;mYo-)>8V(0Xu
zUE-0E{1Mf{Ql%vNgI-?}FkEwBae=k1GB|@cy-TcjArl%Q*|K+|@DFMSiu%$Ne^IOc
zj}aNxf1~z4=0o<VQh$Y!jKE@{9aWfU((jq*7UhaPbWk_^2Pic3-e!DhJtZ9L@)TFq
zque9(Bcd=Ua>$Q;5Kk&mwT;!tZ=};25*iw68fs6+jD!LpT*2(P2VAD4VXmAl#3rOM
zgHv)Wvdo8ApQg#AwtUn3^Y(ayPT{C<lv*Cq?LdxC;q4LZ9J34~E{nacI3-=fHp>FT
zy`(^Nn$c>pr|+Wm<ke7QGi^P%vrreZ(>3L8sg=Vu={k`jD~yZ~vrX5Zm4m+CQokCJ
zxU_!-EdTjay?(ET&rqTElWj}BOrK6wHTBs}j`2(^rxT~bdYE1em_GGsDkgRxbUq5I
zS8mMgXV9k)Wo;y7;IuZ4g{;7v&Oci%zW$tTY=9E5+Ym;JqTwW07<rCiFFCaj7^1&O
z$S_%*Vd`i4xq;&GPeRm*kw%v0q+ks0L4I`*G$ax(;c2@UHMFCMp-wLCNXC{YouY({
zWu3bp&oDf}=#zC{CfT;CFq!RAqQY(^5&e_*bJALQ*!M%h)-)(lwL^*JXCa&1{UMpU
zS@eBlNq<Yt$!NzEL9!aUc*oc<zMS253Lp>mir=j({ne2bsyT`<)3qEu#0(!3lo9G!
ztt{_6BUk>@ooqdh<Bf{Bv!bk990hB&ivf1RKx4k)T#-q-SQS=84mVc)m&4<mTZ;qE
z6fG<J&IL8<M6j~Ggk_nf42d<v<BcLjrOje@nVN)40=aUgD}?`|5`D_SyJA200qHC|
z&gZzL3M=WBv=v!1H6`n-=>p%-jR%JK5|gL&JzHxHUq_ZJ=ZSk=1KKllrs%53lV1)&
z0{sK<S4c0k2rrQ(od?Pl$tk*4-L&>^d{GLW(KL8htXG0u+!O1@C=Q$EH8Q8IuL8zo
zKSUoe{;wj=dx$%FZz)ShKim_}sULv&{-YH%IYZ7pHnKfp*M&*)#1Sl(RhiihGK2#(
zfFlC8ZYiZBvcxUc=qW+&uUwxoK;j!1nd}v1V`l3~tx2Sn0{)<E=Rc{@_YbMj$W(ce
zWYKdhD@qno>cG5VvOBCkEf`i2+PAu1?6Pk$6A-3?#;!*iJ-B&0M(6QSJR|xoIh2v0
zn9ztB{&?>&|8NLP(RU;Km&1+!M-CMoY`rWT?Eg0ow^VS|(7xz#8^)b=euWC_l+ibH
z5Qa8smU9H!70js;DIrPL4^VW%!y0imYH7PYj0?P+WU~sqC=>dY1B>xDZV_*$IW67|
zs*X2@zRS2-Jo@h3yUp_Ve*BrN{l?Hg?}Xxn4;>rs1S*AZBFXHQ*iQ~|0Jm-Kn0dLq
zhl)C-4}GB5HM&dFXa%5flQq&FeQO)p?Fh%^A;BXK#!j1JaZ?%03HJim9&W}D*ixOV
zPkf1(My;fqS4i3|zFhrm3I@)H;UDxQu0LHmTdzIYmNxBQX~%zr9hI0=!ho{YSW%zo
z*Wue(1=JdP(TW$yCe@u{Bc`>+!OVxqF^+%<vR`AT+I4E;=cgWvY>2au?xDMivu3X1
zgTFR(UZYoYXK%qF(dd}Z&<E%{<DWXj`a$RP)5Bv2Z9M-l1c|{(``$1Hoil<9TFOMm
zG_@;YE@)gAiyri|o~AC`4c;q=cNOXRy9c;{SzQ!8{9$KcA%sfb0Dlll3;IJ7j3t1?
z&_u!z(=3QzSJCmp5umDqTB*eFI27=h^m?S3|B|GE6g7eaPm3#GZk0tr*`rj*Rjcx+
z#SDA2Rr-QimAR`Tb#M7m0+BF!o}c#o;TRpSKu6P+UuL9s!u6EITP98LAWe_a!gD0=
zs1bPhg&_Ktb;K<#TZ`q|o>W9ZupEOu*zTaZVw)VSL^A9*+jtU~Lc`VJsF-h$t7r)$
z!`-6CA!>?R#gVGV7h-QTO7ps;eqj2$k}T=gM?Y2RHr%Rbp`q#_@i*Y1+dS#?u|l1;
zMDjsV-g#l1%wkOHn%9t63?3}n=Z5;`yhDQZkAn}lBK%w7`Lk<BbYl~w{DQI4X=yuT
zz@VJ$Pa$hGZzc=q_`q+$3y-7EDpa?k`1tH)D1sut!e>0+p?M5W*uU$fEUQPXn`SHu
zr3L~jaMx@Nts^f3ek2`<$gviRn5V@dNDi1k8b#cl99@$w^onTk-NNayM?TMT-F=s^
zIY|>$=!)NN9^EaTMa~gn?56^a6e5ZTiB(pU(oUe3-6g3p$#L&9JB->GM)wtaSZRxP
zNEm5tBJC~JdxlyW+sNkHIf3XQa{w7=MM=@{z#qkm;d#v?O$vzq6m#=#Q(A6Us<H8m
zrCr|-Cd1yYICvIGjecQe)*k)AyMY`EHG|R>MX)Xq(&Q^%7cDiwSr_j$q0+C@Ha9g?
z$j1Y%z)s3ojvDm&gY?mB4fy$k*E7Uk6jAX(FsU^B4C}od{j<&0J$=Ao;c=(%(N<Xp
zrZ_IC3#`8P-~9%RYz^GQf3Jds{}}zE|Myj(Y-ZwWWN%?>_P_Rn$oxA)rJii7Nr3_i
z)q^gUd;<k)%|=6l6f3SIgtU`wDv5DG(cBq%G~Z}Z$#*u~h!K^h{sQ){l(Ll_Mzya#
zy~5AG#lN*Pbx|94EeMh$E+v8}Z_O2E3EP1TM3NA+0fP&H6M=(v$6lr~79B1NSC6fK
zk%gVv#}i4~<J(}UOIvV6PG{2{;Tl8_hep>>lciC-0*=jTD(@Pw!pKVr{UVDq9w$C3
zG{TuN1CJ<LL;onr({zh<HlC@6YveNUVvsv%Zc?rX2k#k|7NW77!~t|QzmiZ^d+}>f
z$jJ0Bto)YtPJJL?jOqDJW=_|w&2slRmV#S5t)^bxC5wv(lq#fy^)TC>pElM)a7yVj
zk}c1`kTenB#bKeTf!+L}Zb<kDi)Y9+<`}t0VPBqs-WJCT^Jsg?t3|CrH{+&Zh;UDH
z1x;tDv@7r%JniPkF7Y5KpZcxnE_Gh{uW6StSTrK=G^Jwk)>O$uFS)CDXTi5m8B8VP
z35|H(QuU&G2ud^QgLVK_R1uIOF*j{JyCwE?jKl&?-EA_BO>GYSgOf`97?<YsaXOlO
z%g?TL3UW~#$f;Lzf>zsJ-ZdUSz5ugmnI-VFS<zv{!%z-0u-0n@upTb9?^(PQD^g5J
zVM;M*rjr7xNu42oJLY-wL1^W+1Li*hI?7*uBfz7EeYbU}Pp#D^ZxyyMc1S!X=m*W*
zbRO8S6Ajg;vORZQo=!9l=5cSUa}93Uq$y{8RgjaFP0;P4;Q739l!K2j>k#q{$e4li
zs|Uv`qTCSq0wsj+0PbD~QX+caCD3{V5s=3t5tOV!sD799j|~Vzxvn+QfbZ0Mf$zb2
zmt&t(T>{{cRUh#$z=v>Lj!%0ntY|uH<h%(I6D55<BQ`PQo}53rz4Zz&BE5zxzQaCN
z6;-#ChuK(qq)K+h#}Ch{mI(WSt{@Y~D%XM`VIAh<dM6UuVM)EV#+jh8Vhz&G%x&<=
zAl~BT9q`HO_TlOd=-hcmK>PNoO{~To5MW|IN8$gf73_(B<l)f@KRYo#Ek*uSumH7O
z->M})M9v>aWQPMFqb&OomQa56_V15L`$nD#=D*Ap{YUx5`9GQap9%w#9CU;5B+;DK
zC__-&;^1P#L^RIPkUV4}4OkxKTVixOLzFi^%~Jo_E#mu)aH7En1r>I#I;+;l+q<Lp
z^mHx1x98&<QzSYrKbH|{yeQZskyQ~Pr53Is*KmR{*EB=O1>X>m6`m``1@0J|q3)8z
zCf!z7e0>C6*Q{-X$<}B{9J7XXvyRDn5AefuYdj1bBoR3hqbZp&v{=_km$Hk(kw~Dv
zP``3f`vgq|Sa99;f_+`$p4+;vK>7RonM8LEhGnLsu3y0AQqrTvqH-b~Jhwr$0_Gyk
zsSl0PqIU+){gQS6ID`o2^rxl}cyiu>@`5B^vJ@XiU1>MFV5I{u9w0(g=@{V3p=#e#
zCO4#lCub~ZuhmA+9L|e^9jntu%N*o`@>H*|4>G79t{*PNmy$8iGz4c(KP5GFkT?Wt
zPEK$THKY=5q1kk!yAPfcMjl1yjDj<X;-#3nUU^)`VoU%I4e1A(%UfTPtY)g0^K<il
zHd=W}_k)7X1qMSQWm3IZ6McmZ99k_e@}g-`z0qt_@tE7#R_!Hd#xbaKe}j|!WPO+v
z2NqP$74wPDAp1S2KxSn=ZDp@a<KbQEs8WOH@E6#ZUCg>!wx8&fzMAW>ImKLupI$u8
zQ!~u(Ts(48k~Q|7m8O18@GQzteT%Q?!D5!&`_cRiB-ldTNkxwNG)qM-+ryEEH1(7C
zU~Bwoq2FVsCr$RvO7yA>ttG*TvaxI{WhN1ifJr#lRAmcaTuR{Qp)$AVr~$!<s=Fp2
ze%~LZ?!<2n*2rYpMZ_7}F@wMt@k7Xc{+BvrK)3j^kfI3z5uaq^&%=HJ+Htu^(*WpB
z4n>PYjYS6{WtAfKrHXRq1)S{y?zJ!UM+lsqBI+0HJJ>8s<>f5SIpdUNQ)s*Ue5&j|
z;sIjGfrGM9=!N|gaZrhbp>H1t4Eto^Qn(V)c}GMTPT~3sTI*gJz7w0QkyuxwugL~;
z%EG*pBPcwY;+CRTnrz18uFDH8D#D7vSPTW|RuA)xin~<f&Z{nw%87v=JM+zT><bj`
z*XQ&FZzAlvDP&B-o>Pl&&kp}^7eM4>#q^iEuK!o=9Ng^xh3|jk&Q1kS49Pz{eWP<4
zZ;u}3P8fyV=^6=&j2TLDQDh8T7zrwLsCCcXx%F_B|LHOK2=fE?6SVhPjMhWSDpj!W
zj<e)~AWetnmkzta)5F69-xjbjp!f5D@muoq%!pU)x+kFtcFtg19JH>5U6N7s9>kzr
zxDFg)-M!s5$21U;HKU(y5N}YzHrwJdKJMpjRGfm6p{C*U)IebzF&*<}vtrXt`;Vud
zV{vp4B{WI3CXE_VP%HGb7K96I<?E5(i#f+W^Id(Bja`*_l~Lk{YLv@GbN7?D{j8Th
zf+vm~t<-aBP`dPv-fQ=Nq)i+oB5<usrPE?@D?a{2S0ws##1}pmMU^Nn(dd^8G#fsa
z(pL1~cnaXJU!ujdkAgmW&q2v}&mS-il2xqh!Q%9E0%Q`SxMt?bYIgI&%%a{j6Fmdf
zU=1XzjP#7bFv$s6bPchL+J+o6jZk$^e%8_7Vkyx1Qs1KYq&-6@koACrZyQndH~%8f
zE3_>j*)!7E$F4x}xdDIOz-FdDO0Ueq21jA%0u7<O1>l*iojTqPerf4c<k$B8oXQF2
zZVv%fKh0TnOA8jQkQJ5JK9jK(6I?Kh&!{P{tBKJ)W1YE`<35AEjT~wDk!FA7k7VuQ
zzcp79b4q(&hNK$es1|0eAc5z45r9k9?%wz_a*bUq-Oe1edvwK2=w((d*E<P;l%zx)
z%X;0g3Y33RVr5OxT~iGZf$;Hf-EJHjl43onVl<|-O)Ml=uOrX9GoB(*js=^i+hM&7
zW5R8xY!?jGB+Z7+QMd?bw(OR@@XIAO*$e6rg_7BEXfPvI<dND<wKJcJf*<qKbJ`i9
z*_HZ+bX}!XpHCtH@mCB)H|Px~%A`zvm#rz~cduT#XN2ibAxLGifQjDFv7aq-^P;7R
zwR20N9)$puCFw=iLUWWQip#~>lkuND!L}rCunjLe^Y@^o*%8_fsD9$7v#m^Ze{h|U
zJkuQ^_(Q!WO!1OFb41$YZ7G?<sbvo!VA`V4Hvy1>a@QUZof#sbUhk2-XnQm@!<qb{
zV(s%^o@`&Be)Mn+Q!S3+W}I<o@RgI~vba-obvmB31q%)nT0d}LPlid5wF*<8c84T3
z3m4pyx}GV+TYickWiUEDzK3Ci2iQf(B!0g_{w?WF^!4vla@9>~h~r;wS^i^;O89?r
z`+th&hBK-J62FO#wiPz^PFqF{v4%QJOJ7t}2t0IRI~DWD>c~h!LTqzLllZopI&IE`
z%pLAaaMxiN8j7m&Fr?xOK(%AkrW#hH#ajO9(e)|k^fYtj>+=sxpV+(Q0ojOM&ZsB`
zC6iTABy5$QX@>E0=$=ZrRk+N>J9fnM&GoUC?#MszqPOUoUBcoT>}SQ*DjH{4wAt^4
z$C<Q^J5CC(4Xl8c<Il!fgBH>y)L7MO$9!j@sj9kOZ!F%9o<8NCeJZR3HJKSm^R9@l
z9;?LED4e^mtn5eq3-7rjM=!;k2Fzc0J^Szf7~A-$L{wTg%BNM~R^+B;Stt1O%@n#9
z?oTVSTkDr_vpejwvM=ev@a1F3aUVH<1_gGbGz~=e>^WsIqqto%K+^B%EvHJpEOl^L
zQF50I`8<yd1P|HKNpJQig>|A#Y9?w9TSfW6m12!x%`oMdX%2P_`PoYH^@+glNc%=e
zpzItJ3?cp+%7#O4!)O{ZQKerb<Fl3G6Vfxr?denW(9yG>qDrvrL&ox>^jf#0^TB5r
zJmIaBO?~*Ikoba$<#g9sQl(P!m)<1N3TfMI4)%=I3IF2C9A==RkxF{|i9}9_kk=WK
zQ~pT!kNBBmcO>gZf8bmRDNfZ{8QNlqqg0r+jzo^@et-_S)i+d$p^NZB6V3ooFvw#w
zsTT#c<c?$vQj%2le~T+YpJ5;O7lgcY)Id3(&!JFFq$ATXJ=Cz`?At?P`(;Cyn3=M*
z>Y}wVoJ_dfAWl0~*rN^y)tmTn=1F!Of0;?35r<p)LZnMzay!Z)ii5Fdegrdi#HNXL
zrM-%hd<WP2ZO+k!Ri^Z=1RAh7oKNT)YEB}g2J{&><|tD$kG%mixNC><J@E5W2=Ony
z^j(2eu^w|k@!CYj`4w>*C18{_xiy7SW0ZBW`w8a*=7@oCOX3@T`#}ClK>Xk(zum7m
zp&~eR9xVL;alG#WWL>fT1ALc<d}I_SUfE<VVhaq0;oEB{fVxPljz8%qD6@t!BqURN
zn7RdUgnI{`7Egxr+b3oOjC`Ypkfd}j_;^N{g^2*8KkcE|AzC=@kP@ggB7mHggaSy9
zZ}+0RJkvQLsEo{UY^kVRADr=a7qb)G2D{JWD)_OV^K$7F&?(UOWIl?|i2u;5Ulxq&
z^p{?~|41*!f6?n|=KS|-rfg>P-{$3R$$B<GMXb>;%33|!m3433bM<3Ut>p1D!|!e`
zL~bDit9|W3o+it9;-)gvX_17#^7~|J!#O+G;xxd)1p_(#N&j%ySL@|M^Bwa!^akX)
zj6LNW^nhsg>!EVeGfinSDWw7^rs+`|DSl(c{vm=(f)5`adDOYiUEzBiDEh6B0=YN8
z-i!PeC}bnnV@PEWS+FXlfFSn1z{>}SY<}q>?T|tWE2TK2uxGuYEyE_o$eaDeanTax
z1<`ohv1Gqt7knXRwTY|~MCPoGf-G|k&K~KhwP2YAha)PNX%(@>M%;2Ee>YY@HH~kD
zaYwbsBVv^_poj}Pk`>YZ%H>Nb-BQT*AW_7;iTnF$5ZJU4w=epfZA5uz)mGmyA!+PE
zcLs-W*zgb_-{I|6?-vM;<r;H0f8y+t5eyo`7vY<_Y;{b#T3I5H0_j(lPd(rmS0(25
z0~=g5p)^;>9|VY9#AUcTl%N)dT!d(c!Yp#R1pOWV@!Q@)7Bsit$$4YR0Jd{L3nr<2
zrfJ~YT)m`!NJnlgB_xeS(?sBMQQ~3UteS>~UI^|V1<gb*je{&x1$g`;xDoE>1w77e
z$IC%~1q=R=+^^UEKR@SEVQapY3}!AwjBAr>WU_uL4w_7v#P$59{@}$;(HchOD{6H+
z-LRk22l@IpQNj^!;e7)6_Rai1n(AWzeWmP-EX@9Ae`h;|zj=~>3w`$^pPiN0Eqqz?
zSu+$kx>7ln0}bFGf9KI6z4hU9g7%Hds4wXd^7)~k{x=fX7C*&NHe~GG&E0={nOnFA
ze7$_4_K|P^#|%eAF~ZmYj-+uU_Bd3TSVF{MI^Ny61NhxmrHae$!$Wje|2jPP6$bgh
zNiAUrSp^Xr>|Alt_Ylw=jr+~pIyDP#uoH)An`P8RT%_-?l5uoVSd1-(9XbrofIL0r
zfNA*Tgrnqb?tK;<dw3=rjnoiw>y@7QDywZDDXXm%CeZ)m@?3-Y3jZl=85jjJ;FT*s
zrqi(J9h6YbsoUHQ2ztX9x#<%|@T#WQ@{BYC`$@+)f*L*^x$I_I*-_~`p@SH<aVP-R
zNMH491c?@no^P1NYPcaxjgR$aa{y<V-qtYcl~qyBDiH*3xg}+D$1#^^7ewSS=X|Rl
z*?}s&yr8ru=7&>x3>JQ%dB)Wfjq1Q9X7{n*p|bC9|HX>7YO}klak%!^FN@;S5}g95
zww)z1Cq}Z>+eW56H4iHB%Qs=<yb*4J-$~|d7Kos!kh&kAO2)E^%F<pI{^86%Oj!eW
zB9_>(CU)(rpU+I%JUe3rxDa+|Cmj~$D@BHDRe3Dk!B`(ASd`b_t;8CdN2{j%!76h|
z9>KkNlF5>rf&pWW*cz|5c0)za(-Y9E(EGiLZ_z`DvA$elEEW$5XATKzGGDB6cKSr~
zAxnc|(x-b1+$sprNjgloNen>ReP1~~jUwyXJ)UZ4??j;HT&l7>#Qf90>k3gwu&87}
zzx{uNy#-U8YnL?~2oj)iZy>l!aEIXT(73z1ThIm?cXxMp2`+))1b2tv1PJ=&oM)bI
zX5N`P^9Sy#yK3!qZCh)<Tlz;t;{I=l{1+ZW)lW4D#IfEOYeUbP&}gu<^OA4?fe9*f
zLvVHc5M(%r5OE%eYYYu1VZE&r3UcvSb@5o^f1ODDTqFrCIeA6+^~c-TZuUAF26P9p
z`NdlM*QX3VkAthvU!D>2;6Kw@1{(~+!iryNY!P}7Iw}LYjoXU0q;C;U8t@*m`9tXu
zm7(gHNy>!rMG<p`L9hdOv?FCfEV`IkPO!<I5`Atk*m7H1_@uDE(y+2<VY!$Y%MR(7
zgSB8?+GuxEg67h2f5O5}?ZOJLCtnprrBWmzTXvYEN?YE6Qx-rAxed*2Uw&|M2yj|d
zIqI!$ndj}Mgd`}Ff1^|bvu7(7V;I>_mT$LhX|AD20Q}b2G3F||De^fB>1$5vqnISc
ziKG=W*BU(8iSs6av~2w&9Qn0OX-X!(6lSYnf1SwTwspoPmZn`Z1dbs6dmWpi`On)j
zEM*_q#L&#PG)=>eq`|{=QP^N^3;-_%D*#NPZ*-ZT*cUQ19jf5WrBQ66>q$LeE@cE7
z1`hC^OLOlp4i@YycCdsH?RMjKCVI;a!wpn=MsK@yk?Q)X4(k9Mc6*{c@HU2gFe<W(
z%4}M`$jLgc&xRbHdFF1v_odl|8jyTQ+s5>z+hqe!U4=%40StEN5j#m}54|abppi~^
zxg>Y#yi5_?4A^{w9n5@3E(JcaJO?~s@WVPHG@MLQV)+c6k6LrHIRN&}O}TBCOMvxy
z$M4R5I1fruAZMQz6$>i58@qah?$J39#)LKWU0}}GCDVOdqfXdPkQ&H0lXlFmU7gI@
z+KB0|NK`5kr@eu%PEwZ3_;5cOZhh4wThJp-9eMphxh5^-F4+1viJN4qn$0Y8`)<rW
zg`2Plh_i%eAiUNx2@%!oOVp=|^0w@Kv+SvOz|R6AKCb?8evyRz5O?=XYqC$qVbW>e
z{1_myBy4NWF=-(`2HwxMpMB-QL~K*fN{FA{`ED@bG#~%rgXG<fm_RmvS2zXXxC88R
zPP_nk(6!0)E(`gDGd6;ePO+k7D7c^o#g;=Dp?Jekskc&>FLI6D%QdA!qCbMrp%H$j
zej)C(FWg8)AS!VREFHFq$<l6pV-r#2H>H;_owOXFC$+R~5m(SL_E2Nnc>h@}^y)gT
zxpU+?!$oWe=a7B>w4#~4oa%ii&zPA?JEdyK&nfw^N+zYzV;WQC)n8!5jF8Uv*6h4L
z36tZ@m)CeIt9f|#DqT}veq*52k)_Ns*w-Kmnc2QkvN-lmVkf!y`!{x{uO+j!qD)Tv
zEyG=5tMb{7V6uCcv*}CV%S1f2Iv}Zl#tlK^aSrg}H##&MVi8mKd@`KM8NXA_UK?uJ
zqOaxEOkW{4o5S(!c*>H*eT^eLcWl})w(!X}t7X^4+vPP1g;deII%V>Olj8Gj0hqz*
zZ*h_3xem4~BBDU*Azy;hS<7c+dG>M=`R}bBj@~)C4(%#rKL})Ixo_yjMlSN4pxoG7
z3ScZqRiUvEyHZ3P3Z_@3cKCUZ8D~O;UFYn+1a80zv_<OM=Ea^D`Sa&-jfeuar~!X6
zz#$xoOI)feJXO=cb4jj<qWm;{mb|UeFa`8&PVG7F&cleEs;SvZ(->~Ox3H?!*e=mg
zuYyTTJ+X}qCv^(%2JX$Te-UHaS0nLxn0N0q{?T+0=ikIAXJl+<``?VlL8s1h5?HUM
zeDPJ`OXw&e`gv<AtLSN9G-woB(jf}N_wp*Gw@j-9I>ISY6qr<~(;kM8@1E`WqK#J4
zUr%aZFWxty&K@r}NAJpxuvIp0<}@DiZ7%D*{l2LE`u^cV4}>i((WvZ$5ffytZ7^)y
zcl2@_BBOt^)=^;?s900ZuBGOvH-uq-*_MgefS7{4rc&1*7>m6YGdo;KcWx*@MBO&N
zofYIm_oF_4NARN~#iv4&-TV-iRR$Iv5wfoqf?Nis&wk_O=I4hz8Oh8&wmj-}WZSMP
z+@=|UW)>~bv0W|er4#iiX{qwqlwv>D5EIeHbx?eks#4Qh?NV$-OmksZe~OckYPX~x
zH`~S7C+SHBb?kF?vyN-6d3hJwtEZ3ln1Cu6+9n#Ux&IVbw?+`4V6PT(>{U5f-qvbq
z*n$-TbiZr|Q$GaB(6CV(=72w4C4(s@F*P#J;8=TpTq5@@ToTD)^fy*;C`56q(*(j$
zUdoN*9C(f)L$}uC59$pBu1+gSh{Mg*MOH**z#;hn&9Bs;P0{Lk3Gr*da5+~^IUx^*
zPDzC)pXtu(S<|;EQkB=~JAZ*s(JT<yUgWh-YfRfy1X|rMSP%T;@Ex6?6IZs8+gz2L
zd47ErD0U13QXXLC$Tf4-$&<~x7hlGK@@t~BdDPinf=*e`FCur!u&;y_RZ;|OGB~~D
zsAGT5{h$~(QJ5Ci@(?%;m}}9nt2~((Ux?p>!(|XY6+eJgZ+8G~;3CcqkHiwLxy{vL
zPr#vP0ih#I3#H>_$-|@aI04dWZ6=SlPJx>+7)q6OtXk_b7KsBQ(Q0nqNhbA*-RJ4b
zWrG~6w_fRfj2I-J-!GKxvt95UVpg`)>Q1_x#(vMEGV&5D$(L903sWLA>XD5-TBVFB
zfpE)C&EtFT9g$tGN}GiIbm3Oqg$;7~Fo*g;{Q^{Z<O<2@l6XLicYVYaLt**xJI15O
z*}DdIA5B@0F^=O315vUm<~uGD*uN@tEH!P9)P!+Rf4g^j;Uf;tQceDdPZ~p=yl5_l
zW|WB&D4-Rf_ZeE@1GCl9h|kO}BZWSx(a{`q=9XqiU9MBmgk?u)BHw2OY^K?^2$*PG
zsfft%8G0uS;sgn4;Gbj_<%ZeueQKRZV`rPl)GdFvyvDW>)aEYGzn9E^(Ct}R@y(zu
z;%j_ywnb;g>{n4KOWvV<&){_EQj;df3P~ds?lo`_Xz=(#xL|MnQVS7vMq}UTk<ZVm
zLUW81;uAu#In3a;!abLoaN>WDykWEb(l>!h<C25;2`!_*>%;Ne-zPV|<bAqa{*y7G
z!2e%vDu0v1f9cqSs-3E={-K2sD5Lr{QcBz-j&g<%_WhLd*(IbUMb`2pX+ooZb`JZL
zEqgMou8&k+L9fTTuFzvmY<>a!Y9$tw!5`Y@vX@;Za~hwr$Iq8NF5VvDd$AwjCXMN$
zo#Y7GqVOrrkbOhx;cAT484t12HGaTS>Z$J8ykESE4kWZM+i$g68}xvzvDSsJ%6ucx
z?7xRFoVJ-50zT6ipFSv$C;~f7v-v~@42{Art{FCw8e3-fMw_VVjX=TXHb*sx$7-U;
zexQ#GV;zp~kK3W}i4(5Cu4bO914a0S?4nxZIHCp}li+)iwrj5KL)J_n?~Q(F7BW^5
z{W<3;<+j76N;La1Wa=IQ+92^-lQVALy^#Q=1Xs$={Qh{|b0D1xeavddCpsBjuy{Le
ztVNghmmjl*gb}kZ1bSfPL2LwZK(C6mYC9*!4NS)Ax@NI7h%@kBj@g#}8Z8!&iN*>8
zllLPVf1fJR6kbm7<>Yo(42CE^He6t?8#e$X1t#j6RyHXc01eJD`z8%{(1fkIS&P8V
z8$Q5NiRZw`9yfV@Q}fDs`D+(X_sRyZnj<PBy-l4%#KEpOQ#N#s^!`k)yVZ*X=U`p{
z4W}}kRk|KDKzVZ;-+}_h$UX!2D{BfMpTqa7d$9dL3Db|i3pj9p4p-+l5YvKDo^?$O
z9!p=CMFB-I6QLj2@aGAT6Bhw#Y2%vak^(P1K<|Q^c<7EBE*2KsygP2}pm{<QcwTO`
zaymQtmlCl1i#*5WH*xLpY&dRlV^%?+g_~amdBKJKl8dd<bW>AA<{omARyQ*HV)Z+N
zE)|5w4H^!fHA=8V@*)$&)(9>|^0`gkV==4V8~o{6^5iq(>%=<hvQDJrhmCfVFK@K#
zYDdb2DFR%3v&cu?v2&YnuCql4fxvlv^juq~6U72r%cdu`g50?i>}u7);$LtX$t#j!
z9B%J+vLW5#ix6z2^`~jf`mmx~Sve{oIl51^LMWRZQ9!r&rr_h-V6P2e*4y$Fn`iD4
zb_Vtqy_sfDR>}lXG_3@SDbWs2>oE!UNKt=~0WobrK(`Qehu05^GrLEMdgl_>)fLU4
zNxyKHl1TymqO^SOXTH_+&*&~xVnfqYkE|!dk$kgTP0ayi<VA$GaKQO4j-MW|CuG@~
zC-%I|81svX?Nd=D7q`o6Ka}9(?uVL8?#pmXuqS-gm%kSV#z)PkV*bQ(%s;ks{!&%^
zk2gMA{ZtiG<4^4a<KCzX3r*7kLdO;bNa)xoqeW^`;-JA6hqo||Q8L)O@0ye2oE9pc
z&GqP<bv74Yr1NsD@XmeCV|&4UtR{YHCgu~kr$YO9+?1H^a`Ce6GAVHAF}aax@b>x}
z_nppVwt{gg1l}#lFqJrShIY`Nv?FAxaF_HacB3D#V~DK6<nu?IM**O>+wFFM=B*8P
z*>)Tl3ON{>yJ|Z;hLpd+SW{9U<^->g<#V=&?nt4h+))<V0hqWjygdBWvX=>2H_8Nv
z0UREhpJxe71Tr`|ssuCshyf?Xs5-i_Dj*r;K%yXXh~F4Yl5`NQeW;@5hSR0IXPYqN
zUj(4-RFyXDS4tN14M9qDVyrn<;&A+_O>o(XYn-KRt3Q0j0&B-3Tws$0O1?j_jwzp`
z01I(QtuuUrpQ9uj2PfpXRA}u-T#&v@?0_>hNcSx#>ZQ$k$J$tW7O?~?O!-C4v-oW>
zoS1Egih_D~^6<}x`~Vi0+yhvXto(s4bdzklz2ac%D=bRv-IftOaOqVP!~#EOfD){(
zTf)E~D6z&rbqTF+>WT0PQ@kb}54T=9&52hk@Sq)RHD>j@Y}ZR6VH-PN`-F!UTLVvj
z$maJE*>Dl=vI$jtHYbtJ;7bRD3vXlauhNMK`+`+>hy#2^)_Z^113|?T9F#;%k%dnY
z9^0qc%x0<P_Q0kQ2FG4S1SNnaFrvQ$a(4<KQ+PFz{7u7P^jJKB$x9xl8E*=*)S~-P
z5)`@;{GLG#fWa;S*xk1>&lqLgG(n0OFMEq6BLz-8^jAb$q8txrd}*G)|5w-VKbs=F
zaps-vD0wvVjD6tTAe};#u?gQGU+lP8TWN9IscsBirbIGEy9T3Fp&(}r_*}EyG2_L4
z+EgA%&YN~czgwycB97nT9I|BW+hVc9;_}gXTkEli7t~mj%0v$+ngQs$d#Oe|Gs7+M
z{Sen<Y!nbwsuafMmZZnZKjC2u+E~4P@DO0*bZG6^Vvy0xK|8jj9gx2%TVetlC1vpA
zCF`eRf1)oI8u``f8`a4ai>gFaCJ-zT$)|fzsql@e;HUM0F2TBlch{m+^LH2?+#=p0
zR#!P2bWX@+BOaLqqdj$(la}(g(cIBAtMeQjm?YkQ55386u4FGstz3H<IkwH$Yj#C>
z`(GA#-q2eje0tMqE#%P`2SsJ77_3!?&)SJVoaSb;yEj0S1CzP%Hl}eYr0auUEilLP
z-^9*i)=qiH{6#6&^eN88!QXFsmMmwb9Jh<7n;Uglw8X3OJ#3K#d|h?I`I1d}zPIl9
zC#-(xiDG>eE=OJu!srN2*w&%xMlhhcCHLi0P9Yw@DFm*hg}P(D25iVSLMqE}2%x)=
zQ-%@<%MkLo2sJar_dyKUbY@y=@+NeI(@2`-gTwuSC(tD_Kb5%A;xvnUD_jxI0r1ub
z0oWJ-@cU-i(`$y45@iAuhD6QKUf+=Ye(l^y7cWWwwS&T!2EH<4eXYaJP;9L=xAz{H
z2dHLFQ`4vkt?*JYvo<JI!KkOo5mXE#a8(j<rXSF4Da;34Z(0qBs~^L!phPeR@3f2`
z5uN<9+g>C1UnEfHFO~v7AJx2K@?GKbVqs^?Aa@)U{YbA+8j?|xF>%XT(vO!+J7NrJ
zQloPf6~zMGatY_ZGoSccDnJ~4XoeqRheQ9Q-Jt1)oatcri-=t*eGvxOs41(z2=^l%
z%_{P@H-;9wS-lZ(^-Y#Xs$icpV~C&KMoL}FmSM01qECm$V#Xanc_hh*QjjQ>F-S7G
z&1`j+7Tx`c*vHcTgv^)az{F}Sj7%|eKw3x}1(RAbA`zW^7w@d;`=dRXwyfoRXl<{r
zpj*2Ov_D=*)6`0n3V+b?qgQdBF727TmKctD$lS5XJPCq`$7}}-(ZBMw_HSbEiecZq
z^F{o>6svMZUJh=qA`Z^~*{)a7Q^XX;5>Uly(Sxs3nGOmf`LW(ow*yZH`ba{`ZgmCK
zAM7ya-oWrfuYnKtHur&zy#z=cHT6ofo2^GL5A;aPY(Ly+cbWYD``6PG>N|omtu(Q|
zeue{Qyb*b%RwZ_p+C*67%@#-aNF44I*ESm?e0r+$bWO7~&tv$W6?4rdg3=w`Hi3PQ
zby4i!fgV^r$$@Xe5*&wVeM`uE2}T{;@Yi|wHI#+qGbb3vMBwf+#(UrFJ%Sy-B~?D7
z`S_WRoKcq0Cn_02R6`eTn#?jswff<>UptG{s>|wxr;a=yjRywFV@5ptudp%+r|PVB
zct((HSuVG?0gVVoPWfwC(v<*{mIIyVT0*cc$tO?(8<s6KXahU&zO{MSQ2&8Qu_DdL
z+>+&qOwbC#R&gjP<ekREob)r_tGp|N4G}%k9gjx%ltLnO_%loA`y_2DMX@yidAegX
zrj-Mn1NFd3U_#EvH~~y$2HN88rNW>rUTH}2%00XCK+P$()fP9DeN>Oaa~c2Aagd)l
z^H2sEn*I**H6}IcN$kw$P%FqHEuSP<?t^XW*C5d2DEnuVs+F)S%w2dJ1Lk@&G;4pc
z`l`y!xHEDOw<d^0d#p`vLc14)a*w8_x0fzkh9<7~U`%<uEH1ag6bH9<RIDiMku~l2
z-%6TIc>KTH^_2hE97X&8VIyJd;PD@zQT>;M<~@OXBMLOse0Wga4wWvnz7j?k2@n&q
z^&ShP(gQGBV_@oR>qP(6NB#1lr`Lj!URzL8@Co%5Vm3wf0YU|8bm{Qvm^w~>eZ3ji
zcsHlX9xt*oXa%5%@5RToU@0?^3Us0JX0Gxjhnvi73y6f1K-Oh7A}!3)YK}_B8wrV#
zCgK6d@Qk<==m3I$%%*rUIsY1Ua-mn=^1Q2fQ}dpr$H!u|0jvalrN!?^Ayi~qY~?bo
zqvO<VNTc@`DEn5hJ8XY7TPrEPxS6f?o7<bE*d$|@wZ`$!D@epfxabtzS2qwwpwj?!
znjo7}?j;<NN5lV~tVl-G%5!d*Bc)!9I~G8S&g~ve=)r^I7`xlUt2~$$15Zeq6fq&}
z2j0+(Uy61{<Prd!r6eT2)@p-`s13we%#RvbzYn+dH|pfW!uc&OH<@9n#EbgTN7SjK
z^X*;m7#H=s1{lrrCe@aIjpMN<!vSqZ!nkGP{bGDcX{d83M*H~9a>LEmArmNO*Z56F
z+d@7B`*U1<5Hn8K<n&7`;z^~iIxds=?OWvBV-I9WyM&+)8{0$@CZD0w`wO8>GnHs+
z9%gkyHAUsRc9$#>wh+cx_ZP<ZKLUqKs>%3`Mru(9ZXH#XK1;mm-_EQk9>K3n3vaeA
zD;k<0H-QB6{JNmd2r$MmiD%*$8_tlA_E_(jE6J`ST*;Dcd)I=|pFVuF5w1q?LZbT6
zV<XPNR@6v0WZ}x`_-weE{G$Qc^=s^Lc3!iTYaqHMdx&%thF;__YcOdPdPW{pR?%Y4
z09nap`0yi(d|2LgnGqZ*@`%me6_^Z9K_!PX>k;-Z*qYRBL3=^Jdk6K8QqBK_t)#P+
z>Azw7pIiqwE~!ip3DRt3v=di~C-Y}l&S*+o0>f{XoSAAdbeek5om^ZF<>s?2JQ(`k
zN#bAFh9<C|Q*j;Uw0oSlb9wl`{l3EN1?Ff=?G%K{wq^Bl&*Ib=_6>s0bQ|l!PjQ&G
zz?`zY)>?&`D^;3pp-~a5RJPy<yG54;lz{?0J}d|E^3pZ?@_gt;myB0}<91?GrO9(P
zJnXOJ_z4_~i9X$hDS(WE1<GOThwePa+|KnQ&8~Z&6Y(u~$fID4m8tw5_qFCeO`c`J
zpcA|ez=_&-nK#L9$O-q9ij(_%TX5vPtuz0;Ig(k7UGztzxj~c>6aIY202#m~-qxu=
zW`#J5Icizk<?$;c3kCmg1#v;qZ<8n;7l>28akb5v71v_OK~mzA$QBwQ@NQ0Whiv2&
z*d;LFD8KU_;l%x)G~#qCJ*6<wNm#|!7S(DB%Z+r(+6$_)Gx=90=phNZU@spv?-rRI
z(Q^IY)D#<amEL$b=-6LZ`L4q=dC`p4QBBzcm@^hng(qtYSEnsMi!>G%NO2P7#(4LA
zJo)J8wv9loO~5cSOqu@&hwSE~lL`0eEGuex=}&Me7v$=1LG=rQQ3iOM^u9xbDe-f+
z9%+7qVa&p#k0G~l>4YLVoX&o7elZo_;~9+;ezF3pNCE*Wb;sFzM^JlKut-f-l>Fps
zBfP++yeh1r5$3nQXGJ4J4ivyYxU&35Iz;^oS624_`{B6EkZnO2R4la#C^0mp56*Zn
z%1p@45#NM<)P2aDH|ODh4gdOw1~F)feOsQDQ`R%92ccan?@moRe0q*~{9j&Q-wUB8
z5zAZN@ABF|OowOsyKdpwK!Hg_!$~JdvkBLR%v({>*UXQMj?6ZRemp)OjRX*TIK>*p
z8A*w%4b%xq???&BHC`+9ve~AA1<0m>Y0Jv+bPWy!o$+mU_~y<mztp*+?>n%OnGlkO
zR1oy?yoZ^8wZC-BuWPGicJ5tKGPvPws$0!wuG5`N$H-~Xb=%pRc~fWke&KI+uscqK
zJ5+PRrY_C=Q>*UufYBqAqokvD1Hoy7Fdt>)3bc$N+t8v&1LShD{KJ?L_!HJ?iD@H2
zgQ^oU{Gz(X@!LEp><qG1hM<9rL8L0#u0i^U#U+vrSQO~}8U|$Mg_JMuK@D;*qwcnW
zU?JwOYkFo>>(eyY^&pkJ^RE1r0*95RUlba*CCSM%V_24eEP2FP^$6@o4OqHXkU6K>
z@#Hgp*f|he{=}W3IkN#Lsrb${Gt&LVgD*03Zx5a2i#EP_4@BtuvJ<}QLEtwA0)&jH
zaN9GT6a|Es)cczYrx=g-IBm8pIe)KdW|3YLU?~n0Rc*abURj%I{VA6pJ1LSfx<6gc
zb5^KdCbpvnf0zwaK39I>8A;$|E5xPYfSGjMY1}GC^FaUgMV!0F_g&+DAw?c+$uSaB
zezd(YrrsIG<MDjZR~*R{p=qtJVxH+$xiq1vdn40a;Y!?L2@EnsUO^2E-y$nU7T^#e
zIM%lzG0HikL2A)zsO9>=J3kQ+jW6^U9PC_W{6|EuC>hpkZ4k~vj0)zreD~i--#<Bq
zI(`6!5YdR@VPp?>A)OsjMdo06mq^UWrq;yPXnp>1EbSF6T!cOZ4^RzN*LBmt4ja+(
zqL3@9a49p<iWe0accwa#u^Zs%BH&@iikL@-HH^|`ivbRX_rpZ%x~weT!T%L0<ni9N
zXMZAv^B)&8vHy+~7uWygBJZin-zSS;XTc=JYcR_6BrW0}Xm((gtQfUvaP45PuF0Eh
z2*RbQrQ08{dLSq`k`{zto|IxNL}8JlOw66{ezyBQo$>r-)9^^t%e?_J6I#jI!GbmT
zu4XKpj7m(mzb@(&55X9#B7_BB7y!%6^n-xx&ioywaW{5v5%UJhR*dGwx3(}^(h|xE
zDbLaAy%bjq$EbXc#2F$kqqCahP%@9wQI6`&4xe07LV@kbYF2iNYG_=mj<Hm_3(mIe
zIZi+WOv{75eeDDiz;9-vq@}uiC8qM)&c5RWdQ%o*C^)WBeQ5HAN3SUKGzJgbD<p^Y
z2E2b{?iAliSxI7~F8m1tak5a-QW`ckE`hmpizSCf$|Q$$kI356T={zkC#9^WQe0m_
z2qo;erqPigenQ!iMBplbp<;_Rhjx@~WGnKP-t*k*1$|o+TU)LVs4u0dafwlj)g>`o
zIcR{3M`-abIDu2%o*MbPQ`^9_O9x>iZ1qn_u+GUfKGOn3!^y2sg4M##N%hN=U9InH
z*&=-KEZ$1@mfpg0KDV2`p)%5{0)9DfNX|aoRA*NlCz9`?sLUdtI!B?1{Big&>qxTp
z#u5c}A15_?n4&^B0?7^{*G&<TiYXq%Tmi>}&V6MNjX~WtY;_fSzyTDleQ1<sUrvv;
zTeHjyl8`G<XL3n|v)=n!XVZO)aZ_WTZrm|RvNhL@FaL%_x~2VvN!=idJn4>&n@!5B
zp6%#pvXNVL7q|(;E)Dt6eQoc3$$*6+DxVSis;`@Od`w=Qd)H4k681TG2zBd;robuQ
z6tlYbeL|{ZJI))FKl`*c<RbWNz(9OpB7WuJy}SVlqo2qYLC`6D+`xAbP1q~WZ2w_Q
zOSLfp*^GvGrUfy23UdVAO63tr935}$vTJ_)9z#Yv36-?vEqkOCdTzK!CA}*yS}PO)
z!=eLy->vV-|L=U->H8$v{GYJ+^^b|k{|t+N-!}sNOQUD^;iq{gI<OZ~j73|WX^1ed
zo!p|9S6+gg1PysuV9J!$T>3fu5}^6HL~)W^@Ttl{aIxI#PlV(?Zf$OFZr^6fL(2mz
z$M!Z{&R?=GTohj)4_iOKliSUNQ81PnqA3Ao4V)s#?eMEQl(hwLrTayuwt^<M3Zi7`
zm`peW={+Tfvmg{D*b_HBd0TYkE{HWOZ#6;po>P@=F$7&$rVOmc(tYyDcV@7ySXHB%
z$yb3PIfkp(Bc&9#IEX346P*igm6{lR;vF5PJnGE!q{Xf4#nQ|@TR5<hS}~f4<C*<B
zY@BwyGvDlwB4JlqJ;as!!}XU~?xL#diA{%c9D{z6Z62mYVJ%#Z=Un;?Q<J-kFZG9e
zx-B3JsOmOqdQ=R>N~_B;?Geto`;F5wLJU_KziBQyA`)AB!kWn0jXp^I)kq&GeUKZl
zTZ=ccTnZ`A|B!ElM2Wu&WcVp{6#3kYT$-eZ%&$Ukq7fY30FVrhgoK!!#r>Xci0n@!
zIR*;Cqt`1poCRmaL`Pq138h*glir#Bv?<#`LiVU9&3{wUs<DR17`B@p%Hkw{_XcwK
zhSo+@vo{ub!Xup6jg39<AmkMt5J`F>wFo;J^j|4ZrqKhF1N;<PEV&u9@HE}YdpJBa
zxPRzvi&LJ?dJ#P?b|lECU^Vv!5wI#^c%9&90+f5>AFY3EQh#4Qwas3UCyh5-G<KCy
zB<7TNmAIG8MK4&gTV&@pu(98uh0q=USfyNcj5T6~5R`R07xDDjGpg{dV);ZmXbh#G
zuL$RRDQ;~auB-0QLb4dYC57@hJ1R|;=CXRZxJafEPQ-iBZG_%DgUjA!ILZ~Aph$BU
zem*tpDBLZcz7B02;q6$9J6kYH$<(8gt2@_HGx8soC?+F3NojnO^(f4iW;TzXcC^7d
z!=rS}tU)~@B09U+0?khjE~Au|2W!k5uj{xUIn1Had|uG0Fv_?E440Nz+Ui;5%1@<p
zX4_5!1f@TFv-$b)e+q}pU0@9#V`o!Y16UrRt<85dq|(E}*Dcs5r&mPzETg16vAy5F
zadk|~KPh5zxav*v2i(4MD(JL1O0RCbHc>lCaxMT5<|+|ykIFscT7D&Oze4*|<ZW|g
zV;CVrBw(mIaW^Lt^nT{IQkNI|gk-ST{G~DSh?E}kr<bVnbWgpz{Shfvj(FbJ4+HmO
zo9Mog7tHhFRPU325bXIuz1J*Q)wwlj4)W2YTm$xu@cQ?{`4=hEk@}%sv5QaO18uon
z$XMs(Qh<T>i6?xn3BMh#;!$?QF>ooEg<S!)+qP=8(xzAbA@OAyGlvL&@dW`-vfJ68
zWYhK^$84DYFJJuoe3O?hp$5?#3YxjcHHi>3Eke7Lb}BLq#vD5%X?@(FEfR%H2*xSP
zPr=dNhQ{=CSd6(J);0@2R>oJB(pI#KtL@nFQZ$=B{<0M~@!OQFZr*scd44fBU)EcC
zDEHmE_rLHkxai(af8+m+74ZF`6-<BSjeOR|DYZnP)}<^O(dva6%*8g%0U-IN85O9;
zQYP%FB09lW)z`~BC!sdTp=Olih0tPVEw%Gujsea+E{g}Kf~U$-V?-HK?imRNaS#98
z1=P$r3fLREIG8z-2e(>z^4TM9nIm8HGIn`UNA^VOb?FRLw?+5)ES;SRcj0=JwW*4-
z)gW&%>0h91<-FU#?d=9`#6G3Dk_Dh%9{9si<NL<-mB0IFco)XbA0CG1t2s14Cs>e2
zVZRg;RGdBVm?k)58%q$8e^ALAu~Z?{SeSwzOZ_WEO)2x!>}~@JS|m)cZSi>2SX<D7
zmviTSUJisW8($D1^_&?4+?YrqT4U+*jb-P%K#ce`{CD(p<{0V9=KR#4Qxa@gS>EW7
zp9;|^Qm1)>Xw=_~1#nCf(IsQ(Xj=Emc&Hjf4B467D(Ajetw}A-Iy)EH;it|J2IcPC
zyYT1daSz5+GVqA`TDhgu>YU>zA~dLR^0qGL7WhRH_XwV|%a(9j6zd46>y~18rne(l
zd9%~m`H0HOMh5BSE1(ptXC1K_i?SBpyrrG8sH&@-bF@)`yoNdJgL+S=>CuE^h2Y)k
zHT?r|5P$aR2gVw!Y@zd4?63sJZaW21J8Ez3a#!b_e{lnCEi6%AB4jDEP+m%BVW&xG
z3-1Tj?>L&nOm3?}D;ld0mBI=Jm%<1}P9gZ_^x<AMK|Ue+A{e-5<|h6Ce@Dy{62m~S
zavOA8P2tpe{s!I02yHO52$R#-NY}%3iR`PorQ@lvwfYd#>v1K3y@~q(<uB!Oph?>S
z?N4!O@+`Jh%1wUB_N=>w`%nxqKzPph<v&pWf>R25R@l0K2sW5pt7$5Y@|4p?Op5Eh
zc_<7jX#T~n_6rbsvRL6MyrpRS)2mBL#Rm3uqB9lmIkeB<ig1Pi<`p~wde++_ekkqz
zIxTvWnwl5X8`u5CFij#IeuGdx1HnTs)oi4UT-44@93w^nek_A}M^(D$E~qqq9@Dws
z>AvWrwI+9LQZD)~EkiHuLSc+ig88!1`Z+7(F|c8M&OKbgrPF@gPUm-BA~kxVazDQr
zY-$MNgg+@Ya2>&C$9bMn#H}VpgYtf`>cjrJ!m`bnfWiQeSr^S)$2jA@G2NG1(vidx
z@t|gZjsr0^hJ-4nQKh_<99Uq!Qog$rJ2u7Ku0BYugXx}(0YUtlhZRS9a1REb&?BsW
za&1o^_x|{9n@M2#BzJ(H4Eys~>(U)`GM!RqD8<RIXQT<_n3XMk-HC+rwrYA`Wpfza
zW@nX7?T_E-s<rZx2HZh(jii76n$WmfNTt;lUyB(!y)Qxu-7dq@<JMC3M1Y8ah&F8(
z<Kp)v{HaWXj%uD^yw_DzCRMi(`{ha6N5!$1;3{{T#lTO(AL$MxrIp9XX$9;J45N+*
z!=V(rQ>zbALlo(-_DN%$@lijSnTq{tyMNboibEU)7P;WNq8ZHSC*)-@t%}sYnZfEV
zg!*Vb)ybK0V-FXm0=M88^`vThJpuBm$2Y%$l36-#1dMbC$ow)@p*q5`^41F5_-c1(
zUnBB~`d6lL7kH!g8E&ezSLKDU(se~OW>;T5#A7h}NGdGdSTrb+!(=#*l<`Eqmxb*`
zTbqRF#4o|)Y7kZ;-n-tCIi~^Dgvf8Zd2Ymp<z<Eq`8EH3N$*&XvTP<3w+{qUTXN_i
z;75{z=Elh%Tu{dvy>rPR^Jr0L2`t{e)Jjqi{k16MX#(uCvV84G6N8ONkuS`mkyS9n
zM_>i=he6ossHeV4k%3<1vinpx6)dls=ruAVI4)+(wnKmHzk1JLStBg;TU8xp4t?{7
zRM*(xRN`r^e^-&Ws@iU5iEg&&o${pa(^ta;D2tq;i@i@FjpDT(gk#S~&#c2{ToT{>
z<x>yq*F-Q_EM-U#W5Q?Ozu$&j-G<6{oas*dvC!d;7BJ^A^g-+58&(uVdk@E>IMpdS
z*ADk^>FD5DgfkDwKxQd2gw7Bcx?fihjpEdK2#AT};at*QJ4jzUN!MLeAK{!U`xGG%
z)xgtLeNKUc-Fnr-6#dID@i6y0udaMe00QI+546Qi=R~xy>;3HoPB)N1+WIYPcU-C>
z{KtOJv8rajX1&F2an+17S5Ic&o6h_ePQk}CHdY1xoZJ|>TfXNY*RMYrGH9Za|9o?j
zw@NZ#s~T(lENO@+X(+pFNN>Kovs~wXI$%>ap*9_9CyscqM2-zIwY_8iDF?9xq?a&E
zpLQ?_KvtxQ23LK>rlIuw>?IJvnpM#56@W4u%+7%tKWH<v`?UO1qiU95)A3M(RpD#&
zjSYu%$wy(>kCZ2U?aZI<7J^@YTYamrV%kMe;giSnvwEVVe%|Kh4V7=SEE)Kr(##Xh
zi1p5_zW5~hV+~7BvJg3WDh3Ja>TFw;b!V7CPOw3IaO=SqAD#m_e{{ChPqJ96E^B{t
zRrVnZtKJfNXxEUMs{!5JuyQaL=cLdWUGgkqg&F#z6=Q({QE@Y*F8R`5-D~_`Lwm27
zmC5BlS%E9+|K&#aS7u;lZ|1CK>1<~7A8k%M6?um_Av8Y%>h-}im02n*ntAEZJM+c)
zx{=&Mks*6Z<-&yVS)RML$yJrjdfz^M!$(1L+JX$`ZcXIoMX8FZ#g9*%ceOeQy8A!B
zJ|g!D=A<##>-HnkQB|}J)LZW`ou{|OHj{l!^9*-G$t)aJw$SvXOP0%F!Be<l6nz!P
z`T*9+QQL9jJwbdKzCfWhK2l>z%cfZnxKc6CH&YyrP!hwp+=llleQkH>>z9u~M#@~;
zS!$UM5S<6uAp2pr#4vg9FvQ32SZXf?j@R34qu=43*x`?;gtpWUxKgMYORl6u;4Rb1
z{Pa(%2q-k$X1T-1skN}s%-H8X&w=RoE9HbLs1(=m(uS5tg$m+kkW!bIgB)ZMl~27^
zE|3_5Ffp(m1M+!^jcCky8cA8IxaA#EN)s(lwzjl+vQgEJ!@=}S6rf}eeX~MNR5RZL
z>h3<ZPY*suW!!J$X3qqY+LDh-j{`Im@t$bi7M2sFQ$8_3nI^m<5uF5b#Z58yczcfP
zC|{#Pq$Nq->H9>E2srH&{vWgrx3RA=J8-}44*W#U*#HhvzN;@N_Hs&&)S7q(uhyMr
zg2GO|zY~{uWbEP<Lhl@-pOgKuVH?~;TBSOL%VZyz@>@$OQ~ovbn?nQjZb7|!HwXQH
z<&N@Z_HH6Z&i`$xT~*IzRtZg@)i)%>uy}~hKW_m?geK&XabEpYZe&J<Sg5`y6vGNF
zC=q7$D)$!mp-S{P>aSW8_xaPwhEOwrn>7*H<6?Qe@h=ZF|5rpq{8NkqDXF$7dguen
zhd4ARpoX}!L1JBiIFvLxX;B*=rLb^DAqWZ|9i8DSt|}nwU9_+zfqHAnD!?UE{w2Go
zmdB@LVLB&i^lQzkIN0!}xw;h@yhLLh?DP8tVwHYQCn|FFPJ59<M|-&$0d(BO!f?}V
zggf^M?>Uy&?HgOSmG-cDs~+1=h`vocb>8A>GD^J@pjFNhu6*ryg>M)<R%-z^tuXI4
zYU9xt8z#JlPBGIRK`!8o=#0Xj_|_Jo18qOv7TgKguCQ9*^ZDq3&yt1is3-v?j!)mF
z=;rk^FD439HRc%*28c(81LT8ms(!G$AJr;uR}Z}{^8{PsKh=0p707rq7o{l3!7F9t
z*Bw&2<C!Z?T-KleOu21!B_?uFF^ZK|;fZ(XEl>OCF@rXeD!H2%NE{oPp+sd9z=gNG
zkgYPp*(FF=d#2IUMzuJ_avCp0cU;)aN`u*eLL2kQtQZuXFj{()zYzFlDQ@aV61c;#
z?BdFs=Mu27dV;Q55?h||2-|Z;{(y?E^qI76KI{@X|Kp&jl=YMkv|k7UJ+Wb6m@PWP
zX&;$D7Tp66+4+S@$K&>5Y;022urOyB^D@P=lyH$EEgW{_C`l{>f(-f0-c?f1x5J`=
zR0<C8%@@nzu<E+6$3eGnu&lZdpR0uK3Ou}yx&FdqrU$RN;vX!&{$ul;;6Lyv?P_Kx
zYH4O-^Zzymb^e;qyq1L8ch;yxekc%PEVDz$=^_uGg@#U%g^oX3Z6R6-JY!l$LNmCP
z{u2DP*8*F%AR<=qp)ks#1skJ0LY~)Ua{0pdkoWT!zZVokLK_x}IF*@*KD-3Hgb@zx
zMJIAFJ1b%X9Tq@>h2bJoIZA5K602i=M6I9=d&tgfQ`u3Y?>#Ig0KJxOEuRHk)6d%a
zEFQaf4bop(#@a``r$S(+WZ0HxyDicoW1YfZxpq%ybHxf7(s<U6=Od7qNx~`ILs-?`
zolH5K_e?h;(OcrY1FSFIyY`GQD&``PxTv6v&bzI8$oT3@1?Aw7N>V~OO=(fixrc(Z
z4)hn8=snBw2@-)Fj><Bsz>h}S119{+%!Q<3T|rvNE@>7=C=JZWl?AmvDDiu~Mk(zB
zy|cg^<3Q3RIV(+=<eH*{oZXu!FeSgL(sW%EwzWK+6+&WFWm*ATi<FyX78GEmz|4u-
z0a!Dx2Y!(Lxv<0e$qV4en5lwRGs2jzW`X1kel=(FQ%w8L%K4MXK0;#+!5d#;oNYD@
zTD0KOV}aeUS*;4aox~Za7{EQf?)O;s33kT$t}pi}@w?m`0txSSjY}dVVXoxi6TUIF
zLEGALVrYonX5u&w1(~g1bi*Yl5#)T-jLqGnT|9>Tc&^-BAw7eQd?b#fw9JC*CjfW0
zbOz?s7CmLSlb$0HIKM#0;8y21e!EWBT?*6v*%&@@WItnO95C~hK)|$HOa<a<rQA4R
z(AyyS!7pSjK%bY~HCR1io3)1hDi<B)@}eQkFzmxy?<sg*UGm9C&R1lQAPHA8oXXhE
z*e*{>CW}X%qdcd$Fvi8r)wj3%?G8fh6E912sF-k8>?*7%IRr>fEey>aBAD1^#G%>m
z$-DFiOs`AWwL_j7EU)EB9$w)7!aieY#%|*u?6>}7-w*$P$NqnekU*#E1R$(esv<d7
zLMG|(X*yVJ($p4O9B&rQP&HebJT;mR)~BY<a&QUwylhY>sHtCX@gHGcs%2GD^v2;Y
zDSa_hpC<N1n9{1;n4WsRc2DJeeS5k2^v=bz+z?tCe-Y~;4zMGji#v{7Uo_~fN?IN}
zbey7jFytoOXSaq9^myM^x`kOZWX2-ZA_#IM&K-Nu6^6kV_DAbY2>Mi4uqDfnl~ffZ
zsfk^h6~*y~?XegQwk1Fwp5pzc_67nfiYj;Y_E@U1tduoG44Kq66mgV+O(C!1>(kj!
z7&XJX%W4ZV<K^-rWTA{V0R)e+YceCPln-p?fwFj$$8ZL<>ep*4DmP{YqnsWs4-w>~
zWy$T<UWZTx_SdY7g!-4J4H;Hacm;C_CFmn6L~{iJT;D5-udwx&fDR!C;EqCE$XYw;
zj&WMQ2?FL@Ch7o4j@5PxVL)Tabg5qze-*&@kYR-D1K14T*YTy^#UF6-onl5#PH?HB
zOO3afRx(V3vUvEz^^|Z#PZ$LP(3v@j?+_Sl@YcR1fmRP%!fyidqac9bzQOz`TmViu
z8<M0%^7e-j085rs_-!2>sZta1;XMKmf*%W1cSCJ@vgq6vT>LPf^~zQe>?>ova&6X0
zec}lk3t_U1rCa!XIfe7@enAqqV94o)v;fXMAPIyxh)L;|tMCiue&@C_qcHL#9z*$E
zhLzJ|+?jd1BvE74%JW^9CEN8NqHbYgDT5K!54-x(C(BR5{f<S6GFO+lpk`Z-BhTql
zak1B>9Hr#g_5L`+y)^=_vXx?vUvawNj_{;eqhyF<YuNV3nht5T1I-#qm$vedc@d+r
zP}b5_6c3x<!c`zSf3aqTW?5I`Y0J8I_-;C>2{x6bvRKHfRVSRSF(HZD1@{mQhQ@|`
zUP^>Wf$4Kr42RPtTX9Bbqhe4Mm8_C@-ptKB=rw^swNgn{>D^(?7*b||Y-*NXgkCSi
zVb?EX6ceo$-xxf-qIgJKfZ62w1n+kX?=RmKnB<AHc}{Sf-JdJ<4E09Kv~d6W$V8pM
z0i%Fkb%AL2z7`F=m4npz3{V9Yj^(Es-OdMs4UB{wUpS(kW6+3#BY^#U4(Q92BZWEE
z$TOR3N}r3|U`e%0w?`!LO4>OjRLv8>;|v&5q!D~=3c2xEtZfl)YyGMWLdCH$F+OF+
z=%0<SzmiD)D9Id~oVgdHAi!`^&O>euW^5I$>4k&#3_{On#%Oman~Lj*br&xS-L#rh
z)t%%FVox|$=5qTu?^ZG?%rYOa(;Oy4Or(?2pTugJ6=@|1wn(~l*_q&EWSXbPu`^Q8
zjLA0Y0*_}$Shj^gOY}tmZ8FkocbQkf1Nb%bm-eNw*?DEtVUHHG5p(O351%>_<_3bE
zp8ghQyLpR8k^G?;`Vaq?War;B^AFNmtFy=lxOs>-qlmB=8rt6XkRqD@Dy<zD{8HSP
zV7Vjt`OnMRC`k^rQq*{JJ;B!4=<?<D^#RrpNML2kY)uxa0vzy6lfaJ!M5W^i(T0vZ
z`X=<N5;duoS$0|*6HYayF*92kuJpQqi>xCJZ6TyOn+L3GDqW4AG8k)cXj>?Xl*R#G
zPu6wUfu!~496X{WOcY;m-BH@U9ul^#?6N0a?xEbH3Va>N1QfczjPf{HPg;O>sdXz>
ztYMbty~WJWz4JG>973r^4Qe>cT_W67IdwmwH8g(*t=a(7>Xmwtka+f*Ic>Hn4*(N7
zo}sYd{IZhMQFS|w-$|`Fh^=FOaOOIigBYS!YAu&Qm!f2PoRoUwt>{otm6qlRL-f8g
zy~!NFu&$+O@3rF;1`73qtMbvy-?G~6p8M**WVL*FT@&NXvjoazA*(hXQ%{4%5B)Ee
zB2GHvd%tb*oqtuf7UIgbil95biD`uUkj~&t8TD75q5UnZ%{}-_R-0qq-=m<`esCfm
zgJBYspz@9Ho(=2gsb$dqQ<52TO!L0V(~!T}vH$xpd%Py)f|tqJJcmHD#z#M^Gn3m-
zc~TpzMag47J~r~c5><JFmo$z_@yXJQFw;oA;5~dEICs$f3%wEDArB4=exf_naDq9c
z>1-WRzo3iuXW!&iGr6Q(joh3PRXXsx%92Eb_88<QW`N)4CK;5neUw}8uL34v{DR2S
zX0!j2)m{+)1;w4#9(l<>FW%TcW_wuw1B(APq5GE?7N-~|!+;-oD`93pmC^@GH2DH4
z5-4n#tA~2&5=YU7e0Q#Zo@DsI1Ulm0u!f(@Fw!3=Kmu&*2KS3|>wJG;_=s!>my6|U
zEHzvQjS4=Q4n!wCM_{2FOhem6q{@S28-xc0Ny{O`KDniVOSYiQO(*Cqheh*qH2%~j
z^*$84^-*~+1}T|d1KU~%di72IMY)!D^+xA5HcqT!V?uc=lmqNpW(e;qB4@5+;%8b2
zBLi03-`fKX+Ocmhq%I|#X_@kA&C`6zbLAavbQDdc<}6*PljN=et*+D-(n>APUi4!c
z03*9jid7Dkr?qq(3V?uS!nBi#3PA73+%w1wT<STDCXz-PbjYgDT(w0xKvw{;3IC>P
z5l%W;7buTki>JRE9mNQ?>q?&1l@{P7hr-aDXK%+IJ8JoE7e9tFz_c;8Wa1f%3V3;t
zO0Bp}COO^i+TD{w;HaPpOHepy2;)i2H2qmq<*+v^0$W2L+>9$*Ma;Lt5q^B6rhW=6
zDndrQ6N~7s4Wdh`Ba&6*9a{Ua<YI#vF|tP;<3sgv!NBy}5mw0uN{`t1glX@@;uK9l
zypW$}>+k2RG&snZ3cqwGnOuLH_L&cPyqsvG{P8r_+MWpP-Pvkp1iK<+g}76`&MM;@
z*cH_JdE}QU;t!SLA||4PF_(INPZr%e?cG{+^kiUV78F+{jzBVEdvZ8_%fNb0beV?y
zuH?LGHO4ltI^c=-O@ymhK?#c1dD-du2ekTcm6+}mMyfXy@bU6dNSbH(CrDA)oxl;L
zSE|BiCDAWiB#v;jj!;t@_|^*B$T0r>J`ld*=9Z>!#S6G;40-2RGFH{N*7XAL^m*HS
zK<RuKM9Y<Kp_`Ae4iQMBYEadiYp#z{lZAnMG+lV2n8UPv2mlev<1h)ub?B0#-CT*R
zjdp<vGT{qh;P~G9+Z(itE2&f99fnW*0ihjilK~4yM;f#5t!tAq11j8_3LxQg9$E$d
z`M(0E>?%m<{!ifK|KsKa+J6Mje+wE_I|qzE?2TiIT2rYh)BLM=Wo34^EX#7}WZ_5B
zAl}>wJdoh?$2B<A?U-KD=r<YidCMKtzl;$sgebPcGPC^-mMzRJ4*%LR!W4p<0#Vdg
z?C{!CIO20*uc_37SLuw~$m89tIE&ipzncd==+Ln)rC`Yms|QXpYd9dbj@P;BwhC$=
zN|YY9aqKQ21X2w=_w4e%LJef#3`W;nutzm)Qq7j%3%5;D&u}(6;2Tp;;Q+==MzCu;
zze6l@wUgmU*BZ_mEVb;$?^giU%cm`sJE7zz(&+~i^)~%evR*M*&WP^Z=cH3cTY>{S
zYI=x>gs7KF4IVr-hVi@T5W?8{kt-NQ9=V_Np2JQ7qA``D${S8}V9)BC5*1vKb74l6
z|F5s9CQ@xXYp8bsD@KC5d?RHJ(&QB^CtL7*)o6eG0{W2NGGW3_OIZT01U~D^ZG8IU
zcw@Mld%;P2k2n$anX6R2caJhK-&L(zquYGkB~&(5FWq-<mc|%P<%<=jiV0*EX=M=~
zS$3&5RsHZKVu3a669<%vkB%P3+EeRm-OT}eLN>Tgp)j*3(BgJRG%-3Zw;yAf{mh$v
z99>)X5jHJ{fMixu?JaPL@A%8W8tlQ7lIsh7lHkq&2aE2)Cry%16{x*ag78);WA-Ep
z?vX`oTT3OIGUT5k`CYN<gUNx45+)pU#);}$V!9P5j#gDgaGp?z-{}XM^PZFczJ$*D
zIZuP)55fljk(&R`61>D5Ox*0u>|Ot5<nk|^Wvkl!y(2kiuhq%GsMstbzPCUvjzwI~
zf<9j)&B229nQuL&uHz@?YI)M;F8t?Anlj>Ns8^a@El7AA*pP~?)8(T5aIM|t@UZsc
z^SibF_ejB`R7Tq!p)7K!J8<R<YlF6XX^qUWp_W=vEj*ZBn6QEQM9X@cDfzBVh^x>A
zRLqytzw}<DdPf(oYag^wGh|5gJp6tYG|nk)m)LqXE!AwQ=Wk5spE{(|%wA9Yl4@#M
zOt5QM=GfHO?ih*Q`7ySz`R%?z$LfMLuK=W>kprV(A^E!lm)nE2N1HE1gJ0TFvB*1R
ztG=XkX2x3d*gC1^SJP=(iu?Pob_EoM;EH|eu-}}YD&BGtY+<sem5T}v25-8*P^OSU
z6VN8vE#WoPhd?6CGBw(acUq$PH0xO)<5cQ)YeNDA_vE&4i!fltMg+NB7mC1HaTG@8
zFK|6nnZJ7Dm8D~C=+UOc!-&>Y9#OM}I8!eSb}EEQYE?<3OFFJwZ|_LC2%H{Ve=TQj
zpcfn_c6K!2!))-S!jLP|okaiid|cx6PnwpdxM2p$G&2VuF}@2*)ac`we8Za64Qr<-
z8HUmfeIMSxhdU@pR3O<_5)NyS8mL9VB1vBxbwpDW0|OsNe@_023>NYtj#vzx3ilK0
zP|BjSh<Xq36}zUN@Y8)9=ams0HiGst*BB&|X%mSQegi3R_Qem&0vzA%n?y&UN0?>`
zq@#Z`Ws{(C3NSUuH%q873}n>kKS9XHqxwxefQ7kzWkq0;KODXHw}GEX`va8JA1vDc
zV_}T(Hx~c05&Ew<bW>TipA$k8$Xs&Tu}$P`3Q0<7fr9LouxKDC4<cbJ%Ij+fZhd!4
zF(qxTY<|!9CE?5Hd#N}Xk}D`*_)VyZj50`@=1ThdRXQ7=%iU`1lmXOQza0VLI4qXa
z@-U)0qwY)?2LarV=H=-U`(3&kt6n#xOdNaWr5y@%BZfj|^Rl1a*P9O;y{JAL{spE>
zt41{L;)FC_S!iI=dnGWd*I=9*P!T_BL|KD5>E4uvcc4%-ALV%fO5E8WEqph`sPDHt
z9r;BBVR-g15?Do%qO-9oQeoGi`0T~93_AZNyv(nHs|h1t8~B|i7B+@e28S>P?*Aj~
zt>WT(*CpZL*0{U7ySq!{?k>UIHMj)}5FFCD1PJa<aA@3VoFIV!!C{jB{?2?eXU=c$
zi@sRbUG=Vdo>gyE6`(o8Hv4;j#v#QYVg8`XkSv(t6+h7sMK{V<g=a`Y=HfwQksdyi
zX<p%2hs_?M%(JEZh<Wpc0dG7P?rQadfaQJd9{HTh*h43+Xk&X1c`G$7IAQpN!ht3#
zB~n2ea2<Ncxi7ntR5%8DBR92V828g-!lX$R8itRXIkB;}*I1u56TCIx5anyc6>`Rk
zNNwHZ=Ew?`I)uq5U^~{&=`PzwmBnk|nMxh9Nb7Com27!|8}YoOp5)#qBjB}yc8tV5
zzs^7W4I722Vx^)Gcyry!Ih{Ona{9d-pF^<?nXyqNqUH-+46M82N8vW*?+F#E6Lo3J
zdc2i}hcALaHq<TpK*sad-zb04W2Brv@Cx-uM*hd^32IvUlGYY({~J3=8UO4NN8hAT
z)?M(C5fNj-R9RrE1FG@TqOb!?!^nk-dp@t2#xkc<pM=M_AUqr_#Ty{Dc*fOaODVAE
z`^01(w`a&v$J5czJMwpQ4aFrel<bC_RaA+w@th*+92b(>vea}Sk(2(6jdD>x2D51f
zKTt`#^>6+D8l|Vag~<sUNy$XXX7r)P>Fbtyf~KK_h1|xbzFDfDzaDB*4_i{X2_Lae
zHY_sIm1N-F%;g<jPP#q5qo!*EdSuG%aU#9<-Eu6W9afZK0gK1-W}Iz$o*m|w^Z+d<
zT=cuh+q9oHihII4Wd*nsf$b$z90VOB?#~L@Ez*w6gw95mX8Hpv3D5_6;By?*-5Y%>
zD;$P)8np=(N6%{{t&YqQ>qE5ePcpopm<=5oY`<qeFYYGx?#UYulCr!%mi!t)i>k%}
z+Nq4TVd1)&K$v6U=boE#(zW*Ev+*<<5-*eO*>|m?8+?%Xg$;+zF&Qz%coD|tR3L^C
zV7@(03g5_OtECTy#7FC#nE%$S<Bt|e|DC?rv9WT=*FhL?>MJEp-%(+|C^Q!P#52@T
zW<e?q=zm<o*E&WX1K+)s@9mdUoT1XA<o5@1>I0Ixc=+;*WtveL*SRJWx#@d?&Li8l
zg}==Wdv}k>m*nvde)k^K^FMS8WGHImmJI-!r46u9DHNI_1dp**G%9#$+6X$hrohMq
zV&_-ro3|-zW`p1#n1bN(l7plN@zV${=GLTeFy@k={M-whUJx_R`A$^V;0Dd+E>X@g
z?--4L1tH(r@f3b>Z|yz-jL$IDCA^aNao{9MNXPDTKt_)F^zn_T0!RYjPP>tbY0qF~
zMHGMWKx~hFib9&|66_a|mwa)3GV48Y&PB#J2UrE8DsX=CS`eP6TG{u~migZSSm|ez
zA#X{Uo=q2;2J5Oj;yzyG_FsjLOI6=7H`Qs*EPd}6!nI6~|CN^qu&g+vkxNyk-^|Ll
z&lss?YRDIYqls&i9diEhgtiF~?k0cu$DVuc@fGIj&#}AvAB)t~EnNOvtjAw#t~$o6
zDkBILVM0g3g$daKgNh**FWyk*M;I3j%!fDdZ+*>mP&#Pfo=z;h*Bj(*J%VsqOmYXR
z&8U3+eo-L$6dX8KVAdP@3|k-TjQc{M#ZgBU*}(9~K{*V<(bC+|c1LL~<z=lEX1cJH
z>#spZ14is>SkCH9LJA`M;ZOi3QH>4>RD(OJ{m<qFgj<z1M@f2t;M}4o-ielHnn4gA
zECKE|6VX$TvIfF*poI~6RBkLeSEQDzD#wryi&0ly2G@Wn2e<66iYL|Ksd!dpvH+M}
zYUV8b*9e+@f{6av?Sg!(cOOXZ8ooC~B9Ndr)R;%@Vd@H!?IFoSJ0dR$rmfhk6C75$
zIvLVh1ZG+(|0*Y$xy+-E0>ZHiv|OeYca{R86}AG?8Dm*KljfY!=6E}8gXA_2&7rrn
z=aoNbpcs^E`#4!(zu*6HsX3J^BXP@rhP-I={Wugs+07{Lq5t!aVV9~p52LbZ#ttR3
z{M6fN+0oFA52+rkAG`eptMs;w_1bS))3Ue>;4-#@!G6k;Dy|y0*ZY&EJm6RQXHmT_
z>^f$TCvDon`j&aICv(P(dGn!+z#^OA7T{0oWfuCJ<|d)aagV5ReP`A$ufAC41%90g
ze7zr+NX&2M;NkF^qfTjJPHqVE5!0uC@N&FB7w-`XO=B+Ix*`^S`BvOXWH@(J6`Mz`
zr1TQ$;QyF>aT~2VUV(DCcNIqzP}TMum(xS`mMP$45A2w{0^1xhZ1*UKEyf@VZixl5
zd*h+GIT<redef=V%`CdZJhwjGK7)l++tokd^ipvTGyMZjn18DY(EkCam;L{B%R<?c
zSQg`TDWImQV919mok0L9M#37&C=Llp-+w)IPbO2v$%*+8(!lfGQMt2fajm#wSB428
zc|&tJPFX+$4wsQp;R>eBedlM2*T+cf-9FuO{!LM{J1@1FN%GLQN8zw<6@~)Qkx`s9
zUt+0kASQ|5c=}Up1qR(REz<mdHjE1DZhzbrVdDtu`w_zeH2A*r_u|i_+whPM3a2S$
zv?E}7Rm9nHWC#_;cC(o@wArc1)%k+FS)nSmypRQw&|>wJg_@_Z-?Cq)^7Gz@xBED-
zMa#gW^^;X-Y1iaRWB5*!kuE&EN6VLA!p*1$tYb+`1|>FXTSglh-f16wO1=k%1T3ZB
z0y`J7^X6WcN;>yGX)oCpen0_lFNk4J;`?D6V1I+==cIQ-X$9`X9;V_8g!99ij>h)6
zM?+Vm0LcFghE$obVk3=lxZyfDa2J-q9qeeetIu&Wa7&axC&UbOJoWnliLP90+4km}
z8jlS6>b!IbI9R?xyq3ximoj*%e9n}eh~2k#v;Bh#_TXCLSlW@bT+L6arP5RC7-qTv
zl7Php^%=gS`>Fv<YVQ+XoJ#m;?5F&ZimVZ)7g-ntJ{zm8+YHm*;`wf6N#^lFpX$0+
z3Q+?sF$B`L?Xo+=$`=OCYPOSS`>DR2SAR~{e3MoEhKVKuTFtd95m~e~C6k%+{FxiX
zCLUI0!QWCXz#$}lq4bxa>5U{-onOS8N%NoC(-psp-!~@3XC3@fHqxEt<mzIKF>^Pp
z3`AW7GG?x1Ve^YiWx#C#;u~U$fjJm;?VSryLOgL!y2Mpp?kgDkLa*m#Gq~**85a+n
z0RqrB^PdqyM}?_PU<bqqybR=!)FR$lOucYEz{+tgN||9piHgbA$EkBY5ER?#Vngbz
zf0t2<aw^S3-h~q)*5D%dD^pLtLG3w_pUf&GXP~I8S;b|d+&v}A&%Dv3-(tLsEoj~F
zQ>OLq^jVQOSxTUM7{iO!4S}bB!Lz`Vjzoez8N*iCMHEf^LLiUq5O6rXLqvB{S16s@
z<ZRrxOcVNnF-ZC6w(reQ@JD99$ZDK(oGq81@F6Ak7DV|t2fVWblw`6fG3(7UtufE8
zvABiieoO?*xS~5$WKEZbmqGRd3v9y0<pYDoNVYZH!%oa|-X&!1<R$TMO2Z#mNzNB}
z!b1iKW!zvsWS8c+XfC@zcs#Ua$(Adr6s@AR>WD5<mW4aMl$-tIN%&d^CM@_P*4Y1T
z)Wl!8|34Pgcw+0|ylv7=(XFF6+atpnW>BSlEIW`!&S`;;%CujXF<Og`Kc_R8XFYMT
z^+ow{oG$Y4{cl4}1bWYLN?*ku`A)9u^nGu|(Z&#srkCAs-x<-PjXyGO<D=Qz^A-L(
zeDhO*a8NSN2(>_RQ!<iDqgMe0dQdi68Q@yKZDYzgJkN}2Je&(~z2X@JHzgBJ{_rDS
zCa804E2bVHw9K}e0%p26WG~lK6fKfW{N^8r7R_A^ErZL6w|P{=&S`O)D8v=OHQV4N
zBS?Sh(aATyGMT8W5xN7eKQ4H2$MJ^m<Z1E2J>s*j8*gnh=Uh~2)TGgA`Xt3L3(F<#
zLv(TWipAS^h?+^O_f5JgmtuSY>@z2D0eh=XyLDkbyJwxWo?E*db6r|5pxqTFFsyv4
zA8sqJHSJb^Csu+!xSl0d+H@DkG*uuDGfpG=&hJrd5LuV@!W?KxN=$@|<=en`1$Chq
z^u0dH85O59HZ8g_GVUV{(+Vbmy_Ty+YJEMkJGoArXdZUTCP`)T5<#qI_~_fW&;{!C
z=M_EAaD9<EC(XrrX4Yi@+*MM1UuxFp5>k_;-&4r)fMvik_qUDd;`@GCq&1@k$xz81
z4DXOJci^XOEw9Rlx%iVAL7mYl;<^UAM-rZw-k73q&F@Ju=N;jlD{?fR(AEy}EW|mw
zysK5lVig>=y@7^BP0%s;o#&sEVM@!Ih8nONE2#=ombrdkwR^^Q+K%0=C237AE0q31
z@2dE+o8<8jm3g3@2;jH5q%F_#nc-f~u)KoFTR5T1>MB;fGtY|A<RxWry}LRh9)^2f
zHzTbm3mt0+Hav&$Y`$RMWWyepW23*y8Bv?S*kF3;sA4CFzoR^Oa{fgq!?h@(Mhe9%
zCSRYtW&MjWAav;zv6;5k3e9&2@v}4(G%Lo+<Us^C_1POLxQ5)JJ(Yy*Xr)paoAHS3
zHkLm0MULr(`G!_&W==0g<uy!N&Alx-gcd+U99tKPP8S^QMy4?U8=)Wt*75^5RK1S?
zU1yh!-UzYHo%bd}*Ugr8#m^|dLK6nXIf#s~^o;O|P_l<FyS1#M2FcAu@NB7Ketm^c
zzGNUKct&a%;0Cb5*~;hI<P#os$kDfzII}6lrJlnliy^CXhJr?j1(qy?qd6d~1O9;7
zPHvT%X@aHL3DS)|c)Zy1zEgo^OG~VerbKpzpR-`J`isrE?+g~_i_Pi%wOnk`HGgl<
z)5{YPyw>HvRv`O)1iQ{9^a5GeO6YLMi0FgSvHn$~3h~XR82obtME=Km8g*AUZ@2$v
z$*JwEg{6TLf;Ss=TUKmtSZNbqpS`bazN;+tIlCe%eSQ@8Vkhl_t3GnRH3V4bh?AS+
z@VKNRUUg!OXO?yjb5sy~;aM0s-F|fWG}B7{uB@TD2;mNAW3&QYQY3}5%$$T0j!XrS
zhDAk&KqtH6<9#|ZnWd7t<v<{fm0>@?cDR5^Mf+?D=~`dTSjw)_Dbvvg2_~2JyxWJQ
zddd3>!TJiOeI{`;jXR#VbZaIpASM^2KLtj&60DY*G`S|_zd`RxOYBPBQOt#7E4I_(
zzt=stFVypCevy{S)@9iDGpM%DG)Ud4Cd<AheX^vrTVnF>DMK;c+1(QDR^MOBX!~gK
z4vFv@pjO|PGE@>7a%6AA!pUMKOX5F1`_Twct-uMoN`we55ty2r$VFSguoGTT_1DMM
zz`8bcberw^E05p}^7#;$LU^Uokd%%M^|3ZAQh)A*PDlz8J+HhE(K3X@nzTzN4K!D3
z>t~s!%$_#Qe*#yDh|!NLYS#2!@2_@ZNkM*7CqGKkQ$?Lm<VKgy5vTg}mDzhUXNt+6
zRA`Rp%G=EEL@zE8pIql#YyF7${c(X-wvOLX_tUIzY4B3>4@q6-`JP@>(63BK8i7#W
zkSFi7a|IA7Rrn!u6bUTJ$*VGpm3|ik(_X1h?XSe|lMN|^KYZs#7vL?*C%FkV9NVRw
zzY^n3xu+bWryR=%D=q<F-@%V<m3<YO0wpXp1;8sN@$Cpj8NHy*7(qg1M+t@0D64-U
z?Q8iNRex<}GMkkxFmet%4|Xy2j5%ZIvL00wf{jK3P)ilWGs<9=i^t;lV*&g9F|3;6
zDY~SZ!-=z$l&}lK6Ah%I*;IpQ&e06N;e;VJg<ljNkF9ZT8@trH&+H>T_hMjl?EglC
z6GgoVj_8HEckb)qa}y1R?Qr=0)DVWrq6w`WSu-o}6?|3}E2u((FZT-lmk>qWAwkoB
z<gUoSoyGnJ(5id5+IiS`dj2=Bp0}2T)?YKH1GB@t0wWGfQ4!TFXtpS#L{?pWl&ON7
zgCnS`#SZA4u9~)%EdKqcP>X=j9{Q!c;6*8}AyfL;#6{=kdbe-xc4){mv>WjZ&JZW-
zURA`qGHQZ;UMOy8TR3AqHyHjX-try1L)ndpFj=Td#8O9OFOUt(n0_Wkt)R~sq%PMk
zIkIw->*;$=^g2gv+SM;-U*}vw10-qUGMj*0EL+WxY>m6g_=cZ?IDzJ&JDCr0!UpH+
zQud>49!L!)^SfV97e##0^n0XKRt~l(s~5(!f1h_~?aToC)o!$fxDseDY-HeYk*sNG
z*xxG+GmK~x=xZqE{hbhXMsnf<+rC<oqFak-rw&KQ%dcoR&{8n&a29-D(QWupj<pN3
zSUI2eL}zvg$Mu2HovzflzM6M^7f)j>B;V(?Hbp75pk79ve(5sNlQMHuf%wQ+A*(cH
z3<a*tD}i5hyZk0&X|-seB2|^46k)O?a_+5mXr?Xi;3{o}!`Lc$!n0)WYQa1$^UM7F
z@cG=W-l<N<miDxsj9bkrWIvickJ+NePQaAo?uD#6f9af7am6rSsqQZG%)Wrsx=Avg
zE;#a#Fy**Zk^+#D-zNZp^)JMvf%hvflmLfPxdla-qfnZ>MXRG^b!-=3=q=4VM;gT<
z>Sb>iH({P%FNpp8r3b*qoLi424Zad?m&%sRa6_Yfgt5w|cY*q*50d|40GwxGgWzVm
ztB{Q%+t8{7s%njv9O;J^f1AP$^~W95r?v%)-z=E@1>+}ZN5#MUSjzusRMNDtc5wZl
z^11)9=xJcQs-kSR)M>`6%d#~WwaDsUCR6yTHyKmOl(??{R!3v&w7z2@_<t;Vo-L>}
zEp&V*dF?a&+`_#fp-)iefKyJI)VMD&Fq|OHitnEU>UIqQ2Kzkwd$SxE!zlq@<vD9a
z<VrX)M2O09_)FR<w~UBf9NWq*@+hf%Bl!i!XEprZXGU=!DW9wul^8=jA|}%Z@I2y+
znb(I30!L=Ker5<t8%eGNEp9V=_|CH!Dp_TM+|Il&T!b&k*tu`)P&yC89kOG<I|v(@
zBThSw755YdL4#MDSY}vEl6unpn7FE+@z2u^{08c3+}igtcsG_)2O^VIy%=3IM`2V>
zvPTl54M;uz=)xi^Ol3gjyAL*NxK`2~8P?PIx}Q4%EY*9IWSo&;Lehz%mSz>h4zZaN
zzeIW>WFg&pC95%zvqh>8YC2B`e9;Fhfcb2eb8hE#=86A?l|r7bDf7jzH0xt$p_GVA
znpRxU@8|_U@Ga+~rv5D+Uw+mG-q&_w70x^z9?e{F>BdXn(I)*V7I;O%0O)JxL1CH%
zPNN%;a%ywh{>qCh^SQDg@kWX2LO|siO0@nkKAA5%&SU)^_SUpvFofV#+t{UD3QHZ%
zEwpeQM<CBxCfiYcaaksuQc_amWZ?#I^et&?e`yZH!rSweCZW%lk6HPH<7P{cYfLh|
z;;7teKNixh%^YF$ap3?Q*p!A%x)D5dEp68SYZNg!!Z4734zasWU{3kC@+nkO;4-vO
z99mfFo_=egEtAPm-29oFYP(oeT#kpZT5~A}-+hdmzNBvGn@p8}p6t5(#>3BwAw`@h
z?YR)-mfRg^?AZBL5QpscJzxvG*fj_(d4WpwQ(C;6l_ztetvaV{g(hPApU<t!PJHB5
ze*h2qw}8k0p8)@VTNUVJGFd*5K=33lFj5eyN*Ite*kBltDEw5@81(_fE1U0z)q;`9
zrIjOSb;QEhch>cPJ6R&poN3>x+y%V=ebs(GKVI+AhfyMuqS`OcmJNQ;CI8_r9p^(U
zlyST;7v<9YL!(5m5{fh!@yGF~1fk0h0vQFy)*u;ynms-_o{c%kXg1gOyqnpefb<E>
zAWt4r^pb?N(OH7}2&ZOog%#nUEz65!&PZz0$dfK%7sN}GOIr@0#b)cX3yzQTi)RVo
z$#1~&SW{PeX;dIOsZ87hP4QB<Gv-UmPRzw30FvGZ6Evd7it>cQk6&S6lYG3)w!+dP
zu@ITN%&;QjCi#}Vm#w!;NJWGvfY$(m2#%t#XjvzJN+l{G;jD41u>=k(Cwn{D`wd?a
zxe`3XxqG8>hK0|3E^8WKv{(o0TJ#+F#oPfF;m80v-%kLvP&(Maq3ZzUeW&;7?&}RQ
z17pRNlaD@B-QRNgN)=g>j_R)=p~8{Z`QeL)Y%(MQ#V8o_m|jRra0**WDP_v8X&XTQ
z<2IpoghvlpM#=E~qWufbGyw0gj}jxjbg5AT?O9Y4tqIjS>nObRLq`3<aqN2>p*VV*
z2wg$D=mH5!tGT^g_OCQL8=0z!T;>(bBl5nQ-g8P86WxgltN1~gyX#z##LjSRN9{6&
zPZ=Hj^~JH{eCH&Qs-kYhVFb^1uW1GruB@>p$n70{3bd<JDM$LL*a<`G_9bSF7>xFk
z{DbdPRa86hF*%*&JMw2S@3)aX3WaFB$Rv~P%UesJepvAk&B-)=ZrWxjh6+M12!m6D
z7>G-bad!3Z@cVsqrxnjSv}0W<lwIWvdN3%jeCB>uGEz?o|G8tJy+1Wx((=B}R^zkm
zqMmm882)65?K#e?w@?$`QKsxBK7X4dO}V;kBerS4I@265{H_SKo97Wj3d5H(3@PAX
z0K{rZz<e{Lm}rS^B`^RG16M;NQQZC9@@K<TCqwvypa03&ncaoyzxhKP$A2qZ{u+G#
zZP}gF-?BTV_*P3aG+7NCTwIZoFb2fkaI{rUgT&5-3#v@lUF`eOMkVEv(m%XGw^<d9
zLyFH?2>M&F{sL5+33<CZAP(EpZ<tH^!k4DNYfca5<2tsgEwl);NP!S^lGq(l78Ka`
zDFV3jECr@oFqfuR1QIlekKF!__SsPhd>w9akj5x?6m00*(>iQiSQ%Xk(^;1uj8u>5
z+l}LhzODWJ_<&;gWvW&I0b;nititO;hne8g4|5A$5>6YwO%fBJ)030tqY0sGtqIvi
z9)WPfLe>f$u&-`O#jX9NVUaG13mZue#}hUj?(}_~yy9v4s?(32FwxVmaDu^$2OOln
zUTm7CJr%$jsATE}1U(kxPi@hsSOy#QZd#UDT3GWdtnLXG_|oWu02k$r{+c0@3&ZRz
z{XWq+*^N(a9}%$73CS$R2CU-f)$uZEJ^tx@-j}>}_*zgj9_x=oV@!f)|C&#qUq*GB
z7BqPgs+-DmaFUh!8O4iE>p&BiQFquoBSMBr4d=DxZ`ED5!jYh*r4C&2w1-A#nh}5L
zan-OWQ35nj`;Ae2mM+x(7>wI=;LUS^|6(o&_oF>o!2T`NsMx39mK^h&9<E9CXQU<<
zldQe*z~TY8<zj0YnpQm696kbOTrZDnp(i~O+l-S;vwt=67)Ce7wG0i8TT=6X>Ftv8
z#nC;rN8?hXlP<sgTeB`WO^(}TW0~lYB=iafdwnjh)BK_00<ktMFlLH5UfH)$u|cq%
zc%d<$%PrFDAIbYEyN|W|PV|?{<9nwsl0dZATLJ?FN!Io(H}a{iRQbGprAKTTA+3QH
z)CIx^!UoiZ<pn=r^ZWM^P0`Ets&-<7TM~Q3Jf-3iAu`y&al>nP!$fcnTd^}l)CPM+
zO#oJLC4m48vZ;p&7KjabL^p>W<&fL%A{LND_aIOf0J_>o`jAl+a@{dnP9G`TfXV0n
ztLbiOK6bv|63v3@Fk{w0c~ezUval0&`pYLQTK804G>9AR4M$WRb^8%>2Ohuto_=9{
zu&)}D@Rsi2up%^eq`b;hVCX-y!h0+_5AHw1bJKq&-T&Bh_ph?7y#!rDxe@+>O$-Hd
zS}T;iY=M=Ouu0iC&JjL7cn?BlY=@+->a#kxc>I5LWzjOyFjVZqXg-wTZ0<ELnWxp}
z%>Qk8wF?M1`Wb504dn(UzAg~|hg2My{g{dC3_Bu@_ylwWVpjKg7HJSF;n02yEs+<l
z56aoL*%ob+EzC8+HhYf7&F-kO(FW0{crGgfvAKX&mJF64>e<c%-IAOz1|-n?wb~`B
z@FwK(>h<4%%2rFy_alD@8Q&Mn-CA5wA;s-+8db{R*8QXLO+WBLi&W)E7d9Y1L>A?&
z&{I@&d&79SztQk(I;|Gc!jdMCS3w-dPQyq8Vp~MS+e)H3nRD+2j6&%-oh$2Bt;`6d
zFlT?5Dyng9%d@qga}D?;Ym%%|=RQq+#o5!$LGMm{jpbW!4yhZW`rEc{yh}F78IAe3
zM4nK$p2?lu5exltc7QtW=VkX0x*x+8HN%yVG$AgE;V%8(k}P8<1ra$DOYDL^^CK1&
zW&gzvTe%(?m}H6V&cqYrhBKf0zL>Xf1=`$dZ&;t(`|8uz*$nf2Vok~!6+u-p5NTzY
zxY~W$j&Z_yRNTmpp##yKGt_Yn_Sh$$CD=wU?A8~F+!tx-EH<m6sxKvGcOT$zD}bc#
z;D$Hn`28v%3FbHAc(#>E*vGrNiIQIh6)BG?eAHA2wix!v9J)-$8yDWcKa%2QoaB;*
zT1v6RdNdBU#7SvdbhUk42b*mdogxW)^B@>drWen@^(4J7X8Lr;<TtvXeMp2FT-1KT
zCB0e9b9M%?&M7qBl?I&u;-K40v1!Q<DapG@xEyuN{Pv}Eq6c3?MZv@`(iBh>1Ai-i
zPaJm;r(eL+NF33nhFMUyDt;^#zyI|CALC(;ufy<|?-y-=;W2PQyTmXqM|DA^WDRuw
zgc|%XmzBb59V*ZFhW}V#73wH|>T1!)@Zo_kTKA0x4Z0A+REoS<nqCkgjx*r<NSt$c
z({*+Uese6+q*YqTZNklws>KH?s>vNfHmzticRI0EQGGAIfDiK5Gn}&{91~8&2>QRl
z3Ul=VOpy*B2#I`%$!WFWfr4MDfNGB7wsC#lhJwobEv?xguy?x1D-pu7kKI8YyW8<`
z10UMkoMILgQU;<YO=n8zKkkG$t_}jnKV+r*x0^1)|C6l$L%p3Q@gK&*C@|N`XXjc4
z4NeEs0tSYL@G(b|W0SBFk<2-KTt4um;w6~a_}XatD~3>;rDS!{*o@VIn8;Jc`Afl~
zEQaGLPK$XL=O-tEoAcbEFV|0n@9K7p{?OH7kE^UvAi;rHcCy|l$|4gY8eI+W1pNGV
z&1>qDAL?rDj!hfwAC11^lhBOryfH#bOkO-$-*?#%)yb#2M>bdz6(6Mrs~PCR`W`Vh
zUZSITGk_ZFdqq)4yX#C^2SM)qb={F%D=b}JDe0{W?t1DvOPy@^>EiNB`I=|%vLs_K
zC5QTNN5h@{w9}J=-xn=tON&0~EUSh^zn6%rWFP%VWY1-X1H<3*ZoC)hG+(kKVluum
z`N#(p{G{~S5Y~Oz`k|`l)Fb;!r}unO*PB<<w7U}6=YU3cB_!5dPvcHLfrVag3E_^@
zsZp%iix`rQz6M|e@Cn&Coy@g%F<WTJ_Tr*uXnXpyu*@KFL(4^d>j0ev7W+6?_14)G
zw+8Af9AKP@A2fA$WWYvtD*IdnHAeuzd7LBj1+6^fP@GwL@%qO1Z?&E0ucre?&6<^F
z8A&P~da_X<Dt${l{)v$MWRo_=4`lqu3{NkOf(|K>k_Ot8FWl`v5!TMgi8{Pk2E9o?
zy_AvHR7jlvi2b1Y;u=U3<FbUw*;#sAF;&<%JLhkpyTy&GDG#=l0j;4y15pxn%-v2d
zMV>~{n8&?l!^Jr%@ni&7Ew*Kp!4@L^5yT7ITgBYSf!;iEPAOxvgaM0k&Fal-%(y}3
zmKkkwUq+h*No^|vGe+{L^Co#IvIOGhq{&9CNjxT7mbG!x*-%17>;w@E%YFo6)*@Bn
z&VbjU0JBBP?_TLF{W&wU63=2Ne)1!3gL-@CVsOUDQP?Sv(@k!?XI=M|0bVJ88!7)#
zR&l}U4`uW3kv>F?Wu=hrhsf1k62lknSszId|1e)+ppIgb;}4}pgLcK-8ltc$;A#iN
zF$RFk;+#{P2#w2In-dLK_Lw&B1Uq_`>pu|3st=%Nmm|9F<qLd^sb}C1NTNrX;oKM|
zm@vjK*DtdNIq1Xi4kY%opmruKV=+;e<+Y~vlLF>Oxb=%Z`$C3{CMkgjux!ua^F}dW
zJSOo8#C>}bxO;B~N)@3KBK^~X8J_=PY=Fp8%wNWG{KsNDEh`UKC#S#Wi2o}NUHf0&
z2sBn8F`6bDuDS*$vV+7pP$t0-DwPV(cKrKJ?<|?}dqp8dCBp5Y(b@3b?}?A=F&-P(
z@f&t|s(03|+p8~px!a*VZ|^vwb#N(fD%uhPF}-#|A{R_?(Pztx%$VHaV3-C7GF*W1
zZ8%7bUZ43vmIUayi50O_jMDNpuh|jq(PbsMo@bhsPWlnWf$jEZM1hK}?+v5&HJ5yA
zQ<;Y`ayVJ%b8XtHA2i0|?K0C0W{PLMpT5*jstqX8ZgIjMor#1uv*c##SDrZ`*=?>c
zrOHmN;nLINsZ<WB&hbwMN%~P^efolpjZ7y<W)Z)~SteMpQyGCX3Mk-=M7j8(tFbSV
zY#?HH+*M|YbQ3`xolC-g6>o)hP4cy&Xa{wa3Jh=#A(mTIp3W5>@Bpr-87PyuHcY1W
zBTL^{egZ%N`BsBj5dfIVXZ}6Yv&FQ@CrpIeJMIh(tLBH5Vbvl^i@l>Z_Tq!rB@h?8
zM6L%TcEU=U-g>BWz!s-s<&X{bRB`q<-|-e&mhm4#;@9oi=)>MiP_(k;KC8j|0Etl@
z$&lCs!W(1(e5oJ0$PQb48;R$Lg-pwKzh4wTgbX`OV8bC{un{LSgMW2o`+RPO1%A^|
zF1K;e(DQRlzNa9O-~Yywavl6k+`KJcWK8+}ggN$!ooP;48Lvdt=B8Y4DzxNjR<<#>
zsn8xouD*!ge^X3Egobe+UldeTe1$Ldq|Wt-IgmRT6H6kocpF@SU|&_(6~d=Ak~9-L
zG309hxwcSC@<dF^>l;0uh>RnubEIlZn5p#B2!3yo5l#85N+Y`D%?IjaG5{4+k{Acl
z8hgI3bw;KoiDPyj9i0YfaebJ_X1lBle&gXERIhuGu&4c*)KdTLiUZ{@s{fCg4ozpZ
zd3BtSad;c=#_%El?gCVcGyyx)&TJ%yawY~XA?0rC1cOn7V^&Mp75{^zIE4&$Xqfo;
z{f(v*j#*CL_086G-cf<)#mn!PYrS`#epQl#py;Pr?(coE#)^YDWcJx3iSdo_xZju#
zwI`VsqDm^w&G#fo;u@(pY}?5mTh?nBj*+Cc1Faa3#XrXHaUgpnNY+w2@f%;0%;=@4
zA$r7IsSG;$cJ-lsHd7d=RxPJpVw1vTzlkC~3k)&p*B@{+H0|u_=ymN}T7nCAy8VuJ
zW)hP#?zqNmnA9?8spqteR@gwfxuTn5dj0$RxU>4sutnhVuhz)PiL-~@wk<5uSM<}d
z@Y9~-rZYJXvs#&lZdOdEfHQT;R?})ik=kB|{JT!Zpt%;Qge0|5<e1{~p%3f3LB>z{
z2YQJUT5~_Pinr@kgqdX1Z6;+vEOKsI!%}$YR}2Y`1e2DC%Q_;{mYB*+ncw`Nk#Am@
z2oGxOhuVsRJQCP_(QDwVdtYW!xuQ%Ki3b|qyI>%<N`5LattEQvjvp{1K1wk;b!J#b
zhWFl6`^cPi_Boke>Y?PhFCJg|@qlJ<pZB!PfoQ#LLa+9!`wm=3k#O7@FBT`bPy5?S
zf~uS`73Py4%pevD*1UQNWPW@1J=Es2mFfwO5@VLI^fHoW=?xN?ynV_ad`BrOKEB{i
zCN#FGkvI$uXQ(%%axALp9{-AVDpsC^L7iH+@U-ps?d*gsp3^n|78ExOruQl=E+^W%
zCYWMZ_l@7fE<b*`)UuZ-W6`va`=W1~iz_!`V}mXJj~PJfTWX8hA6zp2TU=88#if&j
zwT;Jrt(pJz^k1<S|0R?hwdN&oM3svb9a&1lil{OTn^~p$_<yNa%Ay<;+n7HStTme?
zBF#I^UYVVkf1V@!3)U+a!y@R%;z07ipY3;fG%vSLPipVx8RTa_5^De`Nc({sU^n4-
z7m&Ag#*`dKbY8N%&Cla(bssKdY^@&whNC7nKV{v?(HE}N2dPojcqX|bZA|=57^C$o
zof4Q_of6(BDSLC%lThLlJaUDa*|ZXLT)TYYzR8RnTz*Cu?rLy2U&-JUaZoJyYNVQ^
zN2vK3T-WRx%+>vIpz?E2p)lBK6EA~2Om?DfyW*0z_}!zB9k9xlNXw0><rH&(Da*UH
z%3`{Y;}F$&AmtYxj|lH2V1_VSJHcTd_8SZFLgO(??mI&Lkv^(l@TNt5v!7H5^^v=@
z!F|eIV0E7QL|h%6l3z99IyDaZ{Pp3>@LOR+1SiJqqMPwb1L+$Y+?M6oa&wfqt*kS9
zWYW*powxZWrm29jP^1MYuwaHo6K&OrvPG++OUKW4YO!lM3VVhx(+X4gWUgn-ktwHI
zd*;<@ZHMr@W9QK+3z8q#*4FpXMC;=CJYs^rt#Vhklt^01A}?Dg<egJnz)41To8Ntb
z$jf9IWmHtX<?(z_RcU2eKZ44oLMmi@b;UO6sKptSICO%{<!NmYHi_b{%2-^AT+mp}
z2(RD$Pyq7_ykmk%7+nmMFSNyfiFW_osP|o2qlRm4<DS2MgR-MXeaP+8G>3tC^faci
z<MKKp+->Ps#21OXb?F<L0ib<5Og+r;J}uR#g?1Evvh<g@1mF->cZLJimJE3~PpZIY
z0%|XFJh({<xNDpwcw#epx}x3>oNK;v&dRqh*5oju|3G@hW{Ky+A4t3ZM?3rf3F-e@
zBpYdIYT&%0r6D8><18%jC|^U{r+v1yz%Nw+ut!;}+1R24UJ{VRda9R~ze>&kyYGzC
zSN2uJi_GTP?G2y8s0q4j)?b&_9D|>Joz8qLd^d8XBu)RQW4yE@(MwE9kYcGGPstd~
zdyko-s~(SuFUM=#pFI@AV?5l}RHw*EIqZ#_P85`#ISu63=`E#9B*bmi+0dA^x4p?=
zV6gvqereJ}&UNQSO=_694&i{Z^^$HyTs>{YEG{XvlX9<?sBhkIv^aJ}!dGB$lk;FK
zE)pywwrtPd#ERnW`BWS`fukE?7jOOk%D5o~=ei>?a3Z(nw6dvw#M(XDWkYAyupBp<
zEzhnk#vocyhTvi^Jl;P#M&CTvG8KY}=kU!$qyC0wrXrS;#p1ICTs0FJw}@n(1!^@w
zt+Xvx2TpWR6p)zJo$X>ckW%BPilDzhK|1C(k5lHv-(R0>2OwV2zRH8ZnPOFSFx_VG
z>9zRCq)o#2f|S-34;vryC;`acOI+lFrj)-nb?RHVUV>(j^CJlGmd_90Q+#5O?05}y
z$#97cp7_nUNzQ=(-R(UHQ0f&^pt)1s3jUs+S@2~tb3UPoZVShM1e9>_Rf%;T1I-Dm
z*^5~hSqRuaA)EJFu|E<RkxZ1SFu`WxZ^|L74OZ8x11nM}WoWk3c2uoew(MTMH16Gw
zR(%}osWvT8l5MGs6cAjK44smUHF?jfjne43DB6jZv}AZoh1b^JJ#-D(gR1)Ab@o7Y
zD`pZCFSP$mEJfaZtNKV8`~Cs#yGP1q5?LDl_a{_(*)X+!X@-7k0Y0=jw|90N_o&k_
zd6mZ_@wy+VY1`0t>g<6`W?D#RFd|sHERZuh9>s6rDwVYR!XmUh%YLl91$qJUm(J?s
zwX{vavcj?({aDkrp$$(zX$9rA-bpW9bL5<epGt(8TBUSpL>}{ZO1|kwh78)MP=qUj
zIHI6sx96@yKN<vqkdbXj)WoH}O`JFiUl%x4tWI2C&bmVSXmfkSm>BeqUD6An|MgWo
zy`-!N`HvKj`i~A}t-r&wmj9o(f%AW*qyqJbZE!+Nv#q7F4OJ9qogK8|c``o6Hfv*p
zqEc3xAYWkZi<!`@i=<;ddvP_K4|s}Pc+H6y9eL3+&tT%?)Rd1l6Te0D4o2Pj59-~(
zdZqdwb>E52yyWF>zdk<ThCzt{N=P@E*bwHz3Mc~R%1gw<WZwORtqkRlW%g4WE{aEw
zK%`;>YEIdYq{O4=awMKYZ6I30et`m&2GwBRV`F7%q@wOnGj=hO3qG`!?zY5tNjM&E
zsn`Zs()0=l<xbg_;iI%iC5C-R%2N>bS)F%wRc&R84h#L>1a#Fe;@lFYF9PLLmC|3A
zIjd+dWdVHU%o-USm<%50BeWV4pi})qfN#cX`W@Xl41RSEU(09&6uLW|tbs`Ol|=Xj
znW9$RW;u>+VQ5gb$h`THJn4;WxO+r&9E=!ZpeYdpKBa<_70{=;r}54nwW+lOrON%b
z0*%CzPbDWqx(Xmmr9o1aY6ko4{u<;FPf4(-qIPOrV~=TLqNSzEo!4g*yJ=JR?8}Sd
z1E+Pj`AkzbVw>>ffbW}UzpuD%I*BeUBnN|oSZ0mTsafrunN*aQt|*vs3+?Z55}?l)
zg@)rnNd`^HtI7Dn?<($9J|we+dpeX`;#PWFsgBiK9fS_>uoO!Va>YN{SjTy$^V%d{
zVEb_{&pIZQ_e*FD#?$D35`ABHLMrUP@@cG;*J>48z>IwvQ?U&l`74pBPRciB+>g?h
z#~ElBz-iMbt<4AOxc6?1avAO>qomy469zW(<LG&#&{;nwEnddXp2b}R_5nhtZKpz7
zT?FEEZ6?$s-oM*0vD*xZExbE4-xQhlbO>Xu)h&=gyWX4#(m^t~r3IKw9)|kik2G&S
z#`C8ys(eDYnbaP$ZH&6N^_&nP%Mr6Q{)CWVV?MU4_&h<T-8*^Db{96PZL8%QeJZoL
zMW92Qlb{V<*NEEgiWl5kGWa@OWFj90F>gdL?}%`(77Ft<azi}G6a>mI-#O`ghPM2M
ze7rwzhU-&=<od;NS-VCWLb?(Z7ww<Je>m(n!<TV|YL87Bs<0_%{>>K!h)q@5CF3TR
zc-VtKo7Pj|N=zRj>!}&X6fErb1&Y{S`7u;V`FM&ok}o}EU=WK;$7gn23H?zz)eKsZ
zch}V~Iee>PjX=lD8M07RIGqNS(>f=z`}X^mTq9~NHWWbv?n8Lea<6jo{PVbfo`r{^
zO?o*07dVUid%JWwJo@S*(k*fbN>E(uZ}4k0BaD05Do_TU6R9L%E?z88QruCfZ_T9m
zT&KrG8u@3sU1Xx-#=bMMv^A+5)N(@@v2l!p%NIba5+1t46=LhLYaW^F9`pVcZ|e(p
zNe}f8!PeWm>|ylm!H;bdVkT8SEUM%Zv96K<-6Jc9R}uyPvY_FQX4sJac|)81+f>!R
zTXZeAKL?7vo`Z|EtMC5~Nzimw9{4jEx%^l<{8f5a-{eI;NrC;S3rh(fA!ojDbi&p#
z3-l>}t?NU6oJBvDmpwu&{)BoVcqDcta+GJcezg3A5JseeisbY|y}s0fbX~}&zS>f4
zSnLB9fW)GJ6J(fwHH-B@ezduJ70!l@bQ!6Rpz&b4at|TeZ}Xd=bjLy4vk%t~kGHKK
zXh@uLTQZlzg(&^b(LwFE*1*~-UX-e!@y(*O%!g>epj^Oc?!9Qpo`MIT(2+KlgUsML
zswkxGg%2IRpmw(}EV>H{x0;KIKwu~}z9bwAnTBR<sD?AF<$VX+-DxBW8-d5$xtFui
zUf7d1iF2R191Y7>ANnkbK`<F|+^13<neViW$~0-e5G>W5<r78w6(u8j&}(zX6ijex
zXXlFMe<{Ytdu7F%3i?A;cUc?|7IQQr`|sqP5osnoV)+{s)=c&v#&%QnsKio|qK#81
zi>bbiz<YQg9$+ID{&PK$%f?IH9_rmY*?*g1hV|e6ssC?+)p7nCmK~Bw!_sMj2mu;3
zgYnkup)^6Yh8V1p_B;}_-*ef$6xqgDb2r;MDb;Vq@0)x3X1Fj&^4&++LoVe73j+D2
zpr^Ax=LKH)2Vb-wZM>ZRGz&%Gh$HvvN@|MEZDaoqO7`WXZ9|9%WN4EYO1<;y`iKte
zUt>Xp4x1WJh)Qm$J1j4>d#|rhfXG!&_2mmWisiS8J;ug}pehLWen&mXijbM8T?Bh~
z2F^eyRj;9pLicF6s77Lp>6nGvlnDX3?m=h$*TibPjwNz{CwmPHv-9GIrVN#I8~Y*(
z_u};()wx=f1Awm|N3}VPzigo3!f{80{RpdOj$g8{Q@ie}%~npcV>*p)bDOkVwBasG
zfNt|7O3%&0waXN9JsevNwtpO>3J)a-U}F#;eyiUE#+ReSa<dPf4;8SN8P3|jiMPSm
zqkZ)${OeUxIH`!9WL>9}K8HH&@P*(^p}X@kcK972L!GbhD&nTLU7ikCB0SZb<j_Xp
zg4@jRjJRGy147^yWrrKc)Wf^euQ#jHfIL_y9#lcap*|QME`)|k0x1puc_}*VI3;<|
zp=}5Uqc_1Czc6p=p`>HkFXwmKYG~Xx8_mbuDRzyP%`d8CQk?oQZ);T{hVtvVv@O?~
zkGbTo;OT37UH8lwgCyFu(@fQBf4dWfU{0r#Vl5b0_7E|ejV(v|o;UXh_wath`+NP*
zD(xml6c3kv<b74<ML)#c<hC1{Z{O0kS3x6NbStoYk?TM<PhE@N{dV5+ilW}qcfZ~b
z_E1%OUwE!Y&F#0O(5AI7p``e9>o&CQF9l`ph4hi6wl|lYg$YV_Oi6Um)_HMLmSteQ
zYY5zE(KDdDZ|!I~$N)c3$E#~#xI2Of0N>pBUnaj0jv<hJW6~~veZ!c4sJ67zN`=q8
z97utRQ^rcOO+cX&kaxZ&%Zx;(q5w|C6m?kh+GsSD*e&Kd^M2|Q*;qY$^IGNu?g9g_
z!x>&2m?%S9bD5KBj2%Mad}b9krPGcX&R@frf|Dl~2yx~`WMc$<;$sDE`7n}1#bs3*
z^CNVC*O9;J)rpTE;S6CO8wEom9HopCSBHqCl$~HUN00rZ#IE^=TB&Y?rCni=xYtq|
zUs<mKFsOi60Ouavocu9ej!a_M2~8Yz6fpty%HGYP+AMRy2-AgCx({u@k+TXUr3<H#
z*pci=UPu+8HkZqvX)!a10XNQ=WT)AxYs<GgoLC$Z@Poj$=@jWOw@L0*Muc|BJ|q5e
zX#{Sqb2e5?j^36-!7N=kn>NwYFBWikg%r$*cbsHQ!?V|Tj7<ZRpJ1qL3jg{~9A@h^
z;@HU_xj6kFUB!P63J0(MzPR<)R{p1-B@>p<009~ka~}djuBcrSD+1X05G#W%Gbnx8
zPGhAH=ydmm!FlWZpkvzZ_f5oqma9LF$<?&$1ikTWRVEGtO?dtVIHR{|HuL-AwplM!
zTWm&zE{UES^rk7vh$6Zwqd*cj7c}w@3><R>eY+@cRhFY+Fm+udu5q8N`&#u5)?=i%
zfm|=NID91cG3{?kI6aJ1P8KVfh(@P_#+-aDZ?<CIo|?L<QwvAnJU3)r(Va_{9uvuX
zFsE+y3swiTs=9!y<Ek5&kI`ezuixAGLvHF$4eVWZDjl1d@%)2zh)rtl{13}a3|fc%
zDID_U$oc1wL8{7jZJX2zgln8kdrX78#&&JtoE^>9*=y0o>+f~tG9Yv#v`yMGS{uE?
zv(eN5>{!l?5z=S@EI@kO1V>aL*9A8X=M=|>?8HBFn}~V#XasDpR(6MN%$GIfW!9-#
zxIO7;dB4d^ST!3FEA<A2gY$8-2zskc6XQchE)yt9ne`qa#mgT-n?6BlR2VFZIXaa&
znhcDlUrHHE-_s{`a=u3o{jB#bGg3M{p13rKO0ue!55ovU@qxu<`v}j5bF_I9i}n;v
zW;mSRre+_Ie+tVx`o_rl8$U^aasmE*bvrXCQEteys%Z5#kE!xUmNv6R_C{)-2hJCo
zVByM-cBr2iGV<OVcAY)z85tx|bi<1;;w<Vm^YHJ<DK%HRV&(WqS#?ZtQ#pJb#GAj{
zi&wN?fheUZNEKwK#N2rPmJ=%Edhm3~5iyAuAc_4MEHM3*;;W$RhabZFSMw?rOPW$s
zvag5wNNHH@BBlKLrAazOo%jRpIq<bS$~2G1@@_0~rtS!}`TL0_crH?*Q7sfv(|8(M
zVaiS+zL?Fq_UO)ET(%CjB8<c6ZwSfEFt_gPz1@7_wj}%%2;dkFUL^eOWb}KHdM{z`
z@Oiq*j;kuZM)I8(CCT!9>bv0L(A<)jo#lJJCe1ez(3iQUC!zX|%T!`>@kPrKzZS*5
z_?BkT9~oe$@R7oRGACJ-Kr-7_fgOv7(rz|p^jMw<rk*1bH7D^aM<PGYZKmz4Fp(rV
zM>KTFeX`NLqL%D{#%^7I!#|-CsoK@rV*k;Z@YhGD<?rHU;iuqWXYcgq_y6C>&PE8*
z*7-g9Q_z>olM8@x!AntegEfwkLlHrt2@7(-05PVIDRXgsCM*Ln_?&eopbkZJ(;y@M
zuB)!=uJQI|J*~4b@m@xL^V|w7MtpoYO22z5SfA*;+ju&BsLdtURYINjje^+v)e^Ww
zEGIxv{j_RYhXRahe5Ee4>XH2kw>}-;4P1%^Q7pwc?@-@Y(>$}nhT?~i*gnwI$PJcb
zJ*#j%OV`W{UaH;e5%h$y)82pjz6|@8S+kAtEPr47-8b!5u>S3bxA<G}RPupK>Svtj
zLI^(6D^WykTK_qiuSLBfs;?bm7)%9~N|joqpb#mgPcp*Mf@B4|9=+)1gg^58QV~%Z
zQ5fUT5!{Av!Dt~rpc)y7?L&7awerc0d>|O96Vr$OOmZc?9^b-sKrAvC=?U{UJqtC7
zgg}ZL2E=@T0fI5$F;E;ih!}&NOhKa9Mh;;Zn2UVEPNozIb7O%B48S0bVyjY!#JW*I
z`Xkd3>9JKQ^OXD$Av^;ok=%&rw0VjG32uB4l7aTf7)&x%eMy0jmxu!oktm2CX^a)x
zV%<0)SOcYz@|a}6wnPp&eMJKL8Y(ZuY9vQQM<ndXQ4BVE6|5!9GQ{~v!U5b!gMmMa
zwq8PCZAD^5VMWG|1>zpbjP#LSB>YllARSSSP9*A5dq5|$9J4^x4<7P4(hjo#=!XVr
zk37OGQ1gR=L`C9bnyUCAK}sXDFilnc;2@tOtC7A^b>&<V4LBlwr8bss%e)L2@Q&oi
z*i!JrhD=4CBDqp_eY)fuSV#Iv(UpG5HqeRmld>zT{&RiQrP#m|5<i9u&4$eVJBaN7
zYa}|Bn9Mx~ggWvgmYCeV00cWy4NFY+o(IAmIfEr8e=h<lL^PuaO1-2V5XbIOxkrXn
zM}EcZQN4$U<VLz;_5knEAZCc$v_T&)g9p$N#c7^nFTX~HQa=krMk5O`LX_?aA>xSQ
z^w0E=Uc_FC=d?@afv-q!z<X3kC}J<|bMj^2z#G<O(X0GD4CG^^IOeO$JqqM&q!ChU
zsxBy;Cv6D?14>XpP>fN)KCuK_fSncO6<TRGlf44Lv>@RWJ`n3kw?bChg+d4RNw=ae
z-DZ@R9{4F`E6a-?ys3Ccv6=404(?XGquk8$5(mF1W~Guz1W=qvf)LV^)5xSc@@~|@
zg9_;Mq7gR=;HOkF*#MrC7sZd1!S7BQK%=Q*DK~y#Yz1<e0IHJ@ifUA%pKox$T8iXS
z0YoP!u)Zk;l8@?OZp9fY(cBvnu%{xq+@l*97j%>=7I6~<Mo}PF44^!b1>vWgN(C^U
zd{H0=1`wVQoG5|a!8#yP@FK`jVL44TMJ)Qp1FQ)425EujLEIp{l<BnT)ai7#lsb0Z
zL2sBRyiEpO>?fRHmXkfH02>8z^!P^A>9HkYouaed&!a;>tPaNXtIE2l3W1>aBN52M
z^WNU7Oz2f#b2s!09CtE)b<Jn9e^pqpNt+%Lv8!X*&qt<br_B@wqMooU6HK-@*QYWq
z=m;68%YN2hQgk1Rml9%6g4a56GGRfgO0rW?qMy(EI&`X3Luqy~;?|7WOC6FNyB$yN
zw8y(h^lR-}+M;!CiRP<~_`=eJ0DtC;u)#&v>O4-<Q6_gBNUK@Y$d28JvQQz@E}y8p
zVMA?qql1YQVbK#k{gdmi5MB8m93lJ>K!ImQQLNke5F}7IJ?Zr$-`XWmd;|Va_^L}7
z28xWUd^I0jHtf;7RfAx46;!eX1(zVe!IrADKk8{W4nKJmkq*|$1BcjB9ZdQlh_LH^
z-p?*+<3}yE;XZOVI~>uRj*!to)e{KrFjB9AL<rKG&1H;_5^Xx{iFq-vS7L9;Or>kk
zBzrenmC__7(7%X9GJ~U>Ha_R1;0XuZswgik&^<r|iK%d9cL@FXpw;^4DTAeC3K7xe
zcPR0Ku|&wiM|a%SyWhyG*`e?HoH2vBcw%lCF@vj2ap%fU=A|DKW5u)zal_@!xz%=(
zeML$+FRXvXc`-q&_5Cl(-ZHArrrQz?!P&UGySqzpclY4#8Z-em?(XjHt{ZoE-M9qT
z0D=3Sulsh7bGq;O#{K)$7|*Xc*PK<WYOW+S?*!k1*_9KCJ*|pU1Ail^tDsG>*Z1(=
zZ^pO_IFb*;uZeJ5)8o#tTO)2gI{ZzXg)GZyxBJEhSFkLr+7b^b3#Uc(e1+N<RpicH
z$s1o$LLZjV{9}5#i|e9JxqKX;u97SHe?OU0)Dt^K?D5jQ|I~2nF~a$UZ5`Y1PyQTb
zkGf9Th?XhZvgvUV@_>ZqU(`!i>=b+Y_==rt>u)FH=0??Lc+u_c69meIZJZB_5f+yW
zy=6b=urII571~-xtBrN{5E<t+Fb^4%LE~{u9<xsPD>-tLd4Vyxa)XZWAgjT3cYdml
zBVSx-MEG!2Mj`_F2X9C@InOm<#0Bh9E3<nD1_BRIFiil|H*Tn_e0KW}>(T2C>*#Kn
z&rDi$4#WF4QVIE5<W*~rAv)`CN0bKIbeZU3n3Lv&Y#ZKE%^QYol7w>HvWkw<QKswm
z(ZMEZ^XBAfX@%(Nq#3Re$>yd@ol_CYw4QiJ)0Db*Y&-z7c4ZzrVZ%|b5C$_otEDmP
z6pURoXEj1=bv!#)*Lf^xn$2dR<k^ue7=|2tll+D8(XH>osqx>%U?ig54aKsVhRw#!
zEf{;VF%Aqmyn}RvjTl5}2Jk?)dPdkv&GZQ=?HlP~?ozJQL~R$h=6Z6S0U2enG-O9I
zwauK=W3u9i#CkhIGHSVl6ubK_*rSUX)Pa#LZ?Ru@7))n1;?)McODkq7lEUr%hMegV
z6c3ATH-?;LG2e8~#K|U^g|D9rWP<J*D@}hOheFT4>NJwtXewD0NNqJMIFwIR#Fl2m
z%tm4*E>P+_a-q$JuMF?6HxuN!7x!}Kg1rQOhas#N>jOw6&Zyf0>S|vlwx(0cYdzcJ
z&}oltJaT-Jvi3GHid718Ps-?tjs_-uQJV@@9B6b>o>qtnc6<(oRv@`GQf6q*30b)E
zJPsu_u+G`lEPipFE?L|yh=u#cJ4`sAnHp_%Sc{Xh5P)Qtqb#d_xGQmI%}D(rP5cw*
zU9fU5@Ef}48Q1xIJ4qka;ZnBWCOHC$KW1w*n;?}!LLkPG2cP4L8PJg6j#Bd7LqTem
zud=E{o4sOQqB4`FTjn=>B2~ha{KYR@Co(``chEMYZbsxc4|Zy48xM9S#LnzJN$-@&
ztmS3XFrA(Sh}Kkj#||H7eyw{(C_B^c+#j1E1{CA+hO0v*y23a`J6g2Zi%txbo?^!n
z)A0(Ej3L8YAFh;p%yHip*$wI3u<sDB$fzrivOQo)4k4LxQevsit8i{vbEJ4EFYE6#
zgY{{46aP|Ja*qOJ<jT&8>fE)cFVdS|f>aW7^feW_)!2`HDvH$)TBoEcNBrMpbt@$s
zBMGRol5j}&YZ}OZ>GKj*C4T2;{<}KfY;fW2nl^cdK(mOX#C_h8nBQew>?ZKTvoeb5
zc{`#u%EBP!{6es8ut19L%zIK{Rd&_Guv4y?l;9Uv-i?7Xy%voC{csb0)a0LOMcIBY
z83zM_9J!9B{nGZTR0bCZulddr3;V0-NhEKId-Qjg4run+Ccm(CJ;f3K7DxT=K%(b!
z%|>-vy&T1+P1`;<jRN`uo_Mo7vK|VSy<DCeOU_w4kw&3I>^qF6T#j1|w~mkt^OlQ#
zcR50-pPGcS^f_KFqJ`{N*`@4_qw04f;?+BR8p-sOCEvz2!FQ#Lco`VU@PNi(n~89a
z@%AvF!LCK*AahZ!FOoL~<`^Yq+02scBpx4qq;Am%SQ@W(auYgxY&+7tQAv0gbJ~3S
zh{$q<>JWipb0rS3BbiAjd%ToEf4kR?<l-M0xq_c5`J+X064et;svb{4nN0VBR2bbo
z*7MR9;3Lyo?X?Fu)Wq_IF*f<p+oV)YucwQe$3%yI*Vb$2TbpN)<#bdtzjI6B$(|X}
z;mdGw^MTypbAPFqd*LcV*nXi~#%y?fjpV4U)n+VWHA883H?sMvbzzS^Zk6>SRH|*)
zbI_YXIvf0^71`+bb3!ybYJ36lI9q2$XwNNH{m7();F4)*KYMVqkvk{F<cP4>sGSC@
z%nHM`+PaNzCdKJejCZxurnn6KCRJ<3@WwU%CH2~luUYK8BB4t>_GF<(ST!lpa8znR
z$f?=a4dDf+%wWNVoq5}XWUOO{E!|Coma<z6^nQsmd8|L%7=PkvfpLhCl2|eD$kS2E
zFKb^}rO*Y~X>w&RFWvG)A#3$|wSEr5zPYyevr)~s!Og7i275S_A|u6VIQ>>2+vqA2
zJK;w@E1eP8vrmxu(B3m??Qn4t=l6KqIB8)pi?x@#+Cl4WfzYTV4%8sO%1x29*L1@W
zJw_M@Ni7(D+P?@a_3?%P{CpiA$9{?R`UF;lCnQf3(PE;z7IF=t?~j`caW2V;B?PXA
zbKXo(toK5IjOI2W0{Z*@dP4+)c~+?OPexk&z2>#-T`1@Mrh0_#wF?PR>k~;nwz>>^
z4X-Tby}}=(doeV2iwZGPHIUAm77h~0jJ{hR>=(?lHCR6moi3FGzfhD6I+7%J`K?V=
z2#y%;UV8rRO=;VC<zohvd+x+KU9%d)X5$CGx$oXvy;FYbO|Ea=fpR<5BiJmu0$*q8
z508R<(@5k3-T+~KTy0f%fkf$NB-5;ay}IiEra@f?vCZ}*dN3ZKJPZ8|MN9VLQ5BS0
ze}G8hrFiy1m%crk9Cy6NK`CQdt$+LCdG?3=%r=ZDM!~5kJ!DJZDciP<M8IosmaX-1
z`S(LtsGqo|rlKtWj*8r*<;T-e2M5N})5}+{C@;oM|L{dvM%QZ@KeIdj`ZC7FqaGZ3
zeHP2BFt}Y+*S<yO)wMIPfKzbmR#g<D@6e2eg&Kq3C!c4(V;{!!9YV~u_;i!r#l783
zhsZADT|m%edlyq@nCj)uNbGJQ|L0X4=T%7=o5<|jnN3}z5Od~}z<#Mun&I`{Gh~VH
z`Lu?SorQXtQc9Yo=Vn&YVHM|@zxPVJ@tmlU(<1DYwh)-QU6*cIHsSqv0DIhtmD%a}
zN7$@@|IX39W8U+Nx%PhJ@QMFFqSY~QB9)irC;TPL(D4_np)eFmm)}ra;L?fNP5UIx
zo^0AbwrYwT`i=qn!i{i4`}Qhj?H2*o)+9{-eYGf0V-|g=$N<1-rI6d8S%<F2C~mdr
ztD!VBBohMcPMLcY0&Aq6hI14G(^h%8Bo<GVX)M4=%^_3sTNB=oZ!OD}k}djmktlm?
zRi4w8hj>_9#r(-I&$?wNoK>DB1Dc|1`BUX8Hs!^mNR>^+v|aKOuMT;sp^hgrCNy}M
zB0cSkX6ZeDG6s|b1I+g<-m@oWzXa6oTUF=vrr-CC3C4Cba^jZbYYt5VSKp1?1b;3R
zE_}C9)of~fg=o=E(Cc$}qDM;XABLQ+Z07QLpzm>LJN2*ISn1J)?s8Nk;we`u8F0C1
zYuVj#j3dwtlv>AM4rbeX_PK2}Hym_3vP6<!X{p?dt%YuP^YxvsL2%UXd#ugzy`-t$
z^(on9Y^#6V+EwzdYpJ}SDdBHRtvno}vTN(<|FP=iyHQ2XO0R;iQxn>mL-ev)8Eae>
zsSVv)v-<=A8>`=SS)&QT{5nBwhvJRpid8CaGY_-u@mRMj^F42&FmbOD$#z$DU}2A|
z(mPLe;8F1AyR7wk`ChK=tH=FJ68}(E#m7$Z#MaYiPlvxGNK(x^_<W`C#W01l>WV-k
zZn;ZIM!AoSt5x^W)$L&?|Mi_(eRoBH$SaoV$+Se-PBTrYHpe*N$>=;^h^4@IXVU}z
z?_Ch0%_WQSWkIR$5BdF`ZeUpXt!<(0wS#SX0rH7OV6#|Dbek)c6S1_UMolAqL1+0<
zWt^OA1ZJ9SmG}|@m-f+;pQeh7W}T86(mC`FdtGJ9xt)h#K0id{lI*v0^V4djU;az<
zr?pDK1?TR#6*D2X=ZxvqGY8zWVL_c=X0&hy@IBb7)zkVF&t2DwYeSgM>Ae*UVQ0%*
zZaO=OcQkqWwa=wqq_z=7%JuiGJQ(aXy-dDs$B=oT;4epSYXXq9p24^+5LT5jywXBH
zrOT&vDu{=$&dCfah)2|yDZD#;Ftw{_Tw;6>j8&Bnq|bHV#e~XKd&&jM)7%3e8->61
zl+sl4JeWV03XAoW#A#fg7A<#ms`Zq)o%?U+3op@B#XaDioB8*?YSgLboq3!C{F`1A
zd(NV2gp*IcbzR+IuNEP#6}~oL{N62;dst(huKW%5s9Z8svoH*GQh~&-R_n$QcG806
zsSstVT=mQwpG^FOZJOL7UT)I;C=!sqH9hzw6Oev%Nd3IaDSC2D{VWiWb|HBQ#Ff5u
zzHj=o&G3lS_2#4*@fxc=@LWmaR{tt`Sr(v%u{3L&`I@pit<{nqcKW3p(|Q>WBH&uo
z136@=L}lulwR%OIK$zJmNaT%XGR}2@m1MIpl!dTeG-j<>>MAnEwhx=@B`&EbFkA32
zE@|?U_s1y-&AoxgKdYDNwE?alqQ1*S(fBAOwsgO1w8XSMxZKsV3d(%od@7_1cvxc7
z^l_wLsB>XH00Kn$Ph?y^1>A4ijEL!MSb(T02rNLbrTs7{9#6X=e(Dz%Kt9M)&~8lO
zJCz%%T|>qgJ~wPrD_fEdg(bV4J_oQRCu3q`hY+M^TH4^rx~LnIF<?7gQ0<$MQC(t*
zZ70o<)smDk*x8mbxv@?-vN23Jv$3pEe`R*uaAg<!{nGNd$&&}5<C{*Q>zfIz?wKNA
z*|B7^BWVh0snea<m?a$E*d?6SvrKJ3W@TIXRhsA#AJK%&ty!&lP>;;ETzym;>QP={
zL1c+uJvhx)O)=%Vl0ZG)nO9*(WT94Fq?qXum}Ej^rd3b;y|LO%G1en{youNvq542k
z=mKi7-zVP2JjXgy2ZejIQHg!DL5Z6|w=DfYw=5Gw2ZfEMQHg`5L5YW^X@<3|p4e8&
zBF9FnVTQe|VTQY`X@<?Jeum4ck=Sy^RA?)ETF+$0B*$vTLI{*S%D<aE+u3i>?^E0n
z?@`bZ?vc=u?$OW@;t|o2>`~DX{YdM^cQJpAuwrp6x00?qt!Gnf8k1F}TQ$X19ov!G
zvSBc)XSPzmlG#!X?<RD?W=VA6>IP}Iur;P<<!Gvyk)^w6DP%XY1?mKCO=NPlH5^Y}
zR{wB=wHw$P*K@iubzt>s;?DHd$(rh^9?i5|IZyyx$hnbR+#Uz4U`)ZRU`&rh0*RJn
zEtB@l?|<%LHt9N7u9NFn5MyRr5~F835@TnZ5Tj+=5MyOq5MyLJ5aVQ<<)UWW<zi-A
z<)UXh<zgFr&qXt^&c!k?&&4pX&&4q?{h(}L>LzWU>ZWbq>ZWW5z3V!c{Lro6=q7KU
z=%#Pq=%#KT>1J+U=_YHR>88^$+d;49ast%yT*Iwo^ual@UL!biUc)=GUjrPuN#Itp
zP@vn=<Dl9y`w$#C0x`B6KbYGG{TSO9{m9!V{pi~_{ixeV-^HEl{us>Jf6!U8eWGt!
z^`dS$^<vty8pCsE)<I`Y^+BVgJ3(bl2SVvjwFSXWdj*9}JqLwN2SUfCf5H=UiNFza
zh#(O2h`{HviU4vs``~if`w()u^`U3e9fGWwXu)pS-(I?*F+awGuzSCgk^0SxCEQQ}
zM8SDXAt5aKq+kZ@NMM~F9Kg6~PU@u-7=D8UZ~!{#S=0DUiur;!vE@Rpbxuj&qo67L
zR)es5txQ<JZ`g7`5}i}p_c<{dur&4)_Q$fA6?m7?9qnUVOdC9k{e%`^YGMp7!|sF^
zX__;9K>-Mb<msQ%y_W%vK!LiaOz$8u5^x&!D?(r6obpQx@B<X6Pm2*?X7ck!1RDmS
zuZ30SB?mYFx@M99ezvemyodmfKqQQaSRd9V={GchL7<2}F4_AqNCsSo{e<Dz!YbE3
z4YH=D1-t<UK)7Ujyx+>1qOo8YqcN~`c~x+mS&eWTSw&^Ak<qdB(`ga)d3DxCK$Ip!
zAafIafO^O!qXJfIn{#;m5Qx(R7O)5$0U;K&IF~!K062gp*p~1Ddg)BR%}rvRod9mY
z9412Q-=<(^6Kwz%$e(cv<H`;UXTk%x2W~SlqCV9-7uS~ofgmGnY<ORN9md~gCK2^@
zz!FdZb}af+n{#vh6o?)C1;7UW21o&kV()_nuq#7U0kO{EKwFazAU;?H&;l~SMhAhh
zW6@&k>kW7p#MIjJfc#)u03FyGU<3ZZW(TohYr&z^$798|#AC!Z#p4iL7myM<6&Udj
zhy~w}0%AZB*qI@)`n+1a;~*E%IJOo-nGUZJ?=lD;B+i&kn{5fE1iJ%h09HD@lHTP&
zbsz^*HTq1WbEb1Ea1rRnm`#>#2UY-^V9%fvJA&;^fIzp9d&X=AK@jK%=nwV`4s*Tp
zuNxTv4g!u|yG;8SXc#n%&5Xv};9TKc0h|nx)@?WNZU!=hOfnkKMeFJ?RX01QusVWm
zO;Uh%A+bO^;4*eC#)^)P`h4L;rilZ<U>EV?{i60*IbNCvg!J*4Do$g=b82M8=in>R
zK~m7O#|ody$e_ETm#aMz!(>Z3HX8aiz3QV$RJc+9MEjwuh!UKMhFl>&NVGiVY|O<V
zC^wC)tm+23Up4_#*_wD~=na(^CG2YKEr0&&e$4W~9c~!jmoIaS|6MN!_y5+*5&xgf
z9BqJ~#!-rh)s<i`9y2Pl($AaFZ^WpfVNhfVVQ7?sm`GTI3_DX>l#odsgHt(z8h%_G
zw*JdJ)<_6kdMzm-Qpu0=dQ~k?4VPCddImKuoy*%Bj+>X~U)SAcrYL`f?AG<|Zn^c2
z{^@m_`OLod+wJ~w4ov&<9YPrGr}&M!$U9=dRajuC@e7#rJyHJ?R1^3(&<EW=`V|(e
zE%@&FB>?H#`GSXHkGFdg<MS%``D;Dm&dH3^j~7VCzsz4qK-Z8rXns@MpDH)7sjm_P
zWmBI?u%Ge+Bpvs7ULQk;vk>W!pVKvctbgpje87BS{OlY2bbY@6lEBjb7^tAc$~S(P
zjPmMDr62i?Ny4!s-CAKwL9m&?XI%e*O;zDt;j4la>%2d&8kiPXgmp|uSTv`?s|Dsm
z2u8TaidE+|0z(0z5oqYMi=7)mbO>ei*`>~%AUp&sdPWUid9XcD5+MpJm6lPHR~l>p
zv_LqaL!`^DbN&SaBH+*oYJ*LIM+j-Og34eu;3TFNZMBAXFX#wCo7SMhIRym3)S~NF
z0owxYFpY|xYe2TZ3(Q*Wc2Tet5Qm{#0!$4|qwiKQi2+R`^cCN@0`)PC3hK4MTEI<A
zN9}fTuoBP%p-#h^zFHes3s=>e&R%7$yk6Es1I!HU!WzNkW{75J#-hf&Qcc%LS39Lu
zc&i@{tAYC{PH9YJ(kezU`Q3`tHHFQA$#D=<fKP)L!=ptSeVVq`3@<wSxRP*~KdxwJ
zvw+i@l~vOo%qs6`3n<aENs2dX;Va0rb|bf}akbukZ8lrhL3X&>bZBYY7>5hup+cxY
zQ|4LKmxWRWDd@T2uO+n-MM>^^Hm*mLMNfs>vlETVC5EtNZx@ZHOK?h+9t}~O4=pHh
zV$12pXz9}mNG|9NAyX)jjM$guJhjgum#uRoy5F<vo~(7P^Y@w2aO*H>F)llW{iA;f
z0-lLS<C2*K0@jW-8MYHI*WmF=L}WS$9Tx`3T115Uoe68fb4D7DD0${GrmElJlEjYT
zBQ;Ubk<*s`(NcmY0+tx=1N%r>;}eROTN~&xoQaj^wnnGQx-*&S>mc?kQ#{xEnc`M<
z!pU>ErL{BjH9d?YqS58%QKBXXhvo)4DUt$Bt~jE3@Y_u#%BH*hXqBILOYCaD8~+3P
zK##LR7|tFpXey8t;LeMveCEw$bTWA1(GB6WbUV2Q9?Wv@#_KB_R6Qkofg$hiWU{Bq
zE+<;Ot@4gSp1r%%zqRA{gU!7IJMizsdcE8z5nY4oE^ZJ7fqMuk=iWR!;x!BLvCsSd
z{C*4^qT6q})Aw^lgCYY_{K7v`&Tlv`5v2FJgty8L0{q6pP%d7O{3ODh?x(VDDv?<d
zIJ>6~v8Z>0anME(;hT_mLq<J*9~yR*Lo2iXNR;I{8-jc(kBtL+@DrQ6hL7`P2+kA(
z>cqzcIQr-uEjJqI_8(;@w-mQuJ;Ojp$XRqIik4~%WV!o$=w5}loYODlTEQ8y^Z5*7
zlRanxOc@8IP}ow^QK57iuI7SBY@3uOHKJ;z^OiZa){qer2g$6>5>a=*yhiO?<>osg
zO9_R0cZ!dSE#fqia@=1+qzMjOW7X%Y7`sGgy3ZsAGY0dJqZI6x;CT{qlzc(t`ZhoK
zl^RNG7H_v;uCN8<rdCZyt%b0ll<ktttGaetI|#TfFqC;MOVxgtU^U?qJBhQ~4%<{<
zx3#|vPg^piunuyT{0>RsB=THLlabO_NPVVB)bIgioF|bMuj#ZcVk){oSj%lRM;udb
z+H{zynog2itRxAPwu_%LJ#CMM>QZ-r&8!d5cJj&aPi&7dh>H}zy7IQq)Xy)WZGBZm
zD8xenm<Nb$%5jH}@9_TE1&LDOcxJ^^XH{9R*~qZ|K7$$+Rc;v_G`G$EX2mn~8xyCt
zST<a)Lra&EFPr+{fGtTjiP1HK5zkR(bTC%p7ir5uh9J3fQa34j$`Cw{i?9p6i;p)P
za+o2x@tb7NQi246IesdgY9TVqEeGTJ4TJ58sqH`BBY?r{_mA=zyVSZs0N3~YHa5#u
zK=r&gZ|X6Bg_XXCXST_`1RZT+qpC1rCsEWAQngoue-VaaL?<V(ww4UvjXh0O?QScr
z`Kh?*cXY19k!Q)np<xSW9z_jsHg9DlYkEVs)zsHq3CxAp>u*%b(dV%F-dJL(J6PGs
zC2)+naLLxZl<RrNQn72{q85WkJ{o~NQ~cFY64%4$@}x1ZYv^=DiOYewz2PgOiP?gZ
z+uS|7cJlgpNaYK0!JEzb&9g}g6WzECe_~y-Xci+Au}_$zf`Fe$j^}e;MbvenYQk@>
zu7OA%eoXCZ;VSsQ+U&z2*;|Zht^sV@Zi7NF-3F-Id>Q(2-=}G+s;tAmHzoe{Ob}?Y
z4l6*;w)~^T?J@N;(Uw0Uh7gK`%66l(SoAlpy_8lVInInI3KYUGyol<VY@d$yS;Tfy
z4AS-_C0qGq)o~W$b5oCTE!jWe%c*SNc@u1vfbRZRB~+_Hvdc$|J~pE+RzKJhYAtIU
zem@ls*x@bV^W$O@MMfr)q147?NMa5C?q+K<_B=`M_H1>PjFez^nhe1VX*BU8sI=L$
zDYG&z(adN|$n|%%?4n?|KJ>{*v#3q`@x#&=;zyhuZ0X`>y7)sKBMIj2)smWD8z7K;
zGH=S&#|kcxe==|U&dKVJSL6FSqe%AA123vl94h#s6+M7c;KMI<QC^<6$1tQX`H02p
z4}<Q95SaK|KquN?h(~G+X<{aS<QrBlR3nP>lmWWEFcQ!Op6cvn^AgG)^L(n^(N)Be
zkr#?kY3$DxNJrCL;u~T}<4d=EpZ;B>0DJ%;5N&&JrMyA}g@TLSTLb6iY!{s?Xh$~A
z=Gxt@XfUcLUi%90dRIym0xt+@rkr(l{ziLhrt?Jv$Lfpa+%ug&$C<veG1~Mrg^|K;
z)kDhMGsCMGXK&cc@`J}*TUu{ekdasMmiX(}9IHj?P*@>Rr#XzXP_~Wx@80=UPG(`D
zf})e#+pOF?20I0hNO-y3eNJ*b-ZaEOHy<+G2QAOX82rwsC7i)%|Kyf9L;)_SLOj^-
zpzjBFZdJJ@<Cn0nJLK!Ny(Gx?5R)@og{O@A-*#B_=S<BE<`w}5&jUZUGEg79YkvcS
zT%G3LSYK#TeCf(X>rN(IulE#bj(_9NMp0XM@^bByzzDT{9B%%d&-8@D56AKnBWg%g
zY7fde3z5f5Rnn2R*QL=wt2zylGj$U%VQZ)oFd=T}$x)H8*QZgSXg#pk`hCzFmhuET
zB+e&Qx(uc3VRax;AY`3Wq*j^*w-ypuhEGiy(Grq#Gth8<Jh%i}3MQ?KlsHLn*X@oS
zHaX8&ab(R-oh*2T^jhc|B^+%w-U~El-wWkTKW~N}uSF1qDIQ^Tg()9laFvzaMN~qN
z1v)yE4{ok{6c%3$+0!G`4r=fo54h?;7jalXuMSw4PkA~gBoLPunHiw)>#$<u=YPq}
zM=fkN<*A7nkc|Hs6CY9&AEf164%M=dSIhl^y8#BYBPfBmG>V?~aoe$He_gl`Zv7l~
zrkDXDGlpf=qdN}7I5Ri~ZO(;kvVHa1XKn{zIP?4!?SU286ZZRZHTw64R2bpy7F96B
z(D_T=FX;+?q9N@))L!Jc1A#f<H7MzY?63YiZtjTkp6)va;YiZl0X~GZ!Jiw$RmxKj
zrjVjqteYS^0YWz_u!T0kd;cRu_wg%7_Z2_9leMU~JVQvHb;=FLrP>S76KZG0DA?G}
zso$xYWYFc3x4Wtb_S%M||82u~uWe%&?By7OvMu~FBt$Iip&TO8S=MiLCH7L)h5I43
z)&n6jp>><pr0GXwaelEUgwO=&9d2=j_Ghm6V=%=*$CcMxvaPZNsouq_993fCE*`;I
z?wY1%wntA3{4zgV@en9l;hnhehJYR4NEKd>$fXnEST4q*QIu!z!{ODm=Q6iOU5%M#
zBnabnYMZ_ZDXAwZ%9GslfD1K_V2j208~8(?|0lu>$!kd@tUOj88I@bXN5@>fKyvuf
zd$b08OK1u`Rs}R(g_<o=>O}q$5+Dv#NSr<&*o9{MAdtq~_EB)Q{jM+QP1~0hcoZCF
z>2dEgzE{Au{Vw2igPKC|%2ZPDi*{>Zl`s~HB{o!WD){Tf+xpPSz7B2KyK#i*+P8Q1
zsjy3T?9A{{m#@tx5IGSM&ak(>F6@Fq>U;3n2-4wwKNrDRj3Fdo`xh$g0T;$!arKzO
zMH~-&sRaP>@&iA_eX;DwsCrx+^(sOJXL!li(GHoe`+@24QvXDr14$jNDm*N%7RRE-
z(iO98WAzKJ)YYZe=zl&<=;*3vop5QPJ>ub@YD!_L_PLPF|7^%Sg)>7^-EI#*l`&(Q
zSC!(LpC92b{4wHFXcmnmfn-K8-!L*PG0VnGhR?~3HqFCK#Xr*?ed=8ldJ1L6G5_^I
zUV;Wc4I{_go{WFJJ?Ip(DD_msjA7npgu8Gt=8{WDB{ePW))LmYDXFKz%&FGgN#V&d
z*jt@tCuBG)+}kXI2Weli$a|4;M`Ae3aDUoy0d+z@eIC^eX}X$h2A^Jc@K3c#hxHmA
zzE*fB|9rg~XEiz!PIxH&ymNuI4io+goKfpu3TpQgoRJ-Lo$Y{K&R&brjU0jz-M}PT
zH#dTj&A^4}K$YZ8B~G^<G>iO=sj*df9S0Q*5ItBo=*_+;#yVkMsaa=^g{_uckG^~g
zP2(6}8-t0XmW*E+6+u?;n7}uJIo^9}R-X^9#tyIM0=MP@uV#W{zS9I%j|V}I0lG#r
zXeAB01^`uqELtTu*C{)v$7H?DXzedK_gb0n5tZ*zmH)^kdciGv;VF87EPA0NdciC@
ziQQ~3%0OnV3D7gfX}-d4zCvqW0qDt!UKoj92#YfO^9vShAyVsQfF25h-WycS-=G!o
zpj0Yrmw)^}CpI1mhS2H@%=|EVhHJz)dc@!l^j{_Dzbt}$fVXh-az#m}e?}k*C*j{V
zy0J!zFn>Xhm<iRRDt8efoYsBq=k)2u1pB35Y``CFywxkc32i^XIgS6lPx}1VC<6lI
z$22IEFJD0T|86I(VPa}(VgA4GCI7E9O$`Tib!l87`L8@3_H0meM<t0;OJ9KB<SQa|
z$RuN6ih**MZ;Drmj0R7Zt~{p?Re8VrY^23UXWU;qL?&+6vq;hRqcg^@?pv*9-L9@a
zKF^Q(z8r%`*@EZ@iqc~#f|VVnzONwa61b)FG|Wc7b;LmXnV7J}vbZdRxCjUr*$jB@
z6Y09p1{*V+Ms73_+Z6n$LNz%~?EPZ6IJR1yM?pe>XFMNwNf-<_#BoroIwOMDqN=HM
zr$s>;t*<zJg%dlX<xD9J3A=<_F9YrjRxvukV{l=)YKAl#v9)xR!LX_Yn7x<-D0DLS
zBN2&MUUMc=yuiIR!;r%h&eG}6qn_+mD$MtK|2|#FZ~8SAi6^ijjm+-DUQC$0BMmdR
zY|OZJ!3PlBOn!s6Os%}Fw>iKtLV=gu1GIp>7c>#wmy83P_lbDcdfm8m^EUUG?@aF_
z;QTSxrChxl`B^M3m{c(Bz!B=2#i?8g-^55{vAWIOB3)9g$~I-#P%h9P83mRQfq>G(
z*AC+zk#zb_E<$g{E$ACmS-KGIRYantOpp9f5Mr}Rs9qsaHdsvk-QG~XZh5@5k0trt
za7heIk)aYmR9n3u7YbJ2z1V?2Rg+IcrrXGV+C(RI!E!X}*q05@p|O{<m%og_azIuO
zXq>BM0zcLA|I#sFm5#&*i=~X&TH-NV%`l&ZqZe@pbt!$jL+M^_i>MaRq(7x#=KIV)
zXIPlM!Sfj${h<&<Tvp!vIpt$ZyYzsWb9}-lS%zgAo_4{G+9JNFHdL4Olx49n>xgdA
zqn?!63u(w*riT^DJUQjtvcVq>1|_EUvU{}$6B{Oyj`GU}1fec|G|ZfE5NQ&f_Gb)K
z;?JssAze~Ah$^oP>xebt3t=6TV_$G}$W0vSdwdNaNXifgY0OK;dC+`qU!m8Q&^kXt
zIxubUeXU`%th>V_wEQ8_+!x<Rm)z=4!Z}e59W%_3+&^P-V@mCEB+QV8K7;**UU7Ur
zAp+e)P!j!-vhB1e$K;;+T#`nJ@=bVs?5A-L1d&3x(%<8wVM6g=!uRlTg~0-1(Z2|N
z&KihBbBQnCyd%Hnn&jvhBlz}3GjK|u)#Mf<oM)}XlD_x+YZSLXH!?^O@*mRu+l-h0
zO3D90$P_I*Hw;bOfL6su2Oaw}pqll!D;v5cSGstkcrAp1oq9xQ3Fj=r1)#fnV^(WW
zemEQ)Jsh01DsIL=9j^**hN{*3aWu#4c3r?yUcRsuk3$l7&iu^7Z@%jvEVFOj*L-{;
zpMSTXzntHekQ~ANnGY`&Tgul(W`bTj9-UmPEnG&ya!`AbgYd-6H&pVPFi9f>(R;qB
zhQu3m)AzVzE*O_3dsLi06~X!zo0mP@XJS5Au3e0ZJ;;s+h#>Fflhhr=lQ`|wCle(M
zW-XNK&bZqwu~?yDss6!o<)sfxkA#2@(7(RMnJ3%EM4%UlJsW(r&fzjmZ|L0i&8Z=F
z<f5m|FKm%-vsOPZUoNqyFruN#c}2zYQw+6PV?w}&<#_VFr1Za3B*ZCoQKKZNdZxQ+
zrYelqS~5v5WZ+t3NsPuUE1qLzN@(ub7o>y17zAZhrPdE7gq+PhMXKumO2wp612t}9
zBqR?D`e0O;OEeQKDF4B{6Q;n&c;bhb5hp^#8s#LEHW(yTK!TsEs1q^Sj1a{V$5$e)
z$T!8tFNT#L#9v~MXy=u~-6=*RsOMUfvB4b)4^{0h`M!e~%2_?kk3{1lH@NBQiElM#
zJ9T~~LQUQp>BZR{)r7w@$cJ=&&>fU`W>a0R{iT$cTQR{t>LQhjG2#po3CCG=m<owx
zzcG>lUl=q>FFfyzwaV!id4bQp7aE%NqA<vmJ?~6l?$80rQOhx1kB3#XP1p5iZAWe)
zRYO#S#%4|cpXd&oXZP~e4F5{5X#cDp^AOg;kim*cVA7`1c1BNBx4zSizP@S#W`d(|
zif=VmIZlQWQOG~Z*B(+xN#|$)Q9W&G<UE*BgOzarOA0+$99}&=ME}_KoWj#^GbGvM
zeU#lD+dL1bAk@k3kTac?eN4|(GO-1*eXc+WOlmknm7qNjA51e4Xs(%n{!uD3kgc_i
zjzn<OVWPl9PoAyF8h=DJt*aE|@56bXU3N~0-9ekseS}gH?k<m9{D~%T!QNv+IC>vm
z>hQC&aIoGUT;IW-KHP~*9ocD5waVS(<bamc3N7xlfNrAOb!QMA(zG!Oq(RBA&q*4x
zW2#~zDq!?vw75~jPbG^qy%Ji=RX}_?<*oyj>SjzitL3C<c&o(0pGmHyAj>KdC};ad
z!Zq4)rzIg5JJh;PH@oqFLTBuUEO?Go>_v?EfAza6k^i35R>w)Ju-oS<EP|UGAr*Q%
zS+!n&K(5Zv1+_$9s#O=B<csD}OUQUsXUrF<bpJA&g>@IFO(jio-O1lQ)R4QnW8zH<
z@lp8$p~P~U_b!)I<nQB{vXw)G7h$geZN(4d$Dh}92)X$;WUb4oFC2$E@PE!X68Z34
zJ;aO-8HKJIOOM$Q^1jIjo|N{nsFa=dt7D1`2#zp!1XIHoT<9m)5=pPe(W3CB=b8kJ
zF(}gaq~wm4<Boo<J?3+x*Lo6qKcU%BNj0WOn{BxHa<9Kc<xsBj2zNJPJbTMZ&s$3g
zsLD6tnox<6bJbQ}0UavR*aaUlNRB9}`{ZhAHzc(ALypwr?S2Okn=k}?gX_C#xMj$^
z6(FGxyvewwd19Rig|EFO$Y9=kt{$}GPpEx|i9^5ZJhQE3o!fI+EwQ1pY<R&-4e352
z&H(Wm`F*?F(hUx)SSdZb)qEWjmGMBQ5~x(W!W&f!BhtKLO7c@E*#)H`)}t6bm@q#T
zrN`x|_4;G)qoyWh;}e>g@^8$?IZAX;@J8Lj`v2^!g6Xl(R&a`*rq-{Z>ElDHq1x+!
zou%MO<2&2Rtor&~03$emT*>BbxLxVOi1K3#Kh{jrSg-Yttefnb;?-%`(Y;ZE`TUU)
zOD9z@{l+Z3Jc+RgNae>+-47S!$6S3-^c|oyf5(}SS8!A+TkLY!wCCJq7rEmu`<3Yz
z=f~S`1+U|XRw&91><;Ak%Vl*!=Hn(5UTNxCjA3ZTK}qfzsw+cFaf1S_L38tj*ls$a
zKc69pN+>^4w%udKjYrA1zN74#&+eFtI;z{<n~(i1rpw#iko|BAnW&X~)F=ij$zHQB
zXxm5o!tDtY9N0<ueCyNCCa`26fMX01b2z#FSEPDxJjD#tKVmZp__u;%;q5N!YGLx9
z9iYF)|9HphD7$Xn!-ST(V5@H{ilmaMb)jDYSFAw?E=i1}RZBZeWVH7@xI&75y{i%F
zpPg}k89Cv%$Vixv3%Fr9b#f7;foF%GpZeW#lIv@fD|oVVKf2rZ4zq_H5MF@7qhKI8
z(XW`q=#+8Vzscx0>P&Q9@0~X6%ecdH3vpGC%jJSYBE>e6758GlH3UViTa2_7WrFaG
z<Y!O*O9M0ShJSh=A_@-!Z_0Iv@Fe4e5&%PtuY-BIBq@N~PKP>cz8sr-lhR^-0+5Sa
zSU22kc})MN-1z8x!|_XIW0K)lZS-Yjhn$V#A6>g?vZ#)VN<c5d*A$%g<SBa{eXWU&
z6}pxZgPcs&WjZZe*(u4o{gWmCEJ)wXs;#|m^sGn6ge>*jpy~xl7AI1M`8a9xIxxOn
za%q{?V8fOey<xK-Ls^Q`ciDY6#->RebYoM=eTHf|!I4#T>=jB^9j^E^6`eHNeCz(y
zwf@L2l-yvM<URZw%8B2%(=K$I@`|&{mxmg<o5US2=n&1{uG!)xFENhCBQFnASe&U(
zXeayd5B*BE1kkbU8`e_Sz#z>C8iN~sKbl*iNWWth{Y*N%b}G^`L+w8{qvS!5zoKZ)
za>n#6rnzRhr2z&u?nQ+TWe}_v4)m)5h3|SI{E3XdpG6i+EOO!k)E&p!rM~eBZVJuT
z(8I4Oq;H&H%8*Q=3n@|RqTjxJow!4$$LZz3&ICsT4W1kHkjz0P`Zen43RvmDkZi;m
z-&qRQh*o9^y?pnLyA-2*yTQLE@r#HHq%Xf|oSFI3Z7#8>;@UP&@pvbgPRXHRr3WGo
z$90r;@lN0UfP~EEv5w>B7XF5R==%;gm(VMnd;doCpE+n*8+y@;HsHx|%~eVa`D6>;
zI^986R#)^k%Do%axaxL197}Bs2$<MzP0eF}{%Ju<S^T^pS>8e86LQF3dQ}hz^X73i
zsxW6Ozw&gKmZ6)M_+5m8ddu5qv!FD;8V3Q_t+c_l(KJkmzY~Vb-(PX^JBCNba{&S0
z`KuGT?lVrCO`+7->na(4YM8hLva^rpDfG}IYR((0j{mRI>z9^VyadCCm1P}&Hu3J}
zFsqn@Q)Xr!qEWFiR4ZGh<xq8lE7Mk&Eq`taoC~5is7}kMQM!{!Bq51s;*pbpkq&Xn
zR21jlE}kJ^0xFJpH~Rjv&;yA@Oq*C2=Duq<!|Yj~@UXIXXf6zf*(o`nbdnu$kGG71
zrOmMjh!<%9k8v?xzW}~fZt#drQtt)L4l{3*OtDwQ1j8zr>o|;6!7jv9`i8Da>Cc<W
z+uwinTLmc~V0Zqpq*MRilK$rk!T$eNh&MHKRl<*0Qouzil#!fj0waX_(v?kWAvQ1#
zo$J%a5|~6dY`7tmzF72t%@xVPwFvp3vVQ&3rnH0Ot;@L2%`@=h^$D_{b_LRUl!=H4
zcMeTjEW!LsaC?o3Oc)Ae03t&!LOuyaKs3GZ@hH*oHT|rR$kp5Jw+IvuL6Di`h*1B0
zLMS|vGMAv)&3K{nn>23FI^k}TIx^3ygh|q*%bg;e{FrR0^SiN?Y05xWD<Hdoih;3L
zWqo~5X=aNyp@hzf-=H=bP)b?DlDp0BHQkf^rmB-g*E`9SAy*ZyOSK|*Ht9J$e$Q91
zFlgnARAq0=VRt0oDo=IX!MFj9qz==`>afSppOU=7YW5x54JOx2X%GO3*KK~P@~0wE
zwkNGb{LdnmD!p^quVJKav6X&7Y+U?8HpnP0I&7}`kkyH|P*C9mH6kNLnaOZJ{R(2Y
zWG1VCfXyc^ByM!Hg$s=#yJ1=vru#;qi&@kOmH2hwmvIDbSNWI~zgBi}WujpX$;gFU
zVm{w2{e28CTU4L@NGayvOwl5}`_d*u!0a4+lCW74MZGQ>vzMo)Q=B20ynat!y}JC8
zLM@+|8jT#=q=h3EZfGpcD`5S0h;NZ?t!1bivvnAiKTkRxKyQO;$!^G*^Ez$HX+oLX
zQC)7l;ejD;_wGk38N#9y{F9cUMq;tquo;GI{iRpKB`SQuYfUuF2Z<3^Lpw%z7RILw
zmCTMumTe(LQW=@}Cl$*44fHww1L`9htY`R>T8YoQmG>T%Ba#;QhuDz7AFP;Nu)atL
z_MJAG%vJEEI1SyBdm+ADk82^f_B=X5;>KU;a9S`uyk<xxocc7qo~Cp8<(KI)4vz(m
zpD|L&1qYBj1ELVjigY%Oy&C~+TclSd#^Z_#mD{v!L@g&g{{ed8wdARWuV20t{oC}n
z{{nh(CkF=;M{`j#cN-_i{~5`lxv7sKjrpng)xME269&RgQ!UD&edwD_LgeyS7y^9e
z3B`W$NlUn>tnGFIz`&02>(;7pb6u~N2z)?`ao*;K>R%sfoJg|qv<$bbdx5l!q`;5A
zf0e(8zlcimB%0{KXb!Prj)dWA-J%JnE`>*G8K9V9=7l(mvzs9}PW)A`=q=gv#LY7i
z41vc=YR3?h%gsrg=vw&ghGnBLc?9S%FE*8;x73_6F=~9q+(I!C9ViU42*qwN^AQS0
zOqe2PiF8T3V6fyK9mYL#%xtA|WNRM1Na=BJwpkc=4Q;|(JZ=gIi0X=ZO{JphBvTm8
zJ-KQ<IR24ZAdtJh{QOYd%aZ69w@J=t#4RhEnN6o-@+CO6)!|A>uk*wu4t!3x#oudH
zP8iX-_fk7hrVz37Q98~AUkw&|u=d8$rhNQ1P#MZq&EQ=QmbbU|4pBtnZ^gvLZzScJ
zmXA`8P(|7tQ+1h`*YC`cXNFsCc3YT^g~8}T6tXBeqfE1(Wx*uWzOkR+&SqRMiG*Pp
zQ@|2j`A#-FH*C1-f;75wP)nMW?ra*uRoTC?m*3y7fuyW5w+C7z-D6l=tdA=+K;{%2
zhD0(3+u=!w4)Eaj4twGEj#66~1E__(q7{J(l;~{YZ4S~y-U$S~dpxGh&mmWl>1~5d
z3{u#LI2RKFXNUKlIW?S71vRmKqyv$%PI(J5u}(igB{QqZ39njgPzR0rRy!K3ArhM3
zhR3tr`3#$iC)egx2J+(p<80Yc&z9$J60lgEiu<wRFpSfvPkwkb6=N2H+cy%tCt1W^
z6(a8A7Ivqn_&`}13|KLvshO8Ex1I|Ocf0)y40h?^a*ar`4LI<jKmQF>nH`$DA3_6#
z`o*qb1_FQo<NI1fYc48=oTzImle!IRyx)#bLB9nqQ|{P|Y{>m69LC2Jx7QEPVJ>K|
zBj2|691MXYVbuzL0s^(fx5Ru)t}lvZlSO1kJDF`vyA**4)41Sv*wN)1pbb@8hbZX4
zHamVEj?Llxr;M(kGKQ(aQi`9WT^i!(1gYNgkByl-^64eV*LlVWi9<IU`tYBAe>n|n
z(Y=7}UoLHpKgquOOT!7Lt$63HV2_b;N?*W+YyZ|oP<(*?xbltYm*-5G6XZ}S(3exO
zG$MWAfPpOpqc7>w1;(r_51}=SHw%eB{|02oNXdE2SHes*uHfrF;>M)T85PWGwzhuv
zU@0gHnW<zhOr6s#k>~yF8?WO^YNLAUM`MPP_m++f3TuBsOjyTXun_Z6Ix_~bN;$(2
zcmr35G#8A;X{h{AYV6Sr?eWsq=zZ4kL)WRL*2E302->HK!OXXdQ~mxU4Fj&;6P`B|
z9Jd&o!z{nq0?e?D8onBF5CpQq1~$;3sQ_Rqnc5Z5pe#DxUgP?e(nNkjxj-0*i(IM}
z`l$YKU;JD}|N8l_^aw1;_A0@D>X6cZ8wf=Gf7T)y8#i|+*B=s2UXK5%9%<;S|7%9F
zK0FevH6VN+E<E2x^{cmdhpv9SDYWHxXTKXVhd3&QEY@+le34KulAK@c2f+tTA`>pk
z>dDx5^(UK?>wi6)#;-+00=}jXq{i}INy<i_$?OGS9;B=6|B4M`O_n)7m6R)xr6Q)g
zHX~AJ#mdyOmKv<S6Pmx#7<3Co?y!10SVU}ikL69ZQPv^(t)@Hn<Bn-9mMIPQHQLk4
zHH|FMMLwv2$4S7nNQ(*1X_Q_gd6-^q)1x)ydHu1naER6P@VQ2OvN^Vx4jD)>?M`7X
zX(Cq&hK9uTo^c6DtI+9X@e7S$@YsB~&49u1->mr|*<f3B?q5TuUdcN8#nJVlz_@@9
ziG|O|B-acg3O|)M^){0thKCT(oKGvcGm<a1O=mIwKu7!7OXqOxKuED_UTN5M;<)v}
zzHF-DmtyEVcYs|hi{Z8WijZqiEZ+X=TBt^+*`i3Hf@SBPe4LawIJ)I|3YA-9Q>X?x
zRB4@)74ev*%%Cs4xUF*D-D0K0In@leojW@6Rm_r6d5meb4U!m*qO8(ZLvEPufneP4
zjc{p0BSbyb7b#VP%*X>pQoqu<LF&1s=Q}!L1gWy(29}#P<~VO4+krfH;ohe48P@&r
zaJD-7D59z=nx<Yc=Mf=kVw#Kt_S0D<xdjm+Tv_qgT34kj(`4alD1U24Y;`*^+UWQV
z{EZ3Gg%KIRd_@`cEUH`%#k-;80rog@`H^B$cT9ohd)tVAek#A@DQ3c6yQ;Kw6q#C>
zmb4Yod|)SWel7nC{IOnPS5Q$`Y_9QX4aLfm^4Eui@5Sz+SD#BGbF!?#ypy2s4CxkC
zI+k`XL$0(<9x|zMzcvUR7l^4BOqSJb?+Aa}Mv+CwV;8z?mvD%lA_vhZ^`%?E{r%S@
zm+@&x`u`Y#RR7;9G3Ea!`Zb;Zuh`dvM-tumTF4tjZmpl}oDh{9)$$XQffaK9WiQ&s
zm(gS+L{<sHe?eqF__H66mP43V_^pWWnN!l*j`->KkwDk3Bln-bC!@+=FxFO32YOH=
z$dFY3(N0_nHNm+XR5rSO{Lc9JjdIL5^M{5|He5A=w2hERS-dQ@TZv&r@vODBZm>(J
zvu9dfc=F^lk5<8$WTGh`)ggi^^h(E#wRaR%K>&JYE~Ul3SC{Ujz02-cZo%vrc(k^;
z^>?q`!st70v<1o(#Ug7Qa3HRoDOv-mk={eD)HD?W(PyN!Ba1mBcT^}eA+=NS=|&<Z
zqV+&yOVGH<{P9X^ES<5s2#3ery-3>DjXw80U0QAQE4C)%na&6Y5uM;_!boJSrcJGh
z(kP(1YV33^{whspDPfo)Q>!K?(FP}m2(0I+I!fJ&3zPX$qo3=%6<3GyH^7FQDK{YF
zeCQ^YE-GQ-A9=eqgc_Xw%MNAQcytj15$dVx#rj}TSGv{yZGk}3rqOhmjCYdt;R8oX
zQiyq>baJ@$Kvy{KJ0nF^rH0%-u8--h{XOF0L~^?!<{Q^P@K^JU^;WO^)+_eB>>r4X
zs4Ai?sY7KJcQT&Qoqml)qIy%U{NVHWIvj1dM}tUav~QtTh<WszDp6a;;RyM(lG1{h
z*tLrkq9*&mw_Tn@Gg+7&8+j6ojOmM{Bcg*jiLSUgox5$sJO^!r8&t16r(>dhu)!8x
zV%wbYXx{P_q%nG#iW1sGoSkMf7jKYexn{FA+N+ga?}{q$1B(Ia6#4VCdjFNhT@$T#
zGmR$*=+yhn)De6=JNHA@4eqj7i2`JaYSxr)?xtgT?>(A$v-VZEsf4xs=$8)wa_QT*
z)-+rpSUU&p0a9Irm@DKQ)dk1FK=OyGjL<ur|KPxmcIw~8e>l+o-*SNJ|Kxz1ySas{
ztJ8mpBX-bG{Es{#|D<oJLug`OMgO1<e;F@?8gdfG{Ca8%1qB7cLcrdy);_Quqed+F
z3R$ie=Tkqyp-HJxaWtG2IPh8c#0WtjuVLZy`Z$%vvn}-YcHNfu#i!x7G?eWZq|?ME
zh5!ReuP^WqGHu!eEnhGnWKTMyx8e4v9c7<e5w~uGdft9R2Pn!v*G4~0ntWp>PHrND
z{>OW2$7`@o>}_LGLoVXdFLW$x!pyoRs%$pkid7)}P03wbnr<1YHp4sC6Jc^2Y8~8j
zTR{@o7(`W=Mq{;y_a7Lmh7U`9fk9k!4#fpEBn`X>vQakS4X7lsE3jqwCSb2*=k8Dr
z*&WG5@lfMHTQ>38Nk$W}qcU5Zr8e?1@1si-@bhKPRez5*BSgUzJe*@4a3PK<zB)uY
zjFl#2YVS_~nL#HJs;3`Yr;K4tIZv6!9?%{0VISTg#t=s7kmE6DBq&;|n{6_fPO>!?
zx3y>(EP1kn8XL7H>WNGcCd_U)hq#jLUDewhOwz`(<($H?<eX1&GsiQIMMEp)XHCn=
z&)H<BotZsook9@k7!xwk_;ci;Ba-7(=)&m-^M_KCGO<@<Ej519mw97~2TykA)EldR
z#lQ%|4{z_a|7k6=mAy&h(cs;|e5blu!*}7>a;DRlBfsew&1<H&&J^iCrb{9~l$PlK
zx{}Iz<WE~SW4)44fup3>7Q&I!5)<sBiTWwXr5r+xXMvRRa8s^L8n`4=Tk_=WP}Mw;
zZ_jln_~0~Xv4K^hOY#RDzRK_is|N{jODb5}f_TR;2yert8b(NJ1xmzDD!c`C<JS!N
z0LhC%P+VmvY-<<-yAg{Erb<V0*z7&L)6%sHwqZ8Ru5jhu4Ne*?0&fy5O&E?dx5i)S
z1k-O~1({!ipqGfnKfa1B2<#|s-cf#9LuWWcco={7yhlbZF^@xe-Vi?yPnN^YS!~P=
z70T3mA~qshS7XfT5)vp3>#qQbR$@>XMRB4!@S@B@?0@2tKS1NdeEjP`Bj`_X&D%e0
zy7>RQxBG`pHje+5N|S0BqL@O{-$D_QLcWMXNTN}}%YE~^SAok9MnffsYtM*>2?fE=
zC?var7f|x$49`LID;fzZC8-2nA3=SEr<Y{ke#vUSKKbVe`(I!F>3BX8`02>_f+nUR
z4#|Ib)kvZ}S3&mw5OxmSm1tX=uB1}2?Nn^rwr$(Co$S~)E4H~~I~8lks2CMhpL4&y
zV|4eu<Me-cpNX~JIcEgJ50C1ODq-;iwL0ltcLYu+)vESVP#gHuQwsQdX6iY?*;Sfs
z0sOCwZZHf_^(|EtP3Gys8km^iGx)L}my4*P6C$}a@wTiGXw{>#q-_>jQ;pU?Ickp#
zU|mNdruJMl<tl1ph!drfjps2(YqAV58Ny#)<)+-Aux*AY^OA5xqAV9fig=85O!(gT
z$S+HibVy@NETdyk(}g$OC~O%4%Bnmz2_<eaI`}6}`6U=v`0`d7%s^(q8x7%K8V7O3
zNtk%vL9&2|$8d6wr1p{k&hapEE-g}1rgF}5q!YIgtoY3?-T;Ys?rAgxr0MD5hv=j@
z@y1`-I0u`4xq3OEa(P-~p1KAIjK;gLS@#$-zZoa|eSA``Bpr+xwT-<bYZ_bax7Hs#
z0kERn`{%1Z>1`FLP{R?G;XuqYYU9#y`C4d<XC*Xfnwi1~tb;DX1td?kSC@9Dzd(xY
zL2)%uJ~J_e!iVnYs|+=Y(p$_)>~bnydw;RoOW($*pL46(ohZkjlgu>kwE~>u8?8qE
zd6u0NF!k5hx)V^-^yCsP0+RvYwK-9;#&_=iPyrScHNq_17grU<=Htu5941JNr?6q?
z+a<9eCyGkwz<lUB2RCh4{S@tLS(e~+F<Q`16|=?eOFJsGOUc?NsZ}qujM}{cA%(1w
zUXZt7eF+#m0rQKJ@Eq_^k`YmcCQWGijqgWJbj$OKah_{gG14A$hyNb#M4te_=c49I
zm^50k41-0qhSfMh880~=Kb#|_YAvyonL_y(f<|riUbg@6Zwy}?=2(E>xJ7&npAsut
z=tXC1WEsvx`j88soxF{;)-uQN8sg&6X5VT4qEC0JP8UL)j7uDLy2%Rt{x6Q&yceEd
z{^IE9A2~w*503slgaPA+euVKy&}G^JJ0&rU6rbX|WK)9}GCC@vG!RAVd$JRRIDto`
znR9dZ>@U=YjinNGUENyyMjgkJM~HQVWShoXt@<{?S{>V7omLxrTU}q--JC4`=69Vt
zkT2`?=gwQ8W1s(B%22|WOi5)7iYJUOWASNwetMKs?dF|3;do&IlIeKrTVXjzXPDX!
z>P|VZ2ycf+9^X7Wm@13mJz?(|wEJkMwqbuMGh;pjHvI40`uX_3PX%Zrj^7p1L6HmT
z35$#%BmSry6fF+yfEaqo2SnaRg<Mx>29v@Psx!k$k_{l4{Vt*tRJp~D2ULuy=Y|qZ
z-Gzlv%HE*oYuv;Fey^PX6~jK&(hDZ;Y5*rUJzBkm2PZG#Az12c>zh8(BU3MBF9G7|
zhCjS8`aSm9G3r4G-yEx~Ms#TcLU+4v+Cn_lY6f)~^osZNF)qYP_bVsk15SXx3_bM+
zU*8QzB40x30_g?|ZjwR-X<uR>UaR4Vs@G!sf2@V|%f1IfzZKj)FrvKc4hEw8kxZM?
z%#z<AMx*1FDFwrdp6{24Xamq`H1@|(u&8q(I=NtIl%>lSOiDUWA;M)aXh?JCQO~b`
zhW26XR0^V#S=kR38n;0_NDW6JkJj8u78AQV+FE_jRHJtF$^l9%c$1y8%CVZYH4hv4
zK26aDGJX64;QAKR%863OI_{QTuRgPhLB0>}M6_<l7e<G=u35<zIJAZNK?ZL?0~&Nh
zl>=aNi0e`IOKIq#5Ww<gc<m|huv~``m^E^ZVm^u@j@M@MBCKE9GCwPgo8n{KH$wK`
zb?^|jGZuBIH}?w-y7|HYv4#4|DXJM^Z<i`9-~2}jS3L|=HySGi=Nr~<SW;T2%o+9l
zCBDxmKj`!f6Fo>~peWQ#H8gy9M$WQ^e8O>+z0QP*bW@mLeHJzfto9Evbw3h-9ao}|
zPA2HrNK@TH!f&T0-*HT9%>yhhhJmwFYh6jYNzmt${05|S1V^~G0;H(yqP_$<sHW|N
zQal&1BXaePlZ*?rDOZ~Z&yTnZod?=O7;1I<svSy0;!S?I1;jVT9S|8d9q?E*Y!W4~
zRm+tCZZ^ye7Y%RWB4b7dBQ|ZAi?0h2>P6ojYfEL3B)Z_2`c+NhmaO>X=PR=*Y}leH
zScaQ&-Mwd&zR&-FLRiSJSwQDeF2Su@v7(V*Iwi}lTY%60u|QX~RGGhpJ5$cRHKMkr
z5!jCs>tv07XT_F*JG?Z3J5%x-Hm`UAT&HsW2X3B3Ovl_hdzOG=Dptbb+|SCSY&IPc
zS#~|~R#^HaEAG058*M*@k|pv%47FKt1(8;J(JDz;cH3o<+F1+M?sfcoD8E(WmU$(-
z+w2GwyJai#+GO)q3EN7QB96FKnU*Q%A0iiQHWi2pELa`5eNl|mEe0hBTk7YftZW-n
z`mpY{EzuC1i0Ax`4I;Xwkh(Z?+`cneI4Vhm;cd}RS!b??x3{^(%g3Cv_#!E;YE7e=
z5!KEJC1FTGlqR8VJ>=+cFE*h?R`z67Im!%A+PL-=%@{nAC9cvxt)RRy?yO%jx5Au%
zS9~qvS%J$U)pHWPZa2rpX-PpkFaM<;V;0!k^kDtM*H@TSfL(=kk9O~I<m{M01spC7
zlGL8;r(ZthgN^d<ryDe@t{L@wZp?Qy({3tn$P8zLg)6m@pgESifgwz&SY@lRVXm~P
z6<K9TAttN*ja#R7>K7*mfYum8u>gd_!|Jv-wh3ZJQ|Omo!IZ5J!j!o0lkLKuo8hYy
zc@nx<hSoUrqE(%r-^U#*2jJ9qea*P_wlL7m2~+lB+Yl`SE=b4Y*iyw?G{$bxmlGcE
ztlFblaI=OlU~J<twS~zU@&sYCVh$A*?t4+Kc$b`^4CC1f&bl4cP&S>+Kw@o8fmTu3
zE-Wmm_MU&GoobAd8z?9|>&jP6#-2N^$8}BROcVbulO2(@wCt4mp?<U(bia?u4qT>_
z1hzxDmv<c}ta)z|QErT?Rw^dAg~<(_YYy8mx{j5;Envpt_O6l>*W{p-$Tv;AB^|s8
zDd%l-SPNHJ->mNsnFhYG=q6_W)PU3LO+w)HxMc%*AZdM<-6f$5s$C%UC-CW@&eEVr
zL2F}xk6~eL+GdYCTuv}^uIzfU8`jlMyAUvh3nk4Ka9z4+lCiryF6J;h<4U~yy^7<z
z<iU=k+aAX<oGv}{$12Ys`7%ayA!r(}ocC*^l;LXb*~XN>TPGPY^~BmTK~)OgAv|p-
z;B3Ev_$QuXA49wm_ilAL{s$k%%!;SDC<iSFFDnV)ZhhGPMKNe$#%GwzJ$S2F?!pIj
zR8e|6{fBn0oNn2JqP_&+s(ygIrE}42G-wgRnwhMwD07(FQ2g<uiLKg|O|`f@*B8Yz
zO?BVZtb5!mkL;wFzn+2j$7BYSvBI`9-JM%7Gn*+y?53+DPx{VUk1z2u(KUqm#fIz8
zuAuhUN1>=URqQi31Z0aNYt_$gJBb30(GcZ)NIrD#q2;Nyn)-;LV;KxwUwFq)sVvB|
z0s``0=D=YlPq-?Xln+IqqaTaRlYj8cmb>@2-=3;j8Xf_qTB<=M+UhbAIf=U!r|FFj
z$8jWavs>K~DFe*?WRw^unrTkW0`+>+g>r$iDrWxg&6ZKFr+}{#4V)X6{>U3lX@SSt
zUnK4W`|d?QZyBLu3=Wk(35=Ed2z65(H86YEir(LV#TneMe$K6@N0^3S`>=Ww7a3r%
zh1lWK9|QalE}F4`k^y~W$)cPCDi=-kv7+(rDSqDIWG=PHcn>7e3mhPfb7~h-u^YBI
zKgQ9wqYdOyG9}^~AOsD8&d7$T@1Z#~=m2|85j0henz@%=!BrKWKFYk{U2xc==z%rL
z98Q|wfy7RND<Pji<^<h}hyz@PC?^<@rqkGlk=td7#o_PC$|4xbBu8?;7|Egx_9=2j
zb-F(JK<xwCBByxqhto2_(VQzq_^1trMrX$0(i!~{VcTP4GeO~Lz|MKG=1u<|R2F5-
z?Rn@{_XJyK##$#1S2rZH6|3%rZSMtsaf5H$7XsE3&hJ(5Cfz}!?L9q8_4##@jNXzH
zW?F%=LgyexX%d0bkKNo02KEKX%5-P~V+3Y;;&M|MonT}_j_=3@-1Ue!I6_$Nj4Q}{
zD05Dpx6DKs9Ig|!g2G7$Jm#qxB%M2_mwOqO51A2OjVhsr1F8aqDwy!eThh%~;MW>M
zB<cARpxc|HV>FM*HWOJ|;SV3g3#V@S+FUx#MVm5{7DkIQMw|YKqoh?-mja(Eg@B<m
zbX;1(gX2G9g+nwJ7k34xUkS&U8M3-^UP9KOXqZ$ru$<7?Y+4!8GM(6<%d(kR-DqkZ
z(z2Y`(59Fz(<8__I-sc`8g3aa1|UovxNVGRkB@MNvDSos$ME^$j4z{ZMOo$Do1Jv;
z{we;4zHVONSZ@xaE121h^kRFsqcfb@g;w)|!wux|;sgc6K6Le^)cnP;+85dReBiJ(
zwsURy2gxN2$_e`oha2jK1kr`<6Jbm!aWrt+Qgim)_?g)5@Z7`M0&2b&Nw%Xa$0wq(
zbFA(p9Z)N}*J~F8n#NzywqAG=rkiHR2d@8~Ne;Q9<BI%t!UOIP%^R^7H^d50bdSL8
z!W%iCBUCVR3ul=zBOSUqb90<`lj{p%>IC6>L$!Lq?B$$Vv5MxGoqr(19~XH8uZi8`
z*kluEe~wM(KC9@Cm|8P95<^K)1Ekq(_DjweCC?v&=ov_MEY-WR^hR0ACo_Xfm#6Oe
zc6D&)oG$^Mdyfj;K^+_r<9#_J>~&~2Lv2(Efd*ZMxY02xGWFdK$B89$>>#9|laExR
z{H8f}4x<1|z>?9G++e?5lNqu8cG)|R`2o_lKaQejh~v6x#aC<Qz66cv2I3W2_ZH>)
zJ;zQEkc4HvF+Q#}W*86cy2=#CY;WF`^P}MG%LTUFGgBVe+b&(s`@i0y7;ou}8~#4U
zhV}njqx*NoFJWzNXZHX2#Z`6xK7{p|o?eciEYs-&hK{`H0z*}}r6#1*pocCoIyTQ>
zPE3|*7kpds!syn(#RDoq`lK3bwuWQ1Cz7MEoIB#R?00Q?JGo9U{4&}|APVl!qq9IX
z#1C)fRY)59Nd>v`s>Gebqat;I4Q#lJ8)kxK1u$daB^)Hhk7X*Es0^h>SR=5)qj-OR
z4`z-?pGFkSpbgpV)K8jn<(3`f-iQ7jTSTvoCf{ob&DhC3JD-b!xJ!k9?d&+V(VR9m
zDYMU`yS3@rYnpF*DsO>Ut2)&(TRNfGNjek$rK#qjFthIpvxm+QrAkP5#iN8K>zsjC
zd-E|o#qi{AV8%L=eLkA|>(!~!Mo+M%*X%rworSK#&Q?0%J{BBs);S^g5yva|+t(Pa
z#hb+e77ex@mK)q^$ko)_Q6b0+2zlH!r4=oiq4Hq*9`+l=d$t-HpRXWzBPI=kNMG5u
zqqi-~D8rPsE#5=ziFtibXq<i7UsN75>fty(lcBUy#u>ir&Iui)0?v$?x>P^RO4*zv
z#LBzeA4zLd(0<K3VoR?^sIu4HHBd2AM9=jd49#Qg&C36Y{eHZGp&H`8oWNwY9LlnS
zQnek)l7mTKpeSD%Dt3jpHIb|VV1fU{(yc;Gb0DWoXM`^Bt*Fu)r=Op_Dudt8)`dvw
z&QBC}L<oUyTa8A!LNi}yn|<;@x7vw&^B5E?%t<TcmEH~>0i7c++S?b_qv;>^it7-q
zPnJ|f_63(Q{_O>**`mNH!pJ1^hVq<xnS)+{^E!iTfC~!%-B1FF7#1?4(2LS~7D!BX
zi&6-<Vytxjz?Ot`JBP!mBa`1-jNog?xKcMqaUEeUxXe_4jUy`%8e@~2-h*y_iSj;J
zA$a&1YM?W;{Nc~1-m7c?K6sDxx7fp77P~9|YHyqVvAz9oV*lU97kAYQm4AsH+}bpC
z5gbE!Ib<VU7L2h3Q<>^WhXFAbUQo2Tjh6Y03=g?rRC9iig_Knw2<ga+Lru9V@2vAk
zukT~_*E5k}KUgNP8ar9);&iYf0)@cSSy2+=Ic<D6QCwlDGM*};1Y6aIFJdz@ilqL*
z3|*Cms}=-CNOLPSWQw4O!(%T0LYe}<eMInSzyRx@+YPL8(JoA21){j57f~+VvA<;(
z^`7eF7FE;X_o4J`p6tYTI;x5Z?v3dZKKnZ`!&^)`&WN%)5>D_59>!1C--41^fE2H7
zcwQKNRBFa^Wz1+*$rP!%fU8&Fk2+UvS9*jw_);aN`4|E7878tJ;<huj`;qLkEQ|?$
zggJ!igK!ydYa_&aTmU4dl8Kc5p`&bq&Kwl5tz&F}1roE-%m|0}uneJwri4C^y&<A0
z!u>1W8e2ozv4>#@AIr=aNYfGL4$T&Ml0nN;$1<Z?mJ5}ci>~Eh<4S4m@8R2G?I1!Y
zNxwY<DIKyBvva{7)E~<ceBxr6dZp&(fGP?d){l+fJ5&l|0QIl?uGdP$(H&qI&-qAL
z4goO~Q~HX?a_$7vK6$(?3%3+Kg5$Jix+3xdLqGs}-B6-cEvdn`)>xTmzCs3F+j?OA
z$0q_nxcaY3Z>RSUxH!}=FH@+1I0NBi10;J2Ld}eb8jjZrr#z1pMU8Afj0M*c!vU8H
ztGCi7=TI|BYoq+bFOWIEB_HlcN;&6{*YWHNKhOy-OcC5hp#)5hSzB1eo)u7JPZ9Jc
z@`CaPzSBBCw)@I=>XYF{an8$=BaksfJQal=g2Sgm-=OM`ns>QZvprZq2SB$=wJ#0+
z+KUEPaF-72FZf%_PLPJHk$-8K^B=X0@t<1$_W=U?zrr?hfC`QE5KJm~2%`~75dtHI
z83cW?k{E0mRqgl6>9D7o!DNqY^m)bC6t_|?77)@+ci@;aBejaobmVsLw*M2y+|_pd
z-#^CKLv0}p5M~e5PQ-g77+a{thEba$@X*XuVoJi$RSgkg*cwbB%3yH5&QPYXqt2S6
zVc<j*=5o|GrYd3AaJNDdVxuh(^&?2N?L2elWNss#t^QX`c7&%A96hPU;~`OEWNZo-
z5e_p_r!X7R`^jY|K<R3!tRL^b4yQ!k%&0mUd-2DtdLpuVoL<E(?L#rt_LP!@<XMau
zOMb#wF;9UboDXv8x+TR_L+pI1^WM%_@Y@}eOretS3CvSWkyJx``Al?sKVroru+y>A
zQ7pBD^&~=!G3K!IP30w$iNmp2R&h9PR6^>@LqC~e5(i8o24fa-EwZ=J5$p{Td1f2J
zHR0=TBR*RwXo{rK>Xy_+mF9~t%kO=|dj=7z<4;em!=j!v%368VY@swdC`KCCirckP
zRBlxOlDSotWW-JmjQgHkwRPietXT}luG}Z3rSve{fB4O92EO<7mP3XRSA^$E9ObE1
zoi1AEZ!iGZY^-JH&=x&0V{tI&0F(J48f@Nj?|zaEgaiPTB#Me1*E0U0Qe(JLh|c_)
z&aUREC5RLxyAA5&dfa948Nc>o43dg&4c@abSaJ~sb;r}xm}Os)M+RY$9t-Hp>iHUT
zmZ^79Jx+Ru0u9HT%Z?WTXQDdTO=Kcr3;U2+C4cwIdmIR{AcG)=D6ohQiZ=3v2Lnp)
zP>ueDFPvv{=gee}5Op)AZ1{t<Rl9ovz%qbCja6qcKMlF}N)bycDVsVQ8nbc0*bz&1
ze{ndzybVq*9_5YwBBDJl<qcd3Ke3DC<SDXGN9-)4hb=$Z$-In9&<3s;T*$*$;s=qk
z6=WdxD1-#F{3>6sh3!M8eF|laHu|Xx5lOJ3Tc>{5mx-JX$*wp$qTIRb%KpD$$$oGA
zbN&}B+W&Yg;NOPF{~U^QSJhQS6UOErs#QvF0syE;NJOZu#Cw9i!(zb0%BU=31BVvl
zuVl6lJc3DxDRAT3t>hjCDbWnQm?*M^q{;U615$6NQ`ZU`XMP|1Wn?)XPhYOq6Xks2
zaqa|PvAP)=HYURT;0mD-1URcTT8zZ27ZTD>+N;x5%H<SLl*)Cp5D4Hu@0SW?Wwfx)
zkR6|fP5Xe-NgX$D!ybIHE}988FR&_MKJ)Cl$(2y0$I65rE3d{cT%Rk-c#Y*Nuy5za
zN1Qb+SXda8i12$YXLOBi2jQl?&%E|+U7V#*dZPrh^Ic6{)-=#;Jv_LJD4GTn(PYb5
z+fuMo3|I)Bi<X2C6mZtUw*l_X<-d}ea>clkTl8p;rGG{)LC)^g&~RH8;_*Yy(k{ga
ze8ob)(7Y^W$(T1c`VtCBf?bNs>$$i^{RPZ)*trx>TANQtqVU&lD8g{9b{i)2rJhis
zv2G;yoI-d>{uD^A)Uwo6Fttvjn5)w6DsZ@1MK2<sC!Zny1~LStcHcw75Q>!){79NM
zWf}_J;iqczU7Zof0F3EbhyTxX2Ma1%r81jOF|9;xH$GatG-_#b@0hekH<~L6_f#9o
zD=`*vucY^p*lPYXNKzl(@XI*ud_~KJaZcO2->^$+KP5E8mW`0iw`Etw48`Azp4g-2
zc>sOYHkT#zAZV|a*0q9qEPB6_qgV&~!WRW!MDhzN0+7}!kxuyO_+Wd4i#SfT7O1JT
zy7E2Kk{kQC&~L1|Tb1W8A!0}i5_-fG(NM$aw^3Ro4yaRNax<Kv7P^S)wAc(@!5D6~
zjuU#Tol1kIbq2mE$Ema5U=0eLcB*v>ys@<kHM9fjWUb79I{YGu8S?`EVdWd)-FWtj
zSM&;=^9rx`igWY|Md%r!XcoK;rdhGBMcVs5hFa$iZCu9ct1kK{;9n2>2yxl&y?+Dn
zkJ;kC0Pt_eulmK`GXa0}!R?xQ<*lel=*xtZzpj<9z806YmZ>ewn*_7iW9TQtbs~E>
zKQoNz>?ZsvBElz-tcZ_iU8FvXoqbus`9pP^i$K1woVlNS&wK4V*O?Re=k4C{3*+7<
zMEt%u9zT~oh`eX|Fbx97!2B*d4lLLBtR_x4*VIcO{-?GpaePb--<%Ouuq<|))A}e_
zZafI#*s;l+EWSOnpFlGHH<fPPuyfiVc8cdg$LORp9$KcE3qNE{y>4cc(-M$ASVDDK
zcuqRFd@D?c*)+bo+|5`ai`9&`THk&ahRw1K&$k|K8Oi$_dE%tCralaoWvbx*bgEP{
z<Mqp=90LZvXeDh*j%Rvanw^twx2tw*ja~|YNrEwEiP}>K)~mO>wyW3ustzSr_9T4w
z?_?|`fU-HjU=Y}iiqk`ROP6nIy#ahfB^pS|G)|Tj7BQX`Q5G@PF(D*}i$P`hiX`g>
z0g9A45Pbn>*32LSf5D6ui!u+^V92BAUViGh{qZoOlmQFK6_+^R&>#~ynD3f(h~`aN
z-lo1~{?+t|=0f^FT{7pCp;SM7@&W{Apc?MmMmsXeWA#6F@K->5|1PPg`CF8n5?W12
zVMU>CcDlL;h3hp;cjjz>DkDeEVTNvA8AqIht*gbk7{*b!^ELjignO7pZu2=iBS^ec
zf*_FCg{X*~*l&VVG`WktHJ`v&G5?sb>)W-+j@2AFllE6c$IXuXs-%OBe5+D%n356G
zm5ykR`6qSxG+Ubl8g&qZx(z93RfA25j0n^agJ6(|8#AXgnuf2`N!v9lhSUrDzH1R;
zYX5X-j5qPNfh@V0?>h4xr)nPu8%39+rL}aY+L4!q<>C%ORa{;iIA?bK5;}c}H3mWd
zUF<jcCVti?&G&$K>_=E14cdZq7VVq6eG++=iY;zc^eDV~R8l9VW>&N^tDPgM7G>F3
znPu%M2g%|zyG;6UVU)ZF>8qljxA0=BXo7yPi>nKPkiDf>q(5?)Y%lvh*`xX-D|Ns1
zR|FKt4F~&*6^z{i`a8n0&!a0|{|JBB1mZLblRTch5{f8AKprD4Xho<e9hj4GxIgii
zVwXPG3hzY59)8$j5Z}qKdX?JnsUXciU?FaKg}HTg#)hT^VJ0ss+5<Hr6di$WEQn=D
zj=-m}n{m@3|LUQnS|yh@8ad|6?<%7UEIdC7Sh|Xzx_-`U^tOPJMF&Je`XS*7eh(*F
z02IuJ7fb{c1mp$`QU#3A1(Z0RUu%sK6@yiiL_@i?QWk@mJ12Ybe~{z>5t0#;j<9J0
zzn12a3rP8ay%7B!Azr?bQ~f;?Ao!1##P9zZA*8&W%w3F4-K;(S_a*l<HSK@hw#p`z
zO~(MzfA4USk^%?oN!$y@2ZwAR+q<X8lEECJXzkV$6qD_lEP>5$WYYL;v|lYa*~Ez~
zuOvj|QISyJ-JkU<>sqkS?;BIpH%^;*h7wFH^U97x2`C<dAF?9tVN)!6r%8Kh`x5o0
z&)k^(VL^EQr}aWgqhBD&;iWq$_IU=)Dc!4WgZ5w~hs!^dScgsd^N~HG{7bruHrrv`
zcR;f{<|6A}JPgn)#@opEw$;kU5-nDfjb!aCK)JKglrlNJ=JmxZgnFxs4U74W`8YA9
z8n_`ug%jnJ_-t8f#`2%jnVE}uZ0;lMZ+Y;r=L>~}D4b;Qv>nljVangyopc8Yw#eBq
zR<rVAFFZEfT##R3`8g^ODXv!3oOoEU@>yEdmE|M{v45fPC?IA_jjd|9jyuayWe%r?
zyk%PKD9ACDIg625mviQdCNY&5VIo1>kWnwkrX$<X^`--=B{nolMB*+qD9Y@kz52r%
zLb#{VbO1<&v|~y!>#sbH6-`pA7Vx5(AnKW>u#uT}d1K-(5)+Q1`&7s<_bE(#MXE<0
zd!;!WOe`}IZe}22NVm|h=coMjt2#rkeAeCmlFr37FEa~oIu>qW=yyW`PFDeZCXo-6
z381Kn6uIbK9C-`DrnJMCI|qq&%V{?`tyLISG3>ifoWPCcBZlA@ZaRKgSFC${1Y@Xm
zAO^YYjTo8NSN0u~0yJ%PKBh3(xA6h2lBfwg!U=A?&vUMtBdgdO%-oe?dzQqD+k2HE
zMieBzagZ|uMZYrnJ9}|-?TPle(RSmwz#q!QYgU;jEmF4o-4WVToIkqrK4F2Ar!EGT
z@7k#WV(W;bS~P+|wzGc_7CCg@p%Rb3YOCQ7@T;uqt!9Mx#H@Z9qG?w0*w1>t3Vl*m
z*UbyJOh7|2!Y0n;rQwALpAv|a+pH|ZvMSH8s?a<w`gvNyiCx%^U5*63z#F^h+c(cE
zcP`>!Yu_<xOE1g*o@+2+uQURk9r&*+!uDf!8GnDE7yV<QiT|Gz$$N_$yZpO33s==w
zMUzJ7-zJk|fkzzz4~ZcfH<3yV0(2GEV827>G)OfWe|Us(SlhCsWaB^>yc2&0`&&#6
zSNX5~ti6-e-oYaQ*saVi=l(k5e$MrMd-8jKcozI(amyDk9Gim;RHT@pz@B9-m6Icx
zNn~aYhjW%AonjhdnzF@0&;x*2j!imD4ruBcHPVeE_AMi{SGyecB7zMex`wh5M=c>x
z!<#l>H0?EOFJ`J>PtG<GuFjo=3k4rP#wGwlWGD7C!F?efE0Y=@Wp`6gvXL6a2)f-x
z14dOh8v&-4S658FbM1KSy(lfD-JDll`sBy+oU!b!C>std%Ju;5yS8@(cg<#_KgQ42
z@r_R4LzogyQ$P|2-ErdyAi);9(;U$Mke&{t`Slx|cn$W;43LIUOUsmsIrWxTy8VNI
zWp-zMT`5k<w=NhE?*2~vy&QqB<pw%|o^L<1qQiU-C(VPa<o3W}_6cLf4u86)=YmG?
zWKFmbJXo1yV*+wByG8^s%kV?<DILw@RG*rGw=NWb=;n)OeS|WR=r>!<$)|anpD!zq
z8Bay;$^k|83;!Fv_gj^B@X{YN;(65y10M7G;uVf|a>3t*aVV!pc3k_pCtiI*ERP6{
zy%MD$$u0(DI7E|I)!j&^qluD$mOs1?N?;}#HdWO6waRsknj6lUV%>R@OC$Ty_5O5M
zkVRFhSCf?O!TzjQ=9>OIX=U@89{!)QASA{VqtIRai~}C+U$PM`diEzc+p9UoahZMR
z`1hufbKtY{f7r$Po21BIVi#*-@=<cb1`^otLQC<Oma-_sUcVj^HZ#kt$&((k>{I9d
zy4fX>;dJ8N7Wv65_GA@{4pR)LT0-w;m|#|}!=w{s9zlAIV#!nz%TKQr2&DN8H=XFi
zMD;Dj9>T9HY6o#jTqlYTAJX_7eI+}>jWCC?G{<pm3K8#&cdk0Mqs(|z_;tei$Atu^
z$@YLN!2)f<ttC1j;LQ2}O2%o=*0{nbalusV2#v)D0QMW6^p1P<5Kc}iM{F#L+!+zB
zhaH_g%6kh!;9sSzokg}C&fohK{t+?C|Av^Dqp7>Sxr5vPZTN~)(N|nDLJyeb&{*xA
z21Wp2xiUB0r5=H_ah#PC$;D)adY%_KwPwDS8=h!^>Cs_(;erDNCd+V-8(v*Ci73&f
z6W()U_qp}?jDZ6FkT=K<V32iLnIrBgtz{$*dlo3|4SEBx8VFk)4Gx78;};ItKM9fP
z92E)A2@EGbm`<fWGEEglFwQH&n*0T{0!7E|5x}K84#H*n@Sk*9Htu!#pQ4mTSQhJd
zA^R+vEqtLq#|7O$o<-*!E@WvQ1qd5M0<?2zwz&#oO@i1Hsq8<0y;hNiE@KWgHi0Aq
z1SvARLyecy8G)rn-d)`@rMW@T#X$oE!LY{&TNoWsn?m{n!b1ZQ1O9fXRZE8(Pj4-p
zjIph1EF^UAQ`Fgj-P(Mjv1Hz+<SK`R91p`*L^EBqRfhaGI{8(Fa>I`~0JOLRgF8z4
z)$6hbJCgI{USPYMaiY?mT)rB?Hi4!is>~9vk!0c%_n<PGdS9tF6M>obgvak?i$oB{
zTx0w2DlW@ASosncIQQ7NpHYlrn0db8yk<J)G384djKDQpd=h`c$EeGG^4c}sRL1b<
zp4JiiTU0Gwe@q<OA@t^~<oqa%1+?UNfwC-2Q~<EhuyWp!g1(6}w3?3%X__i@N+anF
z?r+_YEAyLyz`lG5`}$A1q5W^VQFkzNG&Zp_7dNy1f3>5!t$-$s{uz;8rw>V0NY%fw
zc+jSfseA(^)`-bWZ397e3pCrvOC@)g-Jk|mdx2Pu8Ym22z6gYJ;yyCRTI$H@g0IBn
zx%RnQ^k3()vKj^izQXU}5`G(GHY>&(5{@-ui(-zwI4X{oh0cjG5*ezD#-?cXTn`KH
z2o4LbhAhVhx0#}stiTb;a__9jhf#FsQZT6Uo}}-{ug1iItN~5Dz(EF9ok~UQ#9mBL
zrv22`*1=i_7oXMOtEk*=0aal%Hk0z7F==U7=w1T&yWdA2@7lJ~@|!rb+sfTbCG6`k
zXv=c-JlMB|s-IFR_D{v5N|4%utrbc#nVs@LkQQ7P%$9o;WAs}bPLZaBaQL3ia|8bI
z<ZJjyH}gW-rZ^m;HE9A}UAua!qx7^i{liRNIw68j<K?i$dg<o4rFC-*&^EW$9=gZq
zLuPM%cxnQ&p1bXB*VK*e2gmKO57c=uQMoRj*0`7CqKdW?@cKRn){1D0g&(-gvF)+C
zV>VUQKs0ad;`_Xp1dtJvl(1+-1BPJM-8IoL_l82sco=ATf@D>&<6yb+$B^u@_X26d
z0)#~T_P7<Pv^soVcIlhWx^q}EPfPhY@j<ekiZ{b%C0jCOCEFkG(qd6|jIgsG9-*^{
zbm)ui83s;J?{495)I35|A|0VMSyBOCWc|d(z=(YmS|G<m{L3EkArqeZc{T)}3H#bl
zrSU@ufY*Uge}uQM<up(#fonBGtm+UK`P$-|p}xp@hXJC3Z}CiT!DMgI+D|bZb3bi*
zf@sYm_e&5*6HBvA&9JB~lH|bxzx*v;vM+?XW`ETciT~KY6aA-nRm{yC|IcZOa5Y;^
zG)e3L57e~=obM1n^lG3ZvTKZx%ft(*!i|0qlOWrjg)20D)yLy-^DKGC2n;UZA1lv5
z`T+Yl|8x70w~dVXu-1Gs-FI)0@4YiM-GBZ02{mAk@3zlEf%-B%@ZABsWx|6PYH2`T
zuF70yjQ*>)T=kI$I4k6@JqPgS$!FK2xA0)@E!D*y9n55{;S3r#>fpD@i{N;3f@)lz
z4?{af)>>lqtt86Na;HPpO`g<G@O4c4v8N2S2TMj=*KXVcT6bBSQ~Hf~I`(*)#ch<d
z?8T@m$DeufXN1e!q}JBhGnfU@CnSspFW$fPcme{rov5j}zg*bk>jE=$7polK$gHBw
z({|SCIJc_wnlYUIcw@GsQ;Z=;M8^USv4w+85s=*dW*Xxi-S`fuOhQY-oWY^Bmcv{#
z8FST+8V?FV%wrV!PIlB84&U5nlG$-^+qpfI1Xkdtn$q%3;X(M_FB)T>_`Wvx{Qp`A
zb+&f$f-_tbLc>fOO*&y5jEc=uAS7WNkya>Ig4g$pYf=9P%v?%-gz?B5*>!J2^lz7u
zdwrVQAJ;<F9l|=BeX;_=(g=#L-y~bZc#!9QQR~lngO@sTY3L8Fm^?s~O=VcGBgb>4
zGRy$e64u%ED40e9m(mDZ)u=3J91${_I-k!LI_uO<$~R0KRqKBSv_>lv3D-`3U8wwR
zua8G|@I#13g|Hw*?8e&d$Pq#Lo&o*D`6#PqvFA$JSq<@OF@rQG39dPxo0XwwchJhr
zHX^NxeP~;KU#8#6x6e&2Yjie^y9b6=8H=YVGW!?Q<erD#r92r`55HUYCzP5f%bqgg
zDN4-c7|KfFsrtU%H~L~<sYe-n&UbxfTcwvcr0Gp4Ku?VA!#w<AN_m;ed2%xP*A*;H
ztB+KVW}^o%|Kpk6qAcqtC=-jC=oedzu<Dj_6sR>Wo;7zeZAfYk;dJE?MB*J(A*c`j
zdxRFwQ>$Xv68iIcqts6^O|;RhPPQxsjzL2cJDP0*=+K3rL%$x31u;ddQ+pB&8UKC8
z53E-lgQW#&c%=v!AN`-Ft<o)0j71qzCs7U2U>xDXuSkv3u}yq(9C6|tq3j$n?yrI-
zp0{B$Mbp2G3ucDQ;Zj-n8EPS(L$kp=H^>-!hof*RXtK_Nn_IG94lx#D!(Z7-KD03+
z7o@{}mE`aXWz(C6)S@PVTdax79PoHEnKhs;=O{0^yZ{clUj@JYkDEPlh*YoeuPl}M
zkK_6O1@^!5)c*y$`v1Ug@fYmcQqaYEYQu}T2jm7ew&9B^5Vi;?;YPBIZppE3_G|Oo
z(RZ5f-vXZS@v4blzrMEimuD=2-hM?i6prQdTOQ{<bIiR>^EL;*Kc9Pk$tZktg1@e~
z364X_ZM06h9%6&#m_5KpI-%EVP#zX1WGHi5AI0#?1gbxMMEMK0IU^J_xaCD=v02<w
zN6wbr;Q0DG81DcPf(`Cd@Z|K-$J19I>a>;f`>t2pTe65ZYc4u16pW|>*SLBa67{TB
zTZPIGeY&<b>TCk#)$wYS*+Cq=7*~Q;ubW*AOi7IVY6)t}{2byRQoiL}L|t@E_!Ltu
z9_N#%08Pg_TvP~D@72xfnRLS?Sq4f%o~Q%x6E`LRGx$&v;%MWk5ez52-`O5!Uz5|O
zFw9gBmpqIJI>M1X29~F-Pb9Mz6>mo<29)P|Spiy}%3~KE&Na8z$VPr&9bWb$B8BsY
z@V94rzpFhw1G_z4sNH>EI6<zp;RHnVs<4`xw$@PGsK|xTZ*tDFQ7~0(eNGPE`A=B5
zG|+C}nMON2V+Kt#66Z9(g3v~M`-TWyhMF|u6a|ROJPK!u$0S8~Dev)W@VKCZ9_TmJ
z_sppKzFq*}Ew#OEWZ#zI#&*rIxFjaD8V@dl;?<a0>U8&{0$%04mL0YOv}`%>1iK;3
z6J56Ek<_Y<ySg0Qrc;Vj)N4JTl7~@M=gtjvs!;Gvjuak?>Xb|Dk!kzlodX!#umzV7
zRo_OlI1?BM*R2gS+_T&J%l+(S9E@7V-sK4QIJ>~%oUt~HgA_KyCU11`1yZ$?-0V+v
zJ``1g-J(iRfu!iaJuMFr8*L`5!}x`<5?^GlTBf^fTBzQqb#brg$?8Gqy-cJJ>CtxS
zj+D|c$o*UjAQ&C}@KPjfy4(+p;=~ljL@KfkDFM*;+*0O9vgp7f$@jRH7bxvpMr{fz
z_tXPLnR!uHB`?HVe17`}22b$|>dQOFQ`?~(&WyREMSCtqCU1eCM6jf{K@X2+l*Mtu
z<B8U!c+#N@slL&~(UvXlxI=2jfczD5A8i$adDrnEI9b_q!K`8EnG%*@nDv;D7AD%a
z2C_5y;@@p@pt|WolIFG4&>Qj$xq6w3ftf_sJsGUSBuZ>Xvgk4q2e1Abj(7p`%xI~C
zl$IS!XZT(SE9{RuDwpI>8kg9hSWpw6FxT$al02Zuczda6&L|d{VTm_^7sB71A1Jxz
z<ov~X(m!(kZ@2w_?1j^T@l#t_`BT6-mD9r~f{pr}4h+Q{8U}1Q%6Nec0-Ayt6*KfA
zv4<>lXqt-^%*56<O(&zvmez_^$G)l-&Wd7?>erh=hRupjtIc-pN>@vI{{2o4`Na6i
z*fpmo_j9i69RIW3bNJY&@0h_C*Hj&Z?i+hVhmpXt^^-48S0EH&++>N{L{Xm#Hion<
zTo>uIXvu8+G&TfMd5TopxVi=C$&>{t>pOMaGUM3ry(5%3jUPfoUNqBX%xoIpL1Cri
zq9FEcAvAur3DFVof|^Bigr(CjMR_zOU(MO%vqMX{wX)9^UrMuzRH7raR}EOzX;z%j
z(yTK@o5MQzA}yBi<Bk`Jf&TeM1XU{GGLhDmr6OsFKN}KZzZv{k1V@n6N(rZ-UsSS}
z$E<b>i_o!kF=J3yZk1ujJwFsuZxPe_c|5P8Q@-F*wPf{;piHGVf`TTs71A2FOq*Ih
zg-vp5P*ZxThWY0TxGw38j`eDEaeR_;4BW9`msH84TaC<^wHsgFcUelGQ!=FA>>EP0
zO};rY5s@405S5}O3b5l=B{G!0RF#Vq2q=CRMaa+S=@i8a)adHe<;JY`sVT$ZHB+KF
z{4FD*y8O#mMXKVXL{j&n>xXPeALF8ePxEKMgTG>xXbG!z4x1oG(X7guB~4!KJ|B<d
zP^Vj+%!zf!mtC6&R~|!-&H+&@pHmVf{mUX*KDQrqdK7RO_u`9;Y_H_{MGGDq#4{Ln
z)^24InhW)%zgyWfWB7li&eSC>w6eU$$^7&_^+EW#<amVY%lE+B*-yCd9m>X8_2A1K
zFF1Zkk>;Rrh8eOkuMbMVbq+DWg2h?LE)>LMHG!~CTfnTdiGu<X=hwiLQSL<iBHv%F
zlb4_}Ac`76C?|=vKE=fU6H%zVi8-z{uD?UTTpUooZHLU~Y--yxL3FUc_8Rv&^I3b;
zNFS^u`5UnE1O%tBMu^Ph>C2|}=0&ULJGHDi_DW5{F&C?b&f7T(5}uBok<&Lwi3YNH
z`?Yky)TFtK+<Ky9UC0&Xpyz#B$#=w&7xC<92_fva3Hc60HD%vzBv&zs5Zo%nljzq(
z9CrxLLU1dSvafCoDVLDq9-E8wxl{bX++o6pk8$H}^zxjyGMz!>kE@JTbg0kHiB2}j
zs~$@7N$0_qrT#%n2%TQft^=ZweNGqBjnuOb@K@=+kc&#>Y-g*h<2fE4O^a*wtIBqw
z!hDWAu>BZh7&3mvyGy2Oy*R(f&Vi8e3*~5$IEF2t<#uFY#<yOjty<N98PAfi(QzQ@
z%=E6|MSpg*=Ln&z9i&<4Vv(~0A_rHLT_u?REFKL|TJo5xRM_WvDF3FxfRFc192jYh
z_f20r&hu62c)eEdfg0XMv<VowFZJyiC`5&9IGyvx!Z6mfx3ZrSr?jV5p4*rn-ZE`#
z=KtM{&BK1fNK6xs2zWXxBx#u#c$<bYisa7rTbnAQzFcB_v6_9*iLR4}=9|4qVHs&g
zeVqao-(W+(yu$EMW?-{1(&krUysD8{uIugT;%IT)TZ{YjH6gDawxOWb2j{F{IXeRv
z_SMAROnTmlfqgWvmSZQ)mK7~rCPhxI_GU3@o}Cd+9!RH(_-^Nfcwgs&__s3eFVD<5
zO5ZC%!rB4Qo=rFiPoxwTy6$|jl5RaTFKEx6*E~A|IXpX~yfjyf)|}hrOIOp`KH=`h
zt2d>lNWbQ(h5hmGBXA;d_{E|E(w<J;pb$>oD7VX&47zeKY<yfS{m?8+eBHV-el>qJ
z@n+kZon($oDilOsJPYs%5<UEmlC4{^Z#0j3pzotp5qWByN0`J<ST^S7lbb((Cha3r
zQE`Tomp{VGlRvC_`6+4|8b5Xm0Tq{emkz;IHN2+b_Daf6nQ;@XFt-Fp(_6Vza7vzL
zuzEK408pr3wB;cjF~u*97^$p6XzUPsHA_9ni?p&rls3YF&8r46T#}>vS1et4Aq3*Y
zCwjOO)Pw57Li;kh&%NLRRnHiCdKKi{2AGPA&g3gNPv!G=NXmV5D?Epdc2>@=AM$0c
zV@w3T#}Wa_Nw3Zxi2X~K#)f4+Qa_89EKRKcl+L-oiev{aWbg=JrUjB`{ATwrS?WI%
z<nfpNvtmuur;Kq5OO0<Iv((uT?`p=jfw6z8-QBtp6@{xdQbemTQby|_o)$ZXVy-bA
z^->bh=MgWPUFGFQF1g@lGsf$OaS51~z;{X8cTCAV(QEcO^Wy*`*Hm}Y$0<6D?rda_
zSGdmGNOU!mtWg2VXm35dHj1XWyK8>8y35l7A%z2PsYCe4@$(ifT3pt07H4%e6&BKx
zWcuo2i#OFqs%cBowo1Jrfk!0UT~<Ly%W2>mnJSgBjU4IUEgUaf*Wt!3CM{vIY-hb%
zWDnHHZ0r!jx=p%RG;k_t#TR2WDH;s?Aj~J#9Llqc<;>>c)w4=zM;?Oe<c>2-<%)ud
z39WH^!(=BKK}~hTLnz8eV2ey|Un5T*2g;@9D*?@Q9Bv~B7G*S0=aXzl-}Sk*vSv{j
zv11z8^f0(|Ncmh~;qt|JvhJ|}ikcQwOYUW2HD={?sWj$QEV7!D>&dC>;JGEVu4$rf
z=J_s_b!t?R(Ny>04^BAh=ab;(#5s;Mm|E_MM;abQhv<x`m*QPbTHGOE2i{#SrFs%+
zDl^)a4f--p>NaNX(N^@14USF@H*jR!uC6{T_o@q?$I^)TE@{WP&8?0SZN*A3P8Ke2
zS3o25iW>5LhNqA7x+f1(8t?TpT}KOr-T4ryLemI+g(emYg_TPg%6b-B?ut2?a`;vh
zikAp1yW`{uPq7NY)q&0>bODQU;NwJLuJaenZLYE@#udFHMvxaRr`=&;uaMQ9+0^ug
z7jkhe)VfOzWAnfkI!t7#Rcaa^=2XEfS<U_HwG>Ou{B6&!4k<2D%WLSWNUPumIwGV_
z_ivF>nG-$o4AsQWJcKk6dsAB%SC7O&ys{A%?Xr2;CTWKgY2hgyf}AsMG<~FDy5K9=
za8je`O0-XH_0e#Dfr3_Qn}(u>GOce)<(R5Ci_66oq!#*cf`v6CIga*j5?SqAL>G29
zl9*)tq-a#Ln<J_B&08+%zC?&7<vpN1EU+=mP3osVcA4*ig*QJw?CsYJTv+|J3FWje
zjF%=d=WaX?9_;ucinAU%{YJZxZ70>%JBTY}>!Kdr+`gGexHUICv#G7*b~ODSHjP+z
zl*HNg`*|6Z%o*!7>K3v*`l#)Eq@QT7DDvZ)m#S%th^Q<`-FWpYs@P)Jjrr0D6W^x&
z=7v`W+tnfbW(zcHx_q)9#Sff!nf!G7p}{$`A~kJM4TOSS<FSqh-H;M2-xyviLC@{l
zcfLA+u5#n3O9?T0e!N;Ce!+}Ht(3L?OH-xbB90Zi>0ayuOp4K{i#S&oQ#ErR-BkI5
z@{q&?bYnFy_oXwq(@01JvG#I1u%*!^aJn*+@|sa2!6A)o!pYC6O)820I!ZkHcVvm=
zx5H+UHqr7`EO^9^?V4x#yX=fpwBzaoPo!x0Cyrg!^t0Urx7xhh=Be@5#$|N}R}jfG
z4H6c-pf*iMruM>B!i{R0^i*HQ)8+X*{LOypfvauFf|Hx{01^ECG|mOQBMKv@%C454
zZYeI=v_g#KO5_{HTq>hx-|lkwMr<wZ=8{AzwOQU;JFZkQ7Z9}?P8E-xS!HV{E=I?2
z`xB9!2M&WZVVsT%>Hf(`GZu->M%AmCdDuR;uZ+a0@p^4PvPo9<p0J;^n6m$LxF*uC
zNv?KQrHajMggnF&vq&4=+PQ&-yip@S)h%kbY}~6Nlq(al0)KdoZUFJmAE~6<EV|B4
zzZ4M9T$F`_0F6x)Zgt4uMj^2#1JlLZ(A^;?igN$dJCm^nxM-EolvvM@l?@#M1HvmO
z-2Ql*P|XUFeM;V%xmQk-HJaAsHQw)J6Ak<)GTWKPR0QK@KL<2g+P$edBA^&-r3X$X
z(b4ocEn8pN`&^w#bLH4obB3fF{HGac2EKBlKE98RT}uDSi+PczCMVX)m#a&<>TI8z
z3bbP6zYfqgOoqP@sgl!QHmA4d3s$--B(069kw@MCvIWrp0(fbM^2`iG!XC)82*i5I
z{@CsqySyIpw+QUt7BqTB+IT@){}}Qbz9bqkwfMu8&-6xli{1{pVOv7UPfE!3N<Rsl
z&J-NGKVdy)ym=pq{axVosWSR*p8tp2^b@wdKHG)+XeeU6KfXWv1J7$I6-56&bGbXp
zyLHTb)&0WTehn6X>m+I}F+%QNh<YAQ5?3;OaT#7cya3nEW)uB$DF(lJMFui)^T3Jg
zweZ;_jP8Wl%1oB%&X>6=45pWy6%Bhk2E3c`@R7MkpbZNo<1of$2`>H>dl%@dU`0hB
zUT{4q_N_@Jdw{H*dM92lN5i<`ATM_ym0((O6e`mc)1s=ChAs^P@ld|Jb-V`&>hZvc
zkRaDEao_<J=MhNx(P1#%a6<m%S1zTeqp}#oa?BJnLU%o4CmS^p!V|<zPa-RLyrEC@
zS6<$6z@MD@Mh>G^!|F}$q{VoAZ}rK~)#Lmn&1K+Qnu0~QQbdeTW9FFT_{+F~+HHr<
zD0{CK5Tt{{cs0VZKhSUP+px7f`3|-`u>s)cnp9B*e@v^}wpxqtd4IGK#HHQlAD=P2
zW{DK9BjGevCvRYh21$cDSe?_E;+gP;QZAj`z^l!4hB=q*sy&>+t39&}Z+B0g{MB5#
zLu#ubxT#ESv%|qtn+0bin2(KckMAb=rpJ=B!gT1ySlITcYJ~aYB}sW2QBm;Y9BP0#
zT5+z8m{_I+Z6NHYDa;3Be%*WLOUkk4yn=B|Kh*29G0U|e$9aH1(|9x@ZuFP9L5b`b
z`4(*BD$%fbiP-oNjOAbh0I{&3gkWAI?<p+&Ji?l6w=?4-NT7=dX&&U2XfQnVKtovM
zd5i5IGIoZ?_v3JndL*VIP5RO>4C$umh_V9((W_&(kgkov2w}IHTT6G}MXf{J^nzwt
zB%`?&$ZyR%3A?Qc)I6kfqjZ`M%Nt)mE+mX?0z>lz_Rcgq=J*=U^<lMjS}!8DJ&Sl2
z(FUit)X_49Y@W<iCQd0A1(ghH#Y2wNWLaN6nqOYWtZ!bd?`k$?)Egr`Hz%M8$V~XB
z(6{ez^>3Xca(QBO$*oUmqdsn26Z1b_`Z@#__s<mv4ipED7Y7a(2Tm6UP8J7367>xb
zzo5$AV8nc~8-51PM>uA^n);c<1n{Wxb{aC=DM%Uhl0P?Ucy1Bm7q~^B!8(};zVkbA
zz#5r&Z0S#X(p>YU$WJ6UX^9lP69drYzC)EaS*In#-H*qam$Ix@ObA6+?}xm9bgTft
zY7sCm+9c}t?XM-ry0%ZZ;)|QWAarDU@!p)8yy{4UjgVmJtcW<uj8kaxc5c3q;5#bZ
zN}xqKpT>|QUrS~{^UOZvCDNa&b&4)(&+{Fs3XCpTp{s(y@j$k+A>vg=G5<+I^{A%5
zyek4Wea{h3q%Z%zcsZyc0=}ItRzX4jI>;1#w_ZP`f*ObNsWy!&Zya4-9ENC?CJ$Pf
zOIA_h-!zCntSCj_A>!bn$z`c_(*;{4O_8w8r8K>^#^0vRmDW{HX*;LB|BTXX1MP_*
zO|{N?FS?J*B5u;~iQ8BgQ3exfcK9#>^K%UbneQkk(DDW=s7>zUyyp%jNZMoDok`o?
zRIjyHt<hd^(8!%UiY{no9eR2jbo!_8JME@u+$KgT$(<B7{ug2I*d_|rYzd~#llDp5
zwr$(CZQHhO+qP|6C+)7Pd+*G=)BRL`*uP-!6%i};idaXodcfe*deKS0Q%wkB*%%hA
zSgP351VZ&VrU$hu`hYTGiIu{^G=dD-T$&dUu{$g5DX9CYl_u*gF-EI6wqz;UWSIBF
zEruwY5?tR*FMM`Qx+lJF>X8--0JAm|avjlTEbU?J81JiiKD*k7$qiSBWGqh-(mB~3
zC#9rkl+xW37-OgYD3-mE*!V!P?+(q#=AUZ5vOjmhpE~~O^h@^9FK!%DUx|%OSSdke
z$MLkQhc<5(2L!S(X|CR%>&9KRgSgE<WOKrsMb9mbD$jtYn%^U5cMvQ$C*{mb^`NDn
zCQxl~(}BN`>`vVPNQG3ByXc+*Ym?>^FMn~s%FFO8P`IVF@*4$ltI9ZWIlAtH`5=lm
z=A!MyA$-4|Tr!`?^0W(v=1v=JT!*wm!#tI#@kL)9Ivb6_jY72Jt(o%E8Qv}f@kw48
z1aonZ!=tenR<js1V%RHmnL2TDVRJ5s08-<}s*jKvsYf<yTo00ou)ByffG+K1B#V(O
zgHByk(GuQni;)?&cEZeDh`mF|9ye+Fi-8gt3wW|W*Pqyj7z^~?j4s2T>l=Egoi}Yc
z+JKE2FT=D`Ux9H>zLJ_7nId+M&hTg@_BC^p%|tAO?%q|94LDp~wgpIC=7C_s&ziij
zgBzY{#f+ZngJs7Go&#0oL$7PooFMy>`v|1c5BDmVlJD~sikWLBK;dfzmAqLrNU-XI
zY){3}Dmp!=0Sk~C%Pa%buvU)B$Gmj)UJJ?s^<quvv+hn^!@N;Yh7zY^+t9IZu_X!e
zI<5`I)wZYAUtzig?3jyo1jh)c(0}>d6O|Je#jr{IPVo4#gSU~`I}t`A(IEvG-%PAI
zo^ZWuz~GVYqux}SnXi4a14>mO#2;bRPeQ`x5>4w4n#A^3X|vj#PMu6wJ7b`B6|!(p
zekY1XpC0U7Gkg&!?A$N@po_=dn|k|wGB=35hbzp@J;M4-r+I<I=D)gmh5_d=>k#J&
zSGowzmKj+)c}}b)P1~sRZOvo+9k|(6YhoRBD!O6g=tXIB`VDd8*<O3d(=VTw^1*YH
z*>-E{R{ZqSQ8#z-{f`xl-yrV_HZlM}KIy-87vcZAyQpZUZ};E&y<in{RV-z6pAsS|
zhW4v`KW#D;eTapn2(?U_CJ-|UO?-iJNt^^phPbJrbjYQSrW!NL?XNxByGY$fCUVi)
zd+=AZPx73@`))@6-$KEOFEqE$U6bC4yFc&8tN^onoS@xqD*bdh&<EmCWNx^o!#ALy
zrwB-$4*^;T1Zcr`#P-;*2Mje33?;u~?%(HYa(EN(^Jm`YqdgIPp-AY+g=(S7gVwZ>
zI?+(1^fmfnOhD6-jym+FDAo8B`X$wp>WNmcpgQWQ#-uT5C*6btX7^ihAgdKEH$qUS
z%|%E$_S8D!!^O=Ix`L}z_K-^W1*CK0TF!-rLB*GHS7Eo?$@beW?jvGyD$&I<F1O}x
z?I>C5#C%4kn9xX^0%wsQD7PdmDA_w8OQ@|EoeA<4t3A@1ngmp2*G&&<e12E1JC@Ms
zy)FwG?3I8R_fu(*^W;M_MvvoEl?FkE0CrIvGKXloW%CQ>MxlftFTlu#1DmP|hu}kJ
z>r2NuAEE!DLzhA}>gw0)H?bSaAFK11#%RUZ8Nvx^y<-{Vl*4!jbw_hG-ZFH9zny&b
z+ZXg2x}$GF=jktndAa8sF@=G@Z;zry?-^1}y5AN%b)U%ZI)zwR1zG^;(SJoPC1>sA
zmtRV5mO(i`dtbFmOySqKQ5R6dDN|nO5S<i*(4M#AVW6TAw4j<+Y<e&vdMpP=vD~mI
z-ywzxH4Uof<8QReL0Gn^H73R9@8HL)r%^1Fw=b2B?98)f6{)b54B<31nQ1y<lALrD
zMaO-g<*9UutrXo$3J~Ew%pqdJJ8Gn#UYolj=9Zp;5UVg#&qChPyr?Me_QKaiOk3Pi
zv8o7RiDzUUbry?Pg=03%jkB{t6Aj6HJ3C%h_COJrWV}*dobZgF&5SvbgR;JeMqch#
zjUGMpB&aGD2MCl|mU{V-2&LF}yX7RxDQIsH`7*nW0byN?bUHq%bpOFYk(4Zb3Ff%m
z2n#1@S$3OS!eiML*Wb)xz13--)g}RiSE}r=y?|&rfQyzWby*r?kcRjLT{7j>&(v0j
zw4?bsVQqEGh+R3sV#0O1m{nCwhV}){_xYfONaVS%@e&k7rE}~-a@n>m?Ty!<U9_Yw
zlX6g;exeUoBo_NeuP~Ivix&1<@G(FA*avd14POI1yhJGI?05FJ9}HeKJV7kJFxVuU
zl0bH+&7f*PZ$mXLe~k@r6SPn4$k-lB(k}ttJp4b5YlKX5{fFf_c87yP=+YM+=+q_z
z1tPfoI|RShHbgWb^<^u&g9dL(2o*$57i2+12Ns2B3&PFt0I$Fa?{GjqiTLpdZs_JE
z!wC30*`xH*dngpyA_-{rXzXtcld53$m5Ar;8we8S8O6Q@jh(`u>@Z}*mTCPUwT!XL
zJ8Yd98DjuQ=A~j}_Au=W*tF^0p`RY%hqUfQO+&aMM`zwTyo|B&?tda~j&UZhznxNL
z+b9l&I)CUrVz8+Xk77Tvrsdd8<^wLzif(noeSU@g%6Y^3J6fHf4HDaf007`a{9Clb
z{5x9NnwnY}3phJD+1mVXqsX#I@(ABD(AzCF3Xy8UG|hP}!fJOD#eT&B1;+_|MDHt;
z`Pf=6<2UMbJ!gsEV7~sd6e&VTc;0uS7^hZPVph^t3+#-JCOvN^CbPA>yFLJEeI6k8
zMFnRgav<U`l=jpSmu-mrm>96@WK1x@^aV4S`cV~O^>i@Cv7(R%D(J1t?xKU*u!)!@
z=mHL+ZG(p}Xc3t%)h2&HWhFK@el26BGCJiVrNlYHggbTmO)-YV1ZW?_XbbD#E8Esi
zWlt-tE9EE%Lv3oD&a_-#-BS$eb+l=6kYN-Hn%@E2h!ft1Qc-M!N7}6ADDF!N01|0X
z#*}*n=rmE3Ttij13>?R3FVj^M`eWd5x0N+z#i&o6r;P%`y5m5TnYoo2B1#5bCelf&
zOs~bk`BS+KR5^tD7yrFbJ%o>;*brl>Ek#0N^bi9__D)GqeiTZ@oUXixSn5v=zUZQ*
zF$Y&a0GRiBLz^O<WX+^@$eQ_i^B<a8v5@Z;Lh`>?liNqM8Zg2zk)Dg|vt+I{={iVu
zoy72t>1mA18G?c+e0G{@)TmH=<iU7<KT!^H7hw_Vx)ckhM<*b!ecWnlq}#E!iC34w
zDz2l!#AlFd-C&cw^KTONa7Vunu&k7~Z8-!H6-4ZP^R$xLGi^`MEgo3VMEn8{NEleK
zc{K+<UonHav{6jK+*M5xKl0p2F79`>$;{~#q$QJ~jhX8=pntNS*Mynl^_M*AmePo@
zIu17x?FlfBMSKNme$h$5=kOO#P@P+i`U%Lx`{D5faS7U!?J_sRadz_QTQUvm5%lzl
zvg1-9T@pbyzh@*ZshMgdx?ockT@~H>xUE_fM=f5m|4y=^od+#J6pq=*EUxv!wT&O;
zL=JQ4-F*cBJHN`S*BbU-W;!0(|M~t$)#LX(5L68W08sv~svh+J<D>tdG0sbczn7mX
zP~`9bP7MGRit{8(g$gK8PAb@<%2VLG^VrBC?@tg&02-9_hQbpRjre;YnRaiJ?MD1k
z%}m<l+33aVBYT@W^Xu*710JAo4-?2tbw0m8&;_q%uLC(-!AX3+Iv>3IPo->xPx%EV
z7{U@=SUv@eB|5(t1*?}3Tgg7jh_aN~ouNX;ZCP6-K~>(L9DU50qyQK0jzM@gvP<;y
zxe7xJ6N(gfTB$=dwS9kQ(4BNC1+ube%o4Skn~`9Y!+R$6re&!Wi7<6R3V$_{WQj<z
z6?=x0ka#IbQ=vZ$OourEsBhlL4e;SSO=?lbZL#Db;BI4d(GY_$xaDqBbdl^K?o@PC
z689kTD3UOfYV!9<`xrTjRx!ya6e<`7YKCf~ArWXWnQIF73HvBIlx9@XRi;XS$aSEL
z$SYDAn=N(5dA8^~2iXB33TU7dvzJg5PU>jMqtG6jO>CX#ZP#jC`$zLi7S^Qk>)VrQ
z14Jn&j%&l|y_`W0DE*iZsRQuYbD&}8b{!CxKt+16XcXGdEaThAqA`_;ojh@*VvbNm
z@WigM@kO7L*GdX9AyTa-nVXUrl5IjQnlaR%%ZN6SnuiVQXGAH;kna<mlxK^Q7?ZfW
z?>`a>!`AylWWb=($FFBH7c?5=R`t2Z<{tsG5?-Q2S#?-!^)(Sp<pByW7n%uW6vn6c
zP8a!`07HAU?}{hw-Q7bkWJmA62$PLyC36yuWvGw@%fo$0xivNdZ6cny(z9G_2`tuP
z>@@Qwe^#Ln{4|K2aQS1-iu@7%ypTOI=LH&)n{><a&|cBGf`4%Znm!<-kluj>>h5#*
z7Y}Htt1a*8!6}p8p{PWsT*%%@T8j&W^!Ojk{S_c0w=CMS1g+tmb>(D9bm>Avq8VRV
z&*w(EG~uLkxA$riqVi&l(7Mh<sA1ayJm&p*9tB0iPPVNvjTO;L)aeC)^^q;n1N%Up
z%}>)vM!~1%A*>1E;A`Sx=fc)+OJaHdMo$%b=G)&|d%J%X0weu{9$PB|eTV-9&Zf#D
zAM$p7aFcypB+7k6fCOfe2U>N2hESmJunJ-qRjCtIIdQo-1y$}7;U`e8v$*}ZhL7Lv
zcg!TC`7*#0KBMXL75nKGBk9B8YU?e4%wc<o4@?F6!dyr{+w)!-cFg#G8+HiunV7_6
z+=>_sDO1)^*-<G|)_^&RDU;KFmC(%a__q5$9$#r8AYjB<D)z#|%AoZPw`|Ekt|*Vj
zlb^7<((aTg+7i;IkiGreO#v~KDb{a?P;lpf#L5rV5)`MMLzA4fLDt<UHXLta{7i?)
z!2vZ@#*v-P#{qT^U2^zA_XhN&6<fzWg85BZijHW*NyIN65796uRR-d(g$zK0K5|_`
zl|ksw26%%YHS}7eupuxc%3DTh1Jog#bQmS}p$_-k8FKN)Y5m$Eo^7=TDf@s9$P97)
zs-H_m%~V#i4ptZpvv&xw=qGn-!(4+vIdNwy;@Gg^;h|P08!dK>C^zl{hHeq2P#mo1
zg$b!$p1}=jM2rQK6~kyao2N<)4sm1O($o*&(%?zQ6^788y8`9~Lh}>&GCwDsFb~h)
zFHq!B)GA+k()y1^gmS@&kzmO&t?I%Rx|P{8#5dDyH4rnN{%xS3+nVW1vIox5s$un-
z@NeczMAWl%vagCLp&!vF;TO;iQrtgnCD)M&Qfwm0FG1wQwhk*&6y_9WtI~?Nw<M)6
z+V=`=HDo7ZwE^57E}n!S(N#4dslx0xP|cs#H`LR27Vok&`f-mcmPsRO(9+aOHlbsH
zUqnza-OFDjn*MA8wS2tXSWw=Ns&i{1&pz0B_rI%s3UK5zcCjwyqF|e*YY7`d%JjYX
zonWu0+Y8w%N5pXInTO05c=BWmew}a2gI5+l5W0ww377=Z6S?*poGzbm(X_J8G5hZA
zadcdsy+!E+9Ejj_p74N%;}+Ow>5%TB7rSIt>Ho?%1Q2f!i7RNm0us?*kYtHubc=Fy
z^M6nya6(DFgG(Ks?9&Y=MZllub0u^NK)$Idq(zp7em0(hY=8q7<`B?1f@@~4rosRI
zrwr@$+z&zm1_1E;zhX+&+{Vb(Rm4Hx+W3F!FKb0h*}pfZE~2(*qml;$QT!<@+a#bu
z$Abt<`P0JnD{LqhIy<G`xOE+z`I{2<ufmJ>y&uoGt5Fk$+S=oEhx2sD@kZ)&be47(
zV5%TXfObU5h%RRU!eL=cncm-%d}|aKv;zwCQ2gjvL(D*d0GEWG_|O~$%%mt?`A)1K
zDMaQ+$PI}RX8TxBUo~qa!!qX{bVCif<t`O{;hmTBjTI(5L2)03+gSf0d+#c&6Z|Az
zIQ>Q>j7mL*^a^vZOoxYgR(jCt6^!?^#a5_Vr5LY8;U&9|`@~WprL-17dQ#v(tvR;P
zW^;?zo&qYzV(cJ2gy&JxR%Xy~%2KVbAOH<B<xZiW5>}Xs5hmm+#e6l&d$*Wm(!Y*k
z%UG`?<d@3WxcOf&5u{38tqXAm#lmE%FWzT9F)O0XAThz{%d_5Kag|Itci%EZ?{OJ2
z7_RzAD8G~d4vAk02kEKP$bido-9p7{!@?EQN@dYbwsVi^a=U^aH5p6#!4uh8FlWBl
z#JlNX<?8UysDJuEWxQ4o!H@l*?6Lq$!DF~uX}1(1g7j8gD7EmvYxAUe8qMxA9TT}4
zpnneA;B^9pB?V1;;%KFWQS|8S@zSht{#HUqQc8NvCX)p|yEY4W(iWV|TQW9^-@9^d
zV&WHFhU!9!ns*$Zo76vV`W%cyE7U~=c8U%>IwniOXr_C^sIm)R6Ad3hSeMc8hizcB
zuMD>RjeFn<ji!ed<~!<fM0_Ca<Rx&bN@hzNKUI{m#5fR_dj5`N!Ei;gI229dQC1ZG
zsJj5@6t^7^!7#o>@{aR<gLr){_epm%mysvR9WkoFw){l!`T5W2)yl1*xyN7WfcRgF
zssI1eW%wW0+y9zb46#hC<AeB}M;2Cwg#hFRUEudykB#W}!FWSDQJ_9+b0_4P?cKO<
zL2$lArPtA4k9WNh5*-Ft+<Nx$%UO2T>*xL$%Mag<cOwsUE~XAIb?#CWuZHXlJ`YnL
z59|o@USEzPln4WEkD^BW-WktE?4$&~mB^RVj}txKNC|T%xr3hfX1|B%5Q+p@ihik$
zeE$)KVM%y32&2`d#M(PEHqJmPZ2-p*!eW$ZpA<$pQ6-C!Nho+6tzk2BOJ|;Skq8oV
z#btz{{hY>8wCm75#D=<~`1CQX=TO8ghADnrFq3@T1Mo8T^Q1cK5o)Na%KFZHUzmEF
z_jjQD1^J?wW(-~8!<MwVJ?J6@$DQ1;c~*QU21;X^;+>c<@&imYZdj8I2_gL|NpE<S
z*l7E79}^0+T9I^X1o2e4Ta+;<Jqo2-GR44Xhf<Y(GK)TnY<<mMdc>(){z387ql8EI
zNC=SjFbNEbJ^IqZuPyFD7(F>t>BP-M^KJXK!MV56m8j9DD9ZWelp#GfRV$Mflyd_d
z$`vddg-Yw%_~eYDXh?G%wgCG<l$3FVi0>Uh4kKR%N^F}`qY??qONJ)osUQ?}0xZ{Q
zR1m?Kz?^ZrM41v@N_b=%B$Q6c7?gl4i<V!(KpEVV+hL7@BJu5m`q0Ue7+&HxHQ{ZU
ze<m`F&*n^iQpRPU8MTNMl|p8lp)4fIlR4v^7a^S)$S}r>%XO(qm&LoQWr`Z%_$}@z
z5)M7q_DLr2nqjmZB2A|1*i*fErD$c{#|zGqy1v_jPApP+DB`<?(YOJxA2I9n<lq>u
zDb6qZ)G>1%n=VB_zx?@ZcTMYdyp_C?R?dht1S#{7t_R)<zC8b=K9}!s*KsT1>K!6g
z^b~k_<1ynC!|TfPcgFpM!D5?QKFB?kK`*CDU=|UHC2(OrK*+CgW%%Sn=0}`y068f;
zb&!j95I+9K#{ZBLGC>7m!TW7b&~W05Z@E5L&R|Dm^@ZmJwtpBz9c~RF;N)+Fa@H@b
zQF(UU6$Rd~d9(<2`-1d0s+fgEd{F*M2sQtj5D@<pRsV&lVpV80>{aJ)_^TVLK?uNK
z33X3=YO$b!b+{v_Vhtb=kQfN4ztG2HsV3{Hny&J)wd1bT8VofRtVrvxn8K4=+?nMw
zOba!j>BARGWER_;GnuS&oD-L1EK9{RieibRFOIS}8{tvowp`xW9B<PdXSiQ@V?9sb
zR&(4@`$RlCV-nlsf{@%=<91R0cw+kKhOX-OijI2T^I&xAy5Ysm<3YUT#lU%$g)P%w
zywZKk?f3|dir&-X;Ej@gz81ys4wMEtitl{YqkCwK8W$OHoR22O$R1*(OIf}~#h|=q
zNqq|q=3bOJkmREMF%`%`I;Tb6pS>4`_02crrg^<5cIUYr)qTHLW$@x3)jhQRd~K+D
zK;ivXInjMOY&6)v{e1Pr(H&g<dJTc_U5vGTySL{3?vF+LdKJyK_7w%`p*-^B_=co~
zbXOmIIewev(72}+meQHOr|{Vu?X`H#r}HIJ`&0`{cw@!qy>H3^`+O~@dSc}L)*kdd
zI~(?eYX5!I%k-%w+Pk+Es|)c~T=%0nRvYxGG5Y&^G<Nm#H99vB5mFFF&Oc6o*ZuQ|
zngGw7<E=c*RlGxFm?I`0KN0i_GI`7_KTZMPSXfCWGKeb0JUEWnN8_T@7*pB83AW$W
zi47N<88VVH7Hl+-6!R)vjB2Z{R=aIFNa3l2*<$^qMvlN>7~)u>0Uy(-eMcy3SluQ+
z;j&?b(ZD#uv9F2n#mKG4I$n*aKCq5q4_%yuKz?<M|1u53aNW&O8n1uR0=8Zinv;;e
zk&~UnYy=(*yl`sXnsFYjp3tJ;{wU9#puf=0LkT$|qrZ)j<+b}y-@G<LgTY|@tC=Pd
zdh-Am9<wzkI?JMC;c|q={R(2FE7s}oOKf`mv)Iy<gGb=u2~3RJoXzmB7(;MsN)I}Q
zk*oYL?vY<GzZ*RdPU<jXGX=Z5cy&_Lsr%>Z?Y1OFLfqEd+_}s*tVolZ7Ud|$Tw^m0
zI+(yEQk4_>H;s|$0jLdPsn5Dq7;qJ08XSCySd660{A>{BV7FvfG2IAn80{p+%(q76
zvvGWYU-opOQ?Qx>R4|(&jLRcbu#}`%F`7bFFq>jlu#odGqb*=NaxP#hN?|dX(Vc*;
zm&_9RGtHs%3-B2x*fwG59Sa%@TTLHIU=8c*L|8GG#8@$$7_FJh!ZTnuL^hc>^yjFX
z7W1^12GZlgNTs7SU@Z!_!Eg&)MCeRqEm?l`{r;=MFzI5(Y_eWVp}wIvqjf$SZxH-A
zQwiiKpUksaU-r3}KVu1mlcUu)_c3WDBAmw$X9R`e5DSF>RbG~=u!OlNOvZe|a_V$D
zudU%o*vsl%%mdsQe;|alm~aRMy>>ikxh*nZ9i@tnL3aY*CU>bAy3)4l4cR-!u6L_G
z5VKl~hy}~em?sIiNADb9QBI*-%<DXd1p_sg6B8@M50t`WA(JA^!n8o@4;KoQFbyPd
zQUYK%kxLR`HgJw)6Med<xQG)|de|^t&vqU9WwK_}eYiyE5v7zRYNRMzlkg`CDOM3^
z(u72|g-@t=IFHELKBz-x0_$5g?8#od6cV5Gtcd?*t{bd7-pwOI#ew6212t8bS@YCu
za%Nps@C~ybb0~|y^xP*9H_sCXKa)}^iNSDYnib>m_s!xNejsiMBN%R}<#v!NU9+&r
zbQ*PAL#rt)hp27JJRw+4o+vEW_<iB%88v42a$f8FAy_urpCG+IMS2Zna>FRv%{*4D
zuoX~M8hF2vSC-DOC$p{&AwsUd0!6102364GSX9|<(T;G2*!-8WIvw*&YHBnQ_Mhbk
zl6NPl!#4S3=|(E4#GyIa5hOv{!$&fUnM+8|eRxyH&eBj6sf|OzCXEq))aYz7aR}rQ
z)2@}JLyxSC!nzMsn#f9LZ(%nGwfpN&oLY_<FyiWoG`rYW3j&oNtYoIGP&;i*IrC7@
z_Hut~WvmA>of;zQ6h>)VGKL0@n-L6ZW<{n?TFY3TRuR%0wG~f`?K$GeOR+;esAYlZ
zJHwQhNR{P4GlilsBEg2jIk9k7I*H8^DS?{wOxY`mGjX13frGCut09k}ArhfRfn3v2
z+EgSpD1+ge>}mwGthWirXwE<xj=|iI-AB~f_^6ta6zIbBiV4hQvO5;of+d+h@bJ6@
z$aBh);uyNjAhA^`0cW!t7gZ&LhK6A4m=2vRp`BJbwpdS;uhA(Akkgn9OR<<bug)xF
z6BjL|uBUIwlQQWd9@rE<gD4G%A8C<!$upwLM3I$o9)-z>w2{V4dIYB!c?z3$BtOv+
zgnzpc<yXw1VIS&@Hf#TM0PW={{0a?926LUqE@`J5F+w$Vg=I{^vbeQlGLLN&)hkK9
z#Y^mFw=SN-ttZhi-N|bKJ-I+srP6mr!wDF32)TmlR7ZDN=-{@Aeg**@vv%C0uLQ9)
z(K1#B3`;g~h1O=I_1^w@p`OwbO^E|}{n1-sE%a^@t<Kw`QXX_Bbxc9qrEa>{V=}+N
zOHo<Lfv#9M?7kdiI71>&j&s0+Y-(+t%-9J>l!2#d(wcpXvvrXzlj51``h5vxiaFY?
zy7?SsXPjD=-d!U5G>KoD@;oHX4tN}}Ti{ijTdA&vABj4Nl5GpsZL*}ai?4mLC~&&C
z%>G;~2%qjkhKu1y;qG6#ucZue3Cu{qJyk0J2L`K7kMi-0Ux){5p^PdU31!?{+-8*6
zajd(%G#2T_;!vfphJQ1H1gS(35c=AyxuH+0ItuSkeZsS#?IC=E9syH9hOAjqKlKjv
z>U0y|xzJWbuxoU*Fd=?xes!-y{qduVZ6CYUvE|s?$oRJFiBGW+vp7exb0kos1AklB
zvCQPXzHb%lQBW_}i`Pv(!3Bu|L*gLoFw*Dj+JZQ#>pP)fK)M&!H8bIUJc!C6hz!u(
z9k1^;pU)?8QBLXBsrggYUTnn2J-{OC{Yx+;t?xc??TSo*#W@315Hi&LlFT3{9ptXD
zS@UY?UT;*v#ztv=ah|S7JxnC+U>vKWTHUtyja_bZ&SRe^Br%nyQs%&b&%AC=!GPkv
zbiNXaBH1C@@o}VrT9$w?l%$&Nx#HAuYD~B>xe~`z@c>ybNw8(E0k~RU;=mvCDs;VD
zRhG9P#dAshWu}Ut<_>X1s^>Nhu+NJQS^l01Tq6(URk~{9v6VasOZfn2wV=!TUr$^c
ze$i%qDkYtDkT`2mz-s}7W<uz!g#IR60oQD?IBxJR2ZCn(#7zenSN)D>!_a4gtBAv{
zh=Y`MZo{DqafPs;pWsTzRwYE;>5(%%Q0{3@O<KXskids(6aG5G`6OIf^=<LjD1REK
zhASndmgp_ik%%SskVoH{B-p=$7%`q??>N=>lFD4!5p@=|a|bq{+xCC0NE>pO^5=Dt
z1Z%WtXwEqN`Xa!9CIm&@u|w3XCE4mL@_}L<b2Ai)Z&p}KdU7UaDuH)2$>|5m8aBu}
z{LK{r$u)uTi7uHv{n|4Fs)*J)$vV5%ShJILy2sO><ycDzpxFSpmVoEy>Hx4a4A|BO
z=*HUX?l^LQ+>4egO9rw{=F~Y$BCB7xI=<`Bd=TAr0Q$-mt&^Oc^A2^3jEUu~DtJpm
zf|51JnrfSk)(J~y@~$&-;~lmAQ4fO0N6ZsOp(TXFGe!O-FS8kY$R_FylxtKi%Fy{r
z;bnnlx@exXBj!(G@~n&Eo>;q}x>F?gfWqS8ws0lIWzjI5?zU{y$#`E3tCcz;WZm6U
zGoW~${3mxHhJ4Fm9x|}5w2rZ}oJ2-<&s=6_GOLTcW<l2R+9CdsQL8fd_+{2%+Zzu2
z-o0k-lrD(Y4*K&~>Fk5m{=8IU=MfX91sZL`zP;Aw@sz7{e(`uF<MVM;vw0JolEbA%
zBFiF4bg}iX&Q2PE&Y))+(ky4iwMFF@VXN^-Q*R%xmlIKYOdMeBC-1~I=3trQu*r*w
z1}~aQ&dG%&$>R@03E}n=8LtUp*8=V7d|VQPi<UpY41bJ8GNMjoI|j2%`cg5rYwe19
zMntDrU-{liMo%=i_<N_n?t~u?Injq+=%P~Z*mOoX@4RWsRPPYGCJ;XXEq~&QeTEA0
z4o_bpw*zt)Y(Aq@-Kdayv$x8;x)vsj0#akNhM7FTx6EV?ev1~Wu_dxCDUWuZI~Kh%
zU7GG(!^C0j7^l+5G4g1Udh#leo@zk3GI>yTq1DC4_b>)`wwXJh_N$(ckKWqg+lmop
zZep-%DYLTCc6_vb`O%a2(XxB`1_!?~7k*$`giU5c*%7+e1$M28@;t`lxysRpm;=Vl
z3q&cB)65%miAmo7qBe}Q9nZsX$y~85%S2B4Cb?AxbOxbdY*u8A?)R6NB@!TqIR>2e
zCIC0nrJ3uYnlmY^9dI?y>weRN?e)nsJr6kr?TAG}Yx)J+1f`=9ZO{RC+yrK6hI2vY
zH?0(D?ZnMd2FTrn2;2loVm)HN5dhf%2|uTjm2Z+&YVGEa^orI5T`Lc*>1$asTH`vK
zb0CS17+Zoc&RJK6!*Q)Yv-!;`(b}Lu>WDi_R=r<J_LdF&W!57C&(smke#(g1+3t6o
zrJ3zpj0C;N#!}}sOjJM~b%GP+1mSZbNd8n9VROnVYb50p#VAF=5^r6gy{_*nW9e+^
zu4seivSOWVv#LV-wL&;lnPEc(dP$%%Lq0&AzH8F0HL40Qhl4%GSs!#Gz`Q-ZjC3@C
zF@z7b@6rRd$uzYfI|II}#^WW5(PKE}?kQqeja5wW(x4SrYd|k$IQ5q8uFUmD0jVO+
zaEkL#fqYV#Wt8lh_AnDQ0orPf>)hh-X+G3y8uAQhnr8OM7FeXU#>mVxv)rIngY5uU
zB?eEyl^(Auf~49rIsXOo1q|~Qs3r`L&u5BI&=@wy{`{&<rR-OFS0zyjROR<j>44k&
zkHuh>-GPxC900%>&cD&tU;htn{g1&qm2gEQRrH@~qIDzpJS`1Pp{8o90<mUl4Me4(
zC9*JT2m#IO1gi0Y1}s<ByzbkNp61f-D}7Ey(SSn6FW`4k=XdW+K7yf{wDhkX*RI>|
z9nZJZ-AiBKHGf`|Cd1r-FE)gJmd6RUvfqB*Qjg<oMSLPz;h`AVCUJ6hAfoDXc=*SF
zprdqUdu+J+cVwHG3G`D#kf5;W@^lf2QPK4aY@2wod-Pm2dyrWMf1E&M1q|u>jS~1N
zfN&BS7NA%Rb<r_&V8Imir9$-?I12j$rhii&M!|>*n9bBFJZA-Ue3M(NT+W?z#mMI_
z6XUa;n=y6-F%zq2u@gaEGgA#-#?KX?2C>i5afWb>)-4P^H`!pwp3A5@2?^}wWfNdk
ze!xodrevniW$RlH5XnSWdUk6#a9ppkQxfybVA!m<h!Z3d*=Xi~1lQ?rvV=xcrRxpc
zNpUY*a*}5k)EXnbSJ}`o5SSa(v8OtPUS%aN9fEOIQW7y+6q${>#Hi_!YGLH?!8HOo
zvPnMM%qZ^hT>b8yq!`RN1!*Z1+#~0rzJtk0zR&7=aO2+-?jpKl(22jV=(BXw9>D^#
zJ)rh)y^rbZbgSK(<=<?=@qf7o)cleg5e3SAO$(O=aj_4|h4Kn%WZ*%21v&+#*^|W3
zh4hNH1?e%q!=Zulij8FOL3l;v6<0guq+_Pkz7n^cq5FbjE~{2*T4`zOG##K-vdpBo
zW2B*f6%JUU$fv+m2JsoLirNM788!Cj<wHR^7EVHt=?p|t^hlVaNY?EBPD$j;u77OI
zk(D%4D*T!RE=t!ho<m+zO<*dUB#qk^PI#7DX>r0$8u@NWKyBClMx9(V`;%p?8KJeI
zp!z4Zj*EL*b5MQS{s{!jMnM$}Svt<RmC3vzBM&c>X!flcUq^7go~^1q9gw>7s47dm
zdGcgz_QruXxWT3RNJzB-^>p!cSX%SY@NiU@h{6P+RLzu`u@qj$f%o7z#GAW8GjV<k
zaC82vrrjrTbo`kpQdDi#w4Rt*hIgjd#~97#CWrUd=S9FmUi7@svDSSYMzx26T~JWY
zd(7UdbaqaPQ+jna%TV(ic)iM;h<UcoJYa+3NC{uEVTbSftQFcLa7Aum-W})?jWo`X
z!v^cSZfR#KzmZQhK&U%q=DzL{7q%z$K2Zj_CS$N8e#R~86h_t6<O{~i##FJtOWzf{
zRIW>Y^zPFf+I+ogrd8XsxTZ=EC6=0;r84{nDU`djuON!jtpwLNouOKDY7k=g*<@x~
z4~bjj`f;PWAhw3>F1Ch0Kwr#>dRz7mu%L!8453=a3Q)ny61Vb19;MU2Zw)Bm0RoXC
zcDRP1$?uMffL?&`K`z3QnNln8jHZTrxS6po48+~=A*6&)kuElavW&QcB4zYqzIUuL
z2prO-AY>2K<7eYH!Z62B*oK6?E#bP$qui%`giqW7uXy}rk#h*qFYicqtrFFghdZd4
zRV~47K1gmAffqZor_=hzs9}Bz);YQs>evyN_Z4t-xuIxivkAj%;wGi720v#aYU2h_
z!~pHG5uGYwR_+z<q*<Q?oIc1$g-35Y`!JVVjfk#5m74{N8YNs;yZQ$;T?UOviU3H7
zJBWSJ@J>(h_Gl&b_IIe8qY0fsZDQeJG}wTjWHGlhm!uGLZvHIp)<PzcOE&us8_{#*
z>eBE=SMhV8<H_nQ3Z;TK3Kl2Yd}?k`CqvUbza|&3TD?VBs}le2&hH$q8|xWENpCEC
zEY$dtzF(+DQp8lTX1MeU(}tGhC8!k)W_=a(;;>VCgfL}kBELxV8Jj9Md6l^T%K_PZ
zGN?o!6aYXP>fZu1>|aO!zf=$Z-KST!{(BFp4@=jTNqblEZ)yb)D|$eIvq)-dv*bKv
zWHM9<>a~l6t&n0#0asSP<&{?5eBZp?top;Es2Mh&XS`R_rBfRLGa#Ig<1Now?o;+t
zuG6jU-tV_-c!1Npz;Hk<I(x+1jJBXj{YS&CArviTf^x%wpc)t_EyaV5@RvIu^h7a?
zG=@8Whu68jrf{q@db&zE9)`Pmj#-Q})_T88l4~@SJyMA+hPooXl;!=Fi0)q|sIF38
z5uF?=&Q<1f)lUJpr;eB&CoI)CmbClV8|_vG4%-jfl-H#Jn?)fbkesF;tISKnhLo5W
zrGGHW^POjA#)Ah|I-F9gokKCV6Tcg_9+)3RfQN+oTeF7}ZhyJ3|Hz$OjV?%2z$|X;
zq_j(oYs})l1~0}mZ8fBrHJT^uK)XiPJaVOzlV_BvCB#U5FbGx^d-Y3Cnrj~au2R@2
zr0D5Whq-u_+QYrMeAU{6mV0BFIa5Om!>6VT_`vK4u)>L4PHm7zu_7hZ_J=9z13u11
zS@WwlRNTYIhSg9KEVJd)gO(y^LRgGPTNBX;q@Qa&X$<oOiq*UCN`Z)>2Sf|RTr-yK
z6Xn+f?*uAbLlV=A-Fmn22kad(^r!bCzGKdT;2LJ-=s|gf+pTOVp0H+Y*qMHkZphnT
zqC6)lXCHx^!Q?2YZ{N^Z-!Dlz9+yN@Ha!2$z%Z?St}>|iST<Qtwq2V;0GmCUZ}$sR
zGBFSTTSI>$TAyif7SCu+#Zp*J^rYcigs!pi=(lDa_xVlPpNl`B3@hpZEf3+s9<Q!i
zoA7#qERNyWsypF^*lRJ?&JJq%aqX$*mTr5<UC|Xsa2>{Wd!^Wu4-gv5aeU)))$0pa
zvYl_$!jj4K_As2H*oMltZZ4A(62S>ob-L{e8-CtzWqRy7(w-9TB!-pPV`mi&mOFJ_
zZ(Wpu^nZX<+{<q_Fia{Y+|Ija)pka@ny1UIMUx(j1gE8Nf;cM<QfqT}sr_t4xHTmL
zJ$o!BT-`XPmA9E;y8WId_0Ws0V3N9%=wXtjXYqqLYOV)`gP!GCc^@e+L?g`DoGc+>
zX6Q!Ln?UJ9C~u&<Do;5c8$1!Cp)I~}-nY@{4upfk(P;*%2BMR=!a1e35J^x@r^P@&
zP8psRgS7!kG!|viJ>ld-VwqC!38|5pER{c60{yOM?T&w<2$Ao-v*bQvA_%)9&bX#p
zQ}M`z)qrOTG0^7v@y3XLI6B*+NYP7`yAnQro5R{OD{sWJR$Q<IW<mzpM`z4O%(7i7
zOXXHs49g*Ef3T?!m2bpICA1@V&<R@~ILmif%G)3qhmbWc#VE@)7~dpLXyOa+P!*Jh
zEpEMhhxO+X&)%b!Uwt5bLEmFGn*MxyqnBkSf>Sk&x1yV2aJT(c>a<P#)QAZ13(Wld
zBZHoXvc#nU0RX`KS7G7b--7yo>!ANrQRuC(X|u?Oz?~Vi=6tmTLY683YMp0J5&xJT
z8B{=kUkou1k<<E2rhQRU`BakktxSv%2F~LbD=@_oTtYUSBFf2QIx~~Lo!i^<15g({
z1H`ojwRhMO%L$lLcXe13>xrwv#f4C|>8;%K0W>ccbC&2`yFkBA3d5zWv3?3<e+txa
zFO$bIrua(@n?kylG}O~b#DVsZcVC}}+$^sA$WOsPdFC#VD~0=Q{`oAe>H3<@Ym-_s
zpZq5}zrgOZOlns_q+u#>+sojWM|qYD*W$1t=_IVxCD9~w@hGR!%fr&3MHq9FAk}Y(
z`948F+H@DB1H=_}?)S!Y+wU8sX|dK;kiP8hg^a1+iBdEmDW`94@e_oSB6;+Rv~vth
zDxkopCbOdS^%R%a8iU-ie}ES*f~43ZEJla<NFZNUZ(iQSa<sEPeNEVd8OldZH>kot
zydHUWfe=S+aJwq*SNX=C33RFp251qSSbO=LdJ7yb*32BL2Bq`I?Gf)Wd|{UpcF%l5
z)~u9!^Pg?~6MH<=`;*y05l2^yL7&(`rAxF9s{$_D<TW$~q+2Ff&|l<udjH8TjcBoP
zO@IIZKS2MtU#tJmrT=&JuL|j=rRw}0%T)Nn<dbk5Zlu{_6l*++JFaj<jiebNOf~Fq
zB-Rkvx)#%aIG@NhZf24;T#p|NK+q&dX4x+%W~Zn`Hb)dx-!Bby4kS+A1S+uxOim6-
zEeVY*5&kyoX^T33Sklb9?V8&7ZQAad<Myo>3$#Wy3RHKW0zh)V0<aU(3VsLI)tKYy
zi{96HXM-~XR)=|89=zq4>;D3VAh!VUEf)H6zW$N?t%Kr}yWrag|FSFeSN0kOyIFnU
zh1?5FgWZ$8$H(Ep?#taLB;lz5;wc%-rMv|u!L1q<d~FL4b$&nsgL>z--4o#E371W8
zL+{hwLu7uIFaDH7%4NC7P`*zK?}gf{y$=iTmFN9l88Vgjni)DI$(al6RYb{M-M^Lg
z;=leW2=}GCk0tpQZ}t+8?Wr16b$T_$>8Th@<nWRf@2P3DJ-d^}=`lXoB<V3cAP3%s
z)kEH0+%8?t@SWfP0Ly{gL;d{iXL_F%j+gP;3h<4?yRbjX@hKFVdvS+H@~vq7t`5LE
zO6&AW3*5VOTMOhy{;f&;qhb0}*tm=Cw$n%KpWY~YYEXXOq_=!_J+C;w*uBnqI9{%^
zeY@SAdx#*bD9)LFiN++t=;EYHl_){<ERxug=M1-a^9M1!+HFN!RF+7LLUfE5Lsq72
z4yRs=D;XIC=X*yeY3suQ0}9`8`{~|@i}iOItSc_^Yls5UkuDpi?8f2SIg*P>FXjB$
z20IFg8lubbk>h<3sj2S;94Cfvd-l01hQAqyb!Wx7(+d41KsHOMLVHrDCZ6Qld=w{Z
zNkjtm%=0?rW}|DqYaMHHbSEdY+0ab5+YIygkww_=c*Z#AHLm1(rS~XO&XgCH%f)%C
z8JAOkHwH`72nojL$v-YEtXUDqjWxN0<wWoS7@ia|Ia6vBxy`OQ4bF}F9ZhSAryhae
zB9Aj#wbh;7#uwj{_bz+mYm4QI&vWBuB6T!g?DKM_&3w$r-8d4&3P)N=)c}*5&_agv
zoSE8<`h#Ho&v#}@+FZ!FzvI4sd^ul=|D>mJW2;tWQV3}m9--d!Us4yvv4rJ^Eukw|
zhRc4Ume?)CaX_onQ)R_tN=lWZQKi?K(Ba8Stzk$4HT3<Ggv2VEAHWe)V+(E~hF11U
zB#tB+8=`!OCBjIR;>m6#b;*fYHy`d3z;4BING6_MFc>qCOcCoQmMmV5GftsOWmysK
zOK?%wAD4hsZ;;Rcr7IdtSQdl$1b>Eqv1&Go){>4r)s!?fuGWig#FKr(6*GA_ccLg{
zAu=q7Oh~e#H_9f~KQCHrVoVM%PAE;YCxSdyz^_=h5KAS#gp6~Nj9t(Xyc`I~K&U<k
zP3$fyTtpa|zk<M7hO?hah(0)dFI%LGk$0n;B7&&SoOnK$A;XZhV`Oq=^diV;Ce-vG
zxk@7q9hO6$Hy<Y%c5gK36%JhD2<;@jUe+<wRvUDpj)s|UlDW7)W^mt32-7m%r@^<{
zELu+BL0PRGe7e|j$z~q&Bc@HjqFTofMAd<20rurUj9!%74OcP<unrT>4jWB7DP~%x
zP?`#*ni`8vxe{7P&|eqMh%nM>j6Y{hklIMk7h=k6Zk%vP#3xL-O37Sb;Sj)yFdmDO
zmmFat9C2PN9Mr+Fk#8+l-1e-;|Dal@1*c*s3tbbC9AN`B8LxIwJI1TO17ojf+@$J~
zk7;03PAkf$={y~}rjkBzAJ!SCBN{)f0-fHkQ0~>63(s*eW>AA6Fuf_)vraydSDu(a
zYqJKSUKXl{Tq3?YQo1Q}<c_jCZ*k$D{Sj|g-TU%*DUMKCHGLp$*y$qXQdrg_G%QWW
zZD%)b`yrwgx_CB4YMDm<6YN?UE?Hwo`AZS(FfT=$D#Pvty!n*oAunfikkLX%>nrFw
zZeXOK^l<Ub{N;ijUHZtn*+8gTjj5Gg+PrPbi7ByJv?h!ekl9Uiv-Cwu!5$?75&Qw&
zHUfuTbrAuPTnFUXv)+dS?=;#)BKf_k(+p~(y`PbtQ&ZdFbe<mwgNLK6MYW}avFrX!
z&sxH^HD%tQaZ|De+x_~CiNB*_g2h|>l7in8Q%0oGusrJe$Yn)5hcH!~Gb#KuYpX0=
zb_(r0hkpOs$avs`6zT0s{Ka^0$Ghca$}FP;CaJ}uU3q4VL+4{&$VJC&tKnMJ(R-gz
zMlXBPqsA<^hwe;8ir>PZhNOVL^WgZv6&EYwQ|#$ehtJW~xZphTKFyHd^v#9FrZW8P
zQD`Yy@px<e%R>C{$gnOzn6uooSXPzG7^ro0;;GlkMp&swF!Q8`P-*7iV(48eEzJ%W
zwea0R!U957*%u!L65G96)hiRhlA?S03wuS%RO8f<UAUd!a7OYlCSQr?oEvY{4PJKS
zT1w?m_ZVL}=4ar~yd43GGGCU%6RI+_OPaWk#H0>%3p<w<`R;z<R$q}!*Gb<HsjRk}
zo15BKR|OFCsfc|S>touf+VC!Z;wSsbA>OXsj4Wf1c^2)i(2Oglc#I_e`{ThYL(Rt9
zu^`xY%|n@c91?$sVRj?NL7MOk;dU72(w|N<Z@^}>J*-O)^zR#>iwUb}IDS$or+mom
zt?AS?Ua8GTQNxmiZUDn9f+^f@oY+?lum1OsdKp<70=ri()Vn?ce`UTvTp8p!vFJv#
zN|`}MTq-W;!b(39)xm-WZ%g@GHUk5s>&>X+wE#G+NPVkg*&6Gi%Gj3Y#CIjgd~K)B
zklo{H2pzr$DzCz%&Ne^d!prlC1t1MPr@4y4J5*WuImjW{&wSRgH-waZk(@1cphFCx
z;*zd)P{VbXTh6%?PVipa52<Nl_#7VH%Gf=j&*u1!jj(ltmTbYYWi+iF1y#PxTeqT`
z;+o+fz~LgFk)(A=*=3O^)WR?90WP{2Pt!?F@0kX_=aN2enr8kBQsrpZh60!+I#m0v
zaK31SvdsFRUXN7$tlsDsx+c&0z^|~q-`t!*^fNE}5H^QDY%%*NS-qH}_as8(*G}W7
z&A4%Z${1Sgr1n5F;nGqh?T#g5grZ@IB-4(#n1=B9PN<h1ft65aXAjy#7lYM34{D4&
zktaO6f@)Y=s(fvklD;o&^w(UGi%{0NvW!>UYp)0$T~&|{y9!p-c_i>CX1JiW<Rl8W
zRPQ=*9>AeF&}(H6(kNMos@jC0Agr96mJ~+T<$E11L&5<-1R0XiRb9(%8-pjm8=<76
z6G6AenzW>h1g46YtEMZ}^|+;0bZS`lkEKpK(|T%$;JPB_J2OdZ`$gX@eEfLZXAYm-
zV0uGK??2p9<`Ear3?IY~sxUq{Kqo7wE=N3hB0Kgb>{nA^ANtO|cjGpn1%{UWDFx)D
zBH=h-yOPQ8SeW*%%|<xY8gGj%ZwnG{M_^_W{-6-E;uc|rxbzrwwCz>{_k_)!Cdo<S
zP!@J;MvjsPy>Ep1j*v3?q?a4Ab7||puw*O`guQ@%IG?PpKdCY?3jq7S%<sK48r%#k
zx5dVDgeJG;qCD`6n4@Cd;j?5rS~21ELyjC1@rc}XN}TMTDT|2}B5djO^{F#eKsOx-
zH>%|=YRF7#Z1X(WtGT5yYvi>&aJ^+G45hkpdn(q?Ho1?{6}@yeY!AC+x735X?P5)E
zq|`S8qMff3KAy?zFz1>?{=jUW85X%2i?7<tuA-vspBM7ALSaRMO{pw;q_@n{FXEZ*
z@b*jnaIG9d4_!wVxhacpV)~#^E+)4a`p~}pLfW6)YX6YH4t!wGAsSt6d$_2$&x4;f
z9z~DKS8q*3u{->9^NLL9nT~uWA35yga+elA@JyfBn7v8!h4i>PLs7%X4?Y$iQguIG
zwlKMQq^J}{i%w?E+damj(NkS-Ly@ue%JugOA%Cwm8-`z_%Q4>ciMc)wE%LZd?&~n;
zQR6MC%C$2s8M2R$F+WofUbO(vs0y16o}qX<ts#_Ad~SUYB$P?Px^8xbw`<<ie9Ky%
z-kI=y>ANZ(r8Ri8bM=JY{8Gz3)TM;QqQzPn%>wihdGV1U^zC1!P3P||*z7gQ{e*2i
zb643RzB(}W<^yS!pticlC-;$X(;knnj>_+7Ym$uq1bLQQ-HB{FrppzhrP15%I*kF*
zn*gGUCvn&w#J!YYpJc2KVSM1g557*{g?T~aJn|0+T<SMi-2apt{#=Q8+mCod%*N|B
zuymNV5)nZ?Y@*sH{^;xi(_$>tIqYR=O8~SaEp&&=*1ooioxB}pm~|Lc+os%Oxj@e>
zH?IAZcmZ~-R7ojR*_iuHS*NB_5c)8^z#qYyRF_SZee&a%2|r4+M{Ia}?&iL6YWyJy
zulQnL;G{*ndw7aSy(hHZJWL_IqVFG6-iU<LfV(M-mt#wH?gg!=jP%fgwqkyM=BntV
zKkVOIL7(B<M5fX=)I}-DvQQx1WX4Fn5l|;IN4c7>+p=Hw$eiBgzk8(Kx-f}UXz9)B
z`Eo3KhuM|Bi}?visZuFx7x|DeYWolG^2RDSV21?&*v0ra-i7ejF?EzRurN0Kf0?$t
zwd|rCvd<06>Vh*vDGUlel;UYh+r4slxH=s^hM3X)hqfyNO_HXAXK4731su>mFs~n;
zG1s-4$yA-R?Chjt&V$Rx$2(Xbi3POX-BMtrDNT-Nncna)G+HIx3U=48u}wh~RZSor
zQv}~@9C<z723JXQV_ryPOU9SZTcCEAB~t(4n1v=*uJicw37s+AA0o_=B{*d}DR2K~
zjZ?9l@sdydOec{I7T3gAmx2-@q|cswHkrHOrB4z3@ug?Df_%ucNQt({MbsVAEG=(M
zaD8M-?lodh^e3FEk2SvKQ6Mfn&@NQF0C7s5ojvNz(nX1ybd>ZzDy*P=+}CE(B{&iy
zBS4f7B(Gbkr718EQi-4wAz&0Hw^k$TU?D2O)4-N(n>J2T8ec?-Hor9`i%0|gI4fH;
zyaM5Utv`4_GJ^!l!Ci-@LQ}oWQf+A@ij82aj$bMJPWvOOstE^a_m;8H5S}EBL?AKY
z)lc4Hr_zoIBwSx%jTF7|ec<NFOl#vlSoMeg%zHz^pAdZ-sQ1v~^OEXM#f@4S-+@S;
zi=j|GlyQNL;uOvPV;F-nOcYo17stN-SC0K3cl|#un)1G~Nc;%in<+c?-4gu#@<b3Q
z7UE>DsgNT>2vSi`qIvs2*Uk#4G2JG%k>tA(AO(Q?z<2p!j;6He#jfq`>FcbvC(}Dy
zI$FSMeAd`-Ic|3Jmj~sc7+j9@rw8qU?%=c_5iYvJ%g%tc>(RX}@MLwFS>BaR4Ywc@
z&7F^x-2MY9OZfibB@2(mzDp#F3D<FqH~6p`fw;~fCl=Gd?o?QRI<4pE%{O0#0<VX}
z$+<*)7?DRITZa1Kf{7N#HlyE3^57}-sZ66+f3e)OR|nEXB;WXubmBQ<Q@yJRERV8r
z;Sv8Y+RiDs5~p4Fv8_omv2EM7ZDXR9i9NAaY}>Xcwl%S{l8No}|IW8hoqhJjK3Dsq
zyX&p$uCD5*>giv-)#%2;Z5oFYN^Kz9y>Dcy?XXX1&@x68>HjL{%&1XeW5Y@R2)KPB
zTyL^Sr=-U&$33e|Z^~c`dMP;T)igC<#m{ZRCQQ_#wou!8(W^9q0aw=C(mBcLd$I2#
z_jo)ZN$%t?w&Y^CZt3(LEL4*{Y|`GXgUX{!S=X0{Gw!dd%N1V=Ao0k|zX^0q_!={8
z$PuxOFcuRUPCK(kt5Sc-qj}eN9{=g8F|Z~G-M6L`OGmS<?mP?(Cpfx>TdXL?6R@ga
z2$}syY^Q&Ty`3RlUiXjK8~?4?DE~?9e@oq?=jE%h{2)x7VPQlSPk}@-)Cf-_3zx47
zzK#VkU=u8&GxWiF$A*_aCBLHpr_*xzX7sexsgl<DU1g{TdsVAOUf<rZ(y_(8;*XZ&
z(Uag)&w65c&)56yi*wpl&(7Tp|I?=1tluE}j=(bu`h}_nRv{e`<?tyQ;i&n<96tRp
zlUhuYSvMAD@fzn)*Ub>g>aX_H^Wt<0XTONJy>Zc8v+E_as~I2MO%nDe4o~KgCoa#-
zfkot8(`zA^Sq{%sq?uH+I4rl4HSMSmF@g9K`FWaQ2wI#}7ffb^+fUNWF>|CJsjpzP
zC>-s>yIQtPC^w?r5>X|V-7y;yRY#;o1N6v7lxip_H+Di4W8q;oe8f~^dujxv!wIB9
zQ8j3FdomG44)Rr7yXgQv3$e}J7MMDA9`wT*G)@<_QXaM?%3)OTzpipop)h60mnb*h
zmkDO#KyEodKt$?o{4e*I=D3s<7nm=evC;5T6QO}!Ok|<)-6Uk8;azoPq3PX4WTC-b
zc4VQ+-6muq>ai1;7Xh#B7cpVsv2VX@7>y~$hDCcRByx;S)IylqpIt-hSe_@)j45$?
z<QTlMjTwhI)eP*f-AQ|M1L%fZM0-V7oE3mh76^|+MXdZeX7~$@D|$|f7fPd;>Q8NI
zgf&{L45fvh$+UlwDXT3U?DYS{Qk&z_wvd6^lPnNwVtH~5l@^prGo;EZzL%DIv)G@3
z$7Z0TO^_+EISwbaPI4?I**p}NaapN2$!Vz#Bxhrh<14%Cf@ENm)*Jhs=v~VfK}ze0
ztMsi6Gux-!^46nCH}?jm`<Z`I6oRCv?btP2cQc~9_*d61UF{ViWFoO+nLN^^Ru6T5
z`)nP}@bTjb<Hw`JldfI@RyGuC7vVwh_C<@aqsap?cR809SgjlwaoC1GoX{lIR=hXt
zVbp*Au@9}TW#R|T!i})iM`~r|)cXylN@BDgSq-g$q$XQJv(?mn1@-}s_eT<)e)ZLp
zawQ+(_;X`7d34jEvR97Ct24XXZhHH)%AVeq0@&Ja3V_u0isyME$$O^|?DWbxz5PEI
zt%$Tl8ky(>LxrA<2`!s07?THv3P-05F(Zqgi$|<lg&U7B-D$0Rb}7Fj%P@ZedJm+A
zHR%GU+EzCrkx1+~q=!VXbMY&Z2_FJQb53<weMC3qcvyLu<{sNOY$HY4^Vd%)2-+G3
zUDU{GZ%G&=)dfsXfLsi^;AWkVs9hHto#T;!G6CdFf}5JC^i{i-J!*6$WHs?xLbqY;
z?oVI(My9^H6;)dBjmZtCA(XY<mhW9#$-AO1ZUO{00`P<j&T7qqv+9msFJ1|73@3WF
z1<8W}mgrfFT<?v)voc{le<VRFOgS}mG2|KT2~u;{rq1deFxD}wxvoY%|EM?fT0~L~
z#TnJ*X2x@Dynx!CS?#Q$4}uH!SHKwq1#h<J+&;?a54AW}r|e~+IKxe+v}UOp8H1d{
zDV69huR=7!7n_DaXJOy*E^elJS<RIGJnc^WTs>?4j;ZwXOPf}L*9oRlMTI^lF%rE&
zqbS9|sl?)h^RQ0Mwt7I{n0zG=E^v!^quCUGKN*&3bMC0!78QWaL$d<*MxhQrsg6(X
zh%WEjvq^00VbEY#ZJLqvNNp-J%+*~{llvzf*n<%qS>4QtE(eio|KK?-x?m6{DM5lW
z9`ffPQo`Rjc9I@09dGtw($d!yVis+bE^Xd{nZi8Qg}d-)Es`alC|<^i)EtIROL8%#
zl9{<ePuT8yu9|0L%H?&|Hb!Uz^{!s)M&`GYDz@FAbsNEEXCn;8NJMdjJ!BVbMg;1&
zf<Rjx@NOi3r;=CY@EY>-*Fi)BdK}Dl74w_#frE(snuN|i0TN`Z-4=X8%;;@uJnZQ(
z(l-`Erj&IxgJ+56qZ@r*V{^?{T%p${+TF!yRdSKi4?%o~F*KeM(gJ^^Q=_uIROFV1
zOX;w%6M!0EDL*|V8C|B?bjOaBerdrsu44<xp!9CpyHd9>o-S=-%%0`(j=}5Y^5&!j
z(tbc$Z0_lwhHd0HoY!MU@K`>2)9<xS(}*>nJKT4XBF?j>WY)i3cCk-a+eVh4=r!TI
znWVOM;>r3%6yxoXg5K_P31y!<WXh*OKgrLM6V~<+v&lG;VBOXZ<!aeL27I%{Ng%8w
zrIJMjzML5rkOJRiaT7=)X{G=(#5ZZ2`;KZnOoMDcCsFh>W4!IUhH7V|E$iN#Z~HLs
zj*#xyD_*QONdoR1?ly;NXV{~tPv@0tXYh$k{;YwL5UyHH({?B|HbSas2hK!({8>yh
zrTE(7?^7aIh2)SQ)y`}WmD4dJ73w~$f<JHu@m4E|c;Asqm|>V)O<-ap_&t3*{tk1^
z&~KWnk3Ux>{1cejux4ydJ)*|GT25jAcL+Zz@6cH0MxKf&`n|T5%i>nu*9X{^_0Az|
ze%o|AccS2LH02(geh!@!Fx(e*Y}>ZMWsBK|dzhx+pAis3m}fWxeWS!rdxD-CXv_-2
z@n0_1SG~3u^V~YzxxEU0_et8>wGMuVP1-pW&V0w|i>1kM_NK7Oct`28$JqWJHV}j>
z?SNG6g5larf+}`DFkziXa}q1?SDEUcZC1fQ@5^C9{5_52YxxjWq6?i953$+&@=%HS
zD3B0XvbqBEBA)a$62SdJ{)roIXmlH6=y*&0UJ>yXF1zu}ZtM4BVemb}BA_-&&Rxf4
z+}D*MC48)#c}R=y7p!-6dvSC{?szSqj^;$7J@wtS1qyd!hZWuGlp>d_8zf<Bb{}|T
zA{=Iw^BTXPqU(>rfu3zTcT-jn>t|VZX)nL>T1X^I8E<5k1bJh8at_ADm*s8W%jA0`
zGF8B^@u2z85A)Fh#}Qdwjvo%dFZ0`gVcNa~Ggzm=>OUsv8IlYa10PH>aGAXE(|@a+
zzp7%>UYeh|Lv!ry+=2!n^=l~1sy59k`yMXAoj~<!H8M=t$!gy+#gl8ei?M$VQjm9E
z*J=?YMGyYqWb|vv(cB=W^Q2XV62O74Pw8h5N2Y+%!y?bJsI0*|UEu<QoUi}U-_ZhT
z{3h1}z#%m=NhP539G9$JUM|46F@2Gm=|^i;p9ZT(nBkGx-?sgB`33b%F+^PLu>IFv
z%ZHcYT~#cP;rjEZz)C@F@RrNr!nx&i)N&%~9TC1qX(hlVCHj3>GtI^w-6GR~y+2_d
z^>&ang4{l{&wfpYKO^NkTYnOIac6Ow%%kpH_h4nQ;5;L*FOA3e$c6-8fy0Z~s{7`Y
zUuET}dt!r^p<#rLzY)I+SO%mprHWgGMu=O;G>?hdEd!)>Qt}o<E3t|+gSf1sThrWK
z4%zq4o+AC)oHHvr?^$Ug9!KUEu-!@kX|UFaQrCwvJqZ!V^*59&zQY}lp6oWhfKm?@
zZe8@vR<4O<jicvKkFB0Q&G49HPP^kJ-#-jj$LR@s0llZ<*JX72KFUn(>hUw}i~Y^n
zp?92j4#YD}Jp^WFcmq1eVFEk>#FaPMK8G}+eqUU%8RD?NkFtUm`ggojc&9Tl;wX(-
zlh2=Xz;nvr`D)Wp(O_HTmmDUHZHJRk<t`Skh1E@V5X(y818&2_5%$sIbRM=#I6s~9
zrSPn6J{jDLD{Vt=U1dPpq@I-w8b5Yg`B;A9@l?$ys5B$Y0bP$}%wZ;q5owlpGT&Z}
z>pK^1A1I+6-9_yrT8{!U?c57*9(gW784@)C`{!Fn^GSkIT`Jgw(h`;yG6-_F;S>tX
z)GwTg`kLf@n*VT>Ci$f1!}@2pn}#34jOXDH&8&1?Y}6bXzHwVd)cLbNf{ZGeWCfNe
zEfVd-C6z2HlL&8SFwLlHpk2NWqoxWWa)B&I@R==^;z%_jh<Y2+lL5PGedGMHDA5Q(
zQ0mBy>LJmK*HM(y=0;G1wIhv=xTG>8=&avQgRjZr@Cc9_GtE%Lgp7Jwa(%?1v$jmR
zN7};yz@!X9rSJDpdzRZBM7%~v$V2Sz1l!Tw>jM801s77=!-oDVYE+jdRr9CWTy+LP
zkweEHBj437pXEYw&=x<o3{*dilqtp@G*yU`si>MMK00U68Sz-MVJrMc;SM-IQ$}5p
zkXr~1{HZ#k2Y^d0f_lL6`qEk}-ENxRA2-VgT%eefFDlu?11K=ZPJ^1+QwleU*)sQd
zVCR$oB(Xs_Nfp@aOfy2(5NBjdVbm6B*}s6l)6Aw*!8<4>+u_b>8jDPl9~atrjRgH`
zwUyIxuJOB+=sUuHZpdM3JC$ZSJ2Ed1lqUW5jPF#<7^xR&)g)u&5iw*|1eH|eKQ3JQ
z30|1+eA#u+7HBAj4_w9N4}xT(=2X+&ZM6pN-Z8g$rI|H*9gDjEzLgED8s+A2p(k1B
zy$CkLZdaQkUaYUm<di3g)XtH1l&g!>E|EUuZ-X7u5iYQn$3wfepn#y3s3AI}!U1$=
zi-87J;(Uk?>ms#_q&e}g5G1STKqe_acwpWcuvWy668Ie;vs&1TG8W5M{9Sbi>X3?X
zfw9~P+O-J<gtFuTv7SuHcr9yAx&7-&twE*GnD*!Cc2>DT=CI8%MJW11<RxX&rTCEe
zyQqNqYepPCYQZ+lVJd?yDMV_-mgLf!*y8bX3j&kA?dw@W5!Ygj(Vwz9qIgm^fw-}2
zs8~q>%XA6t!>L}fHu1wnv=<}^q3DE-MzS=qH?yUd-XJTllQo%Nw&<6VXDi+T&Wmv#
zZiOCdsvnXO{uy*2?Ciw4{lC71MQx}Iz0X}k-%uGo6(a%=_jiJxJxD(VV?G7w{S*6G
zQqYL6V_3V=j_(b#`}R4$z{Uvq=wH##;)6CT#9xsfPDCyjNI$+mq={V4B$hrGJ8%0q
z7IgG9I~iXFxR?Y$9_B(MO=e!{{XL-&*HB{P?auoHPYKR@1VP?5*A3xvmTW1I3aK$t
zqA?&^d5osG>pIo0ec;!gC}seCC`7oR0t^H1Fb>y1UYHT_c9$s<#fP+LLa`N)Ni=bo
zCtVKIKs*E|T(AI^f_XXj55cUDz4ykzAl&APv|8cmH+WDqxcKhaGUn=ADj|A)n!Ku#
zFXolrs*NLmPYH*T#wHg2)&uR&obQeJVKjc@#(m-GP0v|VOU%hopMf)-T+B$)arntQ
zY-Kizu1p<bz3cuM#64YTDv%|0XYeQGsYq5J{&DZ6IpVu5G;@APN2G(1gzPpk2GK<C
z*tmaKtH2$Z8N@8obPu3^e_W;=B^yViaaj#m)Pe#`VEnv{iP6u$FvFjb&p%Ro{y?xh
zN?97IVzJlPD%xPx=8*HjCu|N)Z9dM7cAL)V_4<BGVp&<!4B%|mgDFXq-S1LxXmen1
zd04nrq(i<Gwq&pAw^2ISa+W3)N}hOO`4fp+=Hd&re5=~btzUnFzs4>{n@VxB_eDId
z?O%3G|7J%Ner#Xx!e^5kcr0skDRReTb1CLFPDMPw&N)V<+c+-mE;AYoAOMawa(D6X
zIl<-n=66<I@4sHt9X+M!gLap%AD5%KT{Qikfdo2*BCnl7zBVWf5B*Q)gW*U0`LMk@
z#6kkF_(abte$Q~wTJSnYcTTma#2MkQ5HoeC#3|vg7;&|z`d&5};Zo;=_P2Au@ckAt
zFPo0=nQ~O=JC#N8(dF<90RS*ObAdMX=a%_WTsMa1lyX!3J)u!1<r`Zr`zsrM)N!Q7
zZ)#Gr95M12jXxpEMN~pLC`at&(X++sFASYgv!y=I1b=2u7P5Sa{ANzvBA9m@d`VYt
zB?WSrk6(OgiTl$;Zx8tB{W-PX@kx|Vfj_`NQY6Y}K;Tp(MN{7#DQSkKtW`jTc;~m`
zw?Kgs@jnm?kRq+;z}BF97GRmXOnk^a6wn$Vqa4&sIM&2hd?MmaH0H)v{7uvwe(a8~
zSX<N^c?^-Scqil@251ZdZbN_^N%~eudtevdM2wb5{lFH&MT{0m{g4)@MT}NR{ZJOZ
ziTD?ZzhV^E1$GyTzrqv~iWn`EU}LM7(|{dv5+;JH;Q?3OWkN(M!EW^l)o_bRMf}Ue
z@lh7wNcvVuNmZE=C0>vTF))tEWOcss#l;E@C?apO_$VkQBok@ARKu6R5)UVwK)})v
z4#=?$zT$O~Y4F=P6k8&hyP)nWaXScGbf7Q@hyqmsJ?6t#Oi98BecOv-3oSz*^sXBY
zfRhP_c!@><$p8=EK*sJesz3_WPmypeSX)LQs=JIVkbop$k+eia4)Uc7#THWLdysFj
zxEPlK#rpLqUooaAAN&|KU-6;{AK_RTUvZNtAMBVgK;~N@fD||jkVy*!&;n=OWwe6<
z*g)og>@^4=2n;v_{(t~kk$f$XZXql<ihSl!PWMYn%aETP*1GjQxtr407#g-^tURcZ
zQ5T2_?O|`pO3fQ`bf5a?8~ax!vnk7!$;dt?E^1Fe0&hu*1t9L}bG~^(Fq0UI|D%K>
zEXbDRYo1gPbpcW2vr60>zBnz&w@BO@nc~H$Q#|}0Mkav7YJs!|d4Zp#0R`j-{6tbq
zKmmyZKVj7Vi7|mf(6ssDuMoun!5aSvhEQB5O1DgUk&ot^##=5*hZ3j(kys#32T2R1
zmVr_MQ7i`(<0~d5L58j{2<Lz(wgV~<F3<p_LO5i?IZ%pkNHkA@RKXhJlD7dCehWu%
ze7A3dBi&9RhCLdv;4qcfs69VJnhmjTTUfHif^1S}e1#;s`0ILv>b8<rw@EHycU}`z
zhx_)uU8Bq9!uBgv+*rc>IJ^8fwePi?{=O{<@F|B9e=yVim5q*mDm@xrG}$KQJI;Z>
zn}M(`N3k^qK0?~2qu7GWAXXu5M~1%@v-XAtyC<D-tE<NCe#{7>BuP6z1SY+G&<MpL
zZS%hMNsiE4=Fe#H!GsAv8daXkrw0zdf}fEQjSG{$sMbWRBtETzH2;0huR`qA+zJZ}
zOp*8h_uQ$qyRDn0>(Br5g=dcLfBd5~PH}Z~gg*8Qj5QFFjv|O60@wNX0uT+33JpFw
zFe*MH&BB7sDLXXKy{>DeBumWEP%rBT9aK(nsbqiWm0pdZL6=U8rhScG%Wck`)i?!`
zuRn1g@l!AF(`Hki+iZ{5-{`kT2%c?LF4*T}3+M9Zny|EMe&oJUVvTpz<FvcI5&9P-
zf6W1Ve2(tgedLTU3i^Q5y1w$~swpSC=kMEU*R5e@-At2LG|ydOF3;g%9yhroz^9`V
zVasQcfj%tXa#M^?#&%-bXPp6Ry3Zn01R?ChSq|U0ugYh!VNoj)l}KDAloVGiSG#oC
z4z|Pbe4ApmUb##$Xao>G&O8k=wMs$QI!7k&9Ihz6+IWc?E4`e#CY`EnHbbnoP4HhD
z&C_xNiq97gx}r!rMU2gHI>H*DegSPTm!>#7VUZ~wA$?c8x^1S^VugXf23((9iq%+r
z21Kn|xn2o=tkwKYHPf`!+nhs+l8SAd6t!9nlAC5`*@7&-SGiKji-V6|{=AqT1+Z>R
zrEbm)nQ*B;WbK5idnUC|YOjfcm|HbTO5QdDw_Mj`l9Mk(&%$Qe2D)acJXUGm2D_!I
zS+9f>zox{UExU5Td#_EjB$h6Rs#|IG6zLDeV8-pDifxmekru8~<cd&%UF8y~Fdyd`
zS)ZJBMYCi{pxhQd^f-o%Oi>dp!*2<WC^dz!8Ulr-q6IEwdz&t~lZYi_%~ONW8THe5
z-@nC(9GyTWHIP|KZ|MSM;d}|cp;THGAXHAf5|HxV$>%f=OZX@pJV;ETV8c7PX1DZQ
zlR4ZFhr;ggs+AEoi?oXFTCJ0;k|<?^_!ctnZW^#;G>!U9uF8Ij`V+$jl62MjN8C-@
zAHAJ=Tg$gnb@&<1s;p!55sq4ergqEm(qa3|%+zW-qlRQ|pBj_7dnrX?Qf3SU+yo{u
zQ~9osmKoxEUBM}`HgX3*mI4WB@H}RXEe0Gjt^Tz0kW&N1(pXF<^1P+N%LtTJKitoi
zW@+8+na-$|?roEo^qEtffH?#7^KFMP?eAHTNb{)<cbNq=m{Dj_FYgIJY}SpW+r#9^
zZ3wq4kYjykS1bvlzFKb1V7e0fpG`+VrlM(8*L1|~BW6>+l?Z;iY;mob45tr&6_=h&
zgI^fU^w({2>#~HmC$FeNIm<xz%V)lDCy<3#mKx^)HW8quufG<4QZFru$Y~~}9gfVb
zUkVh~XRw#|n_IQW1pkQ_y?lwBMfF|p=!%LS*Rsg=y@Ts0dcM2D&xgg%!M+|sD?ROQ
zJ#}NFCVfq5Z&^a3y%YIr;!#~YBZolTl-$l~hLdXpTpJA`3nN0bZX7Dxdh{Jh<HQG2
zmXU+%+heApzl({f^%ODdAOZ4nAwGKp*|KOHdT8xD=p0ZZwh96WZuL{7S8PPJw}I}F
zUrXb<T*~6|7TVwrr1d;prigb5=5Ej~Puk%!1sSI=95v-Pw)CsqU%C9GrG;S*&!tl5
z9HF=Pwj{V|n#Id<)@IF+QFREP$YutT!df$h`bbl^&D;vE=m1ShJ4ILLJb|!)&d?vr
zAg<0FKQ0P=Hy}GR0iw%F@nCAcHC61~YfzkEyEH*68*;&Yz5mIz&CX2ZCga3q+Ma2s
zfB7QeJvkSi{fsS<t6OG=<d)I#365SuIeJ`Y8EDPA>Rjm?B&(F%Vm@AtZ5yRco6cgn
zj7OJ}aB1G@z4~j0nD8n{$z@vg#~?jIhLA@iOTFDCiV|2UCzDT*9PKdT^neP(gm;FN
zhnZqo*XfVFR{5|kK7S;ub?O<0Ll(9wa;vf3_NH_MTfPg@*40xErxh~0$QdF+zxJfG
zuq9b~SLOm9#{P+BajdBGC1uE8vX{ReG8`Co-C%2MqJmUbLErYb8!qedke!qp6>6<j
zX39GpO0fWz44ErD4dsh|95iMhYGKAMCI{9ADGL}BRW)Kh?w!O>=g+*-!WWna@k(Tp
zoo1>i1^IDZ7LI*9t)4WmY+^s`s)RAn6JnjMt2dCOwzSr!)c_lEKV@3!0U~9vr>lH|
zG+KG-aguF>yp6mWnwJ$0rxgf-#fyXY5lZn3=Gh72&xF~J2~2TF6@%G3oZyr8P<B|}
z24&QzvO&)!Ymxx(s9dd6yqw&U6M%QFKlvcyxQRe9OH_{05~vLjqQpFZ1$Y(w5G@cs
zyJzbuJiu$1|FKyySH;&ORd;?5^C4Rxe18A!wMxwC?4H|OzM#$BJN$FzwZl&<Mj7kL
zieE~yM}`5b@wdaBUGUqSWy2C$l-SoC$PfoQK59K@-g#;XB<P)|GNjo=*PqfJg_>W9
z(uI@8Su7r<z14Vjtl3t5cCY*@QV;;TC;iYbi??`A7uqY-XKG*MC(n&A9NAi&e2J+l
z-+lf<wU^IZu+ESnRNKJ|Cx3AJt9{zX=O?=Ay2`Tb=ycFP6Pqm%i+5bUYjm3*M}1R&
z3ASns3-Xksn`CM&9W3B?B~aQ*I3HUijKbOhf%;va04|Ewj!1bqsD`CksFB`z1EHjU
z=R1~<W$4P&)C=dGpsN2Fa0P^EV{df5)BU-PMKNKbUg$K3X><NABvcHL4ieWUC;~_q
zkjFb4b}ge{u>LL$Zz69N{Co8`s&ldj`*OX>YTCVRsPLp+-`t9%AAJowHcWt%b6iiy
zF_fPZK3`@fr^eqY%@jt>&BDf`ti9roy}SKGP~gTk&fed)L4)ApwUsHszx8_%2{BI;
z?LU>=Y1S$ZRy|c*Vpa&v2_*l9w-#Ws7qFSi`mF(++RO+n#^Z^|ZM2DaRleCe;*?!m
z1@sedUAFSAo&FRX4MsP&FGO(Tjc5DXREIM3XeSspP-a7sdz&+fZnE9@tu=-u-G*6e
zX&;XQja+6in69>D*Wf+n9D;7T6U#W;soXRvZINUAT39{37ACH@B9W6UH3k=|0FtQe
zO->(Y3glK|a1vN(#BWiP!?NC+qNJnfgD~J5O+)4M-P8!HCduNR7e$#@mTYR){pmIe
z2+ts&zhMpDyIY4={L9&x<bYH8A{dsZ-{RZ^7(e1VT|=6(s1kIo%Ev}_65u-mQ+rv8
zNq@g%X?4O;=OiB2@QMr(5-%uFZ&CWgd+CR#c6H}sRlkkNHqWMo>*2uV89c;B&qe^8
zCyhX*(`#%-asSPD9-Lm}X+!HJieXcmh8bRCj5a<M>?M7<8lU{_pwYpR2%V^^ONTCQ
ze^aKPLwtYr=#g@ClPagtfSBzq1nGO+DM7lSt=D4;IzBbCAH*_#2MoTdQ`%67x}GZv
zVuJLg);ma^sYx;Q*Ps@UW_)%6Q&o7?M;bdayINvfgK0uL9Zt+^N%Le2`A3n3jw{80
zd#hxz<=6<j8zlcs7F-1@NI=I?H;A!NAD!KfgFi-xBr~kUULB@%GlINfI>CaFW;_+f
zy+X;ACK3}Gkb>86#j&YJXrvW+&sn8+hT%?{@pyT=7p;4lG)k0fL8W&?3O!UyEb6Ae
z)XOmD0}h)*pQR-i?>8iuGtq9!bYL%Ag<dJ|#ezA;C?Uh-GpI(X`gDd8szHFTFPDVl
zVY>$B{?d~`IZ*RikDVNs>{G1N(SJLi;l7*$`ptlw7$u&oyy^3Oy2k%TRkyV#a=3HJ
z@^+5W)@~8%d$mb;AA4%&tJ1WT3$Bvk8I`9FQXFq-UOPD_F6p4q#)oUD5MR=30h~hT
zU${vFk&gr}uXVU*aZ>(vw}}gNuBIBJ#Z5aX<TqeC1uFDU58#cz3G5p}7yTsrY#d(D
zSOhu6ku8+~-N(Y*47Wx_B;GBzs~s#kd~`cXC{<zzf3M9xcp2-BbHh~f&*(vRMLjhp
zG<n>(o6MsYTC^l<V)*RWnlND!Wr^E~c?-ZB<c6fD{%I6Lyh8Ve&^~X@H@7!6erclY
zH5|Sti}#c>lqigN@=2ZaKsbw{=P89`h_?ocWkXwWWR`E|^&duNVfq)VNv|q2yH8Yp
z#yZ=Hy==>rxi!ILeSomrD79YEKwhhKPz(yCH|Ag$<;z;qAYHu8c3iU8gl?~eCNtjS
zX|sUp-}6MrIk<WbCo4cr-iDG_2c9sJWr-i84f`PyZDLVj3O(DXy4`tHwcjGTz4X~V
z!6y@yve{1`a)rN82p(nWQ(s@~6*ePS?Jk&s5aqYq{l=A>zb`VJHXePoU3>X?ujFRB
zlH814w?lmXz8DQ%bPz)d#7heK2fgj~lK`8bJ7}N?&J8$rj&wxm#||iziM+71XTY*^
zHy1W}Tn)WkXngV?NdwUSy!vCc-}6X46tKk2*RsCT+7#{6L=9?oa9?Sar*t$4%2nK=
zr6L!md&F#oB#Or9?}R7%$2^snAOsAvnu3+&zN@ux2vf%u$!QWzdMBLE!?4Oa%iq1R
zdZES<{qp%BDXsQUyclKu;8`isx^&-$sbRBz1dGcuJ{E8jJ=)&fP)SI1!k<(JWltB`
z^PyV0BzMtau%YC$i6`KVFaNp@N$=>bCe~z7_a|5;QY_8nv8owca}{u^kUQs(SZDYH
ze=gs`b9{d=<iB(|V6e_T>z+8t9@y!Q=W{~+)QNM=!aB`e)|!us=wWt1f>TqMxfWmN
zd7JH1U;nhrPvpmdgPPw^Y%+DIubLogFZ)w(2Am@Wi)R)q@uju|2_)z_N|M@;Jbf;|
zo-+C7;wr57n6HVZ#qt|WD^dDNd;^8y@8Bkn(#>hf>mV*8T$O}S>3aAhAq~wkY<=g`
zZuIyI?QFT)R?APYb8l3lQ^^EtjpNiU=Y2JUSbNrl+Whaf)MtdF{C0%Yrm=${oqe4!
zZ#4gL(-)ZI8y;9*9(1qrBj=n+S!WE`GFZv<czB(_gL=40uTgvsGsw){LA77?NGAmu
z9SoxnJa}y;(9~kzVc%%iqJI*Y{FSc9xiS-^T@#U9lfiVxR~!Hx4&W_?DK^7ofdJ2^
z5P-Si(_;GFvhV1YwjTiY*0~F~Ic2osQPcTFo-8AgbR(%>M&hV`zZ~zOXI#)`+<9Dj
z#Ro%CzA?EHghUgL9;it(GPyAfq{OwfBlMXe-|^g>u_h!rGhbS7@xtrMH-24e{s}K4
z788nh$(|T+3UEuT-kFYuXUA>~>OWp`A<R1TrfNcc!|a%vI9{vb#3OAKT@VqoFy}LZ
zb;cK0YV!+#`642_G;;#yHe*Z6w>9`#*>N2)rDRlRtp$56qPFjDz(pW1TLW<1U#N$~
zhU7_Nw-t-3BlR71u69(qc^KK-7}lBE*yI$;GgR>9wre*#nk<q?9H*k;N|L0dYJ!<>
z_>^ZolRjY*t^F&#Dq{ut6TI3IhXQq3)(X~Bajzq!?U_DfQ1{79o){wK$pkTabDFpM
zQiL=B#_h5HY`75om!9>A%Oir)K>euhSqyn%d77#e*7*p<gNgN?*2c9U<Qmm7qZ7B=
zRv`P{(W$~%E3Ucc=4k8o?2KPv&Kt?wo~gpoX-z+7`R}Ck*fJjZ++zmMF!C?m>fd(?
zN6@8rWD4Cw$wac}?0JgRBUvPs?X9COGblC&s(*Y6>LD)3dp;4|{4_tkV{Wpee@QPU
z<EO{1)#%WyBVaXm_MY*jsr$DPwj(q*;~$U&4EZIQI*ESL81^?II^CUZbBMxwjDAsW
z?pUsGn@4xg&W$cuFqw8}=4!i1M3B!!AG{w$z62+^z8w746EfFR4{}8xl@2A)b|p|4
zQ}j!rab+{eM#!zZiQ{3yOEhUD#3p8|i`R*YR}EHH2~+;p1<XAm>*~=(48uX44*1Bw
zbM48fv0AH^E(W>k=L{}d7d?cUco?#BS}8m)U|nKt_Y=uTX~z4-+aa^#+f|J+9I*%5
ze=jM1$kW0~9!lUHnW4|h)1cNEocxisOr~B)WV9R~I$UI5GZq8{8@uT|IKs}+v{#@l
z+Hi>HDPZO#-kV>>fcyH{L{o{-S-p&~9aeC>-cxvslEu{$_PdjFD+WrHAbGt8ARnA#
zn)-f3u$0Qq*|J5A$KFuf3MMf%eosn{YsKuSb_L_U7JZ2|im?R^avSdKLs=5-qylHm
zTcQ_81vLv}O3CBtbh_oR)HpYMVGKAhrB$)178yo-xu$8%Ry}tuYKdyEhFlJWHka5A
zNVQCbfBqGjkMUdcLhYSA+CMf*PCECY4fhqkKzj@wbeAvLBHH2$+z4xKzKcGtPo-`Q
zYvGAIHsxj9T|QZWU{JL4j)8N21A<Y)gCnp*;oA0kQ+21qbDPj{-cH=v7P=*&Ybewb
zxBHJ-zY*R|{%l13EAG#eVChhL<WQQlF2U%~y;B@n-6UIY@ppi$LTq35)9L0(Y@aLs
zD=lU?{xRP<qTDecnH_}inK_`#lVop+&E2?cfNA&4fc@6j&x6wa{J-Bsj}Tw08^-_x
zGa~=bS+GnwvHvFv_U)fy>u73i>BemCU}@^gXyN4XgPo1Z`G+<57aZ7Aq>7R>G6Fur
zKi!aJWhB)8X-WQ7;9&l#-Mqc;|7oDCMHNNCz*g3lly%ttiSYoEIso;5wp0&OS4%Ka
z3nw#664`&vp=N1n;pH-JDF6lrmmn)4s^R%(NLx0BKpXGVXt}E7$#RqZ0B>V0?prck
zBow(bnKM{|_^+W*8C72~F#~jK9ugNZ0yOJn#AxLNvR`NjVzPhXsAWh<c_FYu1ap_0
z9<~jA1belY1sB<kend3-dniBX_db2>^a<RoTzv+b&mv+@5)~+xlS2*-SrL~&5j4eG
z*>`jSj^FiF*FxCz16B8&;D4F^J}ma|zhQrWE)yP*@&HaJ<$fc8y=J?3ljfoTyWs(Q
z?Zb1(P5d4Iwxwr2$Gln@fMn(c=r<?wditEW@%R<1-jqdXy?@#@7->5J9jZr!EZz6H
zxoq#Gao!^Q()$De^G72J_$H9?BgK*D?Z>MJj7SNvHe|XcC)MNbxX$SPcG79-yW5pl
z@0SEvm@Tenrfw_ph6|h9CPcC2AO}d9mejVC7Gw-LGDJaWNY}o$v#!_ecfR#~OX-as
z<-{)i_t+?r>8|V;RD5aj?~yZvks@@EqACrRYK0a%*a8O{4EUxP_^=x5_o}TLyo3dj
z$g9Vnt>3<U&$o6AJ{Gj=xKGZmUItOboTgaANsu@b#;X-OR-;E;6r!I6CDA<Bcf1v_
zhGm|WAQwaKIuKw^bfIkYF;ZONFSag{i2biWWBr{DQkHgx>U$tfC-7j1$QK+Ml0T2_
zPM8gT{|Ujq=R<0E!BIAl5HYpw>x#>2K-0llr$s{pr)Cuh2;{+*v7rhQDCXbpd)b@)
z4mxH3^u(eUp8^{@ox87)R&~ybpl)ps(q}jplgC(V9ZWiown0t@NLQY)ufUp$-BI=8
zu#5pC)E%~7JVATM6R0s1m&+4JZL1!SL>6EY7$SH$)Ze`brcaG;obtTHqU*GrZcm_G
zuq=NsWstgo2YFf`=E8={>kz1?P({6C9k4F=6T=Jd!7fuE1r#%2GG_~YtOp3{yeTD8
zG;ln9PD>ILPqWK7ehbEm5~sAHmc{rXMz!!hc3&3>VOxDY#F@C(2)g13JBLL>ItO5p
z5xfl@noDfO48nnbL*`|s8Y^)<D$#3jE)~SxP9lN){k@;8MfRM*tPI!Ils2IP4Sv>+
ziuBkaNHT1-(QyyZ5s_J<(x#{ZFZL@l2#gi!FQz5G*6BD_WEGm)aUznW!YEY?gLblm
zPk|Og?j$%IW>kZt3eWH(WQ;xaB(0&^eyJtXI!Q`24mWi&m9j4N_xTkjyR@_*sn|W>
z99$q@0+eA%C=}r}8aQ_gCMKyNh6=3i6uN<^UW!!(;IelG%s!%cq1WoynPvtOQwz-Y
z9h0bL^8|011U7g1^#F^=hO)D3LnxbD5T+bY2@Di;#YdjQ73p<nL=RdIS5aVAhs9)c
zFoS4@Se8}t`9f@s+>scS*wLtVb?=uvx7M9eHgFscnsiSd5r=wSTY{!xv${xvb;ghf
zakS8CLNi|{q>w9d3q1G{?V`rdlhjX{Q9>g|osrEvQ<vv_@Vjmy8Cqow*vy@usGP9i
z$q<hy6`EH<oP4oD*|HpbjUF_0y29}b$W^3eJy4%^kT~4=_)O*z7LB3G?vQnxF<H5l
zMy|6$xPPl<nn4!iylh&@UZvvIxBy>!)`=KrscAV%>~RbY)5>CpSR-{zE=h${*cvG`
zUm#;y=lJ)4pk+S}??4Is#{ZjC2$Sa{14Rl`xOn>q(cF2F!veh-I=?Ts;(Qb74~ri_
z>_rwsueXDM>VSiVCZ7d1`^Y#qwaQRd6!E_RZ<dT{DT{%^L_<So1~nOxV5Ic2OkEue
zP8Jz7_qXddkNTdjaG@;|nHnD{)yyn$7eqY?y4KO6WfBCxm+?O%XP+RquMD>wYrvZA
z1R!@60s%LZ@rO|jR)a=Wp;5iNSWvb4N9JreKZ&F+Trj*fz=^QPD1KYH5qVI@S~9fN
zw!ofxzULuUKWpn!m^=JqTAApFAJ(WWiL~h44k7B5L9TsoB8#bnLA})1YPoM#Syg@I
zdaa^n5_WF)AL6s$dEll>Gn2$8LF=_@%%moK1ofYFsxhc=4jW7&*t*G`IWw_+y&r?7
zeP7&aR*K!|lgTtsQiJ^7iezGGLibYU?UT_NFfy0`{yn$AQC4Wfi*$uCq7kU&qK%*L
za2r$JSqusrrZGaO=&XqvL4Hu=rFs>o079?awh~0p5XxIntkTI<uAKPm_6n=L{qn8G
z6z`_M_*u&6uf_>F9wjoQHDUmdvJ=Mw5lOuScMgLB%3biFREfmn+Qs3`>=j~7>g(@s
z#xYI-&Uf=+7LHC|muLANcZ(?_tIAl0#RBU%U1<`D-g-8F{w^v!M>2^>46~$cDy;g3
zGjO_l6mwH}7DT6~W2w8ZsoS9Kysw;_T@DFszkE2Mhk4PLQ!30$&U?4L&CAt&qzRU(
zL<zg!{8lRX^`jxmv>>LRQFJcq-ZE6HB*mS2=rg`SK$dGnG^@IF*^pL22#_~t&F6jh
zdwB9AG)Z2^uwxdAZwCC-n&<IP)>{t0>yN#CH|<&@cCT9u?)mk)(@vVxUf{aw+1!Gx
zrT6b~7`tPBsx9==zN3JLiUw{@V2QeQqg2`Ic|XrKtdZ}rn%<!m6LxKu(#2>uw~8+1
zVx%lLafMn^b?Tz8NxEOWuS4cn>UeG^9tvzaHDaCN7nene-lTv1x{=>!iM{9L3;l0v
zTt#-BN@mI=Dm7MGJibp!6fFWkh%__p;-~Xj7*cg+k0fg$ZmX`f-$&QZ<g$#ny+RFZ
z67WaY(BIgQ3dxFYcX?|5$f?_aaK_EOZ#}Y6wEXHj1deY256Tlg#3XpWR&l|B`Eg6W
z_k2gL_H2wK#IaxC1t?7P;j5VLXyBkB#ttnFFEyCBFjHIsSNrvn8e+lt(y!~d^gJI|
zRG#+SiXy`Y311ahV5=48T+n5*_v_J3zz6QLu<#eQ2^eXLOSc{i6XU<INLErwqE^f#
z_+KEkdA42x1rG-H1^3^96vlr6ssCUoU$~I}Ifg>{zYImFjonjswtRoCEcm%Y=wa67
zhzTEol|(|W@~Z|c0o@FCOjO39Q3Q>2C=9N_1l&v#hd~u5P?uyViZFyyTE-=UkinUO
zx|P4QVbSfY;ka_Nqt3t0=N^KzB%sguz~^b(ZC3EgzaY5~^-h_}w)JWIX?Gz$QUkWv
z_9<D2mbrD-_B^w!ye43jV|rRNJAgl;Q5Y|*pIx-lH-tewvHJ$a@1To$zT|vW4z`eE
z>s+Kq<<LB8_8T-4f(~tzSl-F2j!JI)%tO;cg#fcnw`x|U_oY)Xi8rhEab8LCJxwz5
zRLO_9BQZJ{JShv3pV4RJg<FXn?0N<gIZR<X|3$}4-Oa?hz^r`w5GgIs>F0_dmxC@B
zURb20+XscLn%qJ$hXI-;OaBvs>P%v(=mN`FgXQ-)!<c<6nF#sT6P2DzRfcK9h%xbk
z0Wzcq{eXa^m6a75af?{1B)tnR(pd|WdvC$Y<?k9!9JG_J6Pg8t^_0hSkYUw$>93Aj
zbD=-ld_b=$^!E+fA&o?Tys*UAgJ_~y$+AzD!Us5HW%@fPWTk#t6gk8FVt2_SbY>t*
zG}tJPGH)BjZ;2)rXb-q7tMkoEz1${k+rI*c%xw=4bIl~=3VNg-A0Gqal(Pk7lhoCd
z!CgZoxY4~>a2K3eNJbmRA-dnU!IZ*T3F0y3Ze!5yV-oi@X{X^s)a#=m!&HwgsMRyf
zD*+TEWJV=o)5q!l@#y8x*wd&#7aB})=Wl)CZODI`pxI!!=|$0y`V`6gTRXp(%;tX0
z`}*CsUhxF{N`bxzG?Q_RhAPyY(!ozyp+N?)b{N^uZ6=J;Dx%{RR%um5h^fRmExO4T
zEOicoABj+%qgK!<+>%wd%#-U~0oPGaF*C07vV=bx6L9ZS%7p!1QR}`QvS@>oZnmK5
z>eGGhT@u~%Zav$WSS-RA;RVWqi;jFDFCj)GgelBx#8HlUa=;^Fg)%~b4yQpWhZbxQ
zl9dVUhT&=n39?**oPuu^)Kq$RZNv=Q^Ke5t6jzcOAJ4RGS)7NgCu}6yDsf|lL^zkB
zhg8sbIi#9o5`3qL5KFOW(IdNvzhuEYloXl3NUQSAQ+&mWE5LMlYn<(-?yRjwspIWn
zp`=d>guq+eKMWg{2pSL%HAo75o1|yXs9ILvECAwiVWh*NGLzrGbMUh(wa}q0f*OG^
zA!|$xHVslX4OYTPh6}V+)Nv3;25vpC^N}kJlT+Yu5e325Ue;*-8L#s<W_uxv`AoEj
zj388%uSlHKk|Rz%kb8w{73gdYNrb6RuC|%e79!aWEvyp@*16HBPPIril#dKKbEya)
zQm)l@K8amgDOqeORtO}x_Fl4xc$^C6PAr2PxsYVWg<_>mN3=|xdB|<Y5orf^5TPcL
zLH4AIre3$Rdel09VVhveh&C7QJxx8l{2RqN3YSS&ZZ=ZujVJ%6criAfPjx=ZS@;ZQ
zj2~(Yi$iFo7=L0m3@a;rDF_{2_Obu9<wv-$fWGcd{wE7bx$rV@M3%-9QVE~sk7(us
z17uLBQV`vQV32!o2d6%<6KB<OXZNZuhzOGo5Ney3DGbx{UCnxKaio1jT_SZTYFocu
zx~4+5C!LY;Ox%|td1uo>Upp##%y4vm79p-zb=882Gpt#4U+vq`_GY~S@m1&T@{aNQ
z)2z@}OG+k)Ba9}41ik<k`k@IJhAxE$rdGkZVGc<{4f%vWc7q#}UhY+>mN>|g|M07Y
ztPtT=fQw6uDmNC=fAv>j2ho6fXGbp}plB!h@F>9GWA=B`?2cp0iP8kkqATB+TB9k$
zh?&EXn_*^_?RiATkvisq9@FF}32D-xSn;`h6+WwfUYl-^A<a;BGbq>&+_1~#A@*ri
zYrAtx*Z(@rqqZkObp7xncKNa^Oa6<G-QyjRqdzy7)=p753HI6i5Xg<qMA`E}h9M;#
zd#HA*N=Ge!B~evkFZ@7=K%baum?WklRw5{SwPPG({5fvlr=zR)N@$f;6w8t%i#xy7
zauh(8;5})m=bvx+yz~zL*QznuTEeoPOEse(DI97jrvAJnt{BS4Z$E??JDd$yn+HFe
zE?)=saB;2QOdOkL-kkv$H!|qIdoj$vs%}%@sN+tR7}EWR70%)~a}VKgoU|_}dU~V{
zEk{vyc{vO!=6gBPvDENS03IJMmuJx%46rrsNy{MKon>bg{bn_*?Z;+!XQSuQ)X@B_
zpl+2Ks)Yg9oRKDjAlpt!w;m~UQDW@CI82O73Xe(853Uwb@h1d*!YurU#3DCQSPrW{
zK_y2=&-!&A@BG9WnSPJ#Co?_In`ynzztLvofaAZf^Py`EQMlS26_WM2;2VnAN6K*B
zXN!KMpU$OTo60{v)?~GLHqQw7-JUD^-G`F?l9q<SY3gQ69?>%I+~T7#ylZX)X}<9*
zkfJ<_U0y)udA;H-gS{a2mFo5``h~f9sCSz$i|b!Wo0C`*`yj<i$uZ@B4$uo1BYx{e
zVBIfoop8L;Xy~cN^%F)?b=*+*$wv!sIZ8AB%33+8yjoQ7!GATh(KKH}?RV3r*v}6$
zN_LYw@#wC4aSepL8_ivF57D>N$NzfT2_)jChV8Gv@&MPn9ymLrYvLLBWyTHTGpDkT
zc3ENQLEn3|t#6>v$guG(Lm=SueGrkw-_7k#8xe8sb(e!+?5oZ5i6<&FzYzvPe=V&U
z_3h*(02&vpTAAK?l<heAzXFWod97B^Kk(xF-vSKIe*zdMXRrU92(p1rd;On+7^v5O
zLrk~!bd;eaTJ71T&($V>QkE)p1oN&E70O7g*frrjatu25a1Q@K3caW$mM=JWFygn`
zO&JXGU=q4o2%*4yR$#_dc5P$j>&g2R?<y;z@`BszJ!tXaL0i*!RniKkXZvmUTCqd0
zB%ZJI>+izJW?MxzjOwS5$<wGYhmSDE&a!nPd~Em5hU@iVZFtcE`P$A-__tc4&<grw
zB}@<{>$@-K=y<;9-omSS6Pn4z)^^@}&j?)EHJUaw$>|jcrM^jjhVTrmUWj$9c7Q*u
zq%2LDVBQa<4$}lOwBrjw1gXA>sI)Ia3UYEwv#pqaJa7%_WbXLl`59p(?2GCvY|54h
z0qiks@weF)uBifMeSINn@CrXQ34te`u4p$?alhfMlXO_o9fY%Wc;n42&LX?ji3O~t
z2apB5q~ZoI&&YT_#Di((FMC!I*zB+fr%`+Vl$?=_M^`R?QI2aM3zj$&I2md@zsJQs
zowLiq&CLz-!bhPvM|>Ap!wDRL8s)naGXd1qEe13VRqAb1w>KHr{SR@~SE9?!7r{?Y
zP+1!a(-pDRfgoCebpk&>v4KNHWxzO92^f}Cu_=sdBaC3?6HmTXbf3%JWB5K*r|b27
znK;^>Z$aXtbweQUb@#V6&vX05o5bEBjBg20&cD2_on2keoHk!S$??Lh^D0QfSOdRL
zwGCA8uX@4>{R66MXzA-T=ZR;(sITYo0*8G|LEnG)Q<D^X9PQp(Lu67ln#6o!{j;*j
z-mJBXqR+rfQCwCLF9S_i9IKIJwq}DL<4ve-KfbPS(v1B+&ek~&2mBbUEz{rwoAW)a
z9hSO!t7dI;>5j*3e<hW&re-cuy}zG3%_<h}jj+gQXn&P~0VtVVNvw3!gs?+XoM?t4
zJC*wx+i;$w!LGx2c9oEd%ee=6pBXR>RF!2CGh+GY;bvzHmY#?7C}6+i)gzN+-zb5r
zW-3nDWneLbS|$;OA!0(|CjvKO23ToFjMBV*BXiPjFxQvK5{eGSC2M;WG;mIc%);x~
z$G>90CQbKwOC26`=FCeQvuG|jLx^CDUm}_4e_wj5w;6!QM;2frj<J=q7Kn+S0fTEB
z7;wF{75&ZhecAek!gh&#MX`R2=meuOm^KW3*Lcx6Mqy?-L9T|&qM2ru9PdKGCK`uE
zQ-cviQ*uJG3V{S+s|Uq*(s$aOM3`o>#Ie+Uf^ufT)1YYwW64Z=1_u_th{n^?Ch5-F
zPxHk;S~{6AAl^DQ1D#m3t_Sl=0H%L0)Mb&-a17~QY?3;F`kP2u{t<vCau2tt!D{D^
z*@5V@Y|Jz_ZL;C)o7@M%yIxqWY(T6;js})T#P5R6Vkpu!q;gZ;Z!#jM2Ao0@fxfpL
z3mh@9oJ0~lE7A3dd<T;2!}xADs%K)-8pAO1nHbg+ZqqhhvlT)mkb_MmcpledcHsI0
zR}*5HzP9LwSZ;u%^Kz3(g}0C}pN@FvI1Yvp;w_v5_PS3Ff5LBgGZm>RQ4J}l7{5xq
zt$sj5%lq}gi!9|Cn)zP+#$m7qDYW4OXWxBKm*gRrPYGZR<N%?L!c2O^zZ#O9i3kk-
zpdZ`;eX~(edH<NCaaTz)2c$3lXix{~ZGt%{6G{E~8Ty!WByiCU?W4Q^Qt|!L!Tum{
zb`%u^4CuySq-RR(tOP|yer-I&gF%92;a}*(N8ow=SHm`lX5w*#1_QH!{_hMM{r@%W
z|M2Q!X#M{&uZHIOw^wIt&Dv8)V)@r~@-4C_;bE@2CniV&DeH+`Z^(!Yu=mecPjxqw
z(8e1{h@g9-tE-}eqp3ZbU<KhZP+t(CPz&Wz=pr0`nrkRfv1jChYOOy`&uTwYBz)8|
zE-TL}>Uy92uCOuC%g@7eKIm`H@m_dT{7SX`t6c72UsDx?Nw}m;J^NPCR*BwypFTCf
z^mTPf**#yQH?nN8`Y3jM*BKB<u;5I=B8n4aUYDB)vTUdNjrRZr9+#0VRAqaYmrPd=
z-t%9OXp_bgDgoYEVpm+c2I-|>!x*8R@%y;GJFxfqbr(nno<Sq$`z8U;fn)Y<8x3fz
z<;M1{dMxB8IdEX;aML;d*Ha-dq73E|GGGYw>TbAVyX@&O7nA(tK_4R)gyA8BAt8Qf
z4S`Zs$nnpy>JZMKRZbEc;`n%UR4R!SOX+h7kAkK8Wdo*QIjdK(FwHVa52>@^Tj6|j
z*%yJ-qw!tY^Y8mMI`dC<Z7^uTb9C$s!x$129+kfbEWh3C-ZDd8<&bg}EMA;FX|^ks
z1OZ%FqRYHRihT1}J(~|g{s5Q%7khUZ+h)6_jrs{QGc?Re!wqwq1{!8&W@cti+AuRS
zGc?#RHOxuF%$$5(Gw<w~dG}~(e?LarONu4SmMocMU#E}zw0#G5=;J`%@DSd2?-F<y
z%p-i^D)e9axxvkO^>vhu?vT|NSRB_9J4BEP-;x{&zzHLAPA3XPB`?fPIC-9$y6^Bi
zR_W$GF&<UDR^IR+%#Hrw3hMv?rg}dtt17T<249oElDt||z}TbctMA2d&2zH?kGp1z
z-$5vy>uSw*&!NU+<UbENXyk{??98|+FHd*3Rgy7s?rLadt{TP)fUvB94RG+|hY)se
zVxuDGW`cOgfdnc+Q-n=&K_J`=ljm#YuILYJVHbQgT=1++z7*a3><?{b-DsEB1F>`S
zRVED0vQpMXvMn&BFxeJ&9#ioLs(Sl(1Rd8Xi!9IEhq6BhBP?A6Jht6L_ir3zV;Est
z;=$p`<J;~Quv?})AWXPrl4ZTqsXNbuS*Mkj*4|GYo;NDm>hcOU_mngoJ=T1ba-!99
z7Vg_$OynfZUM2~rH?xwg=m&kN1yvRO6+p@yQ?X#a>j{z7kY`k?MT;lk#8J=E|17oA
z4oV<`eIUWecM8WSfsHB0i;UD}9JBvKpRIWC+mRcTXLmY+($q=9B+NSWV6u2OIANYM
zW>QIaj5EOeoM@Mr^5*mRY+5QVXbBR@Po{!IWM*t>qGlP6>v_zO!$3By-=nU!NjXjV
zZ_^*I^hzO}%GrxkB(%2SAiILmAj(NW4k)%a-|*!%#R{NX#(&Vs=%PXzD$UCF2VbU4
z6f9s!Cnyxh^HCf8+C^ff{J0$m3h+}-czzDzd*Og1#uN}Jz%9v!vFay7Cx;wQKdEhX
zJp?C#N=c@;*6=Yw(;R92Y^)&{p|H8X2Q<6A<W-%$ylO0OdusAD1nOZsac3-+*;Mkb
zo-u%nZZpDQ6<!-Vf1E=OA=Kzrh46J*@3dF&_A;t7^$YARC@8p6nP0pAVm!@P_(+6@
z#=i9cYL3JZtI}okL+Z1_;%hPNkDe_O&8~}ste7khIzFD%_=<fxol~duAnC?(zWBr{
zk(PU`Cbo^BJ%%2tNC%_)X2aqG3YsFbJ5@VW-+pgG>-9C?J$k+}3(onL`1#+RrE!ve
z5KUqkeceHDGCdjGc-8IgmK3FArx~(g(rypwc@-fI0KJyGT;_rP!pe$dIh2o$jm`Sf
z^0G&`1K)5_*|3AAQ8<Esc1J@)18;^jsl$eoMA6sT=VzYJa^Uv*Tofk@-?GOstsV&(
z67k3Gc9!0rX}bZsj^G@IZTFbJ&-snT^uUroGd};H&UuXgGUuHf|Lf;+2gt~W|E*aM
z3Gwf<{#eDr5?u+MkHx`cuZFvB)w-=t>+wst2%T(Lm=GhZglxV!t66CAlxZX}6K=p4
zspo>+fxtejFOe{~VFKW!$g)gCUr5eG!vsLgl9o=(o>DXJI<{B+ePUyEsa_{jGFAxV
zIPcolA37bznLE#VyWDEd8Fb#j1g=igxko5p;W^2wwo$V5RWZrL0l9dAc%xVml*2qZ
zXlfdw%n(K`o0N}&3jRU8qFNlDlc0zw#mN|AG5G!xr*sQK_@4Q`+pfCkR~sfVf*iU2
zxac`-LNZp2-4cAs65Q4Bz4bd+d1pp-EuS*?oE-3>;5(|+U=@|LGze$bx+^_AxZ)mi
za*t$K=tO>MryW=S3XU!f)HX9Ub(KR66f04Dq)NimI%%~Y!N!AU83($dB4NOVbDGei
zqGaX*l|~#^$PXOdBPx%0(SJ18GGQ)u*?z69FJ;5^VpP}gkVfsJE)dewqDXK@L(8=d
z#nZu4rp?{cEA_Ukn?vs6M=e>b3KZh;x|)_{Zpl%lk`#s3x`}^|(h!0M2e;GlqMOSr
z9sZ((00w*Rz;bY1IAv)pK1+l@7;QsL0uHunN`+abgC8@v4ioGzfRm!DHg_n=bwx11
z=fooF7imCV&itb`y`*1%Wa|RvE0|Dqc_~V@mBYcB&YLRx_eSfU<PQdUH1feYIoRQ*
zmL2yw2|>c$B;Mu8c8)K!3H$PCD(gz0^c3-nu?c>CAthw}RQuAeZzp2UxV-2ipQS<P
zz8vUV8&!KjN->Hec}}Do;w@&0+mp>Z*D+~AO`~HwvS`-Q?&09JuxW1Oq?1qH8Mk@=
z6)am&Fww2qS{{Lwoi<i1baH{r+eEPs%K5aKpVz_tT6yL=x3Gj^U_tv>cdh|WSlBP8
zB3U(9yo+8vxv3PHV`Otxh}e?&2kCI&i?M*+RmtmGbxxIxWLSrjI8YfNIQ6-CZ;dT9
z7=p<6VB3%Gd~k2f=3up&z{l?J*H3&w^nE`sDr`PP%$SC`9mpSfd!pC-_z5T)3Gz4s
zi6j9CGbZaMP-%#Brnt$%U1K~g9#?yU7u|A>oPLTkDiui4E}4=-q%?x@>A$8PRhiWu
z=u&u`(vJN2)5oo{%9S2}FGRs8xUd$bTak6Hg==XH{Q7AgaNB`e#ZR?hB*6(Mp)td^
z8JjK>)!LDCgZ5+ggh3z5qq}D1?CLc6Z8ATadOb0M(>V1PyC`W<Te#4RHtE_+`6`=F
zA-|nm6ISLUe)a}PS*&I}4hK_2&L#9crlIKg82#>L(@#Fmh}SSD_>n?-@|1yFJc6+s
ztCa#HpDsW7E+R%xYrheQiB^dbbJ}0e33*Nxp{5nI_nR+-Cf>_+C9!7OBUiPVIM3U5
zb3JVqhs*r!LVzLy2k=dm6#XkSh4ks@SC<=l?%LfAF3Z%~vG4*|)(Sf(&4E18L@)-D
zj!HKrErq+Q{m~q1Qm+>oCDBQ?gr`8g78OT^Z=028?XT^GW+@-8sI2;V7<_RPb-y%0
zeh&rE-u!t>(9PtT%s|vi{KPoGRZ}N@JU3Q~zwtCqMm3)87V$raj)Zpsgln4^Gfuld
zQ;MW`n<j6QRkcD_*QSwGr;Rkql2O_0FG}7l$$Ax`2$ZspIDS1sGOEu@aNBK<EDSqU
zOPd#psFms(Cx7PFMsga}Fm>J3da&f$JWofRT#DJvjU&br_wAKU)5Za-cR~YqC+BJ;
z=@V+v^q(n;_S?DQN87?Hc+JwDl(JNTc8OP(M;2}{!kRtKwXzna|8y={IO<f`ld*hB
z9JLVboe(UaHJJqkVzo5v%jV_QjjuV3CEXswyYiiIEI?Z_fI;LA{IIao7(Lj7W^sG0
zk`Iu6pvx|sn=2(^tPnCk!US*dl0Td*bKd>A$40n%sOy6UTkIA_UWX6KffwW%f<awy
zPXo#k;}09?zmXuQxPF5k$Gs*jQ9_BmwH`IbYT)V|L1^wdA9N1rI>WQ#CNYIH?>Ui+
zbfG}U-ST)uZ-1kz-kRsrxgsxYc&!>rdwA>G^dacZ0)+?QDz~z7dhv1p9$gEeS_7_s
zBE|vopG6n)e~YfaQcD1$>wirs;M0GlR+5b*nhAFI`qR8cmCDzgeoP57UHR;fvabQz
zEL;MSt&GeAyT4i<OipLgnMTsn2ovcZ1;0xrZEP_bk8=ncF0S};d>EzrKtck6UM)~i
zAh~4!v7unTO@ljqq%%r<v-jDn<#)%OeHYJN`@|J~pB=ucgl=^o4;p|gC1LC)vKT?~
zO{^LHO!V6Qq^!zjeL7oO8H=+J-=(M!e@+CWTHVSRTHvr2YtCA1wm^jm{%YUP=$T@K
zF~Xh)Ink&C>;>#2{>aeRui+6ab<8v(`f}l8TvNO(EZgDD-P=c&K5qiFA}tRPEu8&}
z!E|2!>Pn~19>;8DR=P~!J>VfBXHBVNqy!n-D&~xa)T{?3O4z~S178Nc;lTG7#o(U9
z#@Ot(rK`+XndFr6XUzK#%t~kzF2Z{*>@>PYc4|d5i6UnXjz8gYbLZvusU4_SkZ^K}
zXC#&`?iW(c?<W^<Z-MH0@@4fe=(VFt$SbK+!Nb5vFq0~@sZqoYLxlu$Kl61l<bvu6
ziB7v6DZ8+I;*}~imA~AvvlFPA-!sOmb)dtH7_x4X`K-9X^y+a3nHCZp{2`1+i6Hta
z)U|-wY_@dTJVV<ecF1rFl#ftQHl7qlHE<IfsUHS&=K>@cPB$G{Hy=2MlRrOB`kGss
zH9@4Tj}02LkOBqR0;w?-LOH5U4tHrz4-YL|IkDhm)ZmQpVEh3PD{};CEB47oW-${Z
zTZ+CS#yPTOf@+wg&oN^2@R+mQFexCz5Vdg}QeTn0F84+5P)s|CNuf!u0s^2q$CwTC
zT|4-?_pba1zcHsQeEPi2!_frev9jyGX$YEKC%UzG>0~>fz51l(s#LVA!hTF1?dAES
z2`;4ykeZ3>y&Lli=Wv4&+?a|}n9=m`ST<5HIf}BQJz<O4w!UMH)TR3jZHFx&kIw3h
zk~ID*;RO!h$!{&J7je#f4eDW!M^*HDPU_2{GOurHIt$h;8IMW$erdlcGyT~!)T}Nn
z3gOFfpUFqR?Y%083NXwC94VsGb_}A2#;ASljE#YwiKO4d%3WQ!T$2l%HUXIw0bx{b
z<0?<n^s`h|^iYl**BsdCn8^$)KRR1nSzIee(2tRn9`f@(orj$qfs07J+`AzKwX#<T
ztQ{UYaIRZlTMK1=@x7gpbfp%}7K*5#WW?pE4(Lu&$#$NHAF<L3I$2b%Dd+Mf+I=iL
zPa(l*uW6iA`X(UUpT+Ls{aXDnMIhsQq7|A0yVgok7|lJh*SRj^JZ3}$FcYWWt+~G*
z9A$}>^Akir>^!2}$iC3#TF{`h<2*N*Z3;k~DSt0IC5Xv^b^M;*HBXG(22Z=9LT$<D
zgEGeYLET%4gqRT-NB1?l;q&T_%ueC_@b6E+`74t<?)T6o?m;qzJ;a|!;{JnaGUU%m
zwm(i$T8(;8KCdrQ@x`YRH0UoN-f&QNQEFZs(=YwLM%j=4w12uwP-r%d;o95{>X3XQ
zxSg=vc}jwy-rx}6DC+Nz-sV+JtJpKOBriAXP$M~hz}EUh5aQT@klG%ttC~4xp{+u)
zo%~DSIT3VqjnEgb!`ida3&NGBfFIfHJ)knEOngdV7@^{<yE#w`qjQV5vROAgEl<bm
z=ROSQA^%t<GI%UjJiLbd`v~^;=`j)cBL{(hst5G{9KnV*jwbecZcJ?dHinfDN-zJ1
zG5n8_jr?z8nDFXN@6QR0t(ckv0KlRB;|KzzregyDtdyCsu&k`9jiZf&sf{g>xUevh
zt-X!0nWYf`xGrTVxTwb6Ve+lt86hbPEu7aRS^5Daq~*{*k=1gMzXN)K$fyGSL7}k9
z=ol#JVoH7fv#??rp<CHh%_f53q3RJznjEKuD@6@n?q??_PxDXhd+B@6<8Bj3z9^^^
z-*$7&0Z#cK9<Bw#7#Xp?p$=bA46zMxBIMnX9utUu05}J8bM<zt=6?pMvH?H=+gW-t
z)WOZSfL2)w6@cg)ut9>l2L}=>5B#K8{D}_y#0IJr>I`9lcmS|;^AsWhN)dqLYjHjZ
zV4);#1q)cn#V>&dqCkKYDp4{}fi^%_$xogRw7Un$E*Bu72k))~@l|VN76tX~fB>AM
zRb!C^bOGNKA-Yk3hyxT5CO{hlBa#HmW}NQYDABPEY8C?lx<?YmlD<x}pf@K>;<{X(
zZ)_27^;p&j>0wbL8^io2Nl!{6MHAZtlN^T!0NjVEAFmwzv3t9}H+PNqEYGg{b6+ja
zZAkctFV<h%BSFCdWa){sC7qp}IWXHnkZPwcixLfBNf|I*f6!uChRIfkopgVQaN~Fu
zAjr&-{mJtI9~KVogj_$TgK;~8?~P^CW+TG;_RpoS%kJlZU8+DzMR#7ni=CdebESOr
z-Uzr5ll9#m>FZ#S&r3A*)D~-vCLKojg=$!{EQ!>hTZ{a+&%{FsTc`&<%ol`-FEDW~
z2tawTOt*9+RKtj6xA!RsXau6_v@;;!ef2RC7w#K?Y{JUyb_W1)T@Nt=v>?D(QvNmo
zwC`hU7RO^r4nPCI=WIWkYC$OYAL!-Xi0MB*w0C2H>Op=MfG6wbK^B7i?TZhagPkad
zqu9;00NzjyhMSF&x`|x>gNXxSZv$1+@5mMlQWrb32fIBO23+tbG@2eUS15{p^a9B^
zG*(J9IEkJZ>v!LLqJvO$Ig<XL_W7VCLgwGJ#7Hkc+M{zuX$m~XF8?HA4u1}B7iEg~
ztCa)$1?nWwQcQ>&K9KD&<;aSp<(rsmF@;-C!0X$XTQv1`-^mg13XeAMonk^Xj$G8!
zj0_Rc4O7LX7{oN#QT?PG^U2_YD!VfVUU#P688jJagfH4Lw00nJkEMTXtf;D_s&Fy+
zF=;(&E3^tsKp;~OB}rVdOg*_f>O-HaK37ew>X&kgQ(^+*Omb~XL^Pc^F*3xV@4uyC
ziOFM`#o@#)#FoWA<}2j$O(UD7OHv%gS`DrJhOYH3CrbL(6pIuq^ZjY4_jeOISAXc1
zBup-ue11Ht#3v*E9q@uIW}%eqQn|5`%wN!@p<G$&;#S$tvJ46#C1|WpspMm6n8G9Z
zAM<7>Q_W1w?o1gD99v;l0|-QtCX=Qu_Mr~;4g#)S;1Plm0tUtOsc<ZCJaCGzn{XIX
zBnu&Cl2U#uGR`yOrI;imCEF;e(%jN`VtgA$P2fsUPVi3HD^*l-P~x9;D}_@mQ$i}!
zR`x3VqEsilT>|q9vuw8HgHl@wTjjXCi+qgigq%)Zr_PK2qX9x~aL||RV6i+!gQfwT
zC}PY3W}^#Lp*eeHup>H)WGQ`(+J|FFXNV^}X9f>R1!0F$<8tF~#u>YIV<3nFH5=!g
zi|G>M#N!C#9v{Iz@_($EGp{hN@UCEAa$o9P(m%03!8|!yI&-qk5Xhj*xZ$$mx^seQ
zWowmd4QgF>nmFW}F*tHNfVmmIK|ENU61}my&bz@nJexb4B4lS|g=UMzv1H;fI3JBQ
z*tbYFYo0m}+$=^JF>U?UXPP%9o=4eCaT;Q>{mB)J&$!$MU%#An&1l7fM^E33c{#r?
zzyEh9^;o<`s&VU7{fy)2=uf(p@`duD<7m#=bc;;A&c*iS=cu3pk@S9v2)2m9#HB>f
z5r{;o#JlojWj<v$<s0Ssa`8FMBf2B2ITcG;Je4%~G_JIf#^Q>!iazHwt9A4(^cd=C
z>Kg^?C8p!&W7y-=W5^TETfJNITdUiN52N^~ALh6nxjpS2okpE4ZQGCXH(7g2`bv5a
zR7~(pavU<QK4BGpjU7Qva!$fhuqp~Kvd(fJN!Y<XZJlnIxyegwOIxW}wEDF=%G>W%
z_9R80hBu_u%X=nxeSW99WjDH=QIuBHa}~SCpzW-!rv21GAXAr4kvYd`^>evTW20ll
zLzjz>*XVKl0E};d4>Zd?E2OiqlVqK@lhk|8JH;F7IrEA8apWcDzH8I%67xbDLKox*
z$PP${AFf{=m<1RicnWv{)F+52h&D(Dcs>jvco+mVLi;$IZmdhZ2LqNB6S~wXjA7^u
z40XIm#!(7Mf;p7v;0fq;WN(|o2g!rcM(EHDQOnR~LNlBctOqZ2Y8vKJ`a`*T1xGu_
zJG!~@-)c`L9nlvtC6O)M%jS*t&L-vNmhzSc$7#*J&85wLt|9j#7fGm&Xk;)aVZZwp
z`gp^(9YFUiQ(4k~rz$2o8dUDA<hEe#9*mD<y6~udQj7KE2uemxs^#AaAQF;gz?Ru5
zvX=UQb{Uu!BqP$98<i_p)6^`%^L;l%IpLOLmD@}B(KJ}*i_-uLjEp?3+c%u=Eu>dc
z%Ae=f$|n}>7C&;vr^lz~$s?F0*3-^2Hc>Un7}L_mA^djRwHn5Y3mLxqP5R()wTxjI
zBsrB=FJCE(h$+cXOzWzFt>M}%)*+_;i)G#T_3(id&L7jWBeq($xw>wl*;VaggQQEO
z4U;rN0n3G+NlU)f(ADgG+H1sgq&D$Ic1u-W>C)V7<uY16V7j0{nATr~HK8PaXvDhm
zTD`>pLodNl>C8N7Rzul`1}j0Q+_t>9^1k{@^X`_4w9c&Ojhofd(waom@X3+bQT~y2
z`JGx<l|+ZR;Ou1ZIYI^AMbr+Sj+MlkV~)G|P4rm(*zg$GC%sQ68l#Qn%a=K9dAIHv
zK3XHnFBN4?or@Gpb6u-09#@C~A27Jr&f<^T8)#isEILHIZmg$I{a0gf_3>J}cD+}d
zMO|e2Gh;joJfLnx&W_9-Z7f%+y1Hs%tmN6E2*kK-chY=qmeNjAT^elFX%Kq^cYaW=
z7kYYZ%kJll_pbDgt*7`j-9R6SxzSE@bvc!P%(Keo&FMJXkIc*Xp#4F#v+2$IjA`4z
zY4B5wN@jKj74OBvZ~wUMBEzE03~7GeUnwhYcaqO37Fu#z9VWsPnfzFer;<%NcSBce
zdofz)?Y7q>clyiZO<yZ`D|tn|ZC^IUsx)kljP6EGRCp>KuceN-r_N@49?iRF9p>-n
z>9w-lI?e`;@tUkDR`Hw3TW{{2Z%?pXU{57iwA^D{tDZZTUJjuikq&+8Uu%rItv2p;
zyLBge)sW5*VL~!r<KJdNHm5~LMQ2IBkVeI15E9}c;C5UZj>l~l)fS;m40|iTxg9x_
z?XACTJ$;=}eO@?+dx)6ms&p&4vOg;;sp1+W9VBcYcjLV%e6AQ@_Bv}mYh54gAWWfp
z7I>AtntC)CESi+L<J<FmeP*}|ym}&^&SLpb^w&gtKFP)XV@1F~OkN5A+{ppJHvj-0
z-u|2(0Du!C037N909P^qVA*`v>Hh)%p!WZ6|NNN=i6a5*kWCkglwXZZjKSt<m^oTz
zH5)xq*3noSUd>lRnypuS?Esb*6*P&`kD!mmC2)e`bYwFFzv=pHHM5Y6S>Pw0cPA*r
zb2oe>&_x8%MRxjTW@g4sS-G%d2A}k>5rL(X+v5473?#^ax|^FDT7VclbI%Lx?CcDH
z59#e~YilE&xO&WxhMKqnLUTh89RFO+orZ=6rH6+{5zu*N@OI3DkBG#;z!1aE&fXCf
zg@79cIcuJfOC>fFFJ08z+bjIGwY8-R{p0lXl-d^@y4QB^_Vyn)>9%T(Rq-i$TNWKc
z2%07VR^6g?m44NFzOAK&)7{H!mD=yZ)l;@?_VL6SuK;}j+qe$L4j)Yf#SY&f@<*eU
zKT)=F*$p8fA(HPIsU$_*i*cQJhxTACT`iq3G)VUZt&v)=)iNCe!;E=DvLwY5Ib+rY
zl)6RfEKPz0L;<=4b$&c~ttwse#2#Q;;pXj45bwL^)?68J)Jpg9quw%`1a%-XG_gdt
z9eyNJzFGKDYrH_-6t+0^8%MMPMKv89HMtP<C6A~?n2{Q~h+q8ohK2??x3JE$EIb2X
zIEbJ6^#gxcB-4GTk2a_vayq%VeO4hg5WT&@A)V4)OBXM{&?uE!NG5Ji2>wG2re3{*
zw&G@JWaMi)8H`%u#m$Y9_ZiQ`P%XRx{LBICoO%{(+E|%Rhwd`l{QP`~St@~B=KP&k
zmU~BZ{P#u6fx$s2JN$Lp0_n!4CYdXqw^cY1x$O9@lM^dS_}&1Xi93FNekdX6`nf!w
ziHQIr4h=1>4s|+ApuD`?6YNdF2MWN4LH~f3cp>z6n|%;FP*q0&040R~JDdHrMCOg)
z_dnT;2>9C)*}Ki&ZT4=ncbmQ2?A>PXHhZ_(yUpHh_Ww_trTx{*&i#<s7Qlu&f0Hzp
zUmobjF11n*yw30U57EA^_44fuY2y1y;Bm$K2=HEK%OaP+5?BgK@j^@J6SG*QFZNa%
z*(?ip^EwhSG7jCn+?(hIV;h`j1Xu!i-H_EF<zS(?rk{K~JuRaKx5o{c%|i4Rz<tdd
zxGLw50*vbx*VoqxLH<as^2iv>)x!hqA5^PbUS6&|YK>B_Xf#I_LHVPlT&h-XF0R9j
z%*;%%Kel-*ADfFZ=fKa@($;?E;o)&aLPV6MNr;`;(~I<rM{Q6?xVyWHiin8F3Peu-
zbEr~Cs=SiN4z5T`OSA6Kb_pQzMFwrO>cs{Vg0^qL|Dz*+KoGh4k4ILMl9H5-eTNLE
zsnKDh%o||GIpgL3z$$bbTMnH#+JLH{8$00aiR#aVAt52-Tn+P&5Hkn$TJ%YBbeMW-
znA5Bf#NfbrL&%>q2Jn9#N3kMJvUJhOC=k(~OC2b{mnBM{1h$8t?jS3n61rm_)~^o&
zAPa3A9F(NsbUSHrM1u|5RW~$13}AEY5e51p*McrIA{3zK$J^pVrGQ8jOef1f_BNg<
zfhHRH$;1A`LD}&=wRG490@VF$Yik^JQu}Ue0@OE80sK*&^7l^<5}&CdCaxe;Ks?va
zD8=n53&4Rt*SOrM0;8G;G0ur?5Gzk2{+)aM?kNR?CSh0%ddkDwJ35X`Ftzah`B}5V
zqT*X2^`GZp%(w<QSA{-FG$j)vl1WobD?^;Rt@4PCXF|9}6}$lb>H+_cv_rS=qaD_`
z`S|$e)lEDwu?@O82ak>{XyJRK=UQJbE~dx=1)!Pc)RF$&o3qo?=)@6nK-a{?#DQ=D
zVDo(=6u21MUPinB1W?uqf(RwP75*J@r}M|j0e=AJ{ZA41U%sCAZ-_H8vi_@K8%Fr_
z-mtwZ?p<;3ihEbwyW-vz_pZ2i#l0);Us!Q_|Ix6mf7NioAGo+1;-u`7zT~AGAj`;+
z(m&`nrTC<#X4D&ravY@Xx^uH2a`r6jevt9zi#{NLi4!Pdt3qornyvgn0@~TCmQ8DR
zw~2Dd1xx4_>bk{~Ui<u^J5P-IA)ZQJqOqxIP^3Y93?CoA9RI@yqq13ZSfX!Y_~T<^
zCq**{s|N=MsJ^*W<yBSdz=J0NHF=QGrd^HdN@&0SP*4y=VXgudY`dFQo+iD6x3_ot
z$PU{dZ8ZVPDk@XJ(g~Y~heym6_XFkE7V-<z9Tc6>aWrUfJF4$UNl7bTy`(RabmI8=
zUJizI8HtictU%ZW3gm~-Bl@FUDd<U3pgk#CrjM@O&p?`$t?HLya~zWokX%0J$S#Bq
zZbJ!(gK=<kYv6!a#x0G8x}5TJcJSn^-E7$I`x-LhP98g%Ha``!eAnCNa&vcYWrmbs
z$TW$H$KrjC&S@JG(fKjZlfwxzWNJEt!;0e$Y1#xnP@Xg$vA1{uQ{|EH>o^1Zn{5b8
z4pF3dAd1k8B6^ALS3DIJ(OJCaUx>~u-QovypCDPkZYs;_nak_Kg3Um0vx9PcqC~}p
zhhp{6*0iRy?vV13mrqf|1}o`%&RM>3rrwBQM5#y4B=YX<E8qr!@c1=2J2&|WiblnC
z#p(OZRS1CSJG$EcBHb1y%7VNG^M|lAF*w!Gs+ffs0?D9yf#>^ttreID3%xH)wmuYf
z7W2Y`Cu^Uq$70ASs@p-k4tuK}kfp&!;J0q>_noYQZAb?XQlQ!lh*)uGyprzqu6F9!
z3Ew)Jbr)3RERoi}`FZ>nZs?eFnl#tBxLhoYSzKPXQ8&(JeHAR5)xQ|AX{`S)@v!&&
zh4e<0Ii*>Y3|mm;)2mtgUR9TjtJ4bq>+s5grsw&Ma)<Vtk0duYH}E-6?(s!?_wLe$
z_C}g|xzU2UKZj^#s<+xg?``wN#>GjCVb=UpetdaF#VU~X{S6Xeo+D198C<9Qy9nF$
z65%HPXmI%dR)l}`dd!Gp7w^5^y9nP!_%6bC5x$G?U4-u<d>7%n2>)e82qyC%zqkA<
zlcxj(XU%wbTwG{L9Mm%+laNQ^n11Lb&kM*yM7Ch|Yi6P57r=T3VXt#AVm4N718M!_
z_gShw5^jJ|0KZ0xrPvMx)=}NRelnuNbFjZSB?B&XBlqku{Wo1^`<aKeki?LYL_I){
z*F8XfG!3HuLH5-`kRr~_?l4Jy98eGnWy(fch?BPlgCXuKjc29|1c<QVwedF~q(HAq
z6wTSbiB)%YN;9W?hDL!6>CFiX3%e^SDpDc&_R~M!{)8|TPV~G9EUtU-!qt<9AZGjO
z0UHM==gFL%4ez<pr+a)HanUkSm9Fs<JNq3<^&C1B-N+@_)yT-mHqt5o#@upK=vovi
zj(ZSd6;d?^C$ABseUwe-bLvx;Cl`G|dQ88*IFZYy6;(mHc!7M~*RNl%SN4fHa6dbW
zUq+Kg)9^c}J_PyOhfdQrGvj98&6d&8(~ncc4W$&u%Sv!I)YSYavG;dd6`s2a%(|4}
zq-v{yfgsLaD|UD_2{TZ^cpCXGbQ(A|HdbQF`l!Z2g6(l{8g&~QzBM7|f_a}uS8PCX
z9K9DCh1>tg=_G?7nk2m}i-$y55w*Ilt$@Gpk-DmPZp{8e0H%s!a#oskHb$Wa%wIh(
zyzaQW@VD*a*IyG{3ojRc!r-&6+Fa&jg>1IM<jxGEBZhE?|J-T6nG1=Zd)|PWNdJ!W
zhFv0+v--37++8X}^#_<$=$4ES*9PDNA4Bk<Xj|#FJx3O|u96+b2dePyF9c1rz31IO
zofYUwM`}^ot5yp&xq9=8O|2+WD{~HTgXjBLr5tDa7!e$2V-BZF&?nriHk@<SfHIrt
zbu}{{IN5T=3o0({4lsq;spFG<3GQHpepW712aEWxO68WeJ5f_j%4wiP1*11zzq-y(
zH$pTH2BGk?(kF|TYG!%r)o850ij<VeHp<cMi1V+lyPIqT1j)V$R8ouDab-XX%-;+#
zbgHNLe1Gt4bXoXuGf4!Z1Bg)ZaPt}8-D%y<BqZpadBC~ku~-BN`Q_x~M1bYXm-q|@
z>)pphBbszRy)Kso^vo@|on*@_^kr@yES_FQl4}#T)ZxNIIy`t1_}X%;xX0E5>Tmv-
z-EUoBJ_rDetVyu>uFde@<w<F1Il+zy0L+O0OrB`}O`i5fhJQ7YKM~m9o5*)}zPt0?
zo$u~^cjvo1-`)A{&UbhI>$($k=dUI*u0uw{1wA<HX{X9!-NP#2ghS*9XwbmVAm0RJ
z%$3-fAU|?cDg{cm*Vsr)f|)6~0z^k5dj;?k#RQAeVWy}Od|53@vi?4f8jygOBY`a{
zhjDL$j)^h{GGcHYW*PyCI6-JXGVyqcf_$rGmLMVGhPt{qAhciqVRLhH){wacKcfFQ
zX2ik4Vb3>)x_0rn=W%Iit6RnE;$cxOcZv$sRjEXBv1P2}jF7LLJwf85l#EOfx%gwe
zfE>Cq0l)VB!BiepUDFx1%jw$A<v!J`E?}6_Yo1_3kMvDTE$l6Mh{x20Yo*hPb``?X
z#)i^o;<eq?L3c74TBLcwdfWXWd@hY0n%FkI;lRSBnIQb!T6eNK>$w*D=xhR{5mwgo
z)w8h54xR9V*7bEEzozNy2=h1oX6L|-YpV};+6jTNB^@>cO%eSm^x5@#MHH*rJ+r);
zwZ6(x(qmAma4^|k{v5@5Do24!s46^Mcz7*}DuP}$am|i3Sp;f5c;}mlkaiCr6^qbd
z_UqO0%jogL1vpJFJ1b&oJH#A8Pz?Q3yIYZeoTs_^3u<bkg$xFfiKk~Ya!gsU@*<{Z
z3M0O*7TpD8!%jLlkyWwX6<x~$EZE(Qpr(aETh5s-wkunT2~&zeENWlMUPVnU$&k_w
zNaE1SqP8)mSG)JlepscLCi+>X{Pc$FXSPl8=JDpIuj-e(ia(D!D%0xjzQ4b$WT<vp
z;P_(ifsz<xcrS40KM`X1h+G&{ipMG)z3>T4<7In$L`%Si!}4x?UFWgly!`bsd-z-K
zw0$dbFjme{x|^dkKH}~A?8D8X&dtX2O99+e@#;yodId9=8|h0?>3Q#CTz}5e@_hlV
z&J0=@Q5ozLgU*#q&Cm6l-j6SBK?UC|=BIb;AFdQC6=^gxlEt#3qjuQl=Z(W3gi3F&
z&4h${(BStz1PGVKt*>d$v5wIvjhLoF`d$~DJ--12`sl(JVIxz2*Wg<M72OyD0Q~%?
zJ>>sOgMYP<yof#TE#$if-!=HI!FLV5Yw%rz?;3p9;JXI@bu|d4{#Of`$Sb2^g6^Aj
zw}f?k6mw)@-~dOCC@8i3i@X@T6frb0W;%yi7>i1t-y87B{+g^#Zji!)A*M1zPV&WE
z1PYWGoL+7aodh2bELs@;{;2bVyhui>n5sm<qofJP^wT~k*B-Bs#Ly9Z&^-Q@k4-kB
zER=0$IZ=jm*Uy4@J>t*!*x%)E0XgEn#&~-SF<9c=f_ODzaG=mE^TP%q6IEdH%F+_9
zma3|*nHkJTZLGYrqqDQ~_03Hb0umCXe$4`F^?m8~%QWwKlb;~<&fOnXcJQyai#v2@
z?@6$K{P+>bm#03hTqVumHnjBgG}71K;?}L9fV5mj1dC&-tLvDVuey2|1dH@!>*=qg
zkCa8uq2l4>$-k<I_#?;&!YZw!1V&CiwniAk33#G{NR7l#smUn?Z!2zm;mP&NWzEhC
z@ys~+$gJ_S^-86l*i6))C*tnSjIUo*kCW!+=I|N-?AE&W$P3q)5vx7hswz3LH}S<u
zIb<<1CF+vh%-jN`Q1Kv5_ZaSx5n)nNQg-tx|4fe|5qdN2(EwKZ{x6AFidTI3he9Zz
z!<0W)P?mluq+0!GOHCSEj^NeokoXAyIcA<cl&xtpADTz-gNp)m5<&NYxd7l?BUvLT
z>?HPUg-H~{&&h{HJ&sp*`PNxM$vIGQQVPvyG6vJUXJ^)IQj;iKo<{C+*RCy{)!a>}
zEd+b^(76IoCSBF~a9GF7GbRX{gUq)oa06xAjF+WBlSox2tymNgp1Z-bKzS)RZ!V==
zW3@cg_{x|00n6<A{sLQYr8QdNE(e<{97SO2h4m0*<qMF+&^=@q#{Ts5y#X}&i~wKq
z7+dc$NCCZx5XbeEih!`^Omv?Q8oQVvL+B#@18Mp`E_QMijBh+Mo|R3O^~+&e!VZ*%
zA>tjU69;wMida=}g_+_CZc*v*t6b)K1;6sz{p0e%EgV*D73fBCYU<;>za)ilfxMgR
zf&E^usJpDrvZ@bdmbij)#zM~z@sgi;8Cq<oHr4S%WbHbh54}Yf_xd@qM5tluFAUXm
zM<SI+?)P>y7+p`xRl=f3Y#!k<wQ|IZw}E3ycgttwRi4a@HmSyJSrepzM3@mTcQMnC
zN}BAlHiE0&I$(ebqUDmXAt&nJ37QirQ!j)F0KEUSko+&3iv1y|n~|lZjmux1<PQYC
z_fGO%q3;TPSLnM!-xd0<(07HtEA(BV|GEkVUHgCje^h411%L2jZ||wC{^j;=UPw@d
zxdNTGx|VY_kvTVFkt5~!3v*ordu>-QX_Iz`E%Q|Q2%CHY`ParkOrh55U_&JmEmJ|q
zkFus#`~-=t?zb;cJeS@bYi@AV<Yz3n-P6;k@)G&+iZlraQ8za&J`z4-znYp9fN`ij
z3Bp2o+9XO!hrGNz2!NXW>gwtZtk8_4fUK+Cv*-_Kg!Jz%FWWSlZ1shKW0kkD_;8C9
zozvAP=flUFemr&?<MqYtRqHFVtS$xb`|Z^#7M-Q}&WG^Ln8Nc%P_d2k9grjj?Txz?
zduE@v%~k0lVPj{uWhk12;p@4HhoI4*y4%4de0`Ma5@N(VWHC$PFiwA3YN!@={kMyw
zyr7~BR}?B!V0q_KGd=IO;tFwgW!~KD?)4;);}0wzkwkNW*JEyzPP(p%TiaNT-S~9~
z+3j9k5#)ZuT37;6hhya_P7PB8zr3M76pzb93=kHir&xKeZ{?baK`vF24`UeL{Crpa
z@<FmGVC&C^GYTQ-{fy}bMa==e;9J5d<3Qa_wNj+dkPs+Po+#|vKG<X2;Ds@ndO6TA
zm*CM*j8b4ZgeaC0xl>J*y5tlRsd5vlos8;}A?M(_M4_c=&^bhHl)BhdLb_B4lG_-{
z`nllQK=WW_C4N(y*vyw!VcjQ`Mkw;%qJdt}T}XN!-<*>(cM2BGH*nipr=j$R9If*R
z)_6F)rRH})bdXWb{pJxG@iuRK`9IrqkBlgXM7^-2^==<%5@JUpV8vgYVO{m_MP)3}
zs%vFLSMQf-ld*kp@=atcW=C?XZJa?iXu|51uAe;9b#X}wJFr+p5ZQUngMtfN${KPd
z5hUXZ6sUg79T=ZsPCM$5nol9bq@2kzE}K2nAXmq{anHD>%raUoI@nUbXll8vn@!Pn
z`4kkZTKVmJrHOLoO7a*^uw1cn*?udcuj{&tHw)nO8L|1TGxGZH5>)h*6dOPQfFJ*~
zjQpP@_*WmfkAU_5Z>R4Pe3#(61m7k2F2Q#RzDw|3g6|Ui*OegHf9#z+w=Sb@@<)Pq
z4&$2uXvlgI^b+DsLU`U`{_>LLREo738`>KPL+aY~`0?3(fy*m|_H1NiK}k-<*F?*(
zY$m$VWOz}Uh~kEi#Z>WE$1+q{WF4C=-j_qP6L)E6cPR1_e7h)K0)&%L*C4Bava)il
zJV`;mCVf#;Q{(O{_3I}G)slQ*RHhQ6s!0B*iGre*l$6x%j|$=7;5tCcD=Yu7u&MF3
z_<pNjUw_}6`KI4$R2AKK`_Km+E-jwMqhQG6F0r%C#|KB(+xs<OQJsC_mwAJ0$_Ve$
z(DUVe$bn5%8^8C&<X)U>yEmEb<8Gh^yUn?W^T!mA?`|vBO(~ffTBj6kv;r-f(r0{Q
zAEnou%~xJW$uJ=UaJR0Z{rZr<CsW@u8<E5WNAYL!>a0Wz!U=Rz`VNneYo^!zHeBhe
zvd;O#!%Ib|KRh&ZLN>8_R*$REEABF<q-|?+;043qfn(9}Iix`Kj>^f%{v_BNRl4{s
zT%fb-bBC$!qAnxuhH+1S6&@Z7FRfs;vNU;TOE3;+&v`>ln<TmkvPctYAaL|OTDZT2
zFwf$wn7s%5@~zMv5*i7%hr+d&o~IKzl@ivOA@NiI1@$*XI+AYF5%e;SUoaW!fi<Ed
zge}=XM5;H($$9W3sCM8o5*UbL+6Q8E!#z;P4<gWx1<_hQ5u{Ao#}pa|yWcIY#~<Cw
z{Oa+<RFL5bdu;Q-y+UKLHm^wFk*1;bIC)r8oznAM<~$%n$%|^2Lvp5v9z3|D*<Hb)
zyRdlZ88x9}@H_>}L6B@xtr}yh;)4eYYk9%o2ZAq$7kUdcH<i4)ZWE0Mzi4n&D<Yu=
zG;#?j?BlaZyS23FVC5kt3K^5F*AZ}VaOm=QxwvV_xm`Z*^?yE@Fy#40gdawNjNesR
z)72zwHbTQ$^<2-&bTez;pnkH-JZ#7;MjiGgub!S^IxT2@H+2t>MY$+dNDO~`Gj}Xe
zJ1aeP?65VnO1TW0xOEBQ<?Y{Jjf5Z0-vCEbDFRd|UZ%f;kst_E;p7h%_y50w(a6y3
zzwLWo0IB}Jx9>UozrT0;lr?P7MA2W3ojaU=&ISs6_KgLHjpyDXQOprjDv&7lDt%lV
zEcMCt$+7VgIMj&vl_bG)my<x_o+CRgD?uF?I4};u%@LN-FyF?_>tO6sN5M9Pca(nY
z&cnUOz0SFph9W_oUxmkRt(o_&?phT~=sY<a>AH?_0u=R8Cg$QuFO*1eAwg^80|EEt
z{!b0cuBu0^;&DEKlO`Lp=$H<ZwIVmQc29c-wX@5jtlj}ytcok*RlYn<460&iLD0_!
zZzQ;p)wDT-=%v<`9(E<Swr@Yb{5U;*(Lim*|A>7Fx5Xn>B~DF12{P3HAuw}yb#1^d
zb<CDYt!<Y6)mU%<&U}7Upg1GYcTa<gUTN){!kf3(^>t;8$K_MzQt#lDDH}x_6q2XP
z{n0lKuNwE&aa9F7MGc_uXQY7@X1>vn+%^#xK~r#1%LUovba`ZO)+(5Y0iAf7J@(VJ
zHn)S}9i(6ieprH)*N2EAq^zBz7?bd^y$B<-ua4llxxb>xxkne+=(xd_YxR~PBVRvi
z3(U)Q14686-~vfdHHvB)U94Vj6KO|YUbIdloK5Q51N$ivI>82_yS<95Rz|+!$YEEK
z1H>cMYT!L2Nd60qFdJk75V)TO#>v5|5AI}D&&_XK;C9H{HIoPL@0XjTHQO%}j#|5q
zfc^bsd#gsfV-9IhUmp|5tz2>-(I1}9m|U2B#JQRAgA2?}Hi*u2+u|rYZGnH;Oo7@}
zJ4G<l8lrEGs)98(BatO{Z#K4XtR@YOgdZfakttV#dSwaOV=7$zGg31BF7kEeVC0!s
ztzvqc2tx}&fw}&%tp{XaEW8kRomJXcIF4Q%59J&*q(BgMsPD`c3fkHi1cTEL*RCVT
zQ7FxB5!13<7;GJarEw3M^dS~1l-vaZ$(oHE4X&e;HmYJ^lepPkk33ttS$9xV8r^X%
z1a#N<Av5bxN?HL7%;#Q&CNde_KVLTy;gJDi_BNuN^o)pn$ZPCeA$0r>;~#>~1}IQ3
zX5|SVM<4R4MPuZ@wJJiPN)10vW(sO@xEQl+d<2NT^O<}tQNE7SnDu4d>Wf5XQG~%R
zT@|U68#ulsdcLUpd22|VLN3^VN|JRpc<R~7;`{kbB)2P#-48w4u=W754X)*o?$-4!
zTXS6BX#=|zk-+~vO`H+uuy6;9d=x9Z3Z&bRf|;<PJe+3jH&3M}!K{xz^T8~W;tNEr
z_Mng#xcwGcjc`d=?)<K-Nedo*VIg5Vq`+_Sua-+W@;OY02F{gd`QCKBKXvDaz2KW=
zYE%z{xjkWTy8-kDJd)UpEj7vjle&qa-6b%_=*V7GR&2@QT&cl*KD?4FnQ+Q7kz=(t
zj9Cfaep~dp92oO3$d8zQB0mL#mWVMLD}xAqT32Cw?RuuZp|QR2IuoSYf%#sq!)?$>
z{wVpFr+OITbI$sCPEf1`Nw_zj(}7Al1Tq(*vi-8w3(uUAOUHYo7gj9rntt%9hML3p
zvkGq$oz>V8t>d}sK!$(7fS<uWA&#Gp3#V^#No?|Tr1_Vv)?w9JUSC(2xO!h1xqW3c
z{ko-3*ce!e^b7JRED95{LxeqjLvWstFjRM3z(+24B4`DtN%sbb>===B9Ubh&s3vXP
zJr+M_X_pWH)4MAs*JN|SBX0ljL?}<0bnn`l1#-h-TnP&NL?L?-2Amc@(4^IWH22C^
zI)dzx89bZyj?h?{jq&z})Ai};;DCF=hv|}VfHg&M9jO^HdwQ$`0qog-0NK*quhN({
zA3*|A4p*pLPUft`9S4l`sThnVZ53rk#`v<z8Ifoe=A)KiAqe=C_J$iltIHh<En8_>
z*$}=L^Yj5+E@HSwtB7)w5s~*?MTo7!OMSq-BsQTuUgnTpK9(RjndE_3ZjE^eJlVGy
z(ZDGXR?yhBVtMrp`BAY#g*p4VRRUizdyKkob65AH3y^kOk^MzMQW#do++u#Fb++vy
zWD_5HnDpb!_YAS5aNRrrb=ReQn!|0?*k81oDNqj1vL|XwCCFw#1y6CJRqJ*x=)R`R
z)P)zNmcZ)`y&P#-pPf_t5+rqF;8(!i)Ifc5y4DD$0DbK@`9*Nm8w57s7SR7pm!mrJ
z_q5x#f@LlJ6G{dDbf<Kb|DJY#1sxpZ_5WJXL1g?DbShsh@kFry1l>u40XGt*(-DW1
zW|0-Fl|pVSL+pmwCNwm0vx@)ig29=XCI<*RxW8~9G>trYc7;0tp(&&wAuh3mn#y6O
zz|KI)CVuS2$kJv}b>g&Tdq9?#vY7GmX4Cn`)D@<O?V2i8=`BlDO2{a71~S0hOR<5Y
zuTL-Guwe0;p!Y`mo$TWdTfKuts$;+EknYW}=%jrNipOh%-xJH?v&LCw+morC$o`hS
zIZ%!fVRh{0+ktrAP>DCW2&OgPuZfn2C{?$+l>s9$;~1zR#O?3Bp7e0M#I2}Yc^Z1H
z-#h<|dgJ7YMmJi;j~CH74&+;U)#CzjMz9S7_M{1T6$N_904H|BO;ql1SJb`XV-Wi<
z`}Uo_gY&+w6GCt9YlHiwO}xvO#ZmgAHC#xsoA4I}p@r-K<YBHfxklq*D!h^bE)yY^
zu6T0T6#09vVfruAdj<wGbu%#zU|&bdu+zM*dw*?BlP&KWd97mjYM|w&*bfUpA9G=l
zLiJNVcMR;N3W5VwqqpuxbfX{fn>nAa{J2Zxz`1*yydS-Oqb{e`B(TE^>{Ax@Q@MP~
z)i|!k$WpjKNBsm2^!MJ@Kp_QJ=^eiEn?{K+-JY*SIl3FiTWQ!17c>-odNa4Q_S?{s
zoru4r=loKsIm7yUacw0)u0EzK=5~~k#Oo=R=VdrztfE3w$4&u2oY4>{6-3^IGb;FQ
z=A!05zx@M}Wnx7WleR==W9T_-{FcqNXKZ2hLkuL?4{43@#X6ItWZz^xt0RihN@F@~
z3Ze)I;XTD<6e9e%5L&&d4H&^JZ17Xfp4AYoWU2HXmZ!TO3+#B2$R6_kZM$@SA8#~B
z&4rCQtfHpmP2&wovHBGw9cVIcgvUV>*JpwLd><g^6{OFAiS^S%PH8E}ND7Myc<2D2
zS`Sx+rAtRtJ~RCj_{mHbR`cl<WA5}NcxXktI7FJb#s!J1N3W(zm31sjlA`I{kEW<z
z4VhM-$+y<NXCd|(_E!s2aZ}e93bZ~?y0GzA@9WQb=hWf%<3~5J)WX8TX&^*YZA5n9
z0VVi-1Xdx2LWU4urhK^`sV@~~#707L@cF_&PgvJCHbOgy_p##H1Ox<N<KUEF1vlsp
z3#vuKX|#kwJ6HE)oYi<=kr2>3>3+)mJnzTX=X`27MGU84M_5x}Sf{4hY@5>wBLN#0
zK(!@%>MM?c^Ek~jr$A`n?G7;`!S4?hLo_uTq)SAEzR=RMNUzh`-hdR#6&Ww|3$@kt
zg+$r9D0ciNd%*?%Vom!q*HVy8Xj@?FPz0+yQnSD9q#*u~(4~ZGn$Ezz3-!uV1A_Y{
z_U$#HP&*535T~}B62uDyaG0ohWFpigQlJ(p(8a?PtWg3Z*@!^o`V2v~#cOJ1hBD7u
z;~9iTjIvc4-n!1!$LGBIMGbcMq^fMbdJ<h|9k0l4|EFG`vxpjBtRz4#8pJqwE42aH
zBQc|mB=}g>#l+VX8DP^D_9B`kY~zXaOt*bd&P;-ll%}T8yqKMHv{3EfE9c!4QLy3;
z@}%R1qZMZTnG^*)fLN{)XKR@L33gFhP68h)=t_G_q==LOgH6%#>}z%hOV9CF6mx6i
zY{z6JXB;bXuw_O+qS2C7!P0(^x=#xDuwjmt^C9F5Uv`X?=aU*qy7Y~c!!tO4NHezT
z$(<>l!fU!<EgaKR(N+Kopn6I$!3J4=G&|BD2*Jc9Vr)vB*{LW+Z1O`+H&5<zTH9b-
z((IvSIGSj28aMiQ!^9!6kXOFz%eFb~6}u`t#(H%azMgztt<B9pd0V^rCRall7>11L
zHB#9jKs!quTe~G{)#Fs&xcJ;I4ev%rM_~|CK_*|<-J()cr9YNl55-Z=t1a@$E%ndb
z%)Gk2W&vP8Qx#rTtBID~-{WL7Ik*n_&*+Eyr*T5~pK)SrV`*q)|IxtG#=*$&zba|~
zg7fizEnHOpS^-hvw$T(p=euftVstf#=ZFa1qCrIk4WvR&fa~$e-hMkr+b>4eN_C_<
z_~si8J>2&VBXFm$ZOYwcuitIVi^G{}Ro9Gl{%(BqVccc>VZ5BWpxf#7A<MfNiK(y(
zb7bs}DKUkqx}$m^U(xyQ*4c-T=Xq;+(XtVixcx-ZVW`b7X|5Hqd+6W+@w=@m^GdG_
zQJ|wqygpF@c$w0xdyT4BOI_U+c8mv9iiIt8h9OG*j#T}8vN_{X`2@vP`1f9YyT)i@
zbVqp4NCoXU2Ymxp8eeb6#Hy<(9Uq_9?We2j5GR5zj2K!;>P1;>hj9*)%&c%8O3w_q
zjELI^_-fZqxHOgZ&8Lv2TN{5Jn?f;h!3~fQkacX^IZ&LMfz6eTJCqr=4C%d*c_T#R
zJ_XjuFW8<EDE3Q2k|0@4vHIPUTaj-j&&sAqLZLr*JCM%!xi~mno9|8)&YSK)<}B1T
zby@8h2c}pJ&b|G0O$kUtsRM|7L6v(I1%UXzFR0AO+mQMT`^U(>3Ph0e7z_HrA69s)
zvpk<c(la`Nw+9oK&BZAgd|rN$UPJ`xsdMlw7=Z5yg+mmcRW}r;HoDh#BNPPILjN%g
zA|#SC;+QjJgf5xr$QH#|Fc|WKhuh`I{@M02W6EfE+(o~B)LP7<DNE|GY2kC%6#}6I
zG2;LeoRE*y^h)rLC90gf238u$#u%2|oThQ99`lAkWaW*R7_8<Y5?`1Zsd_XCW8V%N
zRwVpA@XQsAuw4M*7L&_%6uvI*lOP()H%8XFJHFwjT?bYA=<b*S(rC)5F9Yp(dGqEA
zbDK^ah{7R6btc~r3TfRcztiR9)KM{M0biBmNtiunM$bIKuDJ2e9T}}C4*w4=?-Zq3
zgM{gRX;j*_ZQHhOv(mP0+cqk*(sowbwr$McGu=Hsea`7M=c4cS?Oto|c%C;_L=0-z
zvAC+--D59AHrOPt(e*>7aKo(`zeJn0r}aZtNFf0;C_T#%dXlS9P2t!(#u~|Q)A+Ef
zl9v-f_ms7i9Er=SU}d-0!YXD7f23(itCw4xHecBKU1n|xsWptJ{8Fm*QTs*xIk<a3
z$mLQ#huD%KlEQPP?mzvT{G53Kw8orjS_vHMyuud>VTyz-!&*zMWa+P5s1!LHnr{)B
z1bK`3TYU?$z8I@dwfCn!xQK_=<ey#{Qp}R*l48cyCnHtVnaA-OrqW@G0cF-w0gY6z
zARvlxXn(#14y{f^ROZan=4nev8!X6#3g;z+hx96N<CRDnh*Q`N^q*K;5K75Uc`@M;
zEdw;<@VJ<5XI+?ND!R(aKd+!xqJg31AdeARk9m+0pp?~YRRE0OF}5Pa?k{3+B?CNm
z1gtW}@H(Zn)THHD`rt72$0sU~)-2uq4XMZNh^-tjuZai?R!XNN&9cJHi)O_}b5f3r
zuXD_FTS;vfK9`Y>Q@x}9Bwgy@3Re-0XRv7qnDTRal&&q<T&m(|)a~)vpDW@8c}Jtn
zq<I@qByKdnJzr7uaK1xpUU4u-8)8VutYVChtSnX>sQ+Z=r>TT(1Sbb@jDBemI@6Ip
zTl@y`<Mn{?<MU9NU}%9r<bw-{_?^LRa0#{+E)pyg<4;zQjK1u*n3%}I*(nzeX|nVV
z1QHKYrR3r^TFslCP(|_RlARm16~3mU5ClSc@LnF?_<&f|X7mfwtHT`<L=vS@mCu&U
z0Q_2u@z^atO=F5E(I~4W1k%5CFM8L(^Y_lf%xz~Uvq`PZZJS_S#)Fo`kJ4>%DSDU^
zw;(#)^dD0Zx(%U2lU{8uYIe8ol$*L`$@tl{t$B8BmiVx?U+>Q{@Pk=B+_iR@VAsEi
zpJ%pWZb6Pof{!}<GBw+edcJ{lxc&Y9iWwuJ3_0NqSXckfg?Ya^mkBTcU>NK_aRKZ9
zgA0F0LJye0e-8<Y|3E_5Ur0d6Titw~=JPYKG2tenBn10_K#5mSEEXyhqVNMkD$Fm+
zFBTOlEGWzeBd0(?AXFqN7A7Es4i*ue+W}pD?siR&+w{3M8c`XAC7-(N^y$3M%6Xld
z#6v>NJ|@T6?4jGAKnas~-yrK9*1JV6cWiHMX!Je4%4_THkzU^Rye|>mes&1mbsyK!
z#3AnU)~gDS?bUb6^$Y3MCv*5Xac?=M{T){LWtWA;#@<$|>pQI<!{|HYwe%u7wC554
zC07r|P|C=Ee*O4Z`M$e#9hKGQOL*{DfZd8oy~hB<<2fH;xG*(ysR-8j-g)2k<K-0L
zb0$2+GtPyHs9=o>uSm~9qCOlvx6!;;VssB-bJ%;)$LoCrp8xG-8dmk^hE1ckC&nAG
zzzE$fVm7vW5(tVRF_EfgucoLM>t3!0l}DCDUqqi`Z~44=QmkK;;s>19&6Z#}(3)NQ
zND}*&*Rv{Ip9B6`FGKV$PAAEz#2CQdaUOZeD&8qUT*;v*z#Eq9ATPOJJUD5)8l9F%
zJF97x+g?8ae#;NGUmqT^wJjZ^3dF0>s6_@Y{kFY-+Ef9q#fb@>g(RGK8KDA0z}qu;
zizsOzO{fSw^5&@9a(4*bb)ZBVy}*(<xQy+^2G#!fC20^16Gz?M#L!q^A6JQkM}|hi
z85vTM?&=v##|iSXE5lIlW^16RXZ`DDm$+OA!q8e-DX0h?Q)I8V3|%oTC;*#MlhSNX
zezdliE{7@Lhy`t5L5R>gG0hB>$K63D&*ux*+vA=b(&xbv#LFK@v5(23KG}qk?<M(2
znSKx@a1tVKW7<oRNgD1?1>PZWQuR4h_pi?^sZsJou<|VA{A_5aNH1B%NxV_Re34<O
z_Qkm7x?quq*u(zalOcmBCn-`%K=POxG)^pQSvKB;o>pn7Dq#jX46ZG%oIA=-sz1%)
z<0eE1rEcNIyrPANZ<){1lc*jfxXC{yLgJNw2rc}y{(&QlrpOX#=@=1WqC6ALN`OoY
z6oe^ca8INN7bN*zoB(Pkl(b~5`XgIq73G}f43#ScM9bASFS`GU=p*(K9f+Ap4hz#O
zpMIREX)&N7HG^q5*y2I#Nb1(NnM<Hzg~GueT!eaz(e)`>_;w{2M0bujrMdwoKC&zY
zjwP;S7<pJ}iiwgkjEc20@%ksl61MR`9X6ge-a1NP`vnjd7cAhJ>Z!f~C&?4Vp;^m-
z(qcD%gsOm%LQaSPw!(A=Y#+CYW&zU0DmjsVHW4BiS&`$oJRWg~SPn~}M5uzy!17&V
z)T~(6(VQ;6JsS&*?Iy&tm#X5{@IYV^T;epEsu6(Orr^ttMd;I8R_Q+hC6Qr(`J2^%
zX;~U0`G<+MakMhXn~DG68f2gh+JOgH+!4^hWWCveT(VIi<trD6>J44UfJ8-mKM?2T
z0?5yB4BD9l^zlQWgyYqpyZ&4L4oZ>u*I+EAM!%vd+;gQ{gp{<K%%p@ODN}vUwuQji
zgp?SA&Q6p<cYaDwLn~v*$P*QxO-)g?T$)1P!%l|j<RBF=jg8i7Sd@wIdgPt;-i4?m
zBh`Ew)uLNwEY&XDpiI2Z=`Q%^<d_>^5aHmnkC}2n#|94|+hU~IZK%-o{>mOWP_lWi
z%Dl#E;zZZtzYMh&?!wA^{Co@c5<}qGKa-b#`QeaB2ejqSXEZk8@VJIP)r7tTzvce<
zN-b|+qjS-*lKrU<p2zTg{at^iSq=}69tHu?<Le`&t^592`ICDM>8l7{eBl--Zq4<D
z7*WdIsrwriH~aqB59ABc0Kkxyp~}cF@cQp8NKX>39{h^~J^zsf|IdtI?_g^8e`W-1
z$b;wq77!q6{?UNaj>8d0<x|z&<ZVj37}DeJW5l4>1nV~fCL}-%6aX#uCn7mWi^uOZ
z_7&2*2Ob9rZ<By5LLdY~F&+~j0)pEeV#Mf^QmY=U&&tugw)Ldr^{JrhcIxmlqtQg%
z8zNp*k(XD`xz4`NxmKaR=G~l#d%cD4>A&}ozY?9?-NaKmczGwIyib0vy_x>hA5NY_
z0cAWjFdBAGgyac5-T!IMMKGR3D{higFdIy6v-%y{GKAk;Ds&3K#;P=<W%yo(hu8#-
z?57|wo(Kd+F1fL}pm!Y<COx#w3tXb|c}Tccvi2pEN}5u?|C-)z+_j^Zf2P34O`v@{
z*nsTR@>eXzj0b0MaWlxiQ$x|IpVmLQfB}FKHkihWcEBM6+bL6x`=jBzNAlgTJfE&q
zsIEyXM>gj&ALQMHOEI4Pv8b0H*rJ0?ggdg8dgo@rx>8QSRaAr-<-UlbQ0s;1$5%uV
zUpR;TcD%jwLa*(1%9>p6e&y+U?Zj8qG(!Q1<btSvAZlsz%g1>?S#ou=$ZrY)|BNm-
z6^aBA{&RtIdMIk+TWS<8Tp5|&_y>^R!E$n`$Zu${p5A5&X+Y_pA}Ul%bGr6;a5Ba3
zy5lZ(RM1j4r(gFG4fnJ~ir;K;_(gu2l;@Q?U0q9joeH`2Q)Q2#m;#c41@j4-a*t31
z7!s8_)0Q?~OAEMEHCQX5B{h;K=#~%mEey~s{izp*rxTUCdfk0j7KN_wH*qkeAY`g5
zV$T1GljHTlLrY7W=!$8%!ai!5UyUIKeWTsPIcCFr@Z*>1)(a(?H8`BX<r6TjHm6wT
zQZTyMe43um;apl@SQ`vI&8{hnQ>NN-UI7c!!shj?4u&GO-UwN|EHQvlYB~8%IoMX9
z{H+@+X^Q*nvfTM57#e87PE=yT|1Tl1Q~5J6q9uNrvCqPctZe4Q6V4^9>V8lqFcr4P
z`LpJCG6G1yDJqmrrS-c^D|Bkw`v*>0AUf*{hRE|tc^1j$ceG2dmb_CFc{yquqGvKn
zKkm)2)bf`nAV9@~|0zLu?Av;iXF{No5FQ{yU~$gcKGKPa{KtS{jaIr%RkZhh7-(uL
zub3lpG>|3W1P~z@CZS=*sUJnAhUXzNUa*j@B2R$2Fj)--1X-n7&SA^i>kk$E=k&tP
zOw(1N3;<kAl-YSrf`_nUlpT{g3ICB}j3Obf89jQ)yU{y}B$cGCvX>cCA0JUCBsPY8
ziyMZ*rENqfTFnAuV{cpI^BM7R=#20=c!M91QL_4qdRGbE<P<4oAbpQmVhJqDLz0J=
zK!vO_9PXbahENFe3~~exIsC4{X5w+Q4K}JPQG*W9JD_wNy2TMYTR6to^?rJ`-|&W2
zngpaG1ej8RRTRSffOBQDa9<!ydz37YA)Ub?D$fWS!BiTO6(uf)qe;8)G6M+BARziW
zBZxr6h>H_gu(C9h3HaFCeR6ZY-|Vw19^E&4@BOG<%oR>AfZ!@F>at!~eL)o({vjZP
zp=u-Jqz5u)Nm?hxv6of9Oj%y(UlsU{nJWyfdCH2Vu#-+r8cezV{q&r>&aB8I4WFy0
zAG?<hts<;eyl|;g#zReEGo?<g`8p~mQf9}rkwU!>2%u1bol;%f$+Eg#w2)F|1Huo?
z*gQ;`*G(!Vp3jZoHzW|q-ZXsXl_Hpsk)ag0RTy)?Xl%ex+Os6(k_)v8m*^HEKy+*o
zP~CBl5e5^zH7et6;$YBBr7uXGsV|!)KD+wJ2_3U_?;#4#v@6PtX|JpX_0ME+r&FTL
zTT?JiFER?rpG4*xRWYE=SQ=lV_xt)`-9Nj5-?pcWcgcj0H~V$OeG*Q3T8|(shzmB&
zPZ0hB39-_VXZ0L&%Y|i>Tm>}HXf{eQ=pLQweR($g-sAB}1V^&u1H<e2C)ifX?mG(3
zjo^=`oR!{h0HPupl32QU#aSds=CulCLS5*O7Du|FL`hu};CvH;c6w25t&Yd9D_X?D
zxsFFQFTBm^*{zzkzG=D^Gwt$CXR2&PUI-y6#kLOOH?eB$eTzPuaClCh@wIy?Y#ORw
zVc|PPE+uUo(Ik@37;3*?-o}Q8^{y{{suil5`PAU=WO2FjEMm?2bNP!Tcfh?{1)i;J
zYZymflRze!Z=V-CHx$<r*27);J&va(PVhOGJ@vo6aay>dra0Ve)*`&`Zs>Z+Qs68Y
zYqJj2bEPRe8W=M$qpMq7Dm+i2B<a^>6K&$;mB=pj%fx3kk3rOaaHept{=N%8o88Y8
z9X)e&$}rm22>+eOuo;7SU1moAaO&DLO>rOLuye`(oqTkx(n(`vDWJv8NocyN&|f`V
zU3bT)hOCckKu&q%=1^ccV8{_vo_S`Y@I#q>tPT4uJ>`(j>up_c+h_ch=K*s2q900&
z^L1z~U){?40u$e-bb2+3Lxv@Qz5t70XZpzn%QUPX-)?BNeDeF(A1{v&qq$hzj^rMs
z&^}bP4w!3T_-xO_?#G<8GoEAow?-%O=u>$TYx=Gy5YOjf(@3o-6w%DY;^K9$p@XT>
zSE}fwKL>3d6_8ime)ne&1uN|tL#kgDiB6QfMWwFoBlKmNSGUKxATM<Q5Wo`j82kMx
zdfvaw2H_m61OX%ffDQToFL?eh+4#o_00jEWf6X&I|KS-^aXR9Nbyv&wTay=_Zl4Y3
zb*$5Eh)VSUeTnFB0wp#i5iMy>O&kTf4=|lV5gd-eu?Ub2e@Fz8a1l5PC;|>b2ufh6
zsL>zTyDf~X@-x#H)64G{N9v2bO`Q}<{!w|l>(`Ix%a2u+`l^o<$2gl46VA(d`?s3M
zmDCvfaat^_xbt&L$4_N+A4a<iV`kTD*WFU&@+_7N6yM~giY69TR}@`0ADs`E)YqPX
zJ`i+<Ek6U+(v+VEI${IeM6#Y=*!n&8yK~I<_POabk<PQEqKNiUC0Ipo-#iAo0rFF`
zYl;*oY{5b)Nwi@Lw9|@Kd1P*la`e9&9|t1ZAJgRAx~g=en%Dcr@k}5q02l<x5Qm}@
zdiai?ICqr*0(9gc2e}wobt?%?ym|lJLU*$S8RzUJ&(7pu_etDfy49>wOqKHESMja1
zN{eKc;f>nuBg`O9?sZDx5TzLDRUrAK)>VFtfEr?^n2d>q?Jp=YX3Z0t<aK5hlBk9B
zFJRdv;xib}1qMpem1;Yfq41KWum)eWcOE1MbrIFjYp-_OB<gFV6z%ry!4I-wG|bJi
z;d=jCqcq-{7BXdP@6@+9^_Lwq9z}BN+<XhGgiK^}iX}7>${Ru;{{m3<2*q@B`ji#m
z{siP@;pRSf7^bi>CmCV@a2$e^wku<+CHwU(bCkUI>01mw&)4){c^3pqxq6(E{!E3H
zUYY40WpNK{Xh%S%T1Gi|${I15*{Fo~Fwm$@8|+DgVk)FJU<452)`E5V=J=Z*t}24>
zo5Sbm3&QssLrsVIcl2g%r#u2{Uh$%!RO?!41xbOK&EOq$Mxuxwr}9EfGWRhpx~kQ~
zw*c9#5rq7&N|bz7<)UgDi^HSwp9F+LDp~}*(2adszg7G*)KRMv8-`P@TjQWu#!>A#
zzoW$TX1_EqLH5M_0@Gl&Y%ZN$*DjxMzb9X)rZY7o1MK>-467BhBe%GIP*;wRpA4%-
zSycmB)R4#|+!JH_Tf#F`FKbD%yi8o#`7ux2EdqLh0c@31V`5~Gej_af&hGZql?S<?
zHehx2{8kd`F+wG(BuJKM4kCoo9LfwMq%w^58YGvQ&5d_6Eplb+cpwH(Sug4NW{LH8
zNZoV<mWGxJDg>0HswIUF3W<N56O*RD1BPsGgX_Dn8fHTJBv)`?9I{JoXgFNjea{Qf
zdsbh*+`5-v=r|ONJOiD*gL7hrsx<^FN)1yLBOW3YFORH1GAqnkRNEFT{3W_N7x0=X
zV^_HlK;8)y6ja{4is>0&;|<|355t>iMf*#fulimVj`==!4%PjBKXf#t@-j#(^1v=1
z74lFk^v(6mBU;UaR&JRD(u5N`R)J(!=gqs8h4^D7MAkS-c?LRN2)PdqDdpx!)tAOo
zl_SuVI2Fv!ZL_%^9no*FXa>}(<+jb23R<cP7)4&XaG`aDz+;(2fj=?}Zz`;pEOFyk
zQW%M<g`WxCRo#Sbdlh>2GYOEQk_c&*TXZh=ydT!-*cD)sI()AZYmFoyb4sMnC+iCF
zAiDjaUg@IfOSoGcp;i#0i8o5VnB)9BSsc%F^iqcC73nB6%(an|%iChqOwHto#oNOf
zqY_T&l9hD%QC&AyO1M7^-JandrNiJ>ybv1@eJ+5Z3c#dFSJ~>9tIaa;G>9zZfdPHi
z^d5S&=-=}1vn}3WjM#0@CaB#4xj@7f0Lv1S8o~Q%==)If2z-OXL}sNX>-Vx2=c|>W
zm6+|I=*(5uYqnhA`PhwuOP7bl)IfDtiz3Pu?d2nIeV+)i>+Q}#%z;c1O+alfqY`zx
zhX2+4^U?hJJ|cX2Skl%E(v{pbqtFP9hXa(D*>QC=r@N6;f2#c;RO%PRuw<@u9l}h*
zTz^?nHoKJN>IOqpbv`!xlASbRplI9@xtWNh%4bF;u&uJ}4(GO06@{zPm<k|&2)Rg(
zqjAmiFflcx&AV6!5HNYd-q|^@>$+asXlZ7=e>FGtyrs?eT<>MV^+tVI2`5@ojHrzr
z1K6?YB~?463KoP&^$L7-ZY~t5%w2ct>}gXvG0G;_s_A<=^X%yJO4p<B@%)UV&+&6#
z@{WST7i{1JHBGU{Bg&qai&e{vQx}5iT6V2zuFBs?lFbcLdJ6r4NkqsRyTtCPt*w2^
zmS%N-Le6g4>aoO{MC(ox5S7eA%Bp5FM63iq$mIvjcjMIm3($)T>PYa}50Ox`*wVMe
z;G*kCg{N22WNrl;qa@Rc7pvx(ZRI=Ad*)MexO4K9C(!Rm*=)<s$NO@;(hm~kx)MLx
zr2kHu!-x6px;s{+AH83!SpYFn2atEef(uPH%eZq?-xnTziQe^wJjh0fOo|{HQEgeZ
z$=4h*_D9^)-+Q=UJGZv~<CosM3{#BgjY(Br8ikHuRECb`Fsv}nEf%+EB<0cNt<-2y
zyynu0+u?L9%+Bu@x#hkutEKm4;8!np+@>ZG71vYy`y)}~d0VP&xm5rAujDyTN2}NI
z(C}X6^|`My&)a>)>F@W00bp@<6_P=(KKJj^09VJLc?kgkoIw01X~6zhX|QvqHL|z2
z{@3mVC&ci7%^JWb{+BfzsLRITsH5^;FRHseKD2vznq6?j8k0Z4z~xH>g9^rvB0-7x
z0%g^Y<&82$2Cp=TMl?=ffnE?HLB&TzC?bK4lqRjjHt;fkYHsSPUMIclEjlA$QMOD3
z=2p~tE-pUjcwPTG-ZER#^3I`;t$Rhyb-tfs_YJc4djlz$58q=$t0GNi2~P)$L#9EO
zW_Y8qY$<37Kp?Vk>8KdLx5EI(-tn&2n&kSuiOcu=5y!WV2SZT&(CYU!H=z$pAhm{)
z<sWVBU~Cv2)4~YVM7Ar_T&<Wje9}#GSNo@<u4IKSW`jxSLZZs+VYQV?9lIbEA4T*l
zQo)m?#0oEf-p<F_leObJkwR@7vcKNGWwm+OHF=40--5ZSv%ZzO`DZ?b68M@$By>Ot
z>q+>D!v5<0Ko)zgX^4;RL?fqvm7n+dVyfn6;4KCh3<78Xc~r|}SCHe{ctRT7`L%Y>
zFE8`p_+KL@T>kw7>)&r*ie!4^vr|CvfAAIX`Uc|VnpvyZoVPID$h1*Ve>MZ}vdyRN
z8Ng^kK{~i(ar*ysA*Dw{EThg=a3lwo(8_7htQiGa8+?_+b_7l+rQC!fjEJ|yGOR);
ziUw|8Lv#fPN^lO~|9<2nQ<f4G*mg`%JoF$vq%;4(!?XhL)$kp)#Wnk>ZXKoE1*@}$
zzcV+4flg;<$fdi})w4a|Y{!s`397Rfa!nbHm+Jm(6&|jgmn@KGjubmmq;{Um+JOm(
z+%-(GQ>F*0zC*g!#RewopV9kZ+wwRD+VXv8^T<?i_J<GYD{Dik)j>INRgw^-G?@m%
z)U3&^r}>C#TcrS#d^cnyZU(A~I0QB%R0j&p8|L_3H)<Rj;~Gd2U13DaCbJ{#_qi{M
z%873GhSvsNO7o<ewbWq<Eky{I1J@3zaWpRF6(ndu@tqhfQFMKOy_8%iWO#kY=8<E}
zagZB6c{`#-Zze|b97!6n43*+gh*Fl7^;|=E9dpZSh>OtS%9?kKq*+@3CxYTb<-5Od
z{?yQ~C(hOS^mIle<-1ae#V9$=wY4KhTn-*9aW<WJBBKH)KgL6KdAc42Yu_>A9-aMW
z^O(+nFRs3Gy}xM&W8+ij&puiTN4ggNsI+c&7}ZQ5c^ek60r3q*lUR0T<W_{dXr++W
zq*>xPgP5M#%P~3g#*2uMnF=NDCDb|FQ{aipoTxBL(CWj9(2A5jtF++r0tQX?K$-s{
zc$cV!DFZoR0X{zFnB&DL<Q4Je>%F%xJX76bsp9^dE?S0}XfHQPj~Ea&#8cEO&l{6b
z6SJs8KqOlhSm|%<MJ|Zrq_Ak10Ky(dNY&u#2c8nDcotnOtV?KV3!cA>Z=#rp!*Ob=
zDx_G!$CK}&_SU$u0Rt7U^$cdAa@x;mq3i+~iKaY+SK~npIIPU4vnKbIwzd|mjHV)F
z;G!CB!Z4q4{S-Gf#Bt=2TvpvDR;%gyD&GtIV^xI+I7AS?4Jh-=@$;K~yvmq=Ihs%N
zDe7p<+biSelt=11CpNb3s(0z|-v4<I>WziR+UQ-ai2Be5F>CrnkoO0~#oA>+QflmL
zX?|S=ium`_1omj!VscWA!W58;wH|(Vl$zAIbH>@vTN2)%pVUCnv2cpXcmABLCTmWA
z668`zzi!*G7yLnE3~>l0Tf9g}C}a2YpT5!=ZE%g<;*_16k-TDv9Ig_Y(nbFC?H<4t
zEW7AYevfM&pOhB2;4VD(JglWZ@+c~|Vkvv0?3hW-!w8^s7?Pwbz_DV&DI|@#@J^i9
z+Ff{hYa&mFeYiWRc=n!UIw&q2BF6x{UEgc1xx{H8nTdq!h>B{-2tw)OIzCn!woA|a
zClQ}smbg%}Gj(dQf!aS_IBD*^nX)&=qQ|^^hv!StioWN-@)9B~LjQamm^ComDJR29
zB$uluAwyaw&y>(k8ogDOG86vlLr)IJY$+bm;nY-O6b7LR44<B6utjMx*hjOK3ly==
z%>O*f1W+yyHs2MXmxxrP_Hf^y{Mu#*o;`asyeFd9Q~<ZkTjFMT00|L?!gOw;dk!r2
znbws~UAQRcKcF_^st8A5uKZ>MdT~P_Wv}q_#$b3{Uv1tMm^&ZFcv#yrxUOKY^Lw~e
zmb6>{O;HYwCKlC5BAY%R&-G^zxneMf0+OHH5-*_%A{7FDj>KCalaZ<zuOv%5(90!<
zAWJqANJ5*D=<bPohUfkKRLIxi`RQhCvW4%4@{?_%)y;K;-+Oli`KO=n<yogu!zj;c
zbfJg;v~6ah_9a{KScDe}DH3B@xbNV19{PLFx621U5I6w6Oc5%ewZQ4$G5qpb*1`7|
zf;s;qhW}*~<DVG*JArE<6#r`kh7kDYfa>1}{AIW4>HO&Axv_aWx#M^-h>SznV3>eP
z(`Y&bKN^WD5e~*5u#M1aBako}2^)v+9~_v7F@^@`h%zD<XI^Ulrl_jxvYoBHD8Rxo
z-$c}=syqM4am;<}ea!8a?gY1e0DS{ncVmj)G{pJ!vDF!G8rwGwtD+jws03Lfv~V@|
z$eLZcU4xPmAFq_ppG~r8wF=8|PEun+5a}^eI$$p7_bqKpgYlJh>gM~AR0Sj=`2(m-
z8z{^PW{K;lI;w^-LU9hCx9o6MbF)S1l0$I|LGJR*h0#^*O2XXLB?UI9Zz^u@>L4w8
zM4H2?3r2?D!+&vTtT^5GO-_?0&Uxbuy9Qir9WL6g31Ew{=(hBblSm7U$jPK<A!)BY
z>!MNAmmQkL@7F11?~5a^_YO;8Os{>x1m*X5kH48Xv9BL|_&O6<9zzg)0=dJV49RdL
zKro7k`=Hu$J;OKFLisi!ex65+khg!cNp5sA@Bd|njo;&Q?WUg>!0&VOGIf15WPe$5
zJIu-3AGC(pG(94Ln20T_-wLE}Tn@w)Y`C8-6*{`CTeIc;<=xjp0}CH`N$T#I8c{SR
z5lR?j7%FqKmf*)qHn&O;$_A8}Ua;BtkaaVJ(^U)R=H&g>E|kLT@J%;w!R&%@?@*}Y
z5dD3y0}VK?dK}_WXJ&&uL(#SX769j_?05X}ZXD5tjf74eBQDPpnH{JC7o-~c?pC&f
z>CB)j*Gq|<DwQB~5%b<Pzz`W%w1Y*$0_P;;b;hG%h5rV;kC?2&;o}XHMt_sjRrYcb
zygxS3iSeeSm^<wp{<Agc4}~yBipZP4jiOq*403Gef}-DJ$tpAf{h?KYy7`hA%CFL$
z3et+!FN_<s$v1!|r#KQS#<Q|>VmOiNiH6(;#_mw^i4@8046-repRUnxFHO0R{Ah+&
zQ7CH4d!2IReQWtY+(`J+VT_45P!zJFjFfAX0Zyo<V#3v^o}Ey0crALUh?-p&EToXx
zBI64Q_Oh}ymGmw9-vEXOwTg|1r9qR*uqsSho!NtU0Z1hgLLs68^3GzrdeG9aKZ4Mw
zsRFnq6*Jw+IGk6adwON4tpoAIu`g%<sa+!NnPS`GiKWX@>jXmC;`dAwPLVp;i|tdR
zmo;h(zs|TZ6Ddl)#T?CZkd(efBSC<sOS*$oQ-fja6flJCstoZshW0hWkRhifz`h=9
zTtroggxH{)XCP`GdSkA-omadJ*We15L;XhzdBZ+dM9pwe^0q6`H_dO6!8Eyn>g4;v
zMrt)=C>NFkOuYbaa1qhp<ZKO%B3c^GF42c$koVb;P@<M?u#kC-Qc#w_@)>-4ljoG{
ze6Z3LP2=rgmRE!tMeftoay5@|rkF$rI61X_i8LY&1re5#{zyvv*Xs)#gfqbzik2i9
zh|lIfL_rtVfhdd{m9jFHy-R5`4bRw!Q*fZZQBnw(Pzu&88bqy`Nj{onKeL<!G|$2I
z%GdD}#BVQ2DWok^e{q;&%dr$SGuo(xxQK~q2JYsM#U|9MG0bSIJLO|4EwNp@W7Cr9
zlMZb?nzj$ejtVxMEHu_f^rweHn7A`w?eA>aB2mO<)lqDGZvj4ou)Eh-2eLY{-f;P|
zVQvNA`vwnuyR|kmbLm>sdc}WJ97Y%`%4T>@CiZd2HaJy<nWNL++zvz%*$0r9DJ-OB
zTb;LTt%<Q)K`&)tHX<+#s==)Nb}=8iHQ)wlS)a;P_gt=CX~!#2P<^Gr^Y<|kGZn<8
zKS7}-ma^K;jCRH?b;!<bnjs%WNMuA=l)E55c@lxlD7WAWl+2(q@;^;?6|QD#iSWuX
z`?J$Lv${=*4V7(j*M*dSvDB=EBasp|p9~$v$l+WjywbN`MWTy((4{Q(g}#3CdB?QW
z)jS4@K5oUsX6?>%m`>T(;ksP2^l-~;*g82m)F4@mn2k3?^T6WXXU)rY+8QitH+6hs
zHQW_2uSeI5g|e?Q#5^=Igeqw9X63e918E!{Rw|5+Y&wsI_^b9aS4&o;Y1lxbgU0kL
zkEDmQ87fYA1;rrMQ-DPolWgKSLLcgX-L&a{@87?MsRM@>#vg3I1k=Yjq6f6JMdv$C
z8f!2ejn+%AIT-#(EhSjv{VBKH4{Ep;IFovpOuQAmfC)rtCU^{i&-?bt-;>^Ro#aL8
z-`4Z3mcxZt-(ndNf^kjk?E<s33M9?_n5*DU^v+jy(o)JRL`e_{?V0;0yWF{9^1cwE
zib*@yEX3W@wbh-4H@8b(x3KLh{7cUE2pv&js+;v=zk~lxux>N7gTexzfjyDt`21(r
z^qs0|YSeFvGEp_2ItzbQp($!p`49wV!l@92qwG<xd(<wR*X1w$-tI<o=pqaA#`RA_
zoCfa3N+!aCM5Zij+f$ok7BaQsUcI$OS^IOb&N@B)M-Nhe>BP%g;}5QLDZuyjBmH04
z*NdB{+@^vz`FHHkV%2Rm{e}G6|A>90|BZd~pQfgEj12!1`Afi*pZ_n&|JyV4|3rQa
z(@Ylt0BrZS!#saG$D{Dib3EBD@q!X4h8UrFiWA|i#ApfOFYrraDT?%-&gz@2rt507
zsFY^r-<vtvo497fHO0arhB+u_b2ZgL%XFwYTquYlVrHTtvn`OI6VhX@>AIVu?{e_h
z&%W2+cfz`9W}0R({x;Js`@8uV*m($#_N(F`5UbK%rQB-rG;E;xnyF*4t1te*^*FOM
z6Cdv-heHFa#C6kM9)1_YQ$^?8pQ`)wwCf?6Tm*^9v2c<27Ck#!bQFla_Hl#4`7*!|
zbEw(n23|Jaz$nN!WxU<MFUWY?;2&VTmw}Ct<(^{Ffp<_AvRs~MR-po~S1y43zKF0O
zBC})VP)cg9>)DZE^58Zt{t#da*}6x|PK7&a)|`~w4`Aod(6v`vT1N;x{jj5%b*%|q
zi{IdJslT`M(7dCPPyH^6xwv_rzzk=s8rpqv&g}b+yc=H33p6%<!?)<~YEGx1>-sBf
zb(mnEMpLhKc6N#gIG0<MoixxWM=J1H%XZG8fpB)!s9Ka#+7RbB;u=beuYqOQ5L?To
zeb*q~jBT7S%)*RwpFY5X$mTnfv}_3q_#2U$+UrZk6-R#o?J(T%m_EmOa`nKt85Aeq
zvzUv8N%7=Oh|8z)RHb4^r`_lDJLqfj*X4w#JbWs@_Hj5sCJ$vyj%FZ5Wynxy?KN=>
zLLrm*hsfrlfP<3_*J3AWfc?PP%O-0-L_HIKEbA!TQpPXmZ(Xc<;uO};)FuuctnGkP
z*MX><YpZ=M`NhhKy;*)k8qXnPXsjS$v`64(OGBNcc9ttc_pYZ`>q*`tjjVVWe*>>P
zxWR>N3_AAL2T1%kZ^TG3Hoy?c58LGzh9B^AHWY&q9nA+NoDp%Uf<OQO+F~IYKuY6p
z|NYnK3f1*q2mZ@cf&VX!*wW6-{$G1iGEhxV|1Bei{QHHuXm#soRdrOocSpVF=^U@?
zNdT@{BupGI<#0w|$Ql*DOeKcMdr<m{R?O|6*@Z!j`MfWN+uIqogf*3Yd`dQ3VViOZ
z7Azw{$buEua+J9Om;r_O46o~rUv*B?Tk9>$e9TS_{#z!8*<RCI);{Ojab0lOtf=h+
zahL`&K?^V(5{tK=8E;se>l)|kSi&@N(yj@&rnGd&Wpmvh?~Z<kM5ux`0{gMaj10{O
zuHXkb(bhN7L-BbP(GSt`yhu4c9m;xjKERndrt!u8Y#VV!?&VbIAKbcn-c>EWH#Z+g
zyFpU{ccMY9oFo^n1S>Td4tfw|)yoj$Bh!~tIhilD85!CcJDr2b@zCIz4Wy)KL5!pE
zK=g_`>tUZ=^D#Bnxph3vj{2Pn?R^Cx7ibuKz`c8-tO`8rzlxksru2Iumc_M^+TM{^
zu-Gi7Oj=b-<xRdCWQy5#Mkqxnm6|<YGsbJ*yY<)G&nSXG1y9yNG#K>w9=D3R=<{Ao
ztG1|G?*o{lS&|sUJ;V#B_LC*2`;J3}`Xyj=Ii(h&3CG1-&T?(#)vmVdzk38n>DFus
z3Y_mYjDMlWbupwB8z$b<wn?yyCGNMv2t>0}LsNQt7-P>Wz6@~UQ`yD|)YrzZw8V@C
zwf~`d`nX!Dqb(nQf_;Y_jN09i1^}OMdRdCQ@4PVIUvkI*M?k}r)AcC<LbSP0cFmWa
zcW&RqcCg`L`j@&f%crLHu|fl_XA`yUl@X?1fzK}G(z$Qq%)Lg)-88gkQ+h<a6lxy9
z>assHo7PU039-a8Q6gL2+Q+fl2LJdaduj_;D_JyiIXv!}h98?D)=wa6Sqlac;-ZNJ
zavfXW`~0aY^Tks;erxF0fwbAMjd>T}@*v{m@6tsTW)L$U#-L=LrG+WpaX1L{U%KF!
zl#}iIbIW$HR9(nR^P{v>i%EJlq)n0}ATMt#mHVfw{YT0rKbr|=l$c)k7bC}0oqZV|
zaWmU5mZ4e2lU@LCQzWUGx-Nvnjtyv?EQ$bJU0A&icnxYzLoWC5WMaNt75#9v@d&*)
zb9$y`4FLpF5%|Z!d*@=ynU!(Z@|vPu7yE{XZ6C+8z-~(hlPCQfIDtBz|ExKROs8AH
zttP>w$#27Hf5#L<U>oTsrz$T!?CqSMy02=J6g7Ho?pKe<WLG@wV0()=GK8l%)s&rk
zrE<e{2N>WgA%jVfgnsR1o^~yC4KO$w({^P60UXFKjm(G<LLT1NUt4a7{?BixvTx&)
z<$Ymd)RFmM`B0#4`HdQ-&;&b_Hk4DnLFZBoJne92kLNcJ6ZpL$zmSrp5j|`L0SyIX
zURA={fN@@=mk#22#pwmeG(W5!arX5fEMBHj`Vav(-I&fcBuH3%Hja-6dhp!ua~w!`
z;aMkkXESp`%Y|}Dh4$$6vX-%0X|7SpD(wov!3H&|xVpKOCCC;q!_ER*u1H!JK4~JS
zS6gc_QBn@(`OvBqXqt&15IU4hVk*cMBY{5VUae}GTqNoO$Ki}i{&=ZWvg5(=dq<VM
z#jUxB;l1Ki6V!sZq5d!KccLLUWF|s-O0GzYaQ<NZ9WeJ7Ta3|FitPDzHHnQR;}_Cq
z?2SWGrAP-Ejz@5+_2dLat|#M$4KZenGZtpLxy(HA&Q?H}NR{Srm@O;H7)hv+5h266
zParA!;Qc}^ct+%m{Q<MdGG?dY?9=Zd3J4h1G-J{0%8V|tYY2&4R8E?L0B<DTkx#4B
z>XJt76U$-MAX(kLIPODs#P~x%t635ia6i+v>|S&bm|&L(AT1k*`XGo>d+M0;SpAYr
zwopPQQSxF?PT+xG_7Ama=te;9kbX&&m;X}<NqzmunaCLiXZS$o-hABUZ#N<6(;jLO
z2XGnVLm~1epWe`*#6+VB$!G_|K+q&=(<sO0UR;F{fJarTMVS{U<)~KxB2s<zf|r@i
z{toE#hc|C{WEf|XN*$Y-TEwFgJ;SWvkS)&W8s#SY5t7BszQ>U$LMWI5Wte9R2-bE}
z?EQxG#n*ylCMn4rov48^ym3}2d>uC3S`%Pmd<OR}C>NhZlBdunwBh1mS67o>2WsuS
ziyGr%1F2uv6e<J{zxyc!(f<ZZW|Aa+Si@BlLI;Jr(h*0)M1TqZ9UbB=Ds02C8j%$}
z?dR*=56QCEB-gTt<WiI9Q<~vc97b{4EF|qG5Mp4p!^)d8{5U1O&_*Em8dZnWI~taK
z98ji-ADM`Z_X(cxun>Z9kDm43n&0;E>C#EdM+u0#2?+%1-gJ4*Zj>c_ixDl-l_4a?
zS5lS%(C}Y1Q1nZ70@&+yy5t;KH$Di2N|DCda_+7enlrcYcf#R?z@aNa-txPHaozVB
z$E|i+a4y;CB{#%rlR7G1?cQ1?w}R>HAUW+Z4YG}v20+2@S_-X3rci-Kh>pJ^LZH##
zL0MU`HW;){bWV;5&<Pn3_c+eBU(RZ2`9B^`cB)%2!4M@VKZkxI8GgkWecvc&M{VD|
zTCJQm6UZ|BivD>I_;oN1V)xuI6ac}5BEp->8cOAlKsj^hDL9HC&avhB5M?ayb1t2=
z-F`X|PCHq$Fn61Mh56ETUjCt;y)0cZIL7X1Lz8PYy9gFwinwQ@ArVIb-_IjLAth}S
zu7?`K-{3a0l*V^wX|@m8+~$~^e%+Ej{OX%{^n8%<sqJ75Gi0Iyszxg2cd_MuC#%or
zj6^`{dKzm-?KNqtoG96vkGtNw>#DncdvWZuzqM@r9(~Q4MtR4^f;0q#MPV<hT~qt{
znqNow$?>dOu!WM!p#);H|1^uLaipv7GiU^QLJFCZG@PeG|Dg;Y8*{OKe{<wh^h{H=
z`E|aW&h3LM`~!RZwym!E<2?%<-{ZaORCn2KVOZ;O`e(^y#dNO^k<nxc!>f+_=T)cF
z%5JFM_U%|gkTJHJ&hAC***ClY)pi)OEFYt)ri*1qBcGxthnx!iRA}JLA@TM2sKRzg
zLcyHLFNE@M^<zI!41kJxe4w}rHP63G8J8xjq#_gmAOrP(xkCRpDf_#RSwf}$_k8UA
zA3nAor>c(my`<%p=kxR{5A%p`AUO)8k4hnkEM$10ly<l<@nyESPW4ab0{SO93lC;Q
zFiYvJXcAdsb7>8I_kxAcV(NOa5Jqr71{3Z$W+-QykEZqO`_dM(KgtE?Yh&H{yYKdO
zXASMs3aaOzyoQ9((v9dJ$ety2?eT;awU~u=^YZCuWyvb*fUkDsm0#SVJ}vaN{m(u~
zLMEOU12FD!Ou6kLOLk`!r&F}oH>0@MS&O+FmzIn)FcB^-HbWAP6^#>@g`7<)(%;^;
z3_ka2<;TkbJTSp8G~g@e7@^n=I4d3l{7f$M+<VVMD){i8i4@@U7421ujpXf+)%ge`
zMD;@fzkF>ecpVLCI32keYJjgIW<dOZ$q{O6o%Qakf9Qv}4XUdd*3;6G&Ur|sf~~Po
z`<Htcm;m_$$D$IK$D(_ozSlWv@8{`Z%6wn#+P+c%Y_e0X+6(kHT>fxx#gzYw6expC
z4$vUQ0W9^~q-Sfu!=P(qw88~T&`t~TPD8{K7z$QTP8aicFywX@{2ay`1<JzC(@dtf
z%S)--mU3C4)p%}IqhY9Jx_-Yg;Yog&YnM-8dk7l}w<9D2YL)~y%s^!T2TVw$N~yEB
z<*L^?QR!#PY$I?wIn!gvtyh>j?ld$x+mz%5>!t*nfvjmF-0K)sN8eoa8OFh}pz=12
zmH8|bs+}wIpz9zeQ&jh9#k8Q=)ex5FJ?+gsIqj`HkX!lvga?5GjQrjz8eZVMpK#?~
zMUjkgs7HbgffUSj=8E$&N<emOL~IXPWnR$hh`kxTz)c7+MW7rM@MJ3Cw!WQRy5F-X
zBF{Xp;@ww(#QJo56K*JeewMCQ;t<xlQRE7_h-%Ti^SF695XxFYJGMM6YI-PJty)<5
z=CS<U+mcZN{vE@uoElQTZ&|sCATOt{Aa3@2rth#qie1$_sdD)9<5Qwo0r)K1btD<e
zgo+X*UzQAyraBThC;fWv+FlFVjbHMxL6S+U^BD7Xbqz(G^1RUibxtr~nQlD|yX{Z~
z{@NWU=q%+R{&$Xz^f;0fhwBZ_YANTuBg;)M#`&8OF!UPK!Vk%i3R{)*6`{qz<3=hl
zfMo`yoQV7NpqY4e8|67e@tW1Sv3Z~{2=ZO~v71auGXk#6s<p<!9Fvq;ZvBW|mxBoz
z2R<YUFE0vGByeAYN`GgWno-A=B*jh(4!AiA_$tK%G&uaoOD3x5NkdCjUthv&zoY%h
zz?EDb>a`@tG$nbo0}aLiK|X}$&@+dg<JMs=mGfy;mJ|x8DEj_{Q<_C9_U!Bq0gQ>B
z69;JYean$oHO!l>R4wjf$yQL+RO79o`S4R>1d6<KWO#!?gQSb=Z}CWm)>-M(#U8!F
zqU)SZijwIM9MPJrSX&U|@6K2ktEs{qSUw15<Q?;@Fd(J~h`FKkELbD!_)Ia%uq9Uf
zt9K6@kM5Ef!?)gtiXa_|_edF}0f)VlP}k!YQ}7*7uglnM_V5B3&dEq=WoXi2-kh`2
zP||^*G~`&P^a1}4N1~>{Mk!Orp(Y~)g%&NszUR9HlT`|s)$BKyeX_BbeVq=3e3F#o
zmHxU@M<a_^PIh~eEHKD(jnSAW8~}D2LpU^J_S6_})09a}c1#ljNI*D-Do_Ig@&Jct
z(}E_SX_KM>nnr`suLp&q>Wx3<oac+7j!9tXG&k)a0?DC^ZsL*mTP6*qBxBL{1mO<w
z{o+6XJC0sKC~jy!+XGwhdH@;>n)EpU5`w^*9EJ=XFX+Ui7z6O&Fz?0^dBKSt+Yq&b
zmeY8Q=?{z0eq>nzdJW^Q;!%ndF3Q5{h-lgnE|UFos{eq%J!*d(lD^4+M9WS)yZl3s
z=Kke}x)FG&EGPm(0>j}A7yG24!x&^2Fj@*tZ*tp9&E^@u#raua;+G`{cZtg$%wMll
zu{YhYyoV^hWR7OClrLq)n;=0>QN{QBTCfm9tf`&(l7{P$ua|a%n4W?FlyFh{>lD|R
z1s<R`@*H{X*?4nF65B{3M4`hm2NUjMIyjsG*1TsYWGmX7D<?@`u+F}0;Y<<OH|Q~Q
z>*}$CrO+)-fl_gjCJE@BO!szcJY{2!^p@{ZhM{s&?CIncqtOjy0zd$pxg!IvaVZ$;
z?VF{-+~k$UCXjANwmmY(zcq?iwS6Mrp(t}&^b+uYeR|?Wqf?=vS+6LAIz1}<9?({m
zC#(vI|4~x^q=oYwTWUciiM0(@;6y;dy~X|lCc2$oJu8Fo$LpI%oD!){6Y6xeg2>1D
z7W!wci0I4=Y^SAIH&wn{a)p*<;s}BF<2px4NXa_G{agd~>yp+|q3`jf+WD~Z<r8!X
z!0?_nO2Zr^9<0)Tj;@AQzvSwSsULYiVNeHhtS&}jb|V_2s68EMi=HZv>W~bUMZ7`-
zZ`kA1p59NlyWTomt+QcW+np2ONDgDoZ_jq2UC%Q~u-ATVmAl05NCeV<NY}4Og&u~f
z%l6Y_A86*+y=GfU!ofR`suZjhi&(kJYA~OYmhY3}YZG~?<)Y8Y3(RcGe2nZ}g_O$<
zYQ@5J^4-K`3)*85ouf<o24qnD?;lT6&f8+!ysdUKWPcc=hLBVRJV2a^R4|LX>D+SP
z3%w6-ke$!E>4__@zBz!A{b*7kW@CbuKZHE;*X<PR+KyHn1lo_-*>13{buiKc0`-d-
zs*TiGDzxxLCeJ0d@*g+oUW2YLi<02IGhN=E0<H^t(aEhB-&}eW-dIt*YqG1A7VMQl
z+1gb$!>9Pra|{`dPT+Q2Fx1LbDwPW~zy=XCuY3G%CLYdybe{T<^6yWa)W8?MYaDEA
z=qfZ-TeOf<`DMt)W%r<c7O$VnBa1Pt;ocGbg7?4U0Z=3c#s`l2TNSW>mr&kjnY;dp
zz%5$I;D0z@UK97hMIO(b)-6kzzd!19l73UDvVD3&=8epbCo0SHf=V0<4$#4>n3!iS
zdU)Eh^h6F#D|Rn_`-b1y+OA=X2tm#KFiGk5KjH`wQy0bF?bo12J=t&I(#^D(6Kat-
zx<C8)+dO!un^D5Jh*RCa%i8g9<-XltqGtIYWexRz%bK03+rKu@gu#CQ*LILW7ymg5
z9*ZrCP<w{?Exz_>mNNhhG5S|{mug2AiR~43I2_g{*a9dJ;SoWO5s_dQ9N_ffLPGVO
zS1%I?l6013Ri2&YvT^IZx9Tmn9@m{$)m3(56+Pq8-6?;452oq+e1g&D0r%qof#DL}
z_0-RS6^(rCVsk)V<Itc*O<Opd`raQw<muvFc}u53djRt1wAn#4w783>Acl7cc%<QA
zzvE(IIl%h8m;$Cfn4XMwUQL)f+`jwRueaT=lRmq0xX+3-Ao{ZdiW9&_AWby|R;>g(
zH$&yhKsN2__2QQF;=0|2Ua-~;9H2_)PrqKSy4L5DUd5Xe7Ga~vz^4H_6tE$aYAB@5
zV;*I)(_FeI2}OLIxDW5mPlg2BUbE;wj$hs!+|a+ccyVL=I68Q9rufwm^eoqV{f~ZA
zKwG4cHfy19iq0syL5j2`)tO9&;yrg*4Nh-4Kz!xSi0yZZx5b+G54uu9CZP9?qX9ua
zh#Lz`MrI$UTw5+bGnD80pZ0HE!7(~AVfp!eFWruP3~a>J=r|!_DMN-Qp1{L^nv-%G
zDJ0@iiO{920L4yXkWUh#mo6dAb!BIwk0epMbz}SaIyl^na<UiM1ytGphO_VSc%%V{
z5EHCuN&;4ph>gUq`c^_={5$gdrI3C%qtaBTENY1-sHqH+%8>b8@qK<uZfkMx7y3Nk
z)VRPXeBHB%%=bsb90KAGg(j*DWN*OSf%OolCifC^kFj>`JYTP++kGz)^t>KZ%m5Y&
zG)qE-I@!y({l|p}1tQm&upGax9$#lA6Mh~3gev-+aQMs_coZ7c6q$svTAU}gR0X1f
zfwV0So(x7d2wlbqW*WD2+Ukq%Ft+F5kq@^*xaFXQ#7uW~LaM*nIKwMH-MgnfOWZ&G
z;r@0Jckc`kb~#r}SJk7|bJ3^PpMGOOP}2Z)iL9iyv6X^Y?%mJx<%96I8%{og<NZS}
zR(S3F!a>D!OjW=Za0itDzRUc2OJYU)a=1)x(!&aJ(}7vH(8P5b7*eob-ce-`D=XLz
zpaWKW7*GDOy-J8m0>bxpYv_a++P!o#8j+5MXrMqpkTsl8U4h`xuaHxSgCZW6NoF^d
zv}(x=@D0B=rT!r*N-F}0p4^XDh=>Og%p3(KfKF6C(lLnuAqY)ZyrElEtztOGG|+-&
zG`Lh+gKDUC1xFr)P}Wnfaqwgj#Q{|40eU;G+q{X9IyAI!r76KzRj*~}qok^>Mi&?u
z5R``RtkV$vVJkF)@;SjK<w6P_{G;N{8w2&^IA}{5b}uQqP!~DP!yeQ`0jd4@B^kYw
z{?9S?rZF(1AkhVtE&jMDvEa!Si8v$85@9dBTBg)MgnyDkKHe{Z4sz<}P)%U+m5vol
zyNIHPMnEL|Eg*(c^%53iU<A-G+i6DR03yelm}Fh$DAg0rB$UP5i2*2_p9Md_(18wu
zsOHaP7_CKR3X^-z?ZEvh)e~SBTBGC|EZZhC!e^kf^jwUiPz(l!9Yu<-t^1*jl3JWH
z3o8=XK@4^+-&&6LwON<239BbDa{{|FN^C>IfvWFz)Q2C|WF0@R`SA}uv*-xEc}Twq
zvqsvNe6fNCnRk)=rCG>x&+UU2Y3bgU8v=fOeUSG8EGHN&g4>;X{=F2h!+nNGfB^u)
z|8Wl(;r}Sbf3L#Ipw;jHttt$1_|GbAH!py&wd#`H8~}o}yYe&&qEZMCWZz3l@HmV8
zTnRtxW--)|wslfs?>~-PAQfJzT2iSb0Vx@Yd(H4}UbpY!ivTRG?B&;Se>wR)Wd}f9
z{q`<gjU~y!Ln`JSu9sh7;cCWztBGL@TK7FRuEvDgvLB9dn+oM9vJ(V1!DOCC14%DF
zMb;{py<cAoF_EDXN6IJ$q9n}#BD&|hpJp1vYx^Ixyi;%{;Papxd@;Y+b~3ST+qN~a
zZCev_Vohvol8J5G`r_>Gf6iX)L2Yeq)n2^!U48NN)7{nY3LoO|yA4&>mF7X{6Y06|
z?HaP~B*VD}oFxKSVLYT&uIs{a5{Rv<6Czc{j~9n}Y)IxlrSrFk4KPL+3QYT8nN~{@
z8A_*=0j)*^OG?EAX+_g4cU%A8*#}Pfm=N^@J;LCB(hUYF>VSWb1q!NYE2M!nVNe|n
zhsJ_45uWcV6Ny#~%q3cr2B@KilLhTcKr&F|z?b&HR!}>SASv!FLhnPnKvn>Q6WSG#
zgsonZ2xVSxEm<!M%519Mn;6V;a&kz)lp#_<V25WSR>sm*5B2jDh=D`_Wy6pYs$^vp
zu?NddGntu@zCVouJKvt4>XvlPWKtU5-{0xLhIrS3qKd*N{KU^{GBSr~(zL2K`Q}qp
zSV5{1vV0D}@jI_(XJ6m<?v?j|u~pCID~};snq1vuGlj5^v<h~T6||#LM7K{mh4CMe
z?e{IezufKYVhITd7QtYXi@U9`OUXzJAxxqtG1*Fq)W86E_h>&^)JTi0JUz8SVXMJx
zS<=GKA&M3tC5G*5!FKa~rhIuhC{28QeFF$#i^muCNrKAN8yu|U`2du9SDQhx2ii(P
z0s?tjFokIF1<=~II+0WL837d9aB0<9)YR0M`}<^wV3`v#4Sra~KXS2X!IWe|2ZF9{
zZdNeJYASyjQZojf-O`-QL+&f_3JDq2K)}8mF?UGAx%xFw=$|vY$O!u`zsrc!@GTh#
zrHMmq2me-_F1v<os;2t^Y23?Z?oQHx0XrpQrPgoKn!UILp7^P}>GLr)q(82)b`J()
z3vO(~bbc60_ThnHM_?vBMHH2;TDaK`31_e+)yAFS5xOmfj8fHNLJOw64m{={7I493
zHI<+~q7g=3rUloG21`4PeEk76z(>&Vn<$OUgx-{NT0<R`W*n!GbXs=xg#9Jl1s6<N
zFRii8_#N=;$|G}giANa<!u2qtYsj|H9pI%Mfe9v>6)WDt%7`koDD|(>q!PAfB$i1g
z@V<uYz!;BiTe4)XVdbK-z!0t|!_`%&O{aNzBT-jtWd&|4stUVs&1j5|j}M=Vi;GE}
z8CLjNt5r!f>$jTX%59<>(}ya7qc+rSeZdX{A{dU{Z)m%IbgBP0l^XCid$a*yU}}K>
z8I^GVA5@Z;QB(dOC6OL}@#+5*p5S`^Z#<=G*~J-XV17Lx@LzY_@Fgl*@v>btFP}jY
zW7tb5lc<D*72}lj#R*B*z)`%#X1(kf?=#t0Gei$#YlhfFm5S`6#0Ix!Waz$O=)O6Y
zKeW5<oV2vr-MB^yA{Ki7alP(n0vZ0-c6G-v=jv4ksx5Fm8l?=E+sarz)CTDxQxprG
zvfOIJ#l0!=$h$!6--lx<mi`2zyU)3L6MjJ_KlT&F$@mGNmg^mMiW9B-r7gC3vX(eH
z@s$}bmq41M;I!<1PPzkyI>vuF+1|UhVr1U2cj$~>j(>s)(94}m*IJHVrFEcglpON>
zf`d<d7Q|9BP<^$!vn+Fn?p$16XeLa3m{puyWGZOB`5`kgLbsA$z0BxId{g#uC@-+K
zcKVwyRh{G83MQi%Sq(H<yXs99x9~%^rGJ9?C<OYKCFg#QCatwBdP>%OTE_vLr;lm>
zw*>iPo8iw=r5TQ{_a|x|<JQtoAl*sV1L2oFUK<QI8S{R~F;&65msIMD0{z<t9?Ye(
zGF^B~m$5Sn)R})7ukKpUtZblklgG|=(97r+5gGh6;$IFR^UJiKTpy~`6`B=*i%aq!
zss}R}_7t-sj#Wmlp1C%bNJNQ*1SM(vIVLoHhg1YK-Plgoq97*qxnz|ZEGq-7c(BK%
zy^eJ?p}xC+qCG3AjhYE*Ikw#tNzql4&}#h6FSbGCE=gGFF%cXpr~Q%rQ2ft4Pk9Z&
zKsorZ@Z~|B^XEsV`hV_pY_WLZxx-ExBt}WfQ?m&h>Z=oew6f+HZL<qqWV(3yvp>~o
zVSV9GEXAgp$)-5gv+!giiF)mB*8+{~1=!nG9ez0sx7|!^=sHB6kFmMlfwp-!!nrm>
z^`e}fZDTC;R0X<jT?g@|XU9oA^}%Pz0SkiYS<zAF`Cow+oFiw|3ga&5M%~n+7TS9^
zFyu8guLty!e;*PKdO3JfBGqL{HSKHG6!I@6n&W4^F01i8f66=W8WDCo7e)>dV=$}I
zn!5c;^y{a!h(JbUdtjN?KR5NUKyE1x&03yWHq-xQN1h(re)9#3;s=g{5AAV9>LP_0
zZ;6dR`k*xJdEZydRf78~36#g|-;G_>XqsPg?&b9vkAbgcXYUVo7&R!g?P&bHhm71;
zAl0HgcxW9okUcyHx>yZt4!%nUGa)!w*GC_;G1(d=x+WjG(6m^4y~ycDU}6DGiEL{*
zc{jVXQ?xB_TzcP~8oY{jl?UKa`otGj#Pkj~f^fD!Nd~~+u1-;JZPu-abi-A7D6BWQ
zeR)JM5W-{-#9CmVEJN&`bnNwa2FX#V+C9;gX~9nF!I=7xKh9AIwmK8}R=9B(oTX`#
zC!q#i^S12AP@uWE_$KH}HHUJwFS#N95sekG0nLkI6+9`jvS+o~;A(V>=FY)x2q32o
z(qQl5SB^Qh{We5+Q2cDu2WNxkz>O`Dx!ofUrg);WZ}t;pf{RijnEA2N{@(A(SE_H*
z$+VTLl|>?{N2CKQuT1$Q!sneG=Ek=DSriKt?#dKsC87U;UF*Y4%}{eYC+zKG?u#cj
zCmt8{^xs|ED0m;U<IIPZV8O;|bO<o%S0+>ZvYlT5@c*cEp;EoqMs36=j6cxY!1)yg
z>k|JDLxU71Cnj12X$K}D7w~mYH#BhIottAtbHptf0^8z;4cbP)fQ+bK!NtnaVHQWK
zqL37EN;@Z7W=NGJk{=1VR2-)<!E|^k(C#TzQSyD6GZXJcYB++*izcb02O_WD`6fJ^
zAY|p!h47K4la38L{krdoDk;ah`}}FM*{4IU$O`dCu!_$}@orxZ-a;txNKA(|l}xkr
z)pYtRs<1M>q7|R$>(MsqjqJz|@m7D;`b%c?`vY(6(jGi#8Jk7mZ0`ykC{bi1CUdLl
zbc>q4CyKuFkv;lG%llg(X4~l);IxZM{)~Ww*;>53g03p7vqEV3olG9Jg8a%IAig_3
zhqF{w3=5YIUF5n|1b^3PA%=VaD3OxQq@Yq&71HGw^|q{@<i5}EpDD02vu76xmiF;a
z*qefZ;7``>6IG2Fj&!-=RWz74am{xwv4mqE&@W-_h}HJ3y*8~YYt-iY^Y`wT%$TGu
z9k=FH%4&nb1_7>A9CJ=f&I%?CAu?lr;_MlvX64u<q8TJ2=6>W!HsrtHBxFLu5B?|A
z`%=_tc?^l6=k_*2Waf@IGrz2PF=jXuTP}QP;dIm?g-OfBmGLIl^8D7z=cqHal6ky1
zvh}Fql+Cn)KPf*IH5v6ow)03~6kT>)6TN!_SA|np)GWNodMuj9_x>_+p7>>N@`{QM
z;8F9I+dS)u&f9Jivf{Plxy31m+jMccYh!ds*`A@JO`C`w;PC9XhJe+x>uyD+RM=J8
z%{Y_eJYE*?0WzoY)E6r724*uxA{5P;Ir>-AtkZeQo)nbSklB@#4-;}q_RvN0v|!h;
zxCre8$FGp@!{wlf4s2SJTVpKA*nqg;GUG|n%pByLxhl)XXgQ!S={M`FBK1Hf^q{Z<
zs3dm3nXa@4=?H}}`*nsDcSfzrva7nxHit~wNlK|2blELv*B$GstK8<B%@h+hPn+5`
z1pkA8I%6OWR`-d1q*1GXYGLSrmlh+`2K~~x$QksrfSz9}I^ZBO8CP8Xv2!N=ak(O%
z6XygmW-1LIcjicLIa+j=kO6x7nV~lB4SdML!3eKK_O6mf(>EJQQ)IPFnvF-TW(ShZ
za>LnI#pF|Qd@=k^*$SEI)AAVJ_KaUhxL3Q_Dwutw9{XWiP5jnp{sy7!V$(WKK<XNu
zyv0E){KdVgF)MaFnmd7J#iq4`mXg`m`WMJDa#fMi_F*ccbY(Mas`7kr5(+kiOy6Y?
z)N^f2xr*gwTJUS;{YM^!v}5zpqn@B~*VKe?hj;6OBU0FCG&2ReDSqX((ZZiUe_d+c
zSGXM?MY#bjQqT(1kdt1j-5t8LphM%e9Sg0C#Llc$g%*`+Ax3-#1IL#ywptG>Ih^Mx
zH_{^DM#?0C%4)mn`n`)ZPi37$$zCVX(I$1#9W0bgoF@p=WqP6c#1JWdgDLXcoo$|X
zl2)XvO%u77=&;-2%JD^<DegC#OTTPuC49CvgPku*iW|6F#V02Z*AVaiI2(_V;7yk)
zO!|6=Lh9%bP-S8d{yM*N59-Uk6_3&vqpXXbugX31S^r4|gk;M=z6DPknOLffHe)K=
zjaR~|n1!V15Tmxrf@I9vw<pi%ZL0<09=4y7eYw~fm%7bGF@=E~egb-8^_u&%q}PD^
zuubtGoM^pGJ)G=8s^B-!7>vXLTB)gN<p1+=u5AQAE%Se5kskhkeJ=T5+R4Jo{a?xn
zh9!K~_y41uLI3ssFXbE(G@1P0R8Gl;|9))h54T9ErEx7-UUmI>(l_Q--nEeDjT{Vs
zorpm+QO5v~K|o`Oghd_Tr<KdCm_>KyU(jAag%(S*<EcZyhCn2T2}_eekBf`)%6OKa
z(0+e>d)ByaZ(CKYpQvy3@rjj(e#y8m^|U!|RW*UWp1q!dx^`Zp-$Z_y{ed<Mjwtpw
ziJx{y&nbB`LMt2vBP-RugnjiTpDtrxy)UjWuKQ+<Q!SUCGq3F-2anWyFJIAk#S^El
zK6&juJ1?M*R~a{=Z~Z?9FaE}3GXJPb%)UR<{EZg%<p}n8%!0WY1J9hP{I)J|2*u+|
zmym3Kh@JQnb)nvW;TAr^c~RxlQy3ocKsM|N@@u|yK+_@z$rCAZI(C#p8$gqW*6=Jt
zCQ+G3!0bRp0cN-fVy(oXP$L(H(sO$W?x1B95uf@g6i(hf3Lv(gCxtIg_Ah>TEnAj8
z*(k+JA+QHxe0w9-x1md2I$9&|q||IQ{7_X1sf1Fp))=C&4U!E$C_>KXfv%7Z$051W
z-<cFa%fH#_0rFna-#!}!GcgT0_)GkYEsv^6Zv^Iczu&!hkUlER5_ItBc<$#*-;B`|
zkwYs3%g;_<a7Dt*Cc*M=%O1y68DWG?x4eT?dx7h<1xqA#!->-sgY7uR&(Sd>a6os_
zn6q=Z&|dYg)gkWe0<?d77b#EF*M$9u?s3d7FOk{cqH+c3nk%U7iX2&>#l>J10j_s7
zubiI)^#(+;#TBTX#}@JMSW?ul$pm)aqQolhn-RMYGAx46v>oSRWw6grz(vuQR~E|<
zD+q9LB*;Y|A9q`y)tKe!^EY<>2bG@y0h*pT1XG3-1mkz;3yISzbUd6@P!L-czsR|i
z7()C6zC^~Sh|m6L-XsYab#I-!Tq2O103W&n&sX`NO)QUZWvAy8@$`teKXp5bsVU_)
z<O&)!H(%n(X=iLmkO(xvZ=U0FP$x!);E8Zbk`>P{=o%-)gw8L2RXb}Kg;#aqLq&rl
z@_g%35X}BM<Tms>GLy6&@AenB=IGwSB$$TT&m><gy}RN**A4H^f^RCKFN)q&205?q
ztL|90EAC=X=be_Yy4X(~(bIv^Jr~s*AyG@Pwf>s}DmGLZbnmi>-Y!IP9BA|o)O*(q
zAg7=cpxE{IEjan-r9}{PmWq^<j@8piB#L5H$J&nA(6xc)6v1#T>V0i$c$j3!MR)ud
zp({akgbze4dDUl?M8(A~VJTPzM3S6wM6u^AW%7LpLS|BdoXfqRAL#^y@5X;Dm*nFK
zNpS9}St84mf%)6g#-H)gBEf~*t&uw^GyejxqrVOLTqI>h_tEEk*$OkCLk%|}JN;3O
zW^m8AAa(6oeg2X3Jo~HkO?0}hx|bpfmB07D7rnEBR@PBw^CVQCaDKv%s>6HIiK+G~
z{a^@a>vIL^*_o0}uF1^2Nf+XPJxQRJ_qo3FRPB8C(I7D$VTJ7OeSe`<xv&??tjiQ2
zfMcQvN8uG1E#gIr67X;cTT7qds$(SMlOz~_+IjBqY=Md`AjF}P6Lx75NfxQ55}D<N
zrJahGCyYQI*8!2z3p>(WHGxSoJvgXpURYH@RV^qgsO7u6*R8cTV+9{OG$KP~ZtV-O
z^R7}}O9><fVdwn@e~RhOaUe2M37r9bMk}kZ>#Wh1ReCEGFjs=93BVMUO}uMrsLw<I
z>T)Zpiwx|i@0v_bUG%l7H}*YkRcLuE_#vxcj|yAQ)`nJ<2k7Umh|z=)CtylX)7F}N
zQXuITFB*Fr2}7fYX_&Rsh(QjdD{^p9g4?)e2vZ=j4gM`pvisYtT})Csauc^$T7|pC
zCDs1-jr2-wPL)a68|;CaaR~JcSg1iy%+8MYV^M5##&-}(8&A}~<TTK6?QrUop_p}7
zCgnh;1{CmvIGyemttS@-_4PY>iMYGG#UeTj2yra3!YW2(9f$Ac!~&TJD8=)Dr`<_$
z(EZLMKSW(rlL#ue1&jvxg#&pL1wYvE4*$K_Hc@wz4As52vt+q>I^yo*$F8CM!#C<j
zY91d?y%yltlKwV$_kYkuX8kICoys>;nQ(LonxnZulK43c4T9yctx4qEuVJybA&8SQ
zldhhMcpk7k%*^raLe}RXk>wqK_kl(&%w9|7;N8*h`aE4W8r!<r7>_YCO!3;R!6e52
z8S?r`=JPX&4%NQ!LVwT#G05UywQXU!;)<OC`JQh2><q9-Gk#a06iFQ+3OZh<o0>SR
z7)(6{A*pYH`z%a|Fo_8kU0MkODIW(?JzgLH67IX^b9`B7@UtHC=abA#NizsbE_zqI
z4pn_|72>j6B%%nX@O^~Ds%#o;acPBj{wy0Nz|9(xc^}($K$@#B0>0isR(@8{x`x>>
z)C3?(>9#0NCb+rkHu#f>wBWWhYj=VqC~N=<KWT>WZzs&}FSIpK?Q<*YHt-nfPQx(x
zg{+mBO<dR>mqp?6b60ojhRFQOm2bCV|0{o7S<Ku6iTagSH0WL%^V%|sDj%*HE)o?z
z>KGmyFPRGPL;QZiP4vr;wWI3W4ftJ2CXD!<G(#la1!E-?@A;1BszviOC?-g)4|os3
z^~D@d#09gR6>%zFX%A6ahYHJP{uw`6Zf5Et#w-f(R2%@%vC@QVAV46A&*?|E^B!Lk
z4*`tEHA{bH9HjQZL-J4P2m7TAXO<Z<Nufu7W48y!duJfa`n@Mn3Ubq9+tVx}XWUYm
zD3q?^tIgYwoP^+pkRTib-ND&_YbXO&tn7zgxCIpm%n~5>)Ah@iPo;>NYp$zn9kv6N
zt{wFZT6Zh($9-_|8C*Z5SM%jWkmW<-65bZpufz^)Wvx|X!?sqz$H3Y0o|s*wmbpRd
z{S$$M6I~w!Uxu2S3m9c7eB#wzHrh>YUb~%ed-pAGmwt{i^P)}e4}>`ZnYKo|*LPx6
zUE~6Z&WBQZF^0a2`XgKgDVHLJB<YgT%Me{&<pjzqWrCe*Uf<u}?VQ*56#OC7LmZfG
zr7ce|eZeS?^i+H+f^qtMgn2x|J1b|OohyoeB_t#khi~&>2HIvlDx6I_Z0~p2u1VBy
z-1|R+F*wGR4Yj<mHPn%eRYa0h39W^TJ#&RCGa5^p=lj;z*xoN%B&X5MA-orFjX0R6
zwiq3@eA4G9BHj9ss@!ot-@GRWl5G*~%l6q!rjKr|dl3{xU*7fMw=Sx3XtJ8&GK?&w
zS$1`ge3f6fg{hu)PEI79WA?e+Dm(u^OghsPY$YO)_A-L<aK%H#3gw&AvV{FBnmoU%
zbiw^0<ekjP8y0`?%3k)*lj||5%WlGdjsUlQiE7mg^jm@Efv@kyk_A3C(a`$CL_rmk
zNVl0%G^m)6h(ZSL;O<)|jlpBjx_1o?Z1BIpt=&5N>YQP=K(FtI=Nsn1N~C(DvQi?*
z^-wY_p%i*4GH)rPZ^>OH>)_nFCCY-}t0)XD)A@uY<52}+UxQJ$Qp1s1FU&zN98NU(
zG<R|l)xy0sD|aoUdUs*`l!#DbF?bp(`PgH$#{F!!cH@7>%g{c<q%mJs6aS^qsW(+w
zZJq<m7O8y`nc^Zc7*0zhz`ZeM>q!_)S|{>euUk6X+<dml_C2ksphAD*_UC`fvu34T
z`gcW|PD^%pPxiIv^R<#wgx=D7h1PO2sZ%%V&Vh%;f>p)dc#F*vY6-wU6BPS-1l@1$
zZ?Bn`y7+B^+}S<W^Q+k%2E&wGEI@QpVW+JmMm_{C_ZTkjKHJGFL|yvAXJ444W8sml
zy?Q5CZMG>N-E64r;=7^)V3`bmFP)>4lSwT~fmNz{*k-7x?a^3-gCG%Ds?x?ioJtg+
z1dZ8Qo$vHMm&E7mNYAQ38+aN5@G*U>vm->&D9698K&-DTtk4(7g-%lC+(FJaGoVN{
z*d2qWp&Lm#9uylcMI<2QuIpK-!CUp9sS;I7PP3rm#uR3Cc1gh_OzCB()A=$Rw5wzQ
zug#E&$*(KLMfY7-8Wy|+DX!@VJT(a>wL%B92CGUmjCbE$0>a!*Nk{Y?px7dPonC~o
zi8i*!K<xJ0DT8Mxh+<8@L`#xG<k_V0(39e8L*2YgX;<zgJg<KF+*&a4vmjzKp_9rd
z4!$5nNV#tWR&6YlQ2n*4W1Q><JMy`eeD9caBi~D55P6$b=QC-_%kN!}@D3?Xpvlpn
zcxCHHbAMo<w>dnjnum@N$L$6(>=b)nj|`b`PqY~eI!K7Vv;Q>MoLdy(HgwAP+7Ag4
zc<*X>+J<`h>rc4aQfmCZoi750r#iTf{Zl8bpw|yE-**ltE&<#eehF*|cidjwvV<6h
zPwu?p0;WJ&W_2?ZrB|Y*+^FvTVOr360EvIwvk)awiFUQE1hUI>BkTJ%D(HcUD5R*7
zswOMxg*Uh+S(wZqxK@0$AA5e}pIaD)?xIYWSeEuYJ?WlBRq(J&k<kFofYx=|*fO1!
z{OI2?H;cMpMy5&$n-v@UOO{d0-mLs{(mTG}SEZSOOivG!8+&Ag9~Ppu0q}oZ#@cSK
z2kMyq4KR^4>3{u^v92OAw3}AP;~2wd^4gQB4t&kv0~v(UII)M@PgVp~?3&%pU7`1c
zhoYP=A6&>mE}d6J5?%K1d`y!0`5U2F9^Z|+pUD+?io)Befnz(`^y8ky_n)KZIL*u8
zvI7U_)kQ-PlPu>+!lW;I5p#u?;^VgZ$bkVJv}P@8z58oI+2Q9U{gNYufa7bC5u`_D
zCFX*IyAOL5qSpb4kB7eLK`jq=6A#izXmxtg^h%P3oRcSdPOe?8?ItYANVZKpX5RU*
zqKT(j96hcLwf#-ZoIj9KYV0l)0Gfz~Htx@^Dvq9BKPR~lsIW@>FL$8h`ZCno0y9zk
zRd1;OYUFzt@b9wYRsXqoKfMt*gp~m^vYsNLh{11CiAk&_-0e8Y2&ZH>r0_fF{=t6t
z+j?BG;ntwK9O!-=3N$bzL~ysMA4|Ln1|;BoQZE=zul_S^;xAAbDGqukd$C4Y!Ab(_
zA)E;&=TRb7T$?Nd0ZjWkM|JKyUqt+Z1!9UU5Mc`xXQBGJAryq!_6aq=)jwt$`)7qU
zl8BJ*P6BR2n>4K6Y#pc!R`<$tq2`fz388j`$vl%^{5@256pF64OKe|16G3|<*EbRg
zLJ!XpURQ~6Lu)7T1IG)JMU^T7G^PM>+5jHl@(X%)xH$r3Qw%^9aT>z5QC>t^LP*?I
z<JBB3^$2}Ru_B?8(Q9Zslj8%Bkk0DV=f6R=>9xS{v0>oaVAhF3KJ`atOUqYr9dpCi
z@-~lFktm&c;T#{}VD67m3c%|jdR$+qK#JH|=HdU^JI4F$AzuSOQ^D{S4LrNsS@~2f
zA%IcAVd_$`a>)5JJCd%r!y<w*_)O3oe}I0KcRo~51jzNi;P2iqOLdxtDjA18U=F*@
z!evi_2FBHbk=2}-%`yTO0mkPzA`As<L9^qb?d<yRA(&$T-OQ$V@n}R*y#u8#_WER>
zv@{RC$iR;&lXi5t@0-MyqR0Z2CGpkM4@UKJxI0`j$6~xGCL5e-7o009=6N-1zmr0r
zAIe*6;#`t~QCj|6$z&mC$u3_Dpa78R(yvdMicmIFxx;>r@py+Yj+qIbG);OY%=@>v
ztZ>`GNGIdxsmDF^Z&oNh$Gq^&UN5Lz?``hffM*=m5J^d4@qPpfSQskd@}Q#N)CQU^
za%dKjco7^;XQ|<O?XSiWrkICj<fYK)Ed>0dt0IccuNJY}k$Td-zP_M<Zq86cqXms`
zJ37+{!Gy8#_ApBE9W2MZ{8*&Iu0oeh-iN}b#uX3bT0ax??We0F<-)&Ut=si(A?s{?
z2Fb`lWXdd!tl?DK%86SHGuWVFW>aL7NPrL1fQUEZ-fd^j@4Zb22d}#X39oI+YU8JD
zszH1a0wlc7v_lT*0n3btFsw#rZW3hF!{)p?&8qDFX6KHm-4Jg`)NC{fX=3|3wer-V
z@Ap&2b}L_m>yaO>Q+;j}B)p<oA=ln+7W?{+@gZ6GL#k&4`t7Lf3i38_UyLa)W0@@8
zFzaB)hi5nb7d8Ah-OF-)s0^_dh<G1AD8>=AC~q~~4BoPVO9p-uz`P+X{Bu3)rwo^u
zZGVK@)jH%&pPvYIe*XZuKFhLMx#NYw*wab4XklT)BN(MxGbu&j<h>PesF>n|p@Q4D
z&r--kkRZmvFGvCHM50MK!zN%v1X?I}bTeb26~q8l);Ss2Z-kMbaP@OUfA@|9`M|y(
zpLE(mMG~%#@S%DUi)}EKLIuiCuhnW<`k5I|kd&PG&*YMYx)5u5ff}B+TRia^Tf{gm
zh9$@uPZ0Ohm+uqIC=h03h&~)S5R5{7a7KKyksT5i&?Z^w2;RQJtn8=aC}qEhN?nov
zJsQKeZN2k3O;pA@ja)1b{8muFAy!BRqOoJNICG%eL^B~I25%K|VU<XeBH;l0md*!G
zgqjcn&JKJ@r6je33wjVVW+gIDev9){?jIzUMyGqw5;Xe5jzbC82$U8^GW)@Pz7F~7
z-TqP{4hnpkuIWgmTFfLJ4o^o-|2PL9u~Yci*G&tU!#I9Ddq#`Y9Bj`zbfi<`Pw_lK
zPmceji<y3p0jQM1L$d^B^@0+dyJz{_fO%M?*e}w=Z!hKf8)0hSB~V6E(BqqssH7)^
zY&2G@ZkwU+iy8$Ee);TM7&>FFkzG#cXeV_-8{k6DYZSTebF$iOzXm$dBjaqP)tDX0
zSwcks@GR%dy@t3Vn^C)-e*VPzpIW{}GN>^>nf9N?zY2Xxw|EyD%!_G$ON*DO>hmnI
ze0t#@TfX0}w&K2=QlmgZkP`5&2E#cNIOmfVgW|I7cLf@AuA3;ih&tFFS+7&}{P};n
zLtJo{knFZ|&6(Mj8pm0d5J~)6{$pb)9&$an;lp<EZRK&+!lpD1d&xB2hfC}v-&CbN
zFxb0INWo2%BfW=h$OfJ0XN!!5mDcE}r#uZEU*;F>4U>W!&666J&=vuNLq4btJe*Wx
ze!Wq1dai=*{=l@`t#KVQUdT`}2be(0j%qKC8e<^hLp@kEUw~)Q`^vLlckFn79-DAq
zg{04(ccM9Vqpy)L4U@-dk^Ze%3w_sXu=B)r{5}VNIqAaQO+F)%r!zp+k(e1CsXNHu
zL0=W>^L#z;G)yV1l```^kijjjD2}*0j=WoojDo9>4@yeH5!MEf<OrjpJ!VR3Se;!-
zuOu$whCn)il`Z+^4IL2XLO^_OpUMyvB0k-pqvPM!VaN3g`IkfSo!sx6oOcp=?f+I5
zHOCt;n^}WLcTDO;@Gs=lM=5FcfBNY;bfH8T5zDBDl*5TK(19&aMow`oh?WRX^-CK%
z#;ZGGv-u&v4UMyI6J`ThC;ag@y_T5PUQ>$;`I<Vf^**oz$sly$<{k8J5JY@A=-J1C
z)V3)A;|u(;{*veHS#bC8jGOwtj45zT^^Oy5nlfWX8&Q-rUM)#szcwG_+^i-U0f;Mx
z#}Sdi7p+bS>*wbiQJ9)Cn;Z^M>lyJJ<SFPpuILF8Tgmg|Br;H!?G5t6YnxcMMG(ME
zc&6Fjg_^++E^CeGlY(^oF0R5r9o4j)E*<biEn)boT??W><i+Pc-P!B}?5xj4a8zLI
zxE$fF`u*k3b-tG6!iiQv0mQ4ul8DwMkMoEMcV&j0>%H_DyF;cFAz~#Zi6Pl!Ws_vM
z++uXt9oz`GeIxSUeoDN2{EIZ%2<C)U$Ca~gb}^UJZs&{~AS5z>j1zdSi7}Xgg+=or
zD7afx%XS)kTSN^&#5MM#2zE9NBdvz75$LDRqv660zn{1|aqqjke!v&H*8&lz!wa|V
zD-@nn$;Xi3Q|E%4KB`n1yD$VJFcF2HWkfIu&WpICl7TZv$>BoMJl`Ufe-9AOutJZo
z?wZrYKS(ziv~PXi`QL^_58WR8%#K7T=)+rfzzL;7OM#X4hGyfgYYlSa>QFNJ+7IBK
zZM<wjf$Lyif!wmj>naL{HbCi9vRM=0JKk;GINtS0dwExGOPx`WubQ3DoC*L=&Cjf{
z9jVNPo01wuk@?Y8b=i^aX^{jgiSF0ySVap3hj2!3yfCvu1PF>dvQ`ShiC7f>6QJqB
z#n3Lc)B_R6!xsYPl*GV3mu4$b0+JkyV-XMjJtoo6Q=zv%N|+skUvIC4!<4@jksc8F
zL?h*!Lvr6-!hF9wNIpiGL1gQ<61TC8F<_*8aZ+m5?V!~AG(cMA3qUZn+hgW7AUlK+
z#0_M%e<>cmDJU@gr>KL;jq|%*4Yhx7TA>W(Y|pXVmc*VgF}Cd0*Ym+93U<Qk&HbTn
zzU|wIFWnYW%47*5ZelbubR-@gFEYIWbN_&+xIb2lG`?D2M9qcmGsOT|Bgn@U!sBF&
zVv#6OI!DAXQk8jW?4ASP9ZZA1d-x#>ABo!!s;T$3a*4%<L!@mgzvJnnAR`W-PV-0!
zg5#kIb6h4Y4wxyh3q$Ks6hR2sNf(`+R9*g5z{d4cwzhfnq6uh^_Q>VWyoH9RFP_z=
zYDhgr$NpFB+Ti${B%o6vP1NEQ-OF%GmkBnW13&clQjfz+<4A&x(#}Jz*zE+9`~cZH
zq4~dh7iozpo|8rOR2c`NHAZj13BkO?;SGI-4OLuHz+4rgX7O~n@CHsoHL0K@eKdH|
zEqW9p`M8Ec+E>J6@!LLIicd*FEKhU<F5~I;TU{zX)9Xuu1rUt%zJ-^@BWm7;-xU7H
zFE(xwtQSXOsYrkRa8Pbc-g&(3HrF5uz#9Y5+(*_({1K!mxEgH+ainZKj;~mXcl_=&
zwt_qmddjl-+9S~pSeieo*G`n5Wo`(#`SL(b;E2Fw9sS%{h1%)U>+gYm7(SuTQU~d1
zcU@hZjrS0lff(05k5OAOR^oKrhiRbT$?lkhTHs3X@tDKHi15kArP!JAiO3;Q@!|@3
zaU7HK#MXqbAksZ9%OXNvpde<Q1MkLeQ|&S>z&_@yY2QW`_TAAP;(sSEFOf~Kj{bUV
z3aXG!2@!>047dXz?sR||`L;vpCBxyVIO1nfRN&c(Av6CD(wXxw$Kp-EiEi5U&100m
zIv=FI$qUA`gR<xMhFYgY1IjISmKU_E4e>5mbgE13mikX^4HbvJPvx;);skH!n1XUx
za!5=xd)oZluZ(9=P5c&OF!GxyLr1fr<JiMUzW^fNG?kDD@8~a~kAgbiI<^HGfB%rl
zi19G7e4+f>U6L{f^ZP63o#oiE-5C(j)d4OFj{eX*5-(^eEOpXnO|UhL;n?X9B;wr+
zmuUHrMRe{CP}Y$fauC2W_ZdLwKYf2riNAT*9=Zv%=6W1^9y&CKhQWGoIS-%KOWgR4
z4o)N#w=#h6lONoOTq@U{vEQH#a`OSU-!Veee~bnpfhU4s=q2}y?BM|&3m)_ugem><
zPx?~f0+0DWN;}7ayRK%wt0P0*P7NshhZBIrEJ6nlR>mkw%P&oDkkQx(fl<&SM$zu4
zgKxZZ)s`E6QoF=#yzG|C>u#ag+oieh^0<!aW{aNHa3|}1PSYJA0lm|12YkM~?iV<n
z0foCaQ6OGZW{RH|F`AzX#ItdM=ekh!%c`%7Nk>DKPJJAJQQL!Mec@$uS1e#-*$2zw
z9g#*w8}*dIo#aw0NIxO^MKwBuUvLFY{7HUqzk4J=CO93s^m9biAlkoX@ukQY{PF9X
zNktfzLs59hW}yn>P#peZnUX}Mh)WIOf@1IRJozzoNho24b<a33$}Pawj!GLV8_N2}
zo<y+A6e^&n%6D=mcgbsQM@W4VY?u`9FRe_`VRYfP=mqoM{=)una{Mr+jWoVgn+Jrm
z9lD{5H+1B4%igfRzcu0c;PWTp>WZeMswv9}>dg&FELjAFw|QwT`Gf#&d^68Qb^<9|
zt_Lsj?JpW0^n-@`FxvKAm7o(t*xMZ;+rE=}kuV<I&vP{<9XP^dJW#Bkovd3Cq_Kfb
z^N+=KqTB~nc19G&!R<UAf_ya+=NikodxK%{LOaGs2NQXiK0aI3RZZ?$v52Q3IK+b4
zpkr%@YU*1Yu4riWh=RGBWC<m4BKLWvh;44Nerd6;@q+jlO4dsq@u@S}iYYN2a7_sf
z)ib251vn^Z*8bP-AKU!_?;_{=nH->LzQUDw)BU(+=kwvW{X<SpeDVg<JW<mlCpy-F
zJxZvH2+S#>>t8ohGxS;cD$F}gTmqq?LI)76smPXG>@|1M9(izYxjyjyGO$Y*z}}q4
ze2SsE!~(c1UUn$z11kjSqK#fSiC0Xk=Cr{<^AE~aaRo~D$yJtUw-fT~7!5dc`UvBF
z3@Eu%ACE3+ufLNAo)NC$VG?fI%2d$K+)DAbqU(dOU;Pwl?D#UI<SPpBB||dW*;J*m
z&*EZuO16v4;Kg8~G08r>Oq6yz3QitqV@;`$d`4qeSHecj%1}ww{qH!iwL{0_QscTg
z+|7*CdP#w@g1izd3}_U~#uPY{(tmG*$50`hQM+h(hARAMGME#{dJ|#@DyHOhU=3M*
zo5*oOp$Nh{fkK}_8SBq=mcVm8?s?FT)lk3N28Bi`e74v+^H47&Slg6#bwJeFL7iCI
zuMq-|0AD=L0wIWn+F>sy^HbICyh3jmN?9^Io5SL#y8u^NNsb74uPhg^j)_5?V4NHP
zdS=0*#StE936iu9B*##wrEREn#>?R8bMlnl%lZfB*_&mRLCubal#knT&0DMA0$IDd
zN?<WrY6~LdZX~bbt`pU)W~aMCHkvk4nI|M>4u+Wv^h=?bEFQi{=YB#OH$HJ|Xz03~
z=k9J1(WCFW7piL$&s4Fmq&#~h#_N5_az*he$x}ELS)EOn{6R4i3D8*uy}z=eD|2?f
zGf)fHj|ZjAK+z&eLuo79D9Xrd&H{{Ut7cEg!_x%ROO)FvgA<)25@FK<#qh+ymO3dh
z(-_9p?EHy3WtB0YBq^|67*RNWN<Wu$aoU`VczoQB`c{?zK5ju}^NcHC3XnZ#xA8+1
zvqs+|4=cQpRyiN*?4WZ_XB)8`|B~|?U;sG8=j-WV^`0D*D^+!K9b}`fYW`MM)1)N1
zoGQ~n>Wjsj_iOF(UB6}8u^-rq^f}Ij+jsJN^Vo?nr8RC2t<t4+6jm#+UROha>&?Rc
z)mV2A9P=qjqfV8MVZxW%FMjB~qi8mt^V#WvthFzFj)wi-D3?qwqTui4icCL|AN;Dn
z31uP;-U&NVH0%aXx$@l`xPjCUPMC*#*@_GVV-~a_e%Lh(s(s16mz0~1Q6hZv$fH#9
zkRon-s>W+Db+^?27csFVha;J%M6l{W-We~qNpJ4)u_g0iKh7$NK4x{b4j8@FFBzOo
z|3%Pt&c?Fbo1;PV*XgGUYI#dee|DBG^e^-F8Racb(uoMClFulCQIPq%c5=^Q=NcIJ
zEnc}bVap#K#n<;@SgBkI3jMCsA<y20h`z3JB+skj_Kpa%4k8HxrPb)F-O~7qi*gmZ
zIjVM4gTXzO#S-iIt4mJhJa&^Mo;2ZscRb0t0voYEK8T~^3__mh`u7Bn^?H0r3%Ra>
zXhd7#XSkUq)>%9a68eSplO%Jw)wCo4UbjL>q)mBoWo=q}*cAq781j*W-btAk@8nSg
zU`FNXPl))T^l@=|TCAW7C#tG^t!}?XbvmHys%wkLTrqz6p9*-#jAW*GoZY!R(d4%z
za4=4-9P(4?i`c=m+Xsl#B?qC?evX1)!S5)~NOOrRJ3a(gYKmjv;u8{2_W32jkX}0p
zELldj{o_f^91*ZLy>!vXt8)~XkaIMnTght1&L({9$+Vi}Xbgq6IxW!A@fcgLK^j6x
zSksD|7g*KKr#^s%YyDa|PvuP4wAutlspazM^51U_kZrjJ7c)0HVOkFM{e0WZCig#d
zOq5VX+r86u0l`f!Z`n}?^f~m1K?OA^cD>Nt$DO%RB1ckut?s*@fjkb}Z(e8xU%#D(
zm+PqPw$o)vRZxf&=Zd8W<KaDqrIXl`e5cP8+R?Y>7~ghMOKeP<Qw-)Y#HbQxFOHnn
zZ3GT<(Tw?H5S_Asl#VIf!!7_p0Kcl*aT)Y(Row)p7n6l8Z{&<(n=u~JFsR#)K(oGK
zlr|f`5Z&VM>4e=}!hLZaYKeLH6DD~QgfNwt*ju179IYAE{D$jkZ_lgQLc^@4Q}?&^
zE*El_8-1^rUn4jh0`3$=DwQ2)^!6yt>*BxR_K36Nh~##bFr7DfS-masxY_v}lV~b)
zOF8CJ6q4dc;~6u}H>q5t-O24vhTT+&U}7Vv8toTs+p6+RdXyQj0C1kY=}46k65j65
z_=5%rjUiZB(*+IM_wm9yoAPp<H5$~~YQrFX3ARALF|_)f&>AHZ4S2gVkWNn5!OID?
ztQ&B}>XG^F8;+lo%W|`lCC!H}KTDV_aW7vvh~d@4($1gy_GviEU5T>k_xt$X5A*5~
zKP1CIaLu18%q~g@$jutbv*4Nw{kSR(aTb5~KYJNjqisLE?xV_6q4;LPy6!^5I|v+y
z9qwDPy7!LEIAIsvnkw|e*}ZM)8k?&6IgVk`?@cxG@VWK(!x-MTme;`6Gs4tZ%*hgk
zAiZpIMN9=70yq0VaAf#^#I@&eVJ|XcV6FR7gZxDJqZ8va^7?RD5?~e|J|=W|u$aes
z<b_gm##2dt<6u0YkGa6^8;b47$jr?`PMzr;r3{+}FMv|0tL6A=%SN|0;6Kf9ErM(2
z`UH1$<42ytE`#8iMaE1f4PCjME*mCEL~MeNZWE7V5%R48!}#~V*$UP3wE?iyAvpf;
zKP+mD0*9pmo2c6?{a&W93a$v!qT^R&5DHXoy$z(7>Z_f+CgrY39BC#Y>=I~?vttEQ
zg<L<;WehSBjx7v+NVRLKf5Y0>>)g}D!i$1KGjTHLC?Jm@9qX+xLd+x5RVCSG(Vmz{
zHLp_{xFhanv06K7Y)8XpTPB4mTiCBiv?YLum%t4h&>~&TaUya6Ah;SFrFds95!j$!
z3{voLUAXh;0kudFT4a8)%Ok-dsX3#$Lv>_nZRbA*wC*<~yTb2|A*YRL&0t>V;;NA-
z6h<wU)B1n1`{wMKgGO!t1VPVW^MuQJNrR?R2M@OB9HrJ|EDqqCy!JySL#_Pr?WokJ
zIoMrD1Ea->7@Z%X#Dq<$)Cmj35=(~Nb#OV;#B9(+G9R)OUv%qKtWC8zZBfFGB<Xc?
zp0IF;KzUnjY!hAdvdK~tthZ@+bwYY)y?E%AY>tv!Uh@z+MLguV9_sh86H%HBjY}y`
zu|zH9y+px4r0p45n@}qOy<<lRTgJC4FIS|3G?dQjrLd4W<5OrjfCHt(t-8_PSPa>t
z-@J{O)6%Oz`&Vy9N3zx8i`b~|!$`@jHV1^6;`)EWzLK0WhAY4ur=H+s@uiKa^sgQ1
zE(~)@<zXFz4a54yR#$qv#6J!YsuKRZz}Rf;!kqHwUk()Lj#PM&FE4s5Z`YF87_bhh
zsXL1$;5<3k)CfYYEu=5EF{Ox^XD&deY1h=2ESy@FW5nga?FkI5LAbhZ^hAilF`w;u
z-UM3L;EI44X`^l^GoBB~E0cZbYN<XMbN`ej{b;GayRLawnvmU&){!QpS=nDQEy+tP
z=ZqW3sh=WweFSeu_|<>vYM}e&9yk$H^_%*>%}0IkjU&nhpY7nUWgQ;PkE#&BV#_|}
zl7F==U_PhUpem#ogffiDV=wEse>|;FC%@~i6*oW&YTmo(^1U4&AYvdQmn?idE3?CE
zxL2q6IF~dz)0>cbA(pEd5z5Vi!zle7$8ocmrZAlbl3W<}BWF_JWnT(!k%yG*Z7IZY
zSYYx=!KnS-c^Pe)ZMVTA+FlCDd-xor3bKgN${#Nv1}&+h@>1=k{6JC@Gq#1qV@zIb
zp!G1-KI8n?)zlFXBMR7Bt40i>R!n!8_D_`}#0#m4Guq$*A6zU|D}s>O?U=!hcq->K
zd0*z-?5jsXAvhn{To{KfFDdfmJbz!JPQ>v{DD@o_`{tJEu?TbaD{wh)wKQBO@JU8$
z!g8!P3+`H3UbLU{;FB}JO~2YcJjPcw2;#)$3xho90^TVMNpb+{{g?1w20X3yw*3jc
zoILT7Tkek#D)S4SyG$(LvB?j)v?!?r_<8MP#YZFU2P$N6)qbZSt`)-+wJ1;d$kah;
z&2`VOgR8mI?V|qdGi((%c^&IVZa`;Mvv^n&aP#o(U^nwz=NWPu#DcQAIv;>k^Uo5M
zT;<FZsvJf=+ijwD22)<2*<KAJZ9a{Rq$#G3$0H#Wvf1oj1h|b#ngbt{%4$_m?Ir6A
z7}$jD;L^=o@yp#XTP!_l3!W~>&(fxnTVWRr#r89_TY_#1eDB~_nRh~CTbcUXdfUJ}
z6+t0jzq~>`Adnth?|yOBNG`P&namH1TUTKccxs5Mli0>cMO?m6Pg~x_SAB-)aK?{g
z&Hec%tTF-XC}6VQHBoeh+Pwn1GJw5MOb#G)cuBO`b=X>;wL#;wckIWg3hQx&mvo-(
z3!QRmsFtrtpC1GmSk4Mm?Oq^B_p6}}S~;OElR0zM$rg#I4JB)fDcF2?!(XH%aH$Bo
zJl$sfE>Fgn?#rVr9v^vs;jT|ioenGC_WRut(!hfB@0akJsg{w0gl<?}HU4}{kj!6G
zB^UCU+#szQ$3dPA-P@OKWIxX;1Yh3sijp$%YFFiW2kp#(H*_{OmZglCwGdzxda3Cg
z3m22I+xS03)+xrk_rF?FuD3HAE9<p?!7OWemwWVrjMh|FTxhKEgXxY@I`D-5AXJ2u
zMfaY;Zga0esBbq%R0SxXj+VbOM}FDCkTxGJM@_X59-=2#qZCTC;KA{S3}aY_t2`n8
z`=T5#A0Ww7LKL1?^2w(NuwTXVbyFM?E`GWw18I68<smmwkdre&%uo$lAH(tFtfco{
zm=^b*k&xNv86G3>OXJKw>GL<iTqNB!IifrZtcQ15`A|937|`)>*_Z|)dF8RqMUef@
z7Aww=>g)}kk%S@_t5c5?UGJ6O%!rdAe<erK6QA$DYm8=?DBUEIs{-!QS8MAT`w~Lf
zpD>0pCKcxUdjl)(3O>VBs43H2C^w98ew275QklU&qGF&`o4g%Ax@cLSF*w%;Xu|T%
zmd;#GnO!ugz2b<FyuO(~C8FL%+P7z_i!P|ou8ty8DP5Cgh>BOYR~E;{#6vbW>%@<=
z8L1t+T9EXbhx|E|3G&~T)K#=)YYH&8&G#M0^hCzDR47`q8C+c_ST0PKo+;?MXE7R3
zXtgM@c}J~rUFdee&5Ccr=~0@$hL^Mv>~DxxYu6cw&h(RVqJ4!(JK~Ko<k05Tz%_oD
z+2-i_Jiu1m!`6h7D?fE%IU=D_=G<?X6F$q~hGXjrhqk8iL<|bhf{ETf>)4g(2WzeQ
zD^)K)hQjrWZ3MyUxBB0~T<0@9tYg|jF}<celG!l(0gWkXt)&`zIdJRRP<!f&7cEht
z1}LU(LJWm8ve6lR7BJEx5xP(a%Dal48&&E^&ZUPE1SxbmTHTeI+Q!OFfsBxYy5uO;
zn=WrK@;bUzG6HQ&C4I;rR-fpPc8Oro?4OX~47dX<18LotGgfwX5O;@N$w68eoBPYV
zKv}5^TB+JOza)xA1$b$0d6_hbcM@v?4}BC9F|Wm1^^Y~S6zY)C98P-be=VwsV3qWT
z*4!Gxvzb&8Jb$KSdu*6>+=vpf{ZUo4)vz^jM_9a!W3hGC)rQV>0~6Xv%`JOKZN2O)
zW!0kFDsQCrxm<8A$jA#1Jv;xd^0RZ)D&=+GyZkdzi`^wpj*C9!6+_Zu%L>6qxc_$G
zNK$~%Y55^h`5k?m0^G4bim3o0F~DPzb)e{+z@xU_Z!c!}iYbdxD5-Q5G8%}Tm2zts
zBZ?l>9}kMdS1RD?Z1L#MceFl*2Bg@i=sLpMK5?G~<|HLYtO}~zL2y(GNO4z!+N(4+
z31lN-3*F|%evVYdtxRd{H|w5OUAwwchnX=dd7V*>C5dpF!wUdElfWh6UVT~-xV>c;
z3xq5G$fjO09H_t<01Bt{gBPy_=2C}2;7MhkC2|uhr8fv5CTETi0;ssJK3`@?Y43s-
z5{rhAWs-fZJcA92xzXhxb#t{zhLkqHtsJu@P;2(I7^Zh~1Up-A^K;O#`->{D1)A5&
zw*|qtXjOxDh3h8au6U~~b}w*_5|W0@EPkSOsm7Y23RM=Xy672*jw<<0gh|u`+>0nn
zpQPg!L082nZZ&BN<?lJbx>+{ob9P|oxZJEW-6TLG`Pki+?K3Od^wVq;P3a}9wm`q8
zq?-X^)6y0+K}i<^`*$gG3ES%}nv?(t!2cY^jkXjnb0d_Lt6Y&NcdB66W+-Fe4F=wo
znISVb#g)3x#H_IdWT15^?Jy=Nx!(U!%mZ@&(8(hLLFnfN^0aW(DKf4AZg~JR9?j?U
z6Q+#zpfo{ue9{SO$Ry40afwEcATIW@>W`;r+E}X2aWUAPvPBjGjF}ni2}OvPOveK{
z!tV|T63E=gXFj5J=dFiw)I?3VCXZSOJ?o4OW!j(EK-bVH1QhpGrD2UtYZFp7W3ulc
z0&xDZ_vTt7v$?jKJr0B#B;PG_D#Ef3?+wVKdHax#sNPoz8{|{#A2x(!!OP&HvbT<H
z%xXjOXtJHBCS<vf53hL3cF7{tL<Y~?F@>%AaYOZ?);|K}9)}hBW#lk!<-x4M41KP|
zAaVQWStKw{`|9*nQtQ1cSO2J^vKwKfZ+DQw`Gr??0Dn~3Q7+ZuU66Dzb7QJ^b}Ta#
zz;>H)eNTydr_;Fy7;iS=St}Wj@byW_b&GcJYEKwbLV71g*E@*~bG5*d8OnF-drJ65
z8`Eb*|7Bo04hhadK|S@C@*B_yGRfYc8z}#aFLO_+(@1uZ-dg-Oypv?05YWDiNNBIe
zma4N@15>GaWcX5tEzi_svHI7H^M`EYLUHUdBm?x}#rL|u#<?l%40;_(10w=u?3vNA
zXBHk!HuKAoQ5s!F7<xMhowro!hnxyde87C9jt-RUN`tjKPJf1x(m<pS;U)eI97x6%
zG_S}XZ~ao%>GL-Ve4YuuJ4)Cd<F80uM%j(odOl2EXyGX(R%0~_EV+1t6ZSLlAIhus
z_MBaPtft?{gk7VPHJGj}-%0K@CIJFXkgF+7gBq;BqKZx5v64Jix$;Rk%)dwAX|1E#
zh-7<D2r}4HI2AC{rDcJYMVCivRK+b%oa}1Uc*P{SKehD!8+-2*t6SHuYrey_ZF3II
zVcWKC+qP}nw&yVCux;Dg-@jI+Dp_k~C%ckL>fk?UdD7DRNpETCxvrD@uB}%cdX3pj
z<1BC)%t{s|)be?X5)<~1vFmZ6(B0*QA#kNx9;wlS4XUxN*nd%H6hS)?xuNO`1TQhH
z`FpzC&P}ncrMKS4hQ;Gov(H1(5IOq7`Z!0n!L!xm1e4VW`Am5Y^y=lXL#G_3c-;c;
zTlZ?~;QQ2zrU#Y0qx6g38g{LeyR!cN8u?wR>;YvGG!#kEiu8dU5dJY#;@A2R4!bMA
z>#3nlJ5Pd0w~0858Ko=$n58GzqU`}bIuX%IGE^!7bx>DnaIRqLEIY7rr=+hd!Zk`K
zMI{UJtQ5aNr}298?aHKkz@KVx>#Gt>DJq)LF6mU<o4+4+A&P&*W+uV3D)_p0H7T9t
z?<rE*kH}L8rCe$k@V|gaSyaQ~Fa146`XiL_f<ndvT@KvHqDP$4w)?mxxc~Ue2=xkE
z)O<OlCmk0;!HBpZ5|A*%dI3}&WsLSpwZQ8*Zq0vf!mlu8X^^YkXb1<QL_Sg(<jt8r
zgVBJ4ISgVrb{szoEY0bT_lH{zB^rojvfndEE^6>TjTp?X4r|bB--}fq+wasp635a)
z=jAxGZL=GK<J@$gIwAQzm;#OEVoXO=eQVt<VH&M>d2Voi{qcrwZ??BJP`$Q94cAM;
zR8ie~cA&}i1S1QYEJ?6YsRlRnPQjeF*D#7RWyPWIER(Jhn;qdg$^%2U2dxj`JDsmC
zPgJj0kDs?o4UIP8!0AImB5kOaK%J0H>?%?BH_7J>hb1Uu2y!{Na$*lt1C2@=9)-m^
zJ64!ri0?1AfyhoEynk*}c_HPWa!ujYQFPBrjWDQ*Sn&e0Y8R}4M$tm}0~Fahl!7s0
zJq}WtdUBLp|7~A|BgNWEmKhdhA{=Vne!>>?+(|Otc<*vSKaH{B`5toq)J%)rh%jGK
z?;EgsmfI)R6w^s&fbOTLGRVpVHx3GN1ijOOPiMBvn9^`<pt_om5RpG!1#%_ujy-TU
z2B1(GDI3b&JO5OsMCxfbO1a1d2sqc-!Yq!q*ui|+w(15}JX6+$+9$srBzb-gT3=ze
z%>QBRI6xfFe7h5FP-Xl;WwIH*sESwG7JvJ~`Qm~ibTwn)hYT7LY3K*Tz6%MQ{RTv8
zV@2<+L^aWLWwQB@{s5m-?N3_F@ZUO+uu+W_S!`}n%iMGWaP542%-{<kFSK$9{dz6I
zRvy&=G`mZvPrr0i$Z>fe3k+Jt&PQrsae8GTXTJbWNEOXD@6WY~m-bF*a&ri&qY0*k
zlM<fk>_?J2C0hj0w;!CLDBgK&<=pnmNFw(;J^|KS{FL%yd64<*iuob%L1hC3^&OpH
znp*HBV=~9&tzqYkUbMj{Eb8GM1|<?_Oa#h8E7^CK`bF9gx?DIm(R^xH6}=Nn!RA`j
z?an;dZ=*VLXy;*jJzwpoBbS)Ni}DDRi(a#X&w14+%)!V-em_NiJ{KT|(RnBfq|b&C
zg71gXdg)W!wQ;(O?MJ(~T?B7lDtSUDzC`|P)<@Qrlnh}+c>V}z&TJc0aUQLy2q~Pj
zTk&(rKXNH2o<=hzdOgmH3g9LnSB^BD<~8{F;_+y(B|2hY#S<NV0ehO_&hAsAgp9dg
zUUQLWy7w`6X-s2sbayd$@%N{CgF4T%MUQ-r#TiSJ-+OW1h!A&h_~>LdwntWbE?J5t
z&Ws0fX<MjF*e&TG{)lk?HDjv6FlbSC0(1B^;l%eQ*3KEJ$N3b^IlLl$0$^BP7)}el
z({(#ltVyQe3x&jA-M#)2+`nNDE)5#~Cf7z#ry7w%FFJuENZp_V<u;S{Zb=R_4-+M#
zg+wCYHy}QVQ)J(UGHk~1IU8lN`Ln_By#_HkAyHU4r-PP1!}mHzQFn9-av9X9+s|Xe
zh)B)ZGf{JFPxy_Nfo*yXE3$V|-YiFoU|hsH`QhmlyGQ6zf$2y7&j04jf3-7r<;$Fg
z(YJ^q&ZOA%IAZ3%-HbM9(f5F`Alm6ZVe%YA%E9K9;JUU5WD(ywHcvpU)f?RV5l#N?
zievA&HlIjI0P;m3dUm0tf-7+*TUVh~%vTSa5SI)RZa_d6nXJMP$?hi;#dy%jM}9HG
z51q`hvgKm0piYf+x|OA;Rau|fi#VV{4Xt$afUo>egN34I<Hy}}REqisf*tXUo^U*S
z3vacjG|%zxO)@qc=3|9t%{4L8e6Qcp{>n|Z`Q4hEdnu!6uk?O9A?zZ2Lw(s}56C5|
z7RoNCFLZXA*1<PrIN+rsayuXd?C5wxaW~_JSrXMR(-;`M=rjVMSM<;j3DiY9xSt(A
zKm^8!oVbr+qgsuXYgF?yh<WQMsQ5Nm>uu2}W$itT<l_B=GJmE&QgGiIjr<r<e!bu=
zfo>G#)C6w65P6rk6(w848eO@LBrlry^u@SvV4@l7d$ya~Q%yM5CSo}=5-Bt_UP{6W
zeC#Xh2qfp@_lE=utf>nLHFozJM$nd#qb9$gtAT_B2V+;%k&Ex!+flvs9<;Ia`X(%)
zV3G8ue3Pd7QoJ<=`({2raf$KFJ(ru6eh-yl+=l&Vd64L0g!~4f^*F5I82&Sm=>=j!
zsSNgY<#S1>y}g9~a1Qj%90g}i*#i}x#QfYUssvP3&PkDyABgC3sj~P59<0hE2DvO$
z@cnV^Q+i%~*tN+!ZNj4Jt2yWk^c9l`6uqZ*_jYDUz<-wKxsK)kz1)4>^b^kbDAJig
zYsFuHoH&mm(@nE)R_0F`6c(wn0}chOv*>4z=2}qRT_#BqW5>CwtWJnrY-!_iZF>R+
zN%1ZMDxWrDxb+g1DaaS0{D4{q9X*{7$`cPTaI`8^R~s;WLT=*7VQ4b+zEV#+$jQ7j
zwbdI3Z6mtldk*%b<(?bQlvsXc^$t$kWkZ*1EU)&za%iSpt*XVsWg9Y3)orkZf_V{y
z9hLSI9Y*0acfKL_>^x3oA=s0b8j#4arwMMf*c4%{R{;?m;;_R*Z40(Fka=Tg6jJ72
z>mHasS(%?bcDT+>@{Vd2f27^S+2L~$)f=4b(Fdw~oe}u;Qw9cfYIhX(wLmf!qJ|?o
zg^OHYW0*7Hs0f_A1PWw4lEfyt8Vgrjo(j(r)h;qXp{iiOlQhpr;)>~7l@md!O5nPD
ztimM^rSdQYF9!r-#jYUAC6WN3fi*!nathV8B=Oqbf*)z+UvG|n?_gqNYgH4%e4LZ(
zf~HL0ZOQAzx4Z0QA@<cTm}nHHDyOC<&j<&|1fe!S(-<o&ixd||lIUI)(NJko5=WT|
zf?wmz%O0}iHQZ!2*Zc;&+0j7Kc&{ctP&46s7%O$O`#-Bp^%^8GbYQeb{{BU@J-=EN
zZMCeQ&^ILWK}`|3FH$FT+V?&FmnnqeO^njN3uE7v{(@UU_!*jh)+bAtQiqnFsv#}k
z$_MQCUJwTUh5mYKtSU>y!9`?O${3`MiP~F!h9tKm7Hu3N#V^)4#gSz{83F4A3<r~I
z>36t2onQt!eLm5pYJLEXx=E#4YDg}^Zl4;T!l|DmB)=a@U2j3i?`I|VAiCKS4Um@@
z@&&DoY4sA`taMZX_}?2u<?eG1ceU_6;KMy2wmwmey}J3(!CrO|FwLJUapLK&PG}uh
zh3-TSS1#(Cz4c%j5K2?zh8@;t#oJS!GSD=7*nwstv1JX+Mwt23B)zl`pY)3xgMNO{
zgVsAJmVfS&Idh0mxcz^>+RnCUEW<vJXx%Pb6?9n-6w;dFOO#HCu&eaBE>zPq2JfV6
zmZ;25fk}dQsPHSbJ=$QpF4OB&|GBWA%nOMTx(<+E0SWSC<^Uh%CpD#wcDZ@<xmu+Y
z`ea%Ixe?vxyA^)=UMK{{MA>9~Im*iz`she?D?zsI&9s;_`P}5K4Blj!|LxmKnNn^l
z+gS_KwcKxu#0G!<hn0qBMIfWSjp{x(FwE3(fs7?(^O%OKfYYvq>7uMK2b4z448|N)
zsiBynmzI#*0aCu*1s)1Ih~WV!zd6_k<%A&u0rZ36eGE=6#aAu^h!*AZOYEfAamm#C
ze24lZf1D|cY=TyW{{7e|WrH4WVhQQi(^J34qmtvH-V;1<ZKsp%-umK43hmeLoiI=Y
za-C|)j`2ckOG(6FY|!d%;BlPx#_|D(s{3F{!>5s1xf(J(#LnBNNuwqPa*r|2{U0Q3
z9|E67&mRjjz#q`M_b!AfzoSYO_n;f9PL<tdGiIfpJK_gkra%@H@(R;|YNm4-*?i4N
zpCLY-oC;jhWd8xS!4D&@cYAaCu!vt!%yc3^aBTo^r!(bMQaoq4J=R;u?5qx&sEC?D
zBnFAkRCF+03v|goGGEPnq4Zq?4|G7}gWv8M;rGG>fZocTb(@qapj&ZBDHRI(gWl5Q
z*{6w$*=l(i=N%Ycf1%ntM7{(F65{36ohdV=n^uT1F83UOK(}UcRUvVjXw_o5#f#Kg
z6wrw@AT2gPAx_>{e;d`_O|@wpKda9d>i6xthbO$yxp}h_{!vAOBa7#Tw)-Pm`zpNM
zd33T9`1=dPz3Ap1foQ9GN&ESd_e_8w!yl7aj6A*=TAqw@_~Ip5Ae0fO41yvxa`8rg
z<hH-DkZO9u00$db6&?md53!#?Z~a%nq80fOFk!umasBZ7HiYNA;(Ev8$B-<s(eJus
zZ{lyVl|wm<yF6F${Jy=kFV?Nyt~A^4jxTn~zG<xdyw!3Hm%Y|#f1F=H$a$CoSfcW-
zcIOB-sIwT(z($}*OM7?Mxeg^raR`4!X*T3rjT_W4gG8wD1YnF*p;a?yoVyW$xYLB)
z26Be5?IkoxzP9^m!u8OdChALPao7n2S5L5dLC@6|c)nrf3kO{K7CMh|KJJKW6L|Y#
zf^WFo$mQP0ASu6s0US0|$OJYZ85pqno7tdM;L2otc2@8#i>?lpbYsoZj@MW+n4L~Y
zu0#~_I9(~4pjXNPF3YIBC}H8hHCRlkBh<j%5+fhG4vI;;r4s{RiN(((TgN~?nUH@-
zMgw0*lYwZlz4uA3>b^dGSzf=<3G7!7+noY^5<R*2Ly^L7+bei`Reg%!@41bE^-61W
z#((o`pCT=9oly#(z(_-JmdEWx&VjO-0?TSk&6{sjCq9z*p6D8?p(oJB5%rK=V{16<
zW6<YTY&6ZLl0UPXu=yJ!=aKdnBvl7}qF?U>#QPmI5ck%kERObext%P#@nJx{VUeCv
zh1Q4m`@np8@3dLwbB7fL7)Iw?Qu`EoMBN3$m~1pDv^BnofbF#V%s3Ns-Efe&f+b9`
z7Fv_nQkAgSoRg;c%9V?+q<#00&<45oGR!8FEQaBAcQ4wF9{eW0yWve8@*BbQ|L)ZL
z2~iOrlB2AoV<}nhX!uqc037|I@TEg>CsDY7W(LsogqG(aw3HU{hSbCc=4_<qXThj9
z6<7$OPcJg@Ge=<(CJ1Dx(%qSi0}7z+N2f{-JbOjY&u$*vKV?b3QJo$@af?i#a({vA
zN8jR;?uI$wJd5h-x&ukSqwQ2h>g>V^@!p{j+XY})P^+QKq6o>%4)!*B9id0$>jsyS
z*(f@b%M`1CgbZMuc@>eX$A=a1zvaThb@T6o=*Y$YSc$*JiBNNfm9<XwH$?%R*1g2M
zWXHb0YLXt(NUh8wrAv4dezDpbB5}_@i5hBm$(^Kwr}%7?B*%VHQwV=fJrOsLO3a1N
zq0rkuB#zx0)#fEP8ZJ#1)<~T?u-hGxqpbHFW{MH-zr?Z9#lnCvinb$T?fnrSiitdX
zfmRYu)H4V)v~1H11^Tqcj{;q6S$w%<Ey__JYm1?BxIxU1eI+KgPg!LRhERZb@ycEt
z4b2TTGbhVDm;gMk{2Y6Y#=G}L4Sm3o$}0xAjbb)@BWSh?LjorA{WGvfN`q)H*zf0a
z+v!Ux0&W#8IY>}l0nCsftVF_)Px3_Gv7>&09|**EZ-a)(#h1KE2Y%g{`Pm0&;3aMw
z47pJ+_Z#g!F*t5S1y<p;&Na}G+(4!f=9Fow4{JsQOHDnoB{u!E$R{UUAn^k2#;mU)
zH#56AcDUzT58J!ITnP1EQ~BBq$lo-K0Gv2`XxpFGm)sE2cLEj&pooonP^AH3SU!VA
zw^#TJ$hQkiTK|>jwaW&|PQRcVr%Nu|F8WQAA}OSyV;J+g1ZUGttc?|<+(vhVhT9fB
zqfW0)Nc(OTe>bOFxsb{|9~_5ZUl@reC-*obv^+omfwDDg5}xuND}_$<G8d6}kaBUS
znBX+wFir~!_r4h<Uj&kFJ>GUFTDngHXmEXwA5GCQJ3j&ws~vx{ZoHQ|SYTcUH%3t#
z9cGfY-rPTR<f^ih&kyJ#N9^RTDW_AFWyI67#CsT+d(38sF5LHcFL!>e|9m8A7k3;Y
z8U|(G*Lh4V(st~JlYkJ|`2kc0c4|UHVODy%>htTN;v;sUDC#8^zP)f?u2h#-DG>zM
zmHN?FnwdYzCmc)cBVJ$dls<WRH}Z?xE>~7ihnJ`RMTz*wEo(}LrGB0WsGD$EX;j<(
zGg(vLVI~i&M`~!-&vTQDf8G@=fcE98$gm}~@q770ZeZ)ET_@Vmh4cFCsYA?@6X_)C
zLLss^Yk94Jf7;Ey3l6Hc=U6%LrBp5e7oqB#j|OBYF@<xSv+?QkO0O62!-JRSR3oQ|
zYy?Y*O(gh%d?6INo2KnlY_TjPZ>sX8Im^f5#}^HY_`|CHNXs_@I##%I!IQQ3)dvl-
zNF)r5SbbZo?!H8!_PR;X_jW@juN<QOkz~{JBOUbg1BMB3QRe)Skx8%ruTeWmhn^6W
zVgLZX*#9nS2lc;4?XdkvxFaz9*WLe+wDYf=TEzcI+97!OG5BXd*^6s90RS*4|5`wR
z%xp{m09xi>wUhGZcFuNA=63dk|0<xg|Gx_;*K?HI)RSJ&d3Rn+5L5+MZyVCA0|3M%
z)sSO|8ik070E1veWd7lhaA;LjG^A{Cm7%~TXz`rz{d~%HGl9r(%_tRZ_G^O8vKAlD
zo2#pjm5=U|?32$Kk68qNBxLf0<3dXShhhjf=PE&*ocPdqk3TS)_%0|R;_>958Q3rY
za0}w$?(1C7_X$*I2LJ}xFVT}CkM8{hb;^^g0SFTSyTr&RFhKE&fH8XIF;u`9CZJxa
z$ru`t3;<YrcncB(D&YW^j}p9KfYpkmO$@+lA#MdEAO;AKK`BNG%-;pjR|!z01@0dN
z<X7_((}VWc0{LsSGKm5E_kaOhW7Xpk`1Jw)8G^J^077<PfDk^)Gzg(INIv6y-)@DT
zeMq}F5TJiDWjal2o*A`0<uA6|{q62P(f*)ygP;Kh6{0EBA#rwE772>@35fIzEC7K0
zHaGCi&KG}je7JXPdSZR^I9&K`b!$h=OLVvM-5m`K3P6;dy;;{gI$8#?9|fv+>9eZP
z0<5b7%y-^&m^YyEHKG4{zD0SkfAZt!7RZlr<KaTXz+90T7W6P4MDhMG@7e7}`9A;i
z^n1he7T}P{pHb6a6!hg_VC!0|7<)1aD)`Ix<%HyWG{o;KmTGRFr9qn(E%Hu1qFtU?
zX4IoYF+rGUJY^sG%#Z1gAoU9>$qf!r9V*u^+X~S#Y2EL84FntouRiYz;P-u?i^hgY
z03e#NFnPQH07-psar`tufa$d20|21=6jQrA8AEym5&#g+51_6WfPfu9t?q}<9>DAF
z#{f0}7v_g0?dL`m1V8l0g)YEM6~I#N=UfGCsRzN%N6OqoY##W<4tKJPtQ~M+j{&Za
znLCKt9SQ|1Fb0WYK*Sl2WEi_jJOhc55erIeAkLELUrcxwj;cUBJmy#oTp?(gpd(Il
zPv?lr5u?rj9=|b0$Q1b**)8@fIiOJiWD(efzoVQ0J8~r7Y0jAiLB~I}&}t658K1|$
zwXkeX>eR&<;1d~Z<UjWd-ZXm6Ks!22L_b0un|u`A=t!MaHICH?PyM$m8cu(%!3`uS
zaFjpFC8TaJ;-Gb4e7u;tw7O6^*(FIcawnu3R8a7*K?>rea=B(QPvo~DcSFvGcy-Zg
z@@pb|qFgdv3V0N~Bym#s@x((}Xd<$BCJ7h`EAb6+x?-hb-g!ieY-#d~c$@L<L&!$|
zYQnUHws?eixx|n0KZk9ooWtS!(olt@ip9yulB_0tN1!EnOoAEtl?u}pxr>mM;hcGz
z5;pm+@(fC06(}q&nPk&h=t7glbVW;lGcC+4Ud$QJoI9bmg78Js{-(`aokE<QoCQ6)
z!NP^Y1&xXuQes(Qd0~}dwqY@3NSA^wq-BgLGp;b<WSFHRq}!>eQ$JICqa{orr*NjI
zrue3uR4S`Dsqig%RKh4%sUTG8s``|Qsx-+TR6s4FS1ncGsdQDa)y^ooDaOgqD(DsU
z>U{;i8^JY(hKS~eiWeyxwT)oK5TTDSncS%hE<37%T+mvj%NS}kzFkVYf_>n)GI&WV
z2{~1oR+}c6<{Udr1Hq3p?A~&$WlPQw&A`og(SgwM(KRev)|l4#*8E=gT<={symGuk
zzq(kzak0<g&!NqE;<Vv>ae?Y&>s06r>D+LcJ?C98y6`xIdYX8GKiirUd$M^fdcrur
zS-zPg_|3=y$rg`g{fph`b}HWJ)GFPgeeO1RuN-O8yfb0Qyl76Mh@zeRI?U{V)g6P^
zwAv2Wu$pDtWYdb<z|eweqj;!z_^_91I@v1Iv~#X`!Fg(GjCQknwR-$AmSZW~D%YTQ
zt$X7$CZt3pdss4xEowA%J=J>>ELA4;r8-@eSJgxHNp+=KVp;ow_QGaa%~~EuEeke_
zGi$Q7ye6w=$TiDm2X!Acj%uFjNy&Eo*X8FW^kwEH_!Y;q!86&j&GRhY6fQE}GM6)#
zx1+Pml&iIU_eJp@%b$v&ia%#+W;kXAPB{;(7^PD2lgMeVX&6d2WszmJd7hIgN7&b$
z^DPTcMOj^0n>A}Ti(6AX!#-6XGW1zE<2rwMZUi20U)1*<rVet-vdRV@;!hZKU3E2d
zKYH-xnzG4rml<uwHioozdnUc~IeB?Z-e=B0ct?1F^E~sydP{qWcX)b9e3yMQd?7w_
zKe*l}zv5o|_B`&<?_|OBfd+t%fO-P31DZgrKnOrHKuaK4!D7I=z!_k9(F9?k;4}yv
zlkEC2?s49Xm^aO6Gw0AIAal?(ao!oH$ffa@kzzw<A$Jgc?MmOI&!$=-!*|83!`lfg
zure^-d{C*VnJVee6`GZt9h_fim#YsoKFoSz@8T+=JGeG1TOD1^sx7S*t&J|T+Wp%r
z+XLLgUPbQGkeyLTp{^nhhgOGpA`YB@PpmVUvkx<sQ=N@!k2VWCFpke=CUf1mHCQ#`
zz1c(3k<%Laj)DjU<ry&Lj>>Fh@KEl9vqI!VdJAI;6&l*wCAkxib5v8F*|)fSgx<|V
z<wRXZn4#npX*?3J5<5s9WK@Nhx2tE@9M<SKlCzVuixlB3Qk!X37~3e@<V<O3lHd+K
zj%_AzlENll4oTje9yZXdL!{@5niXs1;nAfT%4yuSFtyy<#e2jx7nyfVzt7)DU;@#-
zd*bWm+v}TF+ub$pc8U8$y3k3YlrY@rf9WW88oOKE&ihQ7Pd280$?vNxs@z+8Y~IHz
z2F;h02+;(pv7}Tak5AgxK5BLtp&6tYtK3+oEorIxQDda&RohpW*S^+^wjb}S$?7e6
zKY7@!uWw7XO<Y}wUld>1R=;TU)k*eP3M~B%y@jj6xr;f%(X)}<b}sO=e2SfJo}QQn
zVKrdA(wb_m-ncJdD|+_K@za@9{i>;I>s=#XU+&v-^Ll^}!b9WQzDd69ZlQ5kv+5D?
zd9t0q4%~{vHpJ=dJNDgb7ju&v&W-ab@q&03xw)`(wzJ->>+5TTvQcD<!58PWKg#mA
zThF@6bZfEKq=p|9I2xeXDfRX`kUuS$`Lp?FdMCrL?FsTi+=FJGv(KfPuE-{zr=aKN
zG`c7UPZv+Dx9!LG=GTFd%P4D{T5f(0CC}a4VPMihnQ>Wejw~O~V#cP&i}YuPm5zc=
zkD1VHE+2;TwRD@_%lO0gNu17YxBVmWi{S=Yn^X-?EsvP5{nws&otE8&$;;%G8h5Sp
zqs#@@+|7dDyJi29)5_}#y-uD-&&|jsPMa<H7H&IP=hLg}^A(00^tJS+j%S>E-DmIm
z*Ez&H!nt4bcY{g4&F-syzy9nW4TKwbsIc7c<e!DGy?L=Iu_Y2wl9;$00s<U3?4En$
znWVk4#xj)I318J8j|-=&lbx^q52;!8&(&L)x2V~^T91kc$D68(I?hp&QG)In51zZy
z&zhMHpPTlZ&YjU7f(*(}{%`q*xp$+{vcGaKyeHn@pA0X-4<BUndCdP$u46;2_lH8#
zKYKzWaYY#bz>^FB@DBn2-hTd>X8?c;BLHx&4*+nc0{|FyiF(7L000QVf5tm%C&`#=
zt6+xa-DG=FFehb5l>Ra@%_JvdBWgxB6h<X!R)>_NIj@B#3*>7@qzw#rJ`n7p+Al2U
zN})yVN(h8$sH!AI#Sno*63QwdPX*07V{tp4>2bQ@7!|QD@14B)+S}mXr<c9c<KU0u
znqv;<1yI(zWNV<Br4DGsZ#BEw%@v4MPvkfi=DE$h2Y$U=2Tf=W=*-i5N?E(TU58)#
z=6@AMJoGU+c!^u%hzo4SngOxM9^F11r9OLvP`+YQaDm8n-^J7%N-l5Fr+v`sR5eH<
z(wWndHVpsSi!wM89o$hM^Lf?Z6IUGs3qdZV<n=o5Il6CHxbXJ<RcwU1mM9m!Z~7<k
z;=v+xaP7^1t?f6*+jpYcj`Yl)1$R<sg6%5%-Rd4b?`!LD)dL*w8}IIv6o|1@rX4+m
zG=dqsU%|jre<DOKZ!%GxR$NhK-08w7j9f_0%(xhZ(<`KvR;X1Qtl!t1p#_<-2dlxA
zs5CRu2o3)1^r6RB1~3R%40TM6yFfZO(&%8tL)+_@X(VfGty6p8@$CSxm{cS|ZL@~f
z1#(Fw3?EkNvJtOmO<Lesuo>xr76!A%gNCkL1af-$`xFmX|7yM%s#YmEOto+4ID?<-
z9V)jz%hiyO7mwz79uLb(XU|;-^5}YM5fY~;4Hi7C+3S_3w9&@xp>u9bO>&+ZCnfEH
z%Jglof~Ap?88@Gnrt^DjOkpZE{@-Xg3t=dQ(ZA4e6)x6ouvk~=8J7iF#h51vG%9~}
zO$D9~KUATQ&P#?Y17l0p*sR;!CKQa%Mp9iz5racbX-d$b*5(mQc!c_h?~Cr4G$w+)
zcCPB8g~9VETZ0=)@H99Z$RzNtVu_+*b&4qA7RzH~6VJx`f}BP!c9cL9s=kgO^s2Y{
z*!AjGV5UuzY%QTU!6^jKS$u29d{VGmd_H7q+g{0Me8M2_?;|2~z?;^#g`Aqa__p~d
z#R9MVM{*z!g7+->h7~gm8*VD^yMNo;?$HO{^QC$ixC-`u-o7@&?Hlcq3kyfgR}rQS
z(Cuq`+I{B%0j{WBf(PEp|669OQg>511Uvu$4F7*7l1z;MA(C_m^SA$lNdD`6)c+94
zm<T+$e~aY5Me^Sw`EQZ@w@Ch5B>ydv{}#!Ai{!sW^8c?Q2`c%YB59qh6`rDkI_l@;
z_tBMolg-R*HWST!Kt>*di-$rL7y*SPbT<$h9oR?;MI2t}86H`jM(C+fp2j~W-l@=Q
zo{R~}S&XU3vg<ycET4g$6XnFSbLH*z^jBKqAoQtq#qSG$`JIZRJ78E2a0J;2Q_>|+
z2L>xiPxKa#%mtblsJUp-u9WTArg79qwEh_Ai0(J$x0L9cZ*xy3{`IW?#5ZVI3jHD6
zH5*^1Pg0L1-U@)50J#dH%5Ua1xL?bWY}^a^y8)@vaUHyKtT9i~qL3UT5Ht_H$Q^)2
zng@mi8bqc1uH12ic{Zim_=-*WD5z~5<a6K`^E`gZ*ozW$KsX{2EubBA54(&xgvl5h
zXxG8PJ(W;&(p4)LtXI}?5SXvv@9-h_#nfH&GAwoJ>6UH8N49GYEdmiOiYr0~HoAm5
z5vtAd(U*0Q&^CIu^FTpB(7Bq_1y`4kDk{w7q?BaG=GipmnHkhq278HjRKUu7>De4X
zhlA73o$Yw~$};=%`|eLai=H>%aK;4{wz(79l6@?<l<pq}?~?tXt)7DeBMKh1hXeVE
z>)En)7EKBW;N6;OB8i~MyMgeOg8fx_K{)fpzjKD})eOd7a{OXq5X0w{c&3Jywn97@
z!oiY3f1bCAK~4;9r57{sXR&%U4>qHTZ*en)rr%R|mjf&nno1Xn++yTfiX|4J0X;LM
z8Pzb_)4$7zb$J+D%#XT{fHqW7E$FF4>sD6XN<|s_@WsGMo^eBaW?AoF$>9puqg86P
zq?E2Le{C*Z+S?FA@Pi=KA)M{ZM>8<;WHlWHu+>V(Iq2&j?*vSPO&iOI*F?E$k5VeJ
z6D(O)>mJ{aOR32Iq%tv?oLM`aY2Y+^hK#OF{&HfKT3hOVa87|xgUIeiL~8%*6gT=V
zOE5}Pu(ez2(7m6}-c&q}dxaK8;VG0n-!5ttO)Nz#K^`8+KJyDw>xQPjVS{4QF&SB#
zZ-_zFUi&8S?sMLvFCAV~p}8Pe9an76e9Te6EV4hSJT=Kg5LfGdGw~#_MbH*ZK#95)
zF}2D_lZ&DS2ertt<V%Rbns^dT0^EUII0A84kZwkTsUR0h!7##*NH&DMg*0OjfkrvC
zx*rDmL!`YBZ-oMKGOyKj(}#tUO`$E41!Z1ZoJlHMbG|cPODbD^|1xi)nw(P2T&FcM
zv^4br`l}Z>`s5A3!rFH2$m6GP{A#&!SmV%0t8+`t+``$xuQ=OK$XF{TWR&uJl*7{2
z9Ah=g9WsXMFLC}*D`1<MZ}2cb(~{TH9BYG()ggep#DAU~nJG;OISCp<9Fsyly+oEg
z5hEmdk<-5hMp98ix97KwI^X~^b8U9x^A_^0QYR-Z%P^Z5?3`O&fQlR}5}0p4`RkZu
zmq)m813_SGeD%ex<^CanVq<869O(?)LXEPf8DFR(svk=DyItvK2Ly1;e$j}XJ`eF<
zog4Jl%#jHJ0H8zoKXdN?tC`OLI`{v(X1<62{QX6%X<6egVSSq(Px-8PHLSRuh=x-I
z1Ow0l{3VHOfCo{{$=uI{R0z>h%n8<cpK275<j~3~|3a&%d;s8B!m|+D%H`>8O60|r
zii(K_T=!oat-N};x}3PaW~y^QAuZJKb8?=tAN+n^{C-SWJYK!p`^ADvE&e{SbVV7V
zD75R2+=+C9vr@sFn^jmuWirZHma;=HaKq~ef2Q~;9;EQxn}832#awhwv9$%ZSQL4b
z!3Js}wzN&KT#IB{n#~@mZN+EOo9eF-n8!XeUVnV-tx|-;=a|hR2y!ui;MI{0)@Rew
zUQ1lScp<Wh68<CC4*|wU-A(}h6GMB}w<Yk)&EQ;`OIGN&o_gUF!Wo#oC;-b*Ol-4m
zA8#(t7tLC^Zb<X^&cRfE>Dk&(!7{V2iSxojaMXM4w;7Nqyl3q_!ra0a$+XjVCJ)IG
zm|#5C@A$>a7hwuM59!uQGIJywsv>ec7LR9YK#h|RKEI$`Qn*!6rUhY4YOU=0z=P?}
zEkbnngYwDR1CabSCh*<oCeL13SYGm8U=`K`CJ)j?d%lCBH701Yq4!hMe#Vr#gqmv5
z95hi8XLE^BiMptq<vRE&G-yC=AUllzwn)qRljHf{qTJq7^4t*0UkT?E^<%JRD_G#F
z3U!R})BtLYdFFk!4ct-xTx9W!;4qFmb4%;=MV+8M@mZk$pas<`Oc`8Xb6dkwvr6i}
zS_zmMB>G(F>%UkFKt)BB*$=V6l~X5XG%}~IQyf}4C+b=3A5WQdz1jlqP-Hf}UDP`q
z${y-jxxKTl%vr%Soee8UczrIvU7r?X!*bzoFT3ch&(Yh@CU9+cmV)TCU=UmRxfI`5
zW*GI?!GlXkv||&7B*6b3_ZV2EXPEE4_~i~L)lD7nwSck?zTYaN;jH*MZjC59AaoBh
zsE9(L?YK8^&S&!a+9jW-tAoov>}9-R9@NqArnsHAo0$E+?kyt75`Fk94RY05to?fF
z4D<83LfopSAnccyGuOwxGZOIo`1X}RZa>BdNZF8+Mj6N0*0v$mr6uDgYxt8u{~Sf|
z$jr*sl2%=}ckGU5vt#Rz)`1PJXf@xab9;jRX9rgI>kP1~j^0R{?bV+nEh$7Ewr%%s
z)Lh>;7W%&GaFiq<T|UMr4BedJol%@}GGrZ^(2MTnBNy$aHG!E0L{{|Q;g&{Iw@z_b
ze0_dSwr{Tqc_IQ%$`Llx{%~pAKK8{iWFu_KXz44$%maEOX%4&79?hofrwkjbFUPp>
zcr_&HHhT#@qjy;=$Beu<fuK1GZH|WJl=c^J9Gl(K1DUp=)6JN}+L5cC+pl+Y+o}0%
zFZvUmwezDU)peaie>6SWdGhil$b$<8#;B>|i}t~DIN`s%(EU8SVwE0{HYo*4!n`CJ
zB#<%%g#t7&&s*zV7XPfqfL(4L8w!b-DF~|;2PeJ2E_muJQt)k&CcsLlG6+><o>H6`
z9zv75+A-`F9RSJBil*yD)-z%djW+I{1cV&1{av)T5Ycz;8Ne5@5e5z^3_du!#luSp
z?6<G$9{~!Y#XP-NWYLm1mdGp>Lj55pf^%Xoc$X$>*i3vK?xlY2*%&g6A7o-pp|TDP
zE{D#Rd=U>35t@Bx>NTB*M8L;`y<OIda{nTMj-_>Py;r_Uk;j6`UDzS1H*<sMqHp1J
zkzz%VAwaKKl!CHQ!jV%!x%|;WX?h}!(!=y?@Ote9YN~@!v#!Y3w(K_@Yt>~74>_jl
zc6P@ui<pPz{76dSvHWVsHv6&>@`L&V;#pS4Pji+CMo#8$nqJs7**`NqllFWfsk?h@
z<yG&a1-7D-D&`ieUmme%i(|BdIp{X}&VRzZ7fKVVCcuuWz_+GpSz*k|*%MNtQ@^~T
zJQ!jiy-s?)u@#b_3j+ZU_G-)~nuY&{y2yF_2B(HvZ=?mJr*T3oCuKk*(w{DgUeKG^
z|K$d!pKrat2J(QJXGxUruOs!RGcv-8p`pQNQFzYm%E)gHE(NNPoaIlZv5Uk3%OZ*`
z<q4d(S6JKyo7byzZb(RN`P8YAYV;$=>4mC=B*I3uuR`WiN_`GLV?9{pO>Lc<(S-;-
zuOU=!ZOAP<K5Xh4ps9FpF#hGN!+wq8GTFpO5pjI9J0r11pOh@8`ZAxV`i8Z>b#}tj
zpB{E(-8h5H6B#o^F@``xNQo}+6sangztwu=ZJ!9{&k=VZp<zU9g#dJ>QqD|c9TZOK
zL6s(B$@r;}LHcuh{Z|kqHi^VyC~(0qvL#G&Mq6r>#u$k~Mi+48EqSWRYKtM#xM>L>
z!pz_b;<s#4y3*8o3PjW#31xJoY-6bxT7uN1AjD^ZY5LeCpe_TBcd0?kP5e+?QbjOA
z6&oHYo*0kv#VVXf{%PQe_Dq!3-|KYeq1xp>k;q_#GMqvZl89#$nQ&BxGtN5fz6sKa
zOZUfV_21W_f7ha64SG+HrNp$ZmPg9*jOSHs*i=gF!2DA&u^@;2f#aEGxrPNSc4+}?
zR7^Q4Taz=i=9-JKdVy&Se^?%i>ZKS4&%m(c@ig)t9ZM(%T|f3p+~JXg5~lqsFPKCY
zloe)0v&+Bph!vPg`r6b3;Y?+P1uQ$MRhhD&Oj=9Vc#k^rlWc2)y(=(kFC0u=e4|LS
zg^dDDbk%b*gwx~PQa(oZ**gk))i3<Vs5LU-2rT7i!0}6fzybluqn4Mk8H1A1Yc<IC
z9DmAo-<;t?9Qho3XR!u-v^Jb?bWs^hB5aWTiBu`>$oN*ClsLa}V;+~&APcudt635n
z<}#ecg~%mYlZ<oke;g8x`RCEVRVlngylSh$73KK6gf-x3nAiXQ_6xkG!Qj&6q6Qu5
zr~|n<g4sfl$LKS1eT|H8ts2)wG@)wcl&BmCTnl*<DaC|HPS?n1iC-fZ5`>%y#E(gn
zzpTx#s_K`-WP2RYLC~Mhx$!Zj)ic?ph4j(m-65kh;NI)B^{}vj5^%~8v@$VLE46ga
zOnNWYFq-4S8uS=!q+(+T<L0?3T<Nu{7*SpVcijqW+3`4rsWWA=^gf0-3Z~CC`}DRL
zY|Rn#p6w__Le)?PZbYhw49P(ydHU_M6bc=mR@Bxjb6{(_`Qmh|9R?Otl$GN}@TZGl
z=+@@OZ9ALy1s@fE<A>t`bQg}_ZGyi!UaC}g17+Ix^-ukhdR3=Uair|L1S{G@aGg)A
zO@gDRWyYiGEI9I?YtDj{woh!3-&Z0l=3i2J{3XflyA%c=l|HL!GX&ivI_ylTt(6<b
zo9AWgPq5V!@H!#<_T{&wtZg@h&{?|t9vi;cxigM$f_D8sDE%FI&)gr+i;RJ1Q5t?>
z>^X;A;E$ZaZphoaNbNyMj1Ol&UWa~Qm;i6e&}24)@u&aFsXG_i5~lwkrosQV&+or;
zDjUmxaOyn{+~NPgsr>(1|G}x177pA0FF6$__&+(dSqmy!XUXGxwqwJ~Zu|1U1(N~O
zD9azj048)-QBYzYk(HFJqR<p5L3Jxx)l!93hKALqL^K7vB?VdrQbmw>5z<6K8JSXw
zG3pnYfm1&w!_X?e*GN;Z$41Xfw(k$e2|Y8LJ}lPROwUbkSN6|G+s)6choF_r<361;
zxZj|SR9w`oAf<H#Pmt1QE$OrP8FVk4J)8Z?1M9C^iv)t=x0cVcmN=Qti{uTfHaZ?(
zD?hDk!n~PFxopEES^1b6t6@n(YtBl|X(vh<HiPskm#Pl*(I8S|1m2hQ0T@exF|hk?
zDutRa<QIaGJA93rt6|@4Zaxn@#)-f@B*+_FfZ{!&5~Nt?);6R--SX8kTMlWOd}eLX
z@`w1oB2i97F-07=%$u$k?QnMDw*b<sT!iG+FTg{1c%cs<IN)~5Q~>cB>0FxscBgbV
zUbJz%6xB^|Dc!G6H@#26ZQrUz5hwVu`b<i_^CY?S>4I{KXC8sc?mXzpdg*FLb;)vv
z*wjo9N#QmBv|@+E%afq6{|4Jizlze|eKK`7ui$q6z3oyF*UQrPILOlX+H@<1FWLz$
zaCb1Qgjzi)vSGB;BWO8g5K?74XR9crS$D{559co^$f%d$<jTpZ>Ibf68(+=wi65z#
zS0B+u4<FGEAfY2v7n#DB3?QD)B_(9(`yA+Oc@ERL@P;}gB6`pnWWO9*Z9~HiGi`*V
zOeqnblsA)Fu+`r5I_i%}D5x$EHi`ybR>-*(S2YuXV_fuRV`slxRjBH<-JZs@Ot>Sd
z|G3lmOw=8Fz{vCK&daj*u8h5Ho08swe;Mr60m4o;Cp$xwhoXxXC_jz67u28Q7;Zw@
z#$7N;cxpC4<W<FAVH91Ya;sN^AgdjG`Icc@|HtOgs{tfHc7;q90+3O3?g1t3Bg6FT
z&SWWuk4{}4HdftzIFKa22~B(lvLdDolBOQf&KgJxNPb<@zn<UR6))s)-s0ey10YWV
z{b4U-)03I?qqcOWy^jF*-BPZCFfiS{&;t6?%raXs{h-Lo)zsp3`D&BwTt^r(g*I!L
zkC!xR-7h4aIB&5HT_ZJW@*9y1v3Xfa8z_rb18C<D`HXGstR&E@JG|-~An6ngF$gs7
zqd7Nw?GzzuC+%s%2@ua5;?68}yR&#$(@{FU7*UltKK`?~b&M`a=-#NG+pcbpGZp=p
zNeY?1-(-+$poJ2O_Rx^#Z^*4ExcSaznQ|&I3?U~o09X|hj_4gu7b!2jXG86*Mz`l4
zGnYokUfIkL$Tj>gH}ICq*4<rKIagn5A{NflTAc}pBZxgw^>fKWr?V{~UT&fBciDWD
z>j1J>4w%Rly(yz3jN)^*SFY?Hc8vpNNl2Zlbp*v3ee|JHW8E`*35NqG2!{TinVG@!
zf!;z5idD?<v{Vmwzl8xE;ZL?kAZ-T_0I}mHDoMiW_#+fJDS|8{7#%gIBcO56N<rJu
z1=fERTaod6{oLg)+Ar+p?YBqEu19;2Hx0eKxo>YnrO)eMn@R`kCV3d!TU~>RLCdzw
zlacdaRwV-fGB{$7_{aX?oiT4gcK<8wDzdsh_yR6Qu~yZTOS1ssZ`Afu^WG8kW-O`)
z*XTV_4X_+l&1`5;4@m$iv3z!LPEp;L5R=;@^u<lJ&Q3<xlatd-hrekh1rJ1M8zs8=
zS?#Q0kUf9rMWh+}$}tej&n25L1R8x>j6k4!NI|jXa9Jfm(j|UL^DhSx?u9q8By1js
zO!R&v0?g*oxNTgyo@b4UEL73<ohA_RyGB%f>?%!``b+iXO@7)LfNg)25I+ZII2jne
z9c-de9JqNJk@85kg6h6gSH;;<5mb*SC7Yg&X5Rent%4%cyR{gtSET2V-{Vs#xBZtW
z03azx#=LOSI{Na1Rstgka@PZ4wEi+V)V`D109~Vtq_~rB*J2c?4IW4tunTNx`flie
z$Sr}_DICf~Uo6=$pq}4&hcNqe_YNtUk#Y97X!iH%C>PG-;x-!|M{a&IX{V!-u;2YJ
zkt{YmARVZ_#q(u1Wvg$P0MsbmUQ7TL+H1Ep{`v<-B`d3H4fx~fZ0F<4PHst%yL~v$
zXejqO3;Nu!mR0lBJTIqJwQ04G+02<YFY}qSc|$l%HZ=??dcMUt>xg6YVZApHb6PXw
zN=X=gPD$5IUg4-)n>jU`todbB(b9{X+iCV3Ii23GxJpa!CH~pazGO+?e-7Yb1){%b
zW~e~#MwZ|U6{aLPpMY<nP%M^=#W*IRv{Z4OXQ>z>&t`rZ@4<OX1;lx&6$l%z3K&uW
zI)1I71-NGn7@ClKM=^#)mA)Pg@=#j<GgbmgTfy*i_R98e4j;Shj+gZ^B)s7zHq53<
z!-4P;KeH1QUWP1S9arUof|s6?XQ!BdQ;iL%FZrJTT2sL4v!B2sMR^RNA}es|U_H}n
z%USzk#A)f10p4{NfArMvS3H9DZ^4b7-{Lf>YSxEkWTp&qra>v<it`c{1tnua3|<-(
zl*~$_e%|o*m}f)6S=VoK4)4nd6sI954IRZhF?0@tG;MWzya;;Iv!g8YY4Y>gvHKkZ
ze9@I(2uYw0e<?Kl^{@1hX61AkxOX6D?EF^D#Z~5t!Fk2lms|!Pq~4gvD0w{dWoCW9
z7<t|oX}^}kQWr`v5dQY-n_vHyWF_xjh4Y4d^P8RiYxCoiE{fRmvwQ4vjBf!DH6C~Y
zn(+c04k?GZ^6*IQe15ZExz`$O@0^S{R`z20^%?dT`L<gXHfk0|8M8g$_*V5!U!)+I
zRnN~#>y6@B;_-b-lsJnFCUXFOL1NfOobuoZb^aXL>JBpxI!SpNG`Y|He0t~l_O^*&
z=&^{X^+MD-yb;#u>ag|zeelwBM_{o#oV>*T&3TcTKdHqlVAEyWk*??)EwY?uPHlKe
z0rNb)qw>^WVfg|!^&@WODBcfFkwu~v-hi4pNgb%6XXh&Z_KmY_C%jG92;_9bpdSAm
zq%bMDF+fR!29R1toi(@{d<&85T?8h<0*}x3^u>{znx17GIOrO>;6esCMN~5XA&Cio
zzDY05)8A+{32fEl5nj>e5iGJgXA@l&j2rAH;e#$m2<mz731V58N5s{<qV{~u!1B}|
zCB0e=al^OFczNO+*dUvxp|DrvybhzuakCXRtAnv<mjjkJ*c{aq5VWw`3%YZ*fd$|~
zI{^qC%sd^v=C7(#Zhfw%^fF`2A40=<-FyhP9By#0a-*FVJqTsYz$!M{w%okGM;X{o
zfvh+1GmEo$8zbp=*raJxm&<|oUi#Mab-GT<qtbd@tA#G&+w#0S1>&yQ1rV;XONAaH
zJYr9@W5O04Z=xkL<D|a%f?0lQooJdpjD(B+;Md?kn&*?pfTiz8pzzOY6m{iXkrs71
zV)R2<%E{>_S?s)4P4*G7C`W<nIQlMSf6d65o^hxP?t=^2#xs*?-lTjcD)`<Xk>h=x
zd_7**BsG7%n>d5?yC05QthbaI)OOj8f?jPf%f($~7I~!mwmH|G1YdC4Gp9Y^oyxdf
zo%6=c@U=-^EQdCms?V>R;Mbg{EuySlcRK_u2J%zCu@Zd&`xh_aig#{F*$~coa7`$B
z9_kQs`O9JC#$_Y;^_~=Pcz)`0A>^GU3KG-fHC5?zH=CA}u8nKFZ|gKQUu0;kbEO=<
zd|Jyznd;dhX{XNMFcU?%;*w^Lx`D_(IE*7RMIAW#FnW-iYO$%BJDc!VK@<b&KM_t5
z_?~$!ub>&m>ccR`q`W#7fbw~c02rV4n{ZUJtAF3AE$nl^!)x9Kc^ZSPE<ac<E?~^B
zE<8Lw_M+p7a_$301Y|jg(@G{PX`nUAce-=U->3zg780+$j02wuD0Lg&F0pmI6cAJr
z(8E#%c0CZUDYTq-&C}2`BiG&S0dS$aWD`(4e+mBnjhCZI17l&@UqJk;6=H)L$RK8W
z8I?|4)g41vOxKXY^x;AXfpb@01`BX#>cA?yuzuG7IGc1-M7<Jmx8uJm>BSXq=lZKw
zho3^j-V(OHg@8`c7G!9MG=(oxF-=UlPhD|W{?R~MJu{mH@n1na^<+_kjWjabcXv&v
z%(U`YjONJ%kEwbJcHZ_9)Py0#mO1v{g}ObUkB=FM_576zl<uv!Rg@d)UkVmOxEk}g
zelVug`aIXVVQik<h{FdLTowDE<p|JUxloy>d%BEDJ|Y1Z=J)PQn4f)VGr#$TbG_c~
zjl7;=VWp`qZUG)`1vDzd$QknW3vw0c9*Lj5J??Z<q8+HYN=W2@PWV(8l;Sp_rHbc%
zKbTW&1P%*3578M{b$+0s+`V-0!fbZ{DIFMLQN77smSz|e6%3JGg1>w>(*YFbnN<ZK
z30);UPZqtggaMAYSHlpPUpiL}qq3P#H7JA-2>zpgf_t?I!qnI&1f!F)GI!3xS&4f*
zq7Sw~PrBZYg)J<*?qnFh4wLA5on5%sblz;>6Qe4MQXkCLKkw|UIEQchdvMa{L@|``
z7soy^rCm0ADI^RGkSrKK+%lO?ONrobZG|EM|7t}W@}x%K#>X~J2tY1VVU%w0oIT`5
zb|BREv|H&}@5u%Qlq=_;nP0tmF`sa@t@!AP7geRI1sU)X%?C*33m6MDVmD|vVQxu7
zlbOYlRiy76<#8u)o0)1^S2mpUx6U%jnPYW&<BivD30se2u~eIHeOf9JWhidcE@v*f
z$q2h5qX6CcCgWTuq%VHq%HB9V&z)r0_BFu@I0X7TqQB+s7IY0k4JL-WX@A%bc(W;K
zzU)ewYFTJvn`ogKv_h{*uodT(*bK7Z%M_R!Zs)^bLPI}Nb62kQyv8o@Z`+$+A;?|#
zhS${RAu#db&C{Q6dfDrl#j*a(JCd{N?!HTv4fyjdy4X7CbDb(kIUxYe0dbC2dqkYG
z7a3>OiL$d?BF-Cc;WD2C0Nr$lh-#4W`DrSo{5kCa%@T+=_m(`%uQGAsJrx?|<~wT{
z<P;#r^%Y5VeE%CRNK=yh0Rj)V5Zj-#K`f}*f%8T<*7eSkxMjiHr&Un}I(P)o(ByRQ
zZ5g<={r&Pt{}rti<u1dq!>bKH_v~0!x>pB@Tc#iJH1C<RZ!zxf(IO7xggsr?jOt-k
z%ReRnLSk2S%al<+8_#fU)UDfXPQ|3sFkS0~p}{k+Z}FufnBRi0(>;XLXqpf;bsG2v
z^1Ox3#kOKNGDCP95b>1p#DuCqm}3ae)2&EF>Hknreh<ZdQfKSCivUJ5{GeVlRpGX-
zG3Gyb?Qx-dn01PZPH6mx4Rg{dsTGFHKXAXTZN=h1gNV{5%$4AJ{?J<T?xHz~L#$2<
zzYzPPprNU<*&Fi>ckq9)^G-pQwTZU&T4`3=wv9^Lc4npRN~_YgQEA(@ZQHE0?fkn>
z_c^<x<3z`fKVnCmi|=k;tc!WE-Wksr?-L`24i+iN%NX5Y!+%~SGBTcgB_;0`lkLtW
z7Sp%b{_}JkqLkq2{r&`NEv$rNR;`+Qu%DbC!fsl0j1wo)?oVt1l3frmHkPtR=m;P&
zzhwKj*XWeIgF=CFp8Af(yEMXx?}QW{si-g&5r>WtaDba3GvS+J!jyUf{T##x|II&I
zXvN^*!sNpfcQ!oN7ed2L9lmY|Z3My94-*PPkVw8(%T74SY-ttE=`<hrst~OonAu$=
z)&BJTq{l5JdV+MpVKN?xv5UG251fX_LlsJFq*Nh=OP{RC58tMUBe&3&{Ro6Y3h*pm
zhwsh)c5pbD!<3jJ!>6st3Rb@cuxdf<S_JH#P<vz!^pHH;fgcn`yL)4v`~>Ub15<F%
znVn&%7_(y$mc(N+5KwZJ`ytd<v=MQXlBOr-R#fm{RnE$}D(Dhk>bKJSv;caE1k-_$
zW55sPmx^?o#jh^h0u1#H+%dg#v(?_Qi-QQ_>Cqt!@8s#X91dTRU#0aZXP0=$HMMo1
z4@PJ}d9JCe>IZ=FJ^c}sFXuaEo>xgB(Dr`=^dZ5sEQ<dwt+i#IcYNPiLb+UFr6Kg{
z97Eq#o-}(xCilu}WG-MY8%p^>fp~Ag>qfRnWT&^dM3-U0QFGe@2GD;gz)0y#ohG%<
zu?8~0V6k5R%uI-w?Tcq4s(@Z1)&faRfqrKjZ3$>#5#p1fvqM4cc*^WvZ|$;9lgClY
zL;i_>s#@^VnMS>&AiDbuBot=rOfVm9rsor8-VV4$2+V6;x%SS&(H9LW!Fu=18=KS|
z2Uuq}BaSfwSoLohe%JYKz|M03P+AGmYE!vKI1->C*NAd{8Vrm;)B!?*jwtEj_SolB
z#(z*2za*^fjmf#Vyl{ueee<U_4PznX5uW_z1!jfOCw{OovSr&A9kE1U!nrL@8}Rrs
z0z|BV#qC-4a0KXMvjA+8uemWoN!eML${LJC4>r_WQf;(;{JG0swXQ@GN(rqB0+oX*
zhHqaH<iI%Y3rv^&6L_Fv{uW4$HU;8LpEFf7mdee+IN_9w_=|SeXAF%s4dw!8K4gav
zu+wP|BytIB;1>Rqm2)2e`9avm8D^l@u|SudKOI<mcy>r(og9=-j!VtRkz2RQv`g;T
zz={4+Ai+)sm<!-lkFBT7oeZ?qGzJQ5IOMV*Cf349sj5w_4T+t+-SWEp2w+9ZZoGs<
zvqlowc@Qfic8jGZAtN?sJ!1j9@pL=N#gh(+BrQdh3CGQv9KrOlT^9bXx;SX4vi3!h
zYWrarC(D^;6jT|Zsk+Xn|H~KHQ`b5H?qq{U=C^4!<~utGQr?l7Y{k#$4`~2i$gTz0
z^F2M!-<2jnJ+q|-_R!P@VnS*>y>4C-4BLU42r<jEo;swOf6%3GJGOEJUB}DfB1Hlj
zsTO_Xu^o)GV1u}8Rw`y^z(nl)0)d3=9oCWxyC8|sGOb0ED^m3Feo2!Z>rNONlOd|s
z*1&6@gwJDLCbwP=)!)ig5G(9O6n$3^iVtc41%pb=g#AYEwgV8ML?z><XKC){kqN!l
z9#R>a@Dg0u47*b1-o)NN=2=C3)<rhc6Wt9A6JDd7mD2aB97RVsQT2!YB~n08;DxlV
zq>9#y4)#Wyo25)BPclD}NTWwT>1PR^%Bg?2!)#Md?vL>a%*;4NPUU0>#M}%j>bP|8
zt^=qiCjsO5g{e!H6$@%Q?!;)yKmK!)LKwr+W{-tLTx!qMK}q=jJT<-}4gkp~r43Ji
zO>xEWZ}eGM4*k;a3ZGgjOZ>5<7Hq0Z)oh0TClj2G<3-mZHb{fC>{i<odoWf^K_?hh
z{h${DD=wC1?lRZ=HqPjvPDraPOA;axm3bX?!N!u$QuLl0r9ZwxY=v8Y@_cL)c?vl)
z<d1MxAAr=Q5GM-ppsHGKOU)nLNl_)IuXY-Z!$=Lr*I50?&|mXn*zhdLJU~@(0M5}v
ztvxzXSMY1W&X|rbNuiBHsM=V(xciBYpM~cP``29~1;&&C2#xPz;LwK1T$MTA8G}Fx
z2}XQ}2}m@(O?1B{PlT%L1nQNloGp_mRH}XhuwcMSD`=XWGK7Y}I<)$jS*1H!%u06g
z&1ec>ur9IK4=(~sD-lJf{9r0E#vvnuf4lUg!>2uEuGU{CY2ta9^Y0xaY^zW98y?5|
z<UMo;BnNK<*3fLiz-rVvD35p<6u!E;jV?D()3MCE_-8C1C54Mw#rIik1M|oIBm5Px
zxP8+bHr#zj_BGNMf#GwJ!zT{k)iKm|wx~D!=_~>f3@%ksMV!m-H7>-F#Jvl6d2~ej
zeWddV+`_2GwdeImLBeQZX-jLqU=iAItKZ)9g5d2Tnf$OcPTenCJza=|sboznVRba0
zdUEt7iULjZ2K*H6BBLIyQHG$)wT;Bg$l54H-S;);u3rH_dc$2Jr^e#ta}p8nZ-E=j
zsH1($78g;jO53f~-Es<{%2i}40*?`@$Va=*>d?*T3JsjquCet-31rNO=#{ri5$b<~
zfG@5XaO>A1bcx1vrY2U6qzOHfuRB7kdbs5JiIaZDi6FE3?;f7)6$p)CGV3vOW98kU
z7n5q?U2*}E^Q2`ZS~u5MdxJ;oMgEiZn>Oh!HWHllCBzDJpI8!2BefhSJVDs7;aoq*
z!4vb4|DZ)Ie>)-_qaWJy9ZJ#(J;qn1Rx__(tXK`9<rym3$1opEYMu+;&SaIo*oFd3
z#T7&J^n4=AT$tu~f7kwF&Cac?+6WXX77klxBP6uqAiR$soF3#NP+UlMIu{XAb}Ts|
za_j4wj=)QzKg8Jpfyj&BIlr25Pf6tk!GoRpBrvg#36jTo6P^C?eZEb;<6f*Un;AaK
z0gF4V*k8dLx%D0gbKnK{N9vCk!Ep_txu`foLr@`@Xj^~Mq=<w*VG#>Dr#)=K=v8#9
zsQTk6|MdIA_9wx+8Rj<*`KlD&3PPxsHQ1jYx!epKyV-d)@)?H?FW=wngI+$V;C9Ff
zJ-KDBz5Hz1W+4FfI5_@BxWiM}v{1jrOGNdJZ}g2Rb9#Z>_ecfTvPWXrckCC`M@K6l
zU|dksFFd|A6&CEy5X4Zz#m?LJ3{*ca5XY<Ec`83vq&wW-oxIs@(Y=|C^6nyLhA61B
zzD#`WV8!*jwQ@PY0Gr<&Jd%;OFu@=LOK<8Ub0cuO97N{C8Avpn;QE4qtS9Mo*L0X_
zXY_;MxnYkP%Ou_uK8L7B>!y$n(0ht!-!yN!7<!Llx>8rO;RId}=k+uxE-7d~70r*A
z6#9sTUXHvKwqpfoYLT`yf$hS59?`JY@HQr55FqLA4h)6voe*5sILV!C*_KFFYcFk%
zEa(fd8H6L#OpHaXqniN@wFr$L>gJQ;U1H@`i?*U}>YJ99ypLwKo@g2g=lmhYSDN{m
zJUrjOS<A&-ybF~LnkikVYwVMwGXm%ti?9GgFyVxwFWuvgAmMM3_^QO0+mJ)xaDWOO
ziVFCSuCU8<a$1g38|mjp+qs_K)k4?FB|hV+AAmWy5|%siQ*oW?#d)Q!*d__QuIz={
z;p%zV5L-c>H^xvS1eCM|3w}2G9Bq>RAy5|Yi`Ss4!l?)%*`7OXTE<Fi3dSp0Uuicj
z-yMD-rhalCet6xQ1NC+@K+pQ;Sq7okIrJQgyv=gvXiWL#hI87x?Ao!^8id%=Bvl;Q
zu6yLWe0<dFoO4QH`T*<aBn+Yhg4D`eY1bt_)F%{tMzzF9Gw;1Cgs-R6udMrbVBRWk
z`NPDeRf+Sv6yCHRgyMJKW(3r3h|#UfKbuDtRvC-PHEmd^oNtu48={?N{9;}>1Vw(Z
z-*EVB!7-eQ_|ra<fHh!nAee3Tc8J=x0a@-YC}fpP@t>NJ>Fr3)QfX{=`4U*HL~@{e
zGWj!ZXdnc6r>DuI)t3Q9#Zp4uM*d%?Kn*Shh(MOG6TG%U?+YV*@XnG*OG&2nNyS<p
zi;iF7LG)iA-2hNP3&nv!U)Qb3zh4}(6Pt@Y;Q#=)IREM55aYit4($vaolNMAZC!2t
z>9{>XLOuUaIc|_)|J!ksjl>m4^Ilx!pXaS-sjolN;Z{S1q!AJXVi}N#{)R#l5(JUM
z4AE8)vGEhR4bz$$1rLK2(m0svMHh#{B_^fEBqHOWoOS<swRYof=5yF>=H6Bwex>SK
zJ-nrJ^;>0rbAI!o%l*n@+k-BWNhNx_>y20zSyU<^;)^Ec67faJ<f}DFrG9BJTes~#
zfgsE4Q|4}JbN$sv&(r(Nih=L$jr;5QIzjTOi{eA#`tE%nipjoUq%2PSTb0@J{>}LI
z2C3^Kf?sp|L<e71NwfWG&jfC6ZAxw!;X{<ISNrF!m2KDcq~p=S;}loplvk2mw&v$l
z_t!%+0qB#vrFH^&=?sJ|=B{C{F6!9!BG^aR@>U37p9%1x_*gHP@u6r!zK7u^M^&JB
zny@c^A89@N(Vm@fRnSngl1B+wvWJyc-YD15k0ED$DdA9uB<dhDCu1-j%kIQ?{ZMq4
z5;MF{R7yM8wx<v1)acA(69xH17DKW%<bEt=`9@j6HnNJZpwTIwG()kSbS*DsSqCe?
zL?$V--U&TuFGhj$Efb2x{|?X_<(@w(YP2vsoy9AE2U{#zdan=237`Q}01YY(RtxPH
z*5rBN$$Wh+KY#?naW7!CvbH?{>?bMH@2T+bEppLg-?S6<KIx$`dyos}sqC*mYW6zc
zJHMYaN_Ue_!+t~Xa{@EL@-<Hgfu;16DqS`2`9pEh2tgT?z8`6H5O-aUn!zEvJIATX
z%*cZ`@5G$L+FRQ$g`@W#MBj1i_&SSoH7nS^`ITJT&OoSPL~M?TBApVc-J&Zsu(o@0
zAYzb)?Ty~<XmtPqdw>~oDBlf6;jn^kT(pYC<#WUcAm3(1F=HSXlendZ#~iY;zt}zg
zg<quuD*}K*nA{TlEV46T&h*EJ)<v-RJb#LlLfZVHldD;INYB7P<I5Q0-gCf5xC9C6
ziUN3^?O;3J`Raj0@Z9zv>5TR00TI~YEj+J>5f9UnVo;(zt(J>7hTgTZwYDCi9Y;0m
z3xdVS0>o;C?7k;rIK_DjE|6lhI~&jfka!_>+?O)t;;Pp`mPid&c3Jy~l@4-GoZ2w1
z_#?O8#_Ef`A9~-e%DcVqk=T058ygz~cym@k0lA1A42A$)kPsf<oy>asvp5jIl^BL^
zP*iQr-k@1hcoUI@?a%I?iLdudr>6w&o%lBgyXT+^ZoaMstP<*}B;88F!5m91iNDSZ
zooI>ZFc^7d)DP$Hv|)*X1amS!e1D{c%iDNAPQ7-%MaWYS{UL2I9thJbO~42oz}Zh3
z_y2fFM8^!%KB?@3u6tLEo~qBEAPubUd{KCM<8422@AQ_yPRsCZ8-d`rG)P8k=Rl!H
z;3RN-VnO6<wy<geSXf17o7kPx9U_>`n{%wBkV}T}Iz5~&eh}46Fu>6aT2caXT9YkR
z&_h8X#51MrRQ$mZsr_J2&o3)>)n1nvw(`c48TiTIW#uRxc+!D}?81>$9R<LJ+O-{x
zwcj|5G3a$8GM{`diziN92lGc$8LRb2xGCV^0LZGR9^h|1qcdSFe504%Y4ZZSBOZb~
ztDje^X0W^lVDlCr2<KJxQD@851aaUp#5L+|M8=Jl(k0aJwQ+rjdS))BE>l}(2&sD+
z!^X^#f<2I)-upxFZ7vsUy?|T)ei#T*;n!AObD#zZ99XG|Yo()r0-KEL#6%IjM<hH=
zX21ax=6(B4Pr%$n5{>$|U4awe`3&qKVz93grdfqW8hQm}|LUMNEX<rD)vl;Htv=86
z6{9^+pCx+#qVuqLn_mdB1tAawnc3GBK7n*DFTGcmMnH2~WgtFq&0l`ElIj)6=RmZ+
zxw?uwY=3m}rv;TznzcZGWrx(CrnpI-5;9>TAia{<A$$r@Q>C6-8Lq5_<~Y-769S!r
zn@>Q=oFgH)zKkX^R=2@c7}vot5>x`FFqFAoMLYRIRA`96!=WauWa(=+`xNxhsWU5+
zrA4CQ)P%`<E3g~nU(f-39I&Am8V2-m4@KZdzU^knlBJb872=!IJub-c<QAa^j%FL7
z1wv3Bd?XKBjly6>`(uMAQ8#0&$;n=Nm~(yINw|cK8I{I16bDa`E#FaHx(NDB%@R?X
zr0i=|GR$~djb4%ppU^q3hs)&F7ZNFtIVr|I_L+1?<A#gpKbo_yajk(4zV+GXYBN<<
zdP*f(!pn-H(fu;#CZg&b9<gjUhA;uH0W<|n%z5tNHf@S|alg67fFY_L^b1BthCEwu
zXyrbv)0mG6+2x8EsEE6+=bUcvh&sxaEu}qcl<t!R38SrgZ^L$^CQcNlybbs2k5F;&
zA@?Yae<3pQ#gu#zO3md#33@+#D>cA5H7RNCWuJ-eMX8E04AMmMt#}yXVN0W1?_yH;
zoCc3kIh<Qkd+T|=0^Mny${aMk7IWl#rw>17_V^J>!A}L-%4Q-srV!_Pd^lG2{C3eL
z;6aWgw0uXcn-`Gla$45e=zOOEX!syR++>XPaVaPe4skp0={d>%!kaU5y`d7DSGq9U
zwhJGA@*?=s^92H$V&e(LnP4ye9U%7J^3>lU0e~mS{{#@o{{|5MWQXriBTxTh>@fOI
z??`<-23H*Kv#jlv>1w#^;(?3ZiiB7IU1EUQANBwdJo*4kf-gau-fl-;00|iv5#t*n
z2jQP!+#cjGFc8r|kpaob<%oXw?e@QM2Maeh%SXwc`r_t1Z@ZO!USs1&TG{LATi5oL
z`eY)Ps3)Z*JsWI#06JIyeBB@?B&Hc$hM?Y$KJ~3k&gy5wsPe+i54<nQ=DQjm<?dx#
zv@eoEV^*nx#CTtoI0w0mG3^yQ4pXMQIJBY|5DkbPAr8LY%Yg4)iyod|Rk!kHt#&C^
zS~Wk@B~44ST6Q%YUHQCz{Ymqf+4LL4b^6w3e&JcuthBO0RnHdymqY+Y4dsbOUEay5
z{W5uaVf%G@Xl9F4VqZ4{=Nrm!|B8$I@m5(~(fyFG=P>?wjF17_AWq*DjTt?RtERfs
zDzDlbDB@TYW>_n97Ikgh|Kq)Xe=Cn?Rd5rwb}q4`g^vRy@@d=S=7`^m!}B48|LvkN
zi6&Ig7;<_$QvR`PsO36v*>`_-M-K1H&2oP_hR$<Nug^kdh!QhznSW^k=@mdWJiHeP
zKM02Z^X+*a64bM0yyqM_PIG8-(Ij|x=sP~&JBD<T(F^AwD)u-!DNEddgaoWMR7Xvj
z-4SfLM%M>#OCh$kbZ_BN9|*`vKb4erw>PL`6iAon87ExZ8=?{@kC@w9?uoU^ne%X6
zU>1!8pad4kI7NmTB_pdSZo{czzEYys8C|$|bixUQB?*ipJtPA$1Wxh5B&Ad8sI?Rf
z$B03R@y@SV*%EU-lfVS|-}8u1qh;9>4WxVdB~#}L4&Dp41+0r?3v=+C<|2lZ4|N5`
zxAA8_48&t+l9cw&aQ-4q67Qz$tE@IWkuEpy_5gd^e`?*w1n?vgD#SLSn@pO~&Ik2P
zF$w@$jIisqL-!)T3A$Ge&N4{`H_*oW5eKF?Qz~iq3eJipiZx6T`R^i$l!l+)xf&#^
z7wjnFT81GleXMx*8I1sDUX5NWQ@|%7e)Z9_vc0)`J3{QqiKH^+cNs-4%s(YEp(1B1
za9x}7h2S)Ido(K1|1KTw3B-ZFo<=guw$GiT)K6eBU__~3iJYMBxjkj_1uK7<)?j90
z>N8Sv+R8fs7o2pqZbAP(dbEVm{VG&g>!dCQItG5ga{9Sorfe`WmyjoJF`vdPINDd4
zmCi~Y3BhQ=3?4VuKiRH;d_nDR#v*;YhrmVgIleIIV~Q`3SEpp3aNs0&W6fE(;zpZ9
zm_#%z)aMJ4*U9uv$jKel>5YQp^69~_?CSla*EOr6I<8BO)DfV;$B7v*zOuNsJ3)ow
zOWYZoDi=u<LIO!_^{VS37=xsAESAW${j#n%Y!$QA@@U8vC=u^J1{lahb)G42%%J|!
z#{!rt2|^8?>nO!-0SkN#*t_>9Ha>^M%)q@u4Ii{qdYh6KFp&`>A2lCngKjn~VMFHG
zPq~hxrvb*X3tBk3aS80iG-F4#jZM?2s70`Sfca7?6IBxW%8mDxpPUO|mvsQ+<t&+7
zb9r9i<%OIK<;KOTUC-zLJZ_v<oN&rv+5I5*n`6sR!wUxH;>BSA(uJ<i<0ypxj9KB9
zrJ_=y_#>+}&tJ|7J(e}5O%<KShl<Y%rv4J3#u6ne`EA659gjp+)M;tcpO*z~2oh*Q
zF53%bSm(812^&FxHf}P%pX81T`s~gbp3i_KB?j#CJ$*i2NYqFlbKqM2fs;`mG?vbK
z=lgrN#JT0HZ3@XKx|Bi{-xXc`Cnqo`5|SiuJ4BvNP6!PJV6n!QaL~aBPdqGyeZ<8!
z4+w#LTYr!$#em$>(8&me5<CUc`DJamNUvd;TEh#~IxU%r4}wKbC6acSs(_}XS_G#)
zWuglB$?1BM;Kmb@0&)#{sMsU@5?x4CUd;q3lb%Em{UtdHxn<|J31VtqoQ&F+&yG^U
z@4}CHyts*ka+=?A=i00Q?(@4zX1V2dO`5_1z#dHc5qMfNannm{t(<wjsK>|0CS9Ko
ziWZ-*i&2fI%Mbj${B18EWTE)TQOPI9^YnP_3i=_<LvrR?+Z25>SM~X2YVQjuF~Hi#
zM`x!Fh~LFU<_TV0{L6K%gl%>oBOxfdVj080pnq)`*ea`KS#&YsA}Xq>3t_>Refi?4
z_5rFvlfDF1R62XEczddt<EYzGkxE%+g-XVoN?Gj~MZO#0H=Vb?jhRO=j-@68h}}{%
zlP_Y>Egba&=iNqqrSbQq%BgeUXokHqin5%HIkR`9zLjIXY;i&amcFvZ0;$9}y~5$z
zAcOZic6g(7icX7v>dSZu+o3{ss(9g2PE0(p35U*)msUYxoiSOqC`f*u75t1hVo6|P
zL@Jnju}b+0sylt#rm(g5trgsG+-lw#1KI9x$utNimKaMTVB;Zi+TD1HmPXMT_}bUB
z63JniGjlfEjd;29iewk`6zH>?Q7jGlIlNYlZIy0$H_z?KxWwde;&=;>m4*LKiVHU#
zSSBQg4OIhyeTCy1=X}*@QQK~u)8Y_u<F5s?>Yd|;6_2Zrm``Tt_j<qeiZ$gmH5iwd
zyYE&Ei{(?y7URW+G|kYd1OD{eamH<-FAXO-QII$>pkhrsl{OsO+u>PY$X9dnPgClP
zUrDlG(;*PodO!$3pLP!Z+AqzRe`k-lvs@G&C;;F))PG_R?0;bo2NOp}6JtYXCnwwg
z-Crcbncw|)804>AoWFK){@TU)YZvFQU7WvmasJxH`D+*FuU(wKc5(in+{FPl{G<3f
zPvS3MQ@|YZVH#~rN;zeVRq*%EZBYfwy~lC7uz@_9%6vm>Ykveq?d9ffOb<MTZ#x*n
zt1_)0eD`C|qJI(^_JAps#^>nY?dgw6e)<(n9JrIAB;|{o14apy0$>3|6+gRl0lYg@
zcChCJ_ys&)NITBm+h5GsQ6-C(&t22T%&j0pbpR+Le6Py~e8l+^6)-_U^oSsh>gB#W
z9^iZYLt>_{VVWsBCLDcmKhdNqiq5j+JnHt-k4m-fe#ZCMqnF}gcS~m2{Ib(^-Rh8|
zUjR}`|00V5i}16ygI`m-c5Y<*RNy&huO`jwgH1nihkF^}SY=5hk@F~ppac=Y8v6is
zv~M;)(4)ja`x(s}HA~9EtIh`OBg@JL>^*7rf5b&zOj@(Iv&*6^JJ-^}4%^rKOqVO}
zcWF22-qw@klq$-B?zrK(TKD9`NS_o7G@$%FUWgepJS<gsi*$^d3Icx&65!tXS+!}?
zU7=PkpGVoYe&LcWUp%kAqX~7Be@yKDtph-R^>j>O2f6_q{+bO$aECbVK^lRn-n;!y
z3zYIDR@t54dIS4}0|-YMSh>M*CH;HGkz!CV$@m-kCd2)wjDz@J8OOoInCTyjpDQ2~
zAODwR^Y>?%e=L47Pj><UAU1ywF@KLP3jZg%WH`qPN}w8G24^ddhq95N$Avy4ER7~9
zGPpabZ?c)JtI?rRnVNlVW@c>SnGRJJ2#XkGqMpuGRs<~5qh)fTB8iBZiU!RzLV=A-
zkGiDjY>K|gAzVFqUwz#Q>m-~0FpcuHo@(6R&B4UUMtrbc6$gb}mF_I!R+Fb?2g~{K
zdo+6W*%zb+cZPQS{jKoNVE-yf^;G9CpYx%~{4?$k)%|(8^`JB^!uZ7KZ{Y;y-8-7}
zlt?|cF$2OmG9Zw1Xc;B?9@d^9s3_OPyj>vADEQkD@8G-_{&i3#?qbsZx6tOYT<++W
z!2&Or&VZcWu#f;^(<9|zDjKe<nc*Rdz-CSUAP`E~>IaK<g<Bf7%%rS$5T}pewU?iC
z_K^5`A&1lJn&Ud=9S||UJGOMuJtGoNe9jBFxOpDI4W=z?TfA{kZF>(rYoE<>H8wgB
z8ufO6OeJCH_$q9*8RMKp(yX<&w~Gikl~@)Z*U~D7EAUy#w$Gu1a&}g#nio-7lVsZC
z8Ayw-fu~xNSji=SRU%!FZX7etz>RUA+{1&)<~WfyZV3wb8j_jV>Pf~FM1BHy7_WIu
zo?_g&y5U^)3li^G&BQ{ac(TXE<$v>(|Hg?-zRT>h)BC|+of(>R|DpWS%V7tVIG8#y
zl8PLWDnqHcSI;p3jY8@hB%6f_0YN@gg_EEG4vV{&LEiEQ?Nt1sxGir>nV^KfX|eo~
zQ&=xeizIlUs_mP)He}gcbJas(D;p=yX2~^KEQgGNk%EBX9--?`TABp4(<~YKH(lK-
zcZzOl6vaQW*9gi38(b(xV55Kg1CssyONE(aq>st7lZ)N|6=DhZH9Lqki$-+!$Cl_I
zwZ!J(Z@HCx7Zx`r^P=zHkH%^t$?_%$0I&k`pN<CBza9-oCj$qkf3+7LpkW^WJL&)b
z&kY20$Ui>BiR$aN+TwVhlc}7J^d2|v7aaC`u>*?8$Yd6<Kgp>5P~A!dl87G=%*nuz
z!9ft9ZU}O2)fCDJVW^WaUIl)Ip+chtg=k~XEgcZIw>~4UhZzmuT)KC*AJv%!+aBUl
zP&Ej0q@7=KIv&1xZ(q5mbbV6u?#ApAAep7%5+|9r&K7pkRYYZNtxlJivO~*FI`p7J
z2&K`7Sg*w;#`Z<Yu*^N;e*6OLh3)hKSS+j0Zc+=+{{$r+q+6ZMDtA)iOT9s3mU<TN
z$I_63cRl6kJ}_M2-pIwo+;*#!v08=Qv%T>kpR=Gby0k|}yIVi6Ie8j7RNZWvS~;tj
z(d{h+5K=J};d7$|gOJSAs|m;~l&G!OIhjB0*nW!{|NbFRsZ_?F(C35VyKvypR-cH+
z?PKy1#Vy?&<G^!u3zpL|x?yM!n*nPrcPSi)noZ?xnrMn|G6i*kx#{>PC|}E`!zl67
zFGA#05{$N`AiX|QeM&pSy}q7L>t-`0W#0&Vh0f9LSRfb<ZOq>n$VQrSxev3E?@>@6
zn#Y<m*VFZ2G)?fn+r@h;pIDSlOoX4X>A#&~({=mgn7k#ICyLdAFQHn)gL{g$lUK7v
zRiR!`Baxo3jp(PebKpzps1396?I8_i@oBozTl$`My_w>jgzQAvm4}#+jBeuxzsupq
zs@_nh$J~=Nz<&{9#oq&+5b`K!yOC@!xlDyRna-R)3bEmd>Y{Qd+J9Xr-X>-*O6zta
z=sc?DYpidj#3y*~o(ZHXN0$Ph%k^gO45zYC6Y;lQi@F3od^;}gI@TXBT6R<{T>QdK
z?vN5)ByudMQb`)CbqjZwVD=>&qPRpaT^QMmp^cqYgnm8Tuh;r*7*DgLR~XVb(*wJ-
z7WRj=y}gaQE{e*GHD650$_iYp;Tqhx%?;(y=hGcZyp{H(p<qsbm37QJZP|TpA+8!*
zf-wEaxvrXN%(*P+%fZy6&xg_Xr!d%k3Pj&+oN}vnisGWKepy^b(8~ipHvKU~II5CJ
zrNX9w0)8lB+;ypjpT@CGDq+|^MX&U<3!gsOWihH)OXkPTts~^Mnxhr-gkmSda5%(^
zS)CnU*Q3N-zrWB|5&GIpP2k(Ivb(f`Fw;;#va4Y~0J?q-bMSh(G4MLNVI)yIpAMEN
zR>?Pp!xEs#PClBSzVbLPqnn$$`yE~llJ@xIXbPeF3JlS5P$}!;YU<fuq&*w&KEL;I
zh1oEaZDr|s&YC9d2Ke{MfKU3;dt$G$%Rvr_?-<Fd+csIa*rcXN)lAp!6s_4f5tqHf
zc<@|@lv|rxZiw5D=|lM|*LG;6;yT6Fu|&`?R6X2t@7)gk5k^=_lXsN+<&B*OSk|6H
z_w}(SC_q4!ouYa@Y9vpchb(tSu7m62KxKaM79dKDBa?l|<%;?ynZ8)*A|r{bh*|S)
zE!+c9T|_IJbxJWS$n?v|#Rs=AKLg9>NL5z2Xt%QcWad*xMVQ?se**t`BhKLV4;1Zw
z6ZLDA(1O((3;N7bE<-E@)?#@Egd*4FceKs4ALQbq?7XtHC)(JU&>$by+*6!{E&Z;R
z4;o|xF>nYf`X*jI`QH3Pz{p1%@j&V95h;t;*gVQ1!O(ZSe(YBI3+MgTLP#&Jr(I$;
zwaXd1LdxF&pHSuNp2AGx@c1^mfI)IAYOc+Rd)k*>0N#r7;85b>6^o{o4I#UdRp-$g
zD?2geJ=<nivAr!Gr164AjD>-H64#`M3IiD>(?r{XNCTZVIlDD22kNlBjveQSlPjlf
zWl>kUcfj84&#C!BX}DjWiP7f-zW1?CHkp_76Gqb6mi_A%$5wVoFf&oBs%@Sx=t0Px
zzRb5XEi&$hJIC;1<iY|cd5c`=5fRiVf*L=YmVaN!4pqRl6f5+jJ-A1(-qgmuLwTJj
zMCrbtvbWvaOFg06Dv!ooc%!WP`zgc{>LykOe?$4D-mp_7y{Bx#uAf@Twn0yo8Jr-7
zaF{~HCmNd~EA=N5G|Uo_ZgxOi{iJUo{NZUt0)B!wp(ec(F=s+EVsr#u4PIbT{(_mF
zg}Q`xeER#6k+Fk<W8&!+y1o-0|K($XQ#)t0g^5=ATv211L`e0Vhtoqoy-vF(xgV5E
z9lm1eeNBwTJQBQu-m3PJDZK&{AIjS%BDK;)SwAB$wEET`ZEcLKD_JQ$*?~=SZmd)|
zXj6&%N@_7W3py)B?B-c^?Y)iKuEPzDDaZ19?b{3iLkwQ9X$O#N1mOs?lDw)TIf+pU
zgAQxR!s~_roTkckeZ`<@0T8U**l=7vcv27<OcP|OeE5a;L@uV>1ecoX5HBP~63>_m
zM=t4b4h8lL%n@#8(rBkg&?i=m3OZcWi<$}fUxl~wZIW#vk!0kmGABZI7QZPfpk?mX
z(TSd!EEwh?&G<#a9!lmlh(_B0)Z`?>8=5+_`DKbzGzJwto;x1(ehhM{N_4E>P^%o<
zxiq}EFUk1TH=AT}_F-^Lf&nKX7G)RO=7)YMYvXp(Wg~YpDmuT1eUq5#?Q2h5gSn<V
zecd!_vy;M~xG_>-f}!beqt)=B<i%!pq$|7J{r2Q8<vjr7k}Fs<=wY6K!G{^TL)85z
z8Qb4H?M{l9n5c)|5_znEGilVscZ4yMr-Cq?;4hIPyf<8>Qci{HcUrjxy?t~XHG7Ot
z83OoBHE7k2(i(AFoZ#3k&o@da)MeSS8$!}%W&t?`qU9&Ga<r#n%6+R3@6SlY+gS~b
z+kw@edESPip{{wR<7SGGr12YMQno^<)bB@nd`~#t%*J8RmPmcK4oSEZ$;{Ut!or_n
zj5}sg_eCxmAb;vSSut4>wr;1d>vjKJRwp#6j}ueIiKs>Kq(#W(5p<%j+*%gtC&bsR
z-2m|u1ptB}p%_`#OJ`e8!66;4jd;8KM~gBT0f7`R?foQ+K`zH1W$jxZ4(NUY{tN!t
zO-<>(8$5#=k?$^y`<y8its+Sx`3`{dmMY2S7%8$R@hqn)n!@aNo0bzfoXjf6E_O`s
zeuU2Dw#)-a$;8Ogf|9Eu6@EE@q74)y$_)82fR<Db4&+8{=O)2UTDnx;=zTg_*~C$=
z*>2>li{Uf2;B(wQu`}^;k)<p<>e#bu4EliDoIV4M{yFgIMtRP8D<C^LvO19+&-Y{7
zc9>Hcg)xKf1>Z*+>eJ($Cz14&P-Q#p4fJ<_5uJ7{eLBc-0b)f$H|w9qKwjYfHV7PG
zDstZx#Ae#|-vKhrsEXkg8UT2J{%@}4{1YJm$&Sb{7yonXjs^c<#|-tKk=m+Q-czmF
zca1Fd^_iKKbTe}{(v<>HAbA2Ra5*!q&uA4Q{{BhGhNQRs1VbX;CH!!RtRQ)x3as8h
zro>P%uv{ux1B>}Sn;)-&%{rRLE{{eohg+>rxY>@E4GkKMZKJ7~+)o=%URy_ATTdP8
z$F<eFUY~&<3sQFh>Q#{6wP7fDaH6}R`l!sF<}C_tz~-hn;-_?v3#<sxl<v=upB#3&
zsvXZ#d~^+<{ZF}Cdd-Lye+hK>MwoJUW`5%rs=C!uxHa*2!&SU9a5{Q4d7_J*_eZ?y
z6*%0OTt-y;-Y45#x)>KELGEW9UbLnS-CXJ#iX16=2q?}rpd&3B5+uF!GAH=pjBm{c
zv-h9*0_mxloD}?{gjdq;#M}ijdv?#(?-8jo6K34dx8Hcq8-E*6QSO3(Tb;?bhDlzv
zi-a_8n}7FM{{wsQ4ai74YZt3mJ>ZvpGBs{eAbUy8oCovq=Y@A9Lu*YQLO{%kfzEPk
z48$_pdV%m3Lq@vs7~QFe!2dD}q>p#872zW6p{)HuaB~$4)2t6mpOwr!ZaS|Suz?RS
zZ~#BKUF|9G6KJC|-0`}&m6MQB)=nR5yN-i2slg`h6aHPP%OwZ0Bgj2kXmQ`S$%Ty|
z;0LQ%v`>76*0Nm@+x>#&t9#E(Ko~9D!MD^~Ya00J0F=f^-hB&+YbZtf(P(|VN|#G7
z^2G7^3x!x|TBsxen6hzdIk);sf)=$1x9Km(hRJmM$bJ6g+x<d;?|26ud6m@i=BLPW
z_YRzx8Z1c^*7jZ%veww{S#=Jwp=e}pkjmBMw#-9(U$IyB{3gjNnoS-l(<|v}ExhLa
zV5E7J(}*x=Ld6=5)p!<C(T9u6P-ERHh=da2(DDJvu=lBF+rO}Y8xBqoLSAft1-gFo
zk&Qp}*^I96p32+amWIaV9)~Q>F5u1!K}lJeW=49)-JP3cY>8F)2sOonikJ&~l02Jn
z)o(3*%Qfg<)<ErZylc<%a*wH2jXiL*T-kR^#@W$i_O1JEpPuJ4hPP#>1H`7QNyb}i
zsi=q^agyZW(JPbpyqVa3t0qh)uXDNJ=3c4tSX)tTZB$?;b9p&tlEI_pvnknbvzgs!
zo<*e@j**3==BM!-^{#R@?$DY%!cM#+o6Y+kVpW?b7S{#6?iy1>{=6Srfh^0<auH$Y
z7&=wCJ4-ZX!pil*0v7wAJaX1Ey+Y(*Xjy}|LYSuR_<lUsX#IJVd`xXb{Rc+2T(mri
zoO#I|Ncv#(gBrUY(flm&e5AZCLR*&gXr+cVkWz;VS(9@mWa{XZzBKhR{jTGoN*$W{
zmS21m<TO@%qp~j!NbOG#yN?8yJySX%b|30|;pttkg0wm!YW{p99FQj*tYwH`M7M+3
zNEB`+6;Z{XjoU8UV!V*sicZwl_mBJ}%FsU2YgQs_nkPdSpfoCT9{{VF(7B~X0=JdM
z;=rrT2W(wj&d?!!zrx=;@-df95Zcqis8%pGFok&`6xmqATOZ02@n9s}<V<y5Amho4
z_OmbGf$>!H1zRFE)G>Iv1rRE23Q)E|;~5OZ`B+Cz^eZw2PB-^Uzuq11NXNj3*{h1P
zywM!*!d3-^X$h8Y1bpycGGdOtcL#U#r(&-|31js4!+ZX^NPV7(2g^;@_?_rnMhB>G
zs1)cNQI%9-S}^}4Zh?z@Y30;zDhfVZqU-HXe~dpxRrfSyI|T)rnjJ#N=HMc%>vH*y
zeot>XK<UTCo*;=fR2j#g(uo^Bt#2zyCT>w8kyYYSclj}WSizJh(!2-bBT;59e>I}+
zQb;}2w`Z{NT3El+HhvQ#?y^6!?x^8&!Ax7~YR)LArFuOif>M3O9S+OC(UXLMVcr5S
zpH@PG3Idb3r@mQ*hrpUWJK?qDcakA^eUMmn|5}XFxvWHbqODxy4;di>DI6rZaT~<4
zGm`YYc;%YAnlYTY&540g4G}#tkeZXC7bjMNp~EFxPofE%Znt=`QaHZ?A~5!*wAL@f
z(S>x%RJtdeSWztVtDs0sQeA3+`a-Da=R&`5%P*bKsP7eZ#O`~oBpmDs@tP*!Rxv8T
za_IR2b6+_UQu}marSxR5xSI2Ln<7v#hE5)Yn%E`NZN}j>O7V&SO;>a)6OEC`0xm=L
z6-pgQ&|XrTmOB4({w@w_Mb?0U8+VG58ZSOJxzRMGU`rIXc0I%BKlq>)hEMI0+7RF_
zPuGM|F|B>$QDZ7m0uyvgk`wPN%ogq71ct@La=*DP3!0HJ*FX+D32YVZGC3M2$%z_+
zISY@V3B4f!SPg(gEHx#ZNc+n`GUlE6VoYaAQP|vi$=Aw8YYBF2M<r~{#>fhK@boYz
zWH%f05Cl+_Vf+|f1YvmmPX9P@)Z+D~((yd@XcDgIy5pb|0?w8o>I~1(P&<^yIfq{z
zH|<X;TBii^+?ghlAq`B)F6OmH85X#a(WmG-Ffnh+kI>(<hNINc>>dW$Sf!LD)+btR
z$12kmZHh?5Z1TTH1#iyLs9mh?J-6Bu9T>5b6=jW{1*)HRX9K+BU7|ww-~z`0=H5vD
ziX-&RZRcg*c&I-zG*QNB#K2L>#yL#58fJZ^>T*?0REbtNI}O3T3*{g<tXeJ^!tDC+
zhvy#LK^1qqa@d{V9e+t~@JK;pB4RoF0~)ZJ&-dbfl4}#u3HtrK0<)klQ6CzrWp8EK
zPm@0?r1sYg06@6m@eGIf*n3J%V~$u_4AH1w=2VJfS@LF)S7t^p21fNQRKG9;{v4(d
zJ4Zq3ZW5>is%rVlA@(q+BQ1qM=_ATj*#)|EjYrK>1S{=ku%g4%l9hb3CZ*|))71za
z5m~cgA`4S(<s=Wv%o&i(8iYQ|b4|lm%hb+F;LSvU>#P2ja#JaKgwtw2PGu{$=LWL{
zyfN!mnn#`du*qE^z}u%<PHVKLoR^dR&Kxp&L%tBP#7N3(nP%t+>$TLXSJ`{DFLD5>
zeD3?*{!MTDL-#tn+VoLnK<{1Y#TV!B>gKf!!^O;$<L9(y;kp6w1+dmu$LTz!HY&i0
zUYrUo^^PyR%D8%T2zJ8-=fcLT+40S@!RNwaYodW|>^>#c6LkH!(s*ZLVZlAIaZwq7
zIR@{`*Z?QNPRnOo6z^dX;oqMDf9?a+ACu(>)*R-*I#_a6d1OQVgUw~j2!H!5s4oCD
ztT-2Ed)w#K(tR^U;^h8}YWl?hC^|6yZKQjk0e-~zMH7V1gE^Co7RbmD4cQ`gF?T*%
zEPY`Cc-Qg;0tPy^k{o%w(ElAQNqb!5G5*Gc$p3MU5$#{V(%I%;TS-^w(Eqts68gV(
z!&Qc{K943^&o>_pt&JE~^ydVOC`z<N{7Qh0mgOpxr^2eFYekkxLZbMuDy0~zUV;Z?
z@}#-4WjyynD2+;X^bL|)FuBm+p!7hQ){3YLwk|!Fi_T0()7LK+v*k0?G<++k4l~ow
ztG6o_895(V{AY<6AdPg*8KA<Ma7>nF$kF9Ug>Qi~$uS-FkEj3dpbLp6rpw6hVlb|0
z`+wGhdHFzXuyc4~n5`2H#vlb#5Fi);9QI(_5Gao2?0VP}e7~IC%w0`goQ$d%SG8U4
z2n(uzV@C%36gA=5;FwLbZr@7MbhLCFer--a9i|s-l^3Fd>>+*%G8m`pLBtGV28*%r
z)i$s?@=!0%;`G>m@A7awSrkI=WyVSg_RFzsTqC)e7RU1<>U{v43d$|?-n`z&X~O*y
zdK%Lk5bm_lI2T_f(w5^Ie?ua)!|)~XJEm`8pSxMOsrUI>jhcl`=U@;XsY5OCONU<Z
zCF6`g@d<hzm|=zsuY&Bd?d|`mMSr#4`gWvK+KW>2%vW~+Wup3>0f}%Do;3EEIOD?h
z{j>V>@vNWarME3*-**&qhn+1_pYf3?MpCw?8t?gMu8O~Lfzc<oN7qZf4o<ON;JKuB
zsG7cZJHtveK{%jxn&^2fK>W+|{3X@1jb3i21Zmg;1<8#OF3c1?@30x)b9E+A(l1r0
z?ee&NILqg2Xe<EHL&yjmeFn@JU)`nmVRx#!<N1<C99=43ZUF{VI0;n&9&<SAcdkxu
zsPCsKSbm!vqNEd4bm)md6~|u3{T4%v_H>00vf*ZED<)!34@fZ()JFYnyx9Gl{Gkm+
zo*L?8gSK>0aF6*BVxwVfs7Mdt>vPnhinU4w5w&ebzn`F=2Qgz@XOi2?J&w4;AjMj*
z<lYn3#_)_*u8!T_UQcgVyII@5oXk)CMiN9BefFbROI!cP#-HX}HE9VVLP6OJ2ACCQ
zK&*H{Aab*j-LGpEb@}Z{VMOlG-Yx=YQg4{lQh8g?@+X9C!g*#Gi$QIx3Dg>N8QT+B
z2~s>aw{dC-=L&yw$_f<4(9^WB_BM4SL@9PtrVhtHF>k|%OHP8%RuVm)sGkmnPvfbn
z>y<<-1pxEfHOheN&lNjqJ`rSc>y@=|Qca@p-zBl-@rZ05f#ec*1|%TD^C!ROKX^S<
z;adK1p1pU=duJ&sl4>_{%#?_QRzwoI(~z>;SOqK|f2#{5uWit^s?t%9D|b}wgKVBU
zr}Fp{`s?EIkBa;IRQ@+h2G88^r~y*-!NFK_xFUbqa6*GYC2$96AuSL|#I2o7gONXX
zYrY4VAe9cW3cbznkaG#&30k>1XAIsS-b1V?4(sU1S?ux^NX<*&fmRQ{l_r&Y7F~Xq
zku^07dYHi&8tB{w$@|uowIaIn!=sGf$k<r^5kDEfIINWMsW-sfcq*iZ;Y-pAZqz{|
zq%9AwdXcf540^r_&XX9BIbN&9hMU@XO#)IT!3wnQN_UE@Y>|S~B+_W}>7-aQ+fHjs
z5A-oz*M`NemJYl^v_gN+=Vz2>Yq^yjgi)$5V*>v{x3%MoS4YIH3^6T$R%04#h+p*-
zM4t0Xq3R_QB0-DGc2~&5j*Ua%6?7ROC&~j2W`Yh)*aGK2`$SXPbZ@t?)*##RIIYO>
zuq4jN%ZA`gN2D5P-dPRh+axyge9WttayL16<FI7O=3GXZltM33;8i%O$VNIZL8q_<
z`93tr<aYE-*7BVh9=;OkoDEKkrHGa|0eq(C6n<<>+n`mH-^yLoRz*TZPeQIy58?+v
z$f`<aI$(k@DiK!V8?wmO#sT)bD+W=(jwBd@0nbcpj?7VjzMIl8P?cEjmeGKOhs*Sq
zu{%mL%HWSx{yVG2j8&@5Ju@b84FH<l)ehA-r{HtT<NDFo!@$@LrZ;~_M3!<Fd$}5r
z@VEx<FX`+aFR^j`+-cl!Q<OS>ATB%Hf+?r*vy0~54+H}yNc>07!WU}n0X8!gc&th8
zG=uTZ<o12v^$aPgx@b?d9Z%>pi~>RlL{4?XaO_ZL)~=wD&U|;<`uC_bc!a^igc`X#
zO%LZTqgzHiQezh>;khlNHu1z#F$qu`ZR`MiFapdJ-`C%ac3=#MZir60h)&-6?hbTl
zto=+mq2gUXH?w(L`5t0fmASEd86v*d3rFzB{c4Vafr5?JX=5-joe2v);Zo?yUs~)!
z!X!uy(mJsZ{m!Kyh}3a@rjju3hsN;>jXM*G-8Y1h?dSLTc<l#>PmqL$!{|8ZYA0R0
zyGsMxUS&4FYY9hcDH$}%A|WI1Tqv)PfEq?Eu=Xtw^u6#z6;Uy@@oo^c54fjv?3KtL
zgw_OU>1leJsH+nS^ijIITyw(k?8s1F&a>mTNWW@DKv-*{rJcaRi5izebHS2l&e3uT
zA*jov5`UQUHpFJu^ww*Kk{NdLZ{2OcW=rwqEuG+ire@Y#7f`)d=pj?U)@d-n;zOZU
zEkMWn8wRK%6d;df>G3L!o$j)hpcwPAa>r=wEO1Mt#63E`HF>?Q;#IaEm0_ST%RY#Q
zW*b=<K{6`o(aB--+u(ob2@z+B=_lp0womhtml#-PIcy46&K}6&`G;T~JZl4c5zc+i
zJ&t~FMpir{1Cgx<GncQ2`U8og`*<pLz(G5RAuu6Q`6_%*tyNiXnUpag8i*|;AGS#o
zhOKM%*;`Dp3ijoFyvFB4vQ{4hmN~BfsMmvkZ$CFIV0Et8rdZ3%e<``qcHwH?q~8|>
zfs9jV%xfZu)#6YU<<aH@v+>7b64V4i*Z3Cy0Dq)#N5I#4GL!nIJE`0KVi|?yJkT7d
zgxI*xsF(4R!~V|$D29#K^=6-tLFUO1w+;4(Rz><ac7G6IBvH|!Bl?A5oVj&w0-ryn
zmtMns^L1X2g6az7g@IoWsPCfB!!xC91Y4Y)PnJbj(kOTP=`e#rG)*RWFk|nSlN-ph
zcK5nk{b^mpO6gw>j+>WRm6hBfJ1AN5qzZ45^l<$%*6tUZtA29J48_{pl`J(zyMCth
zHWXrO31@S7qYt3)Q{i7)$39?~05$=~{lOAg@PEg*8g;94PiO$Z^*{E4|LR;g+c2^J
zFLL{Y2j2c)$nEdHMf_jnMsW9K0Qk!$|H~%-%O?NJCjZMO|H~%-%O?NJCjZMO|H~%-
zf7B)i#ra2F$T}fyrELQ6-F<2|F`XLKR)UiZA2LPynNFB5@*NmNY52YA@*UphG%v5*
zU#Sg7Wb+w;whd`k6sMNFkWi^tV735;++whx@<LmFD&uZ*;~2pWe;3k9gS1s4a@b#6
z_WRfD2@Y=?4d{s(;8gHyGv}AroXK+8XHD`bOd}=}SRkD@F-owXOzq95R&zfChR2OA
zj)RI56qp(%p@9%jV`I)5fd$itDhqnSEYbNfgj~Tp_Eq;=y_TM8ZgrYs9Hw6+B4`T~
zXB>VOp_aGB`2#Gh;h_-<O965)=-2i6;dT0AtgA}D)Es79XHN^NN?|cJPgo3V#lTU_
zLe%bZdB|?>4^ePV{k%^dpM9lNSCvWVNXG)`jn>uuacPeQD~L*-G44obmCBqE{PKr<
z0(vvkE~2Lh51RIm3sEDq#BaMi#O{gFo?T6o7|BnP<q%<zN4;E5r7LG&F7DGd-9@&%
zT`zT$cvBi3zgsBn$e;)<u&X@VghTyUt|oRiq4dNuq7usvTweBRUgcbmMl~eFw&HOl
z*`&shIF1yh6eLmAmp*gWP<ftA0~B{L(SXGy2p_xlytJ<)xXfo*Ea6NHrTC&1@QA%=
zcDI9Eb$og2m5j6?t0Ri!zX`o&vRd>Gz;z{OU<}a4L~i?xB1TxG_i4K~jZamg<kaS{
zIP2z&&f+Y|I?F{xtrNGp&0=V$Br??8PL2`49V4iwv!yZlnTGNw=I}U!gNCUDD^>F?
zEparz-xsAaY6Wz9w_`%X&~Z|ewUwswtCPt{etQKMFD$mhKO<ReO?-7SDi^d89uJ?G
zTfO(<uG@Zmf+&KDlYwnO9-#n32nJq((2L~x8nct}{-_^sWFeTSPq6@49K6;J8XXBE
z^PPNgGB#a>5dlDeP-KkG!pzAtT#F6GS_~Q4rjOWAtN@@8ooCaE&6P{`rKg+S^Ro00
z3X-)@*7(}rxt#NcmJWwY{<>|LVd`|?anE{y=be<q;p!%{-``z}U3CY;&~PGt5P^ru
zU0F^%pzyqP4jsI`fAa5d0|CiCIfV%>bu|ATAfwlaJ3zky0H5&x{Q&vT>c1XZ=6|mG
z7yUogf2689*5~rtljGC|X7Dci1tYi=kwotTv2J(+ngu1f<?9UVt$$^0+P$nE>y4;Z
zSXeTp$XNgbSfrOZHrxWlIweFRb%8HoGBDWBZ<qc5WA814;##)<?-|_Pf&|y#?(V_e
z-Q6v?yF-BB4grF@y9G$_5IjI2IKl0ibI(2hdqZ+^@0(xM^WyHRp$dxcXI8K7)oXR{
zncgfrnH`fWuPV1L-*xPO1<dr_?K@xSJwEz8n%+Nt>izs#8u{T%pv+jj1*sDjY72ZD
zuH2Ad-!8sn;nEwWx1(>p;c)X5=gY6NoK;=T<4?z$q!7{4VM$P7s4}35o00q3nUYCG
z9w@0VQma}wZYE=fPY{h=oIQ;uE@;qsGB99o<r7IsFmH5831)n1)fw)_0=?ho<nMP4
zQSq1!vl_m2(#LUhhY-XPuMDh9J9Y4R)Z|!ji=F85SVExtSR9KPi64|3pZ<}`7xp8V
zFp`vF0sRLKP9m%Wt<0vC?}^Ct3ckf;>l!h)C<e-0*+t>I+^x^}Tdqa8AA`pB3Mg5H
zcQsYn?JHm{Q^pKnUoJ%sqC<{wF%#8x>t0W?u^#tjUmfd7BMV2+c`B2cp-eT;lfdQV
zz3kbuzhm=zJm=Zlr(Jc3)f8KJ5yTTHo%0f`!Zw&3fK3%t*gQt2Bw944>+PI%J9BxH
zWNfcgOE{X8YBmQ5<I|AGzGqunkzIMv)J0Y;_y2C#Ul&pwMHMcrnrx(sIL$%!{tKTX
z8VkGC{A|Rbz}tu%0X#dVdx~p<1|$Qi_f-jQHJ052Ll!goZH|8Jmz3^WK`9EJUwX;a
zfg0Ew8N%gxh26%2s>P6(Wggo#7N+NL0lS~`mMWc7+><(%B>Lq25<YKrSG<O3{$$Ey
z+A|n(H1K$J(r{&>o(rDHRa*w=76(j(?7%(He;xgR#Z@Db5-EzrwW(q4;<(j-oBb`&
zfBXc0p6Jq&jQ_*Ap4-)V#i<Tqgj?_dmIOc(o?o8O?EJO-EOJ$>i=;4dmx7T4I~gS;
zM0tWdw3}|;vH-VyKqOTpe*9D;#h1dgw)2J5VMNGuc}hIOiig+FZYgH<$jdu}&kt5h
z950n$BE=l7N_&P5=twQBR&XlYBv_s58YXpqdp%@%iMKN{NeUN_R*>RjS2U9j7KSsB
z;BWV$K;-11($(*pIZ_V*w8tc{&3^bOdG=YP^Fj)kiJg=I)ugHxDeeL8agg70aD6WI
zsm=$5j0Qss4Z*IssNPT-j6zvbOi(@X3_jNU$i9&+_dM;D(_J?UoUZy=Z@Wshs6z-b
zJ1_Nq7BGPb0#<+Okbvl98lI{i?wY6w71p?Tz77$rIaGJxf?0${)ur9_i=`Ni3j;;T
zHX=tT|GGsS1_qZjZi*opwC=*a?IqW$x(TVEsURm>W*r|<4@c*z7GY$I(5`5#Yd)F&
zSBn|U2L(qeg`uLn{m+r#ww-cbd2h_*YfJeEwM_?vQ@<pFZgzqLE4N_;LllFP3uwGu
zY9ygR<!*$2Fx>I8VOTib6BdOc!>xuic)?yk4m;<9kE`Cat@qLVW;t(r@p%?rTu(r^
zU#g%TD5J+#j~@)97Q>J}Vol42OVu0P#PP^0zfk<X-^f*+q8K|m3Cw)^Og)z3W7h6C
z9!ry1ThO_(>Z<4hU^Fxf*5ryo>^ZN7yP&AkEz7{dh^ivEJEGj(cki%7GjT$KR`Hi}
zkgV1<)&;KvL__ab0xHN1ybY(rY2cPQ?LQqPIG;!v@+Bz+0&tOog2LClNAq`f7Vlx}
zGa{e+v?r<AS`;j8Zep-aSqRb$++Z|LOM!iUWjIZgQB!KI4zoCn=@CF3r))fw*_ew!
ze@)v1(M)m7_5wEiRW~-BeaTRcT|ut4;wyWT12RiF*z(Sh(jvfQGm_54_Zh*mg1QV;
z6#=Du-Z0o|(^!an5?#$|S2!@8G-{=yDBOC?l}PwwRXnRNu4XgS`UQKmgx!%D4m406
zV8<Bq2sViM-yB)aM6n`A*|2@SM>|?*P|w=mhMA!C76&yYq~cZ-L0;ltNH4-@Oujr$
z(JxJ$&Q`kYV~gbWu_8OhH;hwV_c7{Vn2<-p#e&3f%I5e?!9CfW#yB5B8QY!id#G}u
z(npexFbMyuip;c`qzJ>jg|44=uKvr2oYo1399ILD>xC-y*JF$PbZ`~TDYad$9f78l
z$O3JcAre`FmHh(b>5tY`{)&`|w~lUixOkWvrGnjX?dt91#O*9P6_pgv$~%tlK1_-w
zi!r%QzDry>{D|WQ#KzxgErNHr3%2-%;V@ig=%CKVw?Vtg5r$<D&68<u&VYbWbY9O8
zr|QT|EA=HGAYX%&p8Kuo%}m2WfrDO5hHnzL7ZaZ~(z2z=fSR$rtB~-n(W5o}TbLg4
zVDCaIBuaYM$ipUbd(j?9;sMnzmMgK9@g|N0<JnqD?w8%{6gtY@>u&L8h)&Q7=<~{n
zdDcBc8PtoZlOI@2FIi0Cx4q64J;D_@dFqG!-I~6sBWB<{%OmF8lGeVq8(4gHF0TK6
z+S}GUNQ$cM#B?#!M2ez;4ri&F03%@<Hdq%=IU9b2-xzIcnCO|LHeSjKT!fv7-d93j
zsrJT#xYUKzSX`8W?7?hNk51*;2A`>;So{9uA+EtX>TLi+!hqJpdu=XR7thlda>bAl
zMq!NF(1w?0Au75Wq<-{rDYN_AUe{ap?+P2xl^G}&fYatK#Id4$>n}c{cfIbcV3&B4
zJj)V2nV*8S1{qMcS)B&K&_*hOkZ_`4V<<0bTZ-9*?UOfWQQ@BLXG+@P@TH2QARPkE
z=Q>qjsYFYXCzE|KDY`g0wt=ee;$yq4sv|$upt6(>)`tWO47&mHF4A1M?iYNRiFNU@
zRD`+=IgfK@H#gd~ys`4A7O5rEyMwX(#Jx@VRbR`sU034k_Hq#Ip_AjbaB8U7Wq1aH
zUdjh)8_0;h+aq2j4$%d25m3!oNn^gdxBoVfdSsW6{mAbVpL0UrD6q%^-WI-#&y_=>
zSyY_)l{4+&)wPO~jrK<ydQ7G%qPtTQmus`W7V)qRq@A^78=7W9t8&i+^VEphu6qRA
zoA*juY!|ue3XVr6ZI?+3GDEw^f#^5G+wj-BvhFkQXX#SLhib;?BC*RHTBKS$zly4x
zjd?yk&mFp`%%xn>6t@oDHRdOLX|TNmrCVgpdN)OdD3GYkPAK~<AXNu(6SEv?GOzQ@
zx$MXY&-G!I{gJX8;3K76uSPBW__XR{q}McQh6MoXetX*h>t9u$v!UA$N9k@r5nTUY
z)qYSef7X8e>Me=*VkqxhTg@*%3Q1C>il8{b&<4T;yhk=LI0kAgaNdCh3_u?PaX7!i
zo2;$DLqY`f6ro6JS(@*BeOvC4uE|&T_Ss^_a^&G|Rk`>1=@t{kjts+@@h-XFoyXa(
zy8E}!?*)#w<pp>e&)(YW!X{U4)Xl}S;Y`H$b@Uhq9bLUfP8yaePNo*`C@!4z&}*~W
zolnY~=zXZoet!3rzT;xcUEkZo3E15wpY7v>ljB`y#RI2~uG<-m7~UW5jKjFsz5<W)
z7T_Tl%Cu035fQ3Vg+O+CBl9BemXa@v4mZ;0c4DSEr+R-09$;2icPWfn_7dq$q@{HA
znuFCQT{PZlvscL=Bmfg&)1H}aln)fI(OO|<1RphGpAp?>S=;q?Yu^GJkD=3R6iG!~
zjCZ%1f_{k^dU+!Qw7F}B@@GN_^?DOr^W24zr+Tcp+MQ$)p7dNBK!QKF3DF+jVrmSr
z2`s6ic_{?2!9jV%h7$)M^=Tm#RBgJ$+8pDWl?S~9vq@_f32q;WuOl*zm+={tll#gr
z*a4>qjHXu@lwl@;F#q1xSACUTa5&%}Ogvu4WDkx)NVX`40HGJGJdb%8gaoaZrF`?u
zpM;Sd%piO>b%A|rvX?x<2pG@B&DdnUX$Rm95RjA8>zydO(rIamm8QygKU!$@`jxLd
z0vxl9R|6^F?wry0Y<d0+2|GO7v#c~#KJEQinZ#QgX`NJ^Tnr1c<nDw7*~PL7{U|K<
zQ2vi6m3TZjRDdfh#7g;ZV<Y6q3$k+6a}{F4P2goOOyFY$)zg3(a^LgAHrWu2!r+yd
zve~YWAJjPfe53o*goTal>#jz3D-{RH3{QOB`cek_kWgt}c^*WnFxD7U_G{Lp!M#ss
zk0|{Dz%ruMWJ+Z!tnJEUgD1V%(eZaSDBJ*x0Gs@fds$^7Kw0vMF`f-YltnWCls2`G
zQ6m;67EF9xkgn47yd5TqYSCcBdvSU*3A1IC6d{W&p9zf}vW$u+$C${9d%I_Sp7_kg
zCx1XQ%9?hA{$|lhNX-jpzatF%p6$(ak6vzpkHjrHRPU~a@=1t}LgH&2y3kjJXPCXV
zosq2C2=(0oa;fPwZ|#`BlR!~LJZ7_nZm*r7yrD}>`Bu-a0!=GuddB`*xiqbR2U2kI
zyl}GKg86+aEC9_v9;Y!)Up3&N{SsPjd4(WUa|~PQ1=c#5NLYTLW)Cxu8v8S8oj6KV
zz<y`|G!Ec^?<-*|&<=P$Jk)N_o-t=0Cudm#vq&QWG-oKTVbVko|KiR7W-8F82wlud
zQiS8GG3{n4`v|v{(p9H@#rG{V{i0%DH$DClt$E{<ZDMPPv<1b<yQ1e&LFxcfNX^J-
zFbf0kh#CtLHpU4Od}&%~H(5{jm*S9ua#GG7#A2dQDV5cl%ekB(k|_e}iBdc{&z-q(
ztl+>ap!LRNYG1KNEh+K2ljZ9$uP<nr*xH4^3Kp3<xk!mFEiGbLdoE-hnreCgEvbQH
zlz8hWr*(7RwcQ(`JLhv2g(KNwK~$!H4K6g@;PbNS!ffV!j$)~Gh75(v{oq>{4-cx{
zxm*j40~J$Q#L&YPfudW#Npi;+si;eH2kHa3zK`%Gz`T4T1hh?<0g1Tmk3p-x#pT&k
zCicj%Wr6vWy;+ceFdEa!*#PPOEKCUqN~}uaBKzSteSABCA3XTgpGlFBfH?)(wP;o;
zj3i#U*JymGwKT1gXxrx%)Ic^E&iDvUfm%<n=~|IUZsV>ZQde~(thvIA$>d5`x$R7r
z|NN4#QtgEmFwz|lO!x&D#0?`dQIL8=9ltcjm^_hlRo4QT0Ub9#xYo;$R1gZ1p9m0N
zemOT484+3ck*AYe1%r{0U7PmuKbAU$q@<@GqF4DOBK;5+RgUWgtFv>D<$p7JVyVHG
zJUD^HV4_%6;05P50cABIC*&@ef-n;h@Lcee5g>}u>RFBV$_|Nm)ayv{4fZZw#n)g7
zHa?GP$ZlQVGr8y6gwO)sYo`nAhG2lJ@`Bw5eqFy!3f8SJlyBbB00k3`8Zh4vSQ5N8
z<$?5%;3Y8i|1v9w9D67er*~}#FW8oOztQ($o|sNRSRaKIn;HGH0rJJiS?j~K`=#PS
zj88n=!M2nbFOQ(C(ig|OR*#pPQ7Vx?q<8}hSJcm^y&g|54c1RuXzrZ+vL6|`0mql{
zMv_K`0Z&t<fALh<4k)8-K>aRNqW+jF|CuEpAb~gkS6LD={;w=48-=fm(Q#Bz-rDA6
zmWYrp8o^8=nwa~dCx)uol~VK$JP_V-m(YQ_`HZkxnw{h;1-&qlq#y}gkC@;%jx6&t
z%4I%XLS4cm&%;;mN=gnU2A@l@xR<{vcR%vnS$TE%!mzT){5s)#w1C&mR?@o{v$8W1
zS_^Rudxnn<b<#LxbS&TXxzHGk$hM$cny&@f`;y+c?F`|~SNUE%lx*II1#tmhrTf^o
zk@8Q{?Ac`=PF=r#rP4Q0{_JCTJR;ljO<V3g@rP@U)tlp4cmAtqO`VzG4hr?JYo*;K
z#9pe}mRZuJY~uh7e8xK0&ZG>f-jkP2L>z=*;23Xt7+FAAN0Z0wg?F!)14tkN$846g
z1j(u5kU$x0EC8!uylU!#mWi%mo=t?>0cwP-B%rjr7pL<qBTcsr0x)fod14!N$KmD*
z1u+Njzm~S&W&kjg!p1Q!?ahMQPZQJ)izS8(SMUddOYFCSy**F@q&gp+9fe~*zb+?4
zy<-II5CX;%#-D?&`P!fOGtpsP4X0>k0bk*~Z<cMnCs_QX14oPZ&LE&)KR>nvzSt{@
z8~NN6TX`*<i*;8iHx}r>(c$o-`<<X4WGglh<`RH_AW5(LVyf*ec$%G5aJNk8mn=E}
z;Qk}CKNbl_3#O$vFZht~2MqRs&XgC@HDr)5u_v3)KNBW@zgmxnBek4$tV{@^VJM@r
zwxM<F?H9xXNTOf@1+h2o-!F$&-Sg*)8)G@3rKFuF6%9Pphds8RYRu2eIg(*0<X(!S
zOZi-xsVmWb08Vs(!GwIXqo#VHfQpI}?m@LS>b0j9N!picCPoehgZ-Ja0X2mPc&@zQ
z5V`ejG#-n8?jy#qLNM&kO9v^ZRU`88*ORCeSZKE9v<{2u3RC@Jh;GjcW|bMna4Zyq
zN9oY)m|D77XCWV|z~JS<y9Z~C=jDzK8)2<N*(Q#<m`iua$J_&)d-Hqp4<;ZCx^rFY
zPl&KIU}l=;;C&91{eu7z>;Q0w>^hg^Qoolq;HalNY|5N`7AHKDc+BJar6fl~a?r4;
zpQ^D|fw}Ox)ML4@)3b0p^PjF!{UH43t)esyf<%0qd#^rA;(Fa?<~8VTd{OM>8l%~f
zlDfnCc-eSf77jd~zkRmcsc(c!(QLl#!C^PIz~%S`m^J}sjN~p1?4HvSJIY=xI62J0
zAlKa^_wm~5h5Yo18=f~ZAE&oSqumVda`w{w>vonzp?r1#-byC)6gR-l6E4k)1GO?8
z6T`~CuH$S-|NGdvHHQ1`%<6)FR(^wW$%q=_002*fjdYNRFTAmAWF|#EfRP^37GRJ)
z2#7N>f@e_y1UnUdP|}pMNW?V3twIpmbQIrgcK}+!AZp{+4FJ$u5Sx9QR&rb^ZN5!F
zzFdU|EMw|Y@oh}(v?>l$u2M$@o~{F2<V(w}M~964Y1X?CTi61$-~pdz<G(HRiA0=I
zJ6UQm!{@KSmgPeYStvk{Bo7{~tV!azI+aVX$)e1xrDFjiX`KNw)8jycmyYpkS$lGO
z<J7czC@v-PG(bP@#3+RNEg~PgH)NsWkleBss|yxd+Jx~0Yl1CZ$N+-!#9%83d(TV2
zR4$4tV<l>ptwIuPQAu{m!!}n*sQ0_+mt}8+b80(=-~pk?ez#RQZVZ>~`W_<ebvl;e
z@v%<Q^K+KB8|3)(B-JpuDa9Xp0=^wI+fC5{VpG?x$#5xyJ6s5Wx6c7)u-JPOG4}6P
zZ`Vg>kB$0Wx4}DHuHn6$Zbze}N^V=Dxf9OKSvUyLv?<=)7{DK_zUiRRQjZq)LX2<r
zLgx&nu6f<C39Z=<Phq9T5}_PkR%_#MRHE(5|0!!Qt0*^J;o|Gz1mn`GCj0!+qrCml
zBMc(|4cR^X5dW_9X$HxF#AyTv&GrwFzsn#v|CT{a4V{cF{(ZSs2CMdex7E(`*XiSn
z_B!g%9w$0>=<D9CnD5tQ^~+^6mn91JSc<-wD~ItA^w~fa+Y|9zgDfOLK~7Qd4|{-=
zlne(8K*KDor-p<0SRAwIF=k}GVagjd<ZPb9!{WZh<G$bTwyz?#At{l~#lPdddVTM^
z$_#;o!#f#ZyJVp0mW+b4LmdG`LG4nfo%RjaP7D-OZ5%pCUAwzhH?XM2`((S!WxvVl
zI^ANtg8~Vco(a}ejNQXZmkZ6+jie;4_x*-<M?_aQDL{d26n(<3QLEBPY9tk7t9;Jp
zagK2xFInkLe&6F5=M*p?@f}hO#mZg`a-5<bYq;e$-E?V-DF-5SUya#gxAlPVMbW<3
zwybo^Dw}qO6bcRdW#^4$(5ig`>6G8qLV|uww0tJ8Piq>t;hFOM99aVUXS<g7=scvb
zO6)kX7oI-7QL|1=@|@f}Q-oqO9)ecg^|aM=uk@{~&nZk2prE(z@xw*?lEUI-Gi{q#
z#VV7Jq!V)^&{BBqG)19HWliMlt!0<1OZdP^!#Jn>6lhYntzxzhygOxDTLT*>j{+&2
zY@VeCjZV~@-F6~fiS!URO-j5CNx|5PAZ`;~Jivl%l2|jrHuvJwi?h{K>ZqDS4AMpo
z`LJFz(5AoR$s81V(9&XBRl;F01fAc=vF6x+AsI{pX?MmXd&}+bU|s1&3ZGgQnMlOE
z*^{gN{n`{YYaL=#n^sUXqS*y;++bLBW!N;7O%^_jlSwJ_jc$PTV+LiS=s`CUbef`>
z8VY9^oIiMet{Od7^7tOO;`g*f(b6H(lL!B(OAqo$1|s~Snm3$6g0L+fql!H+p<vt}
z$+90l8(!_qYThy&-M!NP(4s>kBSYrT6-tcAihFW|Bmf<tR-3G^`fAg-cK=kXmiE|2
z8i7C77@xVtnRil~elg~#TARM98ZAmJrbYzz>O@|z;dP>AT4xGGoP_T<4+$gd3?hFH
zJVM{T!tv?6+<{VQ?8xR`!*z>|oijVyiBA$T!6<CL$tjMt1^QHN5a}Tsxu)IiJ%5M7
zaOJ>eLddlFpbH+WFDJi&Zu=EWn*t3m4r#0wCPf<D_hftNm@(bQ<g+6n=Y;ca3RqCo
zw`S1PT0?zj=1R`@^?WL+@MXnGruL2}u<5utjw2p!=^G}OG~)7915c89j#Ny{5F>+T
z8gm9r4PI|gH~TT8&lzELYwLROZdG+AXTsNTaPxu>!F4;aeQ_%um}n8%y?b6;dfZu;
zXN6oi-yK&R6oMs1zxe2Fuq{<q8!FkiC`pBpe1uLik0Vc*r_k%m4*Q;wChX!(9ME11
z>}o%T9yY~@*X<>J6^(UsgWOd&z{@#>F!(C(T@$ufCthIEWDI?~yXQ^s-QDRBR}qt?
zM!H7fu83%eZ^Ed^`{F4%^Rbkq4~Hp|3;J7}MtK{TCWL|KLg4+drGi;UOP1Y^YctL=
z;7}8dXYzd?b4^u%A~4x}{KDemUe3Gqr-wJK%tcfU%~jfY(hbi_)!*nhj(>VNE8Xzz
z#!tGZ-{IX&5w;wd1lt=^Aq2!Vf9FKoc0a)2&}O`h*;MIwjRP5Q`^OVBnM|CJg3Z1u
zcGa(6put)rP|)BtJ|mO2F4cIj#+1N&C@A6KwzybYZ71QK>3GqdRc_5D3Z#tYycRWF
zhtCm+N%$B%<AqetHoKmwI%Y5&*1MH}Hx^MSf!oa20Q2(YH^%E;7L@N|3K3BIRpjiP
zj&XzvA1KQ8(Z%vAt=-Hn)SQm*FH7|3)n|Hi8mauguP=AeQBJ#^3L#+~m8@^ah&4CG
z2ezcEA{@vu)1+Dna@MBA!X8KD(M!I=M#*N)^zy|3%l6;QGu7siW?2}A<uzI7LTAad
z#7S*QQ0`AphknO8(}+j?W?_M<@^f2G#<S;#eOD5tn)!K>5YH3Ifj2iKu~#%HUJ}8v
z;1PCTwEa`UG}CT8V9j=tP~f}>R%EpO@?{P5;4=*>X?G0leCcu~UzF5pZc&-00%9S9
zI$sRMQNqzK(?~<AG$2;0;qBoVzAp~t5(@OH+^sN_h8*P;Iu9KB7WgHI^>f#oz&7}|
z$Aj`+(3F(1fo5#@E8OLf@g6<&808M;z65aB<+u?L3@s+>OR^0yTmb@!W7O~TTb#}s
z7|j;G&0{mxJZs~m)V?;esUXb%064DEfN0zlPE6NmuTFp0{e1=vpKA`fW(DZoxZX{5
zie`f~=5QXwMOm=LG3FmLY}TN~Q$%%cNWnQ?NICVDfY-&oZc0dSI$AfW!8XH;1Ws!x
z;NWIFUXUtlW<>A$!#NKM!Wg6P7ZhtHqOA9QJbpJQSlj9Zc4J%I80;_Drdh@A?hw@o
zkC7r3kk?ncF3&^01qJEG<Lm(|&{0;I?lq!Cg}SZ2niR<?85q_cM6Vu&<|_s1>o>!A
ziUvD!aMU5NeTm~5ZE|#?^{jy))w%F0{Dy<LqeBm?Z^5rmJJ%VPa<oI+wy~qjy03yk
zhzH}|3$*V$c2eV+Kyfg<V+J30;4b2H(5h(M6hf~nF2;jMLJw-l-)+Utx`hi13CtR5
zP@I`(D<m7cU<C3rJ%a?lU#APoBt@cxeFkNC$JnXy-V84t1=UJaP^^SIzn{+pT$^zl
z0e4A7^+2=TqY!-%rP~$L^+a!{;{1En!pb76n(8ZGLqvqR>Gk#OL!#i=+vC~BIyL*!
zW;@}Il|Z+*?`tDtzSEI@>5_n+$PMx>sl^?{K4B_oelWPb>_taBUV$vJ@9u(mhb}yR
zwvvq^4kNZH4o$rezZZkm(v?P$E`v(5#XVFi1h+acxP|6CF&Kdz@`>*LxUu`vb}StV
z2NHpuLfFjzBxx))(`I&>z`u%KptO0=!f?KtirP5HaYrvQ&w%t&4%qu@&%=!19Z#UG
zIarKS_ySy&EU8R}rDjfScflYAhp_|%DJdV4kW6%iPF=LxTej-<460$dSpx#Amd_5o
zXidI>u{wg3cE%EPQOP{!xO2n4gUBuhJUrqbfT=oZC_GfClqSz`Gm884R5W?axo2Z_
z#F<xnm7_f5#GyNKXnHB39TBu&-M|;4#`4<LTq0qWOBMu#K1S;*!rq_coy?d&*j~*D
zWj`EM&Z{{*xQ>OouBqm1g?)K6zEk%H0(z2;2qPI$nxEEuITdMgRj>d+*>5-4(Vy0Q
ze?6!U7Uuu1-23N)>MGP>Z7_B)eVz9Y$Fo<au{$}@oI|Gl3t-@2YjS0!5JSq9v@ruk
z3ushH%kztswDZ3!<bTBH6A33NvZ4|avTXiDh66T}h8Jx+{>i$%@ucQ*f1k;GRp6?>
zm{`@%vVJ8i{n6*B<LK3@z4Yk7+KQMWAW~d}o4R{yja;4cdAVhqkGY&yA#I{4vai?o
ztJ!nw?ADr^hc~s8-@x4i@W{xm+a;7)7kjQ=m5Uvk*FFmuEy%URRj8$s@d{^iMu`yv
z6^NuE>ykr_J+wA}L2dDG6{+ucl=2j;OUU~9X<ado^!3h)zHGnO4i(yw`pN*|pHg;L
z_+7Kzi+fTv)7EYUzHyXNCzD544X1gd{=}!Hy<ZiRkM*0G`q@}dY7!p9{qDZ}=1Kpx
zd80jK>bf8_B!?Oz3UX~}<`l;|bkYdIh$I6(&+SnYl*{8>ZD1h!bX5CL`}0ZvMI%S5
z^1YWOEQ=<>)uGV6aaq>ht6qm+uCt=B_&m*qF0%s`XV0R2Ty(`5Z+6rLleSJghTk$`
z;A!QyjB=<PS6L%pFW;7=B*WDfFRI8kq&*XNZqXRralD+!VDiz=TUCCIuH5$EXz_^T
z-QvD{(=b!e(9k-)+w(56W|fc2IAN%~Z~x}R8A=J9PBwtHXkE_5qQ>aOr~OS@i933A
z>;cBciewIRXHPMuFSH`ccAxu4)4uBDy(25M9PQh|lYbi#?2^921#|g*>e?HtJsXfF
ziyvwt&VT^MOhISX-{xIVgHZ6L;F)A0L^$F_l(*%H>f1%;Qj2o7oXP2os-TKtEZJE>
z_1V$^n}n0LMMHP9?Frpa&!}k9-M*Q<Zt3XIl_o=*a>x&;T|Drzw2VNF$52;QL7670
zcpUZ8Xm$wr0C#aOLKt%%RxE_U0&voA|FmsetwtN8SU*@^p0A8hnG^z1pc=FGf$fxc
zrNDC~n=PGSL!mI;)~c0goyCheJvbnsM+(0*TNm*SyM3>Q`;vdK`4Fr>RNVmZJ>9(s
zzK_Z!q*+F0$QCtuj#-URa=Ix>WEB%eC0@gf&?YTD`k|CrYilpvb$j9W%S&)I!II*s
z^^Y0k$J;9cBC4vGp4;^Pvv2338~ja$5>1+YJBl7R(Mwv}fk(JiZq@}2xuQy@34Kam
z@$C~MRH#E|=`v-DHM97A_VhUd4+!STq?E|11u6m~zP#0J#JK1@rx;ITA~32+Q?wO<
zO#hq)#|e*kAA~Ac)^kvLzt-l*$7w4<qo&=l@y!<La-4H$5i@&}l`JoR<e6G*J*Kx)
z8Pny;D$<Iuuec+;D^2D64DG=9BiM9_x)3XF77@2wy9|t#s&e;{JE@_|`sQH2bzU}d
zS7ZC`Y3((9YO2b38n!d%XBC<R8XOoXU14vO*c?kcJ4-}LTXt(XnG#A!23ne6Y`+$~
zJ0PJ;D7VCBH3GcaTg-(MWNlmC`uh5wN&UMR#pl^O${h*aZD9|KOD+|}&83`cFb<jN
z%BGbc$4<sP-8IQr)7s*(5<iqjI(5{x<3m8?QAOstDxw&!Z$K)jVEB8Gu=5g!p_Aui
z$Vp1ZTttmKl5p5+WGvcX1*^zp3Ha$*Gn21ab+WCoreh$Pht^dLx0|Y_-)*HtN$Um@
zIpn9kcff~UYV^V8eU9uT#VlC5AV>Xr2-X@b)DR(#h$XBz&2YEi!j<%E@<C8CQFqGQ
z`R>uPNZKu9u>hqs4tqO&+Ei~YisAT4(=OYFMXbhEIR4e;r6pD6HUt}XJQ!hIDIbpT
za*O!a&bc@diNUB4d@^?@Xzi<LVjr4^tt@SWbm*bqWItF@JSRjr6!5kPEmvfz;Kl9{
zb=$u_u>RB=64$-Q_7>6WS!$G~whR_&Gucb@EO!I|<X0E}E%7;ep%<N;<Y}f<B@))^
zg1OBQPURR*oY#3K%-=ZDWwm)k@>t3Wk0(AgSof?~gQsU~;sfx*sp0_4EwqxJmLz~$
z=7qD!Q6~@E$rr~#gby$o6Z&Z=-Xn<v$AjPA^=2;CttZLj<rchfDQfrrWIq39X)l2X
zf#L-H&9WPkguOONLh$fZd{00^o~U4M9?;mRXY(AV&L6IkJuWdm9-NYo^S~{9VDmU?
znV}~jh!DYC54`JP_N9XEJ!2vZ_`!jY1*a!&U{C5%Cg+E0hBvB~bs^+J4;t#1U+PTO
z+V3xT;zvwkfE=|`>hXnk9_QzL3hL_6<IbyoZh@+3D1}3ECFp8Z-s5RnKJJIz6IqkS
z$5vkt4+mvg;$@17&>|8M!ZuEZ69WPyF>x^rAHBsCwLRW8RFW<P1W}rmT7DtfBRWDt
zKoFGY^tOkLXDx)1#8=|Z1c!?7^1Ai!p&fSqLPAcSD7+bfM^}l0<ZdJIYWp)G&Rj1p
z^K_nLPoTt}`TGpdlG0`ve7PYA{%91QxKop%7@?`M8e>>kVU#zDUHwX8<6d{(lo<@v
zbfE?klou=xyla=)h?f`dzTdRROPi{#9WA|hOXJ>@Z&j5S{od@1OgQOaA;G`!@{>a-
zt(inEp(6ANloIO3w}Rl_$zDPK+NDY_3iEGB7}(Fh9`3$XHF@7}_#!c)pB=#$=dxuX
zfar*=<O69p4nCvwBoRx9N+b!{xBb1)*a><IYwIwCY;>x2j*noO1_n%TP?Ci;kMT8i
zcn_+FlpSbrWBjF|-b^IBuXf(kCF32OT_5roQ^*qH;r1UK+WCCDAW-OXgy(I@d;aY9
zRRLVFAv-z%LdFCpXoT5xi*DFPzqGmV3tu~3__KPGPY9NZI@zyJQx+njp#|9~E5k`{
zHzPO~A)fmgu_dRZ;Mx);lH6m6CfwWx1kLQSm=j^_<!gpQ`5B%_1PDJumuH56;X!&h
z$Xaj@K!E}K;ET2P$&8}YK2{UY&I=&ERjU-0m&EIK_=E$|?pdcR;QgJmf79{a>kKiC
z#~dl~!_v{ojo(i7(t$G#e#7)jozwHG%qUZ-s7ORuKRd`_lAaM-jkXI%kM$5;oGBv&
zls@qqxGzcGL*@u(#K;JJtsW<6&#jurkY3-K(-u8<JaGw$;_xYGDj5o^Tkp{_XvT)B
zF-V`Ud>a%P2)3Ea-Ro=Yt<=Zcyt5#Il&{Ha_iFjjOsL_=x;4F(FL^lGJ(N50=H}*k
z1>|OnU@iX1`AOF!$BvD4TLhX6nEe(*sq`V{9m8mjWHCD61{*wA-m%(y$`x9EusM9$
zNBm)_ZB_Gw<X1n$(?_jGR09Ba9y+?i-Iejv;*p44j_eLpI9~qOpU!Zxclh`1!VoC0
z|GQ6TVE=XB>7_ls7)sS)_Hx5~002&s%&{sn-U9|AT%a4X9|#cuu1=rH8Bh7zVZ(qL
z=(tAcFpi4C0ISfOpe`8C8Q^g+Ogu5z#<D!1uDaZ2Y<}QiyybK`{(a_B)s@c+U*HDj
z;Pi~WSyXOEi2l^)_5AQ~{0y#a+8Azj+5H`|$}*5Q;qv>d$ai`c865t4uOvpeoJbA^
z#;;iNn5OT12`BjRdtb$J$-2D1QsoKc8G_TBf9KcG>E?B|9dm8xkJk<hLj}(gM=j(d
zjYF!uOxDWD@n}<b6!2iY+(Oz+y^<!C{|Tr=*X3Y)&|qJMC|Bae>KA7Ymr{bldo5FV
zC0IefhPqZG$J)wPc-FVh(|)Pvd)MhBaU$HCza*(rM~CcU=(=@0@5hj1HgtA>P4C(o
zKtntQY>uCza%gNDmnLGDL4@H%$z_Uuj=1}ID~8mvenfs>pEp&i*-fS%ma~Bu;>NYw
z>1wPiby8vL<`qECl~<K$YS-&b*i?J!0?_BhptPCpHKd4~=q<aW1}#C(pUqqCflp@B
zWk*Vs3V!!GB}KiHYOMo_7Rq5#xd|HC1yQHb-wB@zs4<C3Bbe(C&lRxiSmd#a3^io3
zs2mkVIpdQqn$jcH?FV+X^P0g&61cV;*{+2I^yvQD26#scm6=14Yx2g!KmWjJWB~4w
zM1hA|A?T#7XN~h?a1OuA*TS`Dz;yraIQ4g(ce|&j(D<cY00(H4#iOZ_+bS@J6G2nE
zIh3`1AWC9I7@-jG2*B&Irb6a#jlVG@>CL0Thbpv@9t6FLiC2CegXm{zycsfCrE^V%
zc8OgsU8fch2;|nNBuT{vGi-&VmUfifLm~DrtBk6ZTR~T=c$U0&<NVf|(jLKnb`mw~
zlw<EEFK7N;S93!1DlmMobiZKIpI94SNiGvJIzA`<6mGj#eSbN>pxu6Hz+@MX2s^Cr
zwF~?<x9&WuRZ(g$?SxSO%J$w$J}(A9X`mKT3&XT>=kB?zRP&w8`8LTK>lFridr_=r
z2S#XSQu1=6W2nO0sk25;ZF#GhvXl;K|MxIHD9%kELU_xVxaE~>atGFXP1Wd|2z^pV
zTjzLKwRvSVRTj^61Pj3O%6C6kbtG#-NJMAe6219GDKvaTEB<1n<~wB8S+EANAn&=x
zz>4*&s6Ak+R<sMTY&uj%In@Unu~6?twE9Ta14v;a!<a-#Wwi1Fm^WnE7xv_g_;F=}
zd$o`oMm3y*njxQ_6Jb;gJH!g8ZfFL{lTv9?t07CWB*un|x!OoEze~kg8_(sw9m=T(
zf|atgcAIV+e}<<b>KsXki<eK2k{`Hluf&4`wj+OJ!%eI=O`%$;KUmujiGZ$Ri#d=z
ziLy|Blp;=?Fe~fFWfT`~>}ylwk;6h~(t2qJ;19K#lPMUCrhZODKfsOtb!|0m+>7U9
z^S%<e`D+SI;-0b{Af3!-e#CTBu<S}~umbKt!1jj?K`<>E(~^`v)#@2#Z4zfS@lVT=
zJ&POQm#tE*#Mb0XPDGZTf*WO_Tbqt5Xr}NaZ&twv%R@BJoe$$AC!I2Y{6SWN>okF~
zNiv?Z!(~*2V_MJS?_)kNm)H#mCMhdosA+Ig(tWZDz|6mm@CCop?4LM$T=S*dP5hh;
zfidtU+CLB*d8!b_fnJoUNTxSDxjy+Gy=gLPtrmU}UWVL1is_5-_|CC6ELm@}Y_Fz|
z#lmg`r43hdqp?3l2<0|OvXg>4(*@H73um-1;b|jUI2XeuN|xtTpv&$}uqgj$nC2Pi
zk$YA?)HYiojX|`j{0ho$VS^V}+S;)uMUI~#(QdWL#BJu3>DxM0eaSPMyj^9y!cY?$
zmTk^ykL&MchFj1gDUlW`i(KOu#>q0x0%tofC`VFB>6bVH{i8NQXgdhH&3&;8v0zVv
zO(r<!17KCw*NUC(eB{o@-{eaa_);FHLo|zR<WlRjN_q9S-4E4u?QGXBy>bVvo=n^D
zM6ktMRFHl?*>Td{y@Nhp?nI<yA`XCkiPnBhLI2JBl{%7#`?_7e`~@n(BI0K(mg&dq
z+dsBKbh)s01$jnso@TRtQYx)TP|^wcuRlNm%4YveWXw?S|IZQ`WdC31mh!~?k;wMa
zm)kn9uTY8h>%c{YAy8q7fs(w;K?tz0XfOdNKuO7~fEWl8a58NQVo?|}B2pruSQOZ<
z?$k+f_mx)*E802kC2ghURoS})N7qP)Dtp<BhYy`zmqdK$WV~yWi#PzqZAkb}uj*G#
z$aJTpf#Jf9p>E(*mjG-7f4w6zmsa~zXUx@+o^bTH5mexNF+-dBmd*F3>fxfN>s=@g
zUTK?o)1G{vTYXS(?ztSIcXbLpst6THz`pXWef-FBiA0dOb6pmDX_Qb#Hd?k84klM$
zbCR+8xfQUq<jncJ4qQitH$hSy<(MqMKh6K!rJ<SgSyEPrXFfQzoO>2LO0Ul!GBF`T
z+XIsZr+Y9DfjAc3+?H%G<61CWATv5lv-xrNPLzsG$T`2u&AqaFQxk0J>q(a=l4H-b
zAyGMhzNmnn9+oQ)(=C!Nt?m`tc))8h2&@;JEPlSp7KgzQ<?&i@JxmFQ?;mz;V^OvA
z_<8z9nIfpM!ZSn~S}*n_yAyhN2;$x0v<4F*Js6G9!7-@N4B?0E;ST9&BQ5ge{O-pI
zj53DevfiYy#E5F%ChEtk&Fd|;xE-Lud1!)R8J(8$jkNcF0!!ZUk4Hn>Kt0N6FG#}|
zh0GZ^Y43d4rRdV&_T9g0ryA-?DJMp6Zff;1^03`Pv)6V2v(uu1g+g(lQARM>3{3_u
zc!+>^GCIUU!@&e#u2+Y)#KbsrESkJVCVa4=g19sA-|Si2>N&?-J&hFuB4=!&e%72y
zfXr<ML}3A!QE)3Ud0T}qASI*+&z!@yzHZN56E@kY5~BO8-+A0!IeeRoU<!hUN|x?B
z88bf>$JkaBrDo!xhQ%IO)cBN9ug9x2In6>9K#-caMV`;`9NZ&6*lu1?5o0CU(PErw
zVt_A=)=0PvDFYH_Y9laTVhSP}BZ^9_Q4FpJCU<PIu4qAg6qHtP3al}q#~~@}kWY;k
zuw-KLP;Iu+8uOyFph`!%5gWK+q@$%GQv9C5Qes;cns<8|s=Q_|sAIBaP`)j<vZY>Z
z;HL{9adzWp?yW$!BAB8{`zSYq?jBz+Mu(g?OK%N^w!V>5!^TSa;l+8sQYj4B_#{Fg
zmW)P7TI|A?)(j?`2m>;Y?*Ylt*a;7*sPP9|9<2G10p15W&3Qz%ycCeHiF!Vh2Uwvi
zI0dN)*m@VPu`w2TZU(ku=yy1!U=QI}?K{k78v#)rb(RQ9$SE9Nlcel%DsYru2nT+b
z+3nREj26vHwcyo3dRrdh70KjJmZkhLOai#mgqAB;PBJi<bQ#DEBT}z%EHv;2J~-Ha
zeo=6ynMlmXL<}x;uPZmCV2v)s)<t?klP^uC|EoJo2cTA^XUKUx3+%I{zND9yC@}2P
zc<F>{$JK}sifl0!5%qf&?80_9GI*+7tAhgaWElwe3^xcCUbiI3*fdBr%^O#I1zG<i
zc7%O4`Y%eGg=O_H3U)v^ta~WCU8*&2fnc#+H`=;lV@Co52gtR&5}+Q&8AA8oRX-+&
zDfCQ_isI(xXgyZaP)izLCwwuAHtusX&tNf!PVlRPSN?>NUDxBQz=u}o>NEWAI^l0}
z;v|r=NL7k-YZw7EKx`%IuT=ayYtWwF$wOSJ_5fc`!Zkj(0|7DS%^bjME+n_?Ny$Pq
zt)v<eANDz;Z8Zn&7dzu89`O>u9FAjm;L6552a#^tC$fIDD%pH;^fk@Mq86585#Hy^
zkazrG5&g^2{Rhzy4Mu%U+auBw0OUGa?I~IC9O+zHVJw8YBc|6Smez;+i7oK~4Ez9Z
zbug|7?6m$sf=+`BK1m1#Z(kF_wcDFl&})4J)<*?C;geP1`oOz=qr0BRYtGrOcR>Cf
zv2|OyHwnH+GOTr$gek+Rd-o8>LlOYO{UWZzAvmWZeWTZ>>n!zS>UM9S&8KizndUCF
zuHFH_0WdZ6L^|*ha8I+2<=1&O4p4?*{%zLzx9>H&n;QKy>7<}q9sV~-=YI#|{O@3#
z{~e6;zk_l9cQDTX4#xT4!8rdr80UWn<NWVnoc~`Qj008s&n^4c*3qi!m_vTIna-0w
z<5`BG&kRtWtq_zDseX-5<*&yC8Y@aeOiO<(CALgbD`<@HwYtf}4U)AnidkS_E7mHV
z3$>cXMGve*rV8QY4Wnk12{24+IU4dj=(uwT1DYKoB&U5R`{u2&V{-KP@NVdVft<uU
zIS%*8;`VA|%dI_6s{ix%{6<rz8NYV<um^*VBXvSAUcl}3{0d*A>HR3Vkc0CZ9;{4;
zz88MpB}XAgzLrty<M^3y{w&!E&2W7eWN8cUiK}g>l0#y?9ctmfI-Jc~%DFm)I(RK7
zbMxpSQE2@&aQJg_`tVv9lx}71dC%=@-t)R;`+lYA)MZA1tw}Tmst_<0GIay@QKeXH
z3aW7Lq#@>#&eQw0N>`1x=6Dc?5e()eO_*9F?~9{vb@!Ac?CPZ>frCv*xIuK8HA$cn
z9I({O+xhHM)e+z0jU7k&VP-tb=2;&xaZ2F2ynW7k)+MuwcTWvnG-|X3_s)Q3n-^AA
zl$H>FAQf&C7!EiWax_c=RGW(F!Hw%n228z&<uQ4I?_z8F8Xw<V+KW(&HQ>gNU{+4v
zpVpwq&ewRXgiO|X&9ZJ!$R$W~ifZAEK<_^uG4gegeqKrc^5UDoV1CPi2e<!+{zeQ8
zZyee(T>lSNv6{kuOoJTk6<(~bip_^`!1?@qB3zh9CIq_1NRRk#dzV=Bb?Zq!yboH|
zA7G;nWb7xb94WM}F>~dym8E`gSVQTuy9P3dPddy8wv~xu0-^<#@wL#LWb@jvuJYpM
z(Ap><>}m*?UY0+O3*6|m7hHd+kF9eu!yYnWV1YV>g6y4*5n*a;2w2Nr&U8brtK5-t
z(`5L#_(2Tix<M3cYSY*n)|YH}HVUYAI%6kye&DxH=e)tg6p*&10LL3!lhZfSl{8`@
z?(~pmDiO@@8vpUT9<B`O{e-8lmp2c0j*#X=;k}S3qwA+m)2!>I&j~#<EbtR{VB{Wy
zB~1%M3g>7=c@XKD@)X$dBakL_sMzgM`!64|6Re(VFOsPQ0?+t^_!tcHP|Ebn0gZuU
z1CB)qB6VCNEsdsqIffH0Y!)S>C#OvGh|La8)FRi+eVTFW6%uCs4l?&qJ`Z~BjG}qf
z$+B%r;nTM-$X-G1-_XM3S^=soAJvLS_qY_131W73c^gs&H@roOJiq9P*8<bq<tYef
zXtAB<cwTC%S0{%IPMMTkt5~oYUy*rzh0!=PVd};)^v0mo|C(`_wKjdIw@v;=!{ZJ$
z+0h}NEP)*&j{*i!$O48mX2-00po+Y>R&#xPqjUX?j3$&(z@N(cBMOcoiGQ#N_jgje
zx1EDol@b<qijus!kLWy(Izit!o0&rJ>Kt^0aN#)J5SC)6Q@$EFQ?Dgq%Wqgt8G2-4
zA#P4j?Y0b;9dfx8j@?((_{!OxbbJj}&3uWJu){#h+W}kCs|AZ2wiP0aQ2zp}NV#Gx
zWzoS4xqMHNDR=WdQN|5PiQ64407-x2IC9auk!(uo^UyXjeeG077<i?-gPUb+>I_lL
zA~_CEZ%y!)8b_t6q3<DwOV*-%MSMwN5BSV?a!HIiNXGPIr;ALp%VPTH>gD3{n*+Xw
zlgLg>74%R`Sc$e?=<|93wzP>KP~NAI)@R*tL<lo<VnyQeBH!&c#b-BQeCQ!VpxX1y
z;_zCmvn7{!{r<~bB=A76eUGK%5ycif422`KW|K;>v@|f1H7_7AKq2T|o)+-X2ZnMs
z`YPn+lf3RB>Sp3p6pY`ge0C(O3Mmz|0s=9%5OJ_Hc|Swyv9#D|HU;6_-In586(WnS
zkWik+p07TP&-~LWt5pg3j^}RMTQ&g#a$E|Cd0#}ROErm0Z8c!>aCA;y2jQLvV3rt8
zGlZ9DqY%he`p@<gMK@FuJ_H>VB%hs|o*qoCiJH|r>lW#3)jo>{$ZR4gX}iVixlj%=
z$hLSM(5DHb!XEGIeH&Sw@NQ*bd&M*ez8QcdB*Df4Oryc6G#Kb(6{vY_`LYWj1Y0!Y
zDhn|_6Di4)0*Rb97qc1&{%-T~pht&0w#rN~HO4Aa#Kw-}M4OO^%bq+HHX&EXzP;J;
znSfzwIL(4x;`amOq{EfS2yYpj89CIK28&2v0kALb1k7kk4lBr@VB491M*4EgrIDf>
zUFp#s#elUz9m<4gc^e95*l7+)k=_OeV_YFk<?@XnJ_&)V4=?7TslIRREy_|?v7)(F
z`i&Z%Ia%1gf!9QSL7P%_`AD04-j{VGg4i2GlK9NocV_eY5em>Xxc_V-jb8HUzK&=3
zx04K103ZeRk9{2=7zW_aogH)~k$>#$fc<l42NnPU`0<hzQxT$*k`rfm82wp#BI`%4
z4Em=(UKl^f`2JlgD<mf+E~czPFDw3((3lHHYzhtlU_t=^NIwuhf?h&S#>y6k4yN?R
zHipj5Pqou?akPsddv~D!yb<!R%Ng`nVMAwAc2*I46H}*O%d<NSGDJZQ?*e~nd=xB5
z?&{)VZ>Mf)Vs7d}#`J4KVV$b7G)TP$2>_t|KtM(Kk??ChcJbZ1)*st3xBvj&5BfLA
z0Dy?0otvTaKP`~;{PWjegF*>K75PAtE8?ey@Z<jo`n7(&Hi7#s$Q3CNe||vXUsu};
zklw=7*jm`$<M+-`MIxiP2Qf?_pSrW0{wd?vgstwO3u2Hv^B|x0=Pnb7VCiIRWBQxn
zV7T((0u>}ZgMDg%6dOoxZ);@#9}IYjdlFa*YC;IaQ$i*;03d2<Xk%~wdnYv5&xRm_
zn$Y}{6GHi(5SV{W;9ChWAAtb?z)_!e<-FjJgkS56$i%FXKyQsj_2)kAzpgc@KlIKH
zhAzeye-{(IQxQ>|Ap0kO8qu_R0Dzc{jirP0@A?2=3NDr(<UtIGr(IZR2+}(_**pE&
zgkQ_cQUy^hKyObB_0)aDCIEoArHzfL$?xZcO$9w^3J{?Z)Bx-s2xI1d5&q*yf~V*{
z76w6<ApiV=;lD0+>%SoX*%u6~wOj)rN<7q4N~hgl6a{-5Pjh>_-%#x8xJQ{llmf^<
zpC|OMYsBd<ijt|Zi=myl&EFvWh#V~$L5Ow`0`~_5pW9D}-<VQyToU8}{^!ksA2|)4
z|BqwuYWEM=Z#a6Tf#{AP4ljs9_yfn*=O@m8G749?k>?T!0GNS4ow{BG`~&7<>IC}v
zk6YM(H|o(yaHwAX@tk?^Kc6Q5ugeUyM*PPe@c$+qq;(mJ&432JI_%T2cNOvr%-?iY
zF2nI6$POgvr|m(F`X@xj(8$#0cZ{)Nv&mQxBNpoE96%rUPsVRN+A=B%C;|-?Z@8y1
ze3J+O{Kq$6g?{#r4j~7BI)$vH{UP_XcXbiAclz7TFs@z$^8|GU5aOxvm~Z~li`&?{
z|5`mXU{8h%QvWfF{HPw!`b#b0WNGqiHEDvE%>hWw4r)H~4{EYpklNDjcYbqxKS44B
z5}!jnja0dUKg7;1|1pQ+aizE(fGoFxeu^+Hev0^;{NWk<X<`v1cR~L1i!%SZQp%qo
zehrvLQSDv>_1`qu(>eHE?VkWsJ5whW3nx%O{hIK`o!d+vq<#Q@YQl$lP*rGZ=PGRI
z^g9#iLNYe%K!7HQr*)BG)1Lq-7gO7RloY@Br>mD(G!Y2$0_JI8>$d(9^lQvUQ>Uy1
z$exj(=9vD@e_?)aO6f_U!X?<B#m$dymG61V_%(r9AXl9XMCku%XovUzN%);wxaA5c
z2~ykrRO0Oog4CX(_QtNZrgkoW&X~VuXur(reE<y&jGsc=ZR8KeAM@<*^aoDwz;8h|
zY(PG3LH!uW56T)sCWa1wt9Frb^w$Ha!GEeP4kkcL6GOY-&r9#BK0eC^8O{LpG`1r@
z{2_O-_)ToDyQdNLfyBX3Pg`y}3ljgwES}rp>pcOoo%g3KZn5}>-oe%3KXqUVn6=a&
z9Y_rEG`o0y1|gj6&7Dl0o&Q5*&D*dOmV+RL5KjXFY83!bGBmNY|8Fwg)CPFZcM!(<
zrz-1m{TG;DL#)s!oLE3Ut^X+^7`H%>|04HCFt_4Zg9sEqm5W7RL4^OJ6!GGn3;Tn>
z2=&w-O8fst_)mr`IpH%Tg8Y&2Q*c2XgI34JPWCo7e+<yy254PEqdtg14PwCm!1#0u
zV*LG^FPP4;27!c*AR);QLZ@?((8dy!YX9oaKY#mc68|+XDZe-u4&;-NpVk0kS3mN8
zt;ZfpHYEVrqW{yfJnj~x|HG%so*)Bk|7Myqby2VYO)_FX<)3elAh`obW1((oXJYUE
zccZiE3}$2()PRYff;9yQ{DJUmeS*qc75;w?%pZfb6Y?K=OPBxDnX^5oIANdxHAVY0
zKm=ex2v0i~Lk~$ya|;{L>u)DKJf!p25TL257x(D`0-p325RqR~eAtnCWkIdM`Dq!V
z$_xak7#bOYmLdPIIe+KV&Un%ZIuKzD{^<z+%Jwtm*9=}#AoL2zl5wb~3{74T!_>n?
z2vk)3-VXkS<nbEN$SC+J(q0Mv#Q2*M2~({3EiXtf2mLf)97KL%h}hfO8rqo%8M|28
z+x?n1@*bS#k4d!}#H9FvcPH@^PZAV+_D-O5>u&cu=8AgieJzOD3}TY~z`T+EJEp3`
z?}&ldL6v_b-)|ry`47Yg*`J8cF8^O+=N=SQ702-fdE>5@(;y-Y1_Y@HGV*FPO9QcR
zfRKcOblJV&%H6#?yCAL+QUckiBW5K5HDYPtAXqT|p^_wsB{CWj;`mC;Qt*{iNu<&5
zwz1svJ7=#Ae=^_C`Q3AVuXFC*dm+eSvo4=04qCpuKMcrgROU%cVIg$}d0yDBv(*R0
z+~<Wu|NZ5d$0n4SdJc;xIA2mlvV4`55U=BSt-OyJT~_wJ1CVG6V%E?QJ5E;h;ET~g
zfMiffWMK{kVI!1Vs|s301m)|z&Wd<++zvYjg@`e?klIe_d5U4@QuHVIox}gNuKomL
zn~`E9Sd5%W4Su-RPPyW9s(5cP9|3JTLHof>(Zpj<lfC%~N?D-23YDT1Xu$+2rjS7z
z>u}|LFi_$5niej$LfkeGP@{zbO@lI`&gQu|t?m)viuQoaU0`V?b?OmXM1f!Cw1QkP
z4<wtbs{yv1f=w%-V4{t3u#)zLebXV{YJ+juIhJA=oA9$&dyv?E%y7fK^{PrML8gBx
z`QupWewgukCw#1=`WVDQF7#girzvfiTK%W!rbg=2Zo)1WhfO*9#+A}3Fta7jc=P)F
zry@n*v*latzB?M-dN3o%iQ0hgbx>IQj(C$=&)K_<$hi38C%}S6%7Wy25@07@8;k?m
zbt<ULzPJI~+du%=a$Q&HUNwxp%mcSiS%=5uaud+)k>@u@TuX2UC87Vj%|W5IE&*HG
z?6s|;1tNOX5np=lagd6RB<}-n`s^Nvg+VWS<4eyxK>+M@2FC*{8ex3#42ayI_Vzj`
za?MHEYhX8EZ}3YWEvah)^?6F&)+bThS+)8_Bbpotzh$xbPT2nbaWz}JX>otkx3E^P
z2jKWix&_(-otZPOWhEx@$?gk-=k_?c!=$_6a+juX9DB}N!*gnr<j1lYq91B}<t+dd
zxnZaI#GQn&^_iRJ#OT54Ry*T5wes<Cy<oJ+*zn`In$mjEe@5Lunmm<Yu;u-mvO3p6
zJ~g}GiaqQ*E-%QJvEc0u$8zIf^yjDpj^;oqg01#VxRL%UIB%K~=i#WCHnmpB&o!wn
z*00fG!tJv+D>s6=m?HE<V*=ZTBkB)5PlNiT5>LX;IFi6|2DTBwTK;r2cyNRYBkEHr
z1lx+y4?<>lg9YCxaUKZBmLg1?mTg1rmZX+NF#ZA+2Fx`g0NaA)MTrTWF#6X@?2j$Q
zQh<fyd7+SPgkPCs>MhV;rx;&tp&4vDuIfGJ?E{D0L+zRFRM{9DG#@fvd8)F!c{1od
zU2t4ntR)z1`S%-|3cA3dJDqW_F}uzt&k=aoF@$P(!OUr8Y^mI_xS<0;N2z;JFEp}Y
zY|e}xWr9EC8Xq@oRB{XE2uA42<cv}^g=gG?2Kl-xHmdaq8^-1gKm7dAv%rXT#pl-d
zIwTxJerUEJ<jELxW?IvwW`HzOUAyHJ4PrA|%d?8aO4R3wGqSPQ#;}HQI7|ObM&!~I
zC<}@1*oMt#ZF-#{N07OWUpn_)HGp2{jy=!+3c+B@&#NAmC4i$WruI<XgEqN=E0nR|
zz_bgk>ClX%Qg@Tm?@AGD^_ueePlrPrG|K}Y58nPws!m**nk-|)j-S@MhAdGi{FYF+
zbw)8}ZbS?Vk$R-L&J~iGqY7vCGw~BJf|-q+?&g{zpg9PggbChhm=MAAh|5EnOLJf*
z)E=0yRf`GiiHLe~b^LvZjC($q5Gi0n)I1hp;IG{)9zaywcg4+$VY7{3RKrG0W<9nK
z)lQiYi6fe7R+@H@5Vrosuw<@gB9z35IA6@F8P|))@tijM-*%VHIkzX^>_rIAeyU-d
zRBz*mHIBI)?`j&uMj)_$cgM~-vq7RZ=c`R})giF0@I5cF)u&c9?;yt5iLn)VH;cfC
zLU-)m9c|-;0)vbZ((fsfGqLfc6v1|F>34ZZbw|Hc%^q9&sRA<59U8Ey(U*KML;A96
zGSOYTK`_{I>3a{!t!wbzaXEg!HKs^kfI~JtJ|l?221wsIK+Z(ElamcVzBLCkq`x2~
qXW}VOg29$cA5<ilvgR?H-1ei><d>XX#Q#;pUss4iksknQUhxlov~*ek

literal 0
HcwPel00001

diff --git a/guiserver/guiserver.lsp b/guiserver/guiserver.lsp
new file mode 100644
index 0000000..5e80533
--- /dev/null
+++ b/guiserver/guiserver.lsp
@@ -0,0 +1,3122 @@
+;; @module guiserver.lsp
+;; @description Functions for programming GUIs and 2D graphics.
+;; @version 1.14
+;; @author Lutz Mueller, December 2007
+;;
+;; This module has been tested on MacOS X 10.8 and Windows XP, both with the
+;; Standard SUN Java RE v.1.5 (runtime environment) which came pre-installed on
+;; those platforms.
+;; <br><br>
+;; <h2>What is newLISP-GS</h2>
+;; <tt>guiserver.lsp</tt> is a module for interfacing to <tt>guiserver.jar</tt>
+;; a Java server application for generating GUIs (graphical user interfaces)
+;; and 2D graphics for newLISP applications. The <tt>guiserver.lsp</tt> module
+;; implements a newLISP API much smaller and more abstract than the APIs of the 
+;; Java Swing libraries which it interfaces with. Because of this, GUI applications
+;; can be built much faster than when using the original Java APIs.
+;; <br><br>
+;; <h2>Requirements</h2>
+;; At the beginning of the program file, include a 'load' statement for the module:
+;; <pre>
+;; (load "/usr/share/newlisp/guiserver.lsp")
+;; </pre>
+;; or on MS Windows:
+;; <pre>
+;; (load "c:/Program Files/newlisp/guiserver.lsp")
+;; </pre>
+;;
+;; <tt>guiserver.lsp</tt> expects the server <tt>guiserver.jar</tt> to be
+;; installed in <tt>/usr/share/newlisp</tt> on MacOS X and Unix OSs, and 
+;; in <tt>C:\Program Files\newlisp</tt> on MS Windows systems. On Win32 the
+;; standard environment variable <tt>PROGRAMFILES</tt> is used to find the exact location
+;; of non-English installations of Windows.. Both, the <tt>guiserver.lsp</tt> and 
+;; <tt>guiserver.jar</tt> are installed by default when installing newLISP with one of 
+;; the binary installers available.
+;; <br><br>
+;; <h3>Architecture of a newLISP GUI application</h3>
+;; A GUI application in newLISP is composed of four parts:
+;;
+;; <blockquote>
+;; <em>initialization</em> - this means starting the newLISP-GS 'guiserver.jar' and initializing 
+;; communications with it. Only one function call is required to do this.
+;;
+;; <em>building widgets</em> - in this step windows, buttons, text fields etc., and
+;; all visual aspects of the GUI are described. newLISP newLISP-GS offers a wide range
+;; of different control widgets.
+;;
+;; <em>defining event actions</em> - in this step all the functions are defined to
+;; react to events coming from the GUI as a consequence of button pushes, keystrokes,
+;; mouse-movements etc.. These event actions send many commands back to the GUI
+;; to change information for the user, popup dialogs etc..
+;;
+;; <em>listening for events</em> - the newLISP program sits in a loop waiting for
+;; events and dispatching them to the defined event actions. Only one function call
+;; is required for this step.
+;; </blockquote>
+;; <br><br>
+;; <h2>Example</h2>
+;; The following example application shows all the essential elements of a newLISP GUI
+;; application:
+;; <blockquote><pre>
+;; #!/usr/bin/newlisp
+;; ; button-demo.lsp - demonstrate the button control
+;;  
+;; ;;;; initialization
+;; (load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+;;
+;; (gs:init) 
+;;  
+;; ;;;; describe the GUI
+;; (gs:frame 'ButtonDemo 100 100 400 300 "Button demo")
+;; (gs:set-resizable 'ButtonDemo nil)
+;; (gs:panel 'ColorPanel 360 200)
+;; (gs:set-color 'ColorPanel (random) (random) (random))
+;; (gs:button 'aButton 'abutton-action "color")
+;; (gs:set-flow-layout 'ButtonDemo "center" 2 15)
+;; (gs:add-to 'ButtonDemo 'ColorPanel 'aButton)
+;; (gs:set-visible 'ButtonDemo true)
+;;  
+;; ;;;; define actions
+;; (define (abutton-action id)
+;;     (gs:set-color 'ColorPanel (random) (random) (random)))
+;;  
+;; ;;;; listen for incoming action requests and dispatch
+;; (gs:listen)
+;;  
+;; ;; eof 
+;; </pre></blockquote>
+;; <br>
+;; <h3>Application start</h3>
+;; <pre>
+;;     ./button-demo       ; on MacOS X and Unix
+;;
+;;     newlisp button-demo ; on Win32
+;; </pre>
+;; By default guiserver.jar uses the ports 47011 and 47012, but this setting can be overwritten 
+;; either by supplying a port number parameter to the 'gs:init' function or by overwriting the
+;; port number from the command-line. newLISP-GS will then use the port number supplied and the number
+;; following it:
+;; <pre>
+;;     ./button-demo 10001       ; on MacOS X and Unix
+;;
+;;     newlisp button-demo 10001 ; on Win32
+;; </pre>
+;; newLISP-GS 'guiserver.jsr' will now use the ports '10001' and '10002'.
+;; Ports under <tt>1024</tt> should not be used, as many of them are already in use by other
+;; OS services and need administrator privileges to use them.
+;;
+;; A second method to start a newLISP-GS application starts the 'guiserver.jar' first, which then
+;; starts the newLISP application:
+;; <pre>
+;;     Java -jar /usr/share/newlisp/guiserver.jar 47011 /usr/home/aUser/MyApplication.lsp
+;; </pre>
+;; A different port number can be used. Port numbers below 1024 need administrator
+;; permissions. Optionally a splash screen can be specified as the last parameter:
+;; <pre>
+;;     Java -jar /usr/share/newlisp/guiserver.jar 47011 /home/apps/myapp.lsp /local/newLISP128.png
+;; </pre>
+;; The example specifies an image inside 'guiserver.jar'. Any other image path on the local file system
+;; can be used.
+;;
+;; On Win32 similar methods can be used replacing the appropriate file paths, but on Win32 Java jar files
+;; can also be treated as executables and executed directly without calling Java explicitly. By default
+;; 'guiserver.jar' and 'guiserver.lsp' are  installed in 'c:\Program Files\newlisp\' or any other 
+;; directory configured on a Win32 platform using the 'PROGRAMFILES' environment variable:
+;; <pre>
+;;    "c:\Program Files\newlisp\guiserver.jar" 47011 c:\myprogs\MyApplication.lsp
+;; </pre>
+;; Quotes are necessary when spaces are present in the argument string. The example also assumes that
+;; 'newlisp.exe' is in the path for executables.
+;; 
+;; <br><br>
+;; <h2>Debugging</h2>
+;; <b>Tracing commands to newLISP-GS</b><br><br>
+;; For debugging purpose put the following directive at the beginning of your application
+;; or at the place from where to start tracing.
+;; <pre>
+;;         (gs:set-trace true)
+;; </pre>
+;; Then start the application from a terminal or command shell window. Now newLISP-GS
+;; will output startup, version and connection messages and a trace for each 'gs:xxs' directive
+;; as it is received by the newLISP-GS dispatcher:
+;;
+;; <blockquote><pre>
+;; newLISP-GS v.0.94
+;; listening on 47011
+;; accepted from 0.0.0.0
+;; connecting to 0.0.0.0 47012
+;; retrying to connect
+;; connected
+;; -> frame MAIN:ButtonDemo 100 100 400 300 QnV0dG9uIGRlbW8= nil
+;; -> set-resizable MAIN:ButtonDemo nil
+;; -> panel MAIN:ColorPanel 360 200
+;; -> set-color MAIN:ColorPanel 0 1 0 0.2
+;; -> button MAIN:aButton MAIN:abutton-action Y29sb3I=
+;; -> set-flow-layout MAIN:ButtonDemo center 2 15
+;; -> add-to MAIN:ButtonDemo MAIN:ColorPanel MAIN:aButton 
+;; -> set-visible MAIN:ButtonDemo true
+;; -> set-color MAIN:ColorPanel 0.8401877172 0.3943829268 0.7830992238
+;; server shut down
+;; </blockquote></pre>
+;;
+;; Text strings for button names, icon paths and other texts are encode in
+;; Base64 strings as the first trace line for MAIN:ButtonDemo shows. To switch
+;; off tracing mode use:
+;; <pre>
+;;        (gs:set-trace nil)
+;; </pre>
+;; Even if trace mode is switched off, wrong or missing parameters are still messaged
+;; by newLISP-GS in a small message box. After such an error the application and guiserver
+;; will exit. Unknown commands will be ignored. Functions which are not applicable to
+;; certain widgets will also pop up an error message box. In certain situations a
+;; function will have no effect, e.g. 'gs:set-size' or 'gs:set-color' sometimes do not
+;; have an effect, depending on how a widget is configured or depending on the layout
+;; which hosts the widget. Sometimes the platform look-and-feel overwrites colors.
+;; <br><br>
+;;
+;; <b>Event handlers</b><br><br>
+;; For most widgets, event handlers must be defined. Sometimes an event handler is
+;; not required. In this case specify <tt>'gs:no-action</tt> as the event handler
+;; symbol. When developing programs it is useful to watch the event handler first
+;; before coding for it. This can be done easily by printing out event parameters:
+;;
+;; <blockquote><pre>
+;; (gs:button 'aButton 'abutton-handler "press")
+;;
+;; (define (abutton-handler id)
+;;     (println id))
+;; </pre></blockquote>
+;;
+;; Sometimes the same event handler function is attached to several widgets' keyboard
+;; or mouse events. Some of these events receive a greater number of parameters. There
+;; are two easy ways to discover the nature of an event:
+;;
+;; <blockquote><pre>
+;; (define (the-handler)
+;;     (doargs (p)
+;;         (println "->" p)))
+;; </pre></blockquote>
+;;
+;; The other method looks at the source of the event as it was transmitted by the newLISP-GS.
+;; This is useful to recognize the data types used in the event:
+;;
+;; <blockquote><pre>
+;; (define (the-handler)
+;;     (println gs:event))
+;; </pre></blockquote>
+;;
+;; All text from text fields are received as base64-encoded strings. E.g. the text: 
+;; '"Hello World"' would be received as: '"SGVsbG8gV29ybGQ="':
+;;
+;; <blockquote><pre>
+;; (gs:text-field 'TextField 'textfield-handler)
+;;
+;; (define (textfield-handler id text)
+;;     (printnl id ": " (base64-dec text)))
+;; </pre></blockquote>
+;;
+;; When the text "Hello World" is entered in the text field, the following output
+;; would be generated:
+;;
+;; <blockquote><pre>
+;; TextField: "Hello World"
+;; </pre></blockquote>
+;;
+;; In case the ESC key is pressed in the text field, the event handler would
+;; report 'nil' for the text field. A handler should therefore always check text
+;; for string contents before trying to apply the 'base64-dec' function on it.
+;; <br><br>
+;;
+;; <h3>Coding considerations</h3>
+;; <b>mapping or applying 'gs:xxx' functions</b><br><br>
+;; Like any newLISP functions, 'gs:xxx' functions can be mapped or applied to lists of 
+;; parameters using the newLISP 'map' and 'apply' functions. When doing this, make sure to 
+;; map or apply the quoted <tt>'gs:xxx symbol</tt>, so the <tt>gs:xx</tt> functions 
+;; get executed under the <tt>gs</tt> context, prefixing symbols in parameter lists
+;; correctly with the context prefix of their origin.
+;;
+;; <blockquote><pre>
+;;    (map 'gs:panel '(first second third fourth)) ; note quoted gs: function
+;; </blockquote></pre>
+;;
+;; <br>
+;; <h2>Some shortcuts when writing 'gs:xxx' functions</h2>
+;; Due to the nature of transfer between newLISP and the guiserver as text, the following
+;; convenient shortcuts can be taken when writing functions:
+;;
+;; <blockquote>
+;; <ul>
+;; <li>Symbol ids of components can be expressed as strings.</li>
+;; <li>Number values can be expressed as strings.</li>
+;; <li>Numbers can be expressed as floats or integers.</li>
+;; <li>String constants for type and orientation constants can be given as symbols.</li>
+;; </ul>
+;; </blockquote>
+;;
+;; Here are some examples:
+;; <pre>
+;;     (gs:panel 'ColorPanel 360 200)
+;;     ; is the same as
+;;     (gs:panel "ColorPanel" 360 200)
+;;     ; is the same as
+;;     (gs:panel "ColorPanel" "360" "200")
+;;     ; is the same as
+;;     (gs:panel "ColorPanel" 360.0 "200.00")
+;;
+;;     (gs:set-flow-layout 'ButtonDemo "center" 2 15)
+;;     ; is the same as
+;;     (gs:set-flow-layout 'ButtonDemo 'center 2 15)
+;; </pre>
+;; Although the first form is preferred for clarity and readability, in some cases coding
+;; may be more efficient using the other forms.
+;;
+;; Except for the symbols used for action handlers, all symbols are used only by their
+;; face (name) value. This means that reserved symbols of the newLISP programming
+;; language can be used freely in symbol ids for all components, e.g:
+;; <pre>
+;;     (gs:label 'name "Input here")
+;; </pre>
+;; The usage of the reserved symbol 'name' will not pose a problem.
+;; <br><br>
+;; <h2>Return values</h2>
+;; The return value of all functions is usually the number of characters
+;; sent to newLISP-GS. In general, return values of 'gs:xxx' functions do not have
+;; any specific meaning and can be discarded. Only the functions 'gs:get-version',
+;; 'gs:get-screen' and 'gs:get-fonts' return their respective data and copy them
+;; also to the variables 'gs:version', 'gs:screen' and 'gs:fonts' for later access.
+;;
+;; <br><br>
+;; <h2>Function overview</h2>
+;; <ul>
+;; <li><b>Initialization and application setup</b><br>
+;; <pre>
+;;    (gs:init [<server-port>])
+;; </pre>
+;; The initialization function starts <tt>guiserver.jar</tt> which will listen to the <i>server-port</i>
+;; and initiate another connection on <tt>server-port + 1</tt> back to newLISP. If a <server-port>
+;; is not supplied <tt>guiserver</tt> will assume <tt>47011</tt> and <tt>47012</tt>.
+;;
+;; As the last statement in the application put:
+;; <pre>
+;;    (gs:listen)
+;; </pre>
+;; This function listens on <tt>47012</tt> (by default) for event messages from newLISP-GS
+;; and dispatches them to the user-defined action handlers. To avoid newLISP shutting down
+;; when the guiserver shuts down, use:
+;; <pre>
+;;    (gs:listen true)
+;; </pre>
+;; </li>
+;;
+;; Sometimes it is necessary to run other tasks while listening for events. In this case use
+;; 'gs:check-event', which will wait for certain amount of microseconds for an event
+;; to be executed. After the wait-time, it returns. The function is typically used in a loop:
+;;
+;; <pre>
+;;    (while (gs:check-event 10000) ; check for 10 milli seconds
+;;			(do-myprocess)
+;;	  )
+;;  
+;;    (exit)
+;; </pre>
+;;
+;; The loop will exit when 'gs:check-event' returns 'nil' on communications errors, e.g.
+;; when the window's close button was clicked.
+;;
+;; <li><b>Containers</b><br>
+;; A <em>container</em> can contain any other container or control widget. Except for the 
+;; <tt>menu-bar</tt> and the <tt>split-pane</tt>, containers can have a special layout-manager set 
+;; with one of the three layout-manager function commands. By default containers have a flow layout. By
+;; nesting different containers and using different layout-manager settings, complex layouts
+;; can be configured. The function/command <tt>add-to</tt> is used to add components to containers.
+;;
+;; <pre>
+;;    (gs:dialog <sym-id> <sym-parent-frame> <str-message> <int-width> <int-height> [<boolean-visible> [<boolean-modal>]])
+;;    (gs:frame <sym-id> <int-x> <int-y> <int-width> <int-height> [<str-title> <boolean-visible>])
+;;    (gs:menu-bar <sym-frame> [<sym-menu-1> ...])  
+;;    (gs:panel <sym-id> [<int-width> <int-height>])
+;;    (gs:scroll-pane <sym-id> <sym-widget> [<int-width> <int-height>])
+;;    (gs:split-pane <sym-id> <str-orientation> [<float-weight> [<float-location> [int-divider-size>]]])
+;;    (gs:tabbed-pane <sym-id> <sym-action> <str-orientation> [<sym-widget> <sym-tab-title> ...])
+;;    (gs:tool-bar <sym-frame> [<bool-floatable> <int-hgap> <int-vgap>])
+;;    (gs:canvas <sym-id>) 
+;;    (gs:window <sym-id> <int-x> <int-y> <int-width> <int-height>)
+;; </pre>
+;; </li>
+;; <li><b>Labels</b><br>
+;; Labels can have text or an image or both. A normal text <tt>label</tt> can have an icon
+;; added to it and a <tt>image-label</tt> can have text added to it. Labels don't initiate
+;; actions and can be placed in any container like all button-type widgets - buttons, checkboxes
+;; and menu items. A basic set of icon images is built into <tt>guiserver.jar</tt>,
+;; but user-supplied images and icons in <tt>.jpg</tt>, <tt>.png</tt> and <tt>.gif</tt> formats
+;; can be used.
+;; <pre>
+;;    (gs:label <sym-id> <str-text> [<str-align> [<int-width> <int-height>]])
+;;    (gs:image-label <sym-id> <str-icon-path> [<str-align>])
+;; </pre>
+;; </li>
+;; <li><b>Control widgets</b><br>
+;; Except for the passive progress bar, all control widgets fire action requests to
+;; the newLISP program. These requests must be served to avoid error messages but can
+;; be defined as empty functions, if an action is not required:
+;; <pre>
+;;    ; empty action definition
+;;    (define (my-button-action) )
+;;
+;;    ; action handler printing the name of the button pressed
+;;    (define (my-button-action id) (println id " has been pressed"))
+;; </pre>
+;; All action events calls carry information about the widget, that initiated that the event,
+;; and event parameters like keystrokes, slider positions etc..
+;; <pre>
+;;    (gs:button <sym-id> <sym-action> [<str-text> [<int-width> <int-height>]])
+;;    (gs:check-box <sym-id> <sym-action> [<str-text> [<bool-selected>]])
+;;    (gs:combo-box <sym-id> <sym-action> [<str-item-1> ...])
+;;    (gs:combo-box <sym-id> <sym-action> [<list-str-items>])
+;;    (gs:image-button <sym-id> <sym-action> <str-icon-path> [<str-down-icon-path> [<int-width> <int-height>]])
+;;    (gs:list-box <sym-id> <sym-action> [<str-item-1> ...])
+;;    (gs:list-box <sym-id> <sym-action> [<list-str-items>])
+;;    (gs:menu <sym-id> <str-text>)
+;;    (gs:menu-popup <sym-id> <str-text>)
+;;    (gs:menu-item <sym-id> <sym-action> <str-text>)
+;;    (gs:menu-item-check <sym-id> <sym-action> <str-text> [<bool-selected>])
+;;    (gs:progress-bar <sym-id> <int-min> <in-max> <int-initial-value>)
+;;    (gs:radio-button <sym-id> <sym-action> [<str-text> [<bool-selected>]])
+;;    (gs:slider <sym-id> <sym-action> <str-orientation> <int-min> <int-max> <int-initial-value>)
+;;    (gs:text-area <sym-id> <sym-action> [<int-width> <int-height>])
+;;    (gs:text-field <sym-id> <sym-action> <int-columns>)
+;;    (gs:text-pane <sym-id> <sym-action> <str-style> [<int-width> <int-height>])
+;;    (gs:toggle-button <sym-id> <sym-action> [<str-text> <bool-selected>])
+;; </pre>
+;; For all button widgets, and the check box and menu-item widgets, icons can be set using 
+;; the 'gs:set-icon' and 'gs:set-pressed-icon' functions.
+;;
+;; </li>
+;; <li><b>Placing components in containers</b><br>
+;; For the flow and grid layouts the components are added in the sequence they are listed.
+;; The grid-layout fills the grid row by row starting with the left most column. 
+;; <pre>
+;;    (gs:add-to <sym-container> <sym-component> [<sym-component ...])
+;; </pre>
+;; For the border layout an orientation parameter is specified as either <tt>"north"</tt>,
+;; <tt>"west"</tt>, <tt>"center"</tt>, <tt>"east"</tt> or <tt>"south"</tt>.
+;; <pre>
+;;    (gs:add-to <sym-container> [<sym-component> <str-orientation> ...])
+;; </pre>
+
+;; </li>
+;; <li><b>Summary of commands</b><br>
+;; Most of the commands set special attributes of containers or control widgets. 
+;; Not all functions can be applied to all containers and control widgets. A wrong
+;; application will either pop up an error message box or do nothing.
+;;
+;; Some functions will work on certain widgets only in certain situations. For example
+;; <tt>set-size</tt> will work not on components in a grid layout but on components
+;; in a flow layout. Some widgets have a preset background color which cannot be changed
+;; or is overwritten by the current 'gs:look-and-feel' settings.
+;;
+;;	<pre>
+;;    (gs:add-list-item <sym-list-combo> <str-text> [<str-text> ...])
+;;    (gs:add-separator <sym-menu-tool-bar>)
+;;    (gs:add-to <sym-container> <sym-component> [<sym-component ...])
+;;    (gs:add-to <sym-container> <sym-component> <str-orientation> [<sym-component> <str-orientation> ...])
+;;    (gs:append-text <sym-id> <str-text>)
+;;    (gs:check-event <int-microseconds>)
+;;    (gs:clear-list <sym-id>)
+;;    (gs:clear-text <sym-id>)
+;;    (gs:copy-text <sym-id>)
+;;    (gs:cut-text <sym-id>)
+;;    (gs:destroy-shell <sym-text-area>)
+;;    (gs:disable <sym-id-1> [<sym-id-2> ...])
+;;    (gs:dispose <sym-id>)
+;;    (gs:dispose-splash)
+;;    (gs:enable <sym-id-1> [<sym-id-2> ...])
+;;    (gs:eval-shell <sym-text-area> <str-commmand>)
+;;    (gs:find-text <sym-id> <str-text> <sym-action> [<str-direction>]])
+;;    (gs:frame-closed <sym-id> <sym-action>)
+;;    (gs:get-fonts)
+;;    (gs:get-bounds <sym-id>)
+;;    (gs:get-font-metrics <sym-id> <str-text>)
+;;    (gs:get-screen)
+;;    (gs:get-selected-text <sym-id> <sym-action>)
+;;    (gs:get-text <sym-id> [<sym-action>])
+;;    (gs:get-text-position <sym-id>)
+;;    (gs:get-version);
+;;    (gs:goto-text <sym-id> <sym-row> <sym-column>)
+;;    (gs:insert-list-item <sym-list-combo> <str-text> <int-index> [<str-text> <int-index>])
+;;    (gs:insert-tab <sym-tabbed-pane> <sym-component> [<str-text> [<int-index> [<str-icon-path>]])
+;;    (gs:insert-text <sym-id> <str-text> <int-pos>)
+;;    (gs:layout <sym-container>)
+;;    (gs:load-text <sym-id> <str-path>)
+;;    (gs:no-action)
+;;    (gs:paste-text <sym-id> [<str-text>])
+;;    (gs:redo-text <sym-id>)
+;;    (gs:remove-from <sym-container> <sym-component> [<sym-component> ...])
+;;    (gs:remove-list-item <sym-list-combo> <int-index> [<int-index> ...])
+;;    (gs:remove-tab <sym-tabbed-pane> <int-index>)
+;;    (gs:request-focus <sym-id>)
+;;    (gs:run-shell <sym-text-area> <str-commmand>)
+;;    (gs:select-list-item <sym-id> <str-item> [<boolean-flag>])
+;;    (gs:select-text <sym-id> <int-from> [<int-to>])
+;;    (gs:set-accelerator <sym-menu-item> <str-keystroke>)
+;;    (gs:set-background <sym-id> <float-red> <float-green> <float-blue> [<float-alpha>])
+;;    (gs:set-background <sym-id> <list-rgb> [<float-alpha>])
+;;    (gs:set-bevel-border <sym-panel> <str-type>)
+;;    (gs:set-border-layout <sym-container>  [<int-hgap> <int-vgap>])
+;;    (gs:set-caret <sym-id> <int-offset>)
+;;    (gs:set-caret-color <sym-id> <list-rgb>)
+;;    (gs:set-caret-color <sym-id> <float-red> <float-green> <float-blue>)
+;;    (gs:set-color <sym-id> <float-red> <float-green> <float-blue> [<float-alpha>])
+;;    (gs:set-color <sym-id> <list-rgb> [<float-alpha>])
+;;    (gs:set-cursor <sym-id> <str-shape>)
+;;    (gs:set-editable <sym-id> <boolean-flag>)
+;;    (gs:set-flow-layout <sym-container> [<str-alignment> [<int-hgap> <int-vgap>]])
+;;    (gs:set-font <sym-id> <str-family> <int-size> <str-type>)
+;;    (gs:set-foreground <sym-id> <float-red> <float-green> <float-blue> [<float-alpha>])
+;;    (gs:set-foreground <sym-id> <list-rgb> [<float-alpha>])
+;;    (gs:set-grid-layout <sym-container> <int-columns> <int-rows> [<int-hgap> <int-vgap>])
+;;    (gs:set-icon <sym-id> <str-icon-path> [<int-index>])
+;;    (gs:set-look-and-feel <str-look>)
+;;    (gs:set-resizable <sym-frame> <boolean-flag>)
+;;    (gs:set-pressed-icon <sym-id> <str-icon-path>)
+;;    (gs:set-selected <sym-id> <boolean-flag>)
+;;    (gs:set-size <sym-id> <int-width> <int-height>)
+;;    (gs:set-selection-color <sym-id> <float-red> <float-green> <float-blue> [<float-alpha>])
+;;    (gs:set-syntax <sym-id> <str-type>) 
+;;    (gs:set-syntax-colors <list-rgb-comments> <list-rgb-keywords> <list-rgb-string> <list-rgb-number> <list-rgb-quoted> <list-rgb-prantheses>)
+;;    (gs:set-tab-size <sym-id> <int-size>)
+;;    (gs:set-text <sym-id> <str-text> [<int-index>])
+;;    (gs:set-titled-border <sym-component> <str-title>)
+;;    (gs:set-tool-tip <sym-id> <str-text>)
+;;    (gs:set-trace <boolean-flag>)
+;;    (gs:set-utf8 <boolean-flag>)
+;;    (gs:set-value <sym-id> <int-value>)
+;;    (gs:set-visible <sym-id> <boolean-visible>)
+;;    (gs:undo-text <sym-id>)
+;;    (gs:undo-enable <sym-id> <boolean-enabled>)
+;; </pre>
+;; </li>
+;; <li><b>Special dialogs</b><br>
+;;  These are standard dialogs for opening and saving files and for choosing colors.
+;;  Each dialog when closed fires an event for which a handler function must be
+;;  defined by the newLISP program. 
+;;	<pre>
+;;    (gs:color-dialog <sym-parent-frame> <sym-action> <str-title> <float-red> <float-green> <float-blue>)
+;;    (gs:message-dialog <sym-parent-frame> <str-title> <str-message> [<str-type> [<str-icon-path>]])
+;;    (gs:confirm-dialog <sym-parent-frame> <sym-action> <str-title> <str-message> [<str-type>])
+;;    (gs:open-file-dialog <sym-parent-frame> <sym-action> [<str-directory> [<str-mask> <str-description>]])
+;;    (gs:save-file-dialog <sym-parent-frame> <sym-action> [<str-directory> [<str-initial-file> [<str-mask> <str-description>]]])
+;; </pre>
+;; </li>
+;; <li><b>2D Graphics functions</b><br>
+;; Every call to a 'gs:draw-xxx' or 'gs:fill-xxx' function will create a new graphics object, which
+;; will persist until destroyed by a call to 'gs:delete-tag'. Graphics objects are animated
+;; using the tag operations 'gs:move-tag', 'gs:rotate-tag', 'gs:scale-tag' and 
+;; 'gs:shear-tag' or using 'gs:hide-tag' and 'gs:show-tag'. 
+;;
+;; Any 'gs:draw-xxx' or 'gs:fill-xxx' will create graphics objects but not force a screen update.
+;; The canvas is automatically redrawn when made visible for the first time using 'gs:set-visible' or
+;; after a call to 'gs:update'. Redrawing is also forced when resizing the window which hosts the canvas
+;; or any action covering and uncovering the canvas. 
+;; 
+;; After all tag operations redrawing is initiated by default, but it can be forced off by spcifying 
+;; 'nil' as the last parameter in a 'gs:xxx-tag' command. Suppressing immediate redraw is useful to avoid 
+;; flicker when a batch of tag operations is performed.
+;; 
+;; Every graphics object (line, shape, text, or image) carries a group tag. Objects are deleted
+;; using 'gs:delete-tag' and will disappear immediately from the canvas. Using 'gs:move-tag'
+;; lines, shapes, text and images can be moved to a different position.
+;;
+;; <pre>
+;;    (gs:color-tag <sym-tag> <list-rgb> [<boolean-repaint>])
+;;    (gs:delete-tag <sym-tag>[<boolean-repaint>])
+;;    (gs:draw-arc <sym-tag> <int-x> <int-y> <int-width> <int-height> <int-start> <int-angle> [<list-rgb>])
+;;    (gs:draw-circle <sym-tag> <int-x> <int-y> <int-radius> [<list-rgb>])
+;;    (gs:draw-ellipse <sym-tag> <int-x> <int-y> <int-radius-x> <int-radius-y> [<list-rgb>])
+;;    (gs:draw-image <sym-tag> <str-path> <int-x> <int-y> [<int-width> <int-height>])
+;;    (gs:draw-line <sym-tag> <int-x1> <int-y1> <int-x2> <int-y2> [<list-rgb>])
+;;    (gs:draw-path <sym-tag> <list-points> [<list-rgb>])
+;;    (gs:draw-polygon <sym-tag> <list-points> [<list-rgb>])
+;;    (gs:draw-rect <sym-tag> <int-x> <int-y> <int-width> <int-height> [<list-rgb>])
+;;    (gs:draw-round-rect <sym-tag> <int-x> <int-y> <int-width> <int-height> <int-arc-width> <int-arc-height> [<list-rgb>])
+;;    (gs:g <sym-tag> <str-text> <int-x> <int-y> [<list-rgb> [<float-angle>]])
+;;    (gs:export <str-path-file> [<int-width> <int-height>])
+;;    (gs:fill-arc <sym-tag> <int-x> <int-y> <int-width> <int-height> <int-start> <int-angle> [<list-rgb>])
+;;    (gs:fill-circle <sym-tag> <int-x> <int-y> <int-radius> [<list-rgb>])
+;;    (gs:fill-ellipse <sym-tag> <int-x> <int-y> <int-radius-x> <int-radius-y> [<list-rgb>])
+;;    (gs:fill-polygon <sym-tag> <list-points> [<list-rgb>])
+;;    (gs:fill-rect <sym-tag> <int-x> <int-y> <int-width> <int-height> [<list-rgb>])
+;;    (gs:fill-round-rect <sym-tag> <int-x> <int-y> <int-width> <int-height> <int-arc-width> <int-arc-height> [<list-rgb>])
+;;    (gs:hide-tag <sym-tag>  [<boolean-repaint>])
+;;    (gs:move-tag <sym-tag> <int-dx> <int-dy> [<boolean-repaint>])
+;;    (gs:reorder-tags <list-tags>)
+;;    (gs:rotate-tag <sym-tag> <float theta> <int-x> <int-y> [<boolean-repaint>])
+;;    (gs:save-text <sym-id> <str-path>)
+;;    (gs:scale-tag <sym-tag> <float-x> <float-y> [<boolean-repaint>])
+;;    (gs:shear-tag <sym-tag> <float-x> <float-y> [<boolean-repaint>])
+;;    (gs:show-popup <sym-tag> <sym-host> <int-x> <int-y>)
+;;    (gs:show-tag <sym-tag> [<boolean-repaint>])
+;;    (gs:set-canvas <sym-tag>)
+;;    (gs:set-paint <list-rgb>)
+;;    (gs:set-rotation <float-angle>)
+;;    (gs:set-scale <int-x> <int-y>)
+;;    (gs:set-stroke <float-width> [<str-cap> [<str-join> [<float-miterlimit>]]])
+;;    (gs:set-translation <int-x> <int-y>)
+;;    (gs:set-anti-aliasing <boolean-flag>)
+;;    (gs:translate-tag <sym-tag> <int-x> <int-y> [<boolean-repaint>])
+;;    (gs:update)
+;; </pre>
+;; </li>
+;;
+;; <li><b>Events</b><br>
+;; Additionally to the event actions registered when creating a widget,
+;; the canvas, windows and dialogs can fire events as a result of key or mouse
+;; actions or when the position or size of a windows or dialog has changed.
+;;
+;; <pre>
+;;    (gs:key-event <sym-id> <sym-action>)
+;;    (gs:mouse-clicked <sym-canvas> <sym-action> [<boolean-tags>])
+;;    (gs:mouse-dragged <sym-canvas> <sym-action>)
+;;    (gs:mouse-event <sym-id> <sym-action>)
+;;    (gs:mouse-moved <sym-canvas> <sym-action> [<boolean-tags>])
+;;    (gs:mouse-pressed <sym-canvas> <sym-action> [<boolean-tags>])
+;;    (gs:mouse-released <sym-canvas> <sym-action> [<boolean-tags>])
+;;    (gs:mouse-wheel <sym-canvas> <sym-action>)
+;;    (gs:window-closed <sym-id> <sym-action>)
+;;    (gs:window-moved <sym-id> <sym-action>)
+;;    (gs:window-resized <sym-id> <sym-action>)
+;; </pre>
+;; </li>
+;;
+;; <li><b>Built-in icons and images</b><br>
+;; The 'guiserver.jar' file has the following icons and images built in. Each of
+;; them is prefixed with the path '/local/'. For example '/local/newLISP128.png'
+;; addresses the newLISP logo of size 128x128. To address images outside of
+;; 'guiserver.jar', use a normal file path suitable to your platform. On Win32
+;; use forward slashes instead of backslashes.
+;;
+;; <pre>
+;; Image path
+;; ----------
+;; clear-down32.png
+;; clear32.png
+;; copy-down32.png
+;; copy32.png
+;; cut-down32.png
+;; cut32.png
+;; dotgray16.png
+;; dotgray32.png
+;; dotgreen16.png
+;; dotgreen32.png
+;; dotred16.png
+;; dotred32.png
+;; dotyellow16.png
+;; dotyellow32.png
+;; edit-down32.png
+;; edit32.png
+;; folder-closed-down32.png
+;; folder-closed32.png
+;; folder-opened-down32.png
+;; folder-opened32.png
+;; font-book-down32.png
+;; font-book32.png
+;; green10.png
+;; info-down32.png
+;; info32.png
+;; new-down32.png
+;; new32.png
+;; newLISP-down32.png
+;; newLISP128.png
+;; newLISP16.png
+;; newLISP20.png
+;; newLISP32.png
+;; newLISP64.png
+;; newLISPsplashWin.png
+;; paste-down32.png
+;; paste32.png
+;; pressedbutton32.png
+;; red10.png
+;; restart-down32.png
+;; restart32.png
+;; run-down32.png
+;; run32.png
+;; save-down32.png
+;; save32.png
+;; search-down32.png
+;; search32.png
+;; stop-down32.png
+;; stop32.png
+;; </pre>
+;; <li><b>Predefined colors</b><br>
+;; The following colors are predefined:
+;; <pre>
+;; Name          rgb components
+;; ----          -------------- 
+;; gs:black      (0.0 0.0 0.0)
+;; gs:blue       (0.0 0.0 1.0)
+;; gs:cyan       (0.0 1.0 1.0)
+;; gs:darkGray   (0.2509804 0.2509804 0.2509804)
+;; gs:gray       (0.5019608 0.5019608 0.5019608)
+;; gs:green      (0.0 1.0 0.0)
+;; gs:lightGray  (0.7529412 0.7529412 0.7529412)
+;; gs:magenta    (1.0 0.0 1.0)
+;; gs:orange     (1.0 0.78431374 0.0)
+;; gs:pink       (1.0 0.6862745 0.6862745)
+;; gs:red        (1.0 0.0 0.0)
+;; gs:white      (1.0 1.0 1.0)
+;; gs:yellow     (1.0 1.0 0.0)
+;; </pre>
+;;
+;; Colors in newLISP-GS can be specified as three (four with alpha component) single
+;; numbers or as a list of the three RGB values followed by the alpha channel number.
+;; <pre>
+;; (gs:set-background 'aPanel gs:magenta
+;; (gs:set-background 'aPanel 1.0 0 1
+;; (gs:set-background 'aPanel '(1 0 1)
+;; </pre>
+;; All of the above statements will produce the same background color on the <tt>aPanel</tt>.
+;; <li><b>Sound API</b><br>
+;; <pre>
+;;    (gs:play-sound <str-file-path>)
+;; </ul>
+(context 'gs)
+
+(set 'gs:black '(0.0 0.0 0.0))
+(set 'gs:blue '(0.0 0.0 1.0))
+(set 'gs:cyan '(0.0 1.0 1.0))
+(set 'gs:darkGray '(0.2509804 0.2509804 0.2509804))
+(set 'gs:gray '(0.5019608 0.5019608 0.5019608))
+(set 'gs:green '(0.0 1.0 0.0))
+(set 'gs:lightGray '(0.7529412 0.7529412 0.7529412))
+(set 'gs:magenta '(1.0 0.0 1.0))
+(set 'gs:orange '(1.0 0.78431374 0.0))
+(set 'gs:pink '(1.0 0.6862745 0.6862745))
+(set 'gs:red '(1.0 0.0 0.0))
+(set 'gs:white '(1.0 1.0 1.0))
+(set 'gs:yellow '(1.0 1.0 0.0))
+
+
+(if (= ostype "Win32")
+	; on some Win32 systems the jar -> javaw.exe association my be missing, the use the following:
+	;(set 'server-path (string "javaw.exe -jar " "'\"" (env "PROGRAMFILES") "/newlisp/guiserver.jar\"'")) 
+	(set 'server-path (string  "'\"" (env "PROGRAMFILES") "/newlisp/guiserver.jar\"'"))
+	(set 'server-path "/usr/share/newlisp/guiserver.jar"))
+
+;; <br><br><br>
+
+;; @syntax (gs:add-list-item <sym-list-combo> <str-text> [<str-text> ...])
+;; @param <sym-list-combo> The name of the combo box or list box to which text entries are added.
+;; @param <str-text> The text of the entry to be added.
+;;
+;; Items are added in the same sequence as they appear in the 'gs:add-list' command and added to the
+;; end of the existing list of items.
+
+(define (add-list-item comp)
+	(let (s (string "add-list-item " comp " "))
+		(doargs (item)
+			(write-buffer s (string (base64-enc item) " ")))
+		(write-buffer s "\n")
+		(net-send out s))
+)
+
+;; @syntax (gs:add-separator <sym-menu-tool-bar>)
+;; @param <sym-menu-tool-bar> The name of the tool bar or menu bar to which a spacer entry is added.
+;;
+;; Depending on the OS platform the separator may not be visible and only occupy space before the next 
+;; component added to the tool or menu bar.
+
+(define (add-separator bar)
+	(net-send out (string "add-separator " bar "\n"))
+)
+
+;; @syntax (gs:add-to <sym-container> <sym-component> [<sym-componentl> ...])
+;; @param <sym-container> The name of the container to which components are added.
+;; @param <sym-component> One or more symbols of the components to add.
+
+
+;; @syntax (gs:add-to <sym-container> <sym-component> <str-orientation> [<sym-component> <str-orientation> ...])
+;; @param <sym-container> The name of the container to which components are added.
+;; @param <sym-component> The name of a component to add.
+;; @param <str-orientation> The orientation of a component to add in border layout, '"north"', '"west"', '"center"', '"east"' or '"south"'.
+
+(define (add-to id)
+	(let (s (string "add-to " id " "))
+		(doargs (item)
+			(write-buffer s (string item " ")))
+		(write-buffer s "\n")
+		(net-send out s)
+	)
+)
+
+;; @syntax (gs:append-text <sym-id> <str-text>)
+;; @param <sym-id> The name of the text field or text area to which text is appended.
+;; @param <str-text> The text to be appended.
+
+(define (append-text id text)
+	(net-send out (string "append-text " id " " (base64-enc text) "\n"))
+)
+
+;; @syntax (gs:button <sym-id> <sym-action> [<str-text> [<int-width> <int-height>]])
+;; @param <sym-id> The name of the button.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-icon-path> An optional text for the button.
+;; @param <int-width> The optional width of the button.
+;; @param <int-height> The optional height of the button.
+
+(define (button id action text x y)
+	(if text
+		(if (and x y)
+			(net-send out (string "button " id " " action " " (base64-enc text) " " x " " y "\n"))
+			(net-send out (string "button " id " " action " " (base64-enc text) "\n")))
+		(net-send out (string "button " id " " action "\n"))
+	)
+)
+
+;; @syntax (gs:canvas <sym-id>) 
+;; @param <sym-id> The name of the canvas.
+;;
+;; A canvas is a pane for drawing and receiving mouse input events. For most
+;; applications a background color should be specified for the canvas using
+;; 'gs:set-background' or 'gs:set-color' which call the same function internally. The
+;; background forces the canvas to be cleared before redrawing components
+;; which have been moved, rotated, scaled or deleted. In applications where
+;; this is not desired but a background color is still required, the background
+;; color can be specified for the container hosting the canvas. The canvas
+;; background will then appear in the color of the container, but erasing
+;; the canvas before repainting is not enforced.
+;;
+;; A canvas can also be used to host widgets like buttons etc.. In this case
+;; the canvas is treated like a 'gs:pane', with a flow layout by default.
+;; Similar to a panel created with 'gs:pane' other layouts can be set.
+;;
+;; When widgets are present on a canvas they appear to be floating over
+;; the drawing. See the file 'textrot-demo.lsp' for an example.
+
+(define (canvas id parent)
+	(set 'gs:currentCanvas id)
+	(net-send out (string "canvas " id "\n"))
+)
+
+;; @syntax (gs:check-box <sym-id> <sym-action> [<str-text> [<bool-selected>]])
+;; @param <sym-id> The name of the check box.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-text> The text of the check box.
+;; @param <bool-selected> An optional flag indicating the selection state 'true' or 'nil' (default).
+;;
+
+(define (check-box id action text selected)
+	(if text
+		(net-send out (string "check-box " id " " action " " (base64-enc text) " " selected "\n"))
+		(net-send out (string "check-box " id " " action "\n")))
+)
+
+;; @syntax (gs:check-event <int-microseconds>)
+;; @param <int-microseconds> Wait for for an event a maximum of <int-microseconds> and execute it.
+;;
+;; The function 'gs:check-event' is used as an alternative to 'gs:listen' when the application
+;; is performing some activity while waiting for user input from the GUI. Typically
+;; 'gs:check-event' is used in a loop, which performs some other task and at the same time
+;; checks for events from the GUI part of the application. Like 'gs:listen' the function will 
+;; force an exit of the application when communication between the newLISP-GS and the newLISP
+;; application process fails. 
+;;
+;; @example
+;; (while (gs:check-event 10000) ; check for 10 milliseconds
+;;     (do-myprocess)
+;; )
+
+
+(define (check-event us)
+	(if (net-select in "read" us)
+		(if (net-receive in 'event 1000000000 "\n")
+			(eval-string event)
+			(exit)))
+true
+)
+
+;; @syntax (gs:clear-list <sym-id>)
+;; @param <sum-id> The name of the list component in which to clear all entries.
+
+(define (clear-list id)
+	(net-send out (string "clear-list " id "\n"))
+)
+
+;; @syntax (gs:clear-text <sym-id>)
+;; @param <sum-id> The name of the component in which to clear the text.
+
+(define (clear-text id)
+	(net-send out (string "clear-text " id "\n"))
+)
+
+;; @syntax (gs:copy-text <sym-id>)
+;; @param <sum-id> The name of the text component from which to copy the selection to the clipboard.
+
+(define (copy-text id)
+	(net-send out (string "copy-text " id "\n"))
+)
+
+;; @syntax (gs:cut-text <sym-id>)
+;; @param <sym-id-text> The name of the text component from which to cut selected text and place it on the clipboard..
+
+(define (cut-text id)
+	(net-send out (string "cut-text " id "\n"))
+)
+
+
+;; @syntax (gs:color-dialog <sym-parent-frame> <sym-action> <str-title> <float-red> <float-green> <float-blue>)
+;; @param <sym-parent-frame> The name symbol of the parent frame.
+;; @param <sym-action> The symbol of the handler to call when leaving the dialog
+;; @param <str-title> The title of the color dialog.
+;; @param <float-red> The initial red color component.
+;; @param <float-green> The initial green color component.
+;; @param <float-blue The initial blue color component.
+
+(define (color-dialog parent action title red green blue)
+	(net-send out (string "color-dialog " parent " " action " " (base64-enc title) " " red " " green " " blue "\n"))
+)
+
+
+;; @syntax (gs:color-tag <sym-tag> <list-color> [<boolean-update>])
+;; @param <sym-tag> The name tage of the shape(s) to set a new color.
+;; @param <list-color> The new color as a list of 3 numbers for the rgb components.
+;; @param <boolean-repaint> An optional flag to indicate if repainting is required (default is 'true').
+
+(define (color-tag tag color (update true))
+	(net-send out (string "color-tag " gs:currentCanvas " " tag " "
+		(color 0) " " (color 1) " " (color 2) " " update "\n"))
+)
+
+;; @syntax (gs:combo-box <sym-id> <sym-action> [<str-item-1> ...])
+;; @param <sym-id> The name of the combo box.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-item> Zero, one or more text entries in the combo box.
+;; @syntax (gs:combo-box <sym-id> <sym-action> [<list-str-items>])
+;; @param <sym-id> The name of the combo box.
+;; @param <sym-action> The name of the event handler.
+;; @param <list-str-items> Zero, one or more text entries in a list.
+
+(define (combo-box id action)
+	(let (	s (string "combo-box " id " " action " ")
+					entries (if (list? (args 0)) (args 0) (args)) )
+		(dolist (item entries)
+			(write-buffer s (string (base64-enc item) " ")))
+		(write-buffer s "\n")
+		(net-send out s))
+)
+
+;; @syntax (gs:confirm-dialog <sym-parent-frame> <sym-action> <str-title> <str-message> [<str-type>])
+;; @param <sym-parent-frame> The symbol name of the parent frame.
+;; @param <sym-action> The action to perform when the diaog is closed.
+;; @param <str-title> The title of the message box.
+;; @param <str-message> The message in the message box.
+;; @param <str-type> The type of the message box.
+;;
+;; The type of the message box can be one of: '"yes-no"', '"yes-no-cancel"'
+;; On return of the message box <sym-action> carries one of the responses <tt>0</tt> for the yes-,
+;; <tt>1</tt> for the no- or <tt>3</tt> for the cancel-button.
+
+(define (confirm-dialog parent action title message (type plain))
+	(net-send out (string "confirm-dialog " parent " " action " " 
+						(base64-enc title) " " (base64-enc message) " " type "\n"))
+)
+
+;; @syntax (gs:delete-tag <sym-tag> [<boolean-repaint>])
+;; @param <sym-tag> The tag group to be deleted.
+;; @param <boolean-repaint> An optional flag to indicate if repainting is required (default is 'true').
+;;
+;; Deletes all 2D objects (lines, shapes, text, images) tagged with <sym-tag>.
+;;
+;; Each time a 'gs:draw-xxx' or 'gs:fill-xxx' function is called a graphical
+;; object is created. The tag used during creation is a way to address one
+;; or more of these objects. See the file 'mouse-demo.lsp' for an example.
+
+(define (delete-tag tag (repaint true))
+	(net-send out (string "delete-tag " gs:currentCanvas " " tag  " " repaint "\n"))
+)
+
+;; @syntax (gs:destroy-shell <sym-text-area>)
+;; @param <sym-text-area> The name of the text component for which the shell process is destroyed.
+
+(define (destroy-shell id)
+	(net-send out (string "destroy-shell " id "\n"))
+)
+
+;; @syntax (gs:dialog <sym-id> <sym-parent> <str-title> <int-width> <int-height> [<boolean-visible> [<boolean-modal>]])
+;; @param <sym-id> The name of the dialog
+;; @param <sym-parent> The name of the parent frame.
+;; @param <str-title> The title string of the dialog frame.
+;; @param <int-width> The width of the dialog frame.
+;; @param <int-height> The height of the dialog frame.
+;; @param <boolean-visible> The optional flag with a value of 'true' or 'nil' for visibility of the dialog.
+;; @param <boolean-modal> The optional flag with a value of 'true' or 'nil' for modality of the dialog.
+;;
+;; Initially the dialog should not be visible until all widgets are added to it. 
+;; When no flags for visibility and modality are specified, 'nil' is assumed. A modal dialog will
+;; prevent input in the parent window. Components can be added to a dialog using 'gs:add-to'.
+;; Use the 'gs:set-border-layout', 'ga:set-flow-layout' or 'gs:set-grid-layout' to set a specific
+;; layout.
+
+(define (dialog id parent title width height visible modal)
+	(net-send out (string "dialog " id " " parent " " (base64-enc title) " " width " " height " " visible " " modal"\n"))
+)
+
+;; @syntax (gs:disable <sym-id-1> [sym-id-2 ...])
+;; @param <sym-id> The name of the component to disable.
+;;
+;; Disabled components are grayed and do not accept input.
+
+(define (disable)
+	(let (s "disable ")
+		(doargs (item)
+			(write-buffer s (string item " ")))
+		(write-buffer s "\n")
+		(net-send out s)
+	)
+)
+
+;; @syntax (gs:dispose <sym-id>)
+;; @param <sym-id> The name of the component to dispose of.
+
+(define (dispose id)
+	(net-send out (string "dispose " id "\n"))
+)
+
+;; @syntax (gs:dispose-splash)
+;;
+;; A splash screen can be specified when starting the newLISP-GS process before newLISP. 
+;; The function 'gs:dispose-splash' is used to turn off the splash image after
+;; the newLISP GUI application has started.
+;;
+;; @example
+;; java -jar /usr/share/newlisp/guiserver.jar 4711 program.lsp /local/newLISP128.png
+;; ; or on Win32
+;; java -jar "c:\Program Files\newlisp\guiserver.jar" 4711 "newlisp program.lsp" /local/newLISPsplashWin.png
+
+;; The example starts newLISP-GS with an application 'program.lsp' and a splash
+;; screen showing the built-in newLISP logos and using port 4711. Instead, the full pathname 
+;; of a different image file can be specified. Inside 'program.lsp' the function
+;; 'gs:dispose-splash' or a mouse click on the image will turn off the splash screen. 
+;; For 'program.lsp' the full pathname may be necessary. On Win32 quotes are necessary to bracket 
+;; arguments to 'guiserver.jar' which contain spaces. 
+
+(define (dispose-splash)
+	(net-send out "dispose-splash System\n")
+) 
+
+;; @syntax (gs:draw-arc <sym-tag> <int-x> <int-y> <int-width> <int-height> <int-start> <int-angle> [<list-rgb>])
+;; @param <sym-tag> The tag group of the arc.
+;; @param <int-x> The X position of the arc.
+;; @param <int-y> The Y position of the arc.
+;; @param <int-width> The width of the arc.
+;; @param <int-height> The height of the arc.
+;; @param <int-start-angle> The start angle of the arc in 0 to 360 degrees.
+;; @param <int-arc-angle> The opening angle of the arc in 0 to 360 degrees.
+;; @param <list-rgb> The outline color as a list of 3 numbers for the rgb components
+;;
+;; The resulting arc begins at <int-start-angle> and extends for <int-arc-angle degrees>, 
+;; using the current color. Angles are interpreted such that 0 degrees is at the 3 o'clock 
+;; position. A positive value indicates a counter-clockwise rotation while a negative value 
+;; indicates a clockwise rotation.
+;;
+;; The center of the arc is the center of the rectangle whose origin is (x, y) and whose size 
+;; is specified by the width and height arguments.
+;;
+;; The resulting arc covers an area <int-width> pixels wide by <int-height> pixels tall.
+
+(define (draw-arc id x y width height start angle color)
+	(if color
+		(net-send out (string "draw-arc " gs:currentCanvas " " id " " x " " y " "
+						width " " height " " start " " angle " " 
+						(color 0) " " (color 1) " " (color 2) "\n"))
+		(net-send out (string "draw-arc " gs:currentCanvas " " id " " x " " y " "
+						width " " height " " start " " angle "\n"))
+	)
+)
+
+
+;; @syntax (gs:draw-circle <sym-tag> <int-x> <int-y> <int-radius> [<list-rgb>])
+;; @param <sym-tag> The tag group of the circle.
+;; @param <int-x> The X position of the circle center.
+;; @param <int-y> The Y position of the circle center.
+;; @param <int-radius> The radius of the circle.
+;; @param <list-rgb> The outline color as a list of 3 numbers for the rgb components
+;;
+;; Creates the outline of a circle. The color numbers must be entered in list form.
+;; If no <list-rgb> is used the current paint specified with 'gs:set-paint' is used.
+
+(define (draw-circle tag x y radius color)
+	(if color
+		(net-send out (string "draw-circle " gs:currentCanvas " " 
+			tag " " x " " y " " radius " " (color 0) " " (color 1) " " (color 2) "\n"))
+		(net-send out (string "draw-circle " gs:currentCanvas " " 
+			tag " " x " " y " " radius "\n"))
+	)
+)
+
+;; @syntax (gs:draw-ellipse <sym-tag> <int-x> <int-y> <int-radius-x> <int-radius-y> [<list-rgb>])
+;; @param <sym-tag> The tag group of the ellipse.
+;; @param <int-x> The X position of the ellipse center.
+;; @param <int-y> The Y position of the ellipse center.
+;; @param <int-radius-x> The radius of the ellipse.
+;; @param <int-radius-y> The radius of the ellipse.
+;; @param <list-rgb> The outline color as a list of 3 numbers for the rgb components
+;;
+;; Creates the outline of an ellipse. The color numbers must be enterd in list form.
+;; If no <list-rgb> is used the current paint specified with 'gs:set-paint' is used.
+
+(define (draw-ellipse tag x y radius-x radius-y color)
+	(if color
+		(net-send out (string "draw-ellipse " gs:currentCanvas " " 
+			tag " " x " " y " " radius-x " " radius-y " " (color 0) " " (color 1) " " (color 2) "\n"))
+		(net-send out (string "draw-ellipse " gs:currentCanvas " " 
+			tag " " x " " y " " radius-x " " radius-y  "\n"))
+	)
+)
+
+;; @syntax (gs:draw-image <sym-tag> <str-path> <int-x> <int-y> [<int-width> <int-height>])
+;; @param <sym-tag> The tag group of the image.
+;; @param <int-x> The X position of the image top left corner.
+;; @param <int-y> The Y position of the image top left corner.
+;; @param <int-width> The optional width in which to draw the image.
+;; @param <int-height> The optional height in which to draw the image.
+;;
+;; When <int-width> and <int-height> parameters are specified and they are not
+;; equal to the original size of the image (measured in pixels) the image will
+;; be displayed in either compressed or zoomed form.
+
+(define (draw-image tag path x y width height)
+	(if (and width height)
+		(net-send out (string "draw-image " gs:currentCanvas " " tag " " 
+				(base64-enc path) " " x " " y " " width " " height "\n"))
+		(net-send out (string "draw-image " gs:currentCanvas " " tag " " 
+				(base64-enc path) " " x " " y "\n"))
+	)
+) 
+
+;; @syntax (gs:draw-line <sym-tag> <int-x1> <int-y1> <int-x2> <int-y2> [<list-rgb>])
+;; @param <sym-tag> The tage of the line.
+;; @param <int-x1> The X position of the first point.
+;; @param <int-y1> The Y position of the first point.
+;; @param <int-x2> The X position of the second point.
+;; @param <int-y2> The Y position of the second point.
+;;
+;; Draws a line. The color numbers must be entered in list form.
+;; If no <list-rgb> is used the current paint specified with 'gs:set-paint' is used.
+
+(define (draw-line tag x1 y1 x2 y2 color)
+	(if color
+		(net-send out (string "draw-line " gs:currentCanvas " " tag " "
+			x1 " " y1 " " x2 " " y2 " " (color 0) " " (color 1) " " (color 2) "\n"))
+	)
+)
+
+;; @syntax (gs:draw-path <sym-tag> <list-points> [<list-rgb>])
+;; @param <sym-tag> The tage group of the path.
+;; @param <list-points> The list of x and y coordinates of the points.
+;;
+;; Draws a path with the points found in <list-points>. 
+;;
+;; @example 
+;; (gs:draw-path 'P '(1 0 2 2 3 0))
+
+;; The example will draw an upwards-pointing triangle without base at the 
+;; points '1,0', '2,2' and '3,0' 
+
+(define (draw-path tag points color)
+	(if color
+		(let (s (string "draw-path " gs:currentCanvas " " tag " " (/ (length points) 2) " "))
+			(dolist (p points)
+				(write-buffer s (string p " ")))
+			(write-buffer s (string (color 0) " " (color 1) " " (color 2) "\n"))
+			(net-send out s)
+		)
+		(let (s (string "draw-path " gs:currentCanvas " " tag " " (/ (length points) 2) " "))
+			(dolist (p points)
+				(write-buffer s (string p " ")))
+			(write-buffer s "\n")
+			(net-send out s)
+		)
+	)
+)
+
+;; @syntax (gs:draw-polygon <sym-tag> <list-points> [<list-rgb>])
+;; @param <sym-tag> The tag group of the polygon.
+;; @param <list-points> The list of x and y coordinates of the points.
+;;
+;; Draws a polygon with the points found in <list-points>. 
+;;
+;; @example 
+;; (gs:draw-polygon 'P '(1 0 2 2 3 0))
+
+;; The example will draw an upwards-pointing triangle with the points '1,0', '2,2'
+;; and '3,0'.
+
+(define (draw-polygon tag points color)
+	(if color
+		(let (s (string "draw-polygon " gs:currentCanvas " " tag " " (/ (length points) 2) " "))
+			(dolist (p points)
+				(write-buffer s (string p " ")))
+			(write-buffer s (string (color 0) " " (color 1) " " (color 2) "\n"))
+			(net-send out s)
+		)
+		(let (s (string "draw-polygon " gs:currentCanvas " " tag " " (/ (length points) 2) " "))
+			(dolist (p points)
+				(write-buffer s (string p " ")))
+			(write-buffer s "\n")
+			(net-send out s)
+		)
+	)
+)
+
+
+;; @syntax (gs:draw-rect <sym-tag> <int-x> <int-y> <int-width> <int-height> [<list-rgb>])
+;; @param <sym-tag> The tag group of the rectangle.
+;; @param <int-x> The X position of the top left corner.
+;; @param <int-y> The Y position of the top left corner.
+;; @param <int-width> The width of the rectangle.
+;; @param <int-height> The height of the rectangle..
+;; @param <list-rgb> The outline color as a list of 3 numbers for the rgb components
+;;
+;; Creates the outline of a rectangle. The color numbers must be entered in list form.
+;; If no <list-rgb> is used the current paint specified with 'gs:set-paint' is used.
+
+(define (draw-rect tag x y width height color)
+	(if color
+		(net-send out (string "draw-rect " gs:currentCanvas " " 
+			tag " " x " " y " " width " " height " " (color 0) " " (color 1) " " (color 2) "\n"))
+		(net-send out (string "draw-rect " gs:currentCanvas " " 
+			tag " " x " " y " " width " " height "\n"))
+	)
+)
+
+
+;; @syntax (gs:draw-round-rect <sym-tag> <int-x> <int-y> <int-width> <int-height> <int-arc-width> <int-arc-height> [<list-rgb>])
+;; @param <sym-tag> The tag group of the round rectangle.
+;; @param <int-x> The X position of the top left corner.
+;; @param <int-y> The Y position of the top left corner.
+;; @param <int-width> The width of the rectangle.
+;; @param <int-height> The height of the rectangle..
+;; @param <int-arc-width> The width of the corner rectangle.
+;; @param <int-arc-height> The height of the corner rectangle..
+;; @param <list-rgb> The outline color as a list of 3 numbers for the rgb components
+;;
+;; Draws a rectangle shape with round corners. The rounding is defined by the rectangle enclosing
+;; the rounding arc.
+
+(define (draw-round-rect tag x y width height arcw arch color)
+	(if color
+		(net-send out (string "draw-round-rect " gs:currentCanvas " " 
+			tag " " x " " y " " width " " height " "  arcw " " arch " " 
+				(color 0) " " (color 1) " " (color 2) "\n"))
+		(net-send out (string "draw-round-rect " gs:currentCanvas " " 
+			tag " " x " " y " " width " " height  " " arcw " " arch "\n"))
+	)
+)
+
+
+;; @syntax (gs:draw-text <sym-tag> <str-text> <int-x> <int-y> [<list-rgb> [<float-angle>])
+;; @param <sym-tag> The tag group of the text.
+;; @param <str-text> The text to be drawn.
+;; @param <int-x> The X position of the text.
+;; @param <int-y> The Y position of the text.
+;; @param <list-rgb> The optonal color for the text.
+;; @param <float-angle> The optional angle for text in degrees
+;;
+;; If no <list-rgb> is used, the current paint specified with 'gs:set-paint' is used.
+;; The optional angle is <tt>0</tt> by default for horizontal text. A value of <tt>90</tt>
+;; will rotate the text around the <tt>x</tt>, <tt>y</tt> position downwards clockwise.
+
+(define (draw-text tag text x y color angle)
+	(if color
+		(if angle
+			(net-send out (string "draw-text " gs:currentCanvas " "
+				tag " "  (base64-enc text) " " x " " y " " 
+				(color 0) " " (color 1) " " (color 2) " " angle "\n"))
+			(net-send out (string "draw-text " gs:currentCanvas " "
+				tag " "  (base64-enc text) " " x " " y " " 
+				(color 0) " " (color 1) " " (color 2) "\n"))
+		)
+		(net-send out (string "draw-text " gs:currentCanvas " "
+			tag " "  (base64-enc text) " " x " " y "\n"))
+	)
+)
+
+
+
+
+;; @syntax (gs:enable <sym-id-1> [sym-id-2 ...])
+;; @param <sym-id> The name of a component to enable.
+;;
+;; Components are enabled by default.
+
+(define (enable)
+	(let (s (string "enable "))
+		(doargs (item)
+			(write-buffer s (string item " ")))
+		(write-buffer s "\n")
+		(net-send out s)
+	)
+)
+
+;; @syntax (gs:eva-shell <sym-id-text-area> <str-command>)
+;; @param <sym-id-text-area> The name of the text are in which to evaluate text.
+;; @param <str-command> The text to evaluate in the shell.
+
+(define (eval-shell id command)
+	(net-send out (string "eval-shell " id " " (base64-enc command) "\n"))
+)
+
+;; @syntax (gs:export <str-path-file> [<int-width> <int-height>])
+;; @param <str-path-file> The path and file name of the image file to write to.
+;; @param <int-width> The optional width of the image in pixels.
+;; @param <int-height> The optional height of the image in pixels.
+;;
+;; If no width and height are specified, the current size of the canvas is assumed.
+;;
+;; @example
+;;
+;; (gs:export "/usr/home/pictures/mypic.png")
+
+;; This will generate a '.png' file exactly as the image seen on the screen.
+;; The color format is RGBA with 8 bit per color and an alpha channel. When
+;; no background color is defined for the canvas, the background will be
+;; transparent.
+;;
+;; When specifying width and height, a smaller or bigger portion of the canvas
+;; than seen on the screen is printed to the image.
+
+(define (export path width height)
+	(if (and width height)
+		(net-send out (string "export " gs:currentCanvas " " (base64-enc path) " " width " " height "\n"))
+		(net-send out (string "export " gs:currentCanvas " " (base64-enc path) "\n"))
+	)
+)
+			
+
+;; @syntax (gs:fill-arc <sym-tag> <int-x> <int-y> <int-width> <int-height> <int-start> <int-angle> [<list-rgb>])
+;; @param <sym-tag> The tag group of the arc.
+;; @param <int-x> The X position of the arc.
+;; @param <int-y> The Y position of the arc.
+;; @param <int-width> The width of the arc.
+;; @param <int-height> The height of the arc.
+;; @param <int-start-angle> The start angle of the arc in 0 to 360 degrees.
+;; @param <int-arc-angle> The opening angle of the arc in 0 to 360 degrees.
+;; @param <list-rgb> The outline color as a list of 3 numbers for the rgb components.
+;;
+;; The resulting arc begins at <int-start-angle> and extends for <int-arc-angle degrees>, 
+;; using the current color. Angles are interpreted such that 0 degrees is at the 3 o'clock 
+;; position. A positive value indicates a counter-clockwise rotation while a negative value 
+;; indicates a clockwise rotation.
+;;
+;; The center of the arc is the center of the rectangle whose origin is (x, y) and whose size 
+;; is specified by the width and height arguments.
+;;
+;; The resulting arc covers an area <int-width> pixels wide by <int-height> pixels tall.
+
+(define (fill-arc id x y width height start angle color)
+	(if color
+		(net-send out (string "fill-arc " gs:currentCanvas " " id " " x " " y " "
+						width " " height " " start " " angle " " 
+						(color 0) " " (color 1) " " (color 2) "\n"))
+		(net-send out (string "fill-arc " gs:currentCanvas " " id " " x " " y " "
+						width " " height " " start " " angle "\n"))
+	)
+)
+
+;; @syntax (gs:fill-circle <sym-tag> <int-x> <int-y> <int-radius> [<list-rgb>])
+;; @param <sym-tag> The tag group of the circle.
+;; @param <int-x> The X position of the circle center.
+;; @param <int-y> The Y position of the circle center.
+;; @param <int-radius> The radius of the circle.
+;; @param <list-rgb> The outline color as a list of 3 numbers for the rgb components.
+;;
+;; Creates a filled  circle. The color numbers must be entered in list form.
+;; If no <list-rgb> is used, the current paint specified with 'gs:set-paint' is used.
+
+(define (fill-circle tag x y radius color)
+	(if color
+		(net-send out (string "fill-circle " gs:currentCanvas " " 
+			tag " " x " " y " " radius " " (color 0) " " (color 1) " " (color 2) "\n"))
+		(net-send out (string "fill-circle " gs:currentCanvas " " 
+			tag " " x " " y " " radius "\n"))
+	)
+)
+
+;; @syntax (gs:fill-ellipse <sym-tag> <int-x> <int-y> <int-radius-x> <int-radius-y> [<list-rgb>])
+;; @param <sym-tag> The tag group of the ellipse.
+;; @param <int-x> The X position of the ellipse center.
+;; @param <int-y> The Y position of the ellipse center.
+;; @param <int-radius-x> The radius of the ellipse.
+;; @param <int-radius-y> The radius of the ellipse.
+;; @param <list-rgb> The fill color as a list of 3 numbers for the rgb components.
+;;
+;; Creates a filled ellipse. The color numbers must be entered in list form.
+;; If no <list-rgb> is used, the current paint specified with 'gs:set-paint' is used.
+
+(define (fill-ellipse tag x y radius-x radius-y color)
+	(if color
+		(net-send out (string "fill-ellipse " gs:currentCanvas " " 
+			tag " " x " " y " " radius-x " " radius-y " " 
+				(color 0) " " (color 1) " " (color 2) "\n"))
+		(net-send out (string "fill-ellipse " gs:currentCanvas " " 
+			tag " " x " " y " " radius-x " " radius-y  "\n"))
+	)
+)
+
+;; @syntax (gs:fill-polygon <sym-tag> <list-points> [<list-color>])
+;; @param <sym-tag> The tag group of the polygon.
+;; @param <list-points> The list of x and y coordinates of the points.
+;;
+;; Draws a polygon with the points found in <list-points> and fills it with
+;; the current color set with 'gs:set-paint' or the optional color
+;; given in <list-color>.
+;;
+;; @example 
+;; (gs:fill-polygon 'P '(1 0 2 2 3 0))
+;;
+;; (gs:fill-polygon 'P '(1 0 2 2 3 0) gs:gray)
+
+;; The example will fill an upwards pointing triangle with the points '1,0', '2,2'
+;; and '3,0' and fill it with the current color set with 'gs:set-paint'. The second
+;; example paints a gray triangle regardless of the current color set with
+;; 'gs:set-paint'.
+
+(define (fill-polygon tag points color)
+	(if color
+		(let (s (string "fill-polygon " gs:currentCanvas " " tag " " (/ (length points) 2) " "))
+			(dolist (p points)
+				(write-buffer s (string p " ")))
+			(write-buffer s (string (color 0) " " (color 1) " " (color 2) "\n"))
+			(net-send out s)
+		)
+		(let (s (string "fill-polygon " gs:currentCanvas " " tag " " (/ (length points) 2) " "))
+			(dolist (p points)
+				(write-buffer s (string p " ")))
+			(write-buffer s "\n")
+			(net-send out s)
+		)
+	)
+)
+
+;; @syntax (gs:fill-rect <sym-tag> <int-x> <int-y> <int-width> <int-height> [<list-rgb>])
+;; @param <sym-tag> The tag group of the rectangle.
+;; @param <int-x> The X position of the top left corner.
+;; @param <int-y> The Y position of the top left corner.
+;; @param <int-width> The width of the rectangle.
+;; @param <int-height> The height of the rectangle.
+;; @param <list-rgb> The fill color as a list of 3 numbers for the rgb components.
+;;
+;; Creates a filled rectangle. The color numbers must be entered in list form.
+;; If no <list-rgb> is used, the current paint specified with 'gs:set-paint' is used.
+
+(define (fill-rect tag x y width height color)
+	(if color
+		(net-send out (string "fill-rect " gs:currentCanvas " " 
+			tag " " x " " y " " width " " height " " (color 0) " " (color 1) " " (color 2) "\n"))
+		(net-send out (string "fill-rect " gs:currentCanvas " " 
+			tag " " x " " y " " width " " height "\n"))
+	)
+)
+
+;; @syntax (gs:fill-round-rect <sym-tag> <int-x> <int-y> <int-width> <int-height> <int-arc-width> <int-arc-height> [<list-rgb>])
+;; @param <sym-tag> The tag group of the round rectangle.
+;; @param <int-x> The X position of the top left corner.
+;; @param <int-y> The Y position of the top left corner.
+;; @param <int-width> The width of the rectangle.
+;; @param <int-height> The height of the rectangle..
+;; @param <int-arc-width> The width of the corner rectangle.
+;; @param <int-arc-height> The height of the corner rectangle.
+;; @param <list-rgb> The outline color as a list of 3 numbers for the rgb components.
+;;
+;; Paints a rectangle shape with round corners. The rounding is defined by the rectangle enclosing
+;; the rounding arc.
+
+(define (fill-round-rect tag x y width height arcw arch color)
+	(if color
+		(net-send out (string "fill-round-rect " gs:currentCanvas " " 
+			tag " " x " " y " " width " " height " "  arcw " " arch " " 
+				(color 0) " " (color 1) " " (color 2) "\n"))
+		(net-send out (string "fill-round-rect " gs:currentCanvas " " 
+			tag " " x " " y " " width " " height  " " arcw " " arch "\n"))
+	)
+)
+
+;; @syntax (gs:find-text <sym-id> <str-text> <sym-action> [<str-direction>])
+;; @param <sym-id> The name of the textr area or text pane.
+;; @param <boolean-next> The optional direction string '"next"' (default) or '"previous"'.
+;; @param <sym-action> A optional action to peform after find-text.
+;;
+;; The text area or text pane will be searched starting at the current caret position
+;; forward or backwards depending on the optional direction field. After the search
+;; the found text is highlighted. If the optional <sym-action> is specified an event
+;; containing the id of the text area or pane and found position or '-1' will be fired.
+
+(define (find-text id text action (direction "next"))
+	(net-send out (string "find-text " id " " (base64-enc text) " " action " " direction "\n"))
+)
+
+
+
+;; @syntax (gs:frame <sym-id> <int-x> <int-y> <int-width> <int-height> [<str-title> <boolean-visible>])
+;; @param <sym-id> The name of the frame window.
+;; @param <int-x> The X position of the top left window corner.
+;; @param <int-y> The Y position of the top left windows corner.
+;; @param <int-width> The width of the window frame.
+;; @param <int-height> The height of the windows frame.
+;; @param <str-title> The optional title of the window.
+;; @param <boolean-visible> The optional flag with a value of 'true' or 'nil' for the visibility of the window.
+;;
+;; Initially the frame should not be visible until all widgets are added to it. 
+;; When no flag for visibility is specified 'nil' is assumed. The default layout of a frame behaves
+;; like a grid layout with one cell. Use the 'set-flow-layout', 'set-border-layout' and
+;; 'set-grid-layout' to change the layout.
+
+
+(define (frame id x y width height text visible)
+	(if text
+		(net-send out (string "frame " id " " x " " y " " width " " height " " (base64-enc text) " " visible "\n"))
+		(net-send out (string "frame " id " " x " " y " " width " " height "\n"))
+	)
+)
+
+;; @syntax (gs:get-bounds <sym-id>)
+;; @param <sym-id> The id of the component for which to get the list of bounding values.
+;; @return The bounding list '(<x> <y> <width> <height>)'
+ 
+(define (get-bounds id)
+	(set 'gs:bounds nil)
+	(net-send out (string "get-bounds " id "\n"))
+	(while (not gs:bounds) (check-event 10000))
+	gs:bounds
+)
+
+;; @syntax (gs:get-fonts)
+;; @return A list of family names for fonts on the current system.
+;;
+;; The function should be called only once because it may take considerable
+;; time in a system loaded with many fonts. The variable 'gs:fonts' contains
+;; the same list of fonts originally returned by a call to 'gs:get-fonts'.
+
+(define (get-fonts)
+	(if (not gs:fonts)
+		(begin
+    		(net-send out (string "get-fonts System\n"))
+			(while (not gs:fonts) (check-event 10000))
+			(set 'gs:fonts (map base64-dec gs:fonts))
+		)
+	)
+)
+
+;; @syntax (gs:get-font-metrics <sym-id> <str-text>)
+;; @return A list of the two values for width and height in pixels.
+;;
+;; The font metrics for the currently set font in <sym-id> are returned as a list
+;; of width and height in pixels when displaying the string in <str-text>.
+;; After the function call the variable 'gs:font-metrics' contains the same list
+;; of values as originally returned by the call to 'gs:get-font-metrics'.
+
+(define (get-font-metrics id text)
+	(set 'gs:font-metrics nil)
+	(net-send out (string "get-font-metrics " id " " (base64-enc text) "\n"))
+	(while (not gs:font-metrics) (check-event 10000))
+	gs:font-metrics	
+)
+
+
+;; @syntax (gs:get-screen)
+;; @return A list of screen width, height and resolution of the main computer screen.
+;;
+;; After calling the 'gs:get-screen' once the screen parameters are also available
+;; in the variable 'gs:screen'.
+
+(define (get-screen)
+    (net-send out (string "get-screen System\n"))
+	(while (not gs:screen) (check-event 10000))
+	gs:screen
+)
+
+
+;; @syntax (gs:get-selected-text <sym-id> <sym-action>)
+;; @param <sym-id> The name of the component from which to get the selected text.
+;; @param <sym-action> The symbol of the event handler which will receive the selected text.
+
+(define (get-selected-text id action)
+	(net-send out (string "get-selected-text " id " " action "\n"))
+)
+
+
+
+;; @syntax (gs:get-text <sym-id> [<sym-action>])
+;; @param <sym-id> The name of the component from which to get the text.
+;; @param <sym-action> The optional symbol of the event handler which will receive the text.
+;;
+;; If no <sym-action> is specified the function will block until the text is returned. 
+;; After return the text is also available in the variable 'gs:text'.
+;; If <sym-action> is specified the function will return immediately and a <sym-action> event 
+;; is fired containing the text. 
+
+(define (get-text id action)
+	(if action
+		(net-send out (string "get-text " id " " action "\n"))
+		(begin
+			(set 'gs:text nil)
+			(net-send out (string "get-text " id "\n"))
+			(while (not gs:text) (check-event 10000))
+			gs:text)
+	)
+)
+
+
+;; @syntax (gs:get-text-position <sym-id>)
+;; @param <sym-id> The name of the text component for which the line and column position is returned.
+;; @return A list of line and column position of the text caret.
+;;
+
+(define (get-text-position id)
+	(set 'gs:text-position nil)
+	(net-send out (string "get-text-position " id "\n"))
+	(while (not gs:text-position) (check-event 10000))
+	gs:text-position
+)
+
+;; @syntax (gs:get-version)
+;; @return The version string of newLISP-GS running.
+;;
+;; After calling the 'gs:get-version' once the version number is also
+;; available in 'gs:version'.
+
+(define (get-version)
+    (net-send out (string "get-version System\n"))
+	(while (not gs:version) (check-event 10000))
+	gs:version
+)
+
+;; @syntax (gs:goto-text <sym-id> <int-row> <int-column>)
+;; @param <sym-id> The name of the text widget.
+;; @param <int-row> The row number where to place the cursor.
+;; @param <int-column> The column number where to place the cursor.
+
+(define (goto-text id row col)
+	(net-send out (string "goto-text " id " " row " " col "\n"))
+)
+
+
+
+;; @syntax (gs:hide-tag <sym-tag> [<boolean-repaint>])
+;; @param <sym-tag> The tag of the group to hide.
+;; @param <boolean-repaint> An optional flag to indicate if repainting is required (default is 'true').
+;;
+
+(define (hide-tag tag (repaint true))
+	(net-send out (string "hide-tag " gs:currentCanvas " " tag " " repaint "\n"))
+)
+
+
+;; @syntax (gs:image-button <sym-id> <sym-action> <str-icon-path> [<str-down-icon-path> [<int-width> <int-height>]])
+;; @param <sym-id> The name of the image button.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-icon-path> The path for an image icon.
+;; @param <str-down-con-path> The path for a pressed down image icon.
+;; @param <int-width> The optional width of the image button.
+;; @param <int-height> The optional height of the image button.
+
+(define (image-button id action icon down-icon x y)
+	(if down-icon
+		(if (and x y)
+			(net-send out (string "image-button " id " " action " " (base64-enc icon) " " (base64-enc down-icon) " " x " " y "\n"))
+			(net-send out (string "image-button " id " " action " " (base64-enc icon) " " (base64-enc down-icon) "\n"))
+		)
+		(net-send out (string "image-button " id " " action " " (base64-enc icon) "\n"))
+	)
+)
+
+;; @syntax (gs:image-label <sym-id> <str-icon-path> [<str-align>])
+;; @param <sym-id> The name of the label.
+;; @param <str-ucon-path> A string with the icon file path.
+;; @param <str-align> An optional alignment '"left"', '"center"' or '"right"', '"leading"', '"trailing"', '"bottom"' or '"top"'.
+
+(define (image-label id icon align)
+	(if align
+		(net-send out (string "image-label " id " " (base64-enc icon) " " align "\n"))
+		(net-send out (string "image-label " id " " (base64-enc icon) "\n")))
+)
+
+
+;; @syntax (gs:init [<int-port> <str-host>])
+;; @param <int-port> The optional guiserver server port.
+;; @param <str-host> The optional remote host of the guiserver.
+
+(define (init (portIn 47011) (host "127.0.0.1"))
+	; check for server portIn and if this was started by java
+	(if (main-args 2) (set 'portIn (int (main-args 2) portIn)))
+	(if (not (= (main-args 3) "javastart"))
+		(if (= ostype "Win32")
+			(process (string "cmd /c " server-path " " portIn))
+
+			(= ostype "OSX")
+			(process (string "/usr/bin/java -jar " server-path " " portIn))
+
+			(env "JAVA_HOME")
+			(process (string (env "JAVA_HOME") "/bin/java -jar " server-path " " portIn))
+
+			(process (string "/usr/bin/java -jar " server-path " " portIn))
+
+		)
+	)
+
+	(set 'portOut (+ portIn 1))
+	(set 'retry 0)
+	(set 'out nil)
+	(while (not out)
+		(if (> retry 300) ; try for 30 seconds
+			(begin
+				(println "Could not connect to guiserver")
+				(exit))
+			(inc 'retry))
+		(set 'out (net-connect host portIn))
+		(sleep 100))
+
+	(set 'listenSock (net-listen portOut))
+	(set 'in (net-accept listenSock))
+	(net-close listenSock)
+	(gs:set-utf8 (primitive? MAIN:utf8))
+)
+
+
+;; @syntax (gs:insert-list-item <sym-list-combo> <str-text> <int-index> [<str-text> <int-index>])
+;; @param <sym-list-combo> The name of the combo box or list box from which entries are removed.
+;; @param <str-text> The text of the list or combo box item to insert.
+;; @param <int-index> The index of an entry to add to the list or combo box.
+;;
+;; When specifying an index of <tt>0</tt> the first item gets inserted at the beginning. 
+;; When specifying an index equal or greater to the number of items in the list, the item 
+;; is added at the end.
+
+(define (insert-list-item comp)
+	(let (	s (string "insert-list-item " comp " ")
+			p (args))
+		(while p
+			(write-buffer s (string (base64-enc (pop p)) " " (pop p) " ")))
+		
+		(write-buffer s "\n")
+		(net-send out s))
+)
+
+;; @syntax (gs:insert-tab <sym-tabbed-pane> <sym-component> [<str-text> [<int-index> [<str-icon-path>]]])
+;; @param <sym-tabbed-pane> The name of the tabbed pane.
+;; @param <sym-component> The name of the component to insert as a tab.
+;; @param <str-text> The optional text on the tab.
+;; @param <int-index> The optional index where to insert the new tab.
+;; @param <str-icon-path> The file path to an optional icon.
+
+(define (insert-tab pane comp text idx icon)
+	(if text
+		(if idx
+			(if icon
+				(net-send out (string "insert-tab " pane " " comp " " (base64-enc text) " " idx " " (base64-enc icon) "\n"))
+				(net-send out (string "insert-tab " pane " " comp " " (base64-enc text) " " idx "\n")))
+			(net-send out (string "insert-tab " pane " " comp " " (base64-enc text) "\n")))
+		(net-send out (string "insert-tab " pane " " comp "\n")))
+)
+
+;; @syntax (gs:insert-text <sym-id> <str-text> <int-position>)
+;; @param <sym-id> The name of the text component.
+;; @param <str-text> The text to insert.
+;; @param <int-position> The offset position where to insert the text.
+
+(define (insert-text id text position)
+	(replace "\r" text "")
+	(net-send out (string "insert-text " id " " (base64-enc text) " " position "\n"))
+)
+
+;; @syntax (gs:key-event <sym-id> <sym-action>)
+;; @param <sym-canvas> The id of the component to register the action handler.
+;; @param <sym-action> The symbol of the action handler.
+;;
+;; 'gs:key-event' can be used to register a general unspecific key event handler
+;; for any component in the system. Since version 1.05 of newLISP-GS this also
+;; includes text widgets, which alrady handle key events using their normal event 
+;; handler function. With 'gs:key-event' a second handler function can be registered
+;; for text widgets. Both functions will fire on their respective events.
+;;
+;; Components respond to the following key event types: '"pressed"', '"released"', '"typed"'.
+;; 
+;; @example
+;;
+;; (define (key-action id type code modifiers)
+;;     (println "id:" id " type:" type " key code:" code " modifiers:" modifiers)
+;; )
+
+;; The example shows a handler which prints all key event parameters to the terminal/shell
+;; window where the applicaton was started.
+;;
+;; In order for key events to work, the component for which a key action handler
+;; is registered must have the input focus. Use '"gs:request-focus"' to set the
+;; input focus for the component.
+
+
+(define (gs:key-event id action)
+	(net-send out (string "key-event " id " " action "\n"))
+)
+
+;; @syntax (gs:label <sym-id> <str-text> [<str-align> [<int-width> <int-height>]])
+;; @param <sym-id> The name of the label.
+;; @param <str-text> The text to appear on the label.
+;; @param <str-align> The optional alignment of the text.
+;; @param <int-width> The optional width of the label.
+;; @param <int-height> The optional height of the label.
+;;
+;; The following alignment constants can be supplied: '"left"', '"center"', '"right"",
+;; '"leading"', '"trailing"', '"bottom"' and "'top'". By default each label text is
+;; '"center"' aligned.
+
+(define (label id text align width height)
+	(if align
+		(if (and width height)
+			(net-send out (string "label " id " " (base64-enc text) " " align " " width " " height "\n"))
+			(net-send out (string "label " id " " (base64-enc text) " " align "\n")))
+		(net-send out (string "label " id " " (base64-enc text) "\n")))
+)
+
+
+;; @syntax (gs:layout <sym-container>)
+;; @param <sym-container> The id of the container to lay out.
+;;
+;; Forces the container to lay out its components again, e.g. after a 'gs:add-to' or 'gs:remove-from'
+;; when the container was already visible.
+
+(define (layout id)
+	(net-send out (string "layout " id "\n"))
+)
+
+;; @syntax (gs:load-text <sym-id> <str-path>)
+;; @param <sym-id> The id of the 'gs:text-pane'.
+;; @param <str-path> The full path name of the file to load.
+;;
+;; 'gs:load-text' will load text into a 'gs:text-pane' directly by specifying
+;; the path name. During loading, CR-LF line terminators are automatically
+;; translated to LF-only line terminators by stripping all CRs from the file. All internal
+;; operations of guiserver on text assume LF as a line terminator.
+
+(define (load-text id path)
+	(net-send out (string "load-text " id " " (base64-enc path) "\n"))
+)
+
+;; @syntax (gs:listen [<boolean-flag>])
+;; @param <boolean-flag> Prevent exit on loss of communication.
+;; @return Never returns. Exits the application when the guiserver exits, except when <boolean-flag> is 'true'.
+
+(define (listen flag)
+	(while (net-receive in 'event 1000000000 "\n")
+		(eval-string event))
+	(println "server shut down")
+	(if (not flag) (exit))
+)
+
+;; @syntax (gs:list-box <sym-id> <sym-action> [<str-item-1> ...])
+;; @param <sym-id> The name of the list box.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-item> Zero, one or more text entries in the list box.
+;; @syntax (gs:list-box <sym-id> <sym-action> [<list-str-items>])
+;; @param <sym-id> The name of the list box.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-item> Zero, one or more text entries in the list box.
+
+;; The listbox when clicked with the mouse, or when the [enter] key is
+;; presses, will pass the following parameters to the event handler:
+;; <br><br>
+;; <id> - the id string of the list box<br>
+;; <index> - the zero offset index of the highlighted listbox entry<br>
+;; <item> - the string of the highlighted listbox entry<br>
+;; <click-count> - the number of times the mouse has been clicked<br>
+;; </tt>
+
+(define (list-box id action)
+	(let (	s (string "list-box " id " " action " ")
+					entries (if (list? (args 0)) (args 0) (args)) )
+		(dolist (item entries)
+			(write-buffer s (string (base64-enc item) " ")))
+		(write-buffer s "\n")
+		(net-send out s))
+)
+
+
+;; @syntax (gs:message-dialog <sym-parent-frame> <str-title> <str-message> [<str-type> [<str-icon-path>]])
+;; @param <sym-parent-frame> The symbol name of the parent frame.
+;; @param <str-title> The title of the message box.
+;; @param <str-message> The message in the message box.
+;; @param <str-type> The type of the message box.
+;; @param <str-icon-path> The optional path for an icon.
+;;
+;; The type of the message box can be one of: '"error"', '"information"', '"warning"', '"question"', '"plain"'.
+;; The function initiating the message-dialog will return when the dialog is closed.
+
+(define (message-dialog parent title message (type "plain") icon)
+	(if icon
+		(net-send out (string "message-dialog " parent " " 
+				(base64-enc title) " " (base64-enc message) " " type  " " (base64-enc icon) "\n"))
+		(net-send out (string "message-dialog " parent " " 
+				(base64-enc title) " " (base64-enc message) " " type "\n"))
+	)
+)
+
+;; @syntax (gs:menu <sym-id> <str-text>)
+;; @param <sym-id> The name of the menu.
+;; @param <str-text> The title string of the menu.
+
+(define (menu id text)
+	(net-send out (string "menu " id " " (base64-enc text) "\n"))
+)
+
+;; @syntax (gs:menu-popup <sym-id> <str-text>)
+;; @param <sym-id> The name of the menu.
+;; @param <str-text> The title string of the menu.
+
+(define (menu-popup id text)
+	(net-send out (string "menu-popup " id " " (base64-enc text) "\n"))
+)
+
+;; @syntax (gs:menu-bar <sym-frame> [<sym-menu-1> ...])  
+;; @param <sym-frame> The name of the frame hosting the menu bar.
+;; @param <sym-menu> Zero or more symbol names of menus to be positioned on the menu bar.
+
+(define (menu-bar aframe)
+	(let (s (string "menu-bar " aframe " "))
+		(doargs (item)
+			(write-buffer s (string item " ")))
+		(write-buffer s "\n")
+		(net-send out s))
+)
+
+;; @syntax (gs:menu-item <sym-id> <sym-action> <str-text>)
+;; @param <sym-id> The name of the menu item.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-text> The text to appear for the menu item.
+
+(define (menu-item id action text)
+		(net-send out (string "menu-item " id " " action " " (base64-enc text) "\n"))
+)
+
+;; @syntax (gs:menu-item-check <sym-id> <sym-action> <str-text> [<bool-selected>])
+;; @param <sym-id> The name of the menu item.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-text> The text to appear for the menu item.
+;; @param <bool-selected> An optional flag indicating the selection state 'true' or 'nil' (default).
+
+(define (menu-item-check id action text selected)
+		(net-send out (string "menu-item-check " id " " action " " (base64-enc text) " " selected "\n"))
+)
+
+;; @syntax (gs:mouse-clicked <sym-canvas> <sym-action> [<boolean-tags>])
+;; @param <sym-canvas> The id of the canvas to register the action handler.
+;; @param <sym-action> The symbol of the action handler.
+;; @param <boolean-tags> A 'true' to indicate checking for tags.
+;;
+;; If <boolean-tags> is 'true', the action event will carry a list of
+;; all tags which contained the X,Y coordinates of the mouse.
+
+(define (mouse-clicked cnvs action flag)
+	(net-send out (string "mouse-clicked " cnvs " " action " " flag "\n"))
+)
+
+;; @syntax (gs:mouse-dragged <sym-canvas> <sym-action>)
+;; @param <sym-canvas> The id of the canvas to register the action handler.
+;; @param <sym-action> The symbol of the action handler.
+
+(define (gs:mouse-dragged cnvs action)
+	(net-send out (string "mouse-dragged " cnvs " " action "\n"))
+)
+
+;; @syntax (gs:mouse-event <sym-id> <sym-action>)
+;; @param <sym-canvas> The id of the component to register the action handler.
+;; @param <sym-action> The symbol of the action handler.
+;;
+;; 'gs:mouse-event' can be used to register a general unspecific mouse event handler
+;; for any component in the system. Components respond to the following types:
+;; '"pressed"', '"released"', '"clicked"',
+;; 
+;; @example
+;;
+;; (define (mouse-action id type x y button cnt mods)
+;;     (println "id:" id " type:" type " x:" x " y:" y " button:" button " count:" cnt " mods:" mods)
+;; )
+
+;; The example shows a handler which prints all mouse event parameters to the terminal/shell
+;; window where the applicaton was started.
+
+
+(define (gs:mouse-event id action)
+	(net-send out (string "mouse-event " id " " action "\n"))
+)
+
+;; @syntax (gs:mouse-moved <sym-canvas> <sym-action>)
+;; @param <sym-canvas> The id of the canvas to register the action handler.
+;; @param <sym-action> The symbol of the action handler.
+;; @param <boolean-tags> A 'true' to indicate checking for tags.
+;;
+;; If <boolean-tags> is 'true', the action event will carry a list of
+;; all tags which contained the X,Y coordinates of the mouse.
+
+(define (gs:mouse-moved cnvs action flag)
+	(net-send out (string "mouse-moved " cnvs " " action " " flag "\n"))
+)
+
+;; @syntax (gs:mouse-pressed <sym-canvas> <sym-action> [<boolean-tags>])
+;; @param <sym-canvas> The id of the canvas to register the action handler.
+;; @param <sym-action> The symbol of the action handler.
+;; @param <boolean-tags> A 'true' to indicate checking for tags.
+;;
+;; If <boolean-tags> is 'true', the action event will carry a list of
+;; all tags which contained the X,Y coordinates of the mouse.
+
+(define (gs:mouse-pressed cnvs action flag)
+	(net-send out (string "mouse-pressed " cnvs " " action " " flag "\n"))
+)
+
+;; @syntax (gs:mouse-released <sym-canvas> <sym-action> [<boolean-tags>])
+;; @param <sym-canvas> The id of the canvas to register the action handler.
+;; @param <sym-action> The symbol of the action handler.
+;; @param <boolean-tags> A 'true' to indicate checking for tags.
+;;
+;; If <boolean-tags> is 'true', the the action event will carry a list of
+;; all tags which contained the X,Y coordinates of the mouse.
+
+(define (gs:mouse-released cnvs action flag)
+	(net-send out (string "mouse-released " cnvs " " action " " flag "\n"))
+)
+
+;; @syntax (gs:mouse-wheel <sym-canvas> <sym-action>)
+;; @param <sym-canvas> The id of the canvas to register the action handler.
+;; @param <sym-action> The symbol of the action handler.
+
+(define (gs:mouse-wheel cnvs action)
+	(net-send out (string "mouse-wheel " cnvs " " action "\n"))
+)
+
+;; @syntax (gs:move-tag <sym-tag> <int-dx> <int-dy> [<boolean-repaint>])
+;; @param <sym-tag> The tag of the group of objects to move.
+;; @param <int-dx> The distance to move on the X-axis.
+;; @param <int-dy> The distance to move on the Y-axis.
+;; @param <boolean-repaint> An optional flag to indicate if repainting is required (default is 'true').
+;;
+;; 'gs:move-tag' is the only tag operation which actually changes the 
+;; internal data of a drawn object. All other tag operations like
+;; 'gs:translate-tag', 'gs:scale-tag', 'gs:rotate-tag' and 'gs:shear-tag'
+;; will transform object coordinates only for drawing.
+
+(define (gs:move-tag tag dx dy (repaint true))
+	(net-send out (string "move-tag " gs:currentCanvas " " tag " " 
+		dx " " dy " " repaint "\n"))
+)
+
+;; @syntax (gs:no-action)
+;;
+;; Specify as <sym-action> for widgets where no action handler is defined.
+
+(define (no-action))
+
+;; @syntax (gs:open-file-dialog <sym-parent-frame> <sym-action> [<str-directory> [<str-mask> <str-description>]])
+;; @param <sym-parent-frame> The parent frame of the file dialog.
+;; @param <sym-action> The handler function symbol.
+;; @param <str-directory> The initial directory to show.
+;; @param <str-mask> An optonal string mask.
+;; @param Mstr-description> An optional mask description.
+
+(define (open-file-dialog parent action dir mask desc)
+	(if dir
+		(if (and mask desc)
+			(net-send out (string "open-file-dialog " parent " " action " " (base64-enc dir) " " 
+								(base64-enc mask) " " (base64-enc desc) "\n"))
+			(net-send out (string "open-file-dialog " parent " " action " " (base64-enc dir) "\n")))
+		(net-send out (string "open-file-dialog " parent " " action "\n")))
+)
+
+;; @syntax (gs:panel <sym-id> [<int-width> <int-height>])
+;; @param <sym-id> The name of the panel.
+;; @param <int-width> The optional width of the panel.
+;; @param <int-height> The optional height of the panel.
+;;
+;; Panels have a flow layout by default. In a flow layout an unsized button will
+;; assume the natural size necessary to display the text on it.
+;; To change the layout use the 'set-flow-layout' or 'set-grid-layout' functions.
+
+(define (panel id width height)
+	(if (and width height)
+		(net-send out (string "panel " id " " width " " height "\n"))
+		(net-send out (string "panel " id "\n"))
+))
+
+;; @syntax (gs:paste-text <sym-id> [<str-text>])
+;; @param <sym-id> The name of the text component in which to paste text.
+;; @param <str-text> An optional text string to paste instead of the clipboard contents.
+;;
+;; If the <sym-id> contains selected text, this text gets replaced,
+;; otherwise the text is inserted at the current caret position.
+;; If no text is given in <str-text>, the text is taken from the clipboard.
+
+(define (paste-text id text)
+	(if text
+		(net-send out (string "paste-text " id " " (base64-enc text) "\n"))
+		(net-send out (string "paste-text " id "\n")))
+)
+
+;; @syntax (gs:play-sound <str-file-path>)
+;; @param <str-file-path> The path and file name of the sound file.
+;;
+;; On most OS platforms '.au' and '.wav' sound file formats are supported.
+
+(define (play-sound file-name)
+	(net-send out (string "play-sound System " (base64-enc file-name) "\n"))
+)
+
+;; @syntax (gs:progress-bar <sym-id> <int-min> <in-max> <int-initial-value>)
+;; @param <sym-id> The symbols of the progress bar.
+;; @param <int-min> The minimum value of the slider.
+;; @param <int-max> The maximum value of the slider.
+;; @param <int-initial-value> The initial value of the slider.
+
+(define (progress-bar id posmin posmax posinit)
+	(net-send out (string "progress-bar " id " " posmin " " posmax " " posinit "\n"))
+)
+
+;; @syntax (gs:radio-button <sym-id> <sym-action> [<str-text> [<bool-selected>]])
+;; @param <sym-id> The name of the radio button.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-text> The optional text of the radio button.
+;; @param <bool-seected> An optional flag 'true' or 'nil' (default) indicating the initial state of the radio button.
+
+(define (radio-button id action text selected)
+	(if text
+		(net-send out (string "radio-button " id " " action " " (base64-enc text) " " selected "\n"))
+		(net-send out (string "radio-button " id " " action "\n")))
+)
+
+;; @syntax (gs:redo-text <sym-id>)
+;; @param <sym-id> The id of the 'gs:text-pane' where to perform a redo operation.
+
+(define (redo-text id)
+	(net-send out (string "redo-text " id "\n"))
+)
+
+;; @syntax (gs:remove-from <sym-container> <sym-component> [<sym-component> ...])
+;; @param <sym-container> The container from which to remove a component.
+;; @param <sym-component> One or more optional components to remove.
+;;
+
+(define (remove-from id)
+	(let (s (string "remove-from " id " "))
+        (doargs (item)
+            (write-buffer s (string item " ")))
+        (write-buffer s "\n")
+        (net-send out s))
+)
+
+;; @syntax (gs:remove-list-item <sym-list-combo> <int-index> [<int-index> ...])
+;; @param <sym-list-combo> The name of the combo box or list box from which entries are removed.
+;; @param <int-index> The index of an entry to remove from the list or combo box.
+;;
+;; When specifying an index of <tt>0</tt>, the first item gets removed. When specifying an
+;; index equal or greater to the number of items in the list, the item is added at the end.
+
+(define (remove-list-item comp)
+	(let (s (string "remove-list-item " comp " "))
+		(doargs (item)
+			(write-buffer s (string item " ")))
+		(write-buffer s "\n")
+		(net-send out s))
+)
+
+;; @syntax (gs:remove-tab <sym-tabbed-pane> [<int-index>])
+;; @param <sym-tabbed-pane> The name of the tabbed pane.
+;; @param <int-index> The optional index of the tab to remove. The default is <tt>0</tt> for the first tab.
+
+(define (remove-tab pane idx)
+	(if idx
+		(net-send out (string "remove-tab " pane " " idx "\n"))
+		(net-send out (string "remove-tab " pane "\n")))
+)
+
+;; @syntax (gs:request-focus <sym-id> [<int-tab-index>])
+;; @param <sym-id> The name of the component for which to request focus.
+;; @param <int-tab-index> The index of a tab for which focus is requested.
+
+(define (request-focus id idx)
+	(if idx
+		(net-send out (string "request-focus " id " " idx "\n"))
+		(net-send out (string "request-focus " id "\n")))
+)
+
+;; @syntax (gs:reorder-tags <list-tags>)
+;; @param <list-tags> The list of tag symbols or tag string names in the new order of display.
+;;
+;; The re-ordering itself will not repaint the canvas use 'gs:update' to repaint the current 
+;; canvas after using 'gs:reorder-tags'. The list of tags can be given as either a list of
+;; tags symbols or name strings. Tags not appearing in <list-tags> will be deleted.
+
+(define (reorder-tags tags)
+	(let (s (string "reorder-tags " gs:currentCanvas " "))
+		(dolist (tag tags)
+			(write-buffer s (string tag " ")))
+		(write-buffer s "\n")
+		(net-send out s)
+	)
+)
+
+;; @syntax (gs:rotate-tag <sym-tag> <float theta> <int-x> <int-y> [<boolean-repaint>])
+;; @param <sym-tag> The tag group to rotate.
+;; @param <float-theta> The rotation angle in degrees (0 - 360).
+;; @param <int-x> The X-coordinate of the rotation center.
+;; @param <int-y> The Y-coordinate of the rotation center.
+;; @param <boolean-repaint> An optional flag to indicate if repainting is required (default is 'true').
+;;
+;; Like all tag operations, multiple 'gs:rotate-tag' operations are cumulative.
+
+(define (rotate-tag tag angle x y (repaint true))
+	(net-send out (string "rotate-tag " gs:currentCanvas " " tag " " angle " " 
+		x " " y " " repaint "\n"))
+)
+
+;; @syntax (gs:run-shell <id-text-area> <str-command>)
+;; @param <idx-text-area> The id of the text area to wich a shell process will be attached.
+;; @param <str-command> The command string to start the shell process.
+
+(define (run-shell id command)
+	(net-send out (string "run-shell " id " " (base64-enc command) "\n"))
+)
+
+;; @syntax (gs:save-file-dialog <sym-parent-frame> <sym-action> [<str-directory> [<str-initial-file> [<str-mask> <str-description>]]])
+;; @param <sym-parent-frame> The parent frame of the file dialog.
+;; @param <sym-action> The handler function symbol.
+;; @param <str-directory> The initial directory to show.
+;; @param <str-file> The initial file name.
+;; @param <str-mask> An optional string mask.
+;; @param <str-description> An optional mask description.
+
+(define (save-file-dialog parent action dir file mask desc)
+	(if dir
+		(if file
+			(if (and mask desc)
+				(net-send out (string "save-file-dialog " parent " " action " " (base64-enc dir) " " (base64-enc file)
+																		" " (base64-enc mask) " " (base64-enc desc) "\n"))
+				(net-send out (string "save-file-dialog " parent " " action " " (base64-enc dir) " " (base64-enc file) "\n")))
+			(net-send out (string "save-file-dialog " parent " " action " " (base64-enc dir) "\n")))
+		(net-send out (string "save-file-dialog " parent " " action "\n")))
+)
+
+;; @syntax (gs:save-text <sym-id> <str-path>)
+;; @param <sym-id> The id of the 'gs:text-pane'.
+;; @param <str-path> The full path name of the file to save.
+;;
+;; This function will write text back from a 'gs:text-pane' directly
+;; by specifying a path name only. Line feed characters (ASCII 10)
+;; are used as line terminators. If this behavior is not desired,
+;; as is the case with Windows text files, then 'gs:get-text' should
+;; be used instead. A program can then add CR characters using a 
+;; newLISP 'replace', i.e. '(replace "\n" text "\r\n")' before
+;; saving the text to a file.
+
+(define (save-text id path)
+	(net-send out (string "save-text " id " " (base64-enc path) "\n"))
+)
+
+
+;; @syntax (gs:scale-tag <sym-tag> <float-x> <float-y> [<boolean-repaint>])
+;; @param <sym-tag> The tag group to scale.
+;; @param <float-x> The X scaling factor.
+;; @param <float-y> The Y scaling factor.
+;; @param <boolean-repaint> An optional flag to indicate if repainting is required (default is 'true').
+;;
+;; 'gs:scale' scales the object to draw relative to the '0,0' point of
+;; the coordinate system. This means if a object is not at the center it
+;; will not only change in size when scaled but also change the distance
+;; to the center point of the coordinate system, moving away when scaling
+;; up with scale factor bigger '1.0' and moving closer to the center
+;; when scaling down using factors smaller than '1.0'.
+;;
+;; This means that objects which will be scaled should be defined in
+;; coordinates relative to their center point. Then a 'gs:translate-tag'
+;; command should be used to place the object to correct place:
+;;
+;; @example
+;; (gs:circle 'C 0 0 50)
+;; (gs:gs:translate-tag 'C 200 100)
+;; ...
+;; (gs:scale-tag 'C 1.1 1.1)
+
+;; In the example the circle, although defined for '0,0', will be displayed
+;; at the '200,200' position because of the 'gs:translate-tag' statement. When
+;; later scaling the circle will get bigger but stay in place.
+;; Like all tag operations, multiple 'gs:scale-tag' operations are cumulative.
+
+(define (scale-tag tag sx sy (repaint true))
+	(net-send out (string "scale-tag " gs:currentCanvas " " tag " " 
+		sx " " sy " " repaint "\n"))
+)
+
+;; @syntax (gs:select-list-item <sym-id> <str-item> [<boolean-flag>])
+;; @param <sym-id> The name of the list or combo box.
+;; @param <str-item> The item to select.
+;; @param <boolean-flag> An optional flag only for list boxes to force scrolling to the selected entry.
+;;
+;; On combo boxes the optional <boolean-flag> has no effect. The selected entry will always
+;; appear as the visible text of the combo box. The flag has either the value 'true' or 'nil'.
+
+(define (select-list-item id item flag)
+	(net-send out (string "select-list-item " id " " (base64-enc item) " " flag "\n")))
+
+
+;; @syntax (gs:select-text <sym-id> <int-from> [<int-to>])
+;; @param <sym-id> The ame of the text component.
+;; @param <int-from> Start offset of selection.
+;; @param <int-to> Optional end offset of selection.
+;;
+;; If no <int-to> end offset is given, 'gs:select-text' will
+;; select to the end of the text.
+
+(define (select-text id from to)
+	(if to
+		(net-send out (string "select-text " id " " from " " to "\n"))
+		(net-send out (string "select-text " id " " from "\n")))
+)
+
+;; @syntax (gs:scroll-pane <sym-id> <sym-widget> [<int-width> <int-height>])
+;; @param <sym-id> The name of the scroll pane.
+;; @param <sym-widget> The component in the scroll pane to be scrolled.
+;; @param <int-width> The optional width of the scroll pane.
+;; @param <int-height> The optional height of the scroll pane.
+
+(define (scroll-pane id widget width height)
+	(if (and width height)
+		(net-send out (string "scroll-pane " id " " widget " " width " " height "\n"))
+		(net-send out (string "scroll-pane " id " " widget "\n")))
+)
+
+;; @syntax (gs:set-accelerator <sym-menu-item> <str-keystroke>)
+;; @param <sym-menu-item> The name of the menu item for which an accelerator key is set.
+;; @param <str-keystroke> A text string identifying the keystroke.
+;;
+;; The following rules are used to create keystroke strings:
+;;
+;; Syntax:
+;; <blockquote><pre>
+;; modifiers* (typedID | pressedReleasedID)
+;; modifiers := shift | control | ctrl | meta | alt | button1 | button2 | button3
+;; typedID := typed typedKey
+;; typedKey := string of length 1 giving Unicode character.
+;; pressedReleasedID := (pressed | released) key
+;; key := KeyEvent key code name, i.e. the name following "VK_".
+;; </pre></blockquote>
+;; Examples:
+;; <blockquote><pre>
+;; "INSERT"
+;; "control DELETE"
+;; "alt shift X"
+;; "alt shift released X"
+;; "typed a"
+;; </pre></blockquote>
+;; Note that the <i>apple</i> key on MacOS X is the 'meta' key.
+;; The 'alt' on MacOS X is the <i>option</i> key.
+;; For letters use uppercase. 
+;; Keys are added to the menu item display automatically on all platforms.
+
+(define (set-accelerator item key)
+	(net-send out (string "set-accelerator " item " " (base64-enc key) "\n"))
+)
+
+;; @syntax (gs:set-anti-aliasing <boolean-flag>)
+;; @param <boolean-flag> The anti aliasing setting for the current canvas 'true' or 'nil'.
+;;
+;; The default setting is 'true'.
+
+(define (gs:set-anti-aliasing flag)
+	(net-send out (string "set-anti-aliasing " gs:currentCanvas " " flag "\n"))
+)
+
+;; @syntax (gs:set-background <sym-id> <float-red> <float-green> <float-blue> [<float-alpha>])
+;; @param <sym-id> The name of the component for which to set the color.
+;; @param <float-red> The red color component expressed as a number between 0.0 and 1.0.
+;; @param <float-green> The green color component expressed as a number between 0.0 and 1.0.
+;; @param <float-blue> The blue color component expressed as a number between 0.0 and 1.0.
+;; @param <float-alpha> The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).
+;;
+;; @syntax (gs:set-background <sym-id> <list-rgb> [<float-alpha>])
+;; @param <sym-id> The name of the component for which to set the color.
+;; @param <list-rgb> The rgb color can be given as a list of three numbers.
+;; @param <float-alpha> The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).
+;;
+;; Note 'set-background' is the same as 'set-color'.
+
+(define (set-background id red green blue alpha)
+	(if (list? red) 
+		(begin
+			(set 'alpha (or green 1.0)) 
+			(map set '(red green blue) red))
+		(set 'alpha (or alpha 1.0)))
+	(net-send out (string "set-color " id " " red " " green " " blue " " alpha "\n"))
+)
+
+;; @syntax (gs:set-bevel-border <sym-id> <str-type>)
+;; @param <sym-id> The name of the component.
+;; @param <str-type> The type of the bevel '"raised"' or '"lowered"'.
+
+(define (set-bevel-border id type)
+	(net-send out (string "set-bevel-border " id " " type "\n"))
+)
+
+;; @syntax (gs:set-border-layout <sym-container>  [<int-hgap> <int-vgap>])
+;; @param <sym-container> The name of the container for which border layout is set.
+;; @param <int-hgap> The horizontal gap between components in the border layout.
+;; @param <int-vgap> The vertical gap between components in the border layout.
+;;
+;; Border layout divides the layout into 5 zones labeled '"north"', '"west"',
+;; '"center"', '"east"' and '"south"'. These string constants are used in
+;; the 'gs:add-to' command when adding components to a border layout.
+;;
+;; In a border layout each component will take the maximum size if components
+;; are not sized. If components are sized only some dimensions will be honored.
+;; The '"north"' and '"south"' components will stretch to maximum width and
+;; assume the height given in a size parameter of the component. The '"east"'
+;; and '"west"' components will stretch to the maximum height available assuming
+;; their width specified earlier. The '"center"' component will take the left over
+;; maximum space.
+
+(define (set-border-layout container hgap vgap)
+	(if (and hgap vgap)
+		(net-send out (string "set-border-layout " container " "  hgap " " vgap "\n"))
+		(net-send out (string "set-border-layout " container "\n")))
+)
+
+;; @syntax (gs:set-canvas <sym-id>)
+;; @param <sym-id> The id of the canvas to switch to.
+;;
+;; The canvas in <sym-id> must have been created earlier with a 'gs:canvas' 
+;; statement. All graphics operations which do not take a canvas as argument
+;; will automatically refer to this current canvas. If no 'gs:set-canvas' is
+;; used, the current canvas is assumed to be the last one created.
+
+(define (gs:set-canvas id)
+	(net-send out (string "set-canvas " id "\n"))
+)
+
+
+;; @syntax (gs:set-caret <sym-id> <int-offset>)
+;; @param <sym-id> The name of the component for which to set the cursor caret.
+;;
+;; The functions has the same effect as calling 'gs:select-text' with the same 
+;; offset for the dot and mark position.
+
+(define (gs:set-caret id offset)
+	(net-send out (string "set-caret " id " " offset "\n"))
+)
+
+;; @syntax (gs:set-caret-color <sym-id> <float-red> <float-green> <float-blue>)
+;; @param <sym-id> The name of the component for which to set the color.
+;; @param <float-red> The red color component expressed as a number between 0.0 and 1.0.
+;; @param <float-green> The green color component expressed as a  number between 0.0 and 1.0.
+;; @param <float-blue> The blue color component expressed as a  number between 0.0 and 1.0.
+;; @syntax (gs:set-caret-color <sym-id> <list-rgb> [<float-alpha>])
+;; @param <sym-id> The name of the component for which to set the color.
+;; @param <list-rgb> The rgb color can be given as a list of three numbers.
+
+(define (set-caret-color id red green blue)
+	(if (list? red) 
+		(map set '(red green blue) red))
+	(net-send out (string "set-caret-color " id " " red " " green " " blue "\n"))
+)
+
+;; @syntax (gs:set-color <sym-id> <float-red> <float-green> <float-blue> [<float-alpha>])
+;; @param <sym-id> The name of the component for which to set the color.
+;; @param <float-red> The red color component expressed as a number between 0.0 and 1.0.
+;; @param <float-green> The green color component expressed as a number between 0.0 and 1.0.
+;; @param <float-blue> The blue color component expressed as a number between 0.0 and 1.0.
+;; @param <float-alpha> The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).
+;;
+;; @syntax (gs:set-color <sym-id> <list-rgb> [<float-alpha>])
+;; @param <sym-id> The name of the component for which to set the color.
+;; @param <list-rgb> The rgb color can be given as a list of three numbers.
+;; @param <float-alpha> The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).
+;;
+;; Note that 'set-color' is the same as 'set-background'.
+
+(define set-color set-background)
+
+;; @syntax (gs:set-cursor <sym-id> <str-shape>)
+;; @param <sym-id> The name of the frame, dialog or window.
+;; @param <str-shape> The string describing the cursor shape.
+;;
+;; The cursor shape can be one of the following:
+;; <pre>
+;;  "default"
+;;  "crosshair"
+;;  "text"
+;;  "wait"
+;;  "sw-resize"
+;;  "se-resize"
+;;  "nw-resize"
+;;  "ne-resize"
+;;  "n-resize"
+;;  "s-resize"
+;;  "w-resize"
+;;  "e-resize"
+;;  "hand"
+;;  "move"
+;; </pre>
+
+(define (set-cursor id shape)
+	(net-send out (string "set-cursor " id " " shape "\n"))
+)
+
+;; @syntax (gs:set-editable <sym-id> <boolean-editable>)
+;; @param <sym-id> The name of the text widget.
+;; @param <boolean-editable> The flag 'true' or 'nil' to indicate if this text widget can be edited.
+
+(define (set-editable id flag)
+	(net-send out (string "set-editable " id " " flag "\n"))
+)
+
+;; @syntax (gs:set-flow-layout <sym-container> [<str-alignment> [<int-hgap> <int-vgap>]])
+;; @param <sym-container> The name of the container for which flow layout is set.
+;; @param <sym-alignment> The alignment of the flow layout '"left"', '"center"' or '"right"'.
+;; @param <int-hgap> The horizontal gap between components in the flow layout.
+;; @param <int-vgap> The vertical gap between components in the flow layout.
+;;
+;; The flow layout lets components appear in their natural or preferred size. The preferred
+;; size of a component is set using the function 'gs:set-size'. Button-type widgets and
+;; combo boxes will take as much space as necessary to show the included text.
+
+(define (set-flow-layout id (direction "left") hGap vGap)
+	(if (and hGap vGap)
+		(net-send out (string "set-flow-layout " id " " direction  " " hGap " " vGap "\n"))
+		(net-send out (string "set-flow-layout " id " " direction "\n"))
+	)
+)
+
+;; @syntax (gs:set-font <sym-id> <str-family> <int-size> <str-type>)
+;; @param <sym-id> The name of the component for which to set the text font.
+;; @param <str-familiy> The family of the font, e.g.: '"Monospaced"', '"Serif"', '"Sans Serif"'.
+;; @param <int-size> The font size in points.
+;; @param <str-type> The type of the font, one or more of '"plain"', '"bold"', '"italic"'.
+;;
+;; More than the above noted families are available depending on the platform.
+
+(define (set-font id family size type)
+	(net-send out (string "set-font " id " " (base64-enc family) " " size " " type "\n"))
+)
+
+;; @syntax (gs:set-foreground <sym-id> <float-red> <float-green> <float-blue> [<float-alpha>])
+;; @param <sym-id> The name of the component for which to set the color.
+;; @param <float-red> The red color component expressed as a number between 0.0 and 1.0.
+;; @param <float-green> The green color component expressed as a  number between 0.0 and 1.0.
+;; @param <float-blue> The blue color component expressed as a  number between 0.0 and 1.0.
+;; @param <float-alpha> The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).
+;;
+;; @syntax (gs:set-foreground <sym-id> <list-rgb> [<float-alpha>])
+;; @param <sym-id> The name of the component for which to set the color.
+;; @param <list-rgb> The rgb color can be given as a list of three numbers.
+;; @param <float-alpha> The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).
+;;
+;; The foreground color is the color of the text in a component.
+
+(define (set-foreground id red green blue alpha)
+	(if (list? red) 
+		(begin
+			(set 'alpha (or green 1.0)) 
+			(map set '(red green blue) red))
+		(set 'alpha (or alpha 1.0)))
+	(net-send out (string "set-foreground " id " " red " " green " " blue " " alpha "\n"))
+)
+
+
+;; @syntax (gs:set-grid-layout <sym-container> <int-rows> <int-columns> [<int-hgap> <int-vgap>])
+;; @param <sym-container> The name of the container for which grid layout is set.
+;; @param <int-rows> The number of rows in the layout grid.
+;; @param <int-columns> The number of columns in the layout grid.
+;; @param <int-hgap> The horizontal gap between components in the grid layout.
+;; @param <int-vgap> The vertical gap between components in the grid layout.
+;;
+;; In a grid layout each component will assume the maximum size the grid cell allows
+;; regardless of sizes preset using 'gs:set-size' Because of this grid layout cells are
+;; frequently filled with panels using 'gs:panel' which have flow layout by default
+;; and allow deliberate sizing of components using 'gs:set-size'.
+
+(define (set-grid-layout container rows cols hgap vgap)
+	(if (and hgap vgap)
+		(net-send out (string "set-grid-layout " container " " rows " " cols " " hgap " " vgap "\n"))
+		(net-send out (string "set-grid-layout " container " " rows " " cols "\n")))
+)
+
+;; @syntax (gs:set-icon <sym-id> <str-icon-path> [<int-index>])
+;; @param <sym-id> The name of a button or label or menu-item for which to set an icon.
+;; @param <str-icon-path> The file path of the icon to be set.
+;; @param <int-index> If <sym-id> is a tabbed pane <int-index> is the index of the tab.
+
+(define (set-icon comp text idx)
+	(if idx
+    	(net-send out (string "set-icon " comp " " (base64-enc text) " " idx "\n"))
+    	(net-send out (string "set-icon " comp " " (base64-enc text) "\n"))
+	)
+)
+
+;; @syntax (gs:set-look-and-feel <str-look>)
+;; @param <str-look> The class description string for the look and feel of the application.
+;;
+;; The following strings can be tried in <str-look>, but not all will work on a specific
+;; platform. On the Mac the default look-and-feel is built-in to the JVM as the default
+;; style. The '"MacLookAndFeel"' is not available as an explicit flavor here, but may be
+;; on other platforms.
+;; <pre>
+;;    '"com.sun.java.swing.plaf.motif.MotifLookAndFeel"'<br>
+;;    '"javax.swing.plaf.metal.MetalLookAndFeel"'<br>
+;;    '"com.sun.java.swing.plaf.windows.WindowsLookAndFeel"'<br>
+;;    '"javax.swing.plaf.mac.MacLookAndFeel"'<br>
+;;    '"com.sun.java.swing.plaf.gtk.GTKLookAndFeel"'
+;; </pre>
+
+(define (set-look-and-feel look)
+	(net-send out (string "set-look-and-feel System " look "\n"))
+)
+
+;; @syntax (gs:set-paint <list-rgb>)
+;; @param <list-rgb> The current paint used for outlines, text and fill color.
+
+(define (gs:set-paint color)
+	(net-send out (string "set-paint " gs:currentCanvas " " (color 0) " " (color 1) " " (color 2) "\n"))
+)
+
+;; @syntax (gs:set-pressed-icon <sym-id> <str-icon-path>)
+;; @param <sym-id> The name of the button, image button or toggle button.
+;; @param <str-icon-path> The file path of the icon or image to be set to the button in pressed state.
+;;
+;; By default a small grey dot is shown on image buttons when in a pressed state.
+
+(define (set-pressed-icon comp text)
+    (net-send out (string "set-pressed-icon " comp " " (base64-enc text) "\n"))
+)
+
+;; @syntax (gs:set-resizable <sym-frame> <boolean-resizable>)
+;; @param <sym-frame> The name of the frame window.
+;; @param <bbolean-resizable> The flag 'true' or 'nil' to indicate if a frame can be resized by the user.
+
+(define (set-resizable id flag)
+	(net-send out (string "set-resizable " id " " flag "\n"))
+true
+)
+
+;; @syntax (gs:set-rotation <float-angle>)
+;; @param <float-angle> The angle in degrees (0 - 360) of the canvas rotation.
+;;
+;; Unlike the 'gs:rotate-tag' operation which is cumulative, 'gs:set-rotation'
+;; will set an absolute rotation value each time it is called.
+
+(define (gs:set-rotation angle)
+	(net-send out (string "set-rotation " gs:currentCanvas " " angle "\n"))
+)
+
+;; @syntax (gs:set-scale <int-x> <int-y>)
+;; @param <int-x> The X-scale value of the current canvas.
+;; @param <int-y> The Y-scale value of the current canvas.
+;;
+;; Unlike the 'gs:scale-tag' operation which is cumulative, 'gs:set-scale'
+;; will set an absolute scale value each time it is called.
+
+(define (gs:set-scale x y)
+	(net-send out (string "set-scale " gs:currentCanvas " " x " " y "\n"))
+)
+
+;; @syntax (gs:set-selected <sym-id> <boolean-selected> [<sym-id> <boolean-selected>])
+;; @param <sym-id> The name of the toggle or radio button or check box or menu item.
+;; @param <boolean-selected> A flag of 'true' or 'nil' to indicated the selection state.
+;;
+;; More then one toggle control may be set selected or unselected.
+
+(define (set-selected id flag)
+	(let (s (string "set-selected " id " " flag " "))
+		(doargs (item)
+			(write-buffer s (string item " ")))
+		(write-buffer s "\n")
+		(net-send out s)
+	)
+)
+
+;; @syntax (gs:set-selection-color <sym-id> <float-red> <float-green> <float-blue> [<float-alpha>])
+;; @param <sym-id> The name of the component for which to set the text selection color.
+;; @param <float-red> The red color component expressed as a number between 0.0 and 1.0.
+;; @param <float-green> The green color component expressed as a number between 0.0 and 1.0.
+;; @param <float-blue> The blue color component expressed as a number between 0.0 and 1.0.
+;; @param <float-alpha> The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).
+;;
+;; @syntax (gs:set-selection-color <sym-id> <list-rgb> [<float-alpha>])
+;; @param <sym-id> The name of the component for which to set the text selection color.
+;; @param <list-rgb> The rgb color can be given as a list of three numbers.
+;; @param <float-alpha> The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).
+;;
+;; Note 'set-background' is the same as 'set-color'.
+
+(define (set-selection-color id red green blue alpha)
+	(if (list? red) 
+		(begin
+			(set 'alpha (or green 1.0)) 
+			(map set '(red green blue) red))
+		(set 'alpha (or alpha 1.0)))
+	(net-send out (string "set-selection-color " id " " red " " green " " blue " " alpha "\n"))
+)
+
+
+;; @syntax (gs:set-size <sym-id> <int-width> <int-height>)
+;; @param <sym-id> The name of the component of which a preferred size is set.
+;; @param <int-width> The preferred width of the component.
+;; @param <int-height> The preferred height of the component.
+;;
+;; Note that not all layouts allow setting the size of a component. The grid and
+;; border layouts will size the component to its maximum possible in the layout.
+
+(define (set-size id width height)
+	(net-send out (string "set-size " id " " width " " height "\n"))
+)
+
+;; @syntax (gs:set-stroke <float-width> [<str-cap> [<str-join> [<float-miterlimit>]]])
+;; @param <float-width> The width for drawing lines and outlines in shapes.
+;; @param <str-cap> One of optional '"butt"' (default), '"round"' or '"sqare"'.
+;; @param <str-join> One of optional '"miter"' (default), '"bevel"' or '"round"'
+;;
+;; For a <float-width> 0f 0.0 the thinnest possible line width be be chosen. 
+;; Join is the decoration applied at the intersection of two path segments and at the 
+;; intersection of the endpoints.
+;; Cap is the decoration applied to the ends of unclosed subpaths and dash segments.
+;; The <float-miterlimit> should be greater or equal 1.0.
+
+(define (gs:set-stroke width cap jn limit)
+	(if cap
+		(if join
+			(if limit
+				(net-send out (string "set-stroke " gs:currentCanvas " " width " " cap " " jn " " limit "\n"))
+				(net-send out (string "set-stroke " gs:currentCanvas " " width " " cap " " jn "\n"))
+			)
+			(net-send out (string "set-stroke " gs:currentCanvas " " width " " cap "\n"))
+		)
+		(net-send out (string "set-stroke " gs:currentCanvas " " width "\n"))
+	)
+)
+
+;; @syntax (gs:set-syntax <sym-id> <str-type>)
+;; @param <sym-id> The name of the text pane for syntax coloring is enabled or disabled.
+;; @param <str-type> A string '"lsp"', '"c"', '"cpp"', '"java"' or '"php"' to indicate the 
+;; syntax desired, or 'nil' to switch off syntax highlighting.
+;;
+;; Colors for syntax highlighting are preselected for a white background, but can be changed using
+;; the following functions: 'gs:set-background', 'gs:set-foreground', 'gs:set-caret', 'gs:set-selection-color'
+;; and 'gs:set-syntax-colors'.
+
+(define (set-syntax id type)
+	(net-send out (string "set-syntax " id " " type "\n"))
+)
+
+;; @syntax (gs:set-syntax-colors <list-rgb-comment> <list-rgb-keyword> <list-rgb-string> <list-rgb-number> <list-rgb-quoted> <list-rgb-parentheses>)
+;; @param <list-rgb-comment> The color for comments.
+;; @param <list-rgb-keyword> The color for reserved keywords.
+;; @param <list-rgb-string> The color for strings.
+;; @param <list-rgb-number> The color for numbers.
+;; @param <list-rgb-quoted> The color for the quote and quoted symbols.
+;; @param <list-rgb-parentheses> The color for parenthesis.
+;;
+;; Syntax highlighting colors are given as lists of red, green and blue values between 0.0 and 1.0. 
+;; Depending on the syntax colors and the foreground and background colors set for the text pane, 
+;; the caret color and color for selected text should also be changed. Only text widgets created 
+;; using 'gs:text-pane' feature syntax highlighting.
+
+(define (set-syntax-colors comment keyword text number quoted parentheses)
+	(let (	components (append comment keyword text number quoted parentheses)
+			str "set-syntax-colors System ")
+		(dolist (c components)
+			(write-buffer str (string c " ")))
+		(write-buffer str "\n")
+		(net-send out str))
+)
+
+;; @syntax (gs:set-tab-size <sym-id> <int-size>)
+;; @param <sym-id> The name of the text area component.
+;; @param <int-size> The tabulator size.
+;;
+;; Note that 'gs:set-tab-size' will only work with fixed spaced fonts.
+
+(define (set-tab-size id size)
+	(net-send out (string "set-tab-size " id " " size "\n"))
+)
+
+;; @syntax (gs:set-text <sym-id> <str-text> [<int-index>])
+;; @param <sym-id> The name of the component for which text is set.
+;; @param <str-text> The text to be set in the component.
+;; @param <int-index> The index for a tab if the <sym-id> is a tabbed pane.
+
+(define (set-text id text idx)
+	(replace "\r" text "")
+	(if idx
+		(net-send out (string "set-text " id " " (base64-enc text) " " idx "\n"))
+		(net-send out (string "set-text " id " " (base64-enc text) "\n"))
+	)
+)
+
+;; @syntax (gs:set-titled-border <sym-component> <str-title>)
+;; @param <sym-component> The name of the component.
+;; @param <str-title> The text in the titled border around the component.
+;;
+;; The component is usually a 'panel'.
+
+(define (set-titled-border id text)
+	(net-send out (string "set-titled-border " id " " (base64-enc text) "\n"))
+)
+
+;; @syntax (gs:set-tool-tip <sym-id> <str-text>)
+;; @param <sym-id> The name of the widget for which to supply a tool tip.
+;; @param <str-text> The text of the tool tip.
+;;
+;; The tool tip text is shown when leaving the mouse over the widget for certain
+;; amount of time.
+
+(define (set-tool-tip id text)
+    (net-send out (string "set-tool-tip " id " " (base64-enc text) "\n"))
+)
+
+;; @syntax (gs:set-trace <boolean-flag>)
+;; @param <boolean-flag> The flag 'true' or 'nil'.
+
+(define (set-trace flag)
+	(net-send out (string "set-trace System " flag "\n"))
+)
+
+;; @syntax (gs:set-translation <int-x> <int-y>)
+;; @param <int-x> The X-translation value of the current canvas.
+;; @param <int-y> The Y-translation value of the current canvas.
+;;
+;; Translates the current origin of the current canvas to the point in <int-x> <int-y>.
+;; Unlike the 'gs:translate-tag' operation which is cumulative, 'gs:set-translation'
+;; will set an absolute translation value each time it is called.
+
+(define (gs:set-translation x y)
+	(net-send out (string "set-translation " gs:currentCanvas " " x " " y "\n"))
+)
+
+;; @syntax (gs:set-utf8 <boolean-flag>)
+;; @param <boolean> The flag 'true' or 'nil' to indicate if in UTF-8 mode.
+;;
+;; When set in UTF-8 mode, guiserver will convert files to UTF-8 encoding
+;; when loading and saving files. On Mac OX X UTF-8 mode is by default enabled.
+;; On startup guiserver.lsp will detect if newLISP is UTF-8 enabled and
+;; switch the mode in Guiserver accordingly using 'gs:set-utf8'.
+
+(define (gs:set-utf8 flag)
+	(net-send out (string "set-utf8 System " flag "\n"))
+)
+
+;; @syntax (gs:set-value <sym-id> <int-value>)
+;; @param <sym-id> The name of a slider or progress bar for which to set the value.
+;; @param <int-value> The integer value of the name to be set.
+;;
+;; The value should not be bigger or smaller than the minimum or maximum values set
+;; when creating the slider or progress bar, otherwise the setting will default to either
+;; the minimum or maximum preset value.
+
+(define (set-value id value)
+	(net-send out (string "set-value " id " " value "\n"))
+)
+
+;; @syntax (gs:set-visible <sym-id> <boolean-visible>)
+;; @param <sym-id> The component which is hidden or made visible.
+;; @param <boolean-visible> A flag indicating if the component is visible '"true"', '"nil"'.
+;;
+;; Except for frames and dialog windows, components are visible by default. Normally
+;; frames and dialogs are not set visible before all other components are placed inside.
+
+(define (set-visible id flag)
+	(net-send out (string "set-visible " id " " flag "\n"))
+)
+
+;; @syntax (gs:shear-tag <sym-tag> <int-x> <int-y> [<boolean-repaint>])
+;; @param <sym-tag> The tag group to shear.
+;; @param <float-x> The X shearing factor.
+;; @param <float-y> The Y shearing factor.
+;; @param <boolean-repaint> An optional flag to indicate if repainting is required (default is 'true').
+
+(define (shear-tag tag sx sy (repaint true))
+	(net-send out (string "shear-tag " gs:currentCanvas " " tag " " 
+		sx " " sy " " repaint "\n"))
+)
+
+;; @syntax (gs:show-popup <sym-tag> <sym-host> <int-x> <int-y>)
+;; @param <sym-tag> The id of the popup menu.
+;; @param <sym-host> The host container where to pop up the menu.
+;; @param <int-x> The X coordinate of the menu popup position.
+;; @param <int-y> The Y coordinate of the menu popup position.
+
+(define (gs:show-popup id host x y)
+	(net-send out (string "show-popup " id " " host " " x " " y "\n"))
+)
+
+;; @syntax (gs:show-tag <sym-tag> [<boolean-repaint>])
+;; @param <sym-tag> The tag of the group to show.
+;; @param <boolean-repaint> An optional flag to indicate if repainting is required (default is 'true').
+;;
+
+(define (show-tag tag (repaint true))
+	(net-send out (string "show-tag " gs:currentCanvas " " tag " " repaint "\n"))
+)
+
+;; @syntax (gs:slider <sym-id> <sym-action> <str-orientation> <int-min> <int-max> <int-initial-value>)
+;; @param <sym-id> The name of the slider.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-orientation> The orientation of the slider '"horizontal"' or '"vertical"'
+;; @param <int-min> The minimum value of the slider.
+;; @param <int-max> The maximum value of the slider.
+;; @param <int-initial-value> The initial value of the slider.
+
+(define (slider id action orient posmin posmax posinit)
+	(net-send out (string "slider " id " " action " " orient " " posmin " " posmax " " posinit "\n"))
+)
+
+;; @syntax (gs:split-pane <sym-id> <str-orientation> [<float-weight> [<float-location> [<int-divider-size>]]])
+;; @param <sym-id> The name of the split-pane.
+;; @param <str-orientation> The orientation '"horizontal"' or '"vertical"'.
+;; @param <float-weight> The optional weight distribution between '0.0' and '1.0' when re-sizing the window. The default is '0.0'.
+;; @param <float-location> The optional initial divider location between '0.0' and '1.0'.
+;; @param <int-divider-size) The optional size of the draggable divider in pixels.
+
+(define (split-pane id orient (weight 0.0)  (pos 0.5)  (dvdr 5))
+	(net-send out (string "split-pane " id " " orient " " weight " " pos " " dvdr "\n"))
+)
+
+;; @syntax (gs:tabbed-pane <sym-id> <sym-action> <str-orientation> [<sym-tab> <sym-tab-title> ...])
+;; @param <sym-id> The name of the tabbed pane.
+;; @param <str-orientation> The position of the tabs; either '"top"' (default), '"bottom"','"left"' or '"right"'.
+;; @param <sym-tab> The id symbol name of a tab
+;; @param <str-title> The title of the tab.
+
+(define (tabbed-pane id action orient)
+	(let (s (string "tabbed-pane " id " " action " " orient " ")
+		  t (args))
+		(while t
+			(write-buffer s (string (pop t) " " (base64-enc (pop t)) " "))
+		) 
+		(write-buffer s "\n")
+		(net-send out s))
+)
+
+;; @syntax (gs:text-area <sym-id> <sym-action> <int-width> <int-height>)
+;; @param <symid> The name of the text area.
+;; @param <sym-action> The name of the event handler.
+;; @param <int-width> The optional width of the text area..
+;; @param <int-height> The optional height of the text area.
+;; @example
+;; (gs:text-area 'TheText 'textarea-event 10 8)
+;;
+;; (define (textarea-event id code dot mark) ...)
+
+;; 'gs:text-area' transmits the following parameters in its event:
+;; <pre>
+;; id   - name of the widget 
+;; code - key code equals ASCII code. Only for text keys
+;; dot  - position of text caret in the text 
+;; mark - extended (selection) position of caret 
+;; </pre>
+
+
+(define (text-area id action width height)
+	(if (and width height)
+		(net-send out (string "text-area " id " " action " " width " " height "\n"))
+		(net-send out (string "text-area " id " " action "\n")))
+)
+
+;; @syntax (gs:text-field <sym-id> <sym-action> <int-columns>)
+;; @param <sym-id> The name of the text field.
+;; @param <sym-action> The name of the event handler.
+;; @param <int-columns> The number of columns in the text field.
+;; @example
+;; (gs:text-field 'TheText 'textfield-event)
+
+;; The 'textfield-event' is fired when the enter key is pressed in the
+;; text field.
+
+(define (text-field id action columns)
+	(net-send out (string "text-field " id " " action " " columns "\n"))
+)
+
+;; @syntax (gs:text-pane <sym-id> <sym-action> <str-style> [<int-width> <int-height>])
+;; @param <sym-id> The name of the text pane.
+;; @param <sym-action> The key action handler for the html pane.
+;; @param <sym-style> The content type of the text pane.
+;; @param <int-width> The optional width of the pane.
+;; @param <int-height> The optional height of the pane.
+;;
+;; The 'gs:text-pane' is used similar to 'gs:text-area. The following styles
+;; are supported in <sym-style>:
+;; <pre>
+;;    "text/plain"
+;;    "text/html"
+;; </pre>
+;;
+;; The 'gs:text-pane' widget will automatically display scroll bars when
+;; text does not fit in the visible space of the pane. When entering parentheses
+;; they are automatically matched with their opening or closing counterparts, if they exist.
+;; If this is undesired behavior, the simpler 'gs:text-area' control should
+;; be used instead. 
+;;
+;; On each change of the caret or selection in the text pane
+;; an event is fired containing several parameters about the caret and selection
+;; positions, the last character typed, and the modifier keys used. See the
+;; the file 'newlisp-edit.lsp' for a complex application using all features
+;; available in this widget.
+;;
+;; To make hyperlinks in 'HTML' formatted text clickable, editing must
+;; be disabled using the 'gs:set-editable' function. The functions 'gs:set-font'
+;; and 'gs:append-text' will work only on the 'text/plain' content style.
+;; @example
+;; (gs:text-pane 'TheTextPane 'textpane-event "text/plain")
+;;
+;; (define (textpane-event id code mods dot mark len undo redo) ...)
+
+;; 'gs:text-pane' transmits the following parameters in its event:
+;; <pre>
+;; id   - name of the widget 
+;; code - key code equals ASCII code. Only for text keys 
+;; mods - keys pressed together with the previous, like shift, ctrl etc.
+;; dot  - position of the text caret in the text 
+;; mark - extended (selection) position of the caret 
+;; len  - length of the text in the textarea 
+;; undo - undo enabled/disabled 
+;; redo - redo enabled/disabled 
+;; </pre>
+
+(define (text-pane id action style width height)
+	(if (and width height)
+		(net-send out (string "text-pane " id " " action " " style " " width " " height "\n"))
+		(net-send out (string "text-pane " id " " action " " style "\n"))
+	)
+)
+
+;; @syntax (gs:toggle-button <sym-id> <sym-action> <str-text> [<bool-selected>])
+;; @param <sym-id> The name of the toggle button.
+;; @param <sym-action> The name of the event handler.
+;; @param <str-text> The optional text of the toggle button.
+;; @param <bool-selected> An optional flag 'true' or 'nil' (default) indicating the initial state of the toggle button.
+
+(define (toggle-button id action text selected)
+	(if text
+		(net-send out (string "toggle-button " id " " action " " (base64-enc text) " " selected "\n"))
+		(net-send out (string "toggle-button " id " " action "\n")))
+)
+
+;; @syntax (gs:tool-bar <sym-frame> [<bool-floatable> <int-hgap> <int-vgap>])
+;; @param <sym-frame> The name of the frame hosting the toolbar.
+;; @param <bool-floatable> The optional flag 'true' or 'nil' to indicate if the toolbar can be detached.
+;; @param <int-hgap> The horizontal gap between components on the toolbar.
+;; @param <int-vgap> The vertical gap between the components on the toolbar.
+
+(define (tool-bar aframe floatable width height)
+	(if (and width height)
+		(net-send out (string "tool-bar " aframe " " floatable " " width " " height "\n"))
+		(net-send out (string "tool-bar " aframe " " floatable "\n")))
+)
+
+;; @syntax (gs:translate-tag <sym-tag> <int-x> <int-y> [<boolean-repaint>])
+;; @param <sym-tag> The name tag of the group to translate.
+;; @param <int-x> The X-coordinate translation value.
+;; @param <int-y> The Y-coordinate translation value.
+;; @param <boolean-repaint> An optional flag to indicate if repainting is required (default is 'true').
+;;
+;; Moves the origin of the coordinate system of all objects tagged with <sym-tag>.
+;; Like all tag operations multiple 'gs:translate-tag' operations are cumulative.
+
+(define (translate-tag tag x y (repaint true))
+	(net-send out (string "translate-tag " gs:currentCanvas " " tag " " x " " y " " repaint "\n"))
+)
+
+;; @syntax (gs:undo-text <sym-id>)
+;; @param <sym-id> The id of the 'gs:text-pane' where to perform an undo operation.
+
+(define (undo-text id)
+	(net-send out (string "undo-text " id "\n"))
+)
+
+;; @syntax (gs:undo-enable <sym-id> <boolean-enabled)
+;; @param <sym-id> The id of the 'gs:text-pane' for which to enabe/disable undo.
+
+(define (undo-enable id enabled)
+	(net-send out (string "undo-enable " id  " " enabled "\n"))
+)
+
+
+;; @syntax (gs:update)
+;; 
+;; Forces a repaint of the current canvas, e.g. after changing the scale or translation of a visible
+;; canvas. This function is rarely used, as most screen updates are performed automatically.
+;; All tag operations can carry an additional parameter to force update after they have been
+;; draw.
+
+(define (update)
+	(net-send out (string "update " gs:currentCanvas "\n"))
+)
+
+;; @syntax (gs:window <sym-id> <int-x> <int-y> <int-width> <int-height>)
+;; @param <sym-id> The name of the invisible window.
+;; @param <int-x> The x-coordinate of the screen position.
+;; @param <int-y> The y-coordinate of the screen position.
+;; @param <int-width> The width of the window.
+;; @param <int-height> The height of the window.
+;;
+;; Creates a borderless window. Note that a borderless window may treat
+;; some hosted components differently from normal frames and dialogs.
+
+(define (window id x y width height)
+	(net-send out (string "window " id " " x " " y " " width " " height "\n"))
+)
+
+;; @syntax (gs:window-closed <sym-id> <sym-action>)
+;; @param <sym-id> The name of the frame or dialog.
+;; @param <sym-action> The action to perform when the frame or dialog closes.
+;;
+;; A window or dialog window can be closed using the system close button in
+;; one of the corners of the window. In this case it is useful to specify
+;; a handler function which is called upon closing.
+
+(define (frame-closed id action)
+	(net-send out (string "frame-closed " id " " action "\n"))
+)
+
+(define (window-closed id action)
+	(net-send out (string "frame-closed " id " " action "\n"))
+)
+
+
+;; @syntax (gs:window-moved <sym-id> <sym-action>)
+;; @param <sym-id> The name of the frame or dialog.
+;; @param <sym-action> The action to perform when the frame or dialog moves.
+;;
+;; The event will carry the <sym-id> of the window or dialog and current <tt>X</tt> and <tt>Y</tt>
+;; coordinates on the screen.
+;;
+
+(define (frame-moved id action)
+	(net-send out (string "frame-moved " id " " action "\n"))
+)
+
+(define (window-moved id action)
+	(net-send out (string "frame-moved " id " " action "\n"))
+)
+
+
+;; @syntax (gs:window-resized <sym-id> <sym-action>)
+;; @param <sym-id> The name of the frame or dialog.
+;; @param <sym-action> The action to perform when the frame or dialog is resized.
+;;
+;; The event will carry the <sym-id> of the window or dialog and current width and
+;; height.
+
+(define (frame-resized id action)
+	(net-send out (string "frame-resized " id " " action "\n"))
+)
+
+(define (window-resized id action)
+	(net-send out (string "frame-resized " id " " action "\n"))
+)
+
+
+; eof
diff --git a/guiserver/guiserver.lsp.html b/guiserver/guiserver.lsp.html
new file mode 100644
index 0000000..4907984
--- /dev/null
+++ b/guiserver/guiserver.lsp.html
@@ -0,0 +1,2588 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+<META http-equiv="Content-Type" content="text/html; charset=utf-8">
+<title>guiserver.lsp</title>
+
+<style type="text/css" media="screen">
+<!--
+span.arw {
+	color:#666666;
+	font-size: 100%;
+	}
+	
+body, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+	line-height: 115%;
+ 	}
+
+h1, h2, h3, h4 {
+	font-family: Georgia, Times New Roman, Times, serif;
+   	font-size: 110%;
+	}
+
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+   	font-size: 100%;
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	font-size: 100%;
+	}
+-->
+</style>
+</head>
+
+<body style="margin: 20px;" text="#333333" bgcolor="#FFFFFF" 
+			link="#376590" vlink="#551A8B" alink="#ffAA28">
+<blockquote>
+<center><h1>guiserver.lsp</h1></center>
+<p><a href="index.html">Module index</a></p><br/><br/><br/><h2>Module:&nbsp;guiserver.lsp</h2><p>Functions for programming GUIs and 2D graphics.</p>
+<b>Version: </b>1.14<br/>
+<b>Author: </b>Lutz Mueller, December 2007<br/>
+<p></p>
+ This module has been tested on MacOS X 10.8 and Windows XP, both with the
+ Standard SUN Java RE v.1.5 (runtime environment) which came pre-installed on
+ those platforms.
+ <br><br>
+ <h2>What is newLISP-GS</h2>
+ <tt>guiserver.lsp</tt> is a module for interfacing to <tt>guiserver.jar</tt>
+ a Java server application for generating GUIs (graphical user interfaces)
+ and 2D graphics for newLISP applications. The <tt>guiserver.lsp</tt> module
+ implements a newLISP API much smaller and more abstract than the APIs of the 
+ Java Swing libraries which it interfaces with. Because of this, GUI applications
+ can be built much faster than when using the original Java APIs.
+ <br><br>
+ <h2>Requirements</h2>
+ At the beginning of the program file, include a <tt>load</tt> statement for the module:
+ <pre>
+ (load "/usr/share/newlisp/guiserver.lsp")
+ </pre>
+ or on MS Windows:
+ <pre>
+ (load "c:/Program Files/newlisp/guiserver.lsp")
+ </pre>
+<p></p>
+ <tt>guiserver.lsp</tt> expects the server <tt>guiserver.jar</tt> to be
+ installed in <tt>/usr/share/newlisp</tt> on MacOS X and Unix OSs, and 
+ in <tt>C:\Program Files\newlisp</tt> on MS Windows systems. On Win32 the
+ standard environment variable <tt>PROGRAMFILES</tt> is used to find the exact location
+ of non-English installations of Windows.. Both, the <tt>guiserver.lsp</tt> and 
+ <tt>guiserver.jar</tt> are installed by default when installing newLISP with one of 
+ the binary installers available.
+ <br><br>
+ <h3>Architecture of a newLISP GUI application</h3>
+ A GUI application in newLISP is composed of four parts:
+<p></p>
+ <blockquote>
+ <em>initialization</em> - this means starting the newLISP-GS <tt>guiserver.jar</tt> and initializing 
+ communications with it. Only one function call is required to do this.
+<p></p>
+ <em>building widgets</em> - in this step windows, buttons, text fields etc., and
+ all visual aspects of the GUI are described. newLISP newLISP-GS offers a wide range
+ of different control widgets.
+<p></p>
+ <em>defining event actions</em> - in this step all the functions are defined to
+ react to events coming from the GUI as a consequence of button pushes, keystrokes,
+ mouse-movements etc.. These event actions send many commands back to the GUI
+ to change information for the user, popup dialogs etc..
+<p></p>
+ <em>listening for events</em> - the newLISP program sits in a loop waiting for
+ events and dispatching them to the defined event actions. Only one function call
+ is required for this step.
+ </blockquote>
+ <br><br>
+ <h2>Example</h2>
+ The following example application shows all the essential elements of a newLISP GUI
+ application:
+ <blockquote><pre>
+ #!/usr/bin/newlisp
+ ; button-demo.lsp - demonstrate the button control
+<p></p>
+ ;;;; initialization
+ (load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+<p></p>
+ (gs:init) 
+<p></p>
+ ;;;; describe the GUI
+ (gs:frame 'ButtonDemo 100 100 400 300 "Button demo")
+ (gs:set-resizable 'ButtonDemo nil)
+ (gs:panel 'ColorPanel 360 200)
+ (gs:set-color 'ColorPanel (random) (random) (random))
+ (gs:button 'aButton 'abutton-action "color")
+ (gs:set-flow-layout 'ButtonDemo "center" 2 15)
+ (gs:add-to 'ButtonDemo 'ColorPanel 'aButton)
+ (gs:set-visible 'ButtonDemo true)
+<p></p>
+ ;;;; define actions
+ (define (abutton-action id)
+     (gs:set-color 'ColorPanel (random) (random) (random)))
+<p></p>
+ ;;;; listen for incoming action requests and dispatch
+ (gs:listen)
+<p></p>
+ ;; eof 
+ </pre></blockquote>
+ <br>
+ <h3>Application start</h3>
+ <pre>
+     ./button-demo       ; on MacOS X and Unix
+<p></p>
+     newlisp button-demo ; on Win32
+ </pre>
+ By default guiserver.jar uses the ports 47011 and 47012, but this setting can be overwritten 
+ either by supplying a port number parameter to the <tt>gs:init</tt> function or by overwriting the
+ port number from the command-line. newLISP-GS will then use the port number supplied and the number
+ following it:
+ <pre>
+     ./button-demo 10001       ; on MacOS X and Unix
+<p></p>
+     newlisp button-demo 10001 ; on Win32
+ </pre>
+ newLISP-GS <tt>guiserver.jsr</tt> will now use the ports <tt>10001</tt> and <tt>10002</tt>.
+ Ports under <tt>1024</tt> should not be used, as many of them are already in use by other
+ OS services and need administrator privileges to use them.
+<p></p>
+ A second method to start a newLISP-GS application starts the <tt>guiserver.jar</tt> first, which then
+ starts the newLISP application:
+ <pre>
+     Java -jar /usr/share/newlisp/guiserver.jar 47011 /usr/home/aUser/MyApplication.lsp
+ </pre>
+ A different port number can be used. Port numbers below 1024 need administrator
+ permissions. Optionally a splash screen can be specified as the last parameter:
+ <pre>
+     Java -jar /usr/share/newlisp/guiserver.jar 47011 /home/apps/myapp.lsp /local/newLISP128.png
+ </pre>
+ The example specifies an image inside <tt>guiserver.jar</tt>. Any other image path on the local file system
+ can be used.
+<p></p>
+ On Win32 similar methods can be used replacing the appropriate file paths, but on Win32 Java jar files
+ can also be treated as executables and executed directly without calling Java explicitly. By default
+ <tt>guiserver.jar</tt> and <tt>guiserver.lsp</tt> are  installed in <tt>c:\Program Files\newlisp\</tt> or any other 
+ directory configured on a Win32 platform using the <tt>PROGRAMFILES</tt> environment variable:
+ <pre>
+    "c:\Program Files\newlisp\guiserver.jar" 47011 c:\myprogs\MyApplication.lsp
+ </pre>
+ Quotes are necessary when spaces are present in the argument string. The example also assumes that
+ <tt>newlisp.exe</tt> is in the path for executables.
+<p></p>
+ <br><br>
+ <h2>Debugging</h2>
+ <b>Tracing commands to newLISP-GS</b><br><br>
+ For debugging purpose put the following directive at the beginning of your application
+ or at the place from where to start tracing.
+ <pre>
+         (gs:set-trace true)
+ </pre>
+ Then start the application from a terminal or command shell window. Now newLISP-GS
+ will output startup, version and connection messages and a trace for each <tt>gs:xxs</tt> directive
+ as it is received by the newLISP-GS dispatcher:
+<p></p>
+ <blockquote><pre>
+ newLISP-GS v.0.94
+ listening on 47011
+ accepted from 0.0.0.0
+ connecting to 0.0.0.0 47012
+ retrying to connect
+ connected
+ -> frame MAIN:ButtonDemo 100 100 400 300 QnV0dG9uIGRlbW8= nil
+ -> set-resizable MAIN:ButtonDemo nil
+ -> panel MAIN:ColorPanel 360 200
+ -> set-color MAIN:ColorPanel 0 1 0 0.2
+ -> button MAIN:aButton MAIN:abutton-action Y29sb3I=
+ -> set-flow-layout MAIN:ButtonDemo center 2 15
+ -> add-to MAIN:ButtonDemo MAIN:ColorPanel MAIN:aButton 
+ -> set-visible MAIN:ButtonDemo true
+ -> set-color MAIN:ColorPanel 0.8401877172 0.3943829268 0.7830992238
+ server shut down
+ </blockquote></pre>
+<p></p>
+ Text strings for button names, icon paths and other texts are encode in
+ Base64 strings as the first trace line for MAIN:ButtonDemo shows. To switch
+ off tracing mode use:
+ <pre>
+        (gs:set-trace nil)
+ </pre>
+ Even if trace mode is switched off, wrong or missing parameters are still messaged
+ by newLISP-GS in a small message box. After such an error the application and guiserver
+ will exit. Unknown commands will be ignored. Functions which are not applicable to
+ certain widgets will also pop up an error message box. In certain situations a
+ function will have no effect, e.g. <tt>gs:set-size</tt> or <tt>gs:set-color</tt> sometimes do not
+ have an effect, depending on how a widget is configured or depending on the layout
+ which hosts the widget. Sometimes the platform look-and-feel overwrites colors.
+ <br><br>
+<p></p>
+ <b>Event handlers</b><br><br>
+ For most widgets, event handlers must be defined. Sometimes an event handler is
+ not required. In this case specify <tt>'gs:no-action</tt> as the event handler
+ symbol. When developing programs it is useful to watch the event handler first
+ before coding for it. This can be done easily by printing out event parameters:
+<p></p>
+ <blockquote><pre>
+ (gs:button 'aButton 'abutton-handler "press")
+<p></p>
+ (define (abutton-handler id)
+     (println id))
+ </pre></blockquote>
+<p></p>
+ Sometimes the same event handler function is attached to several widgets' keyboard
+ or mouse events. Some of these events receive a greater number of parameters. There
+ are two easy ways to discover the nature of an event:
+<p></p>
+ <blockquote><pre>
+ (define (the-handler)
+     (doargs (p)
+         (println "->" p)))
+ </pre></blockquote>
+<p></p>
+ The other method looks at the source of the event as it was transmitted by the newLISP-GS.
+ This is useful to recognize the data types used in the event:
+<p></p>
+ <blockquote><pre>
+ (define (the-handler)
+     (println gs:event))
+ </pre></blockquote>
+<p></p>
+ All text from text fields are received as base64-encoded strings. E.g. the text: 
+ <tt>"Hello World"</tt> would be received as: <tt>"SGVsbG8gV29ybGQ="</tt>:
+<p></p>
+ <blockquote><pre>
+ (gs:text-field 'TextField 'textfield-handler)
+<p></p>
+ (define (textfield-handler id text)
+     (printnl id ": " (base64-dec text)))
+ </pre></blockquote>
+<p></p>
+ When the text "Hello World" is entered in the text field, the following output
+ would be generated:
+<p></p>
+ <blockquote><pre>
+ TextField: "Hello World"
+ </pre></blockquote>
+<p></p>
+ In case the ESC key is pressed in the text field, the event handler would
+ report <tt>nil</tt> for the text field. A handler should therefore always check text
+ for string contents before trying to apply the <tt>base64-dec</tt> function on it.
+ <br><br>
+<p></p>
+ <h3>Coding considerations</h3>
+ <b>mapping or applying <tt>gs:xxx</tt> functions</b><br><br>
+ Like any newLISP functions, <tt>gs:xxx</tt> functions can be mapped or applied to lists of 
+ parameters using the newLISP <tt>map</tt> and <tt>apply</tt> functions. When doing this, make sure to 
+ map or apply the quoted <tt>'gs:xxx symbol</tt>, so the <tt>gs:xx</tt> functions 
+ get executed under the <tt>gs</tt> context, prefixing symbols in parameter lists
+ correctly with the context prefix of their origin.
+<p></p>
+ <blockquote><pre>
+    (map 'gs:panel '(first second third fourth)) ; note quoted gs: function
+ </blockquote></pre>
+<p></p>
+ <br>
+ <h2>Some shortcuts when writing <tt>gs:xxx</tt> functions</h2>
+ Due to the nature of transfer between newLISP and the guiserver as text, the following
+ convenient shortcuts can be taken when writing functions:
+<p></p>
+ <blockquote>
+ <ul>
+ <li>Symbol ids of components can be expressed as strings.</li>
+ <li>Number values can be expressed as strings.</li>
+ <li>Numbers can be expressed as floats or integers.</li>
+ <li>String constants for type and orientation constants can be given as symbols.</li>
+ </ul>
+ </blockquote>
+<p></p>
+ Here are some examples:
+ <pre>
+     (gs:panel 'ColorPanel 360 200)
+     ; is the same as
+     (gs:panel "ColorPanel" 360 200)
+     ; is the same as
+     (gs:panel "ColorPanel" "360" "200")
+     ; is the same as
+     (gs:panel "ColorPanel" 360.0 "200.00")
+<p></p>
+     (gs:set-flow-layout 'ButtonDemo "center" 2 15)
+     ; is the same as
+     (gs:set-flow-layout 'ButtonDemo 'center 2 15)
+ </pre>
+ Although the first form is preferred for clarity and readability, in some cases coding
+ may be more efficient using the other forms.
+<p></p>
+ Except for the symbols used for action handlers, all symbols are used only by their
+ face (name) value. This means that reserved symbols of the newLISP programming
+ language can be used freely in symbol ids for all components, e.g:
+ <pre>
+     (gs:label 'name "Input here")
+ </pre>
+ The usage of the reserved symbol <tt>name</tt> will not pose a problem.
+ <br><br>
+ <h2>Return values</h2>
+ The return value of all functions is usually the number of characters
+ sent to newLISP-GS. In general, return values of <tt>gs:xxx</tt> functions do not have
+ any specific meaning and can be discarded. Only the functions <tt>gs:get-version</tt>,
+ <tt>gs:get-screen</tt> and <tt>gs:get-fonts</tt> return their respective data and copy them
+ also to the variables <tt>gs:version</tt>, <tt>gs:screen</tt> and <tt>gs:fonts</tt> for later access.
+<p></p>
+ <br><br>
+ <h2>Function overview</h2>
+ <ul>
+ <li><b>Initialization and application setup</b><br>
+ <pre>
+    (gs:init [<em>server-port</em>])
+ </pre>
+ The initialization function starts <tt>guiserver.jar</tt> which will listen to the <i>server-port</i>
+ and initiate another connection on <tt>server-port + 1</tt> back to newLISP. If a <em>server-port</em>
+ is not supplied <tt>guiserver</tt> will assume <tt>47011</tt> and <tt>47012</tt>.
+<p></p>
+ As the last statement in the application put:
+ <pre>
+    (gs:listen)
+ </pre>
+ This function listens on <tt>47012</tt> (by default) for event messages from newLISP-GS
+ and dispatches them to the user-defined action handlers. To avoid newLISP shutting down
+ when the guiserver shuts down, use:
+ <pre>
+    (gs:listen true)
+ </pre>
+ </li>
+<p></p>
+ Sometimes it is necessary to run other tasks while listening for events. In this case use
+ <tt>gs:check-event</tt>, which will wait for certain amount of microseconds for an event
+ to be executed. After the wait-time, it returns. The function is typically used in a loop:
+<p></p>
+ <pre>
+    (while (gs:check-event 10000) ; check for 10 milli seconds
+			(do-myprocess)
+	  )
+<p></p>
+    (exit)
+ </pre>
+<p></p>
+ The loop will exit when <tt>gs:check-event</tt> returns <tt>nil</tt> on communications errors, e.g.
+ when the window's close button was clicked.
+<p></p>
+ <li><b>Containers</b><br>
+ A <em>container</em> can contain any other container or control widget. Except for the 
+ <tt>menu-bar</tt> and the <tt>split-pane</tt>, containers can have a special layout-manager set 
+ with one of the three layout-manager function commands. By default containers have a flow layout. By
+ nesting different containers and using different layout-manager settings, complex layouts
+ can be configured. The function/command <tt>add-to</tt> is used to add components to containers.
+<p></p>
+ <pre>
+    (gs:dialog <em>sym-id</em> <em>sym-parent-frame</em> <em>str-message</em> <em>int-width</em> <em>int-height</em> [<em>boolean-visible</em> [<em>boolean-modal</em>]])
+    (gs:frame <em>sym-id</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> [<em>str-title</em> <em>boolean-visible</em>])
+    (gs:menu-bar <em>sym-frame</em> [<em>sym-menu-1</em> ...])  
+    (gs:panel <em>sym-id</em> [<em>int-width</em> <em>int-height</em>])
+    (gs:scroll-pane <em>sym-id</em> <em>sym-widget</em> [<em>int-width</em> <em>int-height</em>])
+    (gs:split-pane <em>sym-id</em> <em>str-orientation</em> [<em>float-weight</em> [<em>float-location</em> [int-divider-size>]]])
+    (gs:tabbed-pane <em>sym-id</em> <em>sym-action</em> <em>str-orientation</em> [<em>sym-widget</em> <em>sym-tab-title</em> ...])
+    (gs:tool-bar <em>sym-frame</em> [<em>bool-floatable</em> <em>int-hgap</em> <em>int-vgap</em>])
+    (gs:canvas <em>sym-id</em>) 
+    (gs:window <em>sym-id</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em>)
+ </pre>
+ </li>
+ <li><b>Labels</b><br>
+ Labels can have text or an image or both. A normal text <tt>label</tt> can have an icon
+ added to it and a <tt>image-label</tt> can have text added to it. Labels don't initiate
+ actions and can be placed in any container like all button-type widgets - buttons, checkboxes
+ and menu items. A basic set of icon images is built into <tt>guiserver.jar</tt>,
+ but user-supplied images and icons in <tt>.jpg</tt>, <tt>.png</tt> and <tt>.gif</tt> formats
+ can be used.
+ <pre>
+    (gs:label <em>sym-id</em> <em>str-text</em> [<em>str-align</em> [<em>int-width</em> <em>int-height</em>]])
+    (gs:image-label <em>sym-id</em> <em>str-icon-path</em> [<em>str-align</em>])
+ </pre>
+ </li>
+ <li><b>Control widgets</b><br>
+ Except for the passive progress bar, all control widgets fire action requests to
+ the newLISP program. These requests must be served to avoid error messages but can
+ be defined as empty functions, if an action is not required:
+ <pre>
+    ; empty action definition
+    (define (my-button-action) )
+<p></p>
+    ; action handler printing the name of the button pressed
+    (define (my-button-action id) (println id " has been pressed"))
+ </pre>
+ All action events calls carry information about the widget, that initiated that the event,
+ and event parameters like keystrokes, slider positions etc..
+ <pre>
+    (gs:button <em>sym-id</em> <em>sym-action</em> [<em>str-text</em> [<em>int-width</em> <em>int-height</em>]])
+    (gs:check-box <em>sym-id</em> <em>sym-action</em> [<em>str-text</em> [<em>bool-selected</em>]])
+    (gs:combo-box <em>sym-id</em> <em>sym-action</em> [<em>str-item-1</em> ...])
+    (gs:combo-box <em>sym-id</em> <em>sym-action</em> [<em>list-str-items</em>])
+    (gs:image-button <em>sym-id</em> <em>sym-action</em> <em>str-icon-path</em> [<em>str-down-icon-path</em> [<em>int-width</em> <em>int-height</em>]])
+    (gs:list-box <em>sym-id</em> <em>sym-action</em> [<em>str-item-1</em> ...])
+    (gs:list-box <em>sym-id</em> <em>sym-action</em> [<em>list-str-items</em>])
+    (gs:menu <em>sym-id</em> <em>str-text</em>)
+    (gs:menu-popup <em>sym-id</em> <em>str-text</em>)
+    (gs:menu-item <em>sym-id</em> <em>sym-action</em> <em>str-text</em>)
+    (gs:menu-item-check <em>sym-id</em> <em>sym-action</em> <em>str-text</em> [<em>bool-selected</em>])
+    (gs:progress-bar <em>sym-id</em> <em>int-min</em> <em>in-max</em> <em>int-initial-value</em>)
+    (gs:radio-button <em>sym-id</em> <em>sym-action</em> [<em>str-text</em> [<em>bool-selected</em>]])
+    (gs:slider <em>sym-id</em> <em>sym-action</em> <em>str-orientation</em> <em>int-min</em> <em>int-max</em> <em>int-initial-value</em>)
+    (gs:text-area <em>sym-id</em> <em>sym-action</em> [<em>int-width</em> <em>int-height</em>])
+    (gs:text-field <em>sym-id</em> <em>sym-action</em> <em>int-columns</em>)
+    (gs:text-pane <em>sym-id</em> <em>sym-action</em> <em>str-style</em> [<em>int-width</em> <em>int-height</em>])
+    (gs:toggle-button <em>sym-id</em> <em>sym-action</em> [<em>str-text</em> <em>bool-selected</em>])
+ </pre>
+ For all button widgets, and the check box and menu-item widgets, icons can be set using 
+ the <tt>gs:set-icon</tt> and <tt>gs:set-pressed-icon</tt> functions.
+<p></p>
+ </li>
+ <li><b>Placing components in containers</b><br>
+ For the flow and grid layouts the components are added in the sequence they are listed.
+ The grid-layout fills the grid row by row starting with the left most column. 
+ <pre>
+    (gs:add-to <em>sym-container</em> <em>sym-component</em> [<sym-component ...])
+ </pre>
+ For the border layout an orientation parameter is specified as either <tt>"north"</tt>,
+ <tt>"west"</tt>, <tt>"center"</tt>, <tt>"east"</tt> or <tt>"south"</tt>.
+ <pre>
+    (gs:add-to <em>sym-container</em> [<em>sym-component</em> <em>str-orientation</em> ...])
+ </pre>
+
+ </li>
+ <li><b>Summary of commands</b><br>
+ Most of the commands set special attributes of containers or control widgets. 
+ Not all functions can be applied to all containers and control widgets. A wrong
+ application will either pop up an error message box or do nothing.
+<p></p>
+ Some functions will work on certain widgets only in certain situations. For example
+ <tt>set-size</tt> will work not on components in a grid layout but on components
+ in a flow layout. Some widgets have a preset background color which cannot be changed
+ or is overwritten by the current <tt>gs:look-and-feel</tt> settings.
+<p></p>
+	<pre>
+    (gs:add-list-item <em>sym-list-combo</em> <em>str-text</em> [<em>str-text</em> ...])
+    (gs:add-separator <em>sym-menu-tool-bar</em>)
+    (gs:add-to <em>sym-container</em> <em>sym-component</em> [<sym-component ...])
+    (gs:add-to <em>sym-container</em> <em>sym-component</em> <em>str-orientation</em> [<em>sym-component</em> <em>str-orientation</em> ...])
+    (gs:append-text <em>sym-id</em> <em>str-text</em>)
+    (gs:check-event <em>int-microseconds</em>)
+    (gs:clear-list <em>sym-id</em>)
+    (gs:clear-text <em>sym-id</em>)
+    (gs:copy-text <em>sym-id</em>)
+    (gs:cut-text <em>sym-id</em>)
+    (gs:destroy-shell <em>sym-text-area</em>)
+    (gs:disable <em>sym-id-1</em> [<em>sym-id-2</em> ...])
+    (gs:dispose <em>sym-id</em>)
+    (gs:dispose-splash)
+    (gs:enable <em>sym-id-1</em> [<em>sym-id-2</em> ...])
+    (gs:eval-shell <em>sym-text-area</em> <em>str-commmand</em>)
+    (gs:find-text <em>sym-id</em> <em>str-text</em> <em>sym-action</em> [<em>str-direction</em>]])
+    (gs:frame-closed <em>sym-id</em> <em>sym-action</em>)
+    (gs:get-fonts)
+    (gs:get-bounds <em>sym-id</em>)
+    (gs:get-font-metrics <em>sym-id</em> <em>str-text</em>)
+    (gs:get-screen)
+    (gs:get-selected-text <em>sym-id</em> <em>sym-action</em>)
+    (gs:get-text <em>sym-id</em> [<em>sym-action</em>])
+    (gs:get-text-position <em>sym-id</em>)
+    (gs:get-version);
+    (gs:goto-text <em>sym-id</em> <em>sym-row</em> <em>sym-column</em>)
+    (gs:insert-list-item <em>sym-list-combo</em> <em>str-text</em> <em>int-index</em> [<em>str-text</em> <em>int-index</em>])
+    (gs:insert-tab <em>sym-tabbed-pane</em> <em>sym-component</em> [<em>str-text</em> [<em>int-index</em> [<em>str-icon-path</em>]])
+    (gs:insert-text <em>sym-id</em> <em>str-text</em> <em>int-pos</em>)
+    (gs:layout <em>sym-container</em>)
+    (gs:load-text <em>sym-id</em> <em>str-path</em>)
+    (gs:no-action)
+    (gs:paste-text <em>sym-id</em> [<em>str-text</em>])
+    (gs:redo-text <em>sym-id</em>)
+    (gs:remove-from <em>sym-container</em> <em>sym-component</em> [<em>sym-component</em> ...])
+    (gs:remove-list-item <em>sym-list-combo</em> <em>int-index</em> [<em>int-index</em> ...])
+    (gs:remove-tab <em>sym-tabbed-pane</em> <em>int-index</em>)
+    (gs:request-focus <em>sym-id</em>)
+    (gs:run-shell <em>sym-text-area</em> <em>str-commmand</em>)
+    (gs:select-list-item <em>sym-id</em> <em>str-item</em> [<em>boolean-flag</em>])
+    (gs:select-text <em>sym-id</em> <em>int-from</em> [<em>int-to</em>])
+    (gs:set-accelerator <em>sym-menu-item</em> <em>str-keystroke</em>)
+    (gs:set-background <em>sym-id</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em> [<em>float-alpha</em>])
+    (gs:set-background <em>sym-id</em> <em>list-rgb</em> [<em>float-alpha</em>])
+    (gs:set-bevel-border <em>sym-panel</em> <em>str-type</em>)
+    (gs:set-border-layout <em>sym-container</em>  [<em>int-hgap</em> <em>int-vgap</em>])
+    (gs:set-caret <em>sym-id</em> <em>int-offset</em>)
+    (gs:set-caret-color <em>sym-id</em> <em>list-rgb</em>)
+    (gs:set-caret-color <em>sym-id</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em>)
+    (gs:set-color <em>sym-id</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em> [<em>float-alpha</em>])
+    (gs:set-color <em>sym-id</em> <em>list-rgb</em> [<em>float-alpha</em>])
+    (gs:set-cursor <em>sym-id</em> <em>str-shape</em>)
+    (gs:set-editable <em>sym-id</em> <em>boolean-flag</em>)
+    (gs:set-flow-layout <em>sym-container</em> [<em>str-alignment</em> [<em>int-hgap</em> <em>int-vgap</em>]])
+    (gs:set-font <em>sym-id</em> <em>str-family</em> <em>int-size</em> <em>str-type</em>)
+    (gs:set-foreground <em>sym-id</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em> [<em>float-alpha</em>])
+    (gs:set-foreground <em>sym-id</em> <em>list-rgb</em> [<em>float-alpha</em>])
+    (gs:set-grid-layout <em>sym-container</em> <em>int-columns</em> <em>int-rows</em> [<em>int-hgap</em> <em>int-vgap</em>])
+    (gs:set-icon <em>sym-id</em> <em>str-icon-path</em> [<em>int-index</em>])
+    (gs:set-look-and-feel <em>str-look</em>)
+    (gs:set-resizable <em>sym-frame</em> <em>boolean-flag</em>)
+    (gs:set-pressed-icon <em>sym-id</em> <em>str-icon-path</em>)
+    (gs:set-selected <em>sym-id</em> <em>boolean-flag</em>)
+    (gs:set-size <em>sym-id</em> <em>int-width</em> <em>int-height</em>)
+    (gs:set-selection-color <em>sym-id</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em> [<em>float-alpha</em>])
+    (gs:set-syntax <em>sym-id</em> <em>str-type</em>) 
+    (gs:set-syntax-colors <em>list-rgb-comments</em> <em>list-rgb-keywords</em> <em>list-rgb-string</em> <em>list-rgb-number</em> <em>list-rgb-quoted</em> <em>list-rgb-prantheses</em>)
+    (gs:set-tab-size <em>sym-id</em> <em>int-size</em>)
+    (gs:set-text <em>sym-id</em> <em>str-text</em> [<em>int-index</em>])
+    (gs:set-titled-border <em>sym-component</em> <em>str-title</em>)
+    (gs:set-tool-tip <em>sym-id</em> <em>str-text</em>)
+    (gs:set-trace <em>boolean-flag</em>)
+    (gs:set-utf8 <em>boolean-flag</em>)
+    (gs:set-value <em>sym-id</em> <em>int-value</em>)
+    (gs:set-visible <em>sym-id</em> <em>boolean-visible</em>)
+    (gs:undo-text <em>sym-id</em>)
+    (gs:undo-enable <em>sym-id</em> <em>boolean-enabled</em>)
+ </pre>
+ </li>
+ <li><b>Special dialogs</b><br>
+  These are standard dialogs for opening and saving files and for choosing colors.
+  Each dialog when closed fires an event for which a handler function must be
+  defined by the newLISP program. 
+	<pre>
+    (gs:color-dialog <em>sym-parent-frame</em> <em>sym-action</em> <em>str-title</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em>)
+    (gs:message-dialog <em>sym-parent-frame</em> <em>str-title</em> <em>str-message</em> [<em>str-type</em> [<em>str-icon-path</em>]])
+    (gs:confirm-dialog <em>sym-parent-frame</em> <em>sym-action</em> <em>str-title</em> <em>str-message</em> [<em>str-type</em>])
+    (gs:open-file-dialog <em>sym-parent-frame</em> <em>sym-action</em> [<em>str-directory</em> [<em>str-mask</em> <em>str-description</em>]])
+    (gs:save-file-dialog <em>sym-parent-frame</em> <em>sym-action</em> [<em>str-directory</em> [<em>str-initial-file</em> [<em>str-mask</em> <em>str-description</em>]]])
+ </pre>
+ </li>
+ <li><b>2D Graphics functions</b><br>
+ Every call to a <tt>gs:draw-xxx</tt> or <tt>gs:fill-xxx</tt> function will create a new graphics object, which
+ will persist until destroyed by a call to <tt>gs:delete-tag</tt>. Graphics objects are animated
+ using the tag operations <tt>gs:move-tag</tt>, <tt>gs:rotate-tag</tt>, <tt>gs:scale-tag</tt> and 
+ <tt>gs:shear-tag</tt> or using <tt>gs:hide-tag</tt> and <tt>gs:show-tag</tt>. 
+<p></p>
+ Any <tt>gs:draw-xxx</tt> or <tt>gs:fill-xxx</tt> will create graphics objects but not force a screen update.
+ The canvas is automatically redrawn when made visible for the first time using <tt>gs:set-visible</tt> or
+ after a call to <tt>gs:update</tt>. Redrawing is also forced when resizing the window which hosts the canvas
+ or any action covering and uncovering the canvas. 
+<p></p>
+ After all tag operations redrawing is initiated by default, but it can be forced off by spcifying 
+ <tt>nil</tt> as the last parameter in a <tt>gs:xxx-tag</tt> command. Suppressing immediate redraw is useful to avoid 
+ flicker when a batch of tag operations is performed.
+<p></p>
+ Every graphics object (line, shape, text, or image) carries a group tag. Objects are deleted
+ using <tt>gs:delete-tag</tt> and will disappear immediately from the canvas. Using <tt>gs:move-tag</tt>
+ lines, shapes, text and images can be moved to a different position.
+<p></p>
+ <pre>
+    (gs:color-tag <em>sym-tag</em> <em>list-rgb</em> [<em>boolean-repaint</em>])
+    (gs:delete-tag <em>sym-tag</em>[<em>boolean-repaint</em>])
+    (gs:draw-arc <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> <em>int-start</em> <em>int-angle</em> [<em>list-rgb</em>])
+    (gs:draw-circle <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-radius</em> [<em>list-rgb</em>])
+    (gs:draw-ellipse <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-radius-x</em> <em>int-radius-y</em> [<em>list-rgb</em>])
+    (gs:draw-image <em>sym-tag</em> <em>str-path</em> <em>int-x</em> <em>int-y</em> [<em>int-width</em> <em>int-height</em>])
+    (gs:draw-line <em>sym-tag</em> <em>int-x1</em> <em>int-y1</em> <em>int-x2</em> <em>int-y2</em> [<em>list-rgb</em>])
+    (gs:draw-path <em>sym-tag</em> <em>list-points</em> [<em>list-rgb</em>])
+    (gs:draw-polygon <em>sym-tag</em> <em>list-points</em> [<em>list-rgb</em>])
+    (gs:draw-rect <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> [<em>list-rgb</em>])
+    (gs:draw-round-rect <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> <em>int-arc-width</em> <em>int-arc-height</em> [<em>list-rgb</em>])
+    (gs:g <em>sym-tag</em> <em>str-text</em> <em>int-x</em> <em>int-y</em> [<em>list-rgb</em> [<em>float-angle</em>]])
+    (gs:export <em>str-path-file</em> [<em>int-width</em> <em>int-height</em>])
+    (gs:fill-arc <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> <em>int-start</em> <em>int-angle</em> [<em>list-rgb</em>])
+    (gs:fill-circle <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-radius</em> [<em>list-rgb</em>])
+    (gs:fill-ellipse <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-radius-x</em> <em>int-radius-y</em> [<em>list-rgb</em>])
+    (gs:fill-polygon <em>sym-tag</em> <em>list-points</em> [<em>list-rgb</em>])
+    (gs:fill-rect <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> [<em>list-rgb</em>])
+    (gs:fill-round-rect <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> <em>int-arc-width</em> <em>int-arc-height</em> [<em>list-rgb</em>])
+    (gs:hide-tag <em>sym-tag</em>  [<em>boolean-repaint</em>])
+    (gs:move-tag <em>sym-tag</em> <em>int-dx</em> <em>int-dy</em> [<em>boolean-repaint</em>])
+    (gs:reorder-tags <em>list-tags</em>)
+    (gs:rotate-tag <em>sym-tag</em> <em>float theta</em> <em>int-x</em> <em>int-y</em> [<em>boolean-repaint</em>])
+    (gs:save-text <em>sym-id</em> <em>str-path</em>)
+    (gs:scale-tag <em>sym-tag</em> <em>float-x</em> <em>float-y</em> [<em>boolean-repaint</em>])
+    (gs:shear-tag <em>sym-tag</em> <em>float-x</em> <em>float-y</em> [<em>boolean-repaint</em>])
+    (gs:show-popup <em>sym-tag</em> <em>sym-host</em> <em>int-x</em> <em>int-y</em>)
+    (gs:show-tag <em>sym-tag</em> [<em>boolean-repaint</em>])
+    (gs:set-canvas <em>sym-tag</em>)
+    (gs:set-paint <em>list-rgb</em>)
+    (gs:set-rotation <em>float-angle</em>)
+    (gs:set-scale <em>int-x</em> <em>int-y</em>)
+    (gs:set-stroke <em>float-width</em> [<em>str-cap</em> [<em>str-join</em> [<em>float-miterlimit</em>]]])
+    (gs:set-translation <em>int-x</em> <em>int-y</em>)
+    (gs:set-anti-aliasing <em>boolean-flag</em>)
+    (gs:translate-tag <em>sym-tag</em> <em>int-x</em> <em>int-y</em> [<em>boolean-repaint</em>])
+    (gs:update)
+ </pre>
+ </li>
+<p></p>
+ <li><b>Events</b><br>
+ Additionally to the event actions registered when creating a widget,
+ the canvas, windows and dialogs can fire events as a result of key or mouse
+ actions or when the position or size of a windows or dialog has changed.
+<p></p>
+ <pre>
+    (gs:key-event <em>sym-id</em> <em>sym-action</em>)
+    (gs:mouse-clicked <em>sym-canvas</em> <em>sym-action</em> [<em>boolean-tags</em>])
+    (gs:mouse-dragged <em>sym-canvas</em> <em>sym-action</em>)
+    (gs:mouse-event <em>sym-id</em> <em>sym-action</em>)
+    (gs:mouse-moved <em>sym-canvas</em> <em>sym-action</em> [<em>boolean-tags</em>])
+    (gs:mouse-pressed <em>sym-canvas</em> <em>sym-action</em> [<em>boolean-tags</em>])
+    (gs:mouse-released <em>sym-canvas</em> <em>sym-action</em> [<em>boolean-tags</em>])
+    (gs:mouse-wheel <em>sym-canvas</em> <em>sym-action</em>)
+    (gs:window-closed <em>sym-id</em> <em>sym-action</em>)
+    (gs:window-moved <em>sym-id</em> <em>sym-action</em>)
+    (gs:window-resized <em>sym-id</em> <em>sym-action</em>)
+ </pre>
+ </li>
+<p></p>
+ <li><b>Built-in icons and images</b><br>
+ The <tt>guiserver.jar</tt> file has the following icons and images built in. Each of
+ them is prefixed with the path <tt>/local/</tt>. For example <tt>/local/newLISP128.png</tt>
+ addresses the newLISP logo of size 128x128. To address images outside of
+ <tt>guiserver.jar</tt>, use a normal file path suitable to your platform. On Win32
+ use forward slashes instead of backslashes.
+<p></p>
+ <pre>
+ Image path
+ ----------
+ clear-down32.png
+ clear32.png
+ copy-down32.png
+ copy32.png
+ cut-down32.png
+ cut32.png
+ dotgray16.png
+ dotgray32.png
+ dotgreen16.png
+ dotgreen32.png
+ dotred16.png
+ dotred32.png
+ dotyellow16.png
+ dotyellow32.png
+ edit-down32.png
+ edit32.png
+ folder-closed-down32.png
+ folder-closed32.png
+ folder-opened-down32.png
+ folder-opened32.png
+ font-book-down32.png
+ font-book32.png
+ green10.png
+ info-down32.png
+ info32.png
+ new-down32.png
+ new32.png
+ newLISP-down32.png
+ newLISP128.png
+ newLISP16.png
+ newLISP20.png
+ newLISP32.png
+ newLISP64.png
+ newLISPsplashWin.png
+ paste-down32.png
+ paste32.png
+ pressedbutton32.png
+ red10.png
+ restart-down32.png
+ restart32.png
+ run-down32.png
+ run32.png
+ save-down32.png
+ save32.png
+ search-down32.png
+ search32.png
+ stop-down32.png
+ stop32.png
+ </pre>
+ <li><b>Predefined colors</b><br>
+ The following colors are predefined:
+ <pre>
+ Name          rgb components
+ ----          -------------- 
+ gs:black      (0.0 0.0 0.0)
+ gs:blue       (0.0 0.0 1.0)
+ gs:cyan       (0.0 1.0 1.0)
+ gs:darkGray   (0.2509804 0.2509804 0.2509804)
+ gs:gray       (0.5019608 0.5019608 0.5019608)
+ gs:green      (0.0 1.0 0.0)
+ gs:lightGray  (0.7529412 0.7529412 0.7529412)
+ gs:magenta    (1.0 0.0 1.0)
+ gs:orange     (1.0 0.78431374 0.0)
+ gs:pink       (1.0 0.6862745 0.6862745)
+ gs:red        (1.0 0.0 0.0)
+ gs:white      (1.0 1.0 1.0)
+ gs:yellow     (1.0 1.0 0.0)
+ </pre>
+<p></p>
+ Colors in newLISP-GS can be specified as three (four with alpha component) single
+ numbers or as a list of the three RGB values followed by the alpha channel number.
+ <pre>
+ (gs:set-background 'aPanel gs:magenta
+ (gs:set-background 'aPanel 1.0 0 1
+ (gs:set-background 'aPanel '(1 0 1)
+ </pre>
+ All of the above statements will produce the same background color on the <tt>aPanel</tt>.
+ <li><b>Sound API</b><br>
+ <pre>
+    (gs:play-sound <em>str-file-path</em>)
+ </ul>
+
+
+
+
+ <br><br><br>
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_add-list-item"></a><h3><font color=#CC0000>gs:add-list-item</font></h3>
+<b>syntax: (<font color=#CC0000>gs:add-list-item</font> <em>sym-list-combo</em> <em>str-text</em> [<em>str-text</em> ...])</b><br/>
+<b>parameter: </b><em>sym-list-combo</em> - The name of the combo box or list box to which text entries are added.<br/>
+<b>parameter: </b><em>str-text</em> - The text of the entry to be added.<br/>
+<p></p>
+ Items are added in the same sequence as they appear in the <tt>gs:add-list</tt> command and added to the
+ end of the existing list of items.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_add-separator"></a><h3><font color=#CC0000>gs:add-separator</font></h3>
+<b>syntax: (<font color=#CC0000>gs:add-separator</font> <em>sym-menu-tool-bar</em>)</b><br/>
+<b>parameter: </b><em>sym-menu-tool-bar</em> - The name of the tool bar or menu bar to which a spacer entry is added.<br/>
+<p></p>
+ Depending on the OS platform the separator may not be visible and only occupy space before the next 
+ component added to the tool or menu bar.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_add-to"></a><h3><font color=#CC0000>gs:add-to</font></h3>
+<b>syntax: (<font color=#CC0000>gs:add-to</font> <em>sym-container</em> <em>sym-component</em> [<em>sym-componentl</em> ...])</b><br/>
+<b>parameter: </b><em>sym-container</em> - The name of the container to which components are added.<br/>
+<b>parameter: </b><em>sym-component</em> - One or more symbols of the components to add.<br/>
+
+
+<b>syntax: (<font color=#CC0000>gs:add-to</font> <em>sym-container</em> <em>sym-component</em> <em>str-orientation</em> [<em>sym-component</em> <em>str-orientation</em> ...])</b><br/>
+<b>parameter: </b><em>sym-container</em> - The name of the container to which components are added.<br/>
+<b>parameter: </b><em>sym-component</em> - The name of a component to add.<br/>
+<b>parameter: </b><em>str-orientation</em> - The orientation of a component to add in border layout, <tt>"north"</tt>, <tt>"west"</tt>, <tt>"center"</tt>, <tt>"east"</tt> or <tt>"south"</tt>.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_append-text"></a><h3><font color=#CC0000>gs:append-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:append-text</font> <em>sym-id</em> <em>str-text</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the text field or text area to which text is appended.<br/>
+<b>parameter: </b><em>str-text</em> - The text to be appended.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_button"></a><h3><font color=#CC0000>gs:button</font></h3>
+<b>syntax: (<font color=#CC0000>gs:button</font> <em>sym-id</em> <em>sym-action</em> [<em>str-text</em> [<em>int-width</em> <em>int-height</em>]])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the button.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-icon-path</em> - An optional text for the button.<br/>
+<b>parameter: </b><em>int-width</em> - The optional width of the button.<br/>
+<b>parameter: </b><em>int-height</em> - The optional height of the button.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_canvas"></a><h3><font color=#CC0000>gs:canvas</font></h3>
+<b>syntax: (<font color=#CC0000>gs:canvas</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the canvas.<br/>
+<p></p>
+ A canvas is a pane for drawing and receiving mouse input events. For most
+ applications a background color should be specified for the canvas using
+ <tt>gs:set-background</tt> or <tt>gs:set-color</tt> which call the same function internally. The
+ background forces the canvas to be cleared before redrawing components
+ which have been moved, rotated, scaled or deleted. In applications where
+ this is not desired but a background color is still required, the background
+ color can be specified for the container hosting the canvas. The canvas
+ background will then appear in the color of the container, but erasing
+ the canvas before repainting is not enforced.
+<p></p>
+ A canvas can also be used to host widgets like buttons etc.. In this case
+ the canvas is treated like a <tt>gs:pane</tt>, with a flow layout by default.
+ Similar to a panel created with <tt>gs:pane</tt> other layouts can be set.
+<p></p>
+ When widgets are present on a canvas they appear to be floating over
+ the drawing. See the file <tt>textrot-demo.lsp</tt> for an example.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_check-box"></a><h3><font color=#CC0000>gs:check-box</font></h3>
+<b>syntax: (<font color=#CC0000>gs:check-box</font> <em>sym-id</em> <em>sym-action</em> [<em>str-text</em> [<em>bool-selected</em>]])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the check box.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-text</em> - The text of the check box.<br/>
+<b>parameter: </b><em>bool-selected</em> - An optional flag indicating the selection state <tt>true</tt> or <tt>nil</tt> (default).<br/>
+<p></p>
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_check-event"></a><h3><font color=#CC0000>gs:check-event</font></h3>
+<b>syntax: (<font color=#CC0000>gs:check-event</font> <em>int-microseconds</em>)</b><br/>
+<b>parameter: </b><em>int-microseconds</em> - Wait for for an event a maximum of <em>int-microseconds</em> and execute it.<br/>
+<p></p>
+ The function <tt>gs:check-event</tt> is used as an alternative to <tt>gs:listen</tt> when the application
+ is performing some activity while waiting for user input from the GUI. Typically
+ <tt>gs:check-event</tt> is used in a loop, which performs some other task and at the same time
+ checks for events from the GUI part of the application. Like <tt>gs:listen</tt> the function will 
+ force an exit of the application when communication between the newLISP-GS and the newLISP
+ application process fails. 
+<p></p>
+<p></p><b>example:</b><blockquote><pre> (while (gs:check-event 10000) ; check for 10 milliseconds
+     (do-myprocess)
+ )</pre></blockquote>
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_clear-list"></a><h3><font color=#CC0000>gs:clear-list</font></h3>
+<b>syntax: (<font color=#CC0000>gs:clear-list</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sum-id</em> - The name of the list component in which to clear all entries.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_clear-text"></a><h3><font color=#CC0000>gs:clear-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:clear-text</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sum-id</em> - The name of the component in which to clear the text.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_copy-text"></a><h3><font color=#CC0000>gs:copy-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:copy-text</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sum-id</em> - The name of the text component from which to copy the selection to the clipboard.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_cut-text"></a><h3><font color=#CC0000>gs:cut-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:cut-text</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sym-id-text</em> - The name of the text component from which to cut selected text and place it on the clipboard..<br/>
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_color-dialog"></a><h3><font color=#CC0000>gs:color-dialog</font></h3>
+<b>syntax: (<font color=#CC0000>gs:color-dialog</font> <em>sym-parent-frame</em> <em>sym-action</em> <em>str-title</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em>)</b><br/>
+<b>parameter: </b><em>sym-parent-frame</em> - The name symbol of the parent frame.<br/>
+<b>parameter: </b><em>sym-action</em> - The symbol of the handler to call when leaving the dialog<br/>
+<b>parameter: </b><em>str-title</em> - The title of the color dialog.<br/>
+<b>parameter: </b><em>float-red</em> - The initial red color component.<br/>
+<b>parameter: </b><em>float-green</em> - The initial green color component.<br/>
+<b>parameter: </b><float-blue - The initial blue color component.<br/>
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_color-tag"></a><h3><font color=#CC0000>gs:color-tag</font></h3>
+<b>syntax: (<font color=#CC0000>gs:color-tag</font> <em>sym-tag</em> <em>list-color</em> [<em>boolean-update</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The name tage of the shape(s) to set a new color.<br/>
+<b>parameter: </b><em>list-color</em> - The new color as a list of 3 numbers for the rgb components.<br/>
+<b>parameter: </b><em>boolean-repaint</em> - An optional flag to indicate if repainting is required (default is <tt>true</tt>).<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_combo-box"></a><h3><font color=#CC0000>gs:combo-box</font></h3>
+<b>syntax: (<font color=#CC0000>gs:combo-box</font> <em>sym-id</em> <em>sym-action</em> [<em>str-item-1</em> ...])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the combo box.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-item</em> - Zero, one or more text entries in the combo box.<br/>
+<b>syntax: (<font color=#CC0000>gs:combo-box</font> <em>sym-id</em> <em>sym-action</em> [<em>list-str-items</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the combo box.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>list-str-items</em> - Zero, one or more text entries in a list.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_confirm-dialog"></a><h3><font color=#CC0000>gs:confirm-dialog</font></h3>
+<b>syntax: (<font color=#CC0000>gs:confirm-dialog</font> <em>sym-parent-frame</em> <em>sym-action</em> <em>str-title</em> <em>str-message</em> [<em>str-type</em>])</b><br/>
+<b>parameter: </b><em>sym-parent-frame</em> - The symbol name of the parent frame.<br/>
+<b>parameter: </b><em>sym-action</em> - The action to perform when the diaog is closed.<br/>
+<b>parameter: </b><em>str-title</em> - The title of the message box.<br/>
+<b>parameter: </b><em>str-message</em> - The message in the message box.<br/>
+<b>parameter: </b><em>str-type</em> - The type of the message box.<br/>
+<p></p>
+ The type of the message box can be one of: <tt>"yes-no"</tt>, <tt>"yes-no-cancel"</tt>
+ On return of the message box <em>sym-action</em> carries one of the responses <tt>0</tt> for the yes-,
+ <tt>1</tt> for the no- or <tt>3</tt> for the cancel-button.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_delete-tag"></a><h3><font color=#CC0000>gs:delete-tag</font></h3>
+<b>syntax: (<font color=#CC0000>gs:delete-tag</font> <em>sym-tag</em> [<em>boolean-repaint</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group to be deleted.<br/>
+<b>parameter: </b><em>boolean-repaint</em> - An optional flag to indicate if repainting is required (default is <tt>true</tt>).<br/>
+<p></p>
+ Deletes all 2D objects (lines, shapes, text, images) tagged with <em>sym-tag</em>.
+<p></p>
+ Each time a <tt>gs:draw-xxx</tt> or <tt>gs:fill-xxx</tt> function is called a graphical
+ object is created. The tag used during creation is a way to address one
+ or more of these objects. See the file <tt>mouse-demo.lsp</tt> for an example.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_destroy-shell"></a><h3><font color=#CC0000>gs:destroy-shell</font></h3>
+<b>syntax: (<font color=#CC0000>gs:destroy-shell</font> <em>sym-text-area</em>)</b><br/>
+<b>parameter: </b><em>sym-text-area</em> - The name of the text component for which the shell process is destroyed.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_dialog"></a><h3><font color=#CC0000>gs:dialog</font></h3>
+<b>syntax: (<font color=#CC0000>gs:dialog</font> <em>sym-id</em> <em>sym-parent</em> <em>str-title</em> <em>int-width</em> <em>int-height</em> [<em>boolean-visible</em> [<em>boolean-modal</em>]])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the dialog<br/>
+<b>parameter: </b><em>sym-parent</em> - The name of the parent frame.<br/>
+<b>parameter: </b><em>str-title</em> - The title string of the dialog frame.<br/>
+<b>parameter: </b><em>int-width</em> - The width of the dialog frame.<br/>
+<b>parameter: </b><em>int-height</em> - The height of the dialog frame.<br/>
+<b>parameter: </b><em>boolean-visible</em> - The optional flag with a value of <tt>true</tt> or <tt>nil</tt> for visibility of the dialog.<br/>
+<b>parameter: </b><em>boolean-modal</em> - The optional flag with a value of <tt>true</tt> or <tt>nil</tt> for modality of the dialog.<br/>
+<p></p>
+ Initially the dialog should not be visible until all widgets are added to it. 
+ When no flags for visibility and modality are specified, <tt>nil</tt> is assumed. A modal dialog will
+ prevent input in the parent window. Components can be added to a dialog using <tt>gs:add-to</tt>.
+ Use the <tt>gs:set-border-layout</tt>, <tt>ga:set-flow-layout</tt> or <tt>gs:set-grid-layout</tt> to set a specific
+ layout.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_disable"></a><h3><font color=#CC0000>gs:disable</font></h3>
+<b>syntax: (<font color=#CC0000>gs:disable</font> <em>sym-id-1</em> [sym-id-2 ...])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component to disable.<br/>
+<p></p>
+ Disabled components are grayed and do not accept input.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_dispose"></a><h3><font color=#CC0000>gs:dispose</font></h3>
+<b>syntax: (<font color=#CC0000>gs:dispose</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component to dispose of.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_dispose-splash"></a><h3><font color=#CC0000>gs:dispose-splash</font></h3>
+<b>syntax: (<font color=#CC0000>gs:dispose-splash</font>)</b><br/>
+<p></p>
+ A splash screen can be specified when starting the newLISP-GS process before newLISP. 
+ The function <tt>gs:dispose-splash</tt> is used to turn off the splash image after
+ the newLISP GUI application has started.
+<p></p>
+<p></p><b>example:</b><blockquote><pre> java -jar /usr/share/newlisp/guiserver.jar 4711 program.lsp /local/newLISP128.png
+ ; or on Win32
+ java -jar "c:\Program Files\newlisp\guiserver.jar" 4711 "newlisp program.lsp" /local/newLISPsplashWin.png</pre></blockquote>
+ The example starts newLISP-GS with an application <tt>program.lsp</tt> and a splash
+ screen showing the built-in newLISP logos and using port 4711. Instead, the full pathname 
+ of a different image file can be specified. Inside <tt>program.lsp</tt> the function
+ <tt>gs:dispose-splash</tt> or a mouse click on the image will turn off the splash screen. 
+ For <tt>program.lsp</tt> the full pathname may be necessary. On Win32 quotes are necessary to bracket 
+ arguments to <tt>guiserver.jar</tt> which contain spaces. 
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_draw-arc"></a><h3><font color=#CC0000>gs:draw-arc</font></h3>
+<b>syntax: (<font color=#CC0000>gs:draw-arc</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> <em>int-start</em> <em>int-angle</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the arc.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the arc.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the arc.<br/>
+<b>parameter: </b><em>int-width</em> - The width of the arc.<br/>
+<b>parameter: </b><em>int-height</em> - The height of the arc.<br/>
+<b>parameter: </b><em>int-start-angle</em> - The start angle of the arc in 0 to 360 degrees.<br/>
+<b>parameter: </b><em>int-arc-angle</em> - The opening angle of the arc in 0 to 360 degrees.<br/>
+<b>parameter: </b><em>list-rgb</em> - The outline color as a list of 3 numbers for the rgb components<br/>
+<p></p>
+ The resulting arc begins at <em>int-start-angle</em> and extends for <em>int-arc-angle degrees</em>, 
+ using the current color. Angles are interpreted such that 0 degrees is at the 3 o'clock 
+ position. A positive value indicates a counter-clockwise rotation while a negative value 
+ indicates a clockwise rotation.
+<p></p>
+ The center of the arc is the center of the rectangle whose origin is (x, y) and whose size 
+ is specified by the width and height arguments.
+<p></p>
+ The resulting arc covers an area <em>int-width</em> pixels wide by <em>int-height</em> pixels tall.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_draw-circle"></a><h3><font color=#CC0000>gs:draw-circle</font></h3>
+<b>syntax: (<font color=#CC0000>gs:draw-circle</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-radius</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the circle.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the circle center.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the circle center.<br/>
+<b>parameter: </b><em>int-radius</em> - The radius of the circle.<br/>
+<b>parameter: </b><em>list-rgb</em> - The outline color as a list of 3 numbers for the rgb components<br/>
+<p></p>
+ Creates the outline of a circle. The color numbers must be entered in list form.
+ If no <em>list-rgb</em> is used the current paint specified with <tt>gs:set-paint</tt> is used.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_draw-ellipse"></a><h3><font color=#CC0000>gs:draw-ellipse</font></h3>
+<b>syntax: (<font color=#CC0000>gs:draw-ellipse</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-radius-x</em> <em>int-radius-y</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the ellipse.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the ellipse center.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the ellipse center.<br/>
+<b>parameter: </b><em>int-radius-x</em> - The radius of the ellipse.<br/>
+<b>parameter: </b><em>int-radius-y</em> - The radius of the ellipse.<br/>
+<b>parameter: </b><em>list-rgb</em> - The outline color as a list of 3 numbers for the rgb components<br/>
+<p></p>
+ Creates the outline of an ellipse. The color numbers must be enterd in list form.
+ If no <em>list-rgb</em> is used the current paint specified with <tt>gs:set-paint</tt> is used.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_draw-image"></a><h3><font color=#CC0000>gs:draw-image</font></h3>
+<b>syntax: (<font color=#CC0000>gs:draw-image</font> <em>sym-tag</em> <em>str-path</em> <em>int-x</em> <em>int-y</em> [<em>int-width</em> <em>int-height</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the image.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the image top left corner.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the image top left corner.<br/>
+<b>parameter: </b><em>int-width</em> - The optional width in which to draw the image.<br/>
+<b>parameter: </b><em>int-height</em> - The optional height in which to draw the image.<br/>
+<p></p>
+ When <em>int-width</em> and <em>int-height</em> parameters are specified and they are not
+ equal to the original size of the image (measured in pixels) the image will
+ be displayed in either compressed or zoomed form.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_draw-line"></a><h3><font color=#CC0000>gs:draw-line</font></h3>
+<b>syntax: (<font color=#CC0000>gs:draw-line</font> <em>sym-tag</em> <em>int-x1</em> <em>int-y1</em> <em>int-x2</em> <em>int-y2</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tage of the line.<br/>
+<b>parameter: </b><em>int-x1</em> - The X position of the first point.<br/>
+<b>parameter: </b><em>int-y1</em> - The Y position of the first point.<br/>
+<b>parameter: </b><em>int-x2</em> - The X position of the second point.<br/>
+<b>parameter: </b><em>int-y2</em> - The Y position of the second point.<br/>
+<p></p>
+ Draws a line. The color numbers must be entered in list form.
+ If no <em>list-rgb</em> is used the current paint specified with <tt>gs:set-paint</tt> is used.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_draw-path"></a><h3><font color=#CC0000>gs:draw-path</font></h3>
+<b>syntax: (<font color=#CC0000>gs:draw-path</font> <em>sym-tag</em> <em>list-points</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tage group of the path.<br/>
+<b>parameter: </b><em>list-points</em> - The list of x and y coordinates of the points.<br/>
+<p></p>
+ Draws a path with the points found in <em>list-points</em>. 
+<p></p>
+<p></p><b>example:</b><blockquote><pre> (gs:draw-path 'P '(1 0 2 2 3 0))</pre></blockquote>
+ The example will draw an upwards-pointing triangle without base at the 
+ points <tt>1,0</tt>, <tt>2,2</tt> and <tt>3,0</tt> 
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_draw-polygon"></a><h3><font color=#CC0000>gs:draw-polygon</font></h3>
+<b>syntax: (<font color=#CC0000>gs:draw-polygon</font> <em>sym-tag</em> <em>list-points</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the polygon.<br/>
+<b>parameter: </b><em>list-points</em> - The list of x and y coordinates of the points.<br/>
+<p></p>
+ Draws a polygon with the points found in <em>list-points</em>. 
+<p></p>
+<p></p><b>example:</b><blockquote><pre> (gs:draw-polygon 'P '(1 0 2 2 3 0))</pre></blockquote>
+ The example will draw an upwards-pointing triangle with the points <tt>1,0</tt>, <tt>2,2</tt>
+ and <tt>3,0</tt>.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_draw-rect"></a><h3><font color=#CC0000>gs:draw-rect</font></h3>
+<b>syntax: (<font color=#CC0000>gs:draw-rect</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the rectangle.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the top left corner.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the top left corner.<br/>
+<b>parameter: </b><em>int-width</em> - The width of the rectangle.<br/>
+<b>parameter: </b><em>int-height</em> - The height of the rectangle..<br/>
+<b>parameter: </b><em>list-rgb</em> - The outline color as a list of 3 numbers for the rgb components<br/>
+<p></p>
+ Creates the outline of a rectangle. The color numbers must be entered in list form.
+ If no <em>list-rgb</em> is used the current paint specified with <tt>gs:set-paint</tt> is used.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_draw-round-rect"></a><h3><font color=#CC0000>gs:draw-round-rect</font></h3>
+<b>syntax: (<font color=#CC0000>gs:draw-round-rect</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> <em>int-arc-width</em> <em>int-arc-height</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the round rectangle.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the top left corner.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the top left corner.<br/>
+<b>parameter: </b><em>int-width</em> - The width of the rectangle.<br/>
+<b>parameter: </b><em>int-height</em> - The height of the rectangle..<br/>
+<b>parameter: </b><em>int-arc-width</em> - The width of the corner rectangle.<br/>
+<b>parameter: </b><em>int-arc-height</em> - The height of the corner rectangle..<br/>
+<b>parameter: </b><em>list-rgb</em> - The outline color as a list of 3 numbers for the rgb components<br/>
+<p></p>
+ Draws a rectangle shape with round corners. The rounding is defined by the rectangle enclosing
+ the rounding arc.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_draw-text"></a><h3><font color=#CC0000>gs:draw-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:draw-text</font> <em>sym-tag</em> <em>str-text</em> <em>int-x</em> <em>int-y</em> [<em>list-rgb</em> [<em>float-angle</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the text.<br/>
+<b>parameter: </b><em>str-text</em> - The text to be drawn.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the text.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the text.<br/>
+<b>parameter: </b><em>list-rgb</em> - The optonal color for the text.<br/>
+<b>parameter: </b><em>float-angle</em> - The optional angle for text in degrees<br/>
+<p></p>
+ If no <em>list-rgb</em> is used, the current paint specified with <tt>gs:set-paint</tt> is used.
+ The optional angle is <tt>0</tt> by default for horizontal text. A value of <tt>90</tt>
+ will rotate the text around the <tt>x</tt>, <tt>y</tt> position downwards clockwise.
+
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_enable"></a><h3><font color=#CC0000>gs:enable</font></h3>
+<b>syntax: (<font color=#CC0000>gs:enable</font> <em>sym-id-1</em> [sym-id-2 ...])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of a component to enable.<br/>
+<p></p>
+ Components are enabled by default.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_eva-shell"></a><h3><font color=#CC0000>gs:eva-shell</font></h3>
+<b>syntax: (<font color=#CC0000>gs:eva-shell</font> <em>sym-id-text-area</em> <em>str-command</em>)</b><br/>
+<b>parameter: </b><em>sym-id-text-area</em> - The name of the text are in which to evaluate text.<br/>
+<b>parameter: </b><em>str-command</em> - The text to evaluate in the shell.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_export"></a><h3><font color=#CC0000>gs:export</font></h3>
+<b>syntax: (<font color=#CC0000>gs:export</font> <em>str-path-file</em> [<em>int-width</em> <em>int-height</em>])</b><br/>
+<b>parameter: </b><em>str-path-file</em> - The path and file name of the image file to write to.<br/>
+<b>parameter: </b><em>int-width</em> - The optional width of the image in pixels.<br/>
+<b>parameter: </b><em>int-height</em> - The optional height of the image in pixels.<br/>
+<p></p>
+ If no width and height are specified, the current size of the canvas is assumed.
+<p></p>
+<p></p><b>example:</b><blockquote><pre>
+ (gs:export "/usr/home/pictures/mypic.png")</pre></blockquote>
+ This will generate a <tt>.png</tt> file exactly as the image seen on the screen.
+ The color format is RGBA with 8 bit per color and an alpha channel. When
+ no background color is defined for the canvas, the background will be
+ transparent.
+<p></p>
+ When specifying width and height, a smaller or bigger portion of the canvas
+ than seen on the screen is printed to the image.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_fill-arc"></a><h3><font color=#CC0000>gs:fill-arc</font></h3>
+<b>syntax: (<font color=#CC0000>gs:fill-arc</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> <em>int-start</em> <em>int-angle</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the arc.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the arc.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the arc.<br/>
+<b>parameter: </b><em>int-width</em> - The width of the arc.<br/>
+<b>parameter: </b><em>int-height</em> - The height of the arc.<br/>
+<b>parameter: </b><em>int-start-angle</em> - The start angle of the arc in 0 to 360 degrees.<br/>
+<b>parameter: </b><em>int-arc-angle</em> - The opening angle of the arc in 0 to 360 degrees.<br/>
+<b>parameter: </b><em>list-rgb</em> - The outline color as a list of 3 numbers for the rgb components.<br/>
+<p></p>
+ The resulting arc begins at <em>int-start-angle</em> and extends for <em>int-arc-angle degrees</em>, 
+ using the current color. Angles are interpreted such that 0 degrees is at the 3 o'clock 
+ position. A positive value indicates a counter-clockwise rotation while a negative value 
+ indicates a clockwise rotation.
+<p></p>
+ The center of the arc is the center of the rectangle whose origin is (x, y) and whose size 
+ is specified by the width and height arguments.
+<p></p>
+ The resulting arc covers an area <em>int-width</em> pixels wide by <em>int-height</em> pixels tall.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_fill-circle"></a><h3><font color=#CC0000>gs:fill-circle</font></h3>
+<b>syntax: (<font color=#CC0000>gs:fill-circle</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-radius</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the circle.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the circle center.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the circle center.<br/>
+<b>parameter: </b><em>int-radius</em> - The radius of the circle.<br/>
+<b>parameter: </b><em>list-rgb</em> - The outline color as a list of 3 numbers for the rgb components.<br/>
+<p></p>
+ Creates a filled  circle. The color numbers must be entered in list form.
+ If no <em>list-rgb</em> is used, the current paint specified with <tt>gs:set-paint</tt> is used.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_fill-ellipse"></a><h3><font color=#CC0000>gs:fill-ellipse</font></h3>
+<b>syntax: (<font color=#CC0000>gs:fill-ellipse</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-radius-x</em> <em>int-radius-y</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the ellipse.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the ellipse center.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the ellipse center.<br/>
+<b>parameter: </b><em>int-radius-x</em> - The radius of the ellipse.<br/>
+<b>parameter: </b><em>int-radius-y</em> - The radius of the ellipse.<br/>
+<b>parameter: </b><em>list-rgb</em> - The fill color as a list of 3 numbers for the rgb components.<br/>
+<p></p>
+ Creates a filled ellipse. The color numbers must be entered in list form.
+ If no <em>list-rgb</em> is used, the current paint specified with <tt>gs:set-paint</tt> is used.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_fill-polygon"></a><h3><font color=#CC0000>gs:fill-polygon</font></h3>
+<b>syntax: (<font color=#CC0000>gs:fill-polygon</font> <em>sym-tag</em> <em>list-points</em> [<em>list-color</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the polygon.<br/>
+<b>parameter: </b><em>list-points</em> - The list of x and y coordinates of the points.<br/>
+<p></p>
+ Draws a polygon with the points found in <em>list-points</em> and fills it with
+ the current color set with <tt>gs:set-paint</tt> or the optional color
+ given in <em>list-color</em>.
+<p></p>
+<p></p><b>example:</b><blockquote><pre> (gs:fill-polygon 'P '(1 0 2 2 3 0))
+
+ (gs:fill-polygon 'P '(1 0 2 2 3 0) gs:gray)</pre></blockquote>
+ The example will fill an upwards pointing triangle with the points <tt>1,0</tt>, <tt>2,2</tt>
+ and <tt>3,0</tt> and fill it with the current color set with <tt>gs:set-paint</tt>. The second
+ example paints a gray triangle regardless of the current color set with
+ <tt>gs:set-paint</tt>.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_fill-rect"></a><h3><font color=#CC0000>gs:fill-rect</font></h3>
+<b>syntax: (<font color=#CC0000>gs:fill-rect</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the rectangle.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the top left corner.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the top left corner.<br/>
+<b>parameter: </b><em>int-width</em> - The width of the rectangle.<br/>
+<b>parameter: </b><em>int-height</em> - The height of the rectangle.<br/>
+<b>parameter: </b><em>list-rgb</em> - The fill color as a list of 3 numbers for the rgb components.<br/>
+<p></p>
+ Creates a filled rectangle. The color numbers must be entered in list form.
+ If no <em>list-rgb</em> is used, the current paint specified with <tt>gs:set-paint</tt> is used.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_fill-round-rect"></a><h3><font color=#CC0000>gs:fill-round-rect</font></h3>
+<b>syntax: (<font color=#CC0000>gs:fill-round-rect</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> <em>int-arc-width</em> <em>int-arc-height</em> [<em>list-rgb</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group of the round rectangle.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the top left corner.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the top left corner.<br/>
+<b>parameter: </b><em>int-width</em> - The width of the rectangle.<br/>
+<b>parameter: </b><em>int-height</em> - The height of the rectangle..<br/>
+<b>parameter: </b><em>int-arc-width</em> - The width of the corner rectangle.<br/>
+<b>parameter: </b><em>int-arc-height</em> - The height of the corner rectangle.<br/>
+<b>parameter: </b><em>list-rgb</em> - The outline color as a list of 3 numbers for the rgb components.<br/>
+<p></p>
+ Paints a rectangle shape with round corners. The rounding is defined by the rectangle enclosing
+ the rounding arc.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_find-text"></a><h3><font color=#CC0000>gs:find-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:find-text</font> <em>sym-id</em> <em>str-text</em> <em>sym-action</em> [<em>str-direction</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the textr area or text pane.<br/>
+<b>parameter: </b><em>boolean-next</em> - The optional direction string <tt>"next"</tt> (default) or <tt>"previous"</tt>.<br/>
+<b>parameter: </b><em>sym-action</em> - A optional action to peform after find-text.<br/>
+<p></p>
+ The text area or text pane will be searched starting at the current caret position
+ forward or backwards depending on the optional direction field. After the search
+ the found text is highlighted. If the optional <em>sym-action</em> is specified an event
+ containing the id of the text area or pane and found position or <tt>-1</tt> will be fired.
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_frame"></a><h3><font color=#CC0000>gs:frame</font></h3>
+<b>syntax: (<font color=#CC0000>gs:frame</font> <em>sym-id</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em> [<em>str-title</em> <em>boolean-visible</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the frame window.<br/>
+<b>parameter: </b><em>int-x</em> - The X position of the top left window corner.<br/>
+<b>parameter: </b><em>int-y</em> - The Y position of the top left windows corner.<br/>
+<b>parameter: </b><em>int-width</em> - The width of the window frame.<br/>
+<b>parameter: </b><em>int-height</em> - The height of the windows frame.<br/>
+<b>parameter: </b><em>str-title</em> - The optional title of the window.<br/>
+<b>parameter: </b><em>boolean-visible</em> - The optional flag with a value of <tt>true</tt> or <tt>nil</tt> for the visibility of the window.<br/>
+<p></p>
+ Initially the frame should not be visible until all widgets are added to it. 
+ When no flag for visibility is specified <tt>nil</tt> is assumed. The default layout of a frame behaves
+ like a grid layout with one cell. Use the <tt>set-flow-layout</tt>, <tt>set-border-layout</tt> and
+ <tt>set-grid-layout</tt> to change the layout.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_get-bounds"></a><h3><font color=#CC0000>gs:get-bounds</font></h3>
+<b>syntax: (<font color=#CC0000>gs:get-bounds</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The id of the component for which to get the list of bounding values.<br/>
+<p><b>return: </b>The bounding list <tt>(<em>x</em> <em>y</em> <em>width</em> <em>height</em>)</tt></p>
+ 
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_get-fonts"></a><h3><font color=#CC0000>gs:get-fonts</font></h3>
+<b>syntax: (<font color=#CC0000>gs:get-fonts</font>)</b><br/>
+<p><b>return: </b>A list of family names for fonts on the current system.</p>
+<p></p>
+ The function should be called only once because it may take considerable
+ time in a system loaded with many fonts. The variable <tt>gs:fonts</tt> contains
+ the same list of fonts originally returned by a call to <tt>gs:get-fonts</tt>.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_get-font-metrics"></a><h3><font color=#CC0000>gs:get-font-metrics</font></h3>
+<b>syntax: (<font color=#CC0000>gs:get-font-metrics</font> <em>sym-id</em> <em>str-text</em>)</b><br/>
+<p><b>return: </b>A list of the two values for width and height in pixels.</p>
+<p></p>
+ The font metrics for the currently set font in <em>sym-id</em> are returned as a list
+ of width and height in pixels when displaying the string in <em>str-text</em>.
+ After the function call the variable <tt>gs:font-metrics</tt> contains the same list
+ of values as originally returned by the call to <tt>gs:get-font-metrics</tt>.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_get-screen"></a><h3><font color=#CC0000>gs:get-screen</font></h3>
+<b>syntax: (<font color=#CC0000>gs:get-screen</font>)</b><br/>
+<p><b>return: </b>A list of screen width, height and resolution of the main computer screen.</p>
+<p></p>
+ After calling the <tt>gs:get-screen</tt> once the screen parameters are also available
+ in the variable <tt>gs:screen</tt>.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_get-selected-text"></a><h3><font color=#CC0000>gs:get-selected-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:get-selected-text</font> <em>sym-id</em> <em>sym-action</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component from which to get the selected text.<br/>
+<b>parameter: </b><em>sym-action</em> - The symbol of the event handler which will receive the selected text.<br/>
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_get-text"></a><h3><font color=#CC0000>gs:get-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:get-text</font> <em>sym-id</em> [<em>sym-action</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component from which to get the text.<br/>
+<b>parameter: </b><em>sym-action</em> - The optional symbol of the event handler which will receive the text.<br/>
+<p></p>
+ If no <em>sym-action</em> is specified the function will block until the text is returned. 
+ After return the text is also available in the variable <tt>gs:text</tt>.
+ If <em>sym-action</em> is specified the function will return immediately and a <em>sym-action</em> event 
+ is fired containing the text. 
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_get-text-position"></a><h3><font color=#CC0000>gs:get-text-position</font></h3>
+<b>syntax: (<font color=#CC0000>gs:get-text-position</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the text component for which the line and column position is returned.<br/>
+<p><b>return: </b>A list of line and column position of the text caret.</p>
+<p></p>
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_get-version"></a><h3><font color=#CC0000>gs:get-version</font></h3>
+<b>syntax: (<font color=#CC0000>gs:get-version</font>)</b><br/>
+<p><b>return: </b>The version string of newLISP-GS running.</p>
+<p></p>
+ After calling the <tt>gs:get-version</tt> once the version number is also
+ available in <tt>gs:version</tt>.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_goto-text"></a><h3><font color=#CC0000>gs:goto-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:goto-text</font> <em>sym-id</em> <em>int-row</em> <em>int-column</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the text widget.<br/>
+<b>parameter: </b><em>int-row</em> - The row number where to place the cursor.<br/>
+<b>parameter: </b><em>int-column</em> - The column number where to place the cursor.<br/>
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_hide-tag"></a><h3><font color=#CC0000>gs:hide-tag</font></h3>
+<b>syntax: (<font color=#CC0000>gs:hide-tag</font> <em>sym-tag</em> [<em>boolean-repaint</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag of the group to hide.<br/>
+<b>parameter: </b><em>boolean-repaint</em> - An optional flag to indicate if repainting is required (default is <tt>true</tt>).<br/>
+<p></p>
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_image-button"></a><h3><font color=#CC0000>gs:image-button</font></h3>
+<b>syntax: (<font color=#CC0000>gs:image-button</font> <em>sym-id</em> <em>sym-action</em> <em>str-icon-path</em> [<em>str-down-icon-path</em> [<em>int-width</em> <em>int-height</em>]])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the image button.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-icon-path</em> - The path for an image icon.<br/>
+<b>parameter: </b><em>str-down-con-path</em> - The path for a pressed down image icon.<br/>
+<b>parameter: </b><em>int-width</em> - The optional width of the image button.<br/>
+<b>parameter: </b><em>int-height</em> - The optional height of the image button.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_image-label"></a><h3><font color=#CC0000>gs:image-label</font></h3>
+<b>syntax: (<font color=#CC0000>gs:image-label</font> <em>sym-id</em> <em>str-icon-path</em> [<em>str-align</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the label.<br/>
+<b>parameter: </b><em>str-ucon-path</em> - A string with the icon file path.<br/>
+<b>parameter: </b><em>str-align</em> - An optional alignment <tt>"left"</tt>, <tt>"center"</tt> or <tt>"right"</tt>, <tt>"leading"</tt>, <tt>"trailing"</tt>, <tt>"bottom"</tt> or <tt>"top"</tt>.<br/>
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_init"></a><h3><font color=#CC0000>gs:init</font></h3>
+<b>syntax: (<font color=#CC0000>gs:init</font> [<em>int-port</em> <em>str-host</em>])</b><br/>
+<b>parameter: </b><em>int-port</em> - The optional guiserver server port.<br/>
+<b>parameter: </b><em>str-host</em> - The optional remote host of the guiserver.<br/>
+
+
+
+
+
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_insert-list-item"></a><h3><font color=#CC0000>gs:insert-list-item</font></h3>
+<b>syntax: (<font color=#CC0000>gs:insert-list-item</font> <em>sym-list-combo</em> <em>str-text</em> <em>int-index</em> [<em>str-text</em> <em>int-index</em>])</b><br/>
+<b>parameter: </b><em>sym-list-combo</em> - The name of the combo box or list box from which entries are removed.<br/>
+<b>parameter: </b><em>str-text</em> - The text of the list or combo box item to insert.<br/>
+<b>parameter: </b><em>int-index</em> - The index of an entry to add to the list or combo box.<br/>
+<p></p>
+ When specifying an index of <tt>0</tt> the first item gets inserted at the beginning. 
+ When specifying an index equal or greater to the number of items in the list, the item 
+ is added at the end.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_insert-tab"></a><h3><font color=#CC0000>gs:insert-tab</font></h3>
+<b>syntax: (<font color=#CC0000>gs:insert-tab</font> <em>sym-tabbed-pane</em> <em>sym-component</em> [<em>str-text</em> [<em>int-index</em> [<em>str-icon-path</em>]]])</b><br/>
+<b>parameter: </b><em>sym-tabbed-pane</em> - The name of the tabbed pane.<br/>
+<b>parameter: </b><em>sym-component</em> - The name of the component to insert as a tab.<br/>
+<b>parameter: </b><em>str-text</em> - The optional text on the tab.<br/>
+<b>parameter: </b><em>int-index</em> - The optional index where to insert the new tab.<br/>
+<b>parameter: </b><em>str-icon-path</em> - The file path to an optional icon.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_insert-text"></a><h3><font color=#CC0000>gs:insert-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:insert-text</font> <em>sym-id</em> <em>str-text</em> <em>int-position</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the text component.<br/>
+<b>parameter: </b><em>str-text</em> - The text to insert.<br/>
+<b>parameter: </b><em>int-position</em> - The offset position where to insert the text.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_key-event"></a><h3><font color=#CC0000>gs:key-event</font></h3>
+<b>syntax: (<font color=#CC0000>gs:key-event</font> <em>sym-id</em> <em>sym-action</em>)</b><br/>
+<b>parameter: </b><em>sym-canvas</em> - The id of the component to register the action handler.<br/>
+<b>parameter: </b><em>sym-action</em> - The symbol of the action handler.<br/>
+<p></p>
+ <tt>gs:key-event</tt> can be used to register a general unspecific key event handler
+ for any component in the system. Since version 1.05 of newLISP-GS this also
+ includes text widgets, which alrady handle key events using their normal event 
+ handler function. With <tt>gs:key-event</tt> a second handler function can be registered
+ for text widgets. Both functions will fire on their respective events.
+<p></p>
+ Components respond to the following key event types: <tt>"pressed"</tt>, <tt>"released"</tt>, <tt>"typed"</tt>.
+<p></p>
+<p></p><b>example:</b><blockquote><pre>
+ (define (key-action id type code modifiers)
+     (println "id:" id " type:" type " key code:" code " modifiers:" modifiers)
+ )</pre></blockquote>
+ The example shows a handler which prints all key event parameters to the terminal/shell
+ window where the applicaton was started.
+<p></p>
+ In order for key events to work, the component for which a key action handler
+ is registered must have the input focus. Use <tt>"gs:request-focus"</tt> to set the
+ input focus for the component.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_label"></a><h3><font color=#CC0000>gs:label</font></h3>
+<b>syntax: (<font color=#CC0000>gs:label</font> <em>sym-id</em> <em>str-text</em> [<em>str-align</em> [<em>int-width</em> <em>int-height</em>]])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the label.<br/>
+<b>parameter: </b><em>str-text</em> - The text to appear on the label.<br/>
+<b>parameter: </b><em>str-align</em> - The optional alignment of the text.<br/>
+<b>parameter: </b><em>int-width</em> - The optional width of the label.<br/>
+<b>parameter: </b><em>int-height</em> - The optional height of the label.<br/>
+<p></p>
+ The following alignment constants can be supplied: <tt>"left"</tt>, <tt>"center"</tt>, '"right"",
+ <tt>"leading"</tt>, <tt>"trailing"</tt>, <tt>"bottom"</tt> and "<tt>top</tt>". By default each label text is
+ <tt>"center"</tt> aligned.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_layout"></a><h3><font color=#CC0000>gs:layout</font></h3>
+<b>syntax: (<font color=#CC0000>gs:layout</font> <em>sym-container</em>)</b><br/>
+<b>parameter: </b><em>sym-container</em> - The id of the container to lay out.<br/>
+<p></p>
+ Forces the container to lay out its components again, e.g. after a <tt>gs:add-to</tt> or <tt>gs:remove-from</tt>
+ when the container was already visible.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_load-text"></a><h3><font color=#CC0000>gs:load-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:load-text</font> <em>sym-id</em> <em>str-path</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The id of the <tt>gs:text-pane</tt>.<br/>
+<b>parameter: </b><em>str-path</em> - The full path name of the file to load.<br/>
+<p></p>
+ <tt>gs:load-text</tt> will load text into a <tt>gs:text-pane</tt> directly by specifying
+ the path name. During loading, CR-LF line terminators are automatically
+ translated to LF-only line terminators by stripping all CRs from the file. All internal
+ operations of guiserver on text assume LF as a line terminator.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_listen"></a><h3><font color=#CC0000>gs:listen</font></h3>
+<b>syntax: (<font color=#CC0000>gs:listen</font> [<em>boolean-flag</em>])</b><br/>
+<b>parameter: </b><em>boolean-flag</em> - Prevent exit on loss of communication.<br/>
+<p><b>return: </b>Never returns. Exits the application when the guiserver exits, except when <em>boolean-flag</em> is <tt>true</tt>.</p>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_list-box"></a><h3><font color=#CC0000>gs:list-box</font></h3>
+<b>syntax: (<font color=#CC0000>gs:list-box</font> <em>sym-id</em> <em>sym-action</em> [<em>str-item-1</em> ...])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the list box.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-item</em> - Zero, one or more text entries in the list box.<br/>
+<b>syntax: (<font color=#CC0000>gs:list-box</font> <em>sym-id</em> <em>sym-action</em> [<em>list-str-items</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the list box.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-item</em> - Zero, one or more text entries in the list box.<br/>
+
+ The listbox when clicked with the mouse, or when the [enter] key is
+ presses, will pass the following parameters to the event handler:
+ <br><br>
+ <em>id</em> - the id string of the list box<br>
+ <em>index</em> - the zero offset index of the highlighted listbox entry<br>
+ <em>item</em> - the string of the highlighted listbox entry<br>
+ <em>click-count</em> - the number of times the mouse has been clicked<br>
+ </tt>
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_message-dialog"></a><h3><font color=#CC0000>gs:message-dialog</font></h3>
+<b>syntax: (<font color=#CC0000>gs:message-dialog</font> <em>sym-parent-frame</em> <em>str-title</em> <em>str-message</em> [<em>str-type</em> [<em>str-icon-path</em>]])</b><br/>
+<b>parameter: </b><em>sym-parent-frame</em> - The symbol name of the parent frame.<br/>
+<b>parameter: </b><em>str-title</em> - The title of the message box.<br/>
+<b>parameter: </b><em>str-message</em> - The message in the message box.<br/>
+<b>parameter: </b><em>str-type</em> - The type of the message box.<br/>
+<b>parameter: </b><em>str-icon-path</em> - The optional path for an icon.<br/>
+<p></p>
+ The type of the message box can be one of: <tt>"error"</tt>, <tt>"information"</tt>, <tt>"warning"</tt>, <tt>"question"</tt>, <tt>"plain"</tt>.
+ The function initiating the message-dialog will return when the dialog is closed.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_menu"></a><h3><font color=#CC0000>gs:menu</font></h3>
+<b>syntax: (<font color=#CC0000>gs:menu</font> <em>sym-id</em> <em>str-text</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the menu.<br/>
+<b>parameter: </b><em>str-text</em> - The title string of the menu.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_menu-popup"></a><h3><font color=#CC0000>gs:menu-popup</font></h3>
+<b>syntax: (<font color=#CC0000>gs:menu-popup</font> <em>sym-id</em> <em>str-text</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the menu.<br/>
+<b>parameter: </b><em>str-text</em> - The title string of the menu.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_menu-bar"></a><h3><font color=#CC0000>gs:menu-bar</font></h3>
+<b>syntax: (<font color=#CC0000>gs:menu-bar</font> <em>sym-frame</em> [<em>sym-menu-1</em> ...])</b><br/>
+<b>parameter: </b><em>sym-frame</em> - The name of the frame hosting the menu bar.<br/>
+<b>parameter: </b><em>sym-menu</em> - Zero or more symbol names of menus to be positioned on the menu bar.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_menu-item"></a><h3><font color=#CC0000>gs:menu-item</font></h3>
+<b>syntax: (<font color=#CC0000>gs:menu-item</font> <em>sym-id</em> <em>sym-action</em> <em>str-text</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the menu item.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-text</em> - The text to appear for the menu item.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_menu-item-check"></a><h3><font color=#CC0000>gs:menu-item-check</font></h3>
+<b>syntax: (<font color=#CC0000>gs:menu-item-check</font> <em>sym-id</em> <em>sym-action</em> <em>str-text</em> [<em>bool-selected</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the menu item.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-text</em> - The text to appear for the menu item.<br/>
+<b>parameter: </b><em>bool-selected</em> - An optional flag indicating the selection state <tt>true</tt> or <tt>nil</tt> (default).<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_mouse-clicked"></a><h3><font color=#CC0000>gs:mouse-clicked</font></h3>
+<b>syntax: (<font color=#CC0000>gs:mouse-clicked</font> <em>sym-canvas</em> <em>sym-action</em> [<em>boolean-tags</em>])</b><br/>
+<b>parameter: </b><em>sym-canvas</em> - The id of the canvas to register the action handler.<br/>
+<b>parameter: </b><em>sym-action</em> - The symbol of the action handler.<br/>
+<b>parameter: </b><em>boolean-tags</em> - A <tt>true</tt> to indicate checking for tags.<br/>
+<p></p>
+ If <em>boolean-tags</em> is <tt>true</tt>, the action event will carry a list of
+ all tags which contained the X,Y coordinates of the mouse.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_mouse-dragged"></a><h3><font color=#CC0000>gs:mouse-dragged</font></h3>
+<b>syntax: (<font color=#CC0000>gs:mouse-dragged</font> <em>sym-canvas</em> <em>sym-action</em>)</b><br/>
+<b>parameter: </b><em>sym-canvas</em> - The id of the canvas to register the action handler.<br/>
+<b>parameter: </b><em>sym-action</em> - The symbol of the action handler.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_mouse-event"></a><h3><font color=#CC0000>gs:mouse-event</font></h3>
+<b>syntax: (<font color=#CC0000>gs:mouse-event</font> <em>sym-id</em> <em>sym-action</em>)</b><br/>
+<b>parameter: </b><em>sym-canvas</em> - The id of the component to register the action handler.<br/>
+<b>parameter: </b><em>sym-action</em> - The symbol of the action handler.<br/>
+<p></p>
+ <tt>gs:mouse-event</tt> can be used to register a general unspecific mouse event handler
+ for any component in the system. Components respond to the following types:
+ <tt>"pressed"</tt>, <tt>"released"</tt>, <tt>"clicked"</tt>,
+<p></p>
+<p></p><b>example:</b><blockquote><pre>
+ (define (mouse-action id type x y button cnt mods)
+     (println "id:" id " type:" type " x:" x " y:" y " button:" button " count:" cnt " mods:" mods)
+ )</pre></blockquote>
+ The example shows a handler which prints all mouse event parameters to the terminal/shell
+ window where the applicaton was started.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_mouse-moved"></a><h3><font color=#CC0000>gs:mouse-moved</font></h3>
+<b>syntax: (<font color=#CC0000>gs:mouse-moved</font> <em>sym-canvas</em> <em>sym-action</em>)</b><br/>
+<b>parameter: </b><em>sym-canvas</em> - The id of the canvas to register the action handler.<br/>
+<b>parameter: </b><em>sym-action</em> - The symbol of the action handler.<br/>
+<b>parameter: </b><em>boolean-tags</em> - A <tt>true</tt> to indicate checking for tags.<br/>
+<p></p>
+ If <em>boolean-tags</em> is <tt>true</tt>, the action event will carry a list of
+ all tags which contained the X,Y coordinates of the mouse.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_mouse-pressed"></a><h3><font color=#CC0000>gs:mouse-pressed</font></h3>
+<b>syntax: (<font color=#CC0000>gs:mouse-pressed</font> <em>sym-canvas</em> <em>sym-action</em> [<em>boolean-tags</em>])</b><br/>
+<b>parameter: </b><em>sym-canvas</em> - The id of the canvas to register the action handler.<br/>
+<b>parameter: </b><em>sym-action</em> - The symbol of the action handler.<br/>
+<b>parameter: </b><em>boolean-tags</em> - A <tt>true</tt> to indicate checking for tags.<br/>
+<p></p>
+ If <em>boolean-tags</em> is <tt>true</tt>, the action event will carry a list of
+ all tags which contained the X,Y coordinates of the mouse.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_mouse-released"></a><h3><font color=#CC0000>gs:mouse-released</font></h3>
+<b>syntax: (<font color=#CC0000>gs:mouse-released</font> <em>sym-canvas</em> <em>sym-action</em> [<em>boolean-tags</em>])</b><br/>
+<b>parameter: </b><em>sym-canvas</em> - The id of the canvas to register the action handler.<br/>
+<b>parameter: </b><em>sym-action</em> - The symbol of the action handler.<br/>
+<b>parameter: </b><em>boolean-tags</em> - A <tt>true</tt> to indicate checking for tags.<br/>
+<p></p>
+ If <em>boolean-tags</em> is <tt>true</tt>, the the action event will carry a list of
+ all tags which contained the X,Y coordinates of the mouse.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_mouse-wheel"></a><h3><font color=#CC0000>gs:mouse-wheel</font></h3>
+<b>syntax: (<font color=#CC0000>gs:mouse-wheel</font> <em>sym-canvas</em> <em>sym-action</em>)</b><br/>
+<b>parameter: </b><em>sym-canvas</em> - The id of the canvas to register the action handler.<br/>
+<b>parameter: </b><em>sym-action</em> - The symbol of the action handler.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_move-tag"></a><h3><font color=#CC0000>gs:move-tag</font></h3>
+<b>syntax: (<font color=#CC0000>gs:move-tag</font> <em>sym-tag</em> <em>int-dx</em> <em>int-dy</em> [<em>boolean-repaint</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag of the group of objects to move.<br/>
+<b>parameter: </b><em>int-dx</em> - The distance to move on the X-axis.<br/>
+<b>parameter: </b><em>int-dy</em> - The distance to move on the Y-axis.<br/>
+<b>parameter: </b><em>boolean-repaint</em> - An optional flag to indicate if repainting is required (default is <tt>true</tt>).<br/>
+<p></p>
+ <tt>gs:move-tag</tt> is the only tag operation which actually changes the 
+ internal data of a drawn object. All other tag operations like
+ <tt>gs:translate-tag</tt>, <tt>gs:scale-tag</tt>, <tt>gs:rotate-tag</tt> and <tt>gs:shear-tag</tt>
+ will transform object coordinates only for drawing.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_no-action"></a><h3><font color=#CC0000>gs:no-action</font></h3>
+<b>syntax: (<font color=#CC0000>gs:no-action</font>)</b><br/>
+<p></p>
+ Specify as <em>sym-action</em> for widgets where no action handler is defined.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_open-file-dialog"></a><h3><font color=#CC0000>gs:open-file-dialog</font></h3>
+<b>syntax: (<font color=#CC0000>gs:open-file-dialog</font> <em>sym-parent-frame</em> <em>sym-action</em> [<em>str-directory</em> [<em>str-mask</em> <em>str-description</em>]])</b><br/>
+<b>parameter: </b><em>sym-parent-frame</em> - The parent frame of the file dialog.<br/>
+<b>parameter: </b><em>sym-action</em> - The handler function symbol.<br/>
+<b>parameter: </b><em>str-directory</em> - The initial directory to show.<br/>
+<b>parameter: </b><em>str-mask</em> - An optonal string mask.<br/>
+<b>parameter: </b>Mstr-description> - An optional mask description.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_panel"></a><h3><font color=#CC0000>gs:panel</font></h3>
+<b>syntax: (<font color=#CC0000>gs:panel</font> <em>sym-id</em> [<em>int-width</em> <em>int-height</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the panel.<br/>
+<b>parameter: </b><em>int-width</em> - The optional width of the panel.<br/>
+<b>parameter: </b><em>int-height</em> - The optional height of the panel.<br/>
+<p></p>
+ Panels have a flow layout by default. In a flow layout an unsized button will
+ assume the natural size necessary to display the text on it.
+ To change the layout use the <tt>set-flow-layout</tt> or <tt>set-grid-layout</tt> functions.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_paste-text"></a><h3><font color=#CC0000>gs:paste-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:paste-text</font> <em>sym-id</em> [<em>str-text</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the text component in which to paste text.<br/>
+<b>parameter: </b><em>str-text</em> - An optional text string to paste instead of the clipboard contents.<br/>
+<p></p>
+ If the <em>sym-id</em> contains selected text, this text gets replaced,
+ otherwise the text is inserted at the current caret position.
+ If no text is given in <em>str-text</em>, the text is taken from the clipboard.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_play-sound"></a><h3><font color=#CC0000>gs:play-sound</font></h3>
+<b>syntax: (<font color=#CC0000>gs:play-sound</font> <em>str-file-path</em>)</b><br/>
+<b>parameter: </b><em>str-file-path</em> - The path and file name of the sound file.<br/>
+<p></p>
+ On most OS platforms <tt>.au</tt> and <tt>.wav</tt> sound file formats are supported.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_progress-bar"></a><h3><font color=#CC0000>gs:progress-bar</font></h3>
+<b>syntax: (<font color=#CC0000>gs:progress-bar</font> <em>sym-id</em> <em>int-min</em> <em>in-max</em> <em>int-initial-value</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The symbols of the progress bar.<br/>
+<b>parameter: </b><em>int-min</em> - The minimum value of the slider.<br/>
+<b>parameter: </b><em>int-max</em> - The maximum value of the slider.<br/>
+<b>parameter: </b><em>int-initial-value</em> - The initial value of the slider.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_radio-button"></a><h3><font color=#CC0000>gs:radio-button</font></h3>
+<b>syntax: (<font color=#CC0000>gs:radio-button</font> <em>sym-id</em> <em>sym-action</em> [<em>str-text</em> [<em>bool-selected</em>]])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the radio button.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-text</em> - The optional text of the radio button.<br/>
+<b>parameter: </b><em>bool-seected</em> - An optional flag <tt>true</tt> or <tt>nil</tt> (default) indicating the initial state of the radio button.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_redo-text"></a><h3><font color=#CC0000>gs:redo-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:redo-text</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The id of the <tt>gs:text-pane</tt> where to perform a redo operation.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_remove-from"></a><h3><font color=#CC0000>gs:remove-from</font></h3>
+<b>syntax: (<font color=#CC0000>gs:remove-from</font> <em>sym-container</em> <em>sym-component</em> [<em>sym-component</em> ...])</b><br/>
+<b>parameter: </b><em>sym-container</em> - The container from which to remove a component.<br/>
+<b>parameter: </b><em>sym-component</em> - One or more optional components to remove.<br/>
+<p></p>
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_remove-list-item"></a><h3><font color=#CC0000>gs:remove-list-item</font></h3>
+<b>syntax: (<font color=#CC0000>gs:remove-list-item</font> <em>sym-list-combo</em> <em>int-index</em> [<em>int-index</em> ...])</b><br/>
+<b>parameter: </b><em>sym-list-combo</em> - The name of the combo box or list box from which entries are removed.<br/>
+<b>parameter: </b><em>int-index</em> - The index of an entry to remove from the list or combo box.<br/>
+<p></p>
+ When specifying an index of <tt>0</tt>, the first item gets removed. When specifying an
+ index equal or greater to the number of items in the list, the item is added at the end.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_remove-tab"></a><h3><font color=#CC0000>gs:remove-tab</font></h3>
+<b>syntax: (<font color=#CC0000>gs:remove-tab</font> <em>sym-tabbed-pane</em> [<em>int-index</em>])</b><br/>
+<b>parameter: </b><em>sym-tabbed-pane</em> - The name of the tabbed pane.<br/>
+<b>parameter: </b><em>int-index</em> - The optional index of the tab to remove. The default is <tt>0</tt> for the first tab.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_request-focus"></a><h3><font color=#CC0000>gs:request-focus</font></h3>
+<b>syntax: (<font color=#CC0000>gs:request-focus</font> <em>sym-id</em> [<em>int-tab-index</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to request focus.<br/>
+<b>parameter: </b><em>int-tab-index</em> - The index of a tab for which focus is requested.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_reorder-tags"></a><h3><font color=#CC0000>gs:reorder-tags</font></h3>
+<b>syntax: (<font color=#CC0000>gs:reorder-tags</font> <em>list-tags</em>)</b><br/>
+<b>parameter: </b><em>list-tags</em> - The list of tag symbols or tag string names in the new order of display.<br/>
+<p></p>
+ The re-ordering itself will not repaint the canvas use <tt>gs:update</tt> to repaint the current 
+ canvas after using <tt>gs:reorder-tags</tt>. The list of tags can be given as either a list of
+ tags symbols or name strings. Tags not appearing in <em>list-tags</em> will be deleted.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_rotate-tag"></a><h3><font color=#CC0000>gs:rotate-tag</font></h3>
+<b>syntax: (<font color=#CC0000>gs:rotate-tag</font> <em>sym-tag</em> <em>float theta</em> <em>int-x</em> <em>int-y</em> [<em>boolean-repaint</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group to rotate.<br/>
+<b>parameter: </b><em>float-theta</em> - The rotation angle in degrees (0 - 360).<br/>
+<b>parameter: </b><em>int-x</em> - The X-coordinate of the rotation center.<br/>
+<b>parameter: </b><em>int-y</em> - The Y-coordinate of the rotation center.<br/>
+<b>parameter: </b><em>boolean-repaint</em> - An optional flag to indicate if repainting is required (default is <tt>true</tt>).<br/>
+<p></p>
+ Like all tag operations, multiple <tt>gs:rotate-tag</tt> operations are cumulative.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_run-shell"></a><h3><font color=#CC0000>gs:run-shell</font></h3>
+<b>syntax: (<font color=#CC0000>gs:run-shell</font> <em>id-text-area</em> <em>str-command</em>)</b><br/>
+<b>parameter: </b><em>idx-text-area</em> - The id of the text area to wich a shell process will be attached.<br/>
+<b>parameter: </b><em>str-command</em> - The command string to start the shell process.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_save-file-dialog"></a><h3><font color=#CC0000>gs:save-file-dialog</font></h3>
+<b>syntax: (<font color=#CC0000>gs:save-file-dialog</font> <em>sym-parent-frame</em> <em>sym-action</em> [<em>str-directory</em> [<em>str-initial-file</em> [<em>str-mask</em> <em>str-description</em>]]])</b><br/>
+<b>parameter: </b><em>sym-parent-frame</em> - The parent frame of the file dialog.<br/>
+<b>parameter: </b><em>sym-action</em> - The handler function symbol.<br/>
+<b>parameter: </b><em>str-directory</em> - The initial directory to show.<br/>
+<b>parameter: </b><em>str-file</em> - The initial file name.<br/>
+<b>parameter: </b><em>str-mask</em> - An optional string mask.<br/>
+<b>parameter: </b><em>str-description</em> - An optional mask description.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_save-text"></a><h3><font color=#CC0000>gs:save-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:save-text</font> <em>sym-id</em> <em>str-path</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The id of the <tt>gs:text-pane</tt>.<br/>
+<b>parameter: </b><em>str-path</em> - The full path name of the file to save.<br/>
+<p></p>
+ This function will write text back from a <tt>gs:text-pane</tt> directly
+ by specifying a path name only. Line feed characters (ASCII 10)
+ are used as line terminators. If this behavior is not desired,
+ as is the case with Windows text files, then <tt>gs:get-text</tt> should
+ be used instead. A program can then add CR characters using a 
+ newLISP <tt>replace</tt>, i.e. <tt>(replace "\n" text "\r\n")</tt> before
+ saving the text to a file.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_scale-tag"></a><h3><font color=#CC0000>gs:scale-tag</font></h3>
+<b>syntax: (<font color=#CC0000>gs:scale-tag</font> <em>sym-tag</em> <em>float-x</em> <em>float-y</em> [<em>boolean-repaint</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group to scale.<br/>
+<b>parameter: </b><em>float-x</em> - The X scaling factor.<br/>
+<b>parameter: </b><em>float-y</em> - The Y scaling factor.<br/>
+<b>parameter: </b><em>boolean-repaint</em> - An optional flag to indicate if repainting is required (default is <tt>true</tt>).<br/>
+<p></p>
+ <tt>gs:scale</tt> scales the object to draw relative to the <tt>0,0</tt> point of
+ the coordinate system. This means if a object is not at the center it
+ will not only change in size when scaled but also change the distance
+ to the center point of the coordinate system, moving away when scaling
+ up with scale factor bigger <tt>1.0</tt> and moving closer to the center
+ when scaling down using factors smaller than <tt>1.0</tt>.
+<p></p>
+ This means that objects which will be scaled should be defined in
+ coordinates relative to their center point. Then a <tt>gs:translate-tag</tt>
+ command should be used to place the object to correct place:
+<p></p>
+<p></p><b>example:</b><blockquote><pre> (gs:circle 'C 0 0 50)
+ (gs:gs:translate-tag 'C 200 100)
+ ...
+ (gs:scale-tag 'C 1.1 1.1)</pre></blockquote>
+ In the example the circle, although defined for <tt>0,0</tt>, will be displayed
+ at the <tt>200,200</tt> position because of the <tt>gs:translate-tag</tt> statement. When
+ later scaling the circle will get bigger but stay in place.
+ Like all tag operations, multiple <tt>gs:scale-tag</tt> operations are cumulative.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_select-list-item"></a><h3><font color=#CC0000>gs:select-list-item</font></h3>
+<b>syntax: (<font color=#CC0000>gs:select-list-item</font> <em>sym-id</em> <em>str-item</em> [<em>boolean-flag</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the list or combo box.<br/>
+<b>parameter: </b><em>str-item</em> - The item to select.<br/>
+<b>parameter: </b><em>boolean-flag</em> - An optional flag only for list boxes to force scrolling to the selected entry.<br/>
+<p></p>
+ On combo boxes the optional <em>boolean-flag</em> has no effect. The selected entry will always
+ appear as the visible text of the combo box. The flag has either the value <tt>true</tt> or <tt>nil</tt>.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_select-text"></a><h3><font color=#CC0000>gs:select-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:select-text</font> <em>sym-id</em> <em>int-from</em> [<em>int-to</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The ame of the text component.<br/>
+<b>parameter: </b><em>int-from</em> - Start offset of selection.<br/>
+<b>parameter: </b><em>int-to</em> - Optional end offset of selection.<br/>
+<p></p>
+ If no <em>int-to</em> end offset is given, <tt>gs:select-text</tt> will
+ select to the end of the text.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_scroll-pane"></a><h3><font color=#CC0000>gs:scroll-pane</font></h3>
+<b>syntax: (<font color=#CC0000>gs:scroll-pane</font> <em>sym-id</em> <em>sym-widget</em> [<em>int-width</em> <em>int-height</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the scroll pane.<br/>
+<b>parameter: </b><em>sym-widget</em> - The component in the scroll pane to be scrolled.<br/>
+<b>parameter: </b><em>int-width</em> - The optional width of the scroll pane.<br/>
+<b>parameter: </b><em>int-height</em> - The optional height of the scroll pane.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-accelerator"></a><h3><font color=#CC0000>gs:set-accelerator</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-accelerator</font> <em>sym-menu-item</em> <em>str-keystroke</em>)</b><br/>
+<b>parameter: </b><em>sym-menu-item</em> - The name of the menu item for which an accelerator key is set.<br/>
+<b>parameter: </b><em>str-keystroke</em> - A text string identifying the keystroke.<br/>
+<p></p>
+ The following rules are used to create keystroke strings:
+<p></p>
+ Syntax:
+ <blockquote><pre>
+ modifiers* (typedID | pressedReleasedID)
+ modifiers := shift | control | ctrl | meta | alt | button1 | button2 | button3
+ typedID := typed typedKey
+ typedKey := string of length 1 giving Unicode character.
+ pressedReleasedID := (pressed | released) key
+ key := KeyEvent key code name, i.e. the name following "VK_".
+ </pre></blockquote>
+ Examples:
+ <blockquote><pre>
+ "INSERT"
+ "control DELETE"
+ "alt shift X"
+ "alt shift released X"
+ "typed a"
+ </pre></blockquote>
+ Note that the <i>apple</i> key on MacOS X is the <tt>meta</tt> key.
+ The <tt>alt</tt> on MacOS X is the <i>option</i> key.
+ For letters use uppercase. 
+ Keys are added to the menu item display automatically on all platforms.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-anti-aliasing"></a><h3><font color=#CC0000>gs:set-anti-aliasing</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-anti-aliasing</font> <em>boolean-flag</em>)</b><br/>
+<b>parameter: </b><em>boolean-flag</em> - The anti aliasing setting for the current canvas <tt>true</tt> or <tt>nil</tt>.<br/>
+<p></p>
+ The default setting is <tt>true</tt>.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-background"></a><h3><font color=#CC0000>gs:set-background</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-background</font> <em>sym-id</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em> [<em>float-alpha</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the color.<br/>
+<b>parameter: </b><em>float-red</em> - The red color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-green</em> - The green color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-blue</em> - The blue color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-alpha</em> - The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).<br/>
+<p></p>
+<b>syntax: (<font color=#CC0000>gs:set-background</font> <em>sym-id</em> <em>list-rgb</em> [<em>float-alpha</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the color.<br/>
+<b>parameter: </b><em>list-rgb</em> - The rgb color can be given as a list of three numbers.<br/>
+<b>parameter: </b><em>float-alpha</em> - The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).<br/>
+<p></p>
+ Note <tt>set-background</tt> is the same as <tt>set-color</tt>.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-bevel-border"></a><h3><font color=#CC0000>gs:set-bevel-border</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-bevel-border</font> <em>sym-id</em> <em>str-type</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component.<br/>
+<b>parameter: </b><em>str-type</em> - The type of the bevel <tt>"raised"</tt> or <tt>"lowered"</tt>.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-border-layout"></a><h3><font color=#CC0000>gs:set-border-layout</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-border-layout</font> <em>sym-container</em>  [<em>int-hgap</em> <em>int-vgap</em>])</b><br/>
+<b>parameter: </b><em>sym-container</em> - The name of the container for which border layout is set.<br/>
+<b>parameter: </b><em>int-hgap</em> - The horizontal gap between components in the border layout.<br/>
+<b>parameter: </b><em>int-vgap</em> - The vertical gap between components in the border layout.<br/>
+<p></p>
+ Border layout divides the layout into 5 zones labeled <tt>"north"</tt>, <tt>"west"</tt>,
+ <tt>"center"</tt>, <tt>"east"</tt> and <tt>"south"</tt>. These string constants are used in
+ the <tt>gs:add-to</tt> command when adding components to a border layout.
+<p></p>
+ In a border layout each component will take the maximum size if components
+ are not sized. If components are sized only some dimensions will be honored.
+ The <tt>"north"</tt> and <tt>"south"</tt> components will stretch to maximum width and
+ assume the height given in a size parameter of the component. The <tt>"east"</tt>
+ and <tt>"west"</tt> components will stretch to the maximum height available assuming
+ their width specified earlier. The <tt>"center"</tt> component will take the left over
+ maximum space.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-canvas"></a><h3><font color=#CC0000>gs:set-canvas</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-canvas</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The id of the canvas to switch to.<br/>
+<p></p>
+ The canvas in <em>sym-id</em> must have been created earlier with a <tt>gs:canvas</tt> 
+ statement. All graphics operations which do not take a canvas as argument
+ will automatically refer to this current canvas. If no <tt>gs:set-canvas</tt> is
+ used, the current canvas is assumed to be the last one created.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-caret"></a><h3><font color=#CC0000>gs:set-caret</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-caret</font> <em>sym-id</em> <em>int-offset</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the cursor caret.<br/>
+<p></p>
+ The functions has the same effect as calling <tt>gs:select-text</tt> with the same 
+ offset for the dot and mark position.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-caret-color"></a><h3><font color=#CC0000>gs:set-caret-color</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-caret-color</font> <em>sym-id</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the color.<br/>
+<b>parameter: </b><em>float-red</em> - The red color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-green</em> - The green color component expressed as a  number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-blue</em> - The blue color component expressed as a  number between 0.0 and 1.0.<br/>
+<b>syntax: (<font color=#CC0000>gs:set-caret-color</font> <em>sym-id</em> <em>list-rgb</em> [<em>float-alpha</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the color.<br/>
+<b>parameter: </b><em>list-rgb</em> - The rgb color can be given as a list of three numbers.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-color"></a><h3><font color=#CC0000>gs:set-color</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-color</font> <em>sym-id</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em> [<em>float-alpha</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the color.<br/>
+<b>parameter: </b><em>float-red</em> - The red color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-green</em> - The green color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-blue</em> - The blue color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-alpha</em> - The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).<br/>
+<p></p>
+<b>syntax: (<font color=#CC0000>gs:set-color</font> <em>sym-id</em> <em>list-rgb</em> [<em>float-alpha</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the color.<br/>
+<b>parameter: </b><em>list-rgb</em> - The rgb color can be given as a list of three numbers.<br/>
+<b>parameter: </b><em>float-alpha</em> - The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).<br/>
+<p></p>
+ Note that <tt>set-color</tt> is the same as <tt>set-background</tt>.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-cursor"></a><h3><font color=#CC0000>gs:set-cursor</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-cursor</font> <em>sym-id</em> <em>str-shape</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the frame, dialog or window.<br/>
+<b>parameter: </b><em>str-shape</em> - The string describing the cursor shape.<br/>
+<p></p>
+ The cursor shape can be one of the following:
+ <pre>
+  "default"
+  "crosshair"
+  "text"
+  "wait"
+  "sw-resize"
+  "se-resize"
+  "nw-resize"
+  "ne-resize"
+  "n-resize"
+  "s-resize"
+  "w-resize"
+  "e-resize"
+  "hand"
+  "move"
+ </pre>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-editable"></a><h3><font color=#CC0000>gs:set-editable</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-editable</font> <em>sym-id</em> <em>boolean-editable</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the text widget.<br/>
+<b>parameter: </b><em>boolean-editable</em> - The flag <tt>true</tt> or <tt>nil</tt> to indicate if this text widget can be edited.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-flow-layout"></a><h3><font color=#CC0000>gs:set-flow-layout</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-flow-layout</font> <em>sym-container</em> [<em>str-alignment</em> [<em>int-hgap</em> <em>int-vgap</em>]])</b><br/>
+<b>parameter: </b><em>sym-container</em> - The name of the container for which flow layout is set.<br/>
+<b>parameter: </b><em>sym-alignment</em> - The alignment of the flow layout <tt>"left"</tt>, <tt>"center"</tt> or <tt>"right"</tt>.<br/>
+<b>parameter: </b><em>int-hgap</em> - The horizontal gap between components in the flow layout.<br/>
+<b>parameter: </b><em>int-vgap</em> - The vertical gap between components in the flow layout.<br/>
+<p></p>
+ The flow layout lets components appear in their natural or preferred size. The preferred
+ size of a component is set using the function <tt>gs:set-size</tt>. Button-type widgets and
+ combo boxes will take as much space as necessary to show the included text.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-font"></a><h3><font color=#CC0000>gs:set-font</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-font</font> <em>sym-id</em> <em>str-family</em> <em>int-size</em> <em>str-type</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the text font.<br/>
+<b>parameter: </b><em>str-familiy</em> - The family of the font, e.g.: <tt>"Monospaced"</tt>, <tt>"Serif"</tt>, <tt>"Sans Serif"</tt>.<br/>
+<b>parameter: </b><em>int-size</em> - The font size in points.<br/>
+<b>parameter: </b><em>str-type</em> - The type of the font, one or more of <tt>"plain"</tt>, <tt>"bold"</tt>, <tt>"italic"</tt>.<br/>
+<p></p>
+ More than the above noted families are available depending on the platform.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-foreground"></a><h3><font color=#CC0000>gs:set-foreground</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-foreground</font> <em>sym-id</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em> [<em>float-alpha</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the color.<br/>
+<b>parameter: </b><em>float-red</em> - The red color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-green</em> - The green color component expressed as a  number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-blue</em> - The blue color component expressed as a  number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-alpha</em> - The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).<br/>
+<p></p>
+<b>syntax: (<font color=#CC0000>gs:set-foreground</font> <em>sym-id</em> <em>list-rgb</em> [<em>float-alpha</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the color.<br/>
+<b>parameter: </b><em>list-rgb</em> - The rgb color can be given as a list of three numbers.<br/>
+<b>parameter: </b><em>float-alpha</em> - The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).<br/>
+<p></p>
+ The foreground color is the color of the text in a component.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-grid-layout"></a><h3><font color=#CC0000>gs:set-grid-layout</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-grid-layout</font> <em>sym-container</em> <em>int-rows</em> <em>int-columns</em> [<em>int-hgap</em> <em>int-vgap</em>])</b><br/>
+<b>parameter: </b><em>sym-container</em> - The name of the container for which grid layout is set.<br/>
+<b>parameter: </b><em>int-rows</em> - The number of rows in the layout grid.<br/>
+<b>parameter: </b><em>int-columns</em> - The number of columns in the layout grid.<br/>
+<b>parameter: </b><em>int-hgap</em> - The horizontal gap between components in the grid layout.<br/>
+<b>parameter: </b><em>int-vgap</em> - The vertical gap between components in the grid layout.<br/>
+<p></p>
+ In a grid layout each component will assume the maximum size the grid cell allows
+ regardless of sizes preset using <tt>gs:set-size</tt> Because of this grid layout cells are
+ frequently filled with panels using <tt>gs:panel</tt> which have flow layout by default
+ and allow deliberate sizing of components using <tt>gs:set-size</tt>.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-icon"></a><h3><font color=#CC0000>gs:set-icon</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-icon</font> <em>sym-id</em> <em>str-icon-path</em> [<em>int-index</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of a button or label or menu-item for which to set an icon.<br/>
+<b>parameter: </b><em>str-icon-path</em> - The file path of the icon to be set.<br/>
+<b>parameter: </b><em>int-index</em> - If <em>sym-id</em> is a tabbed pane <em>int-index</em> is the index of the tab.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-look-and-feel"></a><h3><font color=#CC0000>gs:set-look-and-feel</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-look-and-feel</font> <em>str-look</em>)</b><br/>
+<b>parameter: </b><em>str-look</em> - The class description string for the look and feel of the application.<br/>
+<p></p>
+ The following strings can be tried in <em>str-look</em>, but not all will work on a specific
+ platform. On the Mac the default look-and-feel is built-in to the JVM as the default
+ style. The <tt>"MacLookAndFeel"</tt> is not available as an explicit flavor here, but may be
+ on other platforms.
+ <pre>
+    <tt>"com.sun.java.swing.plaf.motif.MotifLookAndFeel"</tt><br>
+    <tt>"javax.swing.plaf.metal.MetalLookAndFeel"</tt><br>
+    <tt>"com.sun.java.swing.plaf.windows.WindowsLookAndFeel"</tt><br>
+    <tt>"javax.swing.plaf.mac.MacLookAndFeel"</tt><br>
+    <tt>"com.sun.java.swing.plaf.gtk.GTKLookAndFeel"</tt>
+ </pre>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-paint"></a><h3><font color=#CC0000>gs:set-paint</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-paint</font> <em>list-rgb</em>)</b><br/>
+<b>parameter: </b><em>list-rgb</em> - The current paint used for outlines, text and fill color.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-pressed-icon"></a><h3><font color=#CC0000>gs:set-pressed-icon</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-pressed-icon</font> <em>sym-id</em> <em>str-icon-path</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the button, image button or toggle button.<br/>
+<b>parameter: </b><em>str-icon-path</em> - The file path of the icon or image to be set to the button in pressed state.<br/>
+<p></p>
+ By default a small grey dot is shown on image buttons when in a pressed state.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-resizable"></a><h3><font color=#CC0000>gs:set-resizable</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-resizable</font> <em>sym-frame</em> <em>boolean-resizable</em>)</b><br/>
+<b>parameter: </b><em>sym-frame</em> - The name of the frame window.<br/>
+<b>parameter: </b><em>bbolean-resizable</em> - The flag <tt>true</tt> or <tt>nil</tt> to indicate if a frame can be resized by the user.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-rotation"></a><h3><font color=#CC0000>gs:set-rotation</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-rotation</font> <em>float-angle</em>)</b><br/>
+<b>parameter: </b><em>float-angle</em> - The angle in degrees (0 - 360) of the canvas rotation.<br/>
+<p></p>
+ Unlike the <tt>gs:rotate-tag</tt> operation which is cumulative, <tt>gs:set-rotation</tt>
+ will set an absolute rotation value each time it is called.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-scale"></a><h3><font color=#CC0000>gs:set-scale</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-scale</font> <em>int-x</em> <em>int-y</em>)</b><br/>
+<b>parameter: </b><em>int-x</em> - The X-scale value of the current canvas.<br/>
+<b>parameter: </b><em>int-y</em> - The Y-scale value of the current canvas.<br/>
+<p></p>
+ Unlike the <tt>gs:scale-tag</tt> operation which is cumulative, <tt>gs:set-scale</tt>
+ will set an absolute scale value each time it is called.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-selected"></a><h3><font color=#CC0000>gs:set-selected</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-selected</font> <em>sym-id</em> <em>boolean-selected</em> [<em>sym-id</em> <em>boolean-selected</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the toggle or radio button or check box or menu item.<br/>
+<b>parameter: </b><em>boolean-selected</em> - A flag of <tt>true</tt> or <tt>nil</tt> to indicated the selection state.<br/>
+<p></p>
+ More then one toggle control may be set selected or unselected.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-selection-color"></a><h3><font color=#CC0000>gs:set-selection-color</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-selection-color</font> <em>sym-id</em> <em>float-red</em> <em>float-green</em> <em>float-blue</em> [<em>float-alpha</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the text selection color.<br/>
+<b>parameter: </b><em>float-red</em> - The red color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-green</em> - The green color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-blue</em> - The blue color component expressed as a number between 0.0 and 1.0.<br/>
+<b>parameter: </b><em>float-alpha</em> - The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).<br/>
+<p></p>
+<b>syntax: (<font color=#CC0000>gs:set-selection-color</font> <em>sym-id</em> <em>list-rgb</em> [<em>float-alpha</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which to set the text selection color.<br/>
+<b>parameter: </b><em>list-rgb</em> - The rgb color can be given as a list of three numbers.<br/>
+<b>parameter: </b><em>float-alpha</em> - The transparency of the color expressed as a number between 0.0 (fully transparent)and 1.0 (completely opaque).<br/>
+<p></p>
+ Note <tt>set-background</tt> is the same as <tt>set-color</tt>.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-size"></a><h3><font color=#CC0000>gs:set-size</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-size</font> <em>sym-id</em> <em>int-width</em> <em>int-height</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component of which a preferred size is set.<br/>
+<b>parameter: </b><em>int-width</em> - The preferred width of the component.<br/>
+<b>parameter: </b><em>int-height</em> - The preferred height of the component.<br/>
+<p></p>
+ Note that not all layouts allow setting the size of a component. The grid and
+ border layouts will size the component to its maximum possible in the layout.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-stroke"></a><h3><font color=#CC0000>gs:set-stroke</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-stroke</font> <em>float-width</em> [<em>str-cap</em> [<em>str-join</em> [<em>float-miterlimit</em>]]])</b><br/>
+<b>parameter: </b><em>float-width</em> - The width for drawing lines and outlines in shapes.<br/>
+<b>parameter: </b><em>str-cap</em> - One of optional <tt>"butt"</tt> (default), <tt>"round"</tt> or <tt>"sqare"</tt>.<br/>
+<b>parameter: </b><em>str-join</em> - One of optional <tt>"miter"</tt> (default), <tt>"bevel"</tt> or <tt>"round"</tt><br/>
+<p></p>
+ For a <em>float-width</em> 0f 0.0 the thinnest possible line width be be chosen. 
+ Join is the decoration applied at the intersection of two path segments and at the 
+ intersection of the endpoints.
+ Cap is the decoration applied to the ends of unclosed subpaths and dash segments.
+ The <em>float-miterlimit</em> should be greater or equal 1.0.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-syntax"></a><h3><font color=#CC0000>gs:set-syntax</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-syntax</font> <em>sym-id</em> <em>str-type</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the text pane for syntax coloring is enabled or disabled.<br/>
+<b>parameter: </b><em>str-type</em> - A string <tt>"lsp"</tt>, <tt>"c"</tt>, <tt>"cpp"</tt>, <tt>"java"</tt> or <tt>"php"</tt> to indicate the <br/>
+ syntax desired, or <tt>nil</tt> to switch off syntax highlighting.
+<p></p>
+ Colors for syntax highlighting are preselected for a white background, but can be changed using
+ the following functions: <tt>gs:set-background</tt>, <tt>gs:set-foreground</tt>, <tt>gs:set-caret</tt>, <tt>gs:set-selection-color</tt>
+ and <tt>gs:set-syntax-colors</tt>.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-syntax-colors"></a><h3><font color=#CC0000>gs:set-syntax-colors</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-syntax-colors</font> <em>list-rgb-comment</em> <em>list-rgb-keyword</em> <em>list-rgb-string</em> <em>list-rgb-number</em> <em>list-rgb-quoted</em> <em>list-rgb-parentheses</em>)</b><br/>
+<b>parameter: </b><em>list-rgb-comment</em> - The color for comments.<br/>
+<b>parameter: </b><em>list-rgb-keyword</em> - The color for reserved keywords.<br/>
+<b>parameter: </b><em>list-rgb-string</em> - The color for strings.<br/>
+<b>parameter: </b><em>list-rgb-number</em> - The color for numbers.<br/>
+<b>parameter: </b><em>list-rgb-quoted</em> - The color for the quote and quoted symbols.<br/>
+<b>parameter: </b><em>list-rgb-parentheses</em> - The color for parenthesis.<br/>
+<p></p>
+ Syntax highlighting colors are given as lists of red, green and blue values between 0.0 and 1.0. 
+ Depending on the syntax colors and the foreground and background colors set for the text pane, 
+ the caret color and color for selected text should also be changed. Only text widgets created 
+ using <tt>gs:text-pane</tt> feature syntax highlighting.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-tab-size"></a><h3><font color=#CC0000>gs:set-tab-size</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-tab-size</font> <em>sym-id</em> <em>int-size</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the text area component.<br/>
+<b>parameter: </b><em>int-size</em> - The tabulator size.<br/>
+<p></p>
+ Note that <tt>gs:set-tab-size</tt> will only work with fixed spaced fonts.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-text"></a><h3><font color=#CC0000>gs:set-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-text</font> <em>sym-id</em> <em>str-text</em> [<em>int-index</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the component for which text is set.<br/>
+<b>parameter: </b><em>str-text</em> - The text to be set in the component.<br/>
+<b>parameter: </b><em>int-index</em> - The index for a tab if the <em>sym-id</em> is a tabbed pane.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-titled-border"></a><h3><font color=#CC0000>gs:set-titled-border</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-titled-border</font> <em>sym-component</em> <em>str-title</em>)</b><br/>
+<b>parameter: </b><em>sym-component</em> - The name of the component.<br/>
+<b>parameter: </b><em>str-title</em> - The text in the titled border around the component.<br/>
+<p></p>
+ The component is usually a <tt>panel</tt>.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-tool-tip"></a><h3><font color=#CC0000>gs:set-tool-tip</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-tool-tip</font> <em>sym-id</em> <em>str-text</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the widget for which to supply a tool tip.<br/>
+<b>parameter: </b><em>str-text</em> - The text of the tool tip.<br/>
+<p></p>
+ The tool tip text is shown when leaving the mouse over the widget for certain
+ amount of time.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-trace"></a><h3><font color=#CC0000>gs:set-trace</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-trace</font> <em>boolean-flag</em>)</b><br/>
+<b>parameter: </b><em>boolean-flag</em> - The flag <tt>true</tt> or <tt>nil</tt>.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-translation"></a><h3><font color=#CC0000>gs:set-translation</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-translation</font> <em>int-x</em> <em>int-y</em>)</b><br/>
+<b>parameter: </b><em>int-x</em> - The X-translation value of the current canvas.<br/>
+<b>parameter: </b><em>int-y</em> - The Y-translation value of the current canvas.<br/>
+<p></p>
+ Translates the current origin of the current canvas to the point in <em>int-x</em> <em>int-y</em>.
+ Unlike the <tt>gs:translate-tag</tt> operation which is cumulative, <tt>gs:set-translation</tt>
+ will set an absolute translation value each time it is called.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-utf8"></a><h3><font color=#CC0000>gs:set-utf8</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-utf8</font> <em>boolean-flag</em>)</b><br/>
+<b>parameter: </b><em>boolean</em> - The flag <tt>true</tt> or <tt>nil</tt> to indicate if in UTF-8 mode.<br/>
+<p></p>
+ When set in UTF-8 mode, guiserver will convert files to UTF-8 encoding
+ when loading and saving files. On Mac OX X UTF-8 mode is by default enabled.
+ On startup guiserver.lsp will detect if newLISP is UTF-8 enabled and
+ switch the mode in Guiserver accordingly using <tt>gs:set-utf8</tt>.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-value"></a><h3><font color=#CC0000>gs:set-value</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-value</font> <em>sym-id</em> <em>int-value</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of a slider or progress bar for which to set the value.<br/>
+<b>parameter: </b><em>int-value</em> - The integer value of the name to be set.<br/>
+<p></p>
+ The value should not be bigger or smaller than the minimum or maximum values set
+ when creating the slider or progress bar, otherwise the setting will default to either
+ the minimum or maximum preset value.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_set-visible"></a><h3><font color=#CC0000>gs:set-visible</font></h3>
+<b>syntax: (<font color=#CC0000>gs:set-visible</font> <em>sym-id</em> <em>boolean-visible</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The component which is hidden or made visible.<br/>
+<b>parameter: </b><em>boolean-visible</em> - A flag indicating if the component is visible <tt>"true"</tt>, <tt>"nil"</tt>.<br/>
+<p></p>
+ Except for frames and dialog windows, components are visible by default. Normally
+ frames and dialogs are not set visible before all other components are placed inside.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_shear-tag"></a><h3><font color=#CC0000>gs:shear-tag</font></h3>
+<b>syntax: (<font color=#CC0000>gs:shear-tag</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> [<em>boolean-repaint</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag group to shear.<br/>
+<b>parameter: </b><em>float-x</em> - The X shearing factor.<br/>
+<b>parameter: </b><em>float-y</em> - The Y shearing factor.<br/>
+<b>parameter: </b><em>boolean-repaint</em> - An optional flag to indicate if repainting is required (default is <tt>true</tt>).<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_show-popup"></a><h3><font color=#CC0000>gs:show-popup</font></h3>
+<b>syntax: (<font color=#CC0000>gs:show-popup</font> <em>sym-tag</em> <em>sym-host</em> <em>int-x</em> <em>int-y</em>)</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The id of the popup menu.<br/>
+<b>parameter: </b><em>sym-host</em> - The host container where to pop up the menu.<br/>
+<b>parameter: </b><em>int-x</em> - The X coordinate of the menu popup position.<br/>
+<b>parameter: </b><em>int-y</em> - The Y coordinate of the menu popup position.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_show-tag"></a><h3><font color=#CC0000>gs:show-tag</font></h3>
+<b>syntax: (<font color=#CC0000>gs:show-tag</font> <em>sym-tag</em> [<em>boolean-repaint</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The tag of the group to show.<br/>
+<b>parameter: </b><em>boolean-repaint</em> - An optional flag to indicate if repainting is required (default is <tt>true</tt>).<br/>
+<p></p>
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_slider"></a><h3><font color=#CC0000>gs:slider</font></h3>
+<b>syntax: (<font color=#CC0000>gs:slider</font> <em>sym-id</em> <em>sym-action</em> <em>str-orientation</em> <em>int-min</em> <em>int-max</em> <em>int-initial-value</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the slider.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-orientation</em> - The orientation of the slider <tt>"horizontal"</tt> or <tt>"vertical"</tt><br/>
+<b>parameter: </b><em>int-min</em> - The minimum value of the slider.<br/>
+<b>parameter: </b><em>int-max</em> - The maximum value of the slider.<br/>
+<b>parameter: </b><em>int-initial-value</em> - The initial value of the slider.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_split-pane"></a><h3><font color=#CC0000>gs:split-pane</font></h3>
+<b>syntax: (<font color=#CC0000>gs:split-pane</font> <em>sym-id</em> <em>str-orientation</em> [<em>float-weight</em> [<em>float-location</em> [<em>int-divider-size</em>]]])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the split-pane.<br/>
+<b>parameter: </b><em>str-orientation</em> - The orientation <tt>"horizontal"</tt> or <tt>"vertical"</tt>.<br/>
+<b>parameter: </b><em>float-weight</em> - The optional weight distribution between <tt>0.0</tt> and <tt>1.0</tt> when re-sizing the window. The default is <tt>0.0</tt>.<br/>
+<b>parameter: </b><em>float-location</em> - The optional initial divider location between <tt>0.0</tt> and <tt>1.0</tt>.<br/>
+<b>parameter: </b><int-divider-size) - The optional size of the draggable divider in pixels.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_tabbed-pane"></a><h3><font color=#CC0000>gs:tabbed-pane</font></h3>
+<b>syntax: (<font color=#CC0000>gs:tabbed-pane</font> <em>sym-id</em> <em>sym-action</em> <em>str-orientation</em> [<em>sym-tab</em> <em>sym-tab-title</em> ...])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the tabbed pane.<br/>
+<b>parameter: </b><em>str-orientation</em> - The position of the tabs; either <tt>"top"</tt> (default), <tt>"bottom"</tt>,<tt>"left"</tt> or <tt>"right"</tt>.<br/>
+<b>parameter: </b><em>sym-tab</em> - The id symbol name of a tab<br/>
+<b>parameter: </b><em>str-title</em> - The title of the tab.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_text-area"></a><h3><font color=#CC0000>gs:text-area</font></h3>
+<b>syntax: (<font color=#CC0000>gs:text-area</font> <em>sym-id</em> <em>sym-action</em> <em>int-width</em> <em>int-height</em>)</b><br/>
+<b>parameter: </b><em>symid</em> - The name of the text area.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>int-width</em> - The optional width of the text area..<br/>
+<b>parameter: </b><em>int-height</em> - The optional height of the text area.<br/>
+<p></p><b>example:</b><blockquote><pre> (gs:text-area 'TheText 'textarea-event 10 8)
+
+ (define (textarea-event id code dot mark) ...)</pre></blockquote>
+ <tt>gs:text-area</tt> transmits the following parameters in its event:
+ <pre>
+ id   - name of the widget 
+ code - key code equals ASCII code. Only for text keys
+ dot  - position of text caret in the text 
+ mark - extended (selection) position of caret 
+ </pre>
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_text-field"></a><h3><font color=#CC0000>gs:text-field</font></h3>
+<b>syntax: (<font color=#CC0000>gs:text-field</font> <em>sym-id</em> <em>sym-action</em> <em>int-columns</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the text field.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>int-columns</em> - The number of columns in the text field.<br/>
+<p></p><b>example:</b><blockquote><pre> (gs:text-field 'TheText 'textfield-event)</pre></blockquote>
+ The <tt>textfield-event</tt> is fired when the enter key is pressed in the
+ text field.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_text-pane"></a><h3><font color=#CC0000>gs:text-pane</font></h3>
+<b>syntax: (<font color=#CC0000>gs:text-pane</font> <em>sym-id</em> <em>sym-action</em> <em>str-style</em> [<em>int-width</em> <em>int-height</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the text pane.<br/>
+<b>parameter: </b><em>sym-action</em> - The key action handler for the html pane.<br/>
+<b>parameter: </b><em>sym-style</em> - The content type of the text pane.<br/>
+<b>parameter: </b><em>int-width</em> - The optional width of the pane.<br/>
+<b>parameter: </b><em>int-height</em> - The optional height of the pane.<br/>
+<p></p>
+ The <tt>gs:text-pane</tt> is used similar to 'gs:text-area. The following styles
+ are supported in <em>sym-style</em>:
+ <pre>
+    "text/plain"
+    "text/html"
+ </pre>
+<p></p>
+ The <tt>gs:text-pane</tt> widget will automatically display scroll bars when
+ text does not fit in the visible space of the pane. When entering parentheses
+ they are automatically matched with their opening or closing counterparts, if they exist.
+ If this is undesired behavior, the simpler <tt>gs:text-area</tt> control should
+ be used instead. 
+<p></p>
+ On each change of the caret or selection in the text pane
+ an event is fired containing several parameters about the caret and selection
+ positions, the last character typed, and the modifier keys used. See the
+ the file <tt>newlisp-edit.lsp</tt> for a complex application using all features
+ available in this widget.
+<p></p>
+ To make hyperlinks in <tt>HTML</tt> formatted text clickable, editing must
+ be disabled using the <tt>gs:set-editable</tt> function. The functions <tt>gs:set-font</tt>
+ and <tt>gs:append-text</tt> will work only on the <tt>text/plain</tt> content style.
+<p></p><b>example:</b><blockquote><pre> (gs:text-pane 'TheTextPane 'textpane-event "text/plain")
+
+ (define (textpane-event id code mods dot mark len undo redo) ...)</pre></blockquote>
+ <tt>gs:text-pane</tt> transmits the following parameters in its event:
+ <pre>
+ id   - name of the widget 
+ code - key code equals ASCII code. Only for text keys 
+ mods - keys pressed together with the previous, like shift, ctrl etc.
+ dot  - position of the text caret in the text 
+ mark - extended (selection) position of the caret 
+ len  - length of the text in the textarea 
+ undo - undo enabled/disabled 
+ redo - redo enabled/disabled 
+ </pre>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_toggle-button"></a><h3><font color=#CC0000>gs:toggle-button</font></h3>
+<b>syntax: (<font color=#CC0000>gs:toggle-button</font> <em>sym-id</em> <em>sym-action</em> <em>str-text</em> [<em>bool-selected</em>])</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the toggle button.<br/>
+<b>parameter: </b><em>sym-action</em> - The name of the event handler.<br/>
+<b>parameter: </b><em>str-text</em> - The optional text of the toggle button.<br/>
+<b>parameter: </b><em>bool-selected</em> - An optional flag <tt>true</tt> or <tt>nil</tt> (default) indicating the initial state of the toggle button.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_tool-bar"></a><h3><font color=#CC0000>gs:tool-bar</font></h3>
+<b>syntax: (<font color=#CC0000>gs:tool-bar</font> <em>sym-frame</em> [<em>bool-floatable</em> <em>int-hgap</em> <em>int-vgap</em>])</b><br/>
+<b>parameter: </b><em>sym-frame</em> - The name of the frame hosting the toolbar.<br/>
+<b>parameter: </b><em>bool-floatable</em> - The optional flag <tt>true</tt> or <tt>nil</tt> to indicate if the toolbar can be detached.<br/>
+<b>parameter: </b><em>int-hgap</em> - The horizontal gap between components on the toolbar.<br/>
+<b>parameter: </b><em>int-vgap</em> - The vertical gap between the components on the toolbar.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_translate-tag"></a><h3><font color=#CC0000>gs:translate-tag</font></h3>
+<b>syntax: (<font color=#CC0000>gs:translate-tag</font> <em>sym-tag</em> <em>int-x</em> <em>int-y</em> [<em>boolean-repaint</em>])</b><br/>
+<b>parameter: </b><em>sym-tag</em> - The name tag of the group to translate.<br/>
+<b>parameter: </b><em>int-x</em> - The X-coordinate translation value.<br/>
+<b>parameter: </b><em>int-y</em> - The Y-coordinate translation value.<br/>
+<b>parameter: </b><em>boolean-repaint</em> - An optional flag to indicate if repainting is required (default is <tt>true</tt>).<br/>
+<p></p>
+ Moves the origin of the coordinate system of all objects tagged with <em>sym-tag</em>.
+ Like all tag operations multiple <tt>gs:translate-tag</tt> operations are cumulative.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_undo-text"></a><h3><font color=#CC0000>gs:undo-text</font></h3>
+<b>syntax: (<font color=#CC0000>gs:undo-text</font> <em>sym-id</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The id of the <tt>gs:text-pane</tt> where to perform an undo operation.<br/>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_undo-enable"></a><h3><font color=#CC0000>gs:undo-enable</font></h3>
+<b>syntax: (<font color=#CC0000>gs:undo-enable</font> <em>sym-id</em> <boolean-enabled)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The id of the <tt>gs:text-pane</tt> for which to enabe/disable undo.<br/>
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_update"></a><h3><font color=#CC0000>gs:update</font></h3>
+<b>syntax: (<font color=#CC0000>gs:update</font>)</b><br/>
+<p></p>
+ Forces a repaint of the current canvas, e.g. after changing the scale or translation of a visible
+ canvas. This function is rarely used, as most screen updates are performed automatically.
+ All tag operations can carry an additional parameter to force update after they have been
+ draw.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_window"></a><h3><font color=#CC0000>gs:window</font></h3>
+<b>syntax: (<font color=#CC0000>gs:window</font> <em>sym-id</em> <em>int-x</em> <em>int-y</em> <em>int-width</em> <em>int-height</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the invisible window.<br/>
+<b>parameter: </b><em>int-x</em> - The x-coordinate of the screen position.<br/>
+<b>parameter: </b><em>int-y</em> - The y-coordinate of the screen position.<br/>
+<b>parameter: </b><em>int-width</em> - The width of the window.<br/>
+<b>parameter: </b><em>int-height</em> - The height of the window.<br/>
+<p></p>
+ Creates a borderless window. Note that a borderless window may treat
+ some hosted components differently from normal frames and dialogs.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_window-closed"></a><h3><font color=#CC0000>gs:window-closed</font></h3>
+<b>syntax: (<font color=#CC0000>gs:window-closed</font> <em>sym-id</em> <em>sym-action</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the frame or dialog.<br/>
+<b>parameter: </b><em>sym-action</em> - The action to perform when the frame or dialog closes.<br/>
+<p></p>
+ A window or dialog window can be closed using the system close button in
+ one of the corners of the window. In this case it is useful to specify
+ a handler function which is called upon closing.
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_window-moved"></a><h3><font color=#CC0000>gs:window-moved</font></h3>
+<b>syntax: (<font color=#CC0000>gs:window-moved</font> <em>sym-id</em> <em>sym-action</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the frame or dialog.<br/>
+<b>parameter: </b><em>sym-action</em> - The action to perform when the frame or dialog moves.<br/>
+<p></p>
+ The event will carry the <em>sym-id</em> of the window or dialog and current <tt>X</tt> and <tt>Y</tt>
+ coordinates on the screen.
+<p></p>
+<p></p><center>- &sect; -</center><p></p>
+<a name="gs_window-resized"></a><h3><font color=#CC0000>gs:window-resized</font></h3>
+<b>syntax: (<font color=#CC0000>gs:window-resized</font> <em>sym-id</em> <em>sym-action</em>)</b><br/>
+<b>parameter: </b><em>sym-id</em> - The name of the frame or dialog.<br/>
+<b>parameter: </b><em>sym-action</em> - The action to perform when the frame or dialog is resized.<br/>
+<p></p>
+ The event will carry the <em>sym-id</em> of the window or dialog and current width and
+ height.
+
+
+
+
+
+<p></p><center>- &part; -</center><br/>
+<center><font face='Arial' size='-2' color='#444444'>
+generated with <a href="http://newlisp.org">newLISP</a>&nbsp;
+and <a href="http://newlisp.org/newLISPdoc.html">newLISPdoc</a>
+</font></center>
+</blockquote>
+</body>
+</html>
diff --git a/guiserver/html-demo.lsp b/guiserver/html-demo.lsp
new file mode 100644
index 0000000..6093d74
--- /dev/null
+++ b/guiserver/html-demo.lsp
@@ -0,0 +1,56 @@
+#!/usr/bin/newlisp
+;;
+;; html-demo.lsp - demonstrate  the text pane with HTML
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+;;;; describe the GUI
+(gs:frame 'HtmlDemo 100 100 400 270 "HTML text-pane demo")
+(gs:text-pane 'HtmlPane 'htmlpane-action "text/html" 200 500)
+(gs:set-editable 'HtmlPane nil)
+(gs:set-tab-size 'HtmlPane 4)
+(gs:set-font 'HtmlPane "Monospaced" 14 "plain")
+(gs:set-background 'HtmlPane 1 1 0.96)
+
+(if (= ostype "Win32")
+	(set 'url (string "file:///" (env "PROGRAMFILES") "/newlisp/guiserver/html-demo.lsp"))
+	(set 'url "file:///usr/share/newlisp/guiserver/html-demo.lsp")
+)
+
+(set 'page (format [text]
+<html>
+<center><br><h2>Text panes for HTML</h2></center>
+<blockquote>
+<p>This is a page of <i>html</i> text with a clickable hyperlink 
+<a href="%s">html-demo.lsp</a>.</p>
+
+<p>The previous link expects the file <tt>html-demo.lsp</tt> in 
+the current directory from where the program was started.</p>
+
+<p>Only simple pages are processed correctly.</p>
+
+</blockquote>
+</html>
+[/text] url))
+
+(gs:set-text 'HtmlPane page)
+(gs:append-text 'HtmlPane "This is appended text")
+(gs:add-to 'HtmlDemo 'HtmlPane)
+(gs:set-visible 'HtmlDemo true)
+
+;;;; define actions
+(define (urlfield-action id txt)
+)
+
+(define (htmlpane-action id text)
+)
+
+;;;; listen for incoming action requests and dispatch
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/image-demo.lsp b/guiserver/image-demo.lsp
new file mode 100644
index 0000000..7090a60
--- /dev/null
+++ b/guiserver/image-demo.lsp
@@ -0,0 +1,66 @@
+#!/usr/bin/newlisp
+;;
+;; image-demo.lsp - demonstrate images rotating and zooming
+;; and the mouse-wheel rotating an object
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+;;;; describe the GUI
+(gs:frame 'ImageDemo  100 100 600 600 "Image demo")
+(gs:set-border-layout 'ImageDemo)
+;(gs:set-resizable 'ImageDemo nil)
+(gs:canvas 'MyCanvas)
+(gs:set-background 'MyCanvas gs:white)
+(gs:panel 'Select)
+(gs:radio-button 'ZoomButton 'zoom-action "zoom")
+(gs:radio-button 'TurnButton 'turn-action "turn")
+(gs:set-selected 'TurnButton true)
+(set 'turn-flag true)
+(gs:add-to 'Select 'ZoomButton 'TurnButton)
+(gs:add-to 'ImageDemo 'MyCanvas "center" 'Select "south")
+(gs:mouse-wheel 'MyCanvas 'mouse-wheel-action)
+
+;(gs:set-scale 0.5 0.5) ; only for testing
+
+(gs:set-font 'MyCanvas "Lucida Sans Oblique" 14 "plain")
+(gs:draw-text 'T "turn mouse wheel to turn or zoom image" 20 50 gs:darkGray)
+(gs:draw-image 'S "/local/newLISP128.png" 320 20 32 50)
+(gs:draw-image 'S "/local/newLISP128.png" 380 30 50 32)
+
+(gs:draw-image 'I "/local/newLISP128.png" -64 -64)
+(gs:translate-tag 'I 300 300)
+
+(gs:set-visible 'ImageDemo true)
+
+;; actions
+
+(define (zoom-action id flag)
+	(gs:set-selected 'TurnButton (not flag))
+	(set 'turn-flag (not flag))
+)
+
+(define (turn-action id flag)
+	(gs:set-selected 'ZoomButton (not flag))
+	(set 'turn-flag flag)
+)
+
+
+(define (mouse-wheel-action x y wheel)
+	(if turn-flag
+		(gs:rotate-tag 'I wheel 0 0)
+		(if (< wheel 0)
+			(gs:scale-tag 'I 0.9 0.9)
+			(gs:scale-tag 'I 1.1 1.1)
+		)
+	)
+)
+
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/images/.DS_Store b/guiserver/images/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..8d0e7376fef8e802c2c4fef3061adf2453f4f7ec
GIT binary patch
literal 15364
zcwX(AJ#Q015QgW@F8podq@bX<k_MCn6j54HC?ZirN`aILe*qDPjbb~IJO37HYHF0<
zL=DW&jW2T--*_uP$-I^|R<h5`zPq<~w>|?vaI_fh14IB&fh2Ysuu&C$-%-dB^FV++
zzy}z^GnhahK5qg{CX>lzGW~M}NvPEIW+s#A0m_{pB91+dt0V^e|Bz!@FddE&#~#O3
z5(91*ax8PKaO`l5IQBTMlE^2mfHxljR}OfG5_C959D86gnF{3g?sXW#N8GbdGW+-O
zNjx16;^_dAC4G+XC%;KVc94p(eIG878Nn2;k$eFM@EpFlTv<M7<@mbbi>aF&)kbQH
zEtftu!>b%!OX)&}d`<+@LS_MTpL*m`vQ=hvf0AfYl{wDDC63Gz=jTxIrjfeC9~p<Y
z<QQL*;;Q6OXLYZVZ7}P|(H5u0oa!^^3a-uE61f;(ZZ=h?TWQs6j&^;$@H>v2;|yI(
zY2EEeFpuFq)`^iD(+V9@pJ$ZGqYva?=G#&7>EodF%B@Cs)OhxaMn>zE%%_jlcade6
zvP@`p2KZ?TpL}{lV<hvmH{{XBM$+}n3fxmhAY1bSTe-R(J$BB+ilA#Lt-8!GEgIiz
zpL)(?hOIKI&Txk4GVumZ;0#WEs*=m|4Lx4x*hlh};#RWFJ8aPz<7Nwapv|dD>Q28Y
z<RQFNd`faRN6wIn@k%nodxN)hloaME{S<jR*ve6J82ii>jhgI7UGVx*BB>p0<<`!O
z&qxEh?#^j7>ZA8dWT~dtqJo*CQIkZMtIp{@#_Q}(j%AK!E{E<~k}Yh%z;+&0o!8Q7
z&g(+$XDdgvv5$SY@}JiXT}x@zUxs-^v*|{~-JyC^C6`}ChDIiX?p1Panh$q1@u*5(
zC0$Et-K%6wCX?y!sg#7segFR&3ZMU*Os0FRpnQCGeB?e9GzcO2Hviok0R2HgnEYVq
sDgSM6o#(%K7-0MV+dEa;|3Aq6zsY1WnM@{=$z(E_OeT}bWV*ll1AlI}+yDRo

literal 0
HcwPel00001

diff --git a/guiserver/images/change-name b/guiserver/images/change-name
new file mode 100644
index 0000000..3b659ef
--- /dev/null
+++ b/guiserver/images/change-name
@@ -0,0 +1,2 @@
+replace-filename "(.*?)-icon-(.*)" ".*png" "(string \$1 \$2)"
+
diff --git a/guiserver/images/clear-down32.png b/guiserver/images/clear-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..de62f40024e99a10b945287bada4b7e0a4ab7988
GIT binary patch
literal 2303
zcwPbj2mtqqP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU)kx4{BRCwCN
zS4oT<R~i0Z)vKlVW!y948Qa*77nBHz1S4=FZ~&1*gv5nNQG7x|ToGqDAaOz*5NDJN
zi%*dvgb)fsN$dzGNFX6O0u+Nip4GGU-d%e=zE{;f(=%Rfh_ZfnPxV{A_x<0$Jn`1=
z{(xi83lqy8p-reG1H{B;AEg8wvyEnJxw~}c{994jgECuyQQ>b1gki$uq<4PtGyM3c
zKfy+Kkj;~x7aRxhGVS|EHY5P?H~{*;8El@C!jJpiT4T^J*Q$REVtI7HV;*_;{>t%p
zgpE_Pn;mE3=)1#-Y03qKS{@BYzy93SYj0HRwLkg3_jCY$5FURQJeh8lZ8-aG`gaCE
zrI4<J&8?l5ck|}2Ui|XQZ`2!e?|HueL;!|q7<iglwhh~HGIQJlq-Dc2=}##kX{IUZ
zUjxR(BpqEUxY*y>TD*Ph-5cFb`zsFTYM8>v#~xweNyr3`rj)|Q>I%lA5$R1)C=^kt
zRx<$7G!O;>+(H4xQZXB=-K`ms(m;vt_I9=x|9tD+-(3CDSFbnc>hJl(4nl9tF^3=w
zHId1zO}W>L#&JxG_&r4sc-h~2OccdP_)Y`UgY&rx2IpA>Xj>AMatZC-?UNsV@cxZ{
zZ{wBJ-^8%J17XS;1|B2QY_XL7=4$6JT*BIe74$j`vH2EHTtq-&X}`OUo3RjB7TGBf
z5CJDKJb!>V6-a0%fjp!;-oN?b&l~CJGyZrKD?`ix$mr1YsYg+8n}{d2xPe<N=0Zyn
z*tWxy=8I?zm~=;~=QGv^VM6mJz7{aZkcd-k-T8Rw;pWN@j3n;W%H_A$clI7+07Mc%
z85SoSc^u8?U-56Bc|wb?R&Vm>1aTB)!qk}|a{+;PWDA}Lhf7!-Q<Wx){1oFc(taNa
zKj8<}Bn*F~EE6xBKK<E$Jy`ork|eP-_x{aA9Hh-NNNpE_6pBM7W+zD!ZbBx~{K)jL
zi2`Y?@WeHe*s|&GG=}R35De>d6e1k^#N=Z{-HgKs0T&H9FDA&Pa^<C3v2dn67~Yd0
z1Hv1?BDG2DEMlh^X<;dmsSpXzY9=A(Y=K3F*RpNlbh(I{rBJs`R0%?ant=c@4D1tS
zJ67n)6p5=4Qs$BjMNG#gj4W4_Y<r<rES}2&2os92ZBRJH_5+M-C(9{aQsSm%F4-WJ
zixxL0lqOGECmYe$E^3#TfkuttkkAN#I*|ljrG*3?@DKqvwG$H|T@p|SS<De!L0Xk&
zsdVnX)&OgWq|&}-gz8n93@)_>-t#U&RkX@Er$iMusPMrsK-*7na<PRnbAb~|IHd*z
z1*!d?Z0{lPx`@3Hy*8tOo4I7mi-IgcnL?Xpl<U%stxDxWCPL-MSFFDOOE*^YUYwB0
z2n8YGOA8h!(N{z$vD~bqL@~}?I19(3X3ABdSc9TAlHCD<_7Lr@eRv^#Pc1}Lj8iQ#
zW13kw>%$vaq9PEgi~!E_eL+e;J?F$YK_(D+k&a8GOsCaK39VWMCzwp;`RQ^%wb_7M
zDZ?L!aOUbr_6HCwt7_yi-Yt|*wkS%vsXxHowaqL^>2TFysxzxld9u<8uIjoAj%8J4
z#~*j*1qQY-Y74DK<|9QW45GG)KGC5_Wv^}Q;~cf(jv3=l0r7qpMuRSR_ADfoE{8+7
z{T|TkqioVEVi7xhH%-yAA#P-DkQLJ~U3vTCf2@Dw(zAQgGHZ#Bb5g2>F%CoQbb2tE
z%|>LwqLN)*a4b?tK!OaIr<z$<5;ZVL5Ow?Tw|B6;yN5pAU`VZdMp2rZLvagQL@Kt&
zqtze^efi1S#_Im*bN`uhoo95|Y07k-*8&O{nk{Z#trW3TtD;`8bwYuxQ~jFHhdUre
zSqOp&XLN5Jqh62RPqGceSZ76rwrQbjC(*t2ja!@D?mst&{moAvZhaKTNgzi-(BB;o
z?_8d1zLGFuL|m{&|JSH|o2RR=s@bkhRg)E-yxJe?!k+<QPR`38=YiR-QZFH3IvlY6
zuThK-2yELfKowb(x}DCAzrOv$VZZ-3Qf5uO5zCY)_eR4zdQBoimp=4HW4OzUnFdG`
zbUWd5fX6WfUG11m$R5T7)uY>X{0Q63dYddv+hL484-qkvRDpd2Bc@uZ=yV-<p0}k7
z>BJ8EfsIb*@19CS`rg(tYirf=RLnWtJjv>n$Aq%VDmYFe4A>uZI8Sdh(jFkNL^qu*
zOb+vc!$ze<_So&@@z3uIt(N-27hjBTe{l2BhGcDT|L*Fbck|Pg#@A02U8FqO7Q2^3
zl6qQb+U(Oz_=zq+M8z<b+)USehb%R9cceEYc%h4!m=sfW*i&c_-~86=V(!E|-ueA+
z5r%mys3lC%MbUb<`_W3T{g*wbP>Mfw@xo4_gl@5lVWEt`EkV$V^ks!srImFj#Qu-5
zJV`djL7S|m)m<q}K6IbZXF7WG!o|z|g_BEIUAfN$I?e&;XE^rSoBN$Ra&F<`b62ij
zGkNk7H__Rz=(;HAzL42b>d?|jWqQKN25ROzCfyOHzvX}Rsj)XTkfl>+vPP%Z>%chP
z2VQ*UQd;C@E)}kuPVL9MH&9t6(}_tpAE{E4td`S!V3>W6d~BNkmdT#F84d@SCkwA#
z|2AZ$TFZX0*<OAArE7TZ`76R_7)>)+sxKvzCQ>me89M$&4ptm=gGVnZ)BbSkh77El
zy+tvi7`9nwef_)N%hgDFYfP;%laOw^#O#fOsYR*0bxS8ZiOlkUhb`RU7rjY}DLYf&
z9Bun_cO~aq3zG>twnII^(aB{x{Ge?%xSSG`3&?~4p$;x9hu0Hz5CQ4LExA@yc~S<B
zhG7^ya%<V8tsgy)rvLDcn4f!c4>-7<siR%>M0`*OkhW$M(1Grhdiv$@fBhKvKR^E!
ZU;rVNalBeEE-e56002ovPDHLkV1jwMP4EB!

literal 0
HcwPel00001

diff --git a/guiserver/images/clear32.png b/guiserver/images/clear32.png
new file mode 100644
index 0000000000000000000000000000000000000000..86cdc11bd1bc4f8a2a2887a67d40dd63aa294349
GIT binary patch
literal 2172
zcwPZ~2!r>DP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU)4oO5oRCwCN
zS4oT=R~5al>eck?Pd)zM9d}~8Z4(KI6q6t$P=u`jkr84C$U#VKvOo|a#D)m5U;$!9
z7A#Q~fLS2KiXDR`M@Vsq9V~DxC$>ALvD0(^vF57Bxvze=d-MV!rGLL)<9qksbI(2R
zexa125A#nZX}0&?_u$fxiBt!^Y4?;qDKECqY3rJ&sI7m;G|kOHoPRrrvOgJyz%xOr
ze1j}glDzQ_edD_?(WUFxN(Z7e-RnTTP~>BZ&ld$Q3Ro$MLZ9dQSWupi&h@j>sXQ-e
zyiuE~dhTz6AbK%Z=AWgM^eB`K%%%N9Z66T;2_Y~HeO~^F?Q^9{2ichnBL<?FJMFp7
zukp&+JkLv*#33m-=>FC{Hf&io8HR~PbNwVqQcBXKG+Yp6Fu?Z;QO=U4LDDeDv1J>M
zU5w%sNQg_e=TN=wQ7p|}h{!{s!6FRxTYrC(*4EZ2Lu8F+lUnUIA<txB^m;w2)f-fA
zG%3q+%2lBquqEay1BR>_nEGv2(1mWdd+GX>EA+9PgR&mlc@#t0fhdYGBAn;chru*S
zNWi%yNk)WZqi_g>GjX3Ca4a5@T-&6IW4Ff|wTmA-xPR`auY8}D?%pA{;_q}o(B8ox
zHqMcrJ$IJo=H_&cPn<kSlT%Za0dj>zHxYR-7}9VsAjh%E0=)d*08WQ79FG%9@{ADl
zjFRG2Da{FkQ?QEzhEe8ZCsUbYs&pjAB3`9J&E}YXj}fT&70nNJ(y?I}(eiu=Xd`xD
z5NHx}T8bzkd!tK!XK?(b&z}F$e0}n^?>K*il?Cm9Vn}U^1fo^USQ?SmC=GNmxn66~
z+>ysAO%WNQt5&OsLQsxx({o9o)Vjj~<v=Fu52-3l@*=FY(IZ;#kl7FD6PfUzn?L=s
zkr?!qr$2rA53m3An<;{m@!bU~u$X)FagueP@_4r{Fl2@;2|TBQqvd=9?gGX{KO|$V
zLk{LRodJoBKAD4%Z0LcN<YY1eMXHfAU58SUkx4c^H9h;OCnj3+w;wFt(Fnv?B=1F3
z{rD*|n>FMy=Q1FiP>#r=9v1F}<R%3fogq~sL^|k_0@RHVi^kv!gh>E*PE9TVA*-Nc
zm3%^^sQ_6yt#E40^JiwqCy#0e1V`whJ^{6L{avz79I*@JR3M^!vq#SACbif5WOPGH
zh9Sj4NXr`=G&?g+wJH$P>9UXpgV-*yXt73Uv1UIEUD7G5CyoN;Tywqp(TUcv%gg}?
zh@pb;d1nxQnflT3V&Q|+pe`xoE$I(X|A`isrR6nR>2;}5tLf_43_vcgO0KjuX#$jL
z5Qe%G2XL}puTi5>g*qY)n$)8j14_1O(UUVrPLx8_jXvo;*!-o_3+9#pbstC=iPDo|
zHV$T2DjwA*n&dZXG>K{m<A_o~nIiX55L2(;*X6d+?P-x=EfCO$dd(-r)xr*NiWn|g
zO3#T_`#7NSq|=R$I#JPza6jq>$U6kc6f{28q#DZ4h7_Ba)PWHRN%p|{wQh%eJX=}c
zp#Cr*s6W+^#z`n;15O$++CiGqECYdsPJt@QJ%M$CxiwoKZ#Apcy1ds}=^hg*bcJc3
znm-1$8&YS`)5f^QQ$&`;ir!neN3E$zy_hX6>O*`il;7NJTUUyU$X&<L&kBydQP*TH
zHHNfN;!+po-rTTUAMd*I)!$$I_s>56wUwIbG=?adAPJ!d1@*I#h7m>(08*(n+hYSL
zCj<8y$nhAAn5cQ8Qj)_kp!I~cBBBcNJT^8~CZ3H0e%FM6xgNn&y1Bk|f1}@v<mG={
z{m;U)&);pe=T6Ef({eh<QnFzz#$s&5b6uL7Y3qoY<x>;mS}x1}AR&{(LZs_Us~RzW
zpSM|oT`0tywCRFs0bRRs^^Nz}R^GbZS$^=BcdosWLD}T}jn(eEn@j&XGk5$8G{Byo
zDQZnmlLz=?<d8QNE+xJFA`(VNjpS13Q7R`(??kJmYd`fJ3M-P9U6VpoLZv-P@84gH
zU;fE!zgSsX`W<GQqm3|=Nf^=HwdH>zk$THrT7IBq_|*If>}Il*XGCSNHc^?t42J~7
zjIisaj-&*8ed2>J6^AkyS2!A+Dxg>g<kQ%|VnY=u(RD14j>f}&;O)gb*HdVrZCG_C
zl7qb3F$iSln&ArM$sxaii_ONj5S>j))zyXsj2oy7=0?SKbQwArHh81^29UOn_f}kw
zbui!85%JfXw{G0Ly0UoX%*4^pJz1+#4`f_6&|Xz6Ju=^=yjmdzqmqrm$p(yZl{jF%
zZZ@?+L-z_>9h(~UlB07$2Q+5dfu-f;_*<|2{5v0+ntk>&=gz(O+?T%i!Vu0%kjcXE
zparg74mP-LOq5$T39+Ly#-|u{&!cXb=+Kt%VN3S*t(&)aw9Y(z^6O81^o1dWM@I%0
zv%E5t##Upx-8v{;^R&0=Rr@<kArAIJ?(GAgdHNaE0Qn5RrdhtzeTH*)Q@mr<LtF1h
zV<2ZAdkl?6N-m)O!7D$c3m3i$G2*DU%5CpdvAwJqeLoCQZQE0Opb&?(<(FUoo7U&5
z@6$|s8v0#mRb$u>z;jn5;-H3Jlygewcf70la)1N#$DY`AgIj7_8vpm-fF3s|2f(oJ
zcL7@P!RqQNvpB(oVmAhR&`{zK?x|gOE57gETU<=CEZY~EJb(WD!wWEeb93`o3k%r#
y;4~b_|F?MeIEsa!vIYWM*q5{q`{((81sDLVPb+Z8GUk*30000<MNUMnLSTZh2p)j|

literal 0
HcwPel00001

diff --git a/guiserver/images/copy-down32.png b/guiserver/images/copy-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..0886a851df66f9d91db859ed5bafbe4772981769
GIT binary patch
literal 1384
zcwPZ$1(*7XP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU$`bk7VRCwCF
zSIvrDMG&s)?tAatJCmDHCx|cLP9_e<jY9Ap^bL#=6~&!9!IdjPWfXh?H-ZZnuG~lx
zBZ43*t^z)QpfQk{%$%;Ws`}^r%sJOF3s2H>`t<43_4QX(U)M!u2EE?<;P6ekJ*AI2
zrvL2H=iIlcoCZ<;K4AC9Uo?9^65rKlk_nBx-`jHV<gSOK<0IJL--j2jUWKVElui@r
zB{BSbHOI-ILE+N+W3v!o?cLs=(Y?k9r|=M01t93}=?<{7Th1No0I)tW$gaUVhNY*M
zPaM&G4zCkn1BJQ&3P237vmU0uh(-g;-Bq`wJIR391n1D^?fCc##)khU|Ax$I9tr^V
zhSS1g-56m^6R@zN4}#V^Cm<Yn8CgNRE~LO+@^43mqw@lAXNR)!@)pxGX6IxFRd<ju
z5v8f|8J}KX(Svs`&g?UrqX5svKs8>tz|2ZsNO!xQJENU)fG`w8E&(DBk2`nm;wo@)
z<MHwFFVg*@Lo|=O0I}x?98x9xZ!a7K@A47_C?=Njv%GpDHuP>oQTiV4-1$BJc<HCN
z4leH>X5&2&p=XghJ0DzZsj7d;CZzxrMx<c|QL+X-n)f)MW{baZ^Y(}0Cc1L)^ru4*
z;e4Tz_GhtxIq<v}w|MJo)A5qN#1a>g1aO3T@NjZ+>Tlfo{v#QNXP>DchB1H}%(ua*
zJJ)y!K0pv5QV^KgDC?5ygeUOP8Gyxnrs*4QekUNLcje&nX9AigvS5t<6#oi94SF%I
zO+omO?m-waKzUqMau#OBlrpqjZppI`w{HLN@t0qH{p#5?<iUL`XJwZOfV7}@XKd8F
zzN^n^o+{?aX@rxeF_xOsCj9*CZ_iDn;l?mXR9F9}0CXiTav)||mp&DRm2W7;iMmg~
zEw>i;M*#4KIN(kUq^LK;IruCSTv1O*l9`P=(Fo7ZT-5l)S|kS>8L$l?obgTpQJPK4
zYMB%->9xxW#R80l3Ce)mjKMJ}#$K0s!VNVk+b^)ENgYAMj+9q-p|Lf}K+g$SYmfR8
z2b0aedPd~qx}DKSUochDZ~{OTL+%V<TN~8-uxP;opbb1OAB<^AXFQCH&HxCv!NGF!
zX+gp+8`Wp=Bx%$m)=jX;9_JFOf+>a(;9t{lj7-kekxH#LWV9&PBN^>XXp0soRa7nM
zD5d8h*8&UzX<7t2=fCK@lO2~})HKw*=ML&*II&e~24ycP>IeXb(-1hlw?%a^z$pJa
z$EM4f!9%vl&IOXA*;)pKJO;qwg>lmzUC0ddLdz$ACl^4cpyhNZiQyQdv1Z@eV&g&h
zNsP@mDU@B$`%3*B{91;tNq>z*om3Qeh{B<|qy!<i45(pQ7f3+pTs1z*fPC_~(lm?*
zH6BDb){C%`I^#vz#Ts+*QR+fRRK*5Mni6NqbIoYG&#6A81H-c*8F%o=Y5`lp@5(}&
zd}$F~6mxWw>!@JMO#6d|d%2Hrjx;RBAKez?Gq3(MejOJX&Z(A_im{dG5`?9CW^M%q
zOMSlyK-8aIVtnty7A$A!Ot%`4&-{Go)Jp@^=o|-JN_2&7KQ3Aygt3!w9vocS5##fa
ze4GvsIoe>CH>*W2f0)y5u~X?<+yHD(9!A=Bh4!80Jng&%dr#8oP<;Pb75yA=Z9zSB
q!C8zFn3_c2)`5wM|J(JC00RJ<8tq#Nh#7eR0000<MNUMnLSTaUGm?}5

literal 0
HcwPel00001

diff --git a/guiserver/images/copy32.png b/guiserver/images/copy32.png
new file mode 100644
index 0000000000000000000000000000000000000000..09ac14ab9a3d1443983f3f6855d28e69e6616e4d
GIT binary patch
literal 1444
zcwPad1zY-wP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU%Hc3Q5RCwB)
zR?llBMHGIox;oP{lNl4&b&`=qkR`Ala`7S_TovN#G3Z&`lMu<WARYz1i>#}Qf{Q12
zvj;s15)b(c1P`K14l0Ojc4JgbCNr6y>8@w}=<2Til|*||neM9Usjt5GeeV?#5vc2j
zo&78F>lyhtP<^IXeyefw2l|#wKOi<nVR*mS5Z503eE0rT09#pEAv1XTi`$!N6u%_j
zeAz4tAQT8;0EncKNcz>Y9Ghv(z+d5Xp?B_ywI-+G?(Qz{^?K3&0}#t!L{NWvn?mn4
zSzMT=0L2o8x{u-*eBTH3Td(a5<9LC_>*8R4_<+c3x7)E0F{oc_wpuVF=bZ=u5eUtl
ze(=nL20<)iL`VP%D^qhALf|u)2JOo`BZ2+KWF3ct!-Io;5V3$ps|}C%jZ*?}{;O|9
z+d~=|Dke~pB-EJDk@h{NTc^Qc0G-$GjRv$xll7L*huw!d(46gnC&!PwoYDN^Xjswr
zYPSXug3u~6EX5K;BzLO9!DScm;PNj6@0}qwq0{Z^_f@z~rGa#DFpH;pK%;!0F?h7&
zgW8bQguP-J2K782_`v2Kex=t9MmnZ~+Q{HLIrB@*HZ1BifB@OfT}bK;Pm1D9%Yzw-
zAa<M}gc2pDqLuCZ(b4$5f$UenJMCu7SoBuldmo~X9e4_J1p`?4%1~H9<7o`Bq}-U@
zv86D=RDfcAFZ4Y1+zcAta2&lKPNH~jHuyMMJY|B{2FGQA5HfZ!;Zjm8_u{FY%kX$)
zZE9GFGynlJ+yllqKOBc2z~LAY5Tc#|dr<*|RR|`D&^iST^~xorU83A##^M;IOJvx5
zu9)&i;Y5N6X>PW0qrwH{^-E8Q6Kt+fcTBs4nWmU<8rK$7!4g`$k_}&YjccEL_W7%;
ztE*)fU=15K=9YSqI3&##iCsyCikQyhdTR>eXgmQi8mmmJ!_u1N{Kuc}u5508`@MYi
zS6*6DQ*ZbuDmcP!J||H}u-0pO<3?vuOlkelAJXBUmu)V`fGI&(RDx3ht8|(d36fz#
zB(Wu(u33&rl^K&M)h@`YZC-_yAPV^+6{K~F6{!l3tQ(AsUNFsaH7=l3>Ev`f0zBr@
zizjGxN@s~~i0RO%=7yEmIgij)V9hy$YVaWDAt&`jlAtRnItWT4Of_ghAS7uvn@4G#
zbl;;g2Fd`S3W54yUT3T-tmJ6H{w`IAzE+^w(IP8wiUH<9jsaGeg>w;b^^qJ>Tu7w|
zxz52XPhb)TWL4Er#fI{k&!yNEPL)%rls+kA)aDN|CoSWI0sucJ&wNCMKK(cgAr?SD
zr5dTA32ntB6eR}Eob9r@c<KZq2bq{A^jm*t6I{!>L}pu2i&Np~=K#2Q{iCn%{r+3q
z<9u8^wS-|9bvvEet8cD7-S001N8>OF7pC-Pb}iNrhaX$OSOtK0-@bBFetl)LXn};o
zrKP3wSJ&S7MrP7JrurZo6F1`d0%{L0kXOHD!A(R{+5V^s!NTGqT)*+@pO2q=EIvG%
zl&$D2U+#6Bg-*7tK9rWPMY;GFw>IE~=P$x2jB{o9xMZm5CMu_C_gHZffW>|vZr|R3
z=Po|0YdP1sl-K0Gs*_BC1-D3@#K46MPr{u$8?d~*Y$mEC?wwGHPI>v9qpgRv04`m6
zQJ(2y*xcMqtOtK@Z*Sk)+uM7Jb3V$atIBg+Wr_`gpuM%VwLP6qBXi(&N~cTJ{QNvb
yQ3P^gIwtMdk)X~NZTcTCmK@FZ<=X%JE5HCOy@sJL<9d$(0000<MNUMnLSTX*6RdIo

literal 0
HcwPel00001

diff --git a/guiserver/images/cut-down32.png b/guiserver/images/cut-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..d1abc5aae237507f78a3f1dd5fddc16654415660
GIT binary patch
literal 1651
zcwPZ>28{WMP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU&1xZ9fRCwC#
zS8Hq(RTMrmb7$wVJG0$xyR%*TMv6r&P>G2`FbYagq-r#2h^WzMj3F@^gGNpKrJ}}!
z#1}@42^xt&1S1eoF(5`F??;J10cn@o?yLKno%g-t-GYCRkYFhO(3zdwACo!vyWjb~
zbIvlp@58@&vG6Zn{{ukt?wmWzC;kjMB(LKUpJG@RBuM~Klt7eakVO&dqfrPcDj=SR
zFkNq%EkRR)g~LZ(IDF6o4iTuB6-bX9f=ccz*g_n9q=4giU=;J<XOBTRqJkO}p*BKK
zZ7{$}KA1{7unfbr<@2NOWwW_8p67LQ90v@&uUQIIRb5*j)84?YdwV*Q`JtlgPctk<
z$X=W5u+)Z*s)Sx?XlQs*5`;*pRQf2F8(r<XZp#=O3^UFEzz2*81Vf>>6OD~e)`V5d
zbKE8Abb5=f>pc{~xUw-8*}rg0vb3r;8htQYTYF9t#3`jhVO=JbdJ_|(aEKdU8&)f#
z=V7XTakJJCzdsVG*{_5`Jbm-hP%^opSSU<K2wnA*{Eb^e2m}OiUwtgrqpHeARSg3Q
z@N+Zi^rq2lW=Yi`9LJ7tAtD3=-DoHlt6v<C$KMHtf<PIWU|H7cOgi%(#y)j3M}drE
zC9E>RvYe^KV$0(32}=V)u&k;Pux)ec-e3P%H<Gq)!k8UnqbgE{p`jRxXl%Xsp_PS0
zz#@LEm~nLdE0yR{n^)geHDOd7s2Cp9Mk60IHM0H1VsS-sFx%OGQlDEadfSA6vW>Fw
zBPPrdOz<FJhki(G8p5DG*1gbYDJoxZ%h_qUynAzb*x_nrbzh_<zLVkjO9P-mL6&*A
zZc+_2H!F}xh|t(1erHs~2X^kTKRt7L^j6dKqNb@Y#@Jr$VAiz@Lqma~t(aJbNxv>y
zn767BILqPPLLqD+!6V9q{boRM^Qr#cu%WL{Oo_d9NdT^cLD59G=iWAmh6Nyi>EnSc
z@W<!PZ|U8z9)EG_)W{q`6zG9{C>TBt7LT>o<p#l{=STGD9F-AUl~Nf%mLh`<(`Vmj
z2b&JoXd0M9zs)?kd-LZ(@xW1ZIe}EuSFI0@cb-f_BPv0ZoYc|!STb4pESWrYo9lr;
zoX%~ZtX2Bt*o_HOcQmJ*Z6v<lid|dA)W~Xs_Pr9XKPcE`N;wNkThl(_kepAAy1ke6
z6T#K(FJcFKz_Hx#^X{1c(4>wj-<FFxW}4JDM<b`ZibDNfBi{Y2-8O%wKXFmF7oPeY
zpx^<kkX)1*I5CT%@(B1AWJk`;F6Q#L$UZrX{)u%A%cd?Rna1`T9?kV_+@)oIzkyP}
zATWGxfy)KYx=PDxE7bgzqjjx_Xss*w;r$<He%rIDkZE4a^Rk{9{Nr)f!n<qg+dsTQ
z08|Y)0FhWD6iWyuPVUT0cl9nivgY7AY?`voilquPt#Nf+#-m4;11}=Iu6b2mQ}^@e
z%%LeGef>{WN6<Ev`-EY+S9C9t;jZtz{=6S)nH}>eZN)q<fEt!yMz;o%hyWA+f<37e
zX;Lw10a>YmNH_#on$UlI;M}N@Jhsq{w(sVrKm3TxioXCK-r*I~b>_&Kr%gS#(Ds;E
zU5MS@(hykEWm~J55;k)2ssC&w!&C<zRiEoP)cOW6TGvWDapTL_%5|_#YNkb5s$gcA
zL_1y&b<A66c;Q|7Y&zlaoD$I5kLIG2Asb16!%&-E83VL+69jrCI<_LjLb+Um)2EJs
z<?}xi;v1#@pI*>SY*z?(lvYv@L$zfW)$F2eZbvRP@Jy!6b*93d+wvie*p7achEku<
zp9cYL+RA`7eR;qfT*?<typKKHk{`{3UQB~8MfU{iroLtrhI=a6<IS!<08aTVpsUu_
zsvt0}LTc+41hsuq>d>op=E&zZAKmI;e-jF*d5I;n90oWWg?xt<DW&)-0yvL?3WS2-
zl|fYB^%Rpk-a|^MCm7=2jm<P;cy@~)YJAs)@Bm<T3^W>-F^9P4btOf=5eSp^JbRAg
xktnd@*FInKC8o9hugRPF|G(jX9>AXh3;+wR;-8_z92x)s002ovPDHLkV1nHt63zes

literal 0
HcwPel00001

diff --git a/guiserver/images/cut32.png b/guiserver/images/cut32.png
new file mode 100644
index 0000000000000000000000000000000000000000..74b9ecb89d5e4b3c367d47489ad1cdee8885175a
GIT binary patch
literal 1344
zcwPZO1;6@<P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU$(n&-?RCwC#
zmv2lHXBfcW``2r)S4*MA7D{PgQlKqR{)3=1IzWuNFfzvG)VcX*?$ewx%bc4ZmMr=~
zl1-Q3;xJ~;I74LF+<-V8%qSfqA_Ww%K&7Qj+Hx(mrPsS#JDkhDjY;9d{C&CPz4vmz
zJomiM^Blx+99T+Vu*5tQ02)n7W_d-~iz1OoxD@Y4^m^^9uW#SdpiWj7Ii?(Ur=}d%
zMHR4GZDt5S>arKsZb;RoS1}Cp=z(SYCd)93ay$^0WxWIa11%iO$xBO$i!-w_Dn(*Z
zip@IFJu@@oinzez>ui7jKr2PL`31Q-#o2}|eS%t5?sj|ZHmhx5F$BT{hllUCn$05~
zonBXJFk~q->8Vv1hKj~U$9@Y0=-EgM{E5vrapO*}X*4lWRix8u#p!9OE0ytz!trri
zzsu#aMO+|^)9LIr8aq3qqQqJ0TCE~EIZ2(Cs@dqKDA(wir90vRVSGNH#n@rI5=v54
zS||(&2}&{}Q@dFvlgbB&hCBQ|zb~Q!VM0gJdFxhpGc`R;rf5>~<#BO9uh-{h8?tjO
z7K_Plw@*Y=;4%Jt_XeAXhK3!9Dpeki^N4t*GHKPS(rTSvYmmug(E>gnK~R(<30Q>T
z7!Sn>7Ul5)h6`Yv5MZPL@C#D#?3YWTs-MpwR$>?ekJy<90B``BkF7$XShsWcn|1m5
zxjLbc1SBa0Fbo4fg9Y5y9-G{9m}O~?&&%RefJJ7ZP^&>%79;$RNY@M&)jJ890m=ok
zlQ>OF4}J3JMfVYCz9AzBBJ+cT2focRWTbe#KEUVmfgh1Fnb<W%<2*RG347e;g5hKW
zptDEf+46O8*Pz||U3gWe=2tiDC60Z3!M6*UuK-Qclf(DTeTq1F2|?h|lT*`Ndwbhu
zQ)laqaVzaMkK=ClG>l*@L<n&hKvEPmb`h7({z`oW02@-`*x#o)(@TZIH<S`of&7=m
zp(tv!x3}+xT&d2Fm6Gyu;ZM>;e28hYiH!|L?8Ij+f#c_|bFBjw*cnYAs=O5-`L>Pd
z7@gq8!q1oF%2vO>8amL};ctVUCWDD6dCph+(k|5~uPz64IP^FeoEDfb+`+!Ncr$pe
z%M|PnRr#c&HSme;>jXtj{rGtgg}OJbK;G)=b2;B`^ln0)Mu7IuOn50rphAnSComd3
zu!F#tSD<#+49jg@h3(l^v8+0PAm;k3@R=eNys@^>RgpkL#h*8Oe*Uoe(H>8L?OlkW
z3f{UVrj9$y=f2-hcFkoV05Tz*_uhK`>Fb|JtUn%(`Q`c%^-%pQqH8J<ycztpY2iQx
z?^cqh?jDb!3Urd3zt<rUy9_JbS1D{Te-X_z9a?@>A|Wsk8DRd7wM5<JPvxf9%H%Zw
z@cuD+8j^_GJI5qb=MKp0NrK0lPbK`9aKY{ox@E!<MBmvcK9rjtwPM%~^*AZNCtUID
zF52Yu5$KLJ=<enorfJd@c(}j<bC~Tx<CWXK?jj9ZwR3}XM}mSByM3@LRKn5PQc=}&
zu}seCHoCz<1?+PlDRL9PuriO>yRA&TB}RnsAPBIrLPmY+vhU3CAKd$c!Js$70#6b#
zK2?boh)Fc&p$FK^*4g$@pY=Ss`|RKFe=qQd00RJ<WBRC6>huNx0000<MNUMnLSTY8
ChlnBo

literal 0
HcwPel00001

diff --git a/guiserver/images/dotgray16.png b/guiserver/images/dotgray16.png
new file mode 100644
index 0000000000000000000000000000000000000000..8cc1a202392375bc13384a5fd80e12489a01a022
GIT binary patch
literal 3413
zcwPZj4XW~qP)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C0&+=2K~#9!q|?tz>p&QX;ddsP)V47&hH9G@p<QXQ;KGe=
zju+s4xbs3>y7NA~02f^-2qIO%g)OM53qeUNB-6&^EW~hJpATj;4A1=L&nJqa;D1UK
zML`rr<;2s|)6Qr#Iv9_~`(YRk0NU;LsMqVA4+ev?_4V~D03igP=Y0e3@9zK%hr`3W
zySpRL^ZK1m2hZ~Wh@yz;bV?LO_gh<ACwqH)rvSe1WB=?t91agJFE5WbH#fbFjSU)&
z2Gwenq9{nyluoC^!^1=W;^N|12*K{|?kRu-2*Ysa_V)Iu*Xw!RZWpaJj^j`i1wsfa
zl?qyGy4^0_Zr8iHxjA}$ecdU6@pybttJV7Lb{nM>#u#R^8F3sFMG<ivV~oMJZGs@6
zR;%?NA0H2Z?;}hmll^A1NxfdjvMjPJLkI!D&nsnFhHcv{FE7(-wU|sM`z0`+&j(s-
zs?{o$N(H49N-3n2C9+s7n9t_`XsvmEejb#7=XtoUi|e{9EiGZ&HcBak5C|bkz;PUm
zF{EjV>$;RcqtO^iDgQW*Qzo!13n?W+2=Y8fN{MAz6h(oQlC`z9QF)2J@1GlE0Lq0w
zDgGTliHtG$zJFc<K@glJNphd2DFBY+;5bg1z_KiqQrNalnx-U4avuc2SqZdStt+kd
z$;-=2oFoZZmhtuVRetY0&&je3V+_;jG}c<5G@H$<U%g=4HrLnJhiRG~d7jtzeV=;0
zj+BzwY{tjO2XP$VE2U1hx3^F8JpbJbMNy!X;_dBiCk(@bJkR$(KR*XT2(;FtJkQUA
rAUIoHUA<Z?767cQtb7CiQ-22l90?R16PEEp00000NkvXXu0mjf-|~2{

literal 0
HcwPel00001

diff --git a/guiserver/images/dotgray32.png b/guiserver/images/dotgray32.png
new file mode 100644
index 0000000000000000000000000000000000000000..1c2e258578d198382b749237964d48c7887ee151
GIT binary patch
literal 3454
zcwPa14T18BP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C0-H%hK~#9!?AF0b<3Jb(@c&F^QrpJB7^-brg!H7vf`?x8
zvVDNQhqpe+9((gW`T#xjpimI03Lb1hO+5%oVj(kaoY}*!WpCR<z&&&zFfhsY{rG2K
zh8Sb;or7!u8^8vz0jvXvqG&aLe0*$;$K%dqGHHil*aU!TwK}fX>w{*q+27ya9{~U%
z1g`6519*FT0{{$%!?WAl+pg=njasd?Y7j*cX0sWhD7rg3I_jOCo}L4M=Xw9E&DM=-
zI2@i`US9q@JUny{4h~Q%m5|TpVT^&4617?l_xJaWi;Ih&gb<vZoSd&ym#*_t7>2Ez
zo11REUU!2afDi(<ZNnG?LI`rX9E1=Ef&f7fxYyU$-Ite_R%U?7WYQ@V3XN*D3eGu{
zQkc)@h~pSh6d{gdD5by{gYWw&6bg-phlkEOwb%Lu)9JKbE|*a(7GYTy(liAj1OV{0
zhtf0!V+`Bd+o)73m`<nd%m9nUqA7$xKA%S}mjmY<oO4i0SBT|uiN#_801!gp>FKGN
z8NhX2IF19yaj><u1;!XS=OBcD5V8W;whg5eq?B+R2blp%rP7#E`op&ERRWe}fl>-W
z2(;Fql)|zs7-K*w#opfDII~UYdEP)N_4|WAjlNR&`}s;lDFx5-2AKhT-|r_$awnw(
z0NAz-+qPE;Se6COIT&M*QX)x`JKy*FnE@)5%18*&dwzb7lO#c!ruh8)T&-)Zk)|n>
zQkczVu@ItHE|*7{o&}6CTwPtANh!Oo>oz>kL$O!{r4;k|9PjV%h~xN<bKW~XK0eo4
zXL}YHW57Ab>+5SP48xAry8ZF-(IkXG2r<@L4}9P6@9yr7mdhmoU}tA%b063MHh}*h
gK=IAv+Y|UT04K9S0YaAlrT_o{07*qoM6N<$g45}ang9R*

literal 0
HcwPel00001

diff --git a/guiserver/images/dotgreen16.png b/guiserver/images/dotgreen16.png
new file mode 100644
index 0000000000000000000000000000000000000000..b1259eb42afdb3a9434e38461445d7361066afc3
GIT binary patch
literal 3530
zcwPa@4K?zKP)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C0_RCYK~#9!q|@I^TX!7B@%PC&C%;beJtxK_ouN%)>A+|v
zHCb6@!;BH^g<g2&_1H!4{6l)_o&SIo#y}Psghg;yD{IW4Rvk(Rc5SjYUDf8dC&_mg
zLiPvrxqL2O@cF=_NGbW0C{jwcx3|YdwOY*_92~419UWz>)oKbLkw_fQ&CTtn)9Kym
z>FE-HqA0AduipUqd>$z!g+k$Ru~^)Q#bU{Yg$1UfQz#0&d0nGiE^~f<ew@qYHkX%|
zw*XdGSJ434?KXRRdyn%w`6o-cCGlwG5ns&C69@!xD3TACm)uKzPVtvtlRrNF>B(R)
zAeYN+0XIOUQppsH#f^9-E+Ux-d?vZl>-2i>0k~FewA%`ybeQQ6cSNC3*oepD2S7;!
zI6FIA83eAA+RTV|?ms!bJfYt8;Be@GWH1`g>~(0k`=~RLVdFY^dV0Dt21+lUXN{B>
zJ^YTLyU9gg!N$U&IRVLNXww-q8F~h2w*<zlm(q*p+3^XldzIAeofwgDhY6t|j7fwM
zLeo?fsbEVRS64^X8@SXCb~C_9=`1w{G)v)DP+@9PU<w1%2;(;bI5j5{7z_tAdtO{_
zCvLq>ds0%FR2T!P#QdS#^>!)Xk1!Fm5S}1@!^EXK0R?;1$JN%*H3uqJc-(c8)ANS_
z4uH(v#r;mZiAOUK-U);d2-A-lun1TdrWHV#0%3&k=svow7U|f-{V{NVCbMhTL&xpj
zHEzw1B_^=E0>A3RulW#81IrBJ_4w#@ZH8|n$LW~|yJH|U87h63_+j(qvo|0Ay|`f5
zS5a&a-jRWO<U_T+&~?yiU-9zUtB={+-)~xGpfvtLtJPxh%Wt-{l1lmK{6-`7M>3hX
zM<f_QS2g}=yyvgKPk43QKmN+x*j#+@^;W%J|9?z7J39bGqfz?(Ugr1mZ!7gqDciPd
zDaD~6+|k3ZYhnN4{cm@5T`$#YHKdfRt*zYvpOXIu05aAgn<~fOCjbBd07*qoM6N<$
Ef`E{~QUCw|

literal 0
HcwPel00001

diff --git a/guiserver/images/dotgreen32.png b/guiserver/images/dotgreen32.png
new file mode 100644
index 0000000000000000000000000000000000000000..d74ee34f17205f4c138c96f2d4702a0e8c2e15cc
GIT binary patch
literal 3634
zcwPZA4$bk2P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C15ZgrK~#9!?3YVVqg4QgpVNN5@$p?s>9jBqA|;F&XdS~P
zql2Rk5Nk4lxHBm~Ko|T0H?wnPGG<u20lGDTL`}4e3&t=&9I;I^sBr-bbXtP6(2Ko%
z$Hl0boeP@aqVMXQ<Sd@N?|W`SO37tPv;Zy}z{Vx((g9i>Q2uK{CX;z_>X%Z^08>JU
zF`y6FlTvO22_eL)lrkrT03a9)UL4>BO#<_&RBASnNU*-XPBNK92oVa0!=Z_ZiT9_c
zr&l78$byt|?H`B>NAR};lfcLEcziq_kK^<C7#SI%`)W5f8~nC^z|PJN*=&|rEVeZ_
zH}?^+))WUU%kl&B%gf8-5AHwU*4wv;-i;C&dW8<J53o2nJ!LR*jc>mEn){!8IxeN0
zkHun1Aa~(yD5ac9rBbs?OH1_J=pi^7M082=jw6mLKXX|5g@SU3(kr+!8ld;pt1K=q
z&L)$|nWmIbN;$Q$vB9Zwf_dFT*7Jm)@=rM^yRiucA)wx<bN*+EV^<aX%aTIwgw4&(
zsc1C%Su-LSd-!OL_K1q&&rx?4_@gYSV<PO1=a7vW#ripQPYp+xPTNo$4<D_K-Q!+U
z9O!$R-C^)%H^D#&uO`sdPBhhzQ?UbrTBC}y?7*hvaM?@L&pO!s@rS;qL||Fgp3tpO
zpi|K0(=c=uL%o95?!{?$B7u6N##u$h<#yn4mMC^w{A$+sngy^O3Ec>}orid}03ALr
zhQ~*{s^fAvpF3bxaTOgXioix5w=2W&z{qw}E+fmb5;w2ird&G1qo`<YCYr9H=^BRD
z#57HG)5I_hbk&dQ(y0{Bd2Qf!qFDf|Z;sztX*>&1tW@zRI$pg4Q`OPz?dVE7hEv5f
zI%soiluK2tY;fg`(YIEc0wAT#^}p1=@b2J;Tj|FK9G{%fsM@jBJhWLVZc9a}t5CL4
zEagc*-rss>;Dd!w|3I!OM{zox20+*K$uGWInSYY`e71Mk!S&D}0bc+`C_FnpX7~49
z_S2P>VefkjccU|Fg+hU$p`nWdq*AGW$A)3}kB$y!zWe^$se{7S*m>=sPuRqs;py4#
z@{A>3AGxy{3<h)gd>(*sINW-Wv;bQFf)>F4zXN{_00~fMhHB<-$^ZZW07*qoM6N<$
Eg7z=<B>(^b

literal 0
HcwPel00001

diff --git a/guiserver/images/dotred16.png b/guiserver/images/dotred16.png
new file mode 100644
index 0000000000000000000000000000000000000000..a5dd93c7e1b0bb59cb00d859f3e9b7eaba3df770
GIT binary patch
literal 3528
zcwPa>4L9<MP)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C0_90WK~#9!q?5f*TXz(OpZn#nYu|fqgY7s)!2*TG$c2EF
z5Ek5!kA;CH5-3wAHvW)|Y#!6mQKb%aAaYX#sZ^C~s>(5qsT@#UCnUwhII#hP{p&#D
zD09w!9=*@2b0i@IUot8{CX+!3fh0+kN~NT2+cSkiA+@u!lK_atV)^0W;nid^xg3kd
z?2pTHb93i_k14X*?85rm+Ty@heewC(S)$P>0(e!aOxd~3sqY^?yf>9fElp2PrzJ`H
zlt57wRvtfI`03H32eY^D7<ca8<?`q#{$K!PnZs(8Z!Qm!U0I3$n8`e7cRJj@bt~Nk
zY;SKTf6xBBcynOTm<UC<*ly!``HI$?HwYncoVDp|ceoyk@NQtxu%G<080+uP0k#TI
zeExi<uW=L~@hf=#*rc(yOUp8mKe%>;;Ph=B_g<BRkg2_I#<z>bnJ%ETVW%eDUc%Kq
zT(W>xjZV!6nhOb_eS$csqgU&M+7eehIvX3gR98WLv6HxTv7a7U!W;164hC`gEmWry
z3Fx$19IGxIia<GN^1iK*E4@f`0TE<^n!vgc!SI`Sf<atf6NkrzBuSi|wm8viG(8TS
zo<k1)-KY11pbF4)btJDg_owtw05cfCFal_%h2nOecW~U|RF%<Gg)>=3tNur5Y$Oky
zV<M9itBvCpPTj!g@4;=EXqJI&naF+%#WHZ2ems6ZF0aK=^OW$7>#JSB!1(y`t}n24
z*f>UVdl8m}WcWb$g3pI!`Vgjtsv9&;j@UH=Tm9qX%UwWkIBfUM-(UKz@T~s&pvsY=
z(sH^Gh8LmhoOyIk91iy1)%o?=U-jVp{iO@hsNL<LTCFlVc_aO&s_?`5lf|Lh+xVp`
zU(*wbAgc=dFJJRdvB=-`!!7;0g{6^e*V5&3`SVk*R4QDZm`I<Fjpa7i*Jg_OLaO!j
zX+lE66Ab4agF~y6-`-r-G|euT%V?Sgfb^yB{Qm$RViZI1iObOd0000<MNUMnLSTZZ
C&(nzj

literal 0
HcwPel00001

diff --git a/guiserver/images/dotred32.png b/guiserver/images/dotred32.png
new file mode 100644
index 0000000000000000000000000000000000000000..9eaeda5cdc16cad3c3a7c1b98fdcfd65451f7a0b
GIT binary patch
literal 3645
zcwPZL4#M$?P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C16oN$K~#9!?3O)GTW1u2pZD4q?CX!~Yh!Z@B@RJN+tekf
z1gZ{*mXFe*GD8<AQa^qGf1pd4S|wwdGZjcz(<LHCYDEVEAp|Z_#}pzQ8v~9*4EXE5
z9a2S|nn+kmrTR=~IMVy*IXdS(LQ2W&429Pm;(u?T4p0YhzN{dfPQS>dlwl!692k;P
z_5e{K#I}@j6-Wvp=B1QbAp`)XX`UV6A2BF|nB3ah8eLdeU}<Ry%d(JCc64@jcJ%f2
zjSUYECt|VKG_d%p<NeY-@V9|MDdqQbb922v-@Hk4z@X<!H!UqK0HjhW?ylV<ojYV~
ze0*hMV&Xesu_gv=+YSShGqbb3)7P)_`Nso{d^W<xt}cvF5TPhMIXtBEt&7~gb&DUb
zUF(%FIX*VF31rU<Af=33mNlA~nWg{Sc|MAmv{tLQc2krx8Ke+2lq<AVs(ctRDMZhc
z_-SVJ{aEam*4EY=wE!5pv%HM)c#q3%=WwsDQAqzu+0aoCNF-G$spg)dr4NWng<N`%
zJIl*MBO@a>YSDt8d&xyEX<p2OG%m$Pmh)8eKBVeG5dz95$lMXy!Bd)T!MmE5&D)DT
zT)j#y3`CFDH;6X3(4+`FK^=Ef2$vqf>1sd#cCk#cK|^&&)Z8&g6@hhsGg^~9VB7X~
zQ&o0^RM1Tmf6$K>YQp8!Y0z9Cpi(MP^5${7oHS~ALc50;)#`Sw09GU2T^;JPJv_}p
z0-+E--9YsRaJU<vTPl_)t4>s>gNmZyJlH4lLDy<cR<Ui{$+rGJo*fry^!V`@LEO5I
zQ}>}5I*JiM(fu^)0o+CamoLD{afvtk`;xT+nC~7OOzaq8@`Y0rw;vgJ{wN+F!tY1u
zJ_s179-Tt*lpQ0S=o%Q9uL*#ZG8=7gpKkr?o0a7UTVxLRIdwQGyWB{xhOKE-+#08<
z%KlNF->pAZ-uU|4>Glg3vabT*n3|gU*MdwYL#0xAc<FNI!$*2hU)xxJC!a}ER-M?w
z!AYseqn%wg?r*S^$t1jAeEGwt@%Un)P#_YCoc%AbEbB$C>w5TcDiy!`+pj}M4>o&>
zPqI-V+4h9ZRrlNPC9ixkFmIY>HlNQUgdi4+{r8X3`c+&vP;Wuqz+VFZR}O62Lu5G;
P00000NkvXXu0mjfc7^E0

literal 0
HcwPel00001

diff --git a/guiserver/images/dotyellow16.png b/guiserver/images/dotyellow16.png
new file mode 100644
index 0000000000000000000000000000000000000000..8558b000c23bb7a0182e4de18be671372fa443a5
GIT binary patch
literal 3521
zcwPa)4L<UTP)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C0^UhPK~#9!q|?t&({~)l@#p9JyR`lG_t!!}S2C>>E3mRT
z-Ig+<i`h7t>_#%Pi#M{r!y~s|y>K$otjji1l_g8Igcd@&u!dw+B3)=fbS+S5Z9g8C
zG<x>^2R!nAz212XDJAbS8o<)h5>iT}lvFB}>5cXExqnK3&D6KIQvl8f=Sm-@QY)7y
zCv&5tqXhsdCG+$1{{yCJBBdn1ynLth`0+ww_-yjKTeomxLjdeo|IL(&Ynfl}-TQXx
z`t`*dH*aR&*`VES^CX|YQ-1j4-LErW+Sk7Mis6r@@cIHs;PB-EmoHx6_uO(afB)g#
zPNzd=b~f7wDwWFg*3bEc%!RY|$Cn&p5wNKt4)+j9Y$1s`f-5Npxi@0}@#~|7r}20Z
zC};rN<?>vdqvTZFA)v0K*8b-7&;X%=0NLvzjyeRi7ULt(c-~2FZ*9%>fxSX;=JWF&
zqLCNa+5uV%G(4!9iBtsg^(pE}lb#NPLqRSk-2Ak<I@6C3s#Q{nFV5ja_ptpPOt*vL
z3ZWP#LI~)c(zR4v#y*DjAB|>&VBuM+4@3q95eIw`H(q}j%{v69kDg(n2nq58jt4MJ
z1EC)gY)Ychx2|9%CQ6!7&se@NTF{5^1YjVDs+$O*AiF1E7$`zuC=E>G6;@)R1fT%8
z$F8m%x0^`QM!G{_`w_MWCFDnheF(n~VSABwn4aaO*=pb#ySmZ`V##!FqaNNoIDSpn
z<pEz15%7W64YnKM^?*M_Z@|mTR)>xKGn>QX>0BQej13o*@$VP&#pjKk+ACUJosO{R
zsa_;D9d&?~FsL^Vd9t?C5M#F&!%no&?_hU#mx<|X*$qYI{-XyAiQ1pZcp^b0I)p&5
z|Dwju(=wauy-nAd9~LLmpJuDo>RTmR7WI0a^e3NX+o$Q`TJg8J^0U>MUUxNxkXWvf
vlCEb~uH2Z-8HQ1)R;%c`4uE*ycYZSfbwm!h|Gtd$00000NkvXXu0mjf8Y9LM

literal 0
HcwPel00001

diff --git a/guiserver/images/dotyellow32.png b/guiserver/images/dotyellow32.png
new file mode 100644
index 0000000000000000000000000000000000000000..be6ab618a5ed8c3f2cc08f4d5ea74ad9bad2e9ff
GIT binary patch
literal 3560
zcwPbM4Hxo>P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C0|iM$K~#9!?AG5;T4x-`@%MAi;Q#`M-=_%L4%3y2qw1vF
z+HBF8ZfQ0X{{b(W-t^Aw@93p>{smsujEtqJp{+}nY>A*TEX<e;M=Fb`wJoS9l=JLQ
zC>JEX;kkbD$t%zIoA37#Qc6DN5q&@(&<FGZ-2hfrR*+I6rKDUgr?<DZ=Kd-EHFH?0
zqyWrMt`)DRQtP)SCbA<VBY6NRB?}7+y#cJQt|Fx*x3>1E_~ON4V(4lz^~G(>SQLQc
z>VFgqo0KYhrOA8umcF}xe;HtYe*S~mS~t(sYPEQo%RSo3{POsR>2Hm@KYq{9=aYE6
zek5@E=7d`}Z}59|Etz|gdE9QdnVy|p?k2k{K)GB_?>@~fPT#m{-2TiY76yYF;`9iC
z#1N90DflvFB9DfRKb}2b+>6HxK)xq{%FfPQoU`O)+{CYLq1OK9@>B<*f&giC5NB=t
zT9dJ1sK06_E4#aMJp&x&3o~DT>LwC?jiH^OH9^CTs@ai>K)%03y=Y+BU@#isX2Qj<
z8yhn{D?zYUP9?s%h8a1+@U^kKOcZAjMYkh_0PB*DL&d2dqigS|H^Kz+|E78d2oDOv
zCV0axJiZW`Ckl2imhM0i666J(4`8?J2-_Kfh9nZ{ZVq$>a3scyntnL#@P^O=UWD5Z
z0|8W<9U&BC=K^#cMF@1Ij$MC?BQaj=CR^#|l56zN`gyB?v>QlQ5DXu}aH9l$h>#cI
z^CAon(g<NWJT#hhoTGQvdj^Olr?T6Jq0-6udpb@xcmoK(7d$R7TnLXFd_k-M4{w@n
zwvVrrhQ_9{Jp&BJhVshT!=+r|ReitqmS)FBTR5;(4-$j6IzUtC95zmQxw&5#qYsus
zW+dOU9ymBSU_5<yd0SC=^8Dw;MD5RHJdq$Ai6Rgjzpk;rw?k>mDmkzGv@|jG)pE63
z?cFlUWHLx8iAJNeE-%uXh2Q3y=NmItr<y`Y9M0jQ&6ZxDoSMz*x}L9As|X>w+6Ddp
iKp)Tt^Z_3o@c#gGXiXjx2R$(W0000<MNUMnLSTaKL&iJ+

literal 0
HcwPel00001

diff --git a/guiserver/images/edit-down32.png b/guiserver/images/edit-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..fb0edbaca94bdf56c658569aa19fb287623e5a0e
GIT binary patch
literal 1701
zcwPae23q-vP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU&H%UZ6RCwCN
zR$FfqM-={McD;7U)r3GqfRF?Vlsn=gRG~;!rAnxMs`}o?s(+$?p>KUa>RXG{mr6YM
zp_M9np-|FLN-2bd#?A#hIEkIL*SkACb7pt5CN{|%>zwR*JUiz*-#O=-5lShfuNyaR
zT%(b*^jH@{@R*<v^s_L}0uuU9kMZkah#*whm0imn9y{{r$Xh4Bulil6&OSixw{K~V
zkG*H!r+Hbtd~z>Y@A9Xg!^SHYt@9z>KBGAmD5wZQ0z~QmA{vaaE1|~}s&1}(ajEuj
z|Hwwc?(Y3t61p5M81f6^JWa1jDIO;Q(X|CY)A#fAV>eCgHl8V7X`D-DLB<Pe*UUhu
zorHkrTPQA7-jP%Petq=xu8({2`<~jv$I)muCc6g@d{_AEkz0MSdfm=gQ*l&V0K~|Q
zV{I0sWx=AmMR!4H1V?PxQ0$yi5Ck-@35&*Glq%;p?%un3>B{8~h9*A>9^C%<i>D8t
z<?D}Uip}SXWob)v1Yn}njwL(H*fuOX1KYA;+XjsOEnYy^P{05}G@ArKmj|&_SzEs}
zegDs!>wSGIb;~)oT3*KJnTubBV@Kx0RNZZ5fJqRE^GwDe%dlAl!XgiX*f0s;BtQik
zL_p3Z1F-4$P+0J4^>+*9CA?gi$N2c$w@zHV@|Ekl!0Q0$=$LYCwsGt@P6B{`X9nV;
zB><L!3@m0PLpRHIxG)`e3H6`>U(&nT%r`5gf~(V|S@XOmhB4j_fT37ZZWu5iY&*lC
z7=VymDk@5W1|el=I+a?ksU-TE3$*+Xm@eiJ^q$9z?|rgVoV!IYxgMozV(f5x2856d
zLOZi<o6U+DVUs*3)(8ebg&2r{)8Y{m-bM{$?j7`a%MgtbxOt1xP&yShy+Nvz`CKlC
zYgZ>br9hZmwm7wT%+POGNCVIspuhS&;$WZm2hm%=ler!&^c;uN-v?D)gD*1heII8}
zoxsTc;SLNC03kQKAfcR{i=+nh7@|TH9KB}2L3U#i2mNWRl`YKqqp(MhQjxk;2NF%n
z`_P_2TsU`TGvF-%Ad)_3OQ}}$ja$`#G~&dJ5HnN>7^>Yxu2IJ9@*w>2v&i;jA(<sX
zwGtwq@5k<ZzB7PC??s}&n>T?Jm}Ii)2D=Nn>MZtn|DasXVs+pcx(*(K@S9068S19x
z7bVOWimw5{WF|5nwXBLN-sC*4d>++*f->pVF;x8pvR=nReFSpiB(X!OiK5r$P-nRt
zE~cg*yaqtzNlR?np;DnS>SK1U@1%Y#!^mLQ%6$yDPqA3)hC6%;_P_uXwHqRk@#0x0
zgJ-kP$>!PvFpiAFSTq<+sG?2B=sp{%pHGS>t3~Wt{}t6rfW>eW)}aY%i3Tkefkntc
zh1ww%wyuRAf4bcXfN{dnkrOukJ$4?NaRY$#-wWU@Ou?xwqgd*PfABO!)<H<Q4@1M0
zIddpZhX$eruDtTHeH&^gI$wU^!wN`*^e)Hyu_-uaL{~kxEN#u}D|GN!#+`zL#(`t#
z9~psPcR7HVsgRh`jA};Wy2@CxJ%D(3leB<OQRr3^Vzb&c7!?<mF4$5LGgHq{$sfYR
z$qRh?2`KkE04+KUAP7@+(0a86ppQkIUtbv6jkjJJ=QDwJPIrd@7Jk2vqG#dQdz0wu
z?LwngBj@yPGX~&u&Q%8l?NgxH2?Q$~glD>f%%byvPKzY^G6bMB_aA0fHZb<Vb@cA;
z$Hsb<9nz_a05q9F-w(JBpwi8~4Fmjw#t>|3fv#pNqzy_2Q5r(5QBUu^dKm*F`=|pd
zo81x9PiFG3b`Buj2`ybgrU3-eUf_8ix_9>xD>kaDtH~UFGScY_q7I5%x<yvEWgvdm
zt%q<^{j`JlOc)<h8=lE=q!&R1Buwc@qOod+3?z}$M}*M<Gy;&`s8U*;Qp`xEQ`U0U
z-5!8Qauu_Y*7Nwx*amUpjK!ygO%-isJ4k_Ovv9mcB+nhfF=CTy=VTX68hLvFT6o%|
zD(d4{kkl(&nFn)rQ0-aTsSs%ZtvslfZMx&40_a>%(eZsJT|oZzE>R<^#Bp`J+6F1M
vgi8Q=Xk%K?(z0a<r4-)eCGm!@{{<KTd4t9LETLG-00000NkvXXu0mjfcJ3aO

literal 0
HcwPel00001

diff --git a/guiserver/images/edit32.png b/guiserver/images/edit32.png
new file mode 100644
index 0000000000000000000000000000000000000000..7c0be93adfd8c3487e02122e24a682070c21353a
GIT binary patch
literal 1547
zcwPYu2K4!fP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU%ok>JNRCwCN
zS4(UgMHv2OcI~xeI}ayy>o`qZr)>&tQ=+;rkl;w+2nZp#SAzD~WA8{@H~}{Vf<uG|
zDpDn&t$F|jTtZVyNlMxhnmB1wH!mkPN$h<vGrMcA?RDaC=_I3>*`59WZ@&LAzlmWO
zc$!VFeo!c?A23Mo0md@JCg2%jVlGN^*lYfkVgD<VBrWAOv~z2kbj4W7VD-vJ&~lFv
zd;Yb7`!m`6TkoE``)F}R=;Cr}0IU^@ZR~k~y$<lTt{c$V16|j}Toa=XO|$0Woe4_Q
zbc9<%JA!`Sm-+14J5*M#?uhha!`J*0^>us`EX=Pz8;icq0Hkbvv>E`DWeT;%awC-+
zt)*d@067?y^^Ky+zm520`h_>ta=hil>F~tA?H_(S^kev!;T!V(*~~7d-Wmo-^@{yd
zLfD{#5Xw56QMP8vC>yE9I%h&Nzmz2knNs+D$}UFI=VN2jv(t}r153-R7@K|c!_?x^
zB-`d?eccs+TN9$0a>_sm>^c=A2gN7+y~gI6K?DG=%=UU^EX*w&xH<gufjg;D1UtjG
ze)@gn65E=wl{XAP=qIMdD0elYTkNnEpHuM^5;X(>#l!Zo2M>m?Ve0-rXpKcN_VC_~
zbb4l#ZCh~4rM0Iu|7vV*f#6+G&y?~mIYzEr(=_DS-rR#xw2!}!_RKIMefy9+{mP5Y
zt*u;NaZ>;e(_28QK@i~!Wu=m7cUgkh<G}_q&)i%VE2&T5$^41V_BMFJ&Dh-?j|Kz5
zPFv2|vuEp=fS6%z>n6;uW-J&cAd3Y<=Tw*xARLp2D`C;#2|=G21nykI-G^P6O`O6r
z`}e|Y7?eef!X?GyahyMYeiH^<*x=R|r?;5lX5dUnwA^K12qZfV`p0K@{6NK|e*mHW
z0mNf5G&T95s;W54nKNeuh{ga|v<t5nU@Rc4)6&QQ$TB2}u{Hh`*6#g=$=qJ3hfX1}
zcMm$kVX?1RG|it(Cb#f`DyOtr5G!IafU<JJ*pU1R)VVRJx4%Xv6U2NhiO&9h^hBfZ
zDT?^c>-7pLLqkKG0U#*5AaMkPsT{-}ZHHt+WCcdifI9jq@>A1D%ZH&HK8i%oZnU<x
z2y;oqG#hV&gM%0u8L1bBwP4CYS&j=^xrhjMu)>}1v3~O+9xioYHJ(J*fj-1`?qty+
z3sZ3)v880QSzNeqp}q-93W<X#;!y5@NfjCT(md8vA7g%c1=C7Df(MTv(ba`uARrXj
zxx(2lU%tGx50E;HltR=Jx_JE}R&J+|&h?<!cMS2~UPL<Dg>Q(vgqq2VG*S<^f^g75
z9LYlRN?4m;#`t$B-21f+dh!_d^dCaJGYW+{UQtyA{U!kFmR##+LbpYwS%^TtJTZn_
zsR>NB4Ip^@1tj7<Xl-c`*EF$wg%cqW;;M?e-#WxTcHKr<3g+#vtJkp56hhw{r*Y`W
zVZ?StSw4_V03}C-Fvs>y;0D4<(_Rlj`met+KDUg6Z@-ECN1sD)d=LCA<LRt2A{CdL
zSyQ;#prPy7uycS>e!`2T+<F1~Uws)}iEczA5d?!FQLY){$}al~*-lYP90!H-UgAZk
zBQF&;RCMo4puID~>`M`9Zf2l#m{oQeZ6yQSFo7V<sog=U#R0Q5QydD3bZpm$CD=yg
zWmeahwj#e`W|)edIl)dax?xf8RPGF1cNf^~E+{Ll08;{CRSAY;pMfgnP5}*uA*o0<
zRXL!V5vMj%$#wPndQn~D1L96Mh^rY~6O&u@VjIdKhmZ#IfZyA2p}ei;S3G86vlW1R
zKEJxSxX3-az&_C3h%Yb6W-eQrHw6N|sdT!)O0rs$SN}RbdGciU%*@OQ4w?bb{@;0x
xnwm~6s`SZ|C)ZioK2h4m)AiH-dH$aO0|2+L8=tyoU2y;a002ovPDHLkV1jow;1d7<

literal 0
HcwPel00001

diff --git a/guiserver/images/folder-closed-down32.png b/guiserver/images/folder-closed-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..b887153fa58c56e15bc995919854042bf03f5d6b
GIT binary patch
literal 1478
zcwPa<1v&bOP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU%SV=@dRCwC#
zS37T9MHD{sxce}8W0W|Hh~g>|5(0!M5S0tUf1u<4@Du2$5M7#dDCv=ajtI)ckrjmH
z#JkaYcjv`<&3!m_DBWObG}rge%=ylD&iT%)DW$-5{`sGNxDPR=uNKSA_c4~4F|fU`
z#-vns_x5&wK0N&5+u3Zk3L(7hOmoS*ftS|04#3Ij`3{nBSTfwhPauSJXOv<fr39;0
z{(7-keYvx<^B9kN2bpVdDV<~ywB=2-*O+QB>#WZv^NNzgVsW;PAry2Be2i0GlXGHY
zG%A38be6C4jbDF%{^R@e^oMmGzZH)wOext=7<0}zBA%a$JSTje3!RJhiwv-Mz6+aI
z-{Jd*xAt#>UvH*JNkQNNhXLOhaMl7DvBu%t;P(;JHl0rA%hzQN5X4h7j7AuIN)d9}
zLQDalw~%7M(Bh2$XZ%)Z4?>8@=DiQ^KRP%#c)0iOQ}DO<0oH3;TwpYEFvig|WAJ{0
zU}zpAh$(|0fC5&-R6qcf#6}V_5aR}7*y!vKfKwm_*A>`eh8^5Ju%CSV0i2z_0RQ=C
zcj4L52^>8?MZ*paPSNlLp9ugy`w=)t3^ZVf8M2PUaNvjm3TtBei3Nv@Ig9K$hs!LO
zAnR}uW<iDq9ea85%joap+c25Tz?1RCVvXL9*=RGG%4nwizw-?rN+B@DF$+R}P14+k
z!P+RHqqQ_DOtz0RqM^6WO~Pumgb-HXkB=9)$s&LW(@nG!N@jq)Z!`}a=LDYI6^Z5m
z4fYl~aLf#|lQlsTGm$Vfv-dvAx8`$LE{?#D#v_g=(MHC+8>821*w*27I1WRHAhTzZ
z>82}ru97UFp|dD4T>wi}QX(>Z)6DOD1M@o@@N_V3ChEjnuQYa4^79+iim_~x+AhKf
zl{*gFWB80_xR=5RsY((8FjDtSA$liND$N{kagJh7-z<GMRVSz-3cshdrRGOXR2rPP
zt_@L}L;ROoOIN69>9p)^f9;yyLRPWLmAO)`eO9?E{lwwqAv$%a(h;?pM3p@5SAfpE
zC+joR1g&Q(&Qb;%>#2ST5X~eenQK}`rPi1(=2D8#hM;JMlL+w{yjR{4u%sHnRlssz
z21I#U%+bJ1B^jlRrKB<0_F`2P&-Kc!GN#5T!&5b;Kv<T0g8?Xr3V=S;I9j_A6*HRY
zw9aV=Y#IoWsdUy5^q8v#W7vu;2k8ym7jhcj2U3*wpN)u#wZkkY4;>k|>b)5zR9#b)
za_$M(i~<Ty2<H&C=R6Y-2~$>WQ~)ssjcr6Dc=$#RrNcaKAT>;+4_v0MD<!BJUj_`Y
z=jc=jYc#&Xv6kn!5w<uC`H~RSYEtPWv`s^_)n=q((n@jF`O-5k-jlcNeeH^I&A`Zj
zB)wM#Q0|Gc>J66=8Bfw)DR#9RI#ov&E4YxH{n$sLpXSIjC7;|0BzG*ldifMy9RG%`
z`5YO@v5h6kYK>#&YG~MSE76>wmsE$`gp`3e$o^U(bS@?LXuJb|J$Vd&K6zBjFtrB}
zJ`RD2yqP;-?FHJ1M1)L@fF_}o7uSE)l9DtzyH1D*WY+ru1CRr&QgwI8tUa8Ot0?t#
zoSuu`h}v9Gg99bx`>2Sr^bxDKV!0W6x_Af!NffeGK5Zso2Jc!i=Xao&Sj{4mVw<&v
z2!OWYjNx#4yx{cD@w>Y-WUg%Sw?VI&^jb&@rr$?OFASx3gDxGI3(bjLv4+LWd$)B~
zZt-|2-Cd`YADk_=pKiBl9}R8(`}a%_#GAi6u5OwI@4O@T&)$vk1Lq`!=DL5HS-9rE
g{{dV(fPV!T0LO+fortj-?f?J)07*qoM6N<$f><ZIaR2}S

literal 0
HcwPel00001

diff --git a/guiserver/images/folder-closed32.png b/guiserver/images/folder-closed32.png
new file mode 100644
index 0000000000000000000000000000000000000000..05f168e42c192abbd222c236003035d4974f5a9c
GIT binary patch
literal 1471
zcwPa&1wi_VP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU%QAtEWRCwC#
zSG{jsMG&9a-S^Hue_(86J0d9|1^fpTkWf*iLZU(_e*qGrprfFqMM9#XqM!vQC=?JO
zQ6!{8AR!8bL`Blz1ljk#c9@UdeeYt&RLBh{&F#B=yYri!`OVB85)qu|Cmh|sF5}A-
zhfjFiCcwsC@e`<VxVEvfe&_C=x4yqi*WY^crA6QOaE9S{%3N6-Bf)%LtB8)kUvr*+
zg}`4XaQx_awdXCohob&&n;JGZx2|1&&R>l&e#Lv%_(jFyb%6;^umv!tF+c0?_4TUz
z;ok3yo40-;<n^H&wizqpFbq6;(}`i!&Cl&o1-tvZ^SulB=@9+Th?RPebuuEM+A1ES
zUT{dThz6drXTV6v;t<`&eARt>`^OJI`uNTbRdU>HvRir>`XfNcF7XkZ8+elg6k#JG
zReHc#MSC^ko_Q*Hn@GWl!BN1d(`S>8e~VH44twz4L8t-RZn(#jH{N^qRSv;$AL_s`
zjNu%+B*;j~0B>>A6V_^wbCE|<aHD~I4LanXl)^`Zli#ctEh1Z+v)MauUx5$ae+|N4
z4-vMvm>8=Ad!k~sOb(dwxWdk5P!6?oG8Z%?h$Gh!sTe?fdW7C0lf#!nqXvrb=Dum+
z#TRzNrArr~X(NQEHu!86Z|C@v#1<JGS9oM$V?g5_QaC(JEJ$<{2vIKX_XS*Y2<^R@
zVP5dw!=u03{_x==s6q!}Yg1B#qZb)O;=rdDQI~^(8!1^SX3|f{uD~vxGJ)na7UNJt
zA#0MCW)(bma7>?l{vCXI^Ct*>^l1ZofB{j#GH9@rWHCPYl;%?}#1w+e2cO)|dr>k=
z4$-L|<pPte>j}QO{hLb2Cz1uIn-id%3Ui8kO;OAq$YG#F#tFF9kF>9ZMD&j3!r|z}
zV2g7~B}o93$yN#+jy0#89?M=@riN7^nHLNlZ5>W{6mlxjw1~=NA`qr`h+{oPqUHLU
z_e;zbc_bZ_a!7@cQwu`Wa%&45O%_o!f@yJyg=ACDj5Qz=EdhfWLSXYEQ4WJi|D=%w
zZbFmRV^s^BRM`~kEb0|Hg#%i4ZJ&(7_9Fa_^%ns%GEN#9d!R4MBD2+jv6h)K#)N3}
zM&?TKezZD3sn{rRZw5pw$uV~Jj6?C*gacjDBbBVN43LVal@2tIrN$G+Qq3|cDTgXG
zyOQs6DApTe!>=12TOQjKg1GDf8afRC_bT?Vu^f|n6mYa!U@2(fpvNkqF(^(#APuQy
z;05Cyvn<pIb!wE7KhTl~gcDIX=cteo#UoA{P^ChtCSYm%Sjc9iO>t)~khq*01vc=7
zdcZ2F@nPgZ%mzs5j4HAK9k)<^HyR;*z^AH!%Lz!CU>UqMU^3TB7?cZSYh#R41Nvlu
z#M%ggOcvyM1&`(d<jk;U<W7`gqAB@016A-Yg~LdxxWWNB?bHKuh!`!;kr&G40g>m~
za^Zm9fN)ZZAMXV;ree8_D0rSrwL(%`vt~*{iYb<T>fb^JHbPP{gX-u~hTw8b&I(f)
zOiv=D>dnn6we4jJ^9{_0T%8i3GRerUSZJq2J$aw%!19Gx6B4ccVy+iynbxk<@D$7W
z(p}Vmot<Z37$O`WH_2r<3XX)s6KxomZroHZz`2~m<Wg+=tD5f`vpE-9KkbHVL%kZB
z_5J#UdqxmE<LXaO_zQ5FE&<+vK4QtkaP`_3&9fKQ58inF`72Lvtz7K7*qr@e2A?qh
z@BgssS*Q;W7l#K2zkYo}TV4D8s&YHp68@tPN7V5FkJ@(lBN0k?bH4u#9h~#$e*^vz
ZU;r?inN=}AK=}Xw002ovPDHLkV1m=ptI+@e

literal 0
HcwPel00001

diff --git a/guiserver/images/folder-opened-down32.png b/guiserver/images/folder-opened-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..6b4c5151c7d471de088c490e4841cddf9e0c65ad
GIT binary patch
literal 2075
zcwPY;2;}#PP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU(tw}^dRCwCN
zS6h!9M-@I*UEMvim+Zw}JHas+FIfe`Vgex`5rRMjq<|tM<d={iz+-+wUh@LV1Bkas
z2%``o1r%e+Kq3JS;l(i+!Ae%F#IT#4UGHsrE<JszD!y~NduA+I5#q%o)l^SUSDo*i
z^PTThEAKts%a8f-55L0mc~9;|%;DW0QsnsiCMolj_pb2H{a?nE(i8+S>0n~Uc#;S_
zhUw#SXF4FtlPyPNouSZ#Cv4gOhPA~Xw5CGo02>;rW-T!P*AEBX1d75aAY;pd0u!b1
zZ0s*~#6u<JX`h1DDt+{k?^0`iAxe|YSM&bP-?HIuFHiR<A03e``sCaQyIO!zq#2L~
zFm-oeobpx_T(Hhx=<Eyt1R=3yjzzi-69R5iD$0NsA9#vB^Vs+4*r`?8OH+!po-^d1
z@Q6w=>d|PhPs83W4U!J#ZA$w)G#c(xksVP{49Gj|izrsW48k8#6i3wS4gYcR@_QGq
zzH^(**S`5Yz4^NzQCVgb07RYxRs0cJTR%^aeD-NNzBEtWK>~7&sAWQm14Gg59O>mn
zY<{L<h(oH1oU+jXpt>~Z?NL8rVB46tX$W8`fR#l;t}N-=_2lTyKX%}FM&_ZluhL(y
z{EQCv-X$NjXyyJV>64#(md>oMBkz_7-f~ppFr+95Ff<wV3Mt|tL;?sEE1GRBkXl*-
zrd5Pmk+qhJJcIE*4f=-wv`hV7haOyup4sod@~4XzUw_Nw#ZW?JT|{R;{T!Wp{5&l!
zEs}N_Y1lW&X`rkaMhfs-vpLCZGvo`oW#0HH7Hb9$VD0t-9a}j@n%0CDM$?yGedW@Z
z!H2gDFD&6@G;^9(*Po#@GSuDg&|DZ%8(zmIkWC{1F-q5z@>7IuK&bk@8k5aC{_UuA
z@PrBh)NVyc%YZgFw{BF?!^c`j?U~~=GZRy0b3BMTLsfX>t3b_%;yH4yyp#|F!etc+
zY^rPfOtuP^m;3x2r-BzX_!va@=%||{-T#brz*<jpvnQw(w-I`j6v7?w#!A=zdH{h`
zc|Z1%L&^VZ-8{=csv!>mOdx3MHMqyS857Z9Fxo9kw^c>J^Tq+q&7Y(=ipYXAf#?8<
zL5E0KW;tJrCRQGKM9QJmoK#OB71YeE1px@FS*SQ|HNb!gjM3@rZf03_P^SO_q#~NT
z?<5`&;9{JOmdp?QonsV8M_G)><vrZM$P!AETU6qjjj)i3uR=!26Y(8~6gpdCE=8;~
z3~X<0t$qE8{N;2I{lxGeftjV*`4#f23bS*HN?=R#5v6GYMLZ;*9+4^&RK|#alSUAt
z4EF=(1_;LcST<yN=HCU#T}Z7L0AA!NamDc*M(Wh(A6<O*_ix;M4N}YimJoquDg~*c
z3=0l+HfVU%A(!<@p-d&u93rThgU1<C#Z5&cqz){X?0aSaLeCHpesmB-2aQKZAZRr-
zv?f4(Z*KiNIs5SAH&N#Ew0z<VuGOAHn4t$cq@%rS)Y<qILdFX~Oc+&cOmkiX$!R68
zN;u-1u-7T5s(`D4`x%}?3R&qj8c^VvD<y;}+yD0Wp4&4~JWCIrUSE#lm<m)wR;1MJ
zT&FxMC~VDFD_Qx-PDH0}GTfCb;{bsuR1M8l+TfdN@zrQbRW<=1f|=drmD635rX$my
zi9cZ=K%CuS_dQA=%S=ouK=Dw?a2T?&7*gVCB|1)qYKTa_LLd=wwLn$ic#T5^Me$;%
zJ+nA4S(Y!Mmd~)K&?D;Z{GEo$ZFs*Tgqm)nnvJ-stOS6XG<YsjDWBR<WtgL4g`mt6
zKFCyHEt%HJ)-Qkl3v0sA+#k2%Qy%RyA0E*D<~!(!CF!sbLqQz{&OacC_y`Bsx}R$I
zjqy4fVw9@^!?I?`D8zV-mVE8%#{0i{{UQz|)_n{;deMY!N^bv)4tF5YdQNIyyZ{kV
zCK5)NN2%(H1DfwtDUq*+3$<}B#ga)~WCEaMAh<6@TUxsH{_ZUiqSCtcR(l@Z&d}bi
zx53UXwPstW-E=CPQ9TDjN>R7EBl<?H8{=rfY={pzJj&YhN*gRHz(YgwQ94pv97U5P
z{f#SsxqM?`VX$`i!BweMS)eNh`zDW`Pc%lfU(%q}B=Q2l-l2N7Hrg2Gd&~i3n)?0h
z;P5E#NNdKuU%zqbrE?FR?Z2?Rd>pkpi_JK9Y}$!@^6)OeCY26oF|M2BSDs5Ly0I~t
z8H}v8b*Xyk2}v*8O_FSnPf{lBU#CaU-RA>V3ptfL*}U?I>d@nwMab%LbD3h_Sctrz
zFx`zA@26%j^yzl9&M5PVaNzAf|CHwERJ$x<X+T;#IU!})P{ORntgrGuRuf+xU?(Z?
zcW|L;!(ljssG90*PzzHx$+sK&n3d%&d-~g6-+jvYJoE_P?7|6JIr+ufpjT>q>=_?@
zrq0=uI7~EwFQFPB;Li4S8fAyVA8y6jsLcPl(R+FPV$zNsx|F{XhQSq9x(x3E51e|E
zzV)4#>OAKk`m%E;jOkA#YcIX_1A6zyWr|vh6h)enq@>$>#pKP%`6`T)(d4&zsR-`A
zfAi|}q1d>Y#Z~^Pl5;6Nqo#Ja$1kUv?(yfI1Ng510|3?v$v5-q7oPwC002ovPDHLk
FV1jp$=Dz>{

literal 0
HcwPel00001

diff --git a/guiserver/images/folder-opened32.png b/guiserver/images/folder-opened32.png
new file mode 100644
index 0000000000000000000000000000000000000000..d9754c0b6059b7a10dd4127447aebc11701de925
GIT binary patch
literal 2024
zcwPbM2N(E>P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU(dPzh<RCwCN
zSIv)HM-i{?*Kgj;?0R?ovFooj&bJX#umE33jEEpoHWEZyOF3B_P%iuhT%trAIK;_`
z1KfZJ5JZSX4k!sAI3Wiq0tt)A3mf6JG1*Vg&g{<D`|Rdd)jhMjC{lonpIzJU_3PL5
ztEyjB^(f~Y-OI~#*Pr9@S?8)N7~_vxG&LR5(o*O4r!M?r;nc}y@7nLaN+(Y=X)q}N
zCuLD&Xlm{#z3}|I^zAF}dH}%#7cky`U^S+da^ze_!@eR-dj1<<zi;8vGxKkrn5~L*
z&?Q9?Z;PcGqx%0mU|oSv&CuFWC=@n?LY0#(htw_3QEHzicd|||yt4JfiMaKbPItYl
zU5m8a!O9+F2&n)VAe0B?May0vas3?fssJDt6N7M0jZIf-NLe1!fS#gwW|2&EoYs1~
zl)3YhI|W^=HA*t7Ps;9)wk=ZCCTWPWTe!zF19Nz<Qiunp7?`UApe1Xoe=z{9BQlMd
z%hccg2_`dH=q!}mGgKst)R_JPP1Ymo40_ZsDJ9sfZVbhUrPhbBeir*Y5^z^URfg|-
zxNVaw?-G?;xZlM5CdL*S-KWN|fUaVfJ*~ASQ)_&d`ubP+;1)blCu^RdXljv~6K5#a
z79=U~ApwA)1UHFMm}f7Q*aE_l6W2qu!FUWZhskqHBLD)A5K3EiF}7(p@6a=gPkib6
zjUPPz&O2{k0|`^C$|*1ER5dSCGV>JG;u^)^KuoMmQ-sZH5tK7xr9I_>Vy{~T_E;#*
zg}{Nw0EKt88tM9Rygv@Bi9Y{0edhiLe*YL&Tr<3k-JZKo5H+8q)j>+O+NP-_p=NBv
z@(P)fL|!>l)Qyxo=PegiYV`j=Ch=kiPr0fTpfyvYtSo5d=E`y)AwpDIAUz7Q!CJgj
zfSFentCF$CmTR_;2{g(TZ#n;qMqbeVS?vSjMt_2r4Bl+*bavY9_8tGs_$tntS&D&f
z!Wv<$QJjk2ItweR%F5`*R*Pz^0cfoxOp)^=8-QsKFs#>FNi_J&?rwiG%ktF#zybg^
zs?EtpCJ2AWwV`x)Z!4<go&;<KudqLANLP(QrBx&nX%=uqAxk(@FvlfKF>hET?V7Z*
z^3SzSr`sL_VD_8%n4o5ou<{bVE+A=PX;4%kDaci&qV!Ob(R7lN&i{eMZSjP#y&AF4
zg~3VK91L)rrfe)Yb+~@(p%=f|`2Kgk*Z3|tP-1$5bbN%Jjm4~3L8+!;mQjiHiBaw5
zY6F_7XEar})M$W6y}Q&Nv?-3+IuHZ<AW%?L`g^1=G5L^T4jJW$vn@r!rF8DW_|)e<
z{ov(Sf4ua%v6ekBOHn)x*XE);D^S7Gzta(F(*&yCWP&V+BXO$(oUEVIcBh4a8j*^v
zb4q%GbL>KR#Klscol3B#kSeGUE~Rs!(9+*FcIM_U+%#E%u2!D6)22abRX}2j?R7d9
zy@d}NWQzv%Geg}_+oje!AF3!~MOKLFLh`Hdhu?dmdcrb5B^4w>S*U2c)xZ1YuUu}S
z86|N4*&|xVl;=4}meZ77LOc<73oF>YD8Z5P)yFGPLM)JCl<d+u{pi)onsIwm2f#$S
zqG6tFPEMcRF<F+HIF26T9LXv}k-bexbqlPo$)+LW#tOKZc#B*xccj#gfsE@w7*zln
zDwtH>!cMN6WO`tVqC5-)_gQ?!^=QK0fWd8~+%bvaxSSxa-UI9r9Y6(}MoPyXa$$b-
zt@Q%%95N<qR!x8S+K+x(nOc&Za8YzRufS&4p?dYc6df*~5;CzW@~#v`I*faLK=1RC
z2jP5pI3qX{D2yO0XG~O!>DnLuv~u-l@AHX>&c;b?W(amCcA27L1w1$eBQtT?$eq5j
zIbY4V<c3PQ2gXUBORo^mvC_h)qntNNY1!N`i>#m<H`Z=TA%aDZ)+c5}NmTursse3O
zP2f4-bE_zJQpr>Rpv4oTPB^mKdgYRqg|~d9TmXU0=r_B&!{K(@uCi%nW8?19&G+70
zKKHPDWIFmQ<*E)vrKAyC8;t<qY``T}=_-Ul2bOz+`E<0RM5><KbGyH{Qs`owCt9t+
z_Ud}N!F!lqFTZ;Ik1w5nc-DN24j)0WIRs^uZyq9?(@u_7nvYjP487NOt+cD4+>=e7
zgHrZ}3mGCIHICLddRtpt={A>Y^XMlxX|{RRHIprPB!P>RG$l1wY{er|55ziu0zU9_
z!npvz9RzV8{lW*4qt&&+)-ZKle<~hcrL$*h4UJMvwjPdFdYo#0!@%l&rRCu0_Mbq)
zaVfNIH$FZ1=h(sngLc@E%(GwnC7nJQ|90WYqhE~Uq*<W{%dY@WcNz|clxCUoaaZF*
z$oP!md<f*65Q>wDBF9y=*=(R$#bbaG;$PzQ^V;icZ_$64z}F0<5qudcsHTe-AET!i
z7I4N;$~#7n)nZC{y?j!#Xr$V8yB)f7=R-F?e~R9C<4sy#{$PKwM(4LyNQ;lZuDtw`
zSohybx7Vg$|K@E<(=IJuy7aO8t9$+9RMS1a?m2*e3orm^>h6V^FIUn40000<MNUMn
GLSTZUQ`y7-

literal 0
HcwPel00001

diff --git a/guiserver/images/font-book-down32.png b/guiserver/images/font-book-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..af4b9c4163b4dc0473e4ef36ce3bf1137015b3a4
GIT binary patch
literal 1849
zcwPZH2gdk`P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU&%Sl8*RCwCt
zS51!`R~0?))mL}*^tgL^X6!hQV<+|u4xmVc1VNC<5(z|p0h_SNpU5(bgxIk~iL%QY
z1neRb36P12Q4$5mrjyu?u{|^WS>0V#@00sp)pQUVDYeUjo~f>S)z$Z%d+)jD-e%TX
ze4Q_julW_8bo0$OeuHa&`U9cUh~hRDt0j~)h?oVB6D$`?F#0TMwV}0v5F%)Gx~a<Z
zZWsm|;C!%J%sRZ?9X|K`k3QQT3?QWRwtxQ8%U=y3O4<~gfQ)N!V_}SqwJ`~^CgDu9
ztWlfB=)NrSuF<-$rPwZw+%iJ!NUMAF*|sWI8=;mT6h;1uP<kY#Y94_vZhdrmHM;+j
zC|2JH!mw|(*|f%Xl-4QZXfvz3u(m6-a-b+u2HI$f3W23H=!oc0<Jt4Wn>Vgyg?(Mi
zvN?dOe|+oJmRbFR@fbP`5CnlIi?z(XgK^r*k(UnZ?_0mQduN1@xyR@_fWpJu|N8z>
zCSE7d%>j_nA5b2_!;nt2HLEss-Whi$TND*?v;yHa)0X033|a{YaCMtGfO2&uFBTD}
zE1XbqCjv-Xov~T1$OGEM`A!>g0+FUE-3cLykZBrWs}~}S0<_u@b_M~Fbb&wr^*$z3
zN<l#1agkBwc_rm8XZ#)+Y6ieqe#mVdW^z|+i&MP~T-qPt(#04TE^c8uUEsaH-@|ln
zFrFC%T;hfADU2SLc=u|Eh+ChOK$m9{j>n@`>z*~b832mmVU=!EF9WRd67O9b0wTiC
zUi>!RdFKJ%e)~3gnox9r4~4;}w-l~i6zFzRNI@xN&H))&t)8$f{EN5QC<RITVKF1L
z0jr7S0%0Ln0fwK(IJ~dOV}^}(f+&osVl6gI;6s1?<3$xY7jF6<w+f~#_EnqKx?u`R
zAr74mxCmJ0%1V2KL1-xdl7vX3@AL20l%hgm@A5WzontuUo`}rx$67CDMlAP=C5hJw
zm2jdIr<<Gits(D?@ik!`5W03XpXU-;rm)e8DEw6a!lKjZVSm4mc5CVB&sdfJs!}v!
zl$Un4x}8T(4;qrtm?O)XsT`n<c~#fWuoN2Oaf$O6H}Ku(E?_>7u)EvBv(FgZ{an%G
z7L_=dS|7+uU7Uw1&w?kn8UkP=@F=rJoT`f6iBCnULR!pblFBefUS{~`Co|mmL_%g%
zDIM(z>o)d+=v2~0LllGA^yos^N^dnwLHE=cES$rqfYk=QMQCL(CjitBkd5a!_+o|m
z5%B)|z`=-`S7_F$^Zzc4Ofw?lo{L^10E@*uqrgu+jhU^D)m$JVO{apYfMa_nK^${X
z)nSnXH-{lAv37q3m4;F3jHE+dA!%&}pw}N{QIZ@u>19<yQK>#Wpm|pMvfSJZ36NU%
z1!z?1!ZB!5bqI<UQ^g*wc_RSjs-P}wCw@z7YeA}vDj_gBD#)`KXU}&1M`d9gaXd-a
zRpTR8t-b!J;)2m?s}TU@5J&NWr+=M)f6(>rnbY{@)0cgty0V|*r$0GQ620pqV{5&z
zb-H}xa`Oay8Xh&We5_Fw^tT7lW%eMS(F1jBb;C(Y$^O>U+f)f7y!Oi*$d}cWldVwA
z0d;F$AHIuLO3HMZ>T>ZUJ#zgk0gR3gQIzt4IW=V3bJ3AbmL>l2w;R-e1dU-FAxX7+
zBqS-0<DmBbm@#Y}V|R~JbhHwCjUsUFk+YaY(ZS*54x!g|UMc^|S?B1cq_rK?_rLVo
znDsnSQ??pYd=%hjO4AHL6uMy~m{1Ni84ggB$#p%;>#lC>dVE<E&WHSXb5wf3>Y8v-
z)a4V60DN})u4_6+EC@3qL$4yEt|lOcFORzX*s<TH>VV7<_W0I16`Yz}t{VZk{P;O6
z^L#R#+{ui|dw#~#rWT|B(gmN9ifD$>{N!e_F!EEB4M>!zRg)74X_U{UEzDy2tEMv{
zxxp8dh#9q{$6PsCQZYjVDuRg4&M<8hwP52GZBBwjYnq__=9&O0*Tl5)p%<k@sg}Px
z^XR$XHv-V=^<ncOFIi9qX`j|RF!Te3M+q5pvo807q<zj^OP18^s6XT@Vmhga5HqU(
zF#-5@5G6OMe|#7)_1oFB;Xu;s#u)V4;$ZKoH?M#6@l#1|+q@{K3Km9-vLsEI(~vsR
z#1pB+ohS%DCuts$vj>(357H!jK$<Zsq#mW4TY`IaogkY{ngK{#F(UHzJI_4(>*+#%
zaQF7`$;`Dr@G1Q^%eHrR$3J}G#}jgYe(mbJVzJ0P*^HujfX;22l3VRIq{)eU6eSWd
nr-**U|DPB8zyEdo9{~mc7pGAPfwrM@00000NkvXXu0mjf2(f<w

literal 0
HcwPel00001

diff --git a/guiserver/images/font-book32.png b/guiserver/images/font-book32.png
new file mode 100644
index 0000000000000000000000000000000000000000..fe3b5d2d4e536160172611db0966fca507047d6e
GIT binary patch
literal 1966
zcwPan2T}NmP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU(KuJVFRCwCN
zS4)o^R~7zl-FkHOb9&s}@yy_H?8FlsA+ceR6)du4#Sh4e6-bB$KY`y6wroI=$chb*
zAAp2{k{HPr4sjI6PLF4%XZlf9U3K4_Th%}`IMcHtw^d!!^*HA{=X~cocbIby-{cDL
z4X^NJ7qi7V{`}s%kY$d+&J9#miLz1%twPl9()Bf*rr)g;m5`89pg)`>)oR%dIO`;>
zWFU%p$EL$)L4W^CZ7dl6o9TCc{FAEzL`e$)r&|Gsa}3rx=B$gYF^N&qA3dk#&{^HJ
zQtdcV-Vjdh>UA-8R_;h=c6F5vgTc*@;_l>^jK@njbG-~qKY4)F#mS_Ye)>*XERS^D
z>Km;FM%xaIZnFSw7}a;y^qrC|0uebfUT8^gThMh_qrsepn?HZMN^gD~PhR^CC}S^M
z>@o>|_46OylFQ>?gys3qf~bukjOYm9Ka>bC=0G6G5gqhZzwggJ$+ao^%SY><BM_hC
z@ZBe3@Y8_)W*Z;BeeZW)pMgJp@c7N|?!|BIrSZl&J;H<95wp(6ND-17O<%SFUt_2N
zI)q{4oJxks*IljNeExjFwJZ$}g6$=EdX|Z!$w-DFgJFhD@Y<1oH73&8Aci&pl9-|0
zvh<tq#T>n^1$T3N`nW=sGjRVd(`Ykw81rzVTyTv4<lqVb=d1O_JXbR|2<jADXaYb6
zJ1N3(3;Sb<y&Do2D~(4_G>V*pR1SkxhWmG?*co&%T~5F$6P8MmLhOzEy~8kykE7rk
zBs30lLVM~wSZW{o0^<>sR5*Qn43{tPoxP{{?1baV!@C&zQc<4Hbck}cgV88M7?ni&
zfNW7#m`oFnyVOyC^`+SgATQ-=kymHdMijZG;Hf34w*DCK7R>qpSvf}%6&UwZbdrc7
zRp?kw+!*1-l;}z%@y`=u5z)QKh<jO1{Gg05wnYgmDf3*Y6XR=7(K`|!ONTL%90@2*
zMKLMbDS>kpWky4+6?(e~(jK*56%kpz>@+0^oJ7jhk#9{+t*S4z<Np9K^j4|diPpqq
zs)wr?O<d6AkU$7hL?J>Vp(nefZm<NVhtWX_>6SnprK!)pQye+&MdDtk6}H2WBaZkM
z07~H^ThF9zq|4UrrfZQQO{DvpWI05y4ea0PV))uC7=OEu$z)0?Ue%ph>jRa+)nY*a
zS#_9jbF;Bww#@<uZP`pC${1Vk5XE6RX#j7q8p=dfQY0f_zC6Q=(+b?uthhZ#ryXGK
z9XMADl_#;|8i}pOgOuNP0skz#M8ua)!>p9^qOvPi6A5)R<QZOpd<H~CyeBrXvP4=~
zbajm7$q4hD2nj`Lw+#rNF-i$(0#BJf;>_zQ+dd6Tsk6$s1!?XfSfhB(D^9KT4rLi4
z<Q$!@!ICUQv7w1+Nq`bkKkwVr+#%0|nNevZnGyGA3q=Ig+W{zJvQnFw*L<cenqlfT
zBb6Kp{}h!W))b-IXt70WGbH@8P5qm5Kw0Yr;;7pmP)G6YB`8a2mbo}*8%{K%v@vW{
zg>^<oS%Tr9$&Qh(Rxr<7S972lQr0%_cpEJyUnRxf^<}umj>ti==+v^XiNctM2V{6K
z8sp&JZ4xMso3AL`|K0%ogB!luHN%^_oBAC;oDA_n`@zKIe!g1Wnw~DUm%vB7DCLP`
zQB9e8%#y)4O|f&Uhi4Zr@bSZnB5#2wr%=?EoNDW}-r7btY6{ky8L|*C#8wR2yme>A
z@nAauT5IV}tiSEq?pu&hC@TJ!4?n>&BQl|nnDz-4lBP9n&&a!v*1Ap7-DVT!iAb4?
zXsC4)_Ie@%&r`J>K&8(WF+cXsy`tHgT0}igGk`ZN_ceFTM#ZPyJFkVP{xq%Hh!Q0s
zwCKg=jZPfxk@+vS?ur*hc`lXK!G`(&K75U}udVfhMfKj04V&T9IAzUmuN`&oG`~Ac
z+--AnaIF$($7ag0j64k;^PAI6yKP|CTeG_T8nN=BGuw=?Mus=pFpc!GFosZCJ)54m
zYXMm0<*HD~$K7<ug@9GUGptFemso5F7X*#MQ^%NyHepfAdxMP<uqXwKV<g=kaSG*M
z{_wY7|Ks!dhgSlKqLAd@_=GQwaTkHLw~U~1%wt$G=E$&1+HheDmZl)uJ#tRh!USR3
zg3p%nlq24R)ENOOW<lo%A3gg0Kfjp2?~{8afVaQ@R-HN?u(fH4g&6N6e02=g*#S#C
z^`208BKtn4=(VOjLMb4M3VNQ=oTzlM%=4lUt1?@jW`%fqcD8slJ)XT!U81+{i2hD(
z<`)rA&Av7K<GMfkL9gA0x+rKLFgKDc=j(F4&hk}NmW#Y7r$tsguV{c(Ld`2>PlXUO
zA<czQ=A6hn^A)`u`Pcqmz`n9)3ZrOevfKS(9I-pHsxl$uk}{iXZRu?1G$vN0z+T$2
zO>gT)yRTkf^?4<LOOoxbWBfYnN&x@w^)CSi0A7#NDc>p&WB>pF07*qoM6N<$f~QZr
A0RR91

literal 0
HcwPel00001

diff --git a/guiserver/images/green10.png b/guiserver/images/green10.png
new file mode 100644
index 0000000000000000000000000000000000000000..cfa4f78eb020d449b943c8d16e875d2880441bb1
GIT binary patch
literal 726
zcwPb40xA88P)<h;3K|Lk000e1NJLTq000UA000UI1^@s6jWW-@0007RX+uL$Nkc;*
zP;zf(X>4Tx0C=2rkU>ZkVHk#=QOk%mBNmZ}_z%{}l~FHxbXVOqW!qLQ6)9$C|J|LO
z-5qAet)xRlVVxA}(ygq6*De*EIusE^MrK8Y(6tBz%S*|2m|fjP`%Vw<_kQpH@<Uyh
zW?5#9fNajS<Kdtf8=nyMZ`nr!2iZ%#raM+oEH(t7S(eF;+4z70upH1V%l!ML<;BC<
zBd^ZAd4KH2&7<o({Z-@BE!%~fIv|pijt+_+XusfEE+`SeZ;!-7piBY>(iNPjV0&zQ
z0u&SQr#-#`_!A!A2K)s*?SirhsCq_Ag7OJyO*(oOYKB1h?sWj5!HI{1B4+1PhAAsL
z@6gA_Cxo|JKZOD)O|SK7yHN5gHJz27`~r0ShT8dUEpZ1PUx((;+gi(AXuJlGmb~6x
z7JQ48>3{5`Iy*e}1!2!>vABL5>Tkj3e6jdvp;+9!54B(6S<aOgU4T&Dx?~&aj4Rr^
zySqd{bf{{l=&>wQicmglO}o+-13A5|RcNLuY$Kg<9brpH+69?xBWq5V|E&@5$=v8L
z&<x5u>GTZ)O`vonwcbHMfMO+OZ(m7|q>TOn;4tt!W%rMII=>8eV5F4uG-pPKN<5#-
zM^BbKtCky#m-C&%a9>$JubqgM^!-!$!8mXTl*O6M$e9w0nM^2J;<Gr!2@@oMg-xCm
z1_ma^t{anB1q&SFoF=&C73xRzr@ErvQy-{5w$-clIYVEXTO)?VuDT9aTnDPsx32Z2
zxivW(-Kg*-kT^_XV^Bb1;vjczEGv^%>Yhw4`(9qIdMCe26H(=m@DEeO+&U9u1jzsZ
z03%66K~xx(V_+CWpoif<Ll47$bYVseMaZB8A<sm0s|OGO0Jn|^FaxHL@c;k-07*qo
IM6N<$f>_i^c>n+a

literal 0
HcwPel00001

diff --git a/guiserver/images/info-down32.png b/guiserver/images/info-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..84de75ec4d30d62a1724b551c1f134965f7c6d36
GIT binary patch
literal 2380
zcwPZa3A6TzP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU)-bqA3RCwBq
zS8I$_R~26SabEY%oqO-h03BwE437dS#+ibJ+A2Rxsu)E3gP7P_jq%aY)WjImpZ+lM
z@y|Aq+En8oDK>3GY^X>y8e%~Rq1bk)6w;v#!%&c!d+*%2uXE1c+qKs|Gjp+k-el#R
zd(Pf#ed}9~y$%~S6}ZEX8DLC<)C@RC)$#qA`WiXgSnF3BLo7~9c9HRAEiUJ$(!Tur
zaerYV6+vu3<BpUuFtp@$2IQTLYw(Q4ke{iH^o&nE5}m)gQ(muq0-Bv=kfeY%+>fJp
zs45ryJ6&FUtF?ac@cicCgUx~RMT53EB<yw|*sU0FUI!+u*9XeS&h5>en)t4nnOm9Q
zyTlWa3I>|7B_$SvG02bsFHzvzhyA_Njjd~*uROGIU%ODa!Jz}}78pJPz~V(UP&_xe
zqjc!aU%&^~M_UrN`w}!7HfYUcwpFH2Wd5;Cq&DEkDMTq!w0ilO%C7sqU)#9qD1!t+
z=-UHWFkU|O-lM%QpZH~~-YT~9fisLWlQ2hlN1-a?lu6FP=Y~SUNDN&$O4N)Y%15>8
zo^4N7?%%Ngzd^_@+HD}Abn@I|xfhSUFqfoZlJhOMNH<23<F*Vyj5jL^DSUZj8_-es
z!#N)+ZI3{(u8`QZjmU$z(JJ=*?%1y_sLJ*Y`whg4;owUE0_Zt=X-9bA_%rkEI7|YG
z3Jj<&!BPN)TRZ6CXV-M#@%xA18xIV^*1j32&CTN)hJtI*l3Q<65Y71l>g`ULJMfQZ
zd&ehtSX<DQzeIabt@Q=3ocvj{+UQdu8b_KGine#S${M%C(SMYBTSKf;XtX+T_2OlS
z=VlSG%Mn^@L4zS37DR$N=WFwQ(W|F^9#-f2vBF#kY}{>)`$yh+A~`?3T@^zxMrXzt
zDKpS545Z+2<br_K>^RI$O~KLeHssc<qCG4NrlwjlOWB3DNhE=vpWc=`a&~Y0mF+(^
zWEqP_UcUY@IQFk^rye7;Hn}v#&{62X06nvcC1zJ$2XNqQ1g}jLKn|~muv`YM6|J$J
zJI2hCpiZkV#;jw<FMKnYnpv$N2NI(O{N($))wSwsW4+hfQEt6A+<9%mIQKx|wV5({
zFZu=`R~~@SXB14kccJlFAk1XEVa|YYm0<#GOS5yUdtMvgoxiXCtYno|FFQN=d5V;F
z9vg&jXpbfk_K#JS;PX<bVcT#F0;@t`%mb0aTh~0eS{GOa4lHH3Q$Ro*2)$UEiN_&4
zJ^8ubcM*X1`sq#j%FL+2hej)kpaq}_1b3jaSf&af;3;e=&A@}}N-#XQ4(j#m@bt?c
zz=gRIluHqLZ9xFBp~-uzLt6mKJrel3BhyjN)CiY<8ox(3+k+ZCGRQB5KzCh@ySEYu
z4Ief*{PZsdp8x9{2oFQhb2oHmXCZ0Ss7X+`jN7NR$*xN}$VsbPsX@fCRw|FL(%9Ar
zwFP0jp=~;fEp<LiB6Im|Yeq#SI5X3RtCb2Y%L@lwDKbV>6KKbReP?^NR+>5_S3u{8
zG1h<{mMTrkgplIqs=%bSo)L(^M=HxJK^=yG_;~U~g&ZbiLS9mK64efX1;V-v^X%R+
zjH^*Mpl+>_vLwpvOJ+B+#Y(0U<e72i4pp!xAftBZ%3-mMW--rbW?h~$Jdkv10T~ji
zXAT*)*i#sj6^e<4#$EOUm0t$JLbV=ZCo#f-(3DJO>4-PZ`-M;t7;7xajN4N&b&lE)
zk~%7LSwR4N5<SQLYU!+{vRmkB##Mt&UE+^B<u?(K<p8#3lPUtjGVe{|jDrP1y+i<)
zoE$6UgDG3h=Q-zB?Ium4NKBGR?8Ht$^gm6}D@BIffu6-*rHgxj_N64Su*d2|>KHkQ
z!<ypLkL|p7LJH}>D@1SxOk?FjC$oLPhJ%ulV#`U4aAAT3lPhJ5akRi4P{#mytCnb|
zdju)Sdw~%Wu&mU3W^Ci&1o!-WJ&1~jIg?bcHfC0d^-?b|&_Ts*9LU-!-8beEXwTz$
z=0y;O1yCu6dbI-@-?NVM+;r^z)Jd8pB+@QLU}Fzsn}!ds8!p<j0L#kH9rA;oA0$aU
zqHKn-?DXMXSub1(+Uvb580_2<!d+zvg&rTi_Jt9E@ET0aB#_2fc3B5p6g#SM99U#P
zG9UXF2l|VL+;OZCH5Zq1`SJ@%r}>k1r-_uNWQ^%7#<m<WM=hHYTlNDZ0#@a!@ai9r
zQeK9#0S~QJaOv_aG~*luGRq5^5i#?TdJhc;K@RnLuzXqnZ;+Tvlh@{v5#f=MAXj`Y
zpR{)=r9Rb(wM(jnBxCMMX@Lq4{;dfw)^0!>+pk?GI2!PM5Ft{EW1LQSb{JXD@sRRE
zh@t|9*n@me;lz)=^O@(iZdwj?oEN3=BbUrvRC~C5TBY$pm^TBRxQ($*vT0xeg!@`h
zwqj)of?^SIxrv1e7yAS?H5%M7TIgKp=O7m$FcIQ7>fiY4t}Q?O^yuKMwHXBwNGbir
zauQ+wjbi`sQ=E(6^7(4m>9inCFu9C!^8mTz&I4}uvBiN0G89BTmNkYdfDkFq<$6KL
z5Jx!Pdi0B9Pkrl4o8P$U%ZM$^rPR{#obDO;z3Zs_SDe>Nsl>@QacnG}YS7gMfn^cm
zWLQX#C=bFsL?}v2Y=~YJjX$w>&(@bd@@Zz{0Nvj>%+C4VOXdE-%k_HnOnt7pHHTp`
zDgmq#q(60SJNqWEpgD>V6211xxD~);v#QIb-qVlo-txV#@A~+0!Ef<tw*Scao6Z#b
z8yW~<0Edek)mHB-e|~50iGNN!*=RO~B~BEA8#i)hi>+}ku)$!m0rnDw%}HU?Di;e=
z4~~uO+w<_|eWUj*tKI(V*O)tf9YYHn%JH|ato-|%7aw{1z3E-oZq&wF?ap$g?WxYd
zeIjDar7-zic>V6XO4#9sUf=P_k%MC!R$Srij_Ut6fbQRiGfh4*Ratduy0Sh|dN@v0
yFU^L6&*dZU%E(aPg^{7sWVsNi|5xXK1Q-BRXOMzNR4Y6H0000<MNUMnLSTYyLW`vU

literal 0
HcwPel00001

diff --git a/guiserver/images/info32.png b/guiserver/images/info32.png
new file mode 100644
index 0000000000000000000000000000000000000000..980a5718a4b7822d419e93d2eab6d442c4006ea2
GIT binary patch
literal 2409
zcwPZ%36}PWP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU)`$<GWRCwBq
zSKE(OR~i4-T6>>;_PL)K=03xeivz(bP=h9g#?+=Q#-ft=(4?<b(VEm3{TDPm8Ht26
zrtw9SCX%$KtuMaRXhPMN+oVDmgn^kd9m*MoIk$aTYx(=u-ZOv{>^b?euj~7M-|xGv
zE%w+Idc;pyNJ7@|MbQYq)>m7~k=Ry^)VOD;&i7MEt80P&xD(j9J4Jo9FKxp2eG)=s
zdhEjtc#krkxP{hk>Z$3?E${Hi9q*gfp4{zeF)R#;b+v58NV2K2%k82$vs6p}d~Gm&
z^H!+m*MU3?g!n85*y|XE8?hYNdBZ<4b<;cI_r+8n4|<X)1}~|&t5LEixCpGE5XU00
z#eungZ74l)VJtauJ20&R?upL>fVoZ~TUzSC<5&D&g?GePR$;I$EhW-<N|puMG%J9p
ze4%6kfC7#cBdCrSdlmbyb6ew|UKvdP?%{3uC;)7nmF~EqUfgxjJKl|`xr#ui2$X?X
zB^&_O!fcqFSPu*rSedpCgh(yUK|Rg~kRV|}tjx}&Ke{lUzM*o)9>@Wk8=qN}FK(Ze
zuir{_*ezK1wpJ`Kt}^fY@MJuc^wPLbkv8;)#fWYpCIPfb24R^MFa`k2NR~=hG<Tj?
zuX8G2oJ`*kIdgO`7*5-%WpUuKvvh2wpM+hNf@TBSSrGGFVyukt?!jS?4m1@#v&pA@
z)S_1FQ#==35tJyb!CH;A7H+K}sGs)Y()M%W*z_lAe{v544gklz-lN9UIrGbQJJ}RT
zjc~9M4TT6no^(2odt#9jak3G(h1oOIUb>F($m|`Ffn^XW#6Ws7r8{f!(AM+fXrm{Z
z>#IHEPzW0RcltxIr1$qrtWr2bTJTXih3t#9S@L=C^yEUD))wb!>7%psr`fC2*#A6f
zyuh`Yr3U|vJ5!d0sN-p>-4IVsUr<M8_v&A8*d-gQw9HiHa{T>Bq)-CtjCRMA31liM
z1E5VN9xSYi0-c!e((i9t3U@zA<*`XJTD#{N@!8rGS1IeVU=`9qf!8kEmm9a`R1fcX
z9E0kW<dD3bY)i@#N;r1#9NDHh({VKLz!>ZLVgd@<3DgTog{f^+nAk$qg6Fa-1psN8
zDNaOq@5E+DthXuaFr?aQ>tknvLjx1?xaW6FrL+(oOxbH#<kB)qW}dLeZoP11CO97m
z6g@o@5{d%Bu~fplr&eOR-bpCnwHyX#6b9KS^a=(K$M~8RMd-1$tHHsM`NDB;=)>+#
zuNCh}IL;|2jBqR%!yupsS;hA_UUA;#o+@<dtD8y`1VtC)%X61#wj0pU;2;cSUUN7E
zjPteTd#nulZAz{k^`+i}tIe|UVQ0qnl8F>gbc%?vV6jPccDzT5Ft*T3>D9kpqNDGf
z-6*Bb{2WECn~rS*WB<F3b!yF`oee$*GZWxvn}-21i3iffn41k^Ymk~oDTmfIAMX2k
zY<a$=jbZx0^r?efDEo>`62oxf=!SOZwPgn21bgj{oHvM}OgYSoOH&FZ#yy?triLZM
zgO?MIbC|<`x^W`2g0f0wamBM@5Ky&RA;I_Zk!0B@4B4Feb>k+<jpJOp5TGQL=h(up
z>2YFcjyX4PB%1{Y>sZK*iyQzOmoSJ5F`UiGJ+sYZjhv0M5CegT7*zqW5EH{Vdb8A7
zK4r5}U=~=hV!8BCqpaM~XF2QDhH;Yx7cB6&13;99)ptjV^WJ2!rX<OX^B{<D55h+Q
z0B$(IK?yqwe{JM#2Cx7Y3>Hi400;*lYbOjQ7aoJ?WTY4X^l;O6G>Ysw8;-Gy;1->-
z=NW(v5V+=PsRZu~cvN|&9Ee3UHE|JTv4}*Ra?QfzAb5-8$_OvBU?f^@Tb!u;UM%zY
z3s+(WhD`(z5RowD@H#ilVQ|R^y#f}MEWnhv_^sXQKWOXff|CAeI6I|v;tV)?v#H|F
zvDe}eN7iQ+WY(ZcYCVxiCn&2vyzfDx7)G<WGwm!o<vzeI+#@e2AOs=ROaAE{V>Ax{
zUdQ)}?|QQE?Iez}Btj@$IMNJ=b!EiHnFX}sZbEHEw4P2$FQMBv*JyMog2BXj&+&G7
z;2KcAM<^7j=$A<Vz|5F@ce3d=Gm3mqy;BS-b5Xy$Jw_~Df-(RH0%mv<0Ph_rFtBg5
zN{4q(Qpw8_@yFkJn#%uJq}f}2iu(yEowZ((AG!T{9*h?%6c%gPQv`GMP`txiRZk(S
zg^&xSu=ZLU_l~A$DoGmO1)*~wC_COa_ytAZn5@uD5Yc=8JVz-KuUQG{*{LFZbnyyu
zu0%!8&keh2M!qVbca*7GX_ChveD&KnrG=&2F!R!}8~N5+)}nsr?N;l?Q|<N&r2t{`
zEsI!Z1CRx(fYL6lEnlVX>N3I;<B`N%2+6OFP|)0r7^AqD0p2evpDN`h4KzooSRTfC
z>2EK8UB0kuoL0NB+go@!0C6V_Yd>!`>|3xr%pl^p?`odbH*q2Z!sRZ)Q7RXQ8C^DV
zdE)`kx${}KrIF<O0aZ#3YBWZuRM~_+Qd)lYarv_+rfJoE==coKwbPAF@~KL7;1#LV
z@09Y(?X?#5qb_lEnA`}1kh}}_N_5{w-#xZ&&nD3^i^UREKzRdmqf{BBzAks3`=Wg1
z@Dp_EzAq!G?*BLf6Mrm~2hfd!*Ze|xpxbUyueavda6q``H#YDaYg`zZfr4M8Fsx!$
zG^tu2M9k|*-k|l|F8PD+?W2<qe42Io_JQxBz!xWL)%tb6Q2I3#e65_UQq*r#1U9%-
z-H6RT7oA}+=I9RKbr@EtRH{><SOvroS?|Ap@XPe-3%lukB|qcK=&cW;`&i`PSY1%F
ztZ20-Du0<xkDR|2{iNILPZLHk+8y#DxetKyJOC(?f{=p9fNG&P|D`GMn`d^>i5;WZ
znLqUF*V;#Y9TUo$&RwUG)AQ!Lb4&VAt8Mo76FrKYkRqp_dkK=sgn?Wdsms$dqxAOP
zX?hcem!x>4`u`8$-rub@iG>xK{A88BfaW-XMps1};lfxe73kx!I$fG*(n7UJ=JV?O
buK)u8yLV!d%0zRo00000NkvXXu0mjfPS&3(

literal 0
HcwPel00001

diff --git a/guiserver/images/new-down32.png b/guiserver/images/new-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..a83e3d913f52af294cde315dac696a156a63c2d5
GIT binary patch
literal 1347
zcwPZR1-$x+P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU$)k#D_RCwCN
zSIv$aMG&s)8UIJx^=6&J0td(i4lGKz6GV={LvZEBTOi&5P$C{82+1NO8=>SJ!5s(*
z!RxHoAVDO%r<<zk>Yg?`Ui-FQ)wbua>#MJ-z8a(V9xn1z{{O_6Uw!=rEuR9y903I#
zBJ#hm(gmZ({NWoo2=5#$7K_ekbY*_?<_Di$9`1ZgmkN0Rpwe4616W!+q|FD$;2=Cp
z4h{d0jtw{k!h14-&UrHSV&M5?GP-yF!8h;Uc<+<_y`4MiqgV&RoPnf~1;+?wSwPup
zLA%|CPNxIiZm?dD)?Sakcg6S`+hA}Brqk*E`0l;i)06o}w2{>fizWun0N^MMh0InI
zCA7(Tr%lc}UFeacJ~<uq`?U69Am4k?7Ypb3`fzs_{yIG!jej`0J)O-zRuEok+rWV4
zyeJB2l_j)V6gfrDQFjPLx0A1A%!VHKx@yGE-f##0p3g?(yGOT<XTrpGDF~4l!O9i^
z2=qr|K+KAq=auhi*Y_}}o`C7X-tG=DaWWczfB)9;$^66IkF8vD5gJnnh?3|J3<PH-
zIbu+f9x6mGmDmA}%or!kAs43B64Je#nit2DD|fyde|~Uq@W?qgqi%t#Z@dm~zj^g6
z07N4o*jY&c*b*aRM()Abh75qZpu$QLytEZ8td-STN0C-k#3f87f9^j0{Yl?iJL95#
z_wcQC3{d{_G(^+Fj11)fkmW+lt6)v=1$Y8p5zWlvlAh-p;cj~Q?@PFT?GRpj^_6A-
zXizNHLZV!p*B!#=q7b1(?->m^x$gD(&`FWG<#Gw5{mXFuox}A)#92hl3~JTWBWYCu
zDhvp1q=d|b6JUnd7=$v)X>;Dekh)`UI6O~?Y7p@_EeIKybaN80@Z9PisOjSKE$Wiv
z=?i%J?2q$w07G@_QJ7U;D_(V9D__p~G!Rx;1a*q4D{O5_2iL&kpME|EfNsW=<_<m4
zCq|<0boe+bGUqCxHi7a9kp|&2`SB!bE%@cvCuF}h1Ms>Tuhg?T>4Jr!<EXl;V2({e
zxBxB!R`kl03*Xrx6(j>b`tf0N5r)3j=*Wqf77<`jFT<P0k*ui@aKccXq8t=QkD4ZK
z&6C+_GXQ>w^JOawMMW({0F2DzkWh(`0YRF`0w4;KQ|4S`i31>pm{IU9)m5u7>lt8L
z4KZNtQrZczu670!#0OJeQ>}1%G({W$sa^oUy6?AqBNDn;S{+L%2H92bOfQQ{tZK;A
zFfb5O#`0^I5r7S;S%aWC1<X!`qHutVkY}=jUQReIrZC~{D7_WcIcJCTRz(1o!l0#@
zz|4U6jc;X*49EkFp{lij9TbiRl&O*&$FxX?_`q6aD*++VlZE{I?E&PSu+kM|44_iy
zQKr2jjK#+TNPuVu#g<-?)r|~578$rK$4&r5=UEvhy{Htd%XB0uq~DT(6gmB&3k4Se
z<bx{H>P#_fMNFcUzw2%WfGJmz4b--aPO)jX%$bPK3Y%VaV~Z4E!^Uw$r0;9O31XAA
zbDE;5kv9Wi;c5D{=Hpv6)*B(L%o&}6zL}+Mg@^&H^59p-^x92v{qH{?<$9YgApbli
z{vn&kxYm9egTyo85`arIC!XtXgVilA`q#063;z5kzyN8>FldChbH4xp002ovPDHLk
FV1n9fdoch2

literal 0
HcwPel00001

diff --git a/guiserver/images/new32.png b/guiserver/images/new32.png
new file mode 100644
index 0000000000000000000000000000000000000000..7ace01ccca81fa70f4e932c454cf96451635df4e
GIT binary patch
literal 1107
zcwPZh1g!gsP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU#<w-<ARCwCN
zSIutIKoH*9b)2+;0}|ob_Q(TNq7MOYz$GB{&>Q!v572jL#j%&(=%sIf${nFfh^kek
zs!~V@Ns1lsF#Bh(<8^)z0!veSf4cMS%=gW101?^$e4^QoB%K}-q&>#4PuMg%v>*Dd
zjWL7Ue&=JX842ER#*KH)hB%{cK?Y<QGt(9Wn55|wTBuF)+uDU>Oe#kbnWO<JC7A&t
z^FH&=GRYpd*E<Zv`)MY-?N;N1^&#p&@YxPp%Pi`431$lbpp64(oO9FWkoPmYx&o6)
zd^#8>$HPhTlDejLX%UJ*1prv%)+tv;4h31HEE23i7DrKG4cAs<oZei`>HHX{$3G{@
zD+|JIX8`~MLTwxJ7WaUtx1cBpVJuR{g$5Q0VL;Nmr9p{Kf1DoKNCZ<5g(869MFT7(
zn+l}A2&gA<#SKp1)CS@Pas#LlfsVLN4M1o3kR3_+@MbdXpQUN4`?D-#o12><08j#x
z_W<PSL1$n{s`IbXBn*EZex<|%$x<SvB#YzLv(J~8hkI{df4chi^{&-gV@Z;*`}_MU
z0K+=k5kgKt=R6<wQ%OnW5=bdh@1A7LCKiBFMM^tu5y<g)v~hcT`@Glte#h8%*6nt~
zDJYy;=3`BS{FJCPAlDM*qzrWZDow~Ohq&^!rv7znYl|Hm9Mk{^k)ph37o;K~paNlu
z%M~-E9#a4W8uAivF;gL-XLom3g9xhtYB7|B>H?wD14YDatpMPjddzz|H6>wtdwYHz
z2%^Z-;vj&hRIqJlOgjW6TkYI{i{n^NKRrF2R|lXH3ZDj8YFUTOua<r!SP7J?m?tME
z?Be1g3;>tONw9ntqAi>jDF9DNgTa99@9)<XBCM&IUMDVq>F_A$(gWg8IzK;OtO5x8
zUog2y33Gg~BwXq+a!EjY*8538tUJ|RKa@lQ-hrl0&ZX`Hv#TmC17N;0WOX306bQ^o
zXH&powwlz{0gwGq+<N@X!(7N!+42AfY5`zrFY4rjBK&p~YaC-p%pQo9QlQ+p0|{N-
zN4GeZc7xtW4iBoeVJQGm+7ae8A3bszGGaw1<tRW7)+qs2i2#)3hxsi9!8;tVrXG|c
zVJl)G&Q(+pD99L~A<jzJ=QQ|*av1<nTa>Y`VEY7_?RJ;k)j3cF0(0b+yTfXrbp&`=
zh7|xpn2SWUGA<B5)JM&!VW|kL#fvXVfAXw1<6s&p-bSO*u-EIUpI!-}mUDAIw^_8-
z+mBjT*VhT%h^iN$*<Z&yJ3AXUH#aX-FbF{QSGG?=n5I)s*YJ;YFZ@y*Zde8Iub<xn
Z3;-BwrUq-k6Gs35002ovPDHLkV1jv`=&Jw#

literal 0
HcwPel00001

diff --git a/guiserver/images/newLISP-down32.png b/guiserver/images/newLISP-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..06fc129440f9bcf3ec50da29564d1b3365de50f2
GIT binary patch
literal 2603
zcwPZ33e@$9P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU*y-7qtRCwBy
zS8I%2RTcjB<2>%U?>mo9XF4<OwASeZ9~5jwP#{r)grXRuzl=XftO+Fgi<tP|VB#-n
zXe^1u7gmC4h@?T{4~v1emX=!j6k7Ujr}MaT-{-ZrYwvT1J`A9DvUBdav-e(Wed}A_
zUYqUtNd>om+KCUP88~NPOoM3+^Or&v6D6l-+j4cYhvj*nSIzuxq!wJsE_Hh9RI?kO
zx;z*4B<INI1g$sw2+TGTy!f|^w9Bm@iI4d(8k`(RHJ|9E^3h1S4=0L!){$&^t*FJ)
zZob3mD@#1dF9g0goGP}b6RKC^R9}&T_V^eZAL)QGtih}8*x%Mk<P&kCr=Vj%C*+u-
zk)dKfWZe8o$;B$ym8;e+cOUPi{NzkM+1co(JCjs3|7Qo5q7GB{%dOaXCXCZ9TD8E*
zFy(><nPxWPn^q}kN)wWp(v-R533qy8!2d-f^tWDbq)*Q^yZiMgIbgP={ShkXyYn6X
zY#O%*I3h6Og61Zl(s)Oc_)RPN+ZqS#P*5s`io0NO4+ZIcr8-*Kz0gX3NV9g|?tu8l
z-5w$e&J4;m5it19d`rI&N9_`41UENE%@B4lA{WdsP8esFzFTBi7D0xiMMWhcxat)K
zE4fF81}ewjyVO1vC+bG3QwTCF2t<K)>}*+Rs~uc*eUEH1A!$=#A*UB>%pjrdvp?94
z@0l~g4!cGONXJ1KCUD}#;)5Igop(%CK7UIJgoW0^S?c!mFR#sYDl>~3g`C82RUluG
zP|VPd+f>-ed?`v~6t~dRyCPZ|p3rYpDF}NC=Vn99v?9zk+L#(jhaSFb@Y#P~Y&|r$
z*ln3@#JBIs+gfdh>c=y4@%P?3+l4pWgIkDj_G*e|TT(r{@N>c%&d|spcU%F_BLvev
z6PSsJ>Yo08Wj4j>t4+vq6JNY1LS<Ot?*}8Stoh?BM#}S!<GwXHl801EAy#ax*-f78
zMYN63c<iehcW+E_;9niQaiE989~3ZBDPnY)k9@!>Wrhw6GxIUdT<T(aWe&BXgP7LO
z)?-|mYa^A5xbOZ54}1X_8wPgmA#z6yjb;}c#`90kck;ijH=`MukoTQ1eY_W{v0|R1
z>UenljT9SKYixZ0<cPvQ-fm$3;SLVJpGUP&!sKXx!J5R;_v_eyw1M%F0AU>C+FTRD
zX<^;Q9_}N<>sDpi`Rkj&3okJQ%t78)aCx+HxFomM+w6Jq=w10jyQh8{C3=mZsEWSC
zvG*9>{UE^r3GL_*@M+p;!&-$>IV5P?ID0uk6bpn&3q!RC^=5)=^;v9O-@+pgCb)MK
zP$>ZCuK+K<4*cp59NoH)JJ&cEEOAIFk;?_bbDiC6#}5WKH#^BIq*lY6SnN0g%^t_0
zGZAE=i%oYVn3~X7GYPC(q0#C9?;HcpU6cs&3fJZ}-hA6ZIS+hlmBP?~(E(s)4mfp&
z<IFjUn(yL{Nr9n~hA=!9l*;npOsQ1fDoMAeQ>BLuRECuisqJDrMTOFFZPCZxeKAg-
zP4T5oDMkj(0Pb7|%+Dt{agO2Q72-sXw2$VWy}<GAX-#?NG#Ju^qZSB^Rk=McT&a;H
znQGG01UxONawbypSP-!r9gX8x+ZdUM2y%_h6jdPyn~I514c`ZjoCN;zD#O9!d7PVP
zDCIatf(W&I7x&%^6a$8<*BKU@SujKmsw751aFpsE)-01o9!$l8>`uriVHIulpIE)1
zQBQmL(PKou4Y1_}orxf+D-jOZ@q3Q*=L?vgDuO#9l_AH(aGCPGh@+<#@%?XU+`m~P
zPBH?rKB_xkPVwSP3S~c!<wIF1lOk56`C`ugh@h#JsJ0s({`6{y`Xc3g4DejoX#PpY
z|NI)q>}&y>))z57>EZ1Y5k;YCLrL&faPSb7;X)JN{F=u4DLSS-ir#SM1aROGBlZgz
z6}F<**Ar4oS=SwA|B)kz*ADqOenjBN(HPaLq6i6<2BCA^p$hS_WkU|*1fxevmn0@q
zQa@TeLV0GZ%Q*6$z|Ws+V{9}*fk=9Nj^WG)0z8pezd}-q#D{Y2I!;~EVRN2wqh<*-
z!Ca#<xr<nPt?pv3rLkByvdZz9NykQ7DmYf{lGw0a+Z-83j4+$Eo7WX69S$y@kI?BQ
zR;kC!3}XWf72=2Ingh*&kPaOk{5<s#@}v;XOcX`K_PDnl4luclV|<v>Lof+pYBw7O
zK$Q@~P0MD~*T}Onr=GU#_K4|IqtY6TBHD<elH8P^vXXC3RxVtE-kl)_PIBLKk9od-
z*g%poQ)PJ~y=An>;mR&H=X{#nIzmFh8YeoZY4%$}(rVrvG8(uVbc|4iX}dRdSQNQO
zYUvXa&S6617&+p$f&i~HTHS||sB5Wf&v7Fd^z5HI1eeYlRMV&$!O)h)hE8NKHNe=E
zXq7po^-WJx4m3|t<c^!8;S)ifR|we_Hyvv}$n6gDg-Zq=<7u{$wu)vVGZ7g9Nyw0i
zFf}7KoKe<b5}Wt_Ncw1)p;Uh_6M%%{1&}m+&%2cKNQO<vY}zc>buL%SrR}blw{4dx
z%Oyvw6H46%bKhvH?VPml+>&84cWJHJ3w`5$u3!-;7QE+NhhMgRlc0macvmh3+bh-T
zLFoqeJzIQ}69nUjkr_lx^t#WD^wy}2HW=p&ip-Q78PDZQ)`>#k9V`aU_AIT8`T@gb
zZC@I-O7W>ER(qNaRzcXMNHaN8tltAOX4`RlQDOZ~$kc`LP-hM={buG0YUw;bK)zU_
zXMr@uuNU*)Q$+B3((enU>)dFJJxA^nBeiW;h4^)|v6zd<i8ziZ*J-x7DJ3v_XqoqB
zhuBUfYV*vNq}SYp%&F?a%LNF6B3yF9_r305CD;~tVxO7M`z@U$NN%*{^jkh)yUfWz
zxp}tJZViOSi7+HIVjHRMU(>R(%5tpx*EnwULO2AqM+QyK1Iu_)yt!H__vB#N-(^?p
zkGh!HO|?<0KQ0?AU2gdPGp%-KOBnWubRnS;+mg#1QP{Xr+VXNpIjOE~qv5(9<=iKs
z@dyP;jCc1Ha?aDV=Uxqs+b@Uzbu-dB%PB#-w^k0m9^|}j?QZx)FN~%Va==QqsS27{
zENgoYl5_!dsQorMH^VyO$TK-#KJU9?2bJ1_O_Rng_o<J)8`?Z^y%6~FXE{&)E=qD+
zdr|T*>A>fx0!FpLo@F_=B14l&ST2(@?|6>bLuE!n!!B4+(?*Kf|93h4@U~?g;TL>Q
zY^Ou%H&kisq9k2Q8;%o?tJ!tVMtH$>#A%|!2|}-FuL(-ylRp0uU;rR(22ZoI#c==t
N002ovPDHLkV1jEL?*sq<

literal 0
HcwPel00001

diff --git a/guiserver/images/newLISP128.png b/guiserver/images/newLISP128.png
new file mode 100644
index 0000000000000000000000000000000000000000..01f58e0e679e523fe7db7228f51048c2136ed8d8
GIT binary patch
literal 18206
zcwPV&K<U4UP)<h;3K|Lk000e1NJLTq004jh004jp1^@s6!#-il00004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBVjut`KgRCwCt
zeF@YhS5@vlr>gG#=fB5vr@Pagc@BXD2+4{JVN?_ZA_4{!L4=6o8<eL@*JFvgp6e;=
z1%skUG#XR_2!aBUgg{6j2FOH0I!Sk@=PCdE|97l&-ri@Z+UHc=zdJ*xgZ@c%)xEcF
z-Kw+q{`PqG5n5|_#{V9Cm%x8%({2xJ?~na!<@S=D&p+2SpT*a!dmX>8qy2Kn{=WEg
z_;cc8vCOsXchC8_g5&fj;rRZE8luVQb9$Y)z2Erv{P{_A9{*gj<M@4G$4Sj5qhtU5
zlzm^+TuU6`Ib(r1E`RB9CVbuN7#&27q}2^-Ekoyf9=j0o{u!Y333w)+D<od!IRmia
zK0H?Vxdtf?fJ`1vHg37623-argRD8$1CS<Uh6mpThy>3#9E)c}1rUeR!<C%A9PtK8
zP7L+HBu(f0cAo;>_RB!)=i=)vc-Cg5^=VIyM+-E66#sb)ueTFN>~3fd-;%7`uq{$i
zf~f^hXjQ``YJf_C<Dm|oIR>aog%}|1T;Iz<5}xnhy%9R?EAaMTfiEw^ZGA<}i>HXJ
zm9Y_=y!-L^b|Lgl&>XorS$E=|Nbkoep(6%R5vS?s_!&WjW6J=Z@TK&}QZ5HTV%>Rw
zQoa$|t)JB(uEdYdsKU4yVD^cM#R(C0LW=3?34^{={@BAfnx7KQ;p>w1C+;1<40Vh!
z`1psK0YXck6IRy{xK1^g_teyZQ9U>NQ+S(i!LMB&N}{L`y5?n#3KmBv`H>uJ|3V*8
zb=-#F^GPv2_9?mQgrx}f^%2xU`1vtrf@cB&L=6Mf5j!}yzh}p0==T2?p8O_!Jsc8S
zL;^3CM*=SYgZLnD*anRWXMlh+syspJM?(vZ$s0wM{Xu%-#+}O`04Kh#bxV&CBODtB
zs2Y1v<F`YdJJ;X6{S4^kAHb8|h%d8}@Ph3I5S*Sx^>E+E!#*DO$vkA6a^tQ;A`5p5
z=pdMlJU(-bKQ9wJOzo}EUWgj1>v|?A7(w>%a-V@T`NMR>riYgyxEk=8I9A5t)5`!=
zV{edq7F+S6zjNDpx}X0h9{wc0lPpVk|LwesbnQ5zcX8jfgszMI7((d5#^G{O?>|Cj
z0NKFr<0dl@NfUXc$-cV`BNzq~xe)SmmJv2Sa0H@rrtkqH{p@9cFqlzCa9L;d=Z6nY
zs=3+UL&NS}R?Hm4ixBdylZAvvg6q7E#~pJVtA=_4izBN2szs>lnLtMfO$;EL$P7dF
zm{23)0v#|RJ)7*|Z~T=U9s6LiX4OoM9UvI-t1*YCkrAHWNMQYqi9vy&-nNI|lF!Y4
z7m5E~J90)!LgEwAdo!Sy_JdyB1G;?>U(XroHv?L1GJ4G*z4m=kzsb6D*ma}~Kd1Y^
z`=R?X_t)AF(49q6^%!po##9P-DnnAfPc1Bdx4(1uTWew>%h^fK`beM{0QE%>r@wRi
zIjZ0PzbFka<raeA;s5>;s&X`-N!m%D3jq}mK!_TjU(_0hLL50YKxjzk8B`RJ8z7Eg
z{cCsMIo<c7WdcM6k&fUfk08`0%#SckKuB<+*2!P@cJ6+MNYmd)H>`h<Nxc{lQ+O7t
zfU30*Q4pu#;O@4q@5i6~-zY)DrF6K{2-0&$c-4*|U4-huU9zGo>KFo+lO1sczhBqb
z2--4<W~y7)s0Zynla3LRQQR8tCk6eF1Q6D?5OPTf{d?I-o34rOVtE(xDXN2~ivi>^
zKD|*hz1`bas&@Bp@Ihb6KQ;u+TUKglBg;LI@EVC1-VGF0y)VQvx?e0y_gX>Y<D(g|
z*<J^qMcx7bOd#N<W4J>`NQc}RqDWCVwQ`eerte7Ct(&T0g!%~MQ(%H8&j5p6y^7!8
zdGw)+w3h#X54Smp&5@M%=B>n&^<G10yO$-wmsJH3{2!Gn@Djb82N3!Hk<}l(r?q8?
zm=OZzLDw=vCTNTsbZ{{Pj|8L|b_yxql5JZ5og?HB)Kf)(r)mVoetd-yI*&g5GaBU0
z_-eB!ydcA_`?xWfba!qU;v0+E63rW5zzwv>$dm3pJXc8nUHg6WS`IS)r1{LAV^PU&
za)8k&>kUP3#0K{WHEOJnHsY)?Y-t>fM`K8<%!c;CX5^Qfd%F%?H6Thl$oqN*5TKgb
zlQlZuT)X|~)?dfn@7u_VV_uSY+^iKJ8*hU7{UUmAkSY*tpzB=1Wek92&8uplr%u;v
zT_fRImC(--p;nFHO{5J}3y21dNxUZ?grWdck_(W((>UpbKOK-S2op$80u7!R15}MY
zegg^rto_K=Kf?X56>s%P&!e>W7E6iXM6M82)Yt;-yg`Pc7@+&bAZMk{0MymjI@0Ny
z2Yz&D12EzjYQac1zlI90ZAwhgK4`2kUV~u-LM3$6L?S-i*mS~g9wDFbq?q8zAb^Cy
z1sjmh9m=`~rv4Jy_pSD}5Z)2y4e?c8f%qb}A2UQiY#A|4^!?yk%<mp#{&PFvsN(*f
z$WTLMb`2-_IzoW*SQYMOh$fy1v<Zh06Nu&t7aEZ!1T94J$#g>gd@{MJ|8x=msUkoO
z|B%lfNV^ATKaF?$8go}D^}<6wCtL*kf*E@i$d4HSYS2M&qSv^BPuc~9nlNvT%co;v
zazije1b0rs1S&Epg;fgz4MfpgiMTrE>>tAfU&vOZZ<gbey$S<7$y|YalEjy#UN1)z
ziT@Y4e~o#T4oZCckR?7iD;I1i)DD*LCSgsa*c(&QY{ln-8G;}S<`H!PGZEPj!Dliw
z<aimMs0%Pf_cZ9*?6v(*hR^Od?e1AK<59ccRF)}qX94u$0YuLkd{6mg){pmQ^N-aU
z-4>aTxff7Z*kE3_wm$TK(5JnM;7_&D!YAVAJ>%zEdJB6jtncdwP)8dd*x)lM+&DUG
z--T>--Fb4rHKk;s+&KIT(LG7Gv1|GJ9}rp&pGCU!q$@)#zw58%8BIrWp-qrTqsHul
zS~^gUC8|&y->W)%rvJD$?(!r&f+xc@6}P0d^#{L!5A-W0JJ&vpTss||IY8gn>HWIb
zPRd0^MbyObod?0U&~~VCV!3Ma-!twYRPS}b{ecuU$WUHaco$Vv4Pa40kWw9JK%#e?
zK&h6oqqNe$+SxPv>$OJC6J!E;)bL+5FwEU9ZQXj6(#eN(zYVH&82$Qr%fXRq3~Z(1
zGhxo<@MyjZPD1$mTngRms+%a7v<a49Wk@mLTIG9C`QAV#_21{`MsbSbH*~4G%Ja){
zD4*Sr3n9KP_njF;gF~Q9w3L`YeW<f{{;FC5eF98yWFxTDEjmi<z|tdIFH}n03jM_q
z-I+pHuRXwL_tFvh`=UmldTEIUT*MxLsLKuTmq#cN6$1=EU3CF<-RH4^$M#zBu&^@<
znE_~Yy1%Y*2i^Di`{e4|WPwj1TgFO9K@P74Nil;YTaroolE(UxyQA6xI9j7nJ^|Pd
zEVa&_9izyIpM?Ixh-yc~hnV;<fcQ0VD4r<sONOgJzO2{rwZ>cVgghk-1w)D&RZ*T7
z$0=aIGw^H3vdE<p{e(yr_}Gulk}6cQs%PBl5v9~8dyg-ShL$YoqeTIE6wt3AEMd0E
zo%!yyy0>(C-Xh|6XeI@NZyCUz{Y)~Ll<a-Ghhok~xp~XKxSl(<BP4_HD|mygI4@Ku
zv0Bjqgo^;Gi|=_u&>dGj3iceLe0G5H+~VHZWTbL@-1l`fcG{k+G;P9!PjY4VDo2Fq
zwjf`69CGp$a&>y%k=Gu(TtMmm6(Prkhqk_3=k2#@lKi|g5Hv*KLcsu+EXwS0iII^Z
zWuy_RQd<{e5D>VD79GO(K?o+KvEdl04-rKuW9hDY&f+&k{rSbc*gdxalnW8`mEF3z
zf=*wXeYc-Ozq^E>dl+&mMp5c*OM91op;Cc$6ezH~4N#5ui-kuXJx6s~cc4`|s`FM+
zh^-?i(@}IUglFmOBsoAOcxzd@_|SmhPhARFESD8LT1Pi3|E{Ejfz<;<R&EjKVSyoM
z69l$_Qbn-HyzlG;gmma3#anF!GlzR{_&^sP+uq0bG;H3I!s+J>L$jGeqmhD4Ge{Z}
zkd3W_ba-MZ*YZVo?U{P;WiLE23>PmGAxw|L_zQ+db=!Zc+tZ^a%4e=F%fJBTdhka3
zxyy7T;gT#t`p{H6VY8i{zS@R)f})Nnn_S8HGr$sc^DHZA<mIZ;28u)(yb&zlqIvGc
z!(lkdw_rYPMMC>DZ(ZEc)Im62aF+h!f`UE!yRh}%1^CK+9oV&`VEf*lK>!+3!rB*a
zS%jayd<>p@(HM-50b~l*0M!}DY(!?G9|t>2>Zt1npHNBI+=CCkMYX42uKV-OK5@Yf
zJl=Pp506hN*teqtyLa1||L}-_^DiEPp|K{cn2`87fvk~0B3*&4M8?1u(#6emgcMrT
zNxMUsSkfyY;bp3U#B!lu!5G0;?v%&YDrZc_%ExqNu7NHusYPkmX&dY@#udJpp6Vg-
zJMj5W&%u{>c46;q4ht=1LalxZvU10_@9x2_FU`R(BC}lnvPo#F9$stCR2ntM8!vd_
zNvnVPmOJ-dgD7w`g>1{HfT-YO@zL!Qy@i7h=+@)wO9R#Fs)ruzz~B7KB7A*c4`$}^
z#&zjSpLaqEYf}LiZfU?7=Z(PX6Ps|-Nf|T|!qQYif((#m(jbIL?7j?~K-G<m-M=Fd
zez_@QwNt+0**}_v>Z8C$#T^9Z?m@*3^iWSQpX2fTY!4p!!2<mAzs|x}c6DKPA%_N3
zD?*j2Ah4U~^(!_v;8)(W7Dk6N+!`=C(uASO_0SkwH``O<+!dR$14mOdawG&OhOoCd
z{ky6)y}o>KOZ)|dsT=-v5pLSn1=-Uu9*yn3gMHYC`@0d!)^6><>O{aRUpNA1T`&$?
zP8~sArXfYk7S$Qvj7ElVk#r4(@dm)cz;*Di86w2CfUcVcz!)SF01XTQbj&T)I!#?5
z0Xs+d6ma={&oe~$1r(BPTj$}6UzmYUJ=%gcj$!JEL1#DIF~NQ>;#uXcb>IFTJU*X8
zPB8+6(<JGGT%3X=9hz*8tfo}_&#}PJKvj?)4e{rG@Po5eXZmVwCSBO!r<?`S4LThK
z-#{XFk@$UfQQu9W?cSqm`TdXg;UMnsMUFr7_C<K@kBr0F=Z(SU(?+4GQ9USP1OX|2
zIT6<Q6Pkr&3j?!?1VRkX0&1~LK}bbEL~~X7WD=9*6U<Jij;Stq!`_!Q`~;4bGH}0r
z+ala}(=7bkU30Kwx(_4FvPs=ndrsOF+k0m4oheQpl`zxl8w71+eH5ew8oeI$+S8~F
zhTqmXJpSS48vVT^*#YTM6nR2_>G9v!{Z6AC2T>R=yHRIto3hZwl}_I=K@Y<A9JGz&
z6YZVq!=Ir9oO$a!yyB&kaLxsz$Oz*wgz%UdG>`@njI977tmk9UE(FvBVCon_ET7qc
z(8z<hG+g_F6~_cxm$QvTi3~zp<4?OZuaSC`ly*CZfBej0xDyHg?~k>iho2ACMA+#3
zE>x!p@fjj+q8iLEX&BCO80{u7(o<-B=b(BmP~F)?H%2~)SAE@)B7*6Wa{klze)nS4
znf*zqgEL}F<iIt^jctTA&&fHIRx2+R^7@RJg=)fwaA5Y#^x+f#G6h?1orRaacm<q!
z-Z-3o_82mPMn*tHzzZY@2PQzLfT4ktuqeAD1~Ea6K^RtXN5rpK{;|a`iu1G%)q{!M
z3mfI_p(Nb?wL|d5uOZ>Tzkq(cHiKSY(^da#Dq@B{j>pKjge64Z7H*xMiw&T=pmN+g
z^Psb_*LDuAd|?yb_3h<QpvnNY-mi3m+B3ghkq&?&P%*JGg(lumkKHWK7x$ttVh&-4
z1bQ#QL3s?}@Vc9(;oNO)c=3)!c-|$eVD*|N!W%&x4H~+X<TXgaW|oG87O`<SAPx}Z
zw4JV2s+z#Gak+@#f_VcFni54wA8hecr<23~`{*vXXL}3o#VvEpzjP!ZIzpI&?s;@&
z;#_Wxf|wh_Qt2FAxDYf=Olge%E|U1imoa$<+5qO{>F<5(tUT|$)=R$-EQ@6f8vHFJ
z$O~5`@KtnO`kE2dU3|$Aox@if>RV{_mU8&seGBl|t`6LKZwsz`%><l!)=HS1$e@82
z&X5@rgoMP!6r@+rlA!@3zNiTh6-2^=KHl*5M-IaS_b$Tz13g%e9?MH!vk``d5`#F2
zv@W1$0>LJj>LLK93&n2<uhAaL;pTrk0RQy$S-AJ1MRRTngIk8ww+E>|pHTJrt5cX<
zmzMPdB{m!OBSxTF0@<B^Rd;ILIgM4_9~iY>qYjq!0`ku6`^hj50%IZ!dNrE@E<e8s
zUpvr;xkY6LVVIQ*d3!)IH0VSRrI{Y2a}Le)U<$Y0`#W&Ssf%#M>(;@hO-&ddO_322
zG!(UQH4|xxFAI->-JmxXqevkQ7!kkK>cQtfvkQLd<9i`TMp%KLy$e;)MVIHML_8(p
z<Bz0?m3Ao{v3&^01wgDlq@af|d<gyd!+TrsnNJ^pfB4R<xsN8)mm$Q3l@OKu>H)=T
zP5k0olz!0^=K1ON5{Fj8xR~T_DpNd?cjpt4jr}T$&ijf4QKSk6F@Tu9_l|MA&^vSy
zofaV%_(&i6_@|!Rgj4^c1z$%7$lL=EA?F=4C}-Go+=KhnRiABqo;2MQS;upSyKoZ{
z=dM570Y7osB%F28N?0?Q!MYQNjA}?zFm59;gFyreG3qeBUKv5$h~Rg8eIH!?S9_sJ
z5Q=Xv;`PY>pnD<RI@GXaq9~?FM5R((In^=!cpK(s`|#Md8TjZY4+8=r96H#632mQo
zo*|<5jGAoVJ+Yhavn4kkxij=K?vmksJa2UZ>o%hx;J7!@V``*ejAo-AMVZ#JX=X%%
z?!w!8Gwc6ncImY<Psj-DFV4RiA8<^ws#w9ozTO=qI3Alw;TK*r29JDd4i*-av2I&X
z&IXO8e2IAnk{O9PlZ=kHh7k!4<E?+>%TqA<?^AI0ss_CL6>H$EbH`xQmQiE`VFOCW
zSk%T~6bu^$^Jlc{0hcR#Of>Gf-+BG!VL0uAmC)+C5^lT`*&r{(BaBxe%Bb0c`&+PU
zcNcE|>H+xYyBFY*=^jifT@YDC&&0*9<DTCW*gwB_`Rck}lAx_eV|(LC8KkJ9hVkZy
z@!5xn38+kfkdPQaSOg%OKoAo2mqt}*>Fr3@kJK5018o4M)q9=8;~ks=0{!0TNgSXI
z_44Wy8}P0djKDvArv*Fb^5S9Yx*mAqrcgp;8o^`F*$NYGkh%+fpf+3&qqKeXZ+FA%
zPaTGfE?W(oHV?tM7fd1}B<4O6j|wK4SO$uCyoTJg^Paa7Hm=+U+YVWU^rkCULs#Lm
zwQ?ibR61zl5xEUrgVXQ(_szohAMC<+zcmfF+&u?-5iQ#IopE=c@$>c>ll#^cJ?19+
z7>Qz%&toZup^(U{MkH+6(tvTaQ$~gajG_t{K}j1ztCEDkJUhir%*<oU#C}t~#dpFv
zpStF#y?{g4oqRSPT~tcGfOs0W$<}HMJsFPnDBj=&&l`cIwuZk)18)DKsuU2$R%Xtm
z!Fv#+EdH(8fFuk$8#w6S+`0tc+R=tJs1)CF<r>(0$~c^H?n*ZpiBS&(jZ%vsLadR<
zIYL0YmxAhB_`hIv1CpT(7Lbrb4QZH~AeM6Q6uE2T?>%(?3_S4tMfm*9hhf`+HV9N1
zOK7xmWJ_4MHiy9-9%S^4J@%}MUC#&z5_%k;@zhhAaKif35Pl39V0<Kjabkoas|u_=
zz$cw3HyMTU$?fNLzwz$#8$a?__aBuCK)2#epz0<}iXa;&oB?9=QL12aEP)Fz9);<a
zhA%$SL3I!!0WgS583QQx@C~Q`!5z;s2FTdpWGIdENU&YF-T(1@@PdiM@Z)cqhYO#-
z8rE$XgC-J^2uOJbGdQlcfOI#xPhbAxemKyv?6nUGxiHrQ-Dn!Sp@9Zn55G@o**!bv
z;I`Z5;C7Vw`%t%&&rM9K(9)O8ei6*l&)GBOQPG8BAzz3hd@8EDYa-!SAc0Rp;;&g}
zi9dmYHi_H#FfsyuK16OZsXhroWunbJD7zUHSfXZI_aBW4pajuRLje8N(5Vl8kZz)j
z4CBr8kSHrA6S(w6W99+w-r0o*r~08G;~sj64W48JIPdHS|NCu5^oC;snq0OYw=u^o
z6q5cnC04HA53hQ#181H+0x!616`ZgRZG;?*!I-%IPUQMcO)tPT$N)>oJap~Dxc}T|
z55t?@(KKqKi{~#cwc)R?I|z?Hx(Hj*vM03gzu%3d-ak*5F@PVlE@NJ9AH>L^V($QT
z{0b!U=2M4Y?b_53oCv>S6!&NgOpKrk7?#EsAWtQ6hKepGrFd1~>Jj^GVu1g>JOiNg
zAGqVIC*j?kA4J50NNK76jVp))hT{e3ogo~7jRl~aa>-@mFeDeCgRc)x_X`)0>$<uo
zyL~1RvD)Y}x6%`#$p&_~ht~a_)3EjaIoPwS16xjR!1))gfsLDx5pbX=h}7*W_{6ol
zVHX;0JO=;Oy>0lh#g0i&-}9|Q@X0Ss!6MonWX-Q~NJY#!=hRe_No^k4E_np!9MVPP
z?<=TjCXA4N(W(qqqRyv4+Zc|kAwF&^i2;!C6Nn5W$W=|0{)Wq<`r<Q^dZV9<If;fD
zF6iF+u9F)t`S^}y5db0bwK^zvh|+01VhZJai;UC&z8FQ-p<L4B!b`_YamcsuoLz_n
zI*J5V;to}hEr3ow*ok8T<xpVA8&0Ge=KFBR*ABsh=rP>+y+ybL)zam!SdUE5FtC2_
z{&o<KHHH~7#{J*e1>e70z`Y3b#OEuRRQFj}yY22{$h{t8_b%D}<`A|N*Nj<p#3%&{
zBJnRjwF#pe8Zd-}9vdRaM>H@S9wP$~8jPSi7;ccAL)k#>0+n{`rG|p|1p?4<fAPog
zlWUh{0Q}OcDf-3J;&l^kji!;-)gs9<#+mf9fT&24f<gi=e(?kh-?;!^d$<K#kqH`6
zZX1{+s2XcS4lt&GS<!u`7CMd?iL>B)oi0r6>cS`Qoq-i=1#CQd1==MN5lhs%r=Pe}
z!#dMtx>QHtq<zfY!=i)x%$+mr7=hlKV)vUdn;>CUy|;b1?O@OlVSLky6rQssgT|T$
zj5LHH{sck)D5(Pr`xE$s^gdbtS!$nE%CaI!Lpd)o{tubp)kkCie9B9Cm~Oe=x_*AU
zxdB1}6Z5pijXq{TN9Vt29NokeZn}LD9y;8GMYa4&3~{`EP+3dEZ9Nubdch08===7P
zjqm$d!|#7+H}uE$!{lTJ2NwIa>V?i*kK3jb0Uke$*TD;KJON)LN1Syoz+JZk-17*)
zZiYgA$0!SqIffj=_?-SC^YarH3itVd6-fBaNbF7P8Zf*zgV8k^+EZlUSxG0jCj_9)
z7=8^fK`IIWr7l7#JV+~Dma(w{6ra6AB)EK88(`n<x15FNt<^AK)^waYb!ASzyH?_I
z^x744Y7>~S@k)8>D7=0}2H&`A5%%ovz&+^C_l0${Bn<8)mqhBJE@bLGjWag^oN^|>
zN>tiINQnic%>3g3Cu{(i{u-J%sM8k~Y=KG|<spcPU%jOX=bR@^Nc9YSh_P`2>o<VO
zvXT3^@$?)H9O%RBd~OU?9^&pXdnBGdEt&r>Q9uYaPC&zH)2bBYL<;NHB_L6uH&YAi
zB;n-hk@S<*KaS5b;b4D=bbe}UCRi4l1!yhdMS*h65Cpxdd&|$9)p*(8KUB*A#335W
zDM_K^iJ;y>>oDQs)8fRDjl>mcNE=7Db^>v06JBz828Z^w;lzD?XdUXp_Wd2$*H%VS
zVln3s@9!XsB8DV+WTdSl$vqj3v^ndVjv+Igb~+C5nJ76E<FN9CDY)QKfahKa@ZUdb
zzvr((ggF`g>QgUS2_2Cd_ltaMN_3$EU|ngnE!5f`obysNE)Ook-kmudo>L%ktY*>j
zUBm&PYcBL{VN3_VJ8DwcRyfc@hV{b<44=?|=4b+|C-4|Ii3U`LpV9A;MNdQ?b<$6U
z-Z&z_NJG2GpN;q>GVEDI%;`#~%tKiLRz+1(=?$3E2?Yi+!1=r_-oSqQLF!zWHTTXt
zpx2FJ;*7L$>cslu<Tf@NBd}tfLSp4`Dl)<0B?aq-70e#)neWWcE0~^9FyFH`J%fWk
z;{r014rVtrtnrC<oeBD!dJ4cv2-WKmzMJ%(B*U(cp9z>cGzBN)XA4N7+r9}!`4wlh
zl)}Pf{3W(TO(itT*fEK8=OgZlRS9G(hG60p1xx69cDqP;%FE+-hI564MRZtDCI)dh
zPmO9q+QJC_z$6kh8%ZG}*G&qe!%0}0CZvn@L_-=+YSb_Rq5wjQk$O5WC2QYJaCQ>M
zvy%fmU&rn3KwmIW1(2)2`xpqV!{*3G$Xc5?v@R!Gkbg=(Iz`tk5+v4OBpAy`%J6~5
z5CU-!yC^xssC+1vFpeU=j*1+p%uHDbUNNR&OEv`$J_vC4gZB59+V-wy5$anw()ZtI
z!@zXgBvqsennT(!!@dImx6D|peu(Mgu0xcW#T<5idm1*MKLXRO#CR`c=u*6$pm}m7
zN+KF*<f8TQesfAjHHJ)hm~sHQ$--HI7@GtWm!H&S<r*QQ4M<r7HN%5uYJ+H&_`>M+
zk<458+Wa=@`ev$Ktlw2fdUV#T`nG)2BDhphf1)CjwG0E`hdNH+a3;`Jx^+#O5?BqT
zcLNoh6k~D*_@F~d8XG~n;*OL!8y~iVgW79%;NYPi^n2QP5OcFR%%XcnOf-iS`SPRI
zsG{f~^@S!Pu4%hW<Dv~95phuyz^SOam(bF>e^(iNIS;p8PGyi)Pu-edh+lZoWdJwb
ztl>X)cVYLw9-OgB7>S!fhH140EcGlilgmZVv4l6Yas3d?XO_WFMm^r3hM>skE76ea
z=(L;+=H|E%`lXHm$YmyJ_8C251WM{OX?zSrXcOThgrM(8QR>IKxhip$GsR}e{!4tp
zECg+ho?BZMzUSkoPpZ5(<C+lIR;Ex>RwW?p%%xckzl$2ue73!N+VC&mY{A`!dgh!7
z;&6QWcHf3#DPXjNs#+;-KvSP++EWV&zL*!8v99tF$9kibCzD8uFB?bVqVvA-B(!AF
zdf&YRt!$+Bi3tDOr$&*XBs{)1hn43{!v3%CgD)Y0--PE*Uc3R4?R(+D?*m+cj?xME
z-G_ewFg|G?^Wa{9t@xVqMoZ3$PaXPpoh46pM<2KKs~WIkb!J@6hRNMa7)G5>9N29m
zx{XWRD`a;3-AVjx$TCI~$7k)@1jg`Oqr%XYnH;z3Gcne_n^h>vaBoo%r?s2FnwVM!
znPj-nP~A2m$%b&F{fIrr_hi~wk-g-)*#H6X8mDL-wX#`G`TL>>N1R0@T)UIQcfQkx
zzq_XmckQCMxrSr89z`5a*oms(q>ZTSr%@`=Cb$q?!r@WWqiBuo>^4xHG-1^_lt97z
z8b;BdX+yGl493VTKX(&c@*MQ9TRRQYoO3=B9^HlM8JDAIm^rXTT%fPZAkmzwDIf$o
zbf5zb+)PAJSSf4>*DMAHBgNys%Srfok;V%VmZ|7(0*%9!$V4kC7J#U5CaRuSynNJD
zDiL$obG1Ryq8q2Os0wbDkuQxH;L)8zk@}DU05(^fBj`x$i^7!f^8)DAZ9nM1HJ_P*
z`w#XF(T~^PdK~RjPR9X6$wl>So}+;Sc;AjOm|tqZ$dI%(h6wMzDv9RU(IgcE(J02<
zkyBuCVLLRDDOMvAETC#xwFZfe6y5oNRX+_D&Q9Fx7OQdSdIZz%T&+uYP?vL*t&T27
z)~AW5ruwi0x13$;&+l1;S8Z&-JKiv1@-10mPY^=5d6ilOfwOY@nuy~on=1@}pR5mS
zz6Lnvx}1nX<wrZVb>RJfIc+%lcoLufrf|g8t|n{Vl}aH|4<1g@qDLK#3U<UukTj5c
z&go6K6W!4+`rnhIX<@XIUD6aoCXUeS<#5_*J>yyuU_6QpaF`J#Zjv~}as)mEJW^BU
zr3T=tuE`a6FJ)>vhtE#8U>Xg?_q==@R<E$eDViIg6J^Ti$!pP$@}jN~qhy8k6(f)W
zKqh!Y`hQRfDPtzm+jHo?z4>F)u+Ua;y#Hw6Hx9dWE53Mqu>ms+8O$V;CTli{-o_~T
z)Xl`WhUw;pk+?C0S^7*$TiryA(9)Y>i6&%bOE9DlAfohO&tq2lN1P4d%ig*y;FCpx
zA72HmSojxes;8GL56^gh0XgB$hf&2KI=uaj<FEo%!w5=Z(^V<^$e^xir>9xjC=jiy
zUVvOhGk<)?60hHbtWRN83Tx^2S)04#_~$1|bP?BQ^f3DW2|PA8X56VUlzJ+jm_Q<r
z;hs={Ecte3Ykep1^~8vEPbIUa`^e!fWUIw|4PJi%R&P--a!(5mv{jMN0anw%8Bwr|
zWy<3HzAiF}YW;Zfh^LbUJI{o>@q>lA9B#yI^0pSd;pJmC2-I}5s9c3Kd1@-Lv#P)~
z<_Ht=VpW|RI9%d{Ec@No*#O#>gi|qOB9A`<cxjwLVm`2c+`#-8NjniAt?CJc_({hA
zw&F*^JRTdy$;c>7TnU&(0A>7oVJe*n73NzbphwYQ%#eJ@06By7oDsb5B;JRIm)xK>
zS<c^2mT9nf1W$u=X2{sJ+q_r=-`u*b3v-v+$vBCz{GCnUEI#RFmd}?cDyK_YGZi3)
zi;h`ZvpH^|4)9$p$p6jIs8Z_L!2pxP2|WL@F;gx*<fMMw5Z*Dscwz`ma|=j9$n7Em
zO(t}{up#VJ*t$Alr*jQ8lwpE2MH2MT$DhogH*XV3U6zjKWnC>txK>pE2yCxe@+yl8
zLIDOZHY{094#f@TTiVnD(hMr9kZPDI=V3>*+9q9f4B(hDXl_;Bi3plzkc3cWY}ZA%
zj`ttc0bZ~YhjL^XhMNTU39J}Tjd3?Y2!Os6ApwP23F?W#Q-}8whn}Kx^c>_NWG-ZF
ztB0hmy3H&Sy!s7mp#QnUaNEvSfjV)bs>O&8E>|(=ugyy0WHgt;U$@OZ_x1qN9oC(Y
z!eU3`^J)_{q-Y{BZ2{amY{R3&wmglv5GUxH7rPC?#-fiDy8MG59kY`sj?*7S)n2@=
z37gIzGX@?>{7NMLD%vJ8v#l7nh(K;2m9Eiu2nh@kOlnvcVOkTV%cNlz`pybe9V>BL
zjRx16HKXu4WP(dh8V-!TC;P|eLMWD1>_;|3k5^FPk3N45-p@*DgJ(Tk=57LNF8Zo?
za}A%A54x+>go4pv=mrS{Z6!tURA1r8iX!xU(rH6*)%iWR{=SyEk!RHSL&kga#iP(z
zH3DN!+6}?R?MBRC37;CsC&@N3dnt;keXYg3poDOfIWorxgcg}IuB7nQJjet;szCkg
z6x^}970i7+)_*;`hfVlQr=j$xxK~Bn!Dxc4uIY;$Hs|VARe%t!pev_oVkC;vFrO1B
zxK>z3pv=}wE*Ui$y?=kK3+?W)cMFIZWYE3#+!1K38A10hDTwbSmiFT#sgZgrttS00
zoU)~mEw!uh?yUAt$x7adSx6ly*W%S;qn(eZHjKfWugoC%^Z~dFnZW3CU0VKif60KV
zrYG{ZdQ`&tHHdN>Gvmr;t{NyUs)7X6wc-`keXD8&(wn|rs)C~T55yHYY)X9M=FUy7
zOyG4_jKL}QwBhT!d+^A?9xNUsMxgZRrE40n@>C@J>PBJdTggZGA4{yoKb)8e6r`q%
zHSg4vP0p0}M$^Q6BQH%lG}VQ*Oan%~wV)Vn(=U3G6s`Z?_{O!+xM><5-qnJg^Zmjm
zfMtqTp2(jc_tjJoIws+gEe%scU}^&zE|Ju*DRyF5={C)~v$=kXLImB}s|<iAPL*xW
zeUnEW8iJ~fU)wnW!qlWwp#n+Zxz8Df^`|yr`_?wxzpoDu9O}W`)5r*?qoH>;>ig9v
zj~I83q<g|c|2Rp#WrT5jpK|K9W?tGHdXWvY7H+R&fxFk%)NIjqJ4;;|mF?c-<{MI7
zfHoOBgahNd5%EpKMl}SlebpNH!FOlj-hCZ-aCaLHwesZ)sh*&5yJ2Mt7bE01S0yGr
zJUVQPM8=0~!Kg_YQ>Ky(*`f!bwNT7@Nv;J~(Y(^y0aJA<;1F-WUbaMG`NzNxuoE&<
zW%JoRbas2WG-G$#Im2+m76oVR>cIn3eV9T<*fy6xsl*WJ;Ik)j08rY`-q?g8wCIP2
zD558g8Xz4%Y23Wj1a!tmWD)aErL9pAY(}r2EHgiA36*5F8>e&?wPtp$pY`h_>6FZo
zwg}T+L*kZLwSe!Rd+`d`FyDiVwlBc9zPA8(PWOTUnRtSB0uA$X@tHTQM%A{VVba7z
zXsQ()cU3}EAZm(7hV1w!&SvqAs{MjlHjT&@(X#&?s$l@RpD$?OVNP=e;OzkIT?p$=
zk$xR*_>XDeZQa_?X%aSUZom|(guQbLMsd);gUoQSt4yes(!vB?X3#yV;Oh-Yz*7*y
zXK)bKB5^maN})kh!;x4+O=<jj3hR=NH&H%v_3)Ucr;!^-znvwb$i@5kIIoYB&V;Al
ze5SdAurUqInLycMS6^*KT7<5v8`8CaNy=hRawE^2fLE+;!a3Vo@c7;ie0Qn~dphc<
zqoqWvb5M<KSeL>26Eib0)s~9cf)T0{q+-!AH!omx$juBg%r2e#%2!8o@Xy=V+O5g}
zX01Bby<31^*;3bXC}<mjD&`Nl8bGoOsDh=5zUc_wIN1VJ-n53Qeo*Mfr~5F6{%Z#z
zwB^=_%(Wfl6OpSAphdMB2|R+t6ljG}^$gAaCCI12Ae~PPK+;coo+N&3*cy9uPQyT=
z_3NegR(K7a4zna9BP;^XCc<du2|1hBmA~s^qQ2=MB5a*r<_kPX7|``xJhKPuknyu_
z5B5FUg}Y~ZCT*-;Dmgc4Vt@^JoiovfBBq){qMnGlzJbq11tUYQRE$E}zD(Sfj7cN;
zBMn<b(!lYti7d&a+#XA+5#TGUSX*Fw9Rh6UE`u(Rpq_ns5vcK>{e)2`C6sa{+h7<i
zqjrxbV+!;T6cVdp`sVa<S7_-haj$+>2s_ZE&+N=&>$6k&7(pQU`egNw5b=j>xR+Ey
z(^Syd#ttS=?jn{#M60-|qKk@+1GKbRjm5WLQ|5DJAiiXRvgApCecnb|PHHo=eq?H%
zd&m`c4jX1oq19=^*xDS{ppi(=pS$ugU%^ebWus~P5Ug|4yloknjk6fNPtxuRMrl64
zu!&Q+S;2{yd`EC8`2v*XI*ML3SUOc1VDr!3HM{-e7f#_9Rs~C^=yEaTASO^Y;;_*`
z>6<tSGrNTbXef6KfPPm8iQehC;6=aywyerWuS~}eH<>fV3umTO%EFv+=^7U1DWF4J
zv*94nglxf8%t%+&tSd_aXsv^6C+qlELO-wtFT5QTO_U<W&s;G8A)!Gkg90V-sNe5W
zCx<rG^P>w#6H6&t*Uzo7soXu5g5$1{h*Iync>p7>D%c_%SY}UL11)F$6ZC730EsmH
z1BEOZ!7;&<yzI|sYik1W<hzl8R}|dh*5DCJN9!p^t<ijtB(Y5jNH|PMlmh!8XdHH2
z4`D-i)U8zf*)x(Sg2tORD<{phQjY+sE97W6RY1^}CWbk(%u2m!Fj;gSj~9IqQCL$K
zRvE=HcwmbcS=v*>>RNw}w;^O^y&-CNYi3GQiMOfmN8&ef80#V<pyYSD%Gf+KHLXvb
zyz+9*VN;9XBaw`W=sH6US2LJ`8w>LPZ8eZh0$H^!MXCRZ@RAYVY~_lm_YEux6(YG0
zS?3B6w({Q8mU}}`LnKd8xu7mxL+PYARbUK4<FDqzL<*@*8d=>rTGF|;^@DzrX;E5k
z2x|2>>3^G$k%rhlRBHk?sXa$HsrR_5Room(hX|l_(Z_Gas*KmnSK_o<=&J5>b0>sj
zE>C#rCdZILHe?Dt5&e(>MhW?PwhK6UO4Oe~sj^Cw>@4F^30(xB%v^!g?mf|y#P<P^
zrFWxC$=9Us3->Q^HG&)kjQ+oSFat<=pS2)mu!7bg;#Zwr+a%G()-A5lt&m<NX{Kjx
znne(-;a4oq;F~_Ww(y>t6Bodts24r7*{9w<05>U8fZ#x`%L(l|s%7Bo80C(T!((M{
z61!51V-P>7qEd2OT|&lBe944GuLO0WC8YI8jMVq-q7QVeluf7mn-Q+iGjZxP5xU4r
z&~Ylu1XYpdb#pWQn2BQjW84x?_=K&WT&$zKECSqSYWK+{DuM{g)tA*5c>0MU91#Q?
z{lpoGW<aHM9Y#y3*F~prs4U(rr7Svu5%HyC4luKfq;=1V*)e{W61z{|E{;!g@-0rC
z5jZVbogViBT%CV8wKuL#F4qL`IRwvkwCXF#VlHg=ls<JEA;~8LkXHZ5MX`2(H#DWI
z{Pl?`izd3rLkQoc)G-_s&(9ahP6GIsZsRH)|G8}-1Dy2sJ099`-Sejqk5&n@cC7+i
zXqMYhDQ_1MbAyNr4|Uj2#8upAVIebMBL9FK0X)b1w5?xb(YLJOH4Cf_d);Iv9i_Q>
z+XLm&Y=XInzWGII4(MntX&oYg)&W9F@NTy-Q^QOWO1kJ_BAoQ|`5M-1kwGUOUG_MN
zptf9$!>@yAEq_b&#7)3SOBC=-0B8VSdhJ648NkvpMHJ}2u3S-*uXw50vQ!W>Ulf(z
zxgiOBg{rv`EvjoJ)vX%qAh|F&6;!&p)-0b0ykj^2%tU#WDs_Hf+_M^JPhiD6zeh{F
zLb*Cv$zUY|d5?*&a6`m5wFn|!OuSroMSF>0E0&4MEHCDQftwEy=zT|g!Bv1^n%gSD
zr^*{i@+DcZBIA{|qRNH3Ai<ynxYi6EY+EyvS=6itsaEA)_^uaBFSBLX%40SyN{7>;
zi{=9?2ITAi+I>~(VhGO@t`D#-3nh!`U*>n18Yr4D_~l=eDwc#3xc3t}q)#nNQ5cPW
z(uY}D1xnYjXmuFCmS0c7hk70C8_x;%Nox1fPCSih_@%mf%7_8dFABVfKx`DsL5!BA
z?_=7Y2c3hU=p`1ht1$>8M6hrd_8+n(?b^7T;9M57rVbsu#>=b~b20yrb*y22J+lMY
zk}twlG7+Ju+<V8Poia<O%Lx_A<pGqo#+nQw;q?ni7t9!_2hOCWf2pDD<x?i2we>bM
zQzsgtAe?VkTduHH#Q2TjmpY+!!kd&vAX|O)i$_F&jc>hmCtlz_3m<kX*2b+{41=w1
zsp9uoFhv#TMeixQf(E5xt<dP;xI8D`TVLA0HW@vCt>Qf=v5Lp{HT2OX+dbX0a|@fY
z2=*xM0r-1y-z`*!Qtq`5ey{j$aeno_6<-OI-%~LzYz*0^JgTtr?h^V_r}Gob1cnh(
zYb5hH0Eqj<rGK{bhz#IR;CfkHEYc$oE!+^#7>iUv0M9NaTP(c-<>y6PlVVe)1aVkZ
zv2>|2x~Jo7cqlHfqa0(HBorlsda6k87At%Ce!H42^B&BxcfYGbm7}B1T&22F;nMQO
zbs>=S8Z#ppYoYz}c4el|K)s_?;)$PF1Sr+GL4fNAmDE=mK&CgyB>zL1_Y);O3aA3I
zG+!c>x8U^MLgMr>V-)QgMrhWBy_g&aQDY*ZiU5($HR}Pai)0n}Dbqf3$!tLGWk6BP
zYGIySvSJMbQzpi$gM2!e&KI#87{vo($mWpG0!%u19m70V6N~{g%fNbrPm99xmm&pk
zuNlI7;(Ikv8h_|`iW_QaUH9gOx7@r3IqGKODv^}>geMg=>&RV3Sl!xpk<Asp*3rV!
z+Vt-&;m^Ldf>^GlR~&muW>Q#u&%v{H=NFp_C6hw3Q>`3^@lj|#zG90ymDh2<>6$I7
z8aNN`i+LAby%oO?{+K_npGIH4UqC*)R~0Og<8%8-NteW~A6OtZN9~ecHzWM-Icfwj
zg%YR+RFb_iu`5-V9VcnpI2ngRg?=%2!HT*89ahBnsG=yts9HqW#}<03S%(SAj!2<r
ztaTZIvPPl~;}cG=6QRf=UpXXAuqG3pfZl#l<x;MyG|n_sAsZ@Qz#z32p35aZkbI~@
ze_6=I(!C}?mYQkciHCkheD4LYH1PE`m1fH`0ABn?R0G$_JR1`di7s=~eY%`=$Wz6x
zf>>95Lm_}IsS>IJ-*5uF7XYGE5u6Ele4yw}rAzhTi&Ud^0Ro<MX=jftq;Y80ZmaJM
zNSaP%Dt(}^1C-Ly3Sd#-r-1Xw=7C5ZXx_RF!d1!RRm-#vqpLnlZXVw2bnELUhS-_Y
z|0N0t5ybx&aJvx(IPU{X+t*+DrB;$=*UPlzF5@0LSHqW$#n7(<hsRmhP8vKUYMz*3
z23(*X7=-Hqdlje$V6a<4wmnvX6>sbb{C}8c2+2@=X%{R~y7VdnNG?=Ebbo<52vu77
zeEiwU_qe(WCTIss<;pVC=cPT(ob)5{Q*I9g`TrZli$2mCRGzr(iXnLMKS4F{9+jx1
zPy^ELsnWy-!c<`oSl?ZQE3O9BWF>Nx-Nkg7z7@jt87jr!FH<9Q7!N3-Yfk!gu+%L3
zEuIZFMxZJTRbS_7LbR?F-nyR*{$sBu3UtMAUw&Nm<#mnZ>!^tn>%M2>{L)tS7{ZFw
zKz~v|KXn0d$I=OD5&W^nAO7>luuSM~*~u;I-t=#e;17I0DNrDDKaxP4HS{&tm6=2k
z4nT<tI-G43NIhH3iAx)o@JQ-P!%vmxdSlL|U%hlvQ3hoL?Q$!+XssTgNRSl_rCmn_
zq{_K}f#F(6ba>3iATXZ&d(n#NUh<9cmomstE%A*Vkn-qX!d>>yqx3&=q?y&r{^5^&
z5C`!M9u_5SZslv?b(>P9bTH$Om)#UH8nu`MfDjFUt;kkH3l)p;LD3$qh$8Z3Y;>8H
z=Ab9EojygsK?NCm7jx6T&9C39HIrrr)1o5%yuN@*JU0yE>|wFcl&*;?mSZLg)N=+8
zOYar|p0p&s-Aci<#UYXvg^CXzu@Lo0C!FwxFWikkbYq$}fHn(1_=7TY5hrVOm;|Wy
z4!(4YD!IBsJ7KL@aMBtJMN83eGAcRV%74eF1>AeZQaHLO@79V%7we95e;r+<c!^&r
z1z?Idp#D0b_-|--Kbp-8U}=jYnkU?O<ugF=+>BwhV0i~=A>X{`GJ3)hof<w#JML+M
zG)Ud%Xpt1IU&7)4MwI@$k2t;VXv&q50e%l5_H`&J4W)D?+Epx4pjd~>NJ@i5u@4qS
z%c~bfoWLbU7xP)568C2whRdC6ZaX-sDwc|K@J=o)RocwqiQ_30hN^OT4yyZC3<)YW
zKpfn1Q;P!oAaWgJ^&5J=qVQbITIwG1WtrTu(vC#WXj&MTe(w4e&`-;^fADB%dsGu#
z*S`L958w~}3H@*y!B3J_qE6PB)4IB5uMV@BaUGTrJaG?!-(7kMJhU8#Y9X-JD`8>x
zU9tfdsl6*9L9dK)c<JWz2ZD`7=Xl5(6l=(+S*$=WM|@pTRerH-U)?KHo8j}uo*n;&
zGyItJCp_?D#{Xj|{r4T!1lyyXt%BV5A$+K}qm*n6W9@dvl+<N?zm0V{7!_h*dbntC
zDavxLk{NU`AyKok>`Dwl`{GnxL6o2#z=eWA*;qqEvb?@xi7clk6qNTCR|AEFgc_-@
zCP?CNZz=h{<F_=vev#D^86&=x{v?)uC;763ewz06J4Zdy_NZs3{=}yj@Q43fc_UsI
zg*O8%dE~7*#lyjxdjn-CR0aL*ee57y-qjZK>H+>Uiw$Tfy$OhuGxoMdQvs`}IwzH&
zf)I7=Rn+|kgjPLA2-ZWP{`>BIrs}NZyWBp_Wi(cPTEcz-{f&|VjNw=D`RQsOK<S@)
z+8KcU*1Ybs|A;X3MY@qJYe1nAlF}DVyer~or+_Gfhl*9-1_=UP)PHCdcA==er%EG@
zZ#vjiSRfLlYHfAyZs!FEC;CMMP?yGH-S>-{LO+RA^AxWNjLo0~J&*ula%-YkSHWiW
z60<p-FSBBN?O2!Notp7xZePg+w;}OA_Jn#YJkiOTN!Iu^e1w<aHWp8^sH}kPakMDd
ztF9RwHpF38Ua@Kk3->|{$4q}l#S=Pcbnhm5y5^QNAK_3-!AY5LD}=IX+(k98RRcoA
zId2^lw}ftCP5C%5LsUT7yur=q*V51Caqgaze2cV5^eo&P-#>LmU&711U;(fA&OtH%
zrv(A%Z{?5u(<8`*R~t^u91^gtVx7uzQUa9K1Oa5mlQv4&jt#D;mJT$FxJAJyR#9O+
zlhQCFb{KZ6orx$`A9mK}RXb1#RrACSPXPmKI8jDBMUen23}qALbB11OBYWQ64#u`X
z+O&-NxiT;|wpT+K^wCed3MiQ1wV%2kZ|u4>B7R_@%CbZ$s46NZnTP;QgA}m}D`Zqu
zMWmvNBVO&JD=AwjB8z512JRcuPUJM7vG1C+tv3MqZz~8ZeAtrnDl#5<WK+4gfc90)
zzG0IuxfiyIH!&gJ(%7qvYt~?qzr;=ZDkp;CMXy8Xzy8V4GKDAkM<{^17vgp<>pW3J
z_6jb~eVarmT`Vpsv6rB0eFZn+gBKp_VA__BRy2v@>x#RT$Ov6!SNWisN<4BIERPT;
zF*T1;#@2sLL2Qv1ab@mI`VHY-gfA^%KStH8KmaRPWvW+}g`N-KzgIs|=zmHGKz|dj
zzM+LT_EUI+EzhM{1NV(4(_5L%SfxIjm=r+{H`^hoc+qk3t`5Bh#k~V=eTy)@UZ4tu
zdvA#gwEWkPNSJnW6}j!Acp-7^by(cKumzb1Q_Ln}xoqjA-pqPU3M*e4f@g(}r?E3*
z7@#U6zAW?nF4Wt?e}4+XY~K@V!|{|logouEfH(MV&$U_B4EDxb@YZXgyKKRtEM^`_
zrpiS)Rlj!AtS&Hw-<VpZRnN=?N(Q-AKvTE$Z5VdeE?um{>u}4Tg^fe*fl${2gL*SL
z2FE}oW-N?#@AQ4`*eyf+GT8&~M&dv4MD_mDq5>Eb+%Wg$pP9t_xt4dO5^TPjY0G8&
z+&-#=+%(cRezqu;sAf*Ot_!=?z-|#X4(h`-D?QginYgzp@}7c+W^&UdG?m=uD?6b&
zZ>=)xr=pz%D@SJwXcSYiq$j>CAUtshP`Gst2?~QR^8ui=gnbj|FNqHX`!D*)4NsMR
zPniKM6a4*0=e}~)W_;@3D(9fdGMgpJELAT0=6#jhE)B}n5%79?V7+;&IrFf327=k&
zx;FA`>;Fp?F*o0b1P>-%tV+4bqHJnP5QG{8th@rr8@RHl!3V4IgeYS5#?Mc!C0`J_
z@b$}Mvo9uj$U5Tx5gL6TeX@H0X=eb#1h4wL56pk%s#SP{?<u-f;MQj|Q@!yb^FA_y
zG!rJNX2Gm7>I+VwT8e$dKV6-v93+&0!8XGCV>|kAXfB6|F$ps*MF9=B00wjERM;dP
zbPeG(@Cclnxhso_t-=v6N&J=;1srJ>O1~w3TA)Li;9+?d0E+W};OQX#)5-uYYj`!@
zBr<`#Qp8i12@3lzYGw9)vnexc*47*P0uEr)tbBz~r2z;B_xN}+nw7jPLokn?>HrTd
z*=6miN$8SmwQAiy5xS#+x)H%lN5LmZCbF>bi@3Zg++>i?U_XX`{(j*dMAN$5@85{~
zt0Nmu9d{Mr|3<F(MBcjP=ih=i{TFzn@A3~J-K^DI_Uu0CK_8ib7$Qd|kfaJwB`C$~
z_mn|~FdL@_CzguT?_kF8z_Ow#&B|dL8Uj`h3m0Dyz%O6gF`?9JCglPkuytgx#roa{
zdeTzbxzzi_P9kGBuatZu{w3GsPZ#l@b_Sro;g|h2-Qc^IZvMIbI4Hl(8K9ros26qN
zwv2!qF#!^v7(p3EP<C(X4{a3B7jyz+1QFHY@$Q~+r4f%0&_*lUP_|^TSQvvvDjh)!
zV^#`Qn$C2*5CJ@wM0dfR#2Ro(S|k15z$=Jf7IVt5rq3HVA41sY8NLMSSJOTI3{axM
zb-&ZP<(>QSA+C`=zm0_NJ9j2e`p5_<{e%EHZ7C8TZ3CGX44~Yc1gi#AB|mR#4m8wu
zajGrIv`ljD8BG|va}jnSCr}%^m0AStRDpHY6uuLOh&Nd@W-5tS26vK*^t<DvB)m+L
zg7_jx=}NZ91N<@)|0BnO_{Wq1EE;^`BkiyK{C+g}{uUo_*yOl#f_;*DJ3xjJi14_n
zKE76cqYm;sWCCBNtzF4CKwRh%*4^nSMCS`k2|B2c--^)$Hf91&Tuahu+pLoGCcfuh
zVpkTCERP|*CGHwoapD&)o~hfj&z2_kIAu0~WD=hwzM+$>gZvim-+_>S<FO*Xt(DZr
zzPoql)^|S_3Hcc$=qZM<hQNIb{e0iIYM?xaqk&?KplT|8qIrw)gbQWcvr)IQ`9%fa
zxP8uaB0KLnBX$Lm%r&BHCax)^G;Qi6mwr#ENY|JCy(27xcD^sqk)_m!9lX5MZ^z>|
zBJuA&mc)O?7=Zq|U;l+wNW@Plsx367+PSg*Rlxw|F(-a46L=$0>k2afE4_xOpAWUB
zqdtYLj)I-rmY|ypShJyNLKe-`GC(tn7$A{BnN}_FWyt`c3UJ5FrQ>?OM(XMB^LYGD
zB>oh0^8_5DWeJ`!24IZv9wgw0aU1qVUtV|tO!^hytBPIV4MRTh6C!Vc7ilV27ETjG
zP0zx<vU}wgiJ)GDrX_7sbS6!tRRe{=7wLPWCRmV%qd@td3=O<M;saezkpF8)_>V;@
zI)|sW%)qmY0qC#yjrW|6`uJKT<SR?p&k>kOd?5WbZekHU()C7ST)R)_m<E-7+ohC_
z{VFF!{LJ+tw8u%&h|v=+aPyML@MEr@l(J&g%c8AI=y5o2<t7u_z2urlBI5UtH7$+{
z129Io5*gvcNW_hb>Guj#M3P@&f?{g7T807qY#xgQ)V0+2>@}mESje}HDRJ)*ppN(=
zB5;-1HG~II2lsoN)W?RNhG%Fcn&Zj<^w<C9d&iJ?zl+5C4J1%ffp^CkvHlNQwnPX3
z%b<Xn8pfuBD;GHO(w?|3rKy4NQffIP6m|eJ2m>`CL<sdzA$*R<e}elDBJugcVw9xp
zK9l2rycnRI<LL&aciS(Xi}&)|xV?=VcOju`h^}<43J5#_W(Q~}msa!HV;|MCy^f`A
zz$_By=Q{(CLAYc!_=WGz;GJ(A>fQ6+-~u}juzSp)TrU#-D=+{Xk8lcZ|F-v@g(UhP
zGzS5R+pq*v!9)x{Vbpi{4(kZ{>uM~3*Y?@$u_(HKgYR?fJ8ru!+-0Ln5ya*TXs?lU
zX51Ou*Abqwcn`7gwO?bpd)x?cyj6gAbMQ}vs^NVbafE&gN%eDhk7E^|e}KWK*=!>{
zsJ&}Zx)!H(MUVriNOO&Zmqdp;X(xEU&JlhOBfMWexN|Hm{2vMiU^)L<M#yh}A7yLb
zfM>iN_pb~BK5=(2Mr~a)Be%Yu!>=Y*PRsW57DeSaCU%wR%&Mm%&Cep?7Z~9)XXJG}
z@*Vf_f3`3H8zj3tj}R3XD8K#cjgArCj{9>#Lj~&N37Hy}k+Gtin5b6v_~cUb8lpxN
z>=_<#M8BR(yL+Y~2RrRp<^7jufFt}3G>-Hgzl6+SCaAm;_gCOMn}fM~dSL6NNc-?L
zmAPtQpG5?BM5m^Ux8n9Cv%ln;JvDijhP(gvvvq)<?F;}c_wA!%wU)B}*85Mv-Q~Dl
zjAC^<?&<ZpM|wID=Zou6ilm#?*`YwqcW}E63BJANRD$=WPk|f{tNuSL1H_V*I>|b+
z_5AH$z5xF{9iMZpPf`+N3@92QLi-ZyLx$j&Tyvyp)<aNcRsCAeKQw<oj0_O}HCXg4
zKgI;eqTlO1o8kSx3Io(3L;?`3@UB>R)hAc@+#kRB?<G)Fg;@KOZN2|YgZ2Lf7yxxt
VI{!^gn6Ll<002ovPDHLkV1mSH=T!gz

literal 0
HcwPel00001

diff --git a/guiserver/images/newLISP16.png b/guiserver/images/newLISP16.png
new file mode 100644
index 0000000000000000000000000000000000000000..f516c55af9a62924cfd633d52e9109e1e1ef5899
GIT binary patch
literal 3586
zcwPYl4*l_oP)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C10P95K~#9!T$4>`TvZr`pYNP|Co_|oNv1JlW|}4?HX*bY
zVnh@pv{(pAE9$NaC4xV=5G;a-bmKz1DdM82JC!UHyODwmv8$>i6c<Ge5ks4yCYA)7
z=`?rd&b@Q*Imbn8sJ_eZ{o&g@;x10{UpYXJJJB<UJ^(1Nb(~ogXO_WPklnO*Z_%Mg
ztje8pqMvup`hxxU?t{u&!ClfWdP{6~`R<79exUuMiSxfQaeGK?8%ROij%NWhPUZ0P
z<(Bq&g(&zMCp!a9yzz~#<Vx1vE|>c(U8}K55G`meB(cTA;frDAM#A4wC4Kl{;Ye1(
z1%(o#C_a1Yz2)+;)9ZYGF{EP@*^*C;;%38=>+@-b!rA$N*|#@2`Tmku-%QToX*`p<
zk#5*H@z~)WKKQo9tMd&$`99#xO9Ny}nr|)#Ob=%`f1$zkz>)`^K9nJ^TaTlvkLc6K
z3r~fe&dEn7bNC2rTZU`541fL6VreC0c{O3}Mocpi#w#Ar&E$FgnF0d^jVg_;ctMyv
z5y!%*^SAi@W{NeAu5-A8=J3G+M@xzyuC!TO>k_4k3qKi_)?+?;t(Stxgl8n<TNg7~
z^I2X`i4vHo`pi8$z}TQi6kDby3#@*+$uEC)@f18@H0{Jgdp%m}pFK3!y1ns*635z>
zqY*krD;W+9XZY=UOk>;d<aC~mt(2cvIw&mTRn73eQEFpTXFNY!T6Fr3jiQzs9?*;p
zX+#N8$IuE5sda3(3>od1ne3sPq!{OsD^<{5W<mAj`&J6&>ZQbLf{vxxHf*<d%28zL
z#+G)+5QK(iE2R|)+0qcDJwv}D@}u%HS;~WZ-|erAL<XNIwuG^z9a%cDB}pCajv<T;
zU85)s)ToV4lIh96gLB5~-%|vUtNrB%U##9gIA5>V3(aPeZfXfS1}8%5G=8qgeU%!u
zefv$WxA-Q`eTNA0@`;IE2D91TLvyoxKi)qmM}qBu#+?Y`gyCvG#ZsAKvG1z#yf<)e
z;Vy#mKbCo6c0#`V@c6V1;$z?@L_~?wt00%bE#h2yZ~mVF0PQMugu(f!aR2}S07*qo
IM6N<$f-z;`>Hq)$

literal 0
HcwPel00001

diff --git a/guiserver/images/newLISP20.png b/guiserver/images/newLISP20.png
new file mode 100644
index 0000000000000000000000000000000000000000..af144d70dc3538042e4a32e5626df6e5f959971f
GIT binary patch
literal 3885
zcwPZ557O|7P)<h;3K|Lk000e1NJLTq000yK000yS1^@s6jfou%00009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C1WHLnK~#9!Y?NDwl~okSe|vxXyPWTwGc#w-j5FgUCWRaw
z6Dfj;2^mB2!G?^2vLp#2h@yIkilmnydQqsCK*&hCQNC!D7zjF~7*aIgc*&GdnHrso
zb3Nbfe0%lKOiAO0^|sf4{T|l(DLK4>#ZLg`2)YZUyFsr73`#B``H&Jj1d@VU)M>a=
zoN~8W<-Z}?^n!90f5?B;l766V@+C<9_F(lt!eXWh`$W6Xkf&fHuo+0U01e6m?Sm<x
zv_4_-*_}$V;f2uK2vxc6gx}^_(kHc1l#M}y(hAf(ffXd51rY>;DOCDYx#bw?%vQ4a
z8YuKaTx5fN<A06z$?Pz`6NBR*#zl-lT!Zoq))>SXFouF}xj8({k)!9ku1|ztr@7;T
zpizKv`%nEcyrcKUOYC}goMS&F;Ajd(2aHA>MJ)x#)fCExTr~T?o8ytU$LZhmCm$cW
z*ps^rub>o0L_2d+lW#V9v&?#$gTJQ?>>cHyH8bpbw23Vn8@N22a_IOp&-XX+!@x9O
zd_TpR>nR#&a~0Kajyy|V!!LZL;)C72<Ktr|Jy-MNP|EJlr?@m)CkF!Ht<51xgUj*3
zh?Sw@*ib?ZXw=ZrVtA}CWP49QM@I+6>Z%=PVrp(fJr_iTN`u4p-Xa6%Vs1>-nI6v>
zzFOnlj3V$HnnTU{l|I&iYEiSM)1!BdPqm~;(~JPU&Lo+v3tY`Nry^cGFtupqyyXGg
zRupM2DMqi?*mtHzFuxv01|#+yhP}@<^7tkVqS}mAu3Jk}?rJgI)$DL>A_qVN53djD
z-_ndPFg=^I<$*S?OpkG3VCLU}%>~V5O-QYac3j6OQ#c>hYOG%7^2tk8PXCrNGG*y(
zbLm+dvU-Kb*~>9=HA~smyz_LG2UiE2ybuw%&~uN+`c5CmE1})srg6ODpg6On$sFw!
zhbMYNl+w6HV~iq8EJ-Gaf;i4G2wU$fu(8`G%W{+wTtCDwR&ZSJg7N&)X}_2bMp3k(
zo>&}5;b_QmL1&7<gQ%91WkMWV^4yZ=g0(_!1wm6Pwh)%9V_G{WwHp+pa;5!4FKi;q
z6-fqhCPax4#X>F4Niw0H2~lE+Vj)h2IJG31!VfD{maM=F3j0O4q8-;K2+N<gcHDh5
zC^k{IiZm0_Oh__IoLbVlkXuWfSmNxT%B&_RS7=?fiiW0^^9udG0*vSR05mnX?s7eU
zU}X4e*W|5nvMgQjA~Ur*xj<6Sv7#`pM?+(k_T`;4x3rCG$2^6|6o5(U^R7W|nxJ9x
z($2M?wX}|H8X37k9MwSTl!}^6APCC@g(8iWD$Ug;l*)}mO6#4#*##r1r7huq-W0)c
z3(oFm?|u1&{#CC}OinM)l7w`gtf3SVghhg&aLX~~Bj7zmqT3Ha-O1SZceV2KfhXI<
v$|e!%25DC)t+XCPsf)k~ME<x_@81Ie<~ZxJ8ko`t00000NkvXXu0mjfAsuZf

literal 0
HcwPel00001

diff --git a/guiserver/images/newLISP32.png b/guiserver/images/newLISP32.png
new file mode 100644
index 0000000000000000000000000000000000000000..94c1107ffe2d779b2b52c4b596c44c7e8d1429d3
GIT binary patch
literal 2657
zcwPZv3ZC_eP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU*^GQTORCwBq
zS6gfx)fxU~=FEN9d$HGd=SGMrfrJ1Rfq+UOZ34m+XeD^+LscLZm1rN@KJ~3q5l<DU
zD9{R3Rr>%9G>DrJx2RAqZKY61Q=_CI!FJ;KvTJ+2JG*l`{m!hN1PEzY9-W=_ob!MG
z_kaIoG<o=YxWGq)rfJaiG`ovq6H&Nc#_>hG1~n-Q>Sw8Gi<&S`YNj{}(>xAcMEsS1
zQsb39@?{3Z1&!;v%r>`zwP~YyrwoEy5Vg0;H10*3YG=>oSKW}BE@oiaA83yAvhMr)
z;n*jL4xMMu4?;UH10Am=!mykyEbd9`3wsbYMj%5T6Z3&&<-BtMK<8p`HTl&B?A(N&
zE9^B2`Mt12l_1Uw;fnw?<&BQCUcWw`J^d@$s9uG%$=~D5pr+~B|Do11er0si(}auq
zuKs5MMh<$e@(<C|{UgnD{+c}_<pn~J88?vBs`o@EKY2{HswHR<Z7HKB9W;6NDgdo>
zeI7tUPm_pigPLg|jh3!X+QIW?|L_ltyz^A&+4BKV-WUS${M<d^r-z@E;ex9f${0Nn
z%DA9$QfwFmv|@bqv*MY|SV>n_gV72hqdK&uW2IO|Pioo*=n4dZu7WrVfZj#5+Vyhk
z(4(Hd=q8?pC^3=h%CN``XV)19R#C4okSYKwS<*A&SKA!NfSwXa>x73n@n~vnnABZ^
z;YiN`z=P9Ps~AljerRrDre~@u&|8rhStDRO7TPg2p#(-oR5;`r22_^H&RLqw?v-)1
zy2`LLaP;UhUVFEJ@e@tle05m4ai{aJH9UNq?PxUxT6AKmBR+lX{&w}$j)$HO@a(%S
zZ0Z)c>B<~#-_?UHTMH1jKs!?U*Um6t+6IKBBV3M=#7PFw=DlHSn3-tc_kW(jQ?Jb9
zKeYrk!us%36&u%oa^1#KaSy!0FI7ef72kNVI?|dxes7fOm{<l*^WmBK7~`)l;FWjk
zxMgQI?!KcRn@01{Oatw<q+IyybPNCd*CMuGQAB^AozcHM-^PJA=J5C*PvVVZ0aRi-
zD^wd~Zf>!Tb+wuAo5lPeVCoY><!5VlYAje@zR2-C+_~MuTjOmkMyx;FbhwdV{J9yt
z_|5`$U0=qxZtcV6TT2i<Hr{yt6rO(hG%mlah!c|mUOzC47havk-^UxMB@$gLhU>i6
z<#k-M*+I_J5H%Jzh-zcZ@N<tDKfix-Zu$6;pG84)REcfPfDM=4eQ>0WCB`;X6`0pV
zGr?cRmvP|Dd9-HQ=r7yY_vRc99jzmnZQ+r<$MKuj<}f}Rf&`sWw{l{rC~)fyIo!O>
z!J2M{&9oTBT#DFw-uUq?-j<*?_h8DpuF}V4tgpJn!&-VcJ)fXSCWN8E$SNw3qv8gg
zIu8AN7JquXj#Kjy+$ce%hkHq}NfDYtLxEZt>b9_T)Wg_~1?=4BVnan|QAAdxgp>CS
z(|TRhCqLaJkqk*zFGH!C=qKl5<O(KsZ!h4Z;{i_3MwnlUurL=P$Fkt(fraHZ(A02g
zMPPKj!5&3zL;{7PgyZS(9UYZ|z;Lg?#sPyY80hj+G+RmLNt&iZ6#ph64Rbi5`b;6Q
z+>-dkzAE;;+r(m!!ZJ0LDQtp-s0y4)_eh0BL(lp$zGl)04;~#1@YY+4c>N;^jx2b#
z@>K1WP#FuJ)88YoXLk-eF10#!OEnKo9~P<9O9^RH8&6de?EhO6v-Kp4Ul@O}d-%Qq
zv#$qNY^k7JYQSd5wq7=fh2|-|ba)!4iP8!>`;(PDYW=txXZ>wMe+k0_dZ(vAE9sI2
zCMAGon4-JOz|PIim-gpMUf||yd$4_51=n4cM|X~3sEOfj8)M%X!gt5|K<6{zhAW0w
zK{ymqKiOJpsbn=ey@jP+u-4a9!i8Z>+9dAV-Gz}}3kMDb_+&Oln;!WT)H>$*4ObMf
zV_N}VS?3~8OJOTTz?e!Fp}vy9{dWyuplssV1M?W4Y9XM2T}#8diivA4v9W#BMA2vM
zV}H>Nl?kFIG{c%?bxGqi)Dvzf=M8*&hmY$vd-!yog@vxD%;;lQjPyC^>sDz>58JGM
zQJVFYu$@3Kumy_muCI4v>qRa;VhNtEh445Y43_Btv!uepkoW1iaM>s9lx2NV5Xr~9
znUbwwBqg1!?4UiY?=`Tt&&qm$E)2%nWSJ#;5*US2jUQP<Q!Rq%5v!g+wrs}v;voye
z<vfBQVu_BaK?<5vozAka2^*&4t6DIn$>?KYnD)4^{euV^BT3YT0--S_)fi|nZYmS9
zjY+~Vbp{gMP$|o-X~ZOt%}D_unuMt$`J5yzrk1cL5EPwBR2C7OWJ~ufAC{AY5cWaM
zE{>A{yJ0!{OTud09)=twQUxGYZ9Pjpjd`fls~hw{%>v4}niJSJ+AZpaT&R7D5(OYl
zIzvfH5b4UA4JqW#bX_=pkxY`+^5&PY{_cj**^CTfzUbylM_cXI#;6@+(p7CXRi$qQ
zfR-2;2*rQ`kTTCZ#X)J{ECAUlGM!c3%g!ulTGWnTf|oDDH1wmeOE1Fd1sPBsS)cTB
zr6<C6`{AW{4iQ6<&3~%vGDXu=QO`!4sQ#ZKQ8OdIw^)J=W==#wYPu>`GMfoywx-!W
z<+-4fZmxuUsTZ#6ab|UXizJ*xV}fN~Se=<fn2&dr`^MrpxuL#T>ww5AS(*(WYEaGw
z9;E>Vf&i4qYV3}g!b*(UtrGG%!>8c+bPk1bKXSg$8Nz*A+jQ?<6fb3oZ4!VXRwwZ#
zKiBnBI{qAu^wyUMqTNQUG?B5<nRG})CQ3DvWS;W>agt;}(iH|)CwoPEuB(VrPd|G^
zSq&>Q+R!(Dg6=C9J6<~~1jf0q1MlSv-49R~zhidziivis$zBj;DYiOEs=<QUh51FM
z7zdP?S)eqK*(O6m2+o2Yjh9gDuAr-{z)Bc4^ub*ZV9lNHeP%3QW#B9beP2G`B`sk*
z;ks^lX=w>TbD2VGWn)*SYIK^D`lMN7(K{K!dBU<OHZO-fJ@2B|zH6z*RMiG{-G{Z`
zdFBhRW-@Ag<_G13E}Uold}+eAokx7nxuy{mSyTeD5wHk_ofISWH+|KH3Xqqhx4uo|
zZf4x~bMRb;1&yPdoqHd{yC1~xZSQy9oIdv+6dv3EIr9YI4M2CwK(vrcre50<&3^d9
zu+><rx?`k@PSQy=74w9zeU5FBa(Zf+^j6OX62tB~p_RA%8Ur`&Mb~KkOJ6{xl(^t0
zVf(6m*q6>9ydzyWGM2Wg+hpA8r`q)ltjZ2ug+Oqq@TN7l?;r}BUO;)<ej1+6a`{4U
z!2c7#xu5nt`}Wi@g6WG{e}_1o<U0oRI)rx;-ry0qgOf1x>HmA=e+3u-d?<#LHet#2
P00000NkvXXu0mjfq6-oj

literal 0
HcwPel00001

diff --git a/guiserver/images/newLISP64.png b/guiserver/images/newLISP64.png
new file mode 100644
index 0000000000000000000000000000000000000000..a35dc8fb73bd2b75e57b8ae9a288a937969c3fba
GIT binary patch
literal 7154
zcwPbW8x7=%P)<h;3K|Lk000e1NJLTq002M$002M;1^@s6s%dfF00004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBV2gh@m}RCwC7
zTM3L^)p`EUx!Zeh-t6Ob7%v!On}7ph3x?oQLP^pPH6$geqGkb+R^60VYE?B&D>ZGU
zMwJ@1l?qJ=RYD@v2xU=J5-3YBi!mi(bHErc#MmBt#<RY8+r9Uke*Zb=E;BY@3>oRp
zz3;xeod5f`@BhzvLTgR*;w^Lrf5L4`kBiSjC~S#6gH!yjB=$(@3cd|+HgMPTH8HMf
zksqY_wfv{Gk4?Jkl-p~!Ej@l~e_QS#pU&)0oMMwsP>ro?#Y!M-I;vXDb0|$VVVJ9R
ztGO1(gCt}RKKGcx3u-~g1@gQpQLX(F_aDab9$BsJ#eSSTKY1N6%7UK}2=5#KQt}{E
z2uHfz-Uvaj*6r3dog|k~ny!P^`$*zaA)TqDCyzW$`CfZ0#hjA<K@s>*iAwD;0P~25
zqJ02_f$+>`K@jc{>P$fJ-=^S@MzYDK6n8?^n18=sn7>hX;%l{18-(<%=}TC;=ai=P
z>nO}U(ho9k>Vx%c)$Pt!)oR}&W@ld!QTU+fsox`edLN>|?;2}ht0;hY%a-7uq43iB
zx9n0Jduo2>gKB>6X5EcHjB^!&;KGNcDp-SxvB#!)gVvS82vy0Q-J^xHUc`Ih8_)y;
z$9rPS*XQU~`y6VwKdt8He<XW*zai_rKOx@$k-3Im5+{Bo07#fSOG9dY_JVY3>I=Hl
z`4rAYM&r7JaMp&bZ7Vzr&0`T%C`pKupU#${-MF*($AB0hLRe4*#}x*rqB`A=tImlV
zWTW|QZ*btNqE>s}xR)~4Am2)0^xv}fA-s;`Fg-ExduqP%r#QFXC@yJ0)&=-+2X9WD
zoS8;FC%Y^GpqD(p1b{i_4a!t)ctVpz%+G;E_*H;W#}-AZ-M(2Lo45wn@GstA|83-Z
zu>*ll*CkE|0GXrec?nE?O)@d@Wz~&8Em%+tj#zlbf+L`_6-eI*sg0)yE3go6YynFF
zP}*96us~>b9fjo5Y2)@e08k?e`*2Ndy_%c<SJmlU;tvh}wWw7O!OgtWwFLjPG|#Ec
z^HMcCv$cEd_-&MQuONlY70+Uz9h1jwz(Y)u(rMlbtxLycHxMNdwAM>p0h=sY0pG(W
z&Tfv+N&)zI4pz|sljsEyg9MNJw4R*V=nsqEm-WhX0FX0<cr#1z-_+!-xu(g~iK~*y
z$^X>d<`zmIc(P!gxL9x-%#6@7OA;=?Wx_kbwI~TJ<YFt(h44lOXy4qYRF)zOAUZPu
z0#+CeA^Hto5ucd7+gItWUcK@do-18&RA*uVc8JhC0^L>J@$tK;JHM8a85`BvuVp!M
z18^a%_NCLhbZ#IWo}y&_r_zgd!4i9&1x4*HW-xLKQue%io=)K!t#K%&g|Aj@i6`kU
zjO0_Yul6{lIdM7z7hvIMXJPi^U(>A<YmMg3OT9e6X<;oO|D0KZEV%&y5V`M*lSy;t
z`-TFOi6w=E78ISifwIDDQCwnm41m}gQZVY;>UHsqe~0h+H+i+-dANgoD=tuIe!j7)
zefZFAs&Q<yPz!GGUSZ0@YPam?#_EJMQ(*uS1`xeS`{LyBWImys!1yfK5?Ejc(;OG1
zTdT}<v_T*@6u72nzQz``87cF2jNwLE1)Ww}oC*YaN&qAxP@IIFqp$r#GI#U}>+h^x
z-<iAhb92tQfM%*EJqL!jC>ChxuFqnFa6r22if0zr<^eSS>^6P}6)u;JL4tUNp`>cX
zr>Y;5>>j1GF>ysa)A>h}8a;8E7Qhi77_`Ta-W*T8_F1W$6h^q;vja%+vJ_w%t6DU$
z>{yiCKrGGxZorE}KsgwQB?TUD43cAy256TdRK}c9R^oHJsp-|D3B7tKHeYR8pVHv)
zQBpGcY)346ih9I<^!0{3aQ#LA07_3KGt=j`$M^pgr3*p>@x2FQ+V{)ExZj$w3awrd
zQs1C&wPS)@27)Mo-~wW1`eJbqJV_n8M20dhq)M^DSfH};56|`S`Upyynd#7@&o}7D
zI~(-W-ZmXMo}jcOx^h!QfATR!n>HN*T?xO`>ehEuYyJy?6pLQI7yv01_`GZ$+WQx(
zH8obP2K4C9y7c$oo~46$aEKenhCJFd7SY99YqagsK00fxW~@VJ&gpzUGwDodv4{(t
zDhm`AplQi9#&V40uzUeCm$Wd~rH3A!rMvH+qQ`f)Xeu^NXzYul)%SOI=$z3eEnhK@
zs%m`IK+lH1luCYvJaF^Z2f(Aw#GzmBP9Oag3#F8xA3xKgM~)>lWQ~!grc&BH)uacX
zZPL~q^K{)+19a840U8~v0titGklCTN0=>ur3Lre+QjIiLF0d5{<Xk}*j!6+*QDXeh
z?QYPWKR8a`du-MS4r1&Y3*1$)<3!a!Gjj<YnN9%O998QlJ}x>v-=sj?S2h8^l=49C
zT0v|4z#nOqRLBphn}XHj+L~+KbX@DkbJhGW4tC%k$LN1CkPlopLfhXrNGq0CY~-gU
zW-m`>gOx~9(n)EdrO1OXds!zaGgHTZd=79J>BK~v?)lMi`qmF8=!FxpxuoBXEpfst
zx3A$o4_{2r$28KHP|}=^;<>>;jH>+)lLT?lCs}}C?OzekPhBrO-w4icf7fV8Rnepd
zK1Vp!b;9#Y`7_8UJ$j%`&wl+dJ^Iuv{nm$;)1?;=(7<45?l(#`CcM}Ud<gk}&&|+n
z|9zN75WWB4=5^*CX#hrK!S?~qdjRCbREKswJxkyG{y6P;u3_Ha=f-lXz8HVMV!)$*
zxND-aTB3_&HuD>PtG><al@DjE($7p^#~o@NKm19hbVb6HIRG&T7jB8@JsU&1|K)C8
z#WTWlOL}3mc+vm-e4c*3w?!9UG(}gw2d;7XAgx|qHN64*J}bP588~t0_m0q=_f690
zt{tH^UN+xMslUggYRxm2vG<h)dg$>fdSKTy{Q_oxBDOiC;)In>5iCU83C`!1!L2Sh
zJEZ=8k7~Fe@R(VGI(HW;$^616Wu@<76PF4ABx;N4v3OzrLndGAf|Cpa$<MvNk0xej
z>6znkUSf3|2!V5nsx!kQjfD2^n5Lg#+qPwbwqHF&*IYe9qigCmM%Y4+!oVXx3aAf*
zz52a_G}F=$99r!vdi0qYdSJ&S?bwBP9%`BQ^*X`ZCCw`*a8f$%hbx_TZbWCV3u(Ad
z0#ISx$67%`X=~ww@pNqr02~T)03dN^dUAWx?W~pXeeKL&nvH1lhKN3QeIMO%?;P!(
zjC0g^AWdflsoS^RcYOZGFE;1_Y}+21q?<mniZ0(aOe<E_r~={lzuKT(yXUBjm%VnZ
zL+g;YpM1JOkL@@?5AB?$L-UDwj^|vBhtzWKj7pl1Oa4EEH2<!1E3|oIM5DtVtseAf
zpeBt4nBs{OK+;*GyPfSMqq}k!zzJ$kPhOL0-}tM`zacbKiv(SAe$|})&QE6PIaosC
z219O;GbLK@mHd)Xe)8oe9sTG1^zN;bwEg;JbOXS6<jHB;wWndOyKlz??b|a?kL{YH
zd6<5;bg$=x>pE~Vm-8LyO?U0;K99~nw@T~QhO}l_(%NMnt>~B36WQ*(ae>r=Kq~n)
zA^ie?q}3cqy4_1{Akld{%2ImdT_8JvPZyq#oDYA#=b<@z{9ro|pXri9A}$@Xt6)5|
zW~HXt$yxf|U9+_7nOWL9mE`yQY)^}3Uv3dxmd+b9A&GVzB$~%}15WdC$r3V)<8ys5
zc_wCCHdbhKWk9P3qyb>{Aj}_r>3i1K6=IHH3own9_;R5HKYGRhF!kcI8&#aFH}O}~
z;yDfuTJVE<WCPgN^J>)77t+|%^Yrw-79B=9;sC}$PB|i%rOK)+3R$S%yq;+JDnWD8
zlJ0wCg7zOMUa|S?8eMx)4^@#Chn7L$c@XX=TXf)Pmlm3e+IVmP4Tj()$_YKtAJEW{
zPb-%NG&17T5YStNZ4`npM{ewkm?EpZjUc2gv6V9Wbsz^D@u;T^0CBUq8K>)P`dI*U
zWx1(~_#r&F9{5vVkEGt7fL5%C=n4$*Ah!911k5a<nOQ}%h}0=E%FKAo?L4Z(SrORj
zXU_wG*AVD>G*b+UV`t)cc9<xdYkAa+J(>oMtM!C*-g`n?3m_Uz=78V{@Z&C!jlqt3
zF_r<Cd|%z8o{E5`1&tusjr7{%$WylV(YD)UXq2)WKMjPdj`Le`0ASbaRnjf>?2DA;
zBL+l3e7cd+&-b@z?=c(h+PHiY+L>u<T3ASF28?R~$4xLgh5a!I*a7kpKsdOM=-f%T
z0ko?_MdK|*=w1XT@R7BvJ@Vp&I!DG085*AubR1UF!Lg`#ro!uI;K31?0uR(!vv^J`
z#TXO?5I9LdsNkA$1Pk^xRRBr~t4z`*jN8>01`y$`FM^<^(X0zq+@LAKLl1%m|6u1F
z?c4)0vcE$MU7gp_>NGm49OlMg1=}tp+PE1SL{8dsVvyPkl6LN#qT#dZv|)XXRz?%B
zgf_s^baYbD9&R_n%YElkh9EIH;vy(-oH(Wk3kv~G1wakfC0(_pLN{Ddqd|bIQf(%a
zvI4U7w>k#^o-(3~UWCzb2-}>33I5G@rs=-t+b0QjI>KjvuxO+|M4WC&$LD(~s#a+w
z0@W+~1FH80Gzt*B1iT=grLnVTY2|B*e$goAx&pUnR;Rn14Rrop)+6b1teCRzd*G!u
zy>g^Ww|=mfmLVvH9E;#Oo)%@sI8rb{E$ZAb(YgqJ9-`Ob$u2$dN{8O=AJ+y47Wxo?
zYVh3(tskuz7kFmChu;RYW+b3a*QZvehLX2NqGt+GzGZ}KI_*c!5<>UP1$P{}^TLs_
zz!9{&o@~-t-~u;p?=giEyYgc0D(Zy`kchO+{P|y;+M1+}fHU7p&scbV)vB=`(zRY1
zT^7;0RS}(q09wIFIks>R8|n8=bXLlz>7F4v?|ek3ed7Qv&ACNZgJkOHmIzSlEWs<)
z1AIK)P&6^8NFw1?D^#@cY)ulC0WjLvN?0C%?>h))BcQ<_d3S|w|LMXR3D3dmvJExb
zx}}fSLh$w2Mo}#e4+Mskn0($%4cX%2sEUBsTa{G1V#ws}+kbeRjx{a#aY^tp|45g7
z&ZquIJiN!FIb@OHUUr$R#a3#=WdI-|c35ha$A4{lh+Gui@ZLI7lctAWY}3TT>3jZ2
z)uRhHLio+SASxAF2d%GJ9$`>EqO_!LM;lGV9oq+xD3Br`Rsk5u4|L785u=#9@1LN(
zC*qU3w)%BJ7qkw-U$iNr-d<!F)2$PE>t5uW=oA(pWWzQX%X5>q3p;><;<vZgY2#TT
zC~b#!AMVoRY)bL#w39hUuUj6X8tb94v#PXw82KE+k1Y!km3?FuVcde#RE&(0CfJyw
z@)$Mqc90l=r*Z!3%Lb_*_x$wf8QO`cIMG(GJH^8$KL&8mManrFjBw?Uq!Dn10g#X=
zutMhmNYmDD6c!-8N%II32zAak89mm>FdlRfii}ZE&Wn*24};_!oJ`Dsm}N1U=?VCS
zJ`E0njzZXB<n3ksd>qk=p@0ThcvlUw#udm9cYzoP20<ZDv0HFMm1ox36?E#O9PgzS
z!vUSYu1dT2H|fB5hmOo7)N;*|5iq_gt{nv{JbP6LM#!m9m^xr3wt*gQrZ}OcZ#L%w
zCrSYLN3tG%Hv8n}#h@{im`pxgQ8Waz+5l^~5Wdv_;pr-Soy5Q+_;3Z}rH*=j80l>U
zzCHv{dZ5wJFRaRNGeb!oF=0SbcTQPC!lvAd=a`ybMtG*A^=qp%IoUyWim8Fv!S~by
z?hy*S7ocH32!WXq@}56eL%0EmfP~;?^LTGu;Bb)!g*?DrAd0;_!)nKh*iYFkd#g4`
z^`T~OaxR7sv=jKSvaZ7b1U~oWK~Jkb=rYq(m>*n%`vAfb4Kvk8mZ`CCGShSX+}0EB
z*fc93eZ9&S;Zx0L_Yx+3p0zThHmb&$Stk(mVLf;y)gf?S)z&SXWjL_%xC8)T`J@+^
zy_wG>aiDAgFA5nn@NJ!wi_yZ8H6g4C)*@R1mzW9sHOaVxv@=3JOf7H|6ukGHzuURK
zY?@CSQlb)V9_m%3ZFMVGsHBd+>jH=h-s?f570|%`3e#`_-XH;@x!CZ2o*Q6Ag{T?)
ze4@(DTFU@zpSKXoFaR`Q@h_ILfZPkyH~<s5AQiEhJIFYb2?yFCplxBq$Of_ihlS@T
zE)3!})0oRyD5v?8+TzMic6RwYhfWTHDrSi@AUs3Od3^+H7s5y6+{oT<x{iz1A7we;
zM=XQ({m20junQc(*L!mSU>Y+3ZkO;o7l<S_Gcl^PWJToMSGbvOTUq7vpV@4!5ki=V
zu7v|m2&WCZ*g-fK=)#1XP345-RA~EzDizKGbuOUJrplQ+I55m~p%8g2;eW~%G@1(S
z8`Fp2J^<joaRDKAiL^UI<({DQg9rT}x;cqqU%b>UpQF!&vF7XMCv2C6n<gA8FgT&I
z*)icJbF?`Y`J_lTB>>WcJy(#kD51@SZ(3vlLs)X5GZ2)q3`$j2&f3OC>HG3Mc3Fco
z5udg02Ni4)K;ZR8rXqNdDkCK#WHjqD0Q)?@b54>Z#zd9Yi>gDB(Piff!Zq%tmagsO
zw61J`6H2;SVv$Wbnq!5ni&|CNFkpFr0l>1k%ms9A9VLO?XUc%l#R99motJArFoFkR
z1*JAy0OEk^?4#jJ9~A3vDgnSNv4j{0Soiwf?jOf+17$)oPc-UsnP~kjo8NP}IEC<%
zO&k%70Wc}mfRY+=V_OS_JFwWS(a;1$aDjvYAU3>gNl@VelnG3^rp?$&E|P(j&Ai)m
z7g)`QRcvel@PCv3=w2~+!8lcxQz-`6Hl`=S?*>uzRsc|8tr(NzwSKzf0z#BhWVZNA
zJGaQpU%9{}Oe>1091EOqsWQQo!R2V4rowEdZqLlWv@gtk$vLe{^i?>f=NpZ)=EJB;
z0RsW;OI}G-TlrlY+`4#bOo%*}KM_Q=d&4CDs2x=5f{Jp{wxFR|%gh*^kx@BQmj)1_
zoGB`in|{9J2={bAWRld*?lahFDlI#djwt1V(n&%W$4h7Sr6D?2_$q~!9)diufXH$H
zN%vCRe1cj>QHl;Oo*8n(OZ-s&TbR~AkR)j}Ro1UHVuI<+IdjXV@I-DA#Vj^!-^}6)
zYcYlC7p}tt?LgReYG-;(@Z)ZE76Wt<*)!HiM2oGWyt0O5N%%@Gd|0Vj|A%iwxotfC
z-ywWLb1$RFIj`gbvX~;2LOc{zYTruJ<nu}?mz&wWW6KIk#gedVS)5?neJ|X6sGZ~#
zRB{2*E(qH8bSkVrTMN);%hpO2%LY|$Y597AMa%1opvQu;@DYTMssJEl^N$P_#wB-C
zIQ%e$10WyBfX5#rT7G3-4wuY`S6zf(sZ{INBT%hX4gfP33rkR1W$G`8hYNDKe`jl(
zbZOB^zCO@eKo>ODGjYe&0jaGJMb3c=tryD&i-wkVz?%)4_nq0Z@ReE}duTu6=nvml
z&BJ2ol7FK0zk`>C+=Q?z-3kj>vT{?%ePN~gcX-Lyv??t#({_TK*XNarMr)G7Y2N{(
z%Yuu7P#HUbo3z||fXL%mo7Dk|(u~LHayM5OR^Z+$+=4A>gb!ivRTM;Zs`OaxM-fMU
zq&+-cM8kheqaS#QD$88cV95fBEDJ2Du>T7Wx*V_j{Gx>oaR)Jh8CdFi?zwz+Awwxm
zW~~cdTKB-9U`VEfW}?J_Q1gt9_G}Zz39DRVMrS3uC`EeXTGH_P00Ayy;URRjr`PNw
zM1Bs0+}9Mz!q;i-jdxPtxv#%YP>55mB~(E6i&YZm;dNIDw-!*eIj?t+vtyGbG7uK6
z^45!2dWc;AI*$cx`lc30wVN@vG+33)UuFOEAZxP>m$S_2!!XQ+XR|kZd^W5PwTVpI
zkJ8GkzliP4R*Jq(gGtjQs;FD>@bBWq=i8=&&9mKZo49UBIWDLoP%Zu$NVdqaIO#lv
z8Via#ZOa9eq7vm5i`Ne4B+4$v;(*4LU5Mx&RVr3!v(>EGhb%nCsN)xC#g(_xhToku
zOYPqX0M3!82Ef4n5=`x8pnf-8<!m-PQ&qJALZ?HC*EJv@Yd9eElEu%(Iv-Kgmvrnz
zLQ`|7=^=Q+zR!ytl`iHR+yVxolHly`(0Z7eJpvsI&i)@|Y>$Oc8~a7iSvS+VPrUR-
z!k;n?o^lyGiKl{4eiFI#8yLj-99fxJ`9aHALeh<qAYubT3XX4rB$bPk!b3!9Ep*}<
zAdcA<YmKw$&Vrlt=DYVn^UyN;I8UyaJ**%IxY`SC{h>QAIN_h7uuq)ka``v=afSK*
zDGcByAbdMa@O^=AHPHqDaT^<gV;slM8Y~EwN2o<$Wbt5RD4@Xs-}Dir@J;7N8uK>o
zD(C0e0t7k;&-pxnu&ik|bp|2`L#K7$^e-uG?GVea{5-Aw*h{>6{B(Xb@)mwFW1{nm
z(8eb!p8sWla0^FZzgwX=1OVL*a(kB&-WUW2gsJhfjG>DhzH&s;M=v8<whY3B0W|5G
zE$}TER_iXs1)+)doYy0MCx7M?=i6onatY#5>keA+zAwS&kG`4NpA10y=F?wVC+;UK
z{!wV?)=<JCLiy)@P~VV1E3pyYS^>L5!h4PjYz=N@Mg{_#{Bkd)dc6iZY#W!oHJ@q`
zYufp`b2ApykendM&oMBjxyjvww6PDh{a0wsN4`d@uGMcvcvszOYCZO6Z+sP4lk7i-
zWbay|ojg1@4s1@3?fgQj#b;9OS6JgF7BB!VFs2y*#tMoc$@#y_a{`L{j2=}Y?%xN-
z1q=YJT_>y!yuOL<>?SNYscuX7wQthEmajtam#BZsnf(CL45%~nChA9B&(+gXzL2&^
z9loE`vB$5|3x{t(Jo_++V-FLW)M-C8E}&c^!^Q(Me(m~&uBFb4Ax*&ZTr4oHY$q`9
zO@K>yTY%s{LNUW8e?JXgu;f>}X8^$4{_C6|ee4O+6Hji}oym`@?%Z{n{7u^EO4<fS
z*3BuACE<FE{7;gN`qFinrJKYw{>=&yat}(_`>DR}9ti#j4V<q?$hST8cLsobN_n32
z`~jlbJ*)N1?rW%Z{7N0qUj|V(fVU46zXr+P?&aO*tZSUr60o`%6gm4S9Na~{XFo=L
z8y}{D3l1ATZv_{0razkgl>x8>3<4Osac~e^Z-btCb`vG7F_QjTjGMa=bxN8w^P@-^
zG$Bp{;!LB^cohO4qU!3G$*=B%rl(3mzhi>`>H%0fPzHoEiRm4>rGD*W9tFLqjA}_S
o+s#q2e`&mVM};o`{l5SM0JtaQVZy%hL;wH)07*qoM6N<$f`5IkEdT%j

literal 0
HcwPel00001

diff --git a/guiserver/images/paste-down32.png b/guiserver/images/paste-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..c36c67c0b9b24ecb521ed9be2ce2093a1518921d
GIT binary patch
literal 2039
zcwPbb2MG9yP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU(iAh93RCwBq
zS51r@M-_h6)j!icvoo`^>s>om6bCCpK>-<IBSn@75kf%%P8f$=P(*HlMDmGS&dCLd
z3qn}r&cPN(2pl3LE*K#tI4IG2ZSUIgdS`#;zh`>7tBUVccdy6ZUGJ7u)7{hE^}c%V
zd*6F4j4@P>-@f}IO%g>)lZ*c=kM0opQf2?Sl~l9V#h+ff^phW+ef~`I&fVMke_wol
z>uWDQ^ZPsh`0$fS_r53nNbvLg;|MWvq{ym~M-HxM*W>Za-`pg3_78!#lFYn5o~XBR
z*}%*kp|O~ui6HfjZ+*M|@@sFt@Xd4Q<o3=wwa$H&PM=!-&cFZlw;u!ddTLygCaKT{
zZy4cX!Cn-~-_->DiPzqT0OK(L{ZaO_L7e?jWhUYmcupy#QR<W9NA!$r(fzxhlkcRo
zu-Kv~45;E6nya-=w8IxpZ0<;MvJpjcOwvqY&yY5BKJfLX>zI$n;~}Xm#k%5P0KHhf
zqBTVV{t`wJZ(=+4sWT2JtTo8l9#B}lN0rbg-<9xBN@}tTKrtmrOxwK)#c@U_8xEZa
zGlKH~!Hs&O$wgz-$IqTUPxA|>NvZT;0HA{_1W*HorG{3B!$Vp;`8=Ka`m5vz0Sr6T
z8M!pN^#F0rD4X;t9`tFU7LfZ~lj8m^2^hc<q|+&J@cppjz5Km5>9tG0CeI5F4}o+9
zWf_2IlZOi^d`hX=Xu#zs?X?Cdg`4AyW8{(Ws}!6#P2tixS~4&^9n*9&pftg;yGk2h
z{Dm&O@^kvp8}HFU!`=UvvAZuISYsk+5EDz7j9j>0O2pdX>EuLVni_r<yK`&g1`FgE
zhvrYe1SfLX7G$Q`89IOGFaRdsG!thpCPql|Dh(LMZgK75=y@KlT?<422oKHPLH?$2
zVKSY99tmC#Y5wf@kxCKWSzV!8t>!K-FDrmBhkC%|J|NZy19uYu_|d#I=-~gr2M>JT
zg2=s)d%yxf;60`6vkFIvTS_ldEb6aLl4J?tYj139$SlhgXTpUG7oGr+TZiHNloxc7
zenHeE7rS*~EC3Nb2H<+uolcRj+5*-jVc6j`!Xi@Sq3LwG7w<oe-uue4r+)Rp`|qp2
ze)JJFz^k>jwSzsN*#iKf5I8Sl02~5`Jb>VxvvKQ@0s!wu7l4J0v9RLBXO)V!A!%=I
zzipKI^w#R?A9}qW@#Nv`15kK?cce5(SD7QfQbUF~*0_{;?4@)pAuSg$Jxo{T)AL*l
zA^{)LOj&?gnu<?ue)i7#z59z#Cn4n|v}DAIU#XK9gv1-;n9G9w`IHtIiCpQe!U?kc
zQI5{Dqs%0Puf6$D_xnA&>3Y3>NE(`)fV#*AKWbr@6}vbSE)O{$bN4e4KDTLWxBzKu
zjGtw2>@DUGXVYjn*qA0shdp%l>ec-ru*@$EE5&Lk0HC>-YE%}80|rN(N^n$y1Q05L
z3+n9dtl?Jr)-T?o%a<=dB@InZC~`cT0b({oj48aN0o1YD;8@z08!(R+vdB#SK6cgV
zbiU-%=gyqjv*#R`1qA>HuJ^zJmS1D*Lm3`p`N7X<q#frxAM<N%@7ZSyJz)gXX#x-I
zuCtBn*RLOu1xzBaSGpl&wQ5VKDh;ub!Vq6)c4l_Y-e(V);+)51GD$(e2Yi0x#tpi5
z?b^Wr@`A$(21P^qxn5`iSR)JssbzPqb3jlvOjXRxrY?Jo4J)04<S`iZyWqfs(#(}B
zR}SGo=>hD}3+51pfKnJ|tZAAStOvu{#as&t(orelMQAKwJkReiaRFd6j^pjU=BM93
zLI=1HgaQ&WfOid(B+{ar!A&bbTF+F(l7!lVPvNa8`T;(2A=};A*&N4l=jr9R6d+49
zq+r<KB!VlawofPrlgxvgts-)Y&H%8kSDCGfQ(F~t(7kSl378zCA1E@QNI~1z6-3Ii
z+%=_<yf4Uws02{Po!hP~&G{jvVh=nxRzp&1fN;_Gh4sB%(M+COBUp5{7(Mbp;e~>v
zyaD#aZZ1N{0KhxOiyn;o;haq+nyGZ99%wE0)J{C1rWS<BpJNq-1}NnHm&a?#3K@=q
z8U>Xqw;EPXP40VWI{))Xc8SVksgSg%hRh|`^C|9jL4nTEAt+^-<6EsS(0psj?j%F$
zEpyw7Orf)-Aydk9QIPh+WxtLbibtdNXf)b7+5^S=!f~NoF|Dn9N|kC2O+^(gd1yN!
zDZR(YYP)0xWdYg%T0muJJoF6RZl^sQ4tI|P5LM*EL5z%t_-x!;q4nD<Xvsowp+;d;
zM|azx>fAg<b4{w&n)q0$<0FMb71@5@3%r?>%%zz7$H8F8DL6h7z*5Wq5HUWFsQ(~J
z(xM1Ke)SHiVH@gYsJFp3(2l_qu8(4cS`mP(^~O9knl0PDF;M=`1&>tb($-e{!1(V2
z;JMD7#b)qEb3Xhois&+XS%@b;DGRwZWkJeNk$33k%BuML?Y=;JCJ{o{^D17VgQ0fn
zs=c*!^H>11{U8wCFpz(Cq@+WKc<jKy>7V}{(r0(^DMr&$?PuR`ipTeTAOBx~0RXm;
Vk|0Mh3+(^^002ovPDHLkV1gFA;iCWm

literal 0
HcwPel00001

diff --git a/guiserver/images/paste32.png b/guiserver/images/paste32.png
new file mode 100644
index 0000000000000000000000000000000000000000..760cfdd77a9ba7185a0dae589012c324e68f281c
GIT binary patch
literal 2103
zcwPZF2*~$|P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU($w@>(RCwC7
zSIdtaM;-pEy81Ei$G+|LIyP$~B0v^M#4>^l<PZgp<OE1QlS?je;7>pi5*!d04j?!n
z<%S%<5{U!?MTA7eNsQNv!+PJlvoo_ZJ3BM|sNz@E-P1k0YjL8rwf&l^`s(|>-|tt=
zlsZLxC~7V>3!8%$I>Xbl#W@EUXAGP{Us=Le-kmwG_+pK#rQQ7<|4Fy=usl=0*DMwP
zBc)_CN~DyMfK-ukPMpeI*l;*zF`|(brjG(x2Eal%KEdvTH@?+-eE+WUPiMJsm}^_G
zZJSAEsh+suSaWwieR<`Yd(hp1#T;}Fx@hfuu(wj!+$pm@gAA1)1S$x86)LN}Ib8Y8
z>g{j;>gH!}5vXyp&<ucxFZB8x9R2&PudKiIqhE5%_UI3s3$#ZrwvHH%#~fBw;JHs#
z!GuI}rio&)LhFt2WW!nf!{gqfJlR3r3$fCasJK2j0*v?Hd-3N#eK>sehd=x6wUsM~
zL1YKd-;7W8zQ(xlgx7%M(cn%U|9EQS&yOv9(qF=9RK_S6qSrsx)DijsCCA6&j19#E
z9&P*h(+2~5xXZxo5|LWQ&DCXw;l?)}KKvI;repaz#S|LL79=x~#7IaBTnN0ds&MBE
zt60AMJ-DSBY)iqV=fVO4>BA{XT)%z;bBzMNeCs(3y894P13X4}+M(%eRO@xevV@*1
zNC2n{0Wi)b7>!I#QAch$SZLU&U%if{)#vFs0ShC9ktF6N0%8HqJPMVYC|y>#q{oj&
z2u3~A+G}qjI`|_Bg@W`vN6!_WaUsN;eSw!Mp+Uv;LArz6M4v-AJnEqkiYCUsgp#^H
zo%O_$8l5Al!O%H*B$Y?MD8j9;V(Ck(Xuo>|`{Vby;}`%ul^{@%wiad0XDri&!p<;2
z0Jvisvs{Scj1ED1uEo(YNrtp6l7S+Gm~|*pT){!nMwCXh&LM)~5k#qq>hpJDmsh0V
zQ5<TC5!U_Ke!^qO0MPnl`mLA+%?5eGE;Kd!dVX^T;!Z@FF{8d?jMUTjlra<%pHMpR
zW<G}-x4(O}QZAOM$H0Ue4e-wqXP<GQ(kNh)Ghr|jv)GKxD!}sUF@OZC`OjD~F)_kp
zR&?H?<OM;^b!@m6H_7ML7r**KrLlBZMgz(P<TL92)Mry+$kLOdM`_cVGC|40t)81S
zCX5C!X)*<o%EQgOP!jDbf@d>J^5PFVC;rRS&3|SdK%%lzag*e9PVsCxrPz2Zl^~TN
z$3nt@2BN(&4nlN#19bZ*IPUlLVyf@_{lRyhtgn&2P9$>xSUx!zgUi^}+TqM86M!PU
zkeN=5A%`OeB5V3ydqIy8Qs_pMG2i*yU&m{Y*0}a!I)q4)g318IofLJ@tF@deS;8{_
z&ZvbHhSI#L9JmC8_JiW|f+A$>2N;|j?-Yu~a8mouOF(5zMkdK<#JUN$VyHC|JmZ+~
zkuEC%kv2hTb9g#H;E%T&jk?OuD^ymCHT?vDC{rP=Ab?KG!mH`*KpLvN0g_H?GP$8V
z`3+A(bYf1+Mz445)8+Qu?5ycIP8o1nCV|p5oK_u%0ihj{7XX_=@a&N%L*>eA9IBZV
zDHDPcRkzdb(n9vCwVKYR>XL{@(LtGcKq?tUA*hyPJQ|V_DW<(@Zo{IU31R|-WhPC*
z2x78*)M^Wh9~H}G)8mzT6a)BrIf|n%8A?V0!hq`d=+u;0o62%J*;yN$vxUl=H1mL#
z;iz@E>$=VnV~(jORUUU1S8X`~po|A2qTh#4Elxre698%2HIwALFbyKdLK^2fHPZlx
z2m9OgN~sqI-dJ6nhzLRI0WE=^+;&Ua8D?w^La}t#XGg^ZjLwuKyk=Abn3-vYnfIL(
zK!HwPd?Or^AS3{xVZbRijDeJPBUJilKq!^>MdpG@IHfyH(%&DCu=#XjyVvXIn2Pg?
z=sbNpAwr<H`=QdhYXExF;gx5ht8lhjLxTap7%s>SEN4e%?rdA2(>{&%_V%`3fBh%8
zfB)^tSoiMz9^#|leSZ={l8nho_b}|6l3c7V##-hkGO=%%U}tw%)7L6~?FdEy+Wq~#
zy<Gx<?d_fE9g&jx@Ucj5pTaO80~S%LFT}-yv55rPG-|4jry$i76lQiHr2lcN)#_a2
z6k)btNGXk*HlatmnMQNTc-E#=s-3J<ocmO&vC1c-cmS3yeu8did#4*}S}y`{*0(W$
z5QXv#D)l+@+_SA@H<hi<>;cJ~aZ?jhPE2SrevDvibE8eClZzQ(Q)$#BNXsrz=Gw(C
ze*7AWwM&>?xPqDa%cwQxP@kDcrPiR2k|Jd|U0M0LK|@{2O*M@NKRnnTockh40hEiG
z1bU}btJoBJF1p=AY<}`<49Ah#qU$du;g(671~D^_YGVPl<|3N&%a~hOrt1aT|Ibn*
z=BjlvpEdDEt995(z6s6)_;_QGD<<p>Td;4gUaP-6^6AS+&Bv6>xIAlVg5a2TJ1qpA
z2RLpiv>$P-bJ{u6uF0ml;gNLJ#v-+O)Mu~Y=(N~-@BNSdG70>%f!nOwQ`%MvcKP!+
zYcJKS&N6Asr(!F&37N!#F5i)4x`_F->7b1V8;=7<w&1O9I9%U~o&*x_(ogr!SJnTO
hP5;k_2Jl}21^~ibpdQ+JT8{t#002ovPDHLkV1kf;0LB0S

literal 0
HcwPel00001

diff --git a/guiserver/images/pressedbutton32.png b/guiserver/images/pressedbutton32.png
new file mode 100644
index 0000000000000000000000000000000000000000..13c8183db0b41271096795042634d1a6a54cf6cd
GIT binary patch
literal 3223
zcwPaQ3~2L-P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C0kla(K~#9!?3F*O+E5tAe=*6mm6+-^kWhkxp}189q4XPc
z?QRF>&Yk-ey1VuR6u~<?wVQ<M4Z7sY9j<1x#r%Obo-X%7$9oE?OCC7G;lRU>m-l&&
zB81?aQc8dlpaduZN&p!EMN$5~UI0DdDR2wyA0DJU{}JGIzu*5d8jYycYWTj-WHPw|
z#<BniAs&71^&Sw@=~M(kAQp>-Sg+T@^E?6klJ%6GfMS|vHW&;phQlGvW)of4Nz)YH
z_gSr0zr!&6kmvcQ$9ifq3!|#)+g`7S=Xn4mNrI+nq-l!ly5xDz;c$2*<0%E8>-uH4
z+r_qR9LK>h3^Yw6NfM$cLI^<+1hv8dvMl><Sr&~(1H&+AwOXjEimvO#ag3^}#BqEp
z<5`i6?agd9yEaV|*LATh3&(M=ZJSP~!*;u6zu#X;IZCFW3B2(<@7sJn7n{vSgkdO_
z%cU5P$Hz*g@)771nF0;y0)u+J{;u6_zpPfPPogNg+wFFrPp8vY;93arqv#@f4!i&^
z@Av2@a0A={$N$lU4|)dZz!As_uj2AIECEV@B2?kbI{O6v3;;uoVQY8{I+Xwb002ov
JPDHLkV1l*ZC7A#K

literal 0
HcwPel00001

diff --git a/guiserver/images/red10.png b/guiserver/images/red10.png
new file mode 100644
index 0000000000000000000000000000000000000000..8e3067379e082d66655e3db35dc7f4562ccb0970
GIT binary patch
literal 728
zcwPb60w?{6P)<h;3K|Lk000e1NJLTq000UA000UI1^@s6jWW-@0007RX+uL$Nkc;*
zP;zf(X>4Tx0C=2rkU>ZkVHk#=QOk%mBNmZ}_z%{}l~FHxbXVOqW!qLQ6)9$C|J|LO
z-5qAet)xRlVVxA}(ygq6*De*EIusE^MrK8Y(6tBz%S*|2m|fjP`%Vw<_kQpH@<Uyh
zW?5#9fNajS<Kdtf8=nyMZ`nr!2iZ%#raM+oEH(t7S(eF;+4z70upH1V%l!ML<;BC<
zBd^ZAd4KH2&7<o({Z-@BE!%~fIv|pijt+_+XusfEE+`SeZ;!-7piBY>(iNPjV0&zQ
z0u&SQr#-#`_!A!A2K)s*?SirhsCq_Ag7OJyO*(oOYKB1h?sWj5!HI{1B4+1PhAAsL
z@6gA_Cxo|JKZOD)O|SK7yHN5gHJz27`~r0ShT8dUEpZ1PUx((;+gi(AXuJlGmb~6x
z7JQ48>3{5`Iy*e}1!2!>vABL5>Tkj3e6jdvp;+9!54B(6S<aOgU4T&Dx?~&aj4Rr^
zySqd{bf{{l=&>wQicmglO}o+-13A5|RcNLuY$Kg<9brpH+69?xBWq5V|E&@5$=v8L
z&<x5u>GTZ)O`vonwcbHMfMO+OZ(m7|q>TOn;4tt!W%rMII=>8eV5F4uG-pPKN<5#-
zM^BbKtCky#m-C&%a9>$JubqgM^!-!$!8mXTl*O6M$e9w0nM^2J;<Gr!2@@oMg-xCm
z1_ma^t{anB1q&SFoF=&C73xRzr@ErvQy-{5w$-clIYVEXTO)?VuDT9aTnDPsx32Z2
zxivW(-Kg*-kT^_XV^Bb1;vjczEGv^%>Yhw4`(9qIdMCe26H(=m@DEeO+&U9u1jzsZ
z03}I8K~xx(V_+CO;Gr7B|A%S}|Ix)6(G?-{<!>S6nW%2{00ICe;R_s(o$bN^0000<
KMNUMnLSTY_uuixD

literal 0
HcwPel00001

diff --git a/guiserver/images/restart-down32.png b/guiserver/images/restart-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..25085e3db5f8e6a7ab8494ecfd3a29d87b47cea2
GIT binary patch
literal 2549
zcwPbZ2@3X!P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU*he<?1RCwBy
zSKDt~M;-pnnK^SVd+~bhIC0{T#8DCwC20$7B`Sdwc&I>?BJ~ewB?J-$0uKoBAE5G9
zP^%ycDwh}fKzWH22^EEhTpH5W<RZJd_!8TRW5@CCdcC{nvS)^G<{T#}v_UwU?Cv>p
z=KFr%?|PWN{wh7;kKrE?XPO)$m1w!qrM)ezjh^1w&!}cL2~N#&z!nBVnl6WI+L4ry
z!i`Kb()Jwvc>v;x;KBeiYOm|@nWgOIg_Y!+YwOWdy(k_^`w1ASe5d1(D<lQJ_n=<&
zFYg@jPLGfBzf`I;Yl-wV`#citGZip)yN-@}Z1~!Ad}4C0@!e)?byR09;?#p6DKVxV
zI}?TiBhxNcKupxAR@<_4X!qc64v)(>{Xnf!sy~y$e-nVz<Z`;RlpQ;NW%-ReOSg}5
zJn!-Zpt#B0VsQ(c3v5pALy;7pDSl>@W*%kE2<;f%bLEAjTYtP`l>UK>MCwTdEV!hb
zvz=GYT%3Bdvp!q#-I$o;V+GhPb8zTDh71+Tf`9=vB$)2w3f!Z6q_c>kG@#PJzV&0z
zAN=9IJ@QYKrk^4q9+TaI-<WQ`^7nI>-cF)L8Mq!uRj@o9>J{Lku-+-GSER5=o1<J1
zfl}b)fFN^R3fvC$niJLc&$WI_^eo%AC;THN=|gusA|NF#+*v<%=G@s|#+`f8_e%hR
z)dtvtdln!E=Y`+3CE}N=R4SJ(Xg`e*wD&3Pt>BJ=+d`6VkK&D6^2~+ojlloP!q}*P
zhT`-w0<NH5CmuR?@#5<nt)*HJmT<UNNG=V#930yj<peA?6d4>IrQJJ+s9q5!83?IK
zD{I?ndUl33)@~t@lzm<bP3^|q;MotuUmXAXv)>AQXO;R2B#~z1aGJO__1fa%-1ELC
zt(@9`7)h<H92v*39Q)neQ;7KL;3yr~yOqX<If7K%81r0B<2yn+ux}rUV2skfu+JFM
zo(b;7ndkoX$^7?;3*#pcfZrRdYr7|>roO{X954g!<UTcE$`A}GsEksjwu7WU2qGNY
zO0;cckhWBb8f``IUtFd4{x(e)t~99A%V=ziPg}Q+QKCYS&50X0N2fG(bNbtjMt3*)
zF0LSeZqCdeZ!|V`xdJjPCkHlG8ub9aZO1r0eRwZDb9fh(Ds}3`s8Oy@wTcTL6HU$b
zXzKbrb=MYXW_p3<@5Lm*f1p}I6o5d+EI27sUL0CqZ|$1+Wa0Sy!a9j=FRI?2UwqMK
zli`Dc!b}CtfG&I**)~oG#z){|O;>NWX?AXzm`bqEvEZiKZge85`U-nI@Q15xW@_9=
zamru_f>W`)SeYDjkg_w2D=)6~^gH76#N|T|)|yXqPI-PBq5#)i(iVV!aUY})6iv=4
z`scMKnbQZWbrP}+!Z;K%`F=nll#wM(^`SbA4oREUt#(XF98nms{A@$O2Ct?pO`hr}
z(LphJV|ITWrK6k~f9F+AL#E-ayXnyWT~tFhcB9N5_}r0U^5qCD<F+dLu0qsn+A|i=
z)}b$uCmGeNoCZ-k?l%?Pnpq}CMK(Q6Ea_Yt7zqOXY&*_5Ah^SKYV}wp#E%RQRA6O&
zz@vUY#sQ4>ZbyVmpU6sS`jDb1#zBbu9m5*AF70*WxupkvI``osHCFD>aHS}g0Dp*6
z@W7>=B8rl_ErZ1-YbrY3%=9ez;Q$@jQ^m%V=I=9FYi=MmQfs~E`!qHpDD*YmzNc|-
z9S3C8SdVF8ag{pFdsHtaC^5{s)I_u`TqZVbEI1U$ab0jZ$aHr(Z>^@jn|_1h(QVGt
zrArKXe3XvtAAt0bbZ(vQF3e*~pK8O~Y3OTk5em?a*;TrH`4)u|y?`?E(6~%`=HTcJ
zMkYf*>7vy-7K@826G2#Qw%3;JO~$MYxTjFV74>?HH1V;K{0M#NP>o*v>NdLcaZ2|V
zZ&S&S?S2#4f`L$wAYPQMh7J>XSG3@!OX5>yHei{pHQX*KoraS}59XLDK1Gn2O-kjA
z1Bq%7Ez!hBSLwpUiuL!%NDa(Aldzk;5TMLji^<3qRt-SaPwg@;Gb*So%g;B~V`Oqr
zbCl}d7GQK8KkoLEbh|l@X=Pih(x$bVNQbY|dvx`qE?v7?CV>ccvK~>X^stX<(-93&
zU)fyNW-d@MJ`?-h5Gqp4s>3in30L0bTwE8P?@dZyO~l=3I~kb_31&$2ttv(>X)S9}
z8n@9lT;klZzUJIm&U34?T=JYiVi!FG&vF9r4?~M*sG_dtPDsfoVZ3YyrSP<a8@8?6
zU{Qt7Kmr+|kcu2W4I~0g7-bSlqYc#jlsYk?lXkGLhkX$+BYcnTb2>|kI8Zk27|1&^
zB#w0U1NSr+tSuZA?Xb*Gd8P7Cx=Ff+j3p*jOzA>!X_hCf2~6|b79sdCX)n_UXFo)V
z^{CTWA<4P`DkdXC+*(~MqpDHPD`Bj_eBgVtfiF&(QY|zN6s~i-I#_)>?j=80-L_2|
z;|d#Ph5+e@X{zm9Xy$>K+RJcDs>t)uR9%+GfR!<`ak1%lhC0u^fOuH3pOuRDI~SM=
zh6yh6j#eEAPe#$;ORc_of#Oc?PkR8%N!S_C7KwZS#r4oF<`m=iOmCJvyL3_R7!>Ay
zNTM_V>q``r{13`y_oRs%hW|vS9s3+osX0)u{47q?U*i@VR&f{pOdk!MRtZ(Ssjx?H
z8-|eHeETQ}6xU6v@gO9(GC)pHA=md-s}=XBDC2AWe*TOQ^3hmW^2FI~qJCmUh<Bo9
z%V$vsB$C`EN^e3GD*WePKKC2HGGvJfY7xTna+Ms+moo5sLqq<FFyLp6^rm)L0_C!N
zG#E3J-ty1zvtH%yuamY{%OWU|L{^PFnu|`NAH5dX@@l4FlajF7@c|x`Kmb99h!>u0
z*6ZH)hKIa&wH@I<=haLXgM=sfyTc>Zg?8xus=MC(au$I=g4BW<wzivq+&sltjQn;m
z<2jhDxkQyjqjCW3xUNaJk4h!?N1k-fE2W?OZn)`A8=bCmzBU+s!w<dJx}D?)NtBGK
zq^R$vR6kAtQEmt@6VN8;04yY53<B|1;PI1iOG~LwWBkvTQ)P2sw{XbozAyfer2fls
zl)aSp)ibJ}jp%&7$_eBuXfB);F8GA!@l(=u-h-c)jIWe79f1AcZ^t=P6EK`D`5u2u
z2>yHgJd`BrAXMLp`vaDPV=Y{eE}H`Aq!6r=zcl5wggpV{-vSH(&Wz(`0&dT500000
LNkvXXu0mjfgFw~#

literal 0
HcwPel00001

diff --git a/guiserver/images/restart32.png b/guiserver/images/restart32.png
new file mode 100644
index 0000000000000000000000000000000000000000..9f26c916e1b8cb3071b5c4118258eb778cb05749
GIT binary patch
literal 2578
zcwPY#3hniYP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU*q)9|URCwB)
zS8a@3RT+NHxu5g3Gqbauovkg<(r!zwK#c;TKvWE%&@}iJtVDu>l@ekk^1~m-M1H70
z3=lK|qW(}cegQF*hy(<oDNSK%)5309`a!o{TIhE6V|M1=x%V8ObMCaXSTMTDnVmcL
z-1mLn=Y8JyyjSS4ui<_Eg#FY?^MhBe2RB>_Cp;UDzX-x9XZO=-r11pO&N!0JUg)H2
z9~Dyc?CAG$;J&YO>zIFDVF`ljI=I1SA=P<6ynu^lJH4F_KSHkZTTt?4f_NNJ^I>%7
z_GR}ikkf(?@4-Ok+|AbzRyV>;zp2%cg-9lWWQwNRTnV?ScZd><MdkpfpJ6Q|rp7@e
z?tN$<{W+4kqXcn+(EkF!u+7au<x(A}yL2+X2GQ&EHN$(1RM3fJw8G=H>^+k5gRHA|
z4;-(ZKH3;2uHg|8%WtFe_On?U#rpv;EYWa~U$4Z0pXtuaWu#5+Dl(!9{pI;R$edf+
zPX<6nbT2Jx-pT@Mj%?H*@)t}?wdfXfrXPato&v%>)wvJtiS??x^+Da)85n268DKOe
zXpzsNw*cH80AX?k>GIjYq=7)XEn?t(?eb1YOjBH&%DV882W7AtBEmzKtzJ4#0^mVA
z$)#!Z!reL=4?uwnQKsV}?-jV;tdPI?8Gv5&G9Mt0L%crL!Leq9{&E3J7nkAthmo|Y
z5m~it=-DlyE=2b@{&^E3QqMxDlL46A>T1&2`Xd#M)ePN&PBj=Y^7cFI_kh3oCmwV2
z1&r^Nxch-oJoEek%+AHAltWy8*+Ohs-@w^*g>EOcHnd8iT03f@5d7G2S9}ghG)12#
zj7-5vcWgu2e)VHo=b*I@#bqfpjv2M<hpfUJ951kJxj_*VhjO_62QT9OUvI<I)EtTh
zABQHVaqk1$@%^73#{Rb!Q2d!aySkbcI(m^3M>aruJq9Q!t(s>f^E<zxm1JrerS=HU
zJQNV23+b29obSVIOY%C!f~vGCf9T<HJo)q(R<9bw=hv;m@+CREwr38%`{OP={*OJl
z;JgBEzP3z$Th^wgE)dNl_4a+8J?yt4ao(_rOrpKlr1A7pt>|1)R@%ux(4E)UkIgT8
zxc;`6aNV~yW79KKw+t{dBd~2`(kkIopB%>8PY>Xdb2V=K;t;O7d>K0JE?(L(i=)$l
z6{JlwZL35>b&oAoPV;ING9azn#iTQFg`y@j>tCf3h6zn!`=tuDzmmfpcaC7w6QdYh
z5McE%HK7%vNTAb6;0G>-7UZySz(u2;N23v<z94Ti+m2GS+5)L^tW9O?QW7eT*ut7u
zs$jn8#;si|)3|v)%qA;qKFLk_auK`t_2Kp(?!eAnhj9H@K8l;Z`avvRL{@@6$T$b-
zI5esd1R?Up8WAUWWvq>-{<YtB-$p$L-%)fbZ1na&BU1@~OWJEh+FI$x?E@=R()|Ey
z(1_C3wI6ucwWoyd-Srw?965-_V1cEU;7^b4wgz0!LlkQYZVIKMhbNyI$KL%@NRk92
zJ0>x*eFDpu)p61J1%#3*)1=-+ZYqx*UZe(8x=;vjh0B~TBBL4SbS~ITq;&E0)_MGM
z^CZdz$2P8~o_-Z`^NHC(Lo6TG@j!nb`J9jEH@}9zKbaca2tyac!wr0S?V0${k_4ff
zSeBG^sx1Jsw5>qB$W=*HG1O@OBDf5U`MEh<wx)*b)-A!qoA#3G6jyv^HR=NaW@qLJ
zkf0n7+g>_=$v2z0<P*af8q6b(VpPi>&Rvnm>a)72mm;`QBTZ5|S9V#?=BzQIM7QD!
ze@LomPw&WAcBLxD!s21v`lYkry36s0M|R`L+jCfd?J_K>cW5v{TUGGJL=&&?JBkZG
z+`yF=7ihQ*PnxJB6aosA;#b|S9S=00(ae3;f$5w<@Z^-P^!le0z1LDC>0DE$f(MI4
z2SbHP-13Dp;K-Hu)$ezq*__9n-#Hf-uLh3H#F?O&Uy(+r7hO6{vm;syn{d_b*rn6h
z0zk_9Qrg2zIKC0;F{$E1l&q&rd8DRBNmokLD(yn1ZPdd<xOrWOjW?{aB6{MvBRDpb
zl3Ha2YmZa`s|nMjXn;;5BypQVQk$0qk+AHNZl(i9FTFeuu#nbf-!RA8C`YV=T6Y#}
zWmw3Jq&i|Y*eG2G1HmM2xUzz)KfX9iQ8a_Z@p>nyuzfx?PRW{5hH4WvyI*3C<sJiR
zV)wg@Tm}Vp_wXQ%kGaCjjmlJwK+G-HNzD8+GHJU7A7ZB>PL?}rq_+|n+5+T!A8%1`
zojA44CLy(kIi=?bAbtk`8MFYD8CFsojB)OSB{JaCrx<lfMGK*`N&2m|Y)Cd5b5a^w
zwT!GT1)GU<5_oQChYtf(#~zPf4?_(ey@HWP6sOy^smr1^jw3pbvgn2BA33;%Dx7@D
zh;S3N(sFsc@w@k!Tk0QAJDp`ohqN)5c4)C<oM{}4j_MX&3Xl6!_6awh$BkDNaP`GC
zG)hxQ+swId%B`DGZl)tfZlgDihTYODR_)p1__=W*<YP7^rk=^`gjednp8$T6c8!SQ
z41~%6XnqlbQOGX0y6mbBJSzR1S`*7FMg<fl%Q$5^w9$Y{vY}OFRUz0py<!D^rA`Jo
zYq;(&iEzRm$I|tB15x3=pf+?3b9qVJJW2@|5E*rX0JIsm?BbDaCR`ycL4j@W1ZgU$
zSH{M%Hn}t7nosAYDuP;r00wv+JjaKBaePY87|3dA#w%6spshz4YCWDNt(}h5gpI<~
zulX;8ZO11@>=P5ewm`B0Ra<~g5Wp{25!QzYU=U8OaD;Zg%Z<|~hEn02G!_c6C8!Q;
zBrCs>URa38MA~jKC5ctJIVOdjpu|a@#R=!4cbXbjom`%iJ)I8>!mkdP@vTMY8@X}I
zDQ`yNcnaPD@n^qM(-h79ZlTy89pfq2nzd{w(@sq{GKb0WCe(}8FeE){nqqSceb%{O
zt-<f(MC1ok?0`3M`(NMvUhto<X7*IXU;I+}fE(uT@%pM4c4uZdZO>Yz+hHQ@0kLmg
zbnKY1je~S9M=2GV^FE5MWUtA_3*2@a?QVUybNhU>f9+}B%(OMi^q84^1Ka4WWZ=xy
z)OwV))l&c%$_;=pv<yf#EIx0hl6z^3g2S8*?0*4Z%1t<iTE{pU<kodm_B9mc8ai(<
z4f6OwU_c1RQPPob^1^huzwyo^bb9y{X8$h$rsQOnV_xJ~1?MpTD}@$37|@p$gfK6T
o2e?M<((K8nOYLa@{9Awl0K~lBm2*6O761SM07*qoM6N<$f@?_aJpcdz

literal 0
HcwPel00001

diff --git a/guiserver/images/run-down32.png b/guiserver/images/run-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..67ba7d6a9b15b4fee504ae109fb6b2c268dde83a
GIT binary patch
literal 2423
zcwPZ_35fQIP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU*2}wjjRCwBq
zS6ggU#~J?T%(?8{_F`;fFW6wxKw~GUTttDW0kvwYR4D30RV3P`YL!Ao9{N<N7gc>h
z<Rwoep-rkh^g<K0QgAM`Nm~k`2?YZ#0Zh59jqNqQUv}-iopWaT|1)RT>lB(EYjnJ4
zX8!N{?=wtJe+wS?NRI(4OR(zztaTvDO)JK8cIQ++)H#)Nn+xT9f|iBtNVYNVj5kIK
zcbenn+lD<p18y3iJdZMLlwryTL6{E)F90}k1m6Y|bE`IA8q7X<b$DoZW_EOAt}xkL
zcJm;lua+8&gKb4+Jlr_Znryq?m0ELZbI1C(o9f3dLAg&tDF?tJ_l050Ex-^Mg)#(>
zZh%~2Yv+4cr=B@`<NUsRbLrJW7Qr$Zn1+F%YPH%U@y|yceIdd11kQz_rGDM;;~Tad
z|3df5U&KSbX;|z>*&$p`I?MYJAaECeBZ25HxHi)9)bX=_|JjYv3!6AEL&&lesDYaa
z*nlNDlIeei`oz#O42rG?zHh<9ZCfty+qwJaU8%tnu=qZ*<OpR|H!l$&%?%`w_#&L`
zZ~XqR{`Tv`Gx@=~nB#!S7~nQFj9@VKF^@@2z^@(nZJ|_xWTa#MJA1zQqg@-PUxe&Q
zT!>a+T)QvWjvtBuvCkp+%7aJ$eC+v|e7Y`9;HVMDX%i86Fbs)i7NX|29(>u*gh_#!
zLb~qgyT_h?|HjIL5PL#n1s2c*WFA*`!S&(Jue|u~D@PVeqfXQc14ES*Pz@Nzjh3NZ
zp@@L~W(1?UP7q0S2#$#9K(09Ay!75Lk6h2Je-dKdh`AULz`z2h0RwJV`^%?#4o~K8
zC!$sq&9q!griQ?1=Mc4GkcdRUAo}=?=2UD{tRX6IoWp@ZfqNn_k-e38`Scq{a>Xaw
z!Aaux8QjOvTcKTW;^M%;zPo3-<4#O%V6`I<Okg(WkZNy&_O)$j-msdJL_&q1)L|H`
zX8{?KK>-rCV{m!!R98>m%|j47h{3)e2_$|BnW;~2e5>~l-yqX63Tee$Ys?g|7EEvH
z3rHj#czDYyNOi1&Xeg``QHbiA%DcK(5fDl?W-+{T<&XQv=GJsU_-jbOd=&n2rT5F3
zncJ-)Go%1$vDzqu@c!6vOFl#rCT!T+iX>Vgik7I5tCA2kdxR!P^I;<bL(}P&)BQbr
zRSdZ0IqUqtPkx?JQ6yZoIMAp@h^&ktdMhM0Zfk?p=nk@kCb6_$Ypz{ak*jl6!Uwm`
z>?wQYh<WYq<y3n7&Z7=$FMOejjl?8Z#l?_l45orjiXdUdQU!8LLR$h!5Z>UOVaVn4
z+JNL30<Ch8P{Fqi2hx)_AGtd@&|&=b{D*5N=CUm&GjO9&BxtA&0c-V^Qq5Dq)pnMu
zCAPOgduIw_VO{fuPk^$jxe$6k4HL`pOm1rBN9oJ$=B-SBvtbzA_oXTdK9yUBwOth;
zEUSjD`Allfh4}A=qDaI{=-ROw49?*Cl>sP~3qZNyOT9-_-XsMplq+05U6^b#Z_ivy
z#KJM~v5An`sl@sQxd}I;KQK=<xbjWK3R1JGF$GyI-r#^8vLQQD2G2khux5~A9<KL=
zCZPH!Reel{NGu#R^QAmC8XG5lh3<n+MLY=vWfln_xD0~P_baKk^l;SLv`x77&rvw_
z)<-ZsH4k+yAytHEy{`y>wnotS=sjPU^UcNaa@J}!b*d<pm@Y)5eWlG&H6+tWEl}PE
z{KmyGc<1;fxHmEl4XqLEH4IxbrYs_p1<=6i4a&+~VYx*=YkEa*R7g}`NKUn123Y_?
zYpzVsgUld}lnY1>5=7qI<Qn{U7a@b-NdymJJkYtIOy`4Ocv8m!RU%IEFkvG+I%e`P
zzl~arVdZP1{4`k5Yng8JG8iJT00|~{a1>;qr2gJ}@b+(eVPtp;!K2_rO(@|S*RKGR
z_Syx4Np*UXNZj!Fy=1iUrkTs+M@`4L7*1GizAN;B0v8H}M_Its{}hnq8Zs#bkY%CI
zFJ$1&-}J)p&?F>RMZk`5Jc#%TP!FgEps%#YkjA~9;Xz|v)4#ggH;tMN55=XEuuh^{
zdv(5J@-Q7FWOhnJ(%xgbN0g~XNCR$M8iO7L9~hW``j#+o1TPSH5OiJ;bberZaxE1!
z!!e+UN4{;{pFO!g^^i1EI~u_+i#M}Fi$9Thw~Y!23yxj7FJWfTiHPYsP{5<s)xHrJ
zADM+)>2ZiRI$(qmyzJ{#lgoh>IC&L2oe?&GhcGp5H`9__^#=X|leFfJkqNJKUU2j7
zVQ;}xHG%L*b1F(q6)2`cV}79sef@*5Fk1w>-U1flij-7EMpnze0#^MD_nR8nj9DOT
zADWw*Us@E|%up_kUg0{@Lk%_(2z_<Y%Wn~Ru|xtiu#QV~1qC6s)`+15m(c7Lprr;X
ztBsUdXg#!$ov^{PT!<xNy+7Xb+zX#dKBCs?8v~i0vuva({H$LRCkwJzFAE+B6t2_>
zl7eD`RS%>R%AQ|6Qp)P#G^i6~Jv2LySm4w<NSKlKbNjY^``I0>yXUGG6EaQpM~I(e
zYhwp6QeQ1j7sGBI{a->No<?AmqcpqEJtnAOYMyf4L9Nl`P91`W8RYm}0l^RKf9!kb
zmfei3_!0pUY{i||@W#W0A&$a4tl$L$ydnk|2AMvrfa+{jH1aW17Y4K<YK-;YB$LN%
zu;VtkW*Ma8Pk(*O(}$kf_Jh|r@a0#t1vk6wVx%;6tluZvqNDk!@mzK~x7{w|MFIzr
zP_?4AACOx(RYg2pIRtKk88Jax0v1>flJyPeQ1c%?z3I@I`(Djnzxis78Fj?Bgi;W-
z<1k;GZ8&k|^#d1feem7FLSdchS$Nzw^|?_lkv4(?LlH$q#^)~7#~aeyJ0E}LsqTHp
zKGU*&_CZ%rCZ&Y`^%VR?_{Y$xH6PwNz4vOS?@JT&<C_Y_LMygq9SX|)7|q-g(Qx!$
zTf>^Z$5NaBv~%6=o~^Arhu{;QPb5(Lj4lkr&}@3`-PwUo*Dt4B->oySW8r~jE^a4A
p+LP<j9m(|r4bF=HTj+lT7yvaubK}LR3k3iG002ovPDHLkV1j-lfXDy<

literal 0
HcwPel00001

diff --git a/guiserver/images/run16.png b/guiserver/images/run16.png
new file mode 100644
index 0000000000000000000000000000000000000000..d0d986987308e6244a4b6f68b0a8b65210782567
GIT binary patch
literal 3582
zcwPbi4FU3rP)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C0~<+1K~#9!G|WqDTx9@&;rF{`X3oi6QVdCo#%2+1n;@e^
zHvxqxVmG$#{0(mEqN1yUQo0I6-S`hIx)ISu8?h#(AX33V(WD9{X~m?i?OadJob%n>
z=nr@v;RkD2B)L$G$AVl<H~-P;8$G%!1L<b~>OueApm}}LW!I|yu$RdSwHPr3ge`s|
z6NZ6IvGM*}x5F<Nd+}Zya#VB(1Xd^@VM08$wV>J`X)*m(GZv)LA?)Y|PNe)A@4x%A
zTVGY7ubNSj7=ers1Goq|ksh8PTYhQm^$QDP=3^5xq!NY$|M2YQ@SD|;cT~el(ioAw
zz_=7trKcJ^iH|g_#OIIHjp5g;hvC6lMFlxvqW)cf<5HP-RLu#DbEFB}x!L2(OMBF7
z2CY2GJB)Qyt)R#rtM#KFE@x)GA@_@WE4%&eMPn6|4&gi^dX$cQzP8O5m-k7l28jpf
z!8&xQ*z5mxde3gZrf)sI`LfL&&RD#bxF~QX2q0-1u6(*fh=DWj%;4P!Uq+mbl&a)*
z`Qt14PIu?YSV%_Rk{d}iO3D#9=TS;fNfcMs{-D|vJojdUQQ;UB0jDDm{o!#vEc(bC
zGV2*LiZL&#9!0DT5Wy92^2Iu`KBC*LFf0Pu$WbPiAbrrDxL@Q2UP;gjVHL_m^1@?_
z$TLghEWh1k>Qs$RR?-<cveIMgk!mHqt3^d@l-|E*k1WneoK|@0=nn;Riz&~aOBg>f
z#-q&A9XW=D$0<RrRikQZ8(KH?rkOBXgS~#c7zqk3IVvT(shK}lB}_>U`UOX&r*IzY
zBh|T-`gCKfL2E<Hip<j4^nE+B-}d(grU;Qt3$zl*Cj<|M0q+7XM52IXHYGh-v&*$J
zAI!6uX#i>D`mx1h=R*=c>Hj$}w(p4{00IFBB`|eEGMCUg)wHKuFPxud_8JH@00BZR
ze74wb?{=T=e0Xs9*GpL^Bie{GlChSdIn!cla^}{8Ub+~GS1kpR_+J3{;Fy%hueN8F
zH+QFZUd4$O8;e;X1&L1YYRvT$Jo~-I<oo>oKjYs40GEHDrIU8DD*ylh07*qoM6N<$
Ef(MMw(EtDd

literal 0
HcwPel00001

diff --git a/guiserver/images/run32.png b/guiserver/images/run32.png
new file mode 100644
index 0000000000000000000000000000000000000000..7e414dea73848a160dc81b51a717ece160badec9
GIT binary patch
literal 2483
zcwPas2~75hP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU*MM*?KRCwBq
zS6hr#R~i1-+V^wL+!%)8HtjG4N+C$W)FNJrv=wP6CTjZ7H1dM2v6}QvUo`PWTZxI6
zC`9XnF9eKzXc`RE2HPkGlq#fvAeRA#fq~&RGv}PW&)$2j<@c|>=K_J$!~E=X_Fn)0
zeg9?s|JuUb+)5Ar<bq7gkZ2=v77@7%yBbc%K*Q-ANTl1FQme|Vd<q(&QP-;ZopV)n
zXOQyCw@D2WnF%5h2q>BdA-E63HZhbVL;fcz_Li=?;`+~x$ngzhbaQ!P&h{!3JDL;;
z`%jW1A{F{wBOTOzvR5zs%YuB(pQ7x)$0$2y$TVTAa$gv6cLYEdMy-OgnDTIa|5-QK
zc8<=!c-ssu(x#3TiX4NWkeSjbehJb7LJmn$qb|`mI3O17TAa7u^pX!QP=2N);aH9P
z5MWa|o~4NCI=UG?x%opn|AWiwqbD>%=~-1aZ>$MvmCIlWOWTUZ69vgRG9a?RUHQ*7
zH1NZo`0!pz4?>A8c~c~25YV{SA_||OOTp@I{5607^*ie9EZ=aBSw+|@gFAvspGyL)
zZG<HN7bt_IxXUC`M5W7Jd~==q)c5+6V{cNjAIg)KX4U|QJy=f{{WaU(P2T=lT@O{N
zfb?O+vxTOMD2PH;lwws4(>El|<ULUmGd611)rsyutBIdK8*VZECixw;4q!>mu90@J
zX~4zDXw+Z3aeut`CwE$dl~8%)!X;M$SQp}&LaL#pz+*sFrUmz@c;>NaW%UYy>D-~)
zt#g%klfBzV!%u&a+~vTmmjt-lWjkfT#)a?2|M>B>_+(e01ClwisQ|!60M3Qy3jQwW
z%Fz}%u}77PL=HLQSZj1~<+U1~>w<vH@f_D6_h}?P(e++-`1P#vTpx*cgzXkb09gw@
zPakIWmrvCXu8wp_LLt9UVsJJjCj|tmkxvJ9U7_7SI!}R$D2g1A(6%Pzq?o()*p|o*
z1({DL8y~Fxml^ve)m|m4zJ&Gd-=}f+Q%eqw@83#!hQ(Y-*x#%;Q*4oH@?Bw*zU!CA
zY4;oF$<HGSkP@SneQu@HnF5Cx#gTw+E2Bg4{;hR?`7(-L00D0m9c`Ze(n#~%L%#M&
z0h||;ng+L3R*FV=19<JC!R`6=N!qi05F{!TS`rLyrlquDN&+TRNJT(blJg6WXYX&e
zHK6sFdvg51GYVZ-^TNDTutac$AvQcI?41FTAOs0t(C!@|@zV<^v<mqkr4b2Zrq{C#
z0=R}<#r85oDphp6b>wM9Ds(R<r{)behCbnFj}#O+N*a}6BnMsC{cZO--&bTKKxIHU
z5}dO=Ai+1j@>(B?xk2efj&-6WU+8Gm75-3hC{V|xq3qm>>*jKwdwk;5qFYIQLA%p|
zh$%}T2e@(y0;+5<0u4n9PJy=j+qNPm5jwU9{$b~TY%kdI>Ow>YBpR><U@JDGB?;Da
z92!@*=3dfg`rV=C*&dx6kHLY!f0jUQSR}cQu*~hq5vB+u{}$6th)J|y`j0zLQ!7#Q
z?6x_ul~In$&jFmP8CQ-b(w*td8#A|NyMy&pRo_I|0Lq4)31s*$MIJm@cR)mP`!mJZ
z$yHGUcMVSb^n8bsW=0<!x<*UZ1vG21YonKeM27q`fvhB8d|}gwDhk~=Z`$pVbMZ-G
zJ(E&`02&X2gNWdK%A)7z+5HK$nu;EMypvXKXrtTX;}kW}Xh15(`V_X)Ndnw^VbdU*
zv8ZcT2-(OLc!4R8Q)9=RwxA3y`7FT%xF+y5D+!2uz!xoVr^laeqo7++dv9dzBxz0w
zs=kG&r2x;k4qVRk)Ih1Dvzif9KT@JRhY7G{js&72U0JYo3Ibf1DN?128nhMOiVN^n
z8*1crX4KPPqv|Xlz>1o1Dh7B0@D$e!Yz?C8aWnHo7K+L>7k%`MacEd6)o=TUWD>%r
zgSU~E8my%S_Z;?0*$7zAOYoInsFKs3Quo6(iaLF2B=8(zk5%D)V!bcUPYxOu1sHOk
zH{2#V&$yT{*M%pJz?pvTRQ6QEBAE=v3wy34Ww;`x6lb|D#4Ogd<jGE2@f1!uwH9^u
zRVnE3Xrh?|R9Vng={e^=x0Q;cTL{M@O&#9sqYu;4Yp#G%CzAVdcKjL}6<DZ1zzV!q
zyd@#LGhD2#CK;-|@chxwMU+J`b<eMo+wRgBb^#Y0=enf}aQuX5>lARvsbO$eH9g`i
z-#3RAV2nGQYiBPE45jt7FOOAmGAv2tq5w~^4w<0qx0}?p*rRY>jhcRwI(jiZYYyFM
zWW`ovZ*@UJ>0<wDE~^N^MudE%C=Mqsb&Bq{C2vH*1tG;%zcctn-psc*kz>`eCpt^O
zHYQwCeBpMGW({%&P!rcvlA&wC$C@eGme0{MW%n~>3+8(DQFw?@I6Jh*fOfa*R}GpN
z8KEIK<w{%mZpGOd^+sRK(|m1wgGng6@nzYZWJxBqEg0Ld9Tbt%34~o6Q=SXSK4TK)
z$RHU=TN{<$3W;t*Ug#fwNxZhBkCxb$jv5ffp2nU;c)nBBwSCa<j&H=2$2rEcDdqq#
zk;Pj6&09H5bb0bCPNoHkVuvtW2VwVSg;ZTwBY!SVmDTL#dimvVucWmTQ!ggi0n=x6
zA&x{n;VaS;zn8wOHb<M3)iaFGqLmil1%avKu$TldyCX*ok?~M$VNXPDs1?5#eWBK9
ztaqM&Wh1?C<gPcPnFI=b`IbN1r&>rmoHp5$jHZ;1wJ5{((!5PoaXu)<Q%PJF(UE8r
zZp9_PBcKYvD?JsGvyhG`A6+k>|JG*u`dhL*j!zM2mZ#I{#*RKA!ndNX=&D<F-jK8E
zpAByZl#k^Yu_!i7JH>-bPlH=vOhm8hA>Sc|T>&{ADAa076|eno>&2GuZlV|eK7Ej%
z@h-MM*)s#Xi0K?TpCVbMrkv<FnC*M{RB~)v(rhjjG0-6V@?>=RX2ZEghvE+B;FN4C
zxF2e&dF^MGiPgXT3~l<&Qd%|kpjS|F?_|68lTb{@>F|OR`pD)B`RPq})Xmi`mCVPn
z%Poo*sc^YTxq0YBS7yt3{~n;n_N|~N-dRR#hUsHIA4_27=LTJ+Yc%}OC=EZ7Q#Kz>
x8G)8u4dWH64$q;!^K+^1VjFe--!}gzzyN(oQ?ynoLjM2&002ovPDHLkV1lO|r=9=+

literal 0
HcwPel00001

diff --git a/guiserver/images/save-down32.png b/guiserver/images/save-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..10ac51b98ec05b202a3375ff10a85ebe93d4150e
GIT binary patch
literal 1762
zcwPbG1|9i{P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU&bV)=(RCwCN
zSGkfLMG(!px@Y#%K}aZ;LlANZEP@Du%@1H;@BvuZIQ#;E#Ru>K7&zz)WZ>Wn1q6Y?
zr4UG3X=mr?tEzaJSv|9>8QGfMitg#Is(khG<uNAbOfU0e=_P;sc=PF3ckA5EKkw#G
zKRdSbt8ZNil&#{k){r$A&XB{s!DEB(_?Hip$V{e`DMr1fq|bO>yK3pzlbp`N{<5AP
z{OB&d_T_h9e0XvJz`swPeR3F|e6wmh3Re?dzJv{k#E5ekFzUSC3mB^acus~f*rXJR
zhE%Q$B=Y)9E06mpJ)JEYihcXe)VQCp?Ar?fX0x;RLKUe?4x5T;O0eK?YU3@88}hh%
zr^W>U6##6!oStH$0Y<S}-ZC%)%3?OuMC>!*>3nv)<pRu&Enc=mmJQjEcWTfFOBIIq
z`b+_A{I~{yF${)!n}o3*bTB)x%eb(2BF_sW^;-ZU9M<CmyokAFV+7*?r>-hXK>%zR
z5dRknMgR`OS`4GE<97*c@ET^SgG&Nzn7BiPyvdNWAZ3tDea22s=r6{-3Q+-!E>Oly
zG9m<L^t;2b_@1Ng#ejq%%(F3X0}vl1*-i`uUW8NE74Cx$2VR|1`Wb*CFeL(Di0PKt
zHs#O4C5d7IkU2Uqw`=2W06c*|PEKCJ&Z+oZxwno=D4Na6q-vLYeoqVvGE924BLMvM
zFn;sh*Yge+h@N?=sFqKd&FD;$`)o>FmRz6|Xe5-tk&#W=sjOd%7B+@H(($buI~XVc
z_-YNUPwUIcB@ft5PO#RjMaZ`UsVig)jzCwK0h&(qqKD%(3}S~1QZb%2`SAW$H-CPN
z#F#=tVsEqf%IU39#w20!es;r^#={N~DtmeDic~PMV6DViv6u?YnKp^2<Ny|8ELky@
zF{HA;p*0I5_UBxHb6}+60*M08(V+LPWIrdT+Axqc5JWRbqVg=3!!THm2#x|q%s?%z
zW%axWlPK9>;(XcD<C7J+$|DS&B%(1AHU+6DJD+19YC7h@;nyMabbX@5S&M5d;x78x
zazR#l80@`=1N}9d)4^V#qkTvF69&TRSX1$ZTu_pi7%hf-r1KTRZN7>$TMV?oflij0
zDywcX^dbf*iT|E8hUVb$5SuNMmFu)NR0k|TW%D+dQ>d84=LJB|^`y_VXfn-~2>=p+
zkQla@UsZwry!QuI-QFFBS<4qvD;D7-Lx-Y*S-~<pRyG+*T#qLa0PKc=2N(eDJ?J00
z0d4{H$j7{IHk#IFk4|Z)2-zw}0cS6!u`yW_h~#%K0%bqDQ3s|pBBdC0SkrcCP5%nz
zmA|uF_&w`}nf9#gU73*o61d{pZIZf$N@ynWucaP~gI53}1zC!W0%%}-iLq!RH89R1
z97-%oc1?MAOGX7iPDyikAw@(6m94N@-Jm#yNR>ZVl1V$C9&<VvY6=6a2VToevU@a(
z+fqGuB%)k0;n-MYZElErghSBr_LYpNsHHF99zkn{mSyb+NLUzRlKX#7TKfIJ=E8|x
z)_wDf7)ZHjAgN#Z13}ZZeM`6YX4K7}QK)O0OeS>w#;bIAcqr-CplDd_RAo&KhVI@!
zrTc%+C2@^Oi}z=6DeVfw(hFn(p`v0865|NPM~|M;gWrCps-DnfZx0Enf}$tFodp1g
zDrK$Jfl9=k6-NXo7Of$rZ^)a&J?Dbacs^GdNg^Twa)WNUS*}pYlK6MASkba+Wv)lN
z>^wkN4`9fe(gP+Dv>oGhtdb>ccT_{OuJ1xw-aHjCbuF#tb0nf3_dTsvD{29XcN+pi
zD*^=iFb^PuSGBV~N)*daAakz2*aBcJIz9thOVTI=P)OPx4NK(pWkbnB;eAgnPTv9u
zM@`_<dVugr@&zX@F2^oZ+CxhIhl{EjdI?<T{T6`w%JFGfJ(R}I7B6H`uA_Pif6fMK
z&Q3vhK$Q&Cfq@=C@-P5I6uNn^8+&dJA<BC1NShbwEv)E-M>Rcoum!+fe)CQq<{t+?
zeBkof;b8&*_^PAn{ytrQ<0dra<R_b}Dgi)}Vzm{`#c3UvWjh6ci98);faKLq5036k
zk6!s<3qZS^{o=#X*C8!GLSGOx7cvvvU=Q}v)obqH{oAIb6xusFgl#7jOYa71nc2+0
z-|*eI5Umf<m3#rD-dFY0djInGVBzt(D*SSPp8qev0Pyz<Vn||PfdBvi07*qoM6N<$
Ef`4K!lmGw#

literal 0
HcwPel00001

diff --git a/guiserver/images/save32.png b/guiserver/images/save32.png
new file mode 100644
index 0000000000000000000000000000000000000000..bf923f8d81bded61c8ddb7d26288cc2b6b72c804
GIT binary patch
literal 1534
zcwPbi1p)erP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU%kV!;ARCwCN
zS51o?RTRDNqpG^QdS;RgnM8>)B1Dp)E5VH@xOFE)`~!juap@m$DY)|=xJou6=q4^g
zAV@$W3c*D{%ot5F87JL6T_0T^?|JTfucxQ&&c+@|Gk2<+s(0^s=iYnnD`BmrXZexz
zj6Zt%<&&=~)lJk#TG)>->S6!2vq~7LEi?3AITA3XB;^OWxcNXf!;_nK=f@k@u739Z
zr{n#HgE;_unSF1&BR<b6>TaCw(D|2pRKvxp8PbT54K>~RyP*9c(fK#u`ta3vKKL28
zzMKPaP_&n_N_R&^OI2;DX)TrJ7yw{>%f8_ANnt3>C8^Gd?S&K=W94{aXasAFC5`Hc
zz~QO@A_V~OHEApzl$J&X0ZeNa05m|5RhHOVWL;sQY>8Iw5s6Jm0I0yi7{2qGm|eRB
z0Mlfg@okIzH+FRf1l9|H;F#>YU;t)G7Z_ux!kr52m_S{Jjv)nzP=EmgN9?--tL;(%
zmUHj(?}!&3`Klig{4fCL9{|je%pL;ZesA%BF)bGO$dy^00ecwDxJ|nK9ogDk3M?D1
zV1dM6qK>Bvrh1Dy5A|giQ{ad>H0e^Hjsbw;y>KhQuRwnVx)%Wm_W%qGNG@F~(7USx
zm~Kggz)XhZoh<+W{n9dk79te66={4t1II$q6gI`al`BfIBn1eL@#7xcAC&a?;gAX=
zY1MJ9k%KBPsVHk~EOx@gKo$T<5ETJH7vlZR-G;9HKA=Wp7H|@knDvvT#s0L1|Ge^8
z*Vj&QBot7f_eK**efVZqQY_H{&b<N%h3jr9C@WAA5g3SgDB#L^>Q;&)!<J@6B?1T+
z+&Hxnl^_B2Q`m5d<?G6j7CzR}6v$A73Fk|2Npjy}CCr!45hfNAZD%ZS*_lw##6=Bu
z8Kc!xFUuHcQH07Z5^gcMz%<nb{;mQGPXoZl)MM99@L{$IYKAq=@4qsr=OxQ`fpfy5
z!J_TX1Yp3Rb+qvy7FY<>x7G`N?Nfk*0EspL18|<Rbd;!nOR)nH^5->EI6Y|bJI@<3
z%wMP?@5fFD36|Qh7T*D&3!o{>pb68}3g_3_`4N8vfY)k^Szv=hez?N;+(;UF`<$V*
zUgG3Y!a2(-=SfNY7Si{&^{I#f@Ynkp-M(L98YZ}B-FP={*4R05n*o^40%Hz$LIJ?m
zT1D@k*`x99pA;os>Lq=8<-!Hp+Byq7ilP|8rC7XX3is9bcj)GwN2E`lfg9eO2hchI
zc6kbzYBv$BnH3ajfU~{x$6xfz^=lM&`_$jqfSsbXQ>V#R4aEQ(Lp3ADAU%k-smaup
zPk}Hl1#JLep2h%=Vqyz3Q~-o>rO{GZPH2)9WE!pvLE~{o<GgSIY6uNm9J9p$61fey
zez)GAbti1=&IL=~3jo~}T_`=`&gZ&O$S2<^i-Pju0CZ2NscXu|V}L5*zYV!Hfm#ay
z+SQQj*uz7K@+op@S~3fw-U+Fq2FGYn2g#Ji@7~}@8+CH3M>S0l)Zm#G0E#Sg08G=&
z0bomUkl>x_PU_4lEM5?Fr%x&Ye>#$j47BASeQuj1hDHTCO=#cPXj)qzkR9MaxxWtp
z9jcOqY6Ne2_W;nK5LGa(5w2}elL@7#o~QoiIj4qvuhUDZn?j$my~hgxh7W)HuAg=<
z_cmX6LpHNqX^4=Ha!S|MY5U?O94;cT2pW~9(ZPZ1?YM5xEdY*|;cFxsCxpFp9Rd3u
z0A>jn>duXCuiyLO%GK~<#C7Hay>$5tdUE^9i%F;Zx{NxJ^=C6T9THn6oBCi2?cbZd
zDq2^JLV695xOx*fhAFX^wc`g_ybC63Rx^oHh^ew{aPOyEbw1ji#+{|0nNarV?#?jV
k-&r=-@BdG4$Nva001^*(i0&Nxr~m)}07*qoM6N<$f@H48%>V!Z

literal 0
HcwPel00001

diff --git a/guiserver/images/search-down32.png b/guiserver/images/search-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..f2edbe8992bbaa933f737a029175423baffa734f
GIT binary patch
literal 2473
zcwPai30C%rP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU*J4r-ARCwC7
zSJ`h|R~i4#z2`2ouij_uv7N+Dnz*TwK*4E5E7qzActCyP5k=}ldEf=4A`lOiP=JU2
z1xQGU0)Y}0q_imt1k$FB<9N$rXX0f%i^p?kpF1;m<vVxm#CGgdMdC<Do;g0}eBb%~
ze%~?#4j4Sofo<DhS$32V80RU80T2<tS1i+hh+C3^KvlNK?UvyD`Bz|Qup8QK-8paL
zG<DOtW9JYB3YnY&x26}tG%cV9IlvB5N?!E(Jm*7QU6X-OB+3)cZnj#ja!JXS6y>Vc
zZ2#6U>>HF)o1(-2%Q(;hfs(HdjV9jejSr7eUNnel<}K5xxn(yE2g9*u|G;a-LiVNX
zdge_^x!*Ngnn@5UHut{zX@lQykt5K5_}GzOjf_v60mE9;8nqcy*VZJFHr#Hx%@aE#
z2~su~j`n$d!i&{%F;6%;JJ26R)ObK@z_cu|Eqh;TYxO2%kp>6l{Tzry!;^=PO`L7F
zG)1kH?@E%Oi4v7OZdpVJs7+)}Z);86u%|r(BZoN9e^4rx=4y@R?R>sWy1Ih4&+mdJ
za%>rvgUZga^ZULI_(Q=Vx6enbg_RWLi6Og0+3gkuw@2V)7iW4sUXN{AQoXL$4TD<|
zh0)=q#k*hUc`}2B?YX&SuBSI>#|NUeH{fx^_DF;x1#a^(P5U~4aBHo4BMX+Pijp8Q
z<H4X?^!a5Go#6z^TP#3CiMVtP%wWh>-pFN!HBAehI5AS3n_Yox|C%R~MD4&12bfW2
zRuDLc3V;KmpjIvxl+5Y_QS_LSM5xCj@&15|_jo0WFCZMpv70zSKnb~c%2B}xh5|a$
zB%c1<Vfg3OS^F>V{Ci)~xm+SlOeBCgh9M0!8u9NAKL>$UvXoy{d*frW?DAT&Ebwef
z3_gxy95T6cJkMJ$*^Te8TQ0Y-5{pHRu|o;?@lRg0my&6izLf-zM}EvZA}}=64L+X>
z48!bD@bcGA?NX?Y$>Zv^`MGRvb2bw3eUlFz$_b)m@)&Dq6VS4QBknaNS#JCNKD|)L
zt;OS!h0|xobQ?5&I6h!qy!bP_P$~hB4$HC#l}ZDC@#fp`FqwU1+;IS(@i_d@0i&hE
z;9$49u_^p!btOIM_0W@~ORVvnTjzNJxA3@+H;@Y3>lHal4c*YSJCkRhNsW!iFfUn{
zGMWgn8^XcBHt;Zg^B=Ify5WTBuCSaqk?4p6XQR=Cv*(V(kKT9{5{aI|>U!l~I-U3P
zq&XP$ao%uHgh)i>eO}@<+pVx+Qg69ZNrxiR2a{)yC6U)AUc;V;^qQDLbbKL!ys`nm
zyzmFeWfYKI!XtZ(7W(=Rzq7?WIM58nd!etl7ka)Mf|JjUF1&Yn`ojGD^2a%)F=<$t
zSfuGgM1_8l%0tbj&`xK|m6Or#l}OlM<v3!Y;`d}9g7rZI#0jWCo$uRez;WQzb4&vU
z&bISU!_uH-Q~^T>o;^N7Mn-yb>9q3h`nocuD7Cn*TcJv|8K_sAU$)HJOVvuX>-v96
z!NhQ{`lT060!KBQWkC!L;DB?IZM=T~#>eB3OlHui^jPgo18@KF5=@*Jg`?xc&^A@*
z<Oc$}i4YPCSlkaKy4$gMG>xYVcu-Os8o6|7YUYz0^IUo@^R4C8l0TKopO-{o;R~NX
zjgiuX)Orr8HPzvqRm)(=hr;EN8_S8LM;f?2wFpZ~>oEDkGZ6GeP>BZYt|c}&agQHR
z(I%>26Gfq|Yj$S#R&wzD_orSiSJc5=wkUt};oZM2C)0NFK@Jx0r{U&}MYy++g1MPh
z4DC)bDwb+MII@+F3Gj)bE=aEz5S}!gdVUlFo`B<_Wm`K+GuX@tJY?ZH6EmS{7?!z_
zQ^c8>2d^~Lwi_v%*w`qo+`FHe86NJ#_(!N&qM=9x9+D*i`uZY{_$rlpM}&?8iEiXu
zfR%??nEH4LX6KU-3VI#hOk01VO<-ONoM5di=U{GrEuYUTr?Oe)C}oxajs=6hE60x~
z3M}0!N(EH44Xsui>KI|oriM8|f_km#tYJz8$~-~!g2(HE<byQazng-)3#;(PPrnBz
zCys(<H5}eLss)gE!7dc4aA$rU3i+xUi3BgXWZ~OQwT(G}Ka$HSuV1-x^R+N$*z4C9
zFtHiCI44{AW^Ak<qR{~Gu~-DQ<3f^|SiG>AufX)w5*#_!2eIA(e751hDDo0)7Rzw;
zgE=Ro<u}WKjmT!TT05mE^<gGB%%msK=p8(CZ?n)rK+}v}leKM{W+Dn&$ARto%#c7R
zoz%%*`O)<|5Dd#Oe&i5qQXrkp!#jWa5EkZF9d66zIutf5HPbXj{QM18AMg%}P!HkX
zzxVZp>w|+`kQnL#tP>F5G5uJKL_xr6=wzi%Qea`S?Tp{=hN4n~UthQgc|?S9H#f5k
zHRO*u%C~WHEP1g6BV6`+r0W<B=UgrcUuZsGEY`k{mG9>)yW;0vH0)Fq9~%gF!U1o?
z@N!l=&Jb{6{4xW~a5|+pa9XUk<3SU%rluPNlM{orqUpL9o%;%hg@T>OwNcd9HKZiV
z_AmiHF&PB|{oyTxoFfh=2^j`q{4l;)&1M^!5D{ubKt-oIqQpI916wfW3>w>1Rqa{4
zc%&1?5Wsa6b@5*3to8J+*xuPRR#kg`VGRt{)8XNs?jVGY`|#DavsQ1YxNbtd-hy_k
z&9aJ(^erRgzefkopo4y=vKq!0@iC*g{$Ts}!V?Yf-UX*`z`qEu6GF`M-kuOf2u0&Y
z2Py0e>Wvn;znCVOOc5&OI>)F%3g5-X<q~tw#)%h&+AaO?w!rso%b5lk1q?POLS}&R
zlgpNzY}L~pfUYh-sJO;xVb`!IDPx0i=U$4TU?cZV0m6IgcxD~1JA!Rz0*!Kr*b1&q
zBTSlUS)Y!;qsA0BV@CudBRvj5OpL5tvy4`&HL$#zD9BFLU>$0?+;GAYw|;_-TtFvo
zV@EBElsjh{*2sRw4|HHVJ4Vp~mRy(+J17w+WEmQoro&!TSvzMs)s9?7GT*{ei+D~(
z2fd#v!Y2oD3|o8p3#Ji{JZ`b~4i>6Nqk)G1j9pO){qdpk)Mx%}_|!q3{_m~VR&f4x
n%Z7E}RiEXD<o{#*SAYQk!ISSFiZBqk00000NkvXXu0mjfOGU3q

literal 0
HcwPel00001

diff --git a/guiserver/images/search32.png b/guiserver/images/search32.png
new file mode 100644
index 0000000000000000000000000000000000000000..7930caa5f5831c179a0fd86ea0b7a6f3a7d41e53
GIT binary patch
literal 2551
zcwPbb2?+LyP)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU*iAh93RCwB~
zR|#ws=M{c)?C#8--qRPpI1+P((}1H03JI~GO-T)fs#04Of<&V#RU@jRrczs?^iZPG
z96dvbBBg35K|yJ_+9VhP)R-HLZOqzhyteVN_w4L3XWu{g#HJxte`&PdotgiA@4fGP
z-)~CF#o*pWQ2>fYLpmwI(BLIkI3B8LyM1R)TBIzJL=S#?^!U~FYo5BXvHqK~&+7ws
zfg2<xYrIEOG}*!Ud#Xk5XR;ZHM5CZ-8c?z*OnQhla}bS1;QaX`h2coYw!tiH0LEKJ
z>#UZ|=Tf0iYo{c{J}h+=?_XZ?rR3(#TZTdBN$4*GfR(BIr1V+5dOFWloNaF23%1H9
zT%0>yRv5VAwDEnpyu?)%Jv8fPSM$rkmXjMV{psva<MG7#XSQzzmf=7L1vgd=5D&7b
zoX|Jn2b0MR$w)68JNxgq26X?{vVwvW(~G>vydKYh*<x`hs_ILpGudQ9u!aZ1kDY6L
z-+J!k`JIavJ$Yuw_nv{-)$@#fbX`U;`sY_bljZSv$g40E8(N^b$~RQ-u4@nZ-TSAN
zlnSz@*;Gxnm>EWMxmd>Mare%eF@0a5-&2<pQ@j3gX#Wm;xp&?AwbY}vwYt;k!LN$3
z-#s~Fk;kgT?E3L@22ukpO@S<>;ZAgDv0^LQ?Bgs){4Q4)#W1$4ls9K{c|}s>EJIUn
z+{DV5=v<+%B&2D|!{-}MtBHhknddnO_w>;Dd=|W(0GLf2hGa%B3<5GHEoQ{Ke50`p
zqvWF*NTdXa4fczCY4KI7*)phTsx_a_)0(b>tjHEk)j(I(sKsoN@w?e!cV_0!UD_Ea
zDw%fcW|z6Wy<JKq63}p>fwI}{dTD8i5s(yDRa6kuBCP+)dRVw{fzb-~{X-v(^@pZG
z6f*#FU%cApZLn4>jZw75s;Z(>46T!e1fx}r;L$bmJl>;u-kvp?9pX@=nQdyiAmKB5
zGMR*dfx$@}sGeO7n>KI4Sa;iiglESIfCjV00nIJ_LmYin_XTE}oQ35nC7))oL6n(g
z5Q?rb6s;Sz)IsAc924$IX1cn<E&05p^!N7zRzRnw(BaaWCGh6nKSNbj6?x_^fYqzk
zjJ1GeL6T&+e!Zpt;}fU4yaDeTu6ApqwV*^&Ws$>D=p1j7iBu_u)h(P&rdgdned=E~
zg6$pGBuP>wDL<@&iR7zUwiNch^(M@iF&$#Dm{Dy*1)1EK3OEZ5{euxesln~2{ouQQ
zJvePcDpp&);_Gb=_slrQ*%hASG$f&-$r)CTv=w}EsWJE7-wxhFenxQ%bt<jb)GWo!
z{{qveS3xuyogg}Pyi5pcRa3z4cOzkR;p4`{YoVSGzqY*T^0N60mX=h^m=|+6+*B%&
zDi{a`T|#^ij-P36ZfOlCZ8mF8Os6LWFDxpA7k{}M`~e?yhB`;%unY@Us}<Ps4_j?K
zw6wIr&tLqFQ68S>Q@xSEyNCYS+jOiUxTrYb2ymR4Q)R8v%kj&3cUdGfn7fb`lF_P)
za=o&=90UZRD2kzVQ4nF_;ssDt6o7alHasDR6D6OTPDn_N_KVDMA~$VVn%Qg?gj7tO
zKYw0pG9}(>zBS-9nG_CZhO?~5yk%9H{N<I4N?n2=aH5#aa2yBQwtW{o9uIO!GC-)<
zPAQki32Op|VGNHTGl!;_Vd<mxbtCAM?Sqscz?G}lz{>NAEahWGfl`<^Z*E^KmV7xT
z$dJ!vziqYI7Pj9CKHuHj+f`G$3~V+V2tpc3eK&}zXpon4pcsjggb@TiO#JZ@yx$T<
z(YVNJX>EgCE(e>Q{%R&39}Mn4d}xNMQ8TPO7r{h!?D_3$+QNm8!0I)t4SE@ti&<Mt
z79+SMOB0=U3;+e_bb#eX)-FLSzBnbAWhkddYga&^xCC;l6mmHEp=2`aH<?XaJ42x}
zsig4E+O=!J;jjaln&TV*9Ed2705Z8ONO@@@0J1XJ^NPxHcx}%s@Pi-z2%64cm=Ju)
zlEv`G>#xF`*|Xu3PaB}4D|Ds2eA;K%o7?J<I}9fA6Pw+34o7cWB9Vm1(2&7_k)cFD
zprHX{V!`9}7_)#1wl<HFkdOl>Jvi-lh{faZi`_55frB3mXI=xp{?$uRUHveUGXw4I
zL1;L68iK)=@0>W%urHfcX|shTLH<}*_vEu=;Jp3zJCMm_jR7~Z&{vS8Zg}<eJy2Iy
z2h4Nde|CaZ5)h=vPNx%Au6)dxT77r!z|Nh|WAJL|?(W7-GmuQCAQFj^42R<J$dZA9
zNEI3sVgGzZQCoPcwXGxAfrBSzsA=RP>LBk93=BX|IDBsfkTj$QNE}i+oC5}ldV2eS
z!7Rvg<RT>{l0xHw8!fF64tH!nd*<997}mlXGSi`P!GcHXXU&><r>M9H98SjsK8z4M
zkMd;4jX}_<v117dLJ*r#zr<2S%zFHMCz>xQErwu6C-yUNJmB}94fpo1^!mJzN@Z5y
z@7pV@DtEV{YObM-&1Ul?LX+*-k$|N4+Hi&}W=FCgQ3vq`QW4_oqlCiG!a#ts+pT&g
zXX_3W7ar*D>8n*_&BS3Vl8MAN41O5*x!8dq?=`2<BfuCOFiOuLGlf)&A|&hV>V}Ta
zE@*3OhYX$*D7-h)0-RuAF`E#SLRs(}SzJ8ru*XwyDjJP|N(P(Gly~30{VkLm?eqEW
zJ7XqI9~&CP?e1=U>-HT`zi|sZwV@sv`+K7breQV{00c~A2!qKoW#ui%Y+tCjq~txk
zEr=PkWZDdAQCyyv@|D<%2M0hlC#{Gg`{Ri?*#sVcVl|YNl^Sgzk|O;SM3MUYfrHfP
zGiM+a>Y`bO27h7kM}b2B2dbQf0viQ*a7}1B#RdWa!waTb>?C50n9{Hz)z?1_t5&T<
zPe>cUaM~CIym_--KYa8!#N%=Odh-pKJ7*4((cACw`hVxJ+wF5I9JSL+T=Mm<oQq{i
zi;4{ie{KcHBEiWlSiAOdc;SUz7|>!25W_~X3gnY~$7c*?ArB10x_I#t9%{JD4ww69
zETtZC@pOfYH+`eGr^ko0;lWy9xEBVoV42sgtAm1q0^^`M!hU0XQo}sB=h#OMqFFp{
zd)@A4LACE|x|zB?l*p8KhB}J+`uZNM1>?CuvK;aC@xT8!=WJ`ci4sf#Z{;tjO70c>
zFUp@trV{}A7XzSAaj<;Qbq7zzxQN|-M*iEo-&xT}=zk6J|62bMU;sLy6BBU!_+tP7
N002ovPDHLkV1h3s+hza&

literal 0
HcwPel00001

diff --git a/guiserver/images/stop-down32.png b/guiserver/images/stop-down32.png
new file mode 100644
index 0000000000000000000000000000000000000000..55867554c2d06e710f0b986ac879c75849c8d5bc
GIT binary patch
literal 1669
zcwPa827394P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU&7fD1xRCwCN
zS4(dkMG&s;p53+AfdC3fByp~ska!3Lh(Ev;!~q0>16MAbIFKioaN=Mo0de3TaLf@9
zF9}e>kyk*FIDvTW$RW<gyEEOzS5@7+V`uGfW94%9%=FavRdqdj96$O9?eg<BxI|9p
zK`!!rm)FS1kklGYn9CZTsr~#9RNVnQk@xg_imzU1nm2%6dq>GRaw6@;%=j~*G1L5h
zAI?4;!h4Q6O?1upRXc(^#|mE8uYa|^c6#&XjrneX8@ve!C<`->DM5Wo7$Z~NB)T{^
z|7^4Gf&OFNxg)qK-k3?E+5ucGzi@5swQsHsPN#Y_e~)Jhm8TFq`AnqvK&&p{5#X^-
zG`cmU^TXjgy!T#y{Jwoh@j}9)+elQiEe~{Ib>;Bae=nbA$MgO9E_J$rDk0DTxRB5&
zaJIY5N+32&4G1_8pfQXd4e8wFjU#Ea$xrNGJeEngc1*MhIJG<k`gO2!_{+bR&rs$1
zdjMW_JXIjj>3Z`*Wn0kp0K<AOQsbF=$59WGd`;(82S+77o;<L493*VNZX+O;1N@hj
zl~=wf;Jpqk25`?)w+9b&4P3T>avUfDSkDnEK%jsNIf3bMrFh>D2FGOCQ;Uly)P0#m
zmBC5Ce**aDmoI%t0pQ(=yjl(cc);kp0Iw_toS!D3WSe+^qU~bI#R~r-P&+A5gYmn;
z;5gERpFVWxq~I9=nSj8LSFgVO>GJXi9H_qla0d|C@6gHnt^#oJKxJ;$5a8?q5R$Bi
zA3*`{06cWyR3w0F9OB1Fd^=b@5kcaag9qOg8>;n<4S#84<Au+zT=^&x_ZO;4vsQtE
z0XkT%B9<2dVY&q=N^wZ)5Fvo6t&6fw-V;`=8I<7qbE|77ZwznM&k>#SH|qMKpVzOy
zxRJQu0f@$^?4!?sAzKSlPMj5tke`t93g)s`?A@ZHyl>mZWa%3q7l*@_bPMJ>UDpw6
zrIx}h&OyZ9=IY*}JQM&@#j*uj6lJaF{2on7xcp4@<|5!U_!JYorH)y>6o#CWl-;&*
zhES`}^R{_gPil>+mAy)U%?N!EbGOljJgG4{Pf~24#o@wbRxY<6eU{3));ly?JWW|t
z+4WpNqXMC->D;cplvxBvjGX%*o9ib*$oecsE6K6+1)cMRSRp_>^;pH;YkQ080hU^f
zbRkWd2AZlU(QHMAeAyDTiZty7LLgy{l1Nh$s-p;-B%bzfB`_S1smAKE1>$0{I6zs2
z+8!VjtjKVVKULycgHIzUSt(WzNHda-h(&d5NiwgN7~ssHI{U|;v;hLBGrGWK=40Fo
zC?LMck&lp1nTt=w{k*Lk3IV(i(lr{Av}Khj-n8xD?1hO3t~HJAP4SCpQ~yaJlFnwS
z#2PS0Lbk)ZRy$4>6ERv#ZU8=pY}QPp#*8T*ATGr^6X@XIn9O=R(zxtW180{eSs}rx
z=K(ED+&&GNWdfe97XqU?f&k{x;y?mgDrKjY!&R`<Q(Gc)Rz}+0NWt0S1NXW~x*=;N
z+j1ajc|hW+hUMdNR1#$iBAed>#;S!`^>glzNY8Sb0X~CjK;bHaO_NM{)ySzRAIn-E
zko}F(GN*3EK$BBZ6joR`CoS4)ffb_riGBn4S;Wrs|KNTt>5|-(1Qf;OjDUg{5749#
za4tkKrA)$zl(dxn6SvQc;Ia$Z3rr<|i!tP5%;)fY2_(X}O~P4yXxQnACu}*Cwqt-M
zg(v1BlyXpaG4?U`GdPTXAM&;mh&eC!5S@9@f^_NnghW2v2)NV-$^A4v5xZ?cSjH02
zqO2#tLSQTSTU(A~rE%N^68l>uMr_toF1x-}ekGi@e05BEhY^vr-E8$N@U;C*$hi`V
zCl1)HrFD?l%p{y<g4MqEC&`v0F55SPfQ#aVEWI7TXMPu?776i$WX?F(feBRM;HGnK
zeNOevo1#afekbsm1h_@wpebCsNqWS){l~Mv=jO88dv^fe@zZQOi8YXDtRvj<=W<=?
z{0H#ez6~caA%O`?61?yxF6(@IR}Of0;clW&_7NS~4crzp)BpMVSAYQkT{#x%Ks(A9
P00000NkvXXu0mjfuYVe&

literal 0
HcwPel00001

diff --git a/guiserver/images/stop32.png b/guiserver/images/stop32.png
new file mode 100644
index 0000000000000000000000000000000000000000..68b3df0cb1a6744f6888ee895a1fe41edb92916b
GIT binary patch
literal 1586
zcwPZA2F>}2P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800004XF*Lt007q5
z)K6G40000PbVXQnQ*UN;cVTj606}DLVr3vnZDD6+Qe|Oed2z{QJOBU%#7RU!RCwB)
zS38d!MG&s)nccg+7x)n%?6U(zLIe>BApuA{GJ^~W2@(i_5CKR?_<@ZCA_F8_CLu%!
zBp@RoL5>g!zrdEyMt9zO*xp;8cc;6ks;-{t9q;)L?o{fY+3x<ndiNkb^&~vt&)FCN
zQRW2;+IzI$WF%eFi~)#3wuW{CDE9ytV1QolBy_rO@^cm6$-#&dtBEKB>W#<aUun4g
zWmkwq^5MS_aC(^Iq0@Oi+`4@c`u#a@jOkpXc&;B&A_C|=;L_4F_YNJL=lQ9Q_hON$
zB+9AahyqTuvGJPU+`0hU+jBS`vjbdIJdsF75bz{{fS7>m_hDvp^OK#0d7=XcPIsLP
z5W;;V%BkQ*L1As}WVLer0(d`<GhLv$o&saC0vZ7_69~9x@WAJbRBVOyK6Lv1Q+Kzw
z36_`7bc-VJd6>sUPJlg&fx*Eu_;_XIBEMR|-Yk#+mqi2?D>yTMew1kLgaoRPS_;82
zk?zg@>1~b?T3$Xo!^$y<DHe#DL$$j0>PWzm!8;w0cM4j@k&1XQViN-tC=y`{$Zrbn
zEi8&?p-zAO%pGEy$B&(xl{1Y*S^JV-j#k%R*|~P@5(;=(0v2NOs6ENN#M%Os=YWtB
z65<i>n!KZ!97F}5#qqqp{^=&aSUP^}{Jbc~zm=*X6S%j!dSZBO<q~gOZ~|^xDhUP<
za4J&_VB?0A0oZs$1HLeDjt2?|ffeDfhPjQ6b2r&!mk%HQY$yc$V1VPn;N`*f8{hJd
zMF9_*<q_Oj(2)h8xB!b50o@Q9tra}FLiPnmO2+eZhvn$z*7+Z|ZdD%>ec}9g{P=L|
z)`>BL2L_Z%!|}^!@<tTqQA8;*J1Gel#o1WenzUX#QqR*fD1jZ8lI10$Hy#6cqJ(bO
zQBf4$lyPXxG0w$3m@HyKsScV22+-n!qDRmKj1-F~MYcr>!3dzs&$Ff2M#@wqfcm3r
z6$i`(C$kUoV%Qc;jiC{2<`TA{jGYFk$~q0TItWUPNr{zz83`vBX{2Ysd0|wSHlwpK
zZ7);%s%mX1*|k0`fg*EuJ~G0r4{9CIDwxtv)Dw4*v_&lsq17&H0utfkpRqMGC($eQ
z#8RjT0?f}0f)-3zg_w@m<hq(M7>Qscc=Umkj2DsqmJyKc<#;rrih+FXpSYnQvOFdQ
zmmtC1C4p)aP;!G*KW%)Z;59I%dE<h*6kok^l^4exuIzBto?-zJaa`LSrzIwEmm-zw
zI8ZmJ_CkX6OzFa2#*9RvmS{X&4y&q(dWtcCB%M>zherYDw-TUEsv^b4llOu;2t%}3
z@Il3!3xtG#*V#bSxFAJ+WJL;w>c60cqu?!tZFEY`Sv{Cc#OQZ3y#TUQ!N+sVodVox
zUr2gdL;;7|%&5*)z4*yN5KX2QASumM7o@xjBnv2@YVD&XluQJ7nsx*;Ja&@>j+g~j
zS^9MxP)&gEHVo`FF62_<q^YzBP;LPV7X1cp=_ufQKZHf;b}X}|V{si|a0TF@rvY9R
z^9;c1_{0@AWe3#3R8iyO%Cr`f$GMn2z6+)hTN)l_d4xr9z61E}dw?H`zxmAH0sguN
zu=5<ivqI}mMj{1G4z5ux;1q!>0T)s!=qNtt;0Jkpl*c)iZvcLIAK*Q9?LS2_<DUSR
zISzK7&q$;aT9dIueKyu&=2mc9E9cDdc#uZ{pEvM#0p8;MHy~Y@+9bphu1%sP6X02j
zrMWZkLp&bc1^hk&iNxKE#O;g(wPM4!=E+LV01vY)ThL7dpGu%jLKY0O?=hFBX>0E6
zlDUw9FFpW#R{}YS7nsC?9ll_iJxByle12pf;QRV}2jIgUYwx3dh|jJAUjh8=V*J7X
z`8d_TuK_;iMd58un~{F+Of<7;AC<_K>iq=p$43Ak?4>#G#|m<#Ut*W?;WM<$S8kgJ
kXV4noG1m85_^$v100^-zAY2QH3IG5A07*qoM6N<$f&#YJg#Z8m

literal 0
HcwPel00001

diff --git a/guiserver/images/web32.png b/guiserver/images/web32.png
new file mode 100644
index 0000000000000000000000000000000000000000..c089a30d3d0e76043ba4abe49827e3b0d0ef1be7
GIT binary patch
literal 4501
zcwPaO5o+#<P)<h;3K|Lk000e1NJLTq001BW001Be1^@s6b9#F800009a7bBm000XU
z000XU0RWnu7ytkYO=&|zP*7-ZbZ>KLZ*U+<Lqi~Na&Km7Y-Iodc-oy)cUY767Czti
zWe-+D*zmEJY=HnGBdiF>5Lu!Sk^o_Z5E4Meg@_7P6crJiNL9pw)e1<Rh~l6qxMx9%
zh+2zPTsZC@+^4mDdhhM+``7!t=bY#K&Uw!dfDsZVk>;Xm069{HJUZAPk55R%$-RIA
z6-eL&AQ0xu!e<4=008g<d3b(wus{3(uWtYX0C3eVBofEr|AV?vCRYF;kpSQ#66Xs6
zkWv81E>y@A0LT~suv4>S3ILP<0Bm`DLLvaF4FK%)Nj?Pt*r}7;7Xa9z9H|HZjR63e
zC`Tj$K)V27Re@400>HumpsYY5E(E}?0f1SyGDiY{y#)Yvj#!WnKwtoXnL;eg03bL5
z07D)V%>y7z1E4U{zu>7~aD})?0RX_umCct+(lZpemCzb@^6=o|A>zVpu|i=NDG+7}
z<RYAxn<EoQ=L1a63;+Nc`O(4tI6si*=H%h#X6J10^u?n7Yw&L(J|Xen{=AF=1OO0D
z&+pn_<>l4`aK{0#b-!z=TL9Wt0BGO&T{GJWpjryhdijfaIQ&2!o}p04JRKYg3k&Tf
zVxhe-<BLB3GvROGi+=X}Kpy_vdhh^onn0PYz@vlxaba$Du2PQY%LGC(ZujRS{>O!X
z{f;To;xw^bEES6JSc$k$B2CA6xl)ltA<32E66t?3@gJ7`36pmX0IY^jz)rRYwaaY4
ze(nJRiw;=Qb^t(r^DT@T3y}a2XEZW-_W%Hszxj_qD**t_m!#tW0KDiJT&R>6OvVTR
z07RgHDzHHZ48atvzz&?j9lXF70$~P3Knx_nJP<+#<bWIsp%|7y8C1YJ*aWq(0~(+a
zn&A+%!7(@u=im}tf$MM=24EPT!Wg`U2?RmN2oqr;I*1Wsj@Tm32p5@-1R`NbG?IX%
zAnAw{Q6k02a-;&OLTZs+NF(wsauhj@TtNDe+sGg?iu{VaM=_LvvQY!n0(C&Ss2>`N
z#-MZ2bTkiLfR>_b(HgWKJ%F~Nr_oF3b#wrIijHG|(J>BYjM-sajE6;FiC7vY#};Gd
zST$CUHDeuEH+B^pz@B062qXfFfD`NpUW5?BY=V%GM_5c)L#QR}BeW8_2v-S%gfYS=
zB9o|3v?Y2H`NVi)I<b&gMyw|8As!)~C0-{E6JL`^Bo4`v<W349C6F>n3rTB8+ej^>
zQ=~r95NVuDChL%G$=>7$vVg20myx%S50Foi`^m%Pw-h?Xh~i8Mq9jtJloCocWk2Nv
zrJpiFnV_ms&8eQ$2&#xWpIS+6pmtC%Q-`S&G<BLK&6^fO%cL!%)zF%0XKD9nFX?o;
z3EhJpMVHW*(rf4k>F4Q#^mhymh7E(qNMa}%YZ-ePrx>>xFPTiH1=E+A$W$=bG8>s^
zm=Bn5Rah$aDtr}@$`X}2l~$F0mFKEdRdZE8)p@E5RI61Ft6o-prbbn>P~)iy)E2AN
zsU20jsWz_8Qg>31P|s0cqrPALg8E|(vWA65poU1JRAaZs8I2(p#xiB`SVGovRs-uS
zYnV-9TeA7=Om+qP8+I>yOjAR1s%ETak!GFdam@h^#<Ae=IoX^_&LPeX&U-BbEk7->
z)@rS0t$wXH+Irf)+G6c;?H29p+V6F6oj{!|o%K3xI`?%6x;DB|x`n#ib<gTP(_`y-
z=?V49^$zLX(MR=d^rQ6`>hIR?(H}Q3Gzd138Ei2)WAMz7W9Vy`X}HnwgyE<W%V@fh
z#Au_@NuwvYChmu4<285}K4z?M9Ad0A-euftJYiyKGTWrYq{ZaEDb18?nr6Duw9|CV
z%*ZU<tk|r{?2b9roNJz8zS+Fn{EdaBMV!S-i#ChLmfDtl%LSHAmiMffRz6mFR`pib
ztVz~f>n!VS)>mv$8&{hQn>w4zwy3R}t;BYlZQm5)6pty=DfLrs+A-|>><a9f>;~;Q
z_F?uV_HFjh9n2gO9o9Q^JA86<b<B2baJ=iJ;WWdk#HqvSS7#e%p>v({H5aB!kjoO6
zc9$1ZZKsN-Zl8L~mE{`ly3)1N^`o1+o7}D0ZPeY&J;i;i`%NyJ8_8Y6J?}yE@b_5a
zam?eLr<<q3^N{B+UUpttUi-ZsPqUmRp4KpJ$lJtQ;JwRxU^+fMW%|zP13tz+0-t)H
zhrXu1BHul}BYxI?nSKZSp8Grc%l(h|zu|fE7V%C6U;)7a<pI5c8iBI|YXctynFOT=
zH3f|Yy9O@|J{3X?2@P2va+7bs7xEkVV>8@mESk|3$_SkmS{wQ>%qC18))9_|&j{ZT
zes8AvOzF(F2#DZEY>2oYX&IRp`F#{ADl)1r>QS^)ba8a|EY_^#S^H<bj`5GFjJZ48
zYPNEAXRK;$Qfy=Fo4A0us<?r8hxkSDmlAXnBnj<_<iyy-J&EIU0_SX+Go0j_RF-sO
zuI1dKxfkZ?&dZ*6JXtkakbF3Wm=c$=KjniULQpRlPvxg>O&t^Rgqwv=MZThqqEWH8
zxJo>d=ABlR_Bh=;eM9<ahEGOy#xn^|QY(3p8Irjp^G#Mn*50ho*>Tw|Ih34~oTE|=
zX_mAr*D$vzw@+p(E0Yc6dFE}(8<U61_v9n_bMxC3Y=unGqqI`4P!1MMFQ_YcTNqn-
zxJbQ7TGTV&X8!8=BMX8Se7%scP`I$O*tmFE@!%rAMY|Rwi&GbOE-_tFx@351@X~$D
zXv?ye{ZQgqQdRP5dED}jQiIZ^r9&%%S2UHWl*!9(uJl^DV-;bQWL58Km(^QVe<~N1
zU#xJfsIK_1M!4qUS59BmeD!&4+S=Yqx61A7Nb98QZmjoNzpqNYYC+Y|hVTuo8}W_h
z8((co-gKdQYW0rIw9U%R12tha?OV*YtlRRTHly}>oqt`+R{gE3x4zjX+Sb3_cYE^=
zgB=w+-tUy`ytONMS8KgRef4hA?t<Nq8e$u|zvh13xJP$S#h#CQrF#eVMeplsbZ>0j
zufM;t32jm~jUGrkaOInTZ`zyfns>EuS}G30LFK_G-==(f<51|K&cocp&EJ`SxAh3?
zNO>#LI=^+SEu(FqJ)ynt=!~PC9bO$rzPJB=?=j<Jb;mW2SDv7qC_VA{<bspqr(~y|
zolZYJ)S29Q_e}hmYh6)Yy=Ozuo<A3K?o78|_sR3#=Z{_Rym0g)_hQ>6w@a-(u02P7
zaQ)#(uUl{HW%tYNS3ItC^iAtK(eKlL`f9+{bJzISE?u8_z3;~C8@FyI-5j_jy7l;W
z_U#vU3hqqYU3!mrul&B+{ptt$59)uk{;_4iZQ%G|z+lhASr6|H35TBkl>gI*;nGLU
zN7W-nBaM%pA0HbH8olyl&XeJ%vZoWz%6?Y=dFykl=imL}`%BMQ{Mhgd`HRoLu6e2R
za__6DuR6yg#~-}Tc|Gx_{H@O0eebyMy5GmWADJlpK>kqk(fVV@r_fLLKIeS?{4e)}
z^ZO;zpECde00d`2O+f$vv5tKEQIh}w03c&XQcVB=dL;k=fP(-4`Tqa_faw4Lbua(`
z>R<o>I+y?e7jKeZ#YO-C2C_*+K~#9!#FuM~RaX_qfBT$s&wb3DVTKuC5E<Sbryy16
zkd{8Q6#-*WN(9qN(x@S6lUAd)iGFJOp&EltY+{YrFEyrGsMdyR)fy9mtq&-LI6Q|b
zFie4An7QxAdF{RYaEAeA?hKTe^d#$iSm$K#|NgJX{x2mWe3XwG?`Zq@;^lU{p-IHt
z^rE(9G1Py&Plx_sz3*2adOQI8`Pbe(wq^awB|&g=n>!YqFT*Q;e5db)?|x~ESIiuo
z3V<`7k+=%O_9U3t%^|RCD3pbb>+V_{d+ybp+n@OI2JM$lO#1(LN2F`$g2>#InaJRW
z23@VP^}+j>JoU5PZ^Tm5mfbJ_ZDfol5kUc#1(xC(|5T<$&<3RH@wJWjEqQ$Vu3c6v
zvGB$iFaikim_jK-q2zIXu)xqr3E%f|9dK-gh+vGVYa)VD3IV8kd~@^KuJ1kn`ffLw
z?wpV_<MYEIA(evRPj8>$o%b?Se8I6Tj1i1zI_Je%yLuL#i&{Y(f+!ld0vH214~z(r
z2D?;c?fP{~FBM+?-OEou^hMz8SkldDZ$l|XwHlDg6|K+x^05<+*Rgosh0n8k)imbL
zPLWDDL|Pch2kigvFg?8^+}@ewE9*bTqPgvOI)Kr{wiFb67%Zt8fYEA>Swep?#y2*s
zdNg~cXU7-=J%4?PbTY}#KflW(?>+m%+cRHXv?9^XgWX@nH7SBH#2>B6q-(KebvtcM
zDgJQa5WjBu0WU_+aMyynsYDe3j6hQyS`u<ip}Q9Np^w%QyCwu~u^-z@s{hPC`dqxD
z`O&nFvvOt^$7C-v2JQw0!qtsKF}t;a;GW%_b`P_y=Sg;1FVfl3MG*P5L>AEFV`~Y1
zB*@i^0ao(VZcg>>f9x%D;yW>cnB`CkJdUxS!^yvs$!JD${+MM)gg$kU()3;$Oe6iy
zd476)J3601S<a;WK}0Zh+P-C-`P<x)!PGMg&TaxFc*du<*vC-y5~ZO8nVe517m&#X
zWU~<$yo>Bh{+^L)9$VQYRDuEXK7&0kVWAMIU#bAMg3HBmr3^!}Imx-UWy7Cg&bc*c
zr^@m2F)j_baB?X_`7*;<kKwFGX2ftz{fmA6Uc4|wp|F%qyW5D<`zs`S2JHGQ2%u^J
zu4(^PrpoF$Q4bxB=jlAPmB!+HL?C(OUPiJ3nY>RXAJi-ta@IRbSy!->g~rfir}<Q9
zGh_H9dgusP?qo5*7-4)AEMMrF?w#P%?q234n^<`K5tMOoq9l<v1feDf4MAuKBaP=~
zu*I$=rm|V#%;LV`^CT*UFh77OYtj%HVIqKpLpt;$ZmYh=ovlY`Zc#`)p#Kv)aa@Dz
zIJhx|8?$g+K^h7;b`0B&)0OC8b1C4H7f<48&|!F;77gRm(CN9zsqQ&+q|5!Rv3^c&
z@xADVRh&x>k>@WgJiQ6A!deL$hvkJ$474j2rBkfSmDzB5531@>F`(nkAe#Cjr*`}a
z01jW`@QT@dwj|I}+{fk*F0#<QhXbv5aCT{qmee4P*(De|!m)(qRyVC>VSes6be-8x
ztdOUq!2{IvB}f$31u&WLa`v2N_ogl$SE@!&<HdgN&ku6jtS$!I7Lsjx6W3mWZ7h<}
z5Y3e%w4M4li9#>F7K$1?5B%x3ke;;^(ZM7PDC&8gH+tE#Z6!yS&E(dK0qsD%>NCCn
z5N!j85I2Ug<0w(6sDg?#p@D*dP=l|bS^@5T2q)Ey_=Wn~PhIX2<C4&e2!HZVo{BV7
zBPa(@3?UamA%sdL#4nccN=3?^CLh-P<x#6tAZWjZhC8;w=zTC5fS9eYRUJL>*89A<
z;{ZQSIZzFu<U=W_Ss|!xSO}pQT=AEK8uft{r(x4Ch^Jc+9Zju()x;o-wXGligYTo1
z^Yvx&?a<&vX0&r%rCjB*8IS->;|x+;c933lC&n*Lxq0m_m_iW=@a$ge$=}X=x-T_*
zF~$Sqfet}OH8TO2Dj2O`#lti|v6pE}zW_lArPOsz1kBWmNIR7U517`C-+}|L<M-{s
zTsn@fW>J=nYMeuCZa48;A0RnzC6)=1pj>afxN#XjVW@~I*lv>a?GKag-inEQOc>No
z5ldj%4(I?0EBrrZDyQzOBnAn*F#%#<PTi=AL^r>gjJ>7+;Kp1hk&I7lCNc@rH%LRm
zwQyq^L0MC(;)6X$Klsrr){H3h<?7i@DXugUb*+EOVe@imZJP^O4=XH{uJ`{ep!LI@
n??Vm3gCdd{bAHt0`Tqt0zsBqt&X_Jp00000NkvXXu0mjf1>2@S

literal 0
HcwPel00001

diff --git a/guiserver/index.html b/guiserver/index.html
new file mode 100644
index 0000000..2decf3b
--- /dev/null
+++ b/guiserver/index.html
@@ -0,0 +1,51 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+<META http-equiv="Content-Type" content="text/html; charset=utf-8">
+<title>Index</title>
+
+<style type="text/css" media="screen">
+<!--
+span.arw {
+	color:#666666;
+	font-size: 100%;
+	}
+	
+body, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+	line-height: 115%;
+ 	}
+
+h1, h2, h3, h4 {
+	font-family: Georgia, Times New Roman, Times, serif;
+   	font-size: 110%;
+	}
+
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+   	font-size: 100%;
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	font-size: 100%;
+	}
+-->
+</style>
+</head>
+
+<body style="margin: 20px;" text="#333333" bgcolor="#FFFFFF" 
+			link="#376590" vlink="#551A8B" alink="#ffAA28">
+<blockquote>
+<center><h1>Index</h1></center>
+<a href="guiserver.lsp.html"><br/><br/><h2>Module:&nbsp;guiserver.lsp</h2></a>
+<p>Functions for programming GUIs and 2D graphics.</p>
+<a href="guiserver.lsp.html#gs_add-list-item">add-list-item</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_add-separator">add-separator</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_add-to">add-to</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_append-text">append-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_button">button</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_canvas">canvas</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_check-box">check-box</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_check-event">check-event</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_clear-list">clear-list</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_clear-text">clear-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_copy-text">copy-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_cut-text">cut-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_color-dialog">color-dialog</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_color-tag">color-tag</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_combo-box">combo-box</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_confirm-dialog">confirm-dialog</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_delete-tag">delete-tag</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_destroy-shell">destroy-shell</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_dialog">dialog</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_disable">disable</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_dispose">dispose</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_dispose-splash">dispose-splash</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_draw-arc">draw-arc</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_draw-circle">draw-circle</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_draw-ellipse">draw-ellipse</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_draw-image">draw-image</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_draw-line">draw-line</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_draw-path">draw-path</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_draw-polygon">draw-polygon</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_draw-rect">draw-rect</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_draw-round-rect">draw-round-rect</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_draw-text">draw-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_enable">enable</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_eva-shell">eva-shell</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_export">export</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_fill-arc">fill-arc</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_fill-circle">fill-circle</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_fill-ellipse">fill-ellipse</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_fill-polygon">fill-polygon</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_fill-rect">fill-rect</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_fill-round-rect">fill-round-rect</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_find-text">find-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_frame">frame</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_get-bounds">get-bounds</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_get-fonts">get-fonts</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_get-font-metrics">get-font-metrics</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_get-screen">get-screen</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_get-selected-text">get-selected-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_get-text">get-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_get-text-position">get-text-position</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_get-version">get-version</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_goto-text">goto-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_hide-tag">hide-tag</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_image-button">image-button</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_image-label">image-label</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_init">init</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_insert-list-item">insert-list-item</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_insert-tab">insert-tab</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_insert-text">insert-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_key-event">key-event</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_label">label</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_layout">layout</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_load-text">load-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_listen">listen</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_list-box">list-box</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_message-dialog">message-dialog</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_menu">menu</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_menu-popup">menu-popup</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_menu-bar">menu-bar</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_menu-item">menu-item</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_menu-item-check">menu-item-check</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_mouse-clicked">mouse-clicked</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_mouse-dragged">mouse-dragged</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_mouse-event">mouse-event</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_mouse-moved">mouse-moved</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_mouse-pressed">mouse-pressed</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_mouse-released">mouse-released</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_mouse-wheel">mouse-wheel</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_move-tag">move-tag</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_no-action">no-action</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_open-file-dialog">open-file-dialog</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_panel">panel</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_paste-text">paste-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_play-sound">play-sound</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_progress-bar">progress-bar</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_radio-button">radio-button</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_redo-text">redo-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_remove-from">remove-from</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_remove-list-item">remove-list-item</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_remove-tab">remove-tab</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_request-focus">request-focus</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_reorder-tags">reorder-tags</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_rotate-tag">rotate-tag</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_run-shell">run-shell</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_save-file-dialog">save-file-dialog</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_save-text">save-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_scale-tag">scale-tag</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_select-list-item">select-list-item</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_select-text">select-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_scroll-pane">scroll-pane</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-accelerator">set-accelerator</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-anti-aliasing">set-anti-aliasing</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-background">set-background</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-bevel-border">set-bevel-border</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-border-layout">set-border-layout</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-canvas">set-canvas</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-caret">set-caret</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-caret-color">set-caret-color</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-color">set-color</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-cursor">set-cursor</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-editable">set-editable</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-flow-layout">set-flow-layout</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-font">set-font</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-foreground">set-foreground</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-grid-layout">set-grid-layout</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-icon">set-icon</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-look-and-feel">set-look-and-feel</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-paint">set-paint</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-pressed-icon">set-pressed-icon</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-resizable">set-resizable</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-rotation">set-rotation</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-scale">set-scale</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-selected">set-selected</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-selection-color">set-selection-color</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-size">set-size</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-stroke">set-stroke</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-syntax">set-syntax</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-syntax-colors">set-syntax-colors</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-tab-size">set-tab-size</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-text">set-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-titled-border">set-titled-border</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-tool-tip">set-tool-tip</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-trace">set-trace</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-translation">set-translation</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-utf8">set-utf8</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-value">set-value</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_set-visible">set-visible</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_shear-tag">shear-tag</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_show-popup">show-popup</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_show-tag">show-tag</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_slider">slider</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_split-pane">split-pane</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_tabbed-pane">tabbed-pane</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_text-area">text-area</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_text-field">text-field</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_text-pane">text-pane</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_toggle-button">toggle-button</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_tool-bar">tool-bar</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_translate-tag">translate-tag</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_undo-text">undo-text</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_undo-enable">undo-enable</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_update">update</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_window">window</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_window-closed">window-closed</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_window-moved">window-moved</a>&nbsp; &nbsp; <a href="guiserver.lsp.html#gs_window-resized">window-resized</a>&nbsp; &nbsp; 
+<p></p><center>- &part; -</center><br/>
+<center><font face='Arial' size='-2' color='#444444'>
+generated with <a href="http://newlisp.org">newLISP</a>&nbsp;
+and <a href="http://newlisp.org/newLISPdoc.html">newLISPdoc</a>
+</font></center>
+</blockquote>
+</body>
+</html>
diff --git a/guiserver/java/ArcShape.java b/guiserver/java/ArcShape.java
new file mode 100644
index 0000000..978b317
--- /dev/null
+++ b/guiserver/java/ArcShape.java
@@ -0,0 +1,75 @@
+//
+//  ArcShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/9/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class ArcShape extends Shape {
+
+int width;
+int height;
+int startAngle;
+int arcAngle;
+
+public ArcShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	width = Integer.parseInt(tokens.nextToken());
+	height = Integer.parseInt(tokens.nextToken());
+	startAngle = Integer.parseInt(tokens.nextToken());
+	arcAngle = Integer.parseInt(tokens.nextToken());
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.drawArc(X, Y, width - 1, height - 1, startAngle, arcAngle);
+	}
+	
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X, Y, width, height).contains(x, y));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/Base64Coder.java b/guiserver/java/Base64Coder.java
new file mode 100644
index 0000000..600ac43
--- /dev/null
+++ b/guiserver/java/Base64Coder.java
@@ -0,0 +1,148 @@
+/**
+* A Base64 Encoder/Decoder.
+*
+* <p>
+* This class is used to encode and decode data in Base64 format as described in RFC 1521.
+*
+* <p>
+* This is "Open Source" software and released under the <a href="http://www.gnu.org/licenses/lgpl.html">GNU/LGPL</a> license.<br>
+* It is provided "as is" without warranty of any kind.<br>
+* Copyright 2003: Christian d'Heureuse, Inventec Informatik AG, Switzerland.<br>
+* Home page: <a href="http://www.source-code.biz">www.source-code.biz</a><br>
+*
+* <p>
+* Version history:<br>
+* 2003-07-22 Christian d'Heureuse (chdh): Module created.<br>
+* 2005-08-11 chdh: Lincense changed from GPL to LGPL.<br>
+* 2006-11-21 chdh:<br>
+*  &nbsp; Method encode(String) renamed to encodeString(String).<br>
+*  &nbsp; Method decode(String) renamed to decodeString(String).<br>
+*  &nbsp; New method encode(byte[],int) added.<br>
+*  &nbsp; New method decode(String) added.<br>
+*/
+
+
+public class Base64Coder {
+
+// Mapping table from 6-bit nibbles to Base64 characters.
+private static char[]    map1 = new char[64];
+   static {
+      int i=0;
+      for (char c='A'; c<='Z'; c++) map1[i++] = c;
+      for (char c='a'; c<='z'; c++) map1[i++] = c;
+      for (char c='0'; c<='9'; c++) map1[i++] = c;
+      map1[i++] = '+'; map1[i++] = '/'; }
+
+// Mapping table from Base64 characters to 6-bit nibbles.
+private static byte[]    map2 = new byte[128];
+   static {
+      for (int i=0; i<map2.length; i++) map2[i] = -1;
+      for (int i=0; i<64; i++) map2[map1[i]] = (byte)i; }
+
+/**
+* Encodes a string into Base64 format.
+* No blanks or line breaks are inserted.
+* @param s  a String to be encoded.
+* @return   A String with the Base64 encoded data.
+*/
+public static String encodeString (String s) {
+   return new String(encode(s.getBytes())); }
+
+/**
+* Encodes a byte array into Base64 format.
+* No blanks or line breaks are inserted.
+* @param in  an array containing the data bytes to be encoded.
+* @return    A character array with the Base64 encoded data.
+*/
+public static char[] encode (byte[] in) {
+   return encode(in,in.length); }
+
+/**
+* Encodes a byte array into Base64 format.
+* No blanks or line breaks are inserted.
+* @param in   an array containing the data bytes to be encoded.
+* @param iLen number of bytes to process in <code>in</code>.
+* @return     A character array with the Base64 encoded data.
+*/
+public static char[] encode (byte[] in, int iLen) {
+   int oDataLen = (iLen*4+2)/3;       // output length without padding
+   int oLen = ((iLen+2)/3)*4;         // output length including padding
+   char[] out = new char[oLen];
+   int ip = 0;
+   int op = 0;
+   while (ip < iLen) {
+      int i0 = in[ip++] & 0xff;
+      int i1 = ip < iLen ? in[ip++] & 0xff : 0;
+      int i2 = ip < iLen ? in[ip++] & 0xff : 0;
+      int o0 = i0 >>> 2;
+      int o1 = ((i0 &   3) << 4) | (i1 >>> 4);
+      int o2 = ((i1 & 0xf) << 2) | (i2 >>> 6);
+      int o3 = i2 & 0x3F;
+      out[op++] = map1[o0];
+      out[op++] = map1[o1];
+      out[op] = op < oDataLen ? map1[o2] : '='; op++;
+      out[op] = op < oDataLen ? map1[o3] : '='; op++; }
+   return out; }
+
+/**
+* Decodes a string from Base64 format.
+* @param s  a Base64 String to be decoded.
+* @return   A String containing the decoded data.
+* @throws   IllegalArgumentException if the input is not valid Base64 encoded data.
+*/
+public static String decodeString (String s) {
+	if(s.equals("nil")) return("");
+   return new String(decode(s)); }
+
+/**
+* Decodes a byte array from Base64 format.
+* @param s  a Base64 String to be decoded.
+* @return   An array containing the decoded data bytes.
+* @throws   IllegalArgumentException if the input is not valid Base64 encoded data.
+*/
+public static byte[] decode (String s) {
+   return decode(s.toCharArray()); }
+
+/**
+* Decodes a byte array from Base64 format.
+* No blanks or line breaks are allowed within the Base64 encoded data.
+* @param in  a character array containing the Base64 encoded data.
+* @return    An array containing the decoded data bytes.
+* @throws    IllegalArgumentException if the input is not valid Base64 encoded data.
+*/
+public static byte[] decode (char[] in) {
+   int iLen = in.length;
+   if (iLen%4 != 0) throw new IllegalArgumentException ("Length of Base64 encoded input string is not a multiple of 4.");
+   while (iLen > 0 && in[iLen-1] == '=') iLen--;
+   int oLen = (iLen*3) / 4;
+   byte[] out = new byte[oLen];
+   int ip = 0;
+   int op = 0;
+   while (ip < iLen) {
+      int i0 = in[ip++];
+      int i1 = in[ip++];
+      int i2 = ip < iLen ? in[ip++] : 'A';
+      int i3 = ip < iLen ? in[ip++] : 'A';
+      if (i0 > 127 || i1 > 127 || i2 > 127 || i3 > 127)
+         throw new IllegalArgumentException ("Illegal character in Base64 encoded data.");
+      int b0 = map2[i0];
+      int b1 = map2[i1];
+      int b2 = map2[i2];
+      int b3 = map2[i3];
+      if (b0 < 0 || b1 < 0 || b2 < 0 || b3 < 0)
+         throw new IllegalArgumentException ("Illegal character in Base64 encoded data.");
+      int o0 = ( b0       <<2) | (b1>>>4);
+      int o1 = ((b1 & 0xf)<<4) | (b2>>>2);
+      int o2 = ((b2 &   3)<<6) |  b3;
+      out[op++] = (byte)o0;
+      if (op<oLen) out[op++] = (byte)o1;
+      if (op<oLen) out[op++] = (byte)o2; }
+   return out; }
+
+// Dummy constructor.
+private Base64Coder() {}
+
+} // end class Base64Coder
+ 
+ 
+// eof //
diff --git a/guiserver/java/ButtonWidget.java b/guiserver/java/ButtonWidget.java
new file mode 100644
index 0000000..be37c6d
--- /dev/null
+++ b/guiserver/java/ButtonWidget.java
@@ -0,0 +1,79 @@
+//
+//  ButtonWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/12/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+
+public class ButtonWidget extends aButton {
+
+@SuppressWarnings("unchecked") 
+public ButtonWidget(StringTokenizer params)
+	{
+	abutton = new JButton();
+	jcomponent = abutton;
+	component = abutton;
+	container = abutton;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	if(params.hasMoreTokens())
+		{
+		String base64string = params.nextToken();
+		abutton.setText(Base64Coder.decodeString(base64string));
+		}
+	else
+		{
+		abutton.setVerticalAlignment(JButton.CENTER);
+		}
+		
+	if(params.hasMoreTokens())
+		{
+		int width = Integer.parseInt(params.nextToken());
+		int height = Integer.parseInt(params.nextToken());
+		abutton.setPreferredSize(new Dimension(width, height));
+		}
+	
+	gsObject.widgets.put(id, this);
+	
+	ActionListener listener = new ActionListener() {
+		public void actionPerformed(ActionEvent e)
+			{
+			if(action != null)
+				{
+				guiserver.out.println("("+ action + " \"" + id +  "\")");
+				guiserver.out.flush();
+				}
+			}
+		};
+		
+	abutton.addActionListener(listener);
+	}
+	
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/CanvasWidget.java b/guiserver/java/CanvasWidget.java
new file mode 100644
index 0000000..fd54a5e
--- /dev/null
+++ b/guiserver/java/CanvasWidget.java
@@ -0,0 +1,815 @@
+//
+//  CanvasWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/8/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.event.*;
+import java.awt.geom.*;
+import java.awt.print.*;
+import java.awt.image.BufferStrategy;
+import java.awt.image.BufferedImage;
+import javax.swing.*;
+import javax.imageio.ImageIO;
+import java.util.*;
+import java.io.File;
+import java.io.IOException;
+
+@SuppressWarnings("unchecked")
+public class CanvasWidget extends gsObject {
+
+static CanvasWidget currentCanvas;
+
+Vector drawobjects = new Vector();
+
+MyCanvas canvas;
+//Window ownerWindow;
+double translationX = 0;
+double translationY = 0;
+double theta = 0;
+double scaleX = 1;
+double scaleY = 1;
+Color background = null;
+Stroke currentStroke;
+Color currentPaint;
+//AffineTransform transform = AffineTransform.getScaleInstance(1.0, 1.0);
+AffineTransform transform = null;
+AlphaComposite currentComposite;
+Font currentFont = null;
+boolean antiAliasing = true;
+boolean visible = true;
+
+String mouseClickedEvent;
+String mouseEnteredEvent;
+String mouseExitedEvent;
+String mousePressedEvent;
+String mouseReleasedEvent;
+String mouseDraggedEvent; 	
+String mouseMovedEvent; 	
+String mouseWheelMovedEvent;
+
+boolean mousePressedTags = false;
+boolean mouseReleasedTags = false;
+boolean mouseClickedTags = false;
+boolean mouseMovedTags = false;
+
+public CanvasWidget(StringTokenizer params)
+	{
+	id = params.nextToken();
+	canvas = new MyCanvas();
+
+	component = canvas;
+	
+	// if canvas is not Canvas but JPanel
+	container = canvas;
+	jcomponent = canvas;
+
+	CanvasWidget.currentCanvas = this;
+	
+	currentStroke = new BasicStroke();
+	currentPaint = new Color(0,0,0);
+	
+	scaleX = 1.0;
+	scaleY = 1.0;
+	
+	gsObject.widgets.put(id, this);
+	}
+
+public void g2Canvas(StringTokenizer tokens)
+	{
+	CanvasWidget.currentCanvas = this;
+	}
+	
+public void g2Translation(StringTokenizer tokens)
+	{
+	translationX = Float.parseFloat(tokens.nextToken());
+	translationY = Float.parseFloat(tokens.nextToken());
+	}	
+
+public void g2Scale(StringTokenizer tokens)
+	{
+	scaleX = Float.parseFloat(tokens.nextToken());
+	scaleY = Float.parseFloat(tokens.nextToken());
+	}	
+	
+public void g2Rotation(StringTokenizer tokens)
+	{
+	double rotation = Float.parseFloat(tokens.nextToken());
+	theta = 2.0 * Math.PI * rotation / 360.0;
+	}	
+	
+public void g2Transform(StringTokenizer tokens)
+	{
+	double m00 = Float.parseFloat(tokens.nextToken());
+	double m01 = Float.parseFloat(tokens.nextToken());
+	double m02 = Float.parseFloat(tokens.nextToken());
+	double m10 = Float.parseFloat(tokens.nextToken());
+	double m11 = Float.parseFloat(tokens.nextToken());
+	double m12 = Float.parseFloat(tokens.nextToken());
+	
+	//transform.concatenate(new AffineTransform(m00, m01, m02, m10, m11, m12));
+	}	
+
+public void g2Stroke(StringTokenizer tokens)
+	{
+	float strokeWidth = Float.parseFloat(tokens.nextToken());
+	int strokeCap = BasicStroke.CAP_BUTT;
+	int strokeJoin = BasicStroke.JOIN_MITER;
+	float strokeMiterLimit = (float)10.0;
+	
+	if(tokens.hasMoreTokens())
+		{
+		String cap = tokens.nextToken();
+		if(cap.equals("round")) strokeCap = BasicStroke.CAP_ROUND;
+		else if(cap.equals("square")) strokeCap = BasicStroke.CAP_SQUARE;
+		else strokeCap = BasicStroke.CAP_BUTT;
+		}
+	
+	if(tokens.hasMoreTokens())
+		{
+		String join = tokens.nextToken();
+		if(join.equals("round")) strokeJoin = BasicStroke.JOIN_BEVEL;
+		else if(join.equals("square")) strokeJoin = BasicStroke.JOIN_ROUND;
+		else strokeJoin = BasicStroke.JOIN_MITER;
+		}
+		
+	if(tokens.hasMoreTokens())
+		strokeMiterLimit = Float.parseFloat(tokens.nextToken());
+
+	currentStroke = new BasicStroke(strokeWidth, strokeCap, strokeJoin, strokeMiterLimit);
+	}
+	
+public void g2Paint(StringTokenizer tokens)
+	{
+	float R, G, B;
+	float alpha;
+	
+	R = Float.parseFloat(tokens.nextToken());
+	G = Float.parseFloat(tokens.nextToken());
+	B = Float.parseFloat(tokens.nextToken());
+
+	if(tokens.hasMoreTokens())
+		alpha = Float.parseFloat(tokens.nextToken());
+	else 
+		alpha = 1;
+
+	currentPaint = new Color(R, G, B, alpha);
+	}
+	
+public void g2Update(StringTokenizer tokens)
+	{
+	canvas.repaint();
+	}
+	
+public void g2Export(StringTokenizer tokens)
+	{
+	String path = Base64Coder.decodeString(tokens.nextToken());
+	int width = canvas.getWidth();
+	int height = canvas.getHeight();
+	
+	if(tokens.hasMoreTokens())
+		{
+		width = Integer.parseInt(tokens.nextToken());
+		height = Integer.parseInt(tokens.nextToken());
+		}
+	
+	canvas.export(path, "PNG", width, height);
+	}
+	
+public void g2Print(StringTokenizer tokens)
+	{
+	}
+	
+public void setBackground(StringTokenizer tokens)
+	{
+	float R, G, B;
+	float alpha;
+	
+	R = Float.parseFloat(tokens.nextToken());
+	G = Float.parseFloat(tokens.nextToken());
+	B = Float.parseFloat(tokens.nextToken());
+
+	if(tokens.hasMoreTokens())
+		alpha = Float.parseFloat(tokens.nextToken());
+	else 
+		alpha = 1;
+	
+	background = new Color(R, G, B, alpha);
+	
+	component.setBackground(background);
+	}
+	
+public void setFont(StringTokenizer tokens)
+	{
+	String name = Base64Coder.decodeString(tokens.nextToken());
+	int style = 0;
+	int size = 12;
+	
+	if(tokens.hasMoreTokens())
+		size = Integer.parseInt(tokens.nextToken());
+	
+	while(tokens.hasMoreTokens())
+		{
+		String sstyle = tokens.nextToken();
+		if(sstyle.equals("plain")) style = style | Font.PLAIN;
+		if(sstyle.equals("bold")) style = style | Font.BOLD;
+		if(sstyle.equals("italic")) style = style | Font.ITALIC;
+		}
+		
+	currentFont = new Font(name, style, size);
+	component.setFont(currentFont);
+	}
+	
+
+public void setAntiAliasing(StringTokenizer tokens) 
+	{
+	antiAliasing = tokens.nextToken().equals("true");
+	}
+
+// create shapes
+
+public void drawLine(StringTokenizer tokens)
+	{
+	new LineShape(tokens);
+	}
+	
+public void drawRectangle(StringTokenizer tokens)
+	{
+	new RectangleShape(tokens);
+	}
+
+public void fillRectangle(StringTokenizer tokens)
+	{
+	new FilledRectangleShape(tokens);
+	}
+
+public void drawRoundRect(StringTokenizer tokens)
+	{
+	new RoundRectangleShape(tokens);
+	}
+
+public void fillRoundRect(StringTokenizer tokens)
+	{
+	new FilledRoundRectangleShape(tokens);
+	}
+
+public void drawEllipse(StringTokenizer tokens)
+	{
+	new EllipseShape(tokens);
+	}
+
+public void fillEllipse(StringTokenizer tokens)
+	{
+	new FilledEllipseShape(tokens);
+	}
+
+public void drawCircle(StringTokenizer tokens)
+	{
+	new CircleShape(tokens);
+	}
+
+public void fillCircle(StringTokenizer tokens)
+	{
+	new FilledCircleShape(tokens);
+	}
+
+public void drawArc(StringTokenizer tokens)
+	{
+	new ArcShape(tokens);
+	}
+
+public void fillArc(StringTokenizer tokens)
+	{
+	new FilledArcShape(tokens);
+	}
+
+public void drawPolygon(StringTokenizer tokens)
+	{
+	new PolygonShape(tokens);
+	}
+	
+public void fillPolygon(StringTokenizer tokens)
+	{
+	new FilledPolygonShape(tokens);
+	}
+
+public void drawPath(StringTokenizer tokens)
+	{
+	new PathShape(tokens);
+	}
+	
+public void drawText(StringTokenizer tokens)
+	{
+	new TextShape(tokens);
+	}
+
+public void drawImage(StringTokenizer tokens)
+	{
+	new ImageShape(tokens);
+	}
+	
+// register mouse events
+	
+public void registerMouseClicked(StringTokenizer tokens)
+	{
+	mouseClickedEvent = tokens.nextToken();
+	if(tokens.hasMoreTokens())
+		mouseClickedTags = tokens.nextToken().equals("true");
+	}
+	
+public void registerMousePressed(StringTokenizer tokens)
+	{
+	mousePressedEvent = tokens.nextToken();
+	if(tokens.hasMoreTokens())
+		mousePressedTags = tokens.nextToken().equals("true");
+	}
+
+public void registerMouseRelease(StringTokenizer tokens)
+	{
+	mouseReleasedEvent = tokens.nextToken();
+	if(tokens.hasMoreTokens())
+		mouseReleasedTags = tokens.nextToken().equals("true");
+	}
+	
+public void registerMouseExited(StringTokenizer tokens)
+	{
+	mouseExitedEvent = tokens.nextToken();
+	}
+	
+public void registerMouseEntered(StringTokenizer tokens)
+	{
+	mouseEnteredEvent = tokens.nextToken();
+	}
+	
+public void registerMouseDragged(StringTokenizer tokens)
+	{
+	mouseDraggedEvent = tokens.nextToken();
+	}
+	
+public void registerMouseMoved(StringTokenizer tokens)
+	{
+	mouseMovedEvent = tokens.nextToken();
+	if(tokens.hasMoreTokens())
+		mouseMovedTags = tokens.nextToken().equals("true");
+	}
+	
+public void registerMouseWheel(StringTokenizer tokens)
+	{
+	mouseWheelMovedEvent = tokens.nextToken();
+	}
+
+// manipulate shapes
+
+public void deleteTaggedShape(StringTokenizer tokens)
+	{
+	String label = tokens.nextToken();
+	boolean updateFlag = tokens.nextToken().equals("true");
+	Vector filteredObjects = new Vector();
+	Shape aShape;
+	
+	for(int i = 0; i < drawobjects.size(); i++)
+		{
+		aShape = (Shape)drawobjects.elementAt(i);
+		if(!aShape.tag.equals(label))
+			filteredObjects.add(aShape);
+		}
+		
+	drawobjects = filteredObjects;
+	if(updateFlag) canvas.repaint();
+	}
+	
+public void moveTaggedShape(StringTokenizer tokens)
+	{
+	String label = tokens.nextToken();
+	int dx = Integer.parseInt(tokens.nextToken());
+	int dy = Integer.parseInt(tokens.nextToken());
+	boolean updateFlag = tokens.nextToken().equals("true");
+
+	Shape aShape;
+	
+	for(int i = 0; i < drawobjects.size(); i++)
+		{
+		aShape = (Shape)drawobjects.elementAt(i);
+		if(aShape.tag.equals(label))
+			{
+			aShape.X += dx;
+			aShape.Y += dy;
+			}
+		}
+		
+	if(updateFlag) canvas.repaint();
+	}
+
+public void translateTaggedShape(StringTokenizer tokens)
+	{
+	String label = tokens.nextToken();
+	double X = Float.parseFloat(tokens.nextToken());
+	double Y = Float.parseFloat(tokens.nextToken());
+	boolean updateFlag = tokens.nextToken().equals("true");
+	Shape aShape;
+	
+	for(int i = 0; i < drawobjects.size(); i++)
+		{
+		aShape = (Shape)drawobjects.elementAt(i);
+		if(aShape.tag.equals(label))
+			aShape.transform.translate(X, Y);
+		}
+		
+	if(updateFlag) canvas.repaint();
+	}
+
+	
+public void rotateTaggedShape(StringTokenizer tokens)
+	{
+	String label = tokens.nextToken();
+	double theta = Float.parseFloat(tokens.nextToken());
+	int X = Integer.parseInt(tokens.nextToken());
+	int Y = Integer.parseInt(tokens.nextToken());
+	boolean updateFlag = tokens.nextToken().equals("true");
+	Shape aShape;
+	
+	theta = 2.0 * Math.PI * theta / 360.0;
+	
+	for(int i = 0; i < drawobjects.size(); i++)
+		{
+		aShape = (Shape)drawobjects.elementAt(i);
+		if(aShape.tag.equals(label))
+			aShape.transform.rotate(theta, X, Y);
+		}
+		
+	if(updateFlag) canvas.repaint();
+	}
+	
+public void scaleTaggedShape(StringTokenizer tokens)
+	{
+	String label = tokens.nextToken();
+	double sx = Float.parseFloat(tokens.nextToken());
+	double sy = Float.parseFloat(tokens.nextToken());
+	boolean updateFlag = tokens.nextToken().equals("true");
+	Shape aShape;
+	
+	for(int i = 0; i < drawobjects.size(); i++)
+		{
+		aShape = (Shape)drawobjects.elementAt(i);
+		if(aShape.tag.equals(label))
+			aShape.transform.scale(sx, sy);
+		}
+		
+	if(updateFlag) canvas.repaint();
+	}
+
+public void shearTaggedShape(StringTokenizer tokens)
+	{
+	String label = tokens.nextToken();
+	double shx = Float.parseFloat(tokens.nextToken());
+	double shy = Float.parseFloat(tokens.nextToken());
+	boolean updateFlag = tokens.nextToken().equals("true");
+	Shape aShape;
+	
+	for(int i = 0; i < drawobjects.size(); i++)
+		{
+		aShape = (Shape)drawobjects.elementAt(i);
+		if(aShape.tag.equals(label))
+			aShape.transform.shear(shx, shy);
+		}
+		
+	if(updateFlag) canvas.repaint();
+	}
+			
+public void hideTaggedShape(StringTokenizer tokens)
+	{
+	String label = tokens.nextToken();
+	boolean updateFlag = tokens.nextToken().equals("true");
+	Shape aShape;
+	
+	for(int i = 0; i < drawobjects.size(); i++)
+		{
+		aShape = (Shape)drawobjects.elementAt(i);
+		if(aShape.tag.equals(label))
+			aShape.visible = false;
+		}
+		
+	if(updateFlag) canvas.repaint();
+	}
+	
+	
+public void showTaggedShape(StringTokenizer tokens)
+	{
+	String label = tokens.nextToken();
+	boolean updateFlag = tokens.nextToken().equals("true");
+	Shape aShape;
+	
+	for(int i = 0; i < drawobjects.size(); i++)
+		{
+		aShape = (Shape)drawobjects.elementAt(i);
+		if(aShape.tag.equals(label))
+			aShape.visible = true;
+		}
+		
+	if(updateFlag) canvas.repaint();
+	}
+
+
+public void orderTaggedShapes(StringTokenizer tokens)
+	{
+	String label;
+	Shape aShape;
+	
+	Vector orderedTags = new Vector();
+	
+	while(tokens.hasMoreTokens())
+		{
+		label = tokens.nextToken();
+		for(int i = 0; i < drawobjects.size(); i++)
+			{
+			aShape = (Shape)drawobjects.elementAt(i);
+//			System.out.println("comparing:" + label + "<->" + aShape.tag);
+			if(aShape.tag.equals(label))
+				{
+				orderedTags.add(aShape);
+//				System.out.println("adding->" + aShape.tag);
+				}
+			}
+		}
+		
+	drawobjects = orderedTags;
+	}
+
+class MyCanvas extends JPanel implements MouseListener, MouseMotionListener, MouseWheelListener, Printable  {
+
+	public MyCanvas() {
+		super();
+		
+		// if canvas extends JPanel
+		if(guiserver.DOUBLE_BUFFERING)
+			this.setDoubleBuffered(true);
+		
+		addMouseListener(this);
+		addMouseMotionListener(this);
+		addMouseWheelListener(this);
+		}
+
+	public void update(Graphics g) 
+		{ 
+		if(guiserver.MAC_OS_X) super.update(g);
+		else paint(g); 
+		} 
+ 
+	public void paint(Graphics g)
+		{
+		Graphics2D g2;
+//		BufferStrategy myStrategy = null; 
+		
+/* only if canvas extends Canvas
+		if(guiserver.DOUBLE_BUFFERING)
+			{
+			try {
+				this.createBufferStrategy(2);
+				}	
+			catch (Exception evt) 
+				{
+				System.out.println("event: =>" + evt);
+				}
+	
+			
+			myStrategy = this.getBufferStrategy();
+			Graphics myg = myStrategy.getDrawGraphics();
+			g2 = (Graphics2D)myg;
+			}
+		else
+*/
+			g2 = (Graphics2D)g;
+		
+		render(g2);
+			
+		/* only used if canvas is Canvas
+		if(guiserver.DOUBLE_BUFFERING)
+			{
+			myStrategy.show();
+			g2.dispose();
+			}
+		*/
+		}
+		
+		
+	public void render(Graphics2D g2)
+		{
+		if(background != null) g2.setColor(background);
+		
+		// fill background
+		if(background != null)
+			{
+			g2.setPaint(background);
+			g2.fillRect(0, 0, canvas.getWidth(), canvas.getHeight());
+			}
+				
+		g2.translate(translationX, translationY);
+		g2.scale(scaleX, scaleY);
+		g2.rotate(theta);
+		
+		AffineTransform normalTransform = g2.getTransform();
+		
+		if(antiAliasing)
+			g2.setRenderingHint(RenderingHints.KEY_ANTIALIASING,
+                            RenderingHints.VALUE_ANTIALIAS_ON);
+		
+		for(int i = 0; i < drawobjects.size(); i++)
+			{
+			Shape shape = (Shape)drawobjects.elementAt(i);
+
+			if(shape.visible) 
+				{
+				g2.transform(shape.transform);
+				shape.drawShape(g2);
+				g2.setTransform(normalTransform);
+				}
+			}
+		
+		paintComponents(g2);
+		}
+		
+	public Iterator getTagsFromPoint(int X, int Y)
+		{
+		HashMap tags = new HashMap();
+		for(int i = 0; i < drawobjects.size(); i++)
+			{
+			Shape shape = (Shape)drawobjects.elementAt(i);
+			if(shape.hasPoint(X, Y))
+				{
+				if(!tags.containsKey(shape.tag))
+					tags.put(shape.tag, 0);
+				}
+			}
+			
+		return tags.keySet().iterator();
+		}
+		
+	public void mouseClicked(MouseEvent e) 
+		{
+		if(mouseClickedEvent == null) return;
+		
+		int X = e.getX();
+		int Y = e.getY();
+		
+		guiserver.out.print("(" + mouseClickedEvent + " " + X + " " + Y + " " + 
+			e.getButton() + " " + e.getClickCount() + " " + e.getModifiers());
+		
+		if(mouseClickedTags)
+			{
+			guiserver.out.print(" '(");
+			Iterator tags = getTagsFromPoint(X, Y);
+			while(tags.hasNext())
+				guiserver.out.print("\"" + tags.next() + "\" ");
+			guiserver.out.print(")");
+			}
+			
+		guiserver.out.println(")");	
+		guiserver.out.flush();
+		}
+	
+	public void mouseEntered(MouseEvent e)
+		{
+		if(mouseEnteredEvent == null) return;
+		}
+	
+	public void mouseExited(MouseEvent e) 
+		{
+		if(mouseExitedEvent == null) return;
+		}
+	
+	public void mousePressed(MouseEvent e)
+		{
+		if(mousePressedEvent == null) return;
+			
+		int X = e.getX();
+		int Y = e.getY();
+		
+		guiserver.out.print("(" + mousePressedEvent + " " + X + " " + Y + " " + 
+			e.getButton() + " " + e.getModifiers());
+		
+		if(mousePressedTags)
+			{
+			guiserver.out.print(" '(");
+			Iterator tags = getTagsFromPoint(X, Y);
+			while(tags.hasNext())
+				guiserver.out.print("\"" + tags.next() + "\" ");
+			guiserver.out.print(")");
+			}
+			
+		guiserver.out.println(")");	
+		guiserver.out.flush();
+		}
+	
+	public void mouseReleased(MouseEvent e)
+		{
+		if(mouseReleasedEvent == null) return;
+				
+		int X = e.getX();
+		int Y = e.getY();
+		
+		guiserver.out.print("(" + mouseReleasedEvent + " " + X + " " + Y + " " + 
+			e.getButton() + " " + e.getModifiers());
+		
+		if(mouseReleasedTags)
+			{
+			guiserver.out.print(" '(");
+			Iterator tags = getTagsFromPoint(X, Y);
+			while(tags.hasNext())
+				guiserver.out.print("\"" + tags.next() + "\" ");
+			guiserver.out.print(")");
+			}
+			
+		guiserver.out.println(")");	
+		guiserver.out.flush();
+		}
+	
+	public void mouseDragged(MouseEvent e) 
+		{
+		if(mouseDraggedEvent == null) return;
+			
+		int X = e.getX();
+		int Y = e.getY();
+		
+		guiserver.out.println("(" + mouseDraggedEvent + " " + X + " " + Y + " " + 
+				e.getButton() + " " + e.getModifiers() + ")" );
+		guiserver.out.flush();
+		}
+
+	public void mouseMoved(MouseEvent e) 
+		{
+		if(mouseMovedEvent == null) return;
+			
+		int X = e.getX();
+		int Y = e.getY();
+		
+		guiserver.out.print("(" + mouseMovedEvent + " " + X + " " + Y);
+		
+		if(mouseMovedTags)
+			{
+			guiserver.out.print(" '(");
+			Iterator tags = getTagsFromPoint(X, Y);
+			while(tags.hasNext())
+				guiserver.out.print("\"" + tags.next() + "\" ");
+			guiserver.out.print(")");
+			}
+		
+		guiserver.out.println(")");	
+		guiserver.out.flush();
+		}
+	
+	public void mouseWheelMoved(MouseWheelEvent e) 
+		{
+		if(mouseWheelMovedEvent == null) return;
+		
+		int rotation = e.getWheelRotation();
+		int X = e.getX();
+		int Y = e.getY();
+		
+		guiserver.out.println("(" + mouseWheelMovedEvent + " " + X + " " + Y + " " + rotation + ")" );
+		guiserver.out.flush();
+		}
+		
+	public void export(String path, String format, int width, int height)
+		{
+		//BufferedImage bufferimage = new BufferedImage(width, height, BufferedImage.TYPE_4BYTE_ABGR);
+		BufferedImage bufferimage = new BufferedImage(width, height, BufferedImage.TYPE_INT_ARGB);
+		
+		Graphics2D g2 = bufferimage.createGraphics();
+		
+		render(g2);
+		
+		try { ImageIO.write(bufferimage, format, new File(path)); } 
+		catch (IOException ie) {
+				ErrorDialog.show("Exporting", "Could not write file: " + path);
+				}
+		}
+	
+	public int print(Graphics graphics, PageFormat pageFormat, int pageIndex) 
+		{
+		return(0);
+		}
+	}
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/CheckBoxWidget.java b/guiserver/java/CheckBoxWidget.java
new file mode 100644
index 0000000..cee6978
--- /dev/null
+++ b/guiserver/java/CheckBoxWidget.java
@@ -0,0 +1,80 @@
+//
+//  CheckBoxWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/13/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import javax.swing.*;
+import java.awt.event.*;
+import java.util.*;
+
+public class CheckBoxWidget extends aButton {
+
+@SuppressWarnings("unchecked") 
+
+public CheckBoxWidget(StringTokenizer params)
+	{
+	abutton = new JCheckBox();
+	jcomponent = abutton;
+	component = abutton;
+	container = abutton;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	if(params.hasMoreTokens())
+		{
+		String base64string = params.nextToken();
+		abutton.setText(Base64Coder.decodeString(base64string));
+		}
+	
+	if(params.hasMoreTokens())
+		{
+		if(params.nextToken().equals("true"))
+			abutton.setSelected(true);
+		}
+	
+	gsObject.widgets.put(id, this);
+
+	
+	ActionListener listener = new ActionListener() {
+		public void actionPerformed(ActionEvent e)
+			{	
+			if(action != null)
+				{
+				if(abutton.isSelected())
+					guiserver.out.println("("+ action + " \"" + id + "\" true)");
+				else
+					guiserver.out.println("("+ action + " \"" + id + "\" nil)");
+					
+				guiserver.out.flush();
+				}
+			}
+		};
+
+	abutton.addActionListener(listener);
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/CircleShape.java b/guiserver/java/CircleShape.java
new file mode 100644
index 0000000..548d866
--- /dev/null
+++ b/guiserver/java/CircleShape.java
@@ -0,0 +1,69 @@
+//
+//  CircleShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/9/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+
+@SuppressWarnings("unchecked")
+public class CircleShape extends Shape {
+
+int radius;
+
+public CircleShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	radius = Integer.parseInt(tokens.nextToken());
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.drawOval(X - radius, Y - radius, 2 * radius - 1, 2 * radius - 1);
+	}
+	
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X - radius, Y - radius, 2 * radius, 2 * radius).contains(x, y));
+	}
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/ComboBoxWidget.java b/guiserver/java/ComboBoxWidget.java
new file mode 100644
index 0000000..4066c86
--- /dev/null
+++ b/guiserver/java/ComboBoxWidget.java
@@ -0,0 +1,111 @@
+//
+//  ComboBoxWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/13/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+
+
+@SuppressWarnings("unchecked") 
+public class ComboBoxWidget extends gsObject implements ActionListener{
+
+JComboBox combobox;
+
+public ComboBoxWidget(StringTokenizer params)
+	{
+	combobox = new JComboBox();
+	jcomponent = combobox;
+	component = combobox;
+	container = combobox;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+		
+	while(params.hasMoreTokens())
+		combobox.addItem(Base64Coder.decodeString(params.nextToken()));
+
+	gsObject.widgets.put(id, this);
+
+	combobox.addActionListener(this);
+	}
+	
+public void actionPerformed(ActionEvent e)
+	{
+	int index = combobox.getSelectedIndex();
+	String idx = Integer.toString(index);
+	String item = Base64Coder.encodeString(combobox.getSelectedItem().toString());
+	guiserver.out.println("(" + action + " \"" + id + "\" " + idx + " \"" + item + "\")");
+	guiserver.out.flush();
+	}
+	
+public void addListItem(StringTokenizer tokens)
+	{
+	while(tokens.hasMoreTokens()) 
+		combobox.addItem(Base64Coder.decodeString(tokens.nextToken()));
+	}
+	
+public void removeListItem(StringTokenizer tokens)
+	{
+	int index = 0; 
+	
+	while(tokens.hasMoreTokens()) 
+		{
+		index = Integer.parseInt(tokens.nextToken());
+		if(index > (combobox.getItemCount() - 1)) index = combobox.getItemCount() - 1;
+		if(index < 0) index = 0;
+		combobox.removeItemAt(index);
+		}
+	}
+
+public void insertListItem(StringTokenizer tokens)
+	{
+	int index = 0; 
+	String text;
+	
+	while(tokens.hasMoreTokens())
+		{
+		text = Base64Coder.decodeString(tokens.nextToken());
+		index = Integer.parseInt(tokens.nextToken());
+		if(index > (combobox.getItemCount() - 1)) index = combobox.getItemCount() - 1;
+		if(index < 0) index = 0;
+		combobox.insertItemAt(text, index);
+		}
+	}
+	
+public void selectListItem(StringTokenizer tokens)
+	{
+	String item = Base64Coder.decodeString(tokens.nextToken());
+	combobox.setSelectedItem(item);
+	}
+
+public void clearList(StringTokenizer tokens)
+	{
+	combobox.removeAllItems();
+	}
+	
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/DialogWidget.java b/guiserver/java/DialogWidget.java
new file mode 100644
index 0000000..13378fc
--- /dev/null
+++ b/guiserver/java/DialogWidget.java
@@ -0,0 +1,231 @@
+//
+//  DialogWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/23/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+
+// DO NOT USE, when set modal inhibits Dispather from processing incoming messages
+// this makes it imposible to serve newLISP requests from the Dialog, if modal
+
+@SuppressWarnings("unchecked")
+
+public class DialogWidget extends gsObject {
+
+JDialog jdialog;
+JFrame jfowner;
+String dialogCloseAction = null;
+String dialogMoveAction = null;
+String dialogResizeAction = null;
+
+public DialogWidget(StringTokenizer params)
+	{
+	id = params.nextToken();
+	String owner = params.nextToken();
+	String message = Base64Coder.decodeString(params.nextToken());
+	boolean ismodal = false;
+	
+	jfowner = ((WindowFrame)gsObject.widgets.get(owner)).jframe;
+		
+	//String closeButtonId = params.nextToken();
+	//ButtonWidget closeButton = (ButtonWidget)gsObject.widgets.get(closeButtonId);
+	
+	int x = jfowner.getX() + 100;
+	int y = jfowner.getY() + 100;
+	int width = Integer.parseInt(params.nextToken());
+	int height = Integer.parseInt(params.nextToken());
+	
+	jdialog	= new JDialog(jfowner, message, false);
+	//closeButton.jdialog = jdialog;
+		
+	jdialog.setBounds(x, y, width, height);
+	
+	container = jdialog.getContentPane();
+	
+	if(params.hasMoreTokens())
+		{
+		if(params.nextToken().equals("true"))
+			jdialog.setVisible(true);	
+		}
+	else jdialog.setVisible(false);
+	
+	if(params.hasMoreTokens())
+		{
+		if(params.nextToken().equals("true"))
+			jfowner.setEnabled(false);
+		}
+	
+	WindowAdapter listener = new WindowAdapter() {
+		public void windowClosing(WindowEvent w)
+			{
+			//System.out.println("Closing dialog");
+			jfowner.setEnabled(true);
+			jdialog.dispose();
+			if(dialogCloseAction != null)
+				{
+				guiserver.out.println("(" + dialogCloseAction + "\"" + id + "\")");
+				guiserver.out.flush();
+				}
+			}
+		};
+
+ 	jdialog.addWindowListener(listener);
+	
+	ComponentAdapter componentListener = new ComponentAdapter() {
+		public void componentResized(ComponentEvent re) 
+			{
+			if(dialogResizeAction != null)
+				{
+				guiserver.out.println("(" + dialogResizeAction + "\"" + id + "\"" + 
+						jdialog.getWidth() + " " + jdialog.getHeight() +")");
+				guiserver.out.flush();
+				}
+			}
+			
+		public void componentMoved(ComponentEvent me)
+			{
+			if(dialogMoveAction != null)
+				{
+				guiserver.out.println("(" + dialogMoveAction + "\"" + id + "\"" + 
+						jdialog.getLocationOnScreen().x + " " + jdialog.getLocationOnScreen().y +")");
+				guiserver.out.flush();
+				}
+			}
+		};
+		
+	jdialog.addComponentListener(componentListener);
+
+	gsObject.widgets.put(id, this);
+	
+	jdialog.setDefaultCloseOperation(JFrame.DISPOSE_ON_CLOSE);
+	}
+	
+	
+public void setText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	jdialog.setTitle(text);
+	}
+
+
+public void getText(StringTokenizer tokens)
+	{
+	String action = tokens.nextToken();
+	String text = jdialog.getTitle();
+	if(text.length() == 0)
+		guiserver.out.println("(" + action + " \"" + id + "\")");
+	else
+		guiserver.out.println("(" + action + " \"" + id + "\" [text]" + Base64Coder.encodeString(text) + "[/text])");
+	guiserver.out.flush();
+	}
+	
+
+public void clearText(StringTokenizer tokens)
+	{
+	jdialog.setTitle("");
+	}
+
+
+public void setVisible(StringTokenizer tokens)
+	{
+	if(tokens.nextToken().equals("true"))
+		jdialog.setVisible(true);
+	else
+		jdialog.setVisible(false);
+	}
+
+public void setResizable(StringTokenizer tokens)
+	{
+	if(tokens.nextToken().equals("true"))
+		jdialog.setResizable(true);
+	else
+		jdialog.setResizable(false);
+	}
+
+public void dispose(StringTokenizer tokens)
+	{
+	jfowner.setEnabled(true);
+	jdialog.dispose();
+	}
+	
+public void setBackground(StringTokenizer tokens)
+	{
+	Float red = Float.parseFloat(tokens.nextToken());
+	Float green = Float.parseFloat(tokens.nextToken());
+	Float blue = Float.parseFloat(tokens.nextToken());
+	if(tokens.hasMoreTokens())
+		{
+		Float alpha = Float.parseFloat(tokens.nextToken());
+		jdialog.setBackground(new Color(red, green, blue, alpha));
+		}
+	else
+		jdialog.setBackground(new Color(red, green, blue));
+	}
+	
+public void setFont(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void setToolTip(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void getBounds(StringTokenizer tokens)
+	{
+	int x, y, width, height;
+	
+	x = jdialog.getLocationOnScreen().x;
+	y = jdialog.getLocationOnScreen().y;
+		
+	width = jdialog.getWidth();
+	height = jdialog.getHeight();
+	
+	guiserver.out.println("( set 'gs:bounds '(" + x + " " + y + " " + width + " " + height + "))\n");
+	guiserver.out.flush();
+	}
+
+	
+public void frameCloseEvent(StringTokenizer tokens)
+	{
+	dialogCloseAction = tokens.nextToken();
+	}
+	
+public void frameResizeEvent(StringTokenizer tokens)
+	{
+	dialogResizeAction = tokens.nextToken();
+	}
+	
+public void frameMoveEvent(StringTokenizer tokens)
+	{
+	dialogMoveAction = tokens.nextToken();
+	}
+	
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/Dispatcher.java b/guiserver/java/Dispatcher.java
new file mode 100644
index 0000000..6080270
--- /dev/null
+++ b/guiserver/java/Dispatcher.java
@@ -0,0 +1,306 @@
+//
+//  Dispatcher.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/14/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.lang.reflect.Constructor;
+import java.lang.reflect.Method;
+import java.util.*;
+import java.io.*;
+import java.net.*;
+import java.awt.*;
+import javax.swing.*;
+import javax.swing.event.*;
+import javax.swing.text.*;
+
+@SuppressWarnings("unchecked")
+public class Dispatcher {
+
+static String cmd;
+static HashMap classes = new HashMap();
+static HashMap methods = new HashMap();
+	
+public static void dispatch(String command)
+	{
+	StringTokenizer tokens = null;
+	String id = null;
+	gsObject gsobject = null;
+	Class cfoo;
+	Constructor constor;
+	Class[] defArgs = {StringTokenizer.class};
+	Method method;
+	String methodName;
+	
+	if(guiserver.debug) System.out.println("-> " + command);
+	
+	tokens = new StringTokenizer(command);
+	
+	Object[] initArgs = {tokens};
+	cmd = tokens.nextToken();
+			
+	// look for constructor methods
+	if((cfoo = (Class)classes.get(cmd)) != null)
+		{
+		try { 
+			constor = cfoo.getConstructor(defArgs); 
+			constor.newInstance(initArgs);
+			} catch (Exception ce) { 
+			if(guiserver.debug)
+				System.out.println("Error: " + cmd + "=>" + ce);
+			else
+				{
+				ErrorDialog.show(command, "Could not create " + cmd);
+				//System.exit(1);
+				return;
+				}
+			}
+				
+		return;
+		}
+
+	else // get target object
+		{
+		id = tokens.nextToken();
+		gsobject = (gsObject)gsObject.widgets.get(id);
+		//System.out.println("get target: " + id);
+		if(gsobject == null)
+			{
+			ErrorDialog.wrongApplication(cmd, id);
+			//System.exit(1);
+			return;
+			}
+		}
+
+	// get method for target and invoke it with arguments
+	try { 
+		//System.out.println("invoke " + cmd + " on " + id);
+		methodName = (String)methods.get(cmd);
+		//System.out.println("methodName:" + methodName);
+		method = gsobject.getClass().getMethod(methodName, defArgs);
+		//System.out.println("method:" + method);
+		if(method != null)
+			{
+			method.invoke(gsobject, initArgs);
+			return;
+			}
+		} catch (Exception ce) { 
+		if(guiserver.debug)
+			ce.printStackTrace();
+		else
+			{
+			ErrorDialog.show(command, "Could not invoke method " + cmd + " with " + id);
+			//System.exit(1);
+			return;
+			}
+		}
+	}
+	
+public static void init()
+	{
+	// GUI widget classes
+	classes.put("window", WindowWidget.class);
+	classes.put("frame", WindowFrame.class);
+	classes.put("dialog", DialogWidget.class);
+	classes.put("panel", PanelWidget.class);
+	classes.put("tabbed-pane", TabbedPaneWidget.class);
+	classes.put("split-pane", SplitPaneWidget.class);
+	classes.put("scroll-pane", ScrollPaneWidget.class);
+	classes.put("label", LabelWidget.class);
+	classes.put("image-label", ImageLabelWidget.class);
+	classes.put("set-grid-layout", LayoutGrid.class);
+	classes.put("set-flow-layout", LayoutFlow.class);
+	classes.put("set-border-layout", LayoutBorder.class);
+	classes.put("button", ButtonWidget.class);
+	classes.put("image-button", ImageButtonWidget.class);
+	classes.put("toggle-button", ToggleButtonWidget.class);
+	classes.put("check-box", CheckBoxWidget.class);
+	classes.put("radio-button", RadioButtonWidget.class);
+	classes.put("combo-box", ComboBoxWidget.class);
+	classes.put("slider", SliderWidget.class);
+	classes.put("progress-bar", ProgressBarWidget.class);
+	classes.put("list-box", ListBoxWidget.class);
+	classes.put("text-field", TextFieldWidget.class);
+	classes.put("text-area", TextAreaWidget.class);
+	classes.put("menu-item", MenuItemWidget.class);
+	classes.put("menu-item-check", MenuItemCheckWidget.class);
+	classes.put("menu", MenuWidget.class);
+	classes.put("menu-popup", PopupMenuWidget.class);
+	classes.put("menu-bar", MenuBarWidget.class);
+	classes.put("tool-bar", ToolbarWidget.class);
+	classes.put("text-pane", TextPaneWidget.class);
+
+	// 2D Graphics classes
+	classes.put("canvas", CanvasWidget.class);
+	
+	// GUI methods
+	methods.put("add-list-item","addListItem");
+	methods.put("add-separator","addSeparator");
+	methods.put("add-to","addTo");
+	methods.put("append-text","appendText");
+	methods.put("clear-list","clearList");
+	methods.put("clear-text","clearText");
+	methods.put("confirm-dialog","confirmDialog");
+	methods.put("color-dialog","ColorChooser");
+	methods.put("copy-text","copyText");
+	methods.put("cut-text","cutText");
+	methods.put("disable","Disable");
+	methods.put("dispose","dispose");
+	methods.put("enable","Enable");
+	methods.put("find-text", "findText");
+	methods.put("frame-closed", "frameCloseEvent");
+	methods.put("frame-moved", "frameMoveEvent");
+	methods.put("frame-resized", "frameResizeEvent");
+	methods.put("get-bounds", "getBounds");
+	methods.put("get-font-metrics", "getFontMetrics");
+	methods.put("get-selected-text", "getSelection");
+	methods.put("get-text","getText");
+	methods.put("get-text-position","getTextPosition");
+	methods.put("goto-text", "gotoText");
+	methods.put("insert-list-item","insertListItem");
+	methods.put("insert-tab","insertTab");
+	methods.put("insert-text", "insertText");
+	methods.put("layout", "layout");
+	methods.put("load-text", "loadText");
+	methods.put("open-file-dialog","OpenFileChooser");
+	methods.put("message-dialog","messageDialog");
+	methods.put("paste-text","pasteText");
+	methods.put("redo-text","redoText");
+	methods.put("remove-from", "removeFrom");
+	methods.put("remove-list-item","removeListItem");
+	methods.put("remove-tab","removeTab");
+	methods.put("request-focus","requestFocus");
+	methods.put("save-file-dialog","SaveFileChooser");
+	methods.put("save-text", "saveText");
+	methods.put("set-caret", "setCaret");
+	methods.put("select-text","selectText");
+	methods.put("set-accelerator","setAccelerator");
+	methods.put("set-background","setBackground");
+	methods.put("set-bevel-border","setBevelBorder");
+	methods.put("set-caret-color","setCaretColor");
+	methods.put("set-color","setBackground");	
+	methods.put("set-cursor","setCursor");
+	methods.put("set-editable","setEditable");
+	methods.put("set-font","setFont");
+	methods.put("set-foreground","setForeground");
+	methods.put("set-icon","setIcon");
+	methods.put("select-list-item","selectListItem");
+	methods.put("set-pressed-icon","setPressedIcon");
+	methods.put("set-resizable","setResizable");
+	methods.put("set-selected","setSelected");
+	methods.put("set-selection-color","setSelectionColor");
+	methods.put("set-size","setPreferredSize");
+	methods.put("set-text","setText");
+	methods.put("set-tab-size","setTabSize");
+	methods.put("set-titled-border","setTitledBorder");
+	methods.put("set-tool-tip","setToolTip");
+	methods.put("set-value","setValue");
+	methods.put("set-visible","setVisible");
+	methods.put("set-syntax", "setSyntax");
+	methods.put("show-popup", "showPopup");
+	methods.put("undo-text","undoText");
+	methods.put("undo-enable", "undoEnable");
+	methods.put("run-shell", "runShell");
+	methods.put("eval-shell", "evalShell");
+	methods.put("destroy-shell", "destroyShell");
+	
+	// methods for System object (guiserver)
+	methods.put("dispose-splash", "disposeSplash");
+	methods.put("get-fonts", "getFonts");
+	methods.put("get-screen", "getScreen");
+	methods.put("get-version", "getVersion");
+	methods.put("set-trace", "setTrace");
+	methods.put("set-look-and-feel", "setLookAndFeel");
+	methods.put("set-syntax-colors", "setSyntaxColors");
+	methods.put("play-sound", "playSound");
+	methods.put("set-utf8", "setUTF8");
+	
+	// 2D Grapics
+	// All methods hace the current canvas as target
+	
+	// methods for creating sjapes
+	// put in Vector in current canvas
+	methods.put("draw-arc", "drawArc");
+	methods.put("draw-circle", "drawCircle");
+	methods.put("draw-ellipse", "drawEllipse");
+	methods.put("draw-image", "drawImage"); 
+	methods.put("draw-line", "drawLine");
+	methods.put("draw-path", "drawPath"); 
+	methods.put("draw-polygon", "drawPolygon");
+	methods.put("draw-text", "drawText"); 
+	methods.put("draw-rect", "drawRectangle");
+	methods.put("draw-round-rect", "drawRoundRect");
+	methods.put("fill-arc", "fillArc");
+	methods.put("fill-circle", "fillCircle");
+	methods.put("fill-ellipse", "fillEllipse");
+	methods.put("fill-polygon", "fillPolygon");
+	methods.put("fill-rect", "fillRectangle");
+	methods.put("fill-round-rect", "fillRoundRect");
+	methods.put("set-anti-aliasing", "setAntiAliasing");
+
+	// general mouse and key events
+	methods.put("mouse-event","registerMouseEvent");
+	methods.put("key-event","registerKeyEvent");
+	
+	// specialize events for canvas
+	methods.put("mouse-clicked","registerMouseClicked");
+	methods.put("mouse-pressed","registerMousePressed");
+	methods.put("mouse-released","registerMouseRelease");
+	methods.put("mouse-entered","registerMouseEntered");
+	methods.put("mouse-exited","registerMouseExited");
+	methods.put("mouse-dragged","registerMouseDragged");
+	methods.put("mouse-moved","registerMouseMoved");
+	methods.put("mouse-wheel", "registerMouseWheel");
+	
+	// take canvas for global settings as target
+	methods.put("set-canvas", "g2Canvas");
+	methods.put("set-translation", "g2Translation");
+	methods.put("set-transform", "g2Transform");
+	methods.put("set-rotation", "g2Rotation");
+	methods.put("set-scale", "g2Scale");
+	methods.put("export", "g2Export");
+	methods.put("print", "g2Print");
+	methods.put("update", "g2Update");
+	
+	// current canvas settings used in next shape
+	methods.put("set-stroke", "g2Stroke");
+	methods.put("set-paint", "g2Paint");
+	methods.put("set-composite", "g2Composite");
+	methods.put("set-clipping", "g2Clip");
+	
+	// take tags for drawing shapes as target
+	methods.put("delete-tag", "deleteTaggedShape");
+	methods.put("move-tag", "moveTaggedShape");
+	methods.put("translate-tag", "translateTaggedShape");
+	methods.put("rotate-tag", "rotateTaggedShape");
+	methods.put("scale-tag", "scaleTaggedShape");
+	methods.put("shear-tag", "shearTaggedShape");
+	methods.put("hide-tag", "hideTaggedShape");
+	methods.put("show-tag", "showTaggedShape");
+	methods.put("delete-tag", "deleteTaggedShape");	
+	methods.put("reorder-tags", "orderTaggedShapes");	
+	methods.put("color-tag", "colorTaggedShape");	
+	}
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/EllipseShape.java b/guiserver/java/EllipseShape.java
new file mode 100644
index 0000000..f5623c6
--- /dev/null
+++ b/guiserver/java/EllipseShape.java
@@ -0,0 +1,71 @@
+//
+//  EllipseShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/9/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class EllipseShape extends Shape {
+
+int radiusX;
+int radiusY;
+
+public EllipseShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	radiusX = Integer.parseInt(tokens.nextToken());
+	radiusY = Integer.parseInt(tokens.nextToken());
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.drawOval(X - radiusX, Y - radiusY, 2 * radiusX - 1, 2 * radiusY - 1);
+	}
+	
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X - radiusX, Y - radiusY, 2 * radiusX, 2 * radiusY).contains(x, y));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/ErrorDialog.java b/guiserver/java/ErrorDialog.java
new file mode 100644
index 0000000..9b67f5b
--- /dev/null
+++ b/guiserver/java/ErrorDialog.java
@@ -0,0 +1,72 @@
+//
+//  ErrorDialog.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/18/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.util.*;
+import java.awt.*;
+import javax.swing.*;
+
+public class ErrorDialog {
+
+static public void show(String command, String message)
+	{
+	int len = command.length();
+	String cmd;
+	
+	if(len > 128) 
+		cmd = command.substring(0, 64) + "..." + command.substring(len - 64);
+	else 
+		cmd = command;
+	
+	JOptionPane.showMessageDialog(null,
+					cmd + " :    \n" + message + "    ",
+					"newLISP GUI server",
+					JOptionPane.ERROR_MESSAGE);
+	//System.exit(0);
+	return;
+	}
+	
+static public void wrongApplication(String command, String id)
+	{
+	int len = command.length();
+	String cmd;
+		
+	if(len > 128) 
+		cmd = command.substring(0, 64) + "..." + command.substring(len - 64);
+	else 
+		cmd = command;
+	
+
+	JOptionPane.showMessageDialog(null,
+				cmd + ":    \ncannot be applied to " + id + "    ",
+				"newLISP GUI server",
+				JOptionPane.ERROR_MESSAGE);
+	//System.exit(0);
+	return;
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/FilledArcShape.java b/guiserver/java/FilledArcShape.java
new file mode 100644
index 0000000..056f23d
--- /dev/null
+++ b/guiserver/java/FilledArcShape.java
@@ -0,0 +1,77 @@
+//
+//  FilledArcShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/24/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class FilledArcShape extends Shape {
+
+
+int width;
+int height;
+int startAngle;
+int arcAngle;
+
+public FilledArcShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	width = Integer.parseInt(tokens.nextToken());
+	height = Integer.parseInt(tokens.nextToken());
+	startAngle = Integer.parseInt(tokens.nextToken());
+	arcAngle = Integer.parseInt(tokens.nextToken());
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.fillArc(X, Y, width - 1, height - 1, startAngle, arcAngle);
+	}
+	
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X, Y, width, height).contains(x, y));
+	}
+
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/FilledCircleShape.java b/guiserver/java/FilledCircleShape.java
new file mode 100644
index 0000000..da788c9
--- /dev/null
+++ b/guiserver/java/FilledCircleShape.java
@@ -0,0 +1,70 @@
+//
+//  FilledCircleShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/24/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+
+@SuppressWarnings("unchecked")
+public class FilledCircleShape extends Shape {
+
+int radius;
+
+public FilledCircleShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	radius = Integer.parseInt(tokens.nextToken());
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.fillOval(X - radius, Y - radius, 2 * radius - 1, 2 * radius - 1);
+	}
+	
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X - radius, Y - radius, 2 * radius, 2 * radius).contains(x, y));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/FilledEllipseShape.java b/guiserver/java/FilledEllipseShape.java
new file mode 100644
index 0000000..eb44786
--- /dev/null
+++ b/guiserver/java/FilledEllipseShape.java
@@ -0,0 +1,72 @@
+//
+//  FilledEllipseShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/24/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class FilledEllipseShape extends Shape {
+
+
+int radiusX;
+int radiusY;
+
+public FilledEllipseShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	radiusX = Integer.parseInt(tokens.nextToken());
+	radiusY = Integer.parseInt(tokens.nextToken());
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.fillOval(X - radiusX, Y - radiusY, 2 * radiusX - 1, 2 * radiusY - 1);
+	}
+	
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X - radiusX, Y - radiusY, 2 * radiusX, 2 * radiusY).contains(x, y));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/FilledPolygonShape.java b/guiserver/java/FilledPolygonShape.java
new file mode 100644
index 0000000..f158aec
--- /dev/null
+++ b/guiserver/java/FilledPolygonShape.java
@@ -0,0 +1,103 @@
+//
+//  FilledPolygonShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 7/2/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class FilledPolygonShape extends Shape {
+
+int pointXd[];
+int pointYd[];
+
+int N;
+
+public FilledPolygonShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	N = Integer.parseInt(tokens.nextToken());
+	
+	pointXd = new int [N];
+	pointYd = new int [N];
+	
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	
+	pointXd[0] = pointYd[0] = 0;
+	
+	for(int i = 1; i < N; i++)
+		{
+		pointXd[i] = Integer.parseInt(tokens.nextToken()) - X;
+		pointYd[i] = Integer.parseInt(tokens.nextToken()) - Y;
+		}
+		
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+		
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+		
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	
+/*
+	int pX[] = new int [N];
+	int pY[] = new int [N];
+	
+	for(int i = 0; i < N; i++)
+		{
+		pX[i] = pointXd[i] + X;
+		pY[i] = pointYd[i] + Y;
+		}
+
+	g2.fillPolygon(pX, pY, N);
+*/
+	Polygon polygon = new Polygon();
+	
+	for(int i = 0; i < N; i++)
+		polygon.addPoint(pointXd[i] + X, pointYd[i] + Y);
+
+	g2.fill(polygon);
+	}
+
+public boolean hasPoint(int x, int y)
+	{	
+	Polygon polygon = new Polygon();
+	
+	for(int i = 0; i < N; i++)
+		polygon.addPoint(pointXd[i] + X, pointYd[i] + Y);
+	
+	return(polygon.contains(x, y));
+	}
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/FilledRectangle.java b/guiserver/java/FilledRectangle.java
new file mode 100644
index 0000000..b140d2d
--- /dev/null
+++ b/guiserver/java/FilledRectangle.java
@@ -0,0 +1,79 @@
+//
+//  FilledRectangle.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/24/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class FilledRectangle extends Shape {
+
+int X;
+int Y;
+int width;
+int height;
+
+public FilledRectangle(StringTokenizer tokens)
+	{
+	float R, G, B;
+	float alpha;
+	
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	width = Integer.parseInt(tokens.nextToken());
+	height = Integer.parseInt(tokens.nextToken());
+	if(tokens.hasMoreTokens())
+		{
+		R = Float.parseFloat(tokens.nextToken());
+		G = Float.parseFloat(tokens.nextToken());
+		B = Float.parseFloat(tokens.nextToken());
+		if(tokens.hasMoreTokens())
+			alpha = Float.parseFloat(tokens.nextToken());
+		else 
+			alpha = 1;
+		paintColor = new Color(R, G, B, alpha);
+		}
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.fillRect(X, Y, width, height);
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/FilledRectangleShape.java b/guiserver/java/FilledRectangleShape.java
new file mode 100644
index 0000000..85729b8
--- /dev/null
+++ b/guiserver/java/FilledRectangleShape.java
@@ -0,0 +1,70 @@
+//
+//  FilledRectangleShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/24/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class FilledRectangleShape extends Shape {
+
+int width;
+int height;
+
+public FilledRectangleShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	width = Integer.parseInt(tokens.nextToken());
+	height = Integer.parseInt(tokens.nextToken());
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.fillRect(X, Y, width, height);
+	}
+
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X, Y, width, height).contains(x, y));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/FilledRoundRectShape.java b/guiserver/java/FilledRoundRectShape.java
new file mode 100644
index 0000000..7cc5209
--- /dev/null
+++ b/guiserver/java/FilledRoundRectShape.java
@@ -0,0 +1,81 @@
+//
+//  FilledRoundRectShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/24/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class FilledRoundRectShape extends Shape {
+
+
+int width;
+int height;
+int arcWidth;
+int arcHeight;
+
+@SuppressWarnings("unchecked")
+public FilledRoundRectShape(StringTokenizer tokens)
+	{
+	float R, G, B;
+	float alpha;
+	
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	width = Integer.parseInt(tokens.nextToken());
+	height = Integer.parseInt(tokens.nextToken());
+	arcWidth = Integer.parseInt(tokens.nextToken());
+	arcHeight = Integer.parseInt(tokens.nextToken());
+
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.fillRoundRect(X, Y, width - 1, height - 1, arcWidth, arcHeight);
+	}
+
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X, Y, width, height).contains(x, y));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/FilledRoundRectangleShape.java b/guiserver/java/FilledRoundRectangleShape.java
new file mode 100644
index 0000000..957b45c
--- /dev/null
+++ b/guiserver/java/FilledRoundRectangleShape.java
@@ -0,0 +1,78 @@
+//
+//  FilledRoundRectangleShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 7/2/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class FilledRoundRectangleShape extends Shape {
+
+int width;
+int height;
+
+int arcWidth;
+int arcHeight;
+
+public FilledRoundRectangleShape(StringTokenizer tokens)
+	{
+	float R, G, B;
+	
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	width = Integer.parseInt(tokens.nextToken());
+	height = Integer.parseInt(tokens.nextToken());
+	arcWidth = Integer.parseInt(tokens.nextToken());
+	arcHeight = Integer.parseInt(tokens.nextToken());
+
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.fillRoundRect(X, Y, width - 1, height - 1, arcWidth, arcHeight);
+	}
+	
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X, Y, width, height).contains(x, y));
+	}
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/FilterFileReader.java b/guiserver/java/FilterFileReader.java
new file mode 100644
index 0000000..01c08ed
--- /dev/null
+++ b/guiserver/java/FilterFileReader.java
@@ -0,0 +1,71 @@
+//
+//  FilterFileReader.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 7/17/07.
+
+import java.awt.event.*;
+import java.io.*;
+import java.io.InputStreamReader;
+// import java.io.FileReader;
+import java.io.FileInputStream;
+
+
+public class FilterFileReader extends InputStreamReader {
+
+public FilterFileReader(String path, String charSet) throws java.io.FileNotFoundException, UnsupportedEncodingException
+	{
+	super(new FileInputStream(path), charSet);
+	}
+
+public FilterFileReader(String path) throws java.io.FileNotFoundException, UnsupportedEncodingException
+	{
+	super(new FileInputStream(path));
+	}
+
+/*
+public class FilterFileReader extends FileReader  {
+
+public FilterFileReader(String path) throws java.io.FileNotFoundException
+	{
+	super(path);
+	}
+*/
+	
+public int read() throws java.io.IOException
+	{
+	int chr = super.read();
+	
+	if(chr  == 13)
+		chr = super.read();
+	
+	return(chr);
+	}
+	
+public int read(char[] cbuf, int offset, int length) throws IOException
+	{
+	int chr;
+	int len = 0;
+
+	//System.out.println("reading:" + offset + " " + length);
+	
+	for(int i = 0; i < length; i++)
+		{
+		chr = super.read();
+
+		if(chr == 13)
+			chr = super.read();
+		
+		if(chr == -1) break;
+
+		cbuf[offset + i] = (char)chr;
+		++len;
+		}
+
+	if(len == 0) return(-1);
+	
+	return(len);
+	}
+		
+
+}
diff --git a/guiserver/java/ImageButtonWidget.java b/guiserver/java/ImageButtonWidget.java
new file mode 100644
index 0000000..2b36d1f
--- /dev/null
+++ b/guiserver/java/ImageButtonWidget.java
@@ -0,0 +1,94 @@
+//
+//  ImageButtonWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/22/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+
+public class ImageButtonWidget  extends aButton {
+
+@SuppressWarnings("unchecked") 
+public ImageButtonWidget(StringTokenizer params)
+	{
+	int width = 32;
+	int height = 32;
+	
+	abutton = new JButton();
+	jcomponent = abutton;
+	component = abutton;
+	container = abutton;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	setIconFromPath(Base64Coder.decodeString(params.nextToken()));
+	
+	if(params.hasMoreTokens())
+		setPressedIconFromPath(Base64Coder.decodeString(params.nextToken()));
+	else
+		abutton.setPressedIcon(new ImageIcon(Toolkit.getDefaultToolkit().getImage(getClass().getResource("/images/pressedbutton32.png"))));
+	
+	
+	if(params.hasMoreTokens())
+		{
+		width = Integer.parseInt(params.nextToken());
+		height = Integer.parseInt(params.nextToken());
+		}
+		
+	abutton.setPreferredSize(new Dimension(width, height));
+	
+	abutton.setBorder(BorderFactory.createEmptyBorder());
+	
+	gsObject.widgets.put(id, this);
+	
+	ActionListener listener = new ActionListener() {
+		public void actionPerformed(ActionEvent e)
+			{
+			if(action != null)
+				{
+				guiserver.out.println("("+ action + " \"" + id +  "\")");
+				guiserver.out.flush();
+				}
+			}
+		};
+		
+	abutton.addActionListener(listener);
+	}
+	
+		
+public void setIconFromPath(String path)
+	{
+	abutton.setIcon(guiserver.getIconFromPath(path, this.getClass()));
+	}
+	
+public void setPressedIconFromPath(String path)
+	{
+	abutton.setPressedIcon(guiserver.getIconFromPath(path, this.getClass()));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/ImageLabelWidget.java b/guiserver/java/ImageLabelWidget.java
new file mode 100644
index 0000000..60c72b8
--- /dev/null
+++ b/guiserver/java/ImageLabelWidget.java
@@ -0,0 +1,82 @@
+//
+//  ImageLabelWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/23/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import javax.swing.*;
+import java.util.*;
+
+public class ImageLabelWidget extends gsObject {
+
+JLabel label;
+
+@SuppressWarnings("unchecked") 
+public ImageLabelWidget(StringTokenizer params)
+	{
+	label = new JLabel();
+	jcomponent = label;
+	component = label;
+	container = label;
+	
+	id = params.nextToken();
+	String align = "center";
+	if(params.hasMoreTokens())
+		this.setIcon(params);
+	
+	if(params.hasMoreTokens())
+		align = params.nextToken();
+		
+	if(align.equals("left")) label.setHorizontalAlignment(JLabel.LEFT);
+	else if(align.equals("center")) label.setHorizontalAlignment(JLabel.CENTER);
+	else if(align.equals("right")) 	label.setHorizontalAlignment(JLabel.RIGHT);
+	else if(align.equals("leading")) label.setHorizontalAlignment(JLabel.LEADING);
+	else if(align.equals("trailing")) label.setHorizontalAlignment(JLabel.TRAILING);
+	else if(align.equals("bottom")) label.setVerticalAlignment(JLabel.BOTTOM);
+	else if(align.equals("top")) label.setVerticalAlignment(JLabel.TOP);
+		
+	gsObject.widgets.put(id, this);
+	}
+
+
+public void setText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	label.setText(text);
+	}
+	
+public void clearText(StringTokenizer tokens)
+	{
+	label.setText("");
+	}
+
+public void setIcon(StringTokenizer tokens)
+	{
+	String path = Base64Coder.decodeString(tokens.nextToken());
+	label.setIcon(guiserver.getIconFromPath(path, this.getClass()));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/ImageShape.java b/guiserver/java/ImageShape.java
new file mode 100644
index 0000000..11d42c3
--- /dev/null
+++ b/guiserver/java/ImageShape.java
@@ -0,0 +1,97 @@
+//
+//  ImageShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/24/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class ImageShape extends Shape {
+
+Image image;
+int width;
+int height;
+
+boolean hasDimensions = false;
+
+
+public ImageShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	String path = Base64Coder.decodeString(tokens.nextToken());
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	
+	if(tokens.hasMoreTokens())
+		{
+		width = Integer.parseInt(tokens.nextToken());
+		height = Integer.parseInt(tokens.nextToken());
+		hasDimensions = true;
+		}
+		
+	image = guiserver.getImageFromPath(path, this.getClass());
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	
+	/*
+	MediaTracker mt = new MediaTracker(imageObserver);
+	Image splashImage = Toolkit.getDefaultToolkit().getImage(
+	frame.getClass().getResource("/quids/unilever.jpg"));
+	mt.addImage(splashImage, 0);
+
+	try { mt.waitForID(0); }
+	catch(InterruptedException ie) {}
+
+	SplashWindow sw = new SplashWindow(frame, splashImage);
+	try { Thread.sleep(1500); }
+	catch(InterruptedException ie) {}
+	*/
+
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	//g2.setStroke(stroke);
+	//g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	//int realW = image.getWidth(imageObserver);
+	//int realH = image.getWidth(imageObserver);
+	if(hasDimensions)
+		g2.drawImage(image, X, Y, width, height, CanvasWidget.currentCanvas.component);
+	else
+		g2.drawImage(image, X, Y, CanvasWidget.currentCanvas.component);
+	}
+	
+	
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X, Y, width, height).contains(x, y));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/LabelWidget.java b/guiserver/java/LabelWidget.java
new file mode 100644
index 0000000..cdd0aec
--- /dev/null
+++ b/guiserver/java/LabelWidget.java
@@ -0,0 +1,108 @@
+//
+//  LabelWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/14/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import javax.swing.*;
+import java.util.*;
+
+public class LabelWidget extends gsObject {
+
+JLabel label;
+
+@SuppressWarnings("unchecked") 
+public LabelWidget(StringTokenizer params)
+	{
+	label = new JLabel();
+	jcomponent = label;
+	component = label;
+	container = label;
+	
+	id = params.nextToken();
+	String align = "center";
+	if(params.hasMoreTokens())
+		label.setText(Base64Coder.decodeString(params.nextToken()));
+	
+	if(params.hasMoreTokens())
+		align = params.nextToken();
+		
+	if(align.equals("left")) label.setHorizontalAlignment(JLabel.LEFT);
+	else if(align.equals("center")) label.setHorizontalAlignment(JLabel.CENTER);
+	else if(align.equals("right")) 	label.setHorizontalAlignment(JLabel.RIGHT);
+	else if(align.equals("leading")) label.setHorizontalAlignment(JLabel.LEADING);
+	else if(align.equals("trailing")) label.setHorizontalAlignment(JLabel.TRAILING);
+	else if(align.equals("bottom")) label.setVerticalAlignment(JLabel.BOTTOM);
+	else if(align.equals("top")) label.setVerticalAlignment(JLabel.TOP);
+		
+	if(params.hasMoreTokens())
+		{
+		int width = Integer.parseInt(params.nextToken());
+		int height = Integer.parseInt(params.nextToken());
+		jcomponent.setPreferredSize(new Dimension(width, height));
+		}
+		
+	gsObject.widgets.put(id, this);
+	
+	}
+
+
+public void setText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	label.setText(text);
+	}
+	
+public void getText(StringTokenizer params)
+	{
+	String action = params.nextToken();
+	String text = label.getText();
+	if(text.length() == 0)
+		guiserver.out.println("(" + action + " \"" + id + "\")");
+	else
+		guiserver.out.println("(" + action + " \"" + id + "\" [text]" + Base64Coder.encodeString(text) + "[/text])");
+	guiserver.out.flush();
+	}
+	
+public void appendText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	String oldtext = label.getText();
+	label.setText(oldtext + text);
+	}
+	
+public void clearText(StringTokenizer tokens)
+	{
+	label.setText("");
+	}
+
+public void setIcon(StringTokenizer tokens)
+	{
+	String path = Base64Coder.decodeString(tokens.nextToken());
+	label.setIcon(guiserver.getIconFromPath(path, this.getClass()));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/LayoutBorder.java b/guiserver/java/LayoutBorder.java
new file mode 100644
index 0000000..631df0e
--- /dev/null
+++ b/guiserver/java/LayoutBorder.java
@@ -0,0 +1,53 @@
+//
+//  LayoutBorder.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/15/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import javax.swing.*;
+import java.util.*;
+
+@SuppressWarnings("serial")
+public class LayoutBorder extends BorderLayout{
+
+public LayoutBorder(StringTokenizer params)
+	{
+	super();
+	
+	String id = params.nextToken();
+	
+	gsObject gsobject = (gsObject)gsObject.widgets.get(id);
+	Container target = gsobject.container;
+
+	if(params.hasMoreTokens())
+		{
+		setHgap(Integer.parseInt(params.nextToken()));
+		setVgap(Integer.parseInt(params.nextToken()));
+		}
+	
+	target.setLayout(this);
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/LayoutFlow.java b/guiserver/java/LayoutFlow.java
new file mode 100644
index 0000000..1aef651
--- /dev/null
+++ b/guiserver/java/LayoutFlow.java
@@ -0,0 +1,64 @@
+//
+//  LayoutFlow.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/14/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import javax.swing.*;
+import java.util.*;
+
+@SuppressWarnings("serial")
+public class LayoutFlow extends FlowLayout{
+
+public LayoutFlow(StringTokenizer params)
+	{
+	super();
+	
+	String id = params.nextToken();
+	
+	gsObject gsobject = (gsObject)gsObject.widgets.get(id);
+	
+	Container target = gsobject.container;
+	setAlignment(FlowLayout.LEFT);
+	
+	if(params.hasMoreTokens())
+		{
+		String alignment = params.nextToken();
+		if(alignment.equals("left")) setAlignment(FlowLayout.LEFT);
+		if(alignment.equals("center")) setAlignment(FlowLayout.CENTER);
+		if(alignment.equals("right")) setAlignment(FlowLayout.RIGHT);
+		}
+	else setAlignment(FlowLayout.LEFT);
+
+	if(params.hasMoreTokens())
+		{
+		setHgap(Integer.parseInt(params.nextToken()));
+		setVgap(Integer.parseInt(params.nextToken()));
+		}
+	
+	target.setLayout(this);
+	}
+	
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/LayoutGrid.java b/guiserver/java/LayoutGrid.java
new file mode 100644
index 0000000..e0590cf
--- /dev/null
+++ b/guiserver/java/LayoutGrid.java
@@ -0,0 +1,57 @@
+//
+//  LayoutGrid.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/12/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import javax.swing.*;
+import java.util.*;
+
+@SuppressWarnings("serial")
+public class LayoutGrid extends GridLayout{
+
+public LayoutGrid(StringTokenizer params)
+	{
+	super();
+	
+	String id = params.nextToken();
+	
+	gsObject gsobject = (gsObject)gsObject.widgets.get(id);
+	
+	Container target = gsobject.container;
+	
+	setRows(Integer.parseInt(params.nextToken()));
+	setColumns(Integer.parseInt(params.nextToken()));
+	
+	if(params.hasMoreTokens())
+		{
+		setHgap(Integer.parseInt(params.nextToken()));
+		setVgap(Integer.parseInt(params.nextToken()));
+		}
+	
+	target.setLayout(this);
+	}
+	
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/LineShape.java b/guiserver/java/LineShape.java
new file mode 100644
index 0000000..2a008b0
--- /dev/null
+++ b/guiserver/java/LineShape.java
@@ -0,0 +1,73 @@
+//
+//  LineShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/9/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class LineShape extends Shape {
+
+int dx;
+int dy;
+
+public LineShape(StringTokenizer tokens)
+	{
+	float R, G, B;
+	float alpha;
+	int X2, Y2;
+	
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	X2 = Integer.parseInt(tokens.nextToken());
+	Y2 = Integer.parseInt(tokens.nextToken());
+	
+	dx = X2 - X;
+	dy = Y2 - Y;
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.drawLine(X, Y, X + dx, Y + dy);
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/ListBoxWidget.java b/guiserver/java/ListBoxWidget.java
new file mode 100644
index 0000000..068fa92
--- /dev/null
+++ b/guiserver/java/ListBoxWidget.java
@@ -0,0 +1,186 @@
+//
+//  ListBoxWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/15/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import javax.swing.event.*;
+import java.util.*;
+
+
+@SuppressWarnings("unchecked") 
+public class ListBoxWidget extends gsObject {
+
+JList list = null;
+JScrollPane scrollpane;
+DefaultListModel listModel;
+
+public ListBoxWidget(StringTokenizer params)
+	{
+	scrollpane = new JScrollPane();
+	component = scrollpane;
+	container = scrollpane;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	listModel = new DefaultListModel();
+	while(params.hasMoreTokens())
+		listModel.addElement(Base64Coder.decodeString(params.nextToken()));
+		
+	list = new JList(listModel);
+	jcomponent = list;
+	scrollpane.getViewport().setView(list);
+	
+	list.setSelectionMode(ListSelectionModel.SINGLE_SELECTION);
+    list.setSelectedIndex(0);
+
+	gsObject.widgets.put(id, this);
+	
+	
+	KeyListener keyListener = new KeyAdapter() {
+		public void keyTyped(KeyEvent e)
+			{
+			int index = list.getSelectedIndex();
+			String item = Base64Coder.encodeString((String)list.getSelectedValue());
+			guiserver.out.println("(" + action + " \"" + id + "\" " + index + " \"" + item + "\")");
+			guiserver.out.flush();
+			}
+		};
+
+	MouseListener mouseListener = new MouseAdapter() {
+     public void mouseClicked(MouseEvent e) 
+		{
+		int clickCount = e.getClickCount();
+		int index = list.locationToIndex(e.getPoint());
+
+		if(action != null)
+			{
+			try {
+				String item = Base64Coder.encodeString((String)listModel.getElementAt(index));
+				guiserver.out.println("(" + action + " \"" + id + "\" " + index + " \"" + item + "\" " + clickCount + ")");
+				guiserver.out.flush();
+				} catch (Exception exc) { }
+			}
+
+		if(mouseEvent != null) 
+			{
+			mouseEventOut(e, "clicked");
+			}
+		}
+		
+	public void mousePressed(MouseEvent e) 
+		{ 
+		if(mouseEvent != null) mouseEventOut(e, "pressed"); 
+		}
+		
+	public void mouseReleased(MouseEvent e) 
+		{ 
+		if(mouseEvent != null) mouseEventOut(e, "released"); 
+		}
+	
+	};
+	
+	list.addMouseListener(mouseListener);	
+	list.addKeyListener(keyListener);
+	}
+	
+public void addListItem(StringTokenizer tokens)
+	{
+	while(tokens.hasMoreTokens()) 
+		{
+		String item = Base64Coder.decodeString(tokens.nextToken());
+		listModel.addElement(item);
+		}
+	}
+	
+public void removeListItem(StringTokenizer tokens)
+	{
+	int index = 0; 
+	
+	while(tokens.hasMoreTokens()) 
+		{
+		index = Integer.parseInt(tokens.nextToken());
+		if(index > (listModel.size() - 1)) index = listModel.size() - 1;
+		if(index < 0) index = 0;
+		listModel.remove(index);
+		}
+	}
+	
+public void clearList(StringTokenizer tokens)
+	{
+	while(listModel.size() > 0)
+		listModel.remove(0);
+	}
+	
+public void insertListItem(StringTokenizer tokens)
+	{
+	int index = 0; 
+	String text;
+	
+	while(tokens.hasMoreTokens())
+		{
+		text = Base64Coder.decodeString(tokens.nextToken());
+		index = Integer.parseInt(tokens.nextToken());
+		if(index > (listModel.size() - 1)) index = listModel.size() - 1;
+		if(index < 0) index = 0;
+		listModel.insertElementAt(text, index);
+		}
+	}
+	
+	
+public void selectListItem(StringTokenizer tokens)
+	{
+	String item = Base64Coder.decodeString(tokens.nextToken());
+	Boolean flag = false;
+	
+	if(tokens.hasMoreTokens())
+		flag = tokens.nextToken().equals("true");
+
+	list.setSelectedValue(item, flag);
+	}
+	
+					
+public void scrollDown()
+    {
+	JScrollBar vbar = scrollpane.getVerticalScrollBar();
+    vbar.setValue(vbar.getMinimum());
+    }
+	
+public void registerMouseEvent(StringTokenizer tokens)
+	{
+	mouseEvent = tokens.nextToken();
+	}
+	
+private void mouseEventOut(MouseEvent e, String type)
+	{
+	guiserver.out.println("(" + mouseEvent + " \"" + id + "\" \"" + type + "\" " + e.getX() + " " + e.getY() + " " + 
+		e.getButton() + " " + e.getClickCount() + " " + e.getModifiers() + ")");
+	guiserver.out.flush();
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/ListenerThread.java b/guiserver/java/ListenerThread.java
new file mode 100644
index 0000000..80d0056
--- /dev/null
+++ b/guiserver/java/ListenerThread.java
@@ -0,0 +1,52 @@
+//
+//  ListenerThread.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/24/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+
+public class ListenerThread implements Runnable {
+
+public ListenerThread() 
+	{
+	}
+	
+public void run() {
+	String cmd = null;
+	while(true)
+		{
+		try { cmd = guiserver.in.readLine(); } catch (Exception ex) {}
+		//cmd =  guiserver.in.readLine();
+		if(cmd == null) System.exit(0);   
+		//if(guiserver.debug) Dispatcher.dispatch(cmd);
+		//else
+			{
+			try { Dispatcher.dispatch(cmd);	}
+			catch (Exception e)	{ ErrorDialog.show(cmd, "Missing argument or item not found"); }
+			}
+		}
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/MenuBarWidget.java b/guiserver/java/MenuBarWidget.java
new file mode 100644
index 0000000..481e84b
--- /dev/null
+++ b/guiserver/java/MenuBarWidget.java
@@ -0,0 +1,63 @@
+//
+//  MenuBarWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/21/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import javax.swing.event.*;
+import java.util.*;
+
+public class MenuBarWidget extends gsObject {
+
+JMenuBar menubar;
+JFrame jframe;
+
+public MenuBarWidget(StringTokenizer params)
+	{
+	String target = params.nextToken();
+	menubar = new JMenuBar();
+	
+	jframe = ((WindowFrame)gsObject.widgets.get(target)).jframe;
+	jframe.setJMenuBar(menubar);
+	
+	while(params.hasMoreTokens())
+		{
+		String menu = params.nextToken();
+		JMenu jmenu = ((MenuWidget)gsObject.widgets.get(menu)).jmenu;
+		menubar.add(jmenu);
+		}
+	
+	}
+	
+public void addTo(StringTokenizer tokens)
+	{}
+
+public void setSize(StringTokenizer tokens)
+	{}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/MenuItemCheckWidget.java b/guiserver/java/MenuItemCheckWidget.java
new file mode 100644
index 0000000..e63fc5f
--- /dev/null
+++ b/guiserver/java/MenuItemCheckWidget.java
@@ -0,0 +1,134 @@
+//
+//  MenuItemCheckWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/24/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import javax.swing.*;
+import java.awt.event.*;
+import java.util.*;
+
+public class MenuItemCheckWidget extends gsObject{
+
+JCheckBoxMenuItem cbmenuitem;
+
+@SuppressWarnings("unchecked") 
+public MenuItemCheckWidget(StringTokenizer params)
+	{
+	cbmenuitem = new JCheckBoxMenuItem();
+	jcomponent = cbmenuitem;
+	component = cbmenuitem;
+	container = cbmenuitem;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	if(params.hasMoreTokens())
+		{
+		String base64string = params.nextToken();
+		cbmenuitem.setText(Base64Coder.decodeString(base64string));
+		}
+	
+	if(params.hasMoreTokens())
+		{
+		if(params.nextToken().equals("true"))
+			cbmenuitem.setSelected(true);
+		}
+	
+	gsObject.widgets.put(id, this);
+
+	
+	ActionListener listener = new ActionListener() {
+		public void actionPerformed(ActionEvent e)
+			{	
+			if(action != null)
+				{
+				if(cbmenuitem.isSelected())
+					guiserver.out.println("("+ action + " \"" + id + "\" true)");
+				else
+					guiserver.out.println("("+ action + " \"" + id + "\" nil)");
+					
+				guiserver.out.flush();
+				}
+			}
+		};
+
+	cbmenuitem.addActionListener(listener);
+	}
+
+public void setText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	cbmenuitem.setText(text);
+	}
+
+public void clearText(StringTokenizer tokens)
+	{
+	cbmenuitem.setText("");
+	}
+
+public void setSelected(StringTokenizer tokens)
+	{
+	if(tokens.nextToken().equals("true"))
+		cbmenuitem.setSelected(true);
+	else
+		cbmenuitem.setSelected(false);
+	}
+	
+public void setIcon(StringTokenizer tokens)
+	{
+	String path = tokens.nextToken();
+	cbmenuitem.setIcon(guiserver.getIconFromPath(path, this.getClass()));
+	}
+
+public void setAccelerator(StringTokenizer tokens)
+	{
+	String keystroke = Base64Coder.decodeString(tokens.nextToken());
+	
+	//System.out.println("setting accelerator: " + keystroke);
+	
+	cbmenuitem.setAccelerator(KeyStroke.getKeyStroke(keystroke));
+	
+	// Syntax:
+	// <modifiers>* (<typedID> | <pressedReleasedID>)
+	// modifiers := shift | control | ctrl | meta | alt | button1 | button2 | button3
+	// typedID := typed <typedKey>
+    // typedKey := string of length 1 giving Unicode character.
+    // pressedReleasedID := (pressed | released) key
+    // key := KeyEvent key code name, i.e. the name following "VK_".
+	//
+	// Examples:
+	// "INSERT"
+    // "control DELETE"
+    // "alt shift X"
+    // "alt shift released X"
+    // "typed a"
+	//
+	// note that alt on MacOS X is the option key
+	// for letters use uppercase, keys care added in menu item display automatically
+	}
+
+	
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/MenuItemWidget.java b/guiserver/java/MenuItemWidget.java
new file mode 100644
index 0000000..67ceec3
--- /dev/null
+++ b/guiserver/java/MenuItemWidget.java
@@ -0,0 +1,94 @@
+//
+//  MenuItemWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/21/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+
+public class MenuItemWidget extends aButton {
+
+JMenuItem menuitem;
+
+@SuppressWarnings("unchecked") 
+public MenuItemWidget(StringTokenizer params)
+	{
+	menuitem = new JMenuItem();
+	jcomponent = menuitem;
+	component = menuitem;
+	container = menuitem;
+	abutton = menuitem;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	menuitem.setText(Base64Coder.decodeString(params.nextToken()));
+			
+	gsObject.widgets.put(id, this);
+	
+	ActionListener listener = new ActionListener() {
+		public void actionPerformed(ActionEvent e)
+			{	
+			if(action != null)
+				{
+				guiserver.out.println("("+ action + " \"" + id + "\")");		
+				guiserver.out.flush();
+				}
+			}
+		};
+
+	menuitem.addActionListener(listener);
+	}
+	
+public void setAccelerator(StringTokenizer tokens)
+	{
+	String keystroke = Base64Coder.decodeString(tokens.nextToken());
+	
+	//System.out.println("setting accelerator: " + keystroke);
+	
+	menuitem.setAccelerator(KeyStroke.getKeyStroke(keystroke));
+	
+	// Syntax:
+	// <modifiers>* (<typedID> | <pressedReleasedID>)
+	// modifiers := shift | control | ctrl | meta | alt | button1 | button2 | button3
+	// typedID := typed <typedKey>
+    // typedKey := string of length 1 giving Unicode character.
+    // pressedReleasedID := (pressed | released) key
+    // key := KeyEvent key code name, i.e. the name following "VK_".
+	//
+	// Examples:
+	// "INSERT"
+    // "control DELETE"
+    // "alt shift X"
+    // "alt shift released X"
+    // "typed a"
+	//
+	// note that alt on MacOS X is the option key
+	// for letters use uppercase, keys care added in menu item display automatically
+	}
+	
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/MenuWidget.java b/guiserver/java/MenuWidget.java
new file mode 100644
index 0000000..c7287d2
--- /dev/null
+++ b/guiserver/java/MenuWidget.java
@@ -0,0 +1,54 @@
+//
+//  MenuWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/21/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import javax.swing.event.*;
+import java.util.*;
+
+public class MenuWidget extends gsObject {
+
+JMenu jmenu;
+
+@SuppressWarnings("unchecked") 
+public MenuWidget(StringTokenizer params)
+	{
+	id = params.nextToken();
+	jmenu = new JMenu(Base64Coder.decodeString(params.nextToken()));
+	container = jmenu;
+	jcomponent = jmenu;
+	component = jmenu;
+	
+	gsObject.widgets.put(id, this);
+	}
+
+public void addSeparator(StringTokenizer tokens)
+	{
+	jmenu.addSeparator();
+	}
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/MyDocumentFilter.java b/guiserver/java/MyDocumentFilter.java
new file mode 100644
index 0000000..2ef477b
--- /dev/null
+++ b/guiserver/java/MyDocumentFilter.java
@@ -0,0 +1,57 @@
+//
+//  MyDocumentFilter.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 7/7/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import javax.swing.*;
+import javax.swing.text.*;
+import java.awt.Toolkit;
+
+public class MyDocumentFilter extends DocumentFilter
+	{
+	int maxCharacters;
+		
+	public MyDocumentFilter(int max)
+		{
+		maxCharacters = max;
+		}
+	
+	public void insertString(FilterBypass fb, int offs, String str, AttributeSet a) throws BadLocationException 
+		{
+		if ((fb.getDocument().getLength() + str.length()) <= maxCharacters)
+			super.insertString(fb, offs, str, a);
+        else
+			Toolkit.getDefaultToolkit().beep();
+		}
+	
+    public void replace(FilterBypass fb, int offs, int length, String str, AttributeSet a) throws BadLocationException 
+		{
+        if ((fb.getDocument().getLength() + str.length()
+             - length) <= maxCharacters)
+            super.replace(fb, offs, length, str, a);
+        else
+            Toolkit.getDefaultToolkit().beep();
+		}
+	}
+ 
+ 
+// eof //
diff --git a/guiserver/java/MyFileFilter.java b/guiserver/java/MyFileFilter.java
new file mode 100644
index 0000000..f449555
--- /dev/null
+++ b/guiserver/java/MyFileFilter.java
@@ -0,0 +1,63 @@
+//
+//  MyFileFilter.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/21/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.io.File;
+import java.util.*;
+import javax.swing.*;
+import javax.swing.filechooser.*;
+
+
+public class MyFileFilter extends javax.swing.filechooser.FileFilter {
+
+String extensions;
+String description = null;
+
+public boolean accept(File file)
+	{
+	String fileName = file.getName();
+	String ext;
+	
+	StringTokenizer tokens = new StringTokenizer(extensions);
+	
+	while(tokens.hasMoreTokens())
+		{
+		ext = tokens.nextToken();
+		if(fileName.endsWith(ext)) 
+			return(true);
+		
+		if(file.isDirectory()) return(true);
+		}
+	
+	return(false);
+	}
+	
+public String getDescription() {
+        return description;
+    }
+	
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/OSXAdapter.java b/guiserver/java/OSXAdapter.java
new file mode 100644
index 0000000..115aa8d
--- /dev/null
+++ b/guiserver/java/OSXAdapter.java
@@ -0,0 +1,84 @@
+// OSXAdapter.java
+// guiserver
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+// adapted from OSXAdapter.java in package apple.dts.samplecode.osxadapter;
+
+import com.apple.eawt.*;
+
+public class OSXAdapter extends ApplicationAdapter {
+
+	private static OSXAdapter						theAdapter;
+	private static com.apple.eawt.Application		theApplication;
+
+	private guiserver									mainApp;
+	
+	private OSXAdapter (guiserver inApp) {
+		mainApp = inApp;
+	}
+	
+	public void handleAbout(ApplicationEvent ae) {
+		if (mainApp != null) {
+			ae.setHandled(true);
+			mainApp.about();
+		} else {
+			throw new IllegalStateException("handleAbout: MyApp instance detached from listener");
+		}
+	}
+	
+	public void handlePreferences(ApplicationEvent ae) {
+		if (mainApp != null) {
+			mainApp.preferences();
+			ae.setHandled(true);
+		} else {
+			throw new IllegalStateException("handlePreferences: MyApp instance detached from listener");
+		}
+	}
+	
+	public void handleQuit(ApplicationEvent ae) {
+		if (mainApp != null) {
+			ae.setHandled(false);
+			mainApp.quit();
+		} else {
+			throw new IllegalStateException("handleQuit: MyApp instance detached from listener");
+		}
+	}
+	
+	
+	public static void registerMacOSXApplication(guiserver inApp) {
+		if (theApplication == null) {
+			theApplication = new com.apple.eawt.Application();
+		}			
+		
+		if (theAdapter == null) {
+			theAdapter = new OSXAdapter(inApp);
+		}
+		theApplication.addApplicationListener(theAdapter);
+	}
+	
+	public static void enablePrefs(boolean enabled) {
+		if (theApplication == null) {
+			theApplication = new com.apple.eawt.Application();
+		}
+		theApplication.setEnabledPreferencesMenu(false);
+	}
+}
+
+// eof //
diff --git a/guiserver/java/PanelWidget.java b/guiserver/java/PanelWidget.java
new file mode 100644
index 0000000..26360f0
--- /dev/null
+++ b/guiserver/java/PanelWidget.java
@@ -0,0 +1,59 @@
+//
+//  PanelWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/13/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+
+
+@SuppressWarnings("unchecked") 
+public class PanelWidget extends gsObject {
+
+JPanel jpanel;
+
+public PanelWidget(StringTokenizer params)
+	{
+	jpanel = new JPanel();
+	container = jpanel;
+	jcomponent = jpanel;
+	component = jpanel;
+	
+	id = params.nextToken();
+	
+	if(params.hasMoreTokens())
+		{
+		int width = Integer.parseInt(params.nextToken());
+		int height = Integer.parseInt(params.nextToken());
+		jpanel.setPreferredSize(new Dimension(width, height));
+		}
+		
+	gsObject.widgets.put(id, this);
+	}
+	
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/PathShape.java b/guiserver/java/PathShape.java
new file mode 100644
index 0000000..8b32401
--- /dev/null
+++ b/guiserver/java/PathShape.java
@@ -0,0 +1,87 @@
+//
+//  PathShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 7/3/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class PathShape extends Shape {
+
+int pointXd[];
+int pointYd[];
+
+int N;
+
+public PathShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	N = Integer.parseInt(tokens.nextToken());
+	
+	pointXd = new int [N];
+	pointYd = new int [N];
+	
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	
+	pointXd[0] = pointYd[0] = 0;
+	
+	for(int i = 1; i < N; i++)
+		{
+		pointXd[i] = Integer.parseInt(tokens.nextToken()) - X;
+		pointYd[i] = Integer.parseInt(tokens.nextToken()) - Y;
+		}
+		
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+		
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+		
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	
+	int pX[] = new int [N];
+	int pY[] = new int [N];
+	
+	GeneralPath path = new GeneralPath();
+	
+	path.moveTo(X, Y);
+	
+	for(int i = 1; i < N; i++)
+		path.lineTo(pointXd[i] + X, pointYd[i] + Y);
+	
+	g2.draw(path);
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/PolygonShape.java b/guiserver/java/PolygonShape.java
new file mode 100644
index 0000000..1bfb666
--- /dev/null
+++ b/guiserver/java/PolygonShape.java
@@ -0,0 +1,105 @@
+//
+//  PolygonShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 7/2/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.awt.Polygon;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class PolygonShape extends Shape {
+
+int pointXd[];
+int pointYd[];
+
+int N;
+
+public PolygonShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	N = Integer.parseInt(tokens.nextToken());
+	
+	pointXd = new int [N];
+	pointYd = new int [N];
+	
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	
+	pointXd[0] = pointYd[0] = 0;
+	
+	for(int i = 1; i < N; i++)
+		{
+		pointXd[i] = Integer.parseInt(tokens.nextToken()) - X;
+		pointYd[i] = Integer.parseInt(tokens.nextToken()) - Y;
+		}
+		
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+		
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+		
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+
+/*
+	int pX[] = new int [N];
+	int pY[] = new int [N];
+	
+	for(int i = 0; i < N; i++)
+		{
+		pX[i] = pointXd[i] + X;
+		pY[i] = pointYd[i] + Y;
+		}
+	g2.drawPolygon(pX, pY, N);
+*/
+	Polygon polygon = new Polygon();
+	
+	for(int i = 0; i < N; i++)
+		polygon.addPoint(pointXd[i] + X, pointYd[i] + Y);
+
+	g2.draw(polygon);
+	}
+	
+public boolean hasPoint(int x, int y)
+	{	
+	Polygon polygon = new Polygon();
+	
+	for(int i = 0; i < N; i++)
+		polygon.addPoint(pointXd[i] + X, pointYd[i] + Y);
+	
+	return(polygon.contains(x, y));
+	}
+
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/PopupMenuWidget.java b/guiserver/java/PopupMenuWidget.java
new file mode 100644
index 0000000..0dc2053
--- /dev/null
+++ b/guiserver/java/PopupMenuWidget.java
@@ -0,0 +1,71 @@
+//
+//  PopupMenuWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 7/4/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import javax.swing.event.*;
+import java.util.*;
+
+public class PopupMenuWidget extends gsObject {
+
+JPopupMenu jpopup;
+
+@SuppressWarnings("unchecked") 
+public PopupMenuWidget(StringTokenizer params)
+	{
+	id = params.nextToken();
+	jpopup = new JPopupMenu(Base64Coder.decodeString(params.nextToken()));
+	//jpopup.setLightWeightPopupEnabled(false); only if canvas extends Canvas
+	container = jpopup;
+	jcomponent = jpopup;
+	component = jpopup;
+	
+	gsObject.widgets.put(id, this);
+	}
+
+public void addSeparator(StringTokenizer tokens)
+	{
+	jpopup.addSeparator();
+	}
+	
+public void showPopup(StringTokenizer tokens)
+	{ 
+	gsObject gsobject = (gsObject)gsObject.widgets.get(tokens.nextToken());
+	
+	int x = Integer.parseInt(tokens.nextToken());
+	int y = Integer.parseInt(tokens.nextToken());
+	
+	if(gsobject.jcomponent == null)
+		jpopup.show(gsobject.component, x, y);
+	else
+		jpopup.show(gsobject.jcomponent, x, y);
+		
+	jpopup.repaint();
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/ProgressBarWidget.java b/guiserver/java/ProgressBarWidget.java
new file mode 100644
index 0000000..7b2e0e7
--- /dev/null
+++ b/guiserver/java/ProgressBarWidget.java
@@ -0,0 +1,58 @@
+//
+//  ProgressBarWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/17/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import javax.swing.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked") 
+public class ProgressBarWidget extends gsObject {
+
+JProgressBar progressbar;
+
+public ProgressBarWidget(StringTokenizer params)
+	{
+	progressbar = new JProgressBar();
+	jcomponent = progressbar;
+	component = progressbar;
+	container = progressbar;
+	
+	id = params.nextToken();
+	
+	progressbar.setMinimum(Integer.parseInt(params.nextToken()));
+	progressbar.setMaximum(Integer.parseInt(params.nextToken()));
+	progressbar.setValue(Integer.parseInt(params.nextToken()));
+	
+	gsObject.widgets.put(id, this);
+	}
+
+public void setValue(StringTokenizer tokens)
+	{
+	progressbar.setValue(Integer.parseInt(tokens.nextToken()));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/RadioButtonWidget.java b/guiserver/java/RadioButtonWidget.java
new file mode 100644
index 0000000..5137991
--- /dev/null
+++ b/guiserver/java/RadioButtonWidget.java
@@ -0,0 +1,76 @@
+//
+//  RadioButtonWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/17/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import java.util.*;
+import javax.swing.*;
+
+@SuppressWarnings("unchecked") 
+public class RadioButtonWidget extends aButton {
+
+
+public RadioButtonWidget(StringTokenizer params)
+	{
+	abutton = new JRadioButton();
+	jcomponent = abutton;
+	component = abutton;
+	container = abutton;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	if(params.hasMoreTokens())
+		{
+		String base64string = params.nextToken();
+		abutton.setText(Base64Coder.decodeString(base64string));
+		}
+	
+	if(params.hasMoreTokens())
+		abutton.setSelected(params.nextToken().equals("true"));
+
+	
+	gsObject.widgets.put(id, this);
+	
+	ActionListener listener = new ActionListener() {
+		public void actionPerformed(ActionEvent e)
+			{	
+			if(action != null)
+				{
+				if(abutton.isSelected())
+					guiserver.out.println("("+ action + " \"" + id + "\" true)");
+				else
+					guiserver.out.println("("+ action + " \"" + id + "\" nil)");
+					
+				guiserver.out.flush();
+				}
+			}
+		};
+
+	abutton.addActionListener(listener);
+	}
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/RectangleShape.java b/guiserver/java/RectangleShape.java
new file mode 100644
index 0000000..a09f826
--- /dev/null
+++ b/guiserver/java/RectangleShape.java
@@ -0,0 +1,75 @@
+//
+//  RectangleShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/9/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class RectangleShape extends Shape {
+
+int width;
+int height;
+
+public RectangleShape(StringTokenizer tokens)
+	{
+	float R, G, B;
+	float alpha;
+	
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	width = Integer.parseInt(tokens.nextToken());
+	height = Integer.parseInt(tokens.nextToken());
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.drawRect(X, Y, width - 1, height - 1);
+	}
+	
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X, Y, width, height).contains(x, y));
+	}
+
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/RoundRectShape.java b/guiserver/java/RoundRectShape.java
new file mode 100644
index 0000000..91e04c3
--- /dev/null
+++ b/guiserver/java/RoundRectShape.java
@@ -0,0 +1,79 @@
+//
+//  RoundRectShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/9/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class RoundRectShape extends Shape {
+
+int width;
+int height;
+int arcWidth;
+int arcHeight;
+
+public RoundRectShape(StringTokenizer tokens)
+	{
+	float R, G, B;
+	float alpha;
+	
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	width = Integer.parseInt(tokens.nextToken());
+	height = Integer.parseInt(tokens.nextToken());
+	arcWidth = Integer.parseInt(tokens.nextToken());
+	arcHeight = Integer.parseInt(tokens.nextToken());
+
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.drawRoundRect(X, Y, width - 1, height - 1, arcWidth, arcHeight);
+	}
+
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X, Y, width, height).contains(x, y));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/RoundRectangleShape.java b/guiserver/java/RoundRectangleShape.java
new file mode 100644
index 0000000..fafdde7
--- /dev/null
+++ b/guiserver/java/RoundRectangleShape.java
@@ -0,0 +1,78 @@
+//
+//  RoundRectangleShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 7/2/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class RoundRectangleShape extends Shape {
+
+int width;
+int height;
+
+int arcWidth;
+int arcHeight;
+
+public RoundRectangleShape(StringTokenizer tokens)
+	{
+	float R, G, B;
+	
+	tag = tokens.nextToken();
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	width = Integer.parseInt(tokens.nextToken());
+	height = Integer.parseInt(tokens.nextToken());
+	arcWidth = Integer.parseInt(tokens.nextToken());
+	arcHeight = Integer.parseInt(tokens.nextToken());
+
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+	
+	stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//g2.setComposite(currentComposite);
+	g2.drawRoundRect(X, Y, width - 1, height - 1, arcWidth, arcHeight);
+	}
+
+public boolean hasPoint(int x, int y)
+	{
+	return(new Rectangle(X, Y, width, height).contains(x, y));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/ScrollPaneWidget.java b/guiserver/java/ScrollPaneWidget.java
new file mode 100644
index 0000000..5f5767f
--- /dev/null
+++ b/guiserver/java/ScrollPaneWidget.java
@@ -0,0 +1,62 @@
+//
+//  ScrollPaneWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/23/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import javax.swing.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class ScrollPaneWidget extends gsObject {
+
+JScrollPane jscrollpane;
+
+public ScrollPaneWidget(StringTokenizer params)
+	{	
+	id = params.nextToken();
+	JComponent client  = ((gsObject)gsObject.widgets.get(params.nextToken())).jcomponent;
+	
+	jscrollpane = new JScrollPane(client);
+	jcomponent = jscrollpane;
+	component = jscrollpane;
+	container = jscrollpane;
+	
+	// AS_NEEDED is default	
+	//jscrollpane.setVerticalScrollBarPolicy(JScrollPane.VERTICAL_SCROLLBAR_AS_NEEDED);
+	//jscrollpane.setHorizontalScrollBarPolicy(JScrollPane.HORIZONTAL_SCROLLBAR_AS_NEEDED);
+		
+	if(params.hasMoreTokens())
+		{
+		int width = Integer.parseInt(params.nextToken());
+		int height = Integer.parseInt(params.nextToken());
+		jscrollpane.setPreferredSize(new Dimension(width, height));
+		}
+
+	gsObject.widgets.put(id, this);
+	}
+
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/Shape.java b/guiserver/java/Shape.java
new file mode 100644
index 0000000..1be2ee9
--- /dev/null
+++ b/guiserver/java/Shape.java
@@ -0,0 +1,65 @@
+//
+//  Shape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/9/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+public class Shape {
+
+String tag;
+Stroke stroke;
+Color paintColor;
+AlphaComposite composite;
+AffineTransform transform = AffineTransform.getScaleInstance(1.0, 1.0);
+//AffineTransform transform = null;
+boolean visible = true;
+int X;
+int Y;
+
+public void drawShape(Graphics2D g2) 
+	{ }
+	
+	
+public boolean hasPoint(int X, int Y)
+	{
+	return false;
+	}
+
+static Color getColorParameter(StringTokenizer tokens)
+	{
+	float R, G, B;
+	
+	R = Float.parseFloat(tokens.nextToken());
+	G = Float.parseFloat(tokens.nextToken());
+	B = Float.parseFloat(tokens.nextToken());
+	
+	return new Color(R, G, B);
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/SliderWidget.java b/guiserver/java/SliderWidget.java
new file mode 100644
index 0000000..d70baca
--- /dev/null
+++ b/guiserver/java/SliderWidget.java
@@ -0,0 +1,76 @@
+//
+//  SliderWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/17/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import javax.swing.*;
+import javax.swing.event.*;
+import java.util.*;
+
+
+@SuppressWarnings("unchecked") 
+public class SliderWidget extends gsObject {
+
+final JSlider slider;
+
+public SliderWidget(StringTokenizer params)
+	{
+	slider = new JSlider();
+	jcomponent = slider;
+	component = slider;
+	container = slider;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	
+	if(params.nextToken().equals("vertical"))
+		slider.setOrientation(JSlider.VERTICAL);
+	else 
+		slider.setOrientation(JSlider.HORIZONTAL);
+	
+	slider.setMinimum(Integer.parseInt(params.nextToken()));
+	slider.setMaximum(Integer.parseInt(params.nextToken()));
+	slider.setValue(Integer.parseInt(params.nextToken()));
+	
+	class SliderListener implements ChangeListener {
+		public void stateChanged(ChangeEvent e) {
+			guiserver.out.println("(" + action + " \"" + id + "\" " + slider.getValue() + ")");
+			guiserver.out.flush();
+			}
+		}
+		
+	slider.addChangeListener(new SliderListener());
+	gsObject.widgets.put(id, this);
+	}
+	
+public void setValue(StringTokenizer tokens)
+	{
+	slider.setValue(Integer.parseInt(tokens.nextToken()));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/SoundSystem.java b/guiserver/java/SoundSystem.java
new file mode 100644
index 0000000..f3ac216
--- /dev/null
+++ b/guiserver/java/SoundSystem.java
@@ -0,0 +1,91 @@
+//
+//  Dispatcher.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 8/13/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+import java.io.File;
+import java.io.IOException;
+
+import javax.sound.sampled.AudioFormat;
+import javax.sound.sampled.AudioInputStream;
+import javax.sound.sampled.AudioSystem;
+import javax.sound.sampled.DataLine;
+import javax.sound.sampled.LineUnavailableException;
+import javax.sound.sampled.SourceDataLine;
+
+public class SoundSystem
+{
+private static final int	EXTERNAL_BUFFER_SIZE = 64000;
+
+public static void playSound(String filePath)
+	{
+	File soundFile = new File(filePath);
+	AudioInputStream audioInputStream = null;
+
+	try	{ audioInputStream = AudioSystem.getAudioInputStream(soundFile);	}
+	catch (Exception e)	{
+		ErrorDialog.show("play-sound","Unsupported audio file");
+		return;
+		}
+
+	AudioFormat	audioFormat = audioInputStream.getFormat();
+
+	SourceDataLine line = null;
+
+	DataLine.Info info = new DataLine.Info(SourceDataLine.class, audioFormat);
+	try	{	
+		line = (SourceDataLine) AudioSystem.getLine(info);
+		line.open(audioFormat);
+		}
+	catch (LineUnavailableException e) {
+		System.out.println("Sound data line not available");
+		return;
+		}
+	catch (Exception e)	{
+		ErrorDialog.show("play-sound","Could nor open sound data line");	
+		return;
+		}
+
+	line.start();
+
+	int	nBytesRead = 0;
+	byte[]	abData = new byte[EXTERNAL_BUFFER_SIZE];
+
+	while (nBytesRead != -1)
+		{
+		try	{ nBytesRead = audioInputStream.read(abData, 0, abData.length);	}
+		catch (IOException e) {
+			ErrorDialog.show("play-sound","Could not read audio file");
+			}
+		if (nBytesRead >= 0)
+			{
+			int	nBytesWritten = line.write(abData, 0, nBytesRead);
+			}
+		}
+
+	line.drain();
+	line.close();
+	line = null;
+	}
+
+}
+
+// eof
\ No newline at end of file
diff --git a/guiserver/java/SplashWindow.java b/guiserver/java/SplashWindow.java
new file mode 100644
index 0000000..ca70047
--- /dev/null
+++ b/guiserver/java/SplashWindow.java
@@ -0,0 +1,75 @@
+//
+//  SplashWindow.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/16/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked") 
+class SplashWindow extends Window
+{
+int width;
+int height;
+Image splashImage;
+Window splash;
+
+public SplashWindow(Window parent, Image splashImage)
+  {
+  super(parent);
+  splash = this;
+  this.splashImage =  splashImage;
+  width = splashImage.getWidth(this) + 2;
+  height = splashImage.getHeight(this) + 2;
+  setSize(width, height);
+  Dimension screen = Toolkit.getDefaultToolkit().getScreenSize();
+  setLocation((screen.width - width)/2, (screen.height - height)/2);
+  if(guiserver.MAC_OS_X)
+	this.setBackground(new Color(0, 0, 0, 0));
+  setVisible(true);
+  addMouseListener(new MouseAdapter () {
+    public void mousePressed(MouseEvent e) { splash.dispose(); }
+    });
+  }
+
+public void paint(Graphics g)
+  {
+  if(guiserver.MAC_OS_X)
+	{
+	g.setColor(new Color(0, 0, 0, 0));
+	g.fillRect(0, 0, width, height);
+	System.out.println("mac os x");
+	}
+  else
+	{
+	g.setColor(Color.lightGray);
+	g.fill3DRect(0, 0, width, height, true);
+	}
+  if(splashImage != null)
+    g.drawImage(splashImage,1,1,this);
+  }
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/SplitPaneWidget.java b/guiserver/java/SplitPaneWidget.java
new file mode 100644
index 0000000..df04107
--- /dev/null
+++ b/guiserver/java/SplitPaneWidget.java
@@ -0,0 +1,81 @@
+//
+//  SplitPaneWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/22/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked") 
+public class SplitPaneWidget extends gsObject {
+
+JSplitPane jsplitpane;
+
+public SplitPaneWidget(StringTokenizer params)
+	{
+	id = params.nextToken();
+	
+	if(params.nextToken().equals("horizontal"))
+		{
+		jsplitpane = new JSplitPane(JSplitPane.VERTICAL_SPLIT, true);
+		jsplitpane.setResizeWeight(1.0);
+		}
+	else
+		{
+		jsplitpane = new JSplitPane(JSplitPane.HORIZONTAL_SPLIT, true);
+		jsplitpane.setResizeWeight(0.0);
+		}
+	
+	component = jsplitpane;
+	container = jsplitpane;
+	jcomponent = jsplitpane;
+	
+	if(params.hasMoreTokens())
+		jsplitpane.setResizeWeight(Float.parseFloat(params.nextToken()));
+		
+	if(params.hasMoreTokens())
+		jsplitpane.setDividerLocation(Float.parseFloat(params.nextToken()));
+		
+	if(params.hasMoreTokens())
+		jsplitpane.setDividerSize(Integer.parseInt(params.nextToken()));
+
+	
+	if(params.hasMoreTokens())
+		{
+		int width = Integer.parseInt(params.nextToken());
+		int height = Integer.parseInt(params.nextToken());
+		jsplitpane.setPreferredSize(new Dimension(width, height));
+		}
+		
+	gsObject.widgets.put(id, this);
+	}
+	
+		
+}
+
+
+
+ 
+ 
+// eof //
diff --git a/guiserver/java/SyntaxHighlighter.java b/guiserver/java/SyntaxHighlighter.java
new file mode 100644
index 0000000..3219f57
--- /dev/null
+++ b/guiserver/java/SyntaxHighlighter.java
@@ -0,0 +1,294 @@
+//
+//  SyntaxHighlighter.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 7/19/07.
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+import java.awt.*;
+import java.util.*;
+import java.util.regex.Pattern;
+import javax.swing.*;
+import javax.swing.text.*;
+
+@SuppressWarnings("unchecked")
+public class SyntaxHighlighter {
+
+static String reserved[] = {
+"!","!=","$","$0","$1","$10","$11","$12","$13","$14","$15","$2","$3","$4","$5","$6","$7","$8","$9",
+"$args","$idx","$main-args","%","&","*","+","-","/","<","<<","<=","=",">",">=",">>","?","@","MAIN",
+"NaN?","^","abs","acos","acosh","add","address","amb","and","append","append-file","apply","args",
+"array","array-list","array?","asin","asinh","assoc","assoc-set","atan","atan2","atanh","atom?","base64-dec",
+"base64-enc","bayes-query","bayes-train","begin","beta","betai","bind","binomial","callback","case",
+"catch","ceil","change-dir","char","chop","clean","close","command-line","cond","cons","constant",
+"context","context?","copy-file","cos","cosh","count","cpymem","crc32","crit-chi2","crit-z","current-line",
+"curry","date","date-value","debug","dec","def-new","default","define","define-macro","delete","delete-file",
+"delete-url","destroy","det","device","difference","directory","directory?","div","do-until","do-while","doargs",
+"dolist","dostring","dotimes","dotree","dump","dup","empty?","encrypt","ends-with","env","erf","error-event",
+"error-number","error-text","eval","eval-string","exec","exists","exit","exp","expand","explode","factor",
+"fft","file-info","file?","filter","find","find-all","first","flat","float","float?","floor","flt","for",
+"for-all","fork","format","fv","gammai","gammaln","gcd","get-char","get-float","get-int","get-long",
+"get-string","get-url","global","global?","if","ifft","import","inc","index","int","integer","integer?",
+"intersect","invert","irr","join","lambda?","last","legal?","length","let","letex","letn","list","list?",
+"load","local","log","lookup","lower-case","macro?","main-args","make-dir","map","mat","match","max",
+"member","min","mod","mul","multiply","name","net-accept","net-close","net-connect","net-error","net-eval",
+"net-listen","net-local","net-lookup","net-peek","net-peer","net-ping","net-receive","net-receive-from",
+"net-receive-udp","net-select","net-send","net-send-to","net-send-udp","net-service","net-sessions","new",
+"nil","nil?","normal","not","now","nper","npv","nth","nth-set","null?","number?","open","or","ostype",
+"pack","parse","parse-date","peek","pipe","pmt","pop","pop-assoc", "post-url","pow","pretty-print","primitive?","print",
+"println","prob-chi2","prob-z","process","protected?","push","put-url","pv","quote","quote?","rand",
+"random","randomize","read-buffer","read-char","read-file","read-key","read-line","real-path","ref","ref-set",
+"ref-all","regex","remove-dir","rename-file","replace","replace-assoc","reset","rest","reverse","rotate",
+"round","save","search","seed","seek","select","semaphore","sequence","series","set","set-assoc","set-locale","set-nth",
+"set-ref","set-ref-all","setq","sgn","share","signal","silent","sin","sinh","sleep","slice","sort","source","sqrt","starts-with",
+"string","string?","sub","swap","sym","symbol?","symbols","sys-error","sys-info","tan","tanh","throw",
+"throw-error","time","time-of-day","timer","title-case","trace","trace-highlight","transpose","trim",
+"true","true?","unicode","unify","unique","unless","unpack","until","upper-case","utf8","utf8len","uuid",
+"wait-pid","when","while","write-buffer","write-char","write-file","write-line","xml-error","xml-parse",
+"xml-type-tags","zero?","|","~" };
+
+static SimpleAttributeSet comment;
+static SimpleAttributeSet keyword;
+static SimpleAttributeSet string;
+static SimpleAttributeSet number;
+static SimpleAttributeSet paren;
+static SimpleAttributeSet quoted;
+static SimpleAttributeSet normal;
+
+static Color normalColor = Color.black;
+static Color commentColor = Color.gray;
+static Color keywordColor = new Color(0, 0, 192);
+static Color stringColor = new Color(0, 128, 0);
+static Color numberColor = new Color(192,128, 0);
+static Color parenColor = new Color(192, 0, 0);
+static Color quotedColor = new Color(96, 96, 192);
+
+static String numberPattern = "^-?\\d+$|^-?\\d+\\.\\d+$|^0x[0-9a-fA-F]+$";
+static Pattern compiledPattern;
+
+static StyledDocument doc;
+static String text;
+static String token;
+static Vector topLevels;
+
+static HashSet keys = null;
+static boolean active = false;
+
+@SuppressWarnings("unchecked") 
+static public void color(TextPaneWidget widget, int offset, int length)
+	{
+	int parenCount = 0;
+	int curlCount = 0;
+	int startToken;
+	int idx = offset;
+	char chr;
+
+	active = true;
+
+
+	doc = widget.styledDoc;
+	topLevels = widget.shTopLevels;
+	
+	normal = new SimpleAttributeSet();
+	StyleConstants.setForeground(normal, widget.foreground);
+	
+	try { text = doc.getText(0, widget.documentLength); } 
+	catch (Exception e) {text = null;} 	
+	
+	if(keys == null) init();
+	
+	while(idx < length)
+		{
+		chr = text.charAt(idx++);
+		while(chr <= ' ' && idx < length) chr = text.charAt(idx++);
+		switch(chr)
+			{
+			case ';':
+			case '#':
+				startToken = idx - 1;
+				while(chr != '\n' && idx < length) chr = text.charAt(idx++);
+				doc.setCharacterAttributes(startToken, idx - startToken, comment, false);
+				continue;
+			case '(':
+				++parenCount;
+				doc.setCharacterAttributes(idx - 1, 1, paren, false);
+				continue;
+			case ')':
+				--parenCount;
+				doc.setCharacterAttributes(idx - 1, 1, paren, false);
+				if(parenCount == 0) // top level
+					{
+					topLevels.addElement(offset);
+					offset = idx;
+					}
+				continue;
+			case '\'':
+ 				startToken = idx - 1;
+				while(chr > ' ' && chr != '(' && chr != ')' && idx < length) chr = text.charAt(idx++);
+				if(chr == ' ' || chr == '(' || chr == ')')
+					{
+					doc.setCharacterAttributes(startToken, idx - startToken - 1, quoted, false);
+					idx--;
+					continue;
+					}
+				else
+					doc.setCharacterAttributes(startToken, idx - startToken, quoted, false);
+					
+				continue;
+			case '"':
+				startToken = idx - 1;
+				//while(idx < length && text.charAt(idx++) != '"' );
+				//doc.setCharacterAttributes(startToken, idx - startToken, string, false);
+				//continue;
+				while(idx < length)
+					{
+					chr = text.charAt(idx++);
+					if(chr == '"') 
+						{
+						doc.setCharacterAttributes(startToken, idx - startToken, string, false);
+						break;
+						}
+					if(chr == '\\')
+						{
+						idx++;
+						continue;
+						}
+					}
+				continue;
+			case '{':
+				startToken = idx - 1;
+				curlCount = 1;
+				while(curlCount != 0 && idx < length)
+					{
+					chr = text.charAt(idx++);
+					if(chr == '}') curlCount--;
+					else if(chr == '{') curlCount++;
+					}
+				doc.setCharacterAttributes(startToken, idx - startToken, string, false);
+				continue;
+			case '[':
+				startToken = idx - 1;
+				if(text.startsWith("[text]", startToken))
+					{
+					idx = text.indexOf("[/text]", startToken + 6);
+					if(idx < 0) idx = length;
+					else idx = idx + 7;
+					doc.setCharacterAttributes(startToken, idx - startToken, string, false);
+					continue;
+					}
+				continue;
+			default:
+				startToken = idx - 1;
+				while(chr > ' ' && chr != '(' && chr != ')' && chr != '\'' && idx < length) chr = text.charAt(idx++);
+				token = text.substring(startToken, idx - 1);
+
+				if(keys.contains(token))
+					doc.setCharacterAttributes(startToken, idx - startToken, keyword, false);
+				else
+					{
+					//if(token.matches(numberPattern))
+					if(compiledPattern.matcher(token).matches())
+						doc.setCharacterAttributes(startToken, idx - startToken, number, false);
+					else
+						doc.setCharacterAttributes(startToken, idx - startToken, normal, false);
+					}
+
+				if(chr == '(')
+					{
+					++parenCount;
+					doc.setCharacterAttributes(idx - 1, 1, paren, false);
+					continue;
+					}
+				else if(chr == ')')
+					{
+					--parenCount;
+					doc.setCharacterAttributes(idx - 1, 1, paren, false);
+					if(parenCount == 0) // top level
+						{
+						topLevels.addElement(offset);
+						offset = idx;
+						}
+					continue;
+					}
+				else if(chr == '\'')
+					{
+					doc.setCharacterAttributes(idx - 1, 1, paren, false);
+					continue;
+					}
+			}
+		}
+		
+	active = false;
+	}
+	
+static void init()
+	{
+	if(keys == null)
+		{
+		keys = new HashSet();
+		for(int idx = 0; idx < reserved.length; idx++)
+			keys.add(reserved[idx]);
+		}
+		
+	compiledPattern = Pattern.compile(numberPattern);
+	
+	comment = new SimpleAttributeSet();
+	StyleConstants.setForeground(comment, commentColor);
+	
+	keyword = new SimpleAttributeSet();
+	StyleConstants.setForeground(keyword, keywordColor);
+	
+	string = new SimpleAttributeSet();
+	StyleConstants.setForeground(string, stringColor);
+	
+	number = new SimpleAttributeSet();
+	StyleConstants.setForeground(number, numberColor);
+	
+	quoted = new SimpleAttributeSet();
+	StyleConstants.setForeground(quoted, quotedColor);
+	
+	paren = new SimpleAttributeSet();
+	StyleConstants.setForeground(paren, parenColor);
+	}
+	
+public static void setSyntaxColors(StringTokenizer tokens)
+	{
+	commentColor = new Color(Float.parseFloat(tokens.nextToken()),
+		Float.parseFloat(tokens.nextToken()), Float.parseFloat(tokens.nextToken()));
+
+	keywordColor = new Color(Float.parseFloat(tokens.nextToken()),
+		Float.parseFloat(tokens.nextToken()), Float.parseFloat(tokens.nextToken()));
+		
+	stringColor = new Color(Float.parseFloat(tokens.nextToken()),
+		Float.parseFloat(tokens.nextToken()), Float.parseFloat(tokens.nextToken()));
+		
+	numberColor = new Color(Float.parseFloat(tokens.nextToken()),
+		Float.parseFloat(tokens.nextToken()), Float.parseFloat(tokens.nextToken()));
+		
+	quotedColor = new Color(Float.parseFloat(tokens.nextToken()),
+		Float.parseFloat(tokens.nextToken()), Float.parseFloat(tokens.nextToken()));
+		
+	parenColor = new Color(Float.parseFloat(tokens.nextToken()),
+		Float.parseFloat(tokens.nextToken()), Float.parseFloat(tokens.nextToken()));
+		
+	init();
+	SyntaxHighlighterC.init();
+	}
+}
+
+// eof
diff --git a/guiserver/java/SyntaxHighlighterC.java b/guiserver/java/SyntaxHighlighterC.java
new file mode 100644
index 0000000..b14646d
--- /dev/null
+++ b/guiserver/java/SyntaxHighlighterC.java
@@ -0,0 +1,314 @@
+//
+//  SyntaxHighlighterC.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 8/4/07.
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+import java.awt.*;
+import java.util.*;
+import java.util.regex.Pattern;
+import javax.swing.*;
+import javax.swing.text.*;
+
+@SuppressWarnings("unchecked")
+public class SyntaxHighlighterC {
+
+static String reservedC[] = {
+"auto", "break", "byte", "case", "char", "const", "continue", "default", "do", 
+"double", "else", "enum", "extern", "float", "for", "goto", "if", "inline", "int", 
+"long", "register", "return", "short", "signed", "sizeof", "static", "struct", "switch", 
+"typedef", "union", "unsigned", "void", "volatil", "while"
+};
+
+static String reservedCPP[] = {
+"bool",	"catch", "class", "delete", "friend", "inline", "new", "namespace", 
+"operator",	"private", "protected", "public", "this", "throw", "try", "template"
+}; 
+
+static String reservedJava[] = {
+"abstract", "assert", "boolean", "break", "byte", "case", "catch", "char", 
+"class", "const", "continue", "default", "do", "double", "else", "enum", 
+"extends", "final", "finally", "float", "for", "goto", "if", "implements", 
+"import", "instanceof", "int", "interface", "long", "native", "new", "package", 
+"private", "protected", "public", "return", "short", "static", "strictfp", 
+"super", "switch", "synchronized", "this", "throw", "throws", "transient", 
+"try", "void", "volatile", "while"
+};
+ 
+static String reservedPHP[] = {
+"abstract", "and", "array", "as", "break", "case", "catch", "cfunction", 
+"class", "clone", "const", "continue", "declare", "default", "die", "do", 
+"echo", "else", "elseif", "empty", "enddeclare", "endfor", "endforeach", 
+"endif", "endswitch", "endwhile", "eval", "exception", "exit", "extends", 
+"extends", "final", "for", "foreach", "function", "global", "if", "implements", 
+"include", "include_once", "interface", "isset", "list", "new", "old_function", 
+"or", "php_user_filter", "print", "private", "protected", "public", "require", 
+"require_once", "return", "static", "switch", "this", "throw", "try", "unset", 
+"use", "var", "while", "xor"
+};
+ 
+static SimpleAttributeSet comment;
+static SimpleAttributeSet keyword;
+static SimpleAttributeSet string;
+static SimpleAttributeSet number;
+static SimpleAttributeSet paren;
+static SimpleAttributeSet quoted;
+static SimpleAttributeSet normal;
+
+static String numberPattern = "^-?\\d+$|^-?\\d+\\.\\d+$|^0x[0-9a-fA-F]+$";
+static Pattern compiledPattern;
+
+static StyledDocument doc;
+static String text;
+static String token;
+static Vector topLevels;
+
+static HashSet keys = null;
+
+static HashSet keysC;
+static HashSet keysCPP;
+static HashSet keysJava;
+static HashSet keysPHP;
+
+@SuppressWarnings("unchecked") 
+static public void color(TextPaneWidget widget, int offset, int length)
+	{
+	int parenCount = 0;
+	int curlCount = 0;
+	int startToken;
+	int idx = offset;
+	char chr;
+
+	SyntaxHighlighter.active = true;
+
+
+	doc = widget.styledDoc;
+	topLevels = widget.shTopLevels;
+	
+	normal = new SimpleAttributeSet();
+	StyleConstants.setForeground(normal, widget.foreground);
+	
+	try { text = doc.getText(0, widget.documentLength); } 
+	catch (Exception e) {text = null;} 	
+	
+	//if(keys == null) init();
+	
+	while(idx < length)
+		{
+		chr = text.charAt(idx++);
+		while(chr <= ' ' && idx < length) chr = text.charAt(idx++);
+		switch(chr)
+			{
+			case '#':
+				startToken = idx - 1;
+				while(chr != '\n' && idx < length) chr = text.charAt(idx++);
+				doc.setCharacterAttributes(startToken, idx - startToken, quoted, false);
+				continue;
+			case '{':
+				++parenCount;
+				doc.setCharacterAttributes(idx - 1, 1, paren, false);
+				continue;
+			case '}':
+				--parenCount;
+				doc.setCharacterAttributes(idx - 1, 1, paren, false);
+				if(parenCount == 0) // top level
+					{
+					topLevels.addElement(offset);
+					offset = idx;
+					}
+				continue;
+			case '(':
+				doc.setCharacterAttributes(idx - 1, 1, paren, false);
+				continue;
+			case ')':
+				doc.setCharacterAttributes(idx - 1, 1, paren, false);
+				continue;
+			case '"':
+				startToken = idx - 1;
+				while(idx < length)
+					{
+					chr = text.charAt(idx++);
+					if(chr == '"') 
+						{
+						doc.setCharacterAttributes(startToken, idx - startToken, string, false);
+						break;
+						}
+					if(chr == '\\')
+						{
+						idx++;
+						continue;
+						}
+					}
+				continue;
+			case '\'':
+				startToken = idx - 1;
+				while(idx < length)
+					{
+					chr = text.charAt(idx++);
+					if(chr == '\'') 
+						{
+						doc.setCharacterAttributes(startToken, idx - startToken, string, false);
+						break;
+						}
+					if(chr == '\\')
+						{
+						idx++;
+						continue;
+						}
+					}
+			case '/':
+				startToken = idx - 1;
+				if(text.startsWith("/*", startToken))
+					{
+					idx = text.indexOf("*/", startToken + 2);
+					if(idx < 0) idx = length;
+					else idx = idx + 2;
+					doc.setCharacterAttributes(startToken, idx - startToken, comment, false);
+					}
+				else if(text.startsWith("//", startToken))
+					{
+					while(chr != '\n' && idx < length) chr = text.charAt(idx++);
+					doc.setCharacterAttributes(startToken, idx - startToken, comment, false);
+					}
+				continue;
+			default:
+				startToken = idx - 1;
+				while(chr > ' ' && chr != '(' && chr != ')' && 
+						chr != '\'' && chr != '"' && 
+						chr != ':' && chr != ';' && chr != ',' &&
+						chr != '{' && chr != '}' && chr != '[' && chr != ']' &&
+						idx < length) chr = text.charAt(idx++);
+				token = text.substring(startToken, idx - 1);
+
+				if(keys.contains(token))
+					doc.setCharacterAttributes(startToken, idx - startToken - 1, keyword, false);
+				else
+					{
+					//if(token.matches(numberPattern))
+					if(compiledPattern.matcher(token).matches())
+						doc.setCharacterAttributes(startToken, idx - startToken - 1, number, false);
+					else
+						doc.setCharacterAttributes(startToken, idx - startToken - 1, normal, false);
+					}
+					
+				switch(chr)
+					{
+					case '(':
+					case ')':
+					case '[':
+					case ']':
+						doc.setCharacterAttributes(idx - 1, 1, paren, false);
+						continue;
+					case '{':
+						++parenCount;
+						doc.setCharacterAttributes(idx - 1, 1, paren, false);
+						continue;
+					case '}':
+						--parenCount;
+						doc.setCharacterAttributes(idx - 1, 1, paren, false);
+						if(parenCount == 0) // top level
+							{
+							topLevels.addElement(offset);
+							offset = idx;
+							}
+						continue;
+					case ':':
+					case ';':
+					case ',':
+						doc.setCharacterAttributes(idx - 1, 1, normal, false);
+						continue;
+					case '"':
+					case '\'':
+						--idx;
+						continue;
+					}
+			}
+		}
+		
+	SyntaxHighlighter.active  = false;
+	}
+	
+static void setFlavor(int flavor)
+	{
+	if(keys == null) init();
+	switch(flavor)
+		{
+		case TextPaneWidget.SYNTAX_C:
+			keys = keysC;
+			break;
+		case TextPaneWidget.SYNTAX_CPP:
+			keys = keysCPP;
+			break;
+		case TextPaneWidget.SYNTAX_JAVA:
+			keys = keysJava;
+			break;
+		case TextPaneWidget.SYNTAX_PHP:
+			keys = keysPHP;
+			break;
+		}
+	}
+	
+static void init()
+	{
+	if(keys == null)
+		{
+		keysC = new HashSet();
+		for(int idx = 0; idx < reservedC.length; idx++)
+			keysC.add(reservedC[idx]);
+			
+		keysCPP = new HashSet();
+		for(int idx = 0; idx < reservedC.length; idx++)
+			keysCPP.add(reservedC[idx]);
+		for(int idx = 0; idx < reservedCPP.length; idx++)
+			keysCPP.add(reservedCPP[idx]);
+
+		keysJava = new HashSet();
+		for(int idx = 0; idx < reservedJava.length; idx++)
+			keysJava.add(reservedJava[idx]);
+
+		keysPHP = new HashSet();
+		for(int idx = 0; idx < reservedPHP.length; idx++)
+			keysPHP.add(reservedPHP[idx]);
+			
+		keys = keysC;
+		}
+		
+	compiledPattern = Pattern.compile(numberPattern);
+	
+	comment = new SimpleAttributeSet();
+	StyleConstants.setForeground(comment, SyntaxHighlighter.commentColor);
+	
+	keyword = new SimpleAttributeSet();
+	StyleConstants.setForeground(keyword, SyntaxHighlighter.keywordColor);
+	
+	string = new SimpleAttributeSet();
+	StyleConstants.setForeground(string, SyntaxHighlighter.stringColor);
+	
+	number = new SimpleAttributeSet();
+	StyleConstants.setForeground(number, SyntaxHighlighter.numberColor);
+	
+	quoted = new SimpleAttributeSet();
+	StyleConstants.setForeground(quoted, SyntaxHighlighter.quotedColor);
+	
+	paren = new SimpleAttributeSet();
+	StyleConstants.setForeground(paren, SyntaxHighlighter.parenColor);
+	}	
+}
+
+// eof
diff --git a/guiserver/java/TabbedPaneWidget.java b/guiserver/java/TabbedPaneWidget.java
new file mode 100644
index 0000000..099f1c2
--- /dev/null
+++ b/guiserver/java/TabbedPaneWidget.java
@@ -0,0 +1,169 @@
+//
+//  TabbedPaneWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/17/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import javax.swing.*;
+import javax.swing.event.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class TabbedPaneWidget extends gsObject {
+
+JTabbedPane tabbedpane;
+HashMap tabsHash;
+
+public TabbedPaneWidget(StringTokenizer params)
+	{
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	String orientation = params.nextToken();
+	if(orientation.equals("bottom")) tabbedpane = new JTabbedPane(JTabbedPane.BOTTOM);
+	else if(orientation.equals("left")) tabbedpane = new JTabbedPane(JTabbedPane.LEFT);
+	else if (orientation.equals("right")) tabbedpane = new JTabbedPane(JTabbedPane.RIGHT);
+	else tabbedpane = new JTabbedPane(JTabbedPane.TOP);
+	
+	component = tabbedpane;
+	jcomponent = tabbedpane;
+	container = tabbedpane;
+	tabsHash = new HashMap();
+	
+	while(params.hasMoreTokens())
+		{
+		String cid = params.nextToken();
+		gsObject gsobject = (gsObject)gsObject.widgets.get(cid);
+		String title = Base64Coder.decodeString(params.nextToken());
+		tabbedpane.addTab(title, gsobject.component);
+		tabsHash.put(gsobject.component, cid);
+		}
+		
+	gsObject.widgets.put(id, this);
+	//guiserver.widgets.put(id, tabbedpane);
+	
+	ChangeListener changelistener = new ChangeListener() {
+		public void stateChanged(ChangeEvent e)
+			{
+			int index = tabbedpane.getSelectedIndex();
+			String title = Base64Coder.encodeString(tabbedpane.getTitleAt(index));
+			//Component cmpnt = tabbedpane.getComponentAt(index);
+			//Object obj = cmpnt;
+			//gsObject gso = (gsObject)obj;
+			
+			String cid = (String)tabsHash.get(tabbedpane.getComponentAt(index));
+			
+			guiserver.out.println("("+ action + " \"" + id +  "\" \"" + cid + "\" \"" + title + "\" " + index + ")");
+			guiserver.out.flush();
+			}
+		};
+		
+	tabbedpane.addChangeListener(changelistener);
+	}
+	
+
+public void insertTab(StringTokenizer tokens)
+	{
+	String scomp = tokens.nextToken();
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	int index = 0;
+	ImageIcon icon = null;
+	
+	if(tokens.hasMoreTokens())
+		index = Integer.parseInt(tokens.nextToken());
+		
+	if(tokens.hasMoreTokens())
+		icon = guiserver.getIconFromPath(Base64Coder.decodeString(tokens.nextToken()), this.getClass());
+		
+	if(index > tabbedpane.getTabCount()) 
+		index = tabbedpane.getTabCount();
+	
+	gsObject gsobject = (gsObject)gsObject.widgets.get(scomp);
+	Component comp = gsobject.component;
+	
+	tabbedpane.insertTab(text, icon, comp, null, index);
+	tabsHash.put(comp, gsobject.id);
+	}
+
+public void removeTab(StringTokenizer tokens)
+	{
+	int index = 0;
+	int tcount = tabbedpane.getTabCount();
+	
+	if(tcount == 1) return;
+	
+	if(tokens.hasMoreTokens())
+		index = Integer.parseInt(tokens.nextToken());
+
+	
+	if(index >= tcount) 
+		index = tcount - 1;
+	if(index < 0) index = 0;
+		
+	Component comp = tabbedpane.getComponentAt(index);
+	tabsHash.remove(comp);
+
+	try { tabbedpane.removeTabAt(index); } catch (IndexOutOfBoundsException ex) {}
+	}
+		
+
+public void setIcon(StringTokenizer tokens)
+	{
+	ImageIcon icon = guiserver.getIconFromPath(Base64Coder.decodeString(tokens.nextToken()), this.getClass());
+	
+	int index = Integer.parseInt(tokens.nextToken());
+
+	if(index >= tabbedpane.getTabCount())
+		index = tabbedpane.getTabCount() - 1;
+	if(index < 0) index = 0;
+	
+	tabbedpane.setIconAt(index, icon);
+	}
+	
+public void setText(StringTokenizer tokens)
+	{
+	String title = Base64Coder.decodeString(tokens.nextToken());
+	int index = Integer.parseInt(tokens.nextToken());
+
+	if(index >= tabbedpane.getTabCount())
+		index = tabbedpane.getTabCount() - 1;
+	if(index < 0) index = 0;
+	
+	tabbedpane.setTitleAt(index, title);
+	}
+	
+	
+public void requestFocus(StringTokenizer tokens)
+	{
+	int index = Integer.parseInt(tokens.nextToken());
+	
+	if(index >= tabbedpane.getTabCount()) 
+		index = tabbedpane.getTabCount() - 1;
+	if(index < 0) index = 0;
+	
+	tabbedpane.setSelectedIndex(index);
+	}
+		
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/TextAreaWidget.java b/guiserver/java/TextAreaWidget.java
new file mode 100644
index 0000000..c0277a0
--- /dev/null
+++ b/guiserver/java/TextAreaWidget.java
@@ -0,0 +1,381 @@
+//
+//  TextAreaWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/16/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import java.awt.event.ActionEvent;
+import java.util.*;
+import java.io.*;
+import javax.swing.*;
+import javax.swing.event.*;
+import javax.swing.text.*;
+
+
+@SuppressWarnings("unchecked")
+public class TextAreaWidget extends aTextWidget {
+
+JTextArea textArea;
+int lastCharCode = 65535;
+int lastDot = 0;
+Process process = null;
+BufferedWriter stdOut;
+BufferedReader stdInput;
+BufferedReader stdError;
+String command = "";
+int historyIndex = 0;
+Vector history;
+String lastShellCommand;
+
+public TextAreaWidget(StringTokenizer params)
+	{
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	textArea = new JTextArea();
+	textArea.setFont(new Font("SansSerif", Font.PLAIN, 12));
+	textArea.setLineWrap(true);
+    textArea.setWrapStyleWord(true);
+	
+    areaScrollPane = new JScrollPane(textArea);
+    areaScrollPane.setVerticalScrollBarPolicy(JScrollPane.VERTICAL_SCROLLBAR_AS_NEEDED);
+	
+	container = areaScrollPane;
+	jcomponent = textArea;
+	component = areaScrollPane;
+	textcomp = textArea;
+	isScrollable = true;
+
+	if(params.hasMoreTokens())
+		areaScrollPane.setPreferredSize(
+			new Dimension(Integer.parseInt(params.nextToken()),Integer.parseInt(params.nextToken())));
+		
+	gsObject.widgets.put(id, this);
+		
+	KeyListener keyListener = new KeyAdapter() {
+		public void keyPressed(KeyEvent e)
+			{
+			Character chr = new Character(e.getKeyChar());
+			lastCharCode = chr.hashCode();
+			
+			if(process != null)
+				{
+				// goto beggining of line
+				if(lastCharCode == 1)
+					textArea.setCaretPosition(lastDot);		
+					
+				// goto end of line
+				else if(lastCharCode == 5)
+					textArea.setCaretPosition(textArea.getText().length());		
+					
+				// clear screen with Ctrl-L
+				else if(lastCharCode == 12) 
+					{
+					textArea.setText("");
+					lastDot = 0;
+					try {
+						stdOut.write(10);
+						stdOut.flush();
+						}
+					catch (IOException ioex) { System.out.println("clear screen:" + ioex); };	
+					}
+				// get last command with Ctrl-P
+				else if(lastCharCode == 16) textArea.append(command.trim());				
+				}
+			}
+		};
+		
+	CaretListener caretListener = new CaretListener() {
+		public void caretUpdate(CaretEvent ce)
+			{
+			int mark = ce.getMark();
+			int dot = ce.getDot();
+			guiserver.out.println("(" + action + " \"" + id + "\" " + lastCharCode + " " + dot + " " + mark + ")");
+			guiserver.out.flush();
+			lastCharCode = 65535;
+			}
+		};
+		
+	textArea.addCaretListener(caretListener);
+	textArea.addKeyListener(keyListener);
+	}
+
+public void setTabSize(StringTokenizer tokens)
+	{
+	textArea.setTabSize(Integer.parseInt(tokens.nextToken()));
+	}	
+
+public void clearText(StringTokenizer params)
+	{
+	textcomp.setText("");
+	lastCharCode = 65535;
+	lastDot = 0;
+	if(process != null)
+		try {
+			stdOut.write(10);
+			stdOut.flush();
+			}
+		catch (IOException ioex) { System.out.println("clear screen:" + ioex); };
+	}
+
+
+public void runShell(StringTokenizer tokens)
+	{
+	String command;
+	
+	if(tokens == null)
+		{
+		command = lastShellCommand;
+		}
+	else
+		{
+		command = Base64Coder.decodeString(tokens.nextToken());
+		lastShellCommand = command;
+		}
+	
+	history = new Vector();
+	historyIndex = 0;
+
+	if(process != null)
+		process.destroy();
+		
+	InputMap im = textArea.getInputMap();
+	ActionMap am = textArea.getActionMap();
+	im.put(KeyStroke.getKeyStroke(KeyEvent.VK_UP, 0), "history-up");
+	am.put("history-up", new HistoryUpAction());
+	im.put(KeyStroke.getKeyStroke(KeyEvent.VK_DOWN, 0), "history-down");
+	am.put("history-down", new HistoryDownAction());
+	im.put(KeyStroke.getKeyStroke(KeyEvent.VK_ENTER, 0), "command");
+	am.put("command", new CommandAction());
+
+
+	textArea.setText("");
+	lastCharCode = 65535;
+	lastDot = 0;
+	try { setupShell(command); }
+	catch (IOException ioex) {
+		ErrorDialog.show("run-shell", "Could not start " + command);
+		process = null;
+		}
+	}
+	
+public void setupShell(String command) throws IOException
+	{
+	String s;
+	int chr;
+	process = Runtime.getRuntime().exec(command);
+	
+	//System.out.println("set up:" + command);
+
+	if(guiserver.UTF8)
+		{
+		stdInput = new BufferedReader(new InputStreamReader(process.getInputStream(), "UTF8"));
+		stdError = new BufferedReader( new InputStreamReader(process.getErrorStream(), "UTF8"));
+		}
+	else
+		{
+		stdInput = new BufferedReader(new InputStreamReader(process.getInputStream()));
+		stdError = new BufferedReader( new InputStreamReader(process.getErrorStream()));
+		}
+
+	stdOut = new BufferedWriter( new OutputStreamWriter(process.getOutputStream()));
+		
+	new Thread(new stdinListener()).start();
+	new Thread(new stderrorListener()).start();
+	}
+	
+public void destroyShell(StringTokenizer params)
+	{
+	if(process != null) process.destroy();
+	process = null;
+	stdOut = null;
+	}
+	
+public void evalShell(StringTokenizer params)
+	{
+	String command = Base64Coder.decodeString(params.nextToken());
+	int retryCount = 0;
+	
+	while(retryCount < 1)
+		{
+		if(process == null)
+			{
+			textArea.append("--- restarting shell ---"); 
+			runShell(null);
+			if(process == null) break;
+			}
+		else
+			{
+			try {
+				stdOut.write(command, 0, command.length());
+				stdOut.flush();
+				break;
+				}
+			catch (IOException ioex) { 
+				textArea.append("--- eval shell: must restart shell ---"); 
+				process = null;
+				//++retryCount;
+				};
+			}
+		}
+		
+	}
+	
+class stdinListener implements Runnable
+	{
+	int len;
+	char buff[];
+	String str;
+	String text;
+	
+	stdinListener()
+		{
+		buff = new char[256];
+		}
+		
+	public void run()
+		{
+		try {
+			while((len = stdInput.read(buff, 0, 256)) != -1)
+				{
+				str = new String(buff, 0, len);
+				text = textArea.getText();
+				if(text.length() > 100000)
+					textArea.setText(text.substring(50000));
+					
+				textArea.append(str);
+				lastDot = textArea.getText().length();
+				textArea.setCaretPosition(lastDot);				
+				}
+			}
+		catch (IOException ioex) {};
+		}
+	}
+	
+class stderrorListener implements Runnable
+	{
+	int len;
+	char buff[];
+	String str;
+	String text;
+	
+	stderrorListener()
+		{
+		buff = new char[256];
+		}
+		
+	public void run()
+		{
+		try {
+			while((len = stdError.read(buff, 0, 256)) != -1)
+				{
+				str = new String(buff, 0, len);
+				text = textArea.getText();
+				if(text.length() > 100000)
+					textArea.setText(text.substring(50000));
+					
+				textArea.append(str);
+				lastDot = textArea.getText().length();
+				textArea.setCaretPosition(lastDot);				
+				}
+			}
+		catch (IOException ioex) {};
+		}
+	}
+
+
+private class HistoryUpAction extends AbstractAction {
+	public void actionPerformed(ActionEvent ev) {
+		textArea.setCaretPosition(lastDot);
+		textArea.moveCaretPosition(textArea.getText().length());
+		textArea.cut();
+		if(history.size() > 0)
+			{
+			textArea.append((String)history.elementAt(historyIndex));
+			if(historyIndex < (history.size() - 1))
+				historyIndex += 1;
+			}
+		}
+	}
+
+private class HistoryDownAction extends AbstractAction {
+	public void actionPerformed(ActionEvent ev) {
+		textArea.setCaretPosition(lastDot);
+		textArea.moveCaretPosition(textArea.getText().length());
+		textArea.cut();
+		if(history.size() > 0)
+			{
+			textArea.append((String)history.elementAt(historyIndex));
+			if(historyIndex > 0)
+				historyIndex -= 1;
+			}
+		}
+	}
+
+private class CommandAction extends AbstractAction {
+	public void actionPerformed(ActionEvent ev) {
+			String text = textArea.getText();
+			//System.out.println("lastDot:" + lastDot + " length:" + text.length());
+			//System.out.println("->" + command + "<-");
+			text = text.substring(lastDot);
+			
+			if(guiserver.UTF8)
+				{
+				try {
+					byte[] utf8 = text.getBytes("UTF-8");
+					command = new String(utf8);
+					} 
+				catch (UnsupportedEncodingException e) 
+					{ 
+					System.out.println("errorconverting to UTF8");
+					command = text;
+					}
+				}
+			else
+				command = text;
+			
+			textArea.append("\n");
+			try { 
+				stdOut.write(command, 0, command.length());
+				stdOut.write(10);
+				stdOut.flush();
+				if(command.length() > 0)
+					history.insertElementAt(new String(text), 0);
+				historyIndex = 0;
+				}
+			catch (IOException ioex) { 
+				textArea.append("--- cannot execute: restart shell ---"); 
+				};
+		}
+	}
+
+}
+
+/*
+Thread t = new Thread () {
+	public void run() {}
+	}
+*/
+ 
+ 
+// eof //
diff --git a/guiserver/java/TextFieldWidget.java b/guiserver/java/TextFieldWidget.java
new file mode 100644
index 0000000..8b3658e
--- /dev/null
+++ b/guiserver/java/TextFieldWidget.java
@@ -0,0 +1,84 @@
+//
+//  TextFieldWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/16/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import java.util.*;
+import java.io.*;
+import javax.swing.*;
+import javax.swing.text.*;
+
+@SuppressWarnings("unchecked")
+public class TextFieldWidget extends aTextWidget {
+
+JTextField textfield;
+
+public TextFieldWidget(StringTokenizer params)
+	{
+	textfield = new JTextField();
+	jcomponent = textfield;
+	component = textfield;
+	container = textfield;
+	textcomp = textfield;
+	isScrollable = false;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+	textfield.setColumns(Integer.parseInt(params.nextToken()));
+	
+	gsObject.widgets.put(id, this);
+
+	ActionListener listener = new ActionListener() {
+		public void actionPerformed(ActionEvent e)
+			{	
+			if(action != null)
+				{	
+				String param = "\"" + Base64Coder.encodeString(textfield.getText()) + "\"";
+				guiserver.out.println("("+ action + "\"" + id +  "\"" + param + ")");
+				guiserver.out.flush();
+				}
+			}
+		};
+		
+
+	KeyListener keyListener = new KeyAdapter() {
+		public void keyPressed(KeyEvent e)
+			{
+			Character chr = new Character(e.getKeyChar());
+			if(chr.hashCode() == 27)
+				{
+				guiserver.out.println("("+ action + "\"" + id + "\")");
+				guiserver.out.flush();
+				}
+			} 		
+		};
+		
+	textfield.addKeyListener(keyListener);
+	textfield.addActionListener(listener);
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/TextPaneWidget.java b/guiserver/java/TextPaneWidget.java
new file mode 100644
index 0000000..05e088d
--- /dev/null
+++ b/guiserver/java/TextPaneWidget.java
@@ -0,0 +1,614 @@
+//
+//  TextPaneWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/11/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import java.util.*;
+import java.io.File;
+import java.io.FileReader;
+import java.io.FileWriter;
+
+import javax.swing.*;
+import javax.swing.text.*;
+import javax.swing.text.html.*;
+import javax.swing.event.*;
+import javax.swing.undo.*;
+
+@SuppressWarnings("unchecked")
+public class TextPaneWidget extends aTextWidget {
+
+JTextPane textPane;
+String contentType = null;
+
+CaretListener caretListener;
+CaretEvent lastCaretEvent = null;
+int lastCharCode = 65535;
+int lastModifiers = 0;
+int documentLength = 0;
+String undoState = "nil";
+String redoState = "nil";
+
+Color foreground = new Color(0,0,0);
+StyledDocument styledDoc;
+Vector shTopLevels;
+TextPaneWidget widget;
+
+static final int SYNTAX_NONE = 0;
+static final int SYNTAX_NEWLISP = 1;
+static final int SYNTAX_C = 2;
+static final int SYNTAX_CPP = 3;
+static final int SYNTAX_JAVA = 4;
+static final int SYNTAX_PHP = 5;
+
+int syntaxSelected = SYNTAX_NONE;
+
+//undo helpers
+protected UndoAction undoAction;
+protected RedoAction redoAction;
+protected UndoManager undo = new UndoManager();
+MyUndoableEditListener undoableEditListener;
+boolean undoEnabled = true;
+
+public TextPaneWidget(StringTokenizer params)
+	{
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	textPane = new JTextPane();
+	textPane.setDoubleBuffered(true);
+	
+	Caret caret = new MyCaret();
+	caret.setBlinkRate(500);
+	
+	textPane.setCaret(caret);
+	
+	if(params.hasMoreTokens())
+		contentType = params.nextToken();
+	if(!contentType.equals("text/html") && !contentType.equals("text/rtf"))
+		contentType = "text/plain";
+	textPane.setContentType(contentType);
+			
+	areaScrollPane = new JScrollPane(textPane);
+    areaScrollPane.setVerticalScrollBarPolicy(JScrollPane.VERTICAL_SCROLLBAR_AS_NEEDED);
+	
+	container = areaScrollPane;
+	jcomponent = textPane;
+	component = areaScrollPane;
+	textcomp = textPane;
+	isScrollable = true;
+	
+	widget = this;
+
+	shTopLevels = new Vector();
+
+	if(params.hasMoreTokens())
+		areaScrollPane.setPreferredSize(
+			new Dimension (Integer.parseInt(params.nextToken()),Integer.parseInt(params.nextToken())));
+		
+	gsObject.widgets.put(id, this);
+
+	styledDoc = textPane.getStyledDocument();
+	AbstractDocument doc = (AbstractDocument)styledDoc;
+	//doc.setDocumentFilter(new MyDocumentFilter(1000000));
+	
+	KeyListener keyListener = new KeyAdapter() {
+		public void keyPressed(KeyEvent e)
+			{
+			Character chr = new Character(e.getKeyChar());
+			int code = e.getKeyCode();
+			lastCharCode = chr.hashCode();
+			int lastPos, caretPos, size, len;
+			
+			lastModifiers = e.getModifiersEx();
+			
+			if(syntaxSelected != SYNTAX_NONE) colorSyntax();
+	
+			switch(lastCharCode)
+				{
+				case 40:
+					highlightClosingPar('(', ')');
+					break;
+				case 41:
+					highlightOpeningPar('(', ')');
+					break;
+				case 123:
+					highlightClosingPar('{', '}');
+					break;
+				case 125:
+					highlightOpeningPar('{', '}');
+					break;
+				case 91:
+					highlightClosingPar('[', ']');
+					break;
+				case 93:
+					highlightOpeningPar('[', ']');
+					break;
+
+				}
+			}
+		};
+		
+	caretListener = new CaretListener() {
+		public void caretUpdate(CaretEvent ce)
+			{
+			int mark, dot;
+			
+			if(ce == null) return;
+			
+			mark = ce.getMark();
+			dot = ce.getDot();
+			
+			lastCaretEvent = ce;
+			
+			undoAction.updateUndoState();
+			redoAction.updateRedoState();
+			
+			if(undoAction.isEnabled()) undoState = "true";
+			else undoState = "nil";
+			
+			if(redoAction.isEnabled()) redoState = "true";
+			else redoState = "nil";
+			
+			guiserver.out.println("(" + action + " \"" + id + "\" " + lastCharCode + " " + 
+				lastModifiers + " " + dot + " " + mark + " " + documentLength + " " + 
+				undoState + " " + redoState + ")");
+			guiserver.out.flush();
+			lastCharCode = 65535;
+			}
+		};
+	
+	undoAction = new UndoAction();
+	redoAction = new RedoAction();
+	
+	undoableEditListener = new MyUndoableEditListener();
+	
+	styledDoc.addUndoableEditListener(undoableEditListener);
+	styledDoc.addDocumentListener(new MyDocumentListener());
+	
+	// set ctrl-Z and meta-Z undo/redo keys
+	InputMap inputMap = textPane.getInputMap();
+	KeyStroke key;
+	
+	if(guiserver.MAC_OS_X)
+		key = KeyStroke.getKeyStroke(KeyEvent.VK_Z, Event.META_MASK);
+	else
+		key = KeyStroke.getKeyStroke(KeyEvent.VK_Z, Event.CTRL_MASK);
+	inputMap.put(key, undoAction);
+
+	if(guiserver.MAC_OS_X)
+		key = KeyStroke.getKeyStroke(KeyEvent.VK_Z, Event.META_MASK | Event.SHIFT_MASK);
+	else
+		key = KeyStroke.getKeyStroke(KeyEvent.VK_Z, Event.CTRL_MASK | Event.SHIFT_MASK);
+	inputMap.put(key, redoAction);
+	
+	textPane.addHyperlinkListener(new Hyperactive());
+	textPane.addKeyListener(keyListener);
+	textPane.addCaretListener(caretListener);
+	}
+	
+public void highlightOpeningPar(char opng, char clsng)
+	{
+	int balance = -1;
+	String text = textPane.getText();
+	int currentPos = textPane.getCaretPosition();
+	int caretPos = 0;
+	int len = text.length();
+
+	caretPos = currentPos - 1; // new
+	// go back looking for matching parenthesis
+	while(balance != 0 && caretPos >= 0)
+		{
+		if(text.charAt(caretPos) == opng) ++balance;
+		else if(text.charAt(caretPos) == clsng) --balance;
+		--caretPos;
+		}
+		
+	++caretPos;
+
+	if(balance == 0) highlightPosition(caretPos, currentPos);
+	}
+	
+public void highlightClosingPar(char opng, char clsng)
+	{
+	int balance = 1;
+	String text = textPane.getText();
+	int currentPos = textPane.getCaretPosition();
+	int caretPos = 0;
+	int len = text.length();	
+	
+	if(len == 0) return;
+		
+	caretPos = currentPos;
+	
+	// go forward to matching parentheseis
+	while(balance != 0 && caretPos < len)
+		{
+		if(text.charAt(caretPos) == opng) ++balance;
+		else if(text.charAt(caretPos) == clsng) --balance;
+		++caretPos;
+		}
+		
+	if(balance == 0) highlightPosition(caretPos, currentPos);
+	}
+	
+public void highlightPosition(int pos, int oldPos)
+	{
+	textPane.setCaretPosition(pos);
+	textPane.getCaret().paint(textPane.getGraphics());
+	textPane.repaint();
+	try {Thread.sleep(400); } catch (InterruptedException ie) {}
+	textPane.setCaretPosition(oldPos);
+	textPane.getCaret().paint(textPane.getGraphics());
+	}
+
+
+public void loadText(StringTokenizer tokens)
+	{
+	String path = Base64Coder.decodeString(tokens.nextToken());
+	
+	EditorKit kit = textPane.getEditorKit();
+	
+	System.setProperty("line.separator", "\n");
+	
+	try {
+		if(guiserver.UTF8)
+			kit.read(new FilterFileReader(path, "UTF8"), styledDoc, 0); 
+		else
+			kit.read(new FilterFileReader(path), styledDoc, 0); 			
+		}
+	catch(Exception ex) { ErrorDialog.show("gs:load-text", "Cannot load or decode file: " + path); }
+	}
+	
+	
+public void saveText(StringTokenizer tokens)
+	{
+	String path = Base64Coder.decodeString(tokens.nextToken());
+	
+	EditorKit kit = textPane.getEditorKit();
+	
+	try { kit.write(new FileWriter(path), styledDoc, 0, styledDoc.getLength()); }
+	catch(Exception ex) { ErrorDialog.show("gs:save-text", "Cannot save file: " + path); }
+	}
+
+
+public void findText(StringTokenizer tokens)
+	{
+	String findtext = Base64Coder.decodeString(tokens.nextToken());
+	String direction = "next";
+	boolean isRegex = false;
+	int dot;
+	
+	String findTextAction = tokens.nextToken();
+	
+	if(tokens.hasMoreTokens())
+		direction = tokens.nextToken();
+				
+	if(tokens.hasMoreTokens())
+		isRegex = tokens.nextToken().equals("true");
+	
+	String text = textPane.getText();
+	
+	int currentCaret = textPane.getCaretPosition();
+	
+	if(direction.equals("previous"))
+		{
+		//++currentCaret;
+		if(currentCaret > findtext.length() + 1) 
+			currentCaret -= findtext.length() + 1;
+		dot = text.lastIndexOf(findtext, currentCaret);
+		}
+	else
+		dot = text.indexOf(findtext, currentCaret);
+
+	guiserver.out.println("(" + findTextAction + " \"" + id + "\" " + dot + ")");
+	guiserver.out.flush();
+	
+	if(dot < 0)
+		{
+		textPane.setCaretPosition(currentCaret);
+		return;
+		}
+		
+	textPane.setCaretPosition(dot);
+	textPane.moveCaretPosition(dot + findtext.length());
+	}
+
+public void setTabSize(StringTokenizer tokens)
+	{
+	int tabSize = Integer.parseInt(tokens.nextToken());
+			
+	TabSet tabSet = new TabSet(new TabStop[] { 
+		new TabStop(tabSize), new TabStop(2 * tabSize), new TabStop(3 * tabSize), 
+		new TabStop(4 * tabSize), new TabStop(5 * tabSize), new TabStop(6 * tabSize),
+		new TabStop(7 * tabSize), new TabStop(8 * tabSize), new TabStop(9 * tabSize) });
+		
+	SimpleAttributeSet attributes = new SimpleAttributeSet();
+    StyleConstants.setTabSet(attributes, tabSet);
+    styledDoc.setParagraphAttributes(0, documentLength, attributes, false);
+	}
+	
+public void setSyntax(StringTokenizer tokens)
+	{
+	String tkn  = tokens.nextToken();
+	
+	if(tkn.equals("true") || tkn.equals("lsp"))
+		syntaxSelected = SYNTAX_NEWLISP;
+	else if(tkn.equals("c"))
+		syntaxSelected = SYNTAX_C;
+	else if(tkn.equals("cpp"))
+		syntaxSelected = SYNTAX_CPP;
+	else if(tkn.equals("java"))
+		syntaxSelected = SYNTAX_JAVA;
+	else if(tkn.equals("php"))
+		syntaxSelected = SYNTAX_PHP;
+	else syntaxSelected = SYNTAX_NONE;
+
+	//textPane.setCursor(new Cursor(Cursor.WAIT_CURSOR));
+	if(syntaxSelected == SYNTAX_NONE)
+		{
+		SimpleAttributeSet normal = new SimpleAttributeSet();
+		StyleConstants.setForeground(normal, widget.foreground);
+		styledDoc.setCharacterAttributes(0, documentLength, normal, true);
+		}
+	else
+		{
+		shTopLevels.removeAllElements();
+		if(syntaxSelected == SYNTAX_NEWLISP)
+			SyntaxHighlighter.color(widget, 0, documentLength);
+		else
+			{
+			SyntaxHighlighterC.setFlavor(syntaxSelected);
+			SyntaxHighlighterC.color(widget, 0, documentLength);
+			}
+		}
+	//textPane.setCursor(new Cursor(Cursor.DEFAULT_CURSOR));
+			
+	undo.discardAllEdits();
+	}
+	
+public void setForeground(StringTokenizer tokens)
+	{
+	Float red = Float.parseFloat(tokens.nextToken());
+	Float green = Float.parseFloat(tokens.nextToken());
+	Float blue = Float.parseFloat(tokens.nextToken());
+	if(tokens.hasMoreTokens())
+		{
+		Float alpha = Float.parseFloat(tokens.nextToken());
+		textPane.setForeground(new Color(red, green, blue, alpha));
+		}
+	else
+		textPane.setForeground(new Color(red, green, blue));
+		
+	widget.foreground = textPane.getForeground();
+	}
+	
+class Hyperactive implements HyperlinkListener {
+         public void hyperlinkUpdate(HyperlinkEvent e) {
+ 	          if (e.getEventType() == HyperlinkEvent.EventType.ACTIVATED) {
+ 		      JEditorPane pane = (JEditorPane) e.getSource();
+ 		      if (e instanceof HTMLFrameHyperlinkEvent) {
+ 		          HTMLFrameHyperlinkEvent  evt = (HTMLFrameHyperlinkEvent)e;
+ 		          HTMLDocument doc = (HTMLDocument)pane.getDocument();
+ 		          doc.processHTMLFrameHyperlinkEvent(evt);
+ 		      } else {
+ 		          try {
+ 			      pane.setPage(e.getURL());
+ 		          } catch (Throwable t) {
+ 			      textPane.setText("The page could not be displayed.");
+ 		          }
+ 		      }
+ 	          }
+ 	      }
+     }
+	 
+// undo and redo 
+
+public void undoEnable(StringTokenizer tokens)
+	{
+	undoEnabled = tokens.nextToken().equals("true");
+	}
+	
+public void undoText(StringTokenizer tokens)
+	{
+	undoAction.actionPerformed(new ActionEvent(textPane, Event.ACTION_EVENT, "Undo"));
+	//undo.undo();
+	}
+	
+public void redoText(StringTokenizer tokens)
+	{
+	redoAction.actionPerformed(new ActionEvent(textPane, Event.ACTION_EVENT, "Redo"));
+	}
+
+public void colorSyntax() 
+	{
+	int caretPos = textPane.getCaretPosition();
+	int pos = 0;
+	int size = shTopLevels.size();
+	int p, len;
+		
+	for(int idx = size - 1; idx >= 0; idx--)
+		{
+		pos = (Integer)shTopLevels.elementAt(idx);
+		if(caretPos > pos) 
+			{
+			for(int i = idx; i < size; i++)
+				{
+				p = (Integer)shTopLevels.elementAt(idx);
+				shTopLevels.removeElementAt(idx);
+				}
+			break;
+			}
+		}
+				
+	if(documentLength > caretPos + 1024)
+		len = caretPos + 1024;
+	else
+		len = documentLength;
+	
+	if(syntaxSelected == SYNTAX_NEWLISP)
+		SyntaxHighlighter.color(widget, pos, len);
+	else
+		SyntaxHighlighterC.color(widget, pos, len);
+	}
+		
+//This one listens for edits that can be undone.
+protected class MyUndoableEditListener implements UndoableEditListener 
+	{
+	public void undoableEditHappened(UndoableEditEvent e) 
+		{
+		//Remember the edit and update the menus.
+		if(SyntaxHighlighter.active || undoEnabled != true) return;
+		undo.addEdit(e.getEdit());
+		//System.out.println("=>" + undo.getUndoPresentationName());
+		undoAction.updateUndoState();
+		redoAction.updateRedoState();
+        }
+    }
+
+// Listens for any changes to the document.
+protected class MyDocumentListener implements DocumentListener 
+	{
+	public void insertUpdate(DocumentEvent e) { updateParams(e);}
+	public void removeUpdate(DocumentEvent e) { updateParams(e);}
+	public void changedUpdate(DocumentEvent e) { updateParams(e);}
+	
+	private void updateParams(DocumentEvent e)
+		{
+		Document document = (Document)e.getDocument();
+		documentLength = document.getLength();
+		}
+	}
+
+class UndoAction extends AbstractAction 
+	{
+	public UndoAction() {
+		super("Undo");
+		setEnabled(false);
+		}
+
+	public void actionPerformed(ActionEvent e) 
+		{
+		String pname = undo.getUndoPresentationName();
+		try { undo.undo(); 	} catch (Exception ex) 
+			{
+			Toolkit.getDefaultToolkit().beep();
+			}
+						
+		String qname = undo.getUndoPresentationName();
+		if(pname.equals("Undo addition") && qname.equals("Undo deletion"))
+			{
+			try { undo.undo(); 	} catch (Exception ex) 
+				{
+				Toolkit.getDefaultToolkit().beep();
+				}
+			}
+		
+		updateUndoState();
+		redoAction.updateRedoState();
+		caretListener.caretUpdate(lastCaretEvent);
+		}
+
+	protected void updateUndoState() {
+		if (undo.canUndo()) {
+			setEnabled(true);
+			putValue(Action.NAME, undo.getUndoPresentationName());
+			} 
+		else {
+			setEnabled(false);
+			putValue(Action.NAME, "Undo");
+			}
+		}
+	}
+
+class RedoAction extends AbstractAction 
+	{
+	public RedoAction() {
+		super("Redo");
+		setEnabled(false);
+		}
+
+	public void actionPerformed(ActionEvent e) 
+		{
+		String pname = undo.getRedoPresentationName();
+		try { undo.redo();} catch (Exception ex) 
+			{
+			Toolkit.getDefaultToolkit().beep();
+			}
+						
+		String qname = undo.getRedoPresentationName();
+		if(pname.equals("Redo deletion") && qname.equals("Redo addition"))
+			{
+			try { undo.redo(); 	} catch (Exception ex) 
+				{
+				Toolkit.getDefaultToolkit().beep();
+				}
+			}
+			
+		updateRedoState();
+		undoAction.updateUndoState();
+		caretListener.caretUpdate(lastCaretEvent);
+		}
+
+	protected void updateRedoState() 
+		{
+		if (undo.canRedo()) {
+			setEnabled(true);
+			putValue(Action.NAME, undo.getRedoPresentationName());
+			} 
+		else {
+			setEnabled(false);
+			putValue(Action.NAME, "Redo");
+			}
+		}	
+	}
+	
+class MyCaret extends DefaultCaret 
+	{
+	public void paint(Graphics g) {
+    if (!isVisible()) return;
+    try 
+		{
+		JTextComponent c = getComponent();
+		int dot = getDot();
+		Rectangle r = c.modelToView(dot);
+		g.setColor(c.getCaretColor());
+		g.fillRect(r.x, r.y, 2, r.height);
+		}
+	catch (Exception e) { System.err.println("."); }
+	}
+
+	protected synchronized void damage(Rectangle r) 
+		{
+		if (r == null) return;
+		x = r.x;
+		y = r.y;
+		width = 2;
+		height = r.height;
+		repaint();
+		}
+	}
+	
+}
+ 
+// eof //
diff --git a/guiserver/java/TextShape.java b/guiserver/java/TextShape.java
new file mode 100644
index 0000000..546c7d5
--- /dev/null
+++ b/guiserver/java/TextShape.java
@@ -0,0 +1,89 @@
+//
+//  TextShape.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/24/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.geom.*;
+import java.util.*;
+
+@SuppressWarnings("unchecked")
+public class TextShape extends Shape {
+
+String text;
+Font textShapeFont;
+
+public TextShape(StringTokenizer tokens)
+	{
+	tag = tokens.nextToken();
+	text = Base64Coder.decodeString(tokens.nextToken());
+	X = Integer.parseInt(tokens.nextToken());
+	Y = Integer.parseInt(tokens.nextToken());
+	
+	if(tokens.hasMoreTokens())
+		paintColor = Shape.getColorParameter(tokens);
+	else
+		paintColor = CanvasWidget.currentCanvas.currentPaint;
+		
+	//System.out.println("text color:" + 
+			//paintColor.getRed() + " " + paintColor.getGreen() + " " + paintColor.getBlue());
+	
+	if(tokens.hasMoreTokens())
+		{
+		double theta = Float.parseFloat(tokens.nextToken());
+		theta = 2.0 * Math.PI * theta / 360.0;
+		transform = AffineTransform.getRotateInstance(theta, X, Y);
+		}
+		
+	//stroke = CanvasWidget.currentCanvas.currentStroke;
+	
+	textShapeFont = CanvasWidget.currentCanvas.currentFont;
+	
+	CanvasWidget.currentCanvas.drawobjects.add(this);
+	}
+	
+public void drawShape(Graphics2D g2)
+	{
+	//g2.setStroke(stroke);
+	g2.setPaint(paintColor);
+	//System.out.println("font draw text with:" + textShapeFont);
+	g2.setFont(textShapeFont);
+	//g2.setComposite(currentComposite);
+	g2.drawString(text, X, Y);
+	}
+	
+public boolean hasPoint(int x, int y)
+	{
+	Component component = CanvasWidget.currentCanvas.component;
+	FontMetrics fm = component.getFontMetrics(textShapeFont);	
+
+	int height = fm.getHeight();
+
+	return(new Rectangle(X, Y - height, fm.stringWidth(text), height).contains(x, y));
+	}
+	
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/ToggleButtonWidget.java b/guiserver/java/ToggleButtonWidget.java
new file mode 100644
index 0000000..9e78f29
--- /dev/null
+++ b/guiserver/java/ToggleButtonWidget.java
@@ -0,0 +1,76 @@
+//
+//  ToggleButtonWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/20/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import javax.swing.*;
+import java.awt.event.*;
+import java.util.*;
+
+public class ToggleButtonWidget extends aButton{
+
+@SuppressWarnings("unchecked") 
+public ToggleButtonWidget(StringTokenizer params)
+	{
+	abutton = new JToggleButton();
+	jcomponent = abutton;
+	component = abutton;
+	container = abutton;
+	
+	id = params.nextToken();
+	action = params.nextToken();
+	
+	if(params.hasMoreTokens())
+		{
+		String base64string = params.nextToken();
+		abutton.setText(Base64Coder.decodeString(base64string));
+		}
+	
+	if(params.hasMoreTokens())
+		abutton.setSelected(params.nextToken().equals("true"));
+
+	
+	gsObject.widgets.put(id, this);
+	
+	ActionListener listener = new ActionListener() {
+		public void actionPerformed(ActionEvent e)
+			{	
+			if(action != null)
+				{
+				if(abutton.isSelected())
+					guiserver.out.println("("+ action + " \"" + id + "\" true)");
+				else
+					guiserver.out.println("("+ action + " \"" + id + "\" nil)");
+					
+				guiserver.out.flush();
+				}
+			}
+		};
+
+	abutton.addActionListener(listener);
+	}
+		
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/ToolbarWidget.java b/guiserver/java/ToolbarWidget.java
new file mode 100644
index 0000000..780fb05
--- /dev/null
+++ b/guiserver/java/ToolbarWidget.java
@@ -0,0 +1,67 @@
+//
+//  ToolbarWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/22/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+
+
+@SuppressWarnings("unchecked") 
+public class ToolbarWidget extends gsObject {
+
+JToolBar jtoolbar;
+
+public ToolbarWidget(StringTokenizer params)
+	{
+	jtoolbar = new JToolBar();
+	container = jtoolbar;
+	component = jtoolbar;
+	jcomponent = jtoolbar;
+	
+	id = params.nextToken();
+
+	if(params.hasMoreTokens())
+		jtoolbar.setFloatable(params.nextToken().equals("true"));
+	else	
+		jtoolbar.setFloatable(false);
+	
+	if(params.hasMoreTokens())
+		{
+		int width = Integer.parseInt(params.nextToken());
+		int height = Integer.parseInt(params.nextToken());
+		jtoolbar.setPreferredSize(new Dimension(width, height));
+		}
+		
+	gsObject.widgets.put(id, this);
+	}
+
+public void addSeparator(StringTokenizer tokens)
+	{
+	jtoolbar.add(new JToolBar.Separator());
+	}
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/WindowFrame.java b/guiserver/java/WindowFrame.java
new file mode 100644
index 0000000..64e2b87
--- /dev/null
+++ b/guiserver/java/WindowFrame.java
@@ -0,0 +1,397 @@
+//
+//  WindowFrame.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/11/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+import java.io.*;
+
+@SuppressWarnings("unchecked")
+public class WindowFrame extends gsObject  {
+
+JFrame jframe;
+String frameCloseAction = null;
+String frameMoveAction = null;
+String frameResizeAction = null;
+
+
+public WindowFrame(StringTokenizer params)
+	{
+	jframe = new JFrame();
+	
+	id = params.nextToken();
+	container = jframe.getContentPane();
+	component = container;
+
+	int x = Integer.parseInt(params.nextToken());
+	int y = Integer.parseInt(params.nextToken());
+	int width = Integer.parseInt(params.nextToken());
+	int height = Integer.parseInt(params.nextToken());
+	
+	gsObject.widgets.put(id, this); 		
+	
+	jframe.setBounds(x, y, width, height);
+
+	// not visible on OSX, but on Win32 and Linux
+	jframe.setIconImage(Toolkit.getDefaultToolkit().getImage(getClass().getResource("/images/newLISP32.png")));
+	
+	if(params.hasMoreTokens())
+		jframe.setTitle(Base64Coder.decodeString(params.nextToken()));
+		
+	if(params.hasMoreTokens())
+		{
+		if(params.nextToken().equals("true"))
+			jframe.setVisible(true);	
+		}
+		
+		
+	WindowAdapter listener = new WindowAdapter() {
+		public void windowClosing(WindowEvent w)
+			{
+			if(frameCloseAction != null)
+				{
+				jframe.setDefaultCloseOperation(JFrame.DO_NOTHING_ON_CLOSE);
+				guiserver.out.println("(" + frameCloseAction + "\"" + id + "\")");
+				guiserver.out.flush();
+				}
+			}
+		};
+		
+	jframe.addWindowListener(listener);
+	
+	
+	ComponentAdapter componentListener = new ComponentAdapter() {
+		public void componentResized(ComponentEvent re) 
+			{
+			if(frameResizeAction != null)
+				{
+				guiserver.out.println("(" + frameResizeAction + "\"" + id + "\"" + 
+						jframe.getWidth() + " " + jframe.getHeight() +")");
+				guiserver.out.flush();
+				}
+			}
+			
+		public void componentMoved(ComponentEvent me)
+			{
+			if(frameMoveAction != null)
+				{
+				guiserver.out.println("(" + frameMoveAction + "\"" + id + "\"" + 
+						jframe.getLocationOnScreen().x + " " + jframe.getLocationOnScreen().y +")");
+				guiserver.out.flush();
+				}
+			}
+		};
+		
+	jframe.addComponentListener(componentListener);
+		
+	jframe.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
+	}
+	
+	
+public void setVisible(StringTokenizer tokens)
+	{
+	//jframe.pack();
+	if(tokens.nextToken().equals("true"))
+		jframe.setVisible(true);
+	else
+		jframe.setVisible(false);
+	}
+
+
+public void setText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	jframe.setTitle(text);
+	}
+
+
+public void getText(StringTokenizer tokens)
+	{
+	String action = tokens.nextToken();
+	String text = jframe.getTitle();
+	if(text.length() == 0)
+		guiserver.out.println("(" + action + " \"" + id + "\")");
+	else
+		guiserver.out.println("(" + action + " \"" + id + "\" [text]" + Base64Coder.encodeString(text) + "[/text])");
+	guiserver.out.flush();
+	}
+	
+
+public void clearText(StringTokenizer tokens)
+	{
+	jframe.setTitle("");
+	}
+
+
+public void setResizable(StringTokenizer tokens)
+	{
+	if(tokens.nextToken().equals("true"))
+		jframe.setResizable(true);
+	else
+		jframe.setResizable(false);
+	}
+	
+	
+public void confirmDialog(StringTokenizer tokens)
+	{
+	String action = tokens.nextToken();
+	String title = Base64Coder.decodeString(tokens.nextToken());
+	String message = Base64Coder.decodeString(tokens.nextToken());
+	int option = JOptionPane.YES_NO_OPTION;
+	
+	if(tokens.hasMoreTokens())
+		{
+		if(!tokens.nextToken().equals("yes-no"))
+			option = JOptionPane.YES_NO_CANCEL_OPTION;
+		}
+			
+	int result = JOptionPane.showConfirmDialog(jframe, message, title, option);
+	
+	guiserver.out.println("(" + action + " \"" + id + "\" " + result + ")");
+	guiserver.out.flush();
+	}
+
+
+public void messageDialog(StringTokenizer tokens)
+	{
+	String title = Base64Coder.decodeString(tokens.nextToken());
+	String message = Base64Coder.decodeString(tokens.nextToken());
+	int option = JOptionPane.PLAIN_MESSAGE;
+	String path;
+	
+	if(tokens.hasMoreTokens())
+		{
+		String soption = tokens.nextToken();
+		if(soption.equals("error")) option = JOptionPane.ERROR_MESSAGE;
+		if(soption.equals("information")) option = JOptionPane.INFORMATION_MESSAGE;
+		if(soption.equals("warning")) option = JOptionPane.WARNING_MESSAGE;
+		if(soption.equals("question")) option = JOptionPane.QUESTION_MESSAGE;
+		}
+		
+	if(tokens.hasMoreTokens())
+		{
+		path = Base64Coder.decodeString(tokens.nextToken());
+		JOptionPane.showMessageDialog(jframe, message, title, option, 
+				guiserver.getIconFromPath(path, this.getClass()));
+		}
+	else
+		JOptionPane.showMessageDialog(jframe, message, title, option);
+	}
+
+
+public void ColorChooser(StringTokenizer tokens)
+	{
+	Color color;
+	String action = tokens.nextToken();
+	String title = Base64Coder.decodeString(tokens.nextToken());
+	Float red;
+	Float green;
+	Float blue;
+	
+	if(tokens.hasMoreTokens()) // get initial color
+		{
+		red = Float.parseFloat(tokens.nextToken());
+		green = Float.parseFloat(tokens.nextToken());
+		blue = Float.parseFloat(tokens.nextToken());
+		color = new Color(red, green, blue);
+		}
+	else color = Color.white;
+		
+	color = JColorChooser.showDialog(jframe, title, color);
+	
+	if(color == null)
+		{
+		guiserver.out.println("(" + action + " \"" + id + "\" \"color\")");
+		guiserver.out.flush();
+		return;
+		}
+	
+	red = (new Integer(color.getRed())).floatValue();
+	green = (new Integer(color.getGreen())).floatValue();
+	blue = (new Integer(color.getBlue())).floatValue();
+	
+	red = red/255;
+	green = green/255;
+	blue = blue/255;
+	
+	guiserver.out.println("(" + action + " \"" + id + "\" \"color\" " + red +  " " + green + " " + blue + ")");
+	guiserver.out.flush();
+	}
+	
+public void OpenFileChooser(StringTokenizer tokens)
+	{
+	JFileChooser filechooser;
+	String file = null;
+	
+	String action = tokens.nextToken();
+
+	if(tokens.hasMoreTokens())
+		filechooser = new JFileChooser(Base64Coder.decodeString(tokens.nextToken()));
+	else
+		filechooser = new JFileChooser();
+		
+	filechooser.setFileSelectionMode(JFileChooser.FILES_AND_DIRECTORIES);
+	
+	if(tokens.hasMoreTokens())
+		{
+		MyFileFilter myfilter = new MyFileFilter();
+		myfilter.extensions = Base64Coder.decodeString(tokens.nextToken());
+		myfilter.description = Base64Coder.decodeString(tokens.nextToken());
+		
+		filechooser.setFileFilter(myfilter);
+		}
+
+	int selected = filechooser.showOpenDialog(container);
+	
+	if(selected == JFileChooser.APPROVE_OPTION)
+		{
+		file = Base64Coder.encodeString(filechooser.getSelectedFile().getAbsolutePath());
+		guiserver.out.println("(" + action + " \"" + id + "\" \"open\" " + "\"" + file + "\")");
+		}
+	else
+		{
+		guiserver.out.println("(" + action + " \"" + id + "\" \"open\")");
+		}
+		
+	guiserver.out.flush();
+	}
+
+
+public void SaveFileChooser(StringTokenizer tokens)
+	{
+	JFileChooser filechooser;
+	String file = null;
+	String initialFile = null;
+	
+	String action = tokens.nextToken();
+
+	if(tokens.hasMoreTokens()) // initial directory
+		filechooser = new JFileChooser(Base64Coder.decodeString(tokens.nextToken()));
+	else
+		filechooser = new JFileChooser();
+		
+	if(tokens.hasMoreTokens()) // initial file name
+		{
+		initialFile = Base64Coder.decodeString(tokens.nextToken());
+		filechooser.setSelectedFile(new File(initialFile));
+		}
+		
+		
+	if(tokens.hasMoreTokens())
+		{
+		MyFileFilter myfilter = new MyFileFilter();
+		myfilter.extensions = Base64Coder.decodeString(tokens.nextToken());
+		myfilter.description = Base64Coder.decodeString(tokens.nextToken());
+		filechooser.setFileFilter(myfilter);
+		}
+
+	int selected = filechooser.showSaveDialog(container);
+	
+	if(selected == JFileChooser.APPROVE_OPTION)
+		{
+		file = Base64Coder.encodeString(filechooser.getSelectedFile().getAbsolutePath());
+		guiserver.out.println("(" + action + " \"" + id + "\" \"save\" " + "\"" + file + "\")");
+		}
+	else
+		guiserver.out.println("(" + action + " \"" + id + "\" \"save\")");
+		
+	guiserver.out.flush();
+	}
+	
+public void setFont(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+		
+public void setToolTip(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void dispose(StringTokenizer tokens)
+	{
+	jframe.dispose();
+	}
+		
+public void setPreferredSize(StringTokenizer tokens)
+	{
+	int width = Integer.parseInt(tokens.nextToken());
+	int height = Integer.parseInt(tokens.nextToken());
+	jframe.setSize(new Dimension(width, height));
+	}
+	
+public void setBackground(StringTokenizer tokens)
+	{
+	Float red = Float.parseFloat(tokens.nextToken());
+	Float green = Float.parseFloat(tokens.nextToken());
+	Float blue = Float.parseFloat(tokens.nextToken());
+	if(tokens.hasMoreTokens())
+		{
+		Float alpha = Float.parseFloat(tokens.nextToken());
+		jframe.setBackground(new Color(red, green, blue, alpha));
+		}
+	else
+		jframe.setBackground(new Color(red, green, blue));
+	}
+	
+public void requestFocus(StringTokenizer tokens)
+	{
+	jframe.requestFocus();
+	}
+	
+public void frameCloseEvent(StringTokenizer tokens)
+	{
+	frameCloseAction = tokens.nextToken();
+	}
+	
+public void frameResizeEvent(StringTokenizer tokens)
+	{
+	frameResizeAction = tokens.nextToken();
+	}
+	
+public void frameMoveEvent(StringTokenizer tokens)
+	{
+	frameMoveAction = tokens.nextToken();
+	}
+
+public void getBounds(StringTokenizer tokens)
+	{
+	int x, y, width, height;
+	
+	x = jframe.getLocationOnScreen().x;
+	y = jframe.getLocationOnScreen().y;
+		
+	width = jframe.getWidth();
+	height = jframe.getHeight();
+	
+	guiserver.out.println("( set 'gs:bounds '(" + x + " " + y + " " + width + " " + height + "))\n");
+	guiserver.out.flush();
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/WindowWidget.java b/guiserver/java/WindowWidget.java
new file mode 100644
index 0000000..0b157dd
--- /dev/null
+++ b/guiserver/java/WindowWidget.java
@@ -0,0 +1,114 @@
+//
+//  WindowWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/16/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.color.*;
+import java.awt.event.*;
+import java.util.*;
+import java.io.*;
+
+@SuppressWarnings("unchecked")
+public class WindowWidget extends gsObject {
+
+Window window;
+Frame frame;
+
+public WindowWidget(StringTokenizer params)
+	{
+	id = params.nextToken();
+	
+	frame = new Frame();
+	window = new Window(frame);
+	component = window;
+	container = window;
+	
+	int x = Integer.parseInt(params.nextToken());
+	int y = Integer.parseInt(params.nextToken());
+	int width = Integer.parseInt(params.nextToken());
+	int height = Integer.parseInt(params.nextToken());
+
+	window.setBounds(x, y, width, height);
+		
+	gsObject.widgets.put(id, this);
+	}
+	
+
+public void setBackground(StringTokenizer tokens)
+	{
+	Float red = Float.parseFloat(tokens.nextToken());
+	Float green = Float.parseFloat(tokens.nextToken());
+	Float blue = Float.parseFloat(tokens.nextToken());
+	if(tokens.hasMoreTokens())
+		{
+		Float alpha = Float.parseFloat(tokens.nextToken());
+		component.setBackground(new Color(red, green, blue, alpha));
+		}
+	else
+		component.setBackground(new Color(red, green, blue));
+	}
+
+public void dispose(StringTokenizer tokens)
+	{
+	window.dispose();
+	frame.dispose();
+	} 
+	
+public void setFont(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+		
+public void setToolTip(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void setTitledBorder(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void setBevelBorder(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void getBounds(StringTokenizer tokens)
+	{
+	int x, y, width, height;
+	
+	x = frame.getLocationOnScreen().x;
+	y = frame.getLocationOnScreen().y;
+		
+	width = frame.getWidth();
+	height = frame.getHeight();
+	
+	guiserver.out.println("( set 'gs:bounds '(" + x + " " + y + " " + width + " " + height + "))\n");
+	guiserver.out.flush();
+	}
+		
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/aButton.java b/guiserver/java/aButton.java
new file mode 100644
index 0000000..786fe62
--- /dev/null
+++ b/guiserver/java/aButton.java
@@ -0,0 +1,93 @@
+//
+//  aButton.java  
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/25/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import javax.swing.*;
+import java.util.*;
+
+public class aButton extends gsObject {
+
+AbstractButton abutton;
+
+public void setText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	abutton.setText(text);
+	}
+	
+public void appendText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	String oldtext = abutton.getText();
+	abutton.setText(oldtext + text);
+	}
+
+public void getText(StringTokenizer params)
+	{
+	String action = params.nextToken();
+	String text = abutton.getText();
+	if(text.length() == 0)
+		guiserver.out.println("(" + action + " \"" + id + "\")");
+	else
+		guiserver.out.println("(" + action + " \"" + id + "\" [text]" + Base64Coder.encodeString(text) + "[/text])");
+	guiserver.out.flush();
+	}
+
+public void clearText(StringTokenizer tokens)
+	{
+	abutton.setText("");
+	}
+	
+public void setIcon(StringTokenizer tokens)
+	{
+	String path = Base64Coder.decodeString(tokens.nextToken());
+	abutton.setIcon(guiserver.getIconFromPath(path, this.getClass()));
+	}
+	
+public void setPressedIcon(StringTokenizer tokens)
+	{	
+	String path = Base64Coder.decodeString(tokens.nextToken());
+	abutton.setPressedIcon(guiserver.getIconFromPath(path, this.getClass()));
+	}
+	
+public void setSelected(StringTokenizer tokens)
+	{
+	String target;
+	aButton thebutton;
+	
+	abutton.setSelected(tokens.nextToken().equals("true"));
+	
+	while(tokens.hasMoreTokens())
+		{
+		target = tokens.nextToken();
+		thebutton = (aButton)gsObject.widgets.get(target);
+		thebutton.abutton.setSelected(tokens.nextToken().equals("true"));
+		}
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/aTextWidget.java b/guiserver/java/aTextWidget.java
new file mode 100644
index 0000000..e5d3539
--- /dev/null
+++ b/guiserver/java/aTextWidget.java
@@ -0,0 +1,319 @@
+//
+//  aTextWidget.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 6/14/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.awt.*;
+import java.awt.event.*;
+import java.util.*;
+import javax.swing.*;
+import javax.swing.text.*;
+import java.io.UnsupportedEncodingException;
+
+public class aTextWidget extends gsObject {
+
+JTextComponent textcomp;
+JScrollPane areaScrollPane;
+boolean isScrollable;
+String findTextAction;
+	
+public void setText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	textcomp.setText(text);
+	//if(isScrollable) scrollUp();
+	}
+
+	
+public void appendText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	String oldtext = textcomp.getText();
+	int len = text.length() + oldtext.length();
+	if(len > 100000)
+			textcomp.setText((oldtext + text).substring(len - 100000));
+	else
+
+			textcomp.setText(oldtext + text);
+	if(isScrollable) scrollUp();
+	textcomp.repaint();
+	}
+	
+public void scrollUp()
+    {
+	// work around for Java bug #4201999
+	try {Thread.sleep(100); } catch (InterruptedException ie) {}
+	//textArea.setCaretPosition(textArea.getText().length() - 1);
+	JScrollBar vbar = areaScrollPane.getVerticalScrollBar();
+    vbar.setValue(vbar.getMaximum());
+    }
+	
+public void gotoText(StringTokenizer params)
+	{
+	int line = Integer.parseInt(params.nextToken());
+	int column = Integer.parseInt(params.nextToken());
+	
+	if(line < 1) line = 1;
+	line--;
+	
+	String text = textcomp.getText();
+	int len = text.length();
+	int pos = 0;
+	int col;
+
+	
+	for(int idx = 0; idx < line; idx++)
+		{
+		pos = text.indexOf("\n", pos) + 1;
+		if(pos >= len) break;
+		}
+		
+	for(col = 0; col < column; col++)
+		{
+		if(pos + col >= len) break;
+		if(text.charAt(pos + col) == '\n') break;
+		}
+		
+	textcomp.setCaretPosition(pos + col);
+	}
+
+public void clearText(StringTokenizer params)
+	{
+	textcomp.setText("");
+	}
+	
+public void getText(StringTokenizer params)
+	{
+	String string = textcomp.getText();
+	String text;
+	
+	if(guiserver.UTF8)
+		{
+		try {
+			byte[] utf8 = string.getBytes("UTF-8");
+			text = new String(utf8);
+			} 
+		catch (UnsupportedEncodingException e) 
+			{ 
+			System.out.println("errorconverting to UTF8");
+			text = string;
+			}
+		}
+	else
+		text = string;
+	
+	if(params.hasMoreTokens())
+		{
+		String action = params.nextToken();
+		if(text.length() == 0)
+			guiserver.out.println("(" + action + " \"" + id + "\")");
+		else
+			guiserver.out.println("(" + action + " \"" + id + "\" [text]" + Base64Coder.encodeString(text) + "[/text])");
+		}
+	else
+		{
+		if(text.length() == 0)
+			guiserver.out.println("(set 'gs:text nil)");
+		else
+			guiserver.out.println("(set 'gs:text (base64-dec [text]" + Base64Coder.encodeString(text) + "[/text]))");
+		}
+		
+	guiserver.out.flush();
+	}
+		
+public void getSelection(StringTokenizer params)
+	{
+	String action = params.nextToken();
+	String text = textcomp.getSelectedText();
+	if(text == null) text = "";
+	if(text.length() == 0)
+		guiserver.out.println("(" + action + " \"" + id + "\")");
+	else
+		guiserver.out.println("(" + action + " \"" + id + "\" [text]" + Base64Coder.encodeString(text) + "[/text])");
+	guiserver.out.flush();
+	}
+	
+public void getTextPosition(StringTokenizer tokens)
+	{
+	String text = textcomp.getText();
+	int caret = textcomp.getCaretPosition();
+	int line = 1;
+	int col = 1;
+	
+	for(int i= 0; i < caret; i++)
+		{
+		if(text.charAt(i) == '\n') 
+			{
+			col = 0;
+			++line;
+			}
+		++col;
+		}
+		
+	guiserver.out.println("(set 'gs:text-position '(" + line + " " + col + "))");
+	guiserver.out.flush();
+	}	
+	
+	
+public void setEditable(StringTokenizer tokens)
+	{
+	if(tokens.nextToken().equals("true"))
+		textcomp.setEditable(true);
+	else
+		textcomp.setEditable(false);
+	}
+	
+public void setCaret(StringTokenizer tokens)
+	{
+	int pos = Integer.parseInt(tokens.nextToken());
+	
+	if(pos > textcomp.getText().length())
+		pos = textcomp.getText().length();
+		
+	textcomp.setCaretPosition(pos);
+	textcomp.moveCaretPosition(pos);
+	}
+	
+public void selectText(StringTokenizer tokens)
+	{
+	int toPos;
+	
+	textcomp.setCaretPosition(Integer.parseInt(tokens.nextToken()));
+	if(tokens.hasMoreTokens())
+		toPos = Integer.parseInt(tokens.nextToken());
+	else
+		toPos = textcomp.getText().length();
+		
+	textcomp.moveCaretPosition(toPos);
+	}
+	
+public void copyText(StringTokenizer tokens)
+	{
+	textcomp.copy();
+	}
+
+public void cutText(StringTokenizer tokens)
+	{
+	textcomp.cut();
+	}
+	
+public void pasteText(StringTokenizer tokens)
+	{
+	if(tokens.hasMoreTokens())
+		textcomp.replaceSelection(Base64Coder.decodeString(tokens.nextToken()));
+	else
+		textcomp.paste();
+	}
+	
+public void insertText(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	String oldtext = textcomp.getText();
+	int newpos = Integer.parseInt(tokens.nextToken());
+	if(newpos > textcomp.getText().length()) newpos = textcomp.getText().length();
+	textcomp.setText(oldtext.substring(0, newpos) + text + oldtext.substring(newpos));
+	textcomp.update(textcomp.getGraphics());
+	}
+
+public void requestFocus(StringTokenizer tokens)
+	{
+	textcomp.requestFocus();
+	}
+
+public void setFont(StringTokenizer tokens)
+	{
+	String name = Base64Coder.decodeString(tokens.nextToken());
+	int style = 0;
+	int size = 12;
+	
+	if(tokens.hasMoreTokens())
+		size = Integer.parseInt(tokens.nextToken());
+	
+	while(tokens.hasMoreTokens())
+		{
+		String sstyle = tokens.nextToken();
+		if(sstyle.equals("plain")) style = style | Font.PLAIN;
+		if(sstyle.equals("bold")) style = style | Font.BOLD;
+		if(sstyle.equals("italic")) style = style | Font.ITALIC;
+		}
+		
+	Font font = new Font(name, style, size);
+	textcomp.setFont(font);
+	}
+
+
+public void registerMouseEvent(StringTokenizer tokens)
+	{
+	mouseEvent = tokens.nextToken();
+	jcomponent.addMouseListener(new MouseAdapter () {
+		public void mouseClicked(MouseEvent e) { mouseEventOut(e, "clicked"); }	
+		public void mousePressed(MouseEvent e) { mouseEventOut(e, "pressed"); }
+		public void mouseReleased(MouseEvent e) { mouseEventOut(e, "released"); }
+		});
+	}
+	
+private void mouseEventOut(MouseEvent e, String type)
+	{
+	guiserver.out.println("(" + mouseEvent + " \"" + id + "\" \"" + type + "\" " + e.getX() + " " + e.getY() + " " + 
+		e.getButton() + " " + e.getClickCount() + " " + e.getModifiers() + ")");
+	guiserver.out.flush();
+	}
+		
+public static String removeChar(String str, char ch) 
+		{
+		String result = "";
+		for (int i = 0; i < str.length(); i ++) 
+			{
+			if (str.charAt(i) != ch) 
+				result += str.charAt(i);
+			}
+		
+		return result;
+		}
+		
+public void setCaretColor(StringTokenizer tokens)
+	{
+	Float red = Float.parseFloat(tokens.nextToken());
+	Float green = Float.parseFloat(tokens.nextToken());
+	Float blue = Float.parseFloat(tokens.nextToken());
+		
+	textcomp.setCaretColor(new Color(red, green, blue));
+	}
+
+
+public void setSelectionColor(StringTokenizer tokens)
+	{
+	Float red = Float.parseFloat(tokens.nextToken());
+	Float green = Float.parseFloat(tokens.nextToken());
+	Float blue = Float.parseFloat(tokens.nextToken());
+	Float alpha = (float)1.0;
+	
+	if(tokens.hasMoreTokens())
+		alpha = Float.parseFloat(tokens.nextToken());
+		
+	textcomp.setSelectionColor(new Color(red, green, blue, alpha));
+	}
+
+}
+ 
+ 
+// eof //
diff --git a/guiserver/java/gsObject.java b/guiserver/java/gsObject.java
new file mode 100644
index 0000000..e61b776
--- /dev/null
+++ b/guiserver/java/gsObject.java
@@ -0,0 +1,844 @@
+//
+//  gsObject.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/19/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.awt.*;
+import java.awt.event.*;
+import java.awt.font.*;
+import javax.swing.*;
+import javax.swing.text.*;
+import javax.swing.border.*;
+import java.util.*;
+
+public class gsObject {
+
+static HashMap widgets = new HashMap();
+
+String id;
+String action;
+JComponent jcomponent = null;
+Container container = null;
+Component component = null;
+Dispatcher dispatch = null;
+String mouseEvent = null;
+String keyEvent = null;
+
+public void addTo(StringTokenizer tokens)
+	{
+	boolean isBorderLayout = (container.getLayout() instanceof LayoutBorder);
+	while(tokens.hasMoreTokens())
+		{
+		String comp = tokens.nextToken();
+		//System.out.println("adding: " + comp + " to: " + id);
+		gsObject gsobject = (gsObject)gsObject.widgets.get(comp);
+		Component compnt = gsobject.component;
+		if(isBorderLayout)
+			{
+			String direction = tokens.nextToken();
+			if(direction.equals("north")) container.add(compnt, BorderLayout.NORTH);
+			else if(direction.equals("west")) container.add(compnt, BorderLayout.WEST);
+			else if(direction.equals("center")) container.add(compnt, BorderLayout.CENTER);
+			else if(direction.equals("east")) container.add(compnt, BorderLayout.EAST);
+			else if(direction.equals("south")) container.add(compnt, BorderLayout.SOUTH);
+			else container.add(compnt, BorderLayout.CENTER);
+			}
+		else container.add(compnt);
+		}
+	}
+	
+public void removeFrom(StringTokenizer tokens)
+	{
+	String comp = tokens.nextToken();
+	gsObject gsobject = (gsObject)gsObject.widgets.get(comp);
+	Component compnt = gsobject.component;
+	container.remove(compnt);
+	container.update(container.getGraphics());
+	}
+	
+public void layout(StringTokenizer tokens)
+	{
+	container.validate();
+	}
+	
+public void getBounds(StringTokenizer tokens)
+	{
+	int x, y, width, height;
+	
+	x = component.getX();
+	y = component.getY();
+		
+	width = component.getWidth();
+	height = component.getHeight();
+	
+	guiserver.out.println("( set 'gs:bounds '(" + x + " " + y + " " + width + " " + height + "))\n");
+	guiserver.out.flush();
+	}
+	
+	
+public void loadText(StringTokenizer tokens)
+	{
+	}
+	
+public void saveText(StringTokenizer tokens)
+	{
+	}
+	
+public void setText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void appendText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void getText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void getSelection(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void clearText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void setCaret(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void selectText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void copyText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void cutText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void pasteText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void undoText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void undoEnable(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void redoText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void clearList(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void setVisible(StringTokenizer tokens)
+	{
+	if(tokens.nextToken().equals("true"))
+		component.setVisible(true);
+	else
+		component.setVisible(false);
+	}
+
+
+public void setResizable(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void setSize(StringTokenizer tokens)
+	{
+	int width = Integer.parseInt(tokens.nextToken());
+	int height = Integer.parseInt(tokens.nextToken());
+	component.setSize(new Dimension(width, height));
+	}
+	
+public void setPreferredSize(StringTokenizer tokens)
+	{
+	int width = Integer.parseInt(tokens.nextToken());
+	int height = Integer.parseInt(tokens.nextToken());
+	component.setPreferredSize(new Dimension(width, height));
+	}
+	
+public void Enable(StringTokenizer tokens)
+	{
+	gsObject gsobject;
+	
+	component.setEnabled(true);
+	
+	while(tokens.hasMoreTokens())
+		{
+		gsobject = (gsObject)gsObject.widgets.get(tokens.nextToken());
+		gsobject.component.setEnabled(true);
+		}
+	}
+	
+public void Disable(StringTokenizer tokens)
+	{
+	gsObject gsobject;
+	
+	component.setEnabled(false);
+
+	while(tokens.hasMoreTokens())
+		{
+		gsobject = (gsObject)gsObject.widgets.get(tokens.nextToken());
+		gsobject.component.setEnabled(false);
+		}
+	}
+	
+public void setToolTip(StringTokenizer tokens)
+	{
+	jcomponent.setToolTipText(Base64Coder.decodeString(tokens.nextToken()));
+	}
+	
+public void setEditable(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void setValue(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void setSelected(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void setTitledBorder(StringTokenizer tokens)
+	{
+	jcomponent.setBorder(BorderFactory.createTitledBorder(Base64Coder.decodeString(tokens.nextToken())));
+	}
+	
+public void setBevelBorder(StringTokenizer tokens)
+	{
+	int type = BevelBorder.RAISED;
+	
+	if(tokens.hasMoreTokens())
+		{
+		String stype = tokens.nextToken();		
+		if(stype.equals("lowered")) type = BevelBorder.LOWERED;
+		}
+	
+	jcomponent.setBorder(BorderFactory.createBevelBorder(type));
+	}
+	
+public void setIcon(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void setPressedIcon(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void messageDialog(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void confirmationDialog(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void ColorChooser(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void OpenFileChooser(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void SaveFileChooser(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void requestFocus(StringTokenizer tokens)
+	{
+	component.requestFocus();
+	}
+	
+public void setFont(StringTokenizer tokens)
+	{
+	String name = Base64Coder.decodeString(tokens.nextToken());
+	int style = 0;
+	int size = 12;
+	
+	if(tokens.hasMoreTokens())
+		size = Integer.parseInt(tokens.nextToken());
+	
+	while(tokens.hasMoreTokens())
+		{
+		String sstyle = tokens.nextToken();
+		if(sstyle.equals("plain")) style = style | Font.PLAIN;
+		if(sstyle.equals("bold")) style = style | Font.BOLD;
+		if(sstyle.equals("italic")) style = style | Font.ITALIC;
+		}
+		
+	Font font = new Font(name, style, size);
+	jcomponent.setFont(font);
+	}
+	
+public void getFontMetrics(StringTokenizer tokens)
+	{
+	String text = Base64Coder.decodeString(tokens.nextToken());
+	
+	FontMetrics fm = component.getFontMetrics(component.getFont());
+	
+	int width = fm.stringWidth(text);
+	int height = fm.getHeight();
+	
+	//System.out.println("width:" + width + " height:" + height);
+	
+	guiserver.out.println("(set 'gs:font-metrics '(" + width + " " + height + "))");
+	guiserver.out.flush();
+	}
+	
+public void setForeground(StringTokenizer tokens)
+	{
+	Float red = Float.parseFloat(tokens.nextToken());
+	Float green = Float.parseFloat(tokens.nextToken());
+	Float blue = Float.parseFloat(tokens.nextToken());
+	if(tokens.hasMoreTokens())
+		{
+		Float alpha = Float.parseFloat(tokens.nextToken());
+		jcomponent.setForeground(new Color(red, green, blue, alpha));
+		}
+	else
+		jcomponent.setForeground(new Color(red, green, blue));
+	}
+	
+public void setBackground(StringTokenizer tokens)
+	{
+	Float red = Float.parseFloat(tokens.nextToken());
+	Float green = Float.parseFloat(tokens.nextToken());
+	Float blue = Float.parseFloat(tokens.nextToken());
+	if(tokens.hasMoreTokens())
+		{
+		Float alpha = Float.parseFloat(tokens.nextToken());
+		jcomponent.setBackground(new Color(red, green, blue, alpha));
+		}
+	else
+		jcomponent.setBackground(new Color(red, green, blue));
+	}
+
+public void setCaretColor(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+
+public void setSyntax(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void setCursor(StringTokenizer tokens)
+	{
+	String shape = tokens.nextToken();
+	Cursor cursor = null;
+	
+	if(shape.equals("crosshair")) cursor = new Cursor(Cursor.CROSSHAIR_CURSOR);
+	else if(shape.equals("text")) cursor = new Cursor(Cursor.TEXT_CURSOR);
+	else if(shape.equals("wait")) cursor = new Cursor(Cursor.WAIT_CURSOR);
+	else if(shape.equals("sw-resize")) cursor = new Cursor(Cursor.SW_RESIZE_CURSOR);
+	else if(shape.equals("se-resize")) cursor = new Cursor(Cursor.SE_RESIZE_CURSOR);
+	else if(shape.equals("nw-resize")) cursor = new Cursor(Cursor.NW_RESIZE_CURSOR);
+	else if(shape.equals("ne-resize")) cursor = new Cursor(Cursor.NE_RESIZE_CURSOR);
+	else if(shape.equals("n-resize")) cursor = new Cursor(Cursor.N_RESIZE_CURSOR);
+	else if(shape.equals("s-resize")) cursor = new Cursor(Cursor.S_RESIZE_CURSOR);
+	else if(shape.equals("w-resize")) cursor = new Cursor(Cursor.W_RESIZE_CURSOR);
+	else if(shape.equals("e-resize")) cursor = new Cursor(Cursor.E_RESIZE_CURSOR);
+	else if(shape.equals("hand")) cursor = new Cursor(Cursor.HAND_CURSOR);
+	else if(shape.equals("move")) cursor = new Cursor(Cursor.MOVE_CURSOR);
+	else cursor = new Cursor(Cursor.DEFAULT_CURSOR);
+	
+	if(this instanceof WindowFrame || this instanceof WindowWidget)
+		component.setCursor(cursor);		
+	else
+		jcomponent.setCursor(cursor);
+	}
+	
+	
+public void dispose(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+
+public void insertTab(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+	
+public void removeTab(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void setAccelerator(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void addListItem(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void removeListItem(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void selectListItem(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void addSeparator(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void insertListItem(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void setTabSize(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void setTrace(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void setUTF8(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void setLookAndFeel(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void disposeSplash(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void getProperties(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void getScreen(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void getFonts(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void getVersion(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void getTextPosition(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void showPopup(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void findText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void gotoText(StringTokenizer params)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void frameCloseEvent(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void frameResizeEvent(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void frameMoveEvent(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+// 2D Graphics
+
+public void gsCanvas(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void g2Background(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void g2Font(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void g2Stroke(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void g2Paint(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void g2Export(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void g2Print(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void g2Translation(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void g2Scale(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}		
+	
+public void g2Transform(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void g2Rotation(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+
+public void g2Composite(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void g2Clip(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}	
+	
+public void createLine(StringTokenizer tokens)
+	{	
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void drawLine(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void drawRectangle(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void fillRectangle(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void drawRoundRect(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void fillRoundRect(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void drawEllipse(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void fillEllipse(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void drawCircle(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void fillCircle(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void drawArc(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void fillArc(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void drawPolygon(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void fillPolygon(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void drawPath(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void drawText(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void registerMouseEvent(StringTokenizer tokens)
+	{
+	mouseEvent = tokens.nextToken();
+	component.addMouseListener(new MouseAdapter () {
+		public void mouseClicked(MouseEvent e) { mouseEventOut(e, "clicked"); }	
+		public void mousePressed(MouseEvent e) { mouseEventOut(e, "pressed"); }
+		public void mouseReleased(MouseEvent e) { mouseEventOut(e, "released"); }
+		});
+	}
+	
+public void registerKeyEvent(StringTokenizer tokens)
+	{
+	keyEvent = tokens.nextToken();
+	component.addKeyListener(new KeyAdapter () {
+		public void keyTyped(KeyEvent e) { keyEventOut(e, "typed"); }
+		public void keyPressed(KeyEvent e) { keyEventOut(e, "pressed"); }
+		public void keyReleased(KeyEvent e) { keyEventOut(e, "released"); }
+		});
+	}
+	
+public void registerMouseEntered(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void registerMouseExited(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void registerMousePressed(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void registerMouseReleased(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void registerMouseClicked(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void registerMouseDragged(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void registerMouseMoved(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void registerMouseWheelMoved(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void setAntiAliasing(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void deleteTaggedShape(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void moveTaggedShape(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void	translateTaggedShape(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void rotateTaggedShape(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void scaleTaggedShape(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void shearTaggedShape(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void hideTaggedShape(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void orderTaggedShapes(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void showTaggedShape(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+public void colorTaggedShape(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void update(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void drawImage(StringTokenizer tokens) 
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+private void mouseEventOut(MouseEvent e, String type)
+	{
+	guiserver.out.println("(" + mouseEvent + " \"" + id + "\" \"" + type + "\" " + e.getX() + " " + e.getY() + " " + 
+		e.getButton() + " " + e.getClickCount() + " " + e.getModifiers() + ")");
+	guiserver.out.flush();
+	}
+	
+private void keyEventOut(KeyEvent e, String type)
+	{
+	guiserver.out.println("(" + keyEvent + " \"" + id + "\" \"" + type + "\" " + 
+			e.getKeyCode() + " " + e.getModifiers() + ")");
+	guiserver.out.flush();
+	}
+	
+public void runShell(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void evalShell(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+	
+public void destroyShell(StringTokenizer tokens)
+	{
+	ErrorDialog.wrongApplication(Dispatcher.cmd, id);
+	}
+
+}
+
+// eof
+ 
+ 
+// eof //
diff --git a/guiserver/java/guiserver.java b/guiserver/java/guiserver.java
new file mode 100644
index 0000000..754f44e
--- /dev/null
+++ b/guiserver/java/guiserver.java
@@ -0,0 +1,339 @@
+//
+//  guiserver.java
+//  guiserver
+//
+//  Created by Lutz Mueller on 5/10/07.
+//
+//
+//    Copyright (C) 2007 Lutz Mueller
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU General Public License as published by
+//    the Free Software Foundation, either version 3 of the License, or
+//    (at your option) any later version.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU General Public License for more details.
+//
+//    You should have received a copy of the GNU General Public License
+//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+
+
+import java.lang.*;
+import java.lang.reflect.*;
+import java.awt.*;
+import java.awt.event.*;
+import java.awt.font.*;
+import java.util.*;
+import java.io.*;
+import java.net.*;
+import javax.swing.*;
+
+@SuppressWarnings("unchecked") 
+public class guiserver extends gsObject
+	{
+	static BufferedReader in;
+	static PrintWriter out;
+	static boolean listening = true;
+	static boolean debug = false;
+	static boolean MAC_OS_X;
+	static boolean UTF8 = true;
+	static boolean DOUBLE_BUFFERING = true;
+	static boolean connected = false;
+	static SplashWindow splash = null;
+	static Frame frame = null;
+	static double version = 1.15;
+
+    public static void main (String args[]) throws IOException, InterruptedException 
+		{
+		int portIn = 64001;
+		int portOut = 64002;
+		String host = null;
+		String tkn = null;
+		String osName;
+		Socket socket = null;
+		String splashImagePath = null;
+		
+		osName = System.getProperty("os.name");
+		MAC_OS_X = osName.toLowerCase().startsWith("mac os x");
+
+		System.out.println("newLISP-GS v." + version + " on " + osName);
+	
+		if(args.length == 3) splashImagePath = args[2];
+		
+		// put splash screen first
+		if(splashImagePath != null)
+			{
+			frame = new Frame();
+			MediaTracker mt = new MediaTracker(frame);
+			Image splashImage = guiserver.getImageFromPath(splashImagePath, frame.getClass());
+			mt.addImage(splashImage, 0);
+			try { mt.waitForID(0); } catch(InterruptedException ie) {}
+			splash = new SplashWindow(frame, splashImage);
+			}
+			
+		gsObject gsobject = new guiserver(new StringTokenizer("System"));
+		
+		if(args.length >= 1) 
+			portIn = Integer.parseInt(args[0]);
+		
+		portOut = portIn + 1;
+			
+		if(args.length >= 2)
+			execCommand("newlisp " + args[1] + " " + portIn + " javastart &");
+			
+		// open listener and connection to remote
+		System.out.println(" listening on " + portIn);
+		ServerSocket ssocket = new ServerSocket(portIn);
+		Socket client = ssocket.accept();
+		host = ssocket.getInetAddress().getHostAddress();
+		System.out.println(" accepted connection from " + host);
+		in = new BufferedReader(new InputStreamReader(client.getInputStream()));
+		ssocket.close();
+		
+		//System.out.println("->" + System.getProperty("line.separator").length());
+		System.setProperty("line.separator", "\n");
+		
+		System.out.println(" connecting to " + host + ":" + portOut);
+		
+		int count = 0;
+		while(connected == false)
+		{
+			try { socket = new Socket(host, portOut); connected = true; } catch (IOException ioe)
+				{
+				Thread.sleep(100);
+				if(count == 30)
+					{
+					System.out.println(" server could not connect to " + host + ":" + portOut);
+					System.exit(1);
+					}
+				count = count + 1;
+				System.out.println(" retrying to connect");
+				continue;
+				}
+		}
+		
+		out = new PrintWriter(new OutputStreamWriter(socket.getOutputStream()));
+		System.out.println("server connected");
+		
+		Dispatcher.init();
+		
+		String cmd = null;
+		try {
+			while(listening)
+				{
+				cmd = in.readLine();
+				if(cmd == null) { System.out.println("server shutdown"); System.exit(0); }   
+				if(debug) Dispatcher.dispatch(cmd);
+				else
+					{
+					try { Dispatcher.dispatch(cmd);	}
+					catch (Exception e)	{ ErrorDialog.show(cmd, "Missing argument or item not found"); }
+					}
+				}
+			} catch (IOException IOexc) { System.out.println("server shutdown"); System.exit(0); }
+		}
+
+	public static void disposeSplash()
+		{
+		if(splash != null) splash.dispose();
+		if(frame != null) frame.dispose();
+		}
+		
+	public static void execCommand(String command) throws IOException
+		{
+		String s;
+		
+		
+		System.out.println("guiserver starting newLISP \"" + command + "\"");
+		Process p = Runtime.getRuntime().exec(command);
+/*
+		BufferedReader stdInput = new BufferedReader(new 
+                 InputStreamReader(p.getInputStream()));
+
+		BufferedReader stdError = new BufferedReader(new 
+                 InputStreamReader(p.getErrorStream()));
+
+            // read the output from the command
+            while ((s = stdInput.readLine()) != null) {
+                System.out.println(s);
+            }
+            
+            // read any errors from the attempted command
+            while ((s = stdError.readLine()) != null) {
+                System.out.println(s);
+            }
+*/
+		System.out.println("guiserver finished exec");
+		}
+		
+		
+	public static Image getImageFromPath(String path,  Class cls)
+		{
+		if(path.startsWith("/local/"))
+			return(Toolkit.getDefaultToolkit().getImage(cls.getClass().getResource("/images" + path.substring(6))));
+		else
+			return(Toolkit.getDefaultToolkit().getImage(path));
+		}
+
+	public static ImageIcon getIconFromPath(String path, Class cls)
+		{
+		if(path.startsWith("/local/"))
+			return(new ImageIcon(Toolkit.getDefaultToolkit().getImage(cls.getClass().getResource("/images" + path.substring(6)))));
+		else
+			return(new ImageIcon(path));
+		}
+	
+		
+	public guiserver(StringTokenizer tokens)
+		{
+		id = tokens.nextToken();
+		
+		gsObject.widgets.put(id, this);
+		
+		if(MAC_OS_X) 
+			{
+			macOSXRegistration();
+			guiserver.DOUBLE_BUFFERING = false; // not necessary on OX X
+			}
+		else
+			{
+			GraphicsEnvironment ge = GraphicsEnvironment.getLocalGraphicsEnvironment();
+			GraphicsDevice gd = ge.getDefaultScreenDevice();
+			GraphicsConfiguration gc = gd.getDefaultConfiguration();
+			BufferCapabilities bufCap = gc.getBufferCapabilities();
+			if(bufCap.isPageFlipping())
+				System.out.println(" double buffering supported.");
+			else
+				System.out.println(" double buffering not supported.");
+
+			try { UIManager.setLookAndFeel(UIManager.getSystemLookAndFeelClassName()); } 
+			catch( Exception ex ) { }
+			}
+		}
+
+
+// System object methods
+public void setTrace(StringTokenizer tokens)
+	{
+	if(tokens.nextToken().equals("true"))
+			guiserver.debug = true;
+		else
+			guiserver.debug = false;
+	}	
+
+public void setLookAndFeel(StringTokenizer tokens)
+	{
+	try { 
+		UIManager.setLookAndFeel(tokens.nextToken()); } 
+	catch(Exception ex) {
+		ErrorDialog.show("set-look-and-feel", "Could not set look and feel");}
+	}	
+	
+public void disposeSplash(StringTokenizer tokens)
+	{
+	if(splash != null) splash.dispose();
+	if(frame != null) frame.dispose();
+	}	
+	
+public void getScreen(StringTokenizer tokens)
+	{
+	Toolkit tk = Toolkit.getDefaultToolkit();
+	
+	double screenW = tk.getScreenSize().getWidth();
+	double screenH = tk.getScreenSize().getHeight();
+	int screenRes = tk.getScreenResolution();
+	
+	guiserver.out.println("(set 'gs:screen '(" + screenW + " " + screenH + " " + screenRes + "))\n");
+	guiserver.out.flush();
+	}
+	
+public void getFonts(StringTokenizer tokens)
+	{
+	GraphicsEnvironment ge = GraphicsEnvironment.getLocalGraphicsEnvironment();
+	String[] fontNames = ge.getAvailableFontFamilyNames();
+	
+	guiserver.out.print("(set 'gs:fonts '( ");
+	for(int i = 0; i < fontNames.length; i++)
+		guiserver.out.print("\"" + Base64Coder.encodeString(fontNames[i]) + "\" ");
+	guiserver.out.println(")) ");
+	guiserver.out.flush();
+	}	
+	
+	
+public void getVersion(StringTokenizer tokens)
+	{
+	guiserver.out.println("(set 'gs:version " + guiserver.version + ")\n");
+	guiserver.out.flush();
+	}
+	
+public void setSyntaxColors(StringTokenizer tokens)
+	{
+	SyntaxHighlighter.setSyntaxColors(tokens);
+	}
+	
+public void playSound(StringTokenizer tokens)
+	{
+	SoundSystem.playSound(Base64Coder.decodeString(tokens.nextToken()));
+	}
+
+public void setUTF8(StringTokenizer tokens)
+	{
+	if(tokens.nextToken().equals("true"))
+		guiserver.UTF8 = true;
+	else
+		guiserver.UTF8 = false;
+	}
+
+	
+// Mac OS X specific methods
+
+	public void macOSXRegistration() {
+		if (MAC_OS_X) {
+			try {		
+				OSXAdapter.registerMacOSXApplication(this);
+				OSXAdapter.enablePrefs(true);
+			} catch (Exception e) {
+				System.err.println("Exception while loading the OSXAdapter:");
+				e.printStackTrace();
+			}
+		}
+	}
+
+	public void about() 
+		{
+		gsObject gsobject = (gsObject)gsObject.widgets.get("AboutDialog");
+		if(gsobject != null && (gsobject instanceof WindowFrame))
+			((DialogWidget)gsobject).jdialog.setVisible(true);			
+		else
+			JOptionPane.showMessageDialog(null, 
+				"Software: copyright (c) 2007 Lutz Mueller http://newlisp.org\n" +
+				"Icons: copyright (c) 2007 Michael Michaels http://neglook.com\nAll rights reserved.", 
+				"About newLISP-GS v." + version, JOptionPane.PLAIN_MESSAGE,
+				getIconFromPath("/local/newLISP64.png", this.getClass()));
+   		}
+	
+	public void preferences() 
+		{ 
+		gsObject gsobject = (gsObject)gsObject.widgets.get("PreferencesDialog");
+		if(gsobject != null && (gsobject instanceof WindowFrame))
+			((DialogWidget)gsobject).jdialog.setVisible(true);
+		}
+	
+	public void quit() 
+		{
+		int option = JOptionPane.showConfirmDialog(null, 
+			"Are you sure you want to quit?\nPossibility of losing unsaved content.", "Quit?", JOptionPane.YES_NO_OPTION);
+		if (option == JOptionPane.YES_OPTION) 
+			System.exit(0);
+		}
+	}
+	
+	
+// the end
+ 
+ 
+// eof //
diff --git a/guiserver/java/java b/guiserver/java/java
new file mode 100644
index 0000000..7cb82e3
--- /dev/null
+++ b/guiserver/java/java
@@ -0,0 +1,4 @@
+TextPaneWidget.java: 		      if (e instanceof HTMLFrameHyperlinkEvent) {
+gsObject.java:	boolean isBorderLayout = (container.getLayout() instanceof LayoutBorder);
+guiserver.java:		if(gsobject != null && (gsobject instanceof WindowFrame))
+guiserver.java:		if(gsobject != null && (gsobject instanceof WindowFrame))
diff --git a/guiserver/mouse-demo.lsp b/guiserver/mouse-demo.lsp
new file mode 100644
index 0000000..3af8840
--- /dev/null
+++ b/guiserver/mouse-demo.lsp
@@ -0,0 +1,75 @@
+#!/usr/bin/newlisp
+;;
+;; mouse-demo.lsp - demonstrate mouse handlers and gs:delete-tag
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+(set 'colors (list gs:black gs:blue gs:cyan gs:darkGray gs:gray 
+				gs:green gs:lightGray gs:magenta gs:orange gs:pink gs:red gs:yellow))
+
+;;;; describe the GUI
+(gs:frame 'MouseDemo 100 100 640 640 "Canvas Demo")
+(gs:canvas 'MyCanvas 'MouseDemo)
+(gs:add-to 'MouseDemo 'MyCanvas)
+(gs:set-background 'MyCanvas gs:white)
+(gs:mouse-pressed 'MyCanvas 'mouse-pressed-action true)
+(gs:mouse-released 'MyCanvas 'mouse-released-action true)
+(gs:mouse-clicked 'MyCanvas 'mouse-clicked-action true)
+(gs:mouse-moved 'MyCanvas 'mouse-moved-action)
+(gs:mouse-dragged 'MyCanvas 'mouse-dragged-action)
+(gs:mouse-wheel 'MyCanvas 'mouse-wheel-action)
+(gs:set-anti-aliasing true)
+(println (time-of-day))
+(for (row 0 620 20)
+	(for (col 0 620 20)
+		(let (r (rand (length colors)))
+			(gs:fill-rect (string "R" r) col row 20 20 (colors r))
+		)
+	)
+)
+(println (time-of-day))
+(gs:set-visible 'MouseDemo true)
+
+;; define actions
+
+(define (mouse-pressed-action x y button modifiers tags)
+	(gs:set-text 'MouseDemo 
+		(string "pressed row: " (/ y 20) " col:" (/ x 20) " button: " button " key:" modifiers " tags:" tags))
+)
+
+(define (mouse-released-action x y button modifiers tags)
+	(gs:set-text 'MouseDemo 
+		(string "released row: " (/ y 20) " col:" (/ x 20) " button: " button " key:" modifiers " tags:" tags))
+)
+
+(define (mouse-clicked-action x y button cnt modifiers tags)
+	(gs:set-text 'MouseDemo 
+		(string "clicked row: " (/ y 20) " col:" (/ x 20) 
+			" button: " button " count:" cnt " key:" modifiers " tags:" tags))
+	(if tags (gs:delete-tag (tags 0)))
+)
+
+(define (mouse-moved-action x y)
+	(gs:set-text 'MouseDemo 
+		(string "moved row: " (/ y 20) " col:" (/ x 20)))
+)
+
+(define (mouse-dragged-action x y button modifiers)
+	(gs:set-text 'MouseDemo 
+		(string "dragged row: " (/ y 20) " col:" (/ x 20) " button: " button " key:" modifiers))
+)
+
+(define (mouse-wheel-action x y wheel)
+	(gs:set-text 'MouseDemo 
+		(string "cursor row: " (/ y 20) " col:" (/ x 20) " wheel: " wheel))
+)
+
+;;;; listen for incoming action requests and dispatch
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/move-resize-demo.lsp b/guiserver/move-resize-demo.lsp
new file mode 100644
index 0000000..e98eec3
--- /dev/null
+++ b/guiserver/move-resize-demo.lsp
@@ -0,0 +1,42 @@
+#!/usr/bin/newlisp
+;;
+; move-resize-demo.lsp - demonstrate gs:window-moved and hs:window-resized events
+
+;;;; initialization
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+;(gs:set-trace true)
+
+;;;; describe the GUI
+(gs:frame 'EventDemo 100 100 300 100 "Move or resize window")
+(gs:set-border-layout 'EventDemo)
+(gs:label 'Position "")
+(gs:label 'Size "")
+(gs:set-font 'Position "Mono Spaced" 24 "bold")
+(gs:set-foreground 'Position 0 0 0.5 )
+(gs:set-font 'Size "Mono Spaced" 24 "bold")
+(gs:set-foreground 'Size 0 0 0.5 )
+
+(gs:add-to 'EventDemo 'Position "north")
+(gs:add-to 'EventDemo 'Size "south")
+
+(gs:window-moved 'EventDemo 'move-action)
+(gs:window-resized 'EventDemo 'resize-action)
+
+;;;; define actions
+
+(define (move-action id x y)
+	(gs:set-text 'Position (string "Position " x ":" y)))
+
+(define (resize-action id width height)
+	(gs:set-text 'Size (string "Size " width ":" height)))
+
+
+(gs:set-visible 'EventDemo true)
+
+;;;; listen for incoming action requests and dispatch
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/newlisp-edit.lsp b/guiserver/newlisp-edit.lsp
new file mode 100644
index 0000000..9ccb3d9
--- /dev/null
+++ b/guiserver/newlisp-edit.lsp
@@ -0,0 +1,1405 @@
+#!/usr/bin/newlisp
+
+; newlisp-edit.lsp - multiple tab LISP editor and support for running code from the editor
+
+; version 1.10
+
+;(set 'debug-on true) ; special debug for aux communications
+
+(set-locale "C")
+
+;;;; initialization
+(set 'newlispDir (env "NEWLISPDIR"))
+
+(set 'newlispDoc (if (= ostype "Win32") 
+	newlispDir "/usr/share/doc/newlisp"))
+
+(load (string newlispDir "/guiserver.lsp"))
+
+(constant (global '$HOME) (or (env "HOME") (env "USERPROFILE") (env "DOCUMENT_ROOT") ""))
+(constant '$TEMP (if (= ostype "Win32") (or (env "TEMP") "C:\\temp") "/tmp"))
+
+(if (= ostype "Win32")
+	(begin
+		(set 'userSettingsDir (string
+			(or (env "APPDATA") (env "HOME") (env "USERPROFILE") (env "DOCUMENT_ROOT")) "/newLISP"))
+		(set 'userSettingsPath (append userSettingsDir "/newlisp-edit.config"))
+		(set 'recentFilesPath (append userSettingsDir "/newlisp-edit-recent"))
+		(if (not (directory userSettingsDir)) (make-dir userSettingsDir))
+	)
+	(begin
+		(set 'userSettingsPath (append $HOME "/.newlisp-edit.conf"))
+		(set 'recentFilesPath (append $HOME "/.newlisp-edit-recent"))
+	)
+)
+
+;; init guiserver
+
+(gs:init) 
+;(gs:set-trace true)
+
+
+;; create default user settings
+
+(gs:get-screen)
+(set 'config:currentAppWidth 800)
+(set 'config:currentAppHeight (- (gs:screen 1) 80))
+(set 'config:currentAppX (/ (- (gs:screen 0) config:currentAppWidth) 3))
+(set 'config:currentAppY (/ (- (gs:screen 1) config:currentAppHeight) 2))
+(set 'config:currentForeground '(0.0 0.0 0.2))
+(set 'config:currentBackground '(1.0 1.0 1.0))
+(set 'config:currentDir $HOME)
+(set 'config:currentFontName (if (= ostype "Win32") "Monospaced" "Lucida Sans Typewriter"))
+(set 'config:currentFontSize (if (= ostype "Win32") 14 13))
+(set 'config:currentMonitorFontSize (if (= ostype "Win32") 14 13))
+(set 'config:currentToolbarFloatable "no")
+(set 'config:currentTabsize 16)
+(set 'config:currentTabsPosition "top")
+(set 'config:currentToolbarShow "yes")
+(set 'config:currentThemeIdx 0)
+(set 'config:currentAltShell "")
+(set 'config:currentMonitorForeground '(0.1 0.1 0.5))
+(set 'config:currentMonitorBackground '(0.95 0.95 0.95))
+
+;; configure themes
+
+; background, foreground, caret, selection
+; comments, keywords, strings
+; numebers, quoted, parentheses
+
+(set 'config:currentThemes '(
+	("Mozart" (1 1 1) (0 0 0) (0.5 0.5 0.8) (0.7 0.7 1.0)
+		(0.5 0.5 0.5) (0 0 0.75)	(0 0.5 0.0)	
+		(0.50 0.5 0)	(0.350 0.350 0.50)	(0.50 0 0))
+
+	("Herrmann" (0.3242 0.3984 0.4648) (0.6875 0.6992 0.5781) (0.918 0.4961 0.1016) (0.2773 0.3164 0.4258)
+		(0.5 0.5781 0.597)	(0.125 0.2031 0.332)	(0.5547 0.6562 0.6562)	
+		(0.8203 0.6055 0.1953)	(0.8203 0.6055 0.1953)	(0.125 0.2031 0.332))
+
+	("Shostakovich" (0.2 0.2 0.2) (0.9 0.9 0.9) (0.7 0.7 0.7) (0.8 0.8 1.0)
+		(0.6 0.6 0.6)	(0.9 0.9 0.3) (0.4 0.9 0.4) 
+		(0.75 0.75 0.95) (0.5 0.5 0.9) (1.0 0.3 0.3))
+))
+
+;; initialize script list
+(set 'config:currentScripts 
+	(list 
+		(list "Word count" (string newlispDir "/guiserver/word-count.lsp") "content")
+		(list "Uppercase" (string newlispDir "/guiserver/uppercase.lsp") "selection" "F4")
+))
+
+;; menu-item handler for themes
+(define (theme-handler id)
+  ; extract theme index from id string and extract theme from list
+	(letn ( (idx (int (9 id))) (T (config:currentThemes idx)) )
+		(gs:set-background currentEdit (T 1))
+		(set 'currentBackground (T 1))
+		(gs:set-foreground currentEdit (T 2))
+		(set 'currentForeground (T 2))
+		(gs:set-caret-color currentEdit (T 3))
+		(gs:set-selection-color currentEdit (T 4))
+		(gs:set-syntax-colors (T 5) (T 6) (T 7) (T 8) (T 9) (T 10))
+		(gs:set-syntax currentEdit currentSyntaxStatus)
+		(gs:set-selected 'ViewSyntax (true? currentSyntaxStatus))
+		(set 'currentThemeIdx idx)
+		(dotimes (i (length config:currentThemes))
+			(gs:enable (string "ViewTheme" i)))
+		(gs:disable (string "ViewTheme" idx))
+	)
+)
+
+(define (current-file-syntax)
+	(cond
+		((ends-with currentFile ".lsp") "lsp")
+		((ends-with currentFile ".c") "c")
+		((ends-with currentFile ".cpp") "cpp")
+		((ends-with currentFile ".h") "cpp")
+		((ends-with currentFile ".java") "java")
+		((ends-with currentFile ".php") "php")
+		(true nil)
+	)
+)
+
+;; script-handler, saves current edit tab to a temporary file
+;; and passes the file name as an argument to the script
+;; scripts are registered in the settings file
+;; scripts must exit or newlisp-edit will hang.
+(define (script-handler id)
+	(letn ( (idx (int (10 id))) (S (config:currentScripts idx)))
+		(set 'currentScriptFile (S 1))
+		(if (file? currentScriptFile)
+			(begin
+				(set 'currentScriptMode (S 2))
+				(if (= currentScriptMode "selection")
+					(gs:get-selected-text currentEdit 'script-execute)
+				; else "content"
+    			(gs:get-text currentEdit 'script-execute))
+			)
+			(output-monitor (string "--- could not find script " currentScriptFile " ---\n"))
+		)
+	)
+)
+
+(define (script-execute id text)
+	(if (not text) (set 'text "===="))
+	(let (file (string $TEMP "/" (uuid)))
+		(if (= ostype "Win32")
+			(write-file file (replace "\n" (base64-dec text) "\r\n"))
+			(write-file file (base64-dec text)))
+		(if (= ostype "Win32")
+			(catch (exec (string {newlisp.exe "} currentScriptFile {" } file " > " (string file "out"))) 'result)
+			(catch (exec (string "/usr/bin/newlisp " currentScriptFile " " file)) 'result)
+		)
+		(if (list? result)
+			(begin
+				(set 'result (if (= ostype "Win32")
+					(read-file (string file "out"))
+ 					(join result "\n")))
+				(if (= currentScriptMode "selection")
+					(paste-action result)
+					(if (= ostype "Win32")
+						(output-monitor result)
+						(output-monitor (string result "\n")))
+				)
+			)
+			(output-monitor result)
+		)
+		(if (= ostype "Win32") (delete-file (string file "out")))
+		(delete-file file)
+	)
+)
+
+
+
+;; if newlisp-edit.config exists load user-settings
+(if (file? userSettingsPath) 
+	(if (not (catch (load userSettingsPath) 'result))
+		(set 'loadUserSettingsError result))
+	(if (not (catch (save userSettingsPath 'config) 'result))
+		(set 'loadUserSettingsError result))
+)
+
+(if (not	(catch (load recentFilesPath) 'result))
+	(set 'recentFiles '()))
+
+(set 'currentAppX config:currentAppX)
+(set 'currentAppY config:currentAppY)
+(set 'currentAppWidth config:currentAppWidth)
+(set 'currentAppHeight config:currentAppHeight)
+(set 'currentForeground config:currentForeground)
+(set 'currentBackground config:currentBackground)
+(set 'currentDir config:currentDir)
+(set 'currentFile "Untitled.lsp")
+(set 'currentFontName config:currentFontName)
+(set 'currentFontSize config:currentFontSize)
+(set 'currentMonitorFontSize config:currentMonitorFontSize)
+(set 'currentToolbarFloatable config:currentToolbarFloatable)
+(set 'currentTabsPosition config:currentTabsPosition)
+(set 'currentToolbarShow config:currentToolbarShow)
+(set 'currentThemeIdx config:currentThemeIdx)
+(set 'currentAltShell config:currentAltShell)
+(set 'currentMonitorForeground config:currentMonitorForeground)
+(set 'currentMonitorBackground config:currentMonitorBackground)
+
+(set 'currentPath (string currentDir "/" currentFile))
+(set 'currentSyntaxStatus "lsp")
+
+
+;(gs:set-look-and-feel "com.sun.java.swing.plaf.motif.MotifLookAndFeel")
+;(gs:set-look-and-feel "javax.swing.plaf.metal.MetalLookAndFeel")
+;(gs:set-look-and-feel "com.sun.java.swing.plaf.windows.WindowsLookAndFeel")
+;(gs:set-look-and-feel "javax.swing.plaf.mac.MacLookAndFeel")
+;(gs:set-look-and-feel "com.sun.java.swing.plaf.gtk.GTKLookAndFeel")
+
+(define (start-newlisp-shell)
+	(if (= ostype "Win32")
+		(gs:run-shell 'OutputArea (string newlispDir "/newlisp.exe -C -w " $HOME))
+		(gs:run-shell 'OutputArea (string "/usr/bin/newlisp -C -w " $HOME))
+	)
+)
+
+(define (startshell-handler)
+	(gs:run-shell 'OutputArea currentAltShell)
+)
+
+;;;; describe the GUI ;;;;;;;;;;;;;;;;;;;;;;;
+
+(gs:frame 'TheEditor currentAppX currentAppY currentAppWidth currentAppHeight "newLISP edit")
+(gs:frame-closed 'TheEditor 'quitbutton-handler)
+
+(set 'default-currentFontName currentFontName)
+
+(gs:set-border-layout 'TheEditor 0 0)
+(gs:tool-bar 'ToolBar (= currentToolbarFloatable "yes"))
+(gs:set-flow-layout 'ToolBar "left" 18 5)
+(gs:image-button 'NewButton 'newbutton-handler "/local/new32.png" "/local/new-down32.png")
+(gs:image-button 'ClearButton 'clearbutton-handler "/local/clear32.png" "/local/clear-down32.png")
+(gs:image-button 'LoadButton 'loadbutton-handler "/local/folder-opened32.png" "/local/folder-opened-down32.png")
+(gs:image-button 'SaveButton 'savebutton-handler "/local/save32.png" "/local/save-down32.png")
+(gs:image-button 'CutButton 'cutbutton-handler "/local/cut32.png" "/local/cut-down32.png")
+(gs:image-button 'CopyButton 'copybutton-handler "/local/copy32.png" "/local/copy-down32.png")
+(gs:image-button 'PasteButton 'pastebutton-handler "/local/paste32.png" "/local/paste-down32.png")
+(gs:image-button 'FindButton 'findbutton-handler "/local/search32.png" "/local/search-down32.png")
+(gs:image-button 'ExecButton 'process-or-execbutton-handler "/local/run32.png" "/local/run-down32.png")
+(gs:image-button 'RestartButton 'start-newlisp-shell "/local/restart32.png" "/local/restart-down32.png")
+(gs:image-button 'FontBookButton 'fontbookbutton-handler "/local/font-book32.png" "/local/font-book-down32.png")
+(gs:set-tool-tip 'NewButton "Open a new tab")
+(gs:set-tool-tip 'LoadButton  "Load file into editor")
+(gs:set-tool-tip 'SaveButton "Save file in editor")
+(gs:set-tool-tip 'ClearButton "Clear editor panel")
+(gs:set-tool-tip 'CutButton "Cut selection to clipboard")
+(gs:set-tool-tip 'CopyButton "Copy selection to clipboard")
+(gs:set-tool-tip 'PasteButton "Paste from clipboard")
+(gs:set-tool-tip 'FindButton "Find")
+
+(gs:set-tool-tip 'ExecButton "Run editor content")
+(gs:set-tool-tip 'RestartButton "Restart auxiliary newLISP process")
+(gs:set-tool-tip 'FontBookButton "Select editor font")
+
+(gs:add-to 'ToolBar 'NewButton 'LoadButton 'SaveButton)
+(gs:add-separator 'ToolBar)
+(gs:add-to 'ToolBar 'ClearButton 'CutButton 'CopyButton 'PasteButton)
+(gs:add-separator 'ToolBar)
+(gs:add-to 'ToolBar 'FindButton)
+(gs:add-separator 'ToolBar)
+(gs:add-to 'ToolBar 'ExecButton 'RestartButton)
+(gs:add-separator 'ToolBar)
+(gs:add-to 'ToolBar 'FontBookButton)
+
+(gs:panel 'FontPanel 46 18)
+(gs:set-grid-layout 'FontPanel 1 3)
+(gs:label 'FontSmallerLabel "A" "center")
+(gs:label 'FontSizeLabel (string currentFontSize) "center")
+(gs:label 'FontBiggerLabel "A" "center")
+(gs:set-tool-tip 'FontSizeLabel "Font size" "right")
+(gs:set-font 'FontSmallerLabel "Lucida Sans Regular" 10 "italic")
+(gs:set-font 'FontSizeLabel "Lucida Sans Regular" 10 "plain")
+(gs:set-font 'FontBiggerLabel "Lucida Sans Regular" 13 "italic")
+(gs:add-to 'FontPanel 'FontSmallerLabel 'FontSizeLabel 'FontBiggerLabel)
+
+(gs:add-to 'ToolBar 'FontPanel)
+
+(gs:mouse-event 'FontBiggerLabel 'fontpanel-event)
+(gs:mouse-event 'FontSmallerLabel 'fontpanel-event)
+
+(gs:set-tool-tip 'FontBiggerLabel "Bigger font")
+(gs:set-tool-tip 'FontSmallerLabel "Smaller font")
+
+;; disable Cut- and Copy- buttons until selection is make
+;; SaveButton util content in EditArea
+(gs:disable 'CutButton 'CopyButton 'SaveButton)
+
+(if (= currentToolbarShow "yes")
+	(gs:add-to 'TheEditor 'ToolBar "north"))
+
+(set 'tabs-stack '())
+
+;; configure text area
+(define (make-editor-tab dir file-name)
+	(let (edit-tab (append "tab-" (uuid)) )
+		(push (list edit-tab dir file-name (list true 0 0)) tabs-stack -1)
+		(gs:text-pane edit-tab 'editarea-handler "text/plain")
+		(gs:mouse-event edit-tab 'editarea-mouse-handler)
+		(gs:set-foreground edit-tab currentForeground)
+		(gs:set-background edit-tab currentBackground) 
+		(gs:set-tab-size edit-tab config:currentTabsize)
+		(gs:set-font edit-tab currentFontName currentFontSize "plain")
+	edit-tab)
+)
+
+(set 'currentDot 0 'currentMark 0)
+(set 'edit-buffer-clean true)
+(set 'currentEdit (make-editor-tab currentDir currentFile))
+(gs:set-syntax currentEdit (ends-with currentFile ".lsp"))
+(set 'currentTabIndex 0)
+(gs:set-text 'TheEditor (string "newLISP edit - " currentPath))
+
+(set 'editUndoCount 0)
+
+(gs:tabbed-pane 'EditorTabs 'editortabs-handler currentTabsPosition
+	currentEdit "Untitled.lsp")
+
+(gs:set-icon 'EditorTabs "/local/green10.png" currentTabIndex)
+
+; configure output area
+(gs:text-area 'OutputArea 'gs:no-action)
+(gs:set-background 'OutputArea currentMonitorBackground)
+(gs:set-foreground 'OutputArea currentMonitorForeground)
+(gs:set-font 'OutputArea "Monospaced" currentMonitorFontSize "plain")
+(gs:split-pane 'TextPanel "horizontal" 0.70 0.5 5)
+(gs:add-to 'TextPanel 'EditorTabs 'OutputArea)
+(gs:add-to 'TheEditor  'TextPanel "center")
+
+;; configure main menu
+(gs:menu 'FileMenu "File")
+(gs:menu-item 'FileClear 'clearbutton-handler "Clear tab" true)
+(gs:menu-item 'FileNew 'newbutton-handler "New tab")
+(gs:menu-item 'FileOpen 'loadbutton-handler "Open ...")
+(gs:menu-item 'FileClose 'fileclose-handler "Close tab")
+(gs:menu-item 'FileSave 'savebutton-handler "Save")
+(gs:menu-item 'FileSaveAs 'saveasbutton-handler "Save As ...")
+(gs:menu-item 'FileSettings 'savesettings-handler "Save Settings")
+(gs:menu-item 'FileQuit 'quitbutton-handler (if (= ostype "Win32") "Exit" "Quit"))
+
+(gs:menu 'FileRecent "Recent Files")
+
+
+(if recentFiles (dolist (f recentFiles)
+	(if (file? (f 1))
+		(begin
+			(gs:menu-item (f 0) 'recentfiles-handler (f 1))
+			(gs:add-to 'FileRecent (f 0)))
+		(replace f recentFiles))
+))
+
+(gs:menu 'EditMenu "Edit")
+(gs:menu-item 'EditUndo 'undo-handler "Undo")
+(gs:menu-item 'EditRedo 'redo-handler "Redo")
+(gs:menu-item 'EditCut 'cutbutton-handler "Cut")
+(gs:menu-item 'EditCopy 'copybutton-handler "Copy")
+(gs:menu-item 'EditPaste 'pastebutton-handler "Paste")
+(gs:menu-item 'EditGoto 'goto-handler "Goto Line")
+(gs:menu-item 'EditPosition 'position-handler "Get Position")
+(gs:menu-item 'EditGotoEditor 'switchwindow-handler "Goto Editor")
+(gs:menu-item 'EditGotoShell 'switchwindow-handler "Goto Shell")
+(gs:menu-item 'EditFind 'findbutton-handler "Find")
+(gs:menu-item 'EditFindNext 'findtextnext-action "Find next")
+(gs:menu-item 'EditFindPrevious 'findtextprevious-action "Find Previous")
+(gs:menu-item 'EditReplace 'findtextreplace-action "Replace Selection")
+;(gs:menu-item 'EditReplaceNext 'findtextreplace-action "Replace Next")
+(gs:menu-item 'EditFindDispose 'finddispose-handler "Find Dispose")
+
+(gs:menu-popup 'EditMenuPopup "Edit")
+(gs:menu-item 'EditCutP 'cutbutton-handler "Cut")
+(gs:menu-item 'EditCopyP 'copybutton-handler "Copy")
+(gs:menu-item 'EditPasteP 'pastebutton-handler "Paste")
+
+(gs:menu 'ViewMenu "View")
+(gs:menu-item 'ViewClearMonitor 'viewclearmonitor-handler "Clear monitor")
+(gs:menu-item-check 'ViewToolbar 'viewtoolbar-handler "Toolbar" (= currentToolbarShow "yes"))
+(gs:menu-item-check 'ViewSyntax 'viewsyntax-handler "Syntax coloring" true)
+(dolist (T config:currentThemes)
+	(gs:menu-item (string "ViewTheme" $idx) 'theme-handler (T 0)))
+(gs:menu-item 'ViewFontBook 'fontbookbutton-handler "Font faces ...")
+(gs:menu-item 'ViewFontSmaller 'viewfontsmaller-handler "Font smaller")
+(gs:menu-item 'ViewFontBigger 'viewfontbigger-handler "Font bigger")
+
+(gs:menu 'ToolMenu "Tools")
+(gs:menu-item 'ToolEditSettings 'tooleditsettings-handler "Edit Settings")
+(dolist (T config:currentScripts)
+	(gs:menu-item (string "ToolScript" $idx) 'script-handler (T 0))
+	(if (= 4 (length T)) 
+		(gs:set-accelerator (string "ToolScript" $idx) (T 3)))
+)
+
+(gs:menu 'HelpMenu "Help")
+(gs:menu-item 'HelpAbout 'helpabout-handler "About newLISP-GS")
+(gs:menu-item 'HelpManual 'helpmanual-handler "newLISP Manual and Reference")
+(gs:menu-item 'HelpDemos 'opendemos-handler "Open Demo Folder")
+(gs:menu-item 'HelpGuiserver 'helpguiserver-handler "GS Manual")
+
+(gs:menu 'RunMenu "Run")
+(gs:menu-item 'RunRun 'process-or-execbutton-handler "Run")
+(gs:set-icon 'RunRun "/local/run16.png")
+(gs:menu-item 'RunRestart 'start-newlisp-shell "Restart")
+(gs:menu-item 'RunShell 'startshell-handler "Alternate shell")
+
+(gs:menu-popup 'SyntaxMenu "Syntax")
+(gs:menu-item 'SyntaxNewlisp 'syntaxmenu-handler "newLISP syntax")
+(gs:menu-item 'SyntaxC 'syntaxmenu-handler "C syntax")
+(gs:menu-item 'SyntaxCPP 'syntaxmenu-handler "C++ syntax")
+(gs:menu-item 'SyntaxJava 'syntaxmenu-handler "Java syntax")
+(gs:menu-item 'SyntaxPHP 'syntaxmenu-handler "PHP syntax")
+(gs:add-to 'SyntaxMenu 'SyntaxNewlisp 'SyntaxC 'SyntaxCPP 'SyntaxJava 'SyntaxPHP)
+
+(if (= ostype "OSX")
+	(begin ;; MacOS X keyboard
+		(gs:set-accelerator 'FileClear "shift meta N")
+		(gs:set-accelerator 'FileNew "meta N")
+		(gs:set-accelerator 'FileOpen "meta O")
+		(gs:set-accelerator 'FileClose "meta W")
+		(gs:set-accelerator 'FileSave "meta S")
+		(gs:set-accelerator 'FileSaveAs "shift meta S")
+		(gs:set-accelerator 'EditUndo "meta Z")
+		(gs:set-accelerator 'EditRedo "shift meta Z")
+		(gs:set-accelerator 'EditCut "meta X")
+		(gs:set-accelerator 'EditCopy "meta C")
+		(gs:set-accelerator 'EditPaste "meta V")
+		(gs:set-accelerator 'EditGoto "meta L")
+		(gs:set-accelerator 'EditPosition "shift meta L")
+		(gs:set-accelerator 'EditGotoEditor "meta 1")
+		(gs:set-accelerator 'EditGotoShell "meta 2")
+		(gs:set-accelerator 'EditFind "meta F")
+		(gs:set-accelerator 'EditFindDispose "meta D")
+		(gs:set-accelerator 'EditFindPrevious "shift meta G")
+		(gs:set-accelerator 'EditFindNext "meta G")
+		(gs:set-accelerator 'EditReplace "meta J")
+;		(gs:set-accelerator 'EditReplaceNext "shift meta J")
+		(gs:set-accelerator 'RunRun "meta R")
+		(gs:set-accelerator 'RunRestart "shift meta R")
+		(gs:set-accelerator 'ViewClearMonitor "meta M")
+		(gs:set-accelerator 'ViewFontBook "meta T")
+		(gs:set-accelerator 'ViewFontSmaller "meta MINUS")
+		(gs:set-accelerator 'ViewFontBigger "shift meta EQUALS")
+		(gs:set-accelerator 'ViewSyntax "meta Y")
+	)
+	(begin ;; PC keyboard 
+		(gs:set-accelerator 'FileClear "ctrl N")
+		(gs:set-accelerator 'FileNew "shift ctrl N")
+		(gs:set-accelerator 'FileOpen "ctrl O")
+		(gs:set-accelerator 'FileClose "ctrl W")
+		(gs:set-accelerator 'FileSave "ctrl S")
+		(gs:set-accelerator 'FileSaveAs "shift ctrl S")
+		(gs:set-accelerator 'EditUndo "ctrl Z")
+		(gs:set-accelerator 'EditRedo "shift ctrl Z")
+		(gs:set-accelerator 'EditCopy "ctrl C")
+		(gs:set-accelerator 'EditCut "ctrl X")
+		(gs:set-accelerator 'EditPaste "ctrl V")
+		(gs:set-accelerator 'EditGoto "alt L")
+		(gs:set-accelerator 'EditPosition "shift alt L")
+		(gs:set-accelerator 'EditGotoEditor "alt 1")
+		(gs:set-accelerator 'EditGotoShell "alt 2")
+		(gs:set-accelerator 'EditFind "ctrl F")
+		(gs:set-accelerator 'EditFindPrevious "shift ctrl G")
+		(gs:set-accelerator 'EditFindNext "ctrl G")
+		(gs:set-accelerator 'EditFindDispose "ctrl D")
+		(gs:set-accelerator 'EditReplace "ctrl J")
+;		(gs:set-accelerator 'EditReplaceNext "shift ctrl J")
+		(gs:set-accelerator 'RunRun "alt R")
+		(gs:set-accelerator 'RunRestart "shift alt R")
+		(gs:set-accelerator 'ViewClearMonitor "ctrl M")
+		(gs:set-accelerator 'ViewFontBook "ctrl T")
+		(gs:set-accelerator 'ViewFontSmaller "ctrl MINUS")
+		(gs:set-accelerator 'ViewFontBigger "ctrl EQUALS")
+		(gs:set-accelerator 'ViewSyntax "alt Y")
+	)
+)
+
+;; disable Save and SaveAs until content in EditArea
+(gs:disable 'FileSave 'FileSaveAs)
+;; disable Cut and Copy menu items until selection is made
+(gs:disable 'EditUndo 'EditRedo 'EditCut 'EditCutP 'EditCopy 'EditCopyP)
+;; disable various find dialog options until dialog is up first
+(gs:disable 'EditFindPrevious 'EditFindNext 'EditReplace 'EditFindDispose)
+;; disable monitor clear until something is in it
+;(gs:disable 'ViewClearMonitor)
+
+; File menu
+(gs:add-to 'FileMenu 'FileClear 'FileNew 'FileClose)
+(gs:add-separator 'FileMenu)
+(gs:add-to 'FileMenu 'FileRecent)
+(gs:add-separator 'FileMenu)
+(gs:add-to 'FileMenu 'FileOpen 'FileSave 'FileSaveAs)
+(gs:add-separator 'FileMenu)
+(gs:add-to 'FileMenu 'FileSettings)
+(gs:add-separator 'FileMenu)
+(gs:add-to 'FileMenu 'FileQuit)
+
+; Edit menun
+(gs:add-to 'EditMenu 'EditUndo 'EditRedo)
+(gs:add-separator 'EditMenu)
+(gs:add-to 'EditMenu 'EditCut 'EditCopy 'EditPaste)
+(gs:add-separator 'EditMenu)
+(gs:add-to 'EditMenu 'EditGoto 'EditPosition 'EditGotoEditor 'EditGotoShell)
+(gs:add-separator 'EditMenu)
+(gs:add-to 'EditMenu 'EditFind 'EditFindNext 'EditFindPrevious 'EditReplace)
+(gs:add-separator 'EditMenu)
+(gs:add-to 'EditMenu 'EditFindDispose)
+(gs:disable 'EditFindDispose)
+; edit area popup
+(gs:add-to 'EditMenuPopup 'EditCutP 'EditCopyP 'EditPasteP)
+
+; View menu
+(gs:add-to 'ViewMenu 'ViewClearMonitor)
+(gs:add-separator 'ViewMenu)
+(gs:add-to 'ViewMenu 'ViewToolbar 'ViewSyntax)
+(gs:add-separator 'ViewMenu)
+(dolist (T config:currentThemes)
+	(gs:add-to 'ViewMenu (string "ViewTheme" $idx)))
+(gs:add-separator 'ViewMenu)
+(gs:add-to 'ViewMenu 'ViewFontBook 'ViewFontSmaller 'ViewFontBigger)
+
+(if (empty? currentAltShell)
+	(gs:add-to 'RunMenu 'RunRun 'RunRestart)
+	(gs:add-to 'RunMenu 'RunRun 'RunRestart 'RunShell))
+
+; Tool menu
+(gs:add-to 'ToolMenu 'ToolEditSettings)
+(gs:add-separator 'ToolMenu)
+(dolist (T config:currentScripts)
+	(gs:add-to 'ToolMenu (string "ToolScript" $idx)))
+
+; Help menu
+;; manuals are not added to Help on Win32 because open browser
+;; prevents newlisp-edit/guiserever.jar from exiting
+(if (= ostype "Win32")
+	(begin
+		(gs:add-to 'HelpMenu 'HelpDemos)
+		(gs:add-separator 'HelpMenu)
+		(gs:add-to 'HelpMenu 'HelpAbout))
+	(begin
+		(gs:add-to 'HelpMenu 'HelpManual 'HelpGuiserver)
+		(gs:add-separator 'HelpMenu)
+		(gs:add-to 'HelpMenu 'HelpDemos)
+		(if (!= ostype "OSX")
+			(begin
+			(gs:add-separator 'HelpMenu)
+			(gs:add-to 'HelpMenu 'HelpAbout)
+))))
+
+(gs:menu-bar 'TheEditor 'FileMenu 'EditMenu 'RunMenu 'ViewMenu 'ToolMenu 'HelpMenu)
+
+(gs:set-visible 'TheEditor true)
+(gs:dispose-splash)
+
+; start auxiliary shell newLISP process for evaluation of edit area in OutputArea
+(start-newlisp-shell)
+
+(gs:request-focus currentEdit) ; set focus on editarea
+
+; check if user settings where loaded succesfully
+(if loadUserSettingsError
+	(gs:message-dialog 'TheEditor (string "Problem loading: " userSettingsPath ".")
+		loadUserSettingsError "warning")
+)
+
+;;;; define actions
+
+(define (clear-current-tab)
+	(gs:clear-text currentEdit)
+	(set 'currentDir $HOME)
+	(set 'currentFile "Untitled.lsp")
+	(set 'currentPath (string currentDir "/" currentFile))
+	(set 'currentDot 0 'currentMark 0)
+	(update-current-tab)
+	(gs:disable 'SaveButton 'CutButton 'CopyButton 'FileSave 'EditCut 'EditCutP 'EditCopy 'EditCopyP)
+	(gs:set-icon 'EditorTabs "/local/green10.png" currentTabIndex)
+	(gs:set-text 'EditorTabs currentFile currentTabIndex)
+	(gs:set-text 'TheEditor (string "newLISP edit - " currentPath))
+)
+		
+(define (fileclose-handler)
+	(if (not edit-buffer-clean)
+		(gs:confirm-dialog 'TheEditor 'fileclose-action "Close file tab" 
+			(string "Abandon unsaved " currentFile "?") "yes-no")
+		(fileclose-action 'TheEditor 0)
+	)	
+)
+
+(define (fileclose-action id result)
+	(if (= result 0)
+		(if (> (length tabs-stack) 1)
+			(begin
+				(gs:remove-tab 'EditorTabs currentTabIndex)
+				(replace-assoc currentEdit tabs-stack)
+				(if (= currentTabIndex (length tabs-stack)) ; it was the right most tab
+					(dec 'currentTabIndex)
+					(begin ; its was not the most roght which was removed
+						(set 'currentEdit (first (tabs-stack currentTabIndex)))
+						(switch-to-tab currentEdit)
+					)
+				)
+			)
+			(clear-current-tab)
+		)
+	)
+)
+
+(define (newbutton-handler)
+	(update-current-tab)
+	(set 'currentDir $HOME)
+	(set 'currentFile "Untitled.lsp")
+	(set 'currentPath (string currentDir "/" currentFile))
+	(set 'currentDot 0 'currentMark 0)
+	(set 'edit-buffer-clean true)
+	(set 'currentEdit (make-editor-tab currentDir currentFile))
+	(gs:insert-tab 'EditorTabs currentEdit currentFile (length tabs-stack))
+	(gs:request-focus 'EditorTabs (length tabs-stack))
+	(gs:request-focus currentEdit) ; set focus in edit area
+	(theme-handler (string "ViewTheme" currentThemeIdx))
+)
+
+(define (recentfiles-handler id)
+	(update-current-tab)
+	(let (file (lookup id recentFiles))
+		(if (not (file? file))
+			(gs:message-dialog 'TheEditor "Loading file" (append "Cannot find: " file))
+			(begin
+				(set 'currentPath (lookup id recentFiles))
+				(open-currentpath-in-tab)
+			)
+		)
+	)
+)
+
+(define (loadbutton-handler id)
+	(gs:open-file-dialog 'TheEditor 'openfile-action  currentDir 
+		".lsp .c .h .txt .java .htm .html .css .php .pl .py .rb .lisp .el .cl .cpp .tcl .config" 
+		"Various text formats")
+)
+
+(define (openfile-action id  op file)
+	(if file
+		(begin
+			(update-current-tab)
+			(set 'currentPath (base64-dec file))
+			(open-currentpath-in-tab)
+		)
+	)
+)
+
+(define (open-currentpath-in-tab)
+	(set 'currentDir (join (chop (parse currentPath {\\|/} 0)) "/" ))
+	(set 'currentFile (last (parse currentPath {\\|/} 0)))
+	(set 'currentEdit (make-editor-tab currentDir currentFile))
+	(set 'edit-buffer-clean true)
+	(set 'currentDot 0 'currentMark 0)
+	(gs:insert-tab 'EditorTabs currentEdit currentFile (length tabs-stack))
+	(gs:request-focus 'EditorTabs (length tabs-stack))
+	(gs:request-focus currentEdit) ; set focus in edit area
+	(gs:set-cursor currentEdit "wait")
+
+	(gs:set-text 'TheEditor (string "newLISP edit - " currentPath))
+	(gs:enable 'FileSaveAs)
+
+	(gs:load-text currentEdit currentPath)
+	(set 'currentSyntaxStatus (current-file-syntax))
+	(theme-handler (string "ViewTheme" currentThemeIdx))
+	(gs:set-cursor currentEdit "default")
+)
+
+(define (savebutton-handler id)
+	(if (= currentFile "Untitled.lsp")
+		(saveasbutton-handler id)
+		(savefile-action id op (base64-enc currentPath) true)
+	)
+)
+
+(define (saveasbutton-handler id) 
+	(gs:save-file-dialog 'TheEditor 'savefile-action currentDir currentFile)
+)
+
+(define (savefile-action id op file no-check)
+	(set 'save-file-candidate file)
+	(if file (if no-check 
+		(writefile-prepare file)
+		(begin
+			(if (file? (base64-dec file))
+				(gs:confirm-dialog 'TheEditor 'confirmsave-action "Save As ..." 
+					(append "Overwrite " (base64-dec file) "?") "yes-no-cancel")
+				(writefile-prepare file)
+			)
+		))
+	)
+)
+
+(define (confirmsave-action id result)
+	(if (= result 0) 
+		(writefile-prepare save-file-candidate))
+	(if (= result 1)
+		(saveasbutton-handler 'FileSaveAs))
+)	
+
+(define (writefile-prepare file)
+	(set 'currentPath (base64-dec file))
+	(set 'currentDir (join (chop (parse currentPath {\\|/} 0)) "/" ))
+	(set 'currentFile (last (parse currentPath {\\|/} 0)))
+
+	(gs:set-text 'TheEditor (string "newLISP edit - " currentPath))
+	(gs:set-text 'EditorTabs currentFile currentTabIndex)
+	(gs:disable 'FileSave 'SaveButton)
+	(gs:set-icon 'EditorTabs "/local/green10.png" currentTabIndex)
+	(set 'edit-buffer-clean true)
+
+	(gs:get-text currentEdit 'writefile-action)
+)
+
+(define (writefile-action id text)
+	(local (bytes)
+		(if text
+			(if (= ostype "Win32")
+				(set 'bytes (write-file currentPath (replace "\n" (base64-dec text) "\r\n")))
+				(set 'bytes (write-file currentPath (base64-dec text)) ) ))
+		(save-recent-list)
+		(if (not bytes)
+			(gs:message-dialog 'TheEditor "Saving file" (append "Could not save " currentPath))
+			(output-monitor (string "--- " bytes " bytes saved to " currentPath " ---\n"))
+		)
+	)
+)
+
+(define (save-recent-list)
+	(if (ref currentPath recentFiles)
+		(push (pop recentFiles (first (ref currentPath recentFiles))) recentFiles)
+		(push (list (uuid) currentPath) recentFiles))
+	(set 'recentFiles (0 12 recentFiles))
+	(save recentFilesPath 'recentFiles)
+)
+
+(define (savesettings-handler)
+	(pretty-print 256) ; force one lone line for themes
+	(gs:get-bounds 'TheEditor)
+	(set 'currentAppX (gs:bounds 0))
+	(set 'currentAppY (gs:bounds 1))
+	(set 'currentAppWidth (gs:bounds 2))
+	(set 'currentAppHeight (gs:bounds 3))
+	(set 'config:currentAppX currentAppX)
+	(set 'config:currentAppY currentAppY)
+	(set 'config:currentAppWidth currentAppWidth)
+	(set 'config:currentAppHeight currentAppHeight)
+	(set 'config:currentForeground currentForeground)
+	(set 'config:currentBackground currentBackground)	
+	(set 'config:currentDir currentDir)
+	(set 'config:currentFontName currentFontName)
+	(set 'config:currentFontSize currentFontSize)
+	(set 'config:currentMonitorFontSize currentMonitorFontSize)
+	(set 'config:currentToolbarFloatable currentToolbarFloatable)
+	(set 'config:currentTabsPosition currentTabsPosition)
+	(set 'config:currentToolbarShow currentToolbarShow)
+	(set 'config:currentThemeIdx currentThemeIdx)
+	(set 'config:currentThemeHelp
+			{background foreground caret selection comments keywords strings numbers quoted parentheses})
+	(set 'config:currentAltShell currentAltShell)
+	(set 'config:currentMonitorForeground currentMonitorForeground)
+	(set 'config:currentMonitorBackground currentMonitorBackground)
+	(save userSettingsPath 'config)
+	(output-monitor 
+		(string "--- saved settings in: " userSettingsPath " ---\n"))
+)
+
+(define (tooleditsettings-handler)
+	(set 'currentPath userSettingsPath)
+	(open-currentpath-in-tab)
+)
+
+(define (opendemos-handler)
+	(gs:open-file-dialog 'TheEditor 'openfile-action  (string newlispDir "/guiserver")
+		".lsp" "newLISP files")
+)
+
+(define (quitbutton-handler)
+	(let (is-clean-tabs true)
+		(dolist (tab tabs-stack)
+			(if (not (tab 3 0)) (set 'is-clean-tabs nil)))
+		(if (and is-clean-tabs edit-buffer-clean)
+			(gs:confirm-dialog 'TheEditor 'quitconfirm-action
+				"Quit newLISP edit" "You really want to quit?" "yes-no")
+			(gs:confirm-dialog 'TheEditor 'quitconfirm-action
+				"Quit newLISP edit" "Quit and lose unsaved content?" "yes-no")
+		)
+	)
+)
+
+(define (quitconfirm-action id result)
+	(if (= result 0) 
+		(begin
+			;(println "destroying shell")
+			(gs:destroy-shell 'OutputArea)
+			(exit))
+	)
+)
+
+(define (clearbutton-handler)
+	(if (not edit-buffer-clean)
+		(gs:confirm-dialog 'TheEditor 'clearconfirm-action 
+			"New edit" (string "Abandon unsaved content in " currentFile) "yes-no")
+		(clearbutton-action)
+	)
+)
+
+(define (clearconfirm-action id result)
+	(if (= result 0)
+		(clearbutton-action))
+)
+
+(define (clearbutton-action)
+	(set 'currentPath (string currentDir "/" currentFile))
+	(gs:set-text 'TheEditor (string "newLISP edit - " currentPath))
+	(gs:clear-text currentEdit)
+	(gs:set-icon 'EditorTabs "/local/green10.png" currentTabIndex)
+	(set 'edit-buffer-clean true)
+	(gs:disable 'SaveButton 'FileSave))
+
+(define (undo-handler)
+	(gs:undo-text currentEdit ))
+
+(define (redo-handler)
+	(gs:redo-text currentEdit))
+
+(define (copybutton-handler)
+	(gs:copy-text currentEdit))
+
+(define (cutbutton-handler)
+	(gs:enable 'FileSave 'FileSaveAs 'SaveButton)
+	(gs:set-icon 'EditorTabs "/local/red10.png" currentTabIndex)
+	(set 'edit-buffer-clean nil)
+	(gs:cut-text currentEdit)
+	(gs:request-focus 'CutButton))
+
+(define (pastebutton-handler)
+	(paste-action))
+
+(define (paste-action text)
+	(gs:enable 'FileSave 'FileSaveAs 'SaveButton)
+	(gs:set-icon 'EditorTabs "/local/red10.png" currentTabIndex)
+	(set 'edit-buffer-clean nil)
+	(gs:paste-text currentEdit text))
+
+;; goto line
+
+(define (goto-handler)
+	(gs:dialog 'GotoDialog 'TheEditor "Goto Line" 200 60 nil nil)
+	(gs:set-resizable 'GotoDialog nil)
+	(gs:set-flow-layout 'GotoDialog "center")
+	(gs:label 'GotoTextLabel "Line:")
+	(gs:text-field 'GotoTextField 'gotoline-action 4)
+	(gs:button 'GotoButton 'gotogettext-action "Goto")
+	(gs:add-to 'GotoDialog 'GotoTextLabel 'GotoTextField 'GotoButton)
+	(gs:set-visible 'GotoDialog true)
+)
+
+(define (gotoline-action id text)
+	(if text
+		(let (line (int (base64-dec text) 0))
+			(gs:goto-text currentEdit line 0))	)
+	(gs:dispose 'GotoDialog)
+	(gs:request-focus currentEdit)
+)
+
+(define (gotogettext-action)
+	(gs:get-text 'GotoTextField 'gotoline-action)
+)
+
+(define (position-handler)
+	(gs:get-text-position currentEdit)
+	(output-monitor (string "--- line: " (gs:text-position 0) " column: " (gs:text-position 1) " ---\n"))
+)
+
+(define (switchwindow-handler id)
+	(if (= id "MAIN:EditGotoEditor")
+		(gs:request-focus currentEdit)
+		(gs:request-focus 'OutputArea))
+)
+
+;;;;;;;;;;;;; find text ;;;;;;;;;;;;;;;
+
+(define (findbutton-handler)
+	(if findDialogOpen 
+		(begin
+			(gs:request-focus 'FindTextField)
+			(gs:select-text 'FindTextField 0))
+		(openFindDialog)
+	)
+)
+
+(define (openFindDialog)
+	(gs:dialog 'FindDialog 'TheEditor "Find text" 420 200 nil nil)
+	(gs:set-resizable 'FindDialog nil)
+	(gs:frame-closed 'FindDialog 'finddialogclose-handler)
+	(gs:set-grid-layout 'FindDialog 4 1)
+	
+	(gs:panel 'FindPanel)
+	(gs:label 'FindTextLabel "Find:")
+	(gs:text-field 'FindTextField 'findtextnext-action 24)
+	(gs:add-to 'FindPanel 'FindTextLabel 'FindTextField)
+	
+	(gs:panel 'ReplacePanel)
+	(gs:label 'FindReplaceLabel "Replace:")
+	(gs:text-field 'FindReplaceField 'findtextnext-action 24)
+	(gs:add-to 'ReplacePanel 'FindReplaceLabel 'FindReplaceField)
+	(if (not (null? currentSearchText)) (gs:set-text 'FindTextField currentSearchText))
+	(if (not (null? currentReplaceText)) (gs:set-text 'FindReplaceField currentReplaceText))
+
+	(gs:panel 'ButtonPanel-1)
+	(gs:button 'FindTextPreviousButton 'findtextprevious-action "Previous")
+	(gs:button 'FindTextNextButton 'findtextnext-action "Next")
+	(gs:button 'FindTextReplaceButton 'findtextreplace-action "Replace")
+	(gs:add-to 'ButtonPanel-1 'FindTextPreviousButton 'FindTextNextButton 'FindTextReplaceButton)
+	(gs:panel 'ButtonPanel-2)
+	(gs:button 'FindTextReplaceNextButton 'findtextreplacenext-action "Replace and Next")
+	(gs:button 'FindTextUndoPrevButton 'findtextundoprev-action "Undo Previous")
+	(gs:add-to 'ButtonPanel-2 'FindTextReplaceNextButton 'FindTextUndoPrevButton)
+
+	(gs:set-tool-tip 'FindTextPreviousButton "Find previous occurrence of the find text")
+	(gs:set-tool-tip 'FindTextNextButton "Find next occurrence of the find text")
+	(gs:set-tool-tip 'FindTextReplaceButton "Replace selected text with replacement text")
+	(gs:set-tool-tip 'FindTextReplaceNextButton "Replace next occurence")
+	(gs:set-tool-tip 'FindTextUndoPrevButton "Undo previous replacement")
+
+	(gs:add-to 'FindDialog 'FindPanel 'ReplacePanel 'ButtonPanel-1 'ButtonPanel-2)
+	(gs:set-visible 'FindDialog true)
+	(gs:disable 'FindTextReplaceButton 'FindTextReplaceNextButton 'FindTextUndoPrevButton)
+	(gs:enable 'EditFindPrevious 'EditFindNext 'EditReplace 'EditFindDispose)
+	(gs:select-text 'FindTextField 0)
+	(set 'findDialogOpen true)
+)
+
+(define (finddispose-handler)
+	(gs:dispose 'FindDialog)
+	(gs:disable 'EditFindDispose)
+	(set 'findDialogOpen nil)
+)
+
+(define (finddialogclose-handler id)
+	(gs:enable 'FindButton 'EditFind)
+	(gs:disable 'EditFindDispose)
+	(set 'findDialogOpen nil)
+)
+
+(define (findtextcheckbox-action id flag)
+	(println id " " flag)
+)
+
+;; find next, this handler is enterd first by all
+;; FindDialog events, text-field(s) and button(s)
+
+(define (findtextnext-action id text)
+	(if (and (or (= id "MAIN:FindTextField") (= id "MAIN:FindReplaceField")) (not text)) 
+		(finddispose-handler) ; ESC key was pressed
+		(begin
+			(set 'currentSearchDirection "next")
+			(gs:get-text 'FindTextField 'getfindtext-action)
+		)
+	)
+)
+
+;; find previous
+
+(define (findtextprevious-action)
+	(set 'currentSearchDirection "previous")
+	(gs:get-text 'FindTextField 'getfindtext-action)
+)
+
+
+;; retrieve search field text
+
+(define (getfindtext-action id text)
+	(if text
+		(begin
+			(set 'currentSearchText (base64-dec text))
+			(gs:get-text 'FindReplaceField 'getreplacetext-action)
+		)
+		(gs:request-focus currentEdit)
+	)
+)
+
+;; rertrieve replace field text
+
+(define (getreplacetext-action id text)
+	(set 'currentReplaceText (if text (base64-dec text) ""))
+	(if (not (null? currentSearchText))
+		(gs:find-text currentEdit currentSearchText 'findtextresult-action currentSearchDirection))
+)
+
+(define (findtextresult-action id result)
+	(if (= result -1)
+		(begin
+			(gs:set-text 'FindDialog "Not found")
+			(gs:disable 'FindTextReplaceNextButton)
+			(when (and (= currentDot currentMark) (= currentSearchDirection "next"))
+				(set 'currentMark (inc 'currentDot))
+				(gs:set-caret currentEdit currentMark)
+			)
+		)
+		(begin
+			(gs:set-text 'FindDialog "Find text")
+			(gs:enable 'FindTextReplaceButton 'FindTextReplaceNextButton)
+			(gs:request-focus currentEdit)
+		)
+	)
+)
+
+;; replace
+
+(define (findtextreplace-action)
+	(gs:undo-enable currentEdit nil)
+	(if (!= currentMark currentDot)
+		(gs:paste-text currentEdit currentReplaceText))
+	;(gs:request-focus currentEdit)
+	(gs:disable 'FindTextReplaceButton 'FindTextReplaceNextButton)
+	(gs:enable 'FindTextUndoPrevButton)
+	(gs:set-icon 'EditorTabs "/local/red10.png" currentTabIndex)
+	(set 'edit-buffer-clean nil)
+	(gs:enable 'FileSave 'FileSaveAs 'SaveButton 'EditUndo)
+	(gs:undo-enable currentEdit true)
+)
+	
+;; replace and next
+
+(define (findtextreplacenext-action)
+	(gs:undo-enable currentEdit nil)
+	(gs:paste-text currentEdit currentReplaceText)
+	(gs:disable 'FindTextReplaceButton)
+	(gs:enable 'FindTextReplaceNextButton 'FindTextUndoPrevButton)
+	(gs:set-icon 'EditorTabs "/local/red10.png" currentTabIndex)
+	(set 'edit-buffer-clean nil)
+	(gs:enable 'FileSave 'FileSaveAs 'SaveButton 'EditUndo)
+	(set 'currentSearchDirection "next")
+	(gs:get-text 'FindTextField 'getfindtext-action)
+	(gs:undo-enable currentEdit true)
+)
+
+; previous and undo
+(define (findtextundoprev-action)
+	(gs:undo-enable currentEdit nil)
+	(gs:find-text currentEdit currentReplaceText 'findpreviousresult-action "previous")
+	(gs:undo-enable currentEdit true)
+)
+
+(define (findpreviousresult-action id result)
+	(if (= result -1)
+		(begin
+			(gs:set-text 'FindDialog "Not found for undo")
+			(gs:disable 'FindTextUndoPrevButton 'FindTextReplaceButton 'FindTextReplaceNextButton)
+		)
+		(begin
+			(gs:paste-text currentEdit currentSearchText)
+			(gs:request-focus currentEdit)
+		)
+	)
+)
+
+;; view menu fonts bigger/smaller handlers
+
+(define (viewfontsmaller-handler)
+	(dec 'currentFontSize)
+	(gs:set-text 'FontSizeLabel (string currentFontSize))
+	(gs:set-font currentEdit currentFontName currentFontSize "plain"))
+
+(define (viewfontbigger-handler)
+	(inc 'currentFontSize)
+	(gs:set-text 'FontSizeLabel (string currentFontSize))
+	(gs:set-font currentEdit currentFontName currentFontSize "plain"))
+
+;; 
+
+(define (fontbookbutton-handler)
+	(gs:dialog 'FontBookSelection 'TheEditor "Click on a font name to select it" 300 200 nil nil)
+	(gs:set-background 'FontBookSelection 1 1 1)
+	(gs:get-fonts)
+	(gs:panel 'FontPanel)
+	(gs:set-grid-layout 'FontPanel (length gs:fonts) 1 0 0)
+	(dolist (font gs:fonts)
+		(set 'font-label (string "label-" $idx))
+		(gs:label font-label font)
+		(if (= font currentFontName)
+			(gs:set-foreground font-label 0.8 0.5 0.0))
+		(gs:set-size font-label 100 30)
+		(gs:set-font font-label font 24 "plain")
+		(gs:mouse-event font-label 'mouse-action)
+		(gs:add-to 'FontPanel font-label))
+
+	(gs:scroll-pane 'Scroll 'FontPanel)
+	(gs:add-to 'FontBookSelection 'Scroll)
+	(gs:set-visible 'FontBookSelection true)
+)
+
+;; handle mouse clicks in font book
+(define (mouse-action id type x y button cnt mods)
+	(if (= type "pressed")
+		(gs:set-foreground id 0.8 0.5 0.0)
+		(begin
+			(set 'currentFontName (gs:fonts (int (last (parse id "-")) 0)))
+			(gs:set-font currentEdit currentFontName currentFontSize "plain")
+			(gs:set-foreground id 0 0 0))
+	)
+)
+
+;; font panel mouse click handler
+
+(define (fontpanel-event id  type x y button cnt modifiers)
+	(if (= type "clicked") 
+		(case id
+			("MAIN:FontBiggerLabel" (viewfontbigger-handler))
+			("MAIN:FontSmallerLabel" (viewfontsmaller-handler))
+		)
+	)
+)
+
+;; initialize syntax for first tab
+(theme-handler (string "ViewTheme" currentThemeIdx))
+;;;;;;;;;;;; exec  newlisp over editor contents ;;;;;;;;;;
+
+(define (process-or-execbutton-handler)
+	(if (not (directory? $TEMP))
+		(gs:message-dialog 'TheEditor "Cannot find temporal directory" 
+				(append "Need to create a directory " $TEMP) "information")
+		(begin
+			(disable-main-tools)
+;			(gs:get-text currentEdit 'exec-handler)
+			(gs:get-text currentEdit 'auxiliary-process-handler)
+			(gs:enable 'ViewClearMonitor)
+		)
+	)
+)
+
+; evaluates content of editor area in the auxiliary newLISP
+; process, as output is generated it is displayed in the
+; monitor area
+(define (auxiliary-process-handler id text)
+	(if text
+		(begin
+			(set 'text (base64-dec text))
+			(write-file "editor.txt" text)
+			(gs:eval-shell 'OutputArea (string "[cmd]\n" text "\n[/cmd]\n"))))
+	(after-exec-or-process)
+)
+
+; after the exec or auxiliary process execution
+; enable buttons, menus and edit area
+(define (after-exec-or-process)
+	(gs:enable 'FileMenu 'EditMenu 'ViewMenu 'RunMenu)
+	(gs:enable 'NewButton 'ClearButton 'PasteButton 
+				'LoadButton 'ExecButton 'RestartButton 'FindButton 'FontBookButton)
+	(gs:set-editable  currentEdit true)
+	(if (not edit-buffer-clean) (gs:enable 'SaveButton))
+	(gs:request-focus currentEdit)
+	(gs:select-text currentEdit currentDot currentMark)
+	(if is-selection 
+		(gs:enable 'CutButton 'CopyButton))
+)
+
+; disable main menus and toolbar
+(define (disable-main-tools)
+		(gs:disable 'FileMenu 'EditMenu 'ViewMenu 'RunMenu)
+		(gs:disable 'NewButton 'ClearButton 'LoadButton 'SaveButton 
+				'CutButton 'CopyButton 'PasteButton 
+				'ExecButton 'RestartButton 'FindButton 'FontBookButton)
+		(gs:set-editable  currentEdit nil)
+)
+
+;;;;;;;;;;;;;;;;;;;;;;;; end auxiliary process handling ;;;;;;;;;;;;;;;;;;;;;;;
+
+;; clear bottom monitor area
+(define (viewclearmonitor-handler)
+	(gs:clear-text 'OutputArea)
+	;(gs:disable 'ViewClearMonitor)
+)
+
+;; output to monitor area
+(define (output-monitor str)
+	(gs:append-text 'OutputArea str)
+	(gs:enable 'ViewClearMonitor)
+)
+
+;; dtach/attach toolbar
+(define (viewtoolbar-handler id flag)
+	(if flag
+		(begin
+			(set 'currentToolbarShow "yes")
+			(gs:add-to 'TheEditor 'ToolBar "north")
+			; if the toolbar was not visible on startup
+			; it will not be visible now, inspite of layout
+			; this forces components of the container to be redrawn
+			(gs:set-visible 'TheEditor true)
+			(gs:layout 'TheEditor)
+		)
+		(begin
+			(set 'currentToolbarShow "no")
+			(gs:remove-from 'TheEditor 'ToolBar)	
+			(gs:layout 'TheEditor)
+		)
+	)
+)
+
+;; syntax highlighting and themes 1,2,3
+;; for menu-item theme-handler function
+;; see beginning of file
+
+(define (viewsyntax-handler id flag)
+	(if flag
+		(begin
+			(set 'currentSyntaxStatus (current-file-syntax))
+			(if (not currentSyntaxStatus)
+					(begin
+						(gs:set-selected 'ViewSyntax nil)
+						(gs:show-popup 'SyntaxMenu 'TheEditor 100 100))
+					(gs:set-syntax currentEdit currentSyntaxStatus)))
+		(begin
+			(set 'currentSyntaxStatus nil)
+			(gs:set-syntax currentEdit nil))
+	)
+)
+
+(define (syntaxmenu-handler id idx)
+	(gs:set-syntax currentEdit (set 'currentSyntaxStatus 
+		(case id
+			("MAIN:SyntaxNewlisp" "lsp")
+			("MAIN:SyntaxC" "c")
+			("MAIN:SyntaxCPP" "cpp")
+			("MAIN:SyntaxJava" "java")
+			("MAIN:SyntaxPHP" "php")
+		))
+	)
+	(gs:set-selected 'ViewSyntax (true? currentSyntaxStatus))
+)
+
+;; handle character and caret events from edit area
+(define (editarea-handler id code mods dot mark len undo redo)
+	(if undo (gs:enable 'EditUndo) (gs:disable 'EditUndo))
+	(if redo (gs:enable 'EditRedo) (gs:disable 'EditRedo))
+	(set 'currentDot dot 'currentMark mark)
+;	(println code ":" mods)
+	(if (= code 65535) ; crtl or meta keys wit or w/o shift
+		; caret movement only
+		(if (not is-selection)
+			(if (!= dot mark) ; selection started
+				(begin
+					(gs:enable 'CutButton 'CopyButton 'EditCut 'EditCutP 'EditCopy 'EditCopyP)
+					(set 'is-selection true)))
+			(if (= dot mark)  ; de-selected
+				(begin
+					(gs:disable 'CutButton 'CopyButton 'EditCut 'EditCutP 'EditCopy 'EditCopyP)
+					(set 'is-selection nil)))
+		)
+		; character typed
+		(if edit-buffer-clean
+			(begin
+				(set 'edit-buffer-clean nil)
+				(gs:set-icon 'EditorTabs "/local/red10.png" currentTabIndex)
+				(gs:enable 'FileSave 'FileSaveAs 'SaveButton)
+			)
+		)
+	)			
+)
+
+;; handle mouse clicks from editeara for popup menu
+(define (editarea-mouse-handler id type x y button cnt modifiers)
+	(if (or (= button 3) (= modifiers 18)); right button or ctrl click
+		(gs:show-popup 'EditMenuPopup currentEdit x y)
+	)
+)
+
+;; tabs have switched or a new tab has been inserted
+(define (editortabs-handler id tab title idx)
+	(update-current-tab)
+	(set 'currentTabIndex idx)
+	; get new tab edit area settings
+	(set 'currentEdit tab)
+	(switch-to-tab tab idx)
+)
+
+(define (switch-to-tab tab)
+	(set 'currentDir (lookup currentEdit tabs-stack 1))
+	(set 'currentFile (lookup currentEdit tabs-stack 2)) 
+	(set 'currentPath (string currentDir "/" currentFile))
+	(set 'currentStatus (lookup currentEdit tabs-stack 3))
+	(set 'edit-buffer-clean (currentStatus 0))
+	(if edit-buffer-clean
+		(begin
+			(gs:set-icon 'EditorTabs "/local/green10.png" currentTabIndex)
+			(gs:disable 'FileSave 'SaveButton)
+		)
+		(begin
+			(gs:set-icon 'EditorTabs "/local/red10.png" currentTabIndex)
+			(gs:enable 'FileSave 'SaveButton)
+		)
+	)
+	(set 'currentDot (currentStatus 1))
+	(set 'currentMark (currentStatus 2))
+	(set 'currentSyntaxStatus (currentStatus 3))
+	(if (= currentDot currentMark) 
+		(begin
+			(set 'is-selection nil)
+			(gs:disable 'CutButton 'CopyButton 'EditCut 'EditCutP 'EditCopy 'EditCopyP)
+			(gs:request-focus currentEdit) )
+		(begin
+			(set 'is-selection true)
+			(gs:enable 'CutButton 'CopyButton 'EditCut 'EditCutP 'EditCopy 'EditCopyP)
+			(gs:request-focus currentEdit)
+			(gs:select-text currentEdit currentDot currentMark) )
+	)
+	(gs:set-text 'TheEditor (string "newLISP edit - " currentPath))
+	(theme-handler (string "ViewTheme" currentThemeIdx))
+)
+
+(define (update-current-tab)
+	(set 'currentStatus (list edit-buffer-clean currentDot currentMark currentSyntaxStatus))
+	; save previous tab edit area settings
+	(replace-assoc currentEdit tabs-stack (list currentEdit currentDir currentFile currentStatus))
+)
+
+;; help about box
+;; on Mac OS X the built-in about box is shown (contained in guiserver.jar)
+;; selectable from the Apple system menu
+;; On other OSs the Help menu contains the following (identical loooking)
+;; about box
+
+(define (helpabout-handler)
+	(if (!= ostype "OSX")
+		(begin
+			(gs:get-version)
+			(gs:message-dialog 'TheEditor (string "newLISP-GS v." gs:version)
+				(string "Software: copyright (c) 2007 Lutz Mueller http://newlisp.org\n" 
+						"Icons: copyright (c) 2007 Michael Michaels http://neglook.com\n"
+						"All rights reserved.")
+				"information" "/local/newLISP64.png" )
+		)
+	)
+)
+
+;; show newLISP Users Manual and Reference
+
+(define (helpmanual-handler)
+	(load-platform-help "/manual_frame.html")
+)
+
+;; show GS Manual
+
+(define (helpguiserver-handler)
+	(load-platform-help "/guiserver/index.html")
+)
+
+(define (load-platform-help file-name , prog files)
+	(if (not (file? (string newlispDoc file-name)))
+		(gs:message-dialog 'TheEditor "Display documentation"
+				(string "Cannot find file: " newlispDoc file-name)
+                "warning"))
+	(cond
+		; Mac OS X
+		((= ostype "OSX")
+			(exec (string "open file://" newlispDoc file-name))
+		)
+		; Windows, loading docs from the menu has been disabled because open explorer blocks the Java part
+		; of newlisp-edit.lsp from exiting
+		((= ostype "Win32")
+			(begin
+				(set 'prog (string "cmd /c \"" (env "PROGRAMFILES") "/Internet Explorer/IEXPLORE.EXE\""))
+				;(println "->" prog "<-")
+				(exec (string prog " file://" newlispDoc file-name)))
+		)
+		; all other UNIX
+		(true 
+			(set 'files '(
+					"/usr/bin/sensible-browser"
+					"/usr/bin/x-www-browser"
+					"/usr/bin/mozilla"
+					"/usr/bin/konqueror"))
+			(set 'prog (find true (map file? files)))
+			(if prog
+				(exec (string (files prog) " file://" newlispDoc file-name))
+				(gs:message-dialog 'TheEditor "Display documentation"
+						"Cannot find browser to display documentation" "warning")
+			)
+		)
+	)
+)
+
+
+;; start listening for GUI events and output from auxiliary newLISP process
+;; append out put from newLISP process to monitor area
+
+(while (gs:check-event 10000)
+	(if (and console (net-select console "read" 10000))
+		(begin
+			(if (> (net-peek console) 0) (begin
+				(net-receive console 'response 10024)
+				(output-monitor (or response ""))
+				(sleep 100)
+				))
+			(check-status)
+		)
+	)
+)
+
+;; eof
diff --git a/guiserver/newlisp-gs.nsi b/guiserver/newlisp-gs.nsi
new file mode 100644
index 0000000..0dee195
--- /dev/null
+++ b/guiserver/newlisp-gs.nsi
@@ -0,0 +1,462 @@
+; newlisp-gs.nsi
+;
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+; The name of the installer
+Name "newLISP-GS"
+
+; The file to write
+OutFile "c:\lutz\newLISP\newlisp-9303-win-gs-114.exe"
+
+; The default installation directory
+InstallDir $PROGRAMFILES\newlisp
+
+; The text to prompt the user to enter a directory
+DirText "This will install the newLISP-GS 1.14 and newLISP 9.3.3 on your computer." \
+
+;;;;;;;;;;;;;;;;;;;;;; subroutines for PATH change in Win32 environment ;;;;;;;;;;;;;;
+!verbose 3
+!include "WinMessages.NSH"
+!verbose 4
+
+; AddToPath - Adds the given dir to the search path.
+;        Input - head of the stack
+;        Note - Win9x systems requires reboot
+
+Function AddToPath
+  Exch $0
+  Push $1
+  Push $2
+  Push $3
+
+  # don't add if the path doesn't exist
+  IfFileExists "$0\*.*" "" AddToPath_done
+
+  ReadEnvStr $1 PATH
+  Push "$1;"
+  Push "$0;"
+  Call StrStr
+  Pop $2
+  StrCmp $2 "" "" AddToPath_done
+  Push "$1;"
+  Push "$0\;"
+  Call StrStr
+  Pop $2
+  StrCmp $2 "" "" AddToPath_done
+  GetFullPathName /SHORT $3 $0
+  Push "$1;"
+  Push "$3;"
+  Call StrStr
+  Pop $2
+  StrCmp $2 "" "" AddToPath_done
+  Push "$1;"
+  Push "$3\;"
+  Call StrStr
+  Pop $2
+  StrCmp $2 "" "" AddToPath_done
+
+  Call IsNT
+  Pop $1
+  StrCmp $1 1 AddToPath_NT
+    ; Not on NT
+    StrCpy $1 $WINDIR 2
+    FileOpen $1 "$1\autoexec.bat" a
+    FileSeek $1 -1 END
+    FileReadByte $1 $2
+    IntCmp $2 26 0 +2 +2 # DOS EOF
+      FileSeek $1 -1 END # write over EOF
+    FileWrite $1 "$\r$\nSET PATH=%PATH%;$3$\r$\n"
+    FileClose $1
+    SetRebootFlag true
+    Goto AddToPath_done
+
+  AddToPath_NT:
+    ReadRegStr $1 HKCU "Environment" "PATH"
+    StrCpy $2 $1 1 -1 # copy last char
+    StrCmp $2 ";" 0 +2 # if last char == ;
+      StrCpy $1 $1 -1 # remove last char
+    StrCmp $1 "" AddToPath_NTdoIt
+      StrCpy $0 "$1;$0"
+    AddToPath_NTdoIt:
+      WriteRegExpandStr HKCU "Environment" "PATH" $0
+      SendMessage ${HWND_BROADCAST} ${WM_WININICHANGE} 0 "STR:Environment" /TIMEOUT=5000
+
+  AddToPath_done:
+    Pop $3
+    Pop $2
+    Pop $1
+    Pop $0
+FunctionEnd
+
+; RemoveFromPath - Remove a given dir from the path
+;     Input: head of the stack
+
+Function un.RemoveFromPath
+  Exch $0
+  Push $1
+  Push $2
+  Push $3
+  Push $4
+  Push $5
+  Push $6
+
+  IntFmt $6 "%c" 26 # DOS EOF
+
+  Call un.IsNT
+  Pop $1
+  StrCmp $1 1 unRemoveFromPath_NT
+    ; Not on NT
+    StrCpy $1 $WINDIR 2
+    FileOpen $1 "$1\autoexec.bat" r
+    GetTempFileName $4
+    FileOpen $2 $4 w
+    GetFullPathName /SHORT $0 $0
+    StrCpy $0 "SET PATH=%PATH%;$0"
+    Goto unRemoveFromPath_dosLoop
+
+    unRemoveFromPath_dosLoop:
+      FileRead $1 $3
+      StrCpy $5 $3 1 -1 # read last char
+      StrCmp $5 $6 0 +2 # if DOS EOF
+        StrCpy $3 $3 -1 # remove DOS EOF so we can compare
+      StrCmp $3 "$0$\r$\n" unRemoveFromPath_dosLoopRemoveLine
+      StrCmp $3 "$0$\n" unRemoveFromPath_dosLoopRemoveLine
+      StrCmp $3 "$0" unRemoveFromPath_dosLoopRemoveLine
+      StrCmp $3 "" unRemoveFromPath_dosLoopEnd
+      FileWrite $2 $3
+      Goto unRemoveFromPath_dosLoop
+      unRemoveFromPath_dosLoopRemoveLine:
+        SetRebootFlag true
+        Goto unRemoveFromPath_dosLoop
+
+    unRemoveFromPath_dosLoopEnd:
+      FileClose $2
+      FileClose $1
+      StrCpy $1 $WINDIR 2
+      Delete "$1\autoexec.bat"
+      CopyFiles /SILENT $4 "$1\autoexec.bat"
+      Delete $4
+      Goto unRemoveFromPath_done
+
+  unRemoveFromPath_NT:
+    ReadRegStr $1 HKCU "Environment" "PATH"
+    StrCpy $5 $1 1 -1 # copy last char
+    StrCmp $5 ";" +2 # if last char != ;
+      StrCpy $1 "$1;" # append ;
+    Push $1
+    Push "$0;"
+    Call un.StrStr ; Find $0; in $1
+    Pop $2 ; pos of our dir
+    StrCmp $2 "" unRemoveFromPath_done
+      ; else, it is in path
+      # $0 - path to add
+      # $1 - path var
+      StrLen $3 "$0;"
+      StrLen $4 $2
+      StrCpy $5 $1 -$4 # $5 is now the part before the path to remove
+      StrCpy $6 $2 "" $3 # $6 is now the part after the path to remove
+      StrCpy $3 $5$6
+
+      StrCpy $5 $3 1 -1 # copy last char
+      StrCmp $5 ";" 0 +2 # if last char == ;
+        StrCpy $3 $3 -1 # remove last char
+
+      WriteRegExpandStr HKCU "Environment" "PATH" $3
+      SendMessage ${HWND_BROADCAST} ${WM_WININICHANGE} 0 "STR:Environment" /TIMEOUT=5000
+
+  unRemoveFromPath_done:
+    Pop $6
+    Pop $5
+    Pop $4
+    Pop $3
+    Pop $2
+    Pop $1
+    Pop $0
+FunctionEnd
+
+###########################################
+#            Utility Functions            #
+###########################################
+
+; IsNT
+; no input
+; output, top of the stack = 1 if NT or 0 if not
+;
+; Usage:
+;   Call IsNT
+;   Pop $R0
+;  ($R0 at this point is 1 or 0)
+
+!macro IsNT un
+Function ${un}IsNT
+  Push $0
+  ReadRegStr $0 HKLM "SOFTWARE\Microsoft\Windows NT\CurrentVersion" CurrentVersion
+  StrCmp $0 "" 0 IsNT_yes
+  ; we are not NT.
+  Pop $0
+  Push 0
+  Return
+
+  IsNT_yes:
+    ; NT!!!
+    Pop $0
+    Push 1
+FunctionEnd
+!macroend
+!insertmacro IsNT ""
+!insertmacro IsNT "un."
+
+; StrStr
+; input, top of stack = string to search for
+;        top of stack-1 = string to search in
+; output, top of stack (replaces with the portion of the string remaining)
+; modifies no other variables.
+;
+; Usage:
+;   Push "this is a long ass string"
+;   Push "ass"
+;   Call StrStr
+;   Pop $R0
+;  ($R0 at this point is "ass string")
+
+!macro StrStr un
+Function ${un}StrStr
+Exch $R1 ; st=haystack,old$R1, $R1=needle
+  Exch    ; st=old$R1,haystack
+  Exch $R2 ; st=old$R1,old$R2, $R2=haystack
+  Push $R3
+  Push $R4
+  Push $R5
+  StrLen $R3 $R1
+  StrCpy $R4 0
+  ; $R1=needle
+  ; $R2=haystack
+  ; $R3=len(needle)
+  ; $R4=cnt
+  ; $R5=tmp
+  loop:
+    StrCpy $R5 $R2 $R3 $R4
+    StrCmp $R5 $R1 done
+    StrCmp $R5 "" done
+    IntOp $R4 $R4 + 1
+    Goto loop
+done:
+  StrCpy $R1 $R2 "" $R4
+  Pop $R5
+  Pop $R4
+  Pop $R3
+  Pop $R2
+  Exch $R1
+FunctionEnd
+!macroend
+!insertmacro StrStr ""
+!insertmacro StrStr "un."
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; end subroutines for PATH change ====================
+
+LicenseText License
+LicenseData c:\newlisp\COPYING
+
+ComponentText Select components
+
+ShowInstDetails show
+
+; The stuff to install
+Section "newLISP program (required) and DLL"
+  CreateDirectory $INSTDIR\guiserver
+  CreateDirectory $INSTDIR\modules
+  CreateDirectory $INSTDIR\util
+  ; Set output path to the installation directories.
+
+  SetOutPath $INSTDIR
+  File "c:\newlisp\newlisp.exe"
+  File "c:\newlisp\newlisp.dll"  
+  File "c:\newlisp\md5-checksums.txt"
+  File "c:\newlisp\newlisp_manual.html"
+  File "c:\newlisp\newlisp_index.html"
+  File "c:\newlisp\manual_frame.html"
+  File "c:\newlisp\CodePatterns.html"
+  File "c:\newlisp\newLISPdoc.html"
+  File "c:\newlisp\newLISP-9.3-Release.html"
+  File "c:\newlisp\COPYING"
+  File "c:\newlisp\guiserver.lsp"
+  File "c:\newlisp\guiserver.jar"
+  File "c:\newlisp\newlisp-edit.lsp"
+  File "c:\newlisp\newlisp-win.ico"
+
+  SetOutPath $INSTDIR\guiserver
+  File "c:\newlisp\guiserver\index.html"
+  File "c:\newlisp\guiserver\guiserver.lsp.html"
+  File "c:\newlisp\guiserver\allfonts-demo.lsp"
+  File "c:\newlisp\guiserver\animation-demo.lsp"
+  File "c:\newlisp\guiserver\border-layout-demo.lsp"
+  File "c:\newlisp\guiserver\button-demo.lsp"
+  File "c:\newlisp\guiserver\clipboard-demo.lsp"
+  File "c:\newlisp\guiserver\cursor-demo.lsp"
+  File "c:\newlisp\guiserver\drag-demo.lsp"
+  File "c:\newlisp\guiserver\font-demo.lsp"
+  File "c:\newlisp\guiserver\frameless-demo.lsp"
+  File "c:\newlisp\guiserver\html-demo.lsp"
+  File "c:\newlisp\guiserver\image-demo.lsp"
+  File "c:\newlisp\guiserver\mouse-demo.lsp"
+  File "c:\newlisp\guiserver\move-resize-demo.lsp"
+  File "c:\newlisp\guiserver\pinballs-demo.lsp"
+  File "c:\newlisp\guiserver\properties-demo.lsp"
+  File "c:\newlisp\guiserver\rotation-demo.lsp"
+  File "c:\newlisp\guiserver\shapes-demo.lsp"
+  File "c:\newlisp\guiserver\sound-demo.lsp"
+  File "c:\newlisp\guiserver\stroke-demo.lsp"
+  File "c:\newlisp\guiserver\tabs-demo.lsp"
+  File "c:\newlisp\guiserver\textrot-demo.lsp"
+  File "c:\newlisp\guiserver\widgets-demo.lsp"
+  File "c:\newlisp\guiserver\word-count.lsp"
+  File "c:\newlisp\guiserver\uppercase.lsp"
+
+  SetOutPath $INSTDIR\modules
+  File "c:\newlisp\modules\cgi.lsp"
+  File "c:\newlisp\modules\crypto.lsp"
+  File "c:\newlisp\modules\ftp.lsp"
+  File "c:\newlisp\modules\gmp.lsp"
+  File "c:\newlisp\modules\infix.lsp"
+  File "c:\newlisp\modules\mysql.lsp"
+  File "c:\newlisp\modules\mysql5.lsp"
+  File "c:\newlisp\modules\odbc.lsp"
+  File "c:\newlisp\modules\pop3.lsp"
+  File "c:\newlisp\modules\postscript.lsp"
+  File "c:\newlisp\modules\smtp.lsp"
+  File "c:\newlisp\modules\sqlite3.lsp"
+  File "c:\newlisp\modules\stat.lsp"
+  File "c:\newlisp\modules\unix.lsp"
+  File "c:\newlisp\modules\xmlrpc-client.lsp" 
+  File "c:\newlisp\modules\zlib.lsp"
+
+  SetOutPath $INSTDIR\util
+  File "c:\newlisp\util\httpd-conf.lsp"
+  File "c:\newlisp\util\link.lsp"
+  File "c:\newlisp\util\newlisp.vim"
+  File "c:\newlisp\util\newlispdoc"
+  File "c:\newlisp\util\syntax.cgi"
+
+  SetOutPath $INSTDIR
+
+  ; Write the installation path into the registry
+  WriteRegStr HKLM SOFTWARE\newLISP "Install_Dir" "$INSTDIR"
+
+  ; Write the uninstall keys for Windows
+  WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\newLISP" "DisplayName" "newLISP (remove only)"
+  WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\newLISP" "UninstallString" '"$INSTDIR\uninstall.exe"'
+
+  WriteUninstaller "uninstall.exe"
+  ; make menu in startmenus
+  CreateDirectory "$SMPROGRAMS\newLISP"
+  CreateShortCut "$SMPROGRAMS\newLISP\newLISP.lnk" "$INSTDIR\newlisp.exe" "" "$INSTDIR\newlisp.exe" 0
+  CreateShortCut "$SMPROGRAMS\newLISP\Manual and Reference.lnk" "$INSTDIR\manual_frame.html" "" "$INSTDIR\manual_frame.html" 0
+  CreateShortCut "$SMPROGRAMS\newLISP\GS Manual and Reference.lnk" "$INSTDIR\guiserver\index.html" "" "$INSTDIR\guiserver\index.html" 0
+  #CreateShortCut "$SMPROGRAMS\newLISP\CodePatterns.lnk" "$INSTDIR\guiserver\CodePatterns.html" "" "$INSTDIR\guiserver\CodePatterns.html" 0
+  CreateShortCut "$SMPROGRAMS\newLISP\Uninstall.lnk" "$INSTDIR\uninstall.exe" "" "$INSTDIR\uninstall.exe" 0
+  CreateShortCut "$SMPROGRAMS\newLISP\newLISP-GS.lnk" "$INSTDIR\guiserver.jar" "47011 newlisp-edit.lsp /local/newLISP128.png" "$INSTDIR\newlisp-win.ico" 0
+  CreateShortCut "$DESKTOP\newLISP-GS.lnk" "$INSTDIR\guiserver.jar" "47011 newlisp-edit.lsp /local/newLISP128.png" "$INSTDIR\newlisp-win.ico" 0
+
+SectionEnd ; end the section
+
+Section "Add to path"
+  Push $INSTDIR
+  Call AddToPath
+SectionEnd
+
+; uninstall stuff
+
+UninstallText "This will uninstall newLISP. Hit next to continue."
+
+; special uninstall section.
+Section "Uninstall"
+
+  ; remove registry keys
+  DeleteRegKey HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\newLISP"
+  DeleteRegKey HKLM SOFTWARE\newLISP
+
+  ; remove files
+  Delete $INSTDIR\newlisp.exe
+  Delete $INSTDIR\newlisp.dll
+  Delete $INSTDIR\util\httpd-conf.lsp
+  Delete $INSTDIR\util\link.lsp
+  Delete $INSTDIR\util\newlispdoc
+  Delete $INSTDIR\util\newlisp.vim
+  Delete $INSTDIR\util\syntax.cgi
+  Delete $INSTDIR\md5-checksums.txt
+  Delete $INSTDIR\newlisp_manual.html
+  Delete $INSTDIR\newlisp_index.html
+  Delete $INSTDIR\manual_frame.html
+  Delete $INSTDIR\CodePatterns.html
+  Delete $INSTDIR\newLISPdoc.html
+  Delete $INSTDIR\newLISP-9.3-Release.html
+  Delete $INSTDIR\COPYING
+  Delete $INSTDIR\newlisp.vim
+  Delete $INSTDIR\httpd-conf.lsp
+  Delete $INSTDIR\guiserver.lsp
+  Delete $INSTDIR\guiserver.jar
+  Delete $INSTDIR\newlisp-edit.lsp
+  Delete $INSTDIR\newlisp-win.ico
+
+  Delete $INSTDIR\guiserver\index.html
+  Delete $INSTDIR\guiserver\guiserver.lsp.html
+  Delete $INSTDIR\guiserver\allfonts-demo.lsp
+  Delete $INSTDIR\guiserver\animation-demo.lsp
+  Delete $INSTDIR\guiserver\border-layout-demo.lsp
+  Delete $INSTDIR\guiserver\button-demo.lsp
+  Delete $INSTDIR\guiserver\clipboard-demo.lsp
+  Delete $INSTDIR\guiserver\cursor-demo.lsp
+  Delete $INSTDIR\guiserver\drag-demo.lsp
+  Delete $INSTDIR\guiserver\font-demo.lsp
+  Delete $INSTDIR\guiserver\frameless-demo.lsp
+  Delete $INSTDIR\guiserver\html-demo.lsp
+  Delete $INSTDIR\guiserver\image-demo.lsp
+  Delete $INSTDIR\guiserver\mouse-demo.lsp
+  Delete $INSTDIR\guiserver\move-resize-demo.lsp
+  Delete $INSTDIR\guiserver\pinballs-demo.lsp
+  Delete $INSTDIR\guiserver\properties-demo.lsp
+  Delete $INSTDIR\guiserver\rotation-demo.lsp
+  Delete $INSTDIR\guiserver\shapes-demo.lsp
+  Delete $INSTDIR\guiserver\sound-demo.lsp
+  Delete $INSTDIR\guiserver\stroke-demo.lsp
+  Delete $INSTDIR\guiserver\tabs-demo.lsp
+  Delete $INSTDIR\guiserver\textrot-demo.lsp
+  Delete $INSTDIR\guiserver\widgets-demo.lsp
+  Delete $INSTDIR\guiserver\word-count.lsp
+  Delete $INSTDIR\guiserver\uppercase.lsp
+
+  Delete $INSTDIR\modules\cgi.lsp
+  Delete $INSTDIR\modules\crypto.lsp
+  Delete $INSTDIR\modules\ftp.lsp
+  Delete $INSTDIR\modules\gmp.lsp
+  Delete $INSTDIR\modules\infix.lsp
+  Delete $INSTDIR\modules\mysql.lsp
+  Delete $INSTDIR\modules\mysql5.lsp
+  Delete $INSTDIR\modules\odbc.lsp
+  Delete $INSTDIR\modules\pop3.lsp
+  Delete $INSTDIR\modules\postscript.lsp
+  Delete $INSTDIR\modules\smtp.lsp
+  Delete $INSTDIR\modules\sqlite3.lsp
+  Delete $INSTDIR\modules\stat.lsp
+  Delete $INSTDIR\modules\unix.lsp
+  Delete $INSTDIR\modules\xmlrpc-client.lsp 
+  Delete $INSTDIR\modules\zlib.lsp
+  ; remove start menu entries
+  Delete "$DESKTOP\newLISP-GS.lnk"
+  Delete "$SMPROGRAMS\newLISP-GS.lnk"
+  Delete "$SMPROGRAMS\newLISP\*.*"
+  RMDir "$SMPROGRAMS\newLISP"
+
+  ; remove uninstaller, links and install dir
+  Delete $INSTDIR\uninstall.exe
+  RMDir "$INSTDIR\guiserver"
+  RMDir "$INSTDIR\modules"
+  RMDir "$INSTDIR\util"
+  RMDir "$INSTDIR"
+
+  Push $INSTDIR
+  Call un.RemoveFromPath
+
+SectionEnd
+
+; eof
diff --git a/guiserver/newlisp-gs.nsi.bak b/guiserver/newlisp-gs.nsi.bak
new file mode 100644
index 0000000..c3b70e9
--- /dev/null
+++ b/guiserver/newlisp-gs.nsi.bak
@@ -0,0 +1,462 @@
+; newlisp-gs.nsi
+;
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+; The name of the installer
+Name "newLISP-GS"
+
+; The file to write
+OutFile "c:\lutz\newLISP\newlisp-9303-win-gs-114.exe"
+
+; The default installation directory
+InstallDir $PROGRAMFILES\newlisp
+
+; The text to prompt the user to enter a directory
+DirText "This will install the newLISP-GS 1.14 and newLISP 9.3.2 on your computer." \
+
+;;;;;;;;;;;;;;;;;;;;;; subroutines for PATH change in Win32 environment ;;;;;;;;;;;;;;
+!verbose 3
+!include "WinMessages.NSH"
+!verbose 4
+
+; AddToPath - Adds the given dir to the search path.
+;        Input - head of the stack
+;        Note - Win9x systems requires reboot
+
+Function AddToPath
+  Exch $0
+  Push $1
+  Push $2
+  Push $3
+
+  # don't add if the path doesn't exist
+  IfFileExists "$0\*.*" "" AddToPath_done
+
+  ReadEnvStr $1 PATH
+  Push "$1;"
+  Push "$0;"
+  Call StrStr
+  Pop $2
+  StrCmp $2 "" "" AddToPath_done
+  Push "$1;"
+  Push "$0\;"
+  Call StrStr
+  Pop $2
+  StrCmp $2 "" "" AddToPath_done
+  GetFullPathName /SHORT $3 $0
+  Push "$1;"
+  Push "$3;"
+  Call StrStr
+  Pop $2
+  StrCmp $2 "" "" AddToPath_done
+  Push "$1;"
+  Push "$3\;"
+  Call StrStr
+  Pop $2
+  StrCmp $2 "" "" AddToPath_done
+
+  Call IsNT
+  Pop $1
+  StrCmp $1 1 AddToPath_NT
+    ; Not on NT
+    StrCpy $1 $WINDIR 2
+    FileOpen $1 "$1\autoexec.bat" a
+    FileSeek $1 -1 END
+    FileReadByte $1 $2
+    IntCmp $2 26 0 +2 +2 # DOS EOF
+      FileSeek $1 -1 END # write over EOF
+    FileWrite $1 "$\r$\nSET PATH=%PATH%;$3$\r$\n"
+    FileClose $1
+    SetRebootFlag true
+    Goto AddToPath_done
+
+  AddToPath_NT:
+    ReadRegStr $1 HKCU "Environment" "PATH"
+    StrCpy $2 $1 1 -1 # copy last char
+    StrCmp $2 ";" 0 +2 # if last char == ;
+      StrCpy $1 $1 -1 # remove last char
+    StrCmp $1 "" AddToPath_NTdoIt
+      StrCpy $0 "$1;$0"
+    AddToPath_NTdoIt:
+      WriteRegExpandStr HKCU "Environment" "PATH" $0
+      SendMessage ${HWND_BROADCAST} ${WM_WININICHANGE} 0 "STR:Environment" /TIMEOUT=5000
+
+  AddToPath_done:
+    Pop $3
+    Pop $2
+    Pop $1
+    Pop $0
+FunctionEnd
+
+; RemoveFromPath - Remove a given dir from the path
+;     Input: head of the stack
+
+Function un.RemoveFromPath
+  Exch $0
+  Push $1
+  Push $2
+  Push $3
+  Push $4
+  Push $5
+  Push $6
+
+  IntFmt $6 "%c" 26 # DOS EOF
+
+  Call un.IsNT
+  Pop $1
+  StrCmp $1 1 unRemoveFromPath_NT
+    ; Not on NT
+    StrCpy $1 $WINDIR 2
+    FileOpen $1 "$1\autoexec.bat" r
+    GetTempFileName $4
+    FileOpen $2 $4 w
+    GetFullPathName /SHORT $0 $0
+    StrCpy $0 "SET PATH=%PATH%;$0"
+    Goto unRemoveFromPath_dosLoop
+
+    unRemoveFromPath_dosLoop:
+      FileRead $1 $3
+      StrCpy $5 $3 1 -1 # read last char
+      StrCmp $5 $6 0 +2 # if DOS EOF
+        StrCpy $3 $3 -1 # remove DOS EOF so we can compare
+      StrCmp $3 "$0$\r$\n" unRemoveFromPath_dosLoopRemoveLine
+      StrCmp $3 "$0$\n" unRemoveFromPath_dosLoopRemoveLine
+      StrCmp $3 "$0" unRemoveFromPath_dosLoopRemoveLine
+      StrCmp $3 "" unRemoveFromPath_dosLoopEnd
+      FileWrite $2 $3
+      Goto unRemoveFromPath_dosLoop
+      unRemoveFromPath_dosLoopRemoveLine:
+        SetRebootFlag true
+        Goto unRemoveFromPath_dosLoop
+
+    unRemoveFromPath_dosLoopEnd:
+      FileClose $2
+      FileClose $1
+      StrCpy $1 $WINDIR 2
+      Delete "$1\autoexec.bat"
+      CopyFiles /SILENT $4 "$1\autoexec.bat"
+      Delete $4
+      Goto unRemoveFromPath_done
+
+  unRemoveFromPath_NT:
+    ReadRegStr $1 HKCU "Environment" "PATH"
+    StrCpy $5 $1 1 -1 # copy last char
+    StrCmp $5 ";" +2 # if last char != ;
+      StrCpy $1 "$1;" # append ;
+    Push $1
+    Push "$0;"
+    Call un.StrStr ; Find $0; in $1
+    Pop $2 ; pos of our dir
+    StrCmp $2 "" unRemoveFromPath_done
+      ; else, it is in path
+      # $0 - path to add
+      # $1 - path var
+      StrLen $3 "$0;"
+      StrLen $4 $2
+      StrCpy $5 $1 -$4 # $5 is now the part before the path to remove
+      StrCpy $6 $2 "" $3 # $6 is now the part after the path to remove
+      StrCpy $3 $5$6
+
+      StrCpy $5 $3 1 -1 # copy last char
+      StrCmp $5 ";" 0 +2 # if last char == ;
+        StrCpy $3 $3 -1 # remove last char
+
+      WriteRegExpandStr HKCU "Environment" "PATH" $3
+      SendMessage ${HWND_BROADCAST} ${WM_WININICHANGE} 0 "STR:Environment" /TIMEOUT=5000
+
+  unRemoveFromPath_done:
+    Pop $6
+    Pop $5
+    Pop $4
+    Pop $3
+    Pop $2
+    Pop $1
+    Pop $0
+FunctionEnd
+
+###########################################
+#            Utility Functions            #
+###########################################
+
+; IsNT
+; no input
+; output, top of the stack = 1 if NT or 0 if not
+;
+; Usage:
+;   Call IsNT
+;   Pop $R0
+;  ($R0 at this point is 1 or 0)
+
+!macro IsNT un
+Function ${un}IsNT
+  Push $0
+  ReadRegStr $0 HKLM "SOFTWARE\Microsoft\Windows NT\CurrentVersion" CurrentVersion
+  StrCmp $0 "" 0 IsNT_yes
+  ; we are not NT.
+  Pop $0
+  Push 0
+  Return
+
+  IsNT_yes:
+    ; NT!!!
+    Pop $0
+    Push 1
+FunctionEnd
+!macroend
+!insertmacro IsNT ""
+!insertmacro IsNT "un."
+
+; StrStr
+; input, top of stack = string to search for
+;        top of stack-1 = string to search in
+; output, top of stack (replaces with the portion of the string remaining)
+; modifies no other variables.
+;
+; Usage:
+;   Push "this is a long ass string"
+;   Push "ass"
+;   Call StrStr
+;   Pop $R0
+;  ($R0 at this point is "ass string")
+
+!macro StrStr un
+Function ${un}StrStr
+Exch $R1 ; st=haystack,old$R1, $R1=needle
+  Exch    ; st=old$R1,haystack
+  Exch $R2 ; st=old$R1,old$R2, $R2=haystack
+  Push $R3
+  Push $R4
+  Push $R5
+  StrLen $R3 $R1
+  StrCpy $R4 0
+  ; $R1=needle
+  ; $R2=haystack
+  ; $R3=len(needle)
+  ; $R4=cnt
+  ; $R5=tmp
+  loop:
+    StrCpy $R5 $R2 $R3 $R4
+    StrCmp $R5 $R1 done
+    StrCmp $R5 "" done
+    IntOp $R4 $R4 + 1
+    Goto loop
+done:
+  StrCpy $R1 $R2 "" $R4
+  Pop $R5
+  Pop $R4
+  Pop $R3
+  Pop $R2
+  Exch $R1
+FunctionEnd
+!macroend
+!insertmacro StrStr ""
+!insertmacro StrStr "un."
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; end subroutines for PATH change ====================
+
+LicenseText License
+LicenseData c:\newlisp\COPYING
+
+ComponentText Select components
+
+ShowInstDetails show
+
+; The stuff to install
+Section "newLISP program (required) and DLL"
+  CreateDirectory $INSTDIR\guiserver
+  CreateDirectory $INSTDIR\modules
+  CreateDirectory $INSTDIR\util
+  ; Set output path to the installation directories.
+
+  SetOutPath $INSTDIR
+  File "c:\newlisp\newlisp.exe"
+  File "c:\newlisp\newlisp.dll"  
+  File "c:\newlisp\md5-checksums.txt"
+  File "c:\newlisp\newlisp_manual.html"
+  File "c:\newlisp\newlisp_index.html"
+  File "c:\newlisp\manual_frame.html"
+  File "c:\newlisp\CodePatterns.html"
+  File "c:\newlisp\newLISPdoc.html"
+  File "c:\newlisp\newLISP-9.3-Release.html"
+  File "c:\newlisp\COPYING"
+  File "c:\newlisp\guiserver.lsp"
+  File "c:\newlisp\guiserver.jar"
+  File "c:\newlisp\newlisp-edit.lsp"
+  File "c:\newlisp\newlisp-win.ico"
+
+  SetOutPath $INSTDIR\guiserver
+  File "c:\newlisp\guiserver\index.html"
+  File "c:\newlisp\guiserver\guiserver.lsp.html"
+  File "c:\newlisp\guiserver\allfonts-demo.lsp"
+  File "c:\newlisp\guiserver\animation-demo.lsp"
+  File "c:\newlisp\guiserver\border-layout-demo.lsp"
+  File "c:\newlisp\guiserver\button-demo.lsp"
+  File "c:\newlisp\guiserver\clipboard-demo.lsp"
+  File "c:\newlisp\guiserver\cursor-demo.lsp"
+  File "c:\newlisp\guiserver\drag-demo.lsp"
+  File "c:\newlisp\guiserver\font-demo.lsp"
+  File "c:\newlisp\guiserver\frameless-demo.lsp"
+  File "c:\newlisp\guiserver\html-demo.lsp"
+  File "c:\newlisp\guiserver\image-demo.lsp"
+  File "c:\newlisp\guiserver\mouse-demo.lsp"
+  File "c:\newlisp\guiserver\move-resize-demo.lsp"
+  File "c:\newlisp\guiserver\pinballs-demo.lsp"
+  File "c:\newlisp\guiserver\properties-demo.lsp"
+  File "c:\newlisp\guiserver\rotation-demo.lsp"
+  File "c:\newlisp\guiserver\shapes-demo.lsp"
+  File "c:\newlisp\guiserver\sound-demo.lsp"
+  File "c:\newlisp\guiserver\stroke-demo.lsp"
+  File "c:\newlisp\guiserver\tabs-demo.lsp"
+  File "c:\newlisp\guiserver\textrot-demo.lsp"
+  File "c:\newlisp\guiserver\widgets-demo.lsp"
+  File "c:\newlisp\guiserver\word-count.lsp"
+  File "c:\newlisp\guiserver\uppercase.lsp"
+
+  SetOutPath $INSTDIR\modules
+  File "c:\newlisp\modules\cgi.lsp"
+  File "c:\newlisp\modules\crypto.lsp"
+  File "c:\newlisp\modules\ftp.lsp"
+  File "c:\newlisp\modules\gmp.lsp"
+  File "c:\newlisp\modules\infix.lsp"
+  File "c:\newlisp\modules\mysql.lsp"
+  File "c:\newlisp\modules\mysql5.lsp"
+  File "c:\newlisp\modules\odbc.lsp"
+  File "c:\newlisp\modules\pop3.lsp"
+  File "c:\newlisp\modules\postscript.lsp"
+  File "c:\newlisp\modules\smtp.lsp"
+  File "c:\newlisp\modules\sqlite3.lsp"
+  File "c:\newlisp\modules\stat.lsp"
+  File "c:\newlisp\modules\unix.lsp"
+  File "c:\newlisp\modules\xmlrpc-client.lsp" 
+  File "c:\newlisp\modules\zlib.lsp"
+
+  SetOutPath $INSTDIR\util
+  File "c:\newlisp\util\httpd-conf.lsp"
+  File "c:\newlisp\util\link.lsp"
+  File "c:\newlisp\util\newlisp.vim"
+  File "c:\newlisp\util\newlispdoc"
+  File "c:\newlisp\util\syntax.cgi"
+
+  SetOutPath $INSTDIR
+
+  ; Write the installation path into the registry
+  WriteRegStr HKLM SOFTWARE\newLISP "Install_Dir" "$INSTDIR"
+
+  ; Write the uninstall keys for Windows
+  WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\newLISP" "DisplayName" "newLISP (remove only)"
+  WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\newLISP" "UninstallString" '"$INSTDIR\uninstall.exe"'
+
+  WriteUninstaller "uninstall.exe"
+  ; make menu in startmenus
+  CreateDirectory "$SMPROGRAMS\newLISP"
+  CreateShortCut "$SMPROGRAMS\newLISP\newLISP.lnk" "$INSTDIR\newlisp.exe" "" "$INSTDIR\newlisp.exe" 0
+  CreateShortCut "$SMPROGRAMS\newLISP\Manual and Reference.lnk" "$INSTDIR\manual_frame.html" "" "$INSTDIR\manual_frame.html" 0
+  CreateShortCut "$SMPROGRAMS\newLISP\GS Manual and Reference.lnk" "$INSTDIR\guiserver\index.html" "" "$INSTDIR\guiserver\index.html" 0
+  #CreateShortCut "$SMPROGRAMS\newLISP\CodePatterns.lnk" "$INSTDIR\guiserver\CodePatterns.html" "" "$INSTDIR\guiserver\CodePatterns.html" 0
+  CreateShortCut "$SMPROGRAMS\newLISP\Uninstall.lnk" "$INSTDIR\uninstall.exe" "" "$INSTDIR\uninstall.exe" 0
+  CreateShortCut "$SMPROGRAMS\newLISP\newLISP-GS.lnk" "$INSTDIR\guiserver.jar" "47011 newlisp-edit.lsp /local/newLISP128.png" "$INSTDIR\newlisp-win.ico" 0
+  CreateShortCut "$DESKTOP\newLISP-GS.lnk" "$INSTDIR\guiserver.jar" "47011 newlisp-edit.lsp /local/newLISP128.png" "$INSTDIR\newlisp-win.ico" 0
+
+SectionEnd ; end the section
+
+Section "Add to path"
+  Push $INSTDIR
+  Call AddToPath
+SectionEnd
+
+; uninstall stuff
+
+UninstallText "This will uninstall newLISP. Hit next to continue."
+
+; special uninstall section.
+Section "Uninstall"
+
+  ; remove registry keys
+  DeleteRegKey HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\newLISP"
+  DeleteRegKey HKLM SOFTWARE\newLISP
+
+  ; remove files
+  Delete $INSTDIR\newlisp.exe
+  Delete $INSTDIR\newlisp.dll
+  Delete $INSTDIR\util\httpd-conf.lsp
+  Delete $INSTDIR\util\link.lsp
+  Delete $INSTDIR\util\newlispdoc
+  Delete $INSTDIR\util\newlisp.vim
+  Delete $INSTDIR\util\syntax.cgi
+  Delete $INSTDIR\md5-checksums.txt
+  Delete $INSTDIR\newlisp_manual.html
+  Delete $INSTDIR\newlisp_index.html
+  Delete $INSTDIR\manual_frame.html
+  Delete $INSTDIR\CodePatterns.html
+  Delete $INSTDIR\newLISPdoc.html
+  Delete $INSTDIR\newLISP-9.3-Release.html
+  Delete $INSTDIR\COPYING
+  Delete $INSTDIR\newlisp.vim
+  Delete $INSTDIR\httpd-conf.lsp
+  Delete $INSTDIR\guiserver.lsp
+  Delete $INSTDIR\guiserver.jar
+  Delete $INSTDIR\newlisp-edit.lsp
+  Delete $INSTDIR\newlisp-win.ico
+
+  Delete $INSTDIR\guiserver\index.html
+  Delete $INSTDIR\guiserver\guiserver.lsp.html
+  Delete $INSTDIR\guiserver\allfonts-demo.lsp
+  Delete $INSTDIR\guiserver\animation-demo.lsp
+  Delete $INSTDIR\guiserver\border-layout-demo.lsp
+  Delete $INSTDIR\guiserver\button-demo.lsp
+  Delete $INSTDIR\guiserver\clipboard-demo.lsp
+  Delete $INSTDIR\guiserver\cursor-demo.lsp
+  Delete $INSTDIR\guiserver\drag-demo.lsp
+  Delete $INSTDIR\guiserver\font-demo.lsp
+  Delete $INSTDIR\guiserver\frameless-demo.lsp
+  Delete $INSTDIR\guiserver\html-demo.lsp
+  Delete $INSTDIR\guiserver\image-demo.lsp
+  Delete $INSTDIR\guiserver\mouse-demo.lsp
+  Delete $INSTDIR\guiserver\move-resize-demo.lsp
+  Delete $INSTDIR\guiserver\pinballs-demo.lsp
+  Delete $INSTDIR\guiserver\properties-demo.lsp
+  Delete $INSTDIR\guiserver\rotation-demo.lsp
+  Delete $INSTDIR\guiserver\shapes-demo.lsp
+  Delete $INSTDIR\guiserver\sound-demo.lsp
+  Delete $INSTDIR\guiserver\stroke-demo.lsp
+  Delete $INSTDIR\guiserver\tabs-demo.lsp
+  Delete $INSTDIR\guiserver\textrot-demo.lsp
+  Delete $INSTDIR\guiserver\widgets-demo.lsp
+  Delete $INSTDIR\guiserver\word-count.lsp
+  Delete $INSTDIR\guiserver\uppercase.lsp
+
+  Delete $INSTDIR\modules\cgi.lsp
+  Delete $INSTDIR\modules\crypto.lsp
+  Delete $INSTDIR\modules\ftp.lsp
+  Delete $INSTDIR\modules\gmp.lsp
+  Delete $INSTDIR\modules\infix.lsp
+  Delete $INSTDIR\modules\mysql.lsp
+  Delete $INSTDIR\modules\mysql5.lsp
+  Delete $INSTDIR\modules\odbc.lsp
+  Delete $INSTDIR\modules\pop3.lsp
+  Delete $INSTDIR\modules\postscript.lsp
+  Delete $INSTDIR\modules\smtp.lsp
+  Delete $INSTDIR\modules\sqlite3.lsp
+  Delete $INSTDIR\modules\stat.lsp
+  Delete $INSTDIR\modules\unix.lsp
+  Delete $INSTDIR\modules\xmlrpc-client.lsp 
+  Delete $INSTDIR\modules\zlib.lsp
+  ; remove start menu entries
+  Delete "$DESKTOP\newLISP-GS.lnk"
+  Delete "$SMPROGRAMS\newLISP-GS.lnk"
+  Delete "$SMPROGRAMS\newLISP\*.*"
+  RMDir "$SMPROGRAMS\newLISP"
+
+  ; remove uninstaller, links and install dir
+  Delete $INSTDIR\uninstall.exe
+  RMDir "$INSTDIR\guiserver"
+  RMDir "$INSTDIR\modules"
+  RMDir "$INSTDIR\util"
+  RMDir "$INSTDIR"
+
+  Push $INSTDIR
+  Call un.RemoveFromPath
+
+SectionEnd
+
+; eof
diff --git a/guiserver/newlisp-win.ico b/guiserver/newlisp-win.ico
new file mode 100644
index 0000000000000000000000000000000000000000..7f8d392b5708a3f0d46b9687130a584b406ab701
GIT binary patch
literal 19518
zcwX(8e?ZMy-p4;OO;LV@TisH`L@9cBTuV!nrjnZs(h4<(!f51jS)s+K8PYPclg5vk
z{EAW@V+Xe%OvW<fN6k(K?bzANL^h+zU|V+B@qErX-{1FpyD|3J=Z}4p?m6G@_q^Vp
z&-r}MITt`1{IhBmQ1y!j(2(EwL%Z6LzmDwUXi(LYCr`kAV=cJFB*EOzegeDBkpQXr
zFu3&Z;GeM<oQAD~Q9J$wz23+K7?2G18XthQ<<N0Z1jHR_0?$47p<R3?1Z_JB-Hpef
zV{8FJgTQ0{P8hK3Ds&#P0Km=_9C{3c&cB=r!;fBvo@-BocFIy{-!~Q@Y6Wyl`W-}=
z9>U<fub}I=P2gXAA3Ba*0KRFPA#(ps7*g~V!1VW^=gPz2vGoQde)0fd_<RUhe*|2%
zSAkRDVt{2O&^@UHMxML}FLW6QE-@=WxA8L=UUCP(b0W0s838?}tpjK~0*3FdgFc(S
z1lNqS;JWw#*g19p=Ycc8Ibt)kb?Oa0-rNM8Ba*>qSrNR@>6g%}_#tRl9fv^&{t6v+
z<Du{SSD<6)N@(vB2u>-RVeqbM(2O^L%aly$HfJ07zxye~mNf(PO@y``+#u@E9q2s!
zDD+JF4R~f(L$5t|ARzw|_@;jd-6Imf<5%-RceD{gj{FGzhaQ5<EAs%xt%ksyYUnb>
z2%a-@VekjvfM&{O%*z(g9k>eau{a-XoWS{&H=*y_Cj9&oIQvCG)V`|#vDpx~=R0`O
z?PcgVWFB;xv>b-!R)c49HaPmHK-a~eg7c86V88wo7{0w09NhKbw)`k`9yuF4QV)U4
z)D1A|<7Nmxb{hum{Tim0--AI1AHb^zZ-M)VjnL=AdVnEw!9DjXbkn~9{oeivlK=1{
zw0|iCURr++b2tPB<Q{`AiF?2+Z67!d7!L#190#ApAHs{;K<r-*ZDwr&jbShJp8s0_
zr!a8Ks)0^Xi^1)UtuU;z83NWFfbOrY1JCqw@R<G<cy0a$25vhKFlq@n=`x_pgf-B9
z!H3XZHxoLi9)qxgYvABL8AcQ}fMd^Bq5u0AKr?X}^vpbt{Hfrb^A!Xhya$7enxNg7
zG|;|%8Z?vEgYSyH;HIAr+F5(Su3Z4wy9|L*2fhcNqQAkQqHEw1mIi%Rd<5f;+yl>L
zAAxpJA=r2Ef%bidfU|!x^j&uxyb_my<I+O#HoOl*57k3p?rE&4u2_fTkR1*qc6<Z&
zuWtmG>D$14<~C^af;YZ-Lje{QK!;&QY&*c<-8Z5C2Y&|5ydCh1ihJPDXBzlyy9%9N
zo(`R2--n=`7r|xxV(`lU4uTJ1{dXS=-9jfr8^;k4U3>#N4juy`+b+OMn=iq@>_33p
zs*?aXkAn{1hhZOGfquIhz<uJI&|&HdaO}|++PySZeL?t-{-5gw71?^`Iq8KLerKWo
zD-)JvH5ax<c~&vX08Z<8(U#nUt&yHVJbIm|&M29Sf1L#e7pO$P6(snOTd*}|>qX!^
zniB7ET1<8Cp2P%a;W;`G;f%a^@yAT<+qeH43V(?nL<`T!0i#nmqLF&#%9Xd6`Yd0*
z{1>R@e|zf+UZ5VBh3Dsh&>7s1vI&;coH=v;zHQsWh1>rAi{*XZdg}`D;Ky4K9oQnY
zBt~a&!sf6{xp6fM&z&1R`W!l#GY79Q56r@Ialq027V~h5<>ck%RaW)p30GG%P?Jlp
z@D>*PNgO=80Y<-f4@2kS9G6pBK=o4hf&$m-sxmJxydqfm_+u;u>fmRjfQy}@Gq{K@
z)9dv`RXgHOzvEL-T~$;@I(ZA!0iT0sHGp`I&cS)IUQkihH+7@-_!QJvSLw^R%e)27
zftUhYJcVfL{S@>{y<DN+f^I1CL#t@BQsKalP6A&AwumyZ;7R6%yer{)eMacF+Ngs*
zlj=h=xSldEVIJr#h$(nF1Bk!JrJm6(;Y6W_z`RGwC*mEjNw_DO16x!<n0r3;jINH?
zXN-gJp+5C;er07PHw$bMBy(Vk%ZbaqEjseQiPs%0sNW&u>nm9yuu0(N;Asr7+|$%k
zx(rVm*i%XV(P!+44?j4G@x{9;D_IJ>=p;zzpj8Hh+!H(<ORs;RfAHV|A|6mSFDyWh
za4!A_VlVfZH^Ang)do1ciO1`O_$!sd0`!PSel_yt7bFHuPiLUBF!fyUm6luqQxw|a
z)Ilu2stom;hy%U|m;sxwA&2L4uNpTmjK9O?cj|HZE3$GEHwQ8UHt{Kvsc%WRC{%wD
z^-jGjE`L_<VFpr|fdRG*v=+}T_WJ609rAJcCq0#F&pe%hR^hz_=|evVKPd3MR6Wqe
z&?FcjHP{j!E59YY$WBN|!1G6N_(8;1m5Kdcl?o5UK#1@bv}C}~52J4hPoNTcc~yCg
zBK&|dFa8qsrFblX8c4a~#~H9T1AZSPJ|s6GK?R*qDQ73pqfnJc9mmg=UsW|AmVg!f
zl@u#@3wB6uNJvPoS3q#>3677lYJomsvQ+{MpKFO%vUw4{c_=;pv0kNx1o3&~OAM&-
z{YIwr2?<HC2wyQ|h(v^6TD^sY&v&UBsALBEq>OA~21b&}Pf+B|I-AB@R<12&>6dmZ
zEC>$^25<%}@HG2!z5-q$K{OK~KTKP?Wi;|-wkj$T)D#lZ(hQ7DG12f7R3n$h-ptDs
zLinSr0%~$OLlRkzkPy;r5@$dyeCAsPo={OCXPc-(YQhYSqXP)vWa2Mb&jCq5ij@Rl
z_|58ROCa<LS==Vm4I<>18%pWdFYJjCEi_XD7Q<Dr1o)j-NkB@9NiAjcF$MhwFO#X}
z3GxFL#^o|cG4do>IH({A80j~KCO{E>jFs>!n7DCcVs1!eiVK5@=Qh>E%@It+#PAN-
zbBe*5V^T&QQAt2bN{njND(E-lQsEN|d=e}j;7F<ouok`yFQ>b?x!rgT`K6l{*2I-a
z`GSKA3j-A_0aMQZN}d4K@U6w}#*}p?>-Ocdkc0foC9h=>KNb#@DWH6n1d#As<O}o8
z*k`D+Zkzr>_;Hs_x3kW$D}sR-Nd{yFZV>)?C0}LsWqeCI$Dc^}CCEof9Z<eS5mxXO
z*cm54#NV*w^VZp`XA<~lB+63o&q$JBBJZHZrcC&j3E<Mdd-rbcHaqH?Sfc;cgCnsu
zM@A<JAp9W07y3B9iEQQMI966h&SR3OBo)Z>rQzG5$c^MPd%mourY0`#GFo`;wp*5x
zKcDiY-EM?FC$6TfEFhqYihhX@6JRj`gm1^iPw5OU3=j|yun;|5E-~G<;GZRYX}4R-
zYxw1@W?{hSEv`iMuCCSW8xofQaRPXL4B?9+_u;pjs;cU0SJ#VF+qaJ<>kKJ$f{La}
z&AMFxOO<@A%F8ti&yC)GF(SQ?%EyQQjz|p<KAixbkF|>U-6EZQwW<nrEhxYN_EV*&
zM_k<gDLN>*%~;WwE?uJhFFAg6G*2&yt2s9s;rqQy8yhD!Ha0GcjV<({-;${ToPg^`
zK9dx{4QcoUkM!#L0-wUz($dC>Oy1u6(<6ujR_g?RDfP^4SIRG;{Ah|Vxg57?^!5mZ
zN8a)zij0iRX>248LPLoG@&;TV`Pr27Qoc0#<a>R6L1FB&#!Sz#o$hz)<aysSGACyu
za}Y!gq+X&1vRq+l5beQ^=+rZ3NbWank4X29%sd)iTRUo0t?uZPuhBza<{*O@P)<Nh
zOoa^3=$Ts&hu7B88|uQ-Uj6!3+s8BZr(gVZQyjx_{4WJQ;<HLF2YtFdy)<mK86?sL
z-?~K{_)Nk%ND$vZo?k5CWAybth06~8@e7ctPWMO8wvWB{M{E}ji1DY=>7e+F>9bCQ
zQo1Le=wMmlB$5G409OEN{ESea*h3zpEQSF1V$sRAGxqPCP7HATD&*%~o<QwjIU+tH
z^SxS?XX`p_^&|%BL-ibgii9sozdm%*(ht<=WRSG6Z69Ai19>G`sU+iB0pQN_Q?n)z
z{GxD!`opyyRz~)X_1Te8$?-7(?243Msh{+uPJIBPQ7cah1~`6RUJ3G38UA9h0cGXk
zc#p`&cj|Ehn%N7W%FhV1@-$N&8kojsAT_I+<7ZL4V|to3HdT0e-`Ghw0nIVjuOAWl
z#l^)U|GO5VC#p+(eFify!QcP(78pwSXn-caWxT;~dI96#aFg@J`1NYVBU4>kTVlX5
zsOy9Y6I@|_US3x;P?CrEV5_MIas_|N3rYTq8{F6nz^-xeZ`_FgJg`!F64gewopHgb
zpJPy7*RIG93PJ~YL5|ZSRvWa0!o#Q;gMoeEsv-@;udJ}(ZzS}M#6UNj@q^*i>sW+N
zJE!jp3Mw#^?!#X}`y99L+#jXYG8+EIA8N+H`UL(C^8UBLf7y2Yh7m6RJoy;spr4~-
zp<&{5N7VFw5#wDpYdHhtm-MrN&jK96_0NvuPm%C>*(J1szpH<Lm%dm8PCNU>LS#Rx
zi2VG48nc!Hsmx}rD9%9q(NJ9f?TQ;VY_P)LXxD9&O$WyQ5A*Z?{NaoX)0{F5KR7w<
z-1*U0`T4)@HG;;CCJ0e06;}ddG5MJ3;$j6~#N)Mk4;ybFjF|nffBv<9;(l}?4LmPg
zm^Ll{#r_8lOg6H>g@h~k@#T7Qx<f?623h_CC49V^@bY)>wP?XO+4*7qi-X@ddGhgU
zD4#Lo!t87Lvj;lwG8&C$M&sh=roe30y|=Y|92Oocv%tU&kF4+mi5iNFADsRA>#-}x
zZe8^1Pd{~tHyA`e7|O2U17|xQ=->C&laux^ysh(yUi}C5>gBvkV<fX~JY`H<w6)xQ
z&mQ-oXWfUMc<0UPBE45gMKKj)Ab*&IA1LPsHV`$3<kkexQ(Ww<%*?He-g{ysd8Fyp
z48LR47&Tg>#&Gw5MynY<`OdDpccbj1dM;X&IcwH_ZxnxO+fqgUf2JAJPR6DPIbTdb
zAg2w8Zw~Q7JUPaBKYpAO`T7qzzn-kQOa7pC4WB&O-oO?a?dqINPtVL*rRh%l_h0ay
zF=NK##}o1IL}CIhxRU=M!<U}%10{Tr^8>}}Bz&)cEf?`1HFiOH`O&D&o5O1jS|gI}
z-+g#(@ZgReI}V=hObaU<>u}mMC#PxCE?n@=iS!)1a>1cP_dDGmdn@NLJ2#>OYCsr%
z!xH45x5{s5C~nRz3vf*zIyP9kozvA-s~I@^;ow!P{_Ekue0nW>26+<^?>+I*>dkjg
znQK|?o1=p7d*ZpVbbn!lYgHL8`@8`QexNLREWnC{vMSfYt*0&a6B6+7hc8~k*Zr<m
z%leM)`Q#IqkH(Mx#GWgEaSb}PdQoOhPGf9(0XcZt6$||1!`4XofigbBA57C)ZfAtA
zd3T_*v-2HexCc8U8m<l>p}F&J|H&H4#In%R7tl-!*1Y-X%E*b!3Ja>K0j~Vye30`g
zzTjJ(L2WxF)qnNsF8e!ow{#6!#JbEHjnRldgp6x|u=>#Dz)-7OiQfPU$;m6hj(hzm
zUmP@0D#Yun3c_?+OFSt6trqzsR)@{?|Iz<F+WYQZ3=<b0y86;}pEF?QH-VnFa1MOx
zc>|O`#R|XJj^LN-xK&dEH_&|)`5ODPb1(ncqel;S(qDIRdh98Z0<D4Hbrj35R=av-
zWMeFsfxzz*mk_>~emOs(5~DxOk|-gAFsO0q+>#%AtX(@~?F3Q)!FU$R%M8Yq&nPUp
z(ki6VZRHHu*>UA3<x31~w5!zDhs85AXF*GIi{s&<XVBV{*pZIv@yk(Ad(m-U-UR=+
z`K!$=d^6n!<alj3X8^aLVmAG~C3q=6p)&N_cskYm=?RNUYoK#!HlB+5%fi$iJt%$1
zkhT6_fbP?Mcoh7x$EBLN!RBz9AG2ihH?uv7GcXAc0L2#NC*k7>Bx78-LFAK^GBhdW
zFXx_1y~G7i_*pmsTk<gcRP0>)+UT>V&5Tc><S1a~HbvY7w=P(Q$Nz+i2FjPFA7DMQ
z*RQAPe?Oj_BiZSZjiRLkhU*T`jZ3{WQ=lWis?GpM^CnCn6LJ%Ed*L`8Wg4~2GWVGd
zq+5yKe?lt>Uy**~Ga)}CjUHh6iD%g}YIJEQHeE*g%$qm&?iCCm-%wZJkMF`-?B0tG
z&X}r#Jt&hzPVyk|Ytt4iBNfo_$Rd2+08anBcv?Cv`Q%7pBue{s;q5aVeXnR>Z9yGq
z-LnXuULZM`dE09#OBr_{;)(&s>)AIJCm@FK6?lRF@?Y8AJf145yxMdo`V!LRcr;*g
zJ>hz3?ON7P`8Q|IjQ&GUqY59=_E7$k;}+p_29W;+Z<elf8q}%sH*>SjM9&oPat~M!
zH;3@Og#Qmz^x0sVc&)e!k`cog-!gn50lyCyZZ?~7rPXNu^it7{Gtmq$;R_a|Jv4r1
z;O#Ks_$TrY7uFZ$##|p}89twY--`<u-BSqNEjk)UWMl7bQS=rE!vDvyM<))`x-*Lt
zp#76iXj#aO<5N`dkVyG<I_8<ZIrfCUB>ET`(7~pGn-V-4IF@@>#~I*uC9QpZhF7zj
zYWQ3NHvYyeRNd-%MKNxVmK-}q`IrC)hnDbY0B?}+k8LO#M5fa$oXk&ERffb|mo0sw
ze5rvIU(yOlJKXNSiyAgOdUTA(I}q9A6Y=<CzP=6JeiP1CFggW?D=T7_Oj)PSXEU&V
z_loZA+P$&@*D0hY`X1vAu(4a1fSXD@@_iGFcmGdXIJYtC=2gUOIHI0?(EwSC1Hb=1
z5%oEapfKRzV2$q}!3+G)6B7ep?*7*_vLzmUA7eUl-dgwo$2kLC5-A*|##c8WT$STd
ziHY9_?*9F}SEl0D|LC~Y>~jXXFi|=);H%`TIFMXp{A7yf_~?KsQElau8{qg|KDRU=
zbs)7M?Y6|D_?QxXZQx;8wwi%tA_d=?@HTpTvOxb_7!mO{_|TLs-YytOZnc4bNbrj2
zTZNYy;2rpi4s7uqIJyMS4~O{kw(;s2Nake=?;zZ1k$vAay<3Av15Lix4Yce)yiLG!
z{Liyni>C&Jq;X1?s1@|&WD9)n-ijk%3u<c0_LcKnVL*C^67SpeG<afwOMx(s%z%Xl
z#YOR{&-vUx6`mT%77UD`QaWHRR63Kn`}yd7o1Pj^4NwPc95$jFOGP4n3=94l@WjBH
zHBHH5hyy{k$V8Ic$-~J_&xS_>Yfw$TW26RbT9Dm~OAZ<2+3-M8khCVLNj_#v4iq<H
z>`6(_PDkPMsHSY?z^WdU_hgf&e-<8<#FT9@y2Qg6wTs#8!JkJ5!GO92E8^ivKQnkH
z!9nXR2=M0+Jf|dyvMncCL?gSmc<Xbb6G;s8CWP#4X~E&=>}>whzkp7ZBvo%!$!@VV
z-ZLmkE(EHQ|21$bB}ZMhM)`UAcd`Zj8`1yKbJde)(qn)SX?qnw8%gsa8QEKGUn6Y?
zv8_NqX6+EZ{R3-v;@c-!yRH0jVSu0b_Da@%$hW;^!wCbP;M?4QtN3;s`S2XzC$UWd
zkHvO~495X~5Ze@ZO>8^J@SK5FV!MqTPYp=$)PS-ru|o|>>`+6>w!|Jacum@Nuxy`@
zw%b~^S4rD#EZZQHMOzjQ24t%(3l{@cwq@aBz)#zjr3VxAbKBSCZHND~pRR2yzfaq?
zHUGBSw(3vWwpGuz-VdAa*9mD`<^8-SZL7TB%Jo1Nu(IuKx!%}XpOovF#d>!_Y`0Zg
zFO}=5a=lfq$IA6uxt?3B_b2!^w;w3?3*~;I+;5cok;Q(c+|QKzopL|4*e{j)sdB%y
J*pFMU{{^-|;NJiM

literal 0
HcwPel00001

diff --git a/guiserver/pinballs-demo.lsp b/guiserver/pinballs-demo.lsp
new file mode 100644
index 0000000..0165b15
--- /dev/null
+++ b/guiserver/pinballs-demo.lsp
@@ -0,0 +1,116 @@
+#!/usr/bin/newlisp
+;; pinballs-demo.lsp - demos animations and gs:check-event function
+
+;; GS 1.05+
+;; v0.1
+;;
+;; PinBalls, Cormullion wanted collision, Cormullion got collision ;-)
+;;
+;;
+;; There are different ways to detect collisions with figures, here is an
+;; example that uses a circle.
+;;
+;; In the current GS there is not x,y tag detection nor the option to draw
+;; a circle using floats. So you have to be inventive ;-)
+;;
+;; This example uses gs:draw-circle and stores a imagionary boundry in BOUNDS
+;; per circle/BALL. These are the collision boundry's.
+;;
+;; The calculation is done on the edge of the BALL calls CIRCLE-DOTS. The
+;; more CIRCLE-DOTS the more detection. The more BALLS's the more calculations.
+;;
+;; you can change the quoted line in the code that draws its own circle!
+;; if you use that you will see that GS is unable to do floats because the
+;; BALL looks a little eaten. (takes more performance too!)
+;;
+;; Change the RADIUS to change to size of the BALL.
+;;
+;; BALL collision is done in 4 quadrants, this is easier then calculate them
+;; on every 360 dgr. Here we take a default of 4 x 4 for speed angle.
+;;
+;; behaviour can change per system, if you run GS with your webbrowser open
+;; (that uses JAVA or flash) you could notice stottering of the applet.
+;;
+;; Enjoy, Norman. (c) 2007
+;; (some changes for addition to demos by L.M.)
+
+(set-locale "C")
+(seed ((now) 6))
+(load (append (env "NEWLISPDIR") "/guiserver.lsp"))
+
+(gs:init)
+(gs:get-screen)
+(set 'ww 500 'wh 500 'sw (gs:screen 0) 'sh (gs:screen 1))
+(gs:frame 'F  (- (div sw 2) (div ww 2)) (- (div sh 2) (div wh 2)) ww (+ wh 20) "PinBalls")
+(gs:canvas 'C)
+(gs:set-resizable 'F nil)
+(gs:set-font 'C "Monospaced" 8 "bold")
+(gs:set-background 'C gs:black) 
+(gs:add-to 'F 'C)
+(gs:set-visible 'F true)
+
+;; set variables
+(set 'RADIUS 40 'CIRCLE-DOTS 256 'BALLS 5)
+(define (rcolor) (list (random) (random) (random)))
+(gs:set-stroke 3)
+
+;; updates the current circle bounds
+(define (update-circle c x y, r)
+(set (sym c) '())
+ (dotimes (r CIRCLE-DOTS)
+  (push (list (+ x (mul RADIUS (cos r))) (+ y (mul RADIUS (sin r)))) (eval (sym c)) -1))
+   (push (eval (sym c)) BOUNDS -1))
+
+;; needs to draws my own circle
+(dotimes (t BALLS)
+(set 'x (+ RADIUS (rand 400)) 'y (+ RADIUS (rand 400)))
+ (update-circle (string "O" t) x y)
+    (gs:draw-circle (string "C" t) x y RADIUS (rcolor))
+    (gs:draw-circle (string "C" t) x y ( - RADIUS 5) (rcolor))
+    (gs:draw-text (string "C" t) (string t) (- x 1) y gs:white)
+    (push (list (string "C" t) x y 0 3 (string "O" t)) CIRCLE -1))
+
+;; define pseudo hit-angle action
+(set 'M '(-3 -2 -1) 'P (map abs M))
+(define (flip) (apply amb (append M P)))
+(define (flap) (apply amb M))
+(define (flop) (apply amb P))
+
+(while (gs:check-event 10000)
+	(dolist (L CIRCLE) 
+		(set 'tx (L 1))
+		(set 'ty (L 2))
+		(set  'X (L 3))
+		(set  'Y (L 4))
+		(set  'B (BOUNDS 0))
+
+		;; check wall bounds
+		(and (>= tx (- ww  RADIUS )) (set 'X (flap) 'Y (flip)) )
+		(and (<= tx        RADIUS )  (set 'X (flop) 'Y (flip)) )
+		(and (>= ty (- wh  RADIUS )) (set 'X (flip) 'Y (flap)) )
+		(and (<= ty        RADIUS )  (set 'X (flip) 'Y (flop)) )    
+
+		;; with every movement update the circle boundary
+		(pop BOUNDS)
+
+		(dolist (BB BOUNDS) 
+	  	(and (intersect B BB)
+				(or (and (<= ((BB 0) 0) tx) (<= ((BB 0) 1) ty) (set 'X  4 'Y  4 ))
+					(and (>= ((BB 0) 0) tx) (<= ((BB 0) 1) ty) (set 'X -4 'Y  4 ))
+					(and (<= ((BB 0) 0) tx) (>= ((BB 0) 1) ty) (set 'X  4 'Y -4 ))
+					(and (>= ((BB 0) 0) tx) (>= ((BB 0) 1) ty) (set 'X -4 'Y -4 ))
+				)
+			)
+		)
+	
+		(gs:move-tag (L 0) X Y 0 nil)
+		(update-circle (L 5) tx ty)		
+
+		;; update the "per" CIRCLE data	
+		(replace-assoc (L 0) CIRCLE (list (L 0) (inc 'tx X) (inc 'ty Y) X Y (L 5)))
+		(gs:update)
+	)
+)
+
+(exit)
+
diff --git a/guiserver/properties-demo.lsp b/guiserver/properties-demo.lsp
new file mode 100644
index 0000000..904f206
--- /dev/null
+++ b/guiserver/properties-demo.lsp
@@ -0,0 +1,33 @@
+#!/usr/bin/newlisp
+;;
+;; property-demo.lsp - demonstrate gs:get-screen and gs:get-version
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+;;;; describe the GUI
+
+(gs:get-screen)
+(set 'x (/ (- (gs:screen 0) 450) 2))
+(set 'y (/ (- (gs:screen 1) 400) 2))
+
+(gs:frame 'PropertyDemo x y 450 400 "Properties")
+(gs:text-area 'Output 'gs:no-action')
+(gs:set-editable 'Output nil)
+(gs:add-to 'PropertyDemo 'Output) 
+(gs:set-visible 'PropertyDemo true)
+
+(gs:set-text 'Output (join (map string (gs:get-fonts)) "\n"))
+(gs:set-text 'PropertyDemo 
+	(string "GUI-server v." (gs:get-version) 
+			" screen: " (gs:screen 0) "x" (gs:screen 1)
+			", " (gs:screen 2) " dots/inch"))
+
+;;;; listen for incoming action requests and dispatch
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/rotation-demo.lsp b/guiserver/rotation-demo.lsp
new file mode 100644
index 0000000..20ed891
--- /dev/null
+++ b/guiserver/rotation-demo.lsp
@@ -0,0 +1,66 @@
+#!/usr/bin/newlisp
+;;
+;; rotationn-demo.lsp - demonstrate gs:rotate-tag, gs:translate-tag and  gs:scale-tag
+;; and the mouse-wheel rotating an object
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+;(gs:set-trace true)
+
+;;;; describe the GUI
+(gs:frame 'RotationDemo  100 100 600 600 "Image demo")
+(gs:set-border-layout 'RotationDemo)
+;(gs:set-resizable 'RotationDemo nil)
+(gs:canvas 'MyCanvas)
+(gs:set-background 'MyCanvas gs:white)
+(gs:panel 'Select)
+(gs:radio-button 'ZoomButton 'zoom-action "zoom")
+(gs:radio-button 'TurnButton 'turn-action "turn")
+(gs:set-selected 'TurnButton true)
+(set 'turn-flag true)
+(gs:add-to 'Select 'ZoomButton 'TurnButton)
+(gs:add-to 'RotationDemo 'MyCanvas "center" 'Select "south")
+(gs:mouse-wheel 'MyCanvas 'mouse-wheel-action)
+
+;(gs:set-scale 0.5 0.5) ; only for testing
+
+(gs:set-font 'MyCanvas "Lucida Sans Oblique" 14 "plain")
+(gs:draw-text 'T "turn mouse wheel to turn or zoom image" 20 50 gs:darkGray)
+(gs:fill-circle 'C 0 0 50 gs:red)
+(gs:fill-circle 'C -40 -40 30 gs:black)
+(gs:fill-circle 'C 40 -40 30 gs:black)
+(gs:fill-circle 'C 0 10 8 gs:yellow)
+(gs:translate-tag 'C 300 300)
+
+(gs:set-visible 'RotationDemo true)
+
+;; actions
+
+(define (zoom-action id flag)
+	(gs:set-selected 'TurnButton (not flag))
+	(set 'turn-flag (not flag))
+)
+
+(define (turn-action id flag)
+	(gs:set-selected 'ZoomButton (not flag))
+	(set 'turn-flag flag)
+)
+
+(define (mouse-wheel-action x y wheel)
+	(if turn-flag
+		(gs:rotate-tag 'C wheel 0 0)
+		(if (< wheel 0)
+				(gs:scale-tag 'C 0.9 0.9)
+				(gs:scale-tag 'C 1.1 1.1)
+		)
+	)
+)
+
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/shapes-demo.lsp b/guiserver/shapes-demo.lsp
new file mode 100644
index 0000000..9d5d653
--- /dev/null
+++ b/guiserver/shapes-demo.lsp
@@ -0,0 +1,122 @@
+#!/usr/bin/newlisp
+;;
+;; shapes-demo.lsp - demonstrate different lines, outlines and shapes
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+;; subroutines for random shapes
+
+(define (random-draw-line)
+	(gs:draw-line 'L (rand 640) (rand 640) (rand 640) (rand 640) (list (random) (random) (random))))
+
+(define (random-draw-rect)
+	(gs:draw-rect 'R (rand 640) (rand 640) (rand 100) (rand 100) (list (random) (random) (random))))
+
+(define (random-fill-rect)
+	(gs:fill-rect 'R (rand 640) (rand 640) (rand 100) (rand 100) (list (random) (random) (random))))
+
+(define (random-draw-round-rect)
+	(gs:draw-round-rect 'R (rand 640) (rand 640) (rand 100) (rand 100) 
+			(rand 40) (rand 40) (list (random) (random) (random))))
+
+(define (random-fill-round-rect)
+	(gs:fill-round-rect 'R (rand 640) (rand 640) (rand 100) (rand 100) 
+			(rand 40) (rand 40) (list (random) (random) (random))))
+
+(define (random-draw-circle)
+	(gs:draw-circle 'C (rand 640) (rand 640) (rand 100)  (list (random) (random) (random))))
+
+(define (random-fill-circle)
+	(gs:fill-circle 'C (rand 640) (rand 640) (rand 100)  (list (random) (random) (random))))
+
+(define (random-draw-ellipse)
+	(gs:draw-ellipse 'E (rand 640) (rand 640) (rand 100)  (rand 100) (list (random) (random) (random))))
+
+(define (random-fill-ellipse)
+	(gs:fill-ellipse 'E (rand 640) (rand 640) (rand 100)  (rand 100) (list (random) (random) (random))))
+
+(define (random-draw-arc)
+	(gs:draw-arc 'A (rand 640) (rand 640) (rand 100) (rand 100) (rand 360) (rand 360) (list (random) (random) (random))))
+
+(define (random-fill-arc)
+	(gs:fill-arc 'A (rand 640) (rand 640) (rand 100) (rand 100) (rand 360) (rand 360) (list (random) (random) (random))))
+
+(gs:init) 
+;(gs:set-trace true)
+
+;;;; describe the GUI
+(gs:frame 'ShapesDemo 100 100 640 640 "Random lines, rectangles, circles, ellipses and arcs Demo")
+(gs:set-border-layout 'ShapesDemo)
+(gs:canvas 'MyCanvas 'ShapesDemo)
+(gs:panel 'Selection)
+(gs:label 'HelpText "show or hide shapes:")
+(gs:check-box 'LineSelect 'select-action "lines") 
+(gs:check-box 'RectangleSelect 'select-action "rectangles") 
+(gs:check-box 'CircleSelect 'select-action "circles") 
+(gs:check-box 'EllipseSelect 'select-action "ellipse") 
+(gs:check-box 'ArcSelect 'select-action "arcs") 
+(gs:set-selected 'LineSelect true 'RectangleSelect true 'CircleSelect true 'EllipseSelect true 'ArcSelect true)
+(gs:add-to 'Selection 'HelpText 'LineSelect 'RectangleSelect 'CircleSelect 'EllipseSelect 'ArcSelect)
+(gs:add-to 'ShapesDemo 'MyCanvas "center" 'Selection "south")
+(gs:set-background 'MyCanvas gs:white)
+
+; default color if not specified in shape or text
+(gs:set-paint gs:darkGray) 
+
+;(gs:set-translation 100 100) ;only for test, will shift everything
+;(gs:set-scale 0.5 0.5) ; only for testing scrinks or zooms
+;(gs:set-rotation 10) ; only for testing tilts by 10 degree
+
+
+
+(println (time-of-day))
+(dotimes (i 20)
+	(random-draw-line)
+	(random-draw-rect)
+	(random-fill-rect)
+	(random-draw-round-rect)
+	(random-fill-round-rect)
+	(random-draw-circle)
+	(random-fill-circle)
+	(random-draw-ellipse)
+	(random-fill-ellipse)
+	(random-draw-arc)
+	(random-fill-arc)
+)
+(println (time-of-day))
+
+(gs:set-font 'MyCanvas "Lucida Sans Regular" 40 "italic")
+(gs:draw-text 'T "Random"  60 100)
+(gs:set-font 'MyCanvas "Monospaced" 40 "plain")
+(gs:draw-text 'T "Shapes and Outlines"  60 160 gs:green -15)
+;(gs:draw-text 'T "Third text line"  60 220) ; only for testing
+
+(gs:set-visible 'ShapesDemo true)
+
+;; action handler
+
+(define (select-action id flag)
+	(set 'tag (case id
+		("MAIN:LineSelect" 'L)
+		("MAIN:RectangleSelect" 'R)
+		("MAIN:CircleSelect" 'C)
+		("MAIN:EllipseSelect" 'E)
+		("MAIN:ArcSelect" 'A))
+	)
+	(if flag 
+		(gs:show-tag tag) 
+		(gs:hide-tag tag)
+	)
+)
+
+(gs:add-to 'Selection 'HelpText 'LineSelect 'RectangleSelect 'CircleSelect 'EllipseSelect 'ArcSelect)
+;;;; listen for incoming action requests and dispatch
+
+;(gs:export "shapes.png") ; just for testing
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/sound-demo.lsp b/guiserver/sound-demo.lsp
new file mode 100644
index 0000000..5ebed02
--- /dev/null
+++ b/guiserver/sound-demo.lsp
@@ -0,0 +1,35 @@
+#!/usr/bin/newlisp
+;;
+; button-demo.lsp - demonstrate the button control
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+;(gs:set-trace true)
+
+(constant (global 'home-dir) (or (env "HOME") (env "USERPROFILE") (env "DOCUMENT_ROOT") ""))
+
+;;;; describe the GUI
+(gs:frame 'SoundDemo 100 100 200 100 "Sound Demo")
+(gs:set-flow-layout 'SoundDemo "center" 20 20)
+(gs:button 'aSound 'button-action "Choose Sound File")
+(gs:add-to 'SoundDemo 'aSound)
+(gs:set-visible 'SoundDemo true)
+
+;;;; define actions
+(define (button-action)
+	(gs:open-file-dialog 'SoundDemo 'openfile-action  home-dir
+		".aif .wav" "Sound files .wav and .aif")
+)
+
+(define (openfile-action id  op file)
+	(if file (gs:play-sound (base64-dec file)))
+)
+
+;;;; listen for incoming action requests and dispatch
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/stroke-demo.lsp b/guiserver/stroke-demo.lsp
new file mode 100644
index 0000000..e0d5fc2
--- /dev/null
+++ b/guiserver/stroke-demo.lsp
@@ -0,0 +1,100 @@
+#!/usr/bin/newlisp
+;;
+;; strokes-demo.lsp - demonstrate strokes with round endings in different lines and outlines
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+;; subroutines for random shapes
+
+
+(define (random-draw-line)
+	(gs:draw-line 'L (rand 640) (rand 640) (rand 640) (rand 640) (list (random) (random) (random))))
+
+(define (random-draw-rect)
+	(gs:draw-rect 'R (rand 640) (rand 640) (rand 100) (rand 100) (list (random) (random) (random))))
+
+(define (random-draw-round-rect)
+	(gs:draw-round-rect 'R (rand 640) (rand 640) (rand 100) (rand 100) 
+			(rand 40) (rand 40) (list (random) (random) (random))))
+
+(define (random-draw-circle)
+	(gs:draw-circle 'C (rand 640) (rand 640) (rand 100)  (list (random) (random) (random))))
+
+(define (random-draw-ellipse)
+	(gs:draw-ellipse 'E (rand 640) (rand 640) (rand 100)  (rand 100) (list (random) (random) (random))))
+
+(define (random-draw-arc)
+	(gs:draw-arc 'A (rand 640) (rand 640) (rand 100) (rand 100) (rand 360) (rand 360) (list (random) (random) (random))))
+
+(gs:init) 
+;(gs:set-trace true)
+
+;;;; describe the GUI
+(gs:frame 'StrokesDemo 100 100 640 640 "Random lines, rectangles, circles, ellipses and arcs Demo")
+(gs:set-border-layout 'StrokesDemo)
+(gs:canvas 'MyCanvas 'StrokesDemo)
+(gs:panel 'Selection)
+(gs:label 'HelpText "show or hide shapes:")
+(gs:check-box 'LineSelect 'select-action "lines") 
+(gs:check-box 'RectangleSelect 'select-action "rectangles") 
+(gs:check-box 'CircleSelect 'select-action "circles") 
+(gs:check-box 'EllipseSelect 'select-action "ellipse") 
+(gs:check-box 'ArcSelect 'select-action "arcs") 
+(gs:set-selected 'LineSelect true 'RectangleSelect true 'CircleSelect true 'EllipseSelect true 'ArcSelect true)
+(gs:add-to 'Selection 'HelpText 'LineSelect 'RectangleSelect 'CircleSelect 'EllipseSelect 'ArcSelect)
+(gs:add-to 'StrokesDemo 'MyCanvas "center" 'Selection "south")
+(gs:set-background 'MyCanvas gs:white)
+
+; default color if not specified in shape or text
+(gs:set-paint gs:darkGray) 
+
+;(gs:set-translation 100 100) ;only for test, will shift everything
+;(gs:set-scale 0.5 0.5) ; only for testing scrinks or zooms
+
+(println (time-of-day))
+(dotimes (i 25)
+	(gs:set-stroke (rand 16) "round")
+	(random-draw-line)
+	(random-draw-rect)
+	(random-draw-round-rect)
+	(random-draw-circle)
+	(random-draw-ellipse)
+	(random-draw-arc)
+)
+(println (time-of-day))
+
+(gs:set-font 'MyCanvas "Lucida Sans Regular" 40 "italic")
+(gs:draw-text 'T "Random"  60 100)
+(gs:set-font 'MyCanvas "Monospaced" 40 "plain")
+(gs:draw-text 'T "Outlines and strokes"  60 160 gs:green -15)
+;(gs:draw-text 'T "Third text line"  60 220) ; only for testing
+
+(gs:set-visible 'StrokesDemo true)
+
+;; action handler
+
+(define (select-action id flag)
+	(set 'tag (case id
+		("MAIN:LineSelect" 'L)
+		("MAIN:RectangleSelect" 'R)
+		("MAIN:CircleSelect" 'C)
+		("MAIN:EllipseSelect" 'E)
+		("MAIN:ArcSelect" 'A))
+	)
+	(if flag 
+		(gs:show-tag tag) 
+		(gs:hide-tag tag)
+	)
+)
+
+(gs:add-to 'Selection 'HelpText 'LineSelect 'RectangleSelect 'CircleSelect 'EllipseSelect 'ArcSelect)
+;;;; listen for incoming action requests and dispatch
+
+;(gs:export "shapes.png") ; just for testing
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/tabs-demo.lsp b/guiserver/tabs-demo.lsp
new file mode 100644
index 0000000..d458dc6
--- /dev/null
+++ b/guiserver/tabs-demo.lsp
@@ -0,0 +1,91 @@
+#!/usr/bin/newlisp
+;;
+;; tabs-demo.lsp - demonstrate tabs and icons
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+(gs:get-screen)
+(set 'x (/ (- (gs:screen 0) 450) 2)) 
+(set 'y (/ (- (gs:screen 1) 580) 2))
+
+;;;; describe the GUI
+
+(gs:frame 'TheFrame x y 450 580 "Tabbed Pane Demo")
+;; When mapping gs:xxx functions the quote before gs:xxx is important
+;; so the functions get executed woth gs as the current context which makes
+;; the names from wigets be prefixed with their proper context name.
+(map 'gs:panel '(first second third icons))
+(gs:set-color 'first 1 0 0)
+(gs:set-color 'second 0 1 0)
+(gs:set-color 'third 0 0 1)
+(gs:set-color 'icons 0 0 1 0.1)
+(gs:set-flow-layout 'icons "center" 30 50)
+
+(gs:label 'new "new")
+(gs:label 'edit "edit")
+(gs:label 'cut "cut")
+(gs:label 'copy "copy")
+(gs:label 'paste "paste")
+(gs:label 'folder "folder")
+(gs:label 'openfolder "openfolder")
+(gs:label 'save "save")
+(gs:label 'info "info")
+(gs:label 'run "run")
+(gs:label 'restart "restart")
+(gs:label 'stop "stop")
+(gs:label 'fontbook "fontbook")
+(gs:label 'clear "clear")
+(gs:label 'search "search")
+
+;; if an icon path is prefixed with /local/ it means that this
+;; icon is built-in to guiserver.jar. Other paths to user
+;; supplied external icon images can be used instead (gif, jpg, png)
+(gs:set-icon 'new "/local/new32.png")
+(gs:set-icon 'edit "/local/edit32.png")
+(gs:set-icon 'cut "/local/cut32.png")
+(gs:set-icon 'copy "/local/copy32.png")
+(gs:set-icon 'paste "/local/paste32.png")
+(gs:set-icon 'folder "/local/folder-closed32.png")
+(gs:set-icon 'openfolder "/local/folder-opened32.png")
+(gs:set-icon 'save "/local/save32.png")
+(gs:set-icon 'info "/local/info32.png")
+(gs:set-icon 'run "/local/run32.png")
+(gs:set-icon 'restart "/local/restart32.png")
+(gs:set-icon 'stop "/local/stop32.png")
+(gs:set-icon 'fontbook "/local/font-book32.png")
+(gs:set-icon 'clear "/local/clear32.png")
+(gs:set-icon 'search "/local/search32.png")
+
+; an alternative way to make labels with icons
+(gs:image-label 'newLISP "/local/newLISP32.png")
+(gs:set-text 'newLISP "newLISP")
+(gs:image-label 'newLISPlogo "/local/newLISP128.png")
+
+(gs:add-to 'icons 'new 'edit 'cut 'copy 'paste 'folder 'openfolder 'save)
+(gs:add-to 'icons 'info 'run 'restart 'stop 'fontbook 'clear 'search 'newLISP 'newLISPlogo)
+
+(gs:tabbed-pane 'MyTabs 'tabs-action "top"
+			'first "first tab"
+			'second "second tab"
+			'third "third tab")
+
+(gs:insert-tab 'MyTabs 'icons "icons tab" 3 "/local/newLISP16.png")
+;(gs:remove-tab 'MyTabs 0) ; just for test
+(gs:request-focus 'MyTabs 3)
+(gs:add-to 'TheFrame 'MyTabs) 
+(gs:set-visible 'TheFrame true)
+
+;;;; define actions
+
+(define (tabs-action id cid tab)
+	(println id " " cid " " (base64-dec tab)))
+
+;;;; listen for incoming action requests and dispatch
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/textrot-demo.lsp b/guiserver/textrot-demo.lsp
new file mode 100644
index 0000000..1d6ad28
--- /dev/null
+++ b/guiserver/textrot-demo.lsp
@@ -0,0 +1,42 @@
+#!/usr/bin/newlisp
+;;
+;; textrot-demo.lsp - demonstrate gs:rotate-tag on text
+;; and the mouse-wheel rotating an object
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+;(gs:set-trace true)
+
+;;;; describe the GUI
+(gs:frame 'RotationDemo 100 100 400 300 "Rotate text and widgets on a canvas")
+(gs:set-resizable 'RotationDemo nil)
+(gs:canvas 'MyCanvas 'RotationDemo)
+(gs:button 'TheButton 'button-action "Exit")
+(gs:set-background 'TheButton gs:white)
+(gs:add-to 'MyCanvas 'TheButton)
+(gs:set-stroke 3.0)
+(gs:set-background 'MyCanvas gs:white)
+(gs:mouse-wheel 'MyCanvas 'mouse-wheel-action)
+(gs:add-to 'RotationDemo 'MyCanvas)
+
+(gs:set-font 'MyCanvas "Lucida Sans Oblique" 36 "plain")
+(gs:fill-rect 'R 200 100 60 60 gs:lightGray 0.1)
+(gs:draw-text 'T "turn mouse wheel" 50 130 gs:red -15)
+(gs:fill-rect 'R 100 100 60 60 gs:lightGray 0.1)
+
+(gs:set-visible 'RotationDemo true)
+
+(define (mouse-wheel-action x y wheel)
+	(gs:rotate-tag 'T wheel 50 130)
+)
+
+(define (button-action)
+	(exit 0))
+
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/uppercase.lsp b/guiserver/uppercase.lsp
new file mode 100644
index 0000000..23be5b0
--- /dev/null
+++ b/guiserver/uppercase.lsp
@@ -0,0 +1,6 @@
+;; demo script: uppercase.lsp
+;; this script is registered in the Tool menu of newlisp-edit.lsp
+
+(print (upper-case (read-file (main-args 2))))
+
+(exit)
diff --git a/guiserver/widgets-demo.lsp b/guiserver/widgets-demo.lsp
new file mode 100644
index 0000000..59eb573
--- /dev/null
+++ b/guiserver/widgets-demo.lsp
@@ -0,0 +1,161 @@
+#!/usr/bin/newlisp
+;;
+;; widgets-demo.lsp - demonstrate all widgets
+
+
+;;;; initialization
+(set-locale "C")
+(load (append (env "NEWLISPDIR") "/guiserver.lsp")) 
+
+(gs:init) 
+
+;(gs:set-trace true)
+
+;(gs:set-look-and-feel "com.sun.java.swing.plaf.motif.MotifLookAndFeel")
+;(gs:set-look-and-feel "javax.swing.plaf.metal.MetalLookAndFeel")
+;(gs:set-look-and-feel "com.sun.java.swing.plaf.windows.WindowsLookAndFeel") ;????
+;(gs:set-look-and-feel "javax.swing.plaf.mac.MacLookAndFeel") ; ????
+
+;;;; describe the GUI
+(gs:frame 'WidgetsDemo 200 40 640 640 "Widgets Demo")
+(gs:set-grid-layout 'WidgetsDemo 5 1 10 1)
+
+;; the monitor area
+(gs:text-area 'MonitorArea 'action-handler)
+(gs:set-editable 'MonitorArea nil)
+(gs:set-background 'MonitorArea 0.5 0.5 0.5)
+(gs:set-font 'MonitorArea "Monospaced" 12 "plain")
+(gs:set-foreground 'MonitorArea 1 1 0.0)
+
+;; the button panel
+(gs:panel 'ButtonPanel)
+(gs:set-flow-layout 'ButtonPanel "left" 10 10)
+(gs:set-titled-border 'ButtonPanel "buttons")
+(gs:button 'TheButton 'button-handler "button")
+;(gs:set-color 'TheButton 1 0 0) ; just for testing
+(gs:image-button 'TheImageButton 'action-handler "/local/newLISP32.png")
+(gs:toggle-button 'TheToggleButton 'action-handler " ")
+;(gs:set-selected 'TheToggleButton true)
+(gs:radio-button 'TheRadioButton 'action-handler "radio button")
+;(gs:set-selected 'TheRadioButton true)
+(gs:check-box 'TheCheckBox 'action-handler "check box")
+(gs:set-selected 'TheCheckBox true)
+(gs:button 'TheMessage 'action-handler "press")
+(gs:add-to 'ButtonPanel 'TheButton 'TheImageButton 'TheToggleButton 'TheRadioButton 'TheCheckBox 'TheMessage)
+
+;; list and combo boxes
+(gs:panel 'ListPanel)
+(gs:set-flow-layout 'ListPanel "center"  50 1)
+(gs:set-titled-border 'ListPanel "combox-box and list-box")
+(gs:combo-box 'TheComboBox 'action-handler "one" "two" "three")
+(gs:set-background 'TheComboBox 1.0 0.9 0.9)
+(gs:set-foreground 'TheComboBox 0 0 1)
+(gs:set-font 'TheComboBox "Lucida Serif Typewriter" 14 "plain")
+(gs:list-box 'TheListBox 'action-handler "first entry" "second entry" "third entry")
+(gs:set-background 'TheListBox 1.0 0.9 0.9)
+(gs:set-foreground 'TheListBox 0 0 1)
+(gs:set-size 'TheListBox 200 80)
+(gs:add-list-item 'TheListBox "fourth entry" "fifth entry" "sixth entry" "seventh entry")
+(gs:add-list-item 'TheListBox "eight entry")
+(gs:insert-list-item 'TheListBox "double-click me" 2)
+;(gs:remove-list-item 'TheListBox 2) ; just for testing
+(gs:add-to 'ListPanel 'TheComboBox 'TheListBox )
+
+;; text entry widgets
+(gs:panel 'TextPanel)
+(gs:set-flow-layout 'TextPanel "left" 10 1)
+(gs:set-titled-border 'TextPanel "text-field and text-area")
+(gs:text-field 'TheTextField 'textfield-handler 10)
+(gs:set-background 'TheTextField 0.7 0.8 0.8)
+(gs:text-area 'TheTextArea 'textarea-handler 160 80)
+(gs:set-background 'TheTextArea 0.7 0.8 0.8)
+(gs:button 'GetTextFieldButton 'gettextfield-handler "get text field")
+(gs:button 'GetTextAreaButton 'gettextarea-handler "get text area")
+(gs:add-to 'TextPanel 'TheTextField 'TheTextArea 'GetTextFieldButton  'GetTextAreaButton)
+
+;; slider, progress-bar and scroll-area
+(gs:panel 'SlidePanel)
+(gs:set-titled-border 'SlidePanel "slider, progress-bar and scroll-pane")
+(gs:set-flow-layout 'SlidePanel "left" 20 1)
+(gs:slider 'TheSlider 'slider-handler "horizontal" 1 100 30)
+(gs:label 'SliderStatus "30" "right" 30 10)
+(gs:progress-bar 'TheProgress 1 100 30)
+(gs:image-label 'TheLogo "/local/newLISP128.png")
+(gs:scroll-pane 'TheScrollPane 'TheLogo 100 90)
+
+(gs:add-to 'SlidePanel 'TheSlider 'SliderStatus 'TheProgress 'TheScrollPane)
+
+
+;; add all panels to the grid laount in the main frame
+(gs:add-to 'WidgetsDemo 'MonitorArea 'ButtonPanel 'ListPanel 'TextPanel 'SlidePanel)
+
+(gs:set-visible 'WidgetsDemo true)
+
+;;;; define actions
+
+(define (button-handler)
+	(gs:dialog 'TheDialog 'WidgetsDemo "A Dialog Window" 300 200 true true))
+
+
+;; several widgets can be served by one handler
+;; the first parameter is always the source of the event
+(define (action-handler)
+	(if (= "MAIN:TheToggleButton" (args 0))
+		(if (true? (args 1))
+			(gs:disable 'TheButton 'TheImageButton 'TheRadioButton 'TheCheckBox 'TheMessage)
+			(gs:enable 'TheButton 'TheImageButton 'TheRadioButton 'TheCheckBox 'TheMessage)
+		))
+
+	(if (= "MAIN:TheImageButton" (args 0))
+		(gs:color-dialog 'WidgetsDemo 'action-handler "Choose a color" 1 1 1))
+
+	(if (= "MAIN:TheMessage" (args 0))
+		(gs:confirm-dialog 'WidgetsDemo 'action-handler 
+				"A Message" "Enjoy GUI server" 
+				"yes-no"
+				;(amb "error" "informaton" "warning" "question" "plain")
+		))
+
+	(let (s "")
+		(doargs (item)
+			(write-buffer s (string item " ")))
+		(write-buffer s "\n")
+		(gs:append-text 'MonitorArea s)
+	)
+)
+
+(define (textfield-handler id text)
+	(gs:append-text 'MonitorArea (base64-dec text))
+	(gs:append-text 'MonitorArea "\n")
+	(gs:add-list-item 'TheListBox (base64-dec text))
+	(gs:add-list-item 'TheComboBox (base64-dec text))
+)
+
+(define (textarea-handler)) ; not interested in keystrokes
+
+(define (gettextarea-handler id text)
+	(gs:get-text 'TheTextArea 'gettextcallback-handler)
+)
+
+(define (gettextfield-handler id text)
+	(gs:get-text 'TheTextField 'gettextcallback-handler)
+)
+
+(define (gettextcallback-handler id text)
+	(if text
+		(begin
+			(gs:append-text 'MonitorArea (base64-dec text))
+			(gs:append-text 'MonitorArea "\n"))
+	)
+)
+
+(define (slider-handler id value)
+	(gs:set-text 'SliderStatus (string value))
+	(gs:set-value 'TheProgress value)
+)
+
+;;;; listen for incoming action requests and dispatch
+(gs:listen)
+
+;; eof
+
diff --git a/guiserver/word-count.lsp b/guiserver/word-count.lsp
new file mode 100644
index 0000000..de3e027
--- /dev/null
+++ b/guiserver/word-count.lsp
@@ -0,0 +1,10 @@
+;; demo script: word-count.lsp
+;; this script is registered in the Tool menu of newlisp-edit.lsp
+
+(set 'content (read-file (main-args 2)))
+
+(println 
+	"Words: " (length (find-all "\\w+" content))
+  " Bytes: " ((file-info (main-args 2)) 0))
+
+(exit)
diff --git a/makefile_bsd b/makefile_bsd
new file mode 100644
index 0000000..6cee3a1
--- /dev/null
+++ b/makefile_bsd
@@ -0,0 +1,25 @@
+# makefile for newLISP v. 9.x.x on BSDs: FreeBSD, OpenBSD
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+# the option -fno-strict-aliasing may not be available on some BSD versions 
+
+CFLAGS = -Wall -Wno-uninitialized -fno-strict-aliasing -O2 -c -g -DREADLINE -D_BSD
+# for netBSD use following line
+#CFLAGS = -Wall -Wno-uninitialized -Wno-strict-aliasing -O2 -c -g -D_BSD
+
+CC = gcc
+
+default: $(OBJS)
+	$(CC) $(OBJS) -g -lm -lreadline -lncurses -o newlisp
+# for netBSD use following line
+#	$(CC) $(OBJS) -g -lm -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_bsd
+
diff --git a/makefile_bsd_IPv6 b/makefile_bsd_IPv6
new file mode 100644
index 0000000..746cc25
--- /dev/null
+++ b/makefile_bsd_IPv6
@@ -0,0 +1,25 @@
+# makefile for newLISP v. 9.x.x on BSDs: FreeBSD, OpenBSD and IPv6 potocol
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+# the option -fno-strict-aliasing may not be available on some BSD versions 
+
+CFLAGS = -Wall -Wno-uninitialized -fno-strict-aliasing -O2 -c -g -DREADLINE -D_BSD -DIPV6
+# for netBSD use following line
+#CFLAGS = -Wall -Wno-uninitialized -Wno-strict-aliasing -O2 -c -g -D_BSD -DIPV6
+
+CC = gcc
+
+default: $(OBJS)
+	$(CC) $(OBJS) -g -lm -lreadline -lncurses -o newlisp
+# for netBSD use following line
+#	$(CC) $(OBJS) -g -lm -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_bsd
+
diff --git a/makefile_bsd_lib b/makefile_bsd_lib
new file mode 100644
index 0000000..5b9ba77
--- /dev/null
+++ b/makefile_bsd_lib
@@ -0,0 +1,18 @@
+# makefile for newLISP v. 9.x.x on BSD as a shared library - newlisp.so -
+#
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o unix-lib.o
+
+CFLAGS = -Wall -pedantic -Wno-uninitialized -O2 -c -DLIBRARY -D_BSD
+
+CC = gcc
+
+default: $(OBJS)
+	$(CC) $(OBJS) -lm -shared -o newlisp.so
+	strip newlisp.so
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_bsd_lib
+
diff --git a/makefile_bsd_utf8 b/makefile_bsd_utf8
new file mode 100644
index 0000000..ebe2e3a
--- /dev/null
+++ b/makefile_bsd_utf8
@@ -0,0 +1,23 @@
+# makefile for newLISP v. 9.x.x on BSDs: FreeBSD, OpenBSD with UTF8 support
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o nl-utf8.o pcre.o
+
+CFLAGS = -Wall -Wno-uninitialized -O2 -c -g -DREADLINE -D_BSD -DSUPPORT_UTF8
+# for netBSD use following line
+#CFLAGS = -Wall -Wno-uninitialized -O2 -c -g -D_BSD
+
+CC = gcc
+
+default: $(OBJS)
+	$(CC) $(OBJS) -g -lm -lreadline -lncurses -o newlisp
+# for netBSD use following line
+#	$(CC) $(OBJS) -g -lm -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_bsd_utf8
+
diff --git a/makefile_darwin b/makefile_darwin
new file mode 100644
index 0000000..81f3430
--- /dev/null
+++ b/makefile_darwin
@@ -0,0 +1,25 @@
+# makefile for newLISP v. 9.x.x on Mac OSX with readline support
+#
+# for OS X 10.4/Tiger, Tiger comes standard with libreadline
+#
+# needs readline library and headerfiles installed (X tools)
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+#CFLAGS = -Wall -O2 -I/usr/include -c -g -DREADLINE -DMAC_OSX
+CFLAGS = -Wall -I/usr/include -c -g -DREADLINE -DMAC_OSX
+
+CC = cc -L/usr/lib
+
+default: $(OBJS)
+	$(CC) $(OBJS) -g -lm -lreadline -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_darwin
+
+
diff --git a/makefile_darwinLP64 b/makefile_darwinLP64
new file mode 100644
index 0000000..0aca1de
--- /dev/null
+++ b/makefile_darwinLP64
@@ -0,0 +1,25 @@
+# makefile for newLISP v. 9.x.x on Mac OSX LP64 memory model with readline support
+#
+# for OS X 10.4/Tiger, Tiger comes standard with libreadline
+#
+# needs a G5 or core 2 duo to run. Passes 'make test' on intel core 2 duo
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+;CFLAGS = -m64 -Wall -O2 -I/usr/include -c -g -DREADLINE -DMAC_OSX -DNEWLISP64
+CFLAGS = -m64 -Wall -O2 -I/usr/include -c -g -DMAC_OSX -DNEWLISP64
+#CFLAGS = -m64 -Wall -I/usr/include -c -g  -DMAC_OSX -DNEWLISP64
+
+CC = cc -L/usr/lib
+
+default: $(OBJS)
+	$(CC) $(OBJS) -m64 -g -lm -lreadline -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_darwinLP64
+
+
diff --git a/makefile_darwin_i386 b/makefile_darwin_i386
new file mode 100644
index 0000000..ecba220
--- /dev/null
+++ b/makefile_darwin_i386
@@ -0,0 +1,26 @@
+# makefile for newLISP v. 9.x.x on Mac OSX with readline support
+#
+# for OS X 10.4/Tiger, Tiger comes standard with libreadline
+#
+# needs readline library and headerfiles installed (X tools)
+# UNTESTED!
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+CFLAGS = -arch i386 -Wall -O2 -I/usr/include -c -g -DREADLINE -DMAC_OSX
+#CFLAGS = -Wall -I/usr/include -c -g -DREADLINE -DMAC_OSX
+
+CC = cc -L/usr/lib
+
+default: $(OBJS)
+	$(CC) $(OBJS) -arch i386 -g -lm -lreadline -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_darwin_i386
+
+
diff --git a/makefile_darwin_lib b/makefile_darwin_lib
new file mode 100644
index 0000000..08e0331
--- /dev/null
+++ b/makefile_darwin_lib
@@ -0,0 +1,23 @@
+# makefile for newLISP v. 9.x.x on Mac OSX as a newlisp.dylib
+#
+# all versions MacOS X
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o unix-lib.o
+
+
+CFLAGS = -Wall -O2 -c -DMAC_OSX -DLIBRARY 
+
+CC = cc
+
+default: $(OBJS)
+	$(CC) $(OBJS) -g -lm -bundle -o newlisp.dylib
+#	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_darwin_lib
+
+
diff --git a/makefile_darwin_utf8 b/makefile_darwin_utf8
new file mode 100644
index 0000000..71d4de1
--- /dev/null
+++ b/makefile_darwin_utf8
@@ -0,0 +1,22 @@
+# makefile for newLISP v. 9.x.x on Mac OSX with readline support
+#
+# needs readline library and headerfiles installed (X tools)
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o nl-utf8.o pcre.o
+
+CFLAGS = -Wall -O2 -I/usr/include -c -g -DREADLINE -DMAC_OSX -DSUPPORT_UTF8
+
+CC = cc -L/usr/lib
+
+default: $(OBJS)
+	$(CC) $(OBJS) -g -lm -lreadline -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_darwin_utf8
+
+
diff --git a/makefile_darwin_utf8_IPv6 b/makefile_darwin_utf8_IPv6
new file mode 100644
index 0000000..0e61d14
--- /dev/null
+++ b/makefile_darwin_utf8_IPv6
@@ -0,0 +1,22 @@
+# makefile for newLISP v. 9.x.x on Mac OSX with UTF-8 and readline support and IPV6
+#
+# needs readline library and headerfiles installed (X tools)
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o nl-utf8.o pcre.o
+
+CFLAGS = -Wall -O2 -I/usr/include -c -g -DREADLINE -DMAC_OSX -DSUPPORT_UTF8 -DIPV6
+
+CC = cc -L/usr/lib
+
+default: $(OBJS)
+	$(CC) $(OBJS) -g -lm -lreadline -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_darwin_utf8
+
+
diff --git a/makefile_debian b/makefile_debian
new file mode 100644
index 0000000..ee6a0d9
--- /dev/null
+++ b/makefile_debian
@@ -0,0 +1,26 @@
+# makefile for newLISP v. 9.x.x on LINUX with readline lib support
+#
+# Note, that readline support may require different libraries on different OSs
+# 
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+#CFLAGS = -Wall -pedantic -Wno-uninitialized -c -O2 -g -DLINUX
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DREADLINE -DLINUX
+
+CC = gcc
+
+
+default: $(OBJS)
+	$(CC) $(OBJS) -g -lm -ldl -lreadline -o newlisp
+#	$(CC) $(OBJS) -g -lm -ldl -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux_readline
+
+
+
diff --git a/makefile_linux b/makefile_linux
new file mode 100644
index 0000000..038f036
--- /dev/null
+++ b/makefile_linux
@@ -0,0 +1,26 @@
+# makefile for newLISP v. 9.x.x on LINUX
+#
+# Note, that readline support may require different libraries on different OSs
+# 
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DLINUX
+
+CC = gcc
+
+
+default: $(OBJS)
+#	$(CC) $(OBJS) -g -lm -ldl -lreadline -ltermcap -o newlisp
+#	$(CC) $(OBJS) -g -lm -ldl -lreadline -lncurses -o newlisp
+	$(CC) $(OBJS) -g -lm -ldl -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux
+
+
+
diff --git a/makefile_linux64 b/makefile_linux64
new file mode 100644
index 0000000..ce3de80
--- /dev/null
+++ b/makefile_linux64
@@ -0,0 +1,23 @@
+# makefile for newLISP v. 9.x.x on 64 bit LINUX tested on AMD64
+#
+# Note, that readline support may require different libraries on different OSs
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+#CFLAGS = -m32 -Wall -pedantic -Wno-uninitialized -c -O2 -g -DREADLINE -DLINUX
+CFLAGS = -m32 -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DREADLINE -DLINUX
+
+CC = gcc
+
+default: $(OBJS)
+#	$(CC) $(OBJS) -m32 -g -lm -ldl -lreadline -ltermcap -o newlisp
+	$(CC) $(OBJS) -m32 -g -lm -ldl -lreadline -lncurses -o newlisp
+#	$(CC) $(OBJS) -m32 -g -lm -ldl -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux64
diff --git a/makefile_linux64ILP32 b/makefile_linux64ILP32
new file mode 100644
index 0000000..313f1be
--- /dev/null
+++ b/makefile_linux64ILP32
@@ -0,0 +1,23 @@
+# makefile for newLISP v. 9.x.x on 64 bit LINUX tested on AMD64
+#
+# Note, that readline support may require different libraries on different OSs
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+#CFLAGS = -m32 -Wall -pedantic -Wno-uninitialized -c -O2 -g -DREADLINE -DLINUX
+CFLAGS = -m32 -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DLINUX
+
+CC = gcc
+
+default: $(OBJS)
+#	$(CC) $(OBJS) -m32 -g -lm -ldl -lreadline -ltermcap -o newlisp
+#	$(CC) $(OBJS) -m32 -g -lm -ldl -lreadline -lncurses -o newlisp
+	$(CC) $(OBJS) -m32 -g -lm -ldl -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux64ILP32
diff --git a/makefile_linux64LP64 b/makefile_linux64LP64
new file mode 100644
index 0000000..723a4dd
--- /dev/null
+++ b/makefile_linux64LP64
@@ -0,0 +1,23 @@
+# makefile for newLISP v. 9.x.x on 64 bit LINUX and 64-bit memory pointerstested on AMD64
+#
+# Note, that readline support may require different libraries on different OSs
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+#CFLAGS = -Wall -pedantic -Wno-uninitialized -c -O2 -g -DREADLINE -DLINUX
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DLINUX -DNEWLISP64
+
+CC = gcc
+
+default: $(OBJS)
+#	$(CC) $(OBJS)  -g -lm -ldl -lreadline -ltermcap -o newlisp
+#	$(CC) $(OBJS)  -g -lm -ldl -lreadline -lncurses -o newlisp
+	$(CC) $(OBJS)  -g -lm -ldl -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux64LP64
diff --git a/makefile_linux64LP64_utf8 b/makefile_linux64LP64_utf8
new file mode 100644
index 0000000..d1dd623
--- /dev/null
+++ b/makefile_linux64LP64_utf8
@@ -0,0 +1,23 @@
+# makefile for newLISP v. 9.x.x UTF-8 on 64 bit LINUX and 64-bit memory pointers tested on AMD64
+#
+# Note, that readline support may require different libraries on different OSs
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o nl-utf8.o pcre.o
+
+#CFLAGS = -Wall -pedantic -Wno-uninitialized -c -O2 -g -DREADLINE -DLINUX
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DSUPPORT_UTF8 -DLINUX -DNEWLISP64
+
+CC = gcc
+
+default: $(OBJS)
+#	$(CC) $(OBJS)  -g -lm -ldl -lreadline -ltermcap -o newlisp
+#	$(CC) $(OBJS)  -g -lm -ldl -lreadline -lncurses -o newlisp
+	$(CC) $(OBJS)  -g -lm -ldl -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux64LP64_utf8
diff --git a/makefile_linux64_lib b/makefile_linux64_lib
new file mode 100644
index 0000000..26f942a
--- /dev/null
+++ b/makefile_linux64_lib
@@ -0,0 +1,23 @@
+# makefile for newLISP v. 9.x.x on 64 bit LINUX tested on AMD64 as a shared library
+#
+# Note, that readline support may require different libraries on different OSs
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o unix-lib.o
+
+#CFLAGS = -m32 -Wall -pedantic -Wno-uninitialized -c -O2 -g -DREADLINE -DLINUX
+CFLAGS = -m32 -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DLINUX -DLIBRARY
+
+CC = gcc
+
+default: $(OBJS)
+#	$(CC) $(OBJS) -m32 -g -lm -ldl -lreadline -ltermcap -o newlisp
+#	$(CC) $(OBJS) -m32 -g -lm -ldl -lreadline -lncurses -o newlisp
+	$(CC) $(OBJS) -m32 -g -lm -ldl -shared -o newlisp.so
+	strip newlisp.so
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux64_lib
diff --git a/makefile_linux_IPv6 b/makefile_linux_IPv6
new file mode 100644
index 0000000..102c5d0
--- /dev/null
+++ b/makefile_linux_IPv6
@@ -0,0 +1,26 @@
+# makefile for newLISP v. 9.x.x on LINUX with IPv6 protocol
+#
+# Note, that readline support may require different libraries on different OSs
+# 
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DLINUX -DIPV6
+
+CC = gcc
+
+
+default: $(OBJS)
+#	$(CC) $(OBJS) -g -lm -ldl -lreadline -ltermcap -o newlisp
+#	$(CC) $(OBJS) -g -lm -ldl -lreadline -lncurses -o newlisp
+	$(CC) $(OBJS) -g -lm -ldl -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux
+
+
+
diff --git a/makefile_linux_lib b/makefile_linux_lib
new file mode 100644
index 0000000..31ac026
--- /dev/null
+++ b/makefile_linux_lib
@@ -0,0 +1,23 @@
+# makefile for newLISP v. 9.x.x on LINUX as a shared library - newlisp.so -
+#
+# Note, that readline support may require different libraries on different OSs
+# 
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o unix-lib.o
+
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -DLINUX -DLIBRARY
+
+CC = gcc
+
+default: $(OBJS)
+	$(CC) $(OBJS) -lm -ldl -shared -o newlisp.so
+	strip newlisp.so
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux_lib
+
+
+
diff --git a/makefile_linux_lib_utf8 b/makefile_linux_lib_utf8
new file mode 100644
index 0000000..f045278
--- /dev/null
+++ b/makefile_linux_lib_utf8
@@ -0,0 +1,23 @@
+# makefile for newLISP v. 9.x.x on LINUX as a shared library - newlisp.so -
+#
+# Note, that readline support may require different libraries on different OSs
+# 
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o nl-utf8.o pcre.o unix-lib.o
+
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -DLIBRARY -DSUPPORT_UTF8 -DLINUX
+
+CC = gcc
+
+default: $(OBJS)
+	$(CC) $(OBJS) -lm -ldl -shared -o newlisp.so
+	strip newlisp.so
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux_lib_utf8
+
+
+
diff --git a/makefile_linux_readline b/makefile_linux_readline
new file mode 100644
index 0000000..1721bcd
--- /dev/null
+++ b/makefile_linux_readline
@@ -0,0 +1,27 @@
+# makefile for newLISP v. 9.x.x on LINUX with readline lib support
+#
+# Note, that readline support may require different libraries on different OSs
+# 
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+#CFLAGS = -Wall -pedantic -Wno-uninitialized -c -O2 -g -DLINUX
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DREADLINE -DLINUX
+
+CC = gcc
+
+
+default: $(OBJS)
+#	$(CC) $(OBJS) -g -lm -ldl -lreadline -ltermcap -o newlisp
+	$(CC) $(OBJS) -g -lm -ldl -lreadline -lncurses -o newlisp
+#	$(CC) $(OBJS) -g -lm -ldl -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux_readline
+
+
+
diff --git a/makefile_linux_utf8 b/makefile_linux_utf8
new file mode 100644
index 0000000..9d6efe7
--- /dev/null
+++ b/makefile_linux_utf8
@@ -0,0 +1,27 @@
+# makefile for newLISP v. 9.x.x on LINUX with UTF-8 support
+#
+# Note, that readline support may require different libraries on different OSs
+# 
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o nl-utf8.o pcre.o
+
+#CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DREADLINE -DSUPPORT_UTF8 -DLINUX
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DSUPPORT_UTF8 -DLINUX
+
+CC = gcc
+
+
+default: $(OBJS)
+#	$(CC) $(OBJS) -g -lm -ldl -lreadline -ltermcap -o newlisp
+#	$(CC) $(OBJS) -g -lm -ldl -lreadline -lncurses -o newlisp
+	$(CC) $(OBJS) -g -lm -ldl -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux_utf8
+
+
+
diff --git a/makefile_linux_utf8_readline b/makefile_linux_utf8_readline
new file mode 100644
index 0000000..7752a65
--- /dev/null
+++ b/makefile_linux_utf8_readline
@@ -0,0 +1,26 @@
+# makefile for newLISP v. 9.x.x on LINUX with readline lib and UTF-8 support
+#
+# Note, that readline support may require different libraries on different OSs
+# 
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o nl-utf8.o pcre.o
+
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -g -DREADLINE -DSUPPORT_UTF8 -DLINUX
+
+CC = gcc
+
+
+default: $(OBJS)
+#	$(CC) $(OBJS) -g -lm -ldl -lreadline -ltermcap -o newlisp
+	$(CC) $(OBJS) -g -lm -ldl -lreadline -lncurses -o newlisp
+#	$(CC) $(OBJS) -g -lm -ldl -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_linux_utf8_readline
+
+
+
diff --git a/makefile_mingw b/makefile_mingw
new file mode 100644
index 0000000..622d4ec
--- /dev/null
+++ b/makefile_mingw
@@ -0,0 +1,21 @@
+# makefile for newLISP v. 9.x.x on MinGW
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o nl-sock.o \
+	nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o win32-util.o win32-path.o
+
+CFLAGS = -Wall -pedantic -Wno-long-long -c -O1 -g -DWIN_32
+
+CC = /MinGW/bin/gcc
+STRIP = /MinGW/bin/strip
+
+default: $(OBJS)
+	$(CC)  $(OBJS) -lws2_32 -o newlisp.exe
+	$(STRIP) newlisp.exe 
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h newlisp.h makefile_mingw
+
+
diff --git a/makefile_mingw_utf8 b/makefile_mingw_utf8
new file mode 100644
index 0000000..a430c9d
--- /dev/null
+++ b/makefile_mingw_utf8
@@ -0,0 +1,21 @@
+# makefile for newLISP v. 9.x.x on MinGW with UTF-8 support
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o nl-sock.o \
+	nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o nl-utf8.o win32-util.o win32-path.o
+
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-long-long -c -O1 -g -DSUPPORT_UTF8 -DWIN_32
+
+CC = /MinGW/bin/gcc
+STRIP = /MinGW/bin/strip
+
+default: $(OBJS)
+	$(CC)  $(OBJS) -lws2_32 -o newlisp.exe
+	$(STRIP) newlisp.exe 
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h newlisp.h makefile_mingw_utf8
+
+
diff --git a/makefile_mingwdll b/makefile_mingwdll
new file mode 100644
index 0000000..c56fb96
--- /dev/null
+++ b/makefile_mingwdll
@@ -0,0 +1,22 @@
+# makefile for newLISP  DLL v. 9.x.x on MinGW DLL
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o nl-sock.o \
+	nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o win32-util.o win32-path.o win32dll.o
+
+CFLAGS = -Wall -pedantic -Wno-long-long -c -O1 -DWIN_32 -DLIBRARY 
+
+CC = /MinGW/bin/gcc
+STRIP = /MinGW/bin/strip
+WRAP = /MinGW/bin/dllwrap
+
+default: $(OBJS)
+	$(WRAP) *.o --enable-stdcall-fixup --def win32dll.def -o newlisp.dll -lws2_32
+	$(STRIP) newlisp.dll
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_mingwdll
+
+
diff --git a/makefile_mingwdll_utf8 b/makefile_mingwdll_utf8
new file mode 100644
index 0000000..87e7a3c
--- /dev/null
+++ b/makefile_mingwdll_utf8
@@ -0,0 +1,23 @@
+# makefile for newLISP  v. 9.x.x on MinGW DLL with UTF-8 support
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o nl-sock.o \
+	nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o nl-utf8.o win32-util.o \
+	win32-path.o win32dll.o
+
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-long-long -c -O1 -DLIBRARY -DSUPPORT_UTF8 -DWIN_32
+
+CC = /MinGW/bin/gcc
+STRIP = /MinGW/bin/strip
+WRAP = /MinGW/bin/dllwrap
+
+default: $(OBJS)
+	$(WRAP) *.o --enable-stdcall-fixup --def win32dll.def -o newlisp.dll -lws2_32
+	$(STRIP) newlisp.dll
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_mingwdll_utf8
+
+
diff --git a/makefile_netbsd b/makefile_netbsd
new file mode 100644
index 0000000..0509e9b
--- /dev/null
+++ b/makefile_netbsd
@@ -0,0 +1,23 @@
+# makefile for newLISP v. 9.x.x on BSDs: NetBsd
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+#CFLAGS = -Wall -Wno-uninitialized -Wno-strict-aliasing -O2 -c -g -DREADLINE -D_BSD
+# for netBSD use following line
+CFLAGS = -Wall -Wno-uninitialized -Wno-strict-aliasing -O2 -c -g -D_BSD
+
+CC = gcc
+
+default: $(OBJS)
+#	$(CC) $(OBJS) -g -lm -lreadline -lncurses -o newlisp
+# for netBSD use following line
+	$(CC) $(OBJS) -g -lm -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_netbsd
+
diff --git a/makefile_os2 b/makefile_os2
new file mode 100644
index 0000000..945a377
--- /dev/null
+++ b/makefile_os2
@@ -0,0 +1,21 @@
+# makefile for newLISP v. 9.x.x on OS/2 (tested on eComstation)
+#
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-strict-aliasing -Wno-long-long -c -O2 -s -DOS2
+
+CC = gcc
+
+
+default: $(OBJS)
+	$(CC) $(OBJS) -Zomf -Zmt -lm -ldl -o newlisp.exe
+
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_os2
+
diff --git a/makefile_osx_package b/makefile_osx_package
new file mode 100644
index 0000000..0b22943
--- /dev/null
+++ b/makefile_osx_package
@@ -0,0 +1,97 @@
+# prepare Mac OSX package root directory in ../Package_contents
+
+datadir=../Package_contents/usr/share
+bindir=../Package_contents/usr/bin
+mandir=../Package_contents/usr/share/man
+appdir=../Package_contents/Applications
+
+GUISERVER = ../Package_contents/usr/share/newlisp/guiserver
+
+osx-package:
+	-mkdir ../Package_contents
+	-mkdir ../Package_contents/usr
+	-mkdir ../Package_contents/usr/bin
+	-mkdir ../Package_contents/usr/share
+	-mkdir ../Package_contents/usr/share/man
+	-mkdir ../Package_contents/usr/share/man/man1
+	-mkdir ../Package_contents/Applications
+	# identical from install section in main Makefile
+	-install -d $(datadir)/newlisp
+	-install -d $(datadir)/newlisp/modules
+	-install -d $(datadir)/newlisp/util
+	-install -d $(datadir)/doc/newlisp
+	-install -m 755 newlisp $(bindir)/newlisp
+	-install -m 644 examples/init.lsp.example $(datadir)/newlisp/init.lsp.example
+	-install -m 755 util/newlispdoc $(bindir)/newlispdoc
+	-install -m 644 util/syntax.cgi $(datadir)/newlisp/util/syntax.cgi
+	-install -m 644 util/newlisp.vim $(datadir)/newlisp/util/newlisp.vim
+	-install -m 644 util/link.lsp $(datadir)/newlisp/util/link.lsp
+	-install -m 644 util/httpd-conf.lsp $(datadir)/newlisp/util/httpd-conf.lsp
+	-install -m 644 doc/COPYING $(datadir)/doc/newlisp/COPYING
+	-install -m 644 doc/CREDITS $(datadir)/doc/newlisp/CREDITS
+	-install -m 644 doc/newlisp_manual.html $(datadir)/doc/newlisp/newlisp_manual.html
+	-install -m 644 doc/newlisp_index.html $(datadir)/doc/newlisp/newlisp_index.html
+	-install -m 644 doc/manual_frame.html $(datadir)/doc/newlisp/manual_frame.html
+	-install -m 644 doc/CodePatterns.html $(datadir)/doc/newlisp/CodePatterns.html
+	-install -m 644 doc/newLISPdoc.html $(datadir)/doc/newlisp/newLISPdoc.html
+	-install -m 644 doc/newLISP-9.3-Release.html $(datadir)/doc/newlisp/newLISP-9.3-Release.html
+	-install -m 644 doc/newlisp.1 $(mandir)/man1/newlisp.1
+	-install -m 644 doc/newlispdoc.1 $(mandir)/man1/newlispdoc.1
+	-install -m 644 modules/cgi.lsp $(datadir)/newlisp/modules/cgi.lsp
+	-install -m 644 modules/crypto.lsp $(datadir)/newlisp/modules/crypto.lsp
+	-install -m 644 modules/ftp.lsp $(datadir)/newlisp/modules/ftp.lsp
+	-install -m 644 modules/gmp.lsp $(datadir)/newlisp/modules/gmp.lsp
+	-install -m 644 modules/infix.lsp $(datadir)/newlisp/modules/infix.lsp
+	-install -m 644 modules/mysql.lsp $(datadir)/newlisp/modules/mysql.lsp
+	-install -m 644 modules/mysql5.lsp $(datadir)/newlisp/modules/mysql5.lsp
+	-install -m 644 modules/odbc.lsp $(datadir)/newlisp/modules/odbc.lsp
+	-install -m 644 modules/pop3.lsp $(datadir)/newlisp/modules/pop3.lsp
+	-install -m 644 modules/postscript.lsp $(datadir)/newlisp/modules/postscript.lsp
+	-install -m 644 modules/smtp.lsp $(datadir)/newlisp/modules/smtp.lsp
+	-install -m 644 modules/sqlite3.lsp $(datadir)/newlisp/modules/sqlite3.lsp
+	-install -m 644 modules/stat.lsp $(datadir)/newlisp/modules/stat.lsp
+	-install -m 644 modules/unix.lsp $(datadir)/newlisp/modules/unix.lsp
+	-install -m 644 modules/xmlrpc-client.lsp $(datadir)/newlisp/modules/xmlrpc-client.lsp
+	-install -m 644 modules/zlib.lsp $(datadir)/newlisp/modules/zlib.lsp
+	# GUI-Server install
+	-install -d $(datadir)/newlisp/guiserver
+	-install -d $(datadir)/doc/newlisp/guiserver
+	-install -m 755 guiserver/newlisp-edit.lsp $(bindir)/newlisp-edit
+	-install -m 644 guiserver/guiserver.jar $(datadir)/newlisp/guiserver.jar
+	-install -m 644 guiserver/guiserver.lsp $(datadir)/newlisp/guiserver.lsp
+	-install -m 644 guiserver/COPYING $(datadir)/doc/newlisp/guiserver/COPYING
+	-install -m 644 guiserver/index.html $(datadir)/doc/newlisp/guiserver/index.html
+	-install -m 644 guiserver/guiserver.lsp.html $(datadir)/doc/newlisp/guiserver/guiserver.lsp.html
+	-install -m 644 guiserver/allfonts-demo.lsp $(datadir)/newlisp/guiserver/allfonts-demo.lsp
+	-install -m 644 guiserver/animation-demo.lsp $(datadir)/newlisp/guiserver/animation-demo.lsp
+	-install -m 644 guiserver/border-layout-demo.lsp $(datadir)/newlisp/guiserver/border-layout-demo.lsp
+	-install -m 644 guiserver/button-demo.lsp $(datadir)/newlisp/guiserver/button-demo.lsp
+	-install -m 644 guiserver/clipboard-demo.lsp $(datadir)/newlisp/guiserver/clipboard-demo.lsp
+	-install -m 644 guiserver/cursor-demo.lsp $(datadir)/newlisp/guiserver/cursor-demo.lsp
+	-install -m 644 guiserver/drag-demo.lsp $(datadir)/newlisp/guiserver/drag-demo.lsp
+	-install -m 644 guiserver/font-demo.lsp $(datadir)/newlisp/guiserver/font-demo.lsp
+	-install -m 644 guiserver/frameless-demo.lsp $(datadir)/newlisp/guiserver/frameless-demo.lsp
+	-install -m 644 guiserver/html-demo.lsp $(datadir)/newlisp/guiserver/html-demo.lsp
+	-install -m 644 guiserver/image-demo.lsp $(datadir)/newlisp/guiserver/image-demo.lsp
+	-install -m 644 guiserver/mouse-demo.lsp $(datadir)/newlisp/guiserver/mouse-demo.lsp
+	-install -m 644 guiserver/move-resize-demo.lsp $(datadir)/newlisp/guiserver/move-resize-demo.lsp
+	-install -m 644 guiserver/pinballs-demo.lsp $(datadir)/newlisp/guiserver/pinballs-demo.lsp
+	-install -m 644 guiserver/properties-demo.lsp $(datadir)/newlisp/guiserver/properties-demo.lsp
+	-install -m 644 guiserver/rotation-demo.lsp $(datadir)/newlisp/guiserver/rotation-demo.lsp
+	-install -m 644 guiserver/shapes-demo.lsp $(datadir)/newlisp/guiserver/shapes-demo.lsp
+	-install -m 644 guiserver/sound-demo.lsp $(datadir)/newlisp/guiserver/sound-demo.lsp
+	-install -m 644 guiserver/stroke-demo.lsp $(datadir)/newlisp/guiserver/stroke-demo.lsp
+	-install -m 644 guiserver/tabs-demo.lsp $(datadir)/newlisp/guiserver/tabs-demo.lsp
+	-install -m 644 guiserver/textrot-demo.lsp $(datadir)/newlisp/guiserver/textrot-demo.lsp
+	-install -m 644 guiserver/widgets-demo.lsp $(datadir)/newlisp/guiserver/widgets-demo.lsp
+	-install -m 644 guiserver/word-count.lsp $(datadir)/newlisp/guiserver/word-count.lsp
+	-install -m 644 guiserver/uppercase.lsp $(datadir)/newlisp/guiserver/uppercase.lsp
+
+	# get OS X applications package
+	sudo cp -R /Applications/newLISP-GS.app/ $(appdir)/newLISP-GS.app
+
+	# make the package and image
+	/Developer/Applications/Utilities/PackageMaker.app/Contents/MacOS/PackageMaker \
+		-d ~/newlisp/OSX-package/newLISPpackage-project.pmdoc/ -o ~/newlisp/OSX-package/newLISP-image/newLISPpackage.pkg
+# eof
+
diff --git a/makefile_solaris b/makefile_solaris
new file mode 100644
index 0000000..8f66c46
--- /dev/null
+++ b/makefile_solaris
@@ -0,0 +1,18 @@
+# makefile for newLISP v. 9.x.x on SOLARIS (32 bit app)
+#
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-long-long -fno-strict-aliasing -c -O2 -DSOLARIS 
+
+CC = gcc
+
+default: $(OBJS)
+	$(CC) $(OBJS) -lm -ldl -lrt -lsocket -lnsl -o newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_solaris
diff --git a/makefile_solarisLP64 b/makefile_solarisLP64
new file mode 100644
index 0000000..d8b417c
--- /dev/null
+++ b/makefile_solarisLP64
@@ -0,0 +1,18 @@
+# makefile for newLISP v. 9.x.x on SOLARIS 64-bit app
+#
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+CFLAGS = -m64 -Wall -pedantic -Wno-uninitialized -Wno-long-long -fno-strict-aliasing -c -O2 -DSOLARIS -DNEWLISP64
+
+CC = gcc
+
+default: $(OBJS)
+	$(CC) $(OBJS) -m64 -lm -ldl -lrt -lsocket -lnsl -o newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_solarisLP64
diff --git a/makefile_solaris_utf8 b/makefile_solaris_utf8
new file mode 100644
index 0000000..2adbff6
--- /dev/null
+++ b/makefile_solaris_utf8
@@ -0,0 +1,21 @@
+# makefile for newLISP v. 9.x.x on SOLARIS woth UTF-8 support
+#
+#
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o nl-utf8.o pcre.o
+
+
+# use following for UTF-8 support and add nl-utf8.o to the OBJS line
+CFLAGS = -Wall -pedantic -Wno-uninitialized -Wno-long-long -c -O2 -DSUPPORT_UTF8 -DSOLARIS 
+
+CC = gcc
+
+
+default: $(OBJS)
+	$(CC) $(OBJS) -lm -ldl -lrt -lsocket -lnsl -o newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_solaris_utf8
diff --git a/makefile_tru64 b/makefile_tru64
new file mode 100644
index 0000000..af48177
--- /dev/null
+++ b/makefile_tru64
@@ -0,0 +1,25 @@
+# makefile for newLISP v. 8.x.x on HP Tru64Unix
+#
+# tesetd on Compaq Alpha hardware platform
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+# CFLAGS = -I/usr/local/include -ieee -pedantic -c -O3 -DREADLINE -DSOLARIS -DTRU64 -DNEWLISP64 -D_POSIX_PII_SOCKET
+CFLAGS = -ieee -pedantic -c -O3 -DSOLARIS -DTRU64 -DNEWLISP64 -D_POSIX_PII_SOCKET
+
+CC = cc
+
+default: $(OBJS)
+	$(CC) $(OBJS) -lm -lrt -ldb -lbsd -o newlisp
+	strip newlisp
+
+readline: $(OBJS)
+	$(CC) $(OBJS) -lm -lrt -ldb -lbsd -lreadline -ltermcap -o newlisp
+	strip newlisp
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_tru64
+
diff --git a/makefile_universal b/makefile_universal
new file mode 100644
index 0000000..7eaf61f
--- /dev/null
+++ b/makefile_universal
@@ -0,0 +1,27 @@
+# makefile for newLISP v. 9.x.x on Mac OSX with readline support
+#
+# for OS X 10.4/Tiger, Tiger comes standard with libreadline
+#
+# needs readline library and headerfiles installed (X tools)
+# use the Mac OS X lipo utitlity to extract one or the other ppc/intel
+# example: lipo newlisp-universal -output newlisp-ppc -thin ppc7400
+# note: architecture id for ppc on Tiger: ppc on Leopard: ppc7400
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o pcre.o
+
+CFLAGS = -Wall -arch i386 -arch ppc -O2 -I/usr/include -c -g -DREADLINE -DMAC_OSX
+#CFLAGS = -Wall -I/usr/include -c -g -DREADLINE -DMAC_OSX
+
+CC = cc -L/usr/lib
+
+default: $(OBJS)
+	$(CC) $(OBJS) -arch i386 -arch ppc -g -lm -lreadline -o newlisp-universal
+	strip newlisp-universal
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_universal
+
+
diff --git a/makefile_universal_utf8 b/makefile_universal_utf8
new file mode 100644
index 0000000..73e73b9
--- /dev/null
+++ b/makefile_universal_utf8
@@ -0,0 +1,29 @@
+# makefile for newLISP v. 9.x.x on Mac OSX with readline support
+#
+# for OS X 10.4/Tiger, Tiger comes standard with libreadline
+#
+# needs readline library and headerfiles installed (X tools)
+# use the Mac OS X lipo utitlity to extract one or the other ppc/intel
+# example: lipo newlisp-universal -output newlisp-ppc -thin ppc7400
+# note: architecture id for ppc on Tiger: ppc on Leopard: ppc7400
+
+OBJS = newlisp.o nl-symbol.o nl-math.o nl-list.o nl-liststr.o nl-string.o nl-filesys.o \
+	nl-sock.o nl-import.o nl-xml.o nl-web.o nl-matrix.o nl-debug.o nl-utf8.o pcre.o
+
+CFLAGS = -Wall -arch i386 -arch ppc -O2 -I/usr/include -c -g -DREADLINE -DMAC_OSX -DSUPPORT_UTF8
+#CFLAGS = -Wall -I/usr/include -c -g -DREADLINE -DMAC_OSX
+
+CC = cc -L/usr/lib
+
+default: $(OBJS)
+	$(CC) $(OBJS) -arch i386 -arch ppc -g -lm -lreadline -o newlisp-universal
+	strip newlisp-universal
+	lipo newlisp-universal -output newlisp-intel -thin i386
+	lipo newlisp-universal -output newlisp-ppc -thin ppc
+
+.c.o:
+	$(CC) $(CFLAGS) $<
+
+$(OBJS): primes.h protos.h makefile_universal_utf8
+
+
diff --git a/makefile_wings b/makefile_wings
new file mode 100644
index 0000000..cc0a61d
--- /dev/null
+++ b/makefile_wings
@@ -0,0 +1,82 @@
+# this packages the Win32 binary distribution
+# this makefile is executed from a MinGW MSYS shell
+
+win-gui:
+	-mkdir /c/newlisp
+	-mkdir /c/newlisp/guiserver
+	-mkdir /c/newlisp/modules
+	-mkdir /c/newlisp/util
+	cp newlisp.exe /c/newlisp
+	cp newlisp.dll /c/newlisp
+	cp util/httpd-conf.lsp /c/newlisp/util
+	cp util/link.lsp /c/newlisp/util
+	cp util/newlispdoc /c/newlisp/util
+	cp util/newlisp.vim /c/newlisp/util
+	cp util/syntax.cgi /c/newlisp/util
+	cp doc/newlisp_manual.html /c/newlisp
+	cp doc/newlisp_index.html /c/newlisp
+	cp doc/manual_frame.html /c/newlisp
+	cp doc/CodePatterns.html /c/newlisp
+	cp doc/newLISPdoc.html /c/newlisp
+	cp doc/newLISP-9.3-Release.html /c/newlisp
+	cp doc/COPYING /c/newlisp
+	cp guiserver/guiserver.lsp /c/newlisp
+	cp guiserver/guiserver.jar /c/newlisp	
+	cp guiserver/newlisp-edit.lsp /c/newlisp
+
+	# guiserver sub directory
+	cp guiserver/index.html /c/newlisp/guiserver
+	cp guiserver/guiserver.lsp.html /c/newlisp/guiserver
+	cp guiserver/allfonts-demo.lsp /c/newlisp/guiserver
+	cp guiserver/animation-demo.lsp /c/newlisp/guiserver
+	cp guiserver/border-layout-demo.lsp /c/newlisp/guiserver
+	cp guiserver/button-demo.lsp /c/newlisp/guiserver
+	cp guiserver/clipboard-demo.lsp /c/newlisp/guiserver
+	cp guiserver/cursor-demo.lsp /c/newlisp/guiserver
+	cp guiserver/drag-demo.lsp /c/newlisp/guiserver
+	cp guiserver/font-demo.lsp /c/newlisp/guiserver
+	cp guiserver/frameless-demo.lsp /c/newlisp/guiserver
+	cp guiserver/html-demo.lsp /c/newlisp/guiserver
+	cp guiserver/image-demo.lsp /c/newlisp/guiserver
+	cp guiserver/mouse-demo.lsp /c/newlisp/guiserver
+	cp guiserver/move-resize-demo.lsp /c/newlisp/guiserver
+	cp guiserver/pinballs-demo.lsp /c/newlisp/guiserver
+	cp guiserver/properties-demo.lsp /c/newlisp/guiserver
+	cp guiserver/rotation-demo.lsp /c/newlisp/guiserver
+	cp guiserver/shapes-demo.lsp /c/newlisp/guiserver
+	cp guiserver/sound-demo.lsp /c/newlisp/guiserver
+	cp guiserver/stroke-demo.lsp /c/newlisp/guiserver
+	cp guiserver/tabs-demo.lsp /c/newlisp/guiserver
+	cp guiserver/textrot-demo.lsp /c/newlisp/guiserver
+	cp guiserver/widgets-demo.lsp /c/newlisp/guiserver
+	cp guiserver/word-count.lsp /c/newlisp/guiserver
+	cp guiserver/uppercase.lsp /c/newlisp/guiserver
+	# modules sub directory
+	cp modules/cgi.lsp /c/newlisp/modules
+	cp modules/crypto.lsp /c/newlisp/modules
+	cp modules/ftp.lsp /c/newlisp/modules
+	cp modules/gmp.lsp /c/newlisp/modules
+	cp modules/infix.lsp /c/newlisp/modules
+	cp modules/mysql.lsp /c/newlisp/modules
+	cp modules/mysql5.lsp /c/newlisp/modules
+	cp modules/odbc.lsp /c/newlisp/modules
+	cp modules/pop3.lsp /c/newlisp/modules
+	cp modules/postscript.lsp /c/newlisp/modules
+	cp modules/smtp.lsp /c/newlisp/modules
+	cp modules/sqlite3.lsp /c/newlisp/modules
+	cp modules/stat.lsp /c/newlisp/modules
+	cp modules/unix.lsp /c/newlisp/modules
+	cp modules/xmlrpc-client.lsp /c/newlisp/modules
+	cp modules/zlib.lsp /c/newlisp/modules
+	cp guiserver/newlisp-win.ico /c/newlisp
+	# prepare pack program
+	cp guiserver/newlisp-gs.nsi /NSIS
+	cp guiserver/newlisp-win.ico /NSIS
+	echo 'md5 /c/newlisp/*.exe /c/newlisp/*.dll > /c/newlisp/md5-checksums.txt' >> pack-gui
+	echo 'cd /NSIS/' >> pack-gui
+	echo './makensis newlisp-gs.nsi' >> pack-gui
+	chmod 755 pack-gui
+	# pack everything
+	./pack-gui
+	rm ./pack-gui
+	rm -rf /c/newlisp
diff --git a/modules/README.txt b/modules/README.txt
new file mode 100644
index 0000000..248796a
--- /dev/null
+++ b/modules/README.txt
@@ -0,0 +1,19 @@
+To generate HTML documentation for the modules in this directory, simply
+execute the following statement inside the newlisp-x.x.x/modules directory:
+
+   newlispdoc -s *.lsp
+
+or on Win32
+
+   newlisp -s newlispdoc *.lsp
+
+This will genereate an index page index.html and one html file each
+for each module of the form name.lsp.html, where name is the name of the module.
+For additional conversion options see newlisp-x.x.x/doc/newLISPdoc.html .
+
+The newlispdoc utility can be found in newlisp-x.x.x/examples/newlispdoc .
+
+Documentation on how to format newLISP source files for this program can be found 
+in newlisp-x.x.x/doc/newLISPdoc.html or in /usr/share/doc/newlisp/newLISPdoc.html.
+
+
diff --git a/modules/TEST b/modules/TEST
new file mode 100644
index 0000000000000000000000000000000000000000..2208eeeb29f612e8111d163744f9b548c34d87ad
GIT binary patch
literal 2048
zcwP$*^vNtqRY=P(%1ta$FlJz3U}R))P*7lCU|?r}045-2M518;nT;3lf(RA{2Igsm
zRE~mCFbcpROHz`tQM)8DDJM0ps5G;r7(y~R2e~?ixGID=I{CONK*SU@@)C1X6`VaB
zgEWi`G<6gTODYvS{X#U1f$V~!%;Z!BHy?k;5Di0+WKvFkQb}q>iGq`lzmp~*XN-bT
JFbak*008h!CB*;$

literal 0
HcwPel00001

diff --git a/modules/cgi.lsp b/modules/cgi.lsp
new file mode 100644
index 0000000..8814740
--- /dev/null
+++ b/modules/cgi.lsp
@@ -0,0 +1,188 @@
+;; @module cgi.lsp  
+;; @description Basic CGI processing tools for GET and POST requests
+;; @version v 2.2 - comments redone for automatic documentation
+;; @author Lutz Mueller, lutz@nuevatec.com
+;;
+;; This module defines basic CGI processing tools for processing
+;; CGI GET and POST requests and cookies.
+;;
+;; Include this file at the beginning of each file performing CGI processing:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/cgi.lsp")
+;; </pre>
+;;
+;; <center><h2>Overview</h2></center>
+;; On loading 'cgi.lsp' will retrieve 'GET', 'POST' and cookie
+;; parameters via standard input and the environment variables: 
+;; 'QUERY_STRING' and 'HTTP_COOKIE'. These environment variables are set
+;; by the webserver (tested with Apache 1.3). The webserver is receiving information
+;; back from 'cgi.lsp' via std I/O channels.
+;; 
+;; After having loaded this file all parameters from either 'GET' or 'POST'
+;; method are stored as an association list and in 'CGI:params'
+;; and individual parameters can be accessed using 'CGI:get'.
+;;
+;; All cookies can be accessed in an association list 'CGI:cookies' and
+;; are accessed similar to the 'GET' and 'PUT' parameters using 'CGI:get-cookie'.
+;; A function 'CGI:set-cookie' is available for setting cookies.
+;;
+;; The function 'CGI:put-page' outputs a HTML page to the webserver after
+;; processing newLISP source embedded in '&lt;%' and '%&gt;' tags.
+;;
+;; 'CGI:params' and 'CGI:cookies' contain the empty list '()' when no
+;; parameters or cookies are present
+;;
+;; The function 'CGI:put-page' can be used to output web pages containing
+;; newLISP source embedded in &lt;%, %&gt; tags. Inside these tags are newLISP
+;; statements printing output/HTML to the webpage.
+
+(context 'CGI)
+
+;; @syntax (CGI:put-page <str-file-name>)
+;; @return The page output to standard out.
+;;
+;; Processes an HTML page by evaluating newLISP source
+;; embedded into the HTML text between '&lt;%' and '%&gt;' tags.
+;; The newLISP source typically contains 'print' and 'println'
+;; statements to output strings to standard out.
+;;
+;; @example
+;; <html>
+;; <body>
+;; <% (set 'site "example.com") %>;
+;; <a href="http://<% (print site) %>"><% (print site) %></a>
+;; </body>
+;; </html>
+;; 
+;; ; will output:
+;; 
+;; <pre>
+;;     <html>
+;;     <body>
+;;     <a href="http://example.com">example.com</a>
+;;     </body>
+;;     </html>
+;; </pre>
+
+(define (put-page file-name , page start end)
+    (set 'page (read-file file-name))
+    (set 'start (find "<%" page))
+    (set 'end (find "%>" page))
+    (while (and start end)
+        (print (slice page 0 start))
+        (context MAIN)
+        (eval-string (slice page (+ start 2) (- end start 2)))
+        (context CGI)
+        (set 'page (slice page (+ end 2)))
+        (set 'start (find "<%" page))
+        (set 'end (find "%>" page)))
+    (print page))
+
+;; @syntax (CGI:url-translate <str-url-format>)
+;; @return An ASCII formatted string.
+;;
+;; Translates all URL formatted characters to ASCII. Translates '+' into spaces 
+;; and '%nn' hexdigits into characters. 'nn' is a 2-nibble hex number. 
+;;
+;; @example
+;; (CGI:url-translate "What+time+is+it%3f")  => "What time is it?"
+
+(define (url-translate str)
+   (replace "+" str " ")
+   (replace "%([0-9A-F][0-9A-F])" str (char (int (append "0x" $1))) 1))
+
+
+; This is not an user function, but used internally.
+;
+; get-vars returns all parameter value pairs in an association list
+; i.e.: ( ("name" "johndoe") ("password" "secret") )
+; they can than be accessed using:
+;     (assoc "name" params) => "johndoe"
+; where params is the return value from get-vars
+ 
+(define (get-vars input , var value var-value)
+    (set 'vars (parse input "&"))
+    (dolist (elmnt vars) 
+	(if (find "=" elmnt) 
+	    (begin
+              (set 'var (first (parse elmnt "=")))
+              (set 'value ((+ (find "=" elmnt) 1) elmnt)))
+	    (begin
+	      (set 'var elmnt)
+	      (set 'value "")))
+	(push (list var (url-translate value)) var-value))
+    var-value)
+
+
+; get QUERY_STRING parameters from GET method if present
+;
+(set 'params (env "QUERY_STRING"))
+(if (not params) (set 'params ""))
+(if params
+	(set 'params (get-vars params)))
+
+; get stdin POST method parameters if present
+;
+(set 'inline (read-line))
+(if inline 
+	(set 'params (get-vars inline)))
+ 
+(if (not params) (set 'params '()))
+
+; get cookies
+;
+(if (env "HTTP_COOKIE")
+    (dolist (elmnt (parse (env "HTTP_COOKIE") ";"))
+	(set 'var (trim (first (parse elmnt "="))))
+;	(set 'value (trim (last (parse elmnt "="))))
+	(set 'value (slice elmnt (+ 1 (find "=" elmnt))))
+	(push (list var value) cookies))
+    (set 'cookies '()))
+
+;; @syntax (CGI:set-cookie <str-var> <str-value> <str-domain> <str-path>)
+;; @param <str-var> The cookie variable name as a string.
+;; @param <str-value> The cookie value as a string.
+;; @param <str-domain> The domain where to set the cookie.
+;; @param <str-path> The path for the domain.
+;; @return The string sent to standard out by 'CGI:set-cookie'.
+;;
+;; This function should be called immedeately before
+;; closing the header with '(print "Content-type: text/html\r\n\r\n")',
+;; which is typically the first statement in a CGI script written in
+;; newLISP after the '(load "cgi.lsp")' statement.
+;;
+;; @example
+;; (load "cgi.lsp")
+;;
+;; (CGI:set-cookie "password" "secret" "asite.com" "/somedir")
+;; (print "Content-type: text/html\r\n\r\n")
+;; ...
+
+(define (set-cookie var value domain path)
+    (set 'value (string value))
+    (print (format "Set-Cookie: %s=%s; domain=.%s; path=%s;\n" var value domain path)))
+
+
+;; @syntax (CGI:get-cookie <str-key>)
+;; @param <str-key> The string for the cookie variable name.
+;; @return The string for the cookie value.
+;;
+;; @example
+;; (CGI:get-cookie "login")   =>  "somebody" 
+
+(define (get-cookie keystr)
+	(lookup keystr cookies) )
+
+;; @syntax (CGI:get <str-key>)
+;; @param The name of the 'GET' or 'POST' variable as a string.
+;; @return The value string of the 'GET' or 'POST' variable.
+
+(define (get keystr)
+   (lookup keystr params))
+
+;; @example
+;; (CGI:get "city") => "San Francisco"
+
+
+(context 'MAIN)
+; eof ;
diff --git a/modules/crypto.lsp b/modules/crypto.lsp
new file mode 100644
index 0000000..bb7f35b
--- /dev/null
+++ b/modules/crypto.lsp
@@ -0,0 +1,118 @@
+;; @module crypto.lsp 
+;; @description SSL crypto functions for MD5 and SHA-1 hashing
+;; @version 1.01 - initial release
+;; @version 1.02 - renamed to crypto, new lib detection
+;; @version 1.04 - added hmac encryption from amazon.com query API
+;; @author Lutz Mueller 2007, Martin Quiroga 2007
+;;
+;; <h2>Module for SSL lib crypto  bindings</h2>
+;; This modules imports functions for the MD5 and SHA-1 hashing algorithms described
+;; here: @link http://www.ietf.org/rfc/rfc3174.txt http://www.ietf.org/rfc/rfc3174.txt .
+;; The crypto library is part of the @link http://www.openssl.org/ OpenSSL libraries.
+;; 
+;; To use this module include the following 'load' statement at the
+;; beginning of the program file:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/crypto.lsp")
+;; </pre>
+;;
+;; <h2>Requirements:</h2> 
+;; On Mac OS X, UBUNTU and many other Linux, BSDs and other UNIX installations
+;; <tt>libcrypto.so</tt> is installed by default as part of the OpenSSL
+;; libraries in <tt>usr/lib/libcrypto.so</tt>. If loading this module 
+;; finishes with an error message the path of the library should be corrected.
+;;
+;; This module has been tested on Mac OS X, UBUNTU Linux and FreeBSD.
+
+(context 'crypto)
+
+; set library to path-name of the library on your platform OS
+;
+(set 'files '(
+	"/usr/lib/libcrypto.so"
+	"/usr/lib/libcrypto.so.0.9.8"
+	"/usr/lib/libcrypto.so.0.9.7"
+	"/usr/lib/libcrypto.so.0.9.6"
+	"/usr/lib/libcrypto.so.4"
+	"/usr/lib/libcrypto.dylib"
+))
+
+(set 'library (files (or 
+				(find true (map file? files)) 
+				(begin (println "cannot find crypto library") (exit)))))
+
+(import library "MD5")
+(import library "SHA1")
+
+;; @syntax (crypto:md5 <string> <bool-raw>)
+;; @param <string> The string buffer for which to calculate a MD5 hash
+;; @param <bool-raw> Return the raw binay buffer when 'true'.
+;; @return The 16 Byte MD5 hash as a 32 Byte long hex string or as a 16 byte binary buffer.
+;;
+;; @example
+;; (crypto:md5 "ABC") => "902fbdd2b1df0c4f70b4a5d23525e932"
+;;
+;; (crypto:md5 (read-file "newlisp-9.1.0.tgz")) => "46c79c93e904df35c6a8474ace406c92"
+
+(define (md5 str raw-flag)
+	(if raw-flag
+		(let (buff (dup "\000" 16))
+			(cpymem (MD5 str (length str) 0) buff 16)
+			buff)
+		(join
+			(map (lambda (x) (format "%02x" (& x 0xff))) 
+				(unpack (dup "c" 16) (MD5 str (length str) 0))))
+	)
+)
+
+;; @syntax (crypto:sha1 <string> <bool-raw>)
+;; @param <string> The string buffer for which to calculate a SHA-1 hash
+;; @param <bool-raw> Return the raw binay buffer when 'true'.
+;; @return The 20 Byte SHA-1 hash as a 40 Byte long hex string or as a 20 byte binary buffer.
+;;
+;; @example
+;; (crypto:sha1 "ABC") => "3c01bdbb26f358bab27f267924aa2c9a03fcfdb8"
+;;
+;; (crypto:sha1 (read-file "newlisp-9.1.0.tgz")) => "2127a9c487f338b00f36cfd60b5f33d27b8d0010"
+
+(define (sha1 str raw-flag)
+	(if raw-flag
+		(let (buff (dup "\000" 20))
+			(cpymem (SHA1 str (length str) 0) buff 20)
+			buff)
+		(join
+   			(map (lambda (x) (format "%02x" (& x 0xff))) 
+				(unpack (dup "c" 20) (SHA1 str (length str) 0)))
+		)
+	)
+)
+
+;; @syntax (crypto:hmac <func-hash> <str-message> <str-key>)
+;; @param <func-hash> The hash function to use.
+;; @param <str-message> The message to encrypt.
+;; @param <str-key> The encryption key.
+;;
+;; This function is part of the amazon.com
+;; @link http://docs.amazonwebservices.com/AWSEC2/2007-08-29/DeveloperGuide/using-query-api.html Query-API
+;; and based on @link http://www.faqs.org/rfcs/rfc2104.html RFC2104 - HMAC: Keyed-Hashing for Message Authentication
+;;
+;; @example
+;; (set 'output (crypto:hmac crypto:md5 "Hello World" "secret"))
+;; (unpack (dup "c" (length output)) output)
+;; => (107 59 -76 66 117 -119 -35 -31 -7 -121 90 55 -109 -68 32 98)
+
+(define (hmac hash_fn msg_str key_str , blocksize opad ipad)
+  (set 'blocksize 64)
+   (set 'opad (dup "\x5c" blocksize))
+   (set 'ipad (dup "\x36" blocksize))
+  (if (> (length key_str) blocksize)
+    (set 'key_str (get-true-str (hash_fn key_str)))
+  )
+  (set 'key_str (append key_str (dup "\000" (- blocksize (length key_str))))) ;; padding key with binary zeros
+  (set 'opad (encrypt opad key_str))
+  (set 'ipad (encrypt ipad key_str))
+  (hash_fn (append opad (hash_fn (append ipad msg_str) true)) true)
+)
+
+; eof ;
+
diff --git a/modules/ftp.lsp b/modules/ftp.lsp
new file mode 100644
index 0000000..fd56eef
--- /dev/null
+++ b/modules/ftp.lsp
@@ -0,0 +1,139 @@
+;; @module ftp.lsp
+;; @description FTP file transfer routines
+;; @version 1.4 - comments redone for automatic documentation
+;; @author Rudy Rucker, Lutz Mueller, 2003
+;;
+;; <h2>FTP file transfer routines</h2>
+;; To use the module put a 'load' statement at beginning of your
+;; program file:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/ftp.lsp")
+;; </pre>
+;;
+;; In case of failure the functions return 'nil' and further detail
+;; may be found in the variable 'FTP:result'.
+;;
+;; To set debug mode, which shows all dialog with the server, set
+;; 'FTP:debug-flag':
+;; <pre>
+;; (set 'FTP:debug-flag true)
+;; </pre>
+
+(context 'FTP)
+
+; debugging mode
+(set 'debug-mode nil)
+
+; mode of transfer
+(define GET 1)
+(define PUT 2)
+
+;; @syntax (FTP:get <str-user-id> <str-password> <str-host> <str-dir> <str-file-name>)
+;; @param <str-user-id> The user ID for logon.
+;; @param <str-password> The password for the user ID.
+;; @param <str-host> The remote host name or IP as a string.
+;; @param <str-dir> The subdirectory on the host.
+;; @param <str-file-name> The name of the file to transfer.
+;; @return 'true' on success, 'nil' on failure.
+;; @example
+;; (FTP:get "somebody" "secret" "host.com" "subdir" "aFile.tgz")  ;; download
+;; (FTP:get "somebody" "secret" "192.168.1.120" "" "myfile.txt")  ;; download
+
+;; When leaving the string for the sub directory empty, the current directory "."
+;; is assumed on the host.
+
+(define (get user-id password host subdir file-name)
+    (transfer user-id password host subdir file-name GET))
+
+;; @syntax (FTP:put <str-user-id> <str-password> <str-host> <str-dir> <str-file-name>)
+;; @param <str-user-id> The user ID for logon.
+;; @param <str-password> The password for the user ID.
+;; @param <str-host> The remote host name or IP as a string.
+;; @param <str-dir> The sub directory on the host.
+;; @param <str-file-name> The name of the file to transfer.
+;; @return 'true' on success, 'nil' on failure.
+;; @example
+;; (FTP:put "somebody" "secret" "host.com" "subdir" "file")  ;; upload
+
+(define (put user-id password host subdir file-name)
+    (transfer user-id password host subdir file-name PUT))
+
+(define (transfer user-id password host subdir file-name mode)
+  (if (= subdir "") (set 'subdir "."))
+  (and
+    (connect-to host 21)
+    (send-get-result (append "USER " user-id "\r\n") "3")
+    (send-get-result (append "PASS " password "\r\n") "2")
+    (send-get-result (append "CWD " subdir "\r\n") "2")
+    (send-get-result "TYPE I\r\n" "2")
+    (set 'buff (send-get-result "PASV\r\n" "2"))
+    (regex {(\d+),(\d+),(\d+),(\d+),(\d+),(\d+)} buff)
+    (set 'port (+ (* 256 (int $5)) (int $6)))
+    (set 'ip (string $1 "." $2 "." $3 "." $4))
+    (set 'socket2 (net-connect ip port))
+
+    (if (= mode PUT)
+        (and
+            (check-file file-name)
+            (net-send socket (append "STOR " file-name "\r\n"))
+            (send-get-result "STAT\r\n" "1")
+            (set 'fle (open file-name "r"))
+            (while (> (read-buffer fle 'buffer 512) 0)
+                (if debug-mode (print "."))
+                (net-send socket2 buffer 512))
+            (close fle)) true)
+
+    (if (= mode GET)
+        (and
+            (net-send socket (append "RETR " file-name "\r\n"))
+            (send-get-result "STAT\r\n" "1")
+            (set 'fle (open file-name "w"))
+            (while (net-receive socket2 'buffer 512)
+                (if debug-mode (print "."))
+                (write-buffer fle buffer))
+            (close fle)) true)
+
+    (or (net-close socket2) true)
+    (net-send socket "QUIT\r\n")
+    (or (net-close socket) true)))
+
+(define (send-get-result str code)
+    (net-send socket str)
+    (if debug-mode (println "sent:" str))
+    (net-receive socket 'result 256 "\r\n")
+    (if debug-mode (println result))
+    (if (starts-with result code) result))
+
+(define (connect-to host port)
+    (set 'FTP:result nil)
+    (set 'socket (net-connect host port))
+    (if socket
+        (net-receive socket 'result 256 "\r\n")
+        (begin
+            (set 'result "could not connect")
+            nil)))    
+    
+(define (check-file file-name)
+    (if (file? file-name)
+        true
+        (begin
+            (set 'result (append file-name " does not exist"))
+            nil)))
+
+(context 'MAIN)
+
+; test
+;
+;(set 'FTP:debug-mode true)
+;
+;(FTP:put "userid" "password" "site.com" "tmp" "testfile")
+;
+;(FTP:get "userid" "password" "site.com" "tmp" "testfile")
+;
+;(exit)
+
+
+
+; eof
+
+
diff --git a/modules/gmp.lsp b/modules/gmp.lsp
new file mode 100644
index 0000000..a038993
--- /dev/null
+++ b/modules/gmp.lsp
@@ -0,0 +1,551 @@
+;; @module gmp.lsp
+;; @description GNU MP Bignum Library interface
+;; @version 1.5 - new library detection rotuine
+;; @author Lutz Mueller, 2007
+;;
+;; <h3>The GNU MP Bignum Library</h3>
+;; This modules interfaces to libgmp which can be obtained from 
+;; @link http://www.swox.com/gmp/ www.swox.com/gmp/ .
+;;
+;; Source code for libgmp.so (UNIX) or lbgmp.dll (Win32) or libgmp.dylib (Mac OS X) 
+;; is available at this site.
+;;
+;; This interface module presets the maximum precision to 1024.
+;; The precision can be changed to any other value by changing the 
+;; definition of 'MAX_PRECISION' in the source of this module.
+;;
+;; All arguments to the GMP functions in this module must be given as strings,
+;; an error will be thrown otherwise. When starting with a 0 the number is 
+;; assumed to be in octal format when starting with 0x in hexadecimal format.
+;;
+;; This file only imports a few functions from the many available in GNU GMP.
+;; See the GMP manual for more functions.
+;;
+;; Note, that since version 8.9.7 newLISP does all integer arithmetik with
+;; 64 bits giving up to 19 digits of precision. For precisions less or equal
+;; 19 digits newLISP's built-in 64-bit integer arithmetik is much faster.
+;;
+;; <h3>Usage</h3>
+;; At the beginning of the programfile include a 'load' statement for the module:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/gmp.lsp")
+;; </pre>
+;;
+;; @example
+;; (GMP:+ "123456789012345678901234567890" "123456789012345678901234567890") 
+;; => "246913578024691357802469135780"
+
+;; <h3>Adding more functions to the library</h3>
+;; When adding functions be aware that inside the GMP context
+;;  +,-,*,/,=,&lt;,&gt;,&lt;=,&gt;=  are overwritten for multiple precision and the 
+;; original operators  would have would have to be prefixed with MAIN when used, 
+;; inside the 'gmp.lsp' module.
+
+;; <br/><br/>
+;; <center><h2>Integer arithmetik</h2></center>
+;; @syntax (GMP:+ <arg1> <arg2>)
+;; add two integers in <arg1> and <arg2>
+;; @syntax (GMP:- <arg1> <arg2>)
+;; subtract <arg2> from <arg1>
+;; @syntax (GMP:* <arg1> <arg2>)
+;; multiply <arg1> by <arg2>
+;; @syntax (GMP:/ <arg1> <arg2>)
+;; divide <arg1> by <arg2>, round towards '0' (zero)
+;; @syntax (GMP:% <arg1> <arg2>)
+;; calc rest of division <arg1>/<arg2>
+;; @syntax (GMP:** <arg1> <arg2>)
+;; calc power(<arg1>, <arg2>)
+;; @syntax (GMP:= <arg1> <arg2>)
+;; test for <arg1> equal <arg2>
+;; @syntax (GMP:< <arg1> <arg2>)
+;; test for <arg1> smaller <arg2>
+;; @syntax (GMP:> <arg1> <arg2>)
+;; test for <arg1> bigger <arg2>
+;; @syntax (GMP:<= <arg1> <arg2>)]
+;; test for <arg1> smaller or equal <arg2>
+;; @syntax (GMP:>= <arg1> <arg2>)
+;; test for <arg1> bigger or equal <arg2>
+;;
+;; <center><h2>Bit operations</h2></center>
+;; @syntax (GMP:& <arg1> <arg2>)
+;; bitwise <and> of <arg1>, <arg2>
+;; @syntax (GMP:| <arg1> <arg2>)
+;; bitwise inclusive <or> of <arg1>, <arg2>
+;; @syntax (GMP:^ <arg1> <arg2>)
+;; bitwise exclusive <or> of <arg1>, <arg2>
+;; @syntax (GMP:~ <arg>)
+;; bitwise complement of <arg>
+;;
+;; <center><h2>Number theory</h2></center>
+;; @syntax (GMP:prime? <arg>)
+;; check if <arg> is prime
+;; @syntax (GMP:next-prime <arg>)
+;; calc closes prime greater than <arg>
+;; @syntax (GMP:factor <arg>)
+;; calc a list of prime factors for <arg>
+;; @syntax (GMP:gcd <arg1> <arg2>)
+;; greatest common divisor of <arg1> and <arg2>
+;; @syntax (GMP:bin <arg1> <arg2>)
+;; calc binomial (<arg1> <arg2>)
+;; @syntax (GMP:fac <arg>)
+;; arg! factorial(<arg>) 
+;; @syntax (GMP:fib <arg>)
+;; fibonacci(arg)
+;;
+;; <center><h2>Random numbers</h2></center>
+;; @syntax (GMP:seed <arg>)
+;; seed the random generator
+;; @syntax (GMP:rand <arg>)
+;; generate random numbers between 0 and arg - 1
+;;
+
+(constant '+ add '- sub '* mul '/ div)
+
+(context 'GMP)
+
+; maximum digits, can be set to any value higher if required
+; when choosing a different number the functions GMP:fac and GMP:fib
+; have to be re-calibrated for their maximum value not to overflow
+; the result space
+;
+(define MAX_PRECISION 1024)
+
+(define gmp-type-error "String expected in GMP module.")
+(define gmp-size-error "Argument too big in GMP module")
+(define gmp-divzero-error "Division by zero in GMP module")
+
+(set 'files '(
+    "/opt/local/lib/libgmp.3.4.2.dylib" ;Mac OSX
+    "/opt/local/lib/libgmp.3.3.3.dylib" ;Mac OSX
+    "/opt/local/lib/libgmp.3.dylib" ;Mac OSX
+    "/opt/local/lib/libgmp.dylib" ;Mac OSX
+    "/usr/local/lib/libgmp.so" ; Linux, BSDs
+    "libgmp-3.dll" ; Win32 in path
+))
+
+(set 'library (files (or 
+				(find true (map file? files)) 
+				(begin (println "cannot find GMP library") (exit)))))
+  
+; integer arithmetik    
+(import library "__gmpz_init")
+(import library "__gmpz_add")
+(import library "__gmpz_add_ui")
+(import library "__gmpz_sub")
+(import library "__gmpz_mul")
+(import library "__gmpz_tdiv_q")
+(import library "__gmpz_tdiv_r")
+(import library "__gmpz_cmp")
+(import library "__gmpz_cmp_si")
+(import library "__gmpz_set_si")
+(import library "__gmpz_divisible_p")
+(import library "__gmpz_pow_ui")
+
+; bit operators
+(import library "__gmpz_and")
+(import library "__gmpz_ior")
+(import library "__gmpz_xor")
+(import library "__gmpz_com")
+
+; number theory
+(import library "__gmpz_probab_prime_p")
+(import library "__gmpz_nextprime")
+(import library "__gmpz_gcd")
+(import library "__gmpz_bin_ui")
+(import library "__gmpz_fac_ui")
+(import library "__gmpz_fib_ui")
+
+; random numbers
+(import library "__gmpz_urandomm")
+(import library "__gmp_randseed")
+
+; conversion functions
+(import library "__gmpz_set_str")
+(import library "__gmpz_get_str")
+
+; auxiliary functions
+(import library "__gmpz_sizeinbase")
+(import library "__gmp_randinit_default")
+(import library "__gmp_randseed_ui")
+
+; reserve handles
+(define op1 (dup "\000" 12))
+(define op2 (dup "\000" 12))
+(define rop (dup "\000" 12))
+
+(define randstate (dup "\000" 60))
+
+; init handles
+(__gmpz_init op1)
+(__gmpz_init op2)
+(__gmpz_init rop)
+
+; handles to speed up factor
+(define mp-n (dup "\000" 12))
+(define mp-d (dup "\000" 12))
+(define mp-k (dup "\000" 12))
+(__gmpz_init mp-n)
+(__gmpz_init mp-d)
+(__gmpz_init mp-k)
+
+
+; init randstate
+(__gmp_randinit_default randstate)
+(__gmp_randseed_ui randstate (time-of-day))
+
+; init / reserve result string
+(define rops (dup "\000" (MAIN:+ 2 MAX_PRECISION)))
+
+; add two integers
+;
+(define (GMP:+ p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (__gmpz_add rop op1 op2)
+  (if (MAIN:> (__gmpz_sizeinbase rop 10) MAX_PRECISION)
+  	(throw-error gmp-size-error))
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; subtract two integers
+;
+(define (GMP:- p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (__gmpz_sub rop op1 op2)
+  (if (MAIN:> (__gmpz_sizeinbase rop 10) MAX_PRECISION)
+  	(throw-error gmp-size-error))
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; multiply two integers
+;
+(define (GMP:* p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (__gmpz_mul rop op1 op2)
+  (if (MAIN:> (__gmpz_sizeinbase rop 10) MAX_PRECISION)
+  	(throw-error gmp-size-error))
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; divide two integers
+; return floor value of result
+(define (GMP:/ p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (if (MAIN:= (__gmpz_cmp_si op2 0) 0) (throw-error gmp-divzero-error))
+  (__gmpz_tdiv_q rop op1 op2)
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; modulo two integers
+; return rest value of division result
+(define (GMP:% p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (if (MAIN:= (__gmpz_cmp_si op2 0) 0) (throw-error gmp-divzero-error))
+  (__gmpz_tdiv_r rop op1 op2)
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; exponentiation function
+; return power(p1 p2)
+;
+(define (GMP:** p1 p2 , pexp)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (set 'pexp (int p2 0))
+  (__gmpz_pow_ui rop op1 pexp)
+  (if (MAIN:> (__gmpz_sizeinbase rop 10) MAX_PRECISION)
+  	(throw-error gmp-size-error))
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+  
+; test of two integers are equal, return true if equal
+; otherwise nil
+;
+(define (GMP:= p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (MAIN:= (__gmpz_cmp op1 op2) 0)
+)
+  
+; test is p1 is smaller than p2 
+; return true or nil
+;
+(define (GMP:< p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (MAIN:< (__gmpz_cmp op1 op2) 0)
+)
+
+; test is p1 is smaller than p2
+; return true or nil
+;
+(define (GMP:> p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (MAIN:> (__gmpz_cmp op1 op2) 0)
+)
+
+; test is p1 is smaller or eaual than p2
+; return true or nil
+;
+(define (GMP:<= p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (MAIN:<= (__gmpz_cmp op1 op2) 0)
+)
+
+; test is p1 is bigger or equal than p2
+; return true or nil
+;
+(define (GMP:>= p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (MAIN:>= (__gmpz_cmp op1 op2) 0)
+)
+
+; bitwise and two integers
+;
+(define (GMP:& p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (__gmpz_and rop op1 op2)
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; bitwise inclusive or two integers
+;
+(define (GMP:| p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (__gmpz_ior rop op1 op2)
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; bitwise exclusive or two integers
+;
+(define (GMP:^ p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (__gmpz_xor rop op1 op2)
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; bitwise complement of one integer
+;
+(define (GMP:~ p1)
+  (if (not (string? p1)) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_com rop op1)
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; check if a prime
+; returns true if a prime
+; returns nil if not a primes or probably not a prime
+;
+(define (GMP:prime? p1 , r)
+  (if (not (string? p1)) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (set 'r (__gmpz_probab_prime_p op1 10))
+  (if
+    (MAIN:= r 0) nil
+    (MAIN:= r 1) (MAIN:= (next-prime (- p1 "1")) p1)
+    (MAIN:= r 2) true)
+)
+
+; get the next prime higher then arg
+;
+(define (GMP:next-prime p1)
+  (if (not (string? p1)) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_nextprime rop op1)
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; factorize n
+;
+(define (GMP:factor n)
+  (if (not (string? n)) (throw-error gmp-type-error))
+  (set 'factors nil)
+  (set 'prevfact nil)
+  (__gmpz_set_str mp-n n 0)
+  (if (MAIN:> (__gmpz_cmp_si mp-n 2) 0)
+    (begin
+      (__gmpz_set_si mp-d 2)
+      (__gmpz_set_si mp-k 0)
+
+      (while (MAIN:!= 0 (__gmpz_divisible_p mp-n mp-d))
+        (__gmpz_tdiv_q mp-n mp-n mp-d)
+        (__gmpz_add_ui mp-k mp-k 1)
+      )
+      
+      (if (MAIN:> (__gmpz_cmp_si mp-k 0) 0)
+        (push-factor mp-d mp-k))
+      
+      (__gmpz_set_si mp-d 3)
+      (__gmpz_mul op1 mp-d mp-d)
+      (while (MAIN:<= (__gmpz_cmp op1  mp-n) 0)
+        (__gmpz_set_si mp-k 0)        
+        (while (MAIN:!= 0 (__gmpz_divisible_p mp-n mp-d))
+          (__gmpz_tdiv_q mp-n mp-n mp-d)
+          (__gmpz_add_ui mp-k mp-k 1) )
+        (if (MAIN:> (__gmpz_cmp_si mp-k 0) 0) (push-factor mp-d mp-k))
+        (__gmpz_add_ui mp-d mp-d 2)
+        (__gmpz_mul op1 mp-d mp-d) )
+    ) 
+  ) 
+    
+  (if (MAIN:> (__gmpz_cmp_si mp-n 1))
+    (if prevfact
+      (begin
+        (___gmpz_set_si op1 1) 
+    	(push-factor mp-n op1))
+      (begin
+        (set 'n (get-string (__gmpz_get_str rops 10 mp-n)))
+        (push n factors -1)))) 
+  factors
+)
+
+(define (push-factor f k)
+  (set 'f (get-string (__gmpz_get_str rops 10 f)))
+  (set 'k (get-string (__gmpz_get_str rops 10 k)))
+  (if (not prevfact)
+    (begin
+      (push f factors -1)
+      (set 'k (- k "1"))))
+      
+  (while (> k "0")
+    (push f factors -1)
+    (set 'k (- k "1")) )
+)    
+      	
+
+; get the greates common divisor
+;
+(define (GMP:gcd p1 p2)
+  (if (or (not (string? p1)) (not (string? p2))) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_set_str op2 p2 0)
+  (__gmpz_gcd rop op1 op2)
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+
+; get binomial of <arg1> <arg2>
+;
+(define (GMP:bin n k)
+  (if (not (string? n)) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 n 0)
+  (set 'k (int k 0))
+  (__gmpz_bin_ui rop op1 k)
+  (if (MAIN:> (__gmpz_sizeinbase rop 10) MAX_PRECISION)
+  	(throw-error gmp-size-error))
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+  
+; get factorial of arg
+; args may not be bigger than 458
+; for 1024 digits precision in the result
+;
+(define (GMP:fac p1 , n)
+  (if (not (string? p1)) (throw-error gmp-type-error))
+  (set 'n (int p1))
+  (__gmpz_fac_ui rop n)
+  (if (MAIN:> (__gmpz_sizeinbase rop 10) MAX_PRECISION)
+  	(throw-error gmp-size-error))
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; get fibonacci of arg
+; arg may not be bigger than   for a 1024 digits result
+;
+(define (GMP:fib p1 , n)
+  (if (not (string? p1)) (throw-error gmp-type-error))
+  (set 'n (int p1))
+  (__gmpz_fib_ui rop n)
+  (if (MAIN:> (__gmpz_sizeinbase rop 10) MAX_PRECISION)
+  	(throw-error gmp-size-error))
+  (get-string (__gmpz_get_str rops 10 rop))
+)
+
+; get a random number between 0 and arg - 1
+;
+(define (GMP:rand p1)
+  (if (not (string? p1)) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmpz_urandomm rop randstate op1)
+  (get-string (__gmpz_get_str rops 10 rop))
+) 
+
+; seed the random generator
+;
+(define (GMP:seed p1)
+  (if (not (string? p1)) (throw-error gmp-type-error))
+  (__gmpz_set_str op1 p1 0)
+  (__gmp_randseed randstate op1)  
+  true
+)
+
+(define (check func <arg1> <arg2> result)
+   (if (MAIN:= (apply func (list <arg1> <arg2>)) result)
+   	(println "GMP:" (name func) "\t-> Ok")
+   	(println "Problem in GMP:" (name func)))
+)
+
+(context 'MAIN)
+
+; this test assumes that libgmp itself is correct, only the
+; newLISP implementation is tested
+;
+(define (test-GMP)
+  ; INTEGER ARITHMETIK
+  (GMP:check 'GMP:+ "123" "456" "579")
+  (GMP:check 'GMP:- "100" "99" "1")
+  (GMP:check 'GMP:* "123" "456" "56088")
+  (GMP:check 'GMP:/ "56088" "456" "123")
+  (GMP:check 'GMP:% "56088" "456" "0")
+  (GMP:check 'GMP:** "2" "10" "1024")
+  (GMP:check 'GMP:= "999999" "999999" true)
+  (GMP:check 'GMP:< "999999" "1000000" true)
+  (GMP:check 'GMP:> "999999" "1000000" nil)
+  (GMP:check 'GMP:<= "999999"  "1000000" true)
+  (GMP:check 'GMP:>= "999999" "1000000" nil)
+
+  ; BIT OPERATTIONS
+  (GMP:check 'GMP:& "0xAAAA" "0xFF00" "43520")
+  (GMP:check 'GMP:| "0xAAAA" "0x5555" "65535")
+  (GMP:check 'GMP:^ "0xAAAA" "0xAAAA" "0")
+  (GMP:check 'GMP:~ "0xFFFF" nil "-65536")
+
+  ; NUMBER THEORY
+  (GMP:check 'GMP:prime? "127" nil true)
+  (GMP:check 'GMP:next-prime "127" nil "131")
+  (GMP:check 'GMP:factor "123" nil '("3" "41"))
+  (GMP:check 'GMP:gcd "20" "8" "4")
+  (GMP:check 'GMP:bin "10" "2" "45")
+  (GMP:check 'GMP:fac "5" nil "120")
+  (GMP:check 'GMP:fib "30" nil "832040")
+
+  ; RANDOM NUMBERS
+  (GMP:check 'GMP:seed "12345" nil true)
+  (GMP:check 'GMP:rand "1000000" nil "18235")
+)
+
+; eof
diff --git a/modules/index.html b/modules/index.html
new file mode 100644
index 0000000..34dccf5
--- /dev/null
+++ b/modules/index.html
@@ -0,0 +1,51 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+<META http-equiv="Content-Type" content="text/html; charset=utf-8">
+<title>Index</title>
+
+<style type="text/css" media="screen">
+<!--
+span.arw {
+	color:#666666;
+	font-size: 100%;
+	}
+	
+body, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+	line-height: 115%;
+ 	}
+
+h1, h2, h3, h4 {
+	font-family: Georgia, Times New Roman, Times, serif;
+   	font-size: 110%;
+	}
+
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+   	font-size: 100%;
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	font-size: 100%;
+	}
+-->
+</style>
+</head>
+
+<body style="margin: 20px;" text="#333333" bgcolor="#FFFFFF" 
+			link="#376590" vlink="#551A8B" alink="#ffAA28">
+<blockquote>
+<center><h1>Index</h1></center>
+<a href="winscript.lsp.html"><br/><br/><h2>Module:&nbsp;winscript</h2></a>
+<p>Embedded VBScript/JScript in newLISP.</p>
+<a href="winscript.lsp.html#WINSCRIPT_Initialize">Initialize</a>&nbsp; &nbsp; <a href="winscript.lsp.html#WINSCRIPT_Uninitialize">Uninitialize</a>&nbsp; &nbsp; <a href="winscript.lsp.html#WINSCRIPT_Exec">Exec</a>&nbsp; &nbsp; <a href="winscript.lsp.html#WINSCRIPT_Eval">Eval</a>&nbsp; &nbsp; <a href="winscript.lsp.html#WINSCRIPT_LastResult">LastResult</a>&nbsp; &nbsp; 
+<p></p><center>- &part; -</center><br/>
+<center><font face='Arial' size='-2' color='#444444'>
+generated with <a href="http://newlisp.org">newLISP</a>&nbsp;
+and <a href="http://newlisp.org/newLISPdoc.html">newLISPdoc</a>
+</font></center>
+</blockquote>
+</body>
+</html>
diff --git a/modules/infix.lsp b/modules/infix.lsp
new file mode 100644
index 0000000..edbd263
--- /dev/null
+++ b/modules/infix.lsp
@@ -0,0 +1,135 @@
+;; @module infix.lsp
+;; @description Infix expression parser
+;; @version 2.1 - comments redone for automatic documentation
+;; @author Lutz Mueller
+;;
+;; <h2>Infix expression parser</h2>
+;; Parses infix, prefix or postfix expressions given in strings and returns a
+;; newLISP expressions, which can be evaluated; captures syntax errors.
+;;
+;; At the beginning od the program using this module include the following
+;; statement:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/infix.lsp")
+;; </pre>
+
+;; @syntax (INFIX:xlate <str-expression> [<context-target>])
+;; @param <str-expression> The infix expression in a string
+;; @param <context-target> An optional context as compile taret.
+;; @return A newLISP expression or 'nil' on failure.
+;; When 'nil' is returned then the error message is in 'result'.
+;; As an optional second parameter a target context can be passed, 
+;; if not used, MAIN is assumed.
+;;
+;; Note that the parser requires operators, variables and constants surrounded
+;; by spaces except where parenthesis are used.
+;;        
+;; @example
+;; (INFIX:xlate "3 + 4") => (add 3 4) ;; parses infix
+;; (INFIX:xlate "+ 3 4") => (add 3 4) ;; parses prefix s-expressions
+;; (INFIX:xlate "3 4 +") => (add 2 4) ;; parses postfix
+;;
+;; (INFIX:xlate "3 + * 4") => "ERR: missing argument for +"
+;;
+;; (eval (INFIX:xlate "3 + 4")) => 7
+;;
+;; (INFIX:xlate "(3 + 4) * (5 - 2)")  => (mul (add 3 4) (sub 5 2))
+;;
+;; (INFIX:xlate "(a + b) ^ 2 + (a - b) ^ 2") => (add (pow (add a b) 2) (pow (sub a b) 2))
+;;
+;; (INFIX:xlate "x = (3 + sin(20)) * (5 - 2)")  => (setq x (mul (add 3 (sin 20)) (sub 5 2)))
+;;
+;; (INFIX:xlate "x = (3 + sin(10 - 2)) * (5 - 2)")  
+;;         => (setq x (mul (add 3 (sin (sub 10 2))) (sub 5 2)))
+
+; operator priority table
+; (token operator arg-count priority)
+;
+(context 'INFIX)
+
+(set 'operators '(
+  ("=" setq 2 2) 
+  ("+" add 2 3) 
+  ("-" sub 2 3) 
+  ("*" mul 2 4) 
+  ("/" div 2 4)
+  ("^" pow 2 5)
+  ("sin" sin 1 9)
+  ("cos" cos 1 9)
+  ))
+
+(set 'targetContext MAIN)
+
+(define (xlate str ctx)
+  (if ctx (set 'targetContext ctx))
+  (if (catch (infix-xlate str) 'result)
+    result                     ;; if starts with ERR: is error else result
+    (append "ERR: " result)))  ;; newLISP error has ocurred
+
+
+(define (infix-xlate str)
+  (set 'tokens (parse str))
+  (set 'varstack '())
+  (set 'opstack '())
+  (dolist (tkn tokens)
+	(case tkn
+        ("(" (push tkn opstack))
+        (")" (close-parenthesis))
+        (true (if (assoc tkn operators)
+                  (process-op tkn)
+                  (push tkn varstack)))))
+  (while (not (empty? opstack))
+        (make-expression))
+
+  (set 'result (first varstack))
+  (if (or (> (length varstack) 1) (not (list? result)))
+    (throw "ERR: wrong syntax")
+    result))
+
+
+; pop all operators and make expressions
+; until an open parenthesis is found
+;
+(define (close-parenthesis)
+ (while (not (= (first opstack) "("))
+    (make-expression))
+ (pop opstack))
+  
+
+; pop all operator, which have higher/equal priority
+; and make expressions
+;
+(define (process-op tkn)
+  (if (not (empty? opstack))
+      (while (<= (lookup tkn operators 3) (lookup (first opstack) operators 3))
+        (make-expression)))
+  (push tkn opstack))
+
+; pops an operator from the opstack and makes/returns an
+; newLISP expression
+;
+(define (make-expression)
+  (set 'expression '())
+  (if (empty? opstack) 
+        (throw "ERR: missing parenthesis"))
+  (set 'ops (pop opstack))
+  (set 'op (lookup ops operators 1))
+  (set 'nops (lookup ops operators 2))
+  (dotimes (n nops)
+    (if (empty? varstack) (throw (append "ERR: missing argument for " ops)))
+    (set 'vars (pop varstack))
+    (if (atom? vars)
+            (if (not (or (set 'var (float vars))
+                         (and (legal? vars) (set 'var (sym vars targetContext))) ))
+                (throw (append vars "ERR: is not a variable"))
+                (push var expression))
+            (push vars expression)))
+  (push op expression)
+  (push expression varstack))
+
+(context 'MAIN)
+    
+; eof ;
+
+  
+  
diff --git a/modules/mysql.lsp b/modules/mysql.lsp
new file mode 100644
index 0000000..fc2c3d4
--- /dev/null
+++ b/modules/mysql.lsp
@@ -0,0 +1,249 @@
+;; @module mysql.lsp
+;; @description MySQL v.4 interface
+;; @version v2.31 - addition for mysql_escape_string (Jeff)
+;; @author Lutz Mueller 2003, Gordon Fischer 2005, Jeff 2007
+;;
+;; newLISP connection to the MySQL v 4.1 database
+;;
+;; Current tested MySQL version is 4.1.14
+;;
+;; See also @link http://www.mysql.com www.mysql.com
+;;
+;; This file is tested with MySQL 4.0/4.1  and will not work on
+;; previous versions 3.22 and 3.23 which need different offsets
+;; into the MYSQL result data structure.
+;;
+;; <h3>Implemented functions</h3>
+;; <pre>
+;;     MySQL:init ................ get a database handle MYSQL
+;;     MySQL:connect ............. connect to a database
+;;     MySQL:query ............... execute a SQL statement
+;;     MySQL:num-rows ............ rows in result of query
+;;     MySQL:num-fields .......... columns in result of query
+;;     MySQL:fetch-row ........... get row from the query result
+;;     MySQL:fetch-all ........... get all rows from the last query
+;;     MySQL:database ............ return all database names
+;;     MySQL:tables .............. return all tables names
+;;     MySQL:fields .............. return all fields in a table
+;;     MySQL:data-seek ........... position in result for fetching
+;;     MySQL:affected-rows ....... number of affected rows from operation
+;;     MySQL:inserted-id ......... last value of auto increment id operation
+;;     MySQL:escape .............. escapes SQL input string using mysql_escape_string
+;;     MySQL:error ............... get error message
+;;     MySQL:close-db ............ close database connection
+;; </pre>
+;;
+;; For details on usage see the documentation for the mysql5.lsp module.
+
+(context 'MySQL)
+
+(set 'libmysqlclient "/usr/lib/libmysqlclient.so.14")
+
+(import libmysqlclient "mysql_init")
+(import libmysqlclient "mysql_real_connect")
+(import libmysqlclient "mysql_get_host_info")
+(import libmysqlclient "mysql_escape_string")
+(import libmysqlclient "mysql_query")
+(import libmysqlclient "mysql_real_query")
+(import libmysqlclient "mysql_store_result")
+(import libmysqlclient "mysql_free_result")
+(import libmysqlclient "mysql_data_seek")
+(import libmysqlclient "mysql_fetch_row")
+(import libmysqlclient "mysql_close")
+(import libmysqlclient "mysql_fetch_field_direct")
+(import libmysqlclient "mysql_insert_id")
+
+; initialize database access, get an access handle MYSQL
+;
+(define (init)
+  (set 'MYSQL (mysql_init 0))
+  (if (= MYSQL 0) (set 'MYSQL nil))
+  (not (= MYSQL nil)))
+
+; connect to a specific database
+;
+(define (connect host user passw database)
+  (not(= (mysql_real_connect MYSQL host user passw database 0 0 0) 0)))
+
+; send a SQL string for evaluation
+;
+(define (query sql)
+  (if MYSQL_RES (mysql_free_result MYSQL_RES))
+  (set 'result  (= (mysql_query MYSQL sql) 0))
+  (set 'MYSQL_RES (mysql_store_result MYSQL)) 
+  (if (= MYSQL_RES 0) (set 'MYSQL_RES nil))
+  (if (and result (find "insert into" sql 1)) (set 'result (inserted-id)))
+  result)
+
+; number of rows from last query
+;
+(define (num-rows)
+  (if MYSQL_RES (get-int MYSQL_RES)))
+
+; number of columns from last query
+;
+(define (num-fields)
+  (if MYSQL_RES (get-int (int (+ MYSQL_RES 60)))))
+
+
+; format the result based on the field type.
+;
+
+(define (keep-type res_ptr field_addr column_num, data)
+  (set 'type_ptr (mysql_fetch_field_direct res_ptr (int column_num)))
+  ; The field type is the 20th field of the MySQL_FIELD structure
+  ; since fields 1-19 are all 4 byte fields we get the enum value
+  ; like so
+  (set 'data (get-int (int (+ type_ptr (* 19 4)))))
+  ; Consult 'enum_field_types' in mysql_com.h for values
+  (if (= data 1) ;; boolean
+        (get-string field_addr)
+      (= data 3) ;; integer
+        (int (get-string field_addr))
+      (= data 12) ;; datetime
+        (apply date-value (map int (parse (get-string field_addr) "[-: ]" 0)))
+      (= data 4) ;; float
+        (float (get-string field_addr))
+      ; else
+      (get-string field_addr)
+  )
+)
+
+; fetch a row from a query, subsequent calls go trough the table
+; until the bottom is reached
+;
+(define (fetch-row)
+  (if MYSQL_RES
+    (set 'rdata (mysql_fetch_row MYSQL_RES))
+    (set 'rdata 0))
+  (if (!= rdata 0)
+    (begin
+      (set 'row '())
+      (dotimes (field (num-fields))
+            (set 'field_addr (get-int (int (+ rdata (* field 4)))))
+            (if (= field_addr 0)
+              (push nil row -1) ;; what to do when the field contains NULL
+              (push (keep-type MYSQL_RES field_addr field) row -1)))
+    row)))
+
+; return all rows/columns from the last query
+;
+(define (fetch-all)
+  (set 'all '())
+  (dotimes (x (num-rows)) (push (fetch-row) all))
+  (reverse all))
+
+; get a list of databases
+;
+(define (databases)
+  (query "show databases;")
+  (fetch-all))
+
+; get a list of tables
+;
+(define (tables)
+  (query "show tables;")
+  (fetch-all))
+
+; get a list of fields
+;
+(define (fields table)
+  (query (append "show fields from " table ";"))
+  (fetch-all))
+  
+
+; position to row in result set
+;
+(define (data-seek offset)
+  (if MYSQL_RES
+    (begin
+    (mysql_data_seek MYSQL_RES offset)
+    true)))
+
+; Escapes input value using mysql_escape_string
+(define (escape value , safe-value) 
+  (set 'safe-value (dup " " (+ 1 (length value)))) 
+  (MySQL:mysql_escape_string safe-value value (length value)) 
+  safe-value)
+
+; text info about error
+;
+(define (error)
+  (if MYSQL (get-string (+ MYSQL 60))))
+
+; number of affected rows by last MySQL:query operation
+;
+(define (affected-rows)
+  (if MYSQL
+    (get-int (int (+ MYSQL 368)))))
+
+; last insert_id from auto increment field
+;
+(define (inserted-id)
+  (if MYSQL (mysql_insert_id MYSQL)))
+
+; close database access
+;
+(define (close-db)
+  (if MYSQL_RES (mysql_free_result MYSQL_RES))
+  (if MYSQL (mysql_close MYSQL))
+  (set 'MYSQL nil)
+  (set 'MYSQL_RES nil)
+  true)
+
+(context 'MAIN)
+
+; ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;
+; test data base functions
+;
+
+(define (test-mysql)
+  (MySQL:init)
+  (MySQL:connect 0 "" 0 "test")
+  
+  (println "databases:")
+  (MySQL:query "show databases;")
+  (dotimes (x (MySQL:num-rows)) (println (MySQL:fetch-row)))
+  (println)
+  
+  (MySQL:query "create table fruits (name CHAR(20), 
+                                     qty INT(3),
+                                     num INT(4) AUTO_INCREMENT UNIQUE);")
+  
+  (MySQL:query "insert into fruits values ('apples', 11, null);")
+  (println "inserted-id: " (MySQL:inserted-id))
+  (MySQL:query "insert into fruits values ('oranges', 22, null);")
+  (println "inserted-id: " (MySQL:inserted-id))
+  (MySQL:query "insert into fruits values ('bananas', 33, null);")
+  (println "inserted-id: " (MySQL:inserted-id))
+  
+  (println "\n" (MySQL:affected-rows) " affected rows in query")
+
+  (println "inserted into fruits:")
+  (MySQL:query "select * from fruits;")
+  (dotimes (x (MySQL:num-rows)) (println (MySQL:fetch-row)))
+
+  (println "rows = " (MySQL:num-rows) " fields = " (MySQL:num-fields))
+  (println)
+  
+  (println "tables:")
+  (MySQL:query "show tables;")
+  (dotimes (x (MySQL:num-rows)) (println (MySQL:fetch-row)))
+  (println)
+  
+  (MySQL:query "select * from fruits;")
+  (MySQL:data-seek 2)
+  (println "data-seek to offset 2:")
+  (println (MySQL:fetch-row))
+  (println)
+  
+  (println "fetch-all:")
+  (println (MySQL:query "select * from fruits;"))
+  (println (MySQL:fetch-all))   
+  
+  (MySQL:query "drop table fruits;")
+  (MySQL:close-db)
+)
+
+; eof
diff --git a/modules/mysql5.lsp b/modules/mysql5.lsp
new file mode 100644
index 0000000..a14ebf2
--- /dev/null
+++ b/modules/mysql5.lsp
@@ -0,0 +1,383 @@
+;; @module mysql5.lsp 
+;; @description MySQL v.5 interface
+;; @version 2.6 - addition for mysql_escape_string (Jeff)
+;; @author Lutz Mueller 2003-2006, Gordon Fischer 2005, Jeff Ober 2007
+;;
+;; This MySQL 5 interface module has been tested on version 5.0.19
+;; of mysql from @link http://www.mysql.com www.mysql.com
+;;
+;; This implementation supports a maximum of 2,147,483,647
+;; rows in a database table. Now automatically adjusts row indexes to
+;; endian type of host CPU, but higher 32 bits are treated as 0 for now.
+;;
+;; <h3>Requirements</h3>
+;; At the beginning of the program file include a 'load' statment for the module:
+;; <pre>
+;; (load "/usr/share/newlisp/mysql5.lsp")
+;; </pre>
+;;
+;; A version of 'libmysqlclient' for a specific platform is required:
+;;  
+;; on LINUX/UNIX: '/usr/local/mysql/libmysqlclient.15.so' <br>
+;; on Mac OS X:   '/usr/local/mysql/libmysqlclient.15.dylib'
+;;
+;; To compile MySQL with client libraries use:
+;;
+;; './configure --prefix=/usr/local --enable-shared'
+;;
+;; This library might be in a different location on a particular
+;; installation of MySQL or have a different name.
+;; Change accordingly in the code at the beginning.
+;;
+;; The MySQL server itself may reside on a different machine
+;; on the network. The library 'libmysqlclient' will communicate
+;; with that server. The correct connection is created using
+;; the 'MySQL:connect' call.
+;;
+;; At the bottom of the module file 'mysql5,lsp' a test routine 'test-mysql'
+;; is included to test for correct installation of MySQL.
+;;
+;; In the 'MySQL:connect' call of that test routine the correct parameters 
+;; for the MySQL server location and user and password have to be inserted.
+;;
+;; <h3>Adapting mysql.lsp to other versions of MySQL</h3>
+;; Some of the functions like 'mysql_num_rows()' cannot be imported
+;; because they are really macros extracting data from structures
+;; like 'MYSQL' or 'MYSQL_RES'. See the file 'mysql.h' in your MySQL distribution.
+;;
+;; The file 'sql.c' in the newLISP distribution contains a program
+;; calculating the offsets of the most important fields in these
+;; structures. These offsets are used here to retrieve values for
+;; the number of rows in a result set, etc. Using these offsets
+;; and the information found in 'mysql.h' and 'mysql_com.h', other
+;; functions can be imported and wrappers built around them.
+;; In this case one needs to install the developer's version of
+;; MySQL to get the header files mentioned.
+;;
+;; <h3>Functions available</h3>
+;; <pre>
+;;     MySQL:init ................ get a database handle MYSQL
+;;     MySQL:connect ............. connect to a database
+;;     MySQL:query ............... execute a SQL statement
+;;     MySQL:num-rows ............ rows in result of query
+;;     MySQL:num-fields .......... columns in result of query
+;;     MySQL:fetch-row ........... get row from the query result
+;;     MySQL:fetch-all ........... get all rows from the last query
+;;     MySQL:database ............ return all database names
+;;     MySQL:tables .............. return all tables names
+;;     MySQL:fields .............. return all fields in a table
+;;     MySQL:data-seek ........... position in result for fetching
+;;     MySQL:affected-rows ....... number of affected rows from operation
+;;     MySQL:inserted-id ......... last value of auto increment id operation
+;;     MySQL:escape .............. escapes SQL input string using mysql_real_escape_string
+;;     MySQL:error ............... get error message
+;;     MySQL:close-db ............ close database connection
+;; </pre>
+;;
+;; <h3>A typical MySQL session</h3>
+;; The following code piece outlines a typical MySQL session:
+;; @example
+;; (load "mysql5.lsp) ; load the module file
+;;
+;; (MySQL:init)       ; initialize
+;; (MySQL:connect "192.168.1.10" "auser" "secret" "mydb") ; logon
+;; (MySQL:query "select ...;") ; SQL query
+;; (MySQL:query "insert ...;") ; SQL query
+;;        ...
+;; (MySQL:close-db)
+
+;; The database server is listening on IP 192.168.1.10. The program
+;; connects with username '"auser"' password '"secret"' to a database with 
+;; the name '"mydb"'. After connecting SQL statements are performed and
+;; finally the program disconnects from the server.
+
+(context 'MySQL)
+
+(set 'files '(
+	"/usr/lib/libmysqlclient.so" ; Linux, UNIX
+	"/usr/local/mysql/lib/libmysqlclient.dylib" ; MacOS X
+))
+
+(set 'libmysqlclient (files (or 
+				(find true (map file? files)) 
+				(begin (println "cannot find libmysqlclient library") (exit)))))
+
+(import libmysqlclient "mysql_init")
+(import libmysqlclient "mysql_real_connect")
+(import libmysqlclient "mysql_get_host_info")
+(import libmysqlclient "mysql_real_escape_string")
+(import libmysqlclient "mysql_query")
+(import libmysqlclient "mysql_real_query")
+(import libmysqlclient "mysql_store_result")
+(import libmysqlclient "mysql_free_result")
+(import libmysqlclient "mysql_data_seek")
+(import libmysqlclient "mysql_fetch_row")
+(import libmysqlclient "mysql_close")
+(import libmysqlclient "mysql_fetch_field_direct")
+(import libmysqlclient "mysql_insert_id")
+
+; following constant offsets into 'C' data structures are different on each mayor MySQL
+; version compile and run util/sql.c from the distribution to obtain these numbers
+
+; check endianess of the host CPU 
+(set 'big-endian (= (pack ">ld" 1) (pack "ld" 1)))
+
+(constant 'NUM_ROWS_OFFSET (if big-endian 4 0))
+(constant 'NUM_FIELDS_OFFSET 60)
+(constant 'ERROR_OFFSET 85)
+(constant 'INSERT_ID_OFFSET (if big-endian 708 704))
+(constant 'AFFECTED_ROWS_OFFSET (if big-endian 700 696))
+
+;; @syntax (MySQL:init)
+;; @return 'true' on success, 'nil' on failure.
+
+(define (init)
+  (set 'MYSQL (mysql_init 0))
+  (if (= MYSQL 0) (set 'MYSQL nil))
+  (not (= MYSQL nil)))
+
+;; @syntax (MySQL:connect <str-server> <str-userID> <str-password> <str-db>)
+;; @param <str-server> The host name or IP address or <tt>0</tt> for localhost.
+;; @param <str-userID> The user ID for authentication.
+;; @param <str-password> The password for authentication.
+;; @param <str-db> The name of the database to connect to.
+;; @return 'true' for success or 'nil' for failure.
+;;
+;; Connects to a database on server and authenticates a user ID.
+;; '(MySQL:init)' must have been called previously.
+
+(define (connect host user passw database)
+  (not(= (mysql_real_connect MYSQL host user passw database 0 0 0) 0)))
+
+;; @syntax (MySQL:query <str-sql>)
+;; @param <str-sql> A valid SQL query string.
+;; @return For 'insert' queries rerturns the inserted ID else 'true' 
+;; for success or 'nil' for failure.
+;;
+;; Sends a SQL query string to the database server for evaluation.
+
+(define (MySQL:query sql)
+  (if MYSQL_RES (mysql_free_result MYSQL_RES))
+  (set 'result  (= (mysql_query MYSQL sql) 0))
+  (set 'MYSQL_RES (mysql_store_result MYSQL)) 
+  (if (= MYSQL_RES 0) (set 'MYSQL_RES nil))
+  (if (and result (find "insert into" sql 1)) (set 'result (inserted-id)))
+  result)
+
+;; @syntax (MySQL:num-rows)
+;; @return Number of rows from last query.
+
+(define (num-rows)
+  (if MYSQL_RES (get-int (int (+ MYSQL_RES NUM_ROWS_OFFSET)))))
+
+;; @syntax (MySQL:num-fields)
+;; @return Number of columns from last query.
+
+(define (num-fields)
+  (if MYSQL_RES (get-int (int (+ MYSQL_RES NUM_FIELDS_OFFSET)))))
+
+
+; format the result based on the field type.
+;
+
+(define (keep-type res_ptr field_addr column_num, data)
+  (set 'type_ptr (mysql_fetch_field_direct res_ptr (int column_num)))
+  ; The field type is the 20th field of the MySQL_FIELD structure
+  ; since fields 1-19 are all 4 byte fields we get the enum value
+  ; like so
+  (set 'data (get-int (int (+ type_ptr (* 19 4)))))
+  ; Consult 'enum_field_types' in mysql_com.h for values
+  (if (= data 1) ;; boolean
+        (get-string field_addr)
+      (= data 3) ;; integer
+        (int (get-string field_addr))
+      (= data 12) ;; datetime
+        (apply date-value (map int (parse (get-string field_addr) "[-: ]" 0)))
+      (= data 4) ;; float
+        (float (get-string field_addr))
+      ; else (will handle TEXT type 252)
+      (get-string field_addr)
+  )
+)
+
+;; @syntax (MySQL:fetch-row)
+;; @return A list of field elements.
+;;
+;; Fetches a row from a previous SQL 'MySQL:query'  'select' statement.
+;; Subsequent calls fetch row by row from the result table until the
+;; end of the table is reached.
+
+(define (fetch-row)
+  (if MYSQL_RES
+    (set 'rdata (mysql_fetch_row MYSQL_RES))
+    (set 'rdata 0))
+  (if (!= rdata 0)
+    (begin
+      (set 'row '())
+      (dotimes (field (num-fields))
+            (set 'field_addr (get-int (int (+ rdata (* field 4)))))
+            (if (= field_addr 0)
+              (push nil row -1) ;; what to do when the field contains NULL
+              (push (keep-type MYSQL_RES field_addr field) row -1)))
+    row)))
+
+;; @syntax (MySQL:fetch-all)
+;; @return All rows/fields from the last query.
+;;
+;; The whole result set from the query is returned at once as a list of row lists.
+
+(define (fetch-all)
+
+  (dotimes (x (num-rows)) (push (fetch-row) all))
+  (reverse all))
+
+;; @syntax (MySQL:databases)
+;; @return A list of databases.
+;;
+;; Performs a 'show databases;' query.
+
+(define (databases)
+  (query "show databases;")
+  (fetch-all))
+
+;; @syntax (MySQL:table)
+;; @return A list of tables in the database.
+;;
+;; Performs a 'show tables;' query.
+
+(define (tables)
+  (query "show tables;")
+  (fetch-all))
+
+;; @syntax (MySQL:fields <str-table>)
+;; @param <str-table> The name of the table.
+;; @return A list of field description lists.
+;;
+;; For each field name in the table a list of specifications
+;; for that field is returned. The list starts with the name
+;; for the field followed by the type size/precision and
+;; other optional field descriptions.
+
+(define (fields table)
+  (query (append "show fields from " table ";"))
+  (fetch-all))
+  
+;; @syntax (MySQL:data-seek <num-offset>)
+;; @param <num-offset> The <tt>0</tt> based offset to position inside the data set.
+;; @return Always 'true'. 
+;; 
+;; Positions in the result set at a zero based offset
+;; for a subsequent 'MySQL:fetch-row' call. If the offset
+;; is out of the allowed range for the result set a subsequent
+;; fetch-row will return 'nil'.
+ 
+(define (data-seek offset)
+  (if MYSQL_RES
+    (if big-endian
+    	(mysql_data_seek MYSQL_RES  0 (int offset))
+        (mysql_data_seek MYSQL_RES (int offset) 0)))
+  true
+)
+
+;; @syntax (MySQL:error)
+;; @return Text info about the last error which occured.
+
+(define (error)
+  (if MYSQL (get-string (+ MYSQL ERROR_OFFSET))))
+
+
+;; @syntax (MySQL:affected-rows)
+;; @return Number of affected rows by the last 'MySQL:query' operation.
+
+(define (affected-rows)
+  (if MYSQL
+    (get-int (int (+ MYSQL AFFECTED_ROWS_OFFSET)))))
+
+;; @syntax (MySQL:inserted-id)
+;; @return Last insert ID from an auto increment field.
+
+(define (inserted-id)
+;  (if MYSQL (mysql_insert_id MYSQL))
+  (if MYSQL (get-int (int (+ MYSQL INSERT_ID_OFFSET)))))
+
+;; @syntax (MySQL:escape <str-sql>)
+;; @return escaped string
+;;
+;; This function will escape special characters in <str-sql>, so that it 
+;; is safe to place it in a MySQL query.
+(define (escape value , safe-value) 
+  (set 'safe-value (dup " " (+ 1 (length value)))) 
+  (MySQL:mysql_real_escape_string MySQL:MYSQL safe-value value (length value)) 
+  safe-value)
+
+;; @syntax (MySQL:close-db)
+;; @return Always 'true'.
+;;
+;; Closes database access. For new database acess, both 'MySQL:init' and 
+;; 'MySQL:connect' functions have to be called.
+
+(define (close-db)
+  (if MYSQL_RES (mysql_free_result MYSQL_RES))
+  (if MYSQL (mysql_close MYSQL))
+  (set 'MYSQL nil)
+  (set 'MYSQL_RES nil)
+  true)
+
+(context 'MAIN)
+
+; ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;
+; test data base functions
+;
+
+(define (test-mysql)
+  (MySQL:init)
+  (MySQL:connect 0 "" 0 "test")
+  
+  (println "databases:")
+  (MySQL:query "show databases;")
+
+  (dotimes (x (MySQL:num-rows)) (println (MySQL:fetch-row)))
+  (println)
+  
+  (MySQL:query "create table fruits (name TEXT(2000), 
+                                     qty INT(3),
+                                     num INT(4) AUTO_INCREMENT UNIQUE);")
+  
+  (MySQL:query "insert into fruits values ('apples', 11, null);")
+  (println "inserted-id: " (MySQL:inserted-id))
+  (MySQL:query "insert into fruits values ('oranges', 22, null);")
+  (println "inserted-id: " (MySQL:inserted-id))
+  (MySQL:query "insert into fruits values ('bananas', 33, null);")
+  (println "inserted-id: " (MySQL:inserted-id))
+
+  (println "inserted into fruits:")
+  (MySQL:query "select * from fruits;")
+  (println "\n" (MySQL:affected-rows) " affected rows in query select")
+  (dotimes (x (MySQL:num-rows)) (println (MySQL:fetch-row)))
+
+  (println "no rows = " (MySQL:num-rows) " no fields = " (MySQL:num-fields))
+  (println "fields = " (MySQL:fields "fruits"))
+  (println)
+  
+  (println "tables:")
+  (MySQL:query "show tables;")
+  (dotimes (x (MySQL:num-rows)) (println (MySQL:fetch-row)))
+  (println)
+  
+  (MySQL:query "select * from fruits;")
+  (MySQL:data-seek 2)
+
+  (println "data-seek to offset 2:")
+  (println (MySQL:fetch-row))
+  (println)
+  
+  (println "fetch-all:")
+  (println (MySQL:query "select * from fruits;"))
+  (println (MySQL:fetch-all))   
+  
+  (MySQL:query "drop table fruits;")
+  (MySQL:close-db)
+)
+
+; eof
diff --git a/modules/mysql51.lsp b/modules/mysql51.lsp
new file mode 100644
index 0000000..a79c617
--- /dev/null
+++ b/modules/mysql51.lsp
@@ -0,0 +1,383 @@
+;; @module mysql51.lsp 
+;; @description MySQL v.5.1 interface
+;; @version 2.6 - addition for mysql_escape_string (Jeff)
+;; @author Lutz Mueller 2003-2006, Gordon Fischer 2005, Jeff Ober 2007
+;;
+;; This MySQL 5.1 interface module has been tested on version 5.1.21
+;; of mysql from @link http://www.mysql.com www.mysql.com
+;;
+;; This implementation supports a maximum of 2,147,483,647
+;; rows in a database table. Now automatically adjusts row indexes to
+;; endian type of host CPU, but higher 32 bits are treated as 0 for now.
+;;
+;; <h3>Requirements</h3>
+;; At the beginning of the program file include a 'load' statment for the module:
+;; <pre>
+;; (load "/usr/share/newlisp/mysql5.lsp")
+;; </pre>
+;;
+;; A version of 'libmysqlclient' for a specific platform is required:
+;;  
+;; on LINUX/UNIX: '/usr/local/mysql/libmysqlclient.so' <br>
+;; on Mac OS X:   '/usr/local/mysql/libmysqlclient.dylib'
+;;
+;; To compile MySQL with client libraries use:
+;;
+;; './configure --prefix=/usr/local --enable-shared'
+;;
+;; This library might be in a different location on a particular
+;; installation of MySQL or have a different name.
+;; Change accordingly in the code at the beginning.
+;;
+;; The MySQL server itself may reside on a different machine
+;; on the network. The library 'libmysqlclient' will communicate
+;; with that server. The correct connection is created using
+;; the 'MySQL:connect' call.
+;;
+;; At the bottom of the module file 'mysql51r.lsp' a test routine 'test-mysql'
+;; is included to test for correct installation of MySQL.
+;;
+;; In the 'MySQL:connect' call of that test routine the correct parameters 
+;; for the MySQL server location and user and password have to be inserted.
+;;
+;; <h3>Adapting mysql.lsp to other versions of MySQL</h3>
+;; Some of the functions like 'mysql_num_rows()' cannot be imported
+;; because they are really macros extracting data from structures
+;; like 'MYSQL' or 'MYSQL_RES'. See the file 'mysql.h' in your MySQL distribution.
+;;
+;; The file 'sql.c' in the newLISP distribution contains a program
+;; calculating the offsets of the most important fields in these
+;; structures. These offsets are used here to retrieve values for
+;; the number of rows in a result set, etc. Using these offsets
+;; and the information found in 'mysql.h' and 'mysql_com.h', other
+;; functions can be imported and wrappers built around them.
+;; In this case one needs to install the developer's version of
+;; MySQL to get the header files mentioned.
+;;
+;; <h3>Functions available</h3>
+;; <pre>
+;;     MySQL:init ................ get a database handle MYSQL
+;;     MySQL:connect ............. connect to a database
+;;     MySQL:query ............... execute a SQL statement
+;;     MySQL:num-rows ............ rows in result of query
+;;     MySQL:num-fields .......... columns in result of query
+;;     MySQL:fetch-row ........... get row from the query result
+;;     MySQL:fetch-all ........... get all rows from the last query
+;;     MySQL:database ............ return all database names
+;;     MySQL:tables .............. return all tables names
+;;     MySQL:fields .............. return all fields in a table
+;;     MySQL:data-seek ........... position in result for fetching
+;;     MySQL:affected-rows ....... number of affected rows from operation
+;;     MySQL:inserted-id ......... last value of auto increment id operation
+;;     MySQL:escape .............. escapes SQL input string using mysql_real_escape_string
+;;     MySQL:error ............... get error message
+;;     MySQL:close-db ............ close database connection
+;; </pre>
+;;
+;; <h3>A typical MySQL session</h3>
+;; The following code piece outlines a typical MySQL session:
+;; @example
+;; (load "mysql51.lsp) ; load the module file
+;;
+;; (MySQL:init)       ; initialize
+;; (MySQL:connect "192.168.1.10" "auser" "secret" "mydb") ; logon
+;; (MySQL:query "select ...;") ; SQL query
+;; (MySQL:query "insert ...;") ; SQL query
+;;        ...
+;; (MySQL:close-db)
+
+;; The database server is listening on IP 192.168.1.10. The program
+;; connects with username '"auser"' password '"secret"' to a database with 
+;; the name '"mydb"'. After connecting SQL statements are performed and
+;; finally the program disconnects from the server.
+
+(context 'MySQL)
+
+(set 'files '(
+	"/usr/lib/libmysqlclient.so" ; Linux, UNIX
+	"/usr/local/mysql/lib/libmysqlclient.dylib" ; MacOS X
+))
+
+(set 'libmysqlclient (files (or 
+				(find true (map file? files)) 
+				(begin (println "cannot find libmysqlclient library") (exit)))))
+
+(import libmysqlclient "mysql_init")
+(import libmysqlclient "mysql_real_connect")
+(import libmysqlclient "mysql_get_host_info")
+(import libmysqlclient "mysql_real_escape_string")
+(import libmysqlclient "mysql_query")
+(import libmysqlclient "mysql_real_query")
+(import libmysqlclient "mysql_store_result")
+(import libmysqlclient "mysql_free_result")
+(import libmysqlclient "mysql_data_seek")
+(import libmysqlclient "mysql_fetch_row")
+(import libmysqlclient "mysql_close")
+(import libmysqlclient "mysql_fetch_field_direct")
+(import libmysqlclient "mysql_insert_id")
+
+; following constant offsets into 'C' data structures are different on each mayor MySQL
+; version compile and run util/sql.c from the distribution to obtain these numbers
+
+; check endianess of the host CPU 
+(set 'big-endian (= (pack ">ld" 1) (pack "ld" 1)))
+
+(constant 'NUM_ROWS_OFFSET (if big-endian 4 0))
+(constant 'NUM_FIELDS_OFFSET 72)
+(constant 'ERROR_OFFSET 95)
+(constant 'INSERT_ID_OFFSET (if big-endian 708 704))
+(constant 'AFFECTED_ROWS_OFFSET (if big-endian 700 696))
+
+;; @syntax (MySQL:init)
+;; @return 'true' on success, 'nil' on failure.
+
+(define (init)
+  (set 'MYSQL (mysql_init 0))
+  (if (= MYSQL 0) (set 'MYSQL nil))
+  (not (= MYSQL nil)))
+
+;; @syntax (MySQL:connect <str-server> <str-userID> <str-password> <str-db>)
+;; @param <str-server> The host name or IP address or <tt>0</tt> for localhost.
+;; @param <str-userID> The user ID for authentication.
+;; @param <str-password> The password for authentication.
+;; @param <str-db> The name of the database to connect to.
+;; @return 'true' for success or 'nil' for failure.
+;;
+;; Connects to a database on server and authenticates a user ID.
+;; '(MySQL:init)' must have been called previously.
+
+(define (connect host user passw database)
+  (not(= (mysql_real_connect MYSQL host user passw database 0 0 0) 0)))
+
+;; @syntax (MySQL:query <str-sql>)
+;; @param <str-sql> A valid SQL query string.
+;; @return For 'insert' queries rerturns the inserted ID else 'true' 
+;; for success or 'nil' for failure.
+;;
+;; Sends a SQL query string to the database server for evaluation.
+
+(define (MySQL:query sql)
+  (if MYSQL_RES (mysql_free_result MYSQL_RES))
+  (set 'result  (= (mysql_query MYSQL sql) 0))
+  (set 'MYSQL_RES (mysql_store_result MYSQL)) 
+  (if (= MYSQL_RES 0) (set 'MYSQL_RES nil))
+  (if (and result (find "insert into" sql 1)) (set 'result (inserted-id)))
+  result)
+
+;; @syntax (MySQL:num-rows)
+;; @return Number of rows from last query.
+
+(define (num-rows)
+  (if MYSQL_RES (get-int (int (+ MYSQL_RES NUM_ROWS_OFFSET)))))
+
+;; @syntax (MySQL:num-fields)
+;; @return Number of columns from last query.
+
+(define (num-fields)
+  (if MYSQL_RES (get-int (int (+ MYSQL_RES NUM_FIELDS_OFFSET)))))
+
+
+; format the result based on the field type.
+;
+
+(define (keep-type res_ptr field_addr column_num, data)
+  (set 'type_ptr (mysql_fetch_field_direct res_ptr (int column_num)))
+  ; The field type is the 20th field of the MySQL_FIELD structure
+  ; since fields 1-19 are all 4 byte fields we get the enum value
+  ; like so
+  (set 'data (get-int (int (+ type_ptr (* 19 4)))))
+  ; Consult 'enum_field_types' in mysql_com.h for values
+  (if (= data 1) ;; boolean
+        (get-string field_addr)
+      (= data 3) ;; integer
+        (int (get-string field_addr))
+      (= data 12) ;; datetime
+        (apply date-value (map int (parse (get-string field_addr) "[-: ]" 0)))
+      (= data 4) ;; float
+        (float (get-string field_addr))
+      ; else (will handle TEXT type 252)
+      (get-string field_addr)
+  )
+)
+
+;; @syntax (MySQL:fetch-row)
+;; @return A list of field elements.
+;;
+;; Fetches a row from a previous SQL 'MySQL:query'  'select' statement.
+;; Subsequent calls fetch row by row from the result table until the
+;; end of the table is reached.
+
+(define (fetch-row)
+  (if MYSQL_RES
+    (set 'rdata (mysql_fetch_row MYSQL_RES))
+    (set 'rdata 0))
+  (if (!= rdata 0)
+    (begin
+      (set 'row '())
+      (dotimes (field (num-fields))
+            (set 'field_addr (get-int (int (+ rdata (* field 4)))))
+            (if (= field_addr 0)
+              (push nil row -1) ;; what to do when the field contains NULL
+              (push (keep-type MYSQL_RES field_addr field) row -1)))
+    row)))
+
+;; @syntax (MySQL:fetch-all)
+;; @return All rows/fields from the last query.
+;;
+;; The whole result set from the query is returned at once as a list of row lists.
+
+(define (fetch-all)
+
+  (dotimes (x (num-rows)) (push (fetch-row) all))
+  (reverse all))
+
+;; @syntax (MySQL:databases)
+;; @return A list of databases.
+;;
+;; Performs a 'show databases;' query.
+
+(define (databases)
+  (query "show databases;")
+  (fetch-all))
+
+;; @syntax (MySQL:table)
+;; @return A list of tables in the database.
+;;
+;; Performs a 'show tables;' query.
+
+(define (tables)
+  (query "show tables;")
+  (fetch-all))
+
+;; @syntax (MySQL:fields <str-table>)
+;; @param <str-table> The name of the table.
+;; @return A list of field description lists.
+;;
+;; For each field name in the table a list of specifications
+;; for that field is returned. The list starts with the name
+;; for the field followed by the type size/precision and
+;; other optional field descriptions.
+
+(define (fields table)
+  (query (append "show fields from " table ";"))
+  (fetch-all))
+  
+;; @syntax (MySQL:data-seek <num-offset>)
+;; @param <num-offset> The <tt>0</tt> based offset to position inside the data set.
+;; @return Always 'true'. 
+;; 
+;; Positions in the result set at a zero based offset
+;; for a subsequent 'MySQL:fetch-row' call. If the offset
+;; is out of the allowed range for the result set a subsequent
+;; fetch-row will return 'nil'.
+ 
+(define (data-seek offset)
+  (if MYSQL_RES
+    (if big-endian
+    	(mysql_data_seek MYSQL_RES  0 (int offset))
+        (mysql_data_seek MYSQL_RES (int offset) 0)))
+  true
+)
+
+;; @syntax (MySQL:error)
+;; @return Text info about the last error which occured.
+
+(define (error)
+  (if MYSQL (get-string (+ MYSQL ERROR_OFFSET))))
+
+
+;; @syntax (MySQL:affected-rows)
+;; @return Number of affected rows by the last 'MySQL:query' operation.
+
+(define (affected-rows)
+  (if MYSQL
+    (get-int (int (+ MYSQL AFFECTED_ROWS_OFFSET)))))
+
+;; @syntax (MySQL:inserted-id)
+;; @return Last insert ID from an auto increment field.
+
+(define (inserted-id)
+;  (if MYSQL (mysql_insert_id MYSQL))
+  (if MYSQL (get-int (int (+ MYSQL INSERT_ID_OFFSET)))))
+
+;; @syntax (MySQL:escape <str-sql>)
+;; @return escaped string
+;;
+;; This function will escape special characters in <str-sql>, so that it 
+;; is safe to place it in a MySQL query.
+(define (escape value , safe-value) 
+  (set 'safe-value (dup " " (+ 1 (length value)))) 
+  (MySQL:mysql_real_escape_string MySQL:MYSQL safe-value value (length value)) 
+  safe-value)
+
+;; @syntax (MySQL:close-db)
+;; @return Always 'true'.
+;;
+;; Closes database access. For new database acess, both 'MySQL:init' and 
+;; 'MySQL:connect' functions have to be called.
+
+(define (close-db)
+  (if MYSQL_RES (mysql_free_result MYSQL_RES))
+  (if MYSQL (mysql_close MYSQL))
+  (set 'MYSQL nil)
+  (set 'MYSQL_RES nil)
+  true)
+
+(context 'MAIN)
+
+; ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;
+; test data base functions
+;
+
+(define (test-mysql)
+  (MySQL:init)
+  (MySQL:connect 0 "" 0 "test")
+  
+  (println "databases:")
+  (MySQL:query "show databases;")
+
+  (dotimes (x (MySQL:num-rows)) (println (MySQL:fetch-row)))
+  (println)
+  
+  (MySQL:query "create table fruits (name TEXT(2000), 
+                                     qty INT(3),
+                                     num INT(4) AUTO_INCREMENT UNIQUE);")
+  
+  (MySQL:query "insert into fruits values ('apples', 11, null);")
+  (println "inserted-id: " (MySQL:inserted-id))
+  (MySQL:query "insert into fruits values ('oranges', 22, null);")
+  (println "inserted-id: " (MySQL:inserted-id))
+  (MySQL:query "insert into fruits values ('bananas', 33, null);")
+  (println "inserted-id: " (MySQL:inserted-id))
+
+  (println "inserted into fruits:")
+  (MySQL:query "select * from fruits;")
+  (println "\n" (MySQL:affected-rows) " affected rows in query select")
+  (dotimes (x (MySQL:num-rows)) (println (MySQL:fetch-row)))
+
+  (println "no rows = " (MySQL:num-rows) " no fields = " (MySQL:num-fields))
+  (println "fields = " (MySQL:fields "fruits"))
+  (println)
+  
+  (println "tables:")
+  (MySQL:query "show tables;")
+  (dotimes (x (MySQL:num-rows)) (println (MySQL:fetch-row)))
+  (println)
+  
+  (MySQL:query "select * from fruits;")
+  (MySQL:data-seek 2)
+
+  (println "data-seek to offset 2:")
+  (println (MySQL:fetch-row))
+  (println)
+  
+  (println "fetch-all:")
+  (println (MySQL:query "select * from fruits;"))
+  (println (MySQL:fetch-all))   
+  
+  (MySQL:query "drop table fruits;")
+  (MySQL:close-db)
+)
+
+; eof
diff --git a/modules/odbc.lsp b/modules/odbc.lsp
new file mode 100644
index 0000000..0db4cf2
--- /dev/null
+++ b/modules/odbc.lsp
@@ -0,0 +1,531 @@
+;; @module odbc.lsp 
+;; @description ODBC database interface
+;; @version 1.7 - comments redone for automatic documentation
+;; @author Lutz Mueller, 2003 
+;;
+;; <h2>OCBC Interface functions</h2>
+;; 
+;; This module has only been tested on Win32 but should work on UNIX too
+;; with few modifications. At the beginning of the program file include
+;; a 'load' statement for the module:
+;; <pre>
+;; (load "odbc.lsp")
+;; </pre>
+;; 
+;; Some of the code assumes Intel (low -> high) little-endian byte order.
+;;
+;; See the end of file for a test function 'test-odbc', which demonstrates the 
+;; usage of the module and can be used to test a correct ODBC installation and 
+;; data source setup.
+;;
+;; <h2>Requirements</h2>
+;; On Win32 platforms required 'odbc32.dll' is part of the OS's installations. 
+;; There is no UNIX function import tested or adapted for this ODBC module.
+;;
+;; <h2>Function overview</h2>
+;; <pre>
+;;  (ODBC:connect data-source-name-str user-name-str password-str) ; connect to a data source
+;;  (ODBC:query sql-str)          ; perform a SQL statement
+;;  (ODBC:num-cols)               ; number of columns in a query result set from 'select'
+;;  (ODBC:column-atts col)        ; retrieve columns attributes
+;;  (ODBC:fetch-row)              ; fetch a row of data after a sql query with 'select'
+;;  (ODBC:affected-rows)          ; number of rows affected by a sql query: 'delete', 'update' etc.
+;;  (ODBC:tables)                 ; return a list of tables in the current database
+;;  (ODBC:columns table-name)     ; return an array of column attributes in table-name
+;;  (ODBC:close-db)               ; close database connection
+;; </pre>
+
+(context 'ODBC)
+
+; ----------------- import functions from DLL -------------------
+
+
+; set to the appropiate library on Unix or Win32
+(define ODBC-library "odbc32.dll")
+
+; Constants used, make sure these constants are Ok on your Operating System or Platform.
+; Note, that (define var value) is the same as as saying (set 'var value), it is here more
+; of a visual distinction, documenting that values are constants and shouldn't be changed.
+; Most of these are defned in sql.h, sqltypes.h and sqlext.h of your platform.
+; The following definitions come from c:\Borland\BCC\Include
+
+(define SQL_HANDLE_ENV          1)
+(define SQL_HANDLE_DBC          2)
+(define SQL_HANDLE_STMT         3)
+(define SQL_HANDLE_DESC         4)
+
+(define SQL_NULL_HANDLE         0)
+
+(define SQL_SUCCESS             0)
+(define SQL_SUCCESS_WITH_INFO   1)
+
+(define SQL_OV_ODBC3            3)
+(define SQL_ATTR_ODBC_VERSION	200)
+
+(define SQL_LOGIN_TIMEOUT     103)
+
+(define SQL_NTS                -3)
+
+(define SQL_CHAR                1)
+(define SQL_C_CHAR       SQL_CHAR)
+
+
+; Import functions
+; there are many more, which are not used here, goto microsoft.com and unixodbc.org for
+; more information on ODBC SQLxxx API
+
+
+(set 'funcs '(
+	"SQLAllocHandle"
+	"SQLSetEnvAttr"
+	"SQLFreeHandle"
+	"SQLSetConnectAttr"
+	"SQLConnect"
+	"SQLDisconnect"
+	"SQLGetDiagRec"
+	"SQLExecDirect"
+	"SQLNumResultCols"
+	"SQLRowCount"
+	"SQLBindCol"
+	"SQLFetch"
+	"SQLDescribeCol"
+	"SQLTables"
+	"SQLColumns"))
+
+(dolist (fun funcs)
+	(import ODBC-library fun))
+
+; ------------------------------- reserve space for global pointers ----------------------------
+
+(set 'ptr-odbc-env "    ")     ; pointer to environment handle
+(set 'ptr-odbc-conn "    ")    ; pointer to connection handle
+(set 'ptr-result-cols "    ")  ; pointer to number of columns in result
+(set 'ptr-odbc-stmt "    ")    ; pointer to handle for sql statement
+(set 'ptr-result-rows "    ")  ; pointer to number of affected rows from sql statement
+
+(set 'odbc-stmt nil)           ; statement handle
+(set 'odbc-conn nil)           ; connection handle
+(set 'result-cols 0)           ; contains the number of rows resulting from a 'select' qery
+
+; -------------------------------------- AUXILIARY ROUTINES ------------------------------------
+
+; check result code
+
+(define (is-error-result)
+	;result is 16bit, disregard upper 16 bits
+	(set 'odbc-result (& 0xFFFF odbc-result))
+	(and (!= odbc-result SQL_SUCCESS) (!= odbc-result SQL_SUCCESS_WITH_INFO)))
+
+; initialize and make connection
+
+(define (init)
+	(and
+		; get environment handle
+		(set 'odbc-result (SQLAllocHandle SQL_HANDLE_ENV SQL_NULL_HANDLE ptr-odbc-env))
+
+		(if (is-error-result)
+			(begin
+				(println "Error allocating env handle")
+				nil) true)
+
+		(set 'odbc-env (get-int ptr-odbc-env))
+
+		; register version
+		(set 'odbc-result (SQLSetEnvAttr odbc-env SQL_ATTR_ODBC_VERSION SQL_OV_ODBC3 0))
+
+		(if (is-error-result)
+			(begin
+				(println "Error setting ODBC environment")
+				(SQLFreeHandle SQL_HANDLE_ENV odbc-env)
+				nil) true))
+	)
+
+; get diagnostic record 
+;
+; retrieve error info after last failed ODBC request
+;
+; type is one of the following:
+;
+; SQL_HANDLE_ENV, SQL_HANDLE_DBC, SQL_HANDLE_STMT, SQL_HANDLE_DESC 
+;
+
+(define (error type)
+	(set 'diag-status "          ")
+	(set 'diag-err  "    ")
+	(set 'diag-mlen "    ")
+	(set 'diag-message "                                                                ")
+	(SQLGetDiagRec type odbc-conn 1 diag-status diag-err diag-message 64 diag-mlen)
+	(string diag-message " " diag-status (get-int diag-err)))
+
+; bind all columns to string output 
+;
+; before fetching rows string variables are configured with sufficient long string buffers
+; for the 'fetch' statement.
+;
+
+(set 'vars '(var0  var1  var2  var3  var4  var5  var6  var7  var8  var9 
+             var10 var11 var12 var13 var14 var15 var16 var17 var18 var19 
+             var20 var21 var22 var23 var24 var25 var26 var27 var28 var29
+             var30 var32 var32 var33 var34 var35 var36 var37 var38 var39
+             var40 var41 var42 var43 var44 var45 var46 var47 var48 var49
+             var50 var51 var52 var53 var54 var55 var56 var57 var58 var59
+             var60 var51 var62 var63 var64))
+
+
+(define (bind-columns)
+	(set 'ptr-result-err "    ")
+	(for (v 1 result-cols)
+		(set 'w (+ (last (column-atts v)) 1))
+		(set (nth v vars) (format (string "%" w "s") ""))
+		(SQLBindCol odbc-stmt (int v) SQL_C_CHAR (eval (nth v vars)) w ptr-result-err))
+	
+	true)
+
+
+;====================================  USER ROUTINES ========================================
+
+
+;; @syntax (ODBC:connect <str-data-source> <str-user> <str-password>)
+;; @param <str-data-source> The ODBC dara source.
+;; @param <str-user> The user name.
+;; @param <str-password> The password of the user.
+;; @return 'true' on success, 'nil' on failure.
+;;
+;; Connect to a data-source with a user name and password.
+;; The data-source name must be configured first via ODBC
+;; administrative tools, i.e. a control applet on Win32.
+;;
+;; @example 
+;; (ODBC:connect "mydatabase" "johndoe" "secret")
+
+(define (ODBC:connect data-source user password)
+
+	(and
+		(init)
+
+		; allocate connection handle
+		(set 'odbc-result (SQLAllocHandle SQL_HANDLE_DBC odbc-env ptr-odbc-conn))
+
+		(if (is-error-result)
+			(begin
+				(println "Error allocating conn handle")
+				(SQLFreeHandle SQL_HANDLE_ENV odbc-env)
+				nil) true)
+
+		(set 'odbc-conn (get-int ptr-odbc-conn))
+
+		; set timeout for connection
+		(SQLSetConnectAttr odbc-conn SQL_LOGIN_TIMEOUT 5 0)
+
+		; connect to a data source
+		(set 'odbc-result (SQLConnect odbc-conn data-source SQL_NTS
+                                                      user SQL_NTS
+                                                      password SQL_NTS))
+
+		(if (is-error-result)
+			(begin
+				(println "Could not connect")
+				(SQLFreeHandle SQL_HANDLE_DBC odbc-conn)
+				(SQLFreeHandle SQL_HANDLE_ENV odbc-env)
+				nil) true))
+	)
+
+
+;; @syntax (ODBC:query <str-sql>)
+;; @param <str-sql> The SQL statement string.
+;; @return 'true' on success, 'nil' on failure.
+;;
+;; Send and SQL string for database manipulation
+;;
+;; @example
+;; (query "select * from someTable")
+;; (query "delete from addresses")
+;; (query "insert into fruits values ('apples', 11)")
+
+(define (ODBC:query sql-string)
+	(and 
+		; is stmt handle exists free it
+		(if odbc-stmt (begin 
+			(SQLFreeHandle SQL_HANDLE_STMT odbc-stmt)
+			(set 'odbc-stmt nil)
+			true)	true)
+
+		; allocate statement handle
+		(set 'odbc-result (SQLAllocHandle SQL_HANDLE_STMT odbc-conn ptr-odbc-stmt))
+
+		(if (is-error-result)
+			(begin
+				(println "could not allocate statement handle")
+				nil)
+			(set 'odbc-stmt (get-int ptr-odbc-stmt)))
+
+		; do the query
+		(set 'odbc-result (SQLExecDirect odbc-stmt sql-string SQL_NTS))
+		(if (is-error-result)
+			(begin
+				(println "query failed")
+				nil)
+			true)
+
+		; find number of columns in result set
+		(SQLNumResultCols odbc-stmt ptr-result-cols)
+		(set 'result-cols (& 0xFFFF (get-int ptr-result-cols)))
+
+		; bind colums to string vars for fetching
+		(if (not (= result-cols 0)) (bind-columns) true)
+		true
+		)
+		
+	)
+
+
+;; @syntax (ODBC:num-cols)
+;; @return Number of columns in the result set.
+
+(define (num-cols) result-cols)
+
+
+;; @syntax (ODBC:columns-atts <num-col>)
+;; @param <num-col> The number of the column, starting witth 1 for the first.
+;; @return A list of attributes for a column in a result set.
+;;
+;; Returns a list with the columname SQL, data type number and required column size
+;; when displaying in a string. For the data type number and SQL data type see
+;; the file 'sql.h' on your platform OS, i.e. 'SQL_VARCHAR', 'SQL_INTEGER' etc.
+;;
+;; before using 'ODBC:column-atts' a query has to be performed.
+;;
+;; @example
+;; (ODBC:column-atts 1)  => ("name" 12 20)
+
+;; The first column has the header '"name"' with data type 'SQL_VARCHAR' (12)
+;; and a maximum display width of 20 characters.
+
+(define (column-atts col)
+	(set 'col-name-out "                                ")
+	(set 'ptr-name-len "    ")
+	(set 'ptr-data-type "    ")
+	(set 'ptr-col-size "    ")
+	(set 'ptr-dec-dig "    ")
+	(set 'ptr-nullable "    ")
+
+	(set 'odbc-result (& 0xFFFF (SQLDescribeCol odbc-stmt (int col)
+                                                col-name-out 32
+                                                ptr-name-len
+                                                ptr-data-type
+                                                ptr-col-size
+                                                ptr-dec-dig
+                                                ptr-nullable)))
+	(list col-name-out (& 0xFFFF (get-int ptr-data-type)) (get-int ptr-col-size)))
+
+
+
+;; @syntax (ODBC:fetch-row)
+;; @return A list of items of a result set row.
+;;
+;; Fetches a row of data after a previously executed 'ODBC:query'. Each data is formatted as
+;; a string, and can be converted using newLISP conversion functions 
+;; like: 'int', 'float' or 'string'.
+;;
+;; If data types are unknown then 'ODBC:column-atts' can be used to retrieve the data type
+;; number.
+;;
+;; @example
+;; (ODBC:fetch-row) => ("apples" "11")
+
+(define (fetch-row , row)
+	(bind-columns)
+	(set 'odbc-result (& 0xFFFF (SQLFetch odbc-stmt)))
+	(if (is-error-result) 
+		nil
+		(begin
+			(for (x result-cols 1) (push (eval (nth x vars)) row))
+			row)))
+
+
+;; @syntax (ODBC:affected-rows)
+;; @return Number of rows affected by the last SQL statement.
+;;
+;; Returns the number of rows affected by an 'insert', 'update' or 'delete', 'ODBX:query'
+;; operation. After a 'select' operation the number -1 will be returned.
+
+(define (affected-rows)	
+	(set 'odbc-result (& 0xFFFF (SQLRowCount odbc-stmt ptr-result-rows)))
+	(if (is-error-result) 0	(get-int ptr-result-rows)))
+
+
+;; @syntax (ODBC:tables)
+;; @return A list of tables in the current database connection.
+
+(define (tables)
+    (if (and
+        ; is stmt handle exists free it
+        (if odbc-stmt (begin
+            (SQLFreeHandle SQL_HANDLE_STMT odbc-stmt)
+            (set 'odbc-stmt nil)
+            true)   true)
+
+        ; allocate statement handle
+        (set 'odbc-result (SQLAllocHandle SQL_HANDLE_STMT odbc-conn ptr-odbc-stmt))
+        (if (is-error-result)
+            (begin
+                (println "could not allocate statement handle")
+                nil)
+            (set 'odbc-stmt (get-int ptr-odbc-stmt)))
+
+        ; do the query
+        (set 'odbc-result (SQLTables odbc-stmt 0 SQL_NTS 0 SQL_NTS "%" SQL_NTS 0 SQL_NTS))
+        (if (is-error-result)
+            (begin
+                (println "query failed")
+                nil)
+            true)
+
+        ;; find number of columns in result set
+        (SQLNumResultCols odbc-stmt ptr-result-cols)
+        (set 'result-cols (& 0xFFFF (get-int ptr-result-cols)))
+
+        ;; bind colums to string vars for fetching
+        (if (not (= result-cols 0)) (bind-columns) true)
+
+        (begin
+           (set 'names nil)
+           (while (set 'row (ODBC:fetch-row))
+               (push (nth 2 row) names -1))
+           true)
+        ) names)
+    )
+
+;; @syntax (ODBC:columns <str-table-name>)
+;; @param <str-table-name> The name of the table.
+;; @return A list of list of columns and their attributes.
+
+(define (ODBC:columns table)
+    (if (and
+        ; is stmt handle exists free it
+        (if odbc-stmt (begin
+            (SQLFreeHandle SQL_HANDLE_STMT odbc-stmt)
+            (set 'odbc-stmt nil)
+            true)   true)
+
+        ; allocate statement handle
+        (set 'odbc-result (SQLAllocHandle SQL_HANDLE_STMT odbc-conn ptr-odbc-stmt))
+
+        (if (is-error-result)
+            (begin
+                (println "could not allocate statement handle")
+                nil)
+            (set 'odbc-stmt (get-int ptr-odbc-stmt)))
+
+        ; do the query
+        (set 'odbc-result (SQLColumns odbc-stmt 0 SQL_NTS 0 SQL_NTS
+                          table SQL_NTS 0 SQL_NTS))
+        (if (is-error-result)
+            (begin
+                (println "query failed")
+                nil)
+            true)
+
+        ; find number of columns in result set
+        (SQLNumResultCols odbc-stmt ptr-result-cols)
+        (set 'result-cols (& 0xFFFF (get-int ptr-result-cols)))
+
+        ; bind colums to string vars for fetching
+        (if (not (= result-cols 0)) (bind-columns) true)
+
+        (begin
+           (set 'names nil)
+           (while (set 'col (ODBC:fetch-row))
+               (set 'attr (list (nth 3 col) (nth 5 col) (nth 6 col) (nth 8 col)))
+               (push attr names -1))
+           true)
+        ) names)
+    )
+
+
+;; @syntax (ODBC:close-db)
+;; @return 'true' on success, 'nil' on failure.
+;;
+;; Closes a database connection.
+
+(define (close-db)
+	(if odbc-stmt (SQLFreeHandle SQL_HANDLE_STMT odbc-stmt))
+	(set 'odbc-stmt nil)
+	(if odbc-conn (begin
+		(SQLDisconnect odbc-conn)
+		(SQLFreeHandle SQL_HANDLE_DBC odbc-conn)
+		(set 'odbc-conn nil)))
+	true)
+    
+
+(context 'MAIN)
+;=================================== test =================================================
+;
+; Note: before performing this test a database with name 'test'
+; and data source name 'test' should be created. The data base
+; should contain a table described by the following SQL statement:
+;
+;      create table fruits (name CHAR(20), qty INT(3))
+;
+; For this configure an Access database: 'test-db' with table 'fruits' 
+; and a text field 'name' width 20 and field 'qty' as type integer. 
+; Make the 'User Data Source' connection with the ODBC control applet 
+; in control-panel/administrative-tools for the MS Access *.mdb driver
+; and pick as a data source name and database location the test-db.mdb i
+; created. 
+;
+; On some systems the table can also be created with an SQL statement
+;     (ODBC:query "create ....")
+; On MS-Acces this will not work and the table has to be created
+; manually.
+;
+; A sample of test-db.mdb can be found at: 
+;     http://newlisp.org/downloads/Other/
+;
+; example:
+;          (test-odbc)
+;
+
+
+
+(define (test-odbc)
+
+	; Note, on MS-Access must create table fruits manually first
+	; else you could do:
+	;   (ODBC:query "create table fruits (name CHAR(20), qty INT(3))")
+	; for "aUser" and "secret" you may just put empty strings ""
+	; i.e. (ODBC:connect "test" "" "")
+	; when on Windows on the same machine
+
+	(if (not (ODBC:connect "test-db" "" "")) (exit))
+
+	(println "connected ...")
+
+	(ODBC:query "insert into fruits values ('apples', 11)")
+	(ODBC:query "insert into fruits values ('oranges', 22)")
+	(ODBC:query "insert into fruits values ('bananas', 33)")
+
+	(println "inserted 3 records")
+
+	(ODBC:query "select * from fruits")
+
+	(println "performed a query")
+
+	(println (ODBC:num-cols) " columns in result set")
+	(println "fetching rows ...")
+	(while (set 'row (ODBC:fetch-row)) 
+		(set 'row (map trim row))
+		(println row))
+	(println)
+
+
+	(ODBC:query "delete from fruits")
+	(println "rows deleted: " (ODBC:affected-rows))
+	
+	(println "\nclosing database")
+	(ODBC:close-db)
+	)
+
+
+
+; eof ;
diff --git a/modules/pop3.lsp b/modules/pop3.lsp
new file mode 100644
index 0000000..c1b4edc
--- /dev/null
+++ b/modules/pop3.lsp
@@ -0,0 +1,307 @@
+;; @module pop3.lsp
+;; @description POP3 mail retrieval routines
+;; @version 1.9 - comments redone for automatic documentation
+;; @author Lutz Mueller et al., 2001, 2002
+;;
+;; <h2>POP3 mail retrieval routines</h2>
+;;
+;; Only the module 'pop3.lsp' is required, not other libraries need to be
+;; present. Not all mailservers support all functions.
+;;
+;; To use the module put a 'load' statement at the top of your file:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/pop3.lsp")
+;; </pre>
+;;
+;; <h2>Function overview</h2>
+;; Load down all messages and put them in a directory 'messages/':
+;; <pre>
+;; (POP3:get-all-mail "user" "password" "pop.my-isp.com" "messages/")
+;; </pre>
+;;  
+;; Load down only new messages:
+;; <pre>
+;; (POP3:get-new-mail "user" "password" "pop.my-isp.com" "messages/")
+;; </pre>
+;;
+;; Delete messages, which have not been read:
+;; <pre>
+;; (POP3:delete-old-mail "user" "password" "pop.my-isp.com")
+;; </pre>
+;;
+;; Delete all messages:
+;; <pre>
+;; (POP3:delete-all-mail "user" "password" "pop.my-isp.com")
+;; </pre>
+;;
+;; Get a list of status numbers '(<totalMessages>, <totalBytes>, <lastRead>)':
+;; <pre>
+;; (POP3:get-mail-status "user" "password" "pop.my-isp.com")
+;; </pre>
+;;
+;; Get error message for failed all/new/status function:
+;; <pre>
+;; (POP3:get-error-text)
+;; </pre>
+;; All functions return 'nil' on error and 'POP3:get-error-text' can be used to
+;; retrieve the error text. 
+;;
+;; The variable 'POP3:debug-flag' can be set to 'true' to display all of the
+;; dialog with the pop2 mail server.
+
+(context 'POP3)
+
+(set 'debug-flag nil)
+
+;; @syntax (POP3:get-all-mail <str-user> <str-password> <str-server> <str-dir>)
+;; @param <str-user> The user ID.
+;; @param <str-password> The password for the user ID.
+;; @param <str-dir> The local directory for the retrieved mail.
+;; @return On success 'true' else 'nil'.
+
+(define (get-all-mail userName password pop3server mail-dir)
+    (and 
+        (connect pop3server)
+        (logon userName password)
+        (set 'status (get-status))
+        (set 'no-msgs (nth 2 status))
+        (if (> no-msgs 0)
+          (get-messages 1 no-msgs mail-dir)
+          true)
+        (log-off)))
+
+;; @syntax (POP3:get-new-mail <str-user> <str-password> <str-server> <str-dir>)
+;; @param <str-user> The user ID.
+;; @param <str-password> The password for the user ID.
+;; @param <str-dir> The local directory for the retrieved mail.
+;; @return On success returns 'true' else 'nil'.
+;; On failure use 'POP3:get-error-text' to retrieve the text of
+;; the last error which occured.
+
+(define (get-new-mail userName password pop3server mail-dir)
+    (and 
+        (connect pop3server)
+        (logon userName password)
+        (set 'status (get-status true))
+        (if (<= (first status) (nth 2 status))
+          (get-messages (first status) (nth 2 status) mail-dir)
+          true)
+        (log-off)))
+
+;; @syntax (POP3:get-mail-status <str-user> <str-password> <str-server>)
+;; @param <str-user> The user ID.
+;; @param <str-password> The password for the user ID.
+;; @return A list of status information.
+;; The list of status information returned contains the following items:
+;; (<totalMessages>, <totalBytes>, <lastRead>)
+
+(define (get-mail-status userName password pop3server)
+    (and 
+        (connect pop3server)
+        (logon userName password)
+        (set 'status (get-status true))
+        (log-off)
+        status))
+
+;; @syntax (POP3:delete-old-mail <str-user> <str-password> <str-server>)
+;; @param <str-user> The user ID.
+;; @param <str-password> The password for the user ID.
+;; @return The number of messages left on the server.
+
+(define (delete-old-mail userName password pop3server)
+    (and
+        (connect pop3server)
+        (logon userName password)
+        (set 'status (get-status true))
+        (if (> (first status) 1) 
+            (for (msg 1 (- (first status) 1) ) (delete-message msg))
+            true)
+        (log-off)
+        (first status)))
+
+;; @syntax (POP3:delete-all-mail <str-user> <str-password> <str-server>)
+;; @param <str-user> The user ID.
+;; @param <str-password> The password for the user ID.
+;; @return The number of the message last read.
+(define (delete-all-mail userName password pop3server)
+    (and
+        (connect pop3server)
+        (logon userName password)
+        (set 'status (get-status))
+        (if (> (last status) 0)
+            (for (msg 1 (last status) ) (delete-message msg))
+            true)
+        (log-off)
+        (last status)))
+
+; receive request answer and verify
+;
+(define (net-confirm-request)
+    (if (net-receive socket 'rcvbuff 512 "+OK")
+        (begin
+	    (if debug-flag (println rcvbuff))
+            (if (find "-ERR" rcvbuff) 
+                (finish rcvbuff)
+                true))
+        nil))
+
+(define (net-flush)
+	(if socket
+		(while (> (net-peek socket) 0) 
+			(net-receive socket 'junk 256)
+			(if debug-flag (println junk) )))
+	true)
+
+; connect to server
+;
+(define (connect server)
+    (set 'socket (net-connect pop3server 110))
+    (if (and debug-flag socket) (println "connected on: " socket) )
+    (if (and socket (net-confirm-request))
+        (net-flush)
+        (finish "could not connect")))
+
+;
+(define (logon userName password)
+    (and
+        (set 'sndbuff (append "USER " userName "\r\n"))
+        (net-send socket 'sndbuff)
+	(if debug-flag (println "sent: " sndbuff) true)
+        (net-confirm-request)
+        (net-flush)
+        (set 'sndbuff (append "PASS " password "\r\n"))
+        (net-send socket 'sndbuff)
+	(if debug-flag (println "sent: " sndbuff) true)
+        (net-confirm-request)
+        (net-flush)
+        (if debug-flag (println "logon successful") true)))
+
+
+; get status and last read
+;
+(define (get-status last-flag)
+    (and
+        (set 'sndbuff "STAT\r\n")
+        (net-send socket 'sndbuff)
+	(if debug-flag (println "sent: " sndbuff) true)
+        (net-confirm-request)
+        (net-receive socket 'status 256)
+	(if debug-flag (println "status: " status) true)
+        (net-flush)
+	(if last-flag 
+            (begin
+                (set 'sndbuff "LAST\r\n")
+                (net-send socket 'sndbuff)
+	        (if debug-flag (println "sent: " sndbuff) true)
+                (net-confirm-request)
+                (net-receive socket 'last-read 256)
+	        (if debug-flag (println "last read: " last-read) true)
+                (net-flush))
+            (set 'last-read "0"))
+        (set 'result (list (int (first (parse status)))))
+	(if debug-flag (println "parsed status: " result) true)
+        (push (int (nth 1 (parse status))) result)
+        (push (int (first (parse last-read))) result)
+        result))
+
+
+; get a message
+;
+(define (retrieve-message , message)
+	(set 'finished nil)
+	(set 'message "")
+	(while (not finished)
+		(net-receive socket 'rcvbuff 16384)
+		(set 'message (append message rcvbuff))
+		(if (find "\r\n.\r\n" message) (set 'finished true)))
+	(if debug-flag (println "received message") true)
+	message)
+
+
+; get all messages
+;
+; v 1.4: modified file name generation to improve uniqueness. (CaveGuy)
+;        file name now created using last SMTP or ESMTP ID from header.
+; v 1.5: changed file type to ".pop3" to reflect the context that created it.
+;        (get-messages now forces the directory, if it does not exsist.
+; 
+; v 1.6: make sure directory? doesn't have trailing slash in arg
+;
+(define (get-messages from to mail-dir)
+   (if (ends-with mail-dir "/") (set 'mail-dir (chop mail-dir)))
+   (if (if (not (directory? mail-dir)) (make-dir mail-dir) true)
+       (begin
+          (set 'mail-dir (append mail-dir "/"))
+          (for (msg from to)
+               (if debug-flag (println "getting message " msg) true)
+	       (set 'sndbuff (append "RETR " (string msg) "\r\n"))
+	       (net-send socket 'sndbuff)
+	       (if debug-flag (println "sent: " sndbuff) true)
+	       (set 'message (retrieve-message))
+               (if debug-flag (println (slice message 1 200)) true)
+               (set 'istr (get-message-id message))
+	       (set 'istr (append mail-dir "ME-" istr))         
+               (if debug-flag (println "saving " istr) true)
+               (write-file istr message)
+               (if (not (rename-file istr (append istr ".pop3")))
+	           (delete-file istr)))))
+    true) ; other parts of pop3 rely on 'true' return
+
+; delete messages
+;
+(define (delete-message msg)
+    (and
+        (set 'sndbuff (append "DELE " (string msg) "\r\n"))
+        (net-send socket 'sndbuff)
+	(if debug-flag (println "sent: " sndbuff) true)
+        (net-confirm-request)))
+
+; get-message-date was
+; changed to get-message-id
+; v 1.4: CaveGuy
+
+(define (get-message-id message)
+    (set 'ipos (+ (find "id <| id |\tid " message 1) 5)
+	 'iend (find "@|;|\n|\r| |\t" (slice message ipos) 1))
+    (if debug-flag 
+	(print "Message ID: " (slice message ipos iend) "\n"))
+    (set 'istr (slice message ipos iend)) )
+
+
+; log off
+;
+(define (log-off)
+    (set 'sndbuff "QUIT\r\n")
+    (net-send socket 'sndbuff)
+    (if debug-flag (println "sent: " sndbuff) true)
+    (net-receive socket 'rcvbuff 256)
+    (if debug-flag (println rcvbuff) true)
+    true)
+
+; report error and finish
+;
+(define (finish message)
+    (if (ends-with message "+OK")
+      (set 'message (chop message 3)))
+    ;(print "<h3>" message "</h3>")
+    (set 'mail-error-text message)
+    (if debug-flag (println "ERROR: " message) true)
+    (if socket (net-flush))
+    (if socket (log-off))
+    nil)
+
+;; @syntax (POP3:get-error-text)
+;; @return The text of the last error occurred.
+
+(define (get-error-text) mail-error-text)
+
+(context 'MAIN)
+
+
+;(if (not(POP3:get-all-mail "user" "password" "my-isp.com" "mail"))
+;    (print (POP3:get-error-text)) true)
+
+
+;(POP3:get-new-mail "user" "password" "my-isp.com" "mail")
+;(print (POP3:get-mail-status ""user" "password" "my-isp.com"))
+;(exit)
diff --git a/modules/pop3.lsp.html b/modules/pop3.lsp.html
new file mode 100644
index 0000000..16be1ec
--- /dev/null
+++ b/modules/pop3.lsp.html
@@ -0,0 +1,172 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+<META http-equiv="Content-Type" content="text/html; charset=utf-8">
+<title>pop3.lsp</title>
+
+<style type="text/css" media="screen">
+<!--
+span.arw {
+	color:#666666;
+	font-size: 100%;
+	}
+	
+body, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+	line-height: 115%;
+ 	}
+
+h1, h2, h3, h4 {
+	font-family: Georgia, Times New Roman, Times, serif;
+   	font-size: 110%;
+	}
+
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+   	font-size: 100%;
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	font-size: 100%;
+	}
+-->
+</style>
+</head>
+
+<body style="margin: 20px;" text="#333333" bgcolor="#FFFFFF" 
+			link="#376590" vlink="#551A8B" alink="#ffAA28">
+<blockquote>
+<center><h1>pop3.lsp</h1></center>
+<p><a href="index.html">Module index</a></p><br/><br/><br/><h2>Module:&nbsp;pop3.lsp</h2><p>POP3 mail retrieval routines</p>
+<b>Version: </b>1.9 - comments redone for automatic documentation<br/>
+<b>Author: </b>Lutz Mueller et al., 2001, 2002<br/>
+<p></p>
+ <h2>POP3 mail retrieval routines</h2>
+<p></p>
+ Only the module <tt>pop3.lsp</tt> is required, not other libraries need to be
+ present. Not all mailservers support all functions.
+<p></p>
+ To use the module put a <tt>load</tt> statement at the top of your file:
+ <pre>
+ (load "/usr/share/newlisp/modules/pop3.lsp")
+ </pre>
+<p></p>
+ <h2>Function overview</h2>
+ Load down all messages and put them in a directory <tt>messages/</tt>:
+ <pre>
+ (POP3:get-all-mail "user" "password" "pop.my-isp.com" "messages/")
+ </pre>
+<p></p>
+ Load down only new messages:
+ <pre>
+ (POP3:get-new-mail "user" "password" "pop.my-isp.com" "messages/")
+ </pre>
+<p></p>
+ Delete messages, which have not been read:
+ <pre>
+ (POP3:delete-old-mail "user" "password" "pop.my-isp.com")
+ </pre>
+<p></p>
+ Delete all messages:
+ <pre>
+ (POP3:delete-all-mail "user" "password" "pop.my-isp.com")
+ </pre>
+<p></p>
+ Get a list of status numbers <tt>(<em>totalMessages</em>, <em>totalBytes</em>, <em>lastRead</em>)</tt>:
+ <pre>
+ (POP3:get-mail-status "user" "password" "pop.my-isp.com")
+ </pre>
+<p></p>
+ Get error message for failed all/new/status function:
+ <pre>
+ (POP3:get-error-text)
+ </pre>
+ All functions return <tt>nil</tt> on error and <tt>POP3:get-error-text</tt> can be used to
+ retrieve the error text. 
+<p></p>
+ The variable <tt>POP3:debug-flag</tt> can be set to <tt>true</tt> to display all of the
+ dialog with the pop2 mail server.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="POP3_get-all-mail"></a><h3><font color=#CC0000>POP3:get-all-mail</font></h3>
+<b>syntax: (<font color=#CC0000>POP3:get-all-mail</font> <em>str-user</em> <em>str-password</em> <em>str-server</em> <em>str-dir</em>)</b><br/>
+<b>parameter: </b><em>str-user</em> - The user ID.<br/>
+<b>parameter: </b><em>str-password</em> - The password for the user ID.<br/>
+<b>parameter: </b><em>str-dir</em> - The local directory for the retrieved mail.<br/>
+<p><b>return: </b>On success <tt>true</tt> else <tt>nil</tt>.</p>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="POP3_get-new-mail"></a><h3><font color=#CC0000>POP3:get-new-mail</font></h3>
+<b>syntax: (<font color=#CC0000>POP3:get-new-mail</font> <em>str-user</em> <em>str-password</em> <em>str-server</em> <em>str-dir</em>)</b><br/>
+<b>parameter: </b><em>str-user</em> - The user ID.<br/>
+<b>parameter: </b><em>str-password</em> - The password for the user ID.<br/>
+<b>parameter: </b><em>str-dir</em> - The local directory for the retrieved mail.<br/>
+<p><b>return: </b>On success returns <tt>true</tt> else <tt>nil</tt>.</p>
+ On failure use <tt>POP3:get-error-text</tt> to retrieve the text of
+ the last error which occured.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="POP3_get-mail-status"></a><h3><font color=#CC0000>POP3:get-mail-status</font></h3>
+<b>syntax: (<font color=#CC0000>POP3:get-mail-status</font> <em>str-user</em> <em>str-password</em> <em>str-server</em>)</b><br/>
+<b>parameter: </b><em>str-user</em> - The user ID.<br/>
+<b>parameter: </b><em>str-password</em> - The password for the user ID.<br/>
+<p><b>return: </b>A list of status information.</p>
+ The list of status information returned contains the following items:
+ (<em>totalMessages</em>, <em>totalBytes</em>, <em>lastRead</em>)
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="POP3_delete-old-mail"></a><h3><font color=#CC0000>POP3:delete-old-mail</font></h3>
+<b>syntax: (<font color=#CC0000>POP3:delete-old-mail</font> <em>str-user</em> <em>str-password</em> <em>str-server</em>)</b><br/>
+<b>parameter: </b><em>str-user</em> - The user ID.<br/>
+<b>parameter: </b><em>str-password</em> - The password for the user ID.<br/>
+<p><b>return: </b>The number of messages left on the server.</p>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="POP3_delete-all-mail"></a><h3><font color=#CC0000>POP3:delete-all-mail</font></h3>
+<b>syntax: (<font color=#CC0000>POP3:delete-all-mail</font> <em>str-user</em> <em>str-password</em> <em>str-server</em>)</b><br/>
+<b>parameter: </b><em>str-user</em> - The user ID.<br/>
+<b>parameter: </b><em>str-password</em> - The password for the user ID.<br/>
+<p><b>return: </b>The number of the message last read.</p>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="POP3_get-error-text"></a><h3><font color=#CC0000>POP3:get-error-text</font></h3>
+<b>syntax: (<font color=#CC0000>POP3:get-error-text</font>)</b><br/>
+<p><b>return: </b>The text of the last error occurred.</p>
+
+
+
+
+
+
+
+<p></p><center>- &part; -</center><br/>
+<center><font face='Arial' size='-2' color='#444444'>
+generated with <a href="http://newlisp.org">newLISP</a>&nbsp;
+and <a href="http://newlisp.org/newLISPdoc.html">newLISPdoc</a>
+</font></center>
+</blockquote>
+</body>
+</html>
diff --git a/modules/postscript.lsp b/modules/postscript.lsp
new file mode 100644
index 0000000..31833a1
--- /dev/null
+++ b/modules/postscript.lsp
@@ -0,0 +1,975 @@
+;; @module postscript.lsp
+;; @description Routines for creating postscript files
+;; @version 1.0 - comments redone for automatic documentation
+;; @author Lutz Mueller, July 2006
+;;
+;; <h2>Routines for creating postscript files</h2>
+;; To use this module include the following 'load' statement at
+;; the beginning of the program file:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/postscript.lsp")
+;; </pre>
+;;
+;; See @link http://newlisp.org/index.cgi?Postscript http://newlisp.org/index.cgi?Postscript
+;; for many examples with source code.
+;;
+;; Postscript files can be viewed using: 'open filename.ps' on Mac OS X
+;; or using the Ghostscript program on Unix's or Win32 to convert
+;; to PDF or any graphics file format. Best quality is achieved
+;; on Mac OS X when using the Preview.app viewer for loading the 
+;; postscript files and converting to PDF or bitmapped formats like 
+;; JPEG, PNG, GIF by re-saving.
+;;
+;; If not using Mac OS X look for Ghostscript here:
+;;    @link http://www.ghostscript.com/ www.ghostscript.com and
+;;    here: @link http://www.cs.wisc.edu/~ghost/ www.cs.wisc.edu/~ghost/
+;;
+;; NOTE! on some Mac OS X installations it is necessary to quit out of
+;; the Preview.app completely before viewing a '.ps' file for the first
+;; time. Subsequent views of '.ps' documents are fine.
+;;
+;; On Linux/UNIX systems the following command can be used to convert
+;; a '.ps' file to a '.pdf' file:
+;; <pre>
+;;   gs -sDEVICE=pdfwrite -dBATCH -sOutputFile=aFile.pdf -r300 aFile.ps
+;; </pre>
+;; Most functions work like in <turtle graphics> relative to the
+;; current position of an imaginary drawing pen with an
+;; orientation of 0 to 360 degree starting streight up: 0 and
+;; moving clockwise right 90, down 180, left 270, up and 360 degrees.
+;; Other functions work on absolute X,Y coordinates.
+;;
+;; The coordinate system starts on the bottom left with 0,0 and
+;; extends on a 8 1/2 x 11 inch letter page to 'x': 612, 'y': 792,
+;; 12 points for each inch. The functions 'ps:transpose' and 'ps:scale'
+;; can be used to move the origin point '<x=0, y=0>' or scale from points to
+;; other measurements.
+;;
+;; <br/>
+;; <center><h2>Turtle coordinate positioning and turning</h2></center>
+;;
+;; All commands in this group change the turtle position or 
+;; orientation.
+;;
+;; @syntax (ps:goto <num-x> <num-y>)
+;; @param <num-x> The new x coordinate.
+;; @param <num-y> The new y coordinate.
+;; @return The postscript output.
+;; Moves to position <num-x>, <num-y>. On a US letter page of 612 by 792 
+;; point positions are defined with 72 points per inch.
+;;
+;; @syntax (ps:move <num-s>) 
+;; @param <num-s> The distance to move the pen.
+;; @return The postscript output.
+;; Move turtle forward distance <s> without drawing.
+;;
+;; @syntax (ps:turn <num-dg>)
+;; @param <num-dg>  The degrees to turn: -360 to 0 to 360.
+;; @return The postscript output.
+;; Turn the turtle pen by <dg> degrees. The degrees are specified in angles
+;; from 0 to 360. For turning clockwise specifiy positive values.
+;; Negative degrees turn the turtle pen counter clockwise.
+;;
+;; @syntax (ps:angle <num-dg>) 
+;; @param <num-dg> Angle degrees from 0 to 360.
+;; @return The postscript output.
+;; Set the turtle angle to <num-dg> degrees.
+;; Upwards is 0, right 45, downwards 180 and left 270i degrees.
+;;
+;; <br/>
+;; <center><h2>Line drawing</h2></center>
+;;
+;; All commands in this group change the turtle position or 
+;; orientation, or both.
+;;
+;; @syntax (ps:draw <num-s>) 
+;; @param <num-s> Distance to draw.
+;; @return The postscript output.
+;; Draw going forward distance <num-s>. Moves the turtle forward by 
+;; the amount of points specified in <num-s> and draws with the current 
+;; line color set by 'ps:line-color'.
+;;
+;; @syntax (ps:drawto <x> <y>) 
+;; @param <x> The x coordinate to draw to.
+;; @param <y> The y coordinate to draw to.
+;; @return The postscript output.
+;; Draw a line to point <x>, <y>. Moves the turtle to point 
+;; <x>, <y> like '(ps:goto x y)', but also draws a line from 
+;; the old to the new position. The turtle position is changed to the
+;; new point <x>, <y> and the orientation is changed to the orientaion of 
+;; the line drawn.
+;;
+;; @syntax (ps:line <list-of-lists>) 
+;; @param <list-of-lists> A list of turtle movements or Bezier curves.
+;; @return The postscript output.
+;; Draw a multipart line.  <lists> are turtle movements (<num-dg> <num-s>),
+;; or Bezier curves (<x1> <y1> <x2> <y2> <x3> <y3>) starting
+;; from the last turtle coordinates <x0>, <y0> and
+;; finishing at <x3>, <y3>. All Bezier coordinates are
+;; relative to the previous turtle position and
+;; orientation.
+;;
+;; The turtle position and orientation are changed after
+;; drawing the line.
+;;
+;; @syntax (ps:bezier <x1> <y1> <x2> <y2> <x3> <y3>) 
+;; @param  <x1,y1> Bezier coordinates of <p1> relative to <p0> = 0,0
+;; @param  <x2,y2> Bezier coordinates of <p2> relative to <p0> = 0,0
+;; @param  <x3,y3> Bezier coordinates of <p3> relative to <p0> = 0,0
+;; @return The postscript output.
+;; Draw a Bezier curve.
+;; The Bezier curve starts at point <p0> which is the current
+;; turtle position and stops at point <p3> which is at offset
+;; <x3> and <y3> relative to starting point. The turtle orientation
+;; after the drwaing the Bezier curve is perpendicular
+;; to the Bezier curve baseline <p0> to <p3>.
+;;
+;; <br/>
+;; <center><h2>Closed shapes, filling and clipping</h2></center>
+;;
+;; All functions in this group leave the turtle position and
+;; orientation unchanged.
+;;
+;; @syntax (ps:polygon <rad> <n> [<fill>])
+;; @param <rad> Radius.
+;; @param <n> Number of sides.
+;; @param <fill> Optional fill flag.
+;; @return The postscript output.
+;; Draw a polygon with radius <rad> and <n> sides.
+;; <fill> is 'true' or 'nil' (default) for optional color fill
+;; The polygon is drawn around the current turtle position.
+;; The turtle position or orientation is not changed.
+;;
+;; @syntax (ps:circle <rad> [<fill>])
+;; @param <rad> Radius of the circle.
+;; @param <fill> Optional fill flag.
+;; @return The postscript output.
+;; Draw a circle with radius <rad>. The optional <fill> flag 
+;; with either 'true' or 'nil' (default) indicates if the circle
+;; is filled with the fill color specified by 'ps:fill-color'.
+;; The circle is drawn around the current turtle position.
+;; The turtle position or orientation is not changed.
+;;
+;; @syntax (ps:ellipse <x-rad> <y-rad> <start> <end> [<fill>]) 
+;; @param <x-rad> The x axis radius.
+;; @param <y-rad> The y axis radius.
+;; @param <start> The start angle.
+;; @param <end> The end angle.
+;; @return The postscript output.
+;; Draw an ellipse with optional <fill> either 'true' or 'nil'(default).
+;; The ellipse is drawn around the current turtle position
+;; with the Y axis oriented like the turtle.
+;; For <x-rad>, <y-rad> set to 0, 360 an ellipse is drawn
+;; For a partiual radius the opening is closed by a line
+;; resulting in segment shape, i.e. -90, 90  would result
+;; in a half circle from the left to the right of the turtle.
+;; The turtle position or orientation is not changed.
+;;
+;; @syntax (ps:pie <rad> <width> [<fill>])
+;; @param <rad> The radius of the pie.
+;; @param <width> The width of the pie slice as an angle.
+;; @param <fill> An optional fill flag for color fill
+;; @return The postscript output.
+;; Draw a pie slice with optional <fill> either 'true' or 'nil' (default).
+;; The left edge of the pie is in turtle orientation.
+;; The width angle spreads clockwise. The pie is drawn around the current
+;; turtle position. The turtle position or orientation is not changed.
+;;
+;; @syntax (ps:petal <x> <y> [<fill>]) 
+;; @param <x> The <x1> coordinate of the  underlying Bezier curve <p0> to <p1> <p2> <p3>.
+;; @param <y> The <y1> coordinate of the  underlying Bezier curve <p0> to <p1> <p2> <p3>.
+;; @param <fill> An optional fill flag for color fill.
+;; @return The postscript output.
+;; Draws a petal using a Bezier curve with optional <fill> either 'true' or 'nil' (default).
+;; The <x> and <y> parameters are relative to to the current position.
+;; The petal is drawn with the tip at the current turtle
+;; position and oriented in the direction of the turtle.
+;; The turtle position or orientation is not changed.
+;;
+;; @syntax (ps:shape <list-of-lists> [<fill>])
+;; @param <list-of-lists> A list of turtle movements and/or Bezier curves.
+;; @param <fill> An optional fill flag for color fill.
+;; @return The postscript output.
+;; Draws a shape with optional <fill> or eiher 'true' or 'nil' (default).
+;; <lists> is either a turtle movement  (<dg> <s>) or a Bezier curve 
+;; (<x1> <y1> <x2> <y2> <x3> <y3>) starting from the last turtle coordinates 
+;; <x0>, <y0> and finishing at <x3>, <y3>. All Bezier coordinates
+;; are relative to the previous turtle position and orientation
+;; The turtle position or orientation is not changed.
+;;
+;; @syntax (ps:clip <list-of-lists>) 
+;; @param <list-of-lists> A list of turtle movements and/or Bezier curves.
+;; @return The postscript output.
+;; Define a clipping path using turtle movements (<dg> <s>) and
+;; Bezier curves (<x1> <y1> <x2> <y2> <x3> <y3>) starting from the 
+;; last turtle coordinates <x0>, <y0> and finishing at <x3>, <y3>. 
+;; All Bezier coordinates are relative to the previous turtle position and
+;; orientation.
+;;
+;; Before redefining the clipping area '(ps:gsave)' should
+;; be used to save the old graphics state parameters, after
+;; clipping and drawing in the clipped area the graphics
+;; state should be restored using '(ps:grestore)'.
+;; The turtle position or orientation is not changed.
+;;
+;; <br/>
+;; <center><h2>Text output and clipping</h2></center>
+;; 
+;; All functions in this goup move the turtle by the textlength
+;; drawn and change the orientation when the text is arcing.
+;;
+;; @syntax (ps:text <str-text>)
+;; @param <str-text> The text to draw.
+;; @return The postscript output.
+;; Draws text. '(...)' parenthesis in text should be escaped with
+;; double '\\' characters as in in '\\(' or '\\)', when limiting the string
+;; with double quotes '"'. When limiting the string with '{,}' braces
+;; a single '\' character is enough as in '\(' and '\)'.
+;; Before drawing, a font can be specified, the default font after loading 
+;; the 'postscript.lsp' modules is Helvetica 12 points and using
+;; the current 'ps:line-color' for drawing.
+;;
+;; The turtle position is changed to the baseline after the last character.
+;; The turtle orientation stays the same.
+;;
+;; @syntax (ps:textoutline <str-text> [<fill>])
+;; @param <str-text> The text to draw. 
+;; @param <fill> An optional fill flag for color fill.
+;; Draw a text outline with optional color <fill> specified by
+;; either 'true' or 'nil' (default).
+;; Before drawing a font can be specified
+;; the default font after loading 'postscript.lsp' is
+;; Helvetica 12 points, the text is drawn using the current
+;; line color.
+;;
+;; The turtle position is changed to the baseline after the last character.
+;; The turtle orientation stays the same.
+;;
+;; @syntax (ps:textarc <rad> <str-text>)
+;; @param <rad> The radius of imaginary circle path for text.
+;; @param <str-text> The text to draw. 
+;; @return The postscript output.
+;; Draw text around a circle.
+;; The text is drawn out side of an imaginary circle starting at 
+;; turtle position and orientation and drawing at the current tangent.
+;; To bend text around a circle, draw a sequence of single characters
+;; with the same radius. For a positive radius text goes outside
+;; the circle and clockwise. For a negative radius text goes inside the
+;; circle and counter lock wise. The turtle position and orientation
+;; move along the radius.
+;;
+;;
+;; @syntax (ps:textarcoutline <rad> <str-text> [<fill>]) 
+;; @param <rad> The radius of imaginary circle path for text.
+;; @param <str-text> The text to draw.
+;; @param <fill> An optional fill flag for color fill.
+;; @return The postscript output.
+;; Draw text around a circle.
+;; Same as '(ps:textarc ...)' but the text is drawn as ane outline
+;; and can be filled with ps:fill-color when specifying the optional
+;; fill flag. The turtle position and orientation move along the radius.
+;;
+;; @syntax (ps:textclip <str-text>)
+;; @param <str-text> The text used as a clipping shape.
+;; @return The postscript output.
+;; A text outline is used as a clipping path.
+;; Before redefining the clipping area '(ps:gsave)' should
+;; be used to save the old graphics state parameters, after
+;; clipping and drawing in the clipped area the graphics
+;; state should be restored using '(ps:grestore)'.
+;; The turtle moves with the text shape clipped.
+;;
+;; <br/>
+;; <center><h2>Global settings</h2></center>
+;;
+;; Several global variables control fill and line color, line width
+;; and other parameters influencing the scaling and orientation of
+;; the coordinate system when drawing. Most have default settings
+;; when not explicitely specified.
+;;
+;; @syntax (ps:font <str-name> <num-size>) 
+;; @param <str-name> The font name.
+;; @param <num-size> The size of the font in points.
+;; @return The postscript output.
+;; The current font is set for all subsequent text operations.
+;; Depending on the version of the Postsrcipt viewer or device
+;; installed different fonts are available.
+;;
+;; @syntax (ps:translate <x> <y>) 
+;; @syntax (ps:translate) 
+;; @param <x> The new x position of coordinate origin.
+;; @param <y> The new y position of coordinate origin.
+;; @return The postscript output.
+;; Move the coordinate origin.
+;; By default the origin 0,0 is in the bottom left corner
+;; of the page. <x> and <y> values extend to the right and top. 
+;; When now <x>, <y> values are specified the coordinate origin
+;; is moved to the current position of the turtle.
+;;
+;; @syntax (ps:scale <x> <y>) 
+;; @param <x> The new x scale factor.
+;; @param <y> The new y scale factor.
+;; @return The postscript output.
+;; Scale the coordinate space.
+;; Scaling factors are 1.0 by default and compress for
+;; factors less 1.0 or expand for factors bigger than 1.0.
+;; With a scaling factor for x = 2.0 each point position
+;; specified would cover the double of horizontal distance
+;; on the page. Scaling factors can be saved on the graphics
+;; state stack using the function '(ps:gsave)'.
+;;
+;; @syntax (ps:rotate <deg>) 
+;; @param <deg> The degrees of rotation: -360 to 0 to 360.
+;; @return The postscript output.
+;; Rotate the coordinate space. 
+;; The coorinate space is rotated to the right for
+;; positive angles and to the left for negative angles.
+;; The current rotation angle is 0 by default.
+;; The rotation angle is part of the graphics state saved by
+;; the '(ps:gsave function)'.
+;;
+;; @syntax (ps:gsave)
+;; @return The postscript output.
+;; Saves the current graphics state. The function pushes the 
+;; current graphics state on a special stack, from where it
+;; can be resored using '(ps:grestore)'.
+;;
+;; @syntax (ps:grestore)
+;; @return The postscript output.
+;; Restores the graphics state from the stack.
+;;
+;; @syntax (ps:line-width <points>)
+;; @param <points> The line width in points.
+;; @return The postscript output.
+;; Sets the line width in points for line drawing and the
+;; outlines drawn by shapes and text outlines.
+;;
+;; @syntax (ps:line-cap <mode>) 
+;; @param <mode> The line termination shape mode.
+;; @return The postscript output.
+;; Sets the line termination shape:
+;; <pre>
+;;    0 square line at the end
+;;    1 semicircular line
+;;    2 square line end projecting beyond the end of the line
+;;      by half line width
+;; </pre>
+;;
+;; @syntax (ps:line-join <mode>)
+;; @param <mode> The line join mode.
+;; @return The postscript output.
+;; Sets the line join mode:
+;; <pre>
+;;    0 outer edges of lines mitered together
+;;    1 outer edges of lines rounded together
+;;    2 for lin-cap with 0 the resulting noth
+;;      is filled to produce a chamfered corner
+;; </pre>
+;;
+;; @syntax (ps:line-color <R> <G> <B>) 
+;; @param <R> The red color value.
+;; @param <G> The green color value.
+;; @param <B> The blue color value.
+
+;; @syntax (ps:line-color <str-hex>)
+;; @param <str-hex> A hex string specifying the line color.
+;; @return The postscript output.
+;; Set color for line drawing.
+;; Color values assume the following value:
+;; <pre>
+;;    R - value for red 0.0 to 1.0
+;;    G - value for green 0.0 to 1.0
+;;    B - value for blue 0.0 to 1.0
+;; </pre>
+;; In an alternative syntax color values can be specified in a
+;; hex string:
+;;
+;; <str-hex> is a hex string constant '"000000"' to '"FFFFFF"'
+;; Colors are specified as usual in HTML coding.
+;; Each to two hex digits define a color: 'rrggbb'.  
+;;
+;; @syntax (ps:fill-color <R> <G> <B>) 
+;; @param <R> The red color value.
+;; @param <G> The green color value.
+;; @param <B> The blue color value.
+
+;; @syntax (ps:fill-color <str-hex>)
+;; @param <str-hex> A hex string specifying the line color.
+;; @return The postscript output.
+;; Set color for shape filling.
+;; Color values assume the following value:
+;; <pre>
+;;    R - value for red 0.0 to 1.0
+;;    B - value for green 0.0 to 1.0
+;;    G - value for blue 0.0 to 1.0
+;; </pre>
+;; In an alternative syntax color values can be specified in a
+;; hex string:
+;;
+;; <str-hex> is a hex string constant '"000000"' to '"FFFFFF"'
+;; Colors are specified as usual in HTML coding.
+;; Each two hex digits define a color: 'rrggbb'.  
+;;
+;;
+;; @syntax (ps:render) 
+;; @return The postscript output.
+;; Show on monitor (Mac OS X only)
+;; Uses the Mac OS X Preview.app to convert
+;; and view postscript files ending in '.ps'.
+;;
+;; On Unix and Win32 systems use (ps:save <filename>)
+;; to save the postscript file and convert and view
+;; it using ghostscript from @link http://www.ghostscript.com/ www.ghostscript.com/
+;; and @link http://www.cs.wisc.edu/~ghost/ www.cs.wisc.edu/~ghost .
+;;
+;; @syntax (ps:save <str-filename>) 
+;; @param <str-filename> The filename. 
+;; @return The postscript output.
+;; Save to <str-filename>.
+;; The filename should end in '.ps' to be recognized as a Postscript file 
+;; on Mac OS X, where it can be viewed with the standrad Preview.app, by
+;; double clicking the filename. On Linux/UNIX Ghostsript can be used to 
+;; convert the file to any image format or to view the file.
+;; The Quality of display depends on the underlying OS and hardware.
+
+(context 'ps)
+
+(set 'prolog [text]%!PS-Adobe-2.0
+%%Creator: newLISP
+
+%% ---------- SETUP ----------
+
+/orient 0 def
+/xpos 0 def
+/ypos 0 def
+/pi 3.141592654 def
+
+/fillcolor {0.8 0.8 0.8} def
+/Helvetica findfont 12 scalefont setfont
+
+/turtlestack [0 0 0] def
+
+/pushturtle
+	{	
+	turtlestack length /len exch def 
+	turtlestack aload pop 
+	xpos ypos orient len 3 add array astore
+	/turtlestack exch def
+	} def
+
+/popturtle
+	{
+	turtlestack length /len exch def
+	len 3 gt {
+		turtlestack aload pop
+		/orient exch def
+		/ypos exch def
+		/xpos exch def
+		len 3 sub array astore
+		/turtlestack exch def
+		} if
+	} def
+
+
+%% ---------- NAVIGATION ----------
+
+% x y -
+/goto
+  {
+  /ypos exch def
+  /xpos exch def
+  xpos ypos moveto
+  } def
+
+% points -
+/move
+  {
+  /len exch def
+  /xpos xpos orient sin len mul add def
+  /ypos ypos orient cos len mul add def
+  xpos ypos moveto
+  } def
+  
+% degree -
+/turn
+  {
+  /orient exch orient add def
+  } def
+  
+% degree -
+/angle
+  {
+  /orient exch def
+  } def
+  
+%% ---------- LINE DRAWING ----------
+
+% turtle position is changed
+  
+% points -
+/draw
+  {
+  /len exch def
+  newpath
+  xpos ypos moveto
+  /xpos xpos orient sin len mul add def
+  /ypos ypos orient cos len mul add def
+  xpos ypos lineto stroke
+  } def  
+
+% points -
+/drawtolen
+  {
+  /len exch def
+  /xpos xpos orient sin len mul add def
+  /ypos ypos orient cos len mul add def
+  xpos ypos lineto
+  } def  
+  
+% x y
+/drawto
+  {
+  /newy exch def
+  /newx exch def
+  newpath
+  xpos ypos moveto
+  newx newy lineto
+  stroke
+  newy ypos sub newx xpos sub atan neg 90 add /orient exch def
+  /xpos newx def
+  /ypos newy def
+  } def
+  
+% x1 y1 x2 y2 x3 y3
+/bezier
+  {
+  newpath
+  curve
+  stroke
+  } def
+
+/curve
+  {
+  /y3 exch def
+  /x3 exch def
+  /y2 exch def
+  /x2 exch def
+  /y1 exch def
+  /x1 exch def
+  matrix currentmatrix
+  x1 y1 x2 y2 x3 y3
+  xpos ypos translate
+  orient neg rotate
+  0 0 moveto
+  rcurveto
+  setmatrix
+  y3 x3 atan neg /angleinc exch def
+  /len x3 angleinc cos div def
+  /orient orient angleinc add def
+  /xpos xpos orient 90 add sin len mul add def
+  /ypos ypos orient 90 add cos len mul add def
+  } def
+
+% save turtle position and orientation
+
+/turtlesave
+  {
+  /xpossave xpos def
+  /ypossave ypos def
+  /orientsave orient def
+  } def
+  
+% restore turtle position and orientation
+
+/turtlerestore
+  {
+  /xpos xpossave def
+  /ypos ypossave def
+  /orient orientsave def
+  xpos ypos moveto
+  } def
+
+% x1 y1 x2 y2 -
+/fromto
+  {
+  /ypos exch def
+  /xpos exch def
+  newpath
+  moveto
+  xpos ypos lineto
+  stroke
+  } def
+
+%% ---------- SHAPES ----------
+
+% shapes are close and do not change the turtle position
+
+% radius sides fillflag -
+/polygon
+  {
+  /fillflag exch def
+  360 exch div /orientinc exch def
+  /radius exch def
+  gsave
+  xpos ypos translate
+  orient neg rotate
+  0 sin radius mul
+  0 cos radius mul moveto
+  0 orientinc 360
+   {
+   dup
+   sin radius mul exch
+   cos radius mul
+   lineto
+   } for
+  closepath
+  fillflag {fillshape} if
+  stroke
+  grestore
+  } def
+  
+% radius fillflag -
+/circle
+  {
+  /fillflag exch def
+  /radius exch def
+  newpath
+  xpos ypos radius 0 360 arc
+  fillflag {fillshape} if
+  stroke
+  } def
+  
+  
+% radius width fillflag
+/pie
+  {
+  /fillflag exch def
+  /width exch def
+  90 orient sub width sub /start exch def
+  start width add /end exch def
+  /radius exch def
+  newpath
+  xpos ypos moveto
+  xpos ypos radius start end arc
+  fillflag {fillshape} if
+  closepath
+  stroke
+  } def
+  
+% width height fill
+/petal
+  {
+  /fillflag exch def
+  /y exch def
+  /x exch def
+  gsave
+  xpos ypos translate
+  orient neg rotate
+  newpath
+  0 0 moveto
+  x neg y x y 0 0 
+  rcurveto
+  fillflag {fillshape} if
+  closepath
+  stroke
+  grestore
+  } def
+  
+% xradius yradius start end flag -
+/ellipse
+  {
+  /fillflag exch def
+  % swap start/end and x/y
+  neg /startangle exch def
+  neg /endangle exch def
+  /xrad exch def
+  /yrad exch def
+ 
+  gsave
+  xpos ypos translate
+  orient 90 sub neg rotate
+  newpath
+  xrad yrad scale
+  0 0 1 startangle endangle arc
+  fillflag {fillshape} if
+  1 xrad div 1 yrad div scale
+  closepath
+  stroke
+  grestore
+  } def
+
+/fillshape
+  {
+  gsave
+  fillcolor setrgbcolor
+  fill 
+  grestore
+  } def
+   
+%% ---------- text ----------
+
+/text
+  {
+  /str exch def
+  gsave
+  xpos ypos translate
+  newpath
+  0 0 moveto
+  orient 89.9999 sub neg rotate
+  str show
+  grestore
+  str stringwidth pop move
+  } def
+  
+/textoutline
+  {
+  /fillflag exch def
+  /str exch def
+  gsave
+  xpos ypos translate
+  newpath
+  0 0 moveto
+  orient 89.9999 sub neg rotate
+  str true charpath
+  fillflag {fillshape} if
+  stroke
+  grestore
+  str stringwidth pop move
+  } def
+  
+/textclip
+  {
+  /str exch def
+  matrix currentmatrix
+  xpos ypos translate
+  newpath
+  0 0 moveto
+  orient 89.9999 sub neg rotate
+  str true charpath
+  clip
+  setmatrix
+  } def
+
+/textarc
+  {
+  /str exch def
+  2 mul pi mul /circum exch def
+  
+  str stringwidth pop /len exch def
+  circum len div 360 exch div turn
+  str text
+  } def
+  
+/textarcoutline
+  {
+  /fillflag exch def
+  /str exch def
+  2 mul pi mul /circum exch def
+  
+  str stringwidth pop /len exch def
+  circum len div 360 exch div turn
+  str fillflag textoutline
+  } def
+  
+% --------------------------
+[/text])
+
+; ---------- setup ---------- 
+
+(set 'buffer "")
+(set 'line-feed (if (> (& 0xF (sys-info -1)) 5) "\r\n" "\n"))
+
+; ---------- USER FUNCTIONS ----------
+
+; ---------- output pure postscript ---------- 
+
+(define (ps:ps str)
+	(write-line str buffer))
+	
+; navigation - changes position or orient of the turtle
+	
+(define (goto x y)
+	(ps (format "%g %g goto" x y)))
+	
+(define (turn deg)
+	(ps (format "%g turn" deg)))
+	
+(define (move dist)
+	(ps (format "%g move" dist)))
+	
+(define (angle deg)
+	(ps (format "%g angle" deg)))
+	
+; line graphics changes position and/or orient of the turtle
+	
+(define (draw dist)
+	(ps (format "%g draw" dist)))
+	
+(define (drawto x y)
+	(ps (format "%g %g drawto" x y)))
+	
+(define (bezier x1 y1 x2 y2 x3 y3)
+	(ps (format "%g %g %g %g %g %g bezier" x1 y1 x2 y2 x3 y3)))
+	
+(define (line lst)
+	(let (rec nil)
+		(ps "% new shape")
+		(ps "newpath")
+		(ps "xpos ypos moveto")
+		(while (set 'rec (pop lst))
+			(if (= (length rec) 6)
+				(ps (format "%g %g %g %g %g %g curve"
+						(rec 0) (rec 1) (rec 2)
+						(rec 3) (rec 4) (rec 5)))
+				(begin
+					(ps (format "%g turn" (rec 0)))
+					(ps (format "%g drawtolen" (rec 1))))))
+		(ps "stroke")))
+	
+; shapes do not change the position or orient of the turtle
+; which stays in the curcle center of the shape
+
+(define (polygon radius sides flag)
+	(set 'flag (if flag "true" "false"))
+	(ps (format "%g %g %s polygon" radius sides flag)))
+	
+(define (circle radius flag)
+	(set 'flag (if flag "true" "false"))
+	(ps (format "%g %s circle" radius flag)))
+	
+(define (ellipse xradius yradius start end flag)
+	(set 'flag (if flag "true" "false"))
+	(ps (format "%g %g %g %g %s ellipse" xradius yradius start end flag)))
+	
+(define (pie radius width flag)
+	(set 'flag (if flag "true" "false"))
+	(ps (format "%g %g %s pie" radius width flag)))
+	
+(define (petal width height flag)
+	(set 'flag (if flag "true" "false"))
+	(ps (format "%g %g %s petal" width height flag)))
+	
+(define (shape lst flag)
+	(let (rec nil)
+		(ps "% new shape")
+		(ps "turtlesave")
+		(ps "newpath")
+		(ps "xpos ypos moveto")
+		(while (set 'rec (pop lst))
+			(if (= (length rec) 6)
+				(ps (format "%g %g %g %g %g %g curve"
+						(rec 0) (rec 1) (rec 2)
+						(rec 3) (rec 4) (rec 5)))
+				(begin
+					(ps (format "%g turn" (rec 0)))
+					(ps (format "%g drawtolen" (rec 1))))))
+		(ps "closepath")
+		(if flag (ps "fillshape"))
+		(ps "stroke")
+		(ps "turtlerestore")))
+
+(define (clip lst)
+	(let (rec nil)
+		(ps "% new clipping shape")
+		(ps "turtlesave")
+		(ps "newpath")
+		(ps "xpos ypos moveto")
+		(while (set 'rec (pop lst))
+			(if (= (length rec) 6)
+				(ps (format "%g %g %g %g %g %g curve"
+						(rec 0) (rec 1) (rec 2)
+						(rec 3) (rec 4) (rec 5)))
+				(begin
+					(ps (format "%g turn" (rec 0)))
+					(ps (format "%g drawtolen" (rec 1))))))
+		(ps "closepath")
+		(ps "clip"))
+		(ps "turtlerestore"))
+		
+; text output 
+
+(define (text str)
+	(ps (format "(%s) text" str)))
+	
+(define (textoutline str flag)
+	(set 'flag (if flag "true" "false"))
+	(ps (format "(%s) %s textoutline" str flag)))
+	
+(define (textclip str)
+	(ps (format "(%s) textclip" str)))
+		
+(define (textarc radius str)
+	(ps (format "%g (%s) textarc" radius str)))
+	
+(define (textarcoutline radius str flag)
+	(set 'flag (if flag "true" "false"))
+	(ps (format "%g (%s) %s textarcoutline" radius str flag)))
+	
+; rendering and saving
+
+(define (render)
+	(write-file "noname.ps" (append prolog buffer "showpage" line-feed))
+	(exec "open noname.ps"))
+	
+(define (clear)
+	(set 'buffer ""))
+	
+(define (ps:save file-name)
+	(write-file file-name (append prolog buffer "showpage" line-feed)))
+	
+; global parameters 
+
+(define (translate x y)
+	(if (and x y)
+		(ps (format "%g %g translate" x y))
+		(ps "xpos ypos translate 0 0 moveto")))
+	
+(define (scale x y)
+	(ps (format "%g %g scale" x y)))
+	
+(define (ps:rotate deg)
+	(ps (format "%g rotate" deg)))
+
+(define (gsave)
+	(ps "pushturtle gsave"))
+	
+(define (grestore)
+	(ps "grestore popturtle"))
+	
+(define (line-width points)
+	(ps (format "%g setlinewidth" points)))
+	
+(define (line-cap mode)
+	(ps (format "%g setlinecap" mode)))
+	
+(define (line-join mode)
+	(ps (format "%g setlinejoin" mode)))
+	
+(define (line-color red green blue)
+    (if (string? red)
+    	(let (color red)
+    	  (set 'red (div (int (append "0x" (0 2 color)) 0 16) 255))
+    	  (set 'green (div (int (append "0x" (2 2 color)) 0) 255))
+    	  (set 'blue (div (int (append "0x" (4 2 color)) 0) 255))))
+	(ps (format "%g %g %g setrgbcolor" red green blue)))
+	
+(define (fill-color red green blue)
+    (if (string? red)
+    	(let (color red)
+    	  (set 'red (div (int (append "0x" (0 2 color)) 0 16) 255))
+    	  (set 'green (div (int (append "0x" (2 2 color)) 0) 255))
+    	  (set 'blue (div (int (append "0x" (4 2 color)) 0) 255))))
+	(ps (format "/fillcolor {%g %g %g} def" red green blue)))
+	
+(define (font fname size)
+	(ps (format "/%s findfont %g scalefont setfont" fname size)))
+	
+(context MAIN)
+
+
+
+
+	
+
+
+
diff --git a/modules/smtp.lsp b/modules/smtp.lsp
new file mode 100644
index 0000000..d0380af
--- /dev/null
+++ b/modules/smtp.lsp
@@ -0,0 +1,100 @@
+;; @module smtp.lsp
+;; @description Routines for sending mail using SMPT protocol
+;; @version 1.8 - comments redone for automatic documentation
+;; @author Lutz Mueller 2001
+;;
+;; <h2>Routines for sending mail</h2>
+;; This module implements routines to communicate with a SMTP mail server
+;; for sending email. To use this module include the following 'load' statement
+;; at the beginning of the program file:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/smtp.lsp")
+;; </pre>
+
+;; @syntax (SMTP:send-mail <str-from> <str-to> <str-subject> <str-message> <str-server>)
+;; @param <str-from> The email address of the sender.
+;; @param <str-to> The email address of the recipient.
+;; @param <str-subject> The subject line of the email.
+;; @param <str-message> The message part of the email.
+;; @param <str-server> The address of the SMTP server.
+;; @return On success 'true', on failure 'nil'.
+;; In case the function fails returning 'nil', the function
+;; 'SMTP:get-error-text' can be used to receive the error text.
+;;
+;; @example
+;;
+;; (SMTP:send-mail "jdoe@asite.com" "somebody@isp.com" "Greetings"
+;;                   "How are you today? - john doe -" "smtp.asite.com")
+
+;; Will send mail:
+;; <pre>
+;;  from address: jdoe@asite.com
+;;    to address: somebody@isp.com
+;;  subject line: Greetings
+;;  message body: Hoe are you today? - john doe-
+;;     smtp host: smtp.asite.com
+;; </pre>
+
+;; @syntax (SMTP:get-error-text)
+;; @return The text of the last error occured.
+
+(context 'SMTP)
+
+(set 'debug-flag nil)
+
+; this is the main function to use
+;
+;  USAGE:
+;
+
+(define (send-mail mail-from mail-to mail-subject mail-body SMTP-server)
+    (and
+        (set 'from-hostname (nth 1 (parse mail-from "@")))
+        (set 'socket (net-connect SMTP-server 25))
+        (confirm-request "2")
+        (net-send-get-result (append "HELO " from-hostname) "2")
+        (net-send-get-result (append "MAIL FROM: <" mail-from ">") "2")
+        (net-send-get-result (append "RCPT TO: <" mail-to ">") "2")
+        (net-send-get-result "DATA" "3")
+        (mail-send-header)
+        (mail-send-body)
+        (confirm-request "2")
+        (net-send-get-result "QUIT" "2")
+        (or (net-close socket) true)))
+
+(define (confirm-request conf)
+    (net-receive socket 'recvbuff 256 "\r\n")
+    (if debug-flag (println recvbuff) true)
+	; Empty out pipe. According to SMTP spec, last line has valid code.
+	; added for 1.8 for newLISP 9.2.0
+	(while (< 0 (net-peek socket))
+		(net-receive socket 'recvbuff 256 "\r\n")
+		(if debug-flag (println recvbuff)))
+	(starts-with recvbuff conf))
+  
+(define (net-send-get-result str conf)
+   (set 'send-str (append str "\r\n"))
+   (if debug-flag (println "sent: " send-str)) 
+   (net-send socket 'send-str)
+   (if conf (confirm-request conf) true))
+
+(define (mail-send-header)
+    (net-send-get-result (append "TO: " mail-to))
+    (net-send-get-result (append "FROM: " mail-from))
+    (net-send-get-result (append "SUBJECT: " mail-subject))
+    (net-send-get-result (append "X-Mailer: newLISP v." (string (nth -2 (sys-info)))))) 
+
+(define (mail-send-body )
+    (net-send-get-result "")
+    (dolist (lne (parse mail-body "\r\n")) 
+        (if (= lne ".") 
+            (net-send-get-result "..")
+            (net-send-get-result lne)))
+    (net-send-get-result "."))
+
+(define (get-error-text)
+    recvbuff)
+
+(context 'MAIN)
+
+; eof
diff --git a/modules/sqlite3.lsp b/modules/sqlite3.lsp
new file mode 100644
index 0000000..5f80148
--- /dev/null
+++ b/modules/sqlite3.lsp
@@ -0,0 +1,372 @@
+;; @module sqlite3.lsp 
+;; @description SQLite3 database interface routines
+;; @version 1.6 - comments redone for automatic documentation
+;; @version 1.7 - a fix getting types when null values are present (thanks Dmitry)
+;; @version 1.8 - a fix to make 64-Bit integers work (thanks Dmitry)
+;; @version 1.9 - new library detection routine
+;; @author Lutz Mueller, 2004-7
+;;
+;; <h2>Module for SQLite3 database bindings</h2>
+;; To use this module include the following 'load' statement at the
+;; beginning of the program file:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/sqlite3.lsp")
+;; </pre>
+;;
+;; SQLite version 3.0 introduced a new database format and is incompatible
+;; whith the previous 2.1 to 2.8 format. Old SQLite 2.x based databases can
+;; be converted  using the old and new sqlite client application:
+;;
+;;    sqlite OLD.DB .dump | sqlite3 NEW.DB
+;;
+;; While in sqlite 2.8 all returned fields where of string type, SQLite3
+;; returns, text, integer or float. Blobs are returned as text and NULLs
+;; are returned as nil.
+;;
+;; See also the documentation at @link http://sqlite.org sqlite.org
+;;
+;; <h2>Requirements:</h2> 
+;; One of the libraries sqlite3.dll for Win32 or libsqlite3.so for UNIX like
+;; operating systems is required from http://www.sqlite.org.
+;;
+;; SQLite is an <in-process> database. The library contains the whole database
+;; system. An extra database server is not required. SQLite also has limited
+;; mutiuser capabilities for accessing a common database from several programs
+;; at the same time. See the documentaion at @link http://sqlite.org sqlite.org 
+;; for details.
+;;
+;; The following is a short example how to use SQLite3:
+;;
+;; @example
+;; (sql3:open "MYDB")      ; opens/creates a database returns a handle (ignore)
+;;                         ; or 'nil' on failure
+;;
+;; (sql3:sql "select * from mytable;")	; make a SQL query, return result
+;;
+;; (sql3:error)            ; return error text
+;;
+;; (sql3:close)            ; close the database
+
+;; Function calls returning 'nil' signal that an error has occurred. The
+;; function 'sql3:error' can then be used to get details about the error
+;; as a text string.
+;;
+;; At the bottom of the source file 'sqlite3.lsp' a test routine called
+;; 'test-sqlite3' can be found to test for correct installation of SQLite.
+
+(context 'sql3)
+
+; set library to path-name of the library on your platform OS
+;
+(set 'files (list
+	"/usr/local/lib/libsqlite3.so" ; Linyx and BSDs
+	"/usr/lib/libsqlite3.0.dylib" ; Mac OSX Darwin
+	"/usr/local/lib/libsqlite3.so" ; Solaris
+	(string (env "PROGRAMFILES") "/sqlite3/sqlite3.dll") ; Win32/MinGW
+))
+
+
+(set 'library (files (or 
+				(find true (map file? files)) 
+				(begin (println "cannot find sqlite3 library") (exit)))))
+
+(import library "sqlite3_open" "cdecl")
+(import library "sqlite3_close" "cdecl")
+(import library "sqlite3_prepare" "cdecl")
+(import library "sqlite3_step" "cdecl")
+(import library "sqlite3_column_count" "cdecl")
+(import library "sqlite3_column_name" "cdecl")
+(import library "sqlite3_column_type" "cdecl")
+(import library "sqlite3_column_int" "cdecl")
+(import library "sqlite3_column_double" "cdecl")
+(import library "sqlite3_column_text" "cdecl")
+(import library "sqlite3_column_blob" "cdecl")
+(import library "sqlite3_column_bytes" "cdecl")
+(import library "sqlite3_finalize" "cdecl")
+(import library "sqlite3_get_table" "cdecl")
+(import library "sqlite3_last_insert_rowid" "cdecl")
+(import library "sqlite3_changes" "cdecl")
+(import library "sqlite3_busy_timeout" "cdecl")
+(import library "sqlite3_errmsg" "cdecl")
+
+
+; gloablly used vars and constants
+
+(define db nil)                  ; database handle
+(define dbp "\000\000\000\000")  ; ptr to database handle
+(define error-message nil)        ; error message
+(define col-names '())           ; list of column headers
+(define col-types '())           ; list of column types
+(define pstm "\000\000\000\000") ; ptr to compiled sql
+
+(constant 'SQLITE_OK 0)
+(constant 'SQLITE_ROW 100)
+(constant 'SQLITE_DONE 101)
+
+(constant 'SQLITE_TYPES '(
+	0 
+	SQLITE_INTEGER 
+	SQLITE_FLOAT 
+	SQLITE_TEXT 
+	SQLITE_BLOB 
+	SQLITE_NULL))
+
+;; @syntax (sql3:open <str-db-name>)
+;; @param <str-db-name> The name of the database.
+;; @return A database handle (discard), or 'nil' on failure.
+;;
+;; Opens or creates a database. If the database does exist it gets opened, 
+;; else a new database with the name given is created.
+;; If trying to open a database that already has been opened 'nil' is returned
+;; and an error text can be retrieved using 'sql3:error'.
+
+(define (sql3:open db-name)
+  ; only open if not alrady done
+  (if (not db)
+    (begin
+      (set 'result (sqlite3_open db-name dbp))
+      (if (!= result SQLITE_OK)
+        (set 'db nil)
+        (set 'db (get-int dbp))))
+    (begin
+      (set 'error-message "A database is already open")
+      nil))
+)
+
+; close the currently open database ;;;
+;
+;
+(define (sql3:close) 		;;  overwrite the close in MAIN
+	(if db (begin
+		(sqlite3_close db)
+		(set 'db nil)
+		true)))
+
+;; @syntax (sql3:sql <str-sql>)
+;; @param <str-sql> The SQL statement.
+;;
+;; Executes the SQL statement in <str-sql>. For 'select' statements an array 
+;; of the result set is returned or '()' for the empty set. For other statements
+;; 'true' is returned for a  successful outcome. On failure 'nil' is returened 
+;; and 'sql3:error' can be used to retrieve the error text.
+
+(define (sql sql-str)
+	(set 'result nil 'done nil 'error-message nil)
+	(set 'sqarray '());
+	(set 'col-names '());
+	(set 'col-types '());
+
+	; set up parameters for sqlite3_prepare() call
+	(set 'ppstm "\000\000\000\000") ; pointer to statement ptr
+	(set 'pptail "\000\000\000\000") ; pointer to statement tail
+
+	; compile the sql statment
+	(if db (set 'result (sqlite3_prepare db sql-str -1 ppstm pptail)))
+
+	; set up parameters for sqlite3_step() call
+	(set 'pstm (get-int ppstm))
+
+	; execute the compiled statement
+	(if (= result SQLITE_OK) 
+		(while (not done) 
+			;; execute statement until done/101 or 
+			(set 'result (sqlite3_step pstm))
+			(set 'num-cols (sqlite3_column_count pstm))
+			(if (empty? col-names) (set 'col-names (get-names pstm num-cols)))
+			(set 'col-types (get-types pstm num-cols))
+			(if (= result SQLITE_ROW)
+				(push (get-values pstm num-cols) sqarray -1)
+				(set 'done true) ;; received done/101 or error
+			))
+		
+                )
+	; if done/101 finalize
+	(if (= result SQLITE_DONE) 
+		(begin
+			(set 'result (sqlite3_finalize pstm))
+			; for 'select' statements return the array else 'true'
+			(if (> num-cols 0) sqarray true))
+		(if (= result 0) true (set-error))))
+
+
+(define (get-values pstm cols) 
+	(set 'row '())
+	(dotimes (idx cols)
+		(set 'i (int idx)) ; all loop vars are float
+		(case (nth idx col-types idx)
+;			(SQLITE_INTEGER 
+;				(push (sqlite3_column_int pstm i) row -1))
+;			fixed for 64-bit, thanks Dmitry
+			(SQLITE_INTEGER 
+				(set 'pstr (sqlite3_column_text pstm i)) 
+				(if (= pstr 0) 
+					(push nil row -1) 
+					(push (int (get-string pstr)) row -1))) 
+			(SQLITE_FLOAT 
+				(set 'pstr (sqlite3_column_text pstm i))
+				(if (= pstr 0)
+					(push nil row -1)
+					(push (float (get-string pstr)) row -1)))
+			(SQLITE_TEXT 
+				(set 'pstr (sqlite3_column_text pstm i))
+				(if (= pstr 0)
+					(push "" row -1)
+					(push (get-string pstr) row -1)))
+
+			; not tested yet
+			(SQLITE_BLOB 
+				(set 'pstr (sqlite3_column_blob pstm i))
+				(set 'len (sqlite3_column_bytes pstm i))
+				(set 'buff (dup "\000" len))
+				(if (= pstr 0)
+					(push "" row -1)
+					(begin
+						(cpymem pstr buff len)
+						(push buff row -1))))
+			(SQLITE_NULL 
+				(push nil row -1))))
+	row)
+
+(define (get-names pstm cols) 
+	(set 'row '())
+	(dotimes (idx cols)
+		(set 'i (int idx)) ; all loop vars are float
+		(set 'ps (sqlite3_column_name pstm i))
+		(if (= ps 0)	       ;; check for null pointer to result
+			(push "" row -1)
+			(push (get-string ps) row -1)))
+	row)
+
+(define (get-types pstm cols)
+	(set 'row '())
+	(dotimes (idx cols)
+		(set 'i (int idx)) ; all loop vars are float
+		(push (nth (sqlite3_column_type pstm i) SQLITE_TYPES) row -1))
+	row)
+
+
+;; @syntax (sql3:rowid)
+;; @return The last row id from last 'insert'.
+
+(define (rowid)
+	(if db (sqlite3_last_insert_rowid db)))
+
+;; @syntax (sql3:tables)
+;; @return A list of tables in the database.
+;
+(define (tables)
+	(if db (begin
+		(set 'lst (sql "select tbl_name from sqlite_master")) ))
+		(if lst (set 'lst (first (transpose lst)))))
+
+
+;; @syntax (sql3:columns <str-tabel-name>)
+;; @return A list of column names for a table.
+
+(define (columns aTable)
+        (if (list? (sql (append "select * from " aTable " where 0;")))
+                col-names))
+
+
+;; @syntax (sql3:changes)
+;; @return The Number of rows changed/affected by the last SQL statement.
+
+(define (changes)
+	(if db (sqlite3_changes db)))
+
+
+
+;; @syntax (sql3:timeout <num-milli-seconds>)
+;; @return 'true' on success or 'nil' on failure.
+;;
+;; Sets busy timeout in milliseconds.
+
+(define (timeout ms)
+	(if db (zero? (sqlite3_busy_timeout db (int ms)))))
+
+
+
+;; @syntax (sql3:error)
+;; @return The error text of the last error occured in 'sql3:sql'.
+
+(define (error) error-message)
+	
+(define (set-error)
+	(set 'result (sqlite3_errmsg db))
+	(if (= result 0) 
+		(set 'error-message nil)
+		(set 'error-message (get-string result))
+		nil
+		)
+)
+
+
+(context 'MAIN)
+
+; -------------------------------------------------------------------------
+;
+; test the database routines
+;
+; if there is an old "TEST" db from an earlier sqlite 2.8 delete it first
+;
+(define (test-sqlite3)
+	(if (sql3:open "TEST") 
+		(println "database opened/created,  ... Ok")
+		(println "problem opening/creating database"))
+
+	(if (sql3:sql "create table fruits (name CHAR(20), qty INT(3), price FLOAT(10), blobtext BLOB);")
+		(println "created table fruits,  ... Ok")
+		(println "problem creating table fruits"))
+
+	(if (sql3:sql "insert into fruits values ('apples', 11, 1.234, X'41424300010101');")
+		(println "inserted, last row id: " (sql3:rowid) ",  ... Ok")
+		(println "problem inserting row"))
+
+	(if (sql3:sql "insert into fruits values ('oranges', 22, 2.345, X'42434400020202');")
+		(println "inserted, last row id: " (sql3:rowid) ",  ... Ok")
+		(println "problem inserting row"))
+
+	(if (sql3:sql "insert into fruits values ('bananas', 33, 3.456, X'44454600030303');")
+		(println "inserted, last row id: " (sql3:rowid) ",  ... Ok")
+		(println "problem inserting row"))
+
+	(if (sql3:sql 
+		"insert into fruits values ('grapes', 123456789012345678, 7.89, X'47484900040404');")
+		(println "inserted, last row id: " (sql3:rowid) ",  ... Ok")
+		(println "problem inserting row"))
+
+	(set 'sqarray (sql3:sql "select * from fruits;"))
+
+	(if sqarray
+		(begin
+			(println "selected rows: ") 
+			(map println sqarray)
+			(println "column names: ")
+			(map println sql3:col-names)
+			(println "... Ok")
+			)
+		(println "problem with select"))
+
+	(if (sql3:sql "delete from fruits where 1;")
+		(println "deleted, rows affected: " (sql3:changes) ",  ... Ok")
+		(println "problem deleting rows"))
+
+	(if (list? (sql3:tables) )
+		(println "tables: " (sql3:tables) ", ... Ok")
+		(println "problem in sql3:tables"))
+
+	(if (list? (sql3:columns "fruits") )
+		(println "columns: " (sql3:columns "fruits") ", ... Ok")
+		(println "problem in sql3:columns"))
+	
+
+	(if (sql3:sql "drop table fruits;")
+		(println "table fruits dropped,  ... Ok")
+		(println "problem dropping table fruits"))
+
+
+	(sql3:close)
+)
+
+
+; eof ;
diff --git a/modules/stat.lsp b/modules/stat.lsp
new file mode 100644
index 0000000..5a710b5
--- /dev/null
+++ b/modules/stat.lsp
@@ -0,0 +1,583 @@
+;; @module stat.lsp
+;; @description Basic statistics library
+;; @version 1.3 - comments redone for automatic documentation
+;; @author Lutz Mueller, 2001
+;;
+;; <h2>Functions for statistics and plotting with GNU plot</h2>
+;; To use this module it has to be loaded at the beginning of the
+;; program file:
+;; <pre>
+;; (load "/usr/share/newlisp/stat.lsp")
+;; </pre>
+;; All functions work on integers and floats or a mix of both. <lists> are normal
+;; LISP lists. <matrices> are lists of lists, one list for each row in the
+;; two dimensional data matrix. See the function 'stat:matrix' on how to make matrices
+;; from lists.
+;;
+;; This file also shows how to use some of the built in matrix math functions
+;; like 'multiply', 'transpose', 'invert' and 'fft'. 
+;;
+;; Note, that the plot functions need 'gnuplot' installed, a free graphing 
+;; package available for most operating systems, see: @link http://www.gnuplot.org www.gnuplot.org
+;;
+;; This is the oldest module written in newLISP. Some parts could be rewritten for faster
+;; performance on big data sets using arrays instead of lists.
+;; <br/>
+;; <center><h2>Plot functions (requires 'gnuplot')</h2></center>
+;;
+;; The current directory for newLISP should be writable to use these functions.
+;;
+;; @syntax (stat:plot <p1> <p2> ... <pN>)        
+;; @param <p1> First value to plot.
+;; @param <p2> Second value to plot.
+;; @param <pN> Nth value to plot.
+;; @return The process ID of the gnuplot process.
+;;
+;; @syntax (stat:plotXY X Y)
+;; @param <X> List of x-coordinates to plot.
+;; @param <Y> List of y-coordinates to plot.
+;; @return The process ID of the gnuplot process.
+
+;; <br/>
+;; <center><h2>General uni- and bi- variate statistics</h2></center>
+;;
+;; @syntax (stat:sum <X>)
+;; @param <X> A list of numbers,
+;; @return Sum of data in list <X>.
+
+;; @syntax (stat:mean <X>) 
+;; @param <X> A list of numbers.
+;; @return The mean of data in list <X>.
+
+;; @syntax (stat:var <X>)
+;; @param <X> A list of numbers.
+;; @return The variance of the data in list <X>.
+
+;; @syntax (stat:sdev <X>)
+;; @param <X> A list of numbers.
+;; @return Standard deviation of data in list <X>.
+
+;; @syntax (stat:sum-sq <X>)              
+;; @param <X> A list of numbers.
+;; @return Sum of <x*x> data elements in list <X>.
+
+;; @syntax (stat:sum-xy <X> <Y>)
+;; @param <X> A list of numbers.
+;; @param <Y> A list of numbers.
+;; @return Sum of products <x*y> data elements in lists <X> and <Y>.
+
+;; @syntax (stat:cov <X> <Y>)
+;; @param <X> A list of numbers.
+;; @param <Y> A list of numbers.
+;; @return Covariance of data in lists <X> and <Y>
+
+;; @syntax (stat:sum-d2 <X>)
+;; @param <X> A list of numbers.
+;; @return Sum of squared diffs <(x - mean(X))^2> in list <X>.
+
+;; @syntax (stat:corr <X> <Y>)
+;; @param <X> A list of numbers.
+;; @param <Y> A list of numbers.
+;; @return Correlation coefficient of lists <X> and <Y>.
+
+;; @syntax (stat:regression <X> <Y>)
+;; @param <X> A list of numbers.
+;; @param <Y> A list of numbers.
+;; returns <(b0 b1)> coefficients of regression <Y = b0 + b1*X>.
+
+;; @syntax (stat:fit <X> <Y>)
+;; @param <X> A list of numbers.
+;; @param <Y> A list of numbers.
+;; @return fitted line based on '(stat:regression X Y)'.
+
+;; @syntax (stat:sum-d2xy <X> <Y>)
+;; @return Sum of squared differences <(x - y)^2> of elements in lists <X> and <Y>.
+
+;; @syntax (stat:moments <X>)
+;; @param <X> A list of numbers.
+;; @return Calculates all moments of list <X>.
+;;
+;; @syntax (stat:f-prob <F> <df1> <df2>)
+;; @param <F> The variance ratio.
+;; @param <df1> Degrees of freedom.
+;; @param <df2> Degrees of freedom.
+;; @return Probablity of F variance ratio for <df1>, <df2> degress of freedom.
+
+;; <br/>
+;; <center><h2>Multi variate statistics</h2></center>
+;;
+;; @syntax (stat:multiple-reg <X> <offY>)
+;; @param <X> A list of numbers.
+;; @param <offY> Zero based offset into <Y>.
+;; @return Multiple regression of vars in <X> onto <Y> at <offsetY>.
+
+;; @syntax (stat:cov-matrix <X>)
+;; @param <X> A list of numbers.
+;; @return Covariance matrix of <X> with <N> rows and <k> columns.
+
+;; @syntax (stat:corr-matrix <X>)
+;; @param <X> A list of numbers.
+;; @return Correlation matrix of <X> with <N> rows and <k> columns.
+
+;; <br/>
+;; <center><h2>Time series</h2></center>
+;;
+;; @syntax (stat:smooth <X> <alpha>)
+;; @param <X> A list of numbers.
+;; @param <alpha> Smoothing coefficient <0 &lt; alpha &lt; 1>.
+;; @return Exponentially smoothed sequence in <X>.
+
+;; @syntax (stat:lag <X> <n>)
+;; @param <X> A list of numbers.
+;; @param <n> Lag n.
+;; @return A differenced list of <X> with a lag of <n>.
+;; If the length of list <X> is <l> then the length of the resulting
+;; differenced list is <l - n>.
+
+;; @syntax (stat:cumulate <X>)
+;; @param <X> A list of numbers.
+;; @return The cumulated list of <X>.
+
+;; @syntax (stat:power <TS>)
+;; @param <TS> A time series of numbers.
+;; @return The power spectrum of a time series
+
+;; <br/>
+;; <center><h2>Matrix and list utilities</h2></center>
+;;
+;; @syntax (stat:matrix <C1> .... <CN>)
+;; @param <C1> The first column list of values.
+;; @param <CN> The Nth column list of values.
+;; @return A matrix off  <1> to <N> columns <C>.
+
+;; @syntax (stat:diagonal <item> <N>)
+;; @param <item> The diagonal element.
+;; @return A diagonal matrix of length <N> with <item> in the diagonal.
+
+;; @syntax (stat:get-diagonal <X>)
+;; @param <X> An matrix filled with numbers.
+;; @return A list from the diagonal elements of <X>.
+
+;; @syntax (stat:mat-map <op> <A> <B>)
+;; @return Matrix map, e.g. '(stat:mat-map + A B)'.
+;; Used for adding and subtracting matrices.
+
+(context 'stat)
+
+;---------------------------- gnuplot interface -------------------------------
+; 
+;  These plot functions need gnuplot installed and works fine under UNIX 
+;  or WIN32.
+; 
+;  The plot functions produce data files for the plot data and acommand files
+;  for gnuplot, then execute gnuplot.
+; 
+;  The routines need write access to the current directory to produce temporary files
+;  used by gnuplot:
+; 
+;  The file 'plot' contains the generated plot commands for gnuplot
+;  data is saved in files with the names of symbols containing the data
+;  or in files named 'series-1', 'series-2' etc.
+; 
+;  e.g.: (plot '(1 3 2 5 4)) will produce a 'series-1' ascii file 
+;  but (plot age height) will produce 'age' and 'height' data files
+; 
+  
+
+;
+; plot one or more lists of numbers 'args' is used to access the list of
+; input parameters to 'plot'
+;
+(define (plot)
+    (let  ( fileList '()
+            cnt 0
+            unix (< (& 0xF (last (sys-info))) 5)
+            fileName "")
+	; for each list write an ascii file
+	(dolist (elmnt (args))
+	    (if (list? elmnt)
+		(begin
+			(inc 'cnt)
+			(if (symbol? elmnt)
+				(set 'fileName (string elmnt))
+				(if unix
+					(set 'fileName (append (env "HOME") "/tmp/series-" (string cnt)))
+					(set 'fileName (append "series-" (string cnt)))))
+			
+			(write-file fileName (list2ascii elmnt))
+			(push (append "'" fileName "'") fileList))))
+
+	(set 'fileList (join (reverse fileList) ","))
+	; write file with plot commands depending on OS - Windows doesn't have PWD
+	(if unix
+		(write-file (append (env "HOME") "/tmp/plot") (append "set data style lines; plot " fileList "\r\n"))
+		(write-file "plot" (append "set data style lines; plot " fileList ";pause -1;\r\n")))
+
+	(if unix
+		(process (append "gnuplot -persist "  (env "HOME") "/tmp/plot"))
+		(process "gnuplot plot"))))
+
+
+;
+; plot to lists of numbers in XY-fashion
+;
+; optionally define a style e.g: "line"
+; if style is unused dots are plotted
+;
+(define (plotXY X Y style , lst st fle unix tempDir)
+        (set 'tempDir (append (env "HOME") "/tmp"))
+	(set 'unix (< (& 0xF (last (sys-info))) 5 ))
+	(set 'lst (map list (map string X) (map string Y)))
+	(if unix
+		(set 'fle (open (append (env "HOME") "/tmp/plot-XY") "write"))
+		(set 'fle (open "plot-XY" "write")))
+	(dolist (x lst)
+		(write-line (join x " ") fle))
+	(close fle)
+	(if (not style) 
+		(set 'st "")
+		(set 'st (append "set data style " style "; ")))
+
+	(if unix
+		(write-file (append tempDir "/plot") (append st "plot '" tempDir "/plot-XY';"))
+		(write-file "plot" (append st "plot 'plot-XY'; pause -1;")))
+	(if unix
+		(process (append "gnuplot -persist " tempDir "/plot"))
+		(process "gnuplot plot")))
+
+
+;-------------------  General uni and bi-variate statistics --------------------
+
+; sum of a data vector X
+(define (sum X)
+	(apply add X))
+
+; mean of a data vector X
+(define (mean X)
+	(div (sum X) (length X)))
+
+; variance of a data vecor X
+(define (var X)
+	(div (sum-d2 X) (sub (length X) 1)))
+
+; standard deviation of a data vector X
+(define (sdev X)
+	(sqrt (var X)))
+
+; sum of squares of a data vector X
+(define (sum-sq X)
+	(apply add (map mul X X)))
+
+; sum of the product of data vectors X*Y
+(define (sum-xy X Y)
+	(apply add (map mul X Y)))
+
+; covariance of data vectors X Y
+(define (cov X Y)
+	(sub (sum-xy X Y) (div (mul (sum X) (sum Y)) (length X))))
+
+; sum of sqared differenses of X to mean of X
+(define (sum-d2 X)
+	(sub (sum-sq X) (div (mul (sum X) (sum X)) (length X))))
+
+; Pearson r, product moment correlation of data vectors X and Y
+(define (corr X Y)
+	(div (cov X Y) (sqrt (mul (sum-d2 X) (sum-d2 Y)))))
+
+; regression Yest = b0 + b1*X calculates intercept b0 and slope b1
+(define (regression X Y)
+	(set 'b1 (div (cov X Y) (sum-d2 X)))
+	(set 'b0 (sub (mean Y) (mul b1 (mean X))))
+	(list b0 b1))
+
+; fitted line using regression Y on X
+(define (fit X Y, coeffs b0 b1)
+	(set 'coeffs (regression X Y))
+	(set 'b0 (first coeffs))
+	(set 'b1 (last coeffs))
+	(map (lambda (x) (add b0 (mul x b1))) X))
+
+; sum of squared differences of X and Y
+(define (sum-d2xy X Y)
+  (apply add (map (lambda (x y) (mul (sub x y) (sub x y))) X Y)))
+
+
+
+; moments of a vector of numbers
+;
+(define (moments vector, n median mean avg-dev std-dev var skew kurtosis dev sum)
+  (set 'n (length vector))
+
+  (set 'sum (apply add vector))
+  (set 'mean (div sum n))
+
+  (set 'avg-dev 0 'std-dev 0 'var 0 'skew 0 'kurtosis 0)
+
+  (set 'dev (map sub vector (dup mean n)))
+  (set 'avg-dev (div (apply add (map abs dev)) n))
+  (set 'var (div (apply add (map mul dev dev)) (- n 1)))
+  (set 'skew (apply add (map mul dev dev dev)))
+  (set 'kurtosis (apply add (map  mul dev dev dev dev)))
+
+  (set 'std-dev (sqrt var))
+
+  (if (> var 0.0)
+    (begin
+	(set 'skew (div skew (mul n var std-dev)))
+	(set 'kurtosis (sub (div kurtosis (mul n var var)) 3.0))))
+
+  (sort vector)
+  (set 'mid (/ n 2))
+
+  (if (= 0 (% n 2))
+	(set 'median (div (add (nth mid vector) (nth (- mid 1) vector)) 2))
+	(set 'median (nth mid vector)))
+
+  (list n median mean avg-dev std-dev var skew kurtosis)
+
+;  (println (format "n:                  %d" n))
+;  (println (format "median:             %f" median))
+;  (println (format "mean:               %f" mean))
+;  (println (format "average_deviation:  %f" avg-dev))
+;  (println (format "standard_deviation: %f" std-dev))
+;  (println (format "variance:           %f" var))
+;  (println (format "skew:               %f" skew))
+;  (println (format "kurtosis:           %f" kurtosis))
+)
+
+;-------------------------------- Time Series ----------------------------------
+
+; expontial smoothing with 0 < alpha <= 1
+(define (smooth lst alpha , previous slist)
+  (set 'previous (first lst))
+  (set 'slist '())
+  (dolist (elmnt lst) 
+   (set 'previous (add (mul alpha elmnt) (mul (sub 1 alpha) previous))) 
+   (push previous slist))
+  (reverse slist))
+
+
+;
+; seasonal difference list with variable lag
+; the resulting list is lag shorterm than the original
+;
+(define (lag lst n , sLst)
+	(set 'sLst lst)
+	(dotimes (i n) (pop lst))
+	(set 'sLst (slice sLst 0 (length lst)))
+	(map sub lst sLst))
+
+
+;
+; cumulate of a list
+;
+(define (cumulate lst , sc cum)
+	(set 'sc 0.0)
+	(set 'cum '())
+	(dolist (x lst)
+		(push (inc 'sc x) cum))
+	(reverse cum))
+
+;
+; power spectrum
+;
+; takes a rows by 2 columns matrix with real part in the first and 
+; imagenary part the in the second column. If all numbers are real
+; then the second column is just 0's.
+;
+; returns a matrix with two rows. First row contains power numbers
+; and second row contains the respective frequencies
+;
+
+(define (power ts , lenOrg fts n n2 ps mid frqs)
+	; remember original length
+	(set 'lenOrg (length ts))
+	; do discrete fourier transform
+	(set 'fts (transpose (fft ts)))
+	; calc power spectrum 
+	(set 'n (length (transpose fts)))
+	(set 'n2 (mul n n))
+	(set 'ps (map (lambda (x y) (add (mul x x) (mul y y))) (nth 0 fts) (nth 1 fts)))
+	(set 'ps (map (lambda (x) (mul (div x n2) 2)) ps))
+	; the first and last are not multiplied by 2, divide them back
+	(nth-set (ps 0) (div (first ps) 2))
+	(set 'mid (sub (div n 2) 1))
+	(replace mid ps (div (nth mid ps) 2))
+	; calc a vector with frequencies, adjusted for the new power-2 length
+	; which came back from the FFT
+	(set 'frqs (sequence 1 n))
+	(set 'frqs (map (lambda (x) (mul (div x n) lenOrg)) frqs))
+	(transpose (matrix ps frqs)))
+
+
+
+;------------------------- multivariate statistics -----------------------------
+
+;
+; multiple regression of variables in X onto one of varsiables in X, Y
+; indicated by column offset offY
+; 
+; X is N rows by k columns, the column at offset offY is Y
+;
+; returns a matrix with two rows:
+; first row is regression coefficients and multiple R: b0, b1, b2 ....., R
+; second row is sum of squares: regression-SQ, error-SQ, total-SQ
+; (the unused part of the second row is zero padded)
+;
+; the SQs can be used to calculate mean sqares for regression and error:
+;
+; regression-MSQ = regression-SQ / (k - 1)
+; error-MSQ = error-sq / (n - k - 1)
+;
+; F-ratio = regression-MSQ / error-MSQ  
+; with k and (n - k - 1) df degreees of freedom
+;
+;
+;
+;
+(define (multiple-reg X offY ,  Y Ycoffs b b0 R2 Yest sqErr sqTotal sqReg sq d)
+	(set 'covX (cov-matrix X))
+	(set 'Y (extract-col X offY))
+	; covX is the covariance matrix
+	(pop covX offY)
+	(set 'cvX (transpose covX))
+	; the covariance matrix is reduced to cvX and the
+	; extracted values put in Ycoffs
+	(set 'Ycoffs (matrix (pop cvX offY)))
+	; b contains the regression coefficients except for b0
+	(set 'b (multiply (invert cvX) Ycoffs))
+	; calculate multiple R2 as b'*b / sqTotal
+	(set 'sqTotal (sum-d2 Y))
+	(set 'R2 (div (first (first (multiply (transpose b) Ycoffs))) sqTotal))
+	; estimate Y without b0
+	(set 'Yest (multiply (reduce-col X offY) b))
+	; calculate b0, d is the difference between Y and the Y estimate
+	; b0 is the mean of differences between Y and Yest
+	(set 'd (mat-map sub (matrix Y) Yest))
+	(set 'b0 (mean (first (transpose d))))
+	; estimate Y including b0
+	(set 'Yest (mat-map add Yest (matrix (dup b0 (length Yest)))))
+	; error sum of squares
+	(set 'sqErr (sum-d2xy Y (first (transpose Yest))))
+	; regression sum of squares
+	(set 'sqReg (sub sqTotal sqErr))
+	; make list b out of b0, b1, b2 ... sqrt(R2)
+	(set 'b (append (list b0) (first (transpose b)) (list (sqrt R2))))
+	; make list sq out of sqReg, sqErr and sqTotal
+	(set 'sq (list sqReg sqErr sqTotal))
+	; return matrix with two rows:
+	(transpose (matrix b sq)))
+
+
+
+;
+; covariance matrix cov 
+; 
+; matrix x with N rows and k columns
+; 
+;
+(define (cov-matrix X , XtX N I sumX sumX2)
+	(set 'XtX (multiply (transpose X) X)) 
+	(set 'N (length X))
+	(set 'I (matrix (dup t1 N)))
+	(set 'sumX (multiply (transpose X) I)) 
+	(set 'sumX2 (multiply sumX (transpose sumX)))  
+	(set 'sumX2 (multiply sumX2 (diagonal (div 1 N) (length sumX2))))
+	(mat-map sub XtX sumX2))
+
+
+;
+; correlation matrix
+;
+; matrix X with N rows and k columns
+;
+;
+(define (corr-matrix X , covX N d dd)
+	(set 'covX (cov-matrix X))
+	(set 'd (matrix (get-diagonal covX)))
+	(set 'dd (multiply d (transpose d)))
+	(set 'dd (map (lambda (z) (map sqrt z)) dd))
+	(mat-map div covX dd))
+
+	
+;
+; probablity of F variance ratio with degrees of freedom df1 df2
+;
+;; 
+(define (f-prob F df1 df2)
+  (let (prob (mul 2 (betai (div df2 (add df2 (mul df1 F))) 
+                           (mul 0.5 df2) 
+                           (mul 0.5 df1)))) 
+   (div (if (> prob 1) (sub 2 prob) prob) 2)))	
+
+
+;----------------------------- utility functions -------------------------------
+
+;
+; make a matrix from 1 up to 16 lists
+;
+(define (matrix)
+	(transpose (args)))
+
+
+;
+; make a diagonal matrix n by n and elmnt in the diagonal
+; 
+;
+(define (diagonal elmnt n, m lst)
+	(set 'm '())
+	(dotimes (i n)
+		(set 'lst (dup 0 n))
+		(nth-set (lst i) elmnt)
+		(push lst m))
+	(reverse m))
+		
+;
+; get the diagonal from a square matrix
+;
+(define (get-diagonal X , d x)
+	(set 'd '())
+	(dotimes (idx (length X))
+		(push (nth idx (nth idx X)) d))
+	(reverse d))
+
+;
+; matrix map
+;
+; e.g.: (mat-map sub A B) ;; for matrix subtraction
+;
+(define (mat-map op A B)
+	(map (lambda (x y) (map op x y)) A B))
+
+;
+; reduce matrix by a column at offset
+;
+; returns the reduced matrix
+;
+(define (reduce-col mat off, X)
+	(set 'mat (transpose mat))
+	(pop mat off)
+	(transpose mat))
+
+;
+; extract a column from a matrix
+;
+; returns the extracted column
+;
+(define (extract-col mat off, X)
+	(pop (transpose mat) off))
+
+;
+; convert list to ascii lines terminated by CR-LF
+; for storage in files usable by Gnuplot, R, Excel etc.
+;
+; example: 
+;
+; (write-file "MyData.txt" (list2ascii mydata-list))
+;
+(define (list2ascii lst)
+	(append (join (map string lst) "\r\n") "\r\n"))
+
+; eof
+
+
diff --git a/modules/unix.lsp b/modules/unix.lsp
new file mode 100644
index 0000000..d692299
--- /dev/null
+++ b/modules/unix.lsp
@@ -0,0 +1,247 @@
+;; @module unix.lsp
+;; @description Itreface to various UNIX libc functions
+;; @version 0.1 alpha - mostly untested
+;; @author L.M. 2006-Sep-12, lutz@nuevatec.com
+;;
+;; <h2>UNIX libc function support</h2>
+;; To use this module include the following line at the beginning of
+;; the program file:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/unix.lsp")
+;; </pre>
+;;
+;; All functions are named like the UNIX functions they implelement but with
+;; the unix: namespace prefix. All functions work similar to the UNIX libc functions
+;; they implement but return 'nil' instead of '-1' for failure and 'true' instead
+;; of 0 for success. Note that in the implementaion most parameter types are casted
+;; even though redundant in most situation. The addional cast avoids segfaulting
+;; of the imported functions when supplied with wrong parameter types, i.e. for strings.
+;; Some times the 'int' cast is used to supply default values of an argument, in case
+;; the argument is not given.
+;;
+;; The arguments are given in, is the order used by the equivalent libc functions, not
+;; the order as used by shell  commandline utilities with the same name.
+;;
+;; Some of the wordings from functions descriptions are taken from BSD man pages.
+;;
+;; This module contains wrappers for the following libc functions:
+;; 'getpid', 'getppid', 'getuid', 'geteuid', 'getgid', 'getegid', 
+;; 'setuid', 'seteuid', 'setgid', 'setegid',
+;; 'kill', 'chmod', 'ioctl', 'mkfifo', 'mltemp', 'syslog'
+;; 
+
+(context 'unix)
+
+(if
+    ;; LINUX and BSDs
+    (< (& 0xF (last (sys-info))) 3) (set 'library "/usr/lib/libc.so")
+    ;; Mac OSX / Darwin
+    (= (& 0xF (last (sys-info))) 3) (set 'library "/usr/lib/libc.dylib")
+    ;; Solaris
+    (= (& 0xF (last (sys-info))) 4) (set 'library "/usr/lib/libc.so")
+    true (throw-error "Cannot load library")
+)
+
+;; @syntax (unix:getpid)
+;; @return Returns the current process ID
+
+(import library "getpid")
+
+;; @syntax (unix:getppid)
+;; @return Returns the parents process ID.
+
+(import library "getppid")
+
+;; @syntax (unix:getuid)
+;; @return Returns the real and effective user ID
+
+(import library "getuid")`
+
+;; @syntax (unix:geteuid)
+;; @return Returns the effective user ID
+
+(import library "geteuid")
+
+;; @syntax (unix:getgid)
+;; @return Returns the real group ID.
+
+(import library "getgid")
+
+;; @syntax (unix:getegid)
+;; @return Returns the effective group ID
+
+(import library "getegid")
+
+;; @syntax (unix:setuid <num-id>)
+;; @param <num-id> The number of the real and effective user IDs to set.
+;; @return Returns 'true' or 'nil' depending on success
+;;
+;; Set the real and effective user IDs.
+;; If no argument or the argument given is not a number then sets
+;; current real and effective user IDs.
+
+(set '_setuid (import library "setuid"))
+
+(define (setuid id)
+	(zero? (_setuid (int id (getuid))))
+)
+
+;; @syntax (unix:seteuid <num-id>)
+;; @param <num-id> The number of the effective user ID to set.
+;; @return Returns 'true' or 'nil' depending on success
+;;
+;; Sets the effective user ID.
+;; If no argument or the argument given is not a number then sets
+;; current effective user ID.
+;;
+(set '_seteuid (import library "seteuid"))
+
+(define (seteuid id)
+	(zero? (_seteuid (int id (geteuid))))
+)
+
+
+;; @syntax (unix:setgid <num-id>)
+;; @param <num-id> The number of the real and effective group ID to set.
+;; @return Returns 'true' or 'nil' depending on success
+;;
+;; Sets the real and effective group IDs.
+;; If no argument or the argument given is not a number then sets
+;; current real and effective group IDs.
+
+(set '_setgid (import library "setgid"))
+
+(define (setgid id)
+	(zero? (_setgid (int id (getgid))))
+)
+
+
+;; @syntax (unix:setegid <num-id>)
+;; @param <num-id> the number of the effective group ID to set.
+;; @return Returns 'true' or 'nil' depending on success
+;;
+;; Sets the effective group ID.
+;; If no argument or the argument given is not a number then sets
+;; current effective group ID.
+
+(set '_setegid (import library "setegid"))
+
+(define (setegid id)
+	(zero? (_setegid (int id (getegid))))
+)
+
+;; @syntax (unix:kill <num-pid> <num-sig>)
+;; @param <num-pid> The process ID of the process to send a signal to.
+;; @param <num-sig> The signal to send to the process in <num-pid>
+;; @return Returns 'true' or 'nil' depending on success
+;;
+;; Send a signal to a process.
+;; If no argument is given for <num-sig> or <num-sig> is zero, then
+;; the validiy of the <num-pid> is checked and 'nil' is returned for
+;; an invalid <num-pid>.
+;; Note that kill works has parameters backwards compared to the
+;; kill used in on the shell command line. '(unix:kill ...)' works
+;; like the libc 'kill()' counterpart.
+
+(set '_kill (import library "kill"))
+
+(define (kill pid sig)
+	(zero? (_kill (int pid 0) (int sig 0)))
+)
+
+;; @example
+;; (unix:kill 2652 9)
+
+;; Sends the 'SIGKILL' signal 9 to process ID '2652'
+
+;; @syntax (unix:chmod <str-path> <num-mode>)
+;; @param <str-path> The path name of the file or directory
+;; @param <num-option> The permission pattern as a number
+;; @return Returns 'true' or 'nil' depending on success
+;;
+;; Sets the permission pattern for a UNIX filesystem node. The
+;; pattern is best given as an octal number, i.e.: '0755' for 
+;; a -rwxr-xr-x permission pattern, '0644' for '-rw-r--r--' etc.
+;; If no <int-option> is given unix:chmod assumes '0644'.
+
+(set '_chmod (import library "chmod"))
+
+(define (chmod path option)
+	(zero? (_chmod (string path) (int option 0644)))
+)
+
+;; @example
+;; (unix:chmod "myfile.txt" 0644)
+
+;; Gives '-rw-r--r--' permission to the file 'myfile.txt'
+
+;; @syntax (unix:ioctl <num-id> <num-request> <str-argp>)
+;; @param <num-id> A number for file descriptor.
+;; @param <num-request> A number for a request.
+;; @param <str-argp> An argument string.
+;; @return Returns 'true' or 'nil' depending on success
+;;
+;; Manipulates the underlying device parameters of special
+;; files.
+;;
+(set '_ioctl (import library "ioctl"))
+
+(define (ioctl id request argp)
+	(zero? (_ioctl (int id 0) (int request 0) (string argp)))
+)
+
+;; @syntax (unix:mkfifo <str-path> <num-mode>)
+;; @param <str-path> The path  of the new fifo filename.
+;; @param <num-mode> The persmissions mode number.
+;; @return Returns 'true' or 'nil' depending on success
+;;
+;; Creates a new fifo file with name path.  The access permissions
+;; are specified by mode and restricted by the 'umask(2)' of the calling
+;; process.
+
+(set '_mkfifo (import library "mkfifo"))
+
+(define (mkfifo path mode)
+	(zero? (_mkfifo (string path) (int mode)))
+)
+
+;; @example
+;; (unix:mkfifo "myfifo" 0755)
+
+;; This will create a fifo node with 'prwxr-xr-x' permissions
+
+
+;; @syntax (unix:mktemp <str-template>)
+;; @param <str-template> A file template with Xs appended, i.e. '/tmp/temp.XXXX'.
+;; @return Returns 'true' or 'nil' depending on success
+;;
+;; The function takes the given file name template and overwrites a
+;; portion of it to create a file name.  This file name is guaranteed not to
+;; exist at the time of function invocation and is suitable for use by the
+;; application.  The template may be any file name with some number of 'X's
+;; appended to it, for example '/tmp/temp.XXXXXX'.  The trailing 'X's are
+;; replaced with a unique alphanumeric combination.
+
+(set '_mktemp (import library "mktemp"))
+
+(define (mktemp template)
+	(zero? (_mktemp (string template)))
+)
+
+;; @syntax (unix:syslog <num-priority> <str-message> ...)
+;; @param <num-priority> The priority of the message.
+;; @param <str-message> The message string and template in printf format.
+;; @return Returns 'true' or 'nil' depending on success
+;;
+;; The function writes message to the system message logger.  The
+;; message is then written to the system console, log files, logged-in
+;; users, or forwarded to other machines as appropriate.
+
+(set '_syslog (import library "syslog"))
+
+(define (syslog priority message)
+	(zero? (_syslog (int priority 0) (string message)))
+)
+
+; eof
+
diff --git a/modules/urlfiles b/modules/urlfiles
new file mode 100644
index 0000000..8574857
--- /dev/null
+++ b/modules/urlfiles
@@ -0,0 +1,2 @@
+http://www.autohotkey.net/~easycom/winscript.lsp
+
diff --git a/modules/winscript.lsp.html b/modules/winscript.lsp.html
new file mode 100644
index 0000000..97044cc
--- /dev/null
+++ b/modules/winscript.lsp.html
@@ -0,0 +1,188 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+<META http-equiv="Content-Type" content="text/html; charset=utf-8">
+<title>winscript.lsp</title>
+
+<style type="text/css" media="screen">
+<!--
+span.arw {
+	color:#666666;
+	font-size: 100%;
+	}
+	
+body, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+	line-height: 115%;
+ 	}
+
+h1, h2, h3, h4 {
+	font-family: Georgia, Times New Roman, Times, serif;
+   	font-size: 110%;
+	}
+
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+   	font-size: 100%;
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	font-size: 100%;
+	}
+-->
+</style>
+</head>
+
+<body style="margin: 20px;" text="#333333" bgcolor="#FFFFFF" 
+			link="#376590" vlink="#551A8B" alink="#ffAA28">
+<blockquote>
+<center><h1>winscript.lsp</h1></center>
+<p><a href="index.html">Module index</a></p><br/><br/><br/><h2>Module:&nbsp;winscript</h2><p>Embedded VBScript/JScript in newLISP.</p>
+<b>Version: </b>0.21<br/>
+<b>Author: </b>m35<br/>
+<p></p>
+<b>Location: </b><a href="http://www.autohotkey.net/~easycom/winscript.lsp">http://www.autohotkey.net/~easycom/winscript.lsp</a><br/>
+<p></p>
+ Change log:
+<p></p>
+ 0.10 - Initial release.
+<p></p>
+ 0.11 - Fixed memory leak when unhandled type is returned.
+        Improved get-short and get-single functions.
+<p></p>
+ 0.12 - Fixed handling of automation errors.
+<p></p>
+ 0.20 - Large internal changes to properly handle errors. This fixes
+        memory leaks and provides more comprehensive error information.
+        Added <tt>(WINSCRIPT:LastResult)</tt> function to return the results of
+        win32api calls.
+<p></p>
+ 0.21 - Added missing cleanup if failure during initialization.
+<p></p>
+ Tested with newlisp 9.2.0.
+<p></p>
+ Contact me (m35) in the newLISP Fan Club forum
+ <a href="http://www.alh.net/newlisp/phpbb/viewtopic.php?t=1983
+">http://www.alh.net/newlisp/phpbb/viewtopic.php?t=1983</a> <p></p>
+ A good list of automation error descriptions can be found in
+ <a href="http://support.microsoft.com/kb/186063">KB186063</a> 
+<p></p><b>example:</b><blockquote><pre> &gt; (WINSCRIPT:Initialize)
+ true
+ &gt; (WINSCRIPT:Exec {foo = "bar"})
+ true
+ &gt; (WINSCRIPT:Eval {foo})
+ "bar"
+ &gt; (WINSCRIPT:Uninitialize)
+ true</pre></blockquote>
+<p></p><b>example:</b><blockquote><pre> &gt; (WINSCRIPT:Initialize "VBScript")
+ true
+ &gt; (WINSCRIPT:Exec {Set oSp = CreateObject("SAPI.SpVoice")})
+ true
+ &gt; (WINSCRIPT:Exec {oSp.Speak "newLISP: Puts the fun back in LISP"})
+ true</pre></blockquote>
+<p></p><b>example:</b><blockquote><pre> ; this example requires Microsoft Excel to be installed.
+ &gt; (WINSCRIPT:Initialize)
+ true
+ &gt; (WINSCRIPT:Exec {Set xl = CreateObject("Excel.Application")})
+ true
+ &gt; (WINSCRIPT:Exec {xl.Visible = True})
+ true
+ &gt; (WINSCRIPT:Exec {Set rng = xl.Workbooks.Add().Worksheets(1).Cells(1, 1)})
+ true
+ &gt; (WINSCRIPT:Exec {rng.Value = 1.2345})
+ true
+ &gt; (WINSCRIPT:Eval {rng.Value})
+ 1.2345
+ &gt; (WINSCRIPT:Exec {xl.DisplayAlerts = False})
+ true
+ &gt; (WINSCRIPT:Exec {xl.Quit})
+ true
+ &gt; (WINSCRIPT:Uninitialize)
+ true</pre></blockquote>
+<p></p><center>- &sect; -</center><p></p>
+<a name="WINSCRIPT_Initialize"></a><h3><font color=#CC0000>WINSCRIPT:Initialize</font></h3>
+<b>syntax: (<font color=#CC0000>WINSCRIPT:Initialize</font> [<em>str-language</em>="VBScript"])</b><br/>
+<b>parameter: </b><em>str-language</em> - either <tt>"VBScript"</tt> or <tt>"JScript"</tt><br/>
+<p><b>return: </b>true on success, <tt>(throw-error)</tt> on error</p>
+ Sets up the scripting environment. Must be called before any other
+ functions can be used.
+
+
+
+
+
+
+
+
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="WINSCRIPT_Uninitialize"></a><h3><font color=#CC0000>WINSCRIPT:Uninitialize</font></h3>
+<b>syntax: (<font color=#CC0000>WINSCRIPT:Uninitialize</font>)</b><br/>
+<p><b>return: </b><tt>true</tt></p>
+ Releases memory for scripting environment. Does not have to be called before
+ exiting the program, but it is good practice.
+
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="WINSCRIPT_Exec"></a><h3><font color=#CC0000>WINSCRIPT:Exec</font></h3>
+<b>syntax: (<font color=#CC0000>WINSCRIPT:Exec</font> <em>str-code</em>)</b><br/>
+<b>parameter: </b><em>str-code</em> - code to execute<br/>
+<p><b>return: </b><tt>true</tt> on success, <tt>(throw-error)</tt> on error.</p>
+ Executes the scripting code.
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="WINSCRIPT_Eval"></a><h3><font color=#CC0000>WINSCRIPT:Eval</font></h3>
+<b>syntax: (<font color=#CC0000>WINSCRIPT:Eval</font> <em>str-code</em>)</b><br/>
+<b>parameter: </b><em>str-code</em> - code to evaluate<br/>
+<p><b>return: </b>resulting value on success, <tt>(throw-error)</tt> on error.</p>
+ Evaluates the scripting code and returns the result. Returned types can be
+ String, Byte, Integer, Long, Float, Double, Boolean (<tt>true</tt> or <tt>nil</tt>),
+ or object pointer. Uninitialized variables ("Empty") are returned as an
+ empty list. The remaining types (Arrays, Currency, Date, VARIANT*, and
+ DECIMAL*) are not handled and will cause an error if returned. Convert these
+ unhandled types to handled type (such as String) to return the value.
+<p></p>
+<p></p><b>example:</b><blockquote><pre> &gt; (WINSCRIPT:Initialize)
+ true
+ &gt; (WINSCRIPT:Eval "Now()")
+ user error : Unhandled variant type
+ called from user defined function WINSCRIPT:Eval
+ &gt; (WINSCRIPT:Eval "CStr(Now())")
+ "1/9/2008 10:07:10 PM"</pre></blockquote>
+<p></p><center>- &sect; -</center><p></p>
+<a name="WINSCRIPT_LastResult"></a><h3><font color=#CC0000>WINSCRIPT:LastResult</font></h3>
+<b>syntax: (<font color=#CC0000>WINSCRIPT:LastResult</font>)</b><br/>
+<p><b>return: </b>list of win32api function results during the last WINSCRIPT call.</p>
+ The returned list of strings will hold the results of all win32api functions
+ that could have failed during the last operation. If the last operation
+ threw and error, the last item in the list will be the error message
+ thrown.
+<p></p>
+<p></p><b>example:</b><blockquote><pre> &gt; (WINSCRIPT:Initialize)
+ true
+ &gt; (WINSCRIPT:Exec "#$@#$$^$&*&&")
+ user error : Expected statement
+ called from user defined function WINSCRIPT:Exec
+ &gt; (WINSCRIPT:LastResult)
+ ("MultiByteToWideChar ok" "SysAllocString ok" 
+  "IScriptControl.ExecuteStatement -2146827264"
+  "IScriptError.Description 0" "WideCharToMultiByte ok" "Expected statement")</pre></blockquote>
+
+<p></p><center>- &part; -</center><br/>
+<center><font face='Arial' size='-2' color='#444444'>
+generated with <a href="http://newlisp.org">newLISP</a>&nbsp;
+and <a href="http://newlisp.org/newLISPdoc.html">newLISPdoc</a>
+</font></center>
+</blockquote>
+</body>
+</html>
diff --git a/modules/xmlrpc-client.lsp b/modules/xmlrpc-client.lsp
new file mode 100644
index 0000000..7144771
--- /dev/null
+++ b/modules/xmlrpc-client.lsp
@@ -0,0 +1,215 @@
+;; @module xmlrpc-client.lsp 
+;; @description XMLRPC protocol client routines
+;; @version 0.3 - comments redone for automatic documentation
+;; @author Lutz Mueller, 2005
+;;
+;; <h2>Functions for XML-RPC client</h2>
+;; To use this module include a 'load' statement at the beginning of the program:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/xmlrpc-client.lsp")
+;; </pre>
+;;
+;; The script 'xmlrpc.cgi' together with a webserver or the script
+;; 'xmlrpc-server' for a freestanding XML-RPC server can be used for
+;; testing. Both scripts implement a method 'newLISP.evalString'. This
+;; module contains a client side function for this method.
+;; 
+;; For further information on XML-RPC consult 
+;; @link http://www.xmlrpc.com/ http://www.xmlrpc.com/ .
+;;
+;; Whenever a connection could be made, method functions will return a response
+;; formatted by the XML-RPC server in XML. If a connection failed the function will
+;; return 'nil' and a call to '(XMLRPC:error)' will return and error text.
+;;
+;; If the XML received cannot be parsed into SXML, the function returns 'nil'
+;; and '(XMLRPC:error)' will return an XML error. SXML is XML transformed into
+;; LISP S-expressions.
+
+;; If the XML received is syntactically correct but not correctly formatted,
+;; XML garbage is returned or 'nil' is returned and an error message in 
+;; '(XMLRPC:error)'.
+
+;; @syntax (XMLRPC:system.listMethods <str-url>)                    
+;; @param <str-url> The URL of the XML-RPC server
+;; @return A list or methods supported.
+;; The server at <url> returns a list of methods supported.
+
+;; @syntax (XMLRPC:system.methodHelp <str-url> <str-method-name>)        
+;; @param <str-url> The URL of the XML-RPC server.
+;; @param <method-name> The name of the method to get help for.
+;; @return Help for <str-method-name>
+;; The server at <str-url> returns help for the method in <str-method-name>
+
+;; @syntax (XMLRPC:system.methodSignatures <str-url> <str-method-name>) 
+;; @param <str-url> The URL of the XML-RPC server.
+;; @param <method-name> The name of the method to get the signature for.
+;; @return The signature for a server method.
+;; Gets the calling parameter conventions (signature) for a method
+;; <method-name> at <str-url>.
+
+;; @syntax (XMLRPC:execute <str-url> <str-xml-request>)
+;; @param <str-url> The URL of the XML-RPC server.
+;; @param <str-xml-request> A XML formatted request.
+;; @return XML formatted server response
+;; This is a generic method for making XML-RPC requests.
+;; The request must be XML formatted correctly by the sender (client).
+
+
+;; @syntax (XMLRPC:newLISP.evalString <str-url> <str-expression>)
+;; @param <str-url> The URL of the XML-RPC server.
+;; @param <str-expression> The expresssion to be evaluated in a string.
+;; @return The result of the expression evaluation.
+;; The expression in <str-expression> is encoded in base64 and then
+;; transmitted to the remote server.
+
+;; @syntax (XMLRPC:error)
+;; @return Error text of last error occured.
+
+(context 'XMLRPC)
+
+(set 'request
+[text]<?xml version="1.0"?>
+<methodCall>
+   <methodName>%s</methodName>
+   <params>
+      <param>
+         <value>%s</value>
+       </param>
+    </params>
+</methodCall>
+[/text])
+
+(set 'error-msg "")
+
+
+######### extract value(s) from XML-RPC response XML with <params> #############
+
+; get result data from result structure
+;
+(define (get-result-data xml)
+    (if (starts-with xml "ERR:") 
+        (begin
+            (set error-msg xml)
+            (throw nil)))
+    (xml-type-tags nil nil nil nil)
+    (set 'sxml (xml-parse xml (+ 1 2 4)))   
+    (if (not sxml) (throw (format "XML error: %s" (first (xml-error)))))
+
+    (if (match '(("methodResponse" ("fault" *))) sxml) 
+        (begin
+            (set 'error-msg 
+                (let (fault (nth 0 1 1 1 1 2 1 1 sxml) 
+                      text (nth 0 1 1 1 2 2 1 1 sxml))
+                     (append "Fault " fault ": " text)))
+                (throw nil)))
+
+    (get-value (nth 0 1 1 1 sxml)))
+   
+
+; get contents from expr = (value ...)
+;
+(define (get-value expr)
+    (if (empty? expr) nil
+        (case (nth 1 0 expr)
+            ("i4" (int (nth 1 1 expr)))
+            ("int" (int (nth 1 1 expr)))
+            ("boolean" (if (= "0" (nth 1 1 expr)) nil true))
+            ("double" (float (nth 1 1 expr)))
+            ("base64" (base64-dec (nth 1 1 expr)))
+            ("dateTime.iso8601" (nth 1 1 expr))
+            ("array" (if (= (nth 1 expr) "array") 
+                         "array" ;; if untagged string "array"
+                         (get-array (rest (nth 1 1 expr)))) )
+            ("struct" (get-struct (rest (nth 1 expr))))
+            ("string" (nth 1 1 expr))
+            (true (nth 1 expr)))))
+
+; get contents from expr = ((value ...) (value ...) ...)
+;
+(define (get-array expr)
+    (if (empty? expr) 
+        '()
+        (cons (get-value (first expr)) (get-array (rest expr)))))
+
+
+; get contents from expr = ((member ...) (member) ...)
+;
+(define (get-struct expr)
+    (if (empty? expr)
+        '()
+        (cons (get-member (first expr)) (get-struct (rest expr)))))
+
+
+; get contents from expr = (member ...)
+;
+(define (get-member expr)
+    (list (nth 1 1 expr) (get-value (last expr))))
+
+
+################################ standard system methods #######################
+
+# convert to SXML
+(xml-type-tags nil nil nil nil)
+
+
+# report all methods of XML-RPC server at url
+# return method names in a list of strings
+#
+# (XMLRPC:system.listMethods <url>)  
+#
+(define (system.listMethods url)
+    (execute url (format request "system.listMethods" "")))
+	
+
+# get help for a methodName at url
+# return help in a string
+#
+# (XMLRPC:system.methodHelp <url> <method-name) 
+#
+(define (system.methodHelp url methodName)
+    (execute url (format request "system.methodHelp" methodName) ))
+
+
+# get method signatures of methodName at url
+# return ans array of strings
+#
+# (XMLRPC:system.methodSignatures <url> <method-name>) 
+#
+(define (system.methodSignature url methodName)
+    (execute url (format request "system.methodSignature" methodName) ))
+
+
+(define (error) error-msg)
+
+
+# Execute a method on url with XML formatted request
+#
+# This is a generic method, but with XML formatted by caller.
+#
+# (XMLRPC:execute <url> <xml-request>)
+#
+(define (execute url parameter-XML)
+    (if (not (catch (begin
+        (set 'error-msg "")
+        (set 'xml (post-url url parameter-XML "text/xml"))
+        (get-result-data xml)) 'result))
+
+        (begin (set 'error-msg "Wrong format in XML-RPC") nil)
+        result))
+
+######################### newLISP XML-RPC specific methods #####################
+
+# evaluate a newLISP expression in str at newLISP XML-RPC server at url
+# return evaluation result in a string 
+#
+
+(define (newLISP.evalString url str)
+    (execute url 
+        (format request 
+                "newLISP.evalString" (append "<base64>" (base64-enc str) "</base64>")))
+)
+
+(context MAIN)
+
+# eof
+
diff --git a/modules/zlib.lsp b/modules/zlib.lsp
new file mode 100644
index 0000000..f8562f4
--- /dev/null
+++ b/modules/zlib.lsp
@@ -0,0 +1,113 @@
+;; @module zlisp.lsp
+;; @description Functions for compression/decompression with zlib
+;; @version 1.1 - comments redone for automatic documentation
+;; @version 1.2 - new library detection routine
+;; @author April 13th 2006, L.M.
+;;
+;; <h2>Functions for compression/decompression with zlib</h2> 
+;; For this module a platform sepcific library
+;; from @link http://www.zlib.net/ www.zib.net is needed.
+;;
+;; The module offers two types of compression/decompression support:
+;; one for fast in memory compression/decopmpression, the other for
+;; GZ compatible file compression and decompression.
+;; 
+;; Before using the module it must be loaded:
+;; <pre>
+;; (load "/usr/share/newlisp/modules/zlib.lsp")
+;; </pre>
+
+
+(context 'zlib)
+
+(set 'files '(
+	"/usr/lib/libz.so" ; Linuyx and BSDs
+	"/usr/lib/libz.dylib" ; Mac OSX / Darwin
+	"/usr/lib/libz.so" ; Solaris
+	"libz1.dll" ; Win32
+))
+
+(set 'library (files (or 
+				(find true (map file? files)) 
+				(begin (println "cannot find zlib compression library") (exit)))))
+
+(import library "compress")
+(import library "uncompress")
+(import library "gzopen")
+(import library "gzread")
+(import library "gzclose")
+(import library "gzwrite")
+
+;; @syntax (zlib:squeeze <str-buffer>)
+;; @return The string containing the compressed <str-buffer>.
+;; @example
+;; (set 'str-z  (zlib:squeeze str))
+
+(define (squeeze src)
+	(letn (	(srclen (length src)) 
+			(destlen (int (add (mul 1.01 srclen) 12))) 
+			(dest (dup "\000" destlen))
+			(destlenp (pack "ld" destlen))
+			)
+	(compress dest destlenp src srclen)
+	(set 'destlen (first (unpack "ld" destlenp)))
+	(slice dest 0 destlen)))
+
+
+;; @syntax (zlib:unsqueeze <str-buffer>)
+;; @return The original uncompressed string from a compressed buffer in <str-buffer>
+;; @example
+;; (set 'str (zlib:unsqueeze str-z))
+
+(define (unsqueeze src)
+	(letn (	(srclen (length src)) 
+			(destlen (* srclen 3)) 
+			(dest (dup "\000" destlen))
+			(destlenp (pack "ld" destlen))
+			)
+		(while (= -5 (uncompress dest destlenp src srclen))
+			(set 'destlen (* 2 destlen))	
+			(set 'dest (dup "\000" destlen))
+			(set 'destlenp (pack "ld" destlen)))
+		(set 'destlen (first (unpack "ld" destlenp)))
+		(slice dest 0 destlen)))
+
+;; @syntax (zlib:gz-read-file <str-file-name>)
+;; @return A string buffer with the original contents.
+;;
+;; Uncompresses the GZ compressed file in <str-file-name>.
+;; @example
+;; (set 'buff (zlib:gz-read-file "myfile.gz"))
+
+(define (gz-read-file file-name)
+	(let ( (fno (gzopen file-name "rb"))
+	       (buff (dup "\000" 0x1000))
+	       (result ""))
+		(if (!= fno 0)
+			(begin
+				(while (> (set 'bytes (gzread fno buff 0x1000)) 0)
+					(write-buffer result buff bytes))
+				(gzclose fno)
+				result))))
+
+;; @syntax (zlib:gz-write-file <str-file-name> <str-buffer>)
+;; @return The number of bytes in <str-buffer>.
+;;
+;; Does a GZ compatible comrpression of a buffer in <str-buffer> and
+;; writes it to the file in <str-file-name>.
+;; @example
+;; (zlib:gz-write-file "myfile.gz" buff) 
+
+(define (gz-write-file file-name buff)
+    (let ( (fno (gzopen file-name "wb"))
+		   (result nil))
+    	(if (!= fno 0)	
+			(begin
+				(set 'result (gzwrite fno buff (length buff)))
+				(gzclose fno)
+				result))))
+	
+(context MAIN) 
+
+; eof
+
diff --git a/newlisp.c b/newlisp.c
new file mode 100644
index 0000000..c6d6443
--- /dev/null
+++ b/newlisp.c
@@ -0,0 +1,6147 @@
+/* newlisp.c --- enrty point and main functions for newLISP
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#include "newlisp.h"
+#include "pcre.h"
+#include "protos.h"
+#include "primes.h"
+
+#ifdef WIN_32
+#include <winsock2.h>
+#endif
+
+#ifdef READLINE
+#include <readline/readline.h>
+#include <readline/history.h>
+#endif
+
+#ifdef SUPPORT_UTF8
+#include <wctype.h>
+#endif
+
+#ifdef IPV6
+#define IPV 6
+#else
+#define IPV 4
+#endif
+
+#define freeMemory free
+
+#ifdef WIN_32
+#define INIT_FILE "init.lsp"
+#define fprintf win32_fprintf
+#define fgets win32_fgets
+#define fclose win32_fclose
+#else
+#define INIT_FILE "/usr/share/newlisp/init.lsp"
+#endif
+
+#ifdef LIBRARY
+extern STREAM libStrStream;
+#endif
+
+#ifdef LINUX
+int opsys = 1;
+char ostype[]="Linux";
+#endif
+
+#ifdef _BSD
+int opsys = 2;
+char ostype[]="BSD";
+#endif
+
+#ifdef MAC_OSX
+int opsys = 3;
+char ostype[]="OSX";
+#endif
+
+#ifdef SOLARIS
+#ifdef TRU64
+int opsys = 9;
+char ostype[]="Tru64Unix";
+#else
+int opsys = 4;
+char ostype[]="Solaris";
+#endif
+#endif
+
+#ifdef WIN_32
+int opsys = 6;
+char ostype[]="Win32";
+#endif
+
+#ifdef OS2 
+int opsys = 7; 
+char ostype[]="OS/2"; 
+#endif 
+
+int version = 9303;
+
+char copyright[]=
+"\nnewLISP v.9.3.3 Copyright (c) 2008 Lutz Mueller. All rights reserved.\n\n%s\n\n";
+
+#ifndef NEWLISP64
+#ifdef SUPPORT_UTF8
+char banner[]=
+"newLISP v.9.3.3 on %s IPv%d UTF-8%s\n\n";
+#else
+char banner[]=
+"newLISP v.9.3.3 on %s IPv%d%s\n\n";
+#endif
+#else
+#ifdef SUPPORT_UTF8
+char banner[]=
+"newLISP v.9.3.3 64-bit on %s IPv%d UTF-8%s\n\n";
+#else
+char banner[]=
+"newLISP v.9.3.3 64-bit on %s IPv%d%s\n\n";
+#endif 
+#endif
+
+char banner2[]=
+", execute 'newlisp -h' for more info.";
+
+char linkOffset[] = "@@@@@@@@";
+
+void printHelpText(void);
+
+/* --------------------- globals -------------------------------------- */
+
+/* interactive command line */
+
+int commandLineFlag = TRUE;
+int isTTY = FALSE;
+int demonMode = 0;
+
+int noPromptMode = 0;
+int forcePromptMode = 0;
+int httpMode = 0;
+
+FILE * IOchannel;
+int IOport = 0;
+char * IOdomain = NULL;
+int logTraffic = 0;
+#define LOG_LESS 1
+#define LOG_MORE 2
+
+/* initialization */
+int MAX_CPU_STACK = 0x800;
+int MAX_ENV_STACK;
+int MAX_RESULT_STACK;
+#ifndef NEWLISP64
+long MAX_CELL_COUNT = 0x10000000;
+#else
+long MAX_CELL_COUNT = 0x800000000000000LL;
+#endif
+
+CELL * firstFreeCell = NULL;
+
+CELL * nilCell;
+CELL * trueCell;
+CELL * lastCellCopied;
+SYMBOL * nilSymbol;
+SYMBOL * trueSymbol;
+SYMBOL * starSymbol;
+SYMBOL * plusSymbol;
+SYMBOL * questionSymbol;
+SYMBOL * atSymbol;
+SYMBOL * currentFunc;
+SYMBOL * argsSymbol;
+SYMBOL * mainArgsSymbol;
+SYMBOL * dolistIdxSymbol;
+
+SYMBOL * sysSymbol[MAX_REGEX_EXP];
+
+SYMBOL * errorEvent;
+SYMBOL * currentContext = NULL;
+SYMBOL * mainContext = NULL;
+SYMBOL * demonRequest;
+SYMBOL * timerEvent;
+
+SYMBOL * symHandler[32];
+int currentSignal = 0;
+
+jmp_buf errorJump;
+
+char lc_decimal_point;
+
+/* error and exception handling */
+
+#define EXCEPTION_THROW -1
+int errorReg = 0;
+CELL * throwResult;
+int errnoSave;
+
+/* buffer for read-line */
+STREAM readLineStream;
+
+/* compiler */
+
+size_t cellCount = 0;
+size_t symbolCount = 0;
+
+int parStackCounter = 0;
+
+/* expression evaluation */
+
+static CELL * (*evalFunc)(CELL *) = NULL;
+UINT * envStack = NULL;
+UINT * resultStack = NULL;
+UINT * lambdaStack = NULL;
+int envStackIdx, resultStackIdx, lambdaStackIdx;
+int evalSilent = 0;
+
+extern PRIMITIVE primitive[];
+
+int traceFlag = 0;
+int evalCatchFlag = 0;
+int recursionCount = 0;
+int symbolProtectionLevel = 0; 
+
+int prettyPrintPars = 0;
+int prettyPrintCurrent = 0;
+int prettyPrintFlags = 0;
+int prettyPrintLength = 0;
+char * prettyPrintTab = " ";
+#define MAX_PRETTY_PRINT_LENGTH 80
+UINT prettyPrintMaxLength =  MAX_PRETTY_PRINT_LENGTH;
+int stringOutputRaw = TRUE;
+
+#define pushLambda(A) (*(lambdaStack + lambdaStackIdx++) = (UINT)(A))
+#define popLambda() ((CELL *)*(lambdaStack + --lambdaStackIdx))
+
+int pushResultFlag = TRUE;
+
+char startupDir[PATH_MAX]; /* start up directory, if defined via -w */
+char logFile[PATH_MAX]; /* logFile, is define with -l, -L */
+
+/* ============================== MAIN ================================ */
+
+/*
+void setupSignalHandler(int sig, void (* handler)(int))
+{
+static struct sigaction sig_act;
+sig_act.sa_handler = handler;
+sigemptyset(&sig_act.sa_mask);
+sig_act.sa_flags = SA_RESTART | SA_NOCLDSTOP;
+if(sigaction(sig, &sig_act, 0) != 0)
+	printf("Error setting signal:%d handler\n", sig);
+}
+*/
+
+void setupSignalHandler(int sig, void (* handler)(int))
+{
+if(signal(sig, handler) == SIG_ERR)
+	printf("Error setting signal:%d handler\n", sig);
+}
+
+#ifdef SOLARIS
+void sigpipe_handler(int sig)
+{
+setupSignalHandler(SIGPIPE, sigpipe_handler);
+}
+
+void sigchld_handler(int sig)
+{
+waitpid(-1, (int *)0, WNOHANG);
+}
+
+void ctrlC_handler(int sig) 
+{
+char chr; 
+
+setupSignalHandler(SIGINT, ctrlC_handler);
+
+if(commandLineFlag != TRUE) return;
+
+traceFlag |= TRACE_SIGINT;
+
+printErrorMessage(ERR_SIGINT, NULL, 0);
+printf("(c)ontinue, e(x)it, (r)eset:");
+fflush(NULL);
+chr = getchar();
+if(chr == 'x') exit(1);
+if(chr == 'c') traceFlag &= ~TRACE_SIGINT;
+}
+
+
+void sigalrm_handler(int sig)
+{
+setupSignalHandler(sig, sigalrm_handler);
+/* check if not sitting idle */
+if(recursionCount)
+  traceFlag |= TRACE_TIMER;
+else /* if idle */
+  executeSymbol(timerEvent, NULL);
+}
+
+#endif /* solaris */
+
+
+void setupAllSignals(void)
+{
+#ifdef SOLARIS
+setupSignalHandler(SIGINT,ctrlC_handler);
+#else
+setupSignalHandler(SIGINT, signal_handler);
+#endif
+
+#ifndef WIN_32
+
+#ifdef SOLARIS
+setupSignalHandler(SIGALRM, sigalrm_handler);
+setupSignalHandler(SIGVTALRM, sigalrm_handler);
+setupSignalHandler(SIGPROF, sigalrm_handler);
+setupSignalHandler(SIGPIPE, sigpipe_handler);
+setupSignalHandler(SIGCHLD, sigchld_handler);
+#else
+setupSignalHandler(SIGALRM, signal_handler);
+setupSignalHandler(SIGVTALRM, signal_handler);
+setupSignalHandler(SIGPROF, signal_handler);
+setupSignalHandler(SIGPIPE, signal_handler);
+setupSignalHandler(SIGCHLD, signal_handler);
+#endif
+
+#endif
+}
+
+void signal_handler(int sig)
+{
+#ifndef WIN_32
+char chr; 
+#endif
+
+if(sig > 32 || sig < 1) return;
+
+#ifdef SOLARIS
+switch(sig)
+  {
+  case SIGALRM:
+  case SIGVTALRM:
+  case SIGPROF:
+    setupSignalHandler(sig, sigalrm_handler);
+    break;
+  case SIGPIPE:
+    setupSignalHandler(SIGPIPE, sigpipe_handler);
+    break;
+  case SIGCHLD:
+    setupSignalHandler(SIGCHLD, sigchld_handler);
+    break;
+  }
+#else
+setupSignalHandler(sig, signal_handler);
+#endif
+
+if(symHandler[sig - 1] != nilSymbol)
+    {
+    if(recursionCount)
+        {
+        currentSignal = sig;
+        traceFlag |= TRACE_SIGNAL;
+        return;
+        }
+    else
+        {
+        executeSymbol(symHandler[sig-1], stuffInteger(sig));
+        return;
+        }
+    }
+
+switch(sig)
+    {
+    case SIGINT:
+        if(commandLineFlag != TRUE) return;
+
+        printErrorMessage(ERR_SIGINT, NULL, 0);
+
+#ifdef WIN_32
+        traceFlag |= TRACE_SIGINT;
+#else
+        printf("\n(c)ontinue, (d)ebug, e(x)it, (r)eset:");
+        fflush(NULL);
+        chr = getchar();
+        if(chr == 'x') exit(1);
+        if(chr == 'd') 
+            {
+            traceFlag &= ~TRACE_SIGINT;
+            openTrace();
+            }
+        if(chr == 'r') traceFlag |= TRACE_SIGINT;
+        break;
+    case SIGPIPE:
+        break;
+    case SIGALRM:
+    case SIGVTALRM:
+    case SIGPROF:
+        /* check if not sitting idle */
+        if(recursionCount)
+            traceFlag |= TRACE_TIMER;
+        else /* if idle */
+            executeSymbol(timerEvent, NULL);
+        break;
+    case SIGCHLD:
+        waitpid(-1, (int *)0, WNOHANG);
+#endif
+        break;
+    default:
+        return;
+    }	
+}
+ 
+
+void loadStartup(char * name)
+{
+#ifdef WIN_32
+#ifndef LIBRARY
+char * ptr;
+char EXEName[MAX_LINE];
+char initFile[MAX_LINE];
+
+GetModuleFileName(NULL, EXEName, MAX_LINE);
+name = EXEName;
+#endif 
+#endif
+
+if(strncmp(linkOffset, "@@@@", 4) == 0)
+        {
+#ifdef WIN_32
+#ifndef LIBRARY
+        ptr = name + strlen(name) - 1;
+        while(ptr != name)
+          {
+          if(*ptr == '/' || *ptr == '\\') break;
+          ptr--;
+          }
+        *ptr = 0;
+        strncpy(initFile, name, MAX_LINE - 9);
+        strcat(initFile, "/");
+        strcat(initFile, INIT_FILE);
+        loadFile(initFile, 0, 0, mainContext);
+#else
+        loadFile(INIT_FILE, 0, 0, mainContext);
+#endif
+#else        
+        loadFile(INIT_FILE, 0, 0, mainContext);
+#endif
+        }
+else    /* load encrypted part at offset */ 
+	loadFile(name, *(UINT*)linkOffset, 1, mainContext);
+}
+
+
+#ifdef _BSD
+struct lconv    *localeconv(void);
+char            *setlocale(int, const char *);  
+#endif
+
+void initLocale(void)
+{
+struct lconv * lc;
+char * locale;
+
+#ifndef SUPPORT_UTF8
+locale = setlocale(LC_ALL, "C");
+#else
+locale = setlocale(LC_ALL, "");
+#endif
+
+if (locale != NULL)
+  stringOutputRaw = (strcmp(locale, "C") == 0);
+
+lc = localeconv();
+lc_decimal_point = *lc->decimal_point;
+}
+
+/* set NEWLISPDIR only if not set already */
+void initNewlispDir(void)
+{
+#ifdef WIN_32
+char * varValue;
+char * newlispDir;
+
+if(getenv("NEWLISPDIR") == NULL)
+	{
+	newlispDir = alloca(MAX_PATH);
+	varValue = getenv("PROGRAMFILES");
+	if(varValue != NULL)
+		{
+		strncpy(newlispDir, varValue, MAX_PATH);
+		strncat(newlispDir, "/newlisp", 8);
+		setenv("NEWLISPDIR", newlispDir, TRUE);
+		}
+	else setenv("NEWLISPDIR", "newlisp", TRUE);
+	}
+#else
+if(getenv("NEWLISPDIR") == NULL)
+	setenv("NEWLISPDIR", "/usr/share/newlisp", TRUE);
+#endif
+}
+
+#ifndef  LIBRARY
+char * getArg(char * * arg, int argc, int * index)
+{
+if(strlen(arg[*index]) > 2)
+	return(arg[*index] + 2);
+
+if(*index >= (argc - 1))
+	{
+	printf("missing parameter for %s\n", arg[*index]);
+	exit(-1);
+	}
+
+*index = *index + 1;
+
+return(arg[*index]);
+}
+
+#ifndef WIN_32
+char ** MainArgs;
+#endif 
+
+CELL * getMainArgs(char * mainArgs[])
+{
+CELL * argList;
+#ifndef LIBRARY
+CELL * lastEntry;
+int idx = 0;
+#endif
+
+#ifndef WIN_32
+MainArgs = mainArgs;
+#endif
+
+argList = getCell(CELL_EXPRESSION);
+
+#ifndef LIBRARY
+lastEntry = NULL;
+while(mainArgs[idx] != NULL)
+	{
+	if(lastEntry == NULL)
+		{
+		lastEntry = stuffString(mainArgs[idx]);
+		argList->contents = (UINT)lastEntry;
+		}
+	else
+		{
+		lastEntry->next = stuffString(mainArgs[idx]);
+		lastEntry = lastEntry->next;
+		}
+	idx++;
+	}
+#endif 
+
+return(argList);
+}
+
+    
+int main(int argc, char * argv[])
+{
+char command[MAX_LINE];
+STREAM cmdStream;
+int idx;
+#ifdef READLINE
+char * cmd;
+#endif
+
+#ifdef WIN_32
+WSADATA WSAData;
+WSAStartup(MAKEWORD(1,1), &WSAData);
+#endif
+
+#ifdef SUPPORT_UTF8
+opsys += 128;
+#endif
+
+memset(&cmdStream, 0, sizeof(STREAM));
+
+initLocale();
+initNewlispDir();
+IOchannel = stdin;
+
+initialize();
+initStacks();
+
+mainArgsSymbol->contents = (UINT)getMainArgs(argv);
+
+if((errorReg = setjmp(errorJump)) != 0) 
+    {
+    if(errorReg && (errorEvent != nilSymbol) && !isNil((CELL*)errorEvent->contents)) 
+        executeSymbol(errorEvent, NULL);
+    else exit(-1);
+    goto AFTER_ERROR_ENTRY;
+    }
+
+setupAllSignals();
+
+loadStartup(argv[0]);
+errno = 0;
+
+realpath(".", startupDir);
+
+for(idx = 1; idx < argc; idx++)
+	{
+#ifndef  NOCMD
+	if(strncmp(argv[idx], "-c", 2) == 0)
+		noPromptMode = TRUE;
+
+	if(strncmp(argv[idx], "-C", 2) == 0)
+		forcePromptMode = TRUE;
+
+	if(strncmp(argv[idx], "-http", 5) == 0)
+		{
+		noPromptMode = TRUE;
+		httpMode = TRUE;
+		}
+
+	if(strncmp(argv[idx], "-s", 2) == 0)
+		{
+		MAX_CPU_STACK = atoi(getArg(argv, argc, &idx));
+
+		if(MAX_CPU_STACK < 1024) MAX_CPU_STACK = 1024;
+		initStacks();
+		continue;
+		}
+
+	if(strncmp(argv[idx], "-p", 2) == 0 || strncmp(argv[idx], "-d", 2) == 0  )
+		{
+		if(strncmp(argv[idx], "-d", 2) == 0)
+			demonMode = TRUE;
+
+		IOdomain = getArg(argv, argc, &idx);
+		IOport = atoi(IOdomain);
+
+		setupServer(0);
+		continue;
+		}
+
+	if(strncmp(argv[idx], "-e", 2) == 0)
+		{
+		executeCommandLine(getArg(argv, argc, &idx), OUT_CONSOLE, &cmdStream);
+		exit(0);
+		}		
+
+	if(strncmp(argv[idx], "-l", 2) == 0 || strncmp(argv[idx], "-L", 2) == 0)
+		{
+		logTraffic = (strncmp(argv[idx], "-L", 2) == 0) ? LOG_MORE : LOG_LESS;
+		realpath(getArg(argv, argc, &idx), logFile);
+		continue;
+		}
+
+	if(strncmp(argv[idx], "-m", 2) == 0)
+		{
+#ifndef NEWLISP64
+		MAX_CELL_COUNT =  abs(0x0010000 * atoi(getArg(argv, argc, &idx)));
+#else
+		MAX_CELL_COUNT =  abs(0x0008000 * atoi(getArg(argv, argc, &idx)));
+#endif
+		continue;
+		}
+
+	if(strncmp(argv[idx], "-w", 2) == 0)
+		{
+		realpath(getArg(argv, argc, &idx), startupDir);
+		chdir(startupDir);	
+		continue;
+		}	
+
+	if(strcmp(argv[idx], "-h") == 0)
+		{
+		printHelpText();
+		exit(0);
+		}
+#endif
+	
+	loadFile(argv[idx], 0, 0, mainContext);
+	}
+
+AFTER_ERROR_ENTRY:
+
+if(isatty(fileno(IOchannel)))
+	{
+	isTTY = TRUE;
+	if(!noPromptMode) 	
+		varPrintf(OUT_CONSOLE, banner, ostype, IPV, banner2);
+	}
+else
+	{
+#ifdef WIN_32
+	/* its a faked FILE struct, see win32_fdopen() in nl-sock.c */
+  if(!isSocketStream(IOchannel))
+#endif
+		setbuf(IOchannel,0);
+	if(forcePromptMode)
+		varPrintf(OUT_CONSOLE, banner, ostype, IPV, banner2);
+	}
+
+
+errorReg = setjmp(errorJump);
+
+setupAllSignals();
+reset();
+initStacks();
+
+if(errorReg && !isNil((CELL*)errorEvent->contents) ) 
+	executeSymbol(errorEvent, NULL);
+
+while(TRUE)
+	{
+	if(commandLineFlag == TRUE)
+		{
+#ifdef READLINE
+		if(isTTY) 
+			{
+			errnoSave = errno;
+			if((cmd = readline(prompt())) == NULL) exit(0);
+			errno = errnoSave; /* reset errno, set by readline() */
+			if(strlen(cmd) > 0) add_history(cmd);
+			executeCommandLine(cmd, OUT_CONSOLE, &cmdStream);
+			free(cmd);
+			continue;
+			}
+
+		if(IOchannel != stdin || forcePromptMode) 
+			varPrintf(OUT_CONSOLE, prompt());
+#endif
+#ifndef READLINE
+		if(isTTY || IOchannel != stdin || forcePromptMode) 
+			varPrintf(OUT_CONSOLE, prompt());
+#endif	
+		if(IOchannel == NULL || fgets(command, MAX_LINE - 1, IOchannel) == NULL)
+			{
+			if(!demonMode)  exit(1);
+			if(IOchannel != NULL) fclose(IOchannel);
+			setupServer(1);
+			continue;
+			}
+
+		executeCommandLine(command, OUT_CONSOLE, &cmdStream);
+        }
+	}
+
+#ifndef WIN_32
+return 0;
+#endif
+}
+#endif
+
+
+void printHelpText(void)
+{
+varPrintf(OUT_CONSOLE, copyright, 
+		"usage: newlisp [file | url ...] [options ...] [file | url ...]\n\noptions:\n");
+varPrintf(OUT_CONSOLE, "%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n\n%s\n\n",
+	" -h this help",
+	" -s <stacksize>",
+	" -m <max-mem-megabyte>",
+	" -l log connections only",
+	" -L log all",
+	" -p <port-number>",
+	" -d <port-number>",
+	" -e <quoted lisp expression>",
+	" -c no prompts, HTTP",
+	" -C force prompts",
+	" -http HTTP only",
+	" -w <working-directory>",
+	"more information at http://newlisp.org");
+}
+
+
+void setupServer(int reconnect)
+{
+if((IOchannel  = serverFD(IOport,  IOdomain, reconnect)) == NULL)
+	{
+	printf("newLISP server setup on %s failed.\n", IOdomain);
+	exit(1);
+	}
+
+#ifdef WIN_32
+if(!isSocketStream(IOchannel))
+#endif
+	setbuf(IOchannel,0);
+
+if(!reconnect && !noPromptMode)
+	varPrintf(OUT_CONSOLE, banner, ostype, IPV, ".");
+}
+
+
+char * prompt(void)
+{
+char * context;
+static char string[32];
+
+if(evalSilent || noPromptMode) 
+	{
+	evalSilent = 0;
+	return("");
+	}
+	
+if(currentContext != mainContext)
+	context = currentContext->name;
+else context = "";
+
+if(traceFlag & TRACE_SIGINT) 
+	{
+	traceFlag &= ~TRACE_SIGINT;
+	longjmp(errorJump, errorReg);
+	}
+	
+if(traceFlag)
+	snprintf(string, 31, "%s %d> ", context, recursionCount);
+else
+	snprintf(string, 31, "%s> ", context);
+
+return(string);
+}
+
+
+void reset()
+{
+recoverEnvironment(0);
+
+collectGarbage();
+
+if(printDevice) close((int)printDevice);
+printDevice = recursionCount = resultStackIdx = envStackIdx = lambdaStackIdx = 0;
+symbolProtectionLevel = traceFlag = prettyPrintFlags = 0;
+evalFunc = NULL;
+pushResultFlag = commandLineFlag = TRUE;
+currentContext = mainContext;
+}
+
+
+void recoverEnvironment(int index)
+{
+SYMBOL * symbol;
+CELL * cell;
+
+while(envStackIdx > index)
+	{
+	symbol = (SYMBOL *)popEnvironment();
+	cell = (CELL*)popEnvironment();
+	if(cell != (CELL*)symbol->contents)
+		{
+		deleteList((CELL*)symbol->contents);
+		symbol->contents = (UINT)cell;
+		if(isProtected(symbol->flags))
+			symbol->flags &= ~SYMBOL_PROTECTED;
+		}
+	}
+}
+
+
+void executeCommandLine(char * command, int outDevice, STREAM * cmdStream)
+{
+STREAM stream;
+char buff[MAX_LINE];
+
+if(strlen(command) == 0 || *command == '\n') return;
+
+if(noPromptMode) 
+	{
+	if(logTraffic == LOG_MORE) 
+		writeLog(command, 0);
+	if(strncmp(command, "GET /", 5) == 0) 
+		{
+		executeHTTPrequest(command + 5, HTTP_GET_URL);
+		return;
+		}
+	else if(strncmp(command, "HEAD /", 6) == 0)
+		{
+		executeHTTPrequest(command + 5, HTTP_GET_HEAD);
+		return;
+		}
+	else if(strncmp(command, "PUT /", 5) == 0)
+		{
+		executeHTTPrequest(command + 5, HTTP_PUT_URL);
+		return;
+		}
+	else if(strncmp(command, "POST /", 6) == 0)
+		{
+		executeHTTPrequest(command + 6, HTTP_POST_URL);
+		return;
+		}
+	else if(strncmp(command, "DELETE /", 8) == 0)
+		{
+		executeHTTPrequest(command + 8, HTTP_DELETE_URL);
+		return;
+		}
+
+	if(httpMode) return;
+	}
+
+if(*command == '!' && *(command + 1) != ' ' && strlen(command) > 2)
+	{
+	system((command + 1));
+	return;
+	}
+	
+if(cmdStream != NULL && strncmp(command, "[cmd]", 5) == 0)
+	{
+	openStrStream(cmdStream, 1024, TRUE);	
+	while(fgets(buff, MAX_LINE - 1, IOchannel) != NULL)
+		{
+		if(strncmp(buff, "[/cmd]", 6) == 0)
+			{
+			if(logTraffic) 
+				{
+				writeLog(cmdStream->buffer, 0);
+				writeLog(buff, 0);
+				}
+			/* make stream for evaluation */
+			makeStreamFromString(&stream, cmdStream->buffer);
+			evaluateStream(&stream, OUT_CONSOLE, 0);
+			closeStrStream(cmdStream);
+			return;
+			}
+		writeStreamStr(cmdStream, buff, 0);
+		}
+	closeStrStream(cmdStream);
+	if(!demonMode)  exit(1);
+	if(IOchannel != NULL) fclose(IOchannel);
+	setupServer(1);
+	return;
+	}
+
+if(logTraffic) writeLog(command, TRUE);
+prettyPrintLength = 0;
+
+makeStreamFromString(&stream, command);
+evaluateStream(&stream, outDevice, 0);
+
+return;
+}
+
+
+CELL * evaluateStream(STREAM * stream, UINT outDevice, int flag)
+{
+CELL * program;
+CELL * eval = nilCell;
+int resultIdxSave;
+int result;
+
+result = TRUE;
+resultIdxSave = resultStackIdx;
+while(result)
+	{
+	pushResult(program = getCell(CELL_QUOTE));
+	result = compileExpression(stream, program);
+	if(result)
+		{
+		if(flag && eval != nilCell) deleteList(eval);
+		eval = evaluateExpression((CELL *)program->contents);
+		if(outDevice != 0 && !evalSilent) 
+		    {
+			printCell(eval, TRUE, outDevice);
+			varPrintf(outDevice, "\n");
+			if(logTraffic == LOG_MORE)
+				{
+				printCell(eval, TRUE, OUT_LOG);
+				writeLog("", TRUE);
+				}
+			}                      
+		if(flag) eval = copyCell(eval);
+		}
+	cleanupResults(resultIdxSave);
+	}
+
+if(flag) return(eval);
+return(NULL);
+}
+
+
+long executeSymbol(SYMBOL * symbol, CELL * params)
+{
+CELL * program;
+CELL * cell;
+int resultIdxSave;
+
+if(symbol == nilSymbol || symbol == NULL)   return(0);
+resultIdxSave = resultStackIdx;
+pushResult(program = getCell(CELL_EXPRESSION));
+cell = getCell(CELL_SYMBOL);
+program->contents = (UINT)cell;
+cell->contents = (UINT)symbol;
+if(params != NULL) cell->next = params;
+cell = evaluateExpression(program);
+cleanupResults(resultIdxSave);
+
+return(cell->contents);
+}
+
+
+void initialize()
+{
+int i;
+SYMBOL * symbol;
+CELL * pCell;
+char  symName[8];
+
+/* build true and false cells */
+
+nilCell = getCell(CELL_NIL);
+trueCell = getCell(CELL_TRUE);
+nilCell->contents = (UINT)nilCell;
+trueCell->contents = (UINT)trueCell;
+nilCell->next = trueCell->next = nilCell;
+
+/* build first symbol and context MAIN */
+mainContext = currentContext = translateCreateSymbol("MAIN", CELL_CONTEXT, NULL, TRUE);
+makeContextFromSymbol(mainContext, mainContext);
+
+/* build symbols for primitives */
+
+for(i = 0; primitive[i].name != NULL; i++)
+	{
+	pCell = getCell(CELL_PRIMITIVE);
+	symbol = translateCreateSymbol(
+		primitive[i].name, CELL_PRIMITIVE, mainContext, TRUE);
+	symbol->contents = (UINT)pCell;
+	symbol->flags = primitive[i].prettyPrint | SYMBOL_PROTECTED | SYMBOL_GLOBAL | SYMBOL_BUILTIN;
+	pCell->contents = (UINT)primitive[i].function;
+	pCell->aux = (UINT)symbol->name;
+	}
+
+/* build true, nil, * and ? symbols */
+
+trueSymbol = translateCreateSymbol("true", CELL_TRUE, mainContext, TRUE);
+trueSymbol->contents = (UINT)trueCell;
+nilSymbol = translateCreateSymbol("nil", CELL_NIL, mainContext, TRUE);
+nilSymbol->contents = (UINT)nilCell;
+starSymbol = translateCreateSymbol("*", CELL_PRIMITIVE, mainContext, TRUE);
+plusSymbol = translateCreateSymbol("+", CELL_PRIMITIVE, mainContext, TRUE);
+questionSymbol = translateCreateSymbol("?", CELL_NIL, mainContext, TRUE);
+atSymbol = translateCreateSymbol("@", CELL_NIL, mainContext, TRUE);
+argsSymbol = translateCreateSymbol("$args", CELL_NIL, mainContext, TRUE);
+mainArgsSymbol = translateCreateSymbol("$main-args", CELL_NIL, mainContext, TRUE);
+dolistIdxSymbol = translateCreateSymbol("$idx", CELL_NIL, mainContext, TRUE);
+
+for(i = 0; i < MAX_REGEX_EXP; i++)
+	{
+	snprintf(symName, 8, "$%d", i);
+	sysSymbol[i] = translateCreateSymbol(symName, CELL_NIL, mainContext, TRUE);
+	sysSymbol[i]->flags |= SYMBOL_GLOBAL | SYMBOL_BUILTIN;
+	}
+
+currentFunc = errorEvent = timerEvent  = nilSymbol;
+
+trueSymbol->flags |= SYMBOL_PROTECTED | SYMBOL_GLOBAL;
+nilSymbol->flags |= SYMBOL_PROTECTED | SYMBOL_GLOBAL;
+questionSymbol->flags |= SYMBOL_PROTECTED | SYMBOL_GLOBAL;
+atSymbol->flags |=  SYMBOL_GLOBAL | SYMBOL_BUILTIN;
+argsSymbol->flags |= SYMBOL_GLOBAL | SYMBOL_BUILTIN | SYMBOL_PROTECTED;
+mainArgsSymbol->flags |= SYMBOL_GLOBAL | SYMBOL_BUILTIN | SYMBOL_PROTECTED;
+dolistIdxSymbol->flags |= SYMBOL_GLOBAL | SYMBOL_BUILTIN | SYMBOL_PROTECTED;
+argsSymbol->contents = (UINT)getCell(CELL_EXPRESSION);
+
+symbol = translateCreateSymbol("ostype", CELL_STRING, mainContext, TRUE);
+symbol->contents = (UINT)stuffString(ostype);
+symbol->flags |= SYMBOL_GLOBAL | SYMBOL_BUILTIN | SYMBOL_PROTECTED;
+
+/* init signal handlers */
+for(i = 0; i < 32; i++)
+  symHandler[i] = nilSymbol;
+
+/* init readLineStream */
+openStrStream(&readLineStream, 16, 0);
+}
+
+
+void initStacks()
+{
+MAX_ENV_STACK = (MAX_CPU_STACK * 8 * 2);
+MAX_RESULT_STACK = (MAX_CPU_STACK * 2);
+if(envStack != NULL) freeMemory(envStack);
+if(resultStack != NULL) freeMemory(resultStack);
+if(lambdaStack != NULL) freeMemory(lambdaStack);
+envStack = (UINT *)allocMemory((MAX_ENV_STACK + 16) * sizeof(UINT));
+resultStack = (UINT *)allocMemory((MAX_RESULT_STACK + 16) * sizeof(UINT));
+lambdaStack = (UINT *)allocMemory((MAX_RESULT_STACK + 16) * sizeof(UINT));
+envStackIdx = resultStackIdx = lambdaStackIdx = 0;
+}
+
+	
+/* ------------------------- evaluate s-expression --------------------- */
+
+
+CELL * evaluateExpression(CELL * cell)
+{
+CELL * result;
+CELL * args = NULL;
+CELL * pCell = NULL;
+SYMBOL * newContext = NULL;
+SYMBOL * sPtr;
+int resultIdxSave = 0;
+
+if(cell->type & EVAL_SELF_TYPE_MASK) return cell;
+switch(cell->type)
+	{
+	case CELL_SYMBOL:
+	case CELL_CONTEXT:
+		return((CELL*)((SYMBOL *)cell->contents)->contents);
+
+	case CELL_QUOTE:
+		return((CELL *)cell->contents);
+
+	case CELL_EXPRESSION:
+		args = (CELL *)cell->contents;
+		resultIdxSave = resultStackIdx;                
+		
+		if(++recursionCount > (int)MAX_CPU_STACK)
+			fatalError(ERR_OUT_OF_CALL_STACK, args, 0);
+		
+		if(args->type == CELL_SYMBOL) /* precheck for speedup */
+			{
+			newContext = ((SYMBOL *)args->contents)->context;
+			pCell =  (CELL*)((SYMBOL *)args->contents)->contents;
+			}
+		else if(args->type == CELL_DYN_SYMBOL)
+			{
+			sPtr = getDynamicSymbol(args);
+			newContext = sPtr->context;
+			pCell = (CELL *)sPtr->contents;
+			}
+		else
+			{ 
+			pCell = evaluateExpression(args);
+			newContext = currentContext;
+			}
+
+		if(traceFlag) traceEntry(cell, pCell, args);
+
+		if(pCell->type == CELL_PRIMITIVE)
+			{
+			evalFunc = (CELL *(*)(CELL*))pCell->contents;
+			result = (*evalFunc)(args->next);
+			evalFunc = NULL;
+			break;
+			}
+		
+		if(pCell->type == CELL_LAMBDA)
+			{ 
+			pushLambda(args);
+			result = evaluateLambda((CELL *)pCell->contents, args->next, newContext); 
+			--lambdaStackIdx; 
+			break; 
+			}
+		
+		if(pCell->type == CELL_MACRO)
+			{ 
+			result = evaluateMacro((CELL *)pCell->contents, args->next, newContext);
+			break;
+			}
+
+		if(pCell->type == CELL_IMPORT_CDECL
+#ifdef WIN_32
+		   || pCell->type == CELL_IMPORT_DLL
+#endif
+			)
+			{
+			result = executeLibfunction(pCell, args->next);  
+ 			break;
+			}
+
+			/* check for 'default' functor
+			* allow function call with context name, i.e: (ctx)
+			* assumes that a ctx:ctx contains a function
+			*/
+		if(pCell->type == CELL_CONTEXT)
+			{
+			newContext = (SYMBOL *)pCell->contents;
+			sPtr= translateCreateSymbol(newContext->name, CELL_NIL, newContext, TRUE);
+			pCell = (CELL *)sPtr->contents;
+
+			if(pCell->type == CELL_PRIMITIVE)
+				{
+				evalFunc = (CELL *(*)(CELL*))pCell->contents;
+				result = (*evalFunc)(args->next);
+				evalFunc = NULL;
+				break;
+				}
+
+			else if(pCell->type == CELL_LAMBDA)
+				{
+				pushLambda(args);
+				result = evaluateLambda((CELL *)pCell->contents, args->next, newContext); 
+				--lambdaStackIdx; 
+				break; 
+				}
+
+			else if(pCell->type  == CELL_MACRO)
+				{
+				result = evaluateMacro((CELL *)pCell->contents, args->next, newContext); 
+				break; 
+				}
+
+			}
+			
+
+		/* allow 'implicit indexing' if pCell is a list, array, string or number:
+                   (pCell idx1 idx2 ...) 
+		*/
+                
+		if(args->next != nilCell)
+			{
+			if(pCell->type == CELL_EXPRESSION)
+				result = copyCell(implicitIndexList(pCell, args->next));
+
+			else if(pCell->type == CELL_ARRAY)
+				result = copyCell(implicitIndexArray(pCell, args->next));
+
+			else if(pCell->type == CELL_STRING)
+				result = implicitIndexString(pCell, args->next);
+                              
+			else if(isNumber(pCell->type))
+				result = implicitNrestSlice(pCell, args->next);
+                              
+			else result = errorProcExt(ERR_INVALID_FUNCTION, cell);                              
+			}
+		else 
+			result = errorProcExt(ERR_INVALID_FUNCTION, cell);
+		break;
+
+	case CELL_DYN_SYMBOL:
+		return((CELL*)(getDynamicSymbol(cell))->contents);
+		
+	default:
+		result = nilCell;
+	}
+
+while(resultStackIdx > resultIdxSave)
+	deleteList(popResult());
+
+if(pushResultFlag) 
+	{
+	if(resultStackIdx > MAX_RESULT_STACK)
+		fatalError(ERR_OUT_OF_CALL_STACK, pCell, 0);
+	pushResult(result);
+	}
+else pushResultFlag = TRUE;
+
+if(traceFlag) traceExit(result, cell, pCell, args);
+--recursionCount;
+return(result);
+}
+
+
+CELL *  evaluateExpressionSafe(CELL * cell, int * errNo)
+{
+jmp_buf errorJumpSave;
+CELL * result;
+
+memcpy(errorJumpSave, errorJump, sizeof(jmp_buf));
+if((*errNo = setjmp(errorJump)) != 0)
+	{
+	memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+	return(NULL);
+	}
+
+result = evaluateExpression(cell);
+memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+return(result);
+}
+
+
+/* a symbol belonging to a dynamic context */
+/* the parent context symbol points to the real context */
+/* cell->contents -> name str of this symbol */
+/* cell->aux -> symbol var which holds context (dynamic) */
+/* ((SYMBOL*)cell->aux)->contents -> context cell */
+SYMBOL * getDynamicSymbol(CELL * cell)
+{
+CELL * contextCell;
+
+contextCell = (CELL *)((SYMBOL *)cell->aux)->contents;
+if(contextCell->type != CELL_CONTEXT)
+	fatalError(ERR_CONTEXT_EXPECTED, stuffSymbol((SYMBOL*)cell->aux), TRUE);
+
+return(translateCreateSymbol( 
+		(char*)cell->contents,		/* name of dyn symbol */
+		CELL_NIL,
+		(SYMBOL*)contextCell->contents,	/* contextPtr */
+		TRUE));
+}
+
+
+CELL * evalCheckProtected(CELL * cell, CELL * * flagPtr)
+{
+CELL * result;
+SYMBOL * sPtr;
+
+if(isSymbol(cell->type))
+	{
+	if(cell->type == CELL_SYMBOL)
+		sPtr = (SYMBOL *)cell->contents;
+	else
+		sPtr = getDynamicSymbol(cell);
+
+ 	if(isProtected(sPtr->flags))
+		return(errorProcExt(ERR_SYMBOL_PROTECTED, cell));
+
+	return((CELL *)sPtr->contents);
+	}
+
+symbolProtectionLevel = recursionCount;
+result = evaluateExpression(cell);
+if(symbolProtectionLevel == 0xFFFFFFFF)
+	{
+	if(flagPtr == NULL)
+		return(errorProcExt(ERR_SYMBOL_PROTECTED, cell));
+	else *flagPtr = cell;
+	}
+
+symbolProtectionLevel = 0;
+return(result);
+}
+
+
+/* -------------------- evaluate lambda function ----------------------- */
+
+CELL * evaluateLambda(CELL * localLst, CELL * arg, SYMBOL * newContext)
+{
+CELL * local;
+CELL * result = nilCell;
+CELL * cell;
+SYMBOL * symbol;
+SYMBOL * contextSave;
+int localCount = 0;
+
+if(envStackIdx > (UINT)MAX_ENV_STACK)
+	return(errorProc(ERR_OUT_OF_ENV_STACK));
+
+if(localLst->type != CELL_EXPRESSION)
+	return(errorProcExt(ERR_INVALID_LAMBDA, localLst));
+
+/* evaluate arguments */
+if(arg != nilCell)
+	{
+	/* this symbol precheck does 10% speed improvment on lambdas  */
+	if(arg->type == CELL_SYMBOL)
+		cell = result = copyCell((CELL*)((SYMBOL *)arg->contents)->contents);
+	else
+		cell = result = copyCell(evaluateExpression(arg));
+       
+	while((arg = arg->next) != nilCell)
+		{
+		if(arg->type == CELL_SYMBOL)
+			cell->next = copyCell((CELL*)((SYMBOL *)arg->contents)->contents);
+		else
+			cell->next = copyCell(evaluateExpression(arg));
+
+		cell = cell->next;
+		}
+	}
+
+/* change to new context */
+contextSave = currentContext;
+currentContext = newContext;
+
+/* save environment and get parameters */
+local = (CELL*)localLst->contents;
+GET_LOCAL:
+	{
+	if(local->type == CELL_SYMBOL)
+		symbol = (SYMBOL *)local->contents;
+	/* get default parameters */
+	else if(local->type == CELL_EXPRESSION)
+		{
+		if(((CELL*)local->contents)->type == CELL_SYMBOL)
+			{
+			cell = (CELL *)local->contents;
+			if(cell->type == CELL_SYMBOL)
+				{
+				symbol = (SYMBOL *)cell->contents;
+				if(result == nilCell)
+					result = copyCell(evaluateExpression(cell->next));
+				}
+			else goto GOT_LOCALS;
+			}
+		else goto GOT_LOCALS;
+		}
+	else goto GOT_LOCALS;
+
+	if(isProtected(symbol->flags))
+		return(errorProcExt(ERR_SYMBOL_PROTECTED, local));
+
+	/* save symbol environment */
+	pushEnvironment(symbol->contents);
+	pushEnvironment((UINT)symbol);
+
+	/* fill local symbols */
+	symbol->contents = (UINT)result;
+	cell = result;
+	result = result->next;
+
+	/* unlink list */
+	cell->next = nilCell;
+
+	local = local->next;
+	localCount++;
+	}
+goto GET_LOCAL;
+
+GOT_LOCALS:
+/* put unassigned args in $args */
+pushEnvironment(argsSymbol->contents);
+pushEnvironment((UINT)argsSymbol);
+argsSymbol->contents = (UINT)getCell(CELL_EXPRESSION);
+if(result != nilCell)
+  ((CELL*)argsSymbol->contents)->contents = (UINT)result;
+++localCount;
+
+/* evaluate body expressions */
+cell = localLst->next;
+result = nilCell;
+while(cell != nilCell)
+	{
+	result = evaluateExpression(cell);
+	cell = cell->next;
+	}
+result = copyCell(result);
+
+/* recover environment of local symbols */
+while(localCount--)
+	{
+	symbol = (SYMBOL *)popEnvironment();
+	if(isProtected(symbol->flags) && (symbol != argsSymbol))
+		symbol->flags &= ~SYMBOL_PROTECTED;
+	deleteList((CELL *)symbol->contents);
+	symbol->contents = popEnvironment();
+	}
+
+currentContext = contextSave;
+return(result);
+}
+
+
+CELL * evaluateMacro(CELL * localLst, CELL * arg, SYMBOL * newContext)
+{
+CELL * local;
+CELL * result;
+CELL * cell;
+SYMBOL * symbol;
+SYMBOL * contextSave;
+int localCount;
+
+if(envStackIdx > (UINT)MAX_ENV_STACK)
+	return(errorProc(ERR_OUT_OF_ENV_STACK));
+
+if(localLst->type != CELL_EXPRESSION)
+	return(errorProcExt(ERR_INVALID_MACRO, localLst));
+local = (CELL *)localLst->contents;
+
+contextSave = currentContext;
+currentContext = newContext;
+
+/* save environment and get parameters */
+localCount = 0;
+GET_ARGS:
+  {
+  if(local->type == CELL_SYMBOL)
+  	symbol = (SYMBOL *)local->contents;
+  /* get default parameters */
+  else if(local->type == CELL_EXPRESSION)
+		{
+		if(((CELL*)local->contents)->type == CELL_SYMBOL)
+			{
+			cell = (CELL *)local->contents;
+			if(cell->type == CELL_SYMBOL)
+				{
+				symbol = (SYMBOL *)cell->contents;
+				if(arg == nilCell)
+					arg = evaluateExpression(cell->next);
+				}
+			else goto GOT_ARGS;
+			}
+		else goto GOT_ARGS;
+		}
+  else goto GOT_ARGS;
+
+  if(isProtected(symbol->flags))
+    return(errorProcExt(ERR_SYMBOL_PROTECTED, local));
+
+  pushEnvironment(symbol->contents);
+  pushEnvironment((UINT)symbol);
+  symbol->contents = (UINT)copyCell(arg);
+  local = local->next;
+  arg = arg->next;
+  localCount++;
+  }
+goto GET_ARGS;
+
+GOT_ARGS:
+
+pushEnvironment(argsSymbol->contents);
+pushEnvironment((UINT)argsSymbol);
+argsSymbol->contents = (UINT)getCell(CELL_EXPRESSION);
+if(arg != nilCell)
+    ((CELL*)argsSymbol->contents)->contents = (UINT)copyList(arg);
+++localCount;
+
+arg = localLst->next;
+result = nilCell;
+
+while(arg != nilCell)
+	{
+	result = evaluateExpression(arg);
+	arg = arg->next;
+	}
+result = copyCell(result);
+
+while(localCount--)
+	{
+	symbol = (SYMBOL *)popEnvironment();
+	if(isProtected(symbol->flags) && (symbol != argsSymbol))
+		symbol->flags &= ~SYMBOL_PROTECTED;
+	deleteList((CELL *)symbol->contents);
+	symbol->contents = popEnvironment();
+	}
+
+currentContext = contextSave;	
+return(result);
+}
+
+
+/* -------------- list/cell creation/deletion routines ---------------- */
+
+
+CELL * stuffInteger(UINT contents)
+{
+CELL * cell;
+
+cell = getCell(CELL_LONG);
+cell->contents = (UINT) contents;
+return(cell);
+}
+
+#ifndef NEWLISP64
+CELL * stuffInteger64(INT64 contents)
+{
+CELL * cell;
+
+cell = getCell(CELL_INT64);
+*(INT64 *)&cell->aux = contents;
+return(cell);
+}
+#endif
+
+
+CELL * stuffIntegerList(int argc, ...)
+{
+CELL * cell;
+CELL * list;
+va_list ap;
+
+va_start(ap, argc);
+
+list = getCell(CELL_EXPRESSION);
+list->contents = (UINT)stuffInteger(va_arg(ap, UINT));
+cell = (CELL *)list->contents;
+
+while(--argc)
+	{
+	cell->next = stuffInteger(va_arg(ap, UINT));
+	cell = cell->next;
+	}
+va_end(ap);
+
+return(list);
+}
+
+
+CELL * stuffString(char * string)
+{
+CELL * cell;
+
+cell = getCell(CELL_STRING);
+cell->aux = strlen(string) + 1;
+cell->contents = (UINT)allocMemory((UINT)cell->aux);
+memcpy((void *)cell->contents, string, (UINT)cell->aux);
+return(cell);
+}
+
+
+CELL * stuffStringN(char * string, int len)
+{
+CELL * cell;
+
+cell = getCell(CELL_STRING);
+cell->aux = len + 1;
+cell->contents = (UINT)allocMemory((UINT)cell->aux);
+memcpy((void *)cell->contents, string, len);
+*(char*)(cell->contents + len) = 0;
+return(cell);
+}
+
+CELL * stuffFloat(double * floatPtr)
+{
+CELL * cell;
+
+cell = getCell(CELL_FLOAT);
+#ifndef NEWLISP64
+*(double *)&cell->aux = *floatPtr;
+#else
+*(double *)&cell->contents = *floatPtr;
+#endif
+return(cell);
+}
+
+
+CELL * stuffSymbol(SYMBOL * sPtr)
+{
+CELL * cell;
+
+cell = getCell(CELL_SYMBOL);
+cell->contents = (UINT)sPtr;
+return(cell);
+}
+
+ssize_t convertNegativeOffset(ssize_t offset, CELL * list)
+{
+int len=0;
+
+while(list != nilCell)
+	{
+	++len;
+	list = list->next;
+	}
+offset = len + offset;
+if(offset < 0) 
+	errorProc(ERR_LIST_INDEX_OUTOF_BOUNDS);
+return(offset);
+}
+
+/* ------------------------ creating and freeing cells ------------------- */
+
+CELL * getCell(int type)
+{
+CELL * cell;
+
+if(firstFreeCell == NULL) allocBlock();
+cell = firstFreeCell;
+firstFreeCell = cell->next;
+++cellCount;
+
+cell->type = type;
+cell->next = nilCell;
+cell->aux = (UINT)nilCell;
+cell->contents = (UINT)nilCell;
+
+return(cell);
+}
+
+
+CELL * copyCell(CELL * cell)
+{
+CELL * newCell;
+UINT len;
+
+if(firstFreeCell == NULL) allocBlock();
+newCell = firstFreeCell;
+firstFreeCell = newCell->next;
+++cellCount;
+
+newCell->type = cell->type;
+newCell->next = nilCell;
+newCell->aux = cell->aux;
+newCell->contents = cell->contents;
+
+if(isEnvelope(cell->type))
+	{
+	if(cell->type == CELL_ARRAY)
+		newCell->contents = (UINT)copyArray(cell);
+	else
+		{
+		newCell->contents = (UINT)copyList((CELL *)cell->contents);
+		newCell->aux = (UINT)lastCellCopied;  /* last element optimization */
+		}
+	}
+else if(cell->type == CELL_STRING)
+	{
+	newCell->contents = (UINT)allocMemory((UINT)cell->aux);
+	memcpy((void *)newCell->contents, (void*)cell->contents, (UINT)cell->aux);
+	}
+else if(cell->type == CELL_DYN_SYMBOL)
+	{
+	len = strlen((char *)cell->contents);
+	newCell->contents = (UINT)allocMemory(len + 1);
+	memcpy((char *)newCell->contents, (char *)cell->contents, len + 1);
+	}
+
+return(newCell);
+}
+
+
+/* this routine must be called with the list head
+   if copying with envelope call copyCell() instead */
+CELL * copyList(CELL * cell)
+{
+CELL * firstCell;
+CELL * newCell;
+
+if(cell == nilCell || cell == trueCell) return(lastCellCopied = cell);
+firstCell = newCell = copyCell(cell);
+
+while((cell = cell->next) != nilCell)
+	{
+	newCell->next = copyCell(cell);
+	newCell = newCell->next;
+	}
+	
+lastCellCopied = newCell;
+return(firstCell);
+}
+
+
+/* for deleting lists _and_ cells */
+void deleteList(CELL * cell)
+{
+CELL * next;
+
+while(cell != nilCell)
+	{
+	if(isEnvelope(cell->type))
+		{
+		if(cell->type == CELL_ARRAY)
+			deleteArray(cell);
+		else
+			deleteList((CELL *)cell->contents);
+		}
+
+	else if(cell->type == CELL_STRING || cell->type == CELL_DYN_SYMBOL) 
+		freeMemory( (void *)cell->contents);
+
+	next = cell->next;
+	
+	/* free cell */
+	if(cell == trueCell) 
+		{
+		cell = next;
+		continue;
+		}
+
+	cell->type = CELL_FREE;
+	cell->next = firstFreeCell;
+	firstFreeCell = cell;
+	--cellCount;
+	
+	cell = next;
+	}
+}
+
+/* --------------- cell / memory allocation and deallocation ------------- */
+
+CELL * cellMemory = NULL;
+CELL * cellBlock = NULL;
+
+void allocBlock()
+{
+int i;
+
+if(cellCount > MAX_CELL_COUNT) fatalError(ERR_NOT_ENOUGH_MEMORY, NULL, 0);
+
+if(cellMemory == NULL)
+	{
+	cellMemory = (CELL *)allocMemory((MAX_BLOCK + 1) * sizeof(CELL));
+	cellBlock = cellMemory;
+	}
+else
+	{
+	(cellBlock + MAX_BLOCK)->next = 
+		(CELL *)allocMemory((MAX_BLOCK + 1) * sizeof(CELL));
+	cellBlock = (cellBlock + MAX_BLOCK)->next;
+	}
+
+for(i = 0; i < MAX_BLOCK; i++)
+	{
+	(cellBlock + i)->type = CELL_FREE;
+	(cellBlock + i)->next = (cellBlock + i + 1);
+	}
+(cellBlock + MAX_BLOCK - 1)->next = NULL;
+(cellBlock + MAX_BLOCK)->next = NULL;
+firstFreeCell = cellBlock;
+}
+
+
+void * allocMemory(size_t nbytes)
+{
+void * ptr;
+
+if( (ptr = (void *)malloc(nbytes)) == NULL)
+	fatalError(ERR_NOT_ENOUGH_MEMORY, NULL, 0);
+
+return(ptr);
+}
+
+void * callocMemory(size_t nbytes)
+{
+void * ptr;
+
+if( (ptr = (void *)calloc(nbytes, 1)) == NULL)
+	fatalError(ERR_NOT_ENOUGH_MEMORY, NULL, 0);
+
+return(ptr);
+}
+
+void * reallocMemory(void * prevPtr, UINT size)
+{
+void * ptr;
+
+if( (ptr = realloc(prevPtr, size)) == NULL)
+	fatalError(ERR_NOT_ENOUGH_MEMORY, NULL, 0);
+
+return(ptr);
+}
+
+/* ----------- garbage collection , only required on error --------------- */
+
+void markReferences(SYMBOL * sPtr);
+void markList(CELL * cell);
+void sweepGarbage(void);
+void relinkCells(void);
+
+
+void collectGarbage()
+{
+resultStackIdx = 0;
+nilCell->type |= (UINT)0x00008000; 
+markReferences((SYMBOL *)((CELL *)mainContext->contents)->aux);
+sweepGarbage();
+relinkCells();
+}
+
+
+void markReferences(SYMBOL * sPtr)
+{
+CELL * content;
+
+if(sPtr != NIL_SYM && sPtr != NULL)
+	{
+	markReferences(sPtr->left);
+	markList((CELL *)sPtr->contents);
+	if((symbolType(sPtr) & 0xFF) == CELL_CONTEXT && sPtr != mainContext)
+		{
+		content = (CELL *)sPtr->contents;
+		if((SYMBOL*)content->contents != mainContext && (SYMBOL*)content->contents == sPtr)
+			markReferences((SYMBOL *)content->aux);
+		}
+	markReferences(sPtr->right);
+	}
+}
+
+
+void markList(CELL * cell)
+{
+while(cell != nilCell)
+	{
+	cell->type |= (UINT)0x00008000;
+	if(isEnvelope(cell->type & RAW_TYPE_MASK)) 
+		{
+		if((RAW_TYPE_MASK & cell->type) == CELL_ARRAY)
+			markArray(cell);
+		else
+			markList((CELL *)cell->contents);
+		}
+	cell = cell->next;
+	}
+}
+
+
+void sweepGarbage()
+{
+CELL * blockPtr;
+CELL * lastBlockPtr;
+CELL * memPtr;
+int i, freed;
+
+lastBlockPtr = blockPtr = cellMemory;
+while(blockPtr != NULL)
+	{
+	for(i = freed = 0; i < MAX_BLOCK; i++)
+		{
+		if(*(UINT *)blockPtr != CELL_FREE)
+			{
+			if( *(UINT *)blockPtr & (UINT)0x00008000)
+				*(UINT *)blockPtr &= (UINT)0x00007FFF;
+			else 
+				{
+				blockPtr->type = CELL_FREE;
+				--cellCount;
+				freed++;
+				}
+			}
+		else freed++;
+		blockPtr++;
+		}
+	if(freed == MAX_BLOCK)
+		{
+		memPtr = blockPtr->next;
+		freeMemory(lastBlockPtr->next);
+		lastBlockPtr->next = memPtr;
+		blockPtr = memPtr;
+		}
+	else 
+		{
+		lastBlockPtr = blockPtr;
+		blockPtr = blockPtr->next;
+		}
+	}
+}
+
+
+void relinkCells(void)
+{
+CELL * blockPtr;
+CELL * lastFreeCell = NULL;
+int i;
+
+cellBlock = blockPtr = cellMemory;
+firstFreeCell = NULL;
+while(blockPtr != NULL)
+	{
+	cellBlock = blockPtr;
+	for(i = 0; i <  MAX_BLOCK; i++)
+		{
+		if(*(UINT *)blockPtr == CELL_FREE)
+			{
+			if(firstFreeCell == NULL)
+				firstFreeCell = lastFreeCell = blockPtr;
+			else
+				{
+				lastFreeCell->next = blockPtr;
+				lastFreeCell = blockPtr;
+				}
+			}
+		++blockPtr;
+		}
+	blockPtr = blockPtr->next;
+	}
+lastFreeCell->next = NULL;
+}
+
+
+void cleanupResults(int from)
+{
+while(resultStackIdx > from)
+	deleteList(popResult());
+}
+
+/* -------------------------- I/O routines ------------------------------ */
+
+UINT printDevice;
+STREAM errorStream;
+void prettyPrint(UINT device);
+
+void varPrintf(UINT device, char * format, ...)
+{
+char * buffer;
+va_list argptr;
+ 
+va_start(argptr,format);
+
+/* new in 7201 , defined in nl-filesys.c if not in libc */
+vasprintf(&buffer, format, argptr); 
+
+prettyPrintLength += strlen(buffer);
+switch(device)
+	{
+	case OUT_NULL:
+		return;
+	case OUT_DEVICE:
+		if(printDevice != 0)
+			{
+			write(printDevice, buffer, strlen(buffer));
+			break;
+			}
+	case OUT_CONSOLE:
+#ifdef LIBRARY
+		writeStreamStr(&libStrStream, buffer, 0);
+		return;
+#else
+		if(IOchannel == stdin)
+			{
+			printf("%s", buffer);
+			if(!isTTY) fflush(NULL);
+			}
+		else
+			{
+			if(IOchannel != NULL) 
+#ifndef WIN_32
+			fprintf(IOchannel, "%s", buffer);
+#else
+			fprintf(IOchannel, buffer);
+#endif
+			}
+		break;
+#endif
+	case OUT_LOG:
+		writeLog(buffer, 0);
+		break;
+	default:
+		writeStreamStr((STREAM *)device, buffer, 0);
+		break;
+	}
+
+freeMemory(buffer);
+
+va_end(argptr);
+}
+
+
+int printCell(CELL * cell, UINT printFlag, UINT device)
+{
+SYMBOL * sPtr;
+SYMBOL * sp;
+
+switch(cell->type)
+	{
+	case CELL_NIL:
+		varPrintf(device, "nil"); break;
+
+	case CELL_TRUE:
+		varPrintf(device, "true"); break;
+	
+	case CELL_LONG:
+		varPrintf(device,"%ld", cell->contents); break;
+
+#ifndef NEWLISP64
+	case CELL_INT64:
+#ifdef TRU64
+		varPrintf(device,"%ld", *(INT64 *)&cell->aux); break;
+#else
+#ifdef WIN_32
+		varPrintf(device,"%I64d", *(INT64 *)&cell->aux); break;
+#else
+		varPrintf(device,"%lld", *(INT64 *)&cell->aux); break;
+#endif
+#endif
+#endif
+	case CELL_FLOAT:
+#ifndef NEWLISP64
+		varPrintf(device,"%1.10g",*(double *)&cell->aux);
+#else
+		varPrintf(device,"%1.10g",*(double *)&cell->contents);
+#endif
+		break;
+
+	case CELL_STRING:
+		if(printFlag)
+			printString((char *)cell->contents, device, cell->aux - 1);
+		else
+			varPrintf(device,"%s",cell->contents);
+		break;
+	
+	case CELL_SYMBOL:
+	case CELL_CONTEXT:
+		sPtr = (SYMBOL *)cell->contents;
+		if(sPtr->context != currentContext  
+			/* if not global or global overwritten in current context */
+			&& (!(sPtr->flags & SYMBOL_GLOBAL) || (lookupSymbol(sPtr->name, currentContext)))
+			&& (symbolType(sPtr) != CELL_CONTEXT || 
+				(SYMBOL *)((CELL*)sPtr->contents)->contents != sPtr)) /* context var */
+			{
+			varPrintf(device,"%s:%s", (char*)((SYMBOL*)sPtr->context)->name, sPtr->name);
+			break;
+			}
+		/* overwriting global in MAIN */
+		if(sPtr->context == currentContext
+			&& currentContext != mainContext
+			&& ((sp = lookupSymbol(sPtr->name, mainContext)) != NULL)
+			&& (sp->flags & SYMBOL_GLOBAL) )
+			{
+			varPrintf(device,"%s:%s", currentContext->name, sPtr->name);
+			break;
+			}
+
+		varPrintf(device,"%s",sPtr->name);
+		break;
+	
+	case CELL_PRIMITIVE:
+	case CELL_IMPORT_CDECL:
+#ifdef WIN_32
+	case CELL_IMPORT_DLL:
+#endif
+		varPrintf(device,"%s <%lX>", (char *)cell->aux, cell->contents);
+		break;
+	
+	case CELL_QUOTE:
+		varPrintf(device, "'");
+		prettyPrintFlags |= PRETTYPRINT_DOUBLE;
+		printCell((CELL *)cell->contents, printFlag, device);
+		break;
+	
+	case CELL_EXPRESSION:
+	case CELL_LAMBDA:
+	case CELL_MACRO:
+		printExpression(cell, device);
+		break;
+
+	case CELL_DYN_SYMBOL:
+		varPrintf(device, "%s:%s", ((SYMBOL*)cell->aux)->name, (char*)cell->contents);
+		break;                                                                                                                                                                             
+	case CELL_ARRAY:
+		printArray(cell, device);
+		break;
+
+	default:
+		varPrintf(device,"?");
+	}
+
+prettyPrintFlags &= ~PRETTYPRINT_DOUBLE;
+return(1);
+}
+
+
+void printString(char * str, UINT  device, int size)
+{
+char chr;
+
+if(size >= MAX_STRING)
+    {
+    varPrintf(device, "[text]");
+    while(size--) varPrintf(device, "%c", *str++);
+    varPrintf(device, "[/text]");
+    return;
+    }
+
+varPrintf(device,"\"");
+while(size--)
+	{
+	switch(chr = *str++)
+		{
+		case '\n': varPrintf(device,"\\n"); break;
+		case '\r': varPrintf(device,"\\r"); break;
+		case '\t': varPrintf(device,"\\t"); break;
+		case '\\': varPrintf(device,"\\\\"); break;
+		case '"': varPrintf(device,"\\%c",'"'); break;
+		default: 
+			if((unsigned char)chr < 32 || (stringOutputRaw && (unsigned char)chr > 126))
+                            varPrintf(device,"\\%03u", (unsigned char)chr);
+                        else
+			    varPrintf(device,"%c",chr); break;
+		}
+	}
+varPrintf(device,"\"");
+}
+
+
+int printExpression(CELL * cell, UINT device)
+{
+CELL * item;
+int i, pFlags;
+
+item = (CELL *)cell->contents;
+
+
+if(prettyPrintPars <= prettyPrintCurrent || 
+	prettyPrintLength > prettyPrintMaxLength)
+	prettyPrint(device);
+
+if(cell->type == CELL_LAMBDA) 
+	{
+	varPrintf(device, "(lambda ");
+	++prettyPrintPars;
+	}
+else if(cell->type == CELL_MACRO) 
+	{
+	varPrintf(device, "(lambda-macro ");
+	++prettyPrintPars;
+	}
+else 
+	{
+	if(isSymbol(item->type))
+		{
+		if(item->type == CELL_SYMBOL)
+			 pFlags = ((SYMBOL *)item->contents)->flags;
+		else
+			 pFlags = 0;
+
+		if((pFlags & PRINT_TYPE_MASK) != 0)
+			{
+			prettyPrint(device);
+			varPrintf(device, "(");
+			++prettyPrintPars;
+			for(i = 0; i < (pFlags & PRINT_TYPE_MASK); i++)
+				{
+				if(item == nilCell) 
+					{prettyPrintFlags |= PRETTYPRINT_DOUBLE; break;}
+				printCell(item, TRUE, device);
+				item = item->next;
+				if(item != nilCell) varPrintf(device," ");
+				else prettyPrintFlags |= PRETTYPRINT_DOUBLE;
+				}
+			prettyPrint(device);
+			}
+		else 
+			{
+			varPrintf(device, "(");
+			++prettyPrintPars;
+			}
+		}
+	else 
+		{
+		varPrintf(device, "(");
+		++prettyPrintPars;
+		}
+	}
+
+
+while(item != nilCell)
+	{
+	if(prettyPrintLength > prettyPrintMaxLength) prettyPrint(device);
+	if(printCell(item, TRUE, device) == 0) return(0);
+	item = item->next;
+	if(item != nilCell) varPrintf(device," ");
+	}
+
+varPrintf(device,")");
+--prettyPrintPars;
+
+return(TRUE);
+}
+
+
+void prettyPrint(UINT device)
+{
+int i;
+
+if(prettyPrintFlags) return;
+
+if(prettyPrintPars > 0) 
+	varPrintf(device, LINE_FEED);
+/* varPrintf(device, LINE_FEED);  before 7106 */
+
+for(i = 0; i < prettyPrintPars; i++) 
+	varPrintf(device, prettyPrintTab);
+prettyPrintLength = prettyPrintCurrent = prettyPrintPars;
+prettyPrintFlags |= PRETTYPRINT_DOUBLE;
+}
+
+
+void printSymbol(SYMBOL * sPtr, UINT device)
+{
+CELL * cell;
+CELL * list = NULL;
+char * setStr;
+
+prettyPrintCurrent = prettyPrintPars = 1;
+prettyPrintLength = 0;
+prettyPrintFlags &= !PRETTYPRINT_DOUBLE;
+
+if(sPtr->flags & SYMBOL_PROTECTED)
+	setStr = "(constant ";
+else
+	setStr = "(set ";
+
+switch(symbolType(sPtr))
+	{
+	case CELL_PRIMITIVE:
+	case CELL_IMPORT_CDECL:
+#ifdef WIN_32 
+	case CELL_IMPORT_DLL:
+#endif
+		break;
+	case CELL_SYMBOL:
+	case CELL_DYN_SYMBOL:
+		varPrintf(device, setStr);
+		printSymbolNameExt(device, sPtr);
+		varPrintf(device,"'");
+		printCell((CELL *)sPtr->contents, TRUE, device);
+		varPrintf(device, ")");
+		break;
+	case CELL_ARRAY:
+	case CELL_EXPRESSION:
+		varPrintf(device, setStr);
+		printSymbolNameExt(device, sPtr);
+		cell = (CELL *)sPtr->contents;
+
+		if(symbolType(sPtr) == CELL_ARRAY)
+			{
+			varPrintf(device, "(array ");
+			printArrayDimensions(cell, device);
+			varPrintf(device, "(flat ");
+			list = cell = arrayList(cell);
+			}
+
+		cell = (CELL *)cell->contents;
+
+		varPrintf(device,"'(");
+		prettyPrintPars = 2;
+		if(cell->type == CELL_EXPRESSION) prettyPrint(device);
+		while(cell != nilCell)
+			{
+			if(prettyPrintLength > prettyPrintMaxLength) 
+					prettyPrint(device);
+			printCell(cell, TRUE, device);
+			cell = cell->next;
+			if(cell != nilCell) varPrintf(device, " ");
+			}
+		varPrintf(device, "))");
+		if(symbolType(sPtr) == CELL_ARRAY)
+			{
+			deleteList(list);
+			varPrintf(device ,"))");
+			}
+		break;
+	case CELL_LAMBDA:
+	case CELL_MACRO:
+		if(isProtected(sPtr->flags))
+			{
+			varPrintf(device, "%s%s%s", LINE_FEED, LINE_FEED, setStr);
+			printSymbolNameExt(device, sPtr);
+			printExpression((CELL *)sPtr->contents, device);
+			varPrintf(device, ")");
+			}
+		else if (isGlobal(sPtr->flags))
+			{
+			printLambda(sPtr, device);
+			varPrintf(device, "%s%s", LINE_FEED, LINE_FEED);
+			printSymbolNameExt(device, sPtr);
+			}
+		else printLambda(sPtr, device);
+		break;
+	default:
+		varPrintf(device, setStr);
+		printSymbolNameExt(device, sPtr);
+		printCell((CELL *)sPtr->contents, TRUE, device);
+		varPrintf(device, ")");
+		break;
+	}
+
+varPrintf(device, "%s%s", LINE_FEED, LINE_FEED);
+
+prettyPrintLength = prettyPrintPars = 0;
+}
+
+
+void printLambda(SYMBOL * sPtr, UINT device)
+{
+CELL * lambda;
+CELL * cell;
+
+lambda = (CELL *)sPtr->contents;
+cell = (CELL *)lambda->contents;
+if(cell->type == CELL_EXPRESSION)
+	cell = (CELL *)cell->contents;
+
+if(!isLegalSymbol(sPtr->name))
+        {
+        varPrintf(device, "(set (sym ");
+        printString(sPtr->name, device, strlen(sPtr->name));
+        varPrintf(device, " %s) ", ((SYMBOL*)sPtr->context)->name);
+        printExpression((CELL *)sPtr->contents, device);
+        varPrintf(device, ")");
+        return;
+        }
+	
+if(symbolType(sPtr) == CELL_LAMBDA)
+	varPrintf(device, "(define (");
+else 
+	varPrintf(device, "(define-macro (");
+prettyPrintPars += 2;
+
+printSymbolName(device, sPtr);
+varPrintf(device, " ");
+
+while(cell != nilCell)
+	{
+	printCell(cell, TRUE, device);
+	cell = cell->next;
+	if(cell != nilCell) varPrintf(device, " ");
+	}
+varPrintf(device, ")");
+--prettyPrintPars;
+prettyPrint(device);
+
+cell = (CELL *)lambda->contents;
+while((cell = cell->next) != nilCell)
+	{
+	if(prettyPrintLength > prettyPrintMaxLength) prettyPrint(device);
+	printCell(cell, TRUE, device);
+	if(!(cell->type & ENVELOPE_TYPE_MASK) && cell->next != nilCell) varPrintf(device, " ");
+	}
+
+varPrintf(device, ")");
+--prettyPrintPars;
+}
+
+
+void printSymbolName(UINT device, SYMBOL * sPtr)
+{
+SYMBOL * sp;
+
+if(sPtr->context == currentContext)
+	{
+	if(*sPtr->name == *currentContext->name && strcmp(sPtr->name, currentContext->name) == 0)
+		varPrintf(device, "%s:%s", sPtr->name, sPtr->name);
+
+	else if(currentContext != mainContext 
+		&& ((sp = lookupSymbol(sPtr->name, mainContext)) != NULL)
+		&& (sp->flags &  SYMBOL_GLOBAL) )
+		varPrintf(device, "%s:%s", currentContext->name, sPtr->name);
+	else
+		varPrintf(device,"%s", sPtr->name);
+	}
+else
+	varPrintf(device,"%s:%s", 
+		(char *)((SYMBOL*)sPtr->context)->name, sPtr->name);
+}
+
+
+void printSymbolNameExt(UINT device, SYMBOL * sPtr)
+{
+if(isGlobal(sPtr->flags))
+	{
+	varPrintf(device, "(global '");
+	printSymbolName(device, sPtr);
+	if(symbolType(sPtr) == CELL_LAMBDA || symbolType(sPtr) == CELL_MACRO)
+		varPrintf(device, ")");
+	else varPrintf(device, ") ");
+	}
+else 
+	{
+	if(!isLegalSymbol(sPtr->name))
+		{
+		varPrintf(device, " (sym ");
+		printString(sPtr->name, device, strlen(sPtr->name));
+		varPrintf(device, " %s) ", ((SYMBOL*)sPtr->context)->name);
+		}
+	else
+		{
+		varPrintf(device, "'");
+		printSymbolName(device, sPtr);
+		}
+	varPrintf(device, " ");
+	}
+}
+
+
+CELL * p_prettyPrint(CELL * params)
+{
+CELL * result;
+char * str;
+size_t len;
+
+if(params != nilCell)
+	params = getInteger(params, &prettyPrintMaxLength);
+if(params != nilCell)
+	{
+	getStringSize(params, &str, &len, TRUE);
+	prettyPrintTab = allocMemory(len + 1);
+	memcpy(prettyPrintTab, str, len + 1);
+	}
+
+result = getCell(CELL_EXPRESSION);
+result->contents = (UINT)stuffInteger(prettyPrintMaxLength);
+((CELL *)result->contents)->next = stuffString(prettyPrintTab);
+
+return(result);
+}
+
+
+
+/* -------------------------- error handling --------------------------- */
+
+char * errorMessage[] =
+	{
+	"",                             /* 0 */
+	"not enough memory",            /* 1 */
+	"environment stack overflow",   /* 2 */
+	"call stack overflow",          /* 3 */
+	"problem accessing file",       /* 4 */
+	"not an expression",            /* 5 */
+	"missing parenthesis",          /* 6 */
+	"string token too long",        /* 7 */
+	"missing argument",             /* 8 */
+	"number or string expected",    /* 9 */
+	"value expected",               /* 10 */
+	"string expected",              /* 11 */
+	"symbol expected",              /* 12 */
+	"context expected",             /* 13 */
+	"symbol or context expected",   /* 14 */
+	"list expected",                /* 15 */
+	"list or array expected",       /* 15 */
+	"list or symbol expected",      /* 17 */
+	"list or string expected",      /* 18 */
+	"list or number expected",      /* 19 */
+	"array expected",               /* 20 */
+	"array, list or string expected", /* 21 */
+	"lambda expected",              /* 22 */
+	"lambda-macro expected",        /* 23 */
+	"invalid function",             /* 24 */
+	"invalid lambda expression",    /* 25 */
+	"invalid macro expression",     /* 26 */
+	"invalid let parameter list",   /* 27 */
+	"problem saving file",          /* 28 */
+	"division by zero",             /* 29 */
+	"matrix expected",              /* 30 */ 
+	"wrong dimensions",             /* 31 */
+	"matrix is singular",           /* 32 */
+	"syntax in regular expression", /* 33 */
+	"throw without catch",			/* 34 */
+	"problem loading library",      /* 35 */
+	"import function not found",    /* 36 */
+	"symbol is protected",          /* 37 */
+	"number out of range",          /* 38 */
+	"regular expression",           /* 39 */
+	"missing end of text [/text]",  /* 40 */
+	"mismatch in number of arguments",  /* 41 */
+	"problem in format string",     /* 42 */
+	"data type and format don't match", /* 43 */
+	"invalid parameter",			/* 44 */
+	"invalid parameter: 0.0",	 	/* 45 */
+	"invalid parameter: NaN",	 	/* 46 */
+	"illegal parameter type",	 	/* 47 */
+	"symbol not in MAIN context",	/* 48 */
+	"symbol not in current context", /* 49 */
+	"target cannot be MAIN",		/* 50 */
+	"list index out of bounds",		/* 51 */
+	"array index out of bounds",	/* 52 */
+	"string index out of bounds",	/* 53 */
+	"nesting level to deep",		/* 54 */
+	"invalid syntax",               /* 55 */
+	"user error",	                /* 56 */
+	"user reset -",		 	 		/* 57 */
+	"received SIGINT -",		 	/* 58 */
+	"function is not reentrant"		/* 59 */
+	};
+
+
+void errorMissingPar(STREAM * stream)
+{
+char str[64]; 
+snprintf(str, 40, "...%-40s", ((char *)((stream->ptr - stream->buffer) > 40 ? stream->ptr - 40 : stream->buffer)));
+errorProcExt2(ERR_MISSING_PAR, stuffString(str));
+}
+
+CELL * errorProcAll(int errorNumber, CELL * expr, int deleteFlag)
+{
+if(!traceFlag) fatalError(errorNumber, expr, deleteFlag);
+printErrorMessage(errorNumber, expr, deleteFlag);
+openTrace();
+return(nilCell);
+}
+
+CELL * errorProc(int errorNumber)
+{
+return(errorProcAll(errorNumber, NULL, 0));
+}
+
+/* extended error info in expr */
+CELL * errorProcExt(int errorNumber, CELL * expr)
+{
+return(errorProcAll(errorNumber, expr, 0));
+}
+
+/* extended error info in expr, which has to be discarded after printing */
+CELL * errorProcExt2(int errorNumber, CELL * expr)
+{
+return(errorProcAll(errorNumber, expr, 1));
+}
+
+CELL * errorProcArgs(int errorNumber, CELL * expr)
+{
+if(expr == nilCell) 
+	return(errorProcExt(ERR_MISSING_ARGUMENT, NULL));
+
+return(errorProcExt(errorNumber, expr));
+}
+
+void fatalError(int errorNumber, CELL * expr, int deleteFlag)
+{
+printErrorMessage(errorNumber, expr, deleteFlag);
+closeTrace();
+longjmp(errorJump, errorReg);
+}
+
+
+void printErrorMessage(UINT errorNumber, CELL * expr, int deleteFlag)
+{
+CELL * lambdaFunc;
+UINT lambdaStackIdxSave;
+SYMBOL * context;
+int i;
+
+if(errorNumber == EXCEPTION_THROW)
+	errorNumber = ERR_THROW_WO_CATCH;
+
+errorReg = errorNumber;
+
+if(!errorNumber) return;
+
+openStrStream(&errorStream, MAX_STRING, 1);
+if(traceFlag & ~TRACE_SIGINT) writeStreamStr(&errorStream, "ERR:", 4);
+writeStreamStr(&errorStream, errorMessage[errorReg], 0);
+
+for(i = 0; primitive[i].name != NULL; i++)
+	{
+	if(evalFunc == primitive[i].function)
+		{
+		writeStreamStr(&errorStream, " in function ", 0);
+		writeStreamStr(&errorStream, primitive[i].name, 0);
+		break;
+		}
+	}
+
+if(expr != NULL)
+	{
+	writeStreamStr(&errorStream, " : ", 3);
+	printCell(expr, (errorNumber != ERR_USER_ERROR), (UINT)&errorStream);
+	if(deleteFlag) deleteList(expr);
+	}
+
+lambdaStackIdxSave = lambdaStackIdx;
+while(lambdaStackIdx)
+	{
+	lambdaFunc = popLambda();
+	if(lambdaFunc->type == CELL_SYMBOL)
+		{
+		writeStreamStr(&errorStream, LINE_FEED, 0);
+		writeStreamStr(&errorStream, "called from user defined function ", 0);
+		context = ((SYMBOL *)lambdaFunc->contents)->context;
+		if(context != mainContext)
+		  {
+		  writeStreamStr(&errorStream, context->name, 0);
+		  writeStreamStr(&errorStream, ":", 0);
+		  }
+		writeStreamStr(&errorStream, ((SYMBOL *)lambdaFunc->contents)->name, 0);
+		}
+	}
+lambdaStackIdx = lambdaStackIdxSave;
+
+
+if(!(traceFlag & TRACE_SIGINT)) evalFunc = NULL; 
+parStackCounter = prettyPrintPars = 0;
+
+if(evalCatchFlag && !(traceFlag & TRACE_SIGINT)) return;
+
+if(errorEvent == nilSymbol)
+	{
+	if(errorNumber == ERR_SIGINT)
+		printf(errorStream.buffer);
+	else
+		varPrintf(OUT_CONSOLE, "\n%.1024s\n", errorStream.buffer);
+	}
+}
+
+
+/* --------------------------- load source file ------------------------- */
+
+
+CELL * loadFile(char * fileName, UINT offset, int encryptFlag, SYMBOL * context)
+{
+CELL * result;
+STREAM stream;
+int errNo, dataLen;
+jmp_buf errorJumpSave;
+SYMBOL * contextSave;
+char key[16];
+#ifdef LOAD_DEBUG
+int i;
+#endif
+
+contextSave = currentContext;
+currentContext = context;
+if(encryptFlag)
+	{
+	dataLen = *((int *) (linkOffset + 4));
+	snprintf( key, 15, "%d", dataLen);
+	}
+else dataLen = MAX_FILE_BUFFER;
+
+if(my_strnicmp(fileName, "http://", 7) == 0)
+	{
+	result = getPutPostDeleteUrl(fileName, nilCell, HTTP_GET_URL, 60000);
+	pushResult(result);
+	if(memcmp((char *)result->contents, "ERR:", 4) == 0)
+		return(errorProcExt2(ERR_ACCESSING_FILE, stuffString((char *)result->contents)));
+	return(copyCell(sysEvalString((char *)result->contents, nilCell, context)));
+	}
+
+if(my_strnicmp(fileName, "file://", 7) == 0)
+	fileName = fileName + 7;
+	
+if(makeStreamFromFile(&stream, fileName, dataLen + 4 * MAX_STRING, offset) == 0) 
+	return(NULL);
+
+if(encryptFlag)
+	encryptPad(stream.buffer, stream.buffer, key, dataLen, strlen(key));
+
+memcpy(errorJumpSave, errorJump, sizeof(jmp_buf));
+if((errNo = setjmp(errorJump)) != 0)
+	{
+	closeStrStream(&stream);
+	memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+	currentContext = contextSave;
+	longjmp(errorJump, errNo);
+	}
+	
+#ifdef LOAD_DEBUG
+for(i = 0; i<recursionCount; i++) printf("  ");	
+printf("load: %s\n", fileName);
+#endif
+
+result = evaluateStream(&stream, 0, TRUE);
+currentContext = contextSave;
+
+#ifdef LOAD_DEBUG
+for(i = 0; i<recursionCount; i++) printf("  ");	
+printf("finish load: %s\n", fileName);
+#endif
+
+memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+closeStrStream(&stream);
+return(result);
+}
+
+/* -------------------------- parse / compile ----------------------------- */
+
+
+int compileExpression(STREAM * stream, CELL * cell)
+{
+char token[MAX_STRING + 4];
+double floatNumber;
+CELL * newCell;
+CELL * contextCell;
+SYMBOL * contextPtr;
+int listFlag, tklen;
+char * lastPtr;
+#if experimental
+SYMBOL * saveContext;
+int defaultSymbolLevel = 0;
+
+saveContext = currentContext;
+#endif
+
+listFlag = TRUE; /* assumes we just entered from an envelope cell ! */
+
+GETNEXT:
+lastPtr = stream->ptr;
+switch(getToken(stream, token, &tklen))
+	{
+	case TKN_ERROR:
+		errorProcExt2(ERR_EXPRESSION, stuffStringN(lastPtr, 
+			(strlen(lastPtr) < 60) ? strlen(lastPtr) : 60));
+		return(0);
+
+	case TKN_EMPTY:
+		if(parStackCounter != 0) errorMissingPar(stream);
+		return(0);
+
+	case TKN_CHARACTER:
+		newCell = stuffInteger((UINT)token[0]);
+		break;
+
+	case TKN_HEX:
+#ifndef NEWLISP64
+		newCell = stuffInteger64((INT64)strtoull(token,NULL,0));
+#else
+		newCell = stuffInteger(strtoull(token,NULL,0));
+#endif
+		break;
+
+	case TKN_DECIMAL:
+#ifndef NEWLISP64
+		newCell = stuffInteger64(strtoll(token,NULL,0));
+#else
+		newCell = stuffInteger(strtoll(token,NULL,0));
+#endif
+		break;
+
+	case TKN_FLOAT:
+		floatNumber = (double)atof(token);
+		newCell = stuffFloat(&floatNumber);
+		break;
+
+	case TKN_STRING:
+		newCell = stuffStringN(token, tklen);
+		break;
+
+	case TKN_SYMBOL:
+		if(strcmp(token, "lambda") == 0 || strcmp(token, "fn") == 0)
+			{
+			if(cell->type != CELL_EXPRESSION)
+				{
+				errorProcExt2(ERR_INVALID_LAMBDA, stuffString(lastPtr));
+				return(0);
+				}
+			cell->type =  CELL_LAMBDA;
+			cell->aux = (UINT)nilCell;
+			goto GETNEXT;
+			}
+		else if(strcmp(token, "lambda-macro") == 0 || strcmp(token, "fn-macro") == 0)
+			{
+			if(cell->type != CELL_EXPRESSION)
+				{
+				errorProcExt2(ERR_INVALID_LAMBDA, stuffString(lastPtr));
+				return(0);
+				}
+			cell->type =  CELL_MACRO;
+			cell->aux = (UINT)nilCell;
+			goto GETNEXT;
+			}
+
+		else if(strncmp(token, "[text]", 6) == 0) 
+			{
+			newCell = getCell(CELL_STRING);
+			newCell->contents =  (UINT)readStreamText(stream, "[/text]");
+            if(newCell->contents == 0)
+				{
+				deleteList(newCell); 
+				errorProc(ERR_MISSING_TEXT_END);
+				}
+			newCell->aux = strlen((char *)newCell->contents) + 1;
+			newCell->type = CELL_STRING;
+			break;
+			}
+		newCell = getCell(CELL_SYMBOL);
+		if(*token == '$')
+			newCell->contents = (UINT)translateCreateSymbol(
+				token, CELL_NIL, mainContext, TRUE);
+		else
+			newCell->contents = (UINT)translateCreateSymbol(
+				token, CELL_NIL, currentContext, 0);
+		break;
+
+	case TKN_CONTEXT:
+		contextPtr = NULL; /* since 7.5.1 dyna vars inside contexts */
+		if(currentContext != mainContext)
+			{
+			if(strcmp(currentContext->name, token) == 0)
+				contextPtr = currentContext;
+			else
+				contextPtr = lookupSymbol(token, currentContext);
+			}
+
+		if(contextPtr == NULL)
+			{
+			contextPtr = translateCreateSymbol(
+				token, CELL_CONTEXT, mainContext, TRUE);
+			}
+
+		contextCell = (CELL *)contextPtr->contents;
+
+		if(getToken(stream, token, &tklen) != TKN_SYMBOL)
+			errorProcExt2(ERR_SYMBOL_EXPECTED, stuffString(lastPtr));
+
+		/* context does not exist */
+		if(contextCell->type != CELL_CONTEXT 
+		   || contextPtr != (SYMBOL*)contextCell->contents)
+			{
+			newCell = getCell(CELL_DYN_SYMBOL);
+			newCell->aux = (UINT)contextPtr;
+			newCell->contents = (UINT)allocMemory(tklen + 1);
+			strncpy((char *)newCell->contents, token, tklen + 1);
+			break;
+			}
+
+		/* context exists make a symbol for it */
+		newCell = getCell(CELL_SYMBOL);
+		newCell->contents = (UINT)translateCreateSymbol(
+				token, CELL_NIL, contextPtr, TRUE);
+		break;
+
+	case TKN_QUOTE:
+		newCell = getCell(CELL_QUOTE);
+		linkCell(cell, newCell, listFlag);
+		compileExpression(stream, newCell);
+		break;
+
+	case TKN_LEFT_PAR:
+		++parStackCounter;
+		newCell = getCell(CELL_EXPRESSION);
+		linkCell(cell, newCell, listFlag);
+		compileExpression(stream, newCell);
+		break;
+
+	case TKN_RIGHT_PAR:
+		if(parStackCounter == 0) errorMissingPar(stream);
+		--parStackCounter;
+		cell->next = nilCell;
+		return(TRUE);
+
+	default:
+		errorProcExt2(ERR_EXPRESSION, stuffString(lastPtr));
+		return(0);
+
+	}
+
+linkCell(cell, newCell, listFlag);
+
+if(cell->type == CELL_QUOTE && listFlag == TRUE)
+	return(TRUE);
+
+listFlag = 0;
+cell = newCell;
+
+if(parStackCounter != 0)
+	{
+	if(*(stream->ptr) != 0) goto GETNEXT;
+	else errorMissingPar(stream);
+	}
+
+return(0);
+}
+
+
+void linkCell(CELL * left, CELL * right, int linkFlag)
+{
+if(linkFlag == 0)
+	left->next = right;
+else left->contents = (UINT)right;
+}
+
+int getToken(STREAM * stream, char * token, int * ptr_len)
+{
+char *tkn;
+char chr;
+int tknLen;
+int floatFlag;
+int bracketBalance;
+char buff[4];
+
+tkn = token;
+tknLen = floatFlag = 0;
+*tkn = 0;
+
+STRIP:
+if(stream->ptr > (stream->buffer + stream->size - 4 * MAX_STRING))
+	{
+	if(stream->handle == 0)
+		{
+        /* coming from commmand line or p_evalString */
+		stream->buffer = stream->ptr;
+		}
+	else
+		{
+		stream->position += (stream->ptr - stream->buffer);
+        		lseek((int)stream->handle, stream->position, SEEK_SET);
+		memset(stream->buffer, 0, stream->size + 1);
+
+		if(read(stream->handle, stream->buffer, stream->size) > 0)
+
+	       	stream->ptr = stream->buffer;
+		else
+			{
+			*stream->ptr = 0;
+			return(TKN_EMPTY);
+			}
+		}
+	}
+
+while((unsigned char)*stream->ptr <= ' ' && (unsigned char)*stream->ptr != 0)
+	++stream->ptr;
+
+if(*stream->ptr == 0) return(TKN_EMPTY);
+
+/* check for comments */
+if(*stream->ptr == ';' || *stream->ptr == '#')
+	{
+	stream->ptr++;
+	for(;;)
+		{
+		if(*stream->ptr == 0) return(TKN_EMPTY);
+		if(*stream->ptr == '\n' || *stream->ptr == '\r')
+			break;
+		stream->ptr++;
+		}
+	stream->ptr++;
+	goto STRIP;
+	}
+
+
+if( *stream->ptr == '-' || *stream->ptr == '+')
+	{
+	if(isDigit((unsigned char)*(stream->ptr + 1)) )
+		*(tkn++) = *(stream->ptr++), tknLen++;
+	}
+
+	
+if(isDigit((unsigned char)*stream->ptr) || 
+                (*stream->ptr == lc_decimal_point && 
+                isDigit((unsigned char)*(stream->ptr + 1))))
+	{
+	if(*stream->ptr == '0' && isDigit((unsigned char)*(stream->ptr + 1)))
+		{
+		*(tkn++) = *(stream->ptr++), tknLen++;
+		while(*stream->ptr < '8' && *stream->ptr >= '0' && *stream->ptr != 0)
+			*(tkn++) = *(stream->ptr++), tknLen++;
+		*tkn = 0;
+		return(TKN_DECIMAL);
+		}
+		
+	while(isDigit((unsigned char)*stream->ptr) && tknLen < MAX_SYMBOL)
+		*(tkn++) = *(stream->ptr++), tknLen++;
+	
+	if(toupper(*stream->ptr) == 'X' && token[0] == '0')
+		{
+		*(tkn++) = *(stream->ptr++), tknLen++;
+		while(isxdigit((unsigned char)*stream->ptr) && tknLen < MAX_SYMBOL)
+			*(tkn++) = *(stream->ptr++), tknLen++;
+		*tkn = 0;
+		return(TKN_HEX);
+		}
+
+	if(*stream->ptr == lc_decimal_point)
+		{
+		*(tkn++) = *(stream->ptr++), tknLen++;
+		while(isDigit((unsigned char)*stream->ptr) && tknLen < MAX_SYMBOL)
+			*(tkn++) = *(stream->ptr++), tknLen++;
+		floatFlag = TRUE;
+		}
+	else if(toupper(*stream->ptr) != 'E')
+		{
+		*tkn = 0;
+		return(TKN_DECIMAL);
+		}
+	
+	if(toupper(*stream->ptr) == 'E') 
+		{
+		if(isDigit((unsigned char)*(stream->ptr+2))
+		&& ( *(stream->ptr+1) == '-' || *(stream->ptr+1) == '+') )
+			*(tkn++) = *(stream->ptr++), tknLen++;
+		if(isDigit((unsigned char)*(stream->ptr+1)))
+			{
+			*(tkn++) = *(stream->ptr++), tknLen++;
+			while(isDigit((unsigned char)*stream->ptr) && tknLen < MAX_SYMBOL)
+				*(tkn++) = *(stream->ptr++), tknLen++;
+			}
+		else 
+			{
+			*tkn = 0;
+			if(floatFlag == TRUE) return(TKN_FLOAT);
+			else return(TKN_DECIMAL);
+			}
+		}
+	*tkn = 0;
+	return(TKN_FLOAT);
+	}
+else
+	{
+	chr = *stream->ptr;
+	*(tkn++) = *(stream->ptr++), tknLen++;
+	switch(chr)
+	 {
+	 case '"':
+		--tkn; --tknLen;
+		while(*stream->ptr != '"' && *stream->ptr != 0 
+					  && tknLen < MAX_STRING) 
+ 			{
+			if(*stream->ptr == '\\')
+				{
+				stream->ptr++;
+				if(isDigit((unsigned char)*stream->ptr) && 
+				          isDigit((unsigned char)*(stream->ptr+1)) && 
+				          isDigit((unsigned char)*(stream->ptr+2)))
+					{
+					memcpy(buff, stream->ptr, 3);
+					buff[3] = 0;
+					*(tkn++) = atoi(buff);
+                    tknLen++;
+					stream->ptr += 3;
+					continue;
+					}
+
+				switch(*stream->ptr)
+					{
+					case 0:
+						goto SRING_TO_LONG_ERROR;
+					    break;
+					case 'n':
+					    *(tkn++) = '\n'; break;
+					case '\\':
+					    *(tkn++) = '\\'; break;
+					case 'r':
+					    *(tkn++) = '\r'; break;
+					case 't':
+					    *(tkn++) = '\t'; break;
+					case '"':
+					    *(tkn++) = '"';  break;
+					case 'x':
+						if(isxdigit((unsigned char)*(stream->ptr + 1)) &&
+						   isxdigit((unsigned char)*(stream->ptr + 2)))
+							{
+							buff[0] = '0';
+							buff[1] = (unsigned char)*(stream->ptr + 1);
+							buff[2] = (unsigned char)*(stream->ptr + 2);
+							buff[3] = 0;
+							*(tkn++) = strtol(buff, NULL, 16);
+							stream->ptr += 2;
+							break;
+							}
+					default:
+					    *(tkn++) = *stream->ptr;
+					}
+				stream->ptr++;
+                tknLen++;
+				}
+			else *(tkn++) = *(stream->ptr++), tknLen++;
+			}
+		if(*stream->ptr == '\"')
+			{
+			*tkn = 0;
+			stream->ptr++;
+			*ptr_len = tknLen;
+			return(TKN_STRING);
+			}
+		else
+			{
+			goto SRING_TO_LONG_ERROR;
+			}
+		break;
+
+	 case '\'':
+	 case '(':
+	 case ')':
+		*tkn = 0;
+		return(chr);
+	 case '{':
+		--tkn; --tknLen;
+		bracketBalance = 1;
+		while(*stream->ptr != 0  && tknLen < MAX_STRING) 
+ 			{
+			if(*stream->ptr == '{') ++bracketBalance;
+			if(*stream->ptr == '}') --bracketBalance;
+			if(bracketBalance == 0) break;
+			*(tkn++) = *(stream->ptr++), tknLen++;
+			}
+		if(*stream->ptr == '}')
+			{
+			*tkn = 0;
+			stream->ptr++;
+                        *ptr_len = tknLen;
+			return(TKN_STRING);
+			}
+		else
+			{
+			goto SRING_TO_LONG_ERROR;
+			}
+		break;
+
+		
+	 case ',':
+	 case ':':
+		*tkn = 0;
+		return(TKN_SYMBOL);
+
+         case '[':
+                while( tknLen < MAX_SYMBOL && *stream->ptr != 0 && *stream->ptr != ']')
+                   *(tkn++) = *(stream->ptr++), tknLen++;
+                *tkn++ = ']';
+                *tkn = 0;
+                stream->ptr++;
+
+                return(TKN_SYMBOL);
+
+	 default:
+		while(  tknLen < MAX_SYMBOL
+			&& (unsigned char)*stream->ptr > ' ' 
+			&& *stream->ptr != '"' && *stream->ptr != '\''
+			&& *stream->ptr != '(' && *stream->ptr != ')'
+			&& *stream->ptr != ':' && *stream->ptr != ','
+                        && *stream->ptr != 0)
+				*(tkn++) = *(stream->ptr++), tknLen++;
+		*tkn = 0;
+                *ptr_len = tknLen;
+		if(*stream->ptr == ':') 
+			{
+			stream->ptr++;
+			return(TKN_CONTEXT);
+			}
+		return(TKN_SYMBOL);
+	 }
+	}
+*tkn=0;
+return(TKN_ERROR);
+
+SRING_TO_LONG_ERROR:
+*tkn = 0;
+errorProcExt2(ERR_STRING_TOO_LONG, 
+	stuffStringN(token, strlen(token) < 40 ? strlen(token) : 40));
+return(TKN_ERROR);
+}
+
+/* -------------------------- utilities ------------------------------------ */
+
+size_t listlen(CELL * listHead)
+{
+size_t len = 0;
+
+while(listHead != nilCell)
+  {
+  len++;
+  listHead = listHead->next;
+  }
+  
+return(len);
+}
+
+/* -------------------------- functions to get parameters ------------------ */
+
+void collectSymbols(SYMBOL * sPtr);
+
+int getFlag(CELL * params)
+{
+params = evaluateExpression(params);
+return(!isNil(params));
+}
+
+CELL * getInteger(CELL * params, UINT * number)
+{
+CELL * cell;
+	
+cell = evaluateExpression(params);
+
+#ifndef NEWLISP64
+if(cell->type == CELL_INT64)
+	{
+	if(*(INT64 *)&cell->aux >  0xFFFFFFFF) *number = 0xFFFFFFFF;
+	else if(*(INT64 *)&cell->aux < INT32_MIN_AS_INT64) *number = 0x80000000;
+	else *number = *(INT64 *)&cell->aux;
+	}
+else if(cell->type == CELL_LONG)
+	*number = cell->contents;
+else if(cell->type == CELL_FLOAT)
+	{
+#ifdef WIN_32
+	if(isnan(*(double *)&cell->aux) || !_finite(*(double *)&cell->aux)) *number = 0;
+#else
+	if(isnan(*(double *)&cell->aux)) *number = 0; 
+#endif
+	else if(*(double *)&cell->aux >  4294967295.0) *number = 0xFFFFFFFF;
+	else if(*(double *)&cell->aux < -2147483648.0) *number = 0x80000000;
+	else *number = *(double *)&cell->aux;
+	}
+#else
+if(cell->type == CELL_LONG)
+    *number = cell->contents;
+else if(cell->type == CELL_FLOAT)
+    {
+    if(isnan(*(double *)&cell->contents)) *number = 0;
+    else if(*(double *)&cell->contents >  9223372036854775807.0) *number = 0x7FFFFFFFFFFFFFFFLL;
+    else if(*(double *)&cell->contents < -9223372036854775808.0) *number = 0x8000000000000000LL;
+    else *number = *(double *)&cell->contents;
+    }
+#endif
+else
+	{
+	*number = 0;
+	return(errorProcArgs(ERR_NUMBER_EXPECTED, params));
+	}
+
+return(params->next);
+}
+
+#ifndef NEWLISP64
+CELL * getInteger64(CELL * params, INT64 * number)
+{
+CELL * cell;
+	
+cell = evaluateExpression(params);
+
+if(cell->type == CELL_INT64)
+	*number = *(INT64 *)&cell->aux;
+else if(cell->type == CELL_LONG)
+	*number = (int)cell->contents;
+else if(cell->type == CELL_FLOAT)
+	{
+#ifdef WIN_32
+	if(isnan(*(double *)&cell->aux) || !_finite(*(double *)&cell->aux)) *number = 0;
+#else
+	if(isnan(*(double *)&cell->aux)) *number = 0; 
+#endif
+	else if(*(double *)&cell->aux >  9223372036854775807.0) *number = 0x7FFFFFFFFFFFFFFFLL;
+	else if(*(double *)&cell->aux < -9223372036854775808.0) *number = 0x8000000000000000LL;
+	else *number = *(double *)&cell->aux;
+	}
+else
+	{
+	*number = 0;
+	return(errorProcArgs(ERR_NUMBER_EXPECTED, params));
+	}
+
+return(params->next);
+}
+
+#else
+CELL * getInteger64(CELL * params, INT64 * number)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+
+if(cell->type == CELL_LONG)
+    *number = cell->contents;
+else if(cell->type == CELL_FLOAT)
+    {
+    if(isnan(*(double *)&cell->contents)) *number = 0;
+    else if(*(double *)&cell->contents >  9223372036854775807.0) *number = 0x7FFFFFFFFFFFFFFFLL;
+    else if(*(double *)&cell->contents < -9223372036854775808.0) *number = 0x8000000000000000LL;
+    else *number = *(double *)&cell->contents;
+    }
+else
+    {
+    *number = 0;
+    return(errorProcArgs(ERR_NUMBER_EXPECTED, params));
+    }
+
+return(params->next);
+}
+#endif
+
+CELL * getIntegerExt(CELL * params, UINT * number, int evalFlag)
+{
+CELL * cell;
+
+if(evalFlag)
+	cell = evaluateExpression(params);
+else cell = params;
+
+#ifndef NEWLISP64
+if(cell->type == CELL_INT64)
+	{
+	if(*(INT64 *)&cell->aux >  0xFFFFFFFF) *number = 0xFFFFFFFF;
+	else if(*(INT64 *)&cell->aux < INT32_MIN_AS_INT64) *number = 0x80000000;
+	else *number = *(INT64 *)&cell->aux;
+	}
+else if(cell->type == CELL_LONG)
+	*number = cell->contents;
+else if(cell->type == CELL_FLOAT)
+	{
+#ifdef WIN_32
+	if(isnan(*(double *)&cell->aux) || !_finite(*(double *)&cell->aux)) *number = 0;
+#else
+	if(isnan(*(double *)&cell->aux)) *number = 0; 
+#endif
+	else if(*(double *)&cell->aux >  4294967295.0) *number = 0xFFFFFFFF;
+	else if(*(double *)&cell->aux < -2147483648.0) *number = 0x80000000;
+	else *number = *(double *)&cell->aux;
+	}
+#else
+if(cell->type == CELL_LONG)
+    *number = cell->contents;
+else if(cell->type == CELL_FLOAT)
+    {
+    if(isnan(*(double *)&cell->contents)) *number = 0;
+    else if(*(double *)&cell->contents >  9223372036854775807.0) *number = 0x7FFFFFFFFFFFFFFFLL;
+    else if(*(double *)&cell->contents < -9223372036854775808.0) *number = 0x8000000000000000LL;
+    else *number = *(double *)&cell->contents;
+    }
+#endif
+else
+	{
+	*number = 0;
+	return(errorProcArgs(ERR_NUMBER_EXPECTED, params));
+	}
+
+return(params->next);
+}
+
+
+CELL * getFloat(CELL * params, double * floatNumber)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+
+#ifndef NEWLISP64
+if(cell->type == CELL_FLOAT)
+	*floatNumber = *(double *)&cell->aux;
+else if(cell->type == CELL_INT64)
+	*floatNumber = *(INT64 *)&cell->aux;
+#else
+if(cell->type == CELL_FLOAT)
+    *floatNumber = *(double *)&cell->contents;
+#endif
+else if(cell->type == CELL_LONG)
+	*floatNumber = (long)cell->contents;
+else
+	{
+	*floatNumber = 0.0;
+	return(errorProcArgs(ERR_NUMBER_EXPECTED, params));
+	}
+
+return(params->next);
+}
+
+
+CELL * getString(CELL * params, char * * stringPtr)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+
+if(cell->type != CELL_STRING)
+	{
+	*stringPtr = "";
+	return(errorProcArgs(ERR_STRING_EXPECTED, params));
+	}
+*stringPtr = (char *)cell->contents;
+return(params->next);
+}
+
+
+CELL * getStringSize(CELL * params, char * * stringPtr, size_t * size, int evalFlag)
+{
+CELL * cell;
+
+if(params == nilCell)
+	return(errorProc(ERR_MISSING_ARGUMENT));
+
+if(evalFlag)
+	cell = evaluateExpression(params);
+else cell = params;
+
+if(cell->type != CELL_STRING)
+	{
+	*stringPtr = "";
+	return(errorProcArgs(ERR_STRING_EXPECTED, params));
+	}
+
+*stringPtr = (char *)cell->contents;
+if(size) *size = cell->aux - 1;
+return(params->next);
+}
+
+
+CELL * getSymbol(CELL * params, SYMBOL * * symbol)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+
+if(cell->type != CELL_SYMBOL)
+	{
+	if(cell->type == CELL_DYN_SYMBOL)
+		{
+		*symbol = getDynamicSymbol(cell);
+		return(params->next);
+		}
+	*symbol = nilSymbol;
+	return(errorProcArgs(ERR_SYMBOL_EXPECTED, params));
+	}
+
+*symbol = (SYMBOL *)cell->contents;
+return(params->next);
+}
+
+/* only used for internal syms: $timer, $error-event and $signal-1-> $signal-32 */
+CELL * getCreateSymbol(CELL * params, SYMBOL * * symbol, char * name)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+
+if(cell->type != CELL_SYMBOL)
+    {
+    if(cell->type == CELL_DYN_SYMBOL)
+        {
+        *symbol = getDynamicSymbol(cell);
+        return(params->next);
+        }
+	*symbol = translateCreateSymbol(name, CELL_NIL, mainContext, TRUE);
+    (*symbol)->flags |= SYMBOL_PROTECTED | SYMBOL_GLOBAL;
+	(*symbol)->contents = (UINT)copyCell(cell);
+    }
+else
+	*symbol = (SYMBOL *)cell->contents;
+
+return(params->next);
+}
+
+
+CELL * getContext(CELL * params, SYMBOL * * context)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+
+if(cell->type == CELL_CONTEXT || cell->type == CELL_SYMBOL)
+	*context = (SYMBOL *)cell->contents;
+else	
+	{
+	*context = NULL;
+	return(errorProcArgs(ERR_CONTEXT_EXPECTED, params));
+	}
+
+if(symbolType(*context) != CELL_CONTEXT)
+	return(errorProcExt(ERR_CONTEXT_EXPECTED, params));
+
+return(params->next);
+}
+
+
+/* gets the first element, without list envelope */
+CELL * getListHead(CELL * params, CELL * * list)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+
+if(!isList(cell->type))
+	{
+	*list = copyCell(nilCell);
+	return(errorProcArgs(ERR_LIST_EXPECTED, params));
+	}
+*list = (CELL *)cell->contents; 
+return(params->next);
+}
+
+/* gets a list from an expression or default functor
+   inside the (L foo) parameter form in nth and ref functions 
+   returns the params ptr for foo */
+CELL * getList(CELL * params, CELL * * result, int setFlag)
+{
+SYMBOL * sPtr;
+CELL * list;
+
+list = (CELL *)params->contents;
+params = list->next;	
+if(isSymbol(list->type))
+	{
+	if(list->type == CELL_SYMBOL)
+		sPtr = (SYMBOL *)list->contents;
+	else 
+		sPtr =	getDynamicSymbol(list);
+
+	list = (CELL *)sPtr->contents;
+
+	if(list->type == CELL_CONTEXT)
+		{
+		sPtr = (translateCreateSymbol(
+			((SYMBOL*)list->contents)->name,
+			CELL_NIL,
+			(SYMBOL*)list->contents,
+			TRUE));
+		list = (CELL *)sPtr->contents;
+		}
+
+	if(isProtected(sPtr->flags) && setFlag)
+		return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(sPtr)));
+	}
+else
+	{
+	if(setFlag)
+		list = evalCheckProtected(list, NULL);
+	else
+		list = evaluateExpression(list);
+
+	if(list->type == CELL_CONTEXT)
+		{
+		sPtr = (translateCreateSymbol(
+			((SYMBOL*)list->contents)->name,
+			CELL_NIL,
+			(SYMBOL*)list->contents,
+			TRUE));
+
+		if(setFlag && isProtected(sPtr->flags))
+			return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(sPtr)));
+
+		list = (CELL *)sPtr->contents;
+		}
+	}
+
+*result = list;
+
+return(params);
+}
+
+/* ------------------------------- core predicates ------------------------ */
+
+CELL * p_setlocale(CELL * params)
+{
+struct lconv * lc;
+char * locale;
+UINT category;
+
+if(params != nilCell)
+	params = getString(params, &locale);
+else locale = NULL;
+
+if(params != nilCell)
+	getInteger(params, &category);
+else category = LC_ALL;
+
+locale = setlocale(category, locale);
+
+if(locale == NULL)
+	return(nilCell);
+
+stringOutputRaw = (strcmp(locale, "C") == 0);
+
+lc = localeconv();	
+lc_decimal_point = *lc->decimal_point;
+
+return(stuffString(locale));
+}
+
+
+CELL * p_commandLine(CELL * params)
+{
+commandLineFlag = getFlag(params);
+return((commandLineFlag == FALSE ? nilCell : trueCell));
+}
+
+
+CELL * p_quote(CELL * params)
+{
+return(copyCell(params));
+}
+
+
+CELL * p_eval(CELL * params)
+{
+if(params->type == CELL_SYMBOL)
+	params = (CELL*)((SYMBOL *)params->contents)->contents;
+else
+	params = evaluateExpression(params);
+
+if(params->type == CELL_SYMBOL)
+	{
+	if(symbolProtectionLevel && symbolProtectionLevel == (recursionCount - 1))
+		{
+		if(isProtected(((SYMBOL *)params->contents)->flags))
+			symbolProtectionLevel = 0xFFFFFFFF;
+		}
+	/* eval returns original symbol contents for usage in macros */
+	pushResultFlag = 0;
+	return((CELL*)((SYMBOL *)params->contents)->contents);
+	}
+
+return(copyCell(evaluateExpression(params)));
+}
+
+
+CELL * p_catch(CELL * params)
+{
+jmp_buf errorJumpSave;
+int envStackIdxSave;
+int lambdaStackIdxSave;
+int recursionCountSave;
+int value;
+CELL * expr;
+CELL * result;
+SYMBOL * symbol = NULL;
+SYMBOL * contextSave;
+
+expr = params;
+if(params->next != nilCell)
+    {
+    getSymbol(params->next, &symbol);
+    if(isProtected(symbol->flags))
+        return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(symbol)));
+    }
+
+memcpy(errorJumpSave, errorJump, sizeof(jmp_buf));
+envStackIdxSave = envStackIdx;
+recursionCountSave = recursionCount;
+lambdaStackIdxSave = lambdaStackIdx;
+contextSave = currentContext;
+
+if((value = setjmp(errorJump)) != 0)
+    {
+    memcpy(errorJump, errorJumpSave, (sizeof(jmp_buf)));
+    recoverEnvironment(envStackIdxSave);
+    recursionCount = recursionCountSave;
+    lambdaStackIdx = lambdaStackIdxSave;
+    currentContext = contextSave;
+    evalCatchFlag--;
+
+    if(value == EXCEPTION_THROW)
+        {
+		if(symbol == NULL) return(throwResult);
+        deleteList((CELL*)symbol->contents);
+        symbol->contents = (UINT)throwResult;
+        return(trueCell);
+        }
+        
+    if(errorStream.buffer != NULL)
+        {
+		if(symbol == NULL) 
+			{
+			if(errorEvent == nilSymbol && evalCatchFlag == 0)
+				varPrintf(OUT_CONSOLE, "\n%.1024s\n", errorStream.buffer);
+			longjmp(errorJump, value);
+			}
+        deleteList((CELL*)symbol->contents);
+        symbol->contents = (UINT)stuffString(errorStream.buffer);
+        }
+
+    return(nilCell);
+    }
+
+evalCatchFlag++;
+result = copyCell(evaluateExpression(expr));
+evalCatchFlag--;
+memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+
+if(symbol == NULL) return(result);
+
+deleteList((CELL*)symbol->contents);
+symbol->contents = (UINT)result;
+
+return(trueCell);
+}
+
+
+CELL * p_throw(CELL * params)
+{
+if(evalCatchFlag == 0) 
+    return(errorProc(ERR_THROW_WO_CATCH));
+
+throwResult = copyCell(evaluateExpression(params));
+longjmp(errorJump, EXCEPTION_THROW);
+
+return(trueCell);
+}
+
+CELL * p_throwError(CELL * params)
+{
+evalFunc = NULL;
+errorProcExt(ERR_USER_ERROR, evaluateExpression(params));
+return(nilCell);
+}
+
+
+CELL * p_evalString(CELL * params)
+{
+SYMBOL * context = currentContext;
+char * evalString;
+
+params = getString(params, &evalString);
+if(params->next != nilCell)
+	{
+	if((context = getCreateContext(params->next, TRUE)) == NULL)
+		return(errorProcExt(ERR_SYMBOL_OR_CONTEXT_EXPECTED, params->next));
+	}
+
+return(copyCell(sysEvalString(evalString, params, context)));
+}
+
+CELL * sysEvalString(char * evalString, CELL * proc, SYMBOL * context)
+{
+CELL * program;
+STREAM stream;
+CELL * resultCell = nilCell;
+jmp_buf errorJumpSave;
+int recursionCountSave;
+int envStackIdxSave;
+int resultIdxSave;
+SYMBOL * contextSave = NULL;
+
+makeStreamFromString(&stream, evalString);
+recursionCountSave = recursionCount;
+envStackIdxSave = envStackIdx;
+resultIdxSave = resultStackIdx;
+contextSave = currentContext;
+currentContext = context;
+
+if(proc != nilCell)
+	{
+	evalCatchFlag++;
+	memcpy(errorJumpSave, errorJump, sizeof(jmp_buf));
+
+	if(setjmp(errorJump) != 0)
+		{
+		memcpy(errorJump, errorJumpSave, (sizeof(jmp_buf)));
+		recoverEnvironment(envStackIdxSave);
+		evalCatchFlag--;
+		recursionCount = recursionCountSave;
+		currentContext = contextSave;
+		return(evaluateExpression(proc));
+		}
+	}
+
+while(TRUE)
+	{
+	pushResult(program = getCell(CELL_QUOTE));
+	if(compileExpression(&stream, program) == 0) break;
+	resultCell = evaluateExpression((CELL *)program->contents);
+	if(resultStackIdx > (MAX_RESULT_STACK - 256))
+		{
+		program = popResult();
+		cleanupResults(resultIdxSave);
+		pushResult(program);
+		}
+	}
+
+if(proc != nilCell)
+	{
+	memcpy(errorJump, errorJumpSave, (sizeof(jmp_buf)));
+	evalCatchFlag--;
+	}
+
+currentContext = contextSave;
+return(resultCell);
+}
+
+CELL * p_curry(CELL * params)
+{
+CELL * lambda;
+CELL * cell;
+SYMBOL * xPtr;
+
+xPtr = translateCreateSymbol("_x", CELL_NIL, currentContext, TRUE);
+lambda = getCell(CELL_LAMBDA);
+cell = getCell(CELL_EXPRESSION);
+lambda->contents =  (UINT)cell;
+cell->contents = (UINT)stuffSymbol(xPtr);
+cell->next = getCell(CELL_EXPRESSION);
+cell = cell->next;
+cell->contents = (UINT)copyCell(params);
+cell = (CELL *)cell->contents;
+cell->next = copyCell(params->next);
+cell = cell->next;
+cell->next = stuffSymbol(xPtr);
+
+return(lambda);
+}
+
+
+CELL * p_apply(CELL * params)
+{
+CELL * expr;
+CELL * args;
+CELL * cell;
+CELL * result;
+CELL * func;
+ssize_t count, cnt;
+int resultIdxSave;
+
+func = evaluateExpression(params);
+
+cell = copyCell(func);
+expr = getCell(CELL_EXPRESSION);
+expr->contents = (UINT)cell;
+
+params = params->next;
+args = evaluateExpression(params);
+
+if(params->next != nilCell)
+	getInteger(params->next, (UINT *)&count);
+else count = -1;
+if(count < 2) count = MAX_LONG;
+
+resultIdxSave = resultStackIdx + 2;
+
+if(args->type == CELL_EXPRESSION)
+	{
+	args = (CELL *)args->contents;        
+	cnt = count;
+REDUCE:
+	while(args != nilCell && cnt-- > 0)
+		{
+		if(isSelfEval(args->type))
+			{
+			cell->next = copyCell(args);
+			cell = cell->next;
+			}
+		else
+			{
+			cell->next = getCell(CELL_QUOTE);
+			cell = cell->next;
+			cell->contents = (UINT)copyCell(args);
+			}
+		args = args->next;
+		}
+	pushResult(expr);
+	result = copyCell(evaluateExpression(expr));
+	if(args == nilCell) return(result);
+	cell = copyCell(func);
+	expr = getCell(CELL_EXPRESSION);
+	expr->contents = (UINT)cell;
+	cell->next = getCell(CELL_QUOTE);
+	cell = cell->next;
+	cell->contents = (UINT)result;
+	cnt = count - 1;
+	cleanupResults(resultIdxSave);
+	goto REDUCE;		
+	}
+
+pushResult(expr);
+return(copyCell(evaluateExpression(expr)));
+}
+
+
+CELL * p_args(CELL * params)
+{
+if(params != nilCell) 
+	return(copyCell(implicitIndexList((CELL*)argsSymbol->contents, params)));
+return(copyCell((CELL*)argsSymbol->contents));
+}
+
+/* in-place expansion, if symbol==NULL all uppercase, nil vars are expanded */
+CELL * expand(CELL * expr, SYMBOL * symbol)
+{
+CELL * cell = nilCell;
+SYMBOL * sPtr;
+int enable = 1;
+CELL * cont, * rep;
+int wchar;
+
+if(expr->type == CELL_SYMBOL)
+	return(expr);
+/*
+	return(copyCell(expr));
+*/
+
+if(isEnvelope(expr->type))
+	cell = (CELL*)expr->contents;
+
+while(cell != nilCell)
+	{	
+	if(cell->type == CELL_SYMBOL && (cell->contents == (UINT)symbol || symbol == NULL) )
+		{
+		sPtr = (SYMBOL *)cell->contents;
+		if(symbol == NULL)
+			{
+#ifndef SUPPORT_UTF8
+			wchar = *sPtr->name;
+#else
+    		utf8_wchar(sPtr->name, &wchar);
+#endif
+			enable = (wchar > 64 && wchar < 91);
+			cont = (CELL*)sPtr->contents;
+			enable = (enable && cont->contents != (UINT)nilCell 
+							&& cont->contents != (UINT)nilSymbol);
+			}
+
+		if(symbol || enable)
+			{
+			rep = copyCell((CELL*)sPtr->contents);
+			cell->type = rep->type;
+			cell->aux = rep->aux;
+			cell->contents = rep->contents;
+			rep->type = CELL_LONG;
+			rep->aux = 0;
+			rep->contents = 0;
+			deleteList(rep);
+			}
+		}
+
+	else if(isEnvelope(cell->type)) expand(cell, symbol);
+	cell = cell->next;
+	}
+
+return(expr);
+}
+
+CELL * blockExpand(CELL * block, SYMBOL * symbol)
+{
+CELL * expanded = nilCell;
+CELL * next = nilCell;
+
+while(block != nilCell)
+	{
+	if(expanded == nilCell)
+		{
+		next = expand(copyCell(block), symbol);
+		expanded = next;
+		}
+	else
+		{
+		next->next = expand(copyCell(block), symbol);
+		next = next->next;
+		}
+	block = block->next;
+	}
+
+return(expanded);
+}
+
+
+CELL * p_expand(CELL * params)
+{
+SYMBOL * symbol;
+CELL * expr;
+CELL * next;
+CELL * list;
+CELL * cell;
+
+expr = evaluateExpression(params);
+if(!isList(expr->type) && expr->type != CELL_QUOTE)
+	return(errorProcExt(ERR_LIST_EXPECTED, expr));
+
+params = next = params->next;
+if(params == nilCell)
+	return(expand(copyCell(expr), NULL));
+
+while((params = next) != nilCell)
+	{
+	next = params->next;
+	params = evaluateExpression(params);
+	if(params->type == CELL_SYMBOL)
+		symbol = (SYMBOL*)params->contents;
+	else if(params->type == CELL_DYN_SYMBOL)
+		symbol = getDynamicSymbol(params);
+	else if(params->type == CELL_EXPRESSION)
+		{
+		list = (CELL*)params->contents;
+		while(list != nilCell)
+			{
+			if(list->type != CELL_EXPRESSION)
+				return(errorProcExt(ERR_LIST_EXPECTED, list));
+			cell = (CELL *)list->contents;
+			if(cell->type != CELL_SYMBOL)
+				return(errorProcExt(ERR_SYMBOL_EXPECTED, cell));
+			symbol = (SYMBOL*)cell->contents;
+			pushEnvironment(symbol->contents);
+			pushEnvironment(symbol);
+			symbol->contents = (UINT)cell->next;
+			expr = expand(copyCell(expr), symbol);
+			symbol = (SYMBOL*)popEnvironment();
+			symbol->contents = popEnvironment();
+			pushResult(expr);
+			list = list->next;
+			continue;
+			}
+		break;
+		}
+	else 
+		return(errorProcExt(ERR_LIST_OR_SYMBOL_EXPECTED, params));
+	expr = expand(copyCell(expr), symbol);
+	pushResult(expr);
+	}
+
+return(copyCell(expr));
+}
+
+
+CELL * defineOrMacro(CELL * params, UINT cellType)
+{
+SYMBOL * symbol;
+CELL * argsPtr;
+CELL * args;
+CELL * lambda;
+
+if(params->type != CELL_EXPRESSION)
+	return(errorProcExt(ERR_LIST_OR_SYMBOL_EXPECTED, params));
+
+/* symbol to be defined */
+argsPtr = (CELL *)params->contents;
+if(argsPtr->type != CELL_SYMBOL)
+	{
+	if(argsPtr->type == CELL_DYN_SYMBOL)
+		symbol = getDynamicSymbol(argsPtr);
+	else
+		return(errorProcExt(ERR_SYMBOL_EXPECTED, params));
+	}
+else symbol = (SYMBOL *)argsPtr->contents;
+
+if(isProtected(symbol->flags))
+	return(errorProcExt(ERR_SYMBOL_PROTECTED, params));
+
+/* local symbols */
+argsPtr = copyList(argsPtr->next);
+lambda = getCell(cellType);
+lambda->aux = (UINT)nilCell;
+args = getCell(CELL_EXPRESSION);
+args->contents = (UINT)argsPtr;
+/* body expressions */
+args->next = copyList(params->next);
+lambda->contents = (UINT)args;
+
+deleteList((CELL *)symbol->contents);
+
+symbol->contents = (UINT)lambda;
+
+pushResultFlag = FALSE;
+return(lambda);
+}
+
+#define TYPE_SET 1
+#define TYPE_CONSTANT 2
+#define TYPE_DEFINE 3
+
+CELL * p_define(CELL * params)
+{
+if(params->type != CELL_SYMBOL)
+	{
+	if(params->type != CELL_DYN_SYMBOL)
+		return(defineOrMacro(params, CELL_LAMBDA));
+	return(setDefine(getDynamicSymbol(params), params->next, TYPE_SET));
+	}
+
+return(setDefine((SYMBOL *)params->contents, params->next, TYPE_SET));
+}
+
+
+CELL * p_defineMacro(CELL * params)
+{
+return(defineOrMacro(params, CELL_MACRO));
+}
+
+
+CELL * p_setq(CELL * params)
+{
+SYMBOL * symbol;
+CELL * next;
+
+for(;;)
+	{
+	if(params->type != CELL_SYMBOL)
+		{
+		if(params->type == CELL_DYN_SYMBOL)
+			symbol = getDynamicSymbol(params);
+		else
+			return(errorProcExt(ERR_SYMBOL_EXPECTED, params));
+		}
+	else
+		symbol = (SYMBOL *)params->contents;
+	params = params->next;
+	next = params->next;
+	if(params == nilCell)
+		return(copyCell((CELL*)symbol->contents));
+	if(next == nilCell) return(setDefine(symbol, params, TYPE_SET));
+	setDefine(symbol, params, TYPE_SET);
+	params = next;
+	}
+}
+
+
+CELL * p_set(CELL *params)
+{
+SYMBOL * symbol;
+CELL * next;
+
+for(;;)
+	{
+	params = getSymbol(params, &symbol);
+	next = params->next;
+	if(params == nilCell)
+		return(copyCell((CELL*)symbol->contents));
+	if(next == nilCell) return(setDefine(symbol, params, TYPE_SET));
+	setDefine(symbol, params, TYPE_SET);
+	pushResultFlag = TRUE;
+	params = next;
+	}
+}
+
+
+CELL * p_constant(CELL *params)
+{
+SYMBOL * symbol;
+CELL * next;
+
+for(;;)
+	{
+	params = getSymbol(params, &symbol);
+	/* protect contexts from being set, but not vars holding contexts */
+	if(symbolType(symbol) == CELL_CONTEXT && (SYMBOL *)((CELL *)symbol->contents)->contents == symbol)
+		return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(symbol)));
+	next = params->next;
+	if(symbol->context != currentContext)
+		return(errorProcExt2(ERR_NOT_CURRENT_CONTEXT, stuffSymbol(symbol)));
+	symbol->flags |= SYMBOL_PROTECTED;
+	if(params == nilCell)
+		return(copyCell((CELL*)symbol->contents));
+	if(next == nilCell) return(setDefine(symbol, params, TYPE_CONSTANT));
+	setDefine(symbol, params, TYPE_CONSTANT);
+	params = next;
+	}
+}
+
+
+CELL * setDefine(SYMBOL * symbol, CELL * params, int type)
+{
+CELL * cell;
+
+if(isProtected(symbol->flags))
+	{
+	if(type == TYPE_CONSTANT)
+		{
+		if(symbol == nilSymbol || symbol == trueSymbol)
+			return(errorProcExt2(ERR_SYMBOL_EXPECTED, stuffSymbol(symbol)));
+		}
+	else
+		return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(symbol)));
+	}
+
+cell = copyCell(evaluateExpression(params));
+
+deleteList((CELL *)symbol->contents);
+symbol->contents = (UINT)(cell);
+
+pushResultFlag = FALSE; 
+return(cell);
+}
+
+
+CELL * p_global(CELL * params)
+{
+SYMBOL * sPtr;
+
+do
+	{
+	params = getSymbol(params, &sPtr);
+	if(sPtr->context != mainContext || currentContext != mainContext)
+		return(errorProcExt2(ERR_NOT_IN_MAIN, stuffSymbol(sPtr)));
+	else 
+		sPtr->flags |= SYMBOL_GLOBAL;
+	} while (params != nilCell);
+
+return(stuffSymbol(sPtr));
+}
+
+#define LET_STD 0
+#define LET_NEST 1
+#define LET_EXPAND 2
+#define LET_LOCAL 3
+
+CELL * let(CELL * params, int type);
+
+CELL * p_let(CELL * params) { return(let(params, LET_STD)); }
+CELL * p_letn(CELL * params) { return(let(params, LET_NEST)); }
+CELL * p_letExpand(CELL * params) { return(let(params, LET_EXPAND)); }
+CELL * p_local(CELL * params) { return(let(params, LET_LOCAL)); }
+
+CELL * let(CELL * params, int type)
+{
+CELL * inits;
+CELL * cell;
+CELL * result = nilCell;
+CELL * args = NULL, * list = NULL;
+CELL * body;
+SYMBOL * symbol;
+int localCount = 0;
+
+if(params->type != CELL_EXPRESSION)
+	return(errorProcExt(ERR_INVALID_LET, params));
+
+/* evaluate symbol assignments in parameter list 
+   handle double syntax classic: (let ((v1 e1) (v2 e2) ...) ...) 
+                            and: (let (v1 e1 v2 e2 ...) ...)
+*/
+inits = (CELL*)params->contents;
+body = params->next;
+
+if(type == LET_LOCAL)
+	{
+	while(inits != nilCell)
+		{
+		if(inits->type != CELL_SYMBOL)
+			return(errorProcExt(ERR_SYMBOL_EXPECTED, inits));
+		symbol = (SYMBOL *)inits->contents;
+		if(isProtected(symbol->flags))
+        		return(errorProcExt(ERR_SYMBOL_PROTECTED, inits));
+		pushEnvironment(symbol->contents);
+		pushEnvironment(symbol);
+		symbol->contents = (UINT)nilCell;
+		localCount++;
+		inits = inits->next;
+		}
+	goto EVAL_LET_BODY;	
+	}
+
+while(inits != nilCell)
+	{
+	if(inits->type != CELL_EXPRESSION)
+		{
+		if(inits->type != CELL_SYMBOL)
+			return(errorProcExt(ERR_INVALID_LET, inits));
+		cell = inits;
+		inits = ((CELL*)cell->next)->next;
+		}
+	else 
+		{
+		cell = (CELL *)inits->contents;
+		if(cell->type != CELL_SYMBOL)
+			return(errorProcExt(ERR_SYMBOL_EXPECTED, inits));
+		inits = inits->next;
+		}
+
+	if(type == LET_STD || type == LET_EXPAND)
+		{
+		if(localCount == 0) 
+			list = args = copyCell(evaluateExpression(cell->next));
+		else 
+			{
+			args->next = copyCell(evaluateExpression(cell->next));
+			args = args->next;
+			}
+		}
+	else /* LET_NEST */
+		{
+		symbol = (SYMBOL *)cell->contents;
+		if(isProtected(symbol->flags))
+        		return(errorProcExt(ERR_SYMBOL_PROTECTED, cell));
+		args = copyCell(evaluateExpression(cell->next));
+		pushEnvironment((CELL *)symbol->contents);
+		pushEnvironment((UINT)symbol);
+		symbol->contents = (UINT)args;
+		}
+
+	localCount++;
+	}
+
+/* save symbols and get new bindings */
+if(type == LET_STD || type == LET_EXPAND) 
+	{
+	inits = (CELL*)params->contents;
+	while(inits != nilCell)
+		{
+		if(inits->type == CELL_EXPRESSION)
+			{
+			cell = (CELL *)inits->contents;
+			inits = inits->next;
+			}
+		else
+			{
+			cell = inits;
+			inits = ((CELL*)cell->next)->next;
+			}	
+
+		symbol = (SYMBOL *)cell->contents;
+
+		if(isProtected(symbol->flags))
+			return(errorProcExt(ERR_SYMBOL_PROTECTED, cell));
+
+		pushEnvironment((CELL *)symbol->contents);
+		pushEnvironment((UINT)symbol);
+		symbol->contents = (UINT)list;
+
+		args = list;
+		list = list->next;
+		args->next = nilCell; /* decouple */
+
+		/* hook in LET_EXPAND mode here */
+		if(type == LET_EXPAND)
+			{
+			body = blockExpand(body, symbol);
+			pushResult(body);
+			}
+
+		}
+	}
+
+EVAL_LET_BODY:
+/* evaluate body expressions */
+while(body != nilCell)
+	{
+	if(result != nilCell) deleteList(result);
+	result = copyCell(evaluateExpression(body));
+	body = body->next;
+	}
+
+/* restore environment */
+while(localCount--)
+	{
+	symbol = (SYMBOL *)popEnvironment();
+	if(isProtected(symbol->flags) && (symbol != argsSymbol))
+		symbol->flags &= ~SYMBOL_PROTECTED;
+	deleteList((CELL *)symbol->contents);
+	symbol->contents = popEnvironment();
+	}
+
+return(result);
+}
+
+CELL * p_first(CELL * params)
+{
+char str[2];
+CELL * cell;
+
+cell = evaluateExpression(params);
+
+if(cell->type == CELL_STRING)
+	{
+	if((str[0] = *(char *)cell->contents) == 0)
+	return(stuffString(""));
+#ifndef SUPPORT_UTF8
+	str[1] = 0;
+	return(stuffString(str));
+#else
+	return(stuffStringN((char*)cell->contents, utf8_1st_len((char*)cell->contents)));
+#endif
+	}
+
+else if(isList(cell->type))
+	return(copyCell((CELL *)cell->contents));
+else if(cell->type == CELL_ARRAY)
+	return(copyCell(*(CELL * *)cell->contents)); 
+
+return(errorProcExt(ERR_ARRAY_LIST_OR_STRING_EXPECTED, params));
+}
+
+
+CELL * p_rest(CELL * params)
+{
+CELL * cell;
+CELL * tail;
+
+cell = evaluateExpression(params);
+if(cell->type == CELL_STRING)
+	{
+	if(*(char *)cell->contents == 0)
+		return(stuffString(""));
+#ifndef SUPPORT_UTF8
+	return(stuffString((char *)(cell->contents + 1)));
+#else
+	return(stuffString((char *)(cell->contents + utf8_1st_len((char *)cell->contents))));
+#endif
+	}
+
+else if(isList(cell->type))
+	{
+	tail = getCell(CELL_EXPRESSION);
+	tail->contents = (UINT)copyList(((CELL*)cell->contents)->next);
+	return(tail);
+	}
+else if(cell->type == CELL_ARRAY)
+	return(subarray(cell, 1, MAX_LONG));
+
+return(errorProcExt(ERR_ARRAY_LIST_OR_STRING_EXPECTED, params));
+}
+
+CELL * implicitNrestSlice(CELL * num, CELL * params)
+{
+CELL * list;
+CELL * rest;
+ssize_t  n, len;
+
+getIntegerExt(num, (UINT *)&n, FALSE);
+list = evaluateExpression(params);
+
+if(list->type == CELL_CONTEXT)
+	list = (CELL *)(translateCreateSymbol(
+		((SYMBOL*)list->contents)->name,
+		CELL_NIL,
+		(SYMBOL*)list->contents,
+		TRUE))->contents;
+
+/* slice  */
+if(isNumber(list->type))
+	{
+	getIntegerExt(list, (UINT*)&len, FALSE);
+	list = evaluateExpression(params->next);
+
+	if(list->type == CELL_CONTEXT)
+	list = (CELL *)(translateCreateSymbol(
+		((SYMBOL*)list->contents)->name,
+		CELL_NIL,
+		(SYMBOL*)list->contents,
+		TRUE))->contents;
+
+	if(isList(list->type))    
+		return(sublist((CELL *)list->contents, n, len));
+	else if(list->type == CELL_STRING)
+		return(substring((char *)list->contents, list->aux-1, n, len));
+	else if(list->type == CELL_ARRAY)
+		return(subarray(list, n, len));
+	}
+    
+/* nrest lists */
+else if(isList(list->type))
+	{
+	list = (CELL *)list->contents;
+
+	if(n < 0) n = convertNegativeOffset(n, list);
+    
+	while(n-- && list != nilCell)
+		list = list->next;
+  
+	rest = getCell(CELL_EXPRESSION);
+	rest->contents = (UINT)copyList(list);
+	return(rest);
+	}
+
+/* nrest strings 
+   this was UTF-8 sensitive before 9.1.11, but only the
+   explicit first/last/rest should be UTF8-sensitive
+*/
+else if(list->type == CELL_STRING) 
+	return(substring((char *)list->contents, list->aux - 1, n, MAX_LONG));
+
+else if(list->type == CELL_ARRAY)
+	return(subarray(list, n, MAX_LONG));
+
+return(errorProcExt(ERR_ILLEGAL_TYPE, params));
+}
+
+
+CELL * p_cons(CELL * params)
+{
+CELL * cons;
+CELL * head;
+CELL * tail;
+
+if(params == nilCell)
+	return(getCell(CELL_EXPRESSION));
+
+head = copyCell(evaluateExpression(params));
+
+cons = getCell(CELL_EXPRESSION);
+cons->contents = (UINT)head;
+params = params->next;
+
+if(params != nilCell)
+	{
+	tail = evaluateExpression(params);
+    
+	if(isList(tail->type))
+		{
+		if(params->next != nilCell)	
+			{
+			if(((CELL*)params->next)->contents == -1)
+				{
+				cons->contents = (UINT)copyList((CELL *)tail->contents);
+				tail = (CELL*)cons->contents;
+				while(tail->next != nilCell)
+					tail = tail->next;
+				tail->next = head;
+				return(cons);
+				}
+			}	
+			head->next = copyList((CELL *)tail->contents);
+			cons->type = tail->type;	
+		}
+	else
+		head->next = copyCell(tail);
+	}
+
+return(cons);
+}
+
+
+
+CELL * p_list(CELL * params)
+{
+CELL * list;
+CELL * lastCopy;
+CELL * copy;
+CELL * cell;
+int resultIdxSave;
+
+list = getCell(CELL_EXPRESSION);
+lastCopy = NULL;
+
+resultIdxSave = resultStackIdx;
+while(params != nilCell)
+	{
+	cell = evaluateExpression(params);
+	if(cell->type == CELL_ARRAY)
+		copy = arrayList(cell);
+	else
+		copy = copyCell(cell);
+	if(copy != nilCell)
+		{
+		if(lastCopy == NULL)
+			list->contents = (UINT)copy;
+		else lastCopy->next = copy;
+		}
+	params = params->next;
+	lastCopy = copy;
+	cleanupResults(resultIdxSave);
+	}
+
+return(list);
+}
+
+
+
+CELL * p_last(CELL * params)
+{
+CELL * list;
+CELL * listptr;
+char * str;
+#ifdef SUPPORT_UTF8
+char * ptr;
+int len;
+#endif
+
+list = evaluateExpression(params);
+if(list->type == CELL_STRING)
+	{
+	str = (char *)list->contents;
+#ifndef SUPPORT_UTF8
+	return(stuffString(str + list->aux - 2));
+#else
+	ptr = str;
+	while((len = utf8_1st_len(str)) != 0)
+		{
+		ptr = str;
+		str += len;
+		}
+	return(stuffStringN(ptr, utf8_1st_len(ptr)));
+#endif
+	}
+
+else if(isList(list->type))
+	{
+	if(list->aux != (UINT)nilCell) return(copyCell((CELL *)list->aux));
+	listptr = (CELL *)list->contents;
+	while(listptr->next != nilCell) listptr = listptr->next;
+	list->aux = (UINT)listptr;
+	return(copyCell(listptr));
+	}
+
+else if(list->type == CELL_ARRAY)
+	return(copyCell(*((CELL * *)list->contents + (list->aux - 1) / sizeof(UINT) - 1)));
+
+return(errorProcExt(ERR_ARRAY_LIST_OR_STRING_EXPECTED, params));
+}
+
+
+/* -------------------------- program flow  and logical ------------------ */
+
+CELL * evaluateBlock(CELL * cell)
+{
+CELL * result;
+
+result = nilCell;
+
+while(cell != nilCell)
+	{
+	result = evaluateExpression(cell);
+	cell = cell->next;
+	}
+return(result);
+}
+
+
+CELL * p_if(CELL * params)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+while(isNil(cell) || isEmpty(cell))
+	{
+	params = params->next;
+	if(params->next == nilCell) 
+		return(copyCell(cell));
+	params = params->next;
+	cell = evaluateExpression(params);
+	}
+
+if(params->next == nilCell) return(copyCell(cell));
+
+return((copyCell(evaluateExpression(params->next)))); 
+}
+
+
+CELL * p_when(CELL * params)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+if(isNil(cell) || isEmpty(cell)) return(nilCell);
+
+while(params->next != nilCell)
+	{
+	cell = evaluateExpression(params->next);
+	params = params->next;
+	}
+
+return(copyCell(cell));
+}
+
+
+CELL * p_unless(CELL * params)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+if(!isNil(cell) && !isEmpty(cell))
+	params = params->next;
+
+return((copyCell(evaluateExpression(params->next)))); 
+}
+
+
+CELL * p_condition(CELL * params)
+{
+CELL * condition;
+CELL * eval = nilCell;
+
+while(params != nilCell)
+	{
+	if(params->type == CELL_EXPRESSION)
+		{
+		condition = (CELL *)params->contents;
+		eval = evaluateExpression(condition);
+		if(!isNil(eval) && !isEmpty(eval))
+			{
+			if(condition->next != nilCell)
+				return(copyCell(evaluateBlock(condition->next)));
+			return(copyCell(eval));
+			}
+		params = params->next;
+		}
+	else return(errorProc(ERR_LIST_EXPECTED));
+	}
+
+return(copyCell(eval));
+}
+
+
+CELL * p_case(CELL * params)
+{
+CELL * cases;
+CELL * cond;
+
+cases = params->next;
+params = evaluateExpression(params);
+while(cases != nilCell)
+  {
+  if(cases->type == CELL_EXPRESSION)
+    {
+    cond = (CELL *)cases->contents;
+    if(compareCells(params, cond) == 0
+	  || (cond->type == CELL_SYMBOL && symbolType((SYMBOL *)cond->contents) == CELL_TRUE)
+          || cond->type == CELL_TRUE)
+	return(copyCell(evaluateBlock(cond->next)));
+    }
+	cases = cases->next;
+  }
+return(nilCell);
+}
+
+#define REPEAT_WHILE 0
+#define REPEAT_DOWHILE 1
+#define REPEAT_UNTIL 2
+#define REPEAT_DOUNTIL 3
+
+CELL * p_while(CELL * params) { return(repeat(params, REPEAT_WHILE)); }
+CELL * p_doWhile(CELL * params) { return(repeat(params, REPEAT_DOWHILE)); }
+CELL * p_until(CELL * params) { return(repeat(params, REPEAT_UNTIL)); }
+CELL * p_doUntil(CELL * params) { return(repeat(params, REPEAT_DOUNTIL)); }
+
+CELL * repeat(CELL * params, int type)
+{
+CELL * result;
+CELL * cell;
+int resultIdxSave;
+
+resultIdxSave = resultStackIdx;
+result = nilCell;
+while(TRUE)
+    {
+    switch(type)
+        {
+        case REPEAT_WHILE:
+            cell = evaluateExpression(params);
+            if(isNil(cell) || isEmpty(cell)) goto END_REPEAT;
+            cleanupResults(resultIdxSave);
+            result = evaluateBlock(params->next);
+            continue;
+        case REPEAT_DOWHILE:
+            result = evaluateBlock(params->next);
+            cell = evaluateExpression(params);
+            if(isNil(cell) || isEmpty(cell)) goto END_REPEAT;
+            cleanupResults(resultIdxSave);
+            continue;
+        case REPEAT_UNTIL:
+            cell = evaluateExpression(params);
+            if(!isNil(cell) && !isEmpty(cell)) goto END_REPEAT;
+            cleanupResults(resultIdxSave);
+            result = evaluateBlock(params->next);
+            continue;
+        case REPEAT_DOUNTIL:
+            result = evaluateBlock(params->next);
+            cell = evaluateExpression(params);
+            if(!isNil(cell) && !isEmpty(cell)) goto END_REPEAT;
+            cleanupResults(resultIdxSave);
+            continue;
+        default:
+            break;
+        }
+    }
+END_REPEAT:
+return(copyCell(result));
+}
+
+#ifdef from_8_8_4_to_9_0_10
+CELL * repeat(CELL * params, int type)
+{
+CELL * result;
+CELL * cell;
+int resultIdxSave;
+
+resultIdxSave = resultStackIdx;
+result = nilCell;
+while(TRUE)
+	{
+	switch(type)
+		{
+		case REPEAT_WHILE:
+			cell = evaluateExpression(params);
+			if(isNil(cell) || isEmpty(cell)) goto END_REPEAT;
+			cleanupResults(resultIdxSave);
+			deleteList(result);
+			result = copyCell(evaluateBlock(params->next));
+			continue;
+		case REPEAT_DOWHILE:
+			deleteList(result);
+			result = copyCell(evaluateBlock(params->next));
+			cell = evaluateExpression(params);
+			if(isNil(cell) || isEmpty(cell)) goto END_REPEAT;
+			cleanupResults(resultIdxSave);
+			continue;
+		case REPEAT_UNTIL:
+			cell = evaluateExpression(params);
+			if(!isNil(cell) && !isEmpty(cell)) goto END_REPEAT;
+			cleanupResults(resultIdxSave);
+			deleteList(result);
+			result = copyCell(evaluateBlock(params->next));
+			continue;
+		case REPEAT_DOUNTIL:
+			deleteList(result);
+			result = copyCell(evaluateBlock(params->next));
+			cell = evaluateExpression(params);
+			if(!isNil(cell) && !isEmpty(cell)) goto END_REPEAT;
+			cleanupResults(resultIdxSave);
+			continue;
+		default:
+			break;
+		}
+
+	}
+
+END_REPEAT:
+
+return(result);
+}
+#endif
+
+
+CELL * getPushSymbolParam(CELL * params, SYMBOL * * sym)
+{
+SYMBOL * symbol;
+CELL * cell;
+
+if(params->type != CELL_EXPRESSION)
+	return(errorProcExt(ERR_LIST_EXPECTED, params));
+
+cell = (CELL *)params->contents;
+if(cell->type != CELL_SYMBOL)
+	return(errorProcExt(ERR_SYMBOL_EXPECTED, cell));
+
+*sym = symbol = (SYMBOL *)cell->contents;
+if(isProtected(symbol->flags))
+	return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(symbol)));
+
+pushEnvironment((CELL *)symbol->contents);
+pushEnvironment((UINT)symbol);
+symbol->contents = (UINT)nilCell;
+
+return(cell->next);
+}
+
+CELL * loop(CELL * params, int forFlag)
+{
+CELL * cell;
+CELL * cond = nilCell;
+CELL * block;
+SYMBOL * symbol;
+double fromFlt, toFlt, interval, step, cntFlt;
+INT64 stepCnt, i;
+INT64 fromInt64, toInt64;
+int intFlag;
+int resultIdxSave;
+
+cell = getPushSymbolParam(params, &symbol);
+
+/* integer loops for dotimes and (for (i from to) ...) */
+if((intFlag = ((CELL *)cell->next)->next == nilCell))
+	{
+	if(forFlag)
+		{
+		cell = getInteger64(cell, &fromInt64);
+		getInteger64(cell, &toInt64);
+		stepCnt = (toInt64 > fromInt64) ? toInt64 - fromInt64 : fromInt64 - toInt64;
+		}
+	else /* dotimes */
+		{
+		fromInt64 = toInt64 = 0;
+		cond = getInteger64(cell, &stepCnt);
+		}
+	}
+else /* float (for (i from to step) ...) */
+	{
+	cell = getFloat(cell, &fromFlt);
+	cell = getFloat(cell, &toFlt);
+	cond = getFloat(cell, &step);
+	if(isnan(fromFlt) || isnan(toFlt) || isnan(step))
+		return(errorProc(ERR_INVALID_PARAMETER_NAN));
+	if(step < 0) step = -step;
+	if(fromFlt > toFlt) step = -step;
+	cntFlt = (fromFlt < toFlt) ? (toFlt - fromFlt)/step : (fromFlt - toFlt)/step;
+	stepCnt = (cntFlt > 0.0) ? floor(cntFlt + 0.0000000001) : floor(-cntFlt + 0.0000000001);
+	}
+	
+block = params->next;
+resultIdxSave = resultStackIdx;
+cell = nilCell;
+for(i = 0; i <= stepCnt; i++)
+	{
+	if(!forFlag && i == stepCnt) break;
+	deleteList((CELL *)symbol->contents);
+	if(intFlag)	
+		{
+		symbol->contents = 
+			(UINT)stuffInteger64((fromInt64 > toInt64) ? fromInt64 - i: 
+                                                         fromInt64 + i);
+		}
+	else
+		{
+		interval = fromFlt + i * step;
+		symbol->contents = (UINT)stuffFloat(&interval);
+		}
+	cleanupResults(resultIdxSave);
+	if(cond != nilCell)  
+			{
+			cell = evaluateExpression(cond);
+			if(!isNil(cell)) break;
+			}
+	cell = evaluateBlock(block);
+	}
+
+cell = copyCell(cell);
+deleteList((CELL *)symbol->contents);
+symbol = (SYMBOL*)popEnvironment();
+symbol->flags &= ~SYMBOL_PROTECTED;
+symbol->contents = (UINT)popEnvironment();
+
+return(cell);
+}
+
+
+CELL * p_dotimes(CELL * params)
+{
+return(loop(params, 0));
+}
+
+CELL * p_for(CELL * params)
+{
+return(loop(params, 1));
+}
+
+
+#define DOLIST 0
+#define DOARGS 1
+#define DOSTRING 2
+
+CELL * p_dolist(CELL * params)
+{
+return(dolist(params, DOLIST));
+}
+
+CELL * p_doargs(CELL * params)
+{
+return(dolist(params, DOARGS));
+}
+
+CELL * p_dostring(CELL * params)
+{
+return(dolist(params, DOSTRING));
+}
+
+CELL * dolist(CELL * params, int doType)
+{
+CELL * cell;
+CELL * list = nilCell;
+char * str;
+#ifdef SUPPORT_UTF8
+int chr;
+#endif
+CELL * cond = nilCell;
+SYMBOL * symbol;
+CELL * cellIdx;
+int resultIdxSave;
+
+cell = getPushSymbolParam(params, &symbol);
+
+pushEnvironment(dolistIdxSymbol->contents);
+pushEnvironment(dolistIdxSymbol);
+cellIdx = stuffInteger(0);
+dolistIdxSymbol->contents = (UINT)cellIdx;
+
+switch(doType)
+	{
+	case DOLIST:
+		list = copyCell(evaluateExpression(cell));
+		if(!isList(list->type))
+			return(errorProcExt(ERR_LIST_EXPECTED, cell));
+		cond = cell->next;
+		break;
+	case DOARGS:
+		list = copyCell((CELL *)argsSymbol->contents);
+		cond = cell;
+		break;
+	case DOSTRING:
+		getString(cell, &str);
+		resultIdxSave = resultStackIdx;
+		cond = cell->next;
+		while(*str)
+			{
+			cleanupResults(resultIdxSave);
+			deleteList((CELL *)symbol->contents);
+#ifdef SUPPORT_UTF8
+			str = utf8_wchar(str, &chr);
+			symbol->contents = (UINT)stuffInteger(chr);
+#else
+			symbol->contents = (UINT)stuffInteger((int)*str++);
+#endif
+			if(cond != nilCell)
+				{
+				cell = evaluateExpression(cond);
+				if(!isNil(cell)) break;
+				}
+			cell = evaluateBlock(params->next);
+			cellIdx->contents += 1;
+			}
+		goto FINISH_DO;
+		break;
+	}
+
+/* make sure worklist gets destroyed */
+pushResult(list); 
+list = (CELL *)list->contents;
+
+resultIdxSave = resultStackIdx;
+cell = nilCell;
+while(list!= nilCell)
+	{
+	cleanupResults(resultIdxSave);
+	deleteList((CELL *)symbol->contents);
+	symbol->contents = (UINT)copyCell(list);
+	if(cond != nilCell)
+		{
+		cell = evaluateExpression(cond);
+		if(!isNil(cell)) break;
+		}
+	cell = evaluateBlock(params->next);
+	cellIdx->contents += 1;
+	list = list->next;
+	}
+
+FINISH_DO:
+pushResult(cellIdx);
+cell = copyCell(cell);
+dolistIdxSymbol = (SYMBOL*)popEnvironment();
+dolistIdxSymbol->contents = (UINT)popEnvironment();
+deleteList((CELL *)symbol->contents);
+symbol = (SYMBOL*)popEnvironment();
+symbol->contents = (UINT)popEnvironment();
+
+return(cell);
+}
+
+
+CELL * p_evalBlock(CELL * params)
+{
+return(copyCell(evaluateBlock(params)));
+}
+
+
+CELL * p_silent(CELL * params)
+{
+evalSilent  = TRUE;
+
+return(copyCell(evaluateBlock(params)));
+}
+
+
+CELL * p_and(CELL * params)
+{
+CELL * result = nilCell;
+
+while(params != nilCell)
+	{
+	result = evaluateExpression(params);
+	if(isNil(result) || isEmpty(result)) return(copyCell(result));
+	params = params->next;
+	}
+
+return(copyCell(result));     
+}
+
+
+CELL * p_or(CELL * params)
+{
+CELL * result = nilCell;
+
+while(params != nilCell)
+	{
+	result = evaluateExpression(params);
+	if(!isNil(result) && !isEmpty(result)) 
+		return(copyCell(result));
+	params = params->next;
+	}
+
+return(copyCell(result));
+}
+
+
+CELL * p_not(CELL * params)
+{
+CELL * eval;
+
+eval = evaluateExpression(params);
+if(isNil(eval) || isEmpty(eval)) 
+    return(trueCell);
+return(nilCell);
+}
+
+
+
+/* ------------------------------ I / O --------------------------------- */
+
+CELL * p_print(CELL * params)
+{
+return println(params, FALSE);
+}
+
+
+CELL * p_println(CELL * params)
+{
+return println(params, TRUE);
+}
+
+
+CELL * println(CELL * params, int lineFeed)
+{
+CELL * result;
+
+result = nilCell;
+while(params != nilCell)
+	{
+	result = evaluateExpression(params);
+	if(printCell(result, 0, OUT_DEVICE)  == 0)
+		return(nilCell);
+	params = params->next;
+	}
+
+if(lineFeed) varPrintf(OUT_DEVICE, LINE_FEED);
+
+return(copyCell(result));
+}
+
+
+CELL * p_device(CELL * params)
+{
+if(params != nilCell)
+	getInteger(params, &printDevice);
+return(stuffInteger(printDevice));
+}
+
+
+CELL * p_load(CELL * params)
+{
+char * fileName;
+CELL * result = nilCell;
+CELL * next;
+SYMBOL * context;
+int count = 0;
+
+/* get last parameter */
+if((next = params) == nilCell)
+	errorProc(ERR_MISSING_ARGUMENT);
+while(next->next != nilCell)
+	{
+	count++;
+	next = next->next;
+	}
+
+next = evaluateExpression(next);
+if(next->type == CELL_STRING)
+	{
+	count++;
+	context = mainContext;
+	}
+else
+	{
+	if(count == 0)
+		errorProcExt(ERR_STRING_EXPECTED, next);
+	if((context = getCreateContext(next, FALSE)) == NULL)
+		errorProcExt(ERR_SYMBOL_OR_CONTEXT_EXPECTED, next);
+	next = NULL;
+	}
+
+while(count--)
+	{
+	/* if last arg was a string, avoid double evaluation */
+	if(count == 0 && next != NULL)
+		getStringSize(next, &fileName, NULL, FALSE);
+	else 
+		params = getString(params, &fileName);
+
+	result = loadFile(fileName, 0, 0, context);
+
+	if(result == NULL)
+	    return(errorProcExt2(ERR_ACCESSING_FILE, stuffString(fileName)));
+	}
+
+return(result);
+}
+
+
+void saveContext(SYMBOL * sPtr, UINT device)
+{
+SYMBOL * contextSave;
+
+contextSave = currentContext;
+
+currentContext = sPtr;
+
+if(sPtr != mainContext)
+	varPrintf(device, "%s(context '%s)%s%s", 
+		LINE_FEED, sPtr->name, LINE_FEED, LINE_FEED);
+
+
+saveSymbols((SYMBOL *)((CELL*)sPtr->contents)->aux, device);
+
+if(sPtr != mainContext)
+	varPrintf(device, "%s(context 'MAIN)%s%s", 
+		LINE_FEED, LINE_FEED, LINE_FEED);
+
+currentContext = contextSave;
+}
+
+
+void saveSymbols(SYMBOL * sPtr, UINT device)
+{
+int type;
+
+if(sPtr != NIL_SYM && sPtr != NULL)
+	{
+	saveSymbols(sPtr->left, device);
+	type = symbolType(sPtr);
+	if(type == CELL_CONTEXT)
+		{
+		if(sPtr == (SYMBOL *)((CELL *)sPtr->contents)->contents)
+			{
+			if(sPtr != currentContext) saveContext(sPtr, device);
+			}
+		else printSymbol(sPtr, device);	
+		}
+	else if(type != CELL_PRIMITIVE && type != CELL_NIL
+		&& sPtr != trueSymbol && type != CELL_IMPORT_CDECL
+		&& sPtr != argsSymbol
+#ifdef WIN_32
+		&& type != CELL_IMPORT_DLL
+#endif
+		)
+		if(*sPtr->name != '$') printSymbol(sPtr, device);
+	saveSymbols(sPtr->right, device);
+	}
+}
+
+
+CELL * p_save(CELL * params)
+{
+char * fileName;
+STREAM strStream;
+UINT printDeviceSave;
+CELL * result;
+SYMBOL * contextSave;
+CELL * dataCell;
+
+contextSave = currentContext;
+currentContext = mainContext;
+printDeviceSave = printDevice;
+
+params = getString(params, &fileName);
+
+/* check for URL format */
+if(my_strnicmp(fileName, "http://", 7) == 0)
+	{
+	openStrStream(&strStream, MAX_STRING, 0);
+	serializeSymbols(params, (UINT)&strStream);
+	dataCell = stuffString(strStream.buffer);
+	result = getPutPostDeleteUrl(fileName, dataCell, HTTP_PUT_URL, 60000);
+	closeStrStream(&strStream);
+	deleteList(dataCell);
+	return(result);
+	}
+else
+	{
+	if(my_strnicmp(fileName, "file://", 7) == 0)
+		fileName = fileName + 7; 
+	if( (printDevice = (UINT)openFile(fileName, "write", NULL)) == (UINT)-1)
+		return(errorProcExt2(ERR_SAVING_FILE, stuffString(fileName)));
+	serializeSymbols(params, OUT_DEVICE);
+	close((int)printDevice);
+	}
+
+currentContext = contextSave;
+printDevice = printDeviceSave;
+return(trueCell);
+}
+
+void serializeSymbols(CELL * params, UINT device)
+{
+SYMBOL * sPtr;
+
+if(params->type == CELL_NIL)
+	saveSymbols((SYMBOL *)((CELL*)currentContext->contents)->aux, device);
+else
+    while(params != nilCell)
+	{
+	params = getSymbol(params, &sPtr);
+	if(symbolType(sPtr) == CELL_CONTEXT)
+		saveContext((SYMBOL*)((CELL *)sPtr->contents)->contents, device);
+	else        
+		printSymbol(sPtr, device);
+	}
+}
+
+/* ----------------------- copy a context with 'new' -------------- */
+static SYMBOL * fromContext;
+static SYMBOL * newContext;
+static int overWriteFlag;
+
+CELL * copyContextList(CELL * cell);
+UINT * copyContextArray(CELL * array);
+
+
+CELL * copyContextCell(CELL * cell)
+{
+CELL * newCell;
+SYMBOL * sPtr;
+SYMBOL * newSptr;
+
+if(firstFreeCell == NULL) allocBlock();
+newCell = firstFreeCell;
+firstFreeCell = newCell->next;
+++cellCount;
+
+newCell->type = cell->type;
+newCell->next = nilCell;
+newCell->aux = cell->aux;
+newCell->contents = cell->contents;
+
+if(cell->type == CELL_DYN_SYMBOL)
+	{
+	sPtr = (SYMBOL*)cell->aux;
+	if(sPtr->context == fromContext)
+		newCell->aux =
+			(UINT)translateCreateSymbol(sPtr->name, 0, newContext, TRUE);
+	newCell->contents = (UINT)allocMemory(strlen((char *)cell->contents) + 1);
+	memcpy((void *)newCell->contents,
+		(void*)cell->contents, strlen((char *)cell->contents) + 1);
+	}
+
+if(cell->type == CELL_SYMBOL)
+	{
+	/* if the cell copied itself contains a symbol copy it recursevely,
+	   if new, if not done here it might not been seen as new later and left
+           without contents */
+	sPtr = (SYMBOL *)cell->contents;
+	if(sPtr->context == fromContext && !(sPtr->flags & SYMBOL_BUILTIN))
+		{
+		if((newSptr = lookupSymbol(sPtr->name, newContext)) == NULL)
+			{
+			newSptr = translateCreateSymbol(sPtr->name, symbolType(sPtr), newContext, TRUE);
+			newSptr->contents = (UINT)copyContextCell((CELL*)sPtr->contents);
+			}
+		newCell->contents = (UINT)newSptr;
+		}
+	}
+
+if(isEnvelope(cell->type))
+        {
+        if(cell->type == CELL_ARRAY)
+                newCell->contents = (UINT)copyContextArray(cell);
+        else
+	        newCell->contents = (UINT)copyContextList((CELL *)cell->contents);
+        }
+
+else if(cell->type == CELL_STRING)
+	{
+	newCell->contents = (UINT)allocMemory((UINT)cell->aux);
+	memcpy((void *)newCell->contents,
+		(void*)cell->contents, (UINT)cell->aux);
+	}
+
+return(newCell);
+}
+
+
+CELL * copyContextList(CELL * cell)
+{
+CELL * firstCell;
+CELL * newCell;
+
+if(cell == nilCell || cell == trueCell) return(cell);
+
+firstCell = newCell = copyContextCell(cell);
+
+while((cell = cell->next) != nilCell)
+	{
+	newCell->next = copyContextCell(cell);
+	newCell = newCell->next;
+	}
+	
+return(firstCell);
+}
+
+
+UINT * copyContextArray(CELL * array)
+{
+CELL * * newAddr;
+CELL * * orgAddr;
+CELL * * addr;
+size_t size;
+
+addr = newAddr = (CELL * *)callocMemory(array->aux);
+
+size = (array->aux - 1) / sizeof(UINT);
+orgAddr = (CELL * *)array->contents;
+
+while(size--)
+	*(newAddr++) = copyContextCell(*(orgAddr++));
+	
+return((UINT*)addr);
+}
+
+
+void iterateSymbols(SYMBOL * sPtr)
+{
+int type, newFlag = FALSE;
+SYMBOL * newPtr;
+
+if(sPtr != NIL_SYM && sPtr != NULL && !(sPtr->flags & SYMBOL_BUILTIN))
+	{
+	iterateSymbols(sPtr->left);
+	type = symbolType(sPtr);
+
+	/* check for default symbol */
+	if(*sPtr->name == *fromContext->name && strcmp(sPtr->name, fromContext->name) == 0)
+		{
+		if((newPtr = lookupSymbol(newContext->name, newContext)) == NULL)
+			{
+			newPtr = translateCreateSymbol(newContext->name, type, newContext, TRUE);
+			newFlag = TRUE;
+			}
+		}
+	else
+		{
+		if((newPtr = lookupSymbol(sPtr->name, newContext)) == NULL)
+			{
+			newPtr = translateCreateSymbol(sPtr->name, type, newContext, TRUE);
+			newFlag = TRUE;
+			}
+		}
+
+	if(overWriteFlag == TRUE || newFlag == TRUE)
+		{
+		deleteList((CELL *)newPtr->contents);
+		newPtr->contents = (UINT)copyContextCell((CELL*)sPtr->contents);
+		}
+
+	iterateSymbols(sPtr->right);
+	}
+}
+
+
+
+CELL * p_new(CELL * params)
+{
+CELL * next;
+
+overWriteFlag = FALSE;
+
+params = getContext(params, &fromContext);
+if(!fromContext) return(nilCell); /* for debug mode */
+
+next = params->next;
+
+if(params == nilCell)
+	newContext = currentContext;
+else 
+	{
+	params = evaluateExpression(params);
+	if(params->type == CELL_CONTEXT || params->type == CELL_SYMBOL)
+		newContext = (SYMBOL *)params->contents;
+	else
+		return(errorProcExt(ERR_CONTEXT_EXPECTED, params));
+
+        overWriteFlag = (evaluateExpression(next)->type != CELL_NIL);
+
+	/* allow symbols to be converted to contexts */
+	if(symbolType(newContext) != CELL_CONTEXT)
+		{
+		if(isProtected(newContext->flags))
+			return(errorProcExt(ERR_SYMBOL_PROTECTED, params));
+
+		if(newContext->context != mainContext)
+			return(errorProcExt2(ERR_NOT_IN_MAIN, stuffSymbol(newContext)));
+
+		deleteList((CELL *)newContext->contents);
+		makeContextFromSymbol(newContext, NULL);
+		}
+	}
+
+if(newContext == mainContext)
+	return(errorProc(ERR_TARGET_NO_MAIN));
+
+iterateSymbols((SYMBOL *)((CELL*)fromContext->contents)->aux);
+
+return(copyCell((CELL*)newContext->contents));
+}
+
+
+CELL * p_defineNew(CELL * params)
+{
+SYMBOL * sourcePtr;
+SYMBOL * targetPtr;
+char * name;
+
+params = getSymbol(params, &sourcePtr);
+if(params != nilCell)
+	{
+	params = getSymbol(params, &targetPtr);
+	name = targetPtr->name;
+	newContext = targetPtr->context;
+	}
+else
+	{
+	name = sourcePtr->name;
+	newContext = currentContext;
+	}
+
+if(newContext == mainContext)
+	return(errorProc(ERR_TARGET_NO_MAIN));
+
+fromContext = sourcePtr->context;
+targetPtr = translateCreateSymbol(name, symbolType(sourcePtr), newContext, TRUE);
+
+deleteList((CELL *)targetPtr->contents);
+targetPtr->contents = (UINT)copyContextCell((CELL*)sourcePtr->contents);
+
+return(stuffSymbol(targetPtr));
+}
+	
+
+
+/* ------------------------------ system ------------------------------ */
+
+CELL * isType(CELL *, int);
+
+CELL * p_isNil(CELL * params)
+{
+if(isNil(evaluateExpression(params)))
+        return(trueCell);
+
+return(nilCell);
+}
+
+CELL * p_isEmpty(CELL * params)
+{
+return(isEmptyFunc(evaluateExpression(params)));
+}
+
+CELL * isEmptyFunc(CELL * cell)
+{
+if(cell->type == CELL_STRING)
+    {
+    if(*(char*)cell->contents == 0)
+        return(trueCell);
+    else return(nilCell);
+    }
+
+if(!isList(cell->type))
+		return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, cell));
+if(cell->contents == (UINT)nilCell)
+	return(trueCell);
+return(nilCell);
+}
+
+CELL * isZero(CELL * cell)
+{
+#ifndef NEWLISP64
+if(cell->type == CELL_INT64)
+	{
+	if(*(INT64 *)&cell->aux == 0)
+		return(trueCell);
+	else
+		return(nilCell);
+	}
+#endif
+
+if(cell->type == CELL_FLOAT)
+	{
+#ifndef NEWLISP64
+	if(*(double *)&cell->aux == 0.0)
+#else
+    if(*(double *)&cell->contents == 0.0)
+#endif
+		return(trueCell);
+	else
+		return(nilCell);
+	}	
+
+if(cell->type == CELL_LONG)
+	{
+	if(cell->contents == 0)
+		return(trueCell);
+	}
+
+return(nilCell);
+}
+
+
+CELL * p_isNull(CELL * params)
+{
+CELL * cell;
+
+cell = evaluateExpression(params);
+if(isNil(cell))
+	return(trueCell);
+
+if( (cell->type == CELL_STRING || isList(cell->type)))
+	return(isEmptyFunc(cell));
+
+#ifndef NEWLISP64
+if(cell->type == CELL_FLOAT && (isnan(*(double *)&cell->aux)) )
+#else
+if(cell->type == CELL_FLOAT && (isnan(*(double *)&cell->contents)))
+#endif
+	return(trueCell);
+
+return(isZero(cell));
+}
+
+
+CELL * p_isZero(CELL * params)
+{
+params = evaluateExpression(params);
+return(isZero(params));
+}
+
+
+CELL * p_isTrue(CELL * params)
+{
+params = evaluateExpression(params);
+if(!isNil(params) && !isEmpty(params))
+        return(trueCell);
+
+return(nilCell);
+}
+
+CELL * p_isInteger(CELL * params)
+{
+params = evaluateExpression(params);
+if((params->type & COMPARE_TYPE_MASK) == CELL_INT)
+	return(trueCell);
+return(nilCell);
+}
+
+
+CELL * p_isFloat(CELL * params)
+	{ return(isType(params, CELL_FLOAT)); }
+	
+CELL * p_isNumber(CELL * params)
+{
+params = evaluateExpression(params);
+if(isNumber(params->type)) return(trueCell);
+return(nilCell);
+}
+
+CELL * p_isString(CELL * params)
+	{ return(isType(params, CELL_STRING)); }
+
+CELL * p_isSymbol(CELL * params)
+        { return(isType(params, CELL_SYMBOL)); }
+
+CELL * p_isContext(CELL * params)
+{
+char * symStr;
+SYMBOL * ctx;
+
+/* check type */
+if(params->next == nilCell) 
+    return(isType(params, CELL_CONTEXT)); 
+
+/* check for existense of symbol */
+params = getContext(params, &ctx);
+if(!ctx) return(nilCell); /* for debug mode */
+getString(params, &symStr);
+
+return (lookupSymbol(symStr, ctx) ? trueCell : nilCell);    
+}
+
+CELL * p_isPrimitive(CELL * params)
+	{ return(isType(params, CELL_PRIMITIVE)); }
+
+
+CELL * p_isGlobal(CELL * params)
+{
+params = evaluateExpression(params);
+if(isSymbol(params->type) && isGlobal(((SYMBOL *)params->contents)->flags))
+	return(trueCell);
+return(nilCell);
+}
+
+CELL * p_isProtected(CELL * params)
+{
+params = evaluateExpression(params);
+if(isSymbol(params->type) && isProtected(((SYMBOL *)params->contents)->flags))
+	return(trueCell);
+return(nilCell);
+}
+	
+CELL * p_isAtom(CELL * params)
+{
+if(params == nilCell)
+	return(errorProc(ERR_MISSING_ARGUMENT));
+params = evaluateExpression(params);
+if(params->type & ENVELOPE_TYPE_MASK) return(nilCell);
+return(trueCell);
+}
+
+CELL * p_isQuote(CELL *params)
+	{ return(isType(params, CELL_QUOTE)); }
+
+CELL * p_isList(CELL * params)
+	{ return(isType(params, CELL_EXPRESSION)); }
+
+CELL * p_isLambda(CELL * params)
+	{ return(isType(params, CELL_LAMBDA)); }
+
+CELL * p_isMacro(CELL * params)
+	{ return(isType(params, CELL_MACRO)); }
+
+CELL * p_isArray(CELL * params)
+	{ return(isType(params, CELL_ARRAY)); }
+
+CELL * isType(CELL * params, int operand)
+{
+CELL * contextCell;
+
+if(params == nilCell)
+	return(errorProc(ERR_MISSING_ARGUMENT));
+params = evaluateExpression(params);
+if((UINT)operand == params->type) return(trueCell);
+switch(operand)
+	{
+	case CELL_PRIMITIVE:
+		if(params->type == CELL_IMPORT_CDECL
+#ifdef WIN_32
+		|| params->type == CELL_IMPORT_DLL 
+#endif
+		)
+			return(trueCell);
+		break;
+	case CELL_EXPRESSION:
+		if(isList(params->type)) return(trueCell);
+                break;
+	case CELL_SYMBOL:
+		if(params->type == CELL_DYN_SYMBOL) /* check if already created */
+			{
+			contextCell = (CELL *)((SYMBOL *)params->aux)->contents;
+			if(contextCell->type != CELL_CONTEXT)
+				fatalError(ERR_CONTEXT_EXPECTED, 
+					stuffSymbol((SYMBOL*)params->aux), TRUE);
+			if(lookupSymbol((char *)params->contents, (SYMBOL*)contextCell->contents))
+				return(trueCell);
+			}
+			
+		break;
+	default:
+		break;
+	}
+
+return(nilCell);
+}
+
+
+CELL * p_isLegal(CELL * params)
+{
+char * symStr;
+
+getString(params, &symStr);
+
+if(isLegalSymbol(symStr)) return(trueCell);
+
+return(nilCell);
+}
+
+
+int isLegalSymbol(char * source)
+{
+STREAM stream;
+char token[MAX_SYMBOL + 1];
+int tklen;
+
+if(*source == (char)'"' || *source == (char)'{' || *source == (char)'[' 
+   || (unsigned char)*source <= (unsigned char)' ' || *source == (char)';' || *source == (char)'#')
+        return(0);
+
+makeStreamFromString(&stream, source);
+
+return( (getToken(&stream, token, &tklen) == TKN_SYMBOL) && tklen == strlen(source));
+}
+
+
+CELL * p_exit(CELL * params)
+{
+UINT result;
+
+if(demonMode) 
+	{
+	fclose(IOchannel);
+#ifndef WIN_32
+	IOchannel = NULL;
+#endif
+	longjmp(errorJump, ERR_USER_RESET);
+	}
+
+if(params != nilCell) getInteger(params, (UINT*)&result);
+else result = 0;
+exit(result);
+return(trueCell);
+}
+
+
+
+CELL * p_reset(CELL * params)
+{
+#ifndef LIBRARY
+#ifndef WIN_32
+if (getFlag(params))
+	execv(MainArgs[0], MainArgs);
+#endif
+#endif
+
+longjmp(errorJump, ERR_USER_RESET);
+return(nilCell);
+}
+
+
+CELL * p_errorEvent(CELL * params)
+{
+CELL * symCell;
+
+if(params != nilCell) getCreateSymbol(params, &errorEvent, "$error-event");
+symCell = getCell(CELL_SYMBOL);
+symCell->contents = (UINT)errorEvent;
+return(symCell);
+}
+
+#ifndef WIN_32
+
+CELL * p_timerEvent(CELL * params)
+{
+CELL * symCell;
+double seconds;
+UINT timerOption = 0;
+struct itimerval timerVal;
+struct itimerval outVal;
+static double duration;
+
+if(params != nilCell) 
+  {
+  params = getCreateSymbol(params, &timerEvent, "$timer");
+
+  if(params != nilCell)
+    {
+    params = getFloat(params, &seconds);
+    duration = seconds;
+    if(params != nilCell)
+        getInteger(params, (UINT*)&timerOption);
+    memset(&timerVal, 0, sizeof(timerVal));
+    timerVal.it_value.tv_sec = seconds;
+    timerVal.it_value.tv_usec = (seconds - timerVal.it_value.tv_sec) * 1000000;
+    if(setitimer((int)timerOption, &timerVal, &outVal) == -1)
+      return(nilCell);
+    return(stuffInteger(0));
+    }
+  else
+    getitimer(timerOption, &outVal);
+
+  seconds = duration - (outVal.it_value.tv_sec + outVal.it_value.tv_usec / 1000000.0);
+  return(stuffFloat(&seconds));
+  }
+  
+symCell = getCell(CELL_SYMBOL);
+symCell->contents = (UINT)timerEvent;
+return(symCell);
+}
+#endif
+
+CELL * p_signal(CELL * params)
+{
+CELL * symCell;
+SYMBOL * signalEvent;
+UINT sig;
+char sigStr[12];
+
+params = getInteger(params, (UINT *)&sig);
+if(sig > 32 || sig < 1) return(nilCell);
+    
+if(params != nilCell)
+	{
+	if(isNil(params))
+		{
+		signal(sig, SIG_IGN);
+		symHandler[sig - 1] = nilSymbol;
+		}
+	else if(isTrue(params))
+		{
+		signal(sig, SIG_DFL);
+		symHandler[sig - 1] = trueSymbol;
+		}
+	else
+		{
+		snprintf(sigStr, 11, "$signal-%ld", sig);
+		getCreateSymbol(params, &signalEvent, sigStr);
+		symHandler[sig - 1] = signalEvent;
+		if(signal(sig, signal_handler) == SIG_ERR)
+			return(nilCell);
+		}
+	}
+  
+symCell = getCell(CELL_SYMBOL);
+symCell->contents = (UINT)symHandler[sig - 1];
+return(symCell);
+}
+
+
+CELL * p_errorNumber(CELL * params)
+{
+return(stuffInteger((UINT)errorReg));
+}
+
+
+CELL * p_errorText(CELL * params)
+{
+UINT errorNumber = errorReg;
+
+if(params == nilCell)
+	{
+	if(errorStream.buffer != NULL)
+		return(stuffString(errorStream.buffer));
+	}
+else
+	getInteger(params, &errorNumber);
+
+
+if(errorNumber > MAX_ERROR_NUMBER)
+	errorNumber = ERR_NUMBER_OUT_OF_RANGE;
+
+return(stuffString(errorMessage[errorNumber]));
+}
+
+
+
+CELL * p_dump(CELL * params)
+{
+CELL * blockPtr;
+int i;
+CELL * cell;
+
+if(params != nilCell)
+	{
+	cell = evaluateExpression(params);
+	return(stuffIntegerList
+           (5, cell, cell->type, cell->next, cell->aux, cell->contents));
+	}
+
+blockPtr = cellMemory;
+while(blockPtr != NULL)
+	{
+	for(i = 0; i <  MAX_BLOCK; i++)
+		{
+		if(*(UINT *)blockPtr != CELL_FREE)
+			{
+			varPrintf(OUT_DEVICE, "address=%lX type=%d contents=", blockPtr, blockPtr->type);
+			printCell(blockPtr, TRUE, OUT_DEVICE);
+			varPrintf(OUT_DEVICE,LINE_FEED);
+			}
+		++blockPtr;
+		}
+	blockPtr = blockPtr->next;
+	}
+return(trueCell);
+}
+
+
+CELL * p_mainArgs(CELL * params)
+{
+CELL * cell;
+ssize_t idx;
+
+cell = (CELL*)mainArgsSymbol->contents;
+if(params != nilCell)
+    {
+    getInteger(params, (UINT *)&idx);
+    cell = (CELL *)cell->contents;
+    if(idx < 0) idx = convertNegativeOffset(idx, (CELL *)cell);
+    while(idx--) cell = cell->next;
+    }
+
+return(copyCell(cell));
+}
+
+
+CELL * p_context(CELL * params)
+{
+CELL * cell;
+SYMBOL * sPtr;
+SYMBOL * cPtr;
+char * newSymStr;
+
+if(params->type == CELL_NIL)
+	return(copyCell((CELL *)currentContext->contents));
+
+if((cPtr = getCreateContext(params, TRUE)) == NULL)
+	return(errorProcExt(ERR_SYMBOL_OR_CONTEXT_EXPECTED, params));
+    
+if(params->next == nilCell)
+ 	{
+ 	currentContext = cPtr;
+ 	return(copyCell( (CELL *)currentContext->contents));
+	}
+    
+params = params->next;
+cell = evaluateExpression(params);
+if(cell->type == CELL_STRING)
+	newSymStr = (char *)cell->contents;
+else if(cell->type == CELL_SYMBOL)	
+	newSymStr = ((SYMBOL *)cell->contents)->name;
+else if(cell->type == CELL_DYN_SYMBOL)
+	{
+	sPtr = getDynamicSymbol(cell);
+	newSymStr = sPtr->name;
+	}
+else
+	return(errorProcExt(ERR_ILLEGAL_TYPE, cell));
+
+sPtr = translateCreateSymbol(newSymStr, CELL_NIL, cPtr, TRUE);
+if(params->next == nilCell)
+	{
+	pushResultFlag = FALSE;
+	return((CELL *)sPtr->contents);
+	}
+
+if(strcmp(cPtr->name, sPtr->name) == 0)
+		return(nilCell);
+
+return(setDefine(sPtr, params->next, TYPE_SET));
+}
+
+
+SYMBOL * getCreateContext(CELL * cell, int evaluate)
+{
+SYMBOL * contextSymbol;
+
+if(evaluate)
+	cell = evaluateExpression(cell);
+
+if(cell->type == CELL_SYMBOL || cell->type == CELL_CONTEXT)
+    contextSymbol = (SYMBOL *)cell->contents;
+else
+    return(NULL);
+
+
+if(symbolType(contextSymbol) != CELL_CONTEXT)
+	{
+	if(isProtected(contextSymbol->flags))
+		return(NULL);
+
+	if(contextSymbol->context != mainContext)
+		{
+		contextSymbol= translateCreateSymbol(
+			contextSymbol->name, CELL_CONTEXT, mainContext, 1);
+		}
+
+	if(symbolType(contextSymbol) != CELL_CONTEXT)
+		{
+        if(isProtected(contextSymbol->flags))
+        	errorProcExt(ERR_CONTEXT_EXPECTED, stuffSymbol(contextSymbol));
+
+		deleteList((CELL *)contextSymbol->contents);
+		makeContextFromSymbol(contextSymbol, NULL);
+		}
+	}
+
+/* if this is a context var retrieve the real context symbol */
+return((SYMBOL *)((CELL *)contextSymbol->contents)->contents);
+}
+
+
+CELL * p_default(CELL * params)
+{
+SYMBOL * contextSymbol;
+
+getContext(params, &contextSymbol);
+
+return(stuffSymbol(translateCreateSymbol(contextSymbol->name, CELL_NIL, contextSymbol, TRUE)));
+}
+
+CELL * p_colon(CELL * params)
+{
+SYMBOL * contextSymbol = NULL;
+SYMBOL * methodSymbol;
+CELL * proc;
+CELL * cell;
+CELL * obj;
+CELL * quote;
+
+if(params->type != CELL_SYMBOL)
+	return(errorProcExt(ERR_SYMBOL_EXPECTED, params));
+
+methodSymbol = (SYMBOL *)params->contents;
+params = params->next;
+obj = evaluateExpression(params);
+if(obj->type != CELL_EXPRESSION)
+	return(errorProcExt(ERR_LIST_EXPECTED, obj));
+cell = (CELL *)obj->contents;
+
+if(cell->type == CELL_SYMBOL || cell->type == CELL_CONTEXT)
+    contextSymbol = (SYMBOL *)cell->contents;
+if(contextSymbol == NULL || symbolType(contextSymbol) != CELL_CONTEXT)
+	return(errorProcExt(ERR_CONTEXT_EXPECTED, cell));
+
+if((methodSymbol = lookupSymbol(methodSymbol->name, contextSymbol)) == NULL)
+	return(errorProc(ERR_INVALID_FUNCTION));
+
+proc = getCell(CELL_EXPRESSION);
+proc->contents = (UINT)stuffSymbol(methodSymbol);
+quote = getCell(CELL_QUOTE);
+quote->contents = (UINT)copyCell(obj);
+cell = (CELL *)proc->contents;
+cell->next = quote;
+cell = quote;
+params = params->next;
+while(params != nilCell)
+	{
+	cell->next = copyCell(params);
+	cell = cell->next;
+	params = params->next;
+	}
+
+pushResult(proc);
+return(copyCell(evaluateExpression(proc)));
+}
+
+
+CELL * p_systemSymbol(CELL * params)
+{
+UINT idx;
+
+getInteger(params, &idx);
+
+if(idx > 15 || idx < 0) return(nilCell);
+
+return(copyCell((CELL*)sysSymbol[idx]->contents));
+}
+
+
+/* end of file */
diff --git a/newlisp.h b/newlisp.h
new file mode 100644
index 0000000..da320e7
--- /dev/null
+++ b/newlisp.h
@@ -0,0 +1,483 @@
+/* newlisp.h - header file for newLISP
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+/* 
+starting with version 9.1.9 MINGW is the default flavor for WIN_32
+and the MINGW label as been eliminated 
+*/
+
+#ifdef TRU64
+#define strtoll strtol
+#define strtoull strtoul
+#endif
+
+#if defined(SOLARIS) || defined(TRU64)
+#define MY_RAND_MAX 2147483647
+#else
+#define MY_RAND_MAX RAND_MAX
+#endif
+
+/* 
+This is for 64bit large file support (LFS),
+*/
+#define LFS
+#ifdef LFS
+#ifdef SOLARIS
+#define _LARGEFILE64_SOURCE 1
+#endif
+#define _FILE_OFFSET_BITS 64
+#endif
+
+#include <signal.h>
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <locale.h>
+#include <setjmp.h>
+#include <stdarg.h>
+#include <dirent.h>
+#include <limits.h>
+
+/* some Linux do UTF-8 but do not have wcsftime() 
+   buggy in some GCC, i.e. MinGW and Solaris
+*/
+
+#ifdef SUPPORT_UTF8
+#ifdef LINUX
+#include <wchar.h>
+#define WCSFTIME
+#endif
+#ifdef WIN_32
+#include <wchar.h>
+#endif
+#endif
+
+#ifdef WIN_32
+#include <windef.h>
+#include <winbase.h>
+#else
+#include <termios.h>
+#include <sys/wait.h>
+#endif
+
+#include <unistd.h>
+#include <sys/time.h>
+#include <math.h>
+#include <float.h>
+#include <string.h>
+#include <ctype.h>
+#include <fcntl.h>
+#include <stdarg.h>
+#include <time.h>
+#include <sys/stat.h>
+#include <sys/timeb.h>
+#include <sys/types.h>
+
+#ifndef SOLARIS
+#ifndef _BSD
+#ifndef MAC_OSX
+#include <malloc.h>
+#endif
+#endif
+#else
+#include <alloca.h>
+#endif
+
+#ifdef OS2
+#define vasprintf my_vasprintf 
+#define MY_VASPRINTF 
+#endif
+
+#ifdef MAC_OSX
+#define vasprintf my_vasprintf
+#define MY_VASPRINTF
+#endif
+
+#ifdef SOLARIS
+#define vasprintf my_vasprintf
+#define setenv my_setenv
+#define MY_VASPRINTF
+#define MY_SETENV
+#define MY_RAND_MAX 2147483647
+#endif
+
+#ifdef WIN_32
+#define LITTLE_ENDIAN
+#define MY_VASPRINTF
+#define MY_SETENV
+#define LINE_FEED "\r\n"
+#define isSocketStream(A) ((A)->_flag == 0xFFFF)
+#define getSocket(A) ((A)->_file)
+#define vasprintf my_vasprintf
+#define setenv my_setenv
+#define random rand
+#define srandom srand
+#define ioctl ioctlsocket
+#define off_t off64_t
+#define lseek lseek64
+#define ftell ftello64
+
+#ifndef SUPPORT_UTF8 
+#define mkdir  _mkdir
+#define rmdir  _rmdir
+#define lstat stat
+#endif
+
+#define realpath win32_realpath
+
+/* WIN_32 UTF16 support for file paths */
+#ifdef SUPPORT_UTF8 
+#define USE_WIN_UTF16PATH
+#define rename rename_utf16
+#define open open_utf16
+#define mkdir mkdir_utf16
+#define rmdir rmdir_utf16
+#define unlink unlink_utf16
+#define chdir chdir_utf16
+#define opendir opendir_utf16
+
+#define DIR _WDIR
+#define lstat _wstat
+#define dirent _wdirent
+#define readdir _wreaddir
+#define closedir _wclosedir
+#endif /* SUPPORT_UTF8 */
+
+#endif /* WIN_32 */
+
+
+#ifndef WIN_32
+#define LINE_FEED "\n"
+#define NET_PING
+#define NANOSLEEP
+#endif
+
+#ifndef O_BINARY
+#define O_BINARY 0
+#endif
+
+#define UTF8_MAX_BYTES 6
+
+#define UINT unsigned long 
+
+#define INT16 short int
+#ifndef NEWLISP64
+#define MAX_LONG 0x7FFFFFFF
+#else
+#define MAX_LONG 0x7FFFFFFFFFFFFFFFLL
+#endif
+
+#ifndef NEWLISP64
+#ifdef TRU64
+#define INT64 long
+#define UINT64 unsigned long
+#else
+#define INT64 long long int
+#define UINT64 unsigned long long int
+#endif
+#else
+#define INT64 long
+#define UINT64 unsigned long
+#endif
+
+#define pushEnvironment(A) (*(envStack + envStackIdx++) = (UINT)(A))
+#define popEnvironment() (*(envStack + --envStackIdx))
+
+#define pushResult(A) (*(resultStack + resultStackIdx++) = (UINT)(A))
+#define popResult() ((CELL *)*(resultStack + --resultStackIdx))
+
+#define freeMemory free
+
+#define INT32_MIN_AS_INT64 (((long long int)0xFFFFFFFF << 32) | 0x80000000)
+#define MY_INT64_MAX (((long long int)0x7FFFFFFF << 32) | 0xFFFFFFFF)
+#define TRUE 1
+#define FALSE 0
+  
+#define MAX_STRING 2048
+#define MAX_LINE 255
+#define MAX_SYMBOL 255
+
+#define MAX_READ_LEN 0x4000
+#define MAX_PRINT_LEN 0x4000
+#define MAX_LOAD_BUFFER 0x4000
+#define MAX_FILE_BUFFER 0x4000
+#define MAX_BLOCK 1023
+#define MAX_URL_LEN 256
+
+#define MAX_REGEX_EXP 16
+
+/* token types */
+#define TKN_ERROR -1
+#define TKN_EMPTY 0
+#define TKN_CHARACTER 1
+#define TKN_HEX 2
+#define TKN_OCTAL 3
+#define TKN_DECIMAL 4
+#define TKN_FLOAT 5
+#define TKN_STRING 6
+#define TKN_SYMBOL 7
+#define TKN_CONTEXT 8
+#define TKN_LEFT_PAR '('
+#define TKN_RIGHT_PAR ')'
+#define TKN_QUOTE '\''
+
+/* symbol flags types and masks */
+#define PRINT_TYPE_MASK 0x0F
+#define SYMBOL_PROTECTED 0x10
+#define SYMBOL_GLOBAL 0x20
+#define SYMBOL_BUILTIN 0x40
+#define SYMBOL_PRIMITIVE 0x80
+
+/* cell masks */
+#define RAW_TYPE_MASK 0x0FFF
+#define COMPARE_TYPE_MASK 0x000F
+#define ENVELOPE_TYPE_MASK 0x0010
+#define LIST_TYPE_MASK 0x0020
+#define SYMBOL_TYPE_MASK 0x0040
+#define NUMBER_TYPE_MASK 0x0080
+#define EVAL_SELF_TYPE_MASK 0x0100
+#define INT64_MASK 0x0200
+
+/* cell types */
+#define CELL_NIL (0 | EVAL_SELF_TYPE_MASK)
+#define CELL_TRUE (1 | EVAL_SELF_TYPE_MASK)
+#define CELL_INT 2 /* any INT */
+#define CELL_LONG (2 | EVAL_SELF_TYPE_MASK | NUMBER_TYPE_MASK)
+#define CELL_INT64 (2 | EVAL_SELF_TYPE_MASK | NUMBER_TYPE_MASK | INT64_MASK)
+#define CELL_FLOAT (3 | EVAL_SELF_TYPE_MASK | NUMBER_TYPE_MASK)
+#define CELL_STRING (4 | EVAL_SELF_TYPE_MASK)
+#define CELL_SYMBOL (5 | SYMBOL_TYPE_MASK)
+#define CELL_CONTEXT 6
+#define CELL_PRIMITIVE (7 | EVAL_SELF_TYPE_MASK)
+#define CELL_IMPORT_CDECL (8 | EVAL_SELF_TYPE_MASK)
+#define CELL_IMPORT_DLL (9 | EVAL_SELF_TYPE_MASK)
+#define CELL_QUOTE (10 | ENVELOPE_TYPE_MASK)
+#define CELL_EXPRESSION (11 | ENVELOPE_TYPE_MASK | LIST_TYPE_MASK)
+#define CELL_LAMBDA (12 | ENVELOPE_TYPE_MASK | LIST_TYPE_MASK | EVAL_SELF_TYPE_MASK)
+#define CELL_MACRO (13 | ENVELOPE_TYPE_MASK | LIST_TYPE_MASK | EVAL_SELF_TYPE_MASK)
+#define CELL_ARRAY (14 | ENVELOPE_TYPE_MASK | EVAL_SELF_TYPE_MASK)
+#define CELL_DYN_SYMBOL (15 | SYMBOL_TYPE_MASK)
+#define CELL_FREE 0xFF
+
+#define isEnvelope(A) ((A) & ENVELOPE_TYPE_MASK)
+#define isList(A) ((A) & LIST_TYPE_MASK)
+#define isArray(A) ((A) == CELL_ARRAY)
+#define isString(A) ((A) == CELL_STRING)
+#define isNumber(A) ((A) & NUMBER_TYPE_MASK)
+#define isSymbol(A) ((A) & SYMBOL_TYPE_MASK)
+#define isSelfEval(A) ((A) & EVAL_SELF_TYPE_MASK)
+#define isProtected(A) ((A) & SYMBOL_PROTECTED)
+#define isGlobal(A) ((A) & SYMBOL_GLOBAL)
+#define isDigit(A) isdigit((int)(A))
+
+#define isNil(A) ((A)->type == CELL_NIL || ((A)->type == CELL_SYMBOL && (A)->contents == (UINT)nilSymbol))
+#define isTrue(A) ((A)->type == CELL_TRUE || ((A)->type == CELL_SYMBOL && (A)->contents == (UINT)trueSymbol))
+#define isEmpty(A) ((A)->type == CELL_EXPRESSION && (A)->contents == (UINT)nilCell)
+
+#define symbolType(A) ((CELL*)(A)->contents)->type
+
+/* redefine some functions */
+#ifdef NEWLISP64
+#define stuffInteger64 stuffInteger
+#endif
+
+
+/* RED BLACK binary balanced tree: nl-symbol.c */
+#define BLACK 0
+#define RED 1
+#define NIL_SYM &sentinel
+#define LOOKUP_ONLY 0		/* symbol lookup only, if not found return NULL */
+#define FORCE_CREATION 1	/* if symbol does not exist, create it */
+
+
+/* traceFlag */
+#define TRACE_TRUE 0x0001
+#define TRACE_IN_ENTRY 0x0002
+#define TRACE_IN_EXIT 0x0004
+#define TRACE_IN_DEBUG 0x0008
+#define TRACE_DEBUG_PENDING 0x0010
+#define TRACE_DEBUG_EVAL 0x0020
+#define TRACE_DEBUG_STEP 0x0040
+#define TRACE_DEBUG_NEXT 0x0080
+#define TRACE_SIGINT 0x1000
+#define TRACE_TIMER  0x2000
+#define TRACE_SIGNAL 0x4000
+
+/* error handling */
+
+#define ERR_NOT_ENOUGH_MEMORY 1
+#define ERR_OUT_OF_ENV_STACK 2
+#define ERR_OUT_OF_CALL_STACK 3
+#define ERR_ACCESSING_FILE 4
+#define ERR_EXPRESSION 5
+#define ERR_MISSING_PAR 6
+#define ERR_STRING_TOO_LONG 7
+#define ERR_MISSING_ARGUMENT 8
+#define ERR_NUMBER_OR_STRING_EXPECTED 9
+#define ERR_NUMBER_EXPECTED 10
+#define ERR_STRING_EXPECTED 11
+#define ERR_SYMBOL_EXPECTED 12
+#define ERR_CONTEXT_EXPECTED 13
+#define ERR_SYMBOL_OR_CONTEXT_EXPECTED 14
+#define ERR_LIST_EXPECTED 15
+#define ERR_LIST_OR_ARRAY_EXPECTED 16
+#define ERR_LIST_OR_SYMBOL_EXPECTED 17
+#define ERR_LIST_OR_STRING_EXPECTED 18
+#define ERR_LIST_OR_NUMBER_EXPECTED 19
+#define ERR_ARRAY_EXPECTED 20
+#define ERR_ARRAY_LIST_OR_STRING_EXPECTED 21
+#define ERR_LAMBDA_EXPECTED 22
+#define ERR_MACRO_EXPECTED 23
+#define ERR_INVALID_FUNCTION 24
+#define ERR_INVALID_LAMBDA 25
+#define ERR_INVALID_MACRO 26
+#define ERR_INVALID_LET 27
+#define ERR_SAVING_FILE 28
+#define ERR_MATH 29
+#define ERR_NOT_MATRIX 30
+#define ERR_WRONG_DIMENSIONS 31
+#define ERR_SINGULAR 32
+#define ERR_REGULAR_EXPRESSION 33
+#define ERR_THROW_WO_CATCH 34
+#define ERR_IMPORT_LIB_NOT_FOUND 35
+#define ERR_IMPORT_FUNC_NOT_FOUND 36
+#define ERR_SYMBOL_PROTECTED 37
+#define ERR_NUMBER_OUT_OF_RANGE 38
+#define ERR_REGEX 39
+#define ERR_MISSING_TEXT_END 40
+#define ERR_FORMAT_NUM_ARGS 41
+#define ERR_FORMAT_STRING 42
+#define ERR_FORMAT_DATA_TYPE 43
+#define ERR_INVALID_PARAMETER 44
+#define ERR_INVALID_PARAMETER_0 45
+#define ERR_INVALID_PARAMETER_NAN 46
+#define ERR_ILLEGAL_TYPE 47
+#define ERR_NOT_IN_MAIN 48
+#define ERR_NOT_CURRENT_CONTEXT 49
+#define ERR_TARGET_NO_MAIN 50
+#define ERR_LIST_INDEX_OUTOF_BOUNDS 51
+#define ERR_ARRAY_INDEX_OUTOF_BOUNDS 52
+#define ERR_STRING_INDEX_OUTOF_BOUNDS 53
+#define ERR_NESTING_TOO_DEEP 54
+#define ERR_SYNTAX_WRONG 55
+#define ERR_USER_ERROR 56
+#define ERR_USER_RESET 57
+#define ERR_SIGINT 58
+#define ERR_NOT_REENTRANT 59
+#define MAX_ERROR_NUMBER 59
+
+/* I/O routines */
+
+#define OUT_NULL 0
+#define OUT_DEVICE 1
+#define OUT_CONSOLE 2
+#define OUT_LOG 3
+
+/* HTTP in nl-web.c */
+#define HTTP_GET_URL 0
+#define HTTP_GET_HEAD 1
+#define HTTP_PUT_URL 2
+#define HTTP_PUT_APPEND_URL 3
+#define HTTP_POST_URL 4
+#define HTTP_DELETE_URL 5
+
+/* additional regex option */
+#define REPLACE_ONCE 0x8000
+
+extern int vasprintf (char **, const char *, va_list);
+
+/* ---------------------------- standard types ------------------------- */
+
+typedef struct
+	{
+	int handle;
+	char *ptr;
+	char *buffer;
+	size_t position;
+	size_t size;
+	} STREAM;
+
+typedef struct tagSYMBOL
+	{
+	short int flags;
+	short int color;
+	char * name;
+	UINT contents; 
+	struct tagSYMBOL * context;
+	struct tagSYMBOL * parent;
+	struct tagSYMBOL * left;
+	struct tagSYMBOL * right;   
+	} SYMBOL;
+
+typedef struct 
+	{
+	UINT type;
+	void * next;
+	UINT aux;
+	UINT contents;
+	} CELL;
+
+typedef struct
+	{
+	char * name;
+	CELL * (*function)(CELL *);
+	short int prettyPrint;
+	} PRIMITIVE;
+
+/* --------------------------- globals -------------------------------- */
+
+extern char startupDir[];
+extern FILE * IOchannel;
+extern int MAX_CPU_STACK;
+extern long MAX_CELL_COUNT;
+extern int version;
+extern int opsys;
+extern char ostype[];
+extern size_t cellCount;
+extern size_t symbolCount;
+extern int recursionCount;
+extern UINT printDevice;
+extern UINT * resultStack;
+extern UINT * envStack;
+extern int resultStackIdx;
+extern int envStackIdx;
+extern CELL * trueCell;
+extern CELL * nilCell;
+extern STREAM strStream;
+extern SYMBOL * nilSymbol;
+extern SYMBOL * trueSymbol;
+extern SYMBOL * startSymbol;
+extern SYMBOL * questionSymbol;
+extern SYMBOL * atSymbol;
+extern SYMBOL * mainContext;
+extern SYMBOL * currentContext;
+extern SYMBOL * errorEvent;
+extern SYMBOL sentinel;
+extern int commandLineFlag;
+extern int traceFlag;
+extern int errorReg;
+extern char * errorMessage[];
+extern jmp_buf errorJump;
+extern int pushResultFlag;
+extern int prettyPrintFlags;
+#define PRETTYPRINT_DOUBLE 1
+#define PRETTYPRINT_STRING 2
+extern char lc_decimal_point;
+/* end of file */
+
diff --git a/nl-debug.c b/nl-debug.c
new file mode 100644
index 0000000..be1bb81
--- /dev/null
+++ b/nl-debug.c
@@ -0,0 +1,419 @@
+/* nl-debug.c --- debugging functions for newLISP
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+
+#include "newlisp.h"
+#include "protos.h"
+
+#ifdef WIN_32
+#define fgets win32_fgets
+#endif
+
+extern FILE * IOchannel;
+extern int evalSilent;
+
+int matchString(char * buffer,  char * string, int * length);
+int stringComp(char * buffer, char * string);
+int printFunction(CELL * cell);
+void getDebuggerInput(char * msg);
+void allocateDebugStack(void);
+
+extern SYMBOL * currentFunc;
+extern SYMBOL * timerEvent;
+extern SYMBOL * symHandler[];
+extern int currentSignal;
+
+int currentLevel = 0;
+int debugStackIdx = 0;
+UINT * debugStack;
+
+char preStr[8] = "#";
+char postStr[8] = "#";
+char headerStr[16] = "\n-----\n\n";
+char footerStr[32] = " s|tep n|ext c|ont q|uit > ";
+
+#define pushDebugStack(A) (*(debugStack + debugStackIdx++) = (UINT)(A))
+#define popDebugStack() (*(debugStack + --debugStackIdx))
+
+#define DEBUG_ENTRY "->"
+#define DEBUG_EXIT "<-"
+
+
+void openTrace(void)	
+	{
+	if(traceFlag) return;
+	traceFlag = TRUE;
+	currentFunc = nilSymbol;
+	debugStackIdx = 0;
+	allocateDebugStack();
+	}
+
+void closeTrace(void)
+	{
+/*	printf("closing trace\n"); */
+	traceFlag = 0;
+	if(debugStack) free(debugStack);
+	debugStack = NULL;
+	}
+
+
+
+CELL * p_debug(CELL * params)
+{
+CELL * result;
+
+openTrace();
+result = copyCell(evaluateExpression(params));
+closeTrace();
+
+return(result);
+}
+
+
+CELL * p_trace(CELL * params)
+{
+if(params != nilCell)
+	{
+	if(getFlag(params))
+		openTrace();
+	else
+		closeTrace();
+	}
+
+return((traceFlag == 0 ? nilCell : trueCell));
+}
+
+CELL * p_traceHighlight(CELL * params)
+{
+char * pre, * post, * header, * footer;
+
+params = getString(params, &pre);
+params = getString(params, &post);
+
+strncpy(preStr, pre, 7);
+strncpy(postStr, post, 7);
+
+if(params != nilCell)
+	{
+	params = getString(params, &header);
+	strncpy(headerStr, header, 15);
+	}
+
+if(params != nilCell)
+	{
+	getString(params, &footer);
+	strncpy(footerStr, footer, 31);
+	}
+
+
+return(trueCell);
+}
+
+
+void traceEntry(CELL * cell, CELL * pCell, CELL * args)
+{
+int defaultFuncFlag = FALSE;
+
+if(traceFlag & (TRACE_IN_ENTRY | TRACE_IN_EXIT | TRACE_DEBUG_NEXT)) return;
+traceFlag |= TRACE_IN_ENTRY;
+
+if(traceFlag & TRACE_SIGNAL)
+	{
+	traceFlag &= ~TRACE_SIGNAL;
+	executeSymbol(symHandler[currentSignal - 1], stuffInteger(currentSignal));
+	traceFlag &= ~TRACE_IN_ENTRY;
+	return;
+	}
+
+if(traceFlag & TRACE_SIGINT)
+	{
+	traceFlag &= ~TRACE_SIGINT;
+	longjmp(errorJump, ERR_USER_RESET);
+	}
+	
+if(traceFlag & TRACE_TIMER)
+	{
+	traceFlag &= ~TRACE_TIMER;
+	executeSymbol(timerEvent, NULL);
+	traceFlag &= ~TRACE_IN_ENTRY;
+	return;
+	}
+	
+if(debugStackIdx > 1)
+	{
+	if(printFunction(cell))
+		getDebuggerInput(DEBUG_ENTRY);
+	if(!traceFlag) return;
+	}
+
+if(traceFlag & TRACE_DEBUG_NEXT)
+	{
+	traceFlag &= ~TRACE_IN_ENTRY;
+	return;
+	}
+
+if(pCell->type == CELL_CONTEXT)
+	{
+	defaultFuncFlag = TRUE;
+	currentFunc = translateCreateSymbol(
+			((SYMBOL*)pCell->contents)->name,
+			CELL_NIL,
+			(SYMBOL*)pCell->contents,
+			TRUE);
+
+	pCell = (CELL *)currentFunc->contents;
+	}
+
+if((pCell->type == CELL_LAMBDA || pCell->type == CELL_MACRO)
+	&& args->type == CELL_SYMBOL)
+	{
+	if(debugStackIdx == 0) /* startup */
+		traceFlag &= ~TRACE_DEBUG_NEXT;
+	
+	if(!defaultFuncFlag)
+		currentFunc = (SYMBOL *)args->contents;	
+	pushDebugStack(recursionCount);
+	pushDebugStack(currentFunc);
+	}
+
+traceFlag &= ~TRACE_IN_ENTRY;
+}
+
+
+void traceExit(CELL * result, CELL * cell, CELL * pCell, CELL * args)
+{
+if(traceFlag & (TRACE_IN_ENTRY | TRACE_IN_EXIT | TRACE_SIGNAL | TRACE_SIGINT | TRACE_TIMER)) return;
+traceFlag |= TRACE_IN_EXIT;
+
+if(traceFlag & TRACE_DEBUG_NEXT)
+	{
+	if(currentLevel >= recursionCount)
+		traceFlag &= ~TRACE_DEBUG_NEXT;
+	else 
+		{
+		traceFlag &= ~TRACE_IN_EXIT;
+		return;
+		}
+	}
+
+if( (pCell->type == CELL_LAMBDA || pCell->type == CELL_MACRO)
+		&& args->type == CELL_SYMBOL)
+	{
+	if((UINT)recursionCount == *(debugStack + debugStackIdx - 2) )
+		{
+		debugStackIdx -= 2;
+		if(debugStackIdx > 0)
+			currentFunc = (SYMBOL *)*(debugStack + debugStackIdx - 1);
+		if(debugStackIdx == 0)
+			traceFlag &= ~TRACE_DEBUG_NEXT;
+		}
+	}
+
+if(printFunction(cell))
+	{
+	varPrintf(OUT_CONSOLE, "\nRESULT: ");
+	printCell(result, TRUE, OUT_CONSOLE);
+	varPrintf(OUT_CONSOLE, "\n");
+
+	if(debugStackIdx > 0)
+		{
+		getDebuggerInput(DEBUG_EXIT);
+		if(!traceFlag) return;
+		}
+	}
+
+if(traceFlag & TRACE_DEBUG_NEXT)
+	currentLevel = recursionCount;
+
+traceFlag &= ~TRACE_IN_EXIT;
+}
+
+
+void getDebuggerInput(char * msg)
+{
+char command[MAX_LINE];
+char * context;
+jmp_buf errorJumpSave;
+int resultStackIdxSave;
+SYMBOL * contextSave;
+
+while(TRUE)
+	{
+
+	if(currentContext != mainContext)
+		context = currentContext->name;
+	else context = "";
+
+
+	if(!evalSilent)
+		varPrintf(OUT_CONSOLE, "\n[%s %d %s]%s", msg, recursionCount, context, footerStr);
+	else evalSilent = FALSE;
+
+	fgets(command, MAX_LINE - 1, IOchannel);
+
+	if( (strcmp(command, "n\n") == 0) || (strcmp(command, "n\r\n") == 0))
+		{
+		traceFlag |= TRACE_DEBUG_NEXT;
+		currentLevel = recursionCount;
+		break;
+		}
+	else if( (strcmp(command, "s\n") == 0) || (strcmp(command, "s\r\n") == 0))
+		{
+		traceFlag &= ~TRACE_DEBUG_NEXT;
+		break;
+		}
+	else if( (strcmp(command, "q\n") == 0) || (strcmp(command, "q\r\n") == 0))
+		{
+		closeTrace();
+		longjmp(errorJump, ERR_USER_RESET);
+		}
+	else if( (strcmp(command, "c\n") == 0) || (strcmp(command, "c\r\n") == 0))
+		{
+		closeTrace();
+		break;
+		}
+
+	resultStackIdxSave = resultStackIdx;
+	memcpy(errorJumpSave, errorJump, sizeof(jmp_buf));
+	contextSave = currentContext;
+	currentContext = currentFunc->context;
+	if(setjmp(errorJump))
+		{
+		cleanupResults(resultStackIdxSave);
+		goto DEBUG_EVAL_END;
+		}
+
+	executeCommandLine(command, OUT_CONSOLE, NULL);	
+
+	DEBUG_EVAL_END:
+	currentContext = contextSave;
+	memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+	}
+}
+
+
+int printFunction(CELL * cell)
+{
+char * funcStr;
+char * expStr;
+int start, length;
+STREAM strStream;
+
+if(currentFunc == nilSymbol) return FALSE;
+
+openStrStream(&strStream, MAX_STRING, 0);
+printSymbol(currentFunc, (UINT)&strStream);
+length = strlen(strStream.buffer);
+funcStr = allocMemory(length + 1);
+memcpy(funcStr, strStream.buffer, length + 1);
+*(funcStr + length) = 0;
+
+openStrStream(&strStream, MAX_STRING, 0);
+printCell((CELL *)cell, TRUE, (UINT)&strStream);
+expStr = strStream.buffer;
+start = matchString(funcStr, expStr, &length);
+closeStrStream(&strStream);
+
+if(start == -1 || length == 0)
+	{
+	free(funcStr);
+	return FALSE;
+	}
+
+varPrintf(OUT_CONSOLE, headerStr);
+
+expStr = allocMemory(length + 1);
+strncpy(expStr, funcStr + start, length);
+*(expStr + length) = 0;
+*(funcStr + start) = 0;
+
+varPrintf(OUT_CONSOLE, "%s%s%s%s%s", 
+	funcStr, preStr, expStr, postStr, funcStr + start + length);
+
+free(funcStr);
+
+return TRUE;
+}
+
+
+void allocateDebugStack(void)
+{
+debugStack = (UINT *)allocMemory(MAX_CPU_STACK * 2 * sizeof(UINT));
+}
+
+/* search for a string skipping white space
+*/
+int matchString(char * buffer,  char * string, int * length)
+{
+int position, flag;
+
+/* strip leading white space */
+while(*string <= ' ' && *string > 0) string++;
+
+position = flag = 0;
+
+while(*buffer)
+	{
+	if(*buffer > ' ')
+		if((*length = stringComp(buffer, string)) > 0)
+			{
+			flag = TRUE;
+			break;
+			}
+	position++;
+	buffer++;
+	}
+
+if(!flag) return(-1);
+return(position);
+}
+
+
+/* compare strings skipping white space
+*/
+int stringComp(char * buffer, char * string)
+{
+char * start;
+
+start = buffer;
+while(*string && *buffer)
+	{
+	if(*string > ' ')
+		{
+		if(*buffer > ' ')
+			{
+			if(*string != *buffer) return(0);
+			string++;
+			buffer++;
+			}
+		else buffer++;
+		}
+	else string++;
+	}
+	
+if(*string == 0)
+	return(buffer - start);
+	
+return(0);
+}
+
+
+/* eof */
+
+
diff --git a/nl-filesys.c b/nl-filesys.c
new file mode 100644
index 0000000..1905f84
--- /dev/null
+++ b/nl-filesys.c
@@ -0,0 +1,2281 @@
+/* nl-filesys.c --- I/O process control, date/time - functions for newLISP
+
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+#include "newlisp.h"
+#include <errno.h>
+#include "protos.h"
+
+#ifdef SOLARIS
+#include <stropts.h>
+#ifndef TRU64
+#define FIONREAD I_NREAD
+#endif
+#endif
+
+#ifndef WIN_32
+#include <sys/types.h>
+#include <sys/ipc.h>
+#include <sys/sem.h>
+#include <sys/mman.h>
+#include <sys/ioctl.h>
+#endif
+
+int init_argv(char * ptr, char *argv[]);
+
+#ifdef OS2
+#include <conio.h>
+int semctl(int semid, int semnum, int cmd, ...);
+#endif
+
+#ifdef MAC_OSX
+#ifdef LIBRARY
+char ** environ = NULL;
+#else
+extern char ** environ;
+#endif
+#else
+#ifndef TRU64
+extern char ** environ;
+#endif
+#endif
+
+
+#ifdef WIN_32
+#define fgetc win32_fgetc
+#define random rand
+#define srandom srand
+#include <process.h>
+#include <conio.h>  
+#include <dir.h>
+#define popen  _popen
+#define pclose _pclose
+#define pipe _pipe
+
+/* 
+Set binary as default file mode for Windows.
+See also http://www.mingw.org/MinGWiki/index.php/binary
+*/
+unsigned int _CRT_fmode = _O_BINARY;
+
+/* not needed with MinGW gcc 3.4.5
+struct timezone
+	{
+	int tz_minuteswest;
+	int tz_dsttime;
+	};
+*/
+
+/* with MinGW gcc 3.4.5 not needed
+int gettimeofday( struct timeval *tp, struct timezone *tzp );
+*/
+
+int setenv (const char *name, const char *value, int replace);
+#ifdef USE_WIN_UTF16PATH
+INT64 fileSizeW(WCHAR * pathName);
+#endif
+
+#endif
+
+#ifndef WIN_32
+#include <sys/socket.h>
+#define SOCKET_ERROR -1
+#define INVALID_SOCKET -1
+#endif
+
+#ifdef LINUX
+char * strptime(const char * str, const char * fmt, struct tm * ttm);
+#endif
+
+size_t calcDateValue(int year, int month, int day, int hour, int min, int sec);
+
+extern STREAM readLineStream;
+extern FILE * IOchannel;
+
+CELL * p_isFile(CELL * params) /* includes dev,socket,dir,file etc. */
+{
+char * fileName;
+
+getString(params, &fileName);
+if(isFile(fileName) == 0)
+	return(trueCell);
+
+return(nilCell);
+}
+
+int isFile(char * fileName)
+{
+struct stat fileInfo;
+
+
+#ifdef USE_WIN_UTF16PATH
+return(stat_utf16(fileName, &fileInfo));
+#else
+return(stat(fileName, &fileInfo));
+#endif
+}
+
+CELL * p_isDirectory(CELL * params)
+{
+char * fileName;
+
+getString(params, &fileName);
+if(isDir(fileName)) return(trueCell);
+return(nilCell); 
+}
+
+
+int isDir(char * fileName)
+{
+struct stat fileInfo;
+
+#ifdef WIN32
+char slash;
+size_t len;
+
+len = strlen(fileName);
+slash = *(fileName + len - 1);
+if(slash == '\\' || slash == '/')
+	*(fileName + len - 1) = 0;
+#endif
+	
+
+
+#ifdef USE_WIN_UTF16PATH
+if(stat_utf16(fileName, &fileInfo) != 0)
+#else
+if(stat(fileName, &fileInfo) != 0)
+#endif
+	{
+#ifdef WIN32
+	*(fileName + len - 1) = slash;
+#endif
+	return(0);
+	}
+
+#ifdef WIN32
+*(fileName + len - 1) = slash;
+#endif
+
+if(S_ISDIR(fileInfo.st_mode))
+	return(1);
+return(0);
+}
+
+
+
+CELL * p_open(CELL * params)
+{
+char * fileName;
+char * accessMode;
+char * option = NULL;
+int handle;
+
+params = getString(params, &fileName);
+params = getString(params, &accessMode);
+
+if(params != nilCell)
+	getString(params, &option);
+	
+if( (handle = openFile(fileName, accessMode, option)) == (int)-1)
+	return(nilCell);
+return(stuffInteger((UINT)handle));
+}
+
+CELL * p_close(CELL * params)
+{
+UINT handle;
+
+getInteger(params, &handle);
+if(handle == 0) return(nilCell);
+if(handle == printDevice) printDevice = 0;
+if(close((int)handle) == -1) return(nilCell);
+return(trueCell);
+}
+
+CELL * p_readChar(CELL * params)
+{
+UINT handle;
+unsigned char chr;
+
+getInteger(params, &handle);
+if(read((int)handle, &chr, 1) <= 0) return(nilCell);
+
+return(stuffInteger((UINT)chr));
+}
+
+
+CELL * p_readBuffer(CELL * params)
+{
+UINT handle;
+size_t size, length;
+ssize_t bytesRead = 0;
+int found = 0;
+char * waitFor;
+char chr;
+STREAM stream;
+CELL * strCell;
+SYMBOL * readSptr;
+
+params = getInteger(params, &handle);
+params = getSymbol(params, &readSptr);
+params = getInteger(params, (UINT *)&size);
+
+if(isProtected(readSptr->flags))
+	return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(readSptr)));
+
+memset(&stream, 0, sizeof(stream));
+
+if(params == nilCell)
+	{
+	openStrStream(&stream, size, 0);
+	found = 1;
+	if((bytesRead = read(handle, stream.buffer, size)) == -1)
+		{
+		closeStrStream(&stream); 
+		return(nilCell);
+		}
+	}
+else
+	{
+	getString(params, &waitFor);
+	openStrStream(&stream, MAX_LINE, 0);
+	length = strlen(waitFor);
+	while(bytesRead < size)
+		{
+		if(read(handle, &chr, 1) <= 0)
+			break;
+
+		writeStreamChar(&stream, chr); 
+ 		if(++bytesRead < length) continue;
+		if(strcmp(waitFor,  stream.ptr - length) == 0)
+ 			{
+			found = 1;
+			break;
+			}		
+		}			
+	}
+	
+if(bytesRead == 0) 
+	{ 
+	deleteList((CELL *)readSptr->contents);
+	readSptr->contents = (UINT)nilCell;
+	closeStrStream(&stream); 
+	return(nilCell);
+	} 
+
+strCell = getCell(CELL_STRING);
+strCell->aux = bytesRead + 1;
+stream.buffer = reallocMemory(stream.buffer, bytesRead +1);
+strCell->contents = (UINT)stream.buffer;
+
+deleteList((CELL *)readSptr->contents);
+readSptr->contents = (UINT)strCell;
+
+if(found)
+	return(stuffInteger(bytesRead));
+return(nilCell);
+}
+
+CELL * p_readFile(CELL * params)
+{
+char * fileName;
+char * buffer = NULL;
+CELL * cell;
+ssize_t size;
+
+params = getString(params, &fileName);
+if(my_strnicmp(fileName, "http://", 7) == 0)
+	return(getPutPostDeleteUrl(fileName, params, HTTP_GET_URL, 0));
+
+if(my_strnicmp(fileName, "file://", 7) == 0)
+	fileName = fileName + 7;
+
+if((size = readFile(fileName, &buffer)) == -1)
+	return(nilCell);
+
+cell = getCell(CELL_STRING);
+cell->aux = size + 1;
+cell->contents = (UINT)buffer;
+
+return(cell);
+}
+
+/* allocate a buffer and reads a file into it */
+ssize_t readFile(char * fileName, char * * buffer)
+{
+int handle; 
+size_t size;
+struct stat fileInfo;
+
+#ifdef USE_WIN_UTF16PATH
+if(stat_utf16(fileName, &fileInfo) != 0)
+#else
+if(stat(fileName, &fileInfo) != 0)
+#endif
+	return(-1);
+
+size = fileInfo.st_size;
+
+if( (handle = openFile(fileName, "r", NULL)) == (int)-1)
+	return(-1);
+
+*buffer = callocMemory(size+1);
+
+if(read(handle, *buffer, size) == -1)
+	{
+	freeMemory(*buffer);
+        close(handle);
+	*buffer = NULL;
+	return(-1);
+	}
+
+close(handle);
+
+return(size);
+}
+
+
+
+CELL * p_writeChar(CELL * params)
+{
+UINT handle;
+UINT data;
+size_t count;
+unsigned char chr;
+
+params = getInteger(params, &handle);
+count = 0;
+
+while(params != nilCell)
+	{
+	params = getInteger(params, &data);
+	chr = (unsigned char)data;
+	if(write((int)handle, (void *)&chr, 1) == -1)
+		return(nilCell);
+	++count;
+	}
+	
+return(stuffInteger(count));
+}
+
+
+size_t appendCellString(CELL * cell, char * buffer, size_t size)
+{
+cell->contents = (UINT)reallocMemory((char *)cell->contents, cell->aux + size);
+memcpy((char *)cell->contents + cell->aux - 1, buffer, size);
+cell->aux += size;
+
+*((char *)cell->contents + cell->aux - 1) = 0; 
+
+return(size);
+}
+
+
+CELL * p_writeBuffer(CELL * params)
+{
+UINT handle;
+ssize_t bytesWritten;
+size_t size;
+char * buffer;
+CELL * strCell;
+SYMBOL * writeSptr;
+CELL * cell;
+CELL * flagPtr = NULL;
+
+cell = evalCheckProtected(params, &flagPtr);
+
+params = params->next;
+
+if(isNumber(cell->type))
+	{
+	getIntegerExt(cell, &handle, FALSE); 
+	cell = NULL;
+	}
+else if(cell->type != CELL_STRING) 
+	return(errorProc(ERR_NUMBER_OR_STRING_EXPECTED));
+
+strCell = evaluateExpression(params);
+if(strCell->type == CELL_SYMBOL)
+    {
+    writeSptr = (SYMBOL *)strCell->contents;
+    strCell = (CELL *)writeSptr->contents;
+    }
+else if(strCell->type == CELL_DYN_SYMBOL)
+    {
+    writeSptr = getDynamicSymbol(strCell);
+    strCell = (CELL *)writeSptr->contents;
+    }
+
+if(strCell->type != CELL_STRING)
+	return(errorProcExt(ERR_STRING_EXPECTED, params));
+
+if(params->next == nilCell)
+	size = strCell->aux - 1;
+else       
+	getInteger(params->next, (UINT *)&size);
+
+buffer = (char *)strCell->contents;
+if(size > (strCell->aux - 1)) size = strCell->aux - 1;
+
+if(cell != NULL)
+	{
+	if(flagPtr) return(errorProcExt(ERR_SYMBOL_PROTECTED, flagPtr));
+	return(stuffInteger(appendCellString(cell, buffer, size)));
+	}
+
+if((bytesWritten = write((int)handle, buffer, size)) == (UINT)-1)
+	return(nilCell);
+
+return(stuffInteger(bytesWritten));
+}
+
+
+CELL * p_appendFile(CELL * params)
+{
+return(appendWriteFile(params, "a"));
+}
+
+CELL * p_writeFile(CELL * params)
+{
+return(appendWriteFile(params, "w"));
+}
+
+
+CELL * appendWriteFile(CELL * params, char * type)
+{
+char * fileName;
+int handle;
+char * buffer;
+size_t size;
+
+params = getString(params, &fileName);
+
+if(my_strnicmp(fileName, "http://", 7) == 0)
+	return(getPutPostDeleteUrl(fileName, params, 
+				(*type == 'w') ? HTTP_PUT_URL : HTTP_PUT_APPEND_URL, 0));
+
+if(my_strnicmp(fileName, "file://", 7) == 0)
+	fileName = fileName + 7;
+
+getStringSize(params, &buffer, &size, TRUE);
+
+if( (handle = openFile(fileName, type, NULL)) == (int)-1)
+	return(nilCell);
+
+if(write((int)handle, buffer, size) == -1)
+	return(nilCell);
+
+close(handle);
+
+return(stuffInteger(size));
+}
+
+
+CELL * p_writeLine(CELL * params)
+{
+char * buffer;
+UINT handle;
+CELL * flagPtr = NULL;
+size_t size;
+
+if(params->type == CELL_NIL)
+	buffer = readLineStream.buffer;
+else
+	params = getStringSize(params, &buffer, &size, TRUE);
+
+if(params != nilCell)
+	{
+	params = evalCheckProtected(params, &flagPtr);
+	if(isNumber(params->type))
+		{
+		getIntegerExt(params, &handle, FALSE);
+		if(write((int)handle, buffer, strlen(buffer)) == -1) return(nilCell);
+		if(write((int)handle, LINE_FEED, strlen(LINE_FEED)) == -1) return(nilCell);
+		}
+	if(params->type == CELL_STRING)
+		{
+    	if(flagPtr) return(errorProcExt(ERR_SYMBOL_PROTECTED, flagPtr));
+		appendCellString(params, buffer, size);
+		appendCellString(params, LINE_FEED, strlen(LINE_FEED));
+		}
+	}
+else
+	{
+	varPrintf(OUT_DEVICE, "%s", buffer);
+	varPrintf(OUT_DEVICE, LINE_FEED);
+	}
+
+return(stuffString(buffer));
+}
+
+
+CELL * p_seek(CELL * params)
+{
+UINT handle;
+#ifdef LFS
+INT64 paramPosition;
+off_t newPosition;
+#else
+off_t paramPosition;
+off_t newPosition;
+#endif
+
+params = getInteger(params, &handle);
+
+if(params == nilCell)
+	{
+	if(handle == 0)
+		newPosition = ftell(stdout);
+	else if( (newPosition = lseek(handle, 0, SEEK_CUR)) == -1)
+		return(nilCell);
+	}
+else
+	{
+#ifdef LFS
+	getInteger64(params, &paramPosition);
+#else
+	getInteger(params, (UINT *)&paramPosition);
+#endif
+
+	newPosition = paramPosition;
+	if(newPosition == -1)
+		{
+		if( (newPosition = lseek((int)handle, 0, SEEK_END)) == -1)
+			return(nilCell);
+		}
+	else
+		{
+ 		if( lseek((int)handle, newPosition, SEEK_SET) == -1)
+			return(nilCell);
+		}
+	}
+
+paramPosition = newPosition;
+#ifdef LFS
+return(stuffInteger64(paramPosition));
+#else
+return(stuffInteger(paramPosition));
+#endif
+}
+
+
+char * readStreamLine(STREAM * stream, FILE * inStream)
+{
+int chr;
+
+openStrStream(stream, MAX_STRING, 1);
+
+#ifdef TRU64
+do {
+errno = 0;
+#endif
+while((chr = fgetc(inStream)) != EOF)
+	{
+	if(chr == '\n') break;
+	if(chr == '\r')
+		{
+		chr = fgetc(inStream);
+		if(chr == '\n' || chr == EOF) break;
+		}
+	writeStreamChar(stream, chr);
+	}
+#ifdef TRU64
+} while (errno == EINTR);
+#endif
+
+if(chr == EOF && stream->position == 0) return(NULL);
+return(stream->buffer);
+}
+
+
+CELL * p_readLine(CELL * params)
+{
+UINT handle;
+unsigned char chr;
+char * line;
+int bytesRead;
+
+
+if(params != nilCell)
+	getInteger(params, &handle);
+else 
+	handle = printDevice;
+
+if(handle == 0) 
+	{
+	if((line = readStreamLine(&readLineStream, IOchannel)) == NULL)
+		return(nilCell);
+
+	return(stuffString(line));
+	}
+
+openStrStream(&readLineStream, MAX_STRING, 1);
+while(TRUE)
+	{
+	if((bytesRead = read((int)handle, &chr, 1)) <= 0) break;
+	if(chr == '\n') break;
+	if(chr == '\r')
+		{
+		if(read((int)handle, &chr, 1) < 0) break;
+		if(chr == '\n') break;
+		}
+	writeStreamChar(&readLineStream, chr);
+	}
+
+if(bytesRead <= 0 && readLineStream.position == 0)
+	return(nilCell);
+
+return(stuffString(readLineStream.buffer));;
+}
+
+
+CELL * p_currentLine(CELL * params)
+{
+return(stuffString(readLineStream.buffer));
+}
+
+
+int openFile(char * fileName, char * accessMode, char * option)
+{
+int blocking = 0;
+
+#ifndef WIN_32
+if(option != NULL && *option == 'n')
+	blocking = O_NONBLOCK;
+#endif
+
+if(*accessMode == 'r')
+	return(open(fileName, O_RDONLY | O_BINARY | blocking, 0));
+
+else if(*accessMode == 'w')
+#ifdef WIN_32
+    return(open( fileName, O_WRONLY | O_CREAT | O_TRUNC | O_BINARY, S_IREAD | S_IWRITE) );
+#else
+    return(open(fileName,O_WRONLY | O_CREAT | O_TRUNC | O_BINARY | blocking, 
+        S_IRUSR | S_IRGRP | S_IROTH | S_IWUSR | S_IWGRP | S_IWOTH)); /* rw-rw-rw */
+#endif
+
+else if(*accessMode == 'u')
+	return(open(fileName, O_RDWR | O_BINARY, 0));
+
+else if(*accessMode == 'a')
+       {
+#ifdef WIN_32
+       return(open(fileName, O_RDWR | O_APPEND | O_BINARY | O_CREAT, S_IREAD | S_IWRITE));
+#else
+       return(open(fileName, O_RDWR | O_APPEND | O_BINARY | O_CREAT,
+          S_IRUSR | S_IRGRP | S_IROTH | S_IWUSR | S_IWGRP | S_IWOTH)); /* rw-rw-rw */
+#endif
+       }
+
+return(-1);
+}
+
+/* ------------------------- directory management ------------------------- */
+
+CELL * p_copyFile(CELL * params)
+{
+char * fromName;
+char * toName;
+int fromHandle, toHandle;
+unsigned char * copyBuffer;
+UINT bytesRead;
+
+params = getString(params, &fromName);
+getString(params, &toName);
+
+if((fromHandle = openFile(fromName, "read", NULL)) < 0)
+	return(nilCell);
+
+if((toHandle = openFile(toName,"write", NULL)) < 0)
+	return(nilCell);
+
+copyBuffer = allocMemory(MAX_FILE_BUFFER);
+do
+	{
+	bytesRead = read(fromHandle, copyBuffer, MAX_FILE_BUFFER);
+	write(toHandle, copyBuffer, (int)bytesRead);
+	} while (bytesRead == MAX_FILE_BUFFER);
+
+free(copyBuffer);
+
+close((int)fromHandle);
+close((int)toHandle);
+
+return(trueCell);
+}
+
+
+CELL * p_renameFile(CELL * params)
+{
+char *oldName;
+char *newName;
+
+params = getString(params, &oldName);
+getString(params, &newName);
+return(rename(oldName, newName) == 0 ? trueCell : nilCell);
+}
+
+
+CELL * p_deleteFile(CELL * params)
+{
+char * fileName;
+
+params = getString(params, &fileName);
+if(my_strnicmp(fileName, "http://", 7) == 0)
+	return(getPutPostDeleteUrl(fileName, params, HTTP_DELETE_URL, 0));
+
+return(unlink(fileName) == 0 ? trueCell : nilCell);
+}
+
+
+CELL * p_makeDir(CELL * params)
+{
+char * dirString;
+mode_t mode;
+UINT inMode;
+
+params = getString(params, &dirString);
+if(params != nilCell)
+	{
+	getInteger(params, &inMode);
+	mode = inMode;
+	}
+else
+	mode = 0777; /* drwxrwxrwx  gets user masked to drwxr-xr-x on most UNIX */
+
+#ifdef WIN_32 
+return(mkdir(dirString) == 0 ? trueCell : nilCell);
+#else
+return(mkdir(dirString, (mode_t)mode) == 0 ? trueCell : nilCell);
+#endif
+}
+
+
+CELL * p_removeDir(CELL * params)
+{
+char * dirString;
+
+getString(params, &dirString);
+return(rmdir(dirString) == 0 ? trueCell : nilCell);
+}
+
+
+CELL * p_changeDir(CELL * params)
+{
+char * newDir;
+
+getString(params, &newDir);
+return(chdir(newDir) == 0 ? trueCell : nilCell);
+}
+
+CELL * p_directory(CELL * params)
+{
+CELL * dirList;
+CELL * lastEntry;
+char * dirPath;
+char * fileName;
+char * pattern = NULL;
+UINT options = 0;
+DIR * dir;
+struct dirent * dEnt;
+
+if(params != nilCell)
+	{
+	params = getString(params, &dirPath);
+	if(params != nilCell)
+		{
+		params = getString(params, &pattern);
+		if(params != nilCell)
+			getInteger(params, &options);
+		}
+	}
+else dirPath = ".";
+
+dirList = getCell(CELL_EXPRESSION);
+lastEntry = NULL;
+
+dir = opendir(dirPath);
+if(dir == NULL) return(nilCell);
+
+while((dEnt = readdir(dir)) != NULL)
+	{
+#ifdef USE_WIN_UTF16PATH
+	fileName = utf16_to_utf8(dEnt->d_name);
+#else
+	fileName = dEnt->d_name;
+#endif
+	if(pattern)
+		{
+		if(searchBufferRegex(fileName, 0, pattern, strlen(fileName), options, NULL) == -1)
+			continue;
+		}
+	if(lastEntry == NULL)
+		{
+		lastEntry = stuffString(fileName);
+		dirList->contents = (UINT)lastEntry;
+		}
+	else
+		{
+		lastEntry->next = stuffString(fileName);
+		lastEntry = lastEntry->next;
+		}
+#ifdef USE_WIN_UTF16PATH
+	free(fileName);
+#endif
+	}
+
+closedir(dir);
+return(dirList);
+}
+
+#define DOT_PATH ".\000"
+
+CELL * p_realpath(CELL * params)
+{
+char  path[PATH_MAX];
+char * dir;
+
+if(params != nilCell)
+	getString(params, &dir);
+else dir = DOT_PATH;
+
+if(realpath(dir, path) == NULL)
+	return(nilCell);
+
+return(stuffString(path));
+}
+
+CELL * p_fileInfo(CELL * params)
+{
+#ifdef USE_WIN_UTF16PATH
+WCHAR * pathName;
+struct _stat fileInfo;
+#else
+char * pathName;
+struct stat fileInfo;
+#endif
+
+CELL * list;
+
+#ifdef USE_WIN_UTF16PATH
+char * utf8pathName;
+params = getString(params, &utf8pathName);
+pathName = utf8_to_utf16(utf8pathName);
+#else
+params = getString(params, &pathName);
+#endif
+
+if(lstat(pathName, &fileInfo) != 0)
+	{
+#ifdef USE_WIN_UTF16PATH
+	free(pathName);
+#endif
+	return(nilCell);
+	}
+
+list = stuffIntegerList(
+	8,
+	(UINT)fileInfo.st_size,
+	(UINT)fileInfo.st_mode,
+	(UINT)fileInfo.st_rdev,
+	(UINT)fileInfo.st_uid,
+	(UINT)fileInfo.st_gid,
+	(UINT)fileInfo.st_atime,
+	(UINT)fileInfo.st_mtime,
+	(UINT)fileInfo.st_ctime
+	);
+
+#ifndef NEWLISP64
+#ifdef LFS
+((CELL *)list->contents)->type = CELL_INT64;
+#ifdef USE_WIN_UTF16PATH
+*(INT64 *)&((CELL *)list->contents)->aux = fileSizeW(pathName);
+#else
+*(INT64 *)&((CELL *)list->contents)->aux = fileSize(pathName);
+#endif /* UTF16PATH */
+#endif /* LFS */
+#endif /* NEWLISP64 */
+
+#ifdef USE_WIN_UTF16PATH
+free(pathName);
+#endif
+
+if(params != nilCell)
+	{
+	pushResult(list);
+	return(copyCell(implicitIndexList(list, params)));
+	}
+	
+return(list);
+}
+
+#ifdef LFS
+INT64 fileSize(char * pathName)
+{
+int handle;
+INT64 size;
+
+#ifndef WIN_32
+handle = open(pathName,O_RDONLY | O_BINARY | O_NONBLOCK , 0);
+#else
+handle = open(pathName,O_RDONLY | O_BINARY, 0);
+#endif
+size = lseek(handle, 0, SEEK_END);
+close(handle);
+if(size == -1) size = 0;
+return(size);
+}
+#endif
+
+
+/* ------------------------- processes and pipes ------------------------- */
+
+
+CELL * p_system(CELL *params)
+{
+char * command;
+getString(params, &command);
+return(stuffInteger((UINT)system(command)));
+}
+
+
+CELL * p_exec(CELL * params)
+{
+char * command, * data;
+
+params = getString(params, &command);
+if(params == nilCell)
+    return(readProcess(command));    
+    
+getString(params, &data);
+return(writeProcess(command, data));
+}
+
+
+CELL * readProcess(char * command)
+{
+CELL * lineList;
+CELL * lastLine;
+FILE * handle;
+char * line;
+
+lastLine = NULL;
+
+if((handle = popen(command , "r")) == NULL)
+	return(nilCell);
+
+lineList = getCell(CELL_EXPRESSION);
+while((line = readStreamLine(&readLineStream, handle)) != NULL)
+	{
+	if(lastLine == NULL)
+		{
+		lastLine= stuffString(line);
+		lineList->contents = (UINT)lastLine;
+		}
+	else
+		{
+		lastLine->next = stuffString(line);
+		lastLine = lastLine->next;
+		}
+	}
+pclose(handle);
+
+return(lineList);
+}
+
+
+CELL * writeProcess(char * command, char * data)
+{
+FILE * handle;
+
+if((handle = popen(command, "w")) == NULL)
+	return(nilCell);
+
+if(fwrite(data, sizeof(char), strlen(data), handle) < strlen(data))
+	return(nilCell);
+
+pclose(handle);
+return(trueCell);
+}
+
+
+int init_argv(char * ptr, char *argv[])
+{
+int argc = 0;
+char brkChr;
+
+while(*ptr != 0)
+	{
+	while(*ptr == ' ') ++ptr;
+	if(*ptr == 0) break;
+	if(*ptr == '\'' || *ptr == '"')
+		{
+		brkChr = *ptr;
+		argv[argc++] = ++ptr;
+		while(*ptr != brkChr && *ptr != 0) ++ptr;
+		if(*ptr == 0) break;
+		*ptr++ = 0;	
+		continue;
+		}
+	else
+		{
+		argv[argc++] = ptr++;
+		while(*ptr != ' ' && *ptr != 0) ptr++;
+		if(*ptr == 0) break;
+		*ptr++ = 0;
+		}
+	}
+
+argv[argc] = 0;
+return(argc);
+}
+
+
+
+#ifdef WIN_32
+int winPipe(UINT * inpipe, UINT * outpipe);
+UINT winPipedProcess(char * command, int inpipe, int outpipe, int option);
+CELL * plainProcess(char * command, size_t size);
+
+CELL * p_pipe(CELL * params)
+{
+UINT hin, hout;
+
+if(!winPipe(&hin, &hout))    /* see file win32-util.c */
+	return(nilCell);
+
+return(stuffIntegerList(2, hin, hout));
+}
+
+
+CELL * p_process(CELL * params)
+{
+char * command;
+int result;
+size_t size;
+
+UINT inpipe = 0, outpipe = 0, option = 1;
+
+params = getStringSize(params, &command, &size, TRUE);
+if(params != nilCell)
+	{
+	params = getInteger(params, (UINT *)&inpipe);
+	params = getInteger(params, (UINT *)&outpipe);
+	if(params != nilCell)
+		getInteger(params, (UINT *)&option);
+	}
+else return(plainProcess(command, size));
+
+result = winPipedProcess(command, (int)inpipe, (int)outpipe, (int)option);
+
+if(!result) return(nilCell);
+
+return(stuffInteger(result));
+}
+
+CELL * plainProcess(char * command, size_t len)
+{
+char * cPtr;
+char * argv[16];
+int idx;
+
+cPtr = callocMemory(len + 1);
+memcpy(cPtr, command, len + 1);
+
+#ifdef OLD_PP
+argv[0] = cPtr;
+for(idx = 1; idx < 5; idx++)
+    {
+    cPtr = strchr(cPtr, ' ');
+    if(cPtr == NULL) break;
+    while(*cPtr == ' ') *cPtr++ = 0;
+    argv[idx] = cPtr;
+    }
+argv[idx] = NULL;
+#endif
+
+init_argv(cPtr, argv);
+
+idx = spawnvp(P_NOWAIT, argv[0], (const char * const *)argv); 
+
+free(cPtr);
+if(idx == -1) return(nilCell);
+
+return(stuffInteger(idx));
+}
+
+
+CELL * p_destroyProcess(CELL * params)
+{
+UINT pid;
+
+getInteger(params, &pid);
+
+if(TerminateProcess((HANDLE)pid, 0) == 0)
+	return(nilCell);
+
+return(trueCell);
+}
+
+
+#else /* not WIN_32 */
+
+CELL * p_pipe(CELL * params)
+{
+int handles[2];
+if(pipe(handles) != 0)
+	return(nilCell);
+
+return(stuffIntegerList(2, (UINT)handles[0], (UINT)handles[1]));
+}
+
+
+CELL * p_process(CELL * params)
+{
+char * command;
+char * cmd;
+int forkResult;
+UINT inpipe = 0, outpipe = 0, errpipe = 0;
+char * argv[16];
+size_t  size;
+
+params = getStringSize(params, &command, &size, TRUE);
+cmd = callocMemory(size + 1);
+memcpy(cmd, command, size + 1);
+
+#ifdef DEBUG_INIT_ARGV
+	int i;
+	init_argv(cmd, argv);
+	for(i = 0; i < 15; i++)
+		{
+		if(argv[i] == NULL) break;
+		printf("->%s<-\n", argv[i]);
+		}
+	return(trueCell);
+#endif
+
+if(params != nilCell)
+	{
+	params = getInteger(params, (UINT *)&inpipe);
+	params = getInteger(params, (UINT *)&outpipe);
+	if(params != nilCell)
+		getInteger(params, (UINT *)&errpipe);
+	}
+
+if((forkResult = fork()) == -1)
+    return(nilCell);
+if(forkResult == 0)
+    {
+    /* redirect stdin and stdout, stderr to pipe handles */
+    if(inpipe)
+        {
+        close(STDIN_FILENO); 
+        if(dup2((int)inpipe, STDIN_FILENO) == -1) exit(0);
+        close((int)inpipe);
+        }
+    if(outpipe)
+        {
+        close(STDOUT_FILENO); 
+        if(dup2((int)outpipe, STDOUT_FILENO) == -1) exit(0);
+        if(!errpipe)
+            if(dup2((int)outpipe, STDERR_FILENO) == -1) exit(0);
+        close((int)outpipe);
+        }
+    if(errpipe)
+    	{
+    	close(STDERR_FILENO);
+    	if(dup2((int)errpipe, STDERR_FILENO) == -1) exit(0);
+    	close((int)errpipe);
+    	}
+	
+	init_argv(cmd, argv);
+
+ 	execve(argv[0], argv, environ);
+	exit(0);
+    }
+
+return(stuffInteger(forkResult));
+}
+
+CELL * p_fork(CELL * params)
+{
+int forkResult;
+
+if((forkResult = fork()) == -1)
+    return(nilCell);
+if(forkResult == 0)
+    {
+    evaluateExpression(params);
+    exit(0);
+    }
+
+return(stuffInteger(forkResult));
+}
+
+CELL * p_destroyProcess(CELL * params)
+{
+UINT pid;
+UINT sig;
+
+params = getInteger(params, &pid);
+if(params != nilCell)	
+	getInteger(params, &sig);
+else
+	sig = 9;
+
+if(kill(pid, sig) != 0)
+	return(nilCell);
+
+return(trueCell);
+}
+
+CELL * p_waitpid(CELL * params)
+{
+UINT pid, options;
+int result;
+
+params = getInteger(params, (UINT *)&pid);
+if(params != nilCell)
+	getInteger(params, (UINT *)&options);
+else
+	options = 0;
+
+waitpid((int)pid, &result, (int)options);
+
+return(stuffInteger(result));
+}
+
+#endif
+
+/* ------------------------------ semaphores --------------------------------- */
+
+#ifdef WIN_32
+
+UINT winCreateSemaphore(void);
+UINT winWaitSemaphore(UINT hSemaphore);
+UINT winSignalSemaphore(UINT hSemaphore, int count);
+UINT winDeleteSemaphore(UINT hSemaphore);
+int getSemaphoreCount(UINT hSemaphore);
+
+CELL * p_semaphore(CELL * params)
+{
+UINT sem_id;
+long value;
+
+if(params != nilCell)
+	{
+	params = getInteger(params, &sem_id);
+	if(params != nilCell)
+		{
+		getInteger(params,(UINT *)&value);
+		if(value == 0)
+			{
+			if(!winDeleteSemaphore(sem_id)) 
+				return(nilCell);
+			return(trueCell);
+			}
+
+		/* wait or signal */
+		if(value < 0)
+			{
+			if(winWaitSemaphore(sem_id)) return(trueCell);
+			return(nilCell);
+			}
+		if(value > 0)
+			{
+			if(winSignalSemaphore(sem_id, value)) return(trueCell);
+			return(nilCell);	
+			}
+		}
+
+	else
+		{
+		/* return semaphore value, not on Win32 ? */
+		return(nilCell);
+		}
+	}
+
+/* create semaphore */
+if((sem_id = winCreateSemaphore()) == 0) return(nilCell);
+return(stuffInteger(sem_id));
+}
+#endif
+
+#ifndef WIN_32
+/* only available on Linux/UNIX */
+
+
+CELL * p_semaphore(CELL * params)
+{
+UINT sem_id, value = 0;
+struct sembuf sem_b;
+#ifdef SOLARIS
+#ifndef NEWLISP64
+int semun_val = 0;
+#endif
+#endif
+#ifdef MAC_OSX
+union semun semu;
+
+semu.val = 0;
+#endif
+
+if(params != nilCell)
+	{
+	params = getInteger(params, (UINT*)&sem_id);
+	if(params != nilCell)
+		{
+		getInteger(params,(UINT*)&value);
+		if(value == 0)
+			{
+			/* remove semaphore */
+#ifdef SOLARIS
+
+#ifdef TRU64
+                        if(semctl(sem_id, 0, IPC_RMID, 0) == -1)
+#else
+#ifndef NEWLISP64
+                        if(semctl(sem_id, 0, IPC_RMID, &semun_val) == -1)
+#else
+                        if(semctl(sem_id, 0, IPC_RMID, 0) == -1)
+#endif
+#endif /* SOLARIS */
+
+#else
+
+#ifdef MAC_OSX
+                        if(semctl(sem_id, 0, IPC_RMID, semu) == -1)
+#else
+                        if(semctl(sem_id, 0, IPC_RMID, 0) == -1)
+#endif
+#endif
+                                return(nilCell);
+			return(trueCell);
+			}
+
+		/* wait or signal */
+		sem_b.sem_num = 0;
+		sem_b.sem_op = value;
+		sem_b.sem_flg = 0; 
+		if(semop(sem_id, &sem_b, 1) == -1)
+			return(nilCell);
+		return(trueCell);
+		}
+
+	else
+		/* return semaphore value */
+#ifdef MAC_OSX
+                return(stuffInteger(semctl(sem_id, 0, GETVAL, semu)));
+#else
+                return(stuffInteger(semctl(sem_id, 0, GETVAL)));
+#endif
+	}
+
+/* create semaphore */
+sem_id = semget(IPC_PRIVATE, 1, 0666 );
+#ifdef SOLARIS
+
+#ifdef TRU64
+if(semctl(sem_id, 0, SETVAL, 0) == -1)
+#else
+#ifndef NEWLISP64
+if(semctl(sem_id, 0, SETVAL, &semun_val) == -1)
+#else
+if(semctl(sem_id, 0, SETVAL, 0) == -1)
+#endif
+#endif
+
+#else
+
+#ifdef MAC_OSX
+if(semctl(sem_id, 0, SETVAL, semu) == -1)
+#else
+if(semctl(sem_id, 0, SETVAL, 0) == -1)
+#endif
+
+#endif
+	return(nilCell);
+return(stuffInteger(sem_id));
+}
+
+#endif  /* not WIN_32 */
+
+
+union num_ptr {
+	UINT num;
+	UINT * ptr;
+};
+
+#ifdef WIN_32
+UINT winSharedMemory(int size);
+UINT * winMapView(UINT handle, int size);
+#endif
+
+#ifndef OS2
+CELL * p_share(CELL * params)
+{
+union num_ptr address;
+CELL * cell;
+size_t size;
+char * str;
+static int pagesize = 0;
+
+#ifndef WIN_32
+if(!pagesize) pagesize = getpagesize();
+#else
+UINT handle;
+pagesize = 4096;
+#endif
+
+if(params != nilCell)
+	{
+	cell = evaluateExpression(params);
+#ifndef WIN_32
+	if(isNil(cell))
+		{
+		getInteger(params->next, &address.num);
+		if(munmap((void *)address.ptr, pagesize) == -1)
+			return(nilCell);
+		else return(trueCell);
+		}
+#endif
+	getIntegerExt(cell, &address.num, FALSE);
+	params = params->next;
+#ifdef WIN_32
+	if((address.ptr = winMapView(address.num, pagesize)) == NULL)
+		return(nilCell);
+#endif
+	if(params != nilCell) /* write to shared memory */
+		{
+		cell = evaluateExpression(params);
+       	if(cell->type == CELL_NIL)
+	        {
+	        *address.ptr = CELL_NIL;
+#ifdef WIN_32
+			UnmapViewOfFile(address.ptr);
+#endif
+	        return(nilCell);
+	        }
+        if(cell->type == CELL_TRUE)
+            {
+            *address.ptr = CELL_TRUE;
+#ifdef WIN_32
+			UnmapViewOfFile(address.ptr);
+#endif
+            return(trueCell);
+            }
+		if(cell->type == CELL_STRING)
+			{
+			getStringSize(cell, &str, &size, FALSE);
+			if(size > (pagesize - 2 * sizeof(long) - 1)) 
+				size = pagesize - 2 * sizeof(long) - 1;
+			*address.ptr = cell->type;
+			*(address.ptr + 1) = size;
+			memcpy((char *)(address.num + 2 * sizeof(long)), str, size);
+			*(char *)(address.num + 2 * sizeof(long) + size) = 0;
+			/* fall thru to address.ptr == CELL_STRING, to return sized string */
+
+			goto return_new_string_cell;
+			}
+		if(cell->type == CELL_LONG)
+			{
+			*address.ptr = cell->type;
+			*(address.ptr + 1) = sizeof(long);
+			*(address.ptr + 2) = cell->contents;
+#ifdef WIN_32
+			UnmapViewOfFile(address.ptr);
+#endif
+			return(copyList(cell));
+			}
+#ifndef NEWLISP64
+		if(cell->type == CELL_INT64)
+			{
+			*address.ptr = cell->type;
+			*(address.ptr + 1) = sizeof(INT64);
+			memcpy(address.ptr + 2, (void *)&cell->aux, sizeof(INT64));
+#ifdef WIN_32
+			UnmapViewOfFile(address.ptr);
+#endif
+			return(copyList(cell));
+			}
+		if(cell->type == CELL_FLOAT)
+			{
+			*address.ptr = cell->type;
+			*(address.ptr + 1) = sizeof(double);
+			*(address.ptr + 2) = cell->aux;
+			*(address.ptr + 3) = cell->contents;
+#ifdef WIN_32
+			UnmapViewOfFile(address.ptr);
+#endif
+			return(copyList(cell));
+			}
+
+#else /* NEWLISP64 */
+		if(cell->type == CELL_FLOAT)
+			{
+			*address.ptr = cell->type;
+			*(address.ptr + 1) = sizeof(double);
+			*(address.ptr + 2) = cell->contents;
+			return(copyList(cell));
+			}
+#endif /* NEWLISP64 */
+		return(errorProcExt(ERR_ILLEGAL_TYPE, cell));
+		}
+	if(*address.ptr == CELL_NIL) /* rrad from share memory */
+		{
+#ifdef WIN_32 
+		UnmapViewOfFile(address.ptr);
+#endif
+        return(nilCell);
+        }
+    if(*address.ptr == CELL_TRUE)
+      	{
+#ifdef WIN_32 
+		UnmapViewOfFile(address.ptr);
+#endif
+        return(trueCell);	
+        }
+	if(*address.ptr == CELL_LONG)
+		{
+		cell = stuffInteger(*(address.ptr + 2));
+#ifdef WIN_32 
+		UnmapViewOfFile(address.ptr);
+#endif
+		return(cell);
+		}
+#ifndef NEWLISP64
+	if(*address.ptr == CELL_INT64)
+		{
+		cell = stuffInteger64(*(INT64 *)(address.ptr + 2));
+#ifdef WIN_32 
+		UnmapViewOfFile(address.ptr);
+#endif
+		return(cell);
+		}
+#endif
+		
+	if(*address.ptr == CELL_FLOAT)
+		{
+#ifndef NEWLISP64
+		cell = getCell(CELL_FLOAT);
+		cell->aux = *(address.ptr + 2);
+		cell->contents = *(address.ptr + 3);
+#else
+		cell = getCell(CELL_FLOAT);
+		cell->contents = *(address.ptr + 2);
+#endif
+#ifdef WIN_32
+		UnmapViewOfFile(address.ptr);
+#endif
+		return(cell);
+		}
+	if(*address.ptr == CELL_STRING)
+		{
+return_new_string_cell:
+		cell = getCell(CELL_STRING);
+		cell->aux = *(address.ptr + 1) + 1;
+		cell->contents = (UINT)allocMemory(cell->aux);
+		memcpy((char *)cell->contents, (char*)(address.num + 2 * sizeof(long)), cell->aux);
+#ifdef WIN_32
+		UnmapViewOfFile(address.ptr);
+#endif
+		return(cell);
+		}
+	return(nilCell);
+	}
+
+#ifndef WIN_32
+if((address.ptr = (UINT*)mmap(
+	0, pagesize, PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANON, -1, 0)) == (void*)-1)
+		return(nilCell);
+
+memset((char *)address.num, 0, pagesize);
+return(stuffInteger(address.num));
+
+#else
+if((handle = winSharedMemory(pagesize)) == 0)
+	return(nilCell);
+
+if((address.ptr = winMapView(handle, pagesize)) == NULL)
+	return(nilCell);
+
+memset((char *)address.num, 0, pagesize);
+return(stuffInteger(handle));
+#endif
+}
+#endif /* no OS2 */
+
+/* ------------------------------ time and date functions -------------------- */
+
+CELL * p_systemInfo(CELL * params)
+{
+CELL * cell;
+
+cell = stuffIntegerList(
+	8,
+	cellCount,
+	MAX_CELL_COUNT,
+	symbolCount,
+	(UINT)recursionCount,
+	(UINT)envStackIdx,
+	(UINT)MAX_CPU_STACK,
+	(UINT)version,
+	(UINT)opsys);
+
+if(params != nilCell)	
+	{
+	pushResult(cell);
+	return(copyCell(implicitIndexList(cell, params)));
+	}
+
+return(cell);
+}
+
+
+CELL * p_systemError(CELL * params)
+{
+UINT init;
+
+if(params != nilCell)
+	{
+	getInteger(params, (UINT*)&init);
+	errno=(int)init;
+	}
+
+return(stuffInteger((UINT)errno));
+}
+
+
+CELL * p_date(CELL * params)
+{
+time_t t;
+struct timeval tv;
+struct tm * ltm;
+char * ct;
+char * fmt;
+ssize_t offset;
+ssize_t tme;
+
+#ifdef SUPPORT_UTF8
+#ifdef WCSFTIME
+int * ufmt;
+int * timeString;
+int size;
+#endif
+char * utf8str;
+#else
+char * timeString;
+#endif
+
+if(params == nilCell)
+	{
+	gettimeofday(&tv, NULL);
+	t = tv.tv_sec;
+	}
+else
+	{
+	params = getInteger(params, (UINT *)&tme);
+	t = tme;
+	
+	if(params != nilCell)
+		{
+		params = getInteger(params, (UINT *)&offset);
+	        t += (int)offset * 60;
+		}
+		
+	if(params != nilCell)
+		{
+		params = getString(params, &fmt);
+		ltm = localtime(&t);
+#ifdef SUPPORT_UTF8
+	/* some Linux do UTF-8 but don't have wcsftime() or it is buggy */
+#ifdef WCSFTIME
+		size = utf8_wlen(fmt);
+		ufmt = alloca(UTF8_MAX_BYTES * (size + 1));
+		utf8_wstr(ufmt, fmt, size);
+
+		timeString = alloca(UTF8_MAX_BYTES * 128);
+		size = wcsftime((wchar_t *)timeString, 127, (wchar_t *)ufmt, ltm);
+		utf8str = alloca(size * UTF8_MAX_BYTES + 1);
+		size =  wstr_utf8(utf8str, timeString, size * UTF8_MAX_BYTES);
+		return(stuffString(utf8str));
+#else
+		utf8str = alloca(128);
+		strftime(utf8str, 127, fmt, ltm);
+		return(stuffString(utf8str));
+#endif /* WCSFTIME */
+
+#else
+		timeString = alloca(128);
+		strftime(timeString, 127, fmt, ltm);
+		return(stuffString(timeString));
+#endif
+		}
+	}
+
+ct = ctime(&t);
+if(ct == NULL) return(nilCell);
+
+ct[strlen(ct) - 1] = 0;  /* supress linefeed */
+return(stuffString(ct));
+}
+
+
+int milliSecTime(void)
+{
+struct timeval tv;
+struct tm * ttm;
+
+gettimeofday(&tv, NULL);
+
+ttm = localtime((time_t *)&tv.tv_sec);
+
+return (ttm->tm_hour * 3600000 + 
+       ttm->tm_min * 60000 + ttm->tm_sec * 1000 + 
+       tv.tv_usec/1000);
+}
+
+
+/* returns a differerence of 2 timeval structs in milliseconds
+*/
+int timediff(struct timeval out, struct timeval in )
+{
+	if( (out.tv_usec -= in.tv_usec) < 0 )   {
+		out.tv_sec--;
+		out.tv_usec += 1000000;
+	}
+	out.tv_sec -= in.tv_sec;
+
+return(out.tv_sec*1000 + (out.tv_usec/1000));
+}
+
+UINT64 timediff64(struct timeval out, struct timeval in )
+{
+	if( (out.tv_usec -= in.tv_usec) < 0 )   {
+		out.tv_sec--;
+		out.tv_usec += 1000000;
+	}
+	out.tv_sec -= in.tv_sec;
+
+return(out.tv_sec*1000000 + out.tv_usec);
+}
+
+#ifndef WIN_32
+CELL * p_parseDate(CELL * params)
+{
+struct tm ttm;
+char * dateStr;
+char * formatStr;
+size_t dateValue;
+
+params = getString(params, &dateStr);
+params = getString(params, &formatStr);
+
+memset (&ttm, 0, sizeof (ttm));
+
+if(strptime(dateStr, formatStr, &ttm) == NULL)
+	return(nilCell);
+
+dateValue = calcDateValue(
+		ttm.tm_year + 1900,
+		ttm.tm_mon + 1,
+		ttm.tm_mday,
+		ttm.tm_hour,
+		ttm.tm_min,
+		ttm.tm_sec);
+
+return(stuffInteger(dateValue));
+}
+#endif
+
+CELL * p_time(CELL * params)
+{
+struct timeval start, end;
+INT64 N = 1;
+int resultIdxSave;
+
+gettimeofday(&start, NULL);
+if(params->next != nilCell)
+    getInteger64(params->next, &N);
+
+resultIdxSave = resultStackIdx;
+while(N--)  
+    {
+    evaluateExpression(params);
+    cleanupResults(resultIdxSave);
+    }
+
+gettimeofday(&end, NULL);
+return(stuffInteger((UINT)timediff(end, start)));
+}
+
+
+CELL * p_timeOfDay(CELL * params)
+{
+return(stuffInteger(milliSecTime()));
+}
+
+CELL * p_now(CELL * params)
+{
+struct timeval tv;
+struct tm *ttm;
+struct tm *ltm;
+struct timezone tzp;
+ssize_t offset;
+
+gettimeofday(&tv, &tzp);
+
+if(params != nilCell)
+	{
+	getInteger(params, (UINT*)&offset);
+	offset *= 60;
+        tv.tv_sec += offset;
+	}
+
+ltm = localtime((time_t *)&tv.tv_sec);
+
+ttm = gmtime((time_t *)&tv.tv_sec);
+
+return(stuffIntegerList(
+    11,
+    (UINT)ttm->tm_year + 1900,
+    (UINT)ttm->tm_mon + 1,
+    (UINT)ttm->tm_mday,
+    (UINT)ttm->tm_hour,
+    (UINT)ttm->tm_min,
+    (UINT)ttm->tm_sec,
+    (UINT)tv.tv_usec,
+    (UINT)ttm->tm_yday + 1,
+    (UINT)ttm->tm_wday + 1,
+/* Note, that on SOLARIS tzp.tz_minuteswest and
+   tzp.tz_dsttime might not work correctly 
+   and contain garbage 
+*/
+    (UINT)tzp.tz_minuteswest,
+#ifdef WIN_32
+/*    (UINT)ltm->tm_isdst */
+    (UINT)tzp.tz_dsttime 
+#else
+    (UINT)ltm->tm_isdst
+#endif
+    ));
+}
+
+
+UINT seconds(void)
+{
+struct timeval tv;
+
+gettimeofday(&tv, NULL);
+return(tv.tv_sec);
+}
+
+
+CELL * p_dateValue(CELL * params)
+{
+struct timeval tv;
+ssize_t year, month, day, hour, min, sec;
+size_t dateValue;
+
+if(params->type == CELL_NIL)
+	{
+	gettimeofday(&tv, NULL);
+	return(stuffInteger(tv.tv_sec));
+	}
+
+params = getInteger(params, (UINT *)&year);
+params = getInteger(params, (UINT *)&month);
+params = getInteger(params, (UINT *)&day);
+
+if(year < 1970) return(stuffInteger(0));
+
+hour = min = sec = 0;
+if(params != nilCell)
+        {
+        params = getInteger(params, (UINT *)&hour);
+        params = getInteger(params, (UINT *)&min);
+        getInteger(params, (UINT *)&sec);
+        }
+
+dateValue = calcDateValue(year, month, day, hour, min, sec);
+
+return(stuffInteger((UINT)dateValue));
+}
+
+
+size_t calcDateValue(int year, int month, int day, int hour, int min, int sec)
+{
+size_t dateValue;
+
+dateValue = 367 * year - (7 * (year + ((month + 9) / 12)))/4 
+            + (275 * month)/9 + day + 1721013;
+
+dateValue = dateValue * 24 * 3600 + hour * 3600 + min * 60 + sec 
+            - 413319296; /* correction for 1970-1-1 */
+
+#ifdef NEWLISP64
+dateValue = dateValue % 0x80000000;
+#endif
+
+return(dateValue);
+}
+
+
+#ifdef MAC_OSX
+extern int nanosleep();
+#endif
+
+void mySleep(int ms)
+{
+#ifdef NANOSLEEP
+struct timespec tm;
+
+tm.tv_sec = ms / 1000;
+tm.tv_nsec = (ms - tm.tv_sec * 1000) * 1000000;
+nanosleep(&tm, 0);
+
+#else
+
+#ifdef WIN_32
+/* _sleep() is deprecated in MinGW gcc 3.4.5 */
+Sleep(ms);
+#else
+sleep((ms + 500)/1000);
+#endif
+
+#endif
+}
+
+
+CELL * p_sleep(CELL * params)
+{
+size_t milliSecs;
+
+getInteger(params, (UINT *)&milliSecs);
+
+mySleep(milliSecs);
+
+return(stuffInteger((UINT)milliSecs));
+}
+
+/* -------------------------------- environment functions ------------------- */
+
+
+CELL * p_env(CELL * params)
+{
+char * varName;
+char * varValue;
+
+/* no parameters returns whole environment */
+if(params == nilCell) 
+	return(environment());
+
+/* one parameter get environment for one variable */
+params = getString(params, &varName);
+if(params == nilCell) 
+	{
+	if( (varValue = getenv(varName)) == NULL)
+		return(nilCell);
+	return(stuffString(varValue));
+	}
+
+/* two parameters sets environment for one variable */
+getString(params, &varValue);
+#ifndef MY_SETENV
+if(*varValue == 0)
+	unsetenv(varName);
+else
+#endif
+	if(setenv(varName, varValue, 1) != 0)
+		return(nilCell);
+
+return(trueCell);
+}
+
+
+#ifdef MY_SETENV
+int my_setenv(const char * varName, const char * varValue, int flag)
+{
+char * envstr;
+envstr = alloca(strlen(varName) + strlen(varValue) + 2);
+strcpy(envstr, varName);
+strcat(envstr, "=");
+strcat(envstr, varValue);
+return(putenv(envstr));
+}
+#endif
+
+
+CELL * environment(void)
+{
+char ** env;
+CELL * envList;
+CELL * lastEntry;
+
+lastEntry = NULL;
+envList = getCell(CELL_EXPRESSION);
+
+#ifdef MAC_OSX
+#ifdef LIBRARY
+return(envList);
+#endif
+#endif
+
+env = environ;
+
+while(*env)
+	{
+	if(lastEntry == NULL)
+		{
+		lastEntry = stuffString(*env);
+		envList->contents = (UINT)lastEntry;
+		}
+	else
+		{
+		lastEntry->next = stuffString(*env);
+		lastEntry = lastEntry->next;
+		}
+	env++;
+	}
+
+return(envList);
+}
+
+/* --------------------- read the keyboard -----------------------------------*/
+
+/* thanks to Peter van Eerten for contributing this function */
+CELL * p_readKey(CELL * params)
+{
+#ifdef WIN_32
+return(stuffInteger(getch()));
+#else          
+#ifdef OS2
+return(stuffInteger(getch()));
+#else
+
+struct termios term, oterm;
+char c = 0;
+
+tcgetattr(0, &oterm);
+
+memcpy(&term, &oterm, sizeof(term));
+
+/* put the terminal in non-canonical mode, any
+reads timeout after 0.1 seconds or when a
+single character is read */
+term.c_lflag &= ~(ICANON | ECHO);
+term.c_cc[VMIN] = 0;
+term.c_cc[VTIME] = 1;
+tcsetattr(0, TCSANOW, &term);
+
+#if defined  (_BSD) || (MAC_OSX)
+while(read(0, &c, 1) == 0);
+#else
+while((c = (char)getchar()) == (char)-1);
+#endif
+
+/* reset the terminal to original state */
+tcsetattr(0, TCSANOW, &oterm);
+
+return(stuffInteger(c));
+#endif
+#endif
+} 
+
+/* --------------------- peek a file descriptor ------------------------------*/
+#ifndef WIN_32
+CELL * p_peek(CELL * params)
+{
+UINT handle;
+#ifdef WIN_32
+unsigned long result;
+#else
+int result;
+#endif
+
+getInteger(params, &handle);
+
+if(ioctl((int)handle, FIONREAD, &result) < 0)
+	return(nilCell);
+
+return(stuffInteger((UINT)result));
+} 
+#endif
+
+
+/* --------------------- library functions not found on some OSs -------------*/
+
+#ifdef MY_VASPRINTF
+
+int my_vasprintf(char * * buffer, const char * format, va_list argptr)
+{
+ssize_t size = MAX_STRING;
+ssize_t pSize;
+
+while(TRUE)
+	{
+	*buffer = allocMemory(size + 2);
+	pSize = vsnprintf(*buffer, size + 1, format, argptr);
+
+#if defined(WIN_32) || defined(TRU64)
+	if(pSize < 0)
+		{
+		freeMemory(*buffer);
+		size = size + size / 2;
+		continue;
+		}
+#else
+	if(pSize > size)
+		{
+		freeMemory(*buffer);
+		size = pSize;    
+		continue;
+		}
+#endif
+	break;
+	}
+
+return((int)pSize);
+}
+
+#endif
+
+/* ---------------------- Universal Unique ID version 1 and 3 ----------- */
+
+#define UINT16 unsigned short
+#define UINT32 unsigned int
+
+typedef struct 
+	{
+	UINT32          time_low;
+	UINT16          time_mid;
+	UINT16          time_hi_and_version;
+	unsigned char   clock_seq_hi_and_reserved;
+	unsigned char   clock_seq_low;
+	unsigned char 	node[6];
+	} UUID;
+
+UINT16 clock_seq = 0;
+INT64 last_time = 0;
+char last_node[6];
+
+#define OCT151582 0x01B21DD213814000LL
+
+int getUUID(UUID * uuid, char * node) 
+{
+struct timeval tp;
+INT64 timestamp;
+UINT16 nodeID[3];
+int uuid_version;
+
+gettimeofday(&tp, (struct timezone *)0);
+
+/* add UUID UTC offset Oct 15, 1582 */
+timestamp = tp.tv_sec * (INT64)10000000 + tp.tv_usec * 10 + OCT151582; 
+
+#ifdef WIN_32
+if(timestamp <= last_time) timestamp = last_time + 1;
+#else
+if(timestamp < last_time) clock_seq++;
+if(timestamp == last_time) timestamp++;
+#endif
+
+if(last_time == 0)
+	srandom((timestamp & 0xFFFFFFFF) + getpid());
+
+last_time = timestamp;
+
+
+if(clock_seq == 0) clock_seq = random();
+if(node != NULL && (memcmp(last_node, node, 6) != 0))
+	{
+	clock_seq = random();
+	memcpy(last_node, node, 6);
+	}
+
+if(node == NULL)
+	{
+	nodeID[0] = random(); 
+	nodeID[1] = random();
+	nodeID[2] = random();
+	uuid_version = 4;
+	memcpy(uuid->node, (void *)nodeID, 6);
+	}
+else
+	{
+	uuid_version = 1;
+	/* least sign bit of first byte must be 0 on MACs
+       and 1 on artifical generated node IDs */
+	memcpy(uuid->node, node, 6);
+	}
+
+if(uuid_version == 4) 
+	{
+	clock_seq = random();
+	uuid->time_low = random();
+#ifdef WIN_32
+	uuid->time_low |= (random() << 16);
+#endif
+	uuid->time_mid = random();
+	uuid->time_hi_and_version = random();
+	}
+else
+	{
+	uuid->time_low = (unsigned long)(timestamp & 0xFFFFFFFF);
+	uuid->time_mid = (unsigned short)((timestamp >> 32) & 0xFFFF);
+	uuid->time_hi_and_version = (unsigned short)(timestamp >> 48) ;
+	}
+
+uuid->time_hi_and_version &= 0x0FFF;
+uuid->time_hi_and_version |= (uuid_version << 12);
+uuid->clock_seq_low = clock_seq & 0xFF;
+uuid->clock_seq_hi_and_reserved = (clock_seq & 0x3F00) >> 8;
+uuid->clock_seq_hi_and_reserved |= 0x80;
+
+return(1);
+}
+
+CELL * p_uuid(CELL * params)
+{
+UUID uuid;
+char * nodeMAC = NULL;
+size_t size;
+char str[38];
+
+if(params != nilCell)
+	{
+	getStringSize(params, &nodeMAC, &size, TRUE);
+	if(size < 6) nodeMAC = NULL;
+	}
+	
+getUUID(&uuid, nodeMAC);
+
+snprintf(str, 37, "%08X-%04X-%04X-%02X%02X-%02X%02X%02X%02X%02X%02X", 
+	uuid.time_low, uuid.time_mid, uuid.time_hi_and_version,
+	uuid.clock_seq_hi_and_reserved, uuid.clock_seq_low,
+	uuid.node[0], uuid.node[1], uuid.node[2], 
+	uuid.node[3], uuid.node[4], uuid.node[5]);
+
+return(stuffString(str));
+}
+
+/* eof */
+
diff --git a/nl-import.c b/nl-import.c
new file mode 100644
index 0000000..fba6737
--- /dev/null
+++ b/nl-import.c
@@ -0,0 +1,406 @@
+/* nl-import.c --- shared library interface for newLISP
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+
+#include "newlisp.h"
+#include "protos.h"
+
+
+#ifdef WINCE
+#define _stdcall __stdcall
+#endif
+
+#ifndef WIN_32
+#ifdef MAC_102
+#include "osx-dlfcn.h"
+#else
+#include <dlfcn.h>
+#endif
+#endif
+
+UINT cdeclFunction(UINT fAddress, UINT * args, int count);
+
+extern int evalCatchFlag;
+
+#ifdef WIN_32
+
+
+UINT stdcallFunction(UINT fAddress, UINT * args, int count);
+
+
+CELL * p_importLib(CELL * params)
+{
+char * libName;
+char * funcName;
+char * options = NULL;
+HINSTANCE hLibrary;
+CELL * pCell;
+SYMBOL * symbol;
+FARPROC initProc;
+
+params = getString(params, &libName);
+params = getString(params, &funcName);
+if(params != nilCell)
+	getString(params, &options);
+
+/* hLibrary = NULL; */
+
+if( (UINT)(hLibrary = LoadLibrary(libName)) < 32)
+	return(errorProcExt2(ERR_IMPORT_LIB_NOT_FOUND, stuffString(libName)));
+
+if(options != NULL && strcmp(options, "cdecl") ==  0)
+	pCell = getCell(CELL_IMPORT_CDECL);
+else
+	pCell = getCell(CELL_IMPORT_DLL);
+
+symbol = translateCreateSymbol(funcName, pCell->type, currentContext, TRUE);
+if(isProtected(symbol->flags))
+	return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(symbol)));
+	
+deleteList((CELL *)symbol->contents);
+symbol->contents = (UINT)pCell;
+pCell->contents = (UINT)GetProcAddress(hLibrary, (LPCSTR)funcName);
+pCell->aux = (UINT)symbol->name;
+
+/* put name of imported DLL into DLLs space for loadStartup() */
+initProc = GetProcAddress(hLibrary, (LPCSTR)"dllName");
+if(initProc != 0) (*initProc)(libName);
+
+if(pCell->contents == 0) 
+	return(errorProcExt2(ERR_IMPORT_FUNC_NOT_FOUND, stuffString(funcName)));
+
+return(copyCell(pCell));
+}
+
+#else  /* UNIX and compatible operating systems */
+
+CELL * p_importLib(CELL * params)
+{
+char * libName;
+char * funcName;
+void * hLibrary;
+CELL * pCell;
+SYMBOL * symbol;
+char * error;
+
+params = getString(params, &libName);
+getString(params, &funcName);
+hLibrary = 0;                
+
+#ifdef TRU64
+if((hLibrary = dlopen(libName, RTLD_LAZY)) == 0)
+#else
+if((hLibrary = dlopen(libName, RTLD_GLOBAL|RTLD_LAZY)) == 0)
+#endif
+	return(errorProcExt2(ERR_IMPORT_LIB_NOT_FOUND, stuffString((char *)dlerror())));
+
+pCell = getCell(CELL_IMPORT_CDECL);
+symbol = translateCreateSymbol(funcName, CELL_IMPORT_CDECL, currentContext, TRUE);
+if(isProtected(symbol->flags))
+	return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(symbol)));
+	
+deleteList((CELL *)symbol->contents);
+symbol->contents = (UINT)pCell;
+
+pCell->contents = (UINT)dlsym(hLibrary, funcName);
+
+if((error = (char *)dlerror()) != NULL)
+	return(errorProcExt2(ERR_IMPORT_FUNC_NOT_FOUND, stuffString(error)));
+
+pCell->aux = (UINT)symbol->name;
+
+return(copyCell(pCell));
+}
+
+#endif
+
+
+CELL * executeLibfunction(CELL * pCell, CELL * params)
+{
+CELL * arg;
+UINT args[14];
+int count;
+
+count = 0;
+while(params->type != CELL_NIL && count < 14)
+	{
+	arg = evaluateExpression(params);
+	switch(arg->type)
+		{
+		case CELL_LONG:
+		case CELL_STRING:
+		case CELL_PRIMITIVE:
+			args[count++] = arg->contents;
+			break;
+#ifndef NEWLISP64
+		case CELL_INT64: 
+			args[count++] = *(INT64 *)&arg->aux;
+			break;
+#endif
+		case CELL_FLOAT:
+#ifndef NEWLISP64
+			args[count++] = arg->aux;
+#endif
+			args[count++] = arg->contents;
+			break;
+
+		default:
+			args[count++] = (UINT)arg;
+			break;
+		}
+	params = (CELL *)params->next;
+	}
+
+#ifdef WIN_32
+if(pCell->type == CELL_IMPORT_DLL)
+	return(stuffInteger(stdcallFunction(pCell->contents, args, count)));
+else
+#endif
+return(stuffInteger(cdeclFunction(pCell->contents, args, count)));
+}
+
+
+UINT cdeclFunction(UINT fAddress, UINT * args, int count)
+{
+UINT (*function)();
+
+function = (UINT (*)())fAddress;
+
+switch(count)
+	{
+	case 0:
+            return (*function)();
+
+	case 1:
+            return  (*function)(args[0]);
+
+	case 2:
+            return  (*function)(args[0], args[1]);
+
+	case 3:
+            return  (*function)(args[0], args[1], args[2]);
+
+	case 4:
+            return  (*function)(args[0], args[1], args[2], args[3]);
+
+	case 5:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4]);
+	case 6:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4], args[5]);
+	case 7:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4], args[5], args[6]);
+	case 8:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4], args[5], args[6], args[7]);
+
+	case 9:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4], args[5], args[6], args[7], args[8]);
+
+	case 10:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4], args[5], args[6], args[7], args[8], args[9]);
+	case 11:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				args[4], args[5], args[6], args[7],
+				args[8], args[9], args[10]);
+	case 12:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				args[4], args[5], args[6], args[7],
+				args[8], args[9], args[10], args[11]);
+
+	case 13:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				args[4], args[5], args[6], args[7],
+				args[8], args[9], args[10], args[11],
+				args[12]);
+	case 14:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				args[4], args[5], args[6], args[7],
+				args[8], args[9], args[10], args[11],
+				args[12], args[13]);
+	default:
+	    break;
+	}
+
+return(0);
+}
+
+
+#ifdef WIN_32
+UINT stdcallFunction(UINT fAddress, UINT * args, int count)
+{
+UINT _stdcall (*function)();
+
+function = (UINT _stdcall (*)())fAddress;
+
+switch(count)
+	{
+	case 0:
+            return (*function)();
+
+	case 1:
+            return  (*function)(args[0]);
+
+	case 2:
+            return  (*function)(args[0], args[1]);
+
+	case 3:
+            return  (*function)(args[0], args[1], args[2]);
+
+	case 4:
+            return  (*function)(args[0], args[1], args[2], args[3]);
+
+	case 5:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4]);
+	case 6:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4], args[5]);
+	case 7:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4], args[5], args[6]);
+	case 8:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4], args[5], args[6], args[7]);
+
+	case 9:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4], args[5], args[6], args[7], args[8]);
+
+	case 10:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				     args[4], args[5], args[6], args[7], args[8], args[9]);
+	case 11:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				args[4], args[5], args[6], args[7],
+				args[8], args[9], args[10]);
+	case 12:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				args[4], args[5], args[6], args[7],
+				args[8], args[9], args[10], args[11]);
+
+	case 13:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				args[4], args[5], args[6], args[7],
+				args[8], args[9], args[10], args[11],
+				args[12]);
+	case 14:
+            return  (*function)(args[0], args[1], args[2], args[3],
+				args[4], args[5], args[6], args[7],
+				args[8], args[9], args[10], args[11],
+				args[12], args[13]);
+	default:
+	    break;
+	}
+
+return(0);
+}
+#endif
+
+
+/* used when passing 32bit floats to library routines */
+CELL * p_flt(CELL * params)
+{
+double dfloatV;
+float floatV;
+unsigned int number;
+
+getFloat(params, &dfloatV);
+
+floatV = dfloatV;
+memcpy(&number, &floatV, 4);
+
+return(stuffInteger(number));
+}
+
+
+/* 8 callback functions for up to 4 parameters */
+
+long template(long n, long p1, long p2, long p3, long p4);
+
+long callback0(long p1, long p2, long p3, long p4) {return template(0, p1, p2, p3, p4);}
+long callback1(long p1, long p2, long p3, long p4) {return template(1, p1, p2, p3, p4);}
+long callback2(long p1, long p2, long p3, long p4) {return template(2, p1, p2, p3, p4);}
+long callback3(long p1, long p2, long p3, long p4) {return template(3, p1, p2, p3, p4);}
+long callback4(long p1, long p2, long p3, long p4) {return template(4, p1, p2, p3, p4);}
+long callback5(long p1, long p2, long p3, long p4) {return template(5, p1, p2, p3, p4);}
+long callback6(long p1, long p2, long p3, long p4) {return template(6, p1, p2, p3, p4);}
+long callback7(long p1, long p2, long p3, long p4) {return template(7, p1, p2, p3, p4);}
+
+typedef struct {
+	SYMBOL * sym;
+	UINT func;
+	} LIBCALLBACK;
+
+LIBCALLBACK callback[] = {
+	{ NULL, (UINT)callback0 },
+	{ NULL, (UINT)callback1 },
+	{ NULL, (UINT)callback2 },
+	{ NULL, (UINT)callback3 },
+	{ NULL, (UINT)callback4 },
+	{ NULL, (UINT)callback5 },
+	{ NULL, (UINT)callback6 },
+	{ NULL, (UINT)callback7 },
+};
+
+
+long template(long n, long p1, long p2, long p3, long p4) 
+{
+CELL * args;
+long result;
+jmp_buf errorJumpSave;
+
+memcpy(errorJumpSave, errorJump, sizeof(errorJump));
+if(setjmp(errorJump))
+	{
+	reset();
+	initStacks();
+	result = -1;
+	goto FINISH_CALLBACK;
+	}
+
+args = stuffIntegerList(4, p1, p2, p3, p4);
+result = executeSymbol(callback[n].sym, (CELL *)args->contents);
+args->contents = (UINT)nilCell;
+deleteList(args);
+
+FINISH_CALLBACK:
+memcpy(errorJump, errorJumpSave, sizeof(errorJump));
+return(result);
+}
+
+CELL * p_callback(CELL * params)
+{
+SYMBOL * sPtr;
+UINT n;
+
+params = getInteger(params, &n);
+if(n > 7) n = 7;
+getSymbol(params, &sPtr);
+
+callback[n].sym = sPtr;
+
+return(stuffInteger(callback[n].func));
+}
+
+/* end of file */
diff --git a/nl-list.c b/nl-list.c
new file mode 100644
index 0000000..0323ed7
--- /dev/null
+++ b/nl-list.c
@@ -0,0 +1,2093 @@
+/* n-list.c
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+
+#include "newlisp.h"
+#include "protos.h"
+#include <search.h>
+
+extern SYMBOL * starSymbol;
+extern SYMBOL * plusSymbol;
+extern SYMBOL * sysSymbol[];
+
+extern CELL * firstFreeCell;
+
+/* following used in count, difference, intersect, uniwue and sort 8.6.2 */
+CELL * * listToSortedVector(CELL * list, ssize_t * length, CELL * func, int indexFlag);
+CELL * resortVectorToList(CELL * * vector, ssize_t length);
+void binsort(CELL * * x, ssize_t n, CELL * pCell);
+
+
+CELL * p_map(CELL * params)
+{
+CELL * argsPtr;
+CELL * arg;
+CELL * sPtr;
+CELL * cell;
+CELL * expr;
+CELL * results;
+CELL * res;
+CELL * qCell;
+int resultIdxSave;
+
+sPtr = evaluateExpression(params);
+
+/* get first of argument lists */
+params = params->next;
+argsPtr = cell = copyCell(evaluateExpression(params));
+if(!isList(cell->type))
+	return(errorProcExt(ERR_LIST_EXPECTED, params));
+
+while ((params = params->next) != nilCell)
+	{
+	cell->next = copyCell(evaluateExpression(params));
+	cell = cell->next;
+
+	if(!isList(cell->type))
+            return(errorProcExt(ERR_LIST_EXPECTED, params));
+	}
+
+results = getCell(CELL_EXPRESSION);
+res = NULL;
+resultIdxSave = resultStackIdx;
+while(argsPtr->contents != (UINT)nilCell) /* for all instances of a arg */
+	{
+	expr = getCell(CELL_EXPRESSION);
+	cell = copyCell(sPtr);
+	expr->contents = (UINT)cell;
+	arg = argsPtr;
+	while(arg != nilCell)              /* for all args */
+		{
+		qCell = getCell(CELL_QUOTE);
+		cell->next = qCell;
+		cell = (CELL *)arg->contents; /* pop out first */
+		arg->contents = (UINT)cell->next;
+		qCell->contents = (UINT)cell;
+		cell->next = nilCell;
+		cell = qCell;
+		arg = arg->next;
+		}
+	cell = copyCell(evaluateExpression(expr));
+	deleteList(expr);
+	cleanupResults(resultIdxSave);
+	if(res == NULL)
+		results->contents = (UINT)cell;
+	else
+		res->next = cell;
+	res = cell;
+	}
+deleteList(argsPtr);
+return(results);
+}
+
+
+CELL * explodeList(CELL * list, CELL * params)
+{
+ssize_t len = 1;
+ssize_t count = 1;
+CELL * cell = NULL;
+CELL * last = NULL;
+CELL * result = NULL;
+CELL * * lastChunk = NULL;
+int flag = FALSE;
+
+if(params != nilCell)
+	{
+	params = getInteger(params, (UINT*)&len);
+	flag = getFlag(params);
+	}
+
+result = getCell(CELL_EXPRESSION);
+
+if(len <= 0) return(result);
+
+while(list != nilCell)
+	{
+	if(result->contents == (UINT)nilCell)
+		{
+		cell = getCell(CELL_EXPRESSION);
+		lastChunk = (CELL * *)&result->contents;
+		result->contents = (UINT)cell;
+		cell->contents = (UINT)copyCell(list);
+		last = (CELL*)cell->contents;
+		}
+	else
+		{
+		if(count < len)
+			{
+			last->next = copyCell(list);
+			last = last->next;
+			count++;
+			}
+		else
+			{
+			cell->next = getCell(CELL_EXPRESSION);
+			lastChunk = (CELL * *)&cell->next;
+			cell = cell->next;
+			cell->contents = (UINT)copyCell(list);
+			last = (CELL*)cell->contents;
+			count = 1;
+			}
+		
+		}
+	list = list->next;
+	}
+	
+if(flag && count < len)
+	{
+	if(lastChunk)
+		{
+		deleteList(*lastChunk);
+		*lastChunk = nilCell;
+		}
+	}
+	
+return(result);
+}
+
+
+/* ---------------------- set primitives --------------------------------- */
+
+CELL * setInterDiff(CELL * params, int mode);
+
+
+#define SET_INTER 0
+#define SET_DIFF 1
+#define SET_UNIQUE 2
+
+CELL * p_intersect(CELL * params)
+{
+if(params->next == nilCell)
+	return(setInterDiff(params, SET_UNIQUE));
+else
+	return(setInterDiff(params, SET_INTER));
+}
+
+CELL * p_difference(CELL * params)
+{
+return(setInterDiff(params, SET_DIFF));
+}
+
+
+CELL * p_unique(CELL * params)
+{
+return(setInterDiff(params, SET_UNIQUE));
+}
+
+
+/* new very fast version in 8.6.2 */
+
+CELL * setInterDiff(CELL * params, int mode)
+{
+CELL * listA;
+CELL * listB = NULL;
+CELL * * vectorA;
+CELL * * vectorB = NULL;
+CELL * * vectorResult;
+ssize_t lengthA, lengthB;
+ssize_t i = 0, j = 0, k = 0, top = 0;
+CELL * cell = NULL;
+CELL * result;
+int listMode = FALSE;
+int cmp, flag = FALSE;
+
+params = getListHead(params, &listA);
+if(listA == nilCell)
+	return(getCell(CELL_EXPRESSION));
+
+if(mode != SET_UNIQUE)
+	{
+	params = getListHead(params, &listB);
+	listMode = getFlag(params);
+
+    if(listA == listB)
+      	{
+       	flag = TRUE;
+       	listA = copyList(listB);
+       	}
+
+	if(listB == nilCell) 
+		{
+		if(mode == SET_INTER)
+			return(getCell(CELL_EXPRESSION));
+		listB = NULL;
+		}
+	}
+
+vectorA = listToSortedVector(listA, &lengthA, NULL, TRUE);
+
+vectorResult = callocMemory(lengthA * sizeof(CELL *));
+
+if(listB)
+    vectorB = listToSortedVector(listB, &lengthB, NULL, 0);
+
+result = getCell(CELL_EXPRESSION);
+    
+while(i < lengthA)
+    {
+    if(listB) switch(mode)
+        {
+        case SET_INTER:
+            cmp = compareCells(vectorA[i], vectorB[j]);
+            if(cmp == 0) break;
+            if(cmp < 0)
+                {
+                ++i;
+                continue;
+                }      
+            if(j < (lengthB - 1)) ++j;
+            else ++i;
+            continue;
+
+        case SET_DIFF:
+            cmp = compareCells(vectorA[i], vectorB[j]);
+            if(cmp == 0)
+                {
+                ++i;
+                continue;
+                }
+            if(cmp < 0) break;
+	    if(j < (lengthB - 1)) ++j;
+            else break;
+
+            continue;
+                            
+        case SET_UNIQUE:
+        default:
+            break;
+        }
+
+    /* if not in result or if list mode is specified */
+    if( (k == 0) || (compareCells(vectorA[i], vectorResult[top]) != 0) || (listMode == TRUE) )
+        {
+        top = k;
+        vectorResult[k++] = vectorA[i];
+        }
+
+    ++i;
+    }
+
+
+if(k > 0)
+    {
+    binsort(vectorResult, k, (CELL*)0xFFFFFFFF);
+    cell = copyCell(vectorResult[0]);
+    result->contents = (UINT)cell;
+
+    /* relinking */
+    for(i = 1; i < k; i++)
+        {
+        cell->next = copyCell(vectorResult[i]);
+        cell = cell->next;
+        }
+    cell->next = nilCell;
+    }
+
+free(vectorResult);
+
+cell = resortVectorToList(vectorA, lengthA);
+
+if(vectorB) free(vectorB);
+
+if(flag) deleteList(listA);
+
+return(result);
+}    
+
+/* ----------------------------------------------------------------------- */
+
+CELL * p_match(CELL * params)
+{
+CELL * cell;
+CELL * next;
+CELL * result;
+
+cell = evaluateExpression(params);
+if(!isList(cell->type)) return(nilCell);
+params = params->next;
+next = evaluateExpression(params);
+if(!isList(next->type)) return(nilCell);
+
+result = patternMatchL((CELL *)cell->contents, (CELL *)next->contents, getFlag(params->next));
+if(result) return(result);
+return(getCell(CELL_EXPRESSION));
+}
+
+
+CELL * linkMatches(CELL * * matchList, CELL * matchPtr, CELL * elmnt)
+{
+if(*matchList == NULL)
+    {
+    *matchList = getCell(CELL_EXPRESSION);
+    (*matchList)->contents = (UINT)elmnt;
+    matchPtr = (CELL *)(*matchList)->contents;
+    }
+else
+    {
+    matchPtr->next = elmnt;
+    }
+
+while(matchPtr->next != nilCell)
+	matchPtr = matchPtr->next;
+
+return(matchPtr);
+}
+
+
+CELL * patternMatchL(CELL * pattern, CELL * list, int flag)
+{
+CELL * match;
+CELL * matchList = NULL;
+CELL * matches = NULL;
+CELL * starList = NULL;
+CELL * stars = NULL;
+
+MATCH_LIST:
+switch(pattern->type)
+	{
+	case CELL_NIL:
+	/* end of pattern and list */
+	if(list->type == CELL_NIL) 
+		{
+		if(starList) deleteList(starList);
+		return(matchList);
+		}
+        
+	goto NO_MATCH_RETURN;
+
+	case CELL_QUOTE:
+	case CELL_EXPRESSION:
+	case CELL_MACRO:
+	case CELL_LAMBDA:
+		/* compare subexpressions */
+		if(list->type == pattern->type)
+			{
+			if((match = patternMatchL((CELL*)pattern->contents, (CELL*)list->contents, flag)) != nilCell)
+				{
+				if(match != NULL)
+					{
+					if(flag)
+						matches = linkMatches(&matchList, matches, match);
+					else
+						{
+						matches = linkMatches(&matchList, matches, (CELL*)match->contents);
+						match->contents = (UINT)nilCell;
+						deleteList(match);
+						}
+					}
+				pattern = pattern->next;
+				list = list->next;
+				goto MATCH_LIST;
+				}
+			}
+
+		goto NO_MATCH_RETURN;
+
+	case CELL_SYMBOL:
+		if(pattern->contents == (UINT)questionSymbol)	/* '?' */
+			{
+			if(list == nilCell) goto NO_MATCH_RETURN;
+			if(!flag) matches = linkMatches(&matchList, matches, copyCell(list));
+			break;
+			}
+
+		if(pattern->contents == (UINT)starSymbol ||
+		   pattern->contents == (UINT)plusSymbol)	/* '*'  and '+' */
+			{
+			if(starList == NULL) 
+				{
+				starList = getCell(CELL_EXPRESSION);
+				}
+
+			if(stars == NULL && pattern->contents == (UINT)plusSymbol)
+				goto WILD_CARD_GREP;
+			
+			if(pattern->next == nilCell)
+				{
+				if(stars == NULL)
+					starList->contents = (UINT)copyList(list);
+				else 
+					stars->next = copyList(list);
+
+				linkMatches(&matchList, matches, starList);
+				return(matchList);
+				}
+
+			if((match = patternMatchL(pattern->next, list, flag)) != nilCell)
+				{
+				matches = linkMatches(&matchList, matches, starList);
+				if(match != NULL)
+					{
+					matches->next = (CELL*)match->contents;
+					match->contents = (UINT)nilCell;
+					deleteList(match);
+					}
+				return(matchList);
+				}
+
+			if(list->next == nilCell)
+			goto NO_MATCH_RETURN;
+
+WILD_CARD_GREP:
+			if(pattern->contents == (UINT)plusSymbol)
+				if(list == nilCell) goto NO_MATCH_RETURN;
+
+			if(stars == NULL)
+				{
+				starList->contents = (UINT)copyCell(list);
+				stars = (CELL*)starList->contents;
+				}
+			else 
+				{
+				stars->next = copyCell(list);
+				stars = stars->next;
+				}
+
+			list = list->next;
+			goto MATCH_LIST;
+			}
+	default:
+		if(compareCells(pattern, list) != 0)
+		goto NO_MATCH_RETURN;
+
+		break;	
+	}
+
+if(flag) matches = linkMatches(&matchList, matches, copyCell(list));
+
+
+pattern = pattern->next;
+list = list->next;
+goto MATCH_LIST;
+
+NO_MATCH_RETURN:
+if(starList != NULL) deleteList(starList);
+if(matchList != NULL) deleteList(matchList);
+return(nilCell);
+}
+
+
+CELL * p_assoc(CELL * params)
+{
+CELL * key;
+CELL * eKey;
+CELL * list;
+
+if(params->type == CELL_EXPRESSION && params->next == nilCell)
+	{
+	key = getList(params, &list, FALSE);
+	list = (CELL *)list->contents;
+
+	while(key != nilCell)
+		{
+		eKey = evaluateExpression(key);
+		while(list != nilCell)
+			{
+			if(isList(list->type))
+				if(compareCells(eKey, (CELL *)list->contents) == 0) break;
+			list = list->next;
+			}
+
+		if((key = key->next) == nilCell) break;
+		list = ((CELL *)list->contents)->next;
+		}
+	}
+else
+	{
+	key = evaluateExpression(params);
+	getListHead(params->next, &list);
+	while(list != nilCell)
+		{
+		if(isList(list->type))
+			if(compareCells(key, (CELL *)list->contents) == 0) break;
+		list = list->next;
+		}
+	}
+
+if(list == nilCell) return(nilCell);
+return(copyCell(list));
+}
+
+
+CELL * p_lookup(CELL * params)
+{
+CELL * key;
+CELL * list;
+ssize_t index;
+
+key = evaluateExpression(params);
+params = getListHead(params->next, &list);
+
+while(list != nilCell)
+	{
+	if(isList(list->type))
+		if(compareCells(key, (CELL *)list->contents) == 0) break;
+	list = list->next;
+	}
+
+if(list == nilCell) return(nilCell);
+
+list = (CELL*)list->contents;
+
+if(params != nilCell)
+	getInteger(params, (UINT *)&index);
+else index = -1;
+
+if(index < 0) index = convertNegativeOffset(index, list);
+
+while(index--) 
+        {
+        if(list->next == nilCell) break;
+        list = list->next;
+        }
+
+return(copyCell(list));
+}
+
+/* bind and association list, works like:
+   (define (bind L) (dolist (i L) (apply set i))) 
+   L => ((x 1) (y 2) (z 3))
+*/
+
+CELL * p_bind(CELL * params)
+{
+SYMBOL * lref = NULL;
+CELL * list;
+CELL * cell;
+int evalFlag;
+
+params = getListHead(params, &list);
+evalFlag = getFlag(params);
+
+while(list != nilCell)
+	{
+	if(list->type != CELL_EXPRESSION)
+		return(errorProcExt(ERR_LIST_EXPECTED, list));
+
+	cell = (CELL *)list->contents;
+	lref = getSymbolCheckProtected(cell);
+	deleteList((CELL *)lref->contents);
+	if(evalFlag)
+		lref->contents = (UINT)copyCell(evaluateExpression(cell->next));
+	else
+		lref->contents = (UINT)copyCell(cell->next);
+	list = list->next;
+	}
+
+if(lref == NULL)
+	return(nilCell);
+
+return(copyCell((CELL *)lref->contents));
+}
+
+#ifdef WIN_32
+CELL * p_count(CELL * params)
+{
+CELL * items;
+CELL * list;
+CELL * result;
+CELL * * vectorItems;
+CELL * * vectorList;
+ssize_t lengthItems, lengthList;
+ssize_t i = 0, j = 0, idx; 
+int cmp;
+int flag = FALSE;
+CELL * cell;
+ssize_t * counts;
+
+params = getListHead(params, &items);
+getListHead(params, &list);
+
+result = getCell(CELL_EXPRESSION);
+
+if(items == nilCell)
+	return(result);
+	
+if(items == list)
+	{
+	flag = TRUE;
+	items = copyList(list);
+	}
+	
+vectorItems = listToSortedVector(items, &lengthItems, NULL, TRUE);
+vectorList = listToSortedVector(list, &lengthList, NULL, TRUE);
+
+counts = (ssize_t *)callocMemory(lengthItems * sizeof(ssize_t));
+
+if(vectorList)
+while(i < lengthList)
+	{
+	cmp = compareCells(vectorList[i], vectorItems[j]);
+	if(cmp == 0)
+		{
+		idx = (ssize_t)vectorItems[j]->next;
+		counts[idx] += 1;
+		++i;
+		continue;
+		}
+	if(cmp < 0)
+		{
+		++i;
+		continue;
+		}
+	if(j < (lengthItems - 1)) j++;
+	else i++;
+	}
+
+
+cell = stuffInteger(counts[0]);
+result->contents = (UINT)cell;
+for(i = 1; i < lengthItems; i++)
+	{
+	cell->next = stuffInteger(counts[i]);
+	cell = cell->next;
+	}
+freeMemory(counts);
+
+cell = resortVectorToList(vectorItems, lengthItems);
+if(vectorList) cell = resortVectorToList(vectorList, lengthList);
+
+if(flag) deleteList(items);
+
+return(result);
+}
+
+#else /* Mac OS X and other UNIX */
+
+typedef struct 
+	{
+	UINT type;
+	UINT next;
+	UINT aux;
+	UINT contents;
+	} COUNTCELL;
+
+CELL * p_count(CELL * params)
+{
+CELL * items;
+CELL * list;
+CELL * result;
+CELL * * counts;
+ssize_t lengthItems;
+ssize_t i = 0; 
+int flag = FALSE;
+CELL * cell;
+COUNTCELL * count;
+void * root = NULL;
+void * key;
+
+params = getListHead(params, &items);
+getListHead(params, &list);
+
+result = getCell(CELL_EXPRESSION);
+
+if(items == nilCell)
+	return(result);
+	
+if(items == list)
+	{
+	flag = TRUE;
+	items = copyList(list);
+	}
+	
+lengthItems = listlen(items);
+counts = (CELL * *)callocMemory(lengthItems * sizeof(CELL *));
+
+cell = items;
+for(i = 0; i < lengthItems; i++)
+	{
+	counts[i] = copyCell(cell); 
+	counts[i]->next = NULL;
+	key = tsearch(counts[i], &root, (int (*)(const void *, const void *))compareCells);
+	if(key == NULL)
+		errorProc(ERR_NOT_ENOUGH_MEMORY);
+	cell = cell->next;
+	}
+
+cell = list;
+while(cell != nilCell)
+	{
+	key = tfind(cell, &root, (int (*)(const void *, const void *))compareCells);
+	if(key != NULL)
+		{ 
+		count = (COUNTCELL *)*(CELL * *)key;
+		count->next++;
+		}
+	cell = cell->next;
+	}
+
+cell = stuffInteger((UINT)counts[0]->next);
+result->contents = (UINT)cell;
+for(i = 1; i < lengthItems; i++)
+	{
+	cell->next = stuffInteger((UINT)counts[i]->next);
+	cell = cell->next;
+	}
+
+for(i = 0; i < lengthItems; i++)
+	{
+	counts[i]->next = nilCell;
+	deleteList(counts[i]);
+	}
+
+freeMemory(counts);
+if(flag) deleteList(items);
+
+return(result);
+}
+
+#endif
+
+
+CELL * p_replaceAssoc(CELL * params)
+{
+CELL * key;
+CELL * repList;
+CELL * list;
+CELL * cell;
+CELL * previous = NULL;
+
+key = evaluateExpression(params);
+params = params->next;
+
+cell = evalCheckProtected(params, NULL);
+
+if(!isList(cell->type))
+	return(errorProcExt(ERR_LIST_EXPECTED, cell));
+
+cell->aux = (UINT)nilCell; /* undo last element optimization */
+
+if(isList(cell->type))
+	{
+	list = (CELL *)cell->contents;
+
+	while(list != nilCell)
+		{
+		if(isList(list->type))
+			if(compareCells(key, (CELL *)list->contents) == 0)
+				{
+				deleteList((CELL*)sysSymbol[0]->contents);
+				sysSymbol[0]->contents = (UINT)copyCell(list);
+				/* deleteList((CELL *)list->contents); */
+				if(params->next != nilCell)
+					{
+					getListHead(params->next, &repList);
+					deleteList((CELL *)list->contents);
+					list->contents = (UINT)copyList(repList);
+					}
+				else /* if no replacement given, remove association found */
+					{
+					deleteList((CELL *)list->contents);
+					list->contents = (UINT)nilCell;
+					if(previous == NULL)
+						cell->contents = (UINT)list->next;
+					else
+						previous->next = list->next;
+					list->next = nilCell;
+					deleteList(list);
+					}
+				return(copyCell(cell));
+				}
+		previous = list;
+		list = list->next;
+		}
+	}
+
+return(nilCell);
+}
+
+
+#define SET_ASSOC 0
+#define ASSOC_SET 1
+#define POP_ASSOC 2
+
+CELL * setAssoc(CELL * params, int mode)
+{
+CELL * key;
+CELL * eKey;
+CELL * repList;
+CELL * list;
+CELL * original = NULL;
+CELL * previous = NULL;
+
+if(params->type != CELL_EXPRESSION)
+	return(errorProcExt(ERR_SYNTAX_WRONG, params));
+
+key = getList(params, &list, TRUE);
+list->aux = (UINT)nilCell; /* undo last element optimization */
+original = list;
+list = (CELL *)list->contents;
+
+while(key != nilCell)
+	{
+	eKey = evaluateExpression(key);
+	while(list != nilCell)
+		{
+		if(isList(list->type))
+			if(compareCells(eKey, (CELL *)list->contents) == 0) break;
+		previous = list;
+		list = list->next;
+		}
+
+	if((key = key->next) == nilCell) break;
+	previous = (CELL *)list->contents;
+	list = ((CELL *)list->contents)->next;
+	}
+
+if(list == nilCell) return(nilCell); /* key not found */
+
+if(mode == POP_ASSOC)
+	{
+	if(previous == NULL)
+		original->contents = (UINT)list->next;
+	else
+		previous->next = list->next;
+	list->next = nilCell;
+	return(list);	
+	}
+
+deleteList((CELL*)sysSymbol[0]->contents);
+sysSymbol[0]->contents = (UINT)copyCell(list);
+
+if(params->next != nilCell)
+	{
+	getListHead(params->next, &repList);
+	deleteList((CELL *)list->contents);
+	list->contents = (UINT)copyList(repList);
+	}
+
+if(mode == SET_ASSOC)
+	return(copyCell(original));
+
+return(copyCell((CELL *)sysSymbol[0]->contents));
+}
+
+
+CELL * p_setAssoc(CELL * params)
+{
+return(setAssoc(params, SET_ASSOC));
+}
+
+
+CELL * p_assocSet(CELL * params)
+{
+return(setAssoc(params, ASSOC_SET));
+}
+
+CELL * p_popAssoc(CELL * params)
+{
+return(setAssoc(params, POP_ASSOC));
+}
+
+
+void binsort(CELL * * x, ssize_t n, CELL * pCell)
+{
+ssize_t i,j,k,l,m,kf,lf;
+CELL * expr;
+CELL * cell;
+int resultIndexSave;
+jmp_buf errorJumpSave;
+int errNo;
+CELL * * y;
+
+y = allocMemory(n * sizeof(CELL *));
+
+m = 1;
+while(m < n)
+	{
+	for(i = 0; i < n; i += 2*m)
+		{
+		k = i; l = i + m;
+		if(l >= n)
+			{
+			kf = lf = n;
+			l = lf + 1;
+			}
+		else 
+			{
+			kf = k + m - 1;
+			lf = l + m - 1;
+			}
+
+		if(lf >= n) lf = n - 1;
+
+		for(j = i; j <= lf; j++)
+			{
+			if(k > kf)
+				{
+				y[j] = x[l++]; 
+				continue;
+				}
+			if(l > lf)
+				{
+				y[j] = x[k++]; 
+				continue;
+				}
+				
+			if(pCell == NULL)
+				{
+				if(compareCells((CELL*)x[k], (CELL*)x[l]) <= 0)
+					y[j] = x[k++];
+				else
+					y[j] = x[l++];
+				continue;
+				}
+			if(pCell == (CELL*)0xFFFFFFFF)
+				{
+			    if(((CELL*)x[k])->next <= ((CELL*)x[l])->next)
+					y[j] = x[k++];
+				else
+					y[j] = x[l++];
+				continue;
+				}
+
+			resultIndexSave = resultStackIdx;
+			expr = getCell(CELL_EXPRESSION);
+			expr->contents = (UINT)copyCell(pCell);
+			cell = (CELL *)expr->contents;
+			cell->next = getCell(CELL_QUOTE);
+			((CELL *)cell->next)->contents = (UINT)copyCell((CELL*)x[k]);
+			cell = cell->next;
+			cell->next = getCell(CELL_QUOTE);
+			((CELL *)cell->next)->contents = (UINT)copyCell((CELL*)x[l]);
+			
+			/* do result stack cleanup, and free memory under
+			   error conditions */
+			memcpy(errorJumpSave, errorJump, sizeof(jmp_buf));
+			if((errNo = setjmp(errorJump)) != 0)
+				{
+				memcpy(errorJump, errorJumpSave, (sizeof(jmp_buf)));
+				deleteList(expr);
+				cleanupResults(resultIndexSave);
+				free(x); /* allocates by parent routine */
+				free(y);
+				longjmp(errorJump, errNo);
+				}										
+
+			cell = evaluateExpression(expr);
+
+			memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+			if(!isNil(cell) && !isEmpty(cell))
+				y[j] = x[k++];
+			else
+				y[j] = x[l++];
+
+			deleteList(expr);
+			cleanupResults(resultIndexSave);
+			}
+		}
+
+	for(i = 0; i < n; i++) x[i] = y[i]; 
+	m = m * 2;
+	}
+	
+free(y);
+}
+
+CELL * * listToSortedVector(CELL * list, ssize_t * length, CELL * func, int indexFlag);
+
+CELL * p_sort(CELL * params)
+{
+CELL * list;
+CELL * * vector;
+ssize_t length, i;
+
+list = params;
+
+params = evalCheckProtected(params, NULL);
+
+if(isList(params->type))
+	{
+	if(params->contents == (UINT)nilCell)
+		return(getCell(CELL_EXPRESSION));
+	
+	params->aux = (UINT)nilCell; /* undo last element optimization */
+
+	vector = listToSortedVector((CELL *)params->contents, &length, list->next, 0);
+
+	/* relink cells */
+	list = vector[0];
+	--length;
+	i = 1;
+	while(length--)
+		{
+		list->next = vector[i];
+		list = list->next;
+		i++;
+		}
+	list->next = nilCell;
+
+	params->contents = (UINT)vector[0];
+	freeMemory(vector);
+	}
+else if(isArray(params->type))
+	{
+	vector = (CELL **)params->contents;
+	length = (params->aux - 1) / sizeof(UINT);
+	if(list->next == nilCell)
+		binsort(vector, length, NULL);
+	else
+		binsort(vector, length, list->next);
+	}
+else
+	return(errorProcExt(ERR_LIST_OR_ARRAY_EXPECTED, list));
+
+return(copyCell(params));
+}
+
+
+CELL * * listToSortedVector(CELL * list, ssize_t * length, CELL * func, int indexFlag)
+{
+CELL * * vector;
+CELL * prev;
+ssize_t i;
+
+if((*length = listlen(list)) == 0) return(NULL);
+
+/* build vector */
+vector = allocMemory(*length * sizeof(CELL *));
+for(i = 0; i < *length; i++)
+	{
+	vector[i] = prev = list;
+	list = list->next;
+	if(indexFlag) prev->next = (void *)i;
+	}
+
+if(func != nilCell && func != NULL)
+    {
+	func = evaluateExpression(func);
+    if(func->type == CELL_SYMBOL) 
+    	func = (CELL*)((SYMBOL *)func->contents)->contents;
+    binsort(vector, *length, func);
+    } 
+else
+    binsort(vector, *length, NULL);
+
+return(vector);
+}
+
+
+CELL * resortVectorToList(CELL * * vector, ssize_t length)
+{
+CELL * list;
+ssize_t i;
+
+binsort(vector, length, (CELL*)0xFFFFFFFF);
+list  = vector[0];
+for(i = 1; i < length; i++)
+	{
+	list->next = vector[i];
+	list = list->next;
+	}
+list->next = nilCell;
+list = vector[0];
+free(vector);
+
+return(list);
+}
+
+/* called with params containing the indices 
+   or list of indices */
+
+CELL * implicitIndexList (CELL * list, CELL * params)
+{
+CELL * cell;
+ssize_t index;
+int evalFlag;
+
+cell = evaluateExpression(params);
+if(isNumber(cell->type))
+	{
+	getIntegerExt(cell, (UINT *)&index, FALSE);
+	params = params->next;
+	evalFlag = TRUE;
+	}
+else if(isList(cell->type))
+	{
+	params = (CELL*)cell->contents;
+	params = getIntegerExt(params, (UINT *)&index, FALSE);
+	evalFlag = FALSE;
+	}
+else return(errorProcExt(ERR_LIST_OR_NUMBER_EXPECTED, params));
+
+while(isList(list->type))
+	{
+	/* last element optimization */
+	if(index == -1 && list->aux != (UINT)nilCell) 
+		list = (CELL *)list->aux;
+	else
+		{
+		list = (CELL *)list->contents;
+		if(index < 0) 
+			index = convertNegativeOffset(index, list);
+
+		while(index--)	list = list->next;
+
+		if(list == nilCell) 
+			errorProc(ERR_LIST_INDEX_OUTOF_BOUNDS);
+		}
+
+	if(params == nilCell || !isList(list->type))  break;
+	params = getIntegerExt(params, (UINT *)&index, evalFlag);
+	}
+
+return(list);
+}
+
+
+CELL * p_sequence(CELL * params)
+{
+double fromFlt, toFlt, interval, step, cntFlt;
+INT64 fromInt64, toInt64, stepCnt, i;
+CELL * sequence;
+CELL * cell;
+int intFlag;
+
+if((intFlag = (((CELL*)params->next)->next == nilCell)))
+	{
+	params = getInteger64(params, &fromInt64);
+	getInteger64(params, &toInt64);
+	stepCnt = (fromInt64 > toInt64) ? fromInt64 - toInt64 : toInt64 - fromInt64;
+	cell = stuffInteger64(fromInt64);
+	}
+else
+	{	
+	params = getFloat(params, &fromFlt);
+	params = getFloat(params, &toFlt);
+	getFloat(params, &step);
+
+	if(isnan(fromFlt) || isnan(toFlt) || isnan(step))
+		return(errorProc(ERR_INVALID_PARAMETER_NAN));
+
+	step = (step < 0) ? -step : step;
+	step = (fromFlt > toFlt) ? -step : step;
+	cntFlt = (fromFlt < toFlt) ? (toFlt - fromFlt)/step : (fromFlt - toFlt)/step;
+	stepCnt = (cntFlt > 0.0) ? floor(cntFlt + 0.0000000001) : floor(-cntFlt + 0.0000000001);
+	cell = stuffFloat(&fromFlt);
+	}
+
+sequence = getCell(CELL_EXPRESSION);
+sequence->contents = (UINT)cell;
+
+for(i = 1; i <= stepCnt; i++)
+	{
+	if(intFlag)
+		{
+		if(fromInt64 > toInt64)
+			cell->next = stuffInteger(fromInt64 - i);
+		else
+			cell->next = stuffInteger(fromInt64 + i);
+		}
+	else
+		{
+		interval = fromFlt + i * step;
+		cell->next = stuffFloat(&interval);
+		}
+	cell = cell->next;
+	}
+
+return(sequence);
+}
+
+
+#define FILTER_FILTER 0
+#define FILTER_INDEX 1
+#define FILTER_CLEAN 2
+#define FILTER_FOR_ALL 3
+#define FILTER_EXISTS 4
+
+CELL * filterIndex(CELL * params, int mode);
+
+CELL * p_filter(CELL * params)
+{
+return filterIndex(params, FILTER_FILTER);
+}
+
+CELL * p_index(CELL * params)
+{
+return filterIndex(params, FILTER_INDEX);
+}
+
+CELL * p_clean(CELL * params)
+{
+return filterIndex(params, FILTER_CLEAN);
+}
+
+CELL * p_exists(CELL * params)
+{
+return filterIndex(params, FILTER_EXISTS);
+}
+
+CELL * p_forAll(CELL * params)
+{
+return filterIndex(params, FILTER_FOR_ALL);
+}
+
+CELL * filterIndex(CELL * params, int mode)
+{
+CELL * expr;
+CELL * pCell;
+CELL * args;
+CELL * resultList = NULL;
+CELL * result;
+CELL * cell;
+ssize_t count;
+int resultIndexSave;
+int errNo, trueFlag;
+
+args = evaluateExpression(params->next);
+pCell = evaluateExpression(params);
+
+if(!isList(args->type))
+	return(errorProcExt(ERR_LIST_EXPECTED, params->next));
+args = (CELL *)args->contents;
+
+result = NULL;
+count = 0;
+resultIndexSave = resultStackIdx;
+while(args != nilCell)
+	{
+	expr = getCell(CELL_EXPRESSION);
+	expr->contents = (UINT)copyCell(pCell);
+	cell = (CELL *)expr->contents;
+	cell->next = getCell(CELL_QUOTE);
+	cell = cell->next;
+	cell->contents = (UINT)copyCell(args);
+	pushResult(expr);
+
+	if(!(cell = evaluateExpressionSafe(expr, &errNo)))
+		{
+		if(resultList) deleteList(resultList);
+		longjmp(errorJump, errNo);
+		}
+
+    trueFlag = !isNil(cell);
+
+	cleanupResults(resultIndexSave);
+
+	if(mode == FILTER_EXISTS && trueFlag)
+		return(copyCell(args));
+
+	else if (mode == FILTER_FOR_ALL)
+		{
+		if(trueFlag) goto CONTINUE_FOR_ALL;
+		else return(nilCell);
+		}
+
+	if((trueFlag && mode != FILTER_CLEAN) || (!trueFlag && mode == FILTER_CLEAN))
+		{
+		if(result == NULL)
+			{
+			resultList = getCell(CELL_EXPRESSION);
+			resultList->contents = (mode == FILTER_INDEX) ? 
+						(UINT)stuffInteger((UINT)count): (UINT)copyCell(args) ;
+			result = (CELL*)resultList->contents;
+			}
+		else
+			{
+			result->next = (mode == FILTER_INDEX) ?
+						stuffInteger(count): copyCell(args);
+			result = result->next;
+			}
+		}
+
+	CONTINUE_FOR_ALL:
+	args = args->next;
+	count++;
+	}
+
+if(mode == FILTER_EXISTS)
+	return(nilCell);
+
+if(mode == FILTER_FOR_ALL)
+	return(trueCell);
+
+if(resultList == NULL)
+	return(getCell(CELL_EXPRESSION));
+
+return(resultList);
+}
+
+
+#define MAX_REF_STACK 256
+typedef struct {
+	size_t * base;
+	size_t idx;
+	} REFSTACK;
+
+#define pushRef(A) (refStack->base[refStack->idx++] = (UINT)(A))
+#define popRef() (--refStack->idx)
+
+CELL * makeIndexVector(REFSTACK * refStack)
+{
+CELL * vector;
+CELL * next;
+int i;
+
+vector = getCell(CELL_EXPRESSION);
+next = stuffInteger(refStack->base[0]);
+vector->contents = (UINT)next;
+
+for(i = 1; i < refStack->idx; i++)
+	{
+	next->next = stuffInteger(refStack->base[i]);
+	next = next->next;
+	}	
+	
+return(vector);
+}
+
+#define REF_SINGLE 0
+#define REF_ALL 1
+
+void ref(CELL * keyCell, CELL * list, CELL * funcCell, CELL * result, 
+						CELL * * next, REFSTACK * refStack, int mode)
+{
+size_t idx = 0;
+int resultIdxSave = resultStackIdx;
+
+while(list != nilCell)
+	{
+	if(compareFunc(keyCell, list, funcCell) == 0)
+		{
+		if(funcCell)
+			{
+			deleteList((CELL*)sysSymbol[0]->contents);
+			sysSymbol[0]->contents = (UINT)copyCell(list);
+			}
+		if(refStack->idx < MAX_REF_STACK) pushRef(idx);
+		else errorProc(ERR_NESTING_TOO_DEEP);
+		if(*next == NULL)
+			{
+			*next = makeIndexVector(refStack);
+			result->contents = (UINT)*next;
+			}
+		else
+			{
+			(*next)->next = makeIndexVector(refStack);
+			*next = (*next)->next;
+			}	
+		popRef();
+		if(mode == REF_SINGLE) return;
+		}
+	if(isList(list->type))
+		{
+		if(refStack->idx < MAX_REF_STACK) pushRef(idx);
+		else errorProc(ERR_NESTING_TOO_DEEP);
+		ref(keyCell, (CELL*)list->contents, funcCell, result, next, refStack, mode);
+		popRef();
+		}
+
+	idx++;
+	cleanupResults(resultIdxSave);
+	list = list->next;
+	}
+}
+
+
+CELL * reference(CELL * params, int mode)
+{
+CELL * cell;
+CELL * keyCell;
+CELL * list;
+CELL * funcCell = NULL;
+CELL * next = NULL;
+REFSTACK refStack;
+
+refStack.base = alloca((MAX_REF_STACK + 2) * sizeof(size_t));
+refStack.idx = 0;
+
+if(params->type == CELL_EXPRESSION)
+	{
+	cell = getList(params, &list, FALSE);
+	keyCell = evaluateExpression(cell);
+	}
+else
+	{
+	keyCell = evaluateExpression(params);
+	params = params->next;
+	list = evaluateExpression(params);
+	}
+
+if(params->next != nilCell)
+	funcCell = evaluateExpression(params->next);
+
+if(!isList(list->type))
+	return(errorProcExt(ERR_LIST_EXPECTED, list));
+
+cell = getCell(CELL_EXPRESSION);
+
+ref(keyCell, (CELL *)list->contents, funcCell, cell, &next, &refStack, mode);
+
+if(mode == REF_SINGLE)
+	{
+	next = (CELL *)cell->contents;
+	if(next == nilCell) return(cell);
+	cell->contents = (UINT)nilCell;
+	deleteList(cell);
+	return(next);
+	}
+
+return(cell);
+}
+
+CELL * p_ref(CELL * params)
+{
+return(reference(params, REF_SINGLE));
+}
+
+CELL * p_refAll(CELL * params)
+{
+return(reference(params, REF_ALL));
+}
+
+
+#define SETREF_ELMNT 0
+#define SETREF_LIST 1
+#define SETREF_ALL 2
+
+CELL * modRef(CELL * key, CELL * list, CELL * func, CELL * new, int mode, int * count)
+{
+CELL * result;
+int resultIdxSave = resultStackIdx;
+
+while(list != nilCell)
+	{
+	if(compareFunc(key, list, func) == 0)
+		{
+		*count += 1;
+		if(mode == SETREF_ELMNT)
+			{
+			return(updateCell(list, new));
+			}
+		else
+			{
+			deleteList(updateCell(list, new));
+			if(mode == SETREF_LIST) return(list);
+			}
+
+		list = list->next;
+		continue;
+		}
+	else if(isList(list->type))
+		{
+		result = modRef(key, (CELL *)list->contents, func, new, mode, count);
+		if(result != nilCell) return(result);
+		}
+
+	cleanupResults(resultIdxSave);
+	list = list->next;
+	}
+
+return(nilCell);
+}
+
+
+CELL * setRef(CELL * params, int mode)
+{
+CELL * key;
+CELL * list;
+CELL * new = NULL;
+CELL * funcCell = NULL;
+CELL * result;
+int count = 0;
+
+new = params->next;
+if(params->type != CELL_EXPRESSION)
+	return(errorProcExt(ERR_SYNTAX_WRONG, params));
+
+params = getList(params, &list, TRUE);
+key = evaluateExpression(params);
+
+if(new->next != nilCell)
+	funcCell = evaluateExpression(new->next);
+
+result = modRef(key, (CELL *)list->contents, funcCell, new, mode, &count);
+
+if(count == 0)
+	return(nilCell);
+
+if(mode == SETREF_ELMNT)
+	return(result);
+
+return(copyCell(list));
+}
+
+
+
+CELL * p_setRef(CELL * params)
+{
+return(setRef(params, SETREF_LIST));
+}
+
+CELL * p_setRefAll(CELL * params)
+{
+return(setRef(params, SETREF_ALL));
+}
+
+CELL * p_refSet(CELL * params)
+{
+return(setRef(params, SETREF_ELMNT));
+}
+
+
+/* update a cell in-place and put a copy of previous content
+   in $0 to be used in replacement expressions.
+   this function is used in set-nth/nth-set
+*/
+CELL * updateCell(CELL * cell, CELL * val)
+{
+CELL * prev;
+CELL * new;
+
+if(cell == nilCell) return(nilCell);
+
+deleteList((CELL*)sysSymbol[0]->contents);
+sysSymbol[0]->contents = (UINT)copyCell(cell);
+
+if(val != nilCell)
+	{
+	new = copyCell(evaluateExpression(val)); 
+
+	/* save previous content */
+	prev = getCell(cell->type);
+	prev->aux = cell->aux;
+	prev->contents = cell->contents;
+
+	cell->type = new->type;
+	cell->aux = new->aux;
+	cell->contents = new->contents;
+
+	/* free the cell  */
+	new->type = CELL_FREE;
+	new->aux = 0;
+	new->contents = 0;
+	new->next = firstFreeCell;
+	firstFreeCell = new;
+	--cellCount;
+	}
+else
+	return(copyCell(cell));
+
+return(prev);
+}
+
+void flat(CELL * list, CELL * result, CELL * * next)
+{
+while(list != nilCell)
+	{
+	if(isList(list->type))
+		flat((CELL*)list->contents, result, next);
+	else
+		{
+		if(*next == NULL)
+			{
+			*next = copyCell(list);
+			result->contents = (UINT)*next;
+			}
+		else
+			{
+			(*next)->next = copyCell(list);
+			*next = (*next)->next;
+			}	
+		}
+
+	list = list->next;
+	}
+}
+
+
+CELL * p_flat(CELL * params)
+{
+CELL * list;
+CELL * result;
+CELL * next;
+
+getListHead(params, &list);
+
+result = getCell(CELL_EXPRESSION);
+
+next = NULL;
+
+flat(list, result, &next);
+
+return(result);
+}
+
+
+
+
+/* --------------------------------- array routines ------------------------- */
+
+
+CELL * initArray(CELL * array, CELL * list, CELL * * next);
+
+CELL * p_array(CELL * params)
+{
+ssize_t index[17];
+int p = 0;
+CELL * array = NULL;
+CELL * list = nilCell;
+CELL * next = NULL;
+
+while(params != nilCell && p < 17)
+	{
+	list = evaluateExpression(params);
+	if(isNumber(list->type))
+		{
+		getIntegerExt(list, (UINT*)&index[p], FALSE);
+		if(index[p] < 1) 
+			return(errorProcExt(ERR_WRONG_DIMENSIONS, list));
+		else p++;
+		}
+	else if(isList(list->type)) break;
+	else return(errorProcExt(ERR_NUMBER_EXPECTED, list));
+	params = params->next;
+	}
+
+if(p == 0)
+	return(errorProc(ERR_MISSING_ARGUMENT));
+
+index[p] = 0;
+if(!isList(list->type)) list = nilCell;
+
+array = makeArray(index, 0);
+
+if(list != nilCell) 
+	array = initArray(array, list, &next);
+
+return(array);	
+}
+
+
+CELL * makeArray(ssize_t * index, int p)
+{
+CELL * array;
+CELL * list;
+CELL * * addr;
+ssize_t size;
+
+array = getCell(CELL_ARRAY);
+size = index[p];
+array->contents = (UINT)callocMemory(size * sizeof(UINT) + 1);
+array->aux = size * sizeof(UINT) + 1;
+addr = (CELL * *)array->contents;
+
+p++;
+if(index[p] > 0)
+	{
+	list = makeArray(index, p);
+	while(size--) *(addr++) = copyCell(list);
+	deleteList(list); 
+	return(array);
+	}
+else
+	while(size--) *(addr++) = nilCell;
+
+return(array);
+}
+
+
+CELL * initArray(CELL * array, CELL * list, CELL * * next)
+{
+CELL * * addr;
+int size;
+
+size = (array->aux - 1) / sizeof(UINT);
+addr = (CELL * *)array->contents;
+
+while(size--)
+	{
+	if((*addr)->type == CELL_ARRAY)
+		{
+		*(addr) = initArray(*addr, list, next);
+		addr++;
+		continue;
+		}
+
+	if(*next == NULL || *next == nilCell)
+		{
+		deleteList(*addr);
+		*(addr++) = copyCell((CELL *)list->contents);
+		*next = (CELL*)list->contents;
+		*next = (*next)->next;
+		}
+	else	
+		{
+		deleteList(*addr);
+		*(addr++) = copyCell(*next);
+		*next = (*next)->next;
+		}
+	}
+
+			
+return(array);
+}
+
+
+
+CELL * p_arrayList(CELL * params)
+{
+CELL * array;
+
+array = evaluateExpression(params);
+
+if(array->type != CELL_ARRAY)
+	return(errorProcExt(ERR_ARRAY_EXPECTED, params));
+
+return(arrayList(array));
+}
+
+
+
+CELL * arrayList(CELL * array)
+{
+CELL * list = NULL;
+CELL * * addr;
+CELL * new;
+CELL * cell;
+ssize_t size;
+
+addr = (CELL * *)array->contents;
+size = (array->aux - 1) / sizeof(UINT);
+
+while(size--)
+	{
+	cell = *(addr++);
+	if(cell->type == CELL_ARRAY)
+		new = arrayList(cell);
+	else
+		new = copyCell(cell);
+	if(list == NULL)
+		{
+		array = list = getCell(CELL_EXPRESSION);
+		list->contents = (UINT)new;
+		list = new;
+		}
+	else
+		{
+		list->next = new;
+		list = new;
+		}
+	}
+		
+return(array);
+}
+
+CELL * arrayTranspose(CELL * array)
+{
+ssize_t n, m, i, j;
+CELL * cell;
+CELL * * addr;
+CELL * * newAddr;
+CELL * * row;
+CELL * * newRow;
+CELL * newArray;
+
+addr = (CELL * *)array->contents;
+n = (array->aux - 1) / sizeof(CELL *);
+
+cell = *addr;
+if(cell->type != CELL_ARRAY)
+	return(errorProcExt(ERR_WRONG_DIMENSIONS, array));
+m = (cell->aux - 1) / sizeof(CELL *);
+
+newArray = getCell(CELL_ARRAY);
+newArray->aux = m  * sizeof(CELL *) + 1;
+newAddr = (CELL * *)callocMemory(newArray->aux);
+newArray->contents = (UINT)newAddr;
+
+for(j = 0; j < m; j++)
+	{
+	/* create new row vector */
+	cell = getCell(CELL_ARRAY);
+	cell->aux = n * sizeof(CELL *) + 1;
+	newRow = (CELL * *)callocMemory(cell->aux);
+	cell->contents = (UINT)newRow;
+	*(newAddr + j) = cell;
+	for( i = 0; i < n; i++)
+		{
+		cell = *(addr + i);
+		if(cell->type != CELL_ARRAY)
+			*(newRow + i) = copyCell(cell); 
+		else
+			{
+			row = (CELL * *)cell->contents;
+			if( (cell->aux - 1) / sizeof(CELL *) < (j + 1))
+				*(newRow + i) = nilCell;
+			else
+				*(newRow + i) = copyCell(*(row + j));
+			}
+		}
+	} 	
+		
+return(newArray);
+}
+
+
+CELL * subarray(CELL * array, ssize_t offset, ssize_t length)
+{
+CELL * newArray;
+ssize_t size, i;
+CELL * * newAddr;
+CELL * * addr;
+
+size = (array->aux - 1) / sizeof(CELL *);
+if(offset < 0) offset = offset + size;
+if(offset >= size || offset < 0) 
+		return(errorProcExt2(ERR_ARRAY_INDEX_OUTOF_BOUNDS, stuffInteger(offset)));
+
+if(length < 0)
+	{
+	length = size - offset + length;
+	if(length < 0) length = 0;
+	}
+
+if(length == MAX_LONG && length > (size - offset))
+	length = size - offset;
+
+if(length == 0 || length > (size - offset))
+	return(errorProcExt2(ERR_ARRAY_INDEX_OUTOF_BOUNDS, stuffInteger(length)));
+
+addr = (CELL * *)array->contents;
+newArray = getCell(CELL_ARRAY);
+newArray->aux = length * sizeof(CELL *) + 1;
+newAddr = (CELL * *)callocMemory(newArray->aux);
+newArray->contents = (UINT)newAddr;
+
+for(i = 0; i < length; i++)	
+	*(newAddr + i) = copyCell(*(addr + offset + i));
+
+return(newArray);
+}
+
+
+/* copies an array */
+UINT * copyArray(CELL * array)
+{
+CELL * * newAddr;
+CELL * * orgAddr;
+CELL * * addr;
+ssize_t size;
+
+addr = newAddr = (CELL * *)callocMemory(array->aux);
+
+size = (array->aux - 1) / sizeof(UINT);
+orgAddr = (CELL * *)array->contents;
+
+while(size--)
+	*(newAddr++) = copyCell(*(orgAddr++));
+	
+return((UINT*)addr);
+}
+
+
+CELL * appendArray(CELL * array, CELL * params)
+{
+CELL * cell;
+CELL * * addr;
+ssize_t size, sizeCell;
+ssize_t i;
+CELL * * newAddr;
+int  deleteFlag = 0; 
+
+if(params == nilCell)
+	return(copyCell(array));
+
+START_APPEND_ARRAYS:
+size = (array->aux - 1) / sizeof(CELL *);
+addr = (CELL * *)array->contents;
+cell = evaluateExpression(params);
+if(cell->type != CELL_ARRAY)
+	return(errorProcExt(ERR_ARRAY_EXPECTED, params));
+sizeCell = (cell->aux - 1) / sizeof(CELL *);
+
+newAddr = allocMemory(array->aux + cell->aux -1);
+
+for(i = 0; i < size; i++)
+	*(newAddr + i) = copyCell(*(addr + i));
+
+addr = (CELL * *)cell->contents;
+
+for(i = 0; i < sizeCell; i++)
+	*(newAddr + size + i) = copyCell(*(addr + i));
+
+cell = getCell(CELL_ARRAY);
+cell->aux = (size + sizeCell) * sizeof(CELL *) + 1;
+cell->contents = (UINT)newAddr;
+
+if( (params = params->next) != nilCell)
+	{
+	if(deleteFlag)
+		deleteList(array);
+	deleteFlag = 1;
+	array = cell;
+	goto START_APPEND_ARRAYS;
+	}
+
+if(deleteFlag)
+	deleteList(array);
+
+return(cell);
+}
+
+
+void deleteArray(CELL * array)
+{
+CELL * * addr;
+CELL * * mem;
+ssize_t size;
+
+mem = addr = (CELL * *)array->contents;
+size = (array->aux - 1) / sizeof(UINT);
+while(size--)
+	deleteList(*(addr++));
+
+freeMemory((char *)mem);
+}
+
+
+void markArray(CELL * array)
+{
+CELL * * addr;
+ssize_t size;
+
+addr = (CELL * *)array->contents;
+size = (array->aux - 1) / sizeof(UINT);
+
+while(size--) markList(*(addr++));
+}
+
+
+
+void printArray(CELL * array, UINT device)
+{
+CELL * list;
+
+list = arrayList(array);
+
+printExpression(list, device);
+
+deleteList(list);
+}
+
+
+void printArrayDimensions(CELL * array, UINT device)
+{
+CELL * * addr;
+
+while(array->type == CELL_ARRAY)
+	{
+	varPrintf(device, "%d ", (array->aux - 1)/sizeof(CELL *));
+	addr = (CELL **)array->contents;
+	array = *addr;
+	}
+}
+
+
+CELL * implicitIndexArray(CELL * cell, CELL * params)
+{
+CELL * * addr;
+CELL * list;
+ssize_t size, index;
+int evalFlag;
+
+list = evaluateExpression(params);
+if(isNumber(list->type))
+	{
+	getIntegerExt(list, (UINT *)&index, FALSE);
+	params = params->next;
+	evalFlag = TRUE;
+	}
+else if(isList(list->type))
+	{
+	params = (CELL*)list->contents;
+	params = getIntegerExt(params, (UINT *)&index, FALSE);
+	evalFlag = FALSE;
+	}
+else return(errorProcExt(ERR_LIST_OR_NUMBER_EXPECTED, params));
+
+while(cell->type == CELL_ARRAY)
+	{
+	addr = (CELL * *)cell->contents;
+	size = (cell->aux - 1) / sizeof(UINT);
+	if(index < 0) index = index + size;
+	if(index >= size || index < 0) 
+		return(errorProcExt2(ERR_ARRAY_INDEX_OUTOF_BOUNDS, stuffInteger(index)));
+	cell = *(addr + index);
+	if(params == nilCell || cell->type != CELL_ARRAY) break;
+	params = getIntegerExt(params, (UINT *)&index, evalFlag);
+	}
+
+return(cell);
+}
+
+
+int compareArrays(CELL * left, CELL * right)
+{
+CELL * * leftAddr;
+CELL * * rightAddr;
+ssize_t leftS, rightS;
+ssize_t result;
+
+leftAddr = (CELL * *)left->contents;
+rightAddr = (CELL * *)right->contents;
+leftS = (left->aux - 1) / sizeof(UINT);
+rightS = (right->aux - 1) / sizeof(UINT);
+
+if(leftS < rightS) return(-1);
+if(leftS > rightS) return(1);
+
+result = 0;
+while(leftS && result == 0)
+	{
+	result = compareCells(*(leftAddr++), *(rightAddr++));
+	leftS--; 
+	}
+
+return(result);
+}
+
+
+int compareFunc(CELL * left, CELL * right, CELL * func)
+{
+CELL * cell;
+CELL * expr;
+
+if(func == NULL) 
+	return(compareCells(left, right));
+
+expr = getCell(CELL_EXPRESSION);
+pushResult(expr);
+expr->contents = (UINT)copyCell(func);
+cell = (CELL *)expr->contents;
+cell->next = getCell(CELL_QUOTE);
+((CELL *)cell->next)->contents = (UINT)copyCell((CELL*)left);
+cell = cell->next;
+cell->next = getCell(CELL_QUOTE);
+((CELL *)cell->next)->contents = (UINT)copyCell((CELL*)right);
+			
+cell = evaluateExpression(expr);
+
+return(isNil(cell));
+}
+
+/* eof */
+
+
diff --git a/nl-liststr.c b/nl-liststr.c
new file mode 100644
index 0000000..24bb9e6
--- /dev/null
+++ b/nl-liststr.c
@@ -0,0 +1,1685 @@
+/* nl-liststr.c --- newLISP primitives handling lists and strings
+
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+#include "newlisp.h"
+#include "pcre.h"
+#include "protos.h"
+
+extern CELL * lastCellCopied;
+extern SYMBOL * sysSymbol[];
+
+/* used only on string indices */
+size_t adjustNegativeIndex(ssize_t index, size_t length)
+{
+if(index < 0) index = length + index;
+else if((index+1) > length) errorProc(ERR_STRING_INDEX_OUTOF_BOUNDS);
+
+if(index < 0) errorProc(ERR_STRING_INDEX_OUTOF_BOUNDS);
+
+return(index);
+}
+
+size_t adjustCount(ssize_t count, ssize_t length)
+{
+if(length <= 1 || count == 0 || length == count)
+	return(0);
+
+if(count > 0)
+    count = count % length;
+else
+    {
+    count = -count % length;
+    count = length - count;
+    }
+return(count);
+}
+
+#ifdef LINUX
+extern char * strcasestr(char * haystack, char * needle);
+#endif
+CELL * p_member(CELL * params)
+{
+CELL * key;
+CELL * list;
+CELL * member;
+long options  = -1;
+char * ptr;
+ssize_t pos;
+
+key = evaluateExpression(params);
+
+params = params->next;
+list = evaluateExpression(params);
+
+if(params->next != nilCell)
+	getInteger(params->next, (UINT *)&options);
+
+if(isList(list->type))
+	list = (CELL *)list->contents;
+else if (list->type == CELL_STRING)
+	{
+	if(key->type != CELL_STRING)
+		return(errorProcExt(ERR_STRING_EXPECTED, params));
+	if(options == -1)
+		{
+		ptr = strstr((char *)list->contents, (char *) key->contents);
+		if(ptr) return(stuffString(ptr));
+		}	
+	else
+		{
+		pos = searchBufferRegex((char*)list->contents, 0, (char *)key->contents, list->aux - 1, options, 0);
+		if(pos != -1) return(stuffString((char *)list->contents + pos));
+		}
+	return(nilCell);
+	}
+else 
+	return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, params->next));
+
+while(list != nilCell)
+	{
+	if(compareCells(key, list) == 0) break;
+	list = list->next;
+	}
+
+if(list == nilCell) return(nilCell);
+member = getCell(CELL_EXPRESSION);
+member->contents = (UINT)copyList(list);
+return(member);
+}
+
+CELL * p_length(CELL * params)
+{
+size_t length;
+SYMBOL * symbol;
+
+params = evaluateExpression(params);
+length = 0;
+switch(params->type)
+	{
+	case CELL_LONG:
+		length = sizeof(UINT); break;
+#ifndef NEWLISP64
+	case CELL_INT64:
+		length = sizeof(INT64); break;
+#endif
+	case CELL_FLOAT:
+		length = sizeof(double); break;
+	case CELL_STRING:
+		length = params->aux - 1; break;
+	case CELL_CONTEXT:
+	case CELL_SYMBOL:
+		symbol = (SYMBOL *)params->contents;
+		length = strlen(symbol->name);
+		break;
+	case CELL_DYN_SYMBOL:
+		length = strlen((char *)params->contents);
+		break;
+	case CELL_EXPRESSION:
+	case CELL_LAMBDA:
+	case CELL_MACRO:
+	        length = listlen((CELL *)params->contents);
+		break;
+	case CELL_ARRAY:
+		length = (params->aux - 1) / sizeof(UINT);
+	default:
+		break;
+	}
+return(stuffInteger(length));
+}
+
+
+CELL * p_append(CELL * params)
+{
+CELL * list = NULL;
+CELL * firstCell = NULL;
+CELL * copy = NULL;
+CELL * cell;
+
+while(params != nilCell)
+    {
+    cell = evaluateExpression(params);
+    if(!isList(cell->type))
+        {
+        if(copy == NULL)
+			{
+			if(cell->type == CELL_STRING)
+            	return(appendString(cell, params->next, NULL, 0, FALSE, TRUE));
+			else if(cell->type == CELL_ARRAY)
+            	return(appendArray(cell, params->next));
+			return(errorProcExt(ERR_ARRAY_LIST_OR_STRING_EXPECTED, params));
+			}
+		
+        return(errorProcExt(ERR_LIST_EXPECTED, params));
+        }
+
+	if(list == NULL)
+        list = getCell(cell->type);
+
+    copy = copyList((CELL *)cell->contents);
+
+    params = params->next;
+    if(copy == nilCell) continue;
+
+    if(firstCell == NULL) list->contents = (UINT)copy;
+    else firstCell->next = copy;
+
+    firstCell = lastCellCopied;
+    }
+
+if(list == NULL)
+	return(getCell(CELL_EXPRESSION));
+
+return(list);
+}
+
+
+CELL * appendString(CELL * cell, CELL * list, char * joint, size_t jointLen, int trailJoint, int evalFlag)
+{ 
+CELL * result;
+STREAM stream;
+char * sPtr;
+size_t len;
+
+openStrStream(&stream, MAX_LINE, 0);
+writeStreamStr(&stream, (char *)cell->contents, cell->aux - 1);
+while(list != nilCell)
+	{
+	if(joint == NULL)
+		{
+		list = getStringSize(list, &sPtr, &len, evalFlag);		
+		writeStreamStr(&stream, sPtr, len);
+		}
+	else
+		{
+		list = getStringSize(list, &sPtr, &len, FALSE);
+		if(jointLen) writeStreamStr(&stream, joint, jointLen);
+		writeStreamStr(&stream, sPtr, len);
+		}
+	}
+
+if(trailJoint)
+	writeStreamStr(&stream, joint, jointLen);
+
+result = getCell(CELL_STRING);
+result->contents = (UINT)allocMemory(stream.position + 1);
+*((char *)result->contents + stream.position) = 0;
+result->aux = stream.position + 1;
+memcpy((void *)result->contents, stream.buffer, stream.position);
+
+closeStrStream(&stream);
+
+return(result);
+}
+
+
+CELL * p_chop(CELL * params)
+{
+size_t number = 1;
+size_t length = 0;
+CELL * next;
+#ifdef SUPPORT_UTF8
+char * ptr;
+#endif
+
+next = params->next;
+params = evaluateExpression(params);
+
+if(next != nilCell)
+	getInteger(next, (UINT *)&number);
+
+if(params->type == CELL_STRING)
+	{
+#ifndef SUPPORT_UTF8
+	length = params->aux - 1;
+	if(number > length) number = length;
+	length = length - number;
+	return stuffStringN((char *)params->contents, length);
+#else
+	length = utf8_wlen((char *)params->contents);
+	if(number > length) number = length;
+	length = length - number;
+	ptr = (char *)params->contents;
+	while(length--)
+		ptr += utf8_1st_len(ptr);
+	return stuffStringN((char *)params->contents, ptr - (char *)params->contents);
+#endif
+	}
+
+if(!isList(params->type))
+    return(errorProc(ERR_LIST_OR_STRING_EXPECTED));	
+
+length = listlen((CELL *)params->contents);
+if(number > length) number = length;
+
+return(sublist((CELL *)params->contents, 0, length - number));
+}
+
+CELL * setNthStr(CELL * cellStr, CELL * new, ssize_t index, int typeFlag);
+CELL * setNth(CELL * params, int typeFlag);
+
+CELL * p_nth(CELL * params) {return setNth(params, 0);} 
+CELL * p_nthSet(CELL * params) {return setNth(params, 1);}
+CELL * p_setNth(CELL * params) {return setNth(params, 2);}
+
+CELL * setNth(CELL * params, int typeFlag)
+{
+ssize_t index;
+CELL * list; 
+CELL * next;
+CELL * cell = NULL;
+
+/* new syntax, distinguished by type of first arg and number of args */
+next = params->next;
+if( (params->type == CELL_EXPRESSION) &&
+	( (!typeFlag && next == nilCell) || (typeFlag && next->next == nilCell) ))
+	{
+	params = getList(params, &list, typeFlag);
+
+NTH_EVAL_IMPLICIT:
+	if(isList(list->type))
+		{
+		if(!typeFlag)
+			return(copyCell(implicitIndexList(list, params)));
+		else if(typeFlag == 1)
+			return(updateCell(implicitIndexList(list, params), next));
+		else
+			{
+			deleteList(updateCell(implicitIndexList(list, params), next));
+			return(copyCell(list));
+			}
+		}
+
+	else if(list->type == CELL_ARRAY)
+		{
+		if(!typeFlag)
+			return(copyCell(implicitIndexArray(list, params)));
+		else if(typeFlag == 1)
+			return(updateCell(implicitIndexArray(list, params), next));
+		else
+			{
+			deleteList(updateCell(implicitIndexArray(list, params), next));
+			return(copyCell(list));
+			}
+		}
+	
+	else if(list->type == CELL_STRING)
+		{
+		getInteger(params, (UINT *)&index);
+		return(setNthStr(list, next, index, typeFlag));
+		}
+
+	return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, list));
+	}
+
+list = evaluateExpression(params);
+if(!isNumber(list->type))
+	return(errorProcExt(ERR_NUMBER_EXPECTED, params));
+
+while(isNumber(list->type))
+	{
+	if(cell == NULL)
+		{
+		cell = getCell(CELL_EXPRESSION);
+		cell->contents = (UINT)copyCell(list);
+		next = (CELL *)cell->contents;
+		}
+	else
+		{
+		next->next = copyCell(list);
+		next = next->next;
+		}
+
+	params = params->next;
+	if(typeFlag)
+		list = evalCheckProtected(params, NULL);
+	else
+		list = evaluateExpression(params);
+	}
+
+next = params->next;
+
+if(list->type == CELL_STRING)
+	{
+	getInteger((CELL *)cell->contents, (UINT *)&index);
+	deleteList(cell);
+	return(setNthStr(list, next, index, typeFlag));
+	}
+
+params = getCell(CELL_QUOTE);
+params->contents = (UINT)cell;
+
+pushResult(params);
+
+goto NTH_EVAL_IMPLICIT;
+}	
+
+
+#define INSERT_BEFORE 0
+#define INSERT_AFTER 1
+#define INSERT_END 2
+CELL * p_push(CELL * params)
+{
+CELL * newCell;
+CELL * list;
+CELL * cell = NULL;
+SYMBOL * sPtr;
+int insert = 0, evalFlag = 0;
+ssize_t index;
+
+newCell = evaluateExpression(params);
+params = params->next;
+
+if(isSymbol(params->type))
+	{
+	if(params->type == CELL_SYMBOL)
+		sPtr = (SYMBOL *)params->contents;
+	else
+		sPtr = getDynamicSymbol(params);
+
+	if(isProtected(sPtr->flags))
+		return(errorProcExt(ERR_SYMBOL_PROTECTED, params));
+
+	if(!isList(((CELL*)sPtr->contents)->type))
+		{
+		if(isNil((CELL *)sPtr->contents)) 
+			{
+			deleteList((CELL*)sPtr->contents);
+			list = getCell(CELL_EXPRESSION);
+			sPtr->contents = (UINT)list;		}
+			}
+		list = (CELL*)sPtr->contents;
+		}
+	else
+		list = evalCheckProtected(params, NULL);
+
+if(!isList(list->type))
+	{
+	if(list->type == CELL_STRING)
+		return(pushOnString(newCell, list, params->next));
+	else
+		return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, params));
+	}
+
+if(params->next == nilCell) 
+	{
+	params = params->next;
+	index = 0;
+	}
+else 
+	{
+	cell = ((CELL*)params->next)->next;
+	params = evaluateExpression(params->next);
+	if(isList(params->type))
+		{
+		evalFlag = FALSE;
+		params = getIntegerExt((CELL*)params->contents, (UINT*)&index, FALSE);
+		}
+	else 
+		{
+		evalFlag = TRUE;
+		getIntegerExt(params, (UINT*)&index, FALSE);
+		params = cell;
+		}
+	}
+
+if(index == -1) 
+	{
+	if(params == nilCell)
+		{
+		newCell = copyCell(newCell);
+		cell = (CELL*)list->aux;	
+		list->aux = (UINT)newCell;
+		if(cell != nilCell && cell != trueCell)
+			{
+			cell->next = newCell;
+			return(copyCell(newCell));
+			}
+
+		if(list->contents == (UINT)nilCell)
+			{
+			list->contents = (UINT)newCell;
+			return(copyCell(newCell));
+			}
+
+		list = (CELL *)list->contents;
+		while(list->next != nilCell)
+			list = list->next;
+		list->next = newCell;
+		return(copyCell(newCell));
+		}
+
+	/* index = MAX_LONG; */
+	}
+	
+list->aux = (UINT)nilCell; /* undo last element optimization */
+
+while(isList(list->type))
+	{
+	cell = list;
+	list = (CELL *)list->contents;
+
+	if(index < 0) 
+		{
+		index = listlen(list) + index;
+		if(index == -1) index = 0;
+		if(index == 0) insert = INSERT_BEFORE;
+		else if(index > 0) insert = INSERT_AFTER;
+		else errorProc(ERR_LIST_INDEX_OUTOF_BOUNDS);
+		}
+	else insert = INSERT_BEFORE;
+
+	while(index--) 
+		{
+		if(list == nilCell)
+			{
+			if(index >= 0) errorProc(ERR_LIST_INDEX_OUTOF_BOUNDS);
+			insert = INSERT_END;
+			break;
+			}
+		cell = list;
+		list = list->next;
+		}
+
+	if(params == nilCell || !isList(list->type))  break;
+	params = getIntegerExt(params, (UINT*)&index, evalFlag);
+	}
+
+newCell = copyCell(newCell);
+if(insert == INSERT_BEFORE || list == nilCell)
+	{
+	if(list == (CELL*)cell->contents)
+		{
+		cell->contents = (UINT)newCell;
+		newCell->next = list;
+		}
+	else
+		{
+		cell->next = newCell;
+		newCell->next = list;
+		}
+	}
+
+else if(insert == INSERT_AFTER || insert == INSERT_END)
+    {
+    cell = list->next;
+    list->next = newCell;
+    newCell->next = cell;
+    }
+
+return(copyCell(newCell));
+}
+
+
+CELL * p_pop(CELL * params)
+{
+CELL * list;
+CELL * cell = NULL;
+ssize_t index;
+int evalFlag = FALSE;
+
+list = evalCheckProtected(params, NULL);
+
+if(!isList(list->type))
+	{
+	if(list->type == CELL_STRING)
+		return(popString(list, params->next));
+	else
+		return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, params));
+	}
+
+/* leave last element optimization if popping first for queues */
+if(params->next == nilCell)
+	{
+	cell = (CELL *)list->contents;
+	list->contents = (UINT)cell->next;
+	if(cell->next == nilCell) /* check if only one element in list */
+		list->aux = (UINT)nilCell; /* undo last element optimization */
+	cell->next = nilCell;
+	return(cell);
+	}
+else
+	{
+	list->aux = (UINT)nilCell; /* undo last element optimization */
+	cell = ((CELL*)params->next)->next;
+	params = evaluateExpression(params->next);
+	if(isList(params->type))
+		{
+		evalFlag = FALSE;
+		params = getIntegerExt((CELL*)params->contents, (UINT*)&index, FALSE);
+		}
+	else 
+		{
+		evalFlag = TRUE;
+		getIntegerExt(params, (UINT*)&index, FALSE);
+		params = cell;
+		}
+	}
+
+while(isList(list->type))
+    {
+    cell = list;
+    list = (CELL *)list->contents;
+
+   	if(index < 0) index = convertNegativeOffset(index, list);
+
+   	while(index--) 
+       	{
+		cell = list;
+       	list = list->next;
+       	}
+	if(list == nilCell) 
+		errorProc(ERR_LIST_INDEX_OUTOF_BOUNDS);
+
+    if(params == nilCell || !isList(list->type))  break;
+    params = getIntegerExt(params, (UINT*)&index, evalFlag);
+    }
+
+if(list == (CELL*)cell->contents)
+    cell->contents = (UINT)list->next;
+else
+    cell->next = list->next;
+
+list->next = nilCell;
+return(list);
+}
+
+
+CELL * setNthStr(CELL * cellStr, CELL * new, ssize_t index, int typeFlag)
+{
+char * newStr;
+char * oldStr;
+size_t newLen, oldLen, len;
+char * str;
+
+oldStr = (char*)cellStr->contents;
+oldLen = cellStr->aux - 1;
+
+if(oldLen == 0) return(copyCell(cellStr));
+
+#ifndef SUPPORT_UTF8
+
+index = adjustNegativeIndex(index, oldLen);
+
+if(!typeFlag)
+	return(stuffStringN(oldStr + index, 1));
+
+deleteList((CELL*)sysSymbol[0]->contents);
+sysSymbol[0]->contents = (UINT)stuffStringN(oldStr + index, 1);
+len = 1;
+
+#else
+
+index = adjustNegativeIndex(index, utf8_wlen((char *)cellStr->contents));
+str = oldStr;
+
+while(index--) 
+	{
+	len = utf8_1st_len(str);
+	str += len;
+	}
+len = utf8_1st_len(str);
+
+if(!typeFlag)
+	return(stuffStringN(str, len));
+
+deleteList((CELL*)sysSymbol[0]->contents);
+sysSymbol[0]->contents = (UINT)stuffStringN(str, len);
+index = str - oldStr;
+
+#endif
+
+getStringSize(new, &newStr, &newLen, TRUE);
+/* get back oldStr in case it changed during eval of replacement */
+oldStr = (char *)cellStr->contents;
+oldLen = cellStr->aux - 1;
+if(oldLen == 0) return(copyCell(cellStr));
+index = adjustNegativeIndex(index, oldLen);
+
+str = allocMemory(oldLen + newLen - len + 1);
+*(str + oldLen + newLen - len) = 0;
+
+memcpy(str, oldStr, index);
+memcpy(str + index, newStr, newLen);
+memcpy(str + index + newLen, oldStr + index + len, oldLen - index - len);
+
+cellStr->contents = (UINT)str;
+cellStr->aux = oldLen + newLen - len + 1;
+
+if(typeFlag != 2) 
+	{
+	new = stuffStringN(oldStr + index, len);
+	freeMemory(oldStr);
+	return(new);
+	}
+
+freeMemory(oldStr);
+return(copyCell(cellStr));
+}
+
+
+CELL * popString(CELL * str, CELL * params)
+{
+char * ptr;
+char * newPtr;
+ssize_t index = 0;
+ssize_t len = 1;
+CELL * result;
+
+if(str->aux < 2)
+	return(stuffString(""));
+
+if(params != nilCell)
+	{
+	params = getInteger(params, (UINT*)&index);
+	if(params != nilCell) 
+		{
+		getInteger(params, (UINT*)&len);
+		if(len < 1) len = 0;
+		}
+	}
+
+ptr = (char *)str->contents;
+
+#ifndef SUPPORT_UTF8
+index = adjustNegativeIndex(index, str->aux - 1);
+#else
+index = adjustNegativeIndex(index, utf8_wlen(ptr));
+#endif
+
+if((index + len) > (str->aux - 2))
+	len = str->aux - 1 - index;
+
+newPtr = callocMemory(str->aux - len);
+
+memcpy(newPtr, ptr, index);
+memcpy(newPtr + index, ptr + index + len, str->aux - len - index);
+str->aux = str->aux - len;
+str->contents = (UINT)newPtr;
+result = stuffStringN(ptr + index, len);
+free(ptr);
+return(result);
+}
+
+
+CELL * pushOnString(CELL * newStr, CELL * str, CELL * idx)
+{
+ssize_t index = 0;
+char * ptr;
+char * newPtr;
+int minusFlag;
+int len;
+#ifdef SUPPORT_UTF8
+char * sptr;
+int wChar;
+#endif
+
+if(idx != nilCell) getInteger(idx, (UINT*)&index);
+ptr = (char *)str->contents;
+
+if(newStr->type != CELL_STRING)
+	return(errorProcExt(ERR_STRING_EXPECTED, newStr));
+
+if(index == -1)
+	{
+	appendCellString(str, (char *)newStr->contents, newStr->aux - 1);
+	return(copyCell(newStr));
+	}
+
+minusFlag = (index < 0);
+
+#ifndef SUPPORT_UTF8
+len = str->aux - 1;
+#else
+len = utf8_wlen(ptr);
+#endif
+
+/* convert index into characters to skip before the new one is inserted */
+if(index < 0) index = len + index + 1;
+else if(index > len) index = len;
+if(index < 0) index = 0;
+
+newPtr = callocMemory(str->aux + newStr->aux - 1);
+#ifndef SUPPORT_UTF8
+memcpy(newPtr, ptr, index);
+memcpy(newPtr + index, (char*)newStr->contents, newStr->aux - 1);
+memcpy(newPtr + index + newStr->aux - 1, ptr + index, str->aux - index);
+#else
+sptr = ptr;
+while(index--) /* skip characters to split point) */
+	sptr = utf8_wchar(sptr, &wChar);
+memcpy(newPtr, ptr, sptr - ptr);
+memcpy(newPtr + (sptr - ptr), (char*)newStr->contents, newStr->aux - 1);
+memcpy(newPtr + (sptr - ptr) + newStr->aux - 1, sptr, str->aux - (sptr - ptr)  );
+#endif
+
+str->contents = (UINT)newPtr;
+str->aux = str->aux + newStr->aux - 1;
+*(newPtr + str->aux - 1) = 0;
+free(ptr);
+
+return(copyCell(newStr));
+}
+
+
+CELL * p_select(CELL * params)
+{
+size_t n = 0, idx  = 0; 
+ssize_t index;
+CELL * list, * cell;
+CELL * result = NULL;
+CELL * head;
+int evalFlag = TRUE;
+char * str, * newStr;
+#ifdef SUPPORT_UTF8
+int * wstr;
+int * wnewStr;
+size_t len;
+#endif
+
+head = evaluateExpression(params);
+params = params->next;
+cell = evaluateExpression(params);
+if(isList(cell->type))
+	{
+	evalFlag = FALSE;
+	cell = params = (CELL *)cell->contents;
+	}
+
+if(head->type == CELL_STRING)
+	{
+	if((n = listlen(params)) == 0) return(stuffString(""));
+	
+	str = (char *)head->contents;
+#ifndef SUPPORT_UTF8
+	newStr = (char *)allocMemory(n + 1);
+	idx = 0;
+	while(params->type != CELL_NIL)
+		{
+		if(idx == 0)
+			{
+			getIntegerExt(cell, (UINT *)&index, FALSE);
+			params = params->next;
+			}
+		else
+			params = getIntegerExt(params, (UINT *)&index, evalFlag);
+		index = adjustNegativeIndex(index, head->aux -1);
+		*(newStr + idx++) = *(str + index);
+		}
+	*(newStr + n) = 0;
+#else
+	wstr = allocMemory(head->aux * sizeof(int));
+	len = utf8_wstr(wstr, str, head->aux - 1);
+	wnewStr = allocMemory((n + 1) * sizeof(int));
+	idx = 0;
+	while(params->type != CELL_NIL)
+		{
+		if(idx == 0)
+			{
+			getIntegerExt(cell, (UINT *)&index, FALSE);
+			params = params->next;
+			}
+		else
+			params = getIntegerExt(params, (UINT *)&index, evalFlag);
+		index = adjustNegativeIndex(index, len);
+		*(wnewStr + idx++) = *(wstr + index);
+		}
+	*(wnewStr + n) = 0;
+	newStr = allocMemory(UTF8_MAX_BYTES * n + 1);
+	n = wstr_utf8(newStr, wnewStr, UTF8_MAX_BYTES * n);
+	newStr = reallocMemory(newStr, n + 1);
+#endif
+	result = getCell(CELL_STRING);
+	result->aux = n + 1;
+	result->contents = (UINT)newStr;	
+	return(result);
+	}
+
+if(!isList(head->type))
+	return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, head));
+head = (CELL *)head->contents;
+list = head;
+n = 0;
+while(params->type != CELL_NIL)
+	{
+	if(n++ == 0)
+		{
+		getIntegerExt(cell, (UINT *)&index, FALSE);
+		params = params->next;
+		}
+	else
+		params = getIntegerExt(params, (UINT *)&index, evalFlag);
+	if(index < 0) index = convertNegativeOffset(index, head);
+	if(index < idx) list = head, idx = 0;
+	while(idx < index  && list->next != nilCell) list = list->next, idx++; 
+	if(result == NULL)
+		{
+		result = getCell(CELL_EXPRESSION);
+		cell = copyCell(list);
+		result->contents = (UINT)cell;
+		}
+	else
+		{
+		cell->next = copyCell(list);
+		cell = cell->next;
+		}
+	}
+
+return((result == NULL) ? getCell(CELL_EXPRESSION) : result);
+}	
+
+
+CELL * p_slice(CELL * params)
+{
+CELL * cell;
+ssize_t offset;
+ssize_t length;
+
+cell = evaluateExpression(params);
+params = getInteger(params->next, (UINT *)&offset);
+if(params != nilCell)
+	getInteger(params, (UINT *)&length);
+else
+	length = MAX_LONG;
+
+if(isList(cell->type))
+	return(sublist((CELL *)cell->contents, offset, length));
+else if(cell->type == CELL_STRING)
+	return(substring((char *)cell->contents, cell->aux - 1, offset, length));
+else if(cell->type == CELL_ARRAY)
+	return(subarray(cell, offset, length));
+
+return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, params));
+}
+
+
+CELL * sublist(CELL * list, ssize_t offset, ssize_t length)
+{
+CELL * subList;
+CELL * cell;
+
+if(offset < 0) 
+	offset = convertNegativeOffset(offset, list);
+
+if(length < 0)
+	{
+	length = listlen(list) - offset + length;
+	if(length < 0) length = 0;
+	}
+
+subList = getCell(CELL_EXPRESSION);
+if(length == 0) return(subList);
+
+while(offset-- && list != nilCell)
+	list = list->next;
+
+if(list == nilCell) return(subList);
+
+cell = copyCell(list);
+subList->contents = (UINT)cell;
+--length;
+while(length--) 
+	{
+	list = list->next;
+	if(list == nilCell) break;
+	cell->next = copyCell(list);
+	cell = cell->next;
+	}
+
+return(subList);
+}
+
+
+CELL * p_reverse(CELL * params)
+{
+CELL * cell;
+CELL * previous;
+CELL * next;
+char * str;
+size_t len, tmp;
+char * left;
+char * right;
+
+cell = params;
+params = evalCheckProtected(params, NULL);
+
+
+if(isList(params->type))
+	{
+	params->aux = (UINT)nilCell; /* undo last element optimization */
+
+	previous = cell = (CELL*)params->contents;
+	next = cell->next;
+	cell->next = nilCell;
+	while(cell!= nilCell)
+		{
+		previous = cell;
+		cell = next;
+		next = cell->next;
+		if(cell != nilCell) cell->next = previous;
+		}
+	params->contents = (UINT)previous;
+	}
+
+else if(params->type == CELL_STRING)
+	{
+	str = (char *)params->contents;
+	len = params->aux - 1;
+	left = str;
+	right = left + len - 1;
+	while(left < right)
+		{
+		tmp = *left;
+		*left = *right;
+		*right = tmp;
+		left++;
+		right--;
+		}
+	}
+else return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, cell));
+
+return(copyCell(params));
+}
+
+
+CELL * p_join(CELL * params)
+{
+char * joint = NULL;
+CELL * list;
+size_t jointLen = 0;
+int trailJoint = 0;
+
+params = getListHead(params, &list);
+if(list == nilCell)
+	return(stuffString(""));
+
+if(list->type != CELL_STRING)
+	return(errorProcExt(ERR_STRING_EXPECTED, list));
+
+if(params != nilCell)
+	{
+	params = getStringSize(params, &joint, &jointLen, TRUE);
+	trailJoint = getFlag(params);
+	}
+
+return(appendString(list, list->next, joint, jointLen, trailJoint, FALSE));
+}
+
+
+CELL * p_find(CELL * params) 
+{
+char * key;
+char * second;
+ssize_t found;
+CELL * next;
+CELL * keyCell;
+CELL * funcCell;
+size_t size;
+long options;
+
+keyCell = evaluateExpression(params);
+params = params->next;
+next = evaluateExpression(params);
+
+if(keyCell->type == CELL_STRING && next->type == CELL_STRING)
+	{
+	key = (char *)keyCell->contents;
+	second = (char *)next->contents;
+	size = next->aux - 1;
+
+	if(params->next != nilCell)
+            {
+            params = getInteger(params->next, (UINT*)&options);
+            found = searchBufferRegex(second, 0, key, (int)size, options, NULL);
+            if(found == -1) return(nilCell);
+            }
+        else
+            {
+            found = searchBuffer(second, size, key, keyCell->aux - 1, TRUE);
+            if(found == -1) return(nilCell);
+            }
+	}
+else
+	{
+    /* list mode with optional functor */
+
+	if(!isList(next->type)) return(nilCell);
+	next = (CELL *)next->contents;
+	found = 0;
+
+	if(params->next != nilCell)
+		funcCell = evaluateExpression(params->next);
+	else funcCell = NULL;
+
+   	/* do regex when first arg is string and option# is present */
+   	if(funcCell && isNumber(funcCell->type) && keyCell->type == CELL_STRING)
+       	{
+       	getIntegerExt(funcCell, (UINT*)&options, FALSE);
+       	key = (char *)keyCell->contents;
+       	while(next != nilCell)
+           	{
+           	if(next->type == CELL_STRING)
+               	{
+               	second = (char *)next->contents;
+               	if(searchBufferRegex(second, 0, key, next->aux - 1 , options, NULL) != -1)
+                   	break;
+               	}
+           	found++;
+           	next = next->next;
+           	}
+       	if(next == nilCell) return(nilCell);
+		else return(stuffInteger(found));
+       	}
+
+    while(next != nilCell)
+		{
+		if(compareFunc(keyCell, next, funcCell) == 0)
+			{
+			if(funcCell)
+				{
+				deleteList((CELL*)sysSymbol[0]->contents);
+				sysSymbol[0]->contents = (UINT)copyCell(next);
+				}
+			break;
+			}
+		found++;
+		next = next->next;
+		}
+	if(next == nilCell) return(nilCell);
+	}
+
+return(stuffInteger(found));
+}
+
+/* ------- find-all ---- finds all strings matching a pattern in a list ----- */
+
+CELL * findAllString(char * pattern, char * str, size_t size, CELL * params)
+{
+long options = 0;
+ssize_t findPos = -1;
+int len;
+int offset = 0;
+CELL * result = nilCell;
+CELL * cell = NULL;
+CELL * exprCell;
+CELL * exprRes;
+int errNo;
+
+exprCell = params;
+params = params->next;
+if(params != nilCell)
+	getInteger(params, (UINT *)&options);
+	
+while( (findPos = searchBufferRegex(str, offset, pattern, (int)size, options, &len)) != -1)
+	{
+	if(exprCell != nilCell)
+		{
+		if((exprRes = evaluateExpressionSafe(exprCell, &errNo)) == NULL)
+        	{
+			pushResult(result); /* push for later deletion */
+       		longjmp(errorJump, errNo);
+       		}
+		exprRes = copyCell(exprRes);
+		}
+	else
+		exprRes = stuffStringN(str + findPos, len);
+
+	if(findPos == offset && len == 0) break;
+		
+	if(result == nilCell)
+		{
+		result = getCell(CELL_EXPRESSION);
+		cell = exprRes;
+		result->contents = (UINT)cell;
+		}
+	else
+		{
+		cell->next = exprRes;
+		cell = cell->next;
+		}
+
+	offset = (findPos + len);
+	}
+
+if(result == nilCell)
+	return(getCell(CELL_EXPRESSION));
+
+return(result);
+}
+
+
+CELL * findAllList(CELL * pattern, CELL * list, CELL * exprCell)
+{
+CELL * result = nilCell;
+CELL * cell = NULL;
+CELL * exprRes;
+CELL * match;
+CELL * funcCell;
+int errNo;
+int resultIdxSave;
+
+funcCell = evaluateExpression(exprCell->next);
+resultIdxSave = resultStackIdx;
+
+if(funcCell == nilCell && !isList(pattern->type))
+	return(errorProcExt(ERR_LIST_EXPECTED, pattern));
+	
+while(list != nilCell)
+	{
+	if(funcCell == nilCell)
+		{
+		/* match only takes lists*/
+		if(!isList(list->type))
+			goto CONTINUE_NEXT;
+
+		match = patternMatchL((CELL *)pattern->contents, (CELL *)list->contents, TRUE);
+
+		if(match == NULL || match == nilCell)
+			goto CONTINUE_NEXT;
+
+		deleteList(match);
+		}
+	else
+		{
+		cleanupResults(resultIdxSave);
+		if(compareFunc(pattern, list, funcCell) != 0)
+			goto CONTINUE_NEXT;
+		}
+
+	deleteList((CELL*)sysSymbol[0]->contents);
+	sysSymbol[0]->contents = (UINT)copyCell(list);
+
+	if(exprCell != nilCell)
+		{
+		if((exprRes = evaluateExpressionSafe(exprCell, &errNo)) == NULL)
+       		{
+			pushResult(result); /* push for later deletion */
+   			longjmp(errorJump, errNo);
+   			}
+		}
+	else 
+		exprRes = list;
+
+	exprRes = copyCell(exprRes);
+
+
+	if(result == nilCell)
+		{
+		result = getCell(CELL_EXPRESSION);
+		cell = exprRes;
+		result->contents = (UINT)cell;
+		}
+	else
+		{
+		cell->next = exprRes;
+		cell = cell->next;
+		}
+	
+	CONTINUE_NEXT:	
+	list = list->next;
+	}
+
+if(result == nilCell)
+	return(getCell(CELL_EXPRESSION));
+
+return(result);
+}
+
+
+CELL * p_findAll(CELL * params)
+{
+CELL * key;
+CELL * space;
+
+key = evaluateExpression(params);
+params = params->next;
+space = evaluateExpression(params);
+
+if(key->type == CELL_STRING && space->type == CELL_STRING)
+	return(findAllString((char *)key->contents, 
+			(char *)space->contents,  (size_t) space->aux - 1, params->next));
+
+if(!isList(space->type))
+	return(errorProcExt(ERR_LIST_EXPECTED, space));
+
+return(findAllList(key, (CELL *)space->contents, params->next));
+}
+
+
+void swap(UINT * left, UINT * right)
+{
+UINT tmp;
+
+tmp = *left;
+*left = *right;
+*right = tmp;
+}
+
+SYMBOL * getSymbolCheckProtected(CELL * params)
+{
+SYMBOL * sPtr = NULL;
+
+if(params->type == CELL_DYN_SYMBOL)
+	sPtr = getDynamicSymbol(params);
+else if(params->type == CELL_SYMBOL)
+	sPtr = (SYMBOL *)params->contents;
+else fatalError(ERR_SYMBOL_EXPECTED, params, FALSE);
+
+if(isProtected(sPtr->flags))
+	fatalError(ERR_SYMBOL_PROTECTED, params, FALSE);
+
+return sPtr;
+}
+
+CELL * p_swap(CELL * params)
+{
+size_t first, second, num;
+char * str;
+CELL * envelope;
+CELL * list;
+CELL * firstCell;
+CELL * secondCell;
+SYMBOL * lsym;
+SYMBOL * rsym;
+
+if(((CELL *)params->next)->next == nilCell)
+	{
+	lsym = getSymbolCheckProtected(params);
+	rsym = getSymbolCheckProtected(params->next);
+	swap(&lsym->contents, &rsym->contents);
+	return(copyCell((CELL*)rsym->contents));
+	}
+
+params = getInteger(params, (UINT*)&first);
+params = getInteger(params, (UINT*)&second);
+
+envelope = evalCheckProtected(params, NULL);
+
+if(envelope->type == CELL_STRING)
+	{
+	first = adjustNegativeIndex(first, envelope->aux - 1);
+	second = adjustNegativeIndex(second, envelope->aux - 1);
+	str = (char *)envelope->contents;
+	num = str[first];
+	str[first] = str[second];
+	str[second] = num;
+	return(copyCell(envelope));
+	}
+
+if(!isList(envelope->type))
+	return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, params));
+
+envelope->aux = (UINT)nilCell; /* undo last element optimization */
+
+list = (CELL *)envelope->contents;
+
+if(first < 0) first = convertNegativeOffset(first, list);
+if(second < 0) second = convertNegativeOffset(second, list);
+
+if(first > second) swap((UINT*)&first, (UINT*)&second);
+second = second - first;
+	
+firstCell = list;
+while(first--)
+	{
+	if(firstCell->next == nilCell) break;
+	firstCell = firstCell->next;
+	}	
+secondCell = firstCell;
+
+while(second--)
+	{
+	if(secondCell->next == nilCell) break;
+	secondCell = secondCell->next;
+	}
+
+swap(&firstCell->type, &secondCell->type);
+swap(&firstCell->contents, &secondCell->contents);
+swap(&firstCell->aux, &secondCell->aux);
+
+return(copyCell(envelope));
+}
+
+
+CELL * p_dup(CELL * params)
+{
+CELL * list;
+CELL * expr;
+char * str;
+ssize_t n, len;
+
+expr = evaluateExpression(params);
+params = params->next;
+if(params != nilCell)
+	getInteger(params, (UINT *)&n);
+else n = 2;
+
+if(n < 0) n = 0;
+
+if(expr->type == CELL_STRING && !getFlag(params->next) )
+	{
+	len = expr->aux - 1;
+	list = getCell(CELL_STRING);
+	str = allocMemory(len * n + 1);
+	list->contents = (UINT)str;
+	list->aux = (len * n + 1);
+	*(str + len * n) = 0;
+	while(n--) 
+		{
+		memcpy(str, (char *)expr->contents, len);
+		str += len;
+		}
+	return(list);
+	}
+
+list = getCell(CELL_EXPRESSION);
+if(n-- > 0) 
+	{
+	list->contents = (UINT)copyCell(expr);
+
+	params = (CELL *)list->contents;
+	while(n--)
+		{
+		params->next = copyCell(expr);
+		params = params->next;
+		}
+	}
+
+return(list);
+}
+
+
+#define STARTS_WITH 0
+#define ENDS_WITH 1
+
+CELL * startsEndsWith(CELL * params, int type)
+{
+char * string;
+char * key;
+char * keydollar;
+long options = -1;
+size_t slen, pos;
+int klen;
+CELL * cell, * list;
+
+cell = params->next;
+list = evaluateExpression(params);
+if(list->type == CELL_STRING)
+    {
+    string = (char *)list->contents;
+    getString(cell, &key);
+    }
+else
+    {
+    if(!isList(list->type))
+        errorProcExt(ERR_LIST_OR_STRING_EXPECTED, params);
+    cell = evaluateExpression(cell);
+    list = (CELL *)list->contents;
+   
+    if(type == ENDS_WITH)
+        while(list->next != nilCell) list = list->next;
+
+    if(compareCells(list, cell) == 0) return(trueCell);
+    else return(nilCell);
+    }
+
+if(cell->next != nilCell)
+	{
+	if(evaluateExpression(cell->next)->type == CELL_NIL)
+		options = 1;
+	else 
+		getIntegerExt(cell->next, (UINT*)&options, FALSE);
+	}
+
+klen = strlen(key);
+slen = strlen(string);
+
+if(type == STARTS_WITH)
+	{
+	if(options == -1) 
+		{
+		if(strncmp(string, key, (size_t)klen) == 0)
+			return(trueCell);
+		}
+	else  
+		{
+        if(searchBufferRegex(string, 0, key, slen, options, 0) == 0)
+			return(trueCell);
+		}
+	return(nilCell);
+	}
+
+
+if((options == -1) && (klen > slen)) return(nilCell);
+
+if(options == -1) 
+	{
+	if(strncmp(string + slen - klen, key, klen) == 0)
+		return(trueCell);
+	}
+else
+	{
+	/* append $ to the pattern for anchoring at the end */
+	keydollar = malloc(klen + 4);
+	*keydollar = '(';
+	memcpy(keydollar + 1, key, klen);
+	memcpy(keydollar + 1 + klen, ")$", 2);
+	*(keydollar + klen + 3) = 0;
+	klen = klen + 3;
+    if((pos = searchBufferRegex(string, 0, keydollar, slen, options, &klen)) != -1)	
+		{
+		free(keydollar);
+		if(pos + klen == slen)
+			return(trueCell);
+		}
+	free(keydollar);
+	}
+
+return(nilCell);
+}
+
+CELL * p_startsWith(CELL * params) { return startsEndsWith(params, STARTS_WITH); }
+CELL * p_endsWith(CELL * params) { return startsEndsWith(params, ENDS_WITH); }
+
+CELL * p_replace(CELL * params)
+{
+CELL * keyCell;
+CELL * repCell;
+CELL * funcCell = NULL;
+CELL * list;
+CELL * cell;
+CELL * newList;
+char * keyStr;
+char * buff;
+char * newBuff;
+UINT cnt; 
+size_t newLen;
+long options;
+int resultIdxSave;
+
+keyCell = evaluateExpression(params);
+params = params->next;
+
+newList = cell = evalCheckProtected(params, NULL);
+
+
+cnt = 0;
+resultIdxSave = resultStackIdx;
+if(isList(cell->type))
+	{
+	cell->aux = (UINT)nilCell; /* undo last element optimization */
+
+	list = (CELL *)cell->contents;
+
+	if(params->next != nilCell)
+		{
+		params = params->next;
+		repCell = params;
+		if(params->next != nilCell)
+			funcCell = evaluateExpression(params->next);
+		}
+	else
+		repCell = NULL;
+COMPARE_START:
+	if(compareFunc(keyCell, list, funcCell) == 0)
+		{
+		if(repCell != NULL)
+			{
+			deleteList((CELL*)sysSymbol[0]->contents);
+			sysSymbol[0]->contents = (UINT)copyCell(list);
+			cell->contents = (UINT)copyCell(evaluateExpression(repCell));
+			cell = (CELL*)cell->contents;
+			cell->next = list->next;
+			}
+		else /* remove mode */
+			cell->contents = (UINT)list->next;
+
+		list->next = nilCell;
+		deleteList(list);
+		cnt++;
+
+		if(repCell != NULL)
+			list = cell;
+		else /* remove mode */
+			{
+			list = (CELL*)cell->contents;
+			goto COMPARE_START;
+			}		
+		}
+	
+	while(list->next != nilCell)
+		{
+		if(compareFunc(keyCell, list->next, funcCell) == 0)
+			{
+			cell = list->next;	/* cell = old elmnt */
+			if(repCell != NULL)
+				{
+				deleteList((CELL*)sysSymbol[0]->contents);
+				sysSymbol[0]->contents = (UINT)copyCell(cell);
+				list->next = copyCell(evaluateExpression(repCell));
+				list = list->next;
+				}
+			list->next = cell->next;
+			cell->next = nilCell;
+			deleteList(cell);
+			cnt++;
+			}		
+		else	
+			list = list->next;
+		cleanupResults(resultIdxSave);
+		}
+
+	deleteList((CELL*)sysSymbol[0]->contents);	
+	sysSymbol[0]->contents = (UINT)stuffInteger(cnt);
+	return(copyCell(newList));
+	}
+
+if(cell->type == CELL_STRING)
+	{
+	if(keyCell->type != CELL_STRING)
+		return(errorProc(ERR_STRING_EXPECTED));
+	keyStr = (char *)keyCell->contents;
+	buff = (char *)cell->contents;
+	repCell = params->next;
+
+	if(repCell == nilCell)
+		return(errorProc(ERR_MISSING_ARGUMENT));
+			
+	options = -1;
+	if(repCell->next != nilCell)
+            getInteger(repCell->next, (UINT*)&options);
+
+	newBuff = replaceString(keyStr, keyCell->aux - 1, 
+	                       buff, (size_t)cell->aux -1, repCell, &cnt, options, &newLen);
+	if(newBuff != NULL)
+	    {
+	    freeMemory(buff);
+	    cell->contents = (UINT)newBuff;
+	    cell->aux = newLen + 1;
+	    }
+
+	deleteList((CELL*)sysSymbol[0]->contents);	
+	sysSymbol[0]->contents = (UINT)stuffInteger(cnt);
+	return(copyCell(cell));
+	}
+
+return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, params));
+}
+
+
+
+CELL * p_rotate(CELL * params)
+{
+CELL * cell;
+CELL * previous;
+CELL * last = NULL;
+size_t length, index;
+size_t count;
+
+cell = params;
+
+if(cell->next != nilCell) getInteger(cell->next, (UINT *)&count);
+else count = 1;
+
+params = evalCheckProtected(params, NULL);
+
+if(params->type == CELL_STRING)
+	{	
+	cell = copyCell(params);	
+	length = params->aux - 1;
+	if((count = adjustCount(count, length)) == 0) return(cell);
+	memcpy((char*)cell->contents, (char *)(params->contents + length - count), count);
+	memcpy((char*)(cell->contents + count), (char *)params->contents, length - count);
+	memcpy((char*)params->contents, (char*)cell->contents, length);
+	return(cell);
+	}	
+
+if(!isList(params->type))
+	return(errorProcExt(ERR_LIST_EXPECTED, cell));
+
+params->aux = (UINT)nilCell; /* undo last element optimization */
+
+cell = (CELL *)params->contents;
+length = 0;
+while(cell != nilCell)
+	{
+	++length;
+	last = cell;
+	cell = cell->next;
+	}
+
+if((count = adjustCount(count, length))== 0) 
+	return(copyCell(params));
+index = length - count;
+
+previous = cell = (CELL *)params->contents;
+while(index--) 
+	{
+	previous = cell;
+	cell = cell->next;
+	}
+
+previous->next = nilCell;
+last->next = (CELL *)params->contents;
+params->contents = (UINT)cell;
+
+return(copyCell(params));
+}
+
+/* eof */
diff --git a/nl-math.c b/nl-math.c
new file mode 100644
index 0000000..6c1d273
--- /dev/null
+++ b/nl-math.c
@@ -0,0 +1,2921 @@
+/* nl-math.c
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+#include "newlisp.h"
+#include "protos.h"
+
+#ifdef WINCE
+#define _exception exception
+#endif
+
+#define OP_ADD 1
+#define OP_SUBTRACT 2
+#define OP_MULTIPLY 3
+#define OP_DIVIDE 4
+#define OP_BIT_OR 5
+#define OP_BIT_AND 6
+#define OP_BIT_XOR 7
+#define OP_SHIFTL 8
+#define OP_SHIFTR 9
+#define OP_POW 10
+#define OP_MODULO 11
+#define OP_SIN 12
+#define OP_COS 13
+#define OP_TAN 14
+#define OP_ASIN 15
+#define OP_ACOS 16
+#define OP_ATAN 17
+#define OP_SINH 18
+#define OP_COSH 19
+#define OP_TANH 20
+#define OP_ASINH 21
+#define OP_ACOSH 22
+#define OP_ATANH 23
+#define OP_SQRT 24
+#define OP_LOG 25
+#define OP_EXP 26
+#define OP_MIN 27
+#define OP_MAX 28
+#define OP_ABS 29
+#define OP_CEIL 30
+#define OP_FLOOR 31
+#define OP_NAN 32
+#define OP_ERRORFUNC 33
+#define OP_SIGNUM 34
+#define OP_ISNAN 35
+
+#ifdef WIN_32
+int _matherr(struct _exception *e) {return 1;}
+#endif
+
+CELL * incDec(CELL * params, int type)
+{
+SYMBOL * sPtr;
+INT64 lValue;
+double fValue;
+double adjust;
+CELL * cell;
+
+if(params->next != nilCell)
+	{
+	getFloat(params->next, &adjust);
+	adjust = adjust * type;
+	type = 0;
+	}
+
+cell = evaluateExpression(params);
+if(cell->type != CELL_SYMBOL)
+	{
+	if(cell->type == CELL_DYN_SYMBOL)
+		sPtr = getDynamicSymbol(cell);
+	else
+		return(errorProcExt(ERR_SYMBOL_EXPECTED, params));
+	}
+else
+	sPtr = (SYMBOL *)cell->contents;
+
+if(isProtected(sPtr->flags))
+	return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(sPtr)));
+
+
+if(type == 0)
+	{
+	getFloat(cell, &fValue);
+	deleteList((CELL *)sPtr->contents);
+	fValue = fValue + adjust;
+	cell = getCell(CELL_FLOAT);
+#ifndef NEWLISP64
+	*(double *)&cell->aux = fValue;
+#else
+	*(double *)&cell->contents = fValue;
+#endif
+	sPtr->contents = (UINT)cell;
+	}
+else
+	{
+	getInteger64(cell, &lValue);
+	deleteList((CELL *)sPtr->contents);
+	sPtr->contents = (UINT)stuffInteger64(lValue + type);
+	}
+
+pushResultFlag = FALSE;
+return((CELL *)sPtr->contents);
+}
+
+
+CELL * p_increment(CELL * params) { return(incDec(params, 1)); }
+CELL * p_decrement(CELL * params) { return(incDec(params, -1)); }
+
+
+CELL * arithmetikOp(CELL * params, int op)
+{
+INT64 number;
+INT64 result;
+
+params = getInteger64(params, &number);	
+result = number;
+
+if(params == nilCell)
+	{
+	switch(op)
+		{
+		case OP_SUBTRACT:
+			result = - result;
+			break;
+		case OP_SHIFTL:
+			result <<= 1;
+			break;
+		case OP_SHIFTR:
+			result >>= 1;
+		default:
+			break;
+		}
+	}
+
+while(params != nilCell)
+	{
+	params = getInteger64(params, &number);
+	switch(op)
+		{
+		case OP_ADD:            result += number; break;
+		case OP_SUBTRACT:       result -= number; break;
+		case OP_MULTIPLY:       result *= number; break;
+		case OP_DIVIDE:         
+			if(number == 0)	return(errorProc(ERR_MATH));
+			result /= number; break;
+		case OP_BIT_OR:         result |= number; break;
+		case OP_BIT_AND:        result &= number; break;
+		case OP_BIT_XOR:        result ^= number; break;
+		case OP_SHIFTL:         result <<= number; break;
+		case OP_SHIFTR:         result >>= number; break;
+		case OP_MODULO:
+			if(number == 0)	return(errorProc(ERR_MATH));
+			result %= number; break;
+		default:
+			break;
+		}
+	}
+
+#ifndef NEWLISP64
+params = getCell(CELL_INT64);
+*(INT64 *)&params->aux = result;
+return(params);
+#else
+return(stuffInteger(result));
+#endif
+}
+
+
+CELL * p_add(CELL * params) { return(arithmetikOp(params, OP_ADD)); }
+CELL * p_subtract(CELL * params) { return(arithmetikOp(params, OP_SUBTRACT)); }
+CELL * p_multiply(CELL * params) { return(arithmetikOp(params, OP_MULTIPLY)); }
+CELL * p_divide(CELL * params) { return(arithmetikOp(params, OP_DIVIDE)); }
+
+CELL * p_bitOr(CELL * params) { return(arithmetikOp(params, OP_BIT_OR)); }
+CELL * p_bitAnd(CELL * params) { return(arithmetikOp(params, OP_BIT_AND)); }
+CELL * p_bitXor(CELL * params) { return(arithmetikOp(params, OP_BIT_XOR)); }
+CELL * p_shiftLeft(CELL * params) { return(arithmetikOp(params, OP_SHIFTL)); }
+CELL * p_shiftRight(CELL * params) { return(arithmetikOp(params, OP_SHIFTR)); }
+CELL * p_modulo(CELL * params) { return(arithmetikOp(params, OP_MODULO)); }
+
+
+CELL * p_bitNot(CELL * params)
+{
+INT64 number;
+getInteger64(params, &number);
+return(stuffInteger64(~number));
+}
+
+
+/* ----------------------- float arithmetik ----------------------------- */
+
+CELL * getFloat(CELL * params, double *);
+CELL * floatOp(CELL * params, int op);
+int compareFloats(CELL * left, CELL * right);
+int compareInts(CELL * left, CELL * right);
+
+
+CELL * p_addFloat(CELL * params) { return(floatOp(params, OP_ADD)); }
+CELL * p_subFloat(CELL * params) { return(floatOp(params, OP_SUBTRACT)); }
+CELL * p_mulFloat(CELL * params) { return(floatOp(params, OP_MULTIPLY)); }
+CELL * p_divFloat(CELL * params) { return(floatOp(params, OP_DIVIDE)); }
+CELL * p_minFloat(CELL * params) { return(floatOp(params, OP_MIN)); }
+CELL * p_maxFloat(CELL * params) { return(floatOp(params, OP_MAX)); }
+CELL * p_powFloat(CELL * params) { return(floatOp(params, OP_POW)); }
+CELL * p_modFloat(CELL * params) { return(floatOp(params, OP_MODULO)); }
+
+CELL * floatOp(CELL * params, int op)
+{
+double number;
+double result;
+
+params = getFloat(params, &result);
+if(params == nilCell)
+	{
+	if(op == OP_SUBTRACT)
+		result = - result;
+	else if(op == OP_DIVIDE)
+		result = 1.0 / result;
+	else if(op == OP_POW)
+		result = result * result;
+	}
+while(params != nilCell)
+	{
+	params = getFloat(params, &number);
+#ifdef WIN_32
+	if(isnan(number)) 
+		{
+		result = number;
+		break;
+		}
+#endif
+	switch(op)
+		{
+		case OP_ADD:            result += number; break;
+		case OP_SUBTRACT:       result -= number; break;
+		case OP_MULTIPLY:       result *= number; break;
+		case OP_DIVIDE:         
+			if(number == 0.0) 
+				return(errorProc(ERR_MATH));
+			result /= number; 
+			break;
+		case OP_MIN: if(number < result) result = number; break;
+		case OP_MAX: if(number > result) result = number; break;
+		case OP_POW: result = pow(result, number); break;
+		case OP_MODULO: 
+			if(number == 0.0)
+				return(errorProc(ERR_MATH));
+			result = fmod(result, number);
+		default: break;
+		}
+	}
+
+params = getCell(CELL_FLOAT);
+#ifndef NEWLISP64
+memcpy((void *)&params->aux, (void *)&result, sizeof(double));
+#else
+*(double *)&params->contents = result;
+#endif
+return(params);
+}
+
+
+int compareFloats(CELL * left, CELL * right)
+{
+double leftFloat, rightFloat;
+
+leftFloat = getDirectFloat(left);
+rightFloat = getDirectFloat(right);
+
+if(isnan(leftFloat) && isnan(rightFloat)) return(0);
+if(isnan(leftFloat) || isnan(rightFloat)) return(9);
+
+if(leftFloat < rightFloat) return(-1);
+if(leftFloat > rightFloat) return(1);
+
+return(0);
+}
+
+int compareInts(CELL * left, CELL * right)
+{
+INT64 leftnum;
+INT64 rightnum;
+
+#ifndef NEWLISP64
+if(left->type == CELL_LONG)
+	leftnum = (int)left->contents;
+else
+	leftnum = *(INT64 *)&left->aux;
+
+if(right->type == CELL_LONG)
+	rightnum = (int)right->contents;
+else
+	rightnum = *(INT64 *)&right->aux;
+#else
+leftnum = (UINT)left->contents;
+rightnum = (UINT)right->contents;
+#endif
+
+if(leftnum < rightnum) return(-1);
+if(leftnum > rightnum) return(1);
+
+return(0);
+}
+
+
+double getDirectFloat(CELL * param)
+{
+double floatNum = 0.0;
+
+#ifndef NEWLISP64
+if(param->type == CELL_FLOAT)
+	return(*(double *)&param->aux);
+else if(param->type == CELL_LONG)
+	floatNum = (long)param->contents;
+else if(param->type == CELL_INT64)
+	floatNum = *(INT64 *)&param->aux;
+#else
+if(param->type == CELL_FLOAT)
+	return(*(double *)&param->contents);
+else if(param->type == CELL_LONG)
+	floatNum = (long)param->contents;
+#endif
+
+return(floatNum);
+}
+
+/* ----------------------------- float functions ----------------------- */
+
+
+CELL * functionFloat(CELL *, int);
+
+CELL * p_sin(CELL * params) { return(functionFloat(params, OP_SIN)); }
+CELL * p_cos(CELL * params) { return(functionFloat(params, OP_COS)); }
+CELL * p_tan(CELL * params) { return(functionFloat(params, OP_TAN)); }
+CELL * p_asin(CELL * params) { return(functionFloat(params, OP_ASIN)); }
+CELL * p_acos(CELL * params) { return(functionFloat(params, OP_ACOS)); }
+CELL * p_atan(CELL * params) { return(functionFloat(params, OP_ATAN)); }
+CELL * p_sinh(CELL * params) { return(functionFloat(params, OP_SINH)); }
+CELL * p_cosh(CELL * params) { return(functionFloat(params, OP_COSH)); }
+CELL * p_tanh(CELL * params) { return(functionFloat(params, OP_TANH)); }
+CELL * p_asinh(CELL * params) { return(functionFloat(params, OP_ASINH)); }
+CELL * p_acosh(CELL * params) { return(functionFloat(params, OP_ACOSH)); }
+CELL * p_atanh(CELL * params) { return(functionFloat(params, OP_ATANH)); }
+CELL * p_sqrt(CELL * params) { return(functionFloat(params, OP_SQRT)); }
+CELL * p_log(CELL * params) { return(functionFloat(params, OP_LOG)); }
+CELL * p_exp(CELL * params) { return(functionFloat(params, OP_EXP)); }
+CELL * p_abs(CELL * params) { return(functionFloat(params, OP_ABS)); }
+CELL * p_ceil(CELL * params) { return(functionFloat(params, OP_CEIL)); }
+CELL * p_floor(CELL * params) { return(functionFloat(params, OP_FLOOR)); }
+CELL * p_erf(CELL * params) { return(functionFloat(params, OP_ERRORFUNC)); }
+CELL * p_sgn(CELL * params) { return(functionFloat(params, OP_SIGNUM)); }
+CELL * p_isnan(CELL * params) { return(functionFloat(params, OP_ISNAN)); }
+
+CELL * functionFloat(CELL * params, int op)
+{
+double floatN;
+double base;
+CELL * cell;
+
+getFloat(params, &floatN);
+#ifdef WIN_32
+if(isnan(floatN)) 
+	return( stuffFloat(&floatN) );
+#endif
+
+switch(op)
+  {
+  case OP_SIN: floatN = sin(floatN); break;
+  case OP_COS: floatN = cos(floatN); break;
+  case OP_TAN: floatN = tan(floatN); break;
+
+  case OP_ASIN: floatN = asin(floatN); break;
+  case OP_ACOS: floatN = acos(floatN); break;
+  case OP_ATAN: floatN = atan(floatN); break;
+
+  case OP_SINH: floatN = sinh(floatN); break;
+  case OP_COSH: floatN = cosh(floatN); break;
+  case OP_TANH: floatN = tanh(floatN); break;
+
+  case OP_ASINH: floatN = asinh(floatN); break;
+  case OP_ACOSH: floatN = acosh(floatN); break;
+  case OP_ATANH: floatN = atanh(floatN); break;
+
+  case OP_SQRT: floatN = sqrt(floatN); break;
+  case OP_LOG:
+    if(params->next != nilCell)
+      {
+      getFloat(params->next, &base);
+      floatN = log(floatN) / log(base);
+      } 
+    else 
+      floatN = log(floatN); 
+    break;
+  case OP_EXP: floatN = exp(floatN); break;
+  case OP_ABS: floatN = (floatN < 0.0) ? -floatN : floatN; break;
+  case OP_CEIL: floatN = ceil(floatN); break;
+  case OP_FLOOR: floatN = floor(floatN); break;
+  case OP_ERRORFUNC: floatN = erf(floatN); break;
+  case OP_SIGNUM:
+    if(params->next == nilCell)
+        { 
+        if(floatN > 0.0) floatN = 1.0;
+        else if(floatN < 0.0) floatN = -1.0; 
+        else floatN = 0.0;
+        break;
+        }
+    else
+        {
+        if(floatN < 0.0) cell = params->next;
+        else
+            {
+            params = params->next;
+            if(floatN == 0.0) cell = params->next;
+            else {
+                 params = params->next;
+                 cell = params->next;
+                 }
+            }
+        }
+            
+        return(copyCell(evaluateExpression(cell)));
+    case OP_ISNAN:
+		return (isnan(floatN) ? trueCell : nilCell);
+	default: break;
+}
+
+cell = getCell(CELL_FLOAT);
+#ifndef NEWLISP64
+*(double *)&cell->aux = floatN;
+#else
+*(double *)&cell->contents = floatN;
+#endif
+return(cell);
+}
+
+
+CELL * p_atan2(CELL * params)
+{
+double floatX, floatY;
+CELL * cell;
+
+params = getFloat(params, &floatX);
+getFloat(params, &floatY);
+
+cell = getCell(CELL_FLOAT);
+#ifndef NEWLISP64
+*(double *)&cell->aux = atan2(floatX, floatY);
+#else
+*(double *)&cell->contents = atan2(floatX, floatY);
+#endif
+return(cell);
+}
+
+
+CELL * p_round(CELL * params)
+{
+double fNum;
+double precision = 1.0;
+long digits = 0;
+char * fmt;
+char * result;
+
+
+params = getFloat(params, &fNum);
+if(params != nilCell)
+	getInteger(params, (UINT*)&digits);
+
+if(digits > 0)
+	{
+	precision = pow(10.0, (double)(digits > 20 ? 20 : digits));
+	fNum = precision * floor(fNum/precision + 0.5);
+	}
+else
+	{
+	fmt = alloca(16);
+	result = alloca(32);
+	snprintf(fmt, 15, "%%.%df", (int)((digits < -16) ? 16 : -digits));
+	snprintf(result, 31, fmt, fNum);
+	fNum = atof(result);
+	}
+
+return(stuffFloat(&fNum)); 
+}
+
+
+CELL * p_rand(CELL * params)
+{
+long range;  
+long n;
+CELL * dist, * cell;
+long rnum;
+double scale;
+
+params = getInteger(params, (UINT *)&range);
+scale = range;
+if(range == 0) 
+	{
+	srandom((unsigned)time(NULL));
+	return(trueCell);
+	}
+
+rnum = ((scale * random())/(MY_RAND_MAX - 1));
+if(params->type == CELL_NIL)
+	return(stuffInteger((UINT)rnum));
+	
+getInteger(params, (UINT *)&n);
+
+dist = getCell(CELL_EXPRESSION);
+
+cell = stuffInteger((UINT)rnum);
+dist->contents = (UINT)cell;
+
+--n;
+while(n-- > 0)
+	{
+	rnum = ((scale * random())/(MY_RAND_MAX - 1));
+	cell->next = stuffInteger((UINT)rnum);
+	cell = cell->next;
+	}
+
+return(dist);
+}
+
+
+CELL * p_amb(CELL * params)
+{
+long len;
+
+if((len = listlen(params)) == 0) return(nilCell);
+
+len = random() % len;
+
+while(len--) params = params->next;
+
+return(copyCell(evaluateExpression(params)));
+}
+
+
+CELL *  p_seed(CELL * params)
+{
+INT64 seedNum;
+
+getInteger64(params, &seedNum);
+
+srandom((UINT)(seedNum & 0xFFFFFFFF));
+
+return(stuffInteger(seedNum));
+}
+
+
+/* -----------------------  compare ops --------------------------- */
+
+#define OP_LESS 1
+#define OP_GREATER 2
+#define OP_LESS_EQUAL 3
+#define OP_GREATER_EQUAL 4
+#define OP_EQUAL 5
+#define OP_NOTEQUAL 6
+
+CELL * p_less(CELL * params) { return(compareOp(params, OP_LESS)); }
+CELL * p_greater(CELL * params) { return(compareOp(params, OP_GREATER)); }
+CELL * p_lessEqual(CELL * params) { return(compareOp(params, OP_LESS_EQUAL)); }
+CELL * p_greaterEqual(CELL * params) { return(compareOp(params, OP_GREATER_EQUAL)); }
+CELL * p_equal(CELL * params) { return(compareOp(params, OP_EQUAL)); }
+CELL * p_notEqual(CELL * params) { return(compareOp(params, OP_NOTEQUAL)); }
+
+CELL * compareOp(CELL * params, int op)
+{
+CELL * left;
+CELL * right;
+long cnt = 0;
+int comp;
+
+left = evaluateExpression(params);
+
+while(TRUE)
+	{
+	if((params = params->next) == nilCell && cnt == 0)
+		{
+		if(isNumber(left->type))
+			right = stuffInteger64(0);
+		else if(left->type == CELL_STRING)
+			right = stuffString("");
+		else if(isList(left->type))
+			right = getCell(CELL_EXPRESSION);
+		else break;		
+		pushResult(right);
+		}
+	else
+		right = evaluateExpression(params);
+	++cnt;
+	if((comp = compareCells(left, right)) == 9) return(nilCell);
+	switch(op)
+		{
+		case OP_LESS:
+			if(comp >= 0) return(nilCell);
+			break;
+		case OP_GREATER:
+			if(comp <= 0) return(nilCell);
+			break;
+		case OP_LESS_EQUAL:
+			if(comp > 0) return(nilCell);
+			break;
+		case OP_GREATER_EQUAL:
+			if(comp < 0) return(nilCell);
+			break;
+		case OP_EQUAL:
+			if(comp != 0) return(nilCell);
+			break;
+		case OP_NOTEQUAL:
+			if(comp == 0) return(nilCell);
+		default:
+			break;
+		}
+
+	if(params->next == nilCell) break;
+	left = right;
+	}
+
+return(trueCell);
+}
+
+int compareSymbols(CELL * left, CELL * right)
+{
+SYMBOL * leftS;
+SYMBOL * rightS;
+int comp;
+
+if(left->type == CELL_SYMBOL)
+	leftS = (SYMBOL *)left->contents;
+else
+	leftS = getDynamicSymbol(left);
+
+if(right->type == CELL_SYMBOL)
+	rightS = (SYMBOL *)right->contents;
+else
+	rightS = getDynamicSymbol(right);
+
+if(leftS->context != rightS->context)
+	{
+	leftS = leftS->context;
+	rightS = rightS->context;
+	}
+
+if((comp = strcmp((char *)leftS->name, (char *)rightS->name)) == 0) return(0);
+return (comp > 0 ? 1 : -1);
+}
+
+
+/* returns equal: 0 less: -1 greater: 1 or 9 if NaN or Inf equal comparison */
+int compareCells(CELL * left, CELL * right)
+{
+int comp;
+
+if(left->type != right->type)
+	{
+	if(left->type == CELL_FLOAT && ((right->type & COMPARE_TYPE_MASK) == CELL_INT))
+		return(compareFloats(left, right));
+	if(((left->type & COMPARE_TYPE_MASK) == CELL_INT) && right->type == CELL_FLOAT)
+		return(compareFloats(left, right));
+
+	if((left->type & COMPARE_TYPE_MASK) == CELL_INT && (right->type & COMPARE_TYPE_MASK) == CELL_INT)
+		return(compareInts(left, right));
+
+	if(isSymbol(left->type) && isSymbol(right->type))
+		return(compareSymbols(left, right));
+
+	if(isNil(left))
+		{
+		if(isNil(right)) return(0);
+		else return(-1);
+		}
+
+	if(isTrue(left))
+		{
+		if(isTrue(right)) return(0);
+		if(isNil(right)) return(1);
+		return(-1);
+		}
+
+	comp = (left->type & COMPARE_TYPE_MASK) - (right->type & COMPARE_TYPE_MASK);
+	if(comp == 0) return(0);
+
+	return( comp > 0 ? 1 : -1);
+	}
+
+switch(left->type)
+	{
+	case CELL_STRING:
+		comp = left->aux - right->aux;
+		if(comp == 0)
+			{
+			if((comp = memcmp((char *)left->contents, 
+					(char *)right->contents,
+					left->aux)) == 0) return(0);
+			}
+		else if(comp > 0)
+			{
+			if((comp = memcmp((char *)left->contents,
+					  (char *)right->contents,
+					  right->aux - 1)) == 0) 
+				return(1);
+			}
+		else if(comp < 0)
+			{
+			if((comp = memcmp((char *)left->contents,
+					  (char *)right->contents,
+					  left->aux - 1)) == 0) 
+				return(-1);
+			}
+			
+		return (comp > 0 ? 1 : -1);
+
+	case CELL_SYMBOL:
+	case CELL_DYN_SYMBOL:
+		return(compareSymbols(left, right));
+
+	case CELL_QUOTE:
+	case CELL_EXPRESSION:
+	case CELL_LAMBDA:
+	case CELL_MACRO:
+		return(compareLists((CELL*)left->contents, (CELL*)right->contents));
+	case CELL_ARRAY:
+		return(compareArrays((CELL*)left, (CELL*)right));
+	case CELL_FLOAT:
+		return(compareFloats(left, right));
+#ifndef NEWLISP64
+	case CELL_INT64:
+		if(*(INT64 *)&left->aux > *(INT64 *)&right->aux) return(1);
+		if(*(INT64 *)&left->aux < *(INT64 *)&right->aux) return(-1);
+		break;
+#endif
+	case CELL_LONG:
+	default:
+		if((long)left->contents > (long)right->contents) return(1);
+		if((long)left->contents < (long)right->contents) return(-1);
+		break;  
+	}
+
+return(0);
+}
+
+int compareLists(CELL * left, CELL * right)
+{
+int result;
+
+while(left != nilCell)
+	{
+	if( (result = compareCells(left, right)) != 0)
+		return(result);
+	left = left->next;
+	right = right->next;
+	}
+if(right == nilCell) return(0);
+return(-1);
+}
+
+
+/* ---------------------------- encryption -----------------------------
+
+  XOR one-pad enryption
+
+*/
+
+
+void encryptPad(char *encrypted, char *data, char * key, size_t dataLen, size_t keyLen)
+{
+size_t i;
+for(i = 0; i < dataLen; i++)
+	*(encrypted + i) = *(data + i) ^ *(key + i % keyLen);
+}
+
+
+CELL * p_encrypt(CELL * params)
+{
+char * data;
+char * key;
+char * dataEncrypted;
+CELL * encrypted;
+size_t dataLen, keyLen;
+
+getStringSize(params, &data, &dataLen, TRUE);
+getStringSize(params->next, &key, &keyLen, TRUE);
+
+if(!keyLen) return(errorProcExt(ERR_STRING_EXPECTED, params->next));
+
+dataEncrypted = (char *)allocMemory(dataLen + 1);
+*(dataEncrypted + dataLen) = 0;
+
+encryptPad(dataEncrypted, data, key, dataLen, keyLen);
+
+encrypted = getCell(CELL_STRING);
+encrypted->contents = (UINT)dataEncrypted;
+encrypted->aux = dataLen + 1;
+
+return(encrypted);
+}
+
+
+
+/* =============================  Fast Fourier Transform ======================== */
+
+CELL * fft(CELL * params, int isign);
+CELL * makeListFromFloats(double num1, double num2);
+double getFloatFromCell(CELL *);
+void fastFourierTransform(double data[], unsigned int  nn, int isign);
+
+CELL * p_fft(CELL * params)
+{
+return fft(params, 1);
+}
+
+
+CELL * p_ifft(CELL * params)
+{
+return fft(params, -1);
+}
+
+CELL * fft(CELL * params, int isign)
+{
+CELL * listData;
+CELL * list;
+CELL * cell;
+double * data;
+unsigned int i, n, N;
+
+getListHead(params, &listData);
+
+n = listlen(listData);
+
+N = 1;
+while(N < n) N <<= 1;
+
+data = (double *)allocMemory(N * 2 * sizeof(double));
+list = listData;
+for(i = 0; i < n*2; i+=2)
+	{
+	if(isNumber(list->type))
+		{
+		data[i] = getFloatFromCell(list);
+		data[i+1] = (double)0.0;
+		list = list->next;
+		continue;
+		}
+
+	if(list->type != CELL_EXPRESSION)
+		{
+		freeMemory(data);
+		return(errorProcExt(ERR_LIST_OR_NUMBER_EXPECTED, list));
+		}
+
+	cell = (CELL *)list->contents;
+	data[i] = getFloatFromCell(cell);
+	data[i+1] = getFloatFromCell(cell->next);
+	list= list->next;
+	}
+	
+
+for(i = n * 2; i < N * 2; i++)
+	data[i] = 0.0;
+
+fastFourierTransform(data, N, isign);
+
+list = listData = getCell(CELL_EXPRESSION);
+if(isign == -1) 
+	for(i = 0; i < n * 2; i++) data[i] = data[i]/N;
+
+list->contents = (UINT)makeListFromFloats(data[0], data[1]);
+list = (CELL*)list->contents;
+for(i = 2; i < N * 2; i += 2)
+	{
+	list->next = makeListFromFloats(data[i], data[i+1]);
+	list = list->next;
+	}
+
+freeMemory(data);
+
+return(listData);
+}
+
+
+CELL * makeListFromFloats(double num1, double num2)
+	{
+	CELL * cell;
+	CELL * list;
+
+	list = getCell(CELL_EXPRESSION);
+	list->contents = (UINT)stuffFloat(&num1);
+	cell = (CELL *)list->contents;
+	cell->next = stuffFloat(&num2);
+	return(list);
+	}
+
+
+double getFloatFromCell(CELL * cell)
+	{
+	double number;
+#ifndef NEWLISP64
+	if(cell->type == CELL_FLOAT)
+		memcpy((void *)&number, (void *)&cell->aux, sizeof(double));
+	else if(cell->type == CELL_LONG)
+		number = (int)cell->contents;
+	else number = (double)*(INT64 *)&cell->aux;
+#else
+	if(cell->type == CELL_FLOAT)
+		number = *(double *)&cell->contents;
+	else
+		number = (long)cell->contents;
+#endif
+	return(number);
+	}
+
+	
+/* Fast Fourier Transform 
+// algorithm modified for zero-offset data[] and double precision from
+// 
+// Numerical Recipes in 'C', 2nd Edition
+// W.H. Press, S.A. Teukolsky
+// W.T. Vettering, B.P. Flannery
+// Cambridge University Press, 1992
+*/
+
+#define SWAP(a,b) tempr=(a);(a)=(b);(b)=tempr
+
+void fastFourierTransform(double data[], unsigned int nn, int isign)
+{
+unsigned int n, mmax, m, j, istep, i;
+double wtemp, wr, wpr, wpi, wi, theta;
+double tempr, tempi;
+
+n = nn << 1;
+j = 1;
+
+for(i = 1; i < n; i += 2)
+	{
+	if(j > i)
+		{
+		SWAP(data[j-1], data[i-1]);
+		SWAP(data[j], data[i]);
+		}
+	m = n >> 1;
+	while(m >= 2 && j > m)
+		{
+		j -= m;
+		m >>= 1;
+		}
+	j += m;
+	}
+
+
+mmax = 2;
+while(n > mmax)
+	{
+	istep = mmax << 1;
+	theta = isign * (6.28318530717959/mmax);
+	wtemp = sin(0.5 * theta);
+	wpr = -2.0 * wtemp * wtemp;
+	wpi = sin(theta);
+	wr = 1.0;
+	wi = 0.0;
+	for(m = 1; m < mmax; m += 2)
+		{
+		for(i = m; i <= n; i += istep)
+			{	
+			j = i + mmax;
+			tempr = wr * data[j-1] - wi * data[j];
+			tempi = wr * data[j] + wi * data[j-1];
+			data[j-1] = data[i-1] - tempr;
+			data[j] = data[i] - tempi;
+			data[i-1] += tempr;
+			data[i] += tempi;
+			}
+		wtemp = wr;
+		wr = wtemp * wpr - wi * wpi + wr;
+		wi = wi * wpr + wtemp * wpi + wi;
+		}
+	mmax = istep;
+	}
+}
+
+
+/* --------------------------- probability distributions ----------------- */
+
+#define DIST_RANDOM 0
+#define DIST_NORMAL 1
+
+double getRandom(double offset, double scale, int type)
+{
+int i;
+double randnum;
+
+if(type == DIST_RANDOM)
+	{
+	randnum = random();
+	return(scale * randnum/MY_RAND_MAX + offset);
+	}
+
+if(type == DIST_NORMAL)
+	{
+	randnum = 0.0;
+	for(i = 0; i < 12; i++)
+		randnum += random() % 1024;
+	return(scale * (randnum - 6144)/1024 + offset);
+	}
+
+return(0.0);
+}
+
+CELL * randomDist(CELL * params, int type)
+{
+double randnum;
+size_t i;
+size_t n = 0;
+double scale = 1.0;
+double offset = 0.0;
+CELL * dist;
+CELL * cell;
+
+if(params->type != CELL_NIL)
+	{
+	params = getFloat(params, &offset);
+	params = getFloat(params, &scale);
+	if(params->type != CELL_NIL)
+		getInteger(params, (UINT*)&n);
+	}
+
+if( n == 0)
+	{
+	randnum = getRandom(offset, scale, type);
+	return(stuffFloat(&randnum));
+	}
+
+dist = getCell(CELL_EXPRESSION);
+randnum = getRandom(offset, scale, type);
+dist->contents = (UINT)stuffFloat(&randnum);
+cell = (CELL*)dist->contents;
+for(i = 1; i < n; i++)
+	{
+	randnum = getRandom(offset, scale, type);
+	cell->next = stuffFloat(&randnum);
+	cell = cell->next;
+	}
+
+return(dist);
+}
+
+
+CELL * p_normal(CELL * params)
+{
+return(randomDist(params, DIST_NORMAL));
+}
+
+CELL * p_random(CELL * params)
+{
+return(randomDist(params, DIST_RANDOM));
+}
+
+CELL * p_randomize(CELL * params)
+{
+CELL * list;
+CELL * cell;
+size_t length, i, j;
+CELL * * vector;
+int repetition = 0;
+
+getListHead(params, &list);
+
+if((length = listlen(list)) <= 1) 
+  {
+  cell = getCell(CELL_EXPRESSION);
+  cell ->contents = (UINT)copyList(list);
+  return(cell);
+  }
+  
+repetition = getFlag(params->next);
+ 
+/* build index vector */
+cell = list; 
+vector = allocMemory(length * sizeof(UINT));
+for(i = 0; i < length; i++)
+	{
+	vector[i] = copyCell(cell);
+	vector[i]->next = (void *)i;
+	cell = cell->next;
+	}
+
+/* reorganize randomly */
+RANDOMIZE:
+for(i = 0; i < (length - 1); i++)
+  {
+  j = random() % length;
+  cell = vector[i];
+  vector[i] = vector[j];
+  vector[j] = cell;
+  }
+
+/* check that new sequence is different */
+if(!repetition)
+    {
+    for(i = 0; i < length; i++)
+        if(vector[i]->next != (void *)i) break;
+  
+    if(i == length)  goto RANDOMIZE;
+    }
+
+/* relink the list */
+cell = list = getCell(CELL_EXPRESSION);
+cell->contents  = (UINT)vector[0];
+cell = (CELL *)cell->contents;
+for(i = 1; i < length; i++)
+	{
+	cell->next = vector[i];
+	cell = cell->next;
+	}
+cell->next = nilCell;
+free(vector);
+
+return(list);
+}
+
+/* --------------------------------------------------------------------- 
+   probZ  - probability of normal z value
+
+   Adapted from a polynomial approximation in:
+      Ibbetson D, Algorithm 209
+      Collected Algorithms of the CACM 1963 p. 616
+
+   Note:
+      This routine has six digit accuracy, so it is only useful for absolute
+      z values < 6.  For z values >= to 6.0, poz() returns 0.0.
+
+   propChi2 - popbablitiy of CHI-2 for df degrees of freedom
+
+   Adapted from:
+      Hill, I. D. and Pike, M. C.  Algorithm 299
+      Collected Algorithms for the CACM 1967 p. 243
+      Updated for rounding errors based on remark in
+      ACM TOMS June 1985, page 185
+
+   critChi2 - Compute critical chi-square value for p and df
+   critZ - Compute critical Z-value from p
+
+*/
+
+double probChi2(double chi2, int df);
+double critChi2(double p, int df);
+double probZ(double z);
+double critZ(double p);
+double gammaln(double xx);
+double betai(double a, double b, double x);
+double gammap(double a, double x);
+double betacf(double a, double b, double x);
+static double gser(double a, double x, double gln);
+double gcf(double a, double x, double gln);
+
+CELL * p_probabilityZ(CELL * params)
+{
+double z;
+double p;
+
+getFloat(params, &z);
+
+p = probZ(z);
+return(stuffFloat((double *)&p));
+}
+
+
+double probChi2(double chi2, int df)
+{
+return(1.0 - gammap(df/2, chi2/2));
+}
+
+CELL * p_probabilityChi2(CELL * params)
+{
+double chi2;
+double df;
+double q;
+
+params = getFloat(params, &chi2);
+getFloat(params, &df);
+
+q = probChi2(chi2, df);
+
+return(stuffFloat((double *)&q));
+}
+
+
+CELL * p_criticalChi2(CELL  * params)
+{
+double p;
+long df;
+double chi;
+
+params = getFloat(params, &p);
+getInteger(params, (UINT *)&df);
+
+chi = critChi2(p, df);
+
+return(stuffFloat((double *)&chi));
+}
+
+
+CELL * p_criticalZ(CELL * params)
+{
+double p;
+double Z;
+
+getFloat(params, &p);
+Z = critZ(p);
+
+return(stuffFloat((double *)&Z));
+}
+
+
+#define Z_MAX 6.0  /* Maximum meaningful z value */
+
+double probZ(double z) 
+{
+double y, x, w;
+
+        
+if (z == 0.0) x = 0.0;
+else 
+	{
+	y = 0.5 * (z < 0.0 ? -z : z);
+	if (y >= (Z_MAX * 0.5)) x = 1.0;
+	else 
+		{
+		if (y < 1.0) 
+			{
+			w = y * y;
+			x = ((((((((0.000124818987 * w 
+				- 0.001075204047) * w + 0.005198775019) * w
+				- 0.019198292004) * w + 0.059054035642) * w
+				- 0.151968751364) * w + 0.319152932694) * w
+				- 0.531923007300) * w + 0.797884560593) * y * 2.0;
+			} 
+		else {  
+			y -= 2.0;
+			x = (((((((((((((-0.000045255659 * y
+				+ 0.000152529290) * y - 0.000019538132) * y
+				- 0.000676904986) * y + 0.001390604284) * y
+				- 0.000794620820) * y - 0.002034254874) * y
+				+ 0.006549791214) * y - 0.010557625006) * y
+				+ 0.011630447319) * y - 0.009279453341) * y
+				+ 0.005353579108) * y - 0.002141268741) * y
+				+ 0.000535310849) * y + 0.999936657524;
+			}
+		}
+	}
+return z > 0.0 ? ((x + 1.0) * 0.5) : ((1.0 - x) * 0.5);
+}
+
+#define BIGX 20.0        /* max value to represent exp(x) */
+
+double ex(double x) 
+{
+return (x < -BIGX) ? 0.0 : exp(x);
+}   
+
+
+double critChi2(double p, int df)
+{
+#define CHI_EPSILON 0.000001   /* Accuracy of critchi approximation */
+#define CHI_MAX 99999.0        /* Maximum chi-square value */
+double minchisq = 0.0;
+double maxchisq = CHI_MAX;
+double chisqval;
+        
+if (p <= 0.0) return maxchisq;
+else if (p >= 1.0) return 0.0;
+        
+chisqval = df / sqrt(p);    /* fair first value */
+while ((maxchisq - minchisq) > CHI_EPSILON)
+	{
+	if (gammap(df/2, chisqval/2) < p) minchisq = chisqval;
+	else maxchisq = chisqval;
+	chisqval = (maxchisq + minchisq) * 0.5;
+	}
+return chisqval;
+}
+
+
+double critZ(double p)
+{
+#define Z_EPSILON 0.000001   /* Accuracy of critchi approximation */
+double minZ = 0.0;
+double maxZ = Z_MAX;
+double Zval;
+        
+if (p <= 0.0) return maxZ;
+else if (p >= 1.0) return 0.0;
+        
+Zval = 2.0;    /* fair first value */
+while ((maxZ - minZ) > Z_EPSILON)
+	{
+	if (probZ(Zval) < p) minZ = Zval;
+	else maxZ = Zval;
+	Zval = (maxZ + minZ) * 0.5;
+	}
+return Zval;
+}
+
+
+/* ----------------------- betai and gammaln fucntions ----------------------*/
+
+
+static int paramError;
+
+CELL * p_beta(CELL * params)
+{
+double a, b, beta;
+
+params = getFloat(params, &a);
+getFloat(params, &b);
+
+beta = exp(gammaln(a) + gammaln(b) - gammaln(a+b));
+
+return(stuffFloat(&beta));
+}
+
+CELL * p_betai(CELL * params)
+{
+double a, b, x, result;
+
+params = getFloat(params, &x);
+params = getFloat(params, &a);
+getFloat(params, &b);
+
+paramError = 0;
+
+result = betai(a,b,x);
+
+if(paramError)
+	return(nilCell);
+	
+return(stuffFloat(&result));
+}
+
+
+CELL * p_gammaln(CELL * params)
+{
+double x, result;
+
+getFloat(params, &x);
+
+paramError = 0;
+
+result = gammaln(x);
+
+if(paramError)
+	return(nilCell);
+	
+return(stuffFloat(&result));
+}
+
+
+CELL * p_gammai(CELL * params)
+{
+double a, x, result;
+
+params = getFloat(params, &a);
+getFloat(params, &x);
+
+result = gammap(a, x);
+
+return(stuffFloat(&result));
+}
+
+
+/* these functions are adapted from:
+   Numerical Recipes in C
+   W.H.Press, S.A. Teukolsky, W.T. Vettering, B.P. Flannery
+   Cambridge University Press (c) 1992
+*/
+
+#define ITMAX 100
+#define EPS7 3.0e-7
+
+double betai(double a, double b, double x)
+{
+double bt;
+
+if (x < 0.0 || x > 1.0) 
+	{
+	paramError = 1;
+	return(0.0);
+	}
+
+if (x == 0.0 || x == 1.0) 
+	bt = 0.0;
+else
+	bt = exp(gammaln(a+b)-gammaln(a)-gammaln(b)+a*log(x)+b*log(1.0-x));
+	
+if (x < (a+1.0)/(a+b+2.0))
+	return (bt * betacf(a,b,x) / a);
+else
+	return (1.0 - bt * betacf(b,a,1.0-x) / b);
+}
+
+
+double betacf(double a, double b, double x)
+{
+double qap,qam,qab,em,tem,d;
+double bz,bm,bp,bpp;
+double az,am,ap,app,aold;
+int m;
+
+bm = az = am = 1.0;
+qab=a+b;
+qap=a+1.0;
+qam=a-1.0;
+bz=1.0-qab*x/qap;
+for (m=1;m<=ITMAX;m++) 
+	{
+        em=(double) m;
+	tem=em+em;
+	d=em*(b-em)*x/((qam+tem)*(a+tem));
+	ap=az+d*am;
+	bp=bz+d*bm;
+	d = -(a+em)*(qab+em)*x/((qap+tem)*(a+tem));
+	app=ap+d*az;
+	bpp=bp+d*bz;
+	aold=az;
+	am=ap/bpp;
+	bm=bp/bpp;
+	az=app/bpp;
+	bz=1.0;
+	if (fabs(az-aold) < (EPS7 * fabs(az))) return az;
+	}
+
+return(paramError = 1);
+}
+
+
+double gammaln(double xx)
+{
+double x,y,tmp,ser;
+static double cof[6] = {
+ 76.18009172947146,
+-86.50532032941677,
+ 24.01409824083091,
+ -1.231739572450155,
+  0.1208650973866179e-2,
+ -0.5395239384953e-5};
+
+int j;
+
+if(xx == 0.0)
+	fatalError(ERR_INVALID_PARAMETER_0, NULL, 0);
+
+y=x=xx;
+tmp=x+5.5;
+tmp -= (x+0.5)*log(tmp);
+ser=1.000000000190015;
+
+for (j=0;j<=5;j++) ser += cof[j]/++y;
+	
+return -tmp+log(2.5066282746310005*ser/x);
+}
+
+
+#define EPS9 3.0e-9
+#define FPMIN 1.0e-307
+
+/* incomplete Gamma function
+//
+// gammap = P(a,x) 
+// gammaq = Q(a,x) = 1.0 - P(a,x)
+//
+// prob-chi2 = gammap(df/2, chi2/2) 
+// of beeing as good as observed (>=)
+*/
+double gammap(double a, double x)
+{
+double gln;
+gln = gammaln(a);
+return (x < a + 1) ? gser(a, x, gln) : (1.0 - gcf(a ,x , gln));
+}
+
+
+static double gser(double a, double x, double gln)
+{
+double ap, del, sum;
+int n;
+
+ap = a;
+del = 1.0/a;
+sum = del;
+
+for (n = 1 ; n <= ITMAX ; n++)
+	{
+	++ap;
+	del *= x / ap;
+	sum += del;
+	if (fabs(del) < fabs(sum) * EPS9)
+	return sum * exp(-x + a * log(x) - gln);
+	}
+
+return sum * exp(-x + a * log(x) - gln);
+}
+
+
+double gcf(double a, double x, double gln)
+{
+double b, c, d, h, an, del;
+int i;
+
+b = x + 1 - a;
+c = 1.0/FPMIN;
+d = 1.0/b;
+h = d;
+
+for (i = 1 ; i <= ITMAX ; i++)
+	{
+	an = -i * (i - a);
+	b += 2;
+    
+	d = an * d + b;
+	if (fabs(d) < FPMIN) d = FPMIN;
+
+	c = b + an/c;
+	if (fabs(c) < FPMIN) c = FPMIN;
+
+	d = 1.0/d;
+	del = d * c;
+	h *= del;
+	if (fabs(del-1.0) < EPS9) break;
+	}
+
+return exp(-x + a * log(x) - gln) * h;
+}
+
+
+/* ------------------------------------- Binomial distribution -------------------- */
+
+CELL * p_binomial(CELL * params)
+{
+long n, k;
+double bico, p, binomial;
+
+params = getInteger(params, (UINT *)&n);
+params = getInteger(params, (UINT *)&k);
+getFloat(params, &p);
+
+bico = exp(gammaln(n + 1.0) - gammaln(k + 1.0) - gammaln(n - k + 1.0));
+
+#ifdef TRU64
+binomial = bico * pow(p, (double)k) * pow(1.0 - p, (double)(n - k));
+#else
+binomial = bico * pow(p, k) * pow(1.0 - p, (n - k));
+#endif
+
+return(stuffFloat(&binomial));
+}
+
+/* -------------------------------------------------------------------------------- */
+
+CELL * p_series(CELL * params)
+{
+double fromFlt, factFlt, current;
+ssize_t i;
+ssize_t count;
+CELL * sequence;
+CELL * cell;
+
+params = getFloat(params, &fromFlt);
+params = getFloat(params, &factFlt);
+if(isnan(fromFlt) || isnan(factFlt))
+	return(errorProc(ERR_INVALID_PARAMETER_NAN));
+getInteger(params, (UINT *)&count);
+sequence = getCell(CELL_EXPRESSION);
+if(count > 0)
+	{
+	cell = stuffFloat(&fromFlt);
+	sequence->contents = (UINT)cell;
+	current = fromFlt;
+	for(i = 1; i < count; i++)
+		{
+		current *= factFlt;
+		cell->next = stuffFloat(&current);
+		cell = cell->next;
+		}
+	}
+
+return(sequence);
+}
+
+/* ------------------------------- prime numbers ---------------------------- */
+
+/*
+* adapted for newLISP from the following code:
+*
+* factor.c -- print prime factorization of a number
+* Ray Gardner -- 1985 -- public domain
+* Modified Feb. 1989 by Thad Smith > public domain
+*
+* This version takes numbers up to the limits of double precision.
+*/
+
+
+CELL * pushFactor (INT64 d, int k, INT64 * prevFact, CELL * factList)
+{
+if (! *prevFact)
+	{
+	factList->contents = (UINT)stuffInteger64(d);
+	factList = (CELL*)factList->contents;
+	k--;
+	}
+
+while(k--)
+	{
+	factList->next = stuffInteger64(d);
+	factList = factList->next;
+	}
+
+(*prevFact)++;
+
+return(factList);
+}
+
+
+CELL * p_factor (CELL * params)
+{
+INT64 d, n;
+long k;
+INT64 prevFact = 0;
+CELL * factList;
+CELL * next;
+
+getInteger64(params, &n);
+
+d = n + 1;     /* test for roundoff error */
+
+if ( (n + 3 != d + 2)  || (n < 2) )
+      return(nilCell);
+      
+next = factList = getCell(CELL_EXPRESSION);
+
+if ( n > 2 )
+      {
+      d = 2;
+      for ( k = 0; (n % d) == 0; k++ )
+              n /= d;
+      if ( k )  next = pushFactor(d, k, &prevFact, next);
+      
+      for ( d = 3; d * d <= n; d += 2 )
+            {
+            for ( k = 0; (n % d) == 0; k++ )
+            	n /= d;
+	    	if ( k ) next = pushFactor(d, k, &prevFact, next);
+            }
+      }
+
+if ( n > 1 )
+      {
+      if ( ! prevFact ) 
+      	factList->contents = (UINT)stuffInteger64(n);
+      else  next = pushFactor(n, 1, &prevFact, next);
+      }
+      
+return(factList);
+}
+
+CELL * p_gcd(CELL * params)
+{ 
+INT64 m, n;
+INT64 t, r;
+
+params = getInteger64(params, &m);
+if(m < 0) m = -m;
+n = m;
+
+while(params != nilCell)
+	{
+	params = getInteger64(params, &n);
+	if(n < 0) n = -n;
+
+	ITERATE_GCD:
+	if (m < n) { t = m; m = n; n = t; }
+	if(n == 0) {n = m; continue; } /* for (gcd x 0) => x */
+	r = m % n;
+	if (r == 0) { m = n; continue; }
+	m = n; n = r;
+	goto ITERATE_GCD;
+	}
+
+return(stuffInteger64(n));
+} 
+
+
+/* ------------------------------- financial functions ---------------------- */
+
+
+CELL * p_pmt(CELL * params)
+{
+long nper, type;
+double rate, pv;
+double fv = 0.0;
+double pmt = 0.0;
+double inc;
+
+params = getFloat(params, &rate);
+params = getInteger(params, (UINT *)&nper);
+params = getFloat(params, &pv);
+if(params != nilCell)
+	{
+	params = getFloat(params, &fv);
+	getInteger(params, (UINT *)&type);
+	}
+else type = 0;
+
+
+if(rate == 0)
+    pmt = (-pv - fv) / nper;
+else
+    {
+    inc = pow(1 + rate, (double)nper);
+    pmt = - (pv * inc + fv) / ((1 + rate * type) * ((inc - 1) / rate));
+    }
+  
+return stuffFloat(&pmt);
+}
+
+
+CELL * p_pv(CELL * params)
+{
+long nper, type;
+double rate, pmt, pv;
+double fv = 0.0;
+double inc;
+
+params = getFloat(params, &rate);
+params = getInteger(params, (UINT *)&nper);
+params = getFloat(params, &pmt);
+
+if(params != nilCell)
+	{
+	params = getFloat(params, &fv);
+	getInteger(params, (UINT *)&type);
+	}
+else type = 0;
+
+if(rate == 0)
+    pv = - pmt * nper - fv;
+else
+    {
+    inc = pow(1 + rate, (double)nper);
+    pv = (-pmt * (1 + rate * type) * ((inc - 1) / rate) - fv) / inc;
+    }
+  
+return stuffFloat(&pv);
+}
+
+
+CELL * p_fv(CELL * params)
+{
+double rate, pmt, pv;
+long nper, type;
+double inc, fv;
+
+params = getFloat(params, &rate);
+params = getInteger(params, (UINT *)&nper);
+params = getFloat(params, &pmt);
+params = getFloat(params, &pv);
+if(params != nilCell)
+    getInteger(params, (UINT *)&type);
+else type = 0;
+
+
+if(rate == 0)
+    fv = - pmt * nper - pv;
+else
+    {
+    inc = pow(1 + rate, (double)nper);
+    fv = -pmt * (1 + rate * type) * ((inc - 1) / rate) - pv * inc;
+    }
+  
+return stuffFloat(&fv);
+}
+
+
+CELL * p_nper(CELL * params)
+{
+double rate, pmt, pv;
+double fv = 0.0;
+long type;
+double R, c, nper;
+
+params = getFloat(params, &rate);
+params = getFloat(params, &pmt);
+params = getFloat(params, &pv);
+
+if(params != nilCell)
+	{
+	params = getFloat(params, &fv);
+	getInteger(params, (UINT *)&type);
+	}
+else type = 0;
+  
+if(rate == 0)
+    nper = (-pv - fv) / pmt;
+else if(rate > -1.0)
+    {
+    R = 1.0 + rate;
+    c = pmt * (type ? R : 1.0) / rate;
+    nper = log((c - fv) / (c + pv)) / log(R);
+    }
+else nper = sqrt(-1.0);   /* NaN */
+
+
+return stuffFloat(&nper);
+}
+
+
+CELL * p_npv(CELL * params)
+{
+CELL * list;
+double rate, cashFlow, fNum;
+int count;
+
+params = getFloat(params, &rate);
+list = evaluateExpression(params);
+if(!isList(list->type))
+    return(errorProcExt(ERR_LIST_EXPECTED, params));
+list = (CELL *)list->contents;
+
+cashFlow = 0.0;
+count = 0;
+while(list !=  nilCell)
+    {
+/*
+    if(list->type == CELL_FLOAT)
+        memcpy((void *)&fNum, (void *)&list->aux, sizeof(double));
+    else if(list->type == CELL_LONG)
+	fNum = (int)list->contents;
+*/
+	if(isNumber(list->type))
+		fNum = getFloatFromCell(list);
+    else 
+        fNum = 0.0;
+
+    cashFlow += fNum / pow((1.0 + rate), (double)++count);
+    list = list->next;
+    }
+
+return stuffFloat(&cashFlow);
+}
+
+
+/* Internal Rate of Return - irr
+
+   adapted from a C++ program by:
+  
+   Bernt Arne Odegaard, 1999 http://finance.bi.no/~bernt
+
+   Note, that some data have multiple solutions, this search
+   algorithm returns only one
+
+*/
+
+
+double cfPv(int N, int times[], double amounts[], double rate)
+{
+double PV = 0.0;
+int t;
+
+for(t = 0; t < N; t++)
+    PV += amounts[t] / pow((1.0 + rate), (double)times[t]);
+
+return(PV);
+}
+
+
+#define PRECISION 1.0e-5
+#define MAX_ITERATIONS 50
+#define IRR_ERROR -1.0
+
+double irr(int N, int times[], double amounts[], double x2)
+{
+double est1, est2;
+double x1 = 0.0;
+double f, rtb, dx;
+double x_mid, f_mid;
+int i;
+    
+est1 = cfPv(N, times, amounts,  x1);
+est2 = cfPv(N, times, amounts,  x2);
+
+for(i=0; i<MAX_ITERATIONS; i++)
+    {
+    if(est1 * est2 < 0.0) break;
+
+    if(fabs(est1) < fabs(est2)) 
+        est1 = cfPv(N, times, amounts,  x1 += 1.6 * (x1 - x2));
+    else 
+        est2 = cfPv(N, times, amounts,  x2 += 1.6 * (x2 - x1));
+    }
+    
+if (est2 * est1 > 0.0) return (IRR_ERROR);
+
+f = cfPv(N, times, amounts, x1);
+dx=0;
+
+if(f < 0.0) 
+    {
+    rtb = x1;
+    dx=x2-x1;
+    }
+else 
+    {
+    rtb = x2;
+    dx = x1-x2;     
+    };
+
+for(i = 0; i< MAX_ITERATIONS; i++)
+    {
+    dx *= 0.5;
+    x_mid = rtb + dx;
+    f_mid = cfPv(N, times, amounts, x_mid);
+
+    if(f_mid <= 0.0)
+        rtb = x_mid;
+
+    if((fabs(f_mid) < PRECISION) || (fabs(dx) < PRECISION)) 
+        return x_mid;
+    }; 
+   
+return(IRR_ERROR);
+}
+
+CELL * p_irr(CELL * params)
+{
+CELL * amounts;
+CELL * times;
+CELL * list;
+double result;
+double guess = 0.5;
+double * amountsVec;
+int * timesVec;
+int i, N = 0;
+long number;
+
+params = getListHead(params, &amounts);
+list = amounts;
+if(params != nilCell)
+	{
+	params = getListHead(params, &times);
+	if(params != nilCell)
+		getFloat(params, &guess);
+	}	
+
+else
+	times = NULL;
+
+while(list != nilCell)
+	{
+	++N;
+	list = list->next;
+	}
+
+amountsVec = (double *)allocMemory(N * sizeof(double));
+timesVec = (int *)allocMemory(N * sizeof(int));
+
+for(i = 0; i < N; i++)
+	{
+	if(isNumber(amounts->type))
+		{
+		amountsVec[i] = getFloatFromCell(amounts);
+		amounts = amounts->next;
+		}
+	else 
+		{
+		free(amountsVec);
+		free(timesVec);
+		return(errorProcExt(ERR_NUMBER_EXPECTED, amounts));
+		}
+
+	if(times == NULL) 
+		timesVec[i] = i + 1;
+	else
+		{
+		times = getIntegerExt(times, (UINT *)&number, FALSE);
+		timesVec[i] = number;
+		}
+	}
+
+result = irr(N, timesVec, amountsVec, guess);
+if(result < 0.00001) 
+	result = 0.0;
+else
+	{
+	result = floor((10000 * result + 0.5))/10000;
+	}
+
+free(amountsVec);
+free(timesVec);
+
+if(result == IRR_ERROR)
+	return(nilCell);
+
+return(stuffFloat(&result));
+}
+
+/* ----------------------------------- CRC32 ----------------------- */
+
+/* Algorithm from: http://www.w3.org/TR/PNG-CRCAppendix.html */
+
+unsigned int update_crc(unsigned int crc, unsigned char *buf, int len);
+
+CELL * p_crc32(CELL * params)
+{
+char * data;
+size_t len;
+
+params = getStringSize(params, &data, &len, TRUE);
+return(stuffInteger(update_crc(0xffffffffL, (unsigned char *)data, (int)len) ^ 0xffffffffL));
+}
+
+/* Update a running CRC with the bytes buf[0..len-1]--the CRC
+   should be initialized to all 1's, and the transmitted value
+   is the 1's complement of the final running CRC (see the
+   crc() routine below)). 
+*/
+   
+unsigned int update_crc(unsigned int crc, unsigned char *buf, int len)
+{
+unsigned int crc_table[256];
+unsigned int c;
+int n, k;
+ 
+/* make crc table */  
+for (n = 0; n < 256; n++) 
+    {
+    c = (unsigned int) n;
+    for (k = 0; k < 8; k++) 
+       {
+       if (c & 1)
+           c = 0xedb88320L ^ (c >> 1);
+       else
+           c = c >> 1;
+       }
+   crc_table[n] = c;
+   }
+
+c = crc;   
+
+/* update crc */
+for (n = 0; n < len; n++) 
+    c = crc_table[(c ^ buf[n]) & 0xff] ^ (c >> 8);
+
+return c;
+}
+
+/* ----------------------------------- Bayesian statistics -------------------------- */
+
+/* 
+
+   (bayes-train M1 M2 [M3 ... Mn] D)
+
+   takes two or more lists M1, M2 ... with tokens from a joint set of tokens T.
+   Token can be symbols or strings other datatypes are ignored.
+   Tokerns are placed in a common dictionary in context D and the frquency 
+   is counted  how often they occur in each category Mi.
+   
+   The M categories represent data models for which a sequence of tokens can be
+   classified see (bayes-query ...)
+   
+   Each token in D is a content addressable symbol in D containing a
+   list of ferquencies of that token how often it occurs in each category.
+   String tokens are prepended with an undersocre _ before convering them
+   to a symbol in D.
+   
+   The function returns a list of token numbers in the different category models: 
+   (N-of-tokens-in-M1 N-of-tokens-in-M2)
+   
+   (bayes-train M1 M2 [M3 ... Mn] D)
+
+*/ 
+
+CELL * p_bayesTrain(CELL * params)
+{
+CELL * * category;
+CELL * list;
+CELL * count;
+int * total;
+int i, idx, maxIdx = 0;
+SYMBOL * ctx;
+SYMBOL * sPtr;
+SYMBOL * totalPtr;
+char * token;
+
+list = params;
+while(list != nilCell) list = list->next, maxIdx++;
+--maxIdx; /* last is a context not a category */
+if(maxIdx < 1) errorProc(ERR_MISSING_ARGUMENT);
+
+category = alloca(maxIdx * sizeof(CELL *));
+total = alloca(sizeof(int));
+token = alloca(MAX_STRING + 1);
+
+for(idx = 0; idx < maxIdx; idx++)
+  {
+  params = getListHead(params, &list);
+  category[idx] = list;
+  }
+  
+if((ctx = getCreateContext(params, TRUE)) == NULL)
+  return(errorProcExt(ERR_SYMBOL_OR_CONTEXT_EXPECTED, params));
+            
+for(idx = 0; idx < maxIdx; idx++)
+  {
+  list = category[idx];
+  total[idx] = 0;
+  while(list != nilCell)	
+    {
+
+    switch(list->type)
+      {
+      case CELL_STRING:
+        if(list->aux > MAX_STRING) continue;
+        *token = '_';
+        memcpy(token + 1, (char *)list->contents, list->aux);
+        break;
+      case CELL_SYMBOL:
+        strncpy(token, ((SYMBOL *)list->contents)->name, MAX_STRING);
+        break;
+      }
+    
+    sPtr = translateCreateSymbol(token, CELL_EXPRESSION, ctx, TRUE);
+    if(((CELL*)sPtr->contents)->type == CELL_NIL)
+      {
+      /* create list with maxIdx 0s */
+      count = getCell(CELL_EXPRESSION);
+      sPtr->contents = (UINT)count;
+      count->contents = (UINT)stuffInteger(0);
+      count = (CELL *)count->contents;
+      for(i = 1; i < maxIdx; i++)
+        {
+        count->next = stuffInteger(0);
+        count = count->next;
+        }
+      }
+
+    /* increment value at idx */
+    count = (CELL *)sPtr->contents;
+    if(count->type != CELL_EXPRESSION)
+      return(errorProcExt(ERR_LIST_EXPECTED, count));
+    count = (CELL *)count->contents;
+    for(i = 0; i < idx; i++) 
+      count = count->next;
+    if(count->type == CELL_LONG)	
+      count->contents++;  
+#ifndef NEWLISP64
+	else if(count->type == CELL_INT64)
+	  *(INT64 *)&count->aux += 1;
+#endif
+	else
+      return(errorProcExt(ERR_NUMBER_EXPECTED, count));
+    total[idx]++;
+    list = list->next;
+    } /* done category idx */
+  }
+
+totalPtr = translateCreateSymbol("total", CELL_EXPRESSION, ctx, TRUE);
+if(((CELL *)totalPtr->contents)->type == CELL_NIL)
+  {
+  count = getCell(CELL_EXPRESSION);
+  totalPtr->contents = (UINT)count;
+  count->contents = (UINT)stuffInteger(0);
+  count = (CELL *)count->contents;
+  for(i = 1; i < maxIdx; i++)
+    {
+    count->next = stuffInteger(0);
+    count = count->next;
+    }
+  }
+
+count = (CELL *)totalPtr->contents;
+if(count->type != CELL_EXPRESSION)
+    return(errorProcExt(ERR_LIST_EXPECTED, count));
+count = (CELL *)count->contents;
+for(i = 0; i < maxIdx; i++)
+  {
+  if(count->type == CELL_LONG)
+  	count->contents += total[i];
+#ifndef NEWLISP64
+  else if(count->type == CELL_INT64)
+	*(INT64 *)&count->aux += total[i];
+#endif
+  count = count->next;
+  }    
+
+return(copyCell((CELL *)totalPtr->contents));
+}
+
+/* 
+   (bayes-query L D [trueChainedBayes])
+   (bayes-query L D [trueChainedBayes] [trueFloatProbs)
+   
+   Takes a list of tokens L and a trained dictionary D and returns a list of the 
+   combined probabilities of the tokens to be in one category A versus the other 
+   categories B. All token in L should occur in D, for tokens which are not in D
+   equal probability is asssumed over categories.
+   
+   Token can be strings or symbols. If token are strings or symbols they are 
+   prepended with an underscore when looked up in D. When frequencies in D wehere 
+   learned using bayes-train, the underscore was automatically prepended during 
+   learning.
+
+   for 2 categories:
+   
+                     p(tkn|A) * p(A)
+   p(A|tkn) = ---------------------------------
+              p(tkn|A) * p(A) + p(tkn|B) * p(B)
+              
+   p(A|tkn) is the posterior for A which gets prior p(A) for the next token
+   the priors p(A) and p(B) = p(not A) = 1 are substituted after every token
+
+   for N categories:
+   
+                    p(tkn|Mc) * p(Mc)
+   p(Mc|tkn = -------------------------------    ; Mc is one of N categories
+                sum-i-N( p(tkn|Mi) * p(Mi) ) 
+              
+   
+   When in chain Bayes mode p(Mc|tkn) is the posterior for Mc and replaces
+   the prior p(Mc) for the next token. In chain Bayes mode tokens with 0 frequency 
+   in one category will effectiviely put the probability of this category to 0. 
+   This causes queries resulting in 0 probabilities for all categories to yield NaN values. 
+   
+   The pure chain Bayes mode is the more sensitive one for changes, when a token count of 0
+   occurs the resulting probability goes to a complete 0 in this category, while other
+   categories gain higher probabilities. In the Fisher's  Chi2 mode the the zero-category is 
+   still assigned a probability resulting from other tokens with non-zero counts.
+   
+   Use same or simlar total in training categries when using Fisher Chi2.
+   
+*/
+
+CELL * p_bayesQuery(CELL * params)
+{
+CELL * tokens;
+CELL * tkn;
+char * token;
+SYMBOL * ctx;
+SYMBOL * sPtr;
+SYMBOL * totPtr;
+CELL * count;
+CELL * total;
+int i, idx; 
+int nTkn = 0;   /* number of token in query */
+int maxIdx = 0; /* number of catagories */
+int N = 0;      /* total of tokens in all categories */
+int chainBayes, probFlag;
+double * priorP;
+double * postP;
+double * p_tkn_and_cat;
+double p_tkn_and_all_cat;
+double * Pchi2 = NULL;
+double * Qchi2 = NULL;
+double sumS = 1.0;
+long countNum, totalNum;
+
+CELL * result = NULL;
+CELL * cell = NULL;
+
+params = getListHead(params, &tokens);
+params = getContext(params, &ctx);
+
+chainBayes = getFlag(params);
+probFlag = getFlag(params->next);
+
+totPtr = translateCreateSymbol("total", CELL_EXPRESSION, ctx, FALSE);
+if(totPtr == NULL)  return(nilCell);
+
+total = (CELL *)totPtr->contents;
+if(total->type != CELL_EXPRESSION)
+    return(errorProcExt(ERR_LIST_EXPECTED, (CELL *)totPtr->contents));
+
+/* get number of categories maxIdx and total N for when
+   no probabilities are specified but frequencies/counts  */
+total = (CELL *)total->contents;
+while(total != nilCell)
+    {
+    if(probFlag == FALSE)
+		{
+		if(total->type == CELL_LONG)
+        	N += total->contents;
+#ifndef NEWLISP64
+		else if(total->type == CELL_INT64)
+			N += *(INT64 *)&total->aux;
+#endif
+		}
+    total = total->next;
+    maxIdx++;
+    }
+ 
+priorP = alloca(maxIdx * sizeof(double));
+postP = alloca(maxIdx * sizeof(double));
+p_tkn_and_cat = alloca(maxIdx * sizeof(double));
+if(!chainBayes)
+    {
+    Pchi2 = alloca(maxIdx * sizeof(double));
+    Qchi2 = alloca(maxIdx * sizeof(double));
+    }
+
+total = (CELL *)((CELL *)totPtr->contents)->contents;
+for(idx = 0; idx < maxIdx; idx++) 
+    {
+	if(probFlag == TRUE)
+#ifndef NEWLISP64
+    	priorP[idx] = *(double *)&total->aux; 
+#else
+		priorP[idx] = (double)total->contents;
+#endif
+	else
+		{
+		if(total->type == CELL_LONG)
+			priorP[idx] = (double)total->contents / N;
+#ifndef NEWLISP64
+		else /* INT64 */
+			priorP[idx] = (double)*(INT64 *)&total->aux / N;
+#endif
+		}
+
+/*    printf("priorP[%d]=%f\n", idx, priorP[idx]);  */
+                                    
+    total = total->next;
+    if(!chainBayes) Pchi2[idx] = Qchi2[idx] = 0.0;
+    }
+
+token = alloca(MAX_STRING + 1);
+tkn = tokens;
+while(tkn != nilCell) tkn = tkn->next, nTkn++;
+
+tkn = tokens;
+for(i = 0; i < nTkn; i++)
+    {
+    switch(tkn->type)
+      {
+      case CELL_STRING:
+        if(tkn->aux > MAX_STRING) continue;
+        *token = '_';
+        memcpy(token + 1, (char *)tkn->contents, tkn->aux);
+        break;
+      case CELL_SYMBOL:
+        strncpy(token, ((SYMBOL *)tkn->contents)->name, MAX_STRING);
+        break;
+      }
+
+    if((sPtr = lookupSymbol((char *)token, ctx)) == NULL) continue;
+    
+    count = (CELL *)sPtr->contents;
+    if(count->type != CELL_EXPRESSION) continue;
+  
+    count = (CELL *)(CELL *)count->contents;
+    total = (CELL *)((CELL *)totPtr->contents)->contents;
+      
+    p_tkn_and_all_cat = 0.0;
+    for(idx = 0; idx < maxIdx; idx++)
+        {
+        if(probFlag)
+#ifndef NEWLISP64
+			p_tkn_and_cat[idx] = *(double *)&count->aux * priorP[idx];
+#else
+			p_tkn_and_cat[idx] = *(double *)&count->contents * priorP[idx];
+#endif	
+		else /*   p(M) * p(tkn|M) */         
+			{
+			getInteger(count, (UINT *)&countNum);
+			getInteger(total, (UINT *)&totalNum);
+          	p_tkn_and_cat[idx] = priorP[idx] * countNum / totalNum;
+			}
+        
+        p_tkn_and_all_cat += p_tkn_and_cat[idx];
+/*
+        printf("token[%d] p(tkn(M) * p(tkn|M)[%d]=%lf prior[%d]=%lf\n", i, idx, 
+            (double)p_tkn_and_cat[idx], idx, priorP[idx]);
+*/
+
+        count = count->next;
+        total = total->next;
+        }  
+        
+    for(idx = 0; idx < maxIdx; idx++)
+        {
+        if(!chainBayes)
+            {
+            postP[idx] = p_tkn_and_cat[idx] / p_tkn_and_all_cat;
+            
+            priorP[idx] = 1.0 / maxIdx; /* will cancel out */
+            
+            if(postP[idx] == 0.0)
+                Qchi2[idx] += log(3e-308) * -2.0;
+            else
+                Qchi2[idx] += log(postP[idx]) * -2.0;
+                        
+            if(postP[idx] == 1.0)
+                Pchi2[idx] += log(3e-308) * -2.0;
+            else
+                Pchi2[idx] += log(1.0 - postP[idx]) * -2.0;                                                            
+            }
+        else
+            {
+            postP[idx] = p_tkn_and_cat[idx] / p_tkn_and_all_cat;
+            priorP[idx] = postP[idx];
+            }
+/*
+        printf("p_tkn_and_cat[%d] / p_tkn_and_all_cat = %lf / %lf = %lf\n", 
+          idx, p_tkn_and_cat[idx], p_tkn_and_all_cat, postP[idx]);
+*/
+        }
+        
+    tkn = tkn->next;
+    }
+    
+if(!chainBayes)
+    {
+    sumS = 0.0;
+    for(idx = 0; idx < maxIdx; idx++)
+      {
+      postP[idx] = (probChi2(Qchi2[idx],  2 * nTkn) - probChi2(Pchi2[idx],  2 * nTkn) + 1.0) / 2.0;
+      sumS += postP[idx];
+      }
+    }
+                                                
+    
+for(idx = 0; idx < maxIdx; idx++)
+    {
+    /* normalize probs from fisher's Chi2 */
+    if(!chainBayes) 
+        postP[idx] /= sumS;
+
+    if(idx == 0)
+        {
+        result = getCell(CELL_EXPRESSION);
+        result->contents = (UINT)stuffFloat(postP + idx);
+        cell = (CELL *)result->contents;
+        }
+    else
+        {
+        cell->next = stuffFloat(postP + idx);
+        cell = cell->next;
+        }
+    }
+
+return(result);
+}
+
+/*
+//
+// Copyright (C) 1992-2007 Lutz Mueller <lutz@nuevatec.com>
+// 
+// This program is free software; you can redistribute it and/or modify
+// it under the terms of the GNU General Public License version 2, 1991,
+// as published by the Free Software Foundation.
+//
+// This program is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+// 
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, write to the Free Software
+// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+//
+*/
+
+/*
+ 'unify' for Prolog like unification of s-expressions:
+  (unify '(f (g A) A) '(f B xyz)) => binds A to xyz and B to (g xyz)
+
+  variable symbols must start with an upper-case letter, variables
+  containing nil are considered unbound
+
+  after linear left to right unification each variable symbol is expanded
+  by all other variable symbols
+*/
+
+#ifdef SUPPORT_UTF8
+#include <wctype.h>
+#endif
+
+typedef struct
+	{
+	CELL * left;
+	CELL * right;
+	void * next;
+	} TERMSET;
+
+void pushSet(TERMSET * * root, CELL * left, CELL * right);
+CELL * unify(CELL * left, CELL * right);
+int unifyGetType(CELL * cell);
+void substitute(CELL * expr, CELL * sym, TERMSET * tset);
+CELL * subsym(CELL * expr, CELL * sym, CELL * cell);
+CELL * finishUnify(CELL * result);
+int occurCheck(CELL * symCell, CELL * expr);
+void printStack(TERMSET * tset);
+void freeTermSet(TERMSET * * tset);
+
+TERMSET * mgu = NULL;
+TERMSET * ws = NULL;
+
+int bindFlag;
+
+#ifdef DEBUG
+int debugFlag;
+#endif
+
+CELL * p_unify(CELL * params)
+{
+CELL * left, * right;
+CELL * envHead;
+left = evaluateExpression(params);
+params = params->next;
+right = evaluateExpression(params);
+params = params->next;
+
+if(params != nilCell)
+	{
+	params = getListHead(params, &envHead);
+	while(envHead != nilCell)
+		{
+		if(envHead->type != CELL_EXPRESSION)
+			return(errorProcExt(ERR_LIST_EXPECTED, envHead));
+		pushSet(&ws, copyCell((CELL*)envHead->contents),
+					copyCell(((CELL*)envHead->contents)->next));
+		envHead = envHead->next;
+		}
+	}
+
+bindFlag =  getFlag(params);
+
+#ifdef DEBUG
+debugFlag =  getFlag(params->next);
+if(debugFlag) printStack(ws);
+#endif
+
+return(unify(left, right));
+}
+
+#define UNIFY_ATOM 0
+#define UNIFY_LIST 1
+#define UNIFY_VAR 2
+
+void pushSet(TERMSET * * root, CELL * left, CELL * right)
+{
+TERMSET * set;
+
+set = (TERMSET *)callocMemory(sizeof(TERMSET));
+
+set->left = left;
+set->right = right;
+set->next = *root;
+*root = set;
+}
+
+void  popSet(TERMSET * * root, CELL * * left, CELL * * right)
+{
+TERMSET * set;
+
+set = *root;
+*root = set->next;
+
+*left = set->left;
+*right = set->right;
+
+free(set);
+}
+
+
+CELL * unify(CELL * left, CELL * right)
+{
+int leftType, rightType;
+CELL * lCell, * rCell;
+
+pushSet(&ws, copyCell(left), copyCell(right));
+
+while(ws != NULL)
+	{
+	popSet(&ws, &left, &right);
+
+#ifdef DEBUG
+	if(debugFlag)
+		{
+		printf("unify:");
+		printCell(left, FALSE, OUT_CONSOLE);
+		printf(" ");
+		printCell(right, FALSE, OUT_CONSOLE);
+		printf("\n");
+		}
+#endif
+
+	leftType = unifyGetType(left);
+	rightType = unifyGetType(right);
+
+	if( (leftType == UNIFY_ATOM && rightType == UNIFY_ATOM) ||
+        (left->contents == right->contents))
+		{
+		if(compareCells(left, right) == 0)
+			{
+			deleteList(left);
+			deleteList(right);
+			continue;
+			}
+		else
+			{
+			deleteList(left);
+			deleteList(right);
+			return(finishUnify(nilCell));
+			}
+		}
+
+	if(leftType == UNIFY_VAR && !occurCheck(left, right))
+		{
+		substitute(right, left, mgu); /* expand(right-expr, left-sym) in mgu set */
+		substitute(right, left, ws); /* expand(right-expr, left-sym) in  ws set */
+
+#ifdef DEBUG
+		if(debugFlag)
+			{
+			printf("ws stack\n");
+			printStack(ws);
+			}
+#endif
+		pushSet(&mgu, left, right);
+#ifdef DEBUG
+		if(debugFlag)
+			{
+			printf("mgu stack\n");
+			printStack(mgu);
+			}
+#endif
+		continue;
+		}
+
+	if(rightType == UNIFY_VAR && !occurCheck(right, left))
+		{
+		substitute(left, right, mgu); /* expand(left-expr, right-sym) in mgu set */
+		substitute(left, right, ws); /* expand(left-expr, right-sym) in ws set */
+#ifdef DEBUG
+		if(debugFlag)
+			{
+			printf("ws stack\n");
+			printStack(ws);
+			}
+#endif
+		pushSet(&mgu, right, left);
+#ifdef DEBUG
+		if(debugFlag)
+			{
+			printf("mgu stack\n");
+			printStack(mgu);
+			}
+#endif
+		continue;
+		}
+
+	if(leftType == UNIFY_LIST && rightType == UNIFY_LIST)
+		{
+#ifdef DEBUG
+		if(debugFlag)
+			{
+			printf("lists:");
+			printCell(left, FALSE, OUT_CONSOLE);
+			printf(" ");
+			printCell(right, FALSE, OUT_CONSOLE);
+			printf("\n");
+			}
+#endif
+		if(listlen((CELL*)left->contents) != listlen((CELL*)right->contents))
+			{
+			deleteList(left);
+			deleteList(right);
+			return(finishUnify(nilCell));
+			}
+		
+		lCell = (CELL*)left->contents;
+		rCell = (CELL*)right->contents;
+		while(lCell != nilCell)
+			{
+			pushSet(&ws, copyCell(lCell), copyCell(rCell));
+			lCell = lCell->next;
+			rCell = rCell->next;
+			}
+		deleteList(left);
+		deleteList(right);
+		continue;
+		}
+
+	deleteList(left);
+	deleteList(right);
+	return(finishUnify(nilCell));
+	}
+
+return(finishUnify(trueCell));
+}
+
+int unifyGetType(CELL * cell)
+{
+SYMBOL * sPtr;
+#ifdef SUPPORT_UTF8
+int wchar;
+#endif
+
+if(isSymbol(cell->type))
+	{
+    if(cell->type == CELL_SYMBOL)
+    	sPtr = (SYMBOL *)cell->contents;
+    else
+        sPtr = getDynamicSymbol(cell);
+	
+#ifndef SUPPORT_UTF8
+	return((toupper(*sPtr->name) == *sPtr->name) ? UNIFY_VAR : UNIFY_ATOM);
+#else
+    utf8_wchar(sPtr->name, &wchar);
+	return((towupper(wchar) == wchar) ? UNIFY_VAR : UNIFY_ATOM);
+#endif
+	}
+else if(isList(cell->type))
+	return(UNIFY_LIST);
+
+return(UNIFY_ATOM);
+}
+
+
+int occurCheck(CELL * symCell, CELL * expr)
+{
+CELL * cell;
+
+if(!isEnvelope(expr->type))
+	return(symCell->contents == expr->contents);
+
+cell = (CELL*)expr->contents;
+
+while(cell != nilCell)
+	{
+	if(symCell->contents == cell->contents) return(1);
+	if(isEnvelope(cell->type) && occurCheck(symCell, cell)) return(1);
+	cell = cell->next;
+	}
+
+return(0);
+}
+
+void substitute(CELL * expr, CELL * sym, TERMSET * tset)
+{
+if(tset == NULL) 
+	{
+#ifdef DEBUG
+	if(debugFlag)
+		{
+		printf("empty set in substitute %s for ", ((SYMBOL*)sym->contents)->name);
+		printCell(expr, FALSE, OUT_CONSOLE);
+		printf("\n");
+		}
+#endif
+	return;
+	}
+
+while(tset != NULL)
+    {
+#ifdef DEBUG
+	if(debugFlag)
+		{
+		printf("substitute %s for ", ((SYMBOL*)sym->contents)->name);
+		printCell(expr, FALSE, OUT_CONSOLE);
+		printf("\n");
+		printf("left:");
+		printCell(tset->left, FALSE, OUT_CONSOLE);
+		}
+#endif
+	tset->left = subsym(expr, sym, tset->left);
+#ifdef DEBUG
+	if(debugFlag)
+		{
+		printf("->");
+		printCell(tset->left, FALSE, OUT_CONSOLE);
+		printf(" right:");
+		printCell(tset->right, FALSE, OUT_CONSOLE);
+		}
+#endif
+	tset->right = subsym(expr, sym, tset->right);
+#ifdef DEBUG
+	if(debugFlag)
+		{
+		printf("->");
+		printCell(tset->right, FALSE, OUT_CONSOLE);
+		printf("\n");
+		}
+#endif
+    tset = tset->next;
+    }
+}
+
+
+CELL * subsym(CELL * expr, CELL * sym, CELL * cell)
+{
+SYMBOL * sPtr;
+CELL * sCell;
+
+sPtr = (SYMBOL *)sym->contents;
+sCell = (CELL *)sPtr->contents;
+sPtr->contents = (UINT)expr;
+
+if(isEnvelope(cell->type))
+    {
+    expr =  expand(copyCell(cell), sPtr);
+	deleteList(cell);
+    }
+else
+    {
+    if(cell->contents == (UINT)sPtr)
+		{
+		expr = copyCell(expr); 
+		deleteList(cell);
+		}
+	else
+		expr = cell;
+    }
+
+sPtr->contents = (UINT)sCell;
+return(expr);
+}
+
+CELL * finishUnify(CELL * result)
+{
+CELL * left, * right;
+CELL * list = NULL;
+CELL * assoc,  * cell = NULL;
+SYMBOL * sPtr;
+
+if(result == nilCell)
+	{
+	freeTermSet(&mgu);
+	freeTermSet(&ws);
+	return(nilCell);
+	}
+
+/* make an association list of all bound variables */
+while(mgu != NULL)
+	{
+	popSet(&mgu, &left, &right);
+
+	if(!bindFlag)
+		{
+		assoc = getCell(CELL_EXPRESSION);
+		assoc->contents = (UINT)left;
+		left->next = right;
+		if(list == NULL)
+			{
+			list = getCell(CELL_EXPRESSION);
+			list->contents = (UINT)assoc;
+			}
+		else
+			cell->next = assoc;
+		cell = assoc;
+		}
+	else
+		{
+		sPtr = (SYMBOL*)left->contents;
+		if(isProtected(sPtr->flags))
+			return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(sPtr)));
+		sPtr->contents = (UINT)right;
+		}
+
+	}
+
+freeTermSet(&ws);
+
+if(!list || bindFlag) return(getCell(CELL_EXPRESSION));
+return(list);
+}		
+
+
+void freeTermSet(TERMSET * * tset)
+{
+TERMSET * set;
+
+while(*tset != NULL)
+	{
+	set = *tset;
+	deleteList(set->left);
+	deleteList(set->right);
+	*tset = set->next;
+	free(set);
+	}
+}
+
+#ifdef DEBUG
+void printStack(TERMSET * tset)
+{
+while(tset != NULL)
+	{
+	printCell(tset->left, FALSE, OUT_CONSOLE);
+	printf("<->");
+	printCell(tset->right, FALSE, OUT_CONSOLE);
+	printf("\n");
+	tset = tset->next;
+	}
+}
+#endif
+
+/* eof */
diff --git a/nl-matrix.c b/nl-matrix.c
new file mode 100644
index 0000000..c9ab1ee
--- /dev/null
+++ b/nl-matrix.c
@@ -0,0 +1,769 @@
+/* nl-matrix.c --- matrix functions for newLISP
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+/* Since version 8.9.9 all matrix operations work on lists and 
+   arrays. Previously only lists where supported.
+*/
+
+#include "newlisp.h"
+#include "protos.h"
+
+#define TINY 1.0e-20
+
+
+double * * multiply(double ** A, double ** B, int m, int n, int k, int l);
+double * * invert(double * * A, int n, int * err);
+int ludcmp(double * * a, int n, int * indx, double * d);
+void lubksb(double * * a, int n, int * indx, double * b);
+double * * getMatrix(CELL * params, int * type, int * n, int * m, int * err, int evalFlag);
+double * * makeMatrix(CELL * number, int n, int m);
+int getDimensions(CELL * mat, int * n, int * m);
+double * * data2matrix(CELL * list, int n, int m);
+CELL * matrix2data(double * * matrix, int type, int n, int m);
+double * * allocateMatrix(int rows, int cols);
+void freeMatrix(double * * m, int rows);
+
+/* since version 7.4.8 'transpose' tramspose any matrix not only
+   matrices containing numbers.
+*/ 
+
+CELL * p_matTranspose(CELL * params)
+{
+CELL * A;
+CELL * B;
+CELL * rowA = NULL;
+CELL * cell = NULL;
+CELL * conCell;
+CELL * new;
+int n, m, i, j;
+CELL * * Brows;
+
+A = evaluateExpression(params);
+
+if(A->type == CELL_ARRAY)
+	return(arrayTranspose(A));
+
+if(A->type != CELL_EXPRESSION)
+	return(errorProcExt(ERR_NOT_MATRIX, params));
+
+if(getDimensions(A, &n, &m) == FALSE)
+    return(errorProcExt(ERR_NOT_MATRIX, params));
+    
+if(n == 0 || m == 0)
+    return(errorProcExt(ERR_WRONG_DIMENSIONS, params));
+
+Brows = allocMemory(sizeof(CELL *) * m);
+for(j = 0; j < m; j++)
+	{
+	Brows[j] = getCell(CELL_EXPRESSION);
+	if(j > 0) Brows[j-1]->next = Brows[j];
+	}
+
+B = getCell(CELL_EXPRESSION);
+B->contents = (UINT)Brows[0];
+
+for(i = 0; i < n; i++)
+	{
+	if(i == 0)
+		rowA = (CELL*)A->contents;
+	else
+		rowA = rowA->next;
+
+	if(rowA->type != CELL_EXPRESSION)
+		conCell = rowA;
+	else
+		conCell = NULL;
+
+	for(j = 0; j < m; j++)
+		{
+		if(conCell == NULL)
+			{
+			if(j == 0)
+				cell = (CELL*)rowA->contents;
+			else
+				cell = cell->next;
+			new = copyCell(cell);
+			}
+		else
+			new = copyCell(conCell);
+
+		if( i == 0)
+			Brows[j]->contents = (UINT)new;
+		else
+			Brows[j]->next = new;
+
+		Brows[j] = new;
+		}
+	}
+
+free(Brows);
+
+return(B);
+}
+
+
+CELL * p_matMultiply(CELL * params)
+{
+CELL * C;
+double * * X = NULL;
+double * * Y = NULL;
+int typeX, typeY, typeM;
+double * * M = NULL;
+int n, m, k, l;
+int err = 0;
+
+if((X = getMatrix(params, &typeX, &n, &m, &err, TRUE)) == NULL)
+	return(errorProcExt(err, params));
+
+if((Y = getMatrix(params->next, &typeY, &k, &l, &err, TRUE)) == NULL)
+	{
+	freeMatrix(X, n);
+	return(errorProcExt(err, params->next));
+	}
+
+typeM = (typeX == CELL_ARRAY || typeY == CELL_ARRAY) ? CELL_ARRAY : CELL_EXPRESSION;
+
+if(m != k)
+	err = ERR_WRONG_DIMENSIONS;
+else if((M = multiply(X, Y, n, m, k, l)) == NULL)
+	err = ERR_NOT_ENOUGH_MEMORY;
+
+freeMatrix(X, n);
+freeMatrix(Y, k);
+
+if(err) return(errorProc(err));
+
+C = matrix2data(M, typeM, n, l);
+freeMatrix(M, n);
+
+return(C);
+}
+
+CELL * p_matInvert(CELL * params)
+{
+CELL * dataY;
+int n, m, err = 0;
+int typeA;
+double * * A;
+double * * Y;
+
+if((A = getMatrix(params, &typeA, &n, &m, &err, TRUE)) == NULL)
+	return(errorProcExt(err, params));
+
+if(n != m) 
+	{
+	freeMatrix(A, n);
+	return(errorProcExt(ERR_WRONG_DIMENSIONS, params));
+	}
+
+if( (Y = invert(A, n, &err)) == NULL)
+	{
+	freeMatrix(A, n);
+	if(err) return(errorProc(err));
+	return(nilCell);
+	}
+
+dataY = matrix2data(Y, typeA, n, n);
+
+freeMatrix(A, n);
+freeMatrix(Y, n);
+
+return(dataY);
+}
+
+
+CELL * p_determinant(CELL * params)
+{
+double * * M;
+double d;
+int typeM, n, m, i, err;
+int * indx;
+
+if( (M = getMatrix(params, &typeM, &m, &n, &err, TRUE)) == NULL)
+	return(errorProcExt(err, params));
+
+if(n != m) 
+	{
+	freeMatrix(M, n);
+	return(errorProcExt(ERR_WRONG_DIMENSIONS, params));
+	}
+
+indx = (int *)calloc((n + 1), sizeof(int));
+
+if(ludcmp(M, n, indx, &d) == FALSE)
+	return(nilCell);
+
+for(i = 1; i <= n; i++)
+	d *= M[i][i];
+
+return(stuffFloat(&d));
+}
+
+
+CELL * p_matScalar(CELL * params)
+{
+CELL * param;
+double * * A = NULL;
+double * * B = NULL;
+double * * M = NULL;
+int typeA, typeB, typeC = 0;
+int type;
+int n, m, k, l, err = 0;
+
+CELL * result;
+param = params;
+param = evaluateExpression(param);
+if(param->type == CELL_SYMBOL)
+	type = *((SYMBOL *)param->contents)->name;
+else if(param->type == CELL_PRIMITIVE)
+	type = *(char *)param->aux;
+else
+	return(errorProcExt(ERR_ILLEGAL_TYPE, params));
+
+params = params->next;
+
+if( (A = getMatrix(params, &typeA, &n, &m, &err, TRUE)) == NULL)
+	return(errorProcExt(err, params));
+result = evaluateExpression(params->next);
+if(isNumber(result->type))
+	{
+	k = n, l = m;
+	if((B = makeMatrix(result, k, l)) == NULL)
+		{
+		err = ERR_NOT_ENOUGH_MEMORY;
+		goto MAT_SCALAR_FIN;
+		}
+	typeB = CELL_EXPRESSION;
+	}
+else if( (B = getMatrix(result, &typeB, &k, &l, &err, FALSE)) == NULL)
+	{
+	freeMatrix(A, n);
+	return(errorProc(err));
+	}
+
+typeC = (typeA == CELL_ARRAY || typeB == CELL_ARRAY) ? CELL_ARRAY : CELL_EXPRESSION;
+
+if(n != k || m != l)
+	err = ERR_WRONG_DIMENSIONS;
+else if((M = allocateMatrix(n, m)) == NULL)
+	err = ERR_NOT_ENOUGH_MEMORY;
+else 
+	{
+	for(k = 1; k <= n; k++)
+	 for(l = 1; l <= m; l++)
+		{
+		switch(type)
+			{
+			case '+': M[k][l] = A[k][l] + B[k][l]; break;
+			case '-': M[k][l] = A[k][l] - B[k][l]; break;
+			case '*': M[k][l] = A[k][l] * B[k][l]; break;
+			case '/': 
+				{ 
+				if(B[k][l] == 0)
+					return(errorProc(ERR_MATH));
+				else
+					M[k][l] = A[k][l] / B[k][l];
+				}
+				break;
+			default:
+            return(errorProcExt(ERR_ILLEGAL_TYPE, params));
+			}
+		}
+}
+
+MAT_SCALAR_FIN:
+freeMatrix(A, n);
+freeMatrix(B, n);
+if(err) return (errorProc(err));
+
+result = matrix2data(M, typeC, n, m);
+freeMatrix(M, n);
+
+return(result);
+}
+
+
+/* ------------------- C = A*B, A and B unchanged --------------------- */
+
+double * * multiply(double ** A, double ** B, int n, int m, int k, int l)
+{
+double * * C;
+int i, j, s;
+double sum;
+
+if((C = allocateMatrix(n, l)) == NULL)
+	return(NULL);
+
+if(m != k)
+	{
+	errorProc(ERR_WRONG_DIMENSIONS);
+	return(NULL);
+	}
+
+for(i = 1; i <= n; i++)
+	{
+	for(j = 1; j <= l; j++)
+		{
+		sum = 0.0;
+		for(s = 1; s <= m; s++)
+			sum += A[i][s] * B[s][j];
+
+		C[i][j] = sum;
+		}
+	}
+
+return(C);
+}
+
+
+/* ----- return inverse of A in Y, A will contain LU decomposition --- */
+
+double * * invert(double * * A, int n, int * err)
+{
+double * * Y = NULL;
+double * col;
+double d;
+int i, j;
+int * indx;
+
+
+col = (double *)calloc(n + 4, sizeof(double));
+indx = (int *)calloc((n + 1), sizeof(int));
+
+if(ludcmp(A, n, indx, &d) == FALSE)
+	goto INVERT_FIN;
+
+if((Y = allocateMatrix(n, n)) == NULL)
+	{
+	*err = ERR_NOT_ENOUGH_MEMORY;
+	goto INVERT_FIN;
+	}
+
+for(j = 1; j <= n; j++)
+	{
+	for(i = 1; i <= n; i++) col[i] = 0.0;
+	col[j] = 1.0;
+	lubksb(A, n, indx, col);
+	for(i = 1; i <= n; i++) Y[i][j] = col[i];
+	}
+
+INVERT_FIN:
+free(col);
+free(indx);
+
+return(Y);
+}
+
+
+/* ------------------------- LU decomposition --------------------------- 
+// algorithms ludcmp() and lubskb() adapted from:
+// Numerical Recipes in 'C', 2nd Edition
+// W.H. Press, S.A. Teukolsky
+// W.T. Vettering, B.P. Flannery
+*/
+
+int ludcmp(double * * a, int n, int * indx, double * d)
+{
+int i, imax = 0, j, k;
+double big, dum, sum, temp;
+double * vv;
+
+vv = (double *)calloc(n + 4, sizeof(double));
+*d = 1.0;
+
+/* find abs biggest number in each row and put 1/big in vector */
+for (i = 1; i <= n; i++)
+	{
+	big = 0.0;
+	for(j = 1;j <= n; j++)
+		if ((temp = fabs(a[i][j])) > big) big = temp;
+
+	if(big == 0.0)
+		{
+		free(vv);
+		return(FALSE);
+		}
+
+	vv[i] = 1.0 / big;
+	}
+
+for (j = 1; j <= n; j++)
+	{
+	for (i = 1; i < j; i++)
+		{
+		sum = a[i][j];
+		for(k = 1; k < i; k++) sum -= a[i][k] * a[k][j];
+		a[i][j] = sum;
+		}
+	big = 0.0;
+
+	for (i = j; i <= n; i++)
+		{
+		sum = a[i][j];
+		for(k = 1; k < j; k++)
+			sum -= a[i][k] * a[k][j];
+		a[i][j] = sum;
+
+		if ( (dum = vv[i] * fabs(sum)) >= big)
+			{
+			big = dum;
+			imax = i;
+			}
+		}
+
+	if (j != imax)
+		{
+		for (k = 1; k <= n; k++)
+			{
+			dum = a[imax][k];
+			a[imax][k] = a[j][k];
+			a[j][k] = dum;
+			}
+
+		*d = -(*d);
+		vv[imax] = vv[j];
+		}
+
+
+	indx[j] = imax;
+	if (a[j][j] == 0.0) a[j][j] = TINY;
+
+	if (j != n)
+		{
+		dum = 1.0 / (a[j][j]);
+		for(i = j+1; i <= n; i++) a[i][j] *= dum;
+		}
+	}
+
+free(vv);
+return(TRUE);
+}
+
+
+void lubksb(double * * a, int n, int * indx, double * b)
+{
+int i, ii = 0, ip, j;
+double sum;
+
+for (i = 1; i <= n; i++)
+	{
+	ip = indx[i];
+	sum = b[ip];
+	b[ip] = b[i];
+	if (ii)
+		for(j = ii; j <= i-1; j++) sum -= a[i][j] * b[j];
+	else
+		if(sum) ii = i;
+	b[i] = sum;
+	}
+
+for (i = n; i >= 1; i--)
+	{
+	sum = b[i];
+	for(j = i+1; j <= n; j++) sum -= a[i][j] * b[j];
+	b[i] = sum / a[i][i];
+	}
+}
+
+/* ------------ make a matrix from list or array expr ----------- */
+
+double * * getMatrix(CELL * params, int * type, int * n, int * m, int *err, int evalFlag)
+{
+CELL * data;
+double * * M;
+
+if(evalFlag)
+	data = evaluateExpression(params);
+else
+	data = params;
+
+if(data->type != CELL_EXPRESSION && data->type != CELL_ARRAY)
+	{
+	*err = ERR_NOT_MATRIX;
+	return(NULL);
+	}
+
+*type = data->type;
+
+if(getDimensions(data, n, m) == FALSE)
+	{
+    *err = ERR_NOT_MATRIX;
+	return(NULL);
+	}
+
+if( (M = data2matrix(data, *n, *m)) == NULL)
+	{
+	*err = ERR_NOT_ENOUGH_MEMORY;
+	return(NULL);
+	}
+
+return(M);
+}
+
+double * * makeMatrix(CELL * number, int n, int m)
+{
+double s;
+double * * matrix;
+int i, j;
+
+#ifndef NEWLISP64
+if(number->type == CELL_FLOAT)
+	s = *(double *)&number->aux;
+else if(number->type == CELL_INT64)
+	s = *(INT64 *)&number->aux;
+#else
+if(number->type == CELL_FLOAT)
+	s = *(double *)&number->contents;
+#endif
+else
+	s = number->contents;
+
+if((matrix = allocateMatrix(n, m)) == NULL)
+	return(NULL);
+
+for(i = 1; i <= n; i++)
+	for(j = 1; j <= m; j++)
+		matrix[i][j] = s;
+
+return(matrix);
+}
+
+/* --------------------------- get dimensons or a matrix --------------- */
+
+int getDimensions(CELL * mat, int * n, int * m)
+{
+CELL * row;
+CELL * cell;
+int rows, cols;
+CELL * * addr;
+
+if(mat->type == CELL_ARRAY)
+	{
+	addr = (CELL * *)mat->contents;
+	*n = (mat->aux - 1) / sizeof(CELL *);
+	cell = *addr;
+	if(cell->type != CELL_ARRAY)
+		{
+		errorProcExt(ERR_WRONG_DIMENSIONS, mat);
+		return(FALSE);
+		}
+	*m = (cell->aux - 1) / sizeof(CELL *);
+	return(TRUE);
+	}
+
+/* mat->type is CELL_EXPRESSSION */
+
+row = (CELL *)mat->contents;
+if(row->type != CELL_EXPRESSION)
+	{
+	errorProcExt(ERR_NOT_MATRIX, mat);
+	return(FALSE);
+	}
+
+cell = (CELL *)row->contents;
+
+rows = cols = 0;
+while(row != nilCell)
+	{
+	++rows;
+	row = row->next;
+	}
+
+while(cell != nilCell)
+	{
+	++cols;
+	cell = cell->next;
+	}
+
+if(rows == 0 || cols == 0)
+	{
+	errorProcExt(ERR_WRONG_DIMENSIONS, mat);
+	return(FALSE);
+	}
+
+*n = rows;
+*m = cols;
+
+return(TRUE);
+}
+
+
+/* ------------ copy array/list into a matrix of doubles -------- */
+
+
+/* xlate lists or arrays into C arrays with 1-offest for 1st element
+wrong row type result and missing row elelements result on 0.0 */
+double * * data2matrix(CELL * list, int n, int m)
+{
+double ** matrix;
+CELL * row;
+CELL * cell;
+int i, j, size;
+CELL * * addr;
+CELL * * rowAddr;
+
+if((matrix = allocateMatrix(n, m)) == NULL)
+	return(NULL);
+
+if(list->type == CELL_ARRAY)
+	{
+	addr = (CELL * *)list->contents;	
+	for(i = 1; i <= n; i++)
+		{
+		row = *(addr + i - 1);
+		if(row->type != CELL_ARRAY)
+			{
+			for(j = 1; j <= m; j++) matrix[i][j] = 0.0;
+			continue;
+			}
+		rowAddr = (CELL * *)row->contents;
+		size = (row->aux - 1)/sizeof(CELL *);
+		for(j = 1; j <= m; j++)
+			{
+			if(j <= size)
+				matrix[i][j] = getDirectFloat((CELL *)*(rowAddr + j - 1));
+			else matrix[i][j] = 0.0;
+			}
+		}
+	return(matrix);
+	}
+
+/* list->type == CELL_EXPRESSION */
+
+row = (CELL *)list->contents;
+for(i = 1; i <= n; i++)
+	{
+	if(row->type != CELL_EXPRESSION)
+		for(j = 1; j <= m; j++) matrix[i][j] = 0.0;
+	else
+		{
+		cell = (CELL *)row->contents;
+		for(j = 1; j <= m; j++)
+			{
+			matrix[i][j] = getDirectFloat(cell);
+			cell = cell->next;
+			}
+		}
+	row = row->next;
+	}
+
+return(matrix);
+}
+
+
+/* ------- allocate an array/list and copy matrix into it ---- */
+
+CELL * matrix2data(double ** matrix, int type, int n, int m)
+{
+CELL * list;
+CELL * row;
+CELL * cell;
+int i, j;
+double fnum;
+CELL * * addr;
+CELL * * rowAddr;
+
+list = getCell(type);
+
+if(type == CELL_EXPRESSION)
+	{
+	row = getCell(CELL_EXPRESSION);
+	list->contents = (UINT)row;
+	for(i = 1; i <= n; i++)
+		{
+		cell = getCell(CELL_FLOAT);
+		row->contents = (UINT)cell;
+		for(j = 1; j <= m; j++)
+			{
+			fnum = matrix[i][j];
+#ifndef NEWLISP64
+			*(double *)&cell->aux = fnum;
+#else
+			*(double *)&cell->contents = fnum;
+#endif
+			if(j == m) break;
+			cell->next = getCell(CELL_FLOAT);
+			cell = cell->next;
+			}
+		if(i == n) break;
+		row->next = getCell(CELL_EXPRESSION);
+		row = row->next;
+		}
+	}
+
+else /* type is CELL_ARRAY */
+	{
+	list->aux = n * sizeof(CELL *) + 1;
+	addr = (CELL * *)allocMemory(list->aux);
+	list->contents = (UINT)addr;
+
+	for(i = 1; i <= n; i++)
+		{
+		cell = getCell(CELL_ARRAY);
+		cell->aux = m * sizeof(CELL *) + 1;
+		rowAddr = (CELL * *)allocMemory(cell->aux);
+		cell->contents = (UINT)rowAddr;
+		*(addr + i -1) = cell;
+		for(j = 1; j <= m; j++)
+			{
+			fnum = matrix[i][j];
+			*(rowAddr + j - 1) = stuffFloat(&fnum);
+			}
+		}
+	}
+
+return(list);
+}
+
+
+/* ------------------------ allocate/free a matrix ----------------- */
+
+double * * allocateMatrix(int rows, int cols)
+{
+int i;
+double * * m;
+
+m = (double **) calloc(rows + 1, sizeof(double *));
+if (!m)
+	return(NULL);
+
+for(i = 1; i <= rows; i++)
+	{
+	m[i] = (double *)calloc(cols + 1, sizeof(double));
+	if (!m[i])
+		return(NULL);
+	}
+
+return(m);
+}
+
+
+void freeMatrix(double * * m, int rows)
+{
+int i;
+
+if(m == NULL) return;
+
+for(i = 1; i <= rows; i++)
+	free(m[i]);
+
+free(m);
+}
+
+/* end of file */
diff --git a/nl-sock.c b/nl-sock.c
new file mode 100644
index 0000000..2fdcf0a
--- /dev/null
+++ b/nl-sock.c
@@ -0,0 +1,2161 @@
+/* nl-sock.c
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+/* this file is in the process of beeing ifdeffed to IPv6, but not completed yet
+
+in the makefile_xxx add -DIPV6 in the CC compile flags
+
+*/
+
+#ifdef IPV6
+#define ADDR_TYPE AF_INET6
+#define ICMP_TYPE IPPROTO_ICMPV6
+#else
+#define ADDR_TYPE AF_INET
+#define ICMP_TYPE IPPROTO_ICMP
+#endif
+
+#include "newlisp.h"
+#include <string.h>
+
+#ifdef WIN_32
+#include <winsock2.h>
+#include <ws2tcpip.h>
+#define fdopen win32_fdopen
+#define SHUT_RDWR 2
+#define gethostbyname2(A, B) gethostbyname(A)
+#else
+#include <sys/types.h>
+#include <sys/time.h>
+#include <sys/socket.h>
+#include <sys/un.h>
+#include <sys/ioctl.h>
+#include <sys/wait.h>
+#include <netinet/in_systm.h>
+#include <netinet/in.h>
+#include <netinet/ip.h>
+#include <netinet/ip_icmp.h>
+#include <netinet/icmp6.h>
+#include <netdb.h>
+#include <arpa/inet.h>
+#endif
+
+#ifdef SOLARIS
+#include <stropts.h>
+#include <sys/conf.h>
+#include <netinet/in_systm.h>
+#define gethostbyname2(A, B) gethostbyname(A)
+#ifndef TRU64
+#define FIONREAD I_NREAD
+#endif
+#endif
+
+#ifdef OS2 
+#define socklen_t int 
+#define SHUT_RDWR 2 
+#endif 
+
+#ifndef INADDR_NONE
+#define INADDR_NONE (unsigned) -1
+#endif
+
+#ifndef AF_UNIX
+#define AF_UNIX PF_UNIX
+#endif
+
+#ifndef SUN_LEN
+#define SUN_LEN(su) \
+    (sizeof(*(su)) - sizeof((su)->sun_path) + strlen((su)->sun_path))
+#endif
+
+#include "protos.h"
+
+#define MAX_PENDING_CONNECTS 128
+#define NO_FLAGS_SET 0
+
+#ifdef WIN_32
+#define socklen_t int
+#define close closesocket
+#else
+#define SOCKET_ERROR -1
+#define INVALID_SOCKET -1
+#endif
+
+
+#define ERR_INET_OPEN_SOCKET 1
+#define ERR_INET_HOST_UNKNOWN 2
+#define ERR_INET_INVALID_SERVICE 3
+#define ERR_INET_CONNECT_FAILED 4
+#define ERR_INET_ACCEPT 5
+#define ERR_INET_CONNECTION_DROPPED 6
+#define ERR_INET_CONNECTION_BROKEN 7
+#define ERR_INET_READ 8
+#define ERR_INET_WRITE 9
+#define ERR_INET_CANNOT_BIND 10
+#define ERR_INET_TOO_MUCH_SOCKETS 11
+#define ERR_INET_LISTEN_FAILED 12
+#define ERR_INET_BAD_FORMED_IP 13
+#define ERR_INET_SELECT_FAILED 14
+#define ERR_INET_PEEK_FAILED 15
+#define ERR_INET_NOT_VALID_SOCKET 16
+#define ERR_INET_TIMEOUT 17
+#define MAX_NET_ERROR 17
+
+#define isnum(A) ((A)>= '0' && (A) <= '9')
+
+typedef struct
+    {
+    int socket;
+	int family;
+    void * next;
+    } INET_SESSION;
+
+INET_SESSION * netSessions = NULL;
+
+int deleteInetSession(int sock);
+int getSocketFamily(int sock);
+
+#define READY_READ 0
+#define READY_WRITE 1
+
+int errorIdx = 0;
+
+extern int logTraffic;
+extern int noPromptMode;
+
+/* with MinGW gcc 3.4.5 not needed
+#ifdef WIN_32
+struct timezone {
+       int     tz_minuteswest;
+       int     tz_dsttime;
+};
+int gettimeofday(struct timeval * tv, struct timezone * tz);
+#endif
+*/
+
+
+/********************** session functions *******************/
+
+int createInetSession(int sock, int family)
+{
+INET_SESSION * iSession;
+
+iSession = (INET_SESSION *)malloc(sizeof(INET_SESSION));
+
+iSession->socket = sock;
+iSession->family = family;
+
+if(netSessions == NULL)
+    {
+    netSessions = iSession;
+    iSession->next = NULL;
+    }
+else
+    {
+    iSession->next = netSessions;
+    netSessions = iSession;
+    }
+return(TRUE);
+}
+
+int deleteInetSession(int sock)
+{
+INET_SESSION * session;
+INET_SESSION * previous;
+
+if(netSessions == NULL)
+    return(0);
+else
+    session = previous = netSessions;
+
+while(session)
+    {
+    if(session->socket == sock)
+        {
+        if(session == netSessions)
+            netSessions = session->next;
+        else
+            previous->next = session->next;
+        free((char *)session);
+        return(TRUE);
+        }
+    previous = session;
+    session = session->next;
+    }
+
+return(FALSE);
+}
+
+
+int getSocketFamily(int sock)
+{
+INET_SESSION * session;
+
+session = netSessions;
+
+while(session)
+    {
+	if(session->socket == sock)
+		return(session->family);
+    session = session->next;
+    }
+
+return(-1);
+}
+
+/********************* user functions **************************/
+
+
+CELL * p_netClose(CELL * params) 
+{
+UINT sock; 
+ 
+getInteger(params, &sock); 
+deleteInetSession((int)sock);
+
+if(!getFlag(params->next))
+	shutdown(sock, SHUT_RDWR);
+
+if(close((int)sock) == SOCKET_ERROR)
+    return(netError(ERR_INET_NOT_VALID_SOCKET));
+
+errorIdx = 0;
+return(trueCell);
+}
+
+
+CELL * p_netSessions(CELL * params)
+{
+INET_SESSION * session;
+INET_SESSION * sPtr;
+CELL * sList;
+CELL * last;
+
+session = netSessions;
+sList = getCell(CELL_EXPRESSION);
+last = NULL;
+
+while(session)
+    {
+    sPtr = session;
+    session = session->next;
+    if(last == NULL)
+        {
+        last = stuffInteger(sPtr->socket);
+        sList->contents = (UINT)last;
+        }
+    else
+        {
+        last->next = stuffInteger(sPtr->socket);
+        last = last->next;
+        }
+    }
+
+return(sList);
+}
+
+
+
+/*********************************************************************/
+
+CELL * p_netService(CELL * params) 
+{
+struct servent * pSe; 
+char * service; 
+char * protocol; 
+int port; 
+ 
+params = getString(params, &service); 
+getString(params, &protocol); 
+ 
+if((pSe = getservbyname(service, protocol)) == NULL) 
+    return(netError(ERR_INET_INVALID_SERVICE)); 
+ 
+port = (int)ntohs(pSe->s_port); 
+ 
+errorIdx = 0; 
+return(stuffInteger((UINT)port)); 
+} 
+
+
+CELL * p_netConnect(CELL * params)
+{
+UINT ttl = 3;
+char * remoteHostName; 
+int type; 
+UINT portNo;
+char * protocol = NULL;
+int sock;
+
+params = getString(params, &remoteHostName); 
+#ifndef WIN_32
+if(params == nilCell)
+	{
+	if((sock = netConnectLocal(remoteHostName)) == SOCKET_ERROR)
+		return(netError(errorIdx));
+	else	
+		return(stuffInteger((UINT)sock));
+	}
+#endif
+
+params = getInteger(params, &portNo);
+
+type = SOCK_STREAM;
+if(params != nilCell)
+    {
+    params = getString(params, &protocol);
+    *protocol = toupper(*protocol);
+    type = SOCK_DGRAM;
+    if(*protocol == 'M')
+        {
+        if(params != nilCell)
+            getInteger(params, &ttl);
+        }
+    }
+
+if((sock = netConnect(remoteHostName, (int)portNo, type, protocol, (int)ttl)) == SOCKET_ERROR)
+    return(netError(errorIdx));
+
+createInetSession(sock, AF_INET);
+
+errorIdx = 0;
+return(stuffInteger((UINT)sock)); 
+}
+
+
+#ifndef WIN_32
+/* create local domain UNIX socket */
+int netConnectLocal(char * path)
+{
+int sock;
+struct sockaddr_un remote_sun;
+
+if((sock = socket(AF_UNIX, SOCK_STREAM, 0)) == SOCKET_ERROR)
+	{
+	errorIdx = ERR_INET_OPEN_SOCKET;
+	return(SOCKET_ERROR);
+	}
+	
+remote_sun.sun_family = AF_UNIX;
+strncpy(remote_sun.sun_path, path, sizeof(remote_sun.sun_path) - 1);
+remote_sun.sun_path[sizeof (remote_sun.sun_path) - 1] = '\0';
+if (connect(sock, (struct sockaddr *)&remote_sun, SUN_LEN(&remote_sun)) == -1) 
+	{
+	close(sock);
+	errorIdx = ERR_INET_CONNECT_FAILED;
+	return(SOCKET_ERROR);
+    }
+
+createInetSession(sock, AF_UNIX);
+
+errorIdx = 0;
+return(sock); 
+}
+#endif
+
+/* create internet socket */
+int netConnect(char * remoteHostName, int portNo, int type, char * prot, int ttl)
+{
+#ifdef IPV6
+struct sockaddr_in6 dest_sin;
+struct in6_addr iaddr;
+#else
+struct sockaddr_in dest_sin;
+struct in_addr iaddr;
+#endif
+struct hostent * pHe;
+int sock, idx;
+/* char opt; */
+int opt;
+
+/* create socket */
+if((sock = socket(ADDR_TYPE, type, 0)) == INVALID_SOCKET)
+    {
+    errorIdx = ERR_INET_OPEN_SOCKET;
+    return(SOCKET_ERROR);
+    }
+
+if(prot != NULL) if(*prot == 'M' || *prot == 'B')
+    {
+    memset(&iaddr, 0, sizeof(iaddr));
+#ifdef IPV6
+	/* iaddr = IN6ADDR_ANY_INIT; */
+	iaddr = in6addr_any;
+#else
+    iaddr.s_addr = INADDR_ANY;
+#endif
+
+    if(*prot == 'M')
+        {
+        setsockopt(sock, 0, IP_MULTICAST_IF, (const void *)&iaddr, sizeof(iaddr));
+        opt = ttl;
+        setsockopt(sock, 0, IP_MULTICAST_TTL, (const void *)&opt, sizeof(opt));
+        }
+
+    if(*prot == 'B')
+        {
+        opt = 1;
+        setsockopt(sock, SOL_SOCKET, SO_BROADCAST, (const void *)&opt, sizeof(opt));
+        }
+    }
+
+if((pHe = gethostbyname2(remoteHostName, ADDR_TYPE)) == NULL)
+    {
+    errorIdx = ERR_INET_HOST_UNKNOWN;
+    return(SOCKET_ERROR);
+    }
+
+for(idx = 0; ; idx++)
+    {
+#ifdef IPV6
+    memcpy((char *)&(dest_sin.sin6_addr), pHe->h_addr_list[idx], pHe->h_length);
+    dest_sin.sin6_port = htons((u_short)portNo);
+    dest_sin.sin6_family = AF_INET6;
+#else
+    memcpy((char *)&(dest_sin.sin_addr), pHe->h_addr_list[idx], pHe->h_length);
+    dest_sin.sin_port = htons((u_short)portNo);
+    dest_sin.sin_family = AF_INET;
+	memset(&(dest_sin.sin_zero), '\0', sizeof(dest_sin.sin_zero));
+#endif
+    if(connect(sock,(struct sockaddr *)&dest_sin, sizeof(dest_sin)) == 0)
+        break;
+
+    if(pHe->h_addr_list[idx+1] != NULL)
+        continue;
+
+    close(sock);
+    errorIdx = ERR_INET_CONNECT_FAILED;
+    return(SOCKET_ERROR);
+    }
+
+errorIdx = 0;
+return(sock);
+}
+
+/********* should be called after listen/accept notification **********/
+
+CELL * p_netAccept(CELL * params) 
+{
+int sock;
+UINT listenSock;
+
+getInteger(params, &listenSock); 
+
+if((sock = netAccept((int)listenSock)) == INVALID_SOCKET)
+    return(netError(ERR_INET_ACCEPT));
+
+return(stuffInteger(sock)); 
+}
+
+
+int netAccept(int listenSock)
+{
+int sock, family;
+#ifdef IPV6
+struct sockaddr_in6 dest_sin;
+#else
+struct sockaddr_in dest_sin;
+#endif
+#ifndef WIN_32
+struct sockaddr_un dest_sun;
+#endif
+socklen_t dest_slen;
+
+family = getSocketFamily(listenSock);
+
+#ifndef WIN_32
+if(family == AF_UNIX)
+	{
+	dest_slen = sizeof(struct sockaddr_un);
+	sock = accept(listenSock, (struct sockaddr *) &dest_sun,  &dest_slen);
+	}
+else
+#endif
+	{
+#ifdef IPV6
+	dest_slen = sizeof(struct sockaddr_in6);
+#else
+	dest_slen = sizeof(struct sockaddr_in);
+#endif
+	sock = accept(listenSock, (struct sockaddr *) &dest_sin, (void *)&dest_slen);
+	}
+
+if(sock != INVALID_SOCKET) 
+    {
+    createInetSession(sock, family);
+    errorIdx = 0;
+    }
+
+return(sock);
+}
+
+
+/******************* returns remote IP and port number *************/
+
+#define LOCAL_INFO 0
+#define PEER_INFO 1
+
+
+int getPeerName(int sock, int peerLocalFlag, char * IPaddress)
+{
+socklen_t address_sin_len; 
+#ifdef IPV6
+struct sockaddr_in6 address_sin; 
+#else
+struct sockaddr_in address_sin; 
+#endif
+
+if(getSocketFamily(sock) == AF_UNIX)
+	{
+	snprintf(IPaddress, 6, "local");
+	return(0);
+	}
+
+*IPaddress = 0;
+address_sin_len = sizeof(address_sin); 
+if(peerLocalFlag == LOCAL_INFO) 
+    { 
+    if(getsockname(sock,  
+        (struct sockaddr *)&address_sin, (void *)&address_sin_len) 
+            == SOCKET_ERROR) 
+        return(0); 
+    } 
+else 
+    { 
+    if(getpeername(sock,  
+        (struct sockaddr *)&address_sin, (void *)&address_sin_len) 
+            == SOCKET_ERROR) 
+        return(0); 
+    } 
+ 
+/* return address IP number  */
+#ifdef IPV6
+inet_ntop(AF_INET6, &address_sin.sin6_addr, IPaddress, 40); 
+return(ntohs(address_sin.sin6_port));
+#else
+snprintf(IPaddress, 16, inet_ntoa(address_sin.sin_addr)); 
+return(ntohs(address_sin.sin_port));
+#endif
+}
+
+
+CELL * p_netLocal(CELL * params) 
+{
+return(netPeerLocal(params, LOCAL_INFO));
+}
+
+CELL * p_netPeer(CELL * params)
+{
+return(netPeerLocal(params, PEER_INFO));
+}
+
+
+CELL * netPeerLocal(CELL * params, int peerLocalFlag) 
+{ 
+CELL * result; 
+CELL * cell; 
+#ifdef IPV6
+char name[40];
+#else
+char name[16];
+#endif
+UINT addressPort, sock;
+
+getInteger(params, &sock); 
+if((addressPort = getPeerName((int)sock, peerLocalFlag, name)) == SOCKET_ERROR)
+    return(nilCell);
+ 
+result = getCell(CELL_EXPRESSION); 
+result->contents = (UINT)stuffString(name); 
+cell = (CELL *)result->contents; 
+cell->next = stuffInteger((UINT)addressPort); 
+ 
+errorIdx = 0; 
+return(result); 
+} 
+ 
+
+CELL * p_netLookup(CELL * params)
+{
+#ifdef IPV6
+struct sockaddr_in6 address;
+#else
+union ipSpec 
+    {
+    unsigned int no;
+    unsigned char chr[4];
+    } ip;
+
+struct sockaddr_in address;
+#endif
+struct hostent * pHe;
+char * hostString;
+char IPaddress[16];
+int forceByName = 0;
+
+params = getString(params, &hostString);
+forceByName = getFlag(params);
+
+/* get hostname from ip-number */
+#ifdef IPV6
+if((isDigit((unsigned char)*hostString) || (hostString[0] == ':')) && !forceByName)
+	{
+	if(inet_pton(AF_INET6, hostString, &address.sin6_addr) == 0)
+        return(netError(ERR_INET_BAD_FORMED_IP));
+
+	if((pHe = gethostbyaddr(&address.sin6_addr, AF_INET6, PF_INET6)) == NULL)
+		return(nilCell);
+
+    return(stuffString((char *)pHe->h_name));
+	}
+#else
+if(isDigit((unsigned char)*hostString) && !forceByName)
+    {
+    if((ip.no = inet_addr(hostString)) == INADDR_NONE)
+        return(netError(ERR_INET_BAD_FORMED_IP));
+
+    if((pHe = gethostbyaddr((char *) &ip.no,4,PF_INET)) == NULL)
+        return(nilCell);
+
+    return(stuffString((char *)pHe->h_name));
+    }
+#endif
+
+/* get ip-number from hostname */
+if((pHe = gethostbyname2(hostString, ADDR_TYPE)) == NULL)
+    return(nilCell);
+
+#ifdef IPV6
+memcpy((char *)&(address.sin6_addr), pHe->h_addr_list[0], pHe->h_length);
+inet_ntop(AF_INET6, &address.sin6_addr, IPaddress, 40); 
+#else
+memcpy((char *)&(address.sin_addr), pHe->h_addr_list[0], pHe->h_length);
+snprintf(IPaddress, 16, inet_ntoa(address.sin_addr));
+#endif
+
+errorIdx = 0;
+return(stuffString(IPaddress));
+}
+
+CELL * netReceive(int sock, SYMBOL * readSymbol, size_t readSize, CELL * params);
+
+CELL * p_netReceive(CELL * params) 
+{ 
+UINT sock;
+SYMBOL * readSymbol;
+size_t readSize;
+
+params = getInteger(params, &sock);
+params = getSymbol(params, &readSymbol);
+params = getInteger(params, (UINT *)&readSize);
+
+return(netReceive((int)sock, readSymbol, readSize, params));
+}
+
+CELL * netReceive(int sock, SYMBOL * readSymbol, size_t readSize, CELL * params)
+{
+char * waitFor;
+ssize_t bytesReceived;
+size_t length;
+int found;
+STREAM netStream;
+char chr;
+CELL * cell;
+
+if(isProtected(readSymbol->flags))
+    return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(readSymbol)));
+
+memset(&netStream, 0, sizeof(netStream));
+
+if(params == nilCell)
+    {
+    openStrStream(&netStream, readSize, 0);
+    found = 1;
+    bytesReceived  = recv(sock, netStream.buffer, readSize, NO_FLAGS_SET);
+    }
+else
+    {
+    getString(params, &waitFor);
+    openStrStream(&netStream, MAX_LINE, 0);
+    found = bytesReceived = 0;
+    length = strlen(waitFor);
+    while(bytesReceived < (int)readSize)
+        {
+        if(recv(sock, &chr, 1, NO_FLAGS_SET) <= 0)
+            {
+            bytesReceived = 0;
+            break;
+            }
+        writeStreamChar(&netStream, chr); 
+         if(++bytesReceived < length) continue;
+        if(strncmp(waitFor,  netStream.ptr - length, length) == 0)
+             {
+            found = 1;
+            break;
+            }        
+        }
+            
+    }
+
+if(bytesReceived == 0 || found == 0) 
+    { 
+    closeStrStream(&netStream); 
+    deleteInetSession(sock); 
+    close(sock); 
+    return(netError(ERR_INET_CONNECTION_DROPPED)); 
+    } 
+
+if(bytesReceived == SOCKET_ERROR) 
+    { 
+    closeStrStream(&netStream);         
+    deleteInetSession(sock); 
+    close(sock); 
+    return(netError(ERR_INET_READ)); 
+    } 
+  
+cell = stuffStringN(netStream.buffer, bytesReceived);
+closeStrStream(&netStream);
+
+deleteList((CELL *)readSymbol->contents); 
+readSymbol->contents = (UINT)cell; 
+ 
+errorIdx = 0; 
+return(stuffInteger(bytesReceived)); 
+} 
+
+
+
+CELL * netReceiveFrom(int sock, size_t readSize, int closeFlag)
+{
+int portNo;
+char * buffer;
+ssize_t bytesReceived;
+#ifdef IPV6
+struct sockaddr_in6 remote_sin;
+#else
+struct sockaddr_in remote_sin;
+#endif
+CELL * cell;
+CELL * result;
+#ifdef WIN_32
+int remote_sin_len;
+#else
+#ifdef TRU64
+unsigned long remote_sin_len;
+#else
+socklen_t remote_sin_len;
+#endif
+#endif
+char IPaddress[16];
+
+buffer = (char *)allocMemory(readSize + 1);
+remote_sin_len = sizeof(remote_sin);
+memset(&remote_sin, 0, sizeof(remote_sin));
+
+bytesReceived = recvfrom(sock, buffer, readSize, 0, 
+    (struct sockaddr *)&remote_sin, &remote_sin_len);
+
+if(bytesReceived == SOCKET_ERROR) 
+    {
+    freeMemory(buffer);
+    close(sock); 
+    return(netError(ERR_INET_READ)); 
+    }
+
+#ifdef IPV6
+inet_ntop(AF_INET6, &remote_sin.sin6_addr, IPaddress, 40); 
+portNo = ntohs(remote_sin.sin6_port);
+#else
+snprintf(IPaddress, 16, inet_ntoa(remote_sin.sin_addr)); 
+portNo = ntohs(remote_sin.sin_port);
+#endif
+
+
+cell = result = getCell(CELL_EXPRESSION);
+cell->contents = (UINT)stuffStringN(buffer, bytesReceived);
+cell = (CELL *)cell->contents;
+cell->next = stuffString(IPaddress);
+((CELL*)cell->next)->next = stuffInteger(portNo);
+
+freeMemory(buffer);
+
+if(closeFlag) close(sock);
+
+errorIdx = 0;
+return(result);
+}
+
+
+CELL * p_netReceiveUDP(CELL * params) 
+{ 
+UINT portNo;
+int sock;
+size_t readSize;
+INT64 wait = 0;
+INT64 elapsed;
+char * ifaddr = NULL;
+
+params = getInteger(params, &portNo);
+params = getInteger(params, (UINT *)&readSize);
+if(params != nilCell)
+    {
+    params = getInteger64(params, &wait);
+    if(params != nilCell)
+        getString(params, &ifaddr);
+    }
+
+if((sock = netListenOrDatagram((int)portNo, SOCK_DGRAM, ifaddr, NULL)) == SOCKET_ERROR)
+    return(nilCell);
+
+/* if timeout parameter given wait for socket to be readable */
+if(wait > 0)
+        {
+        if((elapsed = wait_ready(sock, wait, READY_READ)) <= 0)
+                {
+                close(sock);
+				if(elapsed == 0) return(netError(ERR_INET_TIMEOUT));
+				else netError(ERR_INET_SELECT_FAILED);
+                }
+        }
+
+return(netReceiveFrom(sock, readSize, TRUE));
+}
+
+
+CELL * p_netReceiveFrom(CELL * params)
+{
+UINT sock;
+size_t readSize;
+
+params = getInteger(params, &sock);
+getInteger(params, (UINT*)&readSize);
+
+return(netReceiveFrom((int)sock, readSize, FALSE));
+}
+
+
+/**********************************************************************/
+
+CELL * p_netSend(CELL * params) 
+{
+UINT sock; 
+size_t size, size2; 
+char * buffer; 
+ssize_t bytesSent; 
+
+params = getInteger(params, &sock); 
+params = getStringSize(params, &buffer, &size, TRUE);
+
+if(params->type != CELL_NIL) 
+	{
+	getInteger(params, (UINT *)&size2); 
+	if(size2 < size) size = size2;
+	}
+
+if((bytesSent = sendall((int)sock, buffer, size))  == SOCKET_ERROR) 
+    { 
+    deleteInetSession((int)sock); 
+    close((int)sock); 
+    return(netError(ERR_INET_WRITE)); 
+    }
+
+errorIdx = 0; 
+return(stuffInteger(bytesSent)); 
+}
+
+#define SEND_TO_UDP 0
+#define SEND_TO_SOCK 1
+
+CELL * netSendTo(CELL * params, int type)
+{
+char * remoteHost;
+UINT remotePort;
+#ifdef IPV6
+struct sockaddr_in6 dest_sin;
+#else
+struct sockaddr_in dest_sin;
+#endif
+struct hostent * pHe;
+size_t size;
+char * buffer;
+ssize_t bytesSent;
+UINT sock;
+/* char one = 1; */
+int one = 1;
+
+params = getString(params, &remoteHost);
+params = getInteger(params, &remotePort);
+params = getStringSize(params, &buffer, &size, TRUE);
+
+if((pHe = gethostbyname2(remoteHost, ADDR_TYPE)) == NULL)
+        return(netError(ERR_INET_HOST_UNKNOWN));
+
+if(type == SEND_TO_UDP) /* for 'net-send-udp' */
+	{
+    if((sock = socket(ADDR_TYPE, SOCK_DGRAM, 0)) == INVALID_SOCKET)
+        return(netError(ERR_INET_OPEN_SOCKET));
+
+     if(getFlag(params))
+		setsockopt(sock, SOL_SOCKET, SO_BROADCAST, (const void *)&one, sizeof(one));
+	}
+else /* SEND_TO_SOCK , socket may or may not be UDP, for 'net-send-to' */
+    {
+    params = getInteger(params, &sock);
+    }
+
+#ifdef IPV6
+memcpy((char *)&(dest_sin.sin6_addr), pHe->h_addr_list[0], pHe->h_length);
+dest_sin.sin6_port = htons((u_short)remotePort);
+dest_sin.sin6_family = AF_INET6;
+#else
+memcpy((char *)&(dest_sin.sin_addr), pHe->h_addr_list[0], pHe->h_length);
+dest_sin.sin_port = htons((u_short)remotePort);
+dest_sin.sin_family = AF_INET;
+memset(&(dest_sin.sin_zero), '\0', 8);
+#endif
+
+bytesSent = sendto((int)sock, buffer, size, NO_FLAGS_SET,
+        (struct sockaddr *)&dest_sin, sizeof(dest_sin));
+
+if(type == SEND_TO_UDP) close((int)sock);
+
+if(bytesSent == SOCKET_ERROR)
+        return(netError(ERR_INET_WRITE));
+
+errorIdx = 0;
+return(stuffInteger(bytesSent));
+}
+
+
+CELL * p_netSendUDP(CELL * params)
+{
+return(netSendTo(params, SEND_TO_UDP));
+}
+
+
+CELL * p_netSendTo(CELL * params)
+{
+return(netSendTo(params, SEND_TO_SOCK));
+}
+
+
+/************************* listen **************************************/
+
+CELL * p_netListen(CELL * params) 
+{ 
+UINT portNo;
+char * ifAddr = NULL;
+char * option = NULL;
+char * mcAddr = NULL;
+int sock, type; 
+CELL * cell;
+ 
+type = SOCK_STREAM;
+cell = evaluateExpression(params);
+params = params->next;
+
+#ifndef WIN_32
+if(cell->type == CELL_STRING)
+	{
+	if((sock = netListenLocal((char *)cell->contents)) == SOCKET_ERROR)
+		return(netError(errorIdx));
+	else
+		return(stuffInteger((UINT)sock));
+	}
+#endif
+
+getIntegerExt(cell, &portNo, FALSE); 
+
+if(params != nilCell)
+    {
+    params = getString(params, &ifAddr);
+    if(*ifAddr == 0) ifAddr = NULL;
+    if(params != nilCell)
+        {
+        params = getString(params, &option);
+        if(*option == 'u' || *option == 'U')
+            type = SOCK_DGRAM;
+        else if(*option == 'm' || *option == 'M')
+            {
+            type = SOCK_DGRAM;
+            mcAddr = ifAddr;
+            ifAddr = NULL;
+            }
+        }
+    }
+    
+
+if((sock = netListenOrDatagram((int)portNo, type, ifAddr, mcAddr)) == SOCKET_ERROR)
+    return(nilCell);
+
+return(stuffInteger(sock));
+} 
+
+#ifndef WIN_32
+int netListenLocal(char * name)
+{
+int sock;
+struct sockaddr_un local_sun;
+
+sock  = socket(AF_UNIX, SOCK_STREAM, 0);
+local_sun.sun_family = AF_UNIX;
+strncpy(local_sun.sun_path, name, sizeof(local_sun.sun_path) - 1);
+local_sun.sun_path[sizeof (local_sun.sun_path) - 1] = '\0';
+unlink(local_sun.sun_path);
+
+#ifdef OS2
+if(bind(sock, (struct sockaddr *)&local_sun, sizeof(struct sockaddr_un)) == -1)
+#else
+if(bind(sock, (struct sockaddr *)&local_sun, SUN_LEN(&local_sun)) != 0)
+#endif
+	{
+	close(sock);
+	errorIdx = ERR_INET_CANNOT_BIND;
+	return(SOCKET_ERROR);
+	}
+
+if(listen(sock, MAX_PENDING_CONNECTS) == SOCKET_ERROR)
+	{
+	close(sock);
+	errorIdx = ERR_INET_LISTEN_FAILED;
+	return(SOCKET_ERROR);
+	}
+
+createInetSession(sock, AF_UNIX);
+
+errorIdx = 0;
+return(sock);
+}
+#endif
+
+
+int netListenOrDatagram(int portNo, int type, char * ifAddr, char * mcAddr)
+{
+int sock; 
+int one = 1;
+/* char one = 1; */
+#ifdef IPV6
+struct sockaddr_in6 local_sin; 
+#else
+struct sockaddr_in local_sin; 
+#endif
+struct hostent * pHe;
+struct ip_mreq mcast;
+
+if((sock = socket(ADDR_TYPE, type, 0)) == INVALID_SOCKET)
+    {
+    errorIdx = ERR_INET_OPEN_SOCKET; 
+    return SOCKET_ERROR;
+    }
+
+memset(&local_sin, 0, sizeof(local_sin));
+
+if(ifAddr != NULL && *ifAddr != 0)
+	{
+	if((pHe = gethostbyname2(ifAddr, ADDR_TYPE)) == NULL)
+		{
+		errorIdx = ERR_INET_HOST_UNKNOWN;
+		return(SOCKET_ERROR);
+		}
+#ifdef IPV6
+	memcpy((char *)&(local_sin.sin6_addr), pHe->h_addr_list[0], pHe->h_length);
+	}
+
+else 
+	local_sin.sin6_addr = in6addr_any;
+
+#else
+	memcpy((char *)&(local_sin.sin_addr), pHe->h_addr_list[0], pHe->h_length);
+	}
+else 
+	local_sin.sin_addr.s_addr = INADDR_ANY; 
+#endif
+
+#ifdef IPV6
+local_sin.sin6_port = htons((u_short)portNo); 
+local_sin.sin6_family = AF_INET6; 
+#else
+local_sin.sin_port = htons((u_short)portNo); 
+local_sin.sin_family = AF_INET; 
+#endif
+
+setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, (const void*)&one, sizeof(one));
+ 
+if(bind(sock, (struct sockaddr *) &local_sin, sizeof(local_sin)) == SOCKET_ERROR) 
+    { 
+    close(sock);
+    errorIdx = ERR_INET_CANNOT_BIND; 
+    return(SOCKET_ERROR);
+    } 
+
+if(mcAddr != NULL)
+    {
+    memset(&mcast, 0, sizeof(mcast));
+    mcast.imr_multiaddr.s_addr = inet_addr(mcAddr);
+#ifdef IPV6
+    /* mcast.imr_interface.s_addr = IN6ADDR_ANY_INIT;     */
+#else
+    mcast.imr_interface.s_addr = INADDR_ANY;    
+#endif
+    setsockopt(sock, 0, IP_ADD_MEMBERSHIP, (const void *)&mcast, sizeof(mcast));
+    }
+
+if(type == SOCK_STREAM)
+	{
+	if(listen(sock, MAX_PENDING_CONNECTS) == SOCKET_ERROR)  
+		{ 
+		close(sock); 
+		errorIdx = ERR_INET_LISTEN_FAILED;
+		return(SOCKET_ERROR);
+		} 
+	}
+
+createInetSession(sock, AF_INET); 
+
+errorIdx = 0;
+return(sock);
+}
+
+
+/* returns number of bytes ready to read */
+CELL * p_netPeek(CELL * params)
+{
+UINT sock;
+#ifdef WIN_32
+unsigned long result;
+#else
+int result;
+#endif
+
+getInteger(params, &sock);
+
+if(ioctl((int)sock, FIONREAD, &result) == SOCKET_ERROR)
+    return(netError(ERR_INET_PEEK_FAILED));
+
+errorIdx = 0;
+return(stuffInteger((UINT)result));
+} 
+
+
+typedef struct
+    {
+    int sock;
+    void * next;
+    } SOCKLIST;
+
+
+/* checks a socket for readability/writeability  */
+CELL * p_netSelect(CELL * params)
+{
+long value;
+INT64 wait;
+char * mode;
+struct timeval timeOut;
+fd_set socketSet;
+SOCKLIST * sockPtr;
+SOCKLIST * sockList = NULL;
+CELL * cell;
+CELL * list = NULL;
+struct timeval* tmvPtr;
+
+errorIdx = 0;
+
+FD_ZERO(&socketSet);
+
+cell = evaluateExpression(params);
+if(isNumber(cell->type))
+    getIntegerExt(cell, (UINT*)&value, FALSE);
+else if(isList(cell->type))
+    {
+    cell = (CELL*)cell->contents;
+    if(cell == nilCell) return(getCell(CELL_EXPRESSION));
+    sockList = sockPtr = allocMemory(sizeof(SOCKLIST));
+    sockPtr->sock = cell->contents;
+    sockPtr->next = NULL;
+    FD_SET(sockPtr->sock, &socketSet);
+    value = 1;
+    while((cell = cell->next) != nilCell)
+        {
+        sockPtr->next = allocMemory(sizeof(SOCKLIST));
+        sockPtr = sockPtr->next;
+        sockPtr->sock = cell->contents;        
+        sockPtr->next = NULL;
+        if(value == FD_SETSIZE)
+            return(netError(ERR_INET_TOO_MUCH_SOCKETS));
+        else value++;
+        FD_SET(sockPtr->sock, &socketSet);
+        }
+    }
+else return(errorProcExt(ERR_LIST_OR_NUMBER_EXPECTED, params));
+
+params = getString(params->next, &mode);
+getInteger64(params, &wait);
+
+tmvPtr = (wait == -1) ? NULL : &timeOut;
+timeOut.tv_sec = wait/1000000;
+timeOut.tv_usec = wait - timeOut.tv_sec * 1000000;
+
+if(sockList == NULL)
+    {
+    FD_SET((int)value, &socketSet);
+    value = 1;
+    }
+
+/* printf("%d %d %d\n", timeOut.tv_sec, timeOut.tv_usec, sizeof(timeOut.tv_sec));  */
+
+if(*mode == 'r')
+    value = select(FD_SETSIZE, &socketSet, NULL, NULL, tmvPtr);
+else if(*mode == 'w')
+    value = select(FD_SETSIZE, NULL, &socketSet, NULL, tmvPtr);
+else if(*mode == 'e')
+    value = select(FD_SETSIZE, NULL, NULL, &socketSet, tmvPtr);
+
+if(value >= 0)
+    {
+    if((sockPtr = sockList) == NULL)
+        {
+        if(value == 0) return(nilCell);
+        else return(trueCell);
+        }    
+
+    cell = getCell(CELL_EXPRESSION);
+    while(sockPtr != NULL)
+        {
+        if(FD_ISSET(sockPtr->sock, &socketSet))
+            {
+            if(list == NULL)
+                {
+                list = cell;
+                cell->contents = (UINT)stuffInteger(sockPtr->sock);
+                cell = (CELL *)cell->contents;
+                }
+            else
+                {
+                cell->next = stuffInteger(sockPtr->sock);
+                cell = cell->next;
+                }
+            }
+        sockPtr = sockPtr->next;
+        free(sockList);
+        sockList = sockPtr;
+        }
+
+    if(list == NULL) return(cell);
+    else return(list);
+    }
+
+netError(ERR_INET_SELECT_FAILED);
+
+if(sockList == NULL) return(nilCell);
+return(getCell(CELL_EXPRESSION));
+}
+
+extern char logFile[];
+
+void writeLog(char * text, int newLine)
+{
+int handle;
+
+#ifdef WIN_32
+handle = open(logFile, O_RDWR | O_APPEND | O_BINARY | O_CREAT, S_IREAD | S_IWRITE);
+#else
+handle = open(logFile, O_RDWR | O_APPEND | O_BINARY | O_CREAT,
+          S_IRUSR | S_IRGRP | S_IROTH | S_IWUSR | S_IWGRP | S_IWOTH); /* rw-rw-rw */
+#endif
+
+write(handle, text, strlen(text));
+if(newLine) write(handle, &LINE_FEED, strlen(LINE_FEED));
+close(handle);
+}
+
+
+FILE * serverFD(int port, char * domain, int reconnect)
+{
+static int sock, connection;
+char name[18];
+char text[80];
+time_t t;
+
+if(!reconnect)
+	{
+#ifndef WIN_32
+	if(port != 0)
+		sock = netListenOrDatagram(port, SOCK_STREAM, NULL, NULL);
+	else
+		sock = netListenLocal(domain);
+#else
+	sock = netListenOrDatagram(port, SOCK_STREAM, NULL, NULL);
+#endif
+
+	if(sock == SOCKET_ERROR)
+		{
+		snprintf(text, 78, "newLISP v.%d listening on %s", version, domain);
+		writeLog(text, TRUE);
+		return(NULL);
+		}
+	}
+else
+	{
+	deleteInetSession(connection);
+	close(connection); 
+	}
+
+if((connection = netAccept(sock)) == SOCKET_ERROR)
+	return NULL;
+
+createInetSession(connection, (port != 0) ? AF_INET : AF_UNIX);
+
+/* print log */
+getPeerName(connection, PEER_INFO, name);
+t = time(NULL);
+snprintf(text, 78, "Connected to %s on %s", name, ctime(&t));
+/* printf(text); */
+writeLog(text, 0);
+
+return(fdopen(connection, "r+")); 
+}
+
+/******************************* distributed computing ***********************/
+
+#define MAX_BUFF 1024
+CELL * netEvalError(int errNo);
+
+typedef struct
+	{
+	char * host;
+	int port;
+	int sock;
+	int timeOut;
+	STREAM * netStream;
+	CELL * result;
+	void * next;
+	} NETEVAL;
+
+void freeSessions(NETEVAL * base);
+
+CELL * p_netEval(CELL * params)
+{
+CELL * cell = NULL;
+CELL * list = NULL;
+NETEVAL * session = NULL;
+NETEVAL * base = NULL;
+char * host;
+char * prog;
+UINT port;
+int ready;
+int sock;
+size_t size, count = 0;
+ssize_t bytes;
+long timeOut = MAX_LONG;
+int start, elapsed = 0;
+CELL * result;
+STREAM * netStream;
+CELL * netEvalIdle = NULL;
+char buffer[MAX_BUFF];
+STREAM evalStream;
+int rawMode = FALSE;
+int singleSession = FALSE;
+jmp_buf errorJumpSave;
+int errNo;
+int resultStackIdxSave;
+
+list  = evaluateExpression(params);
+if(list->type == CELL_STRING)
+	{
+	host = (char *)list->contents;
+	params = getIntegerExt(params->next, &port, TRUE);
+	params = getStringSize(params, &prog, &size, TRUE);
+	list = nilCell;
+	singleSession = TRUE;
+	goto SINGLE_SESSION;
+	}
+else if(list->type == CELL_EXPRESSION)
+	{
+	list = (CELL*)list->contents;
+	params = params->next;
+	}
+else return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, params));
+
+CREATE_SESSION:
+if(!isList(list->type))
+    return(errorProcExt(ERR_LIST_EXPECTED, list));
+cell = (CELL *)list->contents;
+
+/* get node parameters, since 8.9.8 evaluated */
+memcpy(errorJumpSave, errorJump, sizeof(jmp_buf));
+if((errNo = setjmp(errorJump)) != 0)
+	{
+	memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+	freeSessions(base);
+	longjmp(errorJump, errNo);
+	}
+cell = getStringSize(cell, &host, &size, TRUE);
+cell = getInteger(cell, &port);
+cell = getStringSize(cell, &prog, &size, TRUE);
+rawMode = getFlag(cell);
+
+memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+
+SINGLE_SESSION:
+if(base == NULL)
+    {
+    base = session = allocMemory(sizeof(NETEVAL));
+    memset(base, 0, sizeof(NETEVAL));
+    }
+else
+    {
+    session->next = allocMemory(sizeof(NETEVAL));
+    session = session->next;
+    memset(session, 0, sizeof(NETEVAL));
+    }
+
+#ifndef WIN_32
+if(port != 0)
+	sock = netConnect(host, (int)port, SOCK_STREAM, NULL, 3);
+else
+	sock = netConnectLocal(host);
+#else
+sock = netConnect(host, (int)port, SOCK_STREAM, NULL, 3);
+#endif
+
+if(sock == SOCKET_ERROR)
+		{
+		session->result = netEvalError(errorIdx);
+		goto CONTINUE_CREATE_SESSION;
+		}
+	
+session->host = host;
+session->port = port;
+session->sock = sock;
+
+if( sendall(sock, "[cmd]\n", 6)  == SOCKET_ERROR ||
+    sendall(sock, prog, size) == SOCKET_ERROR ||
+    sendall(sock, "(exit)\n[/cmd]\n", 14) == SOCKET_ERROR )
+    { 
+    close(sock); 
+    session->result = netEvalError(ERR_INET_WRITE); 
+    goto CONTINUE_CREATE_SESSION;
+    }
+
+session->netStream = (void *)allocMemory(sizeof(STREAM));
+memset(session->netStream, 0, sizeof(STREAM));
+openStrStream(session->netStream, MAX_BUFF, 0);
+/* prepend quote for evaluation */
+writeStreamChar(session->netStream, '\'');
+createInetSession(sock, AF_INET);
+count++;
+CONTINUE_CREATE_SESSION:
+list = list->next;
+if(list != nilCell) goto CREATE_SESSION;
+
+/* get timeout and optional handler symbol */
+session = base;
+if(params != nilCell)
+	params = getInteger(params, (UINT *)&timeOut);
+if(params != nilCell)
+	netEvalIdle = params;
+   
+/* printf("timeout %d idle-loop %X\n", timeOut, netEvalIdle); */
+ 
+/* collect data from host in each active session */
+while(count)
+    {
+    resultStackIdxSave = resultStackIdx;
+    if( (netStream = session->netStream) == NULL) 
+        {
+        session = session->next;
+        if(session == NULL) session = base;
+        continue;
+        }
+        
+    start = milliSecTime();
+
+    if(netEvalIdle) 
+        {
+        cell = getCell(CELL_EXPRESSION);
+        cell->contents = (UINT)copyCell(netEvalIdle);
+        pushResult(cell);
+        if(!evaluateExpressionSafe(cell, &errNo))
+			{
+			freeSessions(base);
+			longjmp(errorJump, errNo);
+			}
+        }
+
+    bytes = -1;
+    ready = wait_ready(session->sock, 100, READY_READ);
+    if(ready > 0)
+        {
+        memset(buffer, 0, MAX_BUFF);
+        bytes = recv(session->sock, buffer, MAX_BUFF, NO_FLAGS_SET);
+        if(bytes) writeStreamStr(netStream, buffer, bytes);
+        }
+    if(ready < 0 || bytes == 0 || elapsed >= timeOut)
+        {
+/*        printf("count=%d ready=%d bytes=%d elapsed=%d\n", count, ready, bytes, elapsed); */
+        if(elapsed >= timeOut) result = copyCell(nilCell); 
+        else if(rawMode) /* get raw buffer without the quote */
+            result = stuffStringN(netStream->buffer + 1, netStream->position - 1);
+        else 
+            {
+            makeStreamFromString(&evalStream, netStream->buffer);
+            memcpy(errorJumpSave, errorJump, sizeof(jmp_buf));
+            if((errNo = setjmp(errorJump)) != 0)
+                {
+                memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+                freeSessions(base);
+                longjmp(errorJump, errNo);
+                }
+            result = evaluateStream(&evalStream, 0, TRUE);
+            memcpy(errorJump, errorJumpSave, sizeof(jmp_buf));
+            }
+
+        if(netEvalIdle)
+            {
+            session->result = cell = getCell(CELL_EXPRESSION);
+            cell->contents = (UINT)stuffString(session->host);
+            cell = (CELL *)cell->contents;
+            cell->next = stuffInteger(session->port);
+            cell = cell->next;
+            cell->next = result;
+            }
+        else
+            session->result = result;
+            
+        closeStrStream(netStream);
+        deleteInetSession(session->sock);
+        close(session->sock);
+        free(netStream);
+        session->netStream = NULL;
+            
+        if(netEvalIdle)
+            {
+            list = getCell(CELL_EXPRESSION);
+            list->contents = (UINT)copyCell(netEvalIdle);
+            cell = getCell(CELL_QUOTE);
+            cell->contents = (UINT)session->result;
+            ((CELL*)list->contents)->next = cell;
+            pushResult(list);
+        	if(!evaluateExpressionSafe(list, &errNo))
+				{
+				freeSessions(base);
+				longjmp(errorJump, errNo);
+				}
+            }
+
+        count--;
+        }
+        
+    /* check for rollover at midnight */
+    if(milliSecTime() >= start) 
+        elapsed += milliSecTime() - start;
+    else 
+        elapsed += milliSecTime();
+
+    session = session->next;
+    if(session == NULL) session = base;
+
+    cleanupResults(resultStackIdxSave);
+  }
+
+/* free all sessions and configure result */
+result = NULL;
+while(base != NULL)
+    {
+    if(netEvalIdle == NULL)
+        {
+        if(result == NULL)
+            {
+			if(singleSession)
+				result = base->result;
+			else
+				{
+            	result = getCell(CELL_EXPRESSION);
+            	result->contents = (UINT)base->result;
+            	cell = base->result;
+            	}
+			}
+        else
+            {
+            cell->next = base->result;
+            cell = cell->next;
+            }
+        }
+    session = base;
+    base = base->next;
+    free(session);
+    }
+
+if(elapsed > timeOut) 
+	errorIdx = ERR_INET_TIMEOUT;
+else errorIdx = 0;
+if(netEvalIdle == NULL) return(result);
+return(trueCell);
+}    
+
+
+void freeSessions(NETEVAL * base)
+{
+NETEVAL * session;
+
+while(base != NULL)
+    {
+    if(base->netStream != NULL)
+        {
+        if(base->result != NULL)
+          deleteList(base->result);
+        closeStrStream(base->netStream);
+        deleteInetSession(base->sock);
+        close(base->sock);
+        free(base->netStream);
+        base->netStream = NULL;
+        }
+    session = base;
+    base = base->next;
+    free(session);
+    }
+}
+
+int sendall(int sock, char * buffer, int len)
+{
+int bytesSend = 0;
+int n;
+
+while(bytesSend < len)
+	{
+ 	if((n = send(sock, buffer + bytesSend, len - bytesSend, NO_FLAGS_SET)) == SOCKET_ERROR)
+		return(SOCKET_ERROR);
+	bytesSend += n;
+	}
+
+return(bytesSend);
+}
+
+/*********************** error handling ***************************************/
+
+char * netErrorMsg[] =
+    {
+    "No error",
+    "Cannot open socket",
+    "Host name not known",
+    "Not a valid service",
+    "Connection failed",
+    "Accept failed",
+    "Connection closed",
+    "Connection broken",
+    "Socket recv failed",
+    "Socket send failed",
+    "Cannot bind socket",
+    "Too much sockets in net-select",
+    "Listen failed",
+    "Badly formed IP",
+    "Select failed",
+    "Peek failed",
+    "Not a valid socket",
+	"Operation timed out"
+    };
+
+
+CELL * netError(int errorNo) 
+{ 
+errorIdx = errorNo; 
+return(nilCell); 
+} 
+
+CELL * netEvalError(int errorNo)
+{ 
+errorIdx = errorNo; 
+return(p_netLastError(NULL));
+}
+
+CELL * p_netLastError(CELL * params)
+{
+CELL * cell;
+char str[64];
+
+if(errorIdx == 0 || errorIdx > MAX_NET_ERROR) return(nilCell);
+
+cell = getCell(CELL_EXPRESSION);
+cell->contents = (UINT)stuffInteger(errorIdx);
+snprintf(str, 63, "ERR: %s", netErrorMsg[errorIdx]);
+((CELL*)cell->contents)->next = stuffString(str);
+
+return(cell);
+}
+
+
+#ifdef NET_PING
+/* net-ping */
+
+
+CELL * p_netPing(CELL * params)
+{
+CELL * address;
+UINT maxwait = 1000, listmode = 0;
+UINT flag = 0;
+UINT count = 0;
+
+address = evaluateExpression(params);
+if(address->type == CELL_EXPRESSION)
+	{
+	address = (CELL *)address->contents;
+	listmode = 1;
+	}
+else if(address->type != CELL_STRING)
+  return(errorProcExt(ERR_LIST_OR_STRING_EXPECTED, address));
+
+params = params->next;
+if(params != nilCell)  
+	{
+	params = getInteger(params, &maxwait);
+	if(params != nilCell)
+	params = getInteger(params, &count);
+	flag = getFlag(params);
+	}
+
+return(ping(address, (int)maxwait, (int)listmode, (int)count, (int)flag));
+}
+
+#if defined(IPV6)
+/* datalen 56 + iplen 60 + icmplen 76 */
+#define PLEN 192 /* 192 or 64 ? */
+#else
+#define PLEN 64
+#endif
+
+CELL * ping(CELL * address, int maxwait, int listmode, int maxCount, int flag)
+{
+char * host;
+char * ptr;
+char * hostaddr = NULL;
+struct hostent *hp;
+unsigned char packet[PLEN];
+struct ip *ip;
+#ifdef IPV6
+struct icmp6_hdr *icp = (struct icmp6_hdr *) packet;
+struct sockaddr_in6 whereto;
+struct sockaddr_in6 from;
+struct icmp6_filter filter;
+char IPaddress[40];
+#else
+struct sockaddr_in whereto;
+struct sockaddr_in from;
+struct icmp *icp = (struct icmp *) packet;
+#endif
+int s, sockopt;
+#ifdef TRU64
+unsigned long fromlen;
+#else
+#ifdef OS2
+int fromlen;
+#else
+unsigned int fromlen;
+#endif
+#endif
+int broadcast = 0;
+int size, ipNo, startIp = 0, endIp = 0;
+int timeout = 0, tdiff;
+int sendCount = 0, receiveCount = 0, ping_sequence = 0;
+size_t len;
+struct timeval tv, tp;
+CELL * result = NULL;
+CELL * link = NULL;
+char buff[64];
+
+if ((s = socket(ADDR_TYPE, SOCK_RAW, ICMP_TYPE)) < 0) 
+    return(netError(ERR_INET_OPEN_SOCKET));
+   
+#ifdef IPV6
+ICMP6_FILTER_SETPASS (ICMP6_ECHO_REPLY, &filter);
+setsockopt (s, IPPROTO_ICMPV6, ICMP6_FILTER, &filter, sizeof (filter));
+sockopt = 1;
+/* setsockopt (s, IPPROTO_IPV6, IPV6_RECVHOPLIMIT, &sockopt, sizeof (sockopt)); */
+#endif
+
+gettimeofday(&tv, NULL );
+
+/* for each list-IP */
+while(address != nilCell)
+	{
+	mySleep(1);
+	if(address->type != CELL_STRING)
+		{
+		shutdown(s, SHUT_RDWR);
+		return(errorProcExt(ERR_STRING_EXPECTED, address));
+		}
+
+	host = (char *)address->contents;
+	len = address->aux - 1;
+
+#ifndef IPv6
+	if(strncmp(host + len - 2, ".*", 2) == 0)
+		{
+		startIp = 1;
+		endIp = 254;
+		len--;
+		}
+	else
+		{
+		startIp = endIp = 0;
+		ptr = host + len - 1;
+		while(isdigit((int)*ptr)) --ptr;
+		if(*ptr == '-')
+			{
+			endIp = atoi(ptr + 1);
+			--ptr;
+			while(isdigit((int)*ptr)) --ptr;
+			if(*ptr == '.')
+				{
+				startIp = atoi(ptr + 1);
+				len = ptr - host + 1;
+				}
+			else endIp = startIp = 0;
+			if(endIp < startIp) endIp = startIp;	
+			}
+		}
+#endif
+
+	/* ping ip range */
+	for(ipNo = startIp; ipNo <= endIp; ipNo++)
+        {
+		if(startIp)
+			{
+        	if(hostaddr == NULL) hostaddr = alloca(len + 4);
+        	memcpy(hostaddr, host, len);
+        	snprintf(hostaddr + len, 4, "%d", ipNo);
+			}
+    	else
+       		hostaddr = host;
+        
+		/* target host address info */
+		/* printf("->%s\n", hostaddr); */
+#ifdef IPV6
+		memset((char *)&whereto, 0, sizeof(struct sockaddr_in6));
+		whereto.sin6_family = AF_INET6;
+		if(!(hp = gethostbyname2(hostaddr, AF_INET6)))
+			{
+			shutdown(s, SHUT_RDWR);
+			return(netError(ERR_INET_HOST_UNKNOWN));
+			}
+		memcpy((char *)&(whereto.sin6_addr), hp->h_addr_list[0], hp->h_length);
+#else
+		memset((char *)&whereto, 0, sizeof(struct sockaddr_in));
+		whereto.sin_family = AF_INET;
+		if(!(hp = gethostbyname2(hostaddr, AF_INET)))
+			{
+			shutdown(s, SHUT_RDWR);
+			return(netError(ERR_INET_HOST_UNKNOWN));
+			}
+		memcpy((void *)&whereto.sin_addr, hp->h_addr, hp->h_length);
+		broadcast = ((whereto.sin_addr.s_addr & 0x000000ff) == 255);
+#endif
+		if(broadcast)
+			{
+			sockopt = 1;
+			setsockopt(s, SOL_SOCKET, SO_BROADCAST, (void *) &sockopt, sizeof(sockopt));
+			}
+
+		/* ping */
+		memset(icp, 0, PLEN);
+#ifdef IPV6
+		icp->icmp6_type = ICMP6_ECHO_REQUEST;
+		icp->icmp6_code = 0;
+		icp->icmp6_cksum = 0;
+		icp->icmp6_seq = ping_sequence;
+		icp->icmp6_id = getpid() & 0xFFFF; 
+		gettimeofday((struct timeval *)&icp->icmp6_data8[4], NULL);
+/*
+		sockopt = offsetof(struct icmp6_hdr, icmp6_cksum);
+		setsockopt(s, SOL_RAW, IPV6_CHECKSUM, (char *)&sockopt, sizeof(sockopt)); 
+		sockopt = 1;
+ 		setsockopt(pingsock, SOL_IPV6, IPV6_HOPLIMIT, (char *)&sockopt, sizeof(sockopt));
+*/
+
+#else
+		icp->icmp_type = ICMP_ECHO;
+		icp->icmp_code = 0;
+		icp->icmp_cksum = 0;
+		icp->icmp_seq = ping_sequence;
+		icp->icmp_id = getpid() & 0xFFFF; 
+		gettimeofday((struct timeval *)&icp[1], NULL);
+		icp->icmp_cksum = in_cksum((unsigned short *) icp, PLEN );
+#endif
+		while(wait_ready(s, 10000, READY_WRITE) <= 0)
+			{
+        	gettimeofday(&tp, NULL);
+        	if((timeout = (timediff(tp, tv) > maxwait))) break;
+        	continue;
+			}
+			
+		size = sendto(s, packet, PLEN, 0,(struct sockaddr *)&whereto, sizeof(struct sockaddr));
+		if(size != PLEN)
+			{
+			if(errno == EHOSTUNREACH || errno == EHOSTDOWN) 
+				{
+				if(flag)
+					{
+					snprintf(buff, 16, "errno: %d", errno);
+#ifdef IPV6
+					memset(IPaddress, 0, 40);
+    	  			inet_ntop(AF_INET6, &whereto.sin6_addr, IPaddress, 40); 
+					link = addResult(&result, link, 
+						makePair(stuffString(IPaddress), stuffString(buff)));
+#else
+					link = addResult(&result, link, 
+						makePair(stuffString(inet_ntoa(whereto.sin_addr)), stuffString(buff)));
+#endif
+					}
+    			if( !(listmode || startIp) ) break;
+				continue;
+				}
+			shutdown(s, SHUT_RDWR);    
+			return(netError(ERR_INET_WRITE));
+			}
+
+		sendCount++;
+		}
+	if(!listmode) break;
+	address = address->next;
+	}
+
+/* wait for response(s) */
+if(maxCount == 0) maxCount = sendCount;
+while(sendCount) 
+	{
+    memset(packet, 0, PLEN);
+    fromlen = sizeof(from);
+
+    if(wait_ready(s, 1000, READY_READ) <= 0)
+        {
+        gettimeofday(&tp, NULL);
+       	if((timeout = (timediff(tp, tv) > maxwait))) break;
+        continue;
+        }    
+
+    if ( (len = recvfrom(s, packet, PLEN, 0, (struct sockaddr *)&from, &fromlen)) < 0)
+        continue;
+    
+    ip = (struct ip *) packet;
+	gettimeofday(&tp, NULL);
+#ifdef IPV6
+    icp = (struct icmp6_hdr *)packet;
+	if(icp->icmp6_type != ICMP6_ECHO_REPLY) continue;
+    if(icp->icmp6_id != (getpid() & 0xFFFF)) continue; 
+	tdiff = timediff64(tp, *(struct timeval *)&icp->icmp6_data8[4]);
+#else
+    icp = (struct icmp *)(packet + (ip->ip_hl << 2));
+    if(icp->icmp_id != (getpid() & 0xFFFF)) continue; 
+	tdiff = timediff64(tp, *(struct timeval *)&icp[1]);
+#endif
+
+#ifdef IPV6
+	inet_ntop(AF_INET6, &from.sin6_addr, IPaddress, 40); 
+	link = addResult(&result, link, 
+			makePair(stuffString(IPaddress), stuffInteger(tdiff)));
+#else
+	link = addResult(&result, link, 
+			makePair(stuffString(inet_ntoa(from.sin_addr)), stuffInteger(tdiff)));
+#endif
+
+    if(++receiveCount == maxCount) break;
+    if( !(broadcast || listmode || startIp) ) break;
+	} 
+
+shutdown(s, SHUT_RDWR); 
+ping_sequence++;
+if(timeout) errorIdx = ERR_INET_TIMEOUT;
+else errorIdx = 0;
+return(result == NULL ? getCell(CELL_EXPRESSION) : result);
+}
+
+CELL * addResult(CELL * * result, CELL * cell, CELL * new)
+{
+if(*result == NULL)
+	{
+	*result = getCell(CELL_EXPRESSION);
+	((CELL *)(*result))->contents = (UINT)new;
+	}
+else
+	cell->next = new;	
+
+return(new);
+}
+
+CELL * makePair(CELL * left, CELL * right)
+{
+CELL * cell = getCell(CELL_EXPRESSION);
+
+cell->contents = (UINT)left;
+left->next = right;
+
+return(cell);
+}
+
+int in_cksum(unsigned short * addr, int len)
+{
+int nleft = len;
+unsigned short *w = addr;
+unsigned short  answer;
+int sum = 0;
+
+while( nleft > 1 )  {
+    sum += *w++;
+    nleft -= 2;
+    }
+
+if( nleft == 1 ) {
+    u_short    u = 0;
+    *(unsigned char *)(&u) = *(unsigned char *)w ;
+    sum += u;
+    }
+
+sum = (sum >> 16) + (sum & 0xffff);
+sum += (sum >> 16);
+answer = ~sum;
+return (answer);
+}
+
+#endif /* NET_PING */
+
+
+/* check socket for readability or error 
+   return 0 if the time limit expires or -1
+   on error 
+*/
+int wait_ready(int sock, INT64 wait, int mode)
+{
+struct timeval timeOut;
+fd_set socketSet;
+
+FD_ZERO(&socketSet);
+FD_SET(sock, &socketSet);
+
+timeOut.tv_sec = wait/1000000;
+timeOut.tv_usec = wait - timeOut.tv_sec * 1000000;
+
+if(mode == READY_READ)
+    return(select(FD_SETSIZE, &socketSet, NULL, &socketSet, &timeOut));
+else
+    return(select(FD_SETSIZE, NULL, &socketSet, &socketSet, &timeOut));
+}
+
+
+/* ----------------------------- socket->filestream stuff for win32 ------------------------*/
+
+#ifdef WIN_32
+
+/*
+These functions use the FILE structure to store the raw file handle in '->_file' and
+set ->_flag to 0xFFFF, to identify this as a faked FILE structure.
+*/
+
+FILE * win32_fdopen(int handle, const char * mode)
+{
+FILE * fPtr;
+
+if((fPtr = (FILE *)malloc(sizeof(FILE))) == NULL)
+    return(NULL);
+
+memset(fPtr, 0, sizeof(FILE));
+
+
+#ifdef WIN_32
+fPtr->_file = handle;
+fPtr->_flag = 0xFFFF;
+#endif
+
+return(fPtr);
+}
+
+int win32_fclose(FILE * fPtr)
+{
+if(isSocketStream(fPtr))
+   return(close(getSocket(fPtr)));
+
+
+return(fclose(fPtr));
+}
+
+
+/* for a full fprintf with format string and parameters
+   see version previous to 9.0.2
+*/
+int win32_fprintf(FILE * fPtr, char * buffer)
+{
+int pSize;
+
+if(!isSocketStream(fPtr))
+    return(fprintf(fPtr, buffer));
+
+pSize = strlen(buffer);
+
+if((pSize = sendall(getSocket(fPtr), buffer, pSize)) == SOCKET_ERROR)
+     {
+     close(getSocket(fPtr));
+     return(-1);
+     }
+
+return(pSize);
+}
+
+int win32_fgetc(FILE * fPtr)
+{
+char chr;
+
+if(!isSocketStream(fPtr))
+    return(fgetc(fPtr));
+
+if(recv(getSocket(fPtr), &chr, 1, NO_FLAGS_SET) <= 0)
+    {
+    close(getSocket(fPtr));
+    return(-1);
+    }
+
+return(chr);
+}
+
+
+char * win32_fgets(char * buffer, int  size, FILE * fPtr)
+{
+int bytesReceived = 0;
+char chr;
+
+if(!isSocketStream(fPtr))
+    return(fgets(buffer, size - 1, fPtr));
+
+while(bytesReceived < size)
+    {
+    if(recv(getSocket(fPtr), &chr, 1, NO_FLAGS_SET) <= 0)
+        {
+        close(getSocket(fPtr));
+        return(NULL);
+        }
+
+    *(buffer + bytesReceived++) = chr;
+
+    if(chr == '\n') break;
+    }
+
+*(buffer + bytesReceived) = 0;
+
+return(buffer);
+}
+
+#endif
+
+/* eof */
diff --git a/nl-string.c b/nl-string.c
new file mode 100644
index 0000000..77d26a2
--- /dev/null
+++ b/nl-string.c
@@ -0,0 +1,2239 @@
+/* nl-string.c
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+#include "newlisp.h"
+#ifdef SUPPORT_UTF8
+#include <wctype.h>
+#endif
+#include "pcre.h"
+#include "protos.h"
+
+extern SYMBOL * sysSymbol[];
+#define OVECCOUNT (MAX_REGEX_EXP * 3)    /*  max sub expressions in PCRE */
+
+void regexError(char * msg_1, int num, const char * msg_2);
+pcre * pcreCachedCompile(char * pattern, int options);
+
+CELL * cellTokenString(char * *source, size_t * srclen, char *separator, pcre *re);
+
+#ifdef USE_WIN_UTF16PATH
+int open_utf16(const char* a, int b, int c);
+#endif
+
+/* ---------------------------- string processing ----------------------- */
+
+int my_strnicmp(char * s1, char * s2, ssize_t size)
+{
+while(toupper(*s1) == toupper(*s2))
+	{
+	if(--size <= 0) return(0);
+	s1++, s2++;
+	}
+return(toupper(*s1) - toupper(*s2));
+}
+
+
+CELL * substring(char * string, ssize_t slen, ssize_t offset, ssize_t len)
+{
+if(offset < 0)
+	{
+	offset = slen + offset;
+	if(offset < 0) offset = 0;
+	}
+else
+	offset = (offset > slen) ? slen : offset;
+	
+if(len < 0) 
+	{
+	len = slen - offset + len;
+	if(len < 0) len = 0;
+	}
+
+if(len == MAX_LONG) 
+	len = slen - offset;
+else
+	len = ((offset + len) > slen) ? (slen - offset) : len;
+
+return(stuffStringN(string + offset, len));
+}
+
+#define SEARCH_SIZE 0x1000
+
+CELL * p_search(CELL * params)
+{
+UINT fileHandle;
+ssize_t bytesRead;
+ssize_t position;
+int flag = 0;
+CELL * next;
+
+#ifdef LFS
+off_t filePosition;
+off_t foundPosition;
+double result;
+#else
+ssize_t filePosition;
+ssize_t foundPosition;
+#endif
+
+char * searchString;
+char * buffer;
+long options;
+size_t len;
+
+params = getInteger(params, (UINT *)&fileHandle);
+params = getStringSize(params, &searchString, &len, TRUE);
+if(len == 0) return(nilCell);
+
+options = -1;
+if(params != nilCell)
+	{
+	next = params->next;
+	params = evaluateExpression(params);
+	if(isNumber(params->type))
+		getIntegerExt(params, (UINT *)&options, FALSE); 
+	else
+		{
+		flag = (params->type != CELL_NIL);
+		if(next != nilCell)
+			getInteger(next, (UINT *)&options);
+		}
+	}
+
+buffer = (char *)allocMemory(SEARCH_SIZE + 1);
+if((filePosition = lseek((int)fileHandle, 0, SEEK_CUR)) == -1) 
+	return(nilCell);
+
+foundPosition = 0;
+
+do
+    {
+    memset(buffer, 0, SEARCH_SIZE + 1);
+    bytesRead = read((int)fileHandle, buffer, SEARCH_SIZE);
+
+    if(options == -1)
+        position = searchBuffer(buffer, bytesRead, searchString, len, 1);
+    else
+        position = searchBufferRegex(buffer, 0, searchString, (int)bytesRead , options, (int *)&len);
+
+    if(position != -1)
+        {
+		if(flag)
+        	foundPosition = filePosition + position + len;
+		else
+        	foundPosition = filePosition + position;
+        break;
+        }
+
+    filePosition = filePosition + bytesRead - len;
+    lseek((int)fileHandle, filePosition, SEEK_SET);
+    } while (bytesRead == SEARCH_SIZE);
+
+freeMemory(buffer);
+
+if(position == -1) return(nilCell);
+
+lseek((int)fileHandle, foundPosition, SEEK_SET);
+#ifdef LFS
+result = foundPosition;
+return(stuffFloat(&result));
+#else
+return(stuffInteger(foundPosition));
+#endif
+}
+
+
+
+CELL * implicitIndexString(CELL * cell, CELL * params)
+{
+ssize_t index;
+char * ptr;
+#ifndef SUPPORT_UTF8
+char str[2];
+#else
+ssize_t i, p;
+#endif
+
+ptr = (char*)cell->contents;
+getInteger(params, (UINT *)&index);
+
+#ifndef SUPPORT_UTF8
+index = adjustNegativeIndex(index, cell->aux - 1);
+str[0] = *(ptr + index);
+str[1] = 0;
+return(stuffString(str));
+#else
+index = adjustNegativeIndex(index, utf8_wlen(ptr));
+for(i = 0; i < index; i++)
+	{
+	p = utf8_1st_len(ptr);
+	ptr += p;
+	}
+return(stuffStringN(ptr, utf8_1st_len(ptr)));
+#endif
+}
+
+
+CELL * p_char(CELL * params)
+{
+char * string;
+ssize_t offset;
+size_t len;
+int  num;
+CELL * datCell;
+char buff[2];
+
+
+datCell = evaluateExpression(params);
+switch(datCell->type)
+	{
+	case CELL_STRING:
+		string = (char *)datCell->contents;
+
+#ifndef SUPPORT_UTF8
+		len = (size_t)datCell->aux - 1;
+#else
+		len = utf8_wlen(string);
+#endif
+
+		if(params->next != nilCell)
+			getInteger(params->next, (UINT*)&offset);
+		else offset = 0;
+
+		offset = adjustNegativeIndex(offset, len);
+
+#ifndef SUPPORT_UTF8
+		return(stuffInteger((UINT)*((unsigned char *)string + (UINT)offset)));
+
+	case CELL_LONG:
+		buff[0] = (int)datCell->contents;
+		break;
+#ifndef NEWLISP64
+	case CELL_INT64:
+		num = *(INT64 *)&datCell->aux;
+		buff[0] = num;
+		break;
+	case CELL_FLOAT:
+		num = *(double*)&datCell->aux;
+		buff[0] = num;
+#else /* NEWLISP64 */
+	case CELL_FLOAT:
+		num = *(double*)&datCell->contents;
+		buff[0] = num;
+#endif /* NEWLISP64 */
+		break;
+
+
+#else /* SUPPORT_UTF8 */
+		while(offset--) string += utf8_1st_len(string);
+		utf8_wchar(string, &num);	
+		return(stuffInteger(num));
+
+#ifndef NEWLISP64
+	case CELL_FLOAT:
+	case CELL_LONG:
+	case CELL_INT64:
+		string = allocMemory(UTF8_MAX_BYTES + 1);	
+		if(datCell->type == CELL_FLOAT)
+			num = *(double*)&datCell->aux;
+		else if(datCell->type == CELL_INT64)
+			num = *(INT64 *)&datCell->aux;
+		else
+			num = datCell->contents;
+#else /* NEWLISP64 */
+	case CELL_FLOAT:
+	case CELL_LONG:
+		string = allocMemory(UTF8_MAX_BYTES + 1);	
+		if(datCell->type == CELL_FLOAT)
+			num = *(double*)&datCell->contents;
+		else
+			num = (int)datCell->contents;
+#endif /* NEWLISP 64 */
+		len = wchar_utf8(num, string);		
+		datCell = stuffStringN(string, len);
+		free(string);
+		return(datCell);
+#endif /* SUPPORT_UTF8 */
+	default:
+		buff[0] = 0;
+	}
+
+return(stuffStringN(buff, 1));
+}
+
+
+CELL * p_explode(CELL * params)
+{
+char * string;
+CELL * cell;
+CELL * result;
+ssize_t size;
+ssize_t len = 1;
+int flag = 0;
+#ifdef SUPPORT_UTF8
+int clen, i;
+#endif
+
+cell = evaluateExpression(params);
+if(isList(cell->type))
+	return(explodeList((CELL*)cell->contents, params->next));
+
+getStringSize(cell, &string, (size_t *)&size, TRUE);
+if(params->next != nilCell)
+	{
+	params = getInteger(params->next, (UINT *)&len);
+	flag = getFlag(params);
+	if(!flag && len > size) len = size;
+	}
+
+result = cell = getCell(CELL_EXPRESSION);
+if(size == 0 || len <= 0) return(result);
+
+#ifndef SUPPORT_UTF8
+if(flag && size < len) return(result);
+
+cell->contents = (UINT)stuffStringN(string, len);
+cell = (CELL *)cell->contents;
+string += len;
+
+while((size -= len) > 0)
+	{
+	if(flag && size < len) break;
+	cell->next = stuffStringN(string, (size >= len) ? len : size);
+        cell = cell->next;
+	string += len;
+	}
+#else
+size = utf8_wlen(string);
+for(i = 0, clen = 0; i < len; i++)
+	clen += utf8_1st_len(string + clen);
+
+if(flag && size < len) return(result);
+
+cell->contents = (UINT)stuffStringN(string, clen);
+cell = (CELL *)cell->contents;
+string += clen;
+while((size -= len) > 0)
+	{
+	if(flag && size < len) break;
+	for(i = 0, clen = 0; i < len; i++)
+		clen += utf8_1st_len(string + clen);
+	cell->next = stuffStringN(string, clen);
+	cell = cell->next;
+	string += clen;
+	}
+#endif
+
+return(result);
+}
+
+
+#define STR_LOWER 0
+#define STR_UPPER 1
+#define STR_TITLE 2
+
+
+CELL * strUpperLower(CELL * params, int type)
+{
+#ifndef SUPPORT_UTF8
+char * string;
+char * ptr;
+#else
+char * utf8str;
+int * unicode;
+int * ptr;
+size_t size;
+#endif
+CELL * cell;
+int option = FALSE;
+
+#ifndef SUPPORT_UTF8
+params = getString(params, &string);
+if(params != nilCell)
+  {
+  params = evaluateExpression(params);
+  if(params->contents != (UINT)nilCell)
+    option = TRUE;
+  }
+
+cell = stuffString(string);
+ptr = (void *)cell->contents;
+
+if(type == STR_UPPER)
+    while(*ptr) { *ptr = toupper(*ptr); ptr++; }
+else
+    {
+    if(type == STR_TITLE)
+      if(*ptr) { *ptr = toupper(*ptr); ptr++; }
+    if(((type == STR_TITLE) && option) || (type == STR_LOWER))
+      while(*ptr) { *ptr = tolower(*ptr); ptr++; }
+    }
+#else
+
+params = getString(params, &utf8str);
+option = getFlag(params);
+
+size =  utf8_wlen(utf8str);
+
+unicode = allocMemory((size + 1) * sizeof(int));
+size = utf8_wstr(unicode, utf8str, size);
+
+ptr = unicode;
+
+/* Note that on many platforms towupper/towlower
+do not work correctly for non-ascii unicodes */
+
+if(type == STR_UPPER)
+    while(*ptr) { *ptr = towupper(*ptr); ptr++; }
+else
+    {
+    if(type == STR_TITLE)
+      if(*ptr) { *ptr = towupper(*ptr); ptr++; }
+    if(((type == STR_TITLE) && option) || (type == STR_LOWER))
+      while(*ptr) { *ptr = towlower(*ptr); ptr++; }
+    }
+
+utf8str = allocMemory(size * UTF8_MAX_BYTES + 1);
+size =  wstr_utf8(utf8str, unicode, size * UTF8_MAX_BYTES + 1);
+utf8str = reallocMemory(utf8str, size + 1);
+
+free(unicode);
+cell = getCell(CELL_STRING);
+cell->contents = (UINT)utf8str;
+cell->aux = size + 1;
+#endif
+
+return(cell);
+}
+
+CELL * p_upper(CELL * params) {return(strUpperLower(params, STR_UPPER));}
+CELL * p_lower(CELL * params) {return(strUpperLower(params, STR_LOWER));}
+CELL * p_title(CELL * params) {return(strUpperLower(params, STR_TITLE));}
+
+char * getFormatType(char * fmt, int * type)
+{
+PARSE_FORMAT:
+
+/* get % */
+while(*fmt != '%' && *fmt != 0) fmt++;
+if(*fmt == 0) 
+	{
+    *type = 0;
+	return(fmt);
+    }
+fmt++;
+
+/* is it double %% for '%' */
+if(*fmt == '%')
+    {
+    fmt++;
+    goto PARSE_FORMAT;
+    }
+
+/* get width spec */
+
+/* force + before numbers */
+if(*fmt == '+') 
+  	fmt++;
+else
+    {
+    /* left align numbers or strings */
+    if(*fmt == '-')
+        {
+        fmt++;
+        /* force + before numbers */
+        if(*fmt == '+') fmt++;
+        }
+    }
+
+while(isdigit((int)*fmt) && *fmt != 0) fmt++;
+if(*fmt == 0) return(NULL);
+
+/* its a float or string with dot precision*/
+if(*fmt == '.')
+    {
+    fmt++;
+    while(isdigit((int)*fmt) && *fmt !=0) fmt++;
+    if(*fmt == 0) return(NULL);
+
+	if(*fmt == 'f' || *fmt == 'g' || *fmt =='G' || *fmt == 'e' || *fmt == 'E')
+        {
+        *type = CELL_FLOAT;
+        return(++fmt);
+        }
+    if(*fmt == 's')
+        {
+        *type = CELL_STRING;
+        return(++fmt);
+        }
+    else return(NULL);
+    }
+
+/* its a float without dot */
+if(*fmt == 'f' || *fmt == 'g' || *fmt =='G' || *fmt == 'e' || *fmt == 'E')
+    {
+    *type = CELL_FLOAT;
+    return(++fmt);
+    }
+
+/* its an integer or character */
+#ifdef TRU64
+if(*fmt == 'd' || *fmt == 'i' || *fmt == 'u' || *fmt == 'x' || *fmt == 'X' || *fmt == 'c' || *fmt == 'o')
+#else
+if(*fmt == 'd' || *fmt == 'u' || *fmt == 'x' || *fmt == 'X' || *fmt == 'c' || *fmt == 'o')
+#endif
+    {
+#ifdef TRU64
+#ifndef NEWLISP64
+    *type = CELL_INT64;
+#else
+	*type = CELL_LONG;
+#endif
+#else
+	*type = CELL_LONG;
+#endif
+    return(++fmt);
+    }
+
+/* its a string */
+if(*fmt == 's')
+    {
+    *type = CELL_STRING;
+    return(++fmt);
+    }
+
+#ifndef WIN_32
+#ifdef TRU64 /* supporting ld, li, lu, lx, lX formats */
+if(*fmt == 'l' &&  
+		(*(fmt + 1) == 'd' || *(fmt + 1) == 'i' || *(fmt + 1) == 'u' || *(fmt + 1) =='x' || *(fmt + 1) == 'X'))
+    {
+#ifndef NEWLISP64
+    *type = CELL_INT64;
+#else
+    *type = CELL_LONG;
+#endif
+    return(fmt+2);
+    }
+#else /* all other UNIX suporting lld, llu, llx, llX formats */
+if(*fmt == 'l' && *(fmt + 1) == 'l' && 
+		(*(fmt + 2) == 'd' || *(fmt + 2) == 'u' || *(fmt + 2) =='x' || *(fmt + 2) == 'X'))
+    {
+#ifndef NEWLISP64
+    *type = CELL_INT64;
+#else
+	*type = CELL_LONG;
+#endif
+    return(fmt+3);
+    }
+#endif
+#else /* MinGW uses MS conventions */
+if(memcmp(fmt, "I64", 3) == 0 &&
+		(*(fmt + 3) == 'd' || *(fmt + 3) == 'u' || *(fmt + 3) =='x' || *(fmt + 3) == 'X'))
+    {
+    *type = CELL_INT64;
+    return(fmt+4);
+    }
+#endif
+
+/* L and q seem not to be suported on most GCC although in the docs
+if(*fmt == 'L' && (*(fmt + 1) == 'd' || *(fmt + 1) =='x' || *(fmt + 1) == 'X'))
+    {
+    *type = CELL_INT64;
+    return(fmt+3);
+    }
+*/
+
+/* its a wchar_t unicode string */
+if(*fmt == 'l' && *(fmt + 1) == 's')
+    {
+    *type = CELL_STRING;
+    return(fmt+2);
+    }
+
+return(NULL);
+}
+
+CELL * p_format(CELL * params)
+{
+char * format;
+char * fmt;
+char * nextfmt;
+CELL * cell;
+STREAM fmtStream;
+int fType;
+double floatNum;
+UINT intNum;
+#ifndef NEWLISP64
+INT64 bigNum;
+#endif
+int evalFlag = TRUE;
+char saveChar;
+
+params = getString(params, &format);
+fmt = format;
+
+openStrStream(&fmtStream, MAX_STRING, 0);
+
+while(params->type != CELL_NIL)
+    {
+	/* printf("entry>%s<\n", fmt); */
+    nextfmt = getFormatType(fmt, &fType);
+	/* printf("exit>%s<\n", nextfmt); */
+
+    if(nextfmt == NULL)
+		{
+		closeStrStream(&fmtStream);
+        return(errorProcExt2(ERR_FORMAT_STRING, stuffString(format)));
+		}
+
+	saveChar = *nextfmt;
+	*nextfmt = 0;
+
+	if(evalFlag) 
+		cell = evaluateExpression(params);
+	else
+		cell = params;
+
+	if(cell->type == CELL_EXPRESSION && fmt == format)
+		{
+		params = (CELL *)cell->contents;
+		evalFlag = FALSE;
+		cell = params;
+		}
+
+    if(fType == 0)
+		{
+		*nextfmt = saveChar;
+		closeStrStream(&fmtStream);
+        return(errorProcExt(ERR_FORMAT_NUM_ARGS, params));
+		}
+
+    if(fType == CELL_LONG)
+        {
+        if(isNumber(cell->type))
+			cell = getIntegerExt(cell, &intNum, FALSE);
+		else goto FORMAT_DATA_ERROR;
+
+		varPrintf((UINT)&fmtStream, fmt, intNum);
+		goto NEXT_FORMAT;
+		}
+#ifndef NEWLISP64
+    if(fType == CELL_INT64)
+        {
+        if(isNumber(cell->type))
+			cell = getInteger64(cell, &bigNum);
+		else goto FORMAT_DATA_ERROR;
+
+		varPrintf((UINT)&fmtStream, fmt, bigNum);
+		goto NEXT_FORMAT;
+		}
+#endif
+    if(fType == CELL_FLOAT)
+		{
+		if(cell->type == CELL_FLOAT)
+#ifndef NEWLISP64
+			floatNum = *(double *)&cell->aux;
+		else if(cell->type == CELL_INT64)
+			floatNum = *(INT64 *)&cell->aux;
+#else
+			floatNum = *(double *)&cell->contents;
+#endif
+		else if(cell->type == CELL_LONG)
+			floatNum = (long)cell->contents;
+		else goto FORMAT_DATA_ERROR;
+
+		varPrintf((UINT)&fmtStream, fmt, floatNum);
+		goto NEXT_FORMAT;
+		}
+
+    if(fType != cell->type)
+		goto FORMAT_DATA_ERROR;
+
+	/* printf("stream>%s< with >%s<\n", (char *)cell->contents, fmt); */
+	varPrintf((UINT)&fmtStream, fmt, cell->contents);
+
+	NEXT_FORMAT:
+	*nextfmt = saveChar;
+	fmt = nextfmt;
+    params = params->next;
+	continue;
+
+	FORMAT_DATA_ERROR:
+	*nextfmt = saveChar;
+	closeStrStream(&fmtStream);
+    return(errorProcExt(ERR_FORMAT_DATA_TYPE, params));
+    }
+
+getFormatType(fmt, &fType);
+if(fType != 0)
+	{
+	closeStrStream(&fmtStream);
+    errorProcExt2(ERR_FORMAT_NUM_ARGS, stuffString(format));
+	}
+
+varPrintf((UINT)&fmtStream, fmt);
+/* writeStreamStr(&fmtStream, fmt, 0); */
+
+cell = getCell(CELL_STRING);
+cell->aux = fmtStream.position + 1;
+cell->contents = (UINT)fmtStream.buffer;
+
+return(cell);
+}
+
+void openStrStream(STREAM * stream, size_t buffSize, int reopenFlag)
+	{
+	if(stream->buffer != NULL && reopenFlag)
+		freeMemory(stream->buffer);
+	stream->buffer = stream->ptr = callocMemory(buffSize + 1);
+	stream->size = buffSize;	
+	stream->position = stream->handle = 0;
+	}
+
+void closeStrStream(STREAM * stream)
+	{
+	if(stream->buffer != NULL)
+		freeMemory(stream->buffer);
+	stream->buffer = stream->ptr = NULL;
+	stream->size = stream->position = 0;
+	if(stream->handle != 0)
+            {
+            close((int)stream->handle);
+            stream->handle = 0;
+            }
+	}
+	
+
+void writeStreamChar(STREAM * stream, char chr)
+{
+if(stream->position == stream->size)
+	{
+	stream->size += stream->size / 2;
+	stream->buffer = reallocMemory(stream->buffer, stream->size + 1);
+	memset(stream->buffer + stream->position, 0, stream->size - stream->position + 1);
+	stream->ptr = stream->buffer + stream->position;
+	}
+*(stream->ptr++) = chr;
+stream->position++;
+}
+
+
+void writeStreamStr(STREAM * stream, char * buff, size_t length)
+{
+size_t newPosition;
+
+if(length == 0) length = strlen(buff);
+newPosition = stream->position + length;
+
+if(newPosition >=  stream->size)
+	{
+	while(newPosition >= stream->size)
+		stream->size += stream->size / 2;
+	stream->buffer = reallocMemory(stream->buffer, stream->size + 1);
+	memset(stream->buffer + stream->position, 0, stream->size - stream->position + 1);
+	stream->ptr = stream->buffer + stream->position;
+	}
+	
+memcpy(stream->ptr, buff, length);
+stream->ptr += length;
+stream->position = newPosition;
+}
+
+
+/* creates a memory buffer and reads byte into it until  
+   the limiter is found 
+*/
+
+char * readStreamText(STREAM * stream, char * limit)
+{
+STREAM outStream;
+ssize_t findPos = -1;
+size_t searchLen;
+size_t llen = strlen(limit);
+char * result;
+
+memset(&outStream, 0, sizeof(STREAM));
+openStrStream(&outStream, MAX_STRING, 0);
+while(findPos == -1)
+    {
+    if((searchLen = strlen(stream->ptr)) < llen)
+		break;
+    findPos = searchBuffer(stream->ptr, searchLen, limit, llen, TRUE);
+    if(findPos != -1)
+        {
+        if(findPos > 0) 
+			writeStreamStr(&outStream, stream->ptr, findPos);
+        stream->ptr += findPos + llen;
+        result = allocMemory(outStream.position + 1);
+		memcpy(result, outStream.buffer, outStream.position);
+		*(result + outStream.position) = 0; 
+        closeStrStream(&outStream);
+        return(result);
+        }
+
+    writeStreamStr(&outStream, stream->ptr, searchLen - llen);
+
+    /* adjustment for the first time, after it will be 0 always */
+    stream->position += (stream->ptr - stream->buffer); 
+
+    stream->position += searchLen - llen;
+
+    if(stream->handle == 0) /* its not a file */
+        {
+        stream->buffer = stream->ptr;
+        break;
+        }
+    else
+        {
+        lseek(stream->handle, stream->position, SEEK_SET);
+        memset(stream->buffer, 0, stream->size + 1);
+        if(read(stream->handle, stream->buffer, stream->size) > 0)
+            stream->ptr = stream->buffer;
+        else 
+            {
+            *stream->ptr = 0; 
+            break;
+            }
+        }
+    }
+
+closeStrStream(&outStream);
+
+return(NULL);
+}
+
+
+/* this is only used for reading with getToken()
+   stream->size does not reflect the real size of
+   the buffer as in makeStreamFromFile() 
+*/
+void makeStreamFromString(STREAM * stream, char * str)
+{
+memset(stream, 0, sizeof(STREAM));
+stream->buffer = stream->ptr = str;
+/* make getToken work to the end of str */
+stream->size = strlen(str) + 4 * MAX_STRING;
+}
+
+int makeStreamFromFile(STREAM * stream, char * fileName, size_t size, size_t offset)
+{
+if((stream->handle = open(fileName, O_RDONLY | O_BINARY, 0)) == -1)
+	return(0);
+
+stream->ptr = stream->buffer = (char *)callocMemory(size + 1);
+if(offset != 0)
+	lseek((int)stream->handle, offset, SEEK_SET);
+
+stream->position = offset;
+stream->size = size;
+
+/* load first buffer */
+if(read(stream->handle, stream->buffer, size) <= 0)
+	{
+	closeStrStream(stream);
+	return(0);
+	}
+
+return(TRUE);
+}
+
+
+ssize_t searchBuffer(char * buffer,  size_t length, char * string, size_t size, int caseFlag)
+{
+size_t position = 0;
+
+if(caseFlag == FALSE)
+	{
+	while(position < length)
+		{
+		if(toupper(*buffer) == toupper(*string))
+			if(my_strnicmp(buffer, string, size) == 0) break;
+		position++;
+		buffer++;
+		}
+	}
+else /* case sensitive */
+	{
+	while(position < length)
+		{
+		if(*buffer == *string)
+			if(memcmp(buffer, string, size) == 0) break;
+		position++;
+		buffer++;
+		}
+	}
+
+if(position == length) return(-1);
+return(position);
+}
+
+/* eliminated in v.8.4.1
+CELL * patternMatchS(char * pattern, char * string)
+{
+CELL * cell;
+CELL * match;
+CELL * star, * plus;
+char * start;
+int starLen, len;
+
+start = string; starLen = len = 0;
+MATCH:
+switch(*pattern)
+	{
+	case '\\':
+		++pattern;
+		if(*pattern != *string) return(nilCell);
+		break;
+	case 0:
+		if(*string != 0) return(nilCell);
+		return(stuffStringN(start, len));
+	case '?':
+		if(*string == 0) return(nilCell);
+		break;
+	case '#':
+		if(*string == 0) return(nilCell);
+		if(!isDigit((unsigned char)*string)) return(nilCell);
+		break;
+
+	case '+':	
+		if(*(pattern + 1) == 0)
+			{
+			if(*string == 0)
+				plus = stuffString("");
+			else if(*(string + 1) == 0)
+				plus = stuffStringN(string, 1);
+			else return(nilCell);
+
+			if(len == 0) return(plus);
+			cell = stuffStringN(start, len);
+			cell->next = plus;
+			return(cell);
+			}
+			
+		if((match = patternMatchS(pattern+1, string)) != nilCell)
+			plus = stuffString("");
+		else if((match = patternMatchS(pattern+1, string+1)) != nilCell)
+			plus = stuffStringN(string, 1);
+		else return(nilCell);
+			
+		if(len == 0) cell = plus;
+		else
+			{
+			cell = stuffStringN(start, len);
+			cell->next = plus;
+			}
+		plus->next = match;
+		return(cell);
+
+	case '*':
+		if(*(pattern + 1) == 0)
+			{
+			if(len == 0) return(stuffString(string));
+			cell = stuffStringN(start, len);
+			cell->next = stuffString(string);
+			return(cell);
+			}
+
+		if((match = patternMatchS(pattern+1, string)) != nilCell)
+			{
+			star = stuffStringN(start+len, starLen);
+			if(len == 0) cell = star;
+			else
+				{
+				cell = stuffStringN(start, len);
+				cell->next = star;
+				}
+			star->next = match;
+			return(cell);
+			}
+
+		if(*string != 0) ++string, ++starLen;
+		else return(nilCell);
+		goto MATCH;
+
+	default:
+		if(*pattern != *string) return(nilCell);
+		break;
+	}
+++pattern;
+++string;
+++len;
+goto MATCH;
+}
+*/
+
+
+CELL * p_integer(CELL * params)
+{
+char * intString;
+INT64 num;
+long base;
+CELL * deflt;
+INT64 result;
+
+deflt = params->next;
+params = evaluateExpression(params);
+
+if(params->type == CELL_STRING)
+	intString = (char *)params->contents;
+else if(isNumber(params->type))
+	{
+	getInteger64(params, &num);
+	return(stuffInteger64(num));
+	}
+else 
+	return(copyCell(evaluateExpression(deflt)));
+
+while(isspace((int)*intString)) intString++;
+if(!isDigit((unsigned char)*intString))
+	{
+	if(*intString != '-' && *intString != '+')
+		return(copyCell(evaluateExpression(deflt)));
+	if(!isDigit((unsigned char)*(intString+1)))
+		return(copyCell(evaluateExpression(deflt)));
+	}
+
+if(deflt->next != nilCell)
+	getInteger(deflt->next, (UINT *)&base);
+else base = 0;
+#ifdef TRU64 
+result = strtoul(intString, NULL, base); 
+#else 
+result = strtoull(intString,(char **)0, base); 
+#endif 
+return(stuffInteger64(result)); 
+}
+
+CELL * p_float(CELL * params)
+{
+char * fltString;
+double value;
+CELL * deflt;
+
+deflt = params->next;
+params = evaluateExpression(params);
+
+if(params->type == CELL_STRING)
+	fltString = (char *)params->contents;
+else if(isNumber(params->type))
+	{
+	getFloat(params, &value);
+	return(stuffFloat(&value));
+	}
+else
+	return(copyCell(evaluateExpression(deflt)));
+
+while(isspace((int)*fltString)) fltString++;
+if(!isDigit((unsigned char)*fltString))
+	{
+	if(*fltString != '-' && *fltString != '+' && *fltString != lc_decimal_point)
+		return(copyCell(evaluateExpression(deflt)));
+	if(!isDigit((unsigned char)*(fltString+1)))
+		return(copyCell(evaluateExpression(deflt)));
+	}
+
+value = atof(fltString);
+return( stuffFloat(&value) );
+}
+
+
+CELL * p_symbol(CELL * params)
+{
+char * token;
+char number[32];
+SYMBOL * context;
+SYMBOL * sPtr;
+CELL * cell;
+#ifdef WIN_32
+char * fmt = "%I64d";
+#endif
+
+
+cell = evaluateExpression(params);
+switch(cell->type)
+	{
+	case CELL_LONG:
+		snprintf(number, 30, "%ld", cell->contents);
+		token = number;
+		break;
+#ifndef NEWLISP64
+	case CELL_INT64:
+#ifdef TRU64
+        snprintf(number, 30, "%ld", *(INT64 *)&cell->aux); 
+#else
+
+#ifdef WIN_32
+        snprintf(number, 30, fmt, *(INT64 *)&cell->aux);
+#else
+        snprintf(number, 30, "%lld", *(INT64 *)&cell->aux);
+#endif /* WIN_32 */
+
+#endif /* TRUE64 */
+		token = number;
+		break;
+#endif /* NEWLISP64 */
+	case CELL_FLOAT:
+#ifndef NEWLISP64
+		snprintf(number, 30, "%1.10g",*(double *)&cell->aux);
+#else
+		snprintf(number, 30, "%1.10g",*(double *)&cell->contents);
+#endif
+		token = number;
+		break;
+	case CELL_STRING:
+		token = (char*)cell->contents;
+		break;
+	case CELL_SYMBOL:
+		sPtr = (SYMBOL*)cell->contents;
+		token = sPtr->name;
+		break;
+	default:
+		return(errorProcExt(ERR_NUMBER_OR_STRING_EXPECTED, params));
+	}
+params = params->next;
+	
+if(params == nilCell)
+	context = currentContext;
+else if((context = getCreateContext(params, TRUE)) == NULL)
+	return(errorProcExt(ERR_SYMBOL_OR_CONTEXT_EXPECTED, params));
+
+if(params->next != nilCell)
+	{
+	cell = evaluateExpression(params->next);
+        if(cell->type == CELL_NIL)
+		{
+		sPtr = lookupSymbol(token, context);
+		if(sPtr == NULL) return(nilCell);
+		return(stuffSymbol(sPtr));
+		}
+	}
+
+sPtr = translateCreateSymbol(token, CELL_NIL, context, TRUE);
+return(stuffSymbol(sPtr));
+}
+
+	
+
+CELL * p_symbolSource(CELL * params)
+{
+STREAM strStream;
+CELL * cell;
+
+openStrStream(&strStream, MAX_STRING, 0);
+serializeSymbols(params, (UINT)&strStream);
+cell = stuffString(strStream.buffer);
+closeStrStream(&strStream);
+return(cell);
+}
+
+
+CELL * p_string(CELL * params)
+{
+CELL * cell;
+STREAM strStream;
+
+openStrStream(&strStream, MAX_STRING, 0);
+prettyPrintFlags |= PRETTYPRINT_STRING;
+while (params != nilCell)
+	{
+	cell = evaluateExpression(params);
+	if(cell->type == CELL_STRING) /* speed optimization for strings */
+	    writeStreamStr(&strStream, (char *)cell->contents, 0);
+	else
+	    printCell(cell , FALSE, (UINT)&strStream);                                                    
+    params = params->next;
+	}
+prettyPrintFlags &= ~PRETTYPRINT_STRING;
+cell = stuffString(strStream.buffer);
+
+closeStrStream(&strStream);
+return(cell);
+}
+
+
+UINT getAddress(CELL * params)
+{
+UINT num;
+
+params = evaluateExpression(params);
+
+#ifndef NEWLISP64
+if(params->type == CELL_INT64)
+	{
+	num = *(INT64 *)&params->aux;
+	return(num);
+	}
+else if(params->type == CELL_FLOAT)
+	{
+	num = *(INT64 *)&params->aux;
+	return(num);
+	}
+#else
+if(params->type == CELL_FLOAT)
+	{
+	num = *(double *)&params->contents;
+	return(num);
+	}
+#endif
+
+return(params->contents);
+
+}
+
+CELL * p_getChar(CELL * params)
+{
+return(stuffInteger((UINT)*(char*)getAddress(params)));
+}
+
+CELL * p_getString(CELL * params)
+{
+return(stuffString((char *)getAddress(params)));
+}
+
+CELL * p_getInteger(CELL * params)
+{
+return(stuffInteger(*(unsigned int *)getAddress(params)));
+}
+
+CELL * p_getLong(CELL * params)
+{
+#ifndef NEWLISP64
+return(stuffInteger64(*(INT64 *)getAddress(params)));
+#else
+return(stuffInteger(*(UINT *)getAddress(params)));
+#endif
+}
+
+CELL * p_getFloat(CELL * params)
+{
+return(stuffFloat((double*)getAddress(params)));
+}
+
+
+CELL * p_address(CELL * params)
+{
+params = evaluateExpression(params);
+switch(params->type)
+    {
+    case CELL_LONG:
+        return(stuffInteger((UINT)&params->contents));
+#ifndef NEWLISP64
+    case CELL_INT64:
+    case CELL_FLOAT:
+        return(stuffInteger((UINT)&params->aux));
+#else
+	case CELL_FLOAT:
+		return(stuffInteger((UINT)&params->contents));
+#endif
+    default:
+        break;
+    }
+return(stuffInteger(params->contents));
+}
+
+
+CELL * p_copyMemory(CELL * params)
+{
+UINT toAddress, fromAddress, nBytes;
+CELL * cell;
+
+cell = evaluateExpression(params);
+params = params->next;
+fromAddress = getAddress(cell);
+
+cell = evaluateExpression(params);
+toAddress = getAddress(cell);
+
+getInteger(params->next, &nBytes);
+
+memcpy((char*)toAddress, (char*)fromAddress, nBytes);
+
+return(stuffInteger(nBytes));
+}
+
+
+CELL * cellTokenString(char * * source, size_t * srclen, char * separator, pcre * re)
+{
+char * start;
+char * src;
+ssize_t len, slen;
+int ovector[OVECCOUNT];
+int rc;
+
+if(*source == NULL) return(stuffString(""));
+start = src = *source;
+len = 0;
+slen = strlen(separator);
+
+if(re == NULL)
+    {
+    while(*src != 0)
+	{
+        if(*src == *separator)
+            {
+            if(strncmp(src, separator, slen) == 0)
+                {
+                *source = src+slen;
+                if(**source == 0) /* last token is separator */
+                     *source = NULL;
+                return(stuffStringN(start, len));
+                }
+            }
+	src++;
+	len++;
+        }
+    *source = src;
+    if(len == 0) return(NULL);
+    return(stuffStringN(start, len));
+    }
+else  if(*src != 0)
+    {
+    len = *srclen;
+    rc = pcre_exec(re, NULL, src, len, 0, 0, ovector, OVECCOUNT);
+
+    /* matching failed */
+    if (rc == -1)  
+        {
+        *source = src + len;
+        return(stuffStringN(src, len));
+        }
+
+    /* error in pcre_exec() */
+    if (rc < 0) 
+        regexError("error in pcre_exec()", rc, "");
+
+    *source = src + ovector[1];
+    *srclen -= ovector[1];
+    if(**source == 0) /* last token is separator */
+        *source = NULL;
+
+    if(ovector[1] - ovector[0] == 0)
+        return(NULL);
+
+    return(stuffStringN(src, ovector[0]));
+    }
+
+return(NULL);
+}
+
+
+CELL * p_parse(CELL * params)
+{
+CELL * cell;
+CELL * newCell;
+CELL * result;
+char * string;
+char * separator;
+char token[MAX_STRING];
+STREAM stream;
+int tklen;
+size_t srclen;
+/* PCRE stuff */
+long options = 0;
+pcre *re = NULL;
+
+params = getStringSize(params, &string, &srclen, TRUE);
+if(params == nilCell) separator = NULL;
+else 
+    {
+    params = getString(params, &separator);
+    if(params != nilCell) 
+        {
+        getInteger(params, (UINT *)&options);
+        /* Compile the regular expression in separator */
+        re = pcreCachedCompile(separator, options); 
+        }
+    else re = NULL;
+    }
+
+if(separator == NULL) 
+    makeStreamFromString(&stream, string);
+
+result = cell = getCell(CELL_EXPRESSION);
+while(string != NULL)
+	{
+	if(separator != NULL)
+		{
+		if((newCell = cellTokenString(&string, &srclen, separator, re)) == NULL)
+			break;
+		}
+	else
+		{
+		if(getToken(&stream, token, &tklen) == TKN_EMPTY) break;
+		newCell = stuffString(token);
+		}
+
+	if(cell == result)
+		result->contents = (UINT)newCell;
+	else 
+		cell->next = newCell;
+
+	cell = newCell;
+        if(string == NULL) 
+            newCell->next = stuffString("");
+	}
+
+return(result);
+}
+
+#define PACK_NONE 0
+#define PACK_CHAR 1
+#define PACK_BYTE 2
+#define PACK_INT 3
+#define PACK_UNSIGNED_INT 4
+#define PACK_LONG 5
+#define PACK_UNSIGNED_LONG 6
+#define PACK_LONG_LONG 7
+#define PACK_UNSIGNED_LONG_LONG 8
+#define PACK_FLOAT 9
+#define PACK_DOUBLE 10
+#define PACK_STRING 11
+#define PACK_NULL 12
+#define PACK_BIG_ENDIAN 13
+#define PACK_LITTLE_ENDIAN 14
+
+
+void swapEndian(char * data, int n)
+{
+char tmp[8];
+int i;
+
+i = n;
+while(i) { tmp[n - i] = data[i - 1]; i--; }
+   
+memcpy(data, &tmp[0], n);
+}
+
+
+CELL * p_pack(CELL * params)
+{
+char * format;
+char * source;
+char * packed;
+char * pPtr;
+CELL * cell;
+ssize_t length, ln;
+int len, type;
+int listFlag = 0;
+int bigEndian = 1, endianSwitch = 0;
+char chrV;
+unsigned char byteV;
+short int shortV;
+unsigned short int uint16V;  /* 16 bit */
+unsigned int uint32V;         /* 32 bit */
+unsigned long long  uint64V; /* 64 bit */
+float floatV;
+double doubleV;
+
+/* find out endianess */
+bigEndian = (*((char *)&bigEndian) == 0) ;
+
+params = getString(params, &format);
+source = format;
+length = 0;
+while((source = parsePackFormat(source, &len, &type)) != NULL)
+	length += len;
+
+if(length == 0) return(stuffString(""));
+pPtr = packed = allocMemory(length);
+source = format;
+length = 0;
+
+while((source = parsePackFormat(source, &len, &type)) != NULL)
+	{
+	if(type == PACK_NULL)
+		{
+		memset(pPtr, 0, len);
+		pPtr += len;
+		length += len;
+		continue;
+		}
+		
+	else if(type == PACK_LITTLE_ENDIAN || type == PACK_BIG_ENDIAN)
+		{
+		endianSwitch = ((type == PACK_BIG_ENDIAN) != bigEndian);
+		continue;
+		}
+
+	if(params->type == CELL_NIL) break;
+	if(listFlag)
+		cell = params;
+	else
+		cell = evaluateExpression(params);
+	/* accept data in a list, (will recurse into it but never come out) */
+	if(isList(cell->type))
+		{
+		cell = (CELL *)cell->contents;
+		params = cell;
+		listFlag = 1;
+		}
+#ifndef NEWLISP64
+	if(cell->type == CELL_FLOAT || cell->type == CELL_INT64)
+		uint64V = *(INT64 *)&cell->aux;
+	else /* CELL_LONG and CELL_STRING */
+		uint64V = cell->contents;
+#else
+	uint64V = cell->contents;
+#endif
+	
+	switch(type)
+		{
+		case PACK_NONE:
+			break;
+
+		case PACK_BYTE:
+			byteV = (char)uint64V;
+			memcpy(pPtr, &byteV, 1);
+			break;
+
+		case PACK_CHAR:
+			chrV = (char)uint64V;
+			memcpy(pPtr, &chrV, 1);
+			break;
+
+		case PACK_INT:
+			shortV = (short int)uint64V;
+			memcpy(pPtr, &shortV, 2);
+			if(endianSwitch) swapEndian(pPtr, 2);
+			break;
+
+		case PACK_UNSIGNED_INT:
+			uint16V = (unsigned short int)uint64V;
+			memcpy(pPtr, &uint16V, 2);
+			if(endianSwitch) swapEndian(pPtr, 2);
+			break;
+
+		case PACK_LONG:
+		case PACK_UNSIGNED_LONG:
+			uint32V = (unsigned int)uint64V;
+			memcpy(pPtr, &uint32V, 4);
+			if(endianSwitch) swapEndian(pPtr, 4);
+			break;
+
+		case PACK_LONG_LONG:
+		case PACK_UNSIGNED_LONG_LONG:
+			memcpy(pPtr, &uint64V, 8);
+			if(endianSwitch) swapEndian(pPtr, 8);
+			break;
+
+		case PACK_FLOAT:
+		case PACK_DOUBLE:
+			if(cell->type == CELL_FLOAT)
+				doubleV = *(double *)&uint64V;
+			else doubleV = (double)uint64V;
+			if(type == PACK_FLOAT)
+				{
+				floatV = doubleV;
+				memcpy(pPtr, &floatV, 4);
+				if(endianSwitch) swapEndian(pPtr, 4);
+				}
+			else
+				{
+				memcpy(pPtr, &doubleV, 8);
+				if(endianSwitch) swapEndian(pPtr, 8);
+				}
+			break;
+			
+		case PACK_STRING:
+			if(cell->type == CELL_STRING)
+				{
+				ln = cell->aux - 1;
+				if(len <= ln)
+					memcpy(pPtr, (void *)cell->contents, len);
+				else
+					{
+					memcpy(pPtr, (void*)cell->contents, ln);
+					memset(pPtr + ln, 0, len - ln);
+					}
+				}
+			else memset(pPtr,  0, len);
+			break;
+
+		default:
+			break;
+		}
+
+	pPtr += len;
+	params = params->next;
+	length += len;
+	}
+
+cell = stuffStringN(packed, length);
+free(packed);
+return(cell);
+}
+
+
+char * parsePackFormat(char * format, int * length, int * type)
+{
+*length = 0;
+while(*format == ' ') format++;
+
+if(*format == 0) return(NULL);
+
+switch(*format)
+	{
+	case '<':
+		*type = PACK_LITTLE_ENDIAN;
+		format++;
+		break;
+	        
+	case '>':
+		*type = PACK_BIG_ENDIAN;
+		format++;
+		break;
+                
+	case 'b':
+		*length = 1;	
+		*type = PACK_BYTE;
+		format++;
+		break;
+
+	case 'c':
+		*length = 1;	
+		*type = PACK_CHAR;
+		format++;
+		break;
+	case 's':
+	case 'n':
+		*type = (*format == 's') ? PACK_STRING : PACK_NULL;
+		format++;
+		if(isdigit((int)*format) )
+			{
+			*length = atol(format);
+			while(isdigit((int)*format)) format++;
+			}
+		else *length = 1;
+		
+		break;
+	case 'd':
+	case 'u':
+		*type = (*format == 'd') ? PACK_INT : PACK_UNSIGNED_INT;
+		*length = 2;
+		format++;
+		break;
+	case 'l':
+		if(*(format + 1) == 'd' || *(format + 1) == 'u')
+			{
+			*length = 4;
+			*type = (*(format + 1) == 'd') ? PACK_LONG : PACK_UNSIGNED_LONG;
+			format += 2;
+			}
+		else if(*(format + 1) == 'f')
+			{
+			*length = 8;
+			*type = PACK_DOUBLE;
+			format += 2;
+			}
+		else 
+			{
+			*type = PACK_NONE;
+			format++;
+			}
+		break;
+	case 'L':
+		if(*(format + 1) == 'd' || *(format + 1) == 'u')
+			{
+			*length = 8;
+			*type = (*(format + 1) == 'd') ? PACK_LONG_LONG : PACK_UNSIGNED_LONG_LONG;
+			format += 2;
+			}
+		else 
+			{
+			*type = PACK_NONE;
+			format++;
+			}
+		break;
+	case 'f':
+		*length = 4;
+		*type = PACK_FLOAT;
+		format++;
+		break;
+	default:
+		*type = PACK_NONE;
+		format++;
+		break;
+	}
+
+return(format);
+}
+
+
+CELL * p_unpack(CELL * params)
+{
+char * format;
+char * source;
+char * pPtr;
+CELL * cell;
+CELL * result;
+CELL * next;
+size_t length, maxlen;
+int len;
+int type;
+int bigEndian = 1, endianSwitch = 0;
+char chrV;
+unsigned char byteV;
+short shortV;
+unsigned short uint16V;
+int int32V;
+unsigned int uint32V;
+unsigned long long int uint64V;
+float floatV;
+double doubleV;
+
+/* find out endianess */
+bigEndian = (*((char *)&bigEndian) == 0) ;
+
+params = getString(params, &format);
+params = evaluateExpression(params);
+
+if(params->type == CELL_STRING)
+    {
+    pPtr = (char *)params->contents; 
+    maxlen = params->aux - 1;
+    }
+else
+    {
+    getIntegerExt(params, (void*)&pPtr, FALSE);
+    maxlen = MAX_LONG;
+    }
+    
+length = 0;
+source = format;
+result = getCell(CELL_EXPRESSION);
+next = NULL;
+
+while( (source = parsePackFormat(source, &len, &type))!= NULL)
+	{
+	if(length + len > maxlen) break;
+
+	if(type == PACK_LITTLE_ENDIAN || type == PACK_BIG_ENDIAN)
+		{
+		endianSwitch = ((type == PACK_BIG_ENDIAN) != bigEndian);
+		continue;
+		}
+                
+	switch(type)
+		{		
+		case PACK_NULL:
+			pPtr += len;
+			length += len;
+			continue;
+	
+		case PACK_BYTE:
+			memcpy(&byteV, pPtr, 1);
+			cell = getCell(CELL_LONG);
+			cell->contents = byteV;
+			break;
+
+		case PACK_CHAR:
+			memcpy(&chrV, pPtr, 1);
+			cell = getCell(CELL_LONG);
+			cell->contents = chrV;
+			break;
+
+		case PACK_INT:
+			memcpy(&shortV, pPtr, 2);
+		        if(endianSwitch) swapEndian((char*)&shortV, 2);
+			cell = getCell(CELL_LONG);
+			cell->contents = (int)shortV;
+			break;
+
+		case PACK_UNSIGNED_INT:
+			memcpy(&uint16V, pPtr, 2);
+		        if(endianSwitch) swapEndian((char*)&uint16V, 2);
+			cell = getCell(CELL_LONG);
+			cell->contents = uint16V;
+			break;
+
+		case PACK_LONG:
+			memcpy(&int32V, pPtr, 4);
+			if(endianSwitch) swapEndian((char *)&int32V, 4);
+#ifndef NEWLISP64
+			cell = getCell(CELL_INT64);
+			*(INT64 *)&cell->aux = int32V;
+#else
+			cell = getCell(CELL_LONG);
+			*(long *)&cell->contents = int32V;
+#endif
+			break;
+
+		case PACK_UNSIGNED_LONG:
+			memcpy(&uint32V, pPtr, 4);
+			if(endianSwitch) swapEndian((char*)&uint32V, 4);
+#ifndef NEWLISP64
+			cell = getCell(CELL_INT64);
+			*(INT64 *)&cell->aux = uint32V;
+#else
+			cell = getCell(CELL_LONG);
+			cell->contents = uint32V;
+#endif
+			break;
+
+		case PACK_LONG_LONG:
+		case PACK_UNSIGNED_LONG_LONG:
+			memcpy(&uint64V, pPtr, 8);
+		        if(endianSwitch) swapEndian((char*)&uint64V, 8);
+#ifndef NEWLISP64
+			cell = getCell(CELL_INT64);
+			memcpy(&cell->aux, &uint64V, 8);
+#else
+			cell = getCell(CELL_LONG);
+			cell->contents = uint64V;
+#endif
+			break;
+
+		case PACK_FLOAT:
+			memcpy(&floatV, pPtr, 4);
+		        if(endianSwitch) swapEndian((char*)&floatV, 4);
+			doubleV = floatV;
+			cell = stuffFloat(&doubleV);
+			break;
+
+		case PACK_DOUBLE:
+			memcpy(&doubleV, pPtr, 8);
+			if(endianSwitch) swapEndian((char*)&doubleV, 8);
+			cell = stuffFloat(&doubleV);
+			break;
+			
+		case PACK_STRING:
+			cell = stuffStringN(pPtr, len);
+			break;
+
+		default:
+			cell = getCell(CELL_NIL);
+			break;
+		}
+
+	pPtr += len; length += len;
+	if(next == NULL)
+		result->contents = (UINT)cell;
+	else	
+		next->next = cell;
+	
+	next = cell;
+	}
+
+return(result);
+}
+
+
+CELL * p_trim(CELL * params)
+{
+char * str;
+size_t left, right, len;
+char * trimChr;
+#ifndef SUPPORT_UTF8
+char * ptr;
+char lchr, rchr;
+#else
+int * wstr;
+int * wptr;
+int lchr, rchr;
+CELL * result;
+#endif
+
+params = getString(params, &str);
+
+#ifndef SUPPORT_UTF8
+len = strlen(str);
+ptr = str;
+#else
+len = utf8_wlen(str);
+wptr = wstr = allocMemory((len + 1) * sizeof(int));
+len = utf8_wstr(wstr, str, len);
+#endif
+
+if(len == 0)
+	return(stuffString(str));
+
+if(params == nilCell)	
+	lchr = rchr = 32;
+else 
+	{
+	params = getString(params, &trimChr);
+#ifndef SUPPORT_UTF8
+	lchr = *trimChr;
+#else
+	utf8_wchar(trimChr, &lchr);
+#endif
+	if(params != nilCell)
+		{
+		getString(params, &trimChr);
+#ifndef SUPPORT_UTF8
+		rchr = *trimChr;
+#else
+		utf8_wchar(trimChr, &rchr);
+#endif
+		}		
+	else rchr = lchr;
+	}
+
+left = right = 0;
+#ifndef SUPPORT_UTF8
+while(*str == lchr) str++, left++;
+#else
+while(*wstr == lchr) wstr++, left++;
+#endif
+
+if(left == len)
+	return(stuffString(""));
+
+#ifndef SUPPORT_UTF8
+str = ptr + len - 1;
+while(*str == rchr && right < len) str--, ++right;
+
+return(stuffStringN(ptr + left, len - left - right));
+
+#else
+
+wstr = wptr + len - 1;
+while(*wstr == rchr && right < len) wstr--, ++right;
+
+*(wptr + len - right) = 0;
+
+str = allocMemory((len - left - right + 1) * UTF8_MAX_BYTES);
+len = wstr_utf8(str, wptr + left, (len - left - right) * UTF8_MAX_BYTES);
+free(wptr);
+result = stuffStringN(str, len);
+free(str);
+return(result);
+#endif
+
+}
+
+
+
+/* ------- PRCE Perl Compatible Regular Expressions for all platforms ------- */
+/*                    see also http://www.pcre.org/                           */
+
+
+void regexError(char * msg_1, int num, const char * msg_2);
+
+
+
+CELL * p_regex(CELL * params)
+{
+pcre *re;
+int ovector[OVECCOUNT];
+int rc, idx;
+char * pattern;
+char * string;
+long options = 0;
+int len;
+CELL * cell, * result, * strCell;
+
+cell = getString(params, &pattern);
+strCell = evaluateExpression(cell);
+if(strCell->type != CELL_STRING)
+	return(errorProcExt(ERR_STRING_EXPECTED, cell));
+
+string = (char *)strCell->contents;
+
+params = cell->next;
+if(params != nilCell)
+    params = getInteger(params, (UINT *)&options);
+
+/* Compile the regular expression in the first argument */
+re = pcreCachedCompile(pattern, (int)options);
+
+/* Compilation succeeded: match the subject in the second argument */
+rc = pcre_exec(
+    re,                    /* the compiled pattern */
+    NULL,                  /* no extra data - we didn't study the pattern */
+    string,                /* the subject string */
+    (int)strCell->aux - 1, /* the length of the subject */
+    0,                     /* start at offset 0 in the subject */
+    0,                     /* default options */
+    ovector,               /* output vector for substring information */
+    OVECCOUNT);            /* number of elements in the output vector */
+
+/* Matching failed */
+if (rc == -1)
+    return(nilCell);
+
+/* error in pcre_exec() */
+if (rc < 0) 
+    regexError("error in pcre_exec()", rc, "");
+
+/* Match succeded */
+
+/* Show substrings stored in the output vector */
+result = cell = getCell(CELL_EXPRESSION);
+for(idx = 0; idx < rc; idx++)
+    {
+    len = ovector[2*idx+1] - ovector[2*idx];
+    strCell = stuffStringN(string + ovector[2*idx], len);
+
+    deleteList((CELL*)sysSymbol[idx]->contents);
+    sysSymbol[idx]->contents = (UINT)copyCell(strCell);
+
+    if(idx == 0)
+        {
+        cell->contents = (UINT)strCell;
+        cell = (CELL *)cell->contents;
+        }
+    else	
+        {
+        cell->next = strCell;
+        cell = cell->next;
+        }
+
+    cell->next = stuffInteger(ovector[2*idx]);
+    cell = cell->next;
+    cell->next = stuffInteger(len);
+    cell = cell->next;
+    }
+
+return(result);
+}
+
+
+ssize_t searchBufferRegex(char * string,  int offset, 
+                          char * pattern, int length, int options, int * len)
+{
+pcre *re;
+int ovector[OVECCOUNT];
+int rc, idx;
+CELL * cell;
+
+options &= ~REPLACE_ONCE; /* turn custom bit off for PCRE */
+
+/* Compile the regular expression in the first argument */
+re = pcreCachedCompile(pattern, options);
+
+/* Compilation succeeded: match the subject in the second argument */
+rc = pcre_exec(re, NULL, string, length, offset, 0, ovector, OVECCOUNT);
+
+/* matching failed */
+if (rc == -1)  
+    return(-1);
+
+/* error in pcre_exec() */
+if (rc < 0) 
+    regexError("error in pcre_exec()", rc, "");
+
+
+for(idx = 0; idx < rc; idx++)
+    {
+    cell = stuffStringN(string  + ovector[2*idx], ovector[2*idx+1] - ovector[2*idx]);
+    deleteList((CELL*)sysSymbol[idx]->contents);
+    sysSymbol[idx]->contents = (UINT)cell;
+    }
+
+if(len != NULL)
+    *len = ovector[1] - ovector[0];
+
+return((UINT)ovector[0]);
+}
+
+
+pcre * pcreCachedCompile(char * pattern, int options)
+{
+const char * error;
+int errOffset;
+static char * cPattern = NULL;
+static pcre * re = NULL;
+static int cacheOptions = -1;
+UINT len;
+
+if((cPattern == NULL) || (strcmp(cPattern, pattern) != 0) || (options != cacheOptions))
+    {
+    cacheOptions = options;
+    if(cPattern != NULL) freeMemory(cPattern);
+    len = strlen(pattern);
+    cPattern = (char *)allocMemory(len + 1);
+    memcpy(cPattern, pattern, len + 1);
+#ifdef WIN_32
+    if(re != NULL) free(re);
+#else
+    if(re != NULL) (pcre_free)(re);
+#endif
+    re = pcre_compile(pattern, options, &error, &errOffset, NULL); 
+
+    /* Compilation failed: print the error message and exit */
+    if (re == NULL) 
+        {
+        freeMemory(cPattern);
+        cPattern = NULL;
+        regexError("offset", errOffset, error);
+        }
+    } 
+
+return(re);
+}
+    
+
+void regexError(char * msg_1, int number, const char * msg_2)
+{
+CELL * cell;
+char * errorBuff = malloc(256);
+snprintf(errorBuff, 256,  "%s %d %s:", msg_1, number, msg_2);
+cell = stuffString(errorBuff);
+free(errorBuff);
+fatalError(ERR_REGEX, cell, 0);
+}
+
+
+
+/* replace string with or without (options = -1) regular expressions */
+
+typedef struct {
+    int offset;
+    int length;
+    char * repStr;
+    int repLen;
+    void * next;
+    } REGEX;
+
+void freeRegex(REGEX * regex);
+
+char * replaceString
+   (char * keyStr, int keyLen, char * buff, size_t buffLen, CELL * exprCell, 
+    UINT * cnt, int options, size_t * newLen)
+{
+ssize_t oldLen, findPos;
+size_t count, offset;
+size_t repLen;
+char * newBuff;
+CELL * cell;
+REGEX * start_rx = NULL, * end_rx = NULL;
+int resultStackIdxSave;
+int errNo;
+int bias = 0;
+
+*newLen = oldLen = 0;
+*cnt = 0;
+offset = count = 0;
+
+/* save all found string and fill sys variables $0, $1 ... etc */
+while(offset <= buffLen)
+    {
+    if(options == -1)
+        findPos = searchBuffer(buff + offset, buffLen - offset, keyStr, keyLen, TRUE);
+    else
+        findPos = searchBufferRegex(buff, (int)offset, keyStr, (int)buffLen, options, &keyLen);
+
+    if(findPos == -1) break;
+    
+    if(options != -1) findPos -= offset;
+
+    if(count == 0)
+        start_rx = end_rx = (REGEX *)callocMemory(sizeof(REGEX));
+    else
+        {
+        end_rx->next = callocMemory(sizeof(REGEX));
+        end_rx = end_rx->next;
+        }
+
+    end_rx->next = NULL;
+    end_rx->offset = findPos + offset; /* pos where pattern found */
+
+    resultStackIdxSave = resultStackIdx; 
+
+	if((cell = evaluateExpressionSafe(exprCell, &errNo)) == NULL)
+		{
+		freeRegex(start_rx);
+		longjmp(errorJump, errNo);
+		}	
+
+    end_rx->length = keyLen;           /* length of pattern found */
+    if(cell->type == CELL_STRING)
+        {
+        repLen = end_rx->repLen = cell->aux-1;
+        end_rx->repStr = (char *)allocMemory(repLen + 1); /* replacement string */
+        memcpy(end_rx->repStr, (char *)cell->contents, cell->aux); 
+        }
+    else /* if replacement expression is not string leave old content */
+        {
+        repLen = end_rx->repLen = keyLen;
+        end_rx->repStr = (char *)callocMemory(repLen + 1);
+        memcpy(end_rx->repStr, buff + offset + findPos, keyLen);
+        }
+
+    cleanupResults(resultStackIdxSave); 
+
+    count++;
+    offset += findPos + keyLen; /* next start for search */
+    oldLen += keyLen; /* space occupied by old content */
+    *newLen += repLen; /* space needed by new replacement content */
+
+    bias = (keyLen == 0);
+    offset += bias;
+
+    if(options != -1)
+	if(options & REPLACE_ONCE) break; 
+    }
+
+if(count == 0) return(NULL);
+
+*newLen = buffLen - oldLen + *newLen;
+newBuff = callocMemory(*newLen + 1);
+
+end_rx = start_rx;
+
+/* count is now offset into the new buffer */
+*cnt = count;
+count = start_rx->offset;
+memcpy(newBuff, buff, count);  
+
+while(start_rx != NULL) /* replace */
+    {
+    repLen = start_rx->repLen;
+    memcpy(newBuff + count, start_rx->repStr, repLen);
+    count += repLen;
+    freeMemory(start_rx->repStr);
+
+    end_rx = start_rx->next;
+    if(end_rx != NULL) /* copy from buffer */
+      {
+      repLen =  end_rx->offset - start_rx->offset - start_rx->length;
+      memcpy(newBuff + count, buff + start_rx->offset + start_rx->length, repLen);
+      count += repLen;
+      }                   
+    
+    freeMemory(start_rx);
+    start_rx = end_rx;
+    }
+/*
+printf("count %d buffLen %d offset %d bias %d str %s lencpy %d\n",  
+        count, buffLen, offset, bias, buff + offset - bias, buffLen - offset + bias);
+*/
+memcpy(newBuff + count, buff + offset - bias, buffLen - offset + bias);
+return(newBuff);
+}
+
+
+void freeRegex(REGEX * regex)
+{
+REGEX * oldRegex;
+
+while(regex != NULL)
+	{
+    if(regex->repStr != NULL)
+		freeMemory(regex->repStr);
+    oldRegex = regex;
+	regex = regex->next;
+	free(oldRegex);
+	}
+}
+
+/* eof */
+
+
diff --git a/nl-symbol.c b/nl-symbol.c
new file mode 100644
index 0000000..bb8abcc
--- /dev/null
+++ b/nl-symbol.c
@@ -0,0 +1,815 @@
+/* nl-symbol.c --- symbol handling routines for newLISP
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+
+#include "newlisp.h"
+#include "protos.h"
+
+
+extern CELL * cellMemory;
+extern SYMBOL * trueSymbol;
+extern SYMBOL * orSymbol;
+
+SYMBOL * findInsertSymbol(char * key, int forceCreation);
+int deleteSymbol(char * key);
+void deleteContextSymbols(CELL * cell);
+CELL dumpSymbol(char * name);
+void collectSymbols(SYMBOL * sPtr, CELL * symbolList, CELL * * nextSymbol);
+void symbolReferences(SYMBOL * sPtr,  CELL * symbolList, CELL * * nextSymbol);
+static SYMBOL * root;	/* root symbol derived from context */
+
+/* --------- return a list of all symbols in a context -------------- */
+
+
+CELL * p_symbols(CELL * params)
+{
+SYMBOL * context;
+CELL * symbolList;
+CELL * nextSymbol;
+
+symbolList = getCell(CELL_EXPRESSION);
+nextSymbol = NULL;
+
+if(params->type == CELL_NIL) 
+	context = currentContext;
+else
+	getContext(params, &context);
+
+if(context) /* check in case we are in debug mode */
+	collectSymbols((SYMBOL *)((CELL *)context->contents)->aux, symbolList, &nextSymbol);
+return(symbolList);
+}
+
+
+void collectSymbols(SYMBOL * sPtr, CELL * symbolList, CELL * * nextSymbol)
+{
+if(sPtr != NIL_SYM && sPtr != NULL)
+	{
+	collectSymbols(sPtr->left, symbolList, nextSymbol);
+	if(*nextSymbol == NULL)
+		{
+		*nextSymbol = getCell(CELL_SYMBOL);
+		(*nextSymbol)->contents = (UINT)sPtr;
+		symbolList->contents = (UINT)*nextSymbol;
+		}
+	else 
+		{
+		(*nextSymbol)->next = getCell(CELL_SYMBOL);
+		*nextSymbol = (*nextSymbol)->next;
+		(*nextSymbol)->contents = (UINT)sPtr;
+		}
+	collectSymbols(sPtr->right, symbolList, nextSymbol);
+	}
+}
+
+
+
+/* iterate thru symbol tree for a specific context
+*/
+
+CELL * p_dotree(CELL * params)
+{
+SYMBOL * context;
+SYMBOL * symbol;
+CELL * symbolList;
+CELL * nextSymbol;
+CELL * cell;
+CELL * list;
+int resultIdxSave;
+
+if(params->type != CELL_EXPRESSION)
+	return(errorProcExt(ERR_LIST_EXPECTED, params));
+
+list = (CELL *)params->contents;
+if(list->type == CELL_SYMBOL)
+	symbol = (SYMBOL *)list->contents;
+else if(list->type == CELL_DYN_SYMBOL)
+	symbol = getDynamicSymbol(list);
+else
+	return(errorProcExt(ERR_SYMBOL_EXPECTED, list));
+
+if(isProtected(symbol->flags))
+	return(errorProcExt2(ERR_SYMBOL_PROTECTED, stuffSymbol(symbol)));
+
+pushEnvironment((CELL *)symbol->contents);
+pushEnvironment((UINT)symbol);
+
+symbol->contents = (UINT)copyCell(nilCell);
+
+getContext(list->next, &context);
+if(!context) return(nilCell); /* for debug mode */
+cell = nilCell;
+
+symbolList = getCell(CELL_EXPRESSION);
+nextSymbol = NULL;
+collectSymbols((SYMBOL *)((CELL *)context->contents)->aux, symbolList, &nextSymbol);
+
+resultIdxSave = resultStackIdx;
+list = (CELL *)symbolList->contents;
+while(list != nilCell)
+    {
+    cleanupResults(resultIdxSave);
+    deleteList((CELL *)symbol->contents);
+    symbol->contents = (UINT)copyCell(list);
+    cell = evaluateBlock(params->next);
+    list = list->next;
+    }
+
+cell = copyCell(cell);
+deleteList((CELL *)symbol->contents);
+
+symbol = (SYMBOL*)popEnvironment();
+symbol->contents = (UINT)popEnvironment();
+
+deleteList(symbolList);
+
+return(cell);
+}
+
+
+
+SYMBOL * lookupSymbol(char * token, SYMBOL * context)
+{
+root = (SYMBOL *)((CELL *)context->contents)->aux;
+
+return(findInsertSymbol(token, LOOKUP_ONLY));
+}
+
+
+
+/* 
+   if forceFlag is TRUE then 
+       create the symbol, if not found in the context 
+       specified in that context
+   else
+       if not found try to inherit from MAIN as a global
+       or primitive, else create it in context specified
+*/
+
+
+SYMBOL * translateCreateSymbol
+	(char * token, int type, SYMBOL * context, int forceFlag)
+{
+SYMBOL * sPtr;
+CELL * cell = NULL;
+size_t len;
+
+/* for the first symbol (also a context) context is NULL */
+if(context == NULL)
+	root = NULL;
+else
+	{
+	cell = (CELL *)context->contents;
+	root = (SYMBOL *)cell->aux;
+	}
+
+if(forceFlag)
+	sPtr = findInsertSymbol(token, FORCE_CREATION);
+else /* try to inherit from MAIN, if not here create in current context */
+	{
+	sPtr = findInsertSymbol(token, LOOKUP_ONLY);
+	if(sPtr == NULL)
+		{
+		if(context != mainContext)
+			{
+			root = (SYMBOL *)((CELL *)mainContext->contents)->aux;
+			sPtr = findInsertSymbol(token, LOOKUP_ONLY);
+			/* since 7.2.7 only inherit primitives and other globals */
+			if(sPtr != NULL && !(sPtr->flags & SYMBOL_GLOBAL))
+				{
+				if(symbolType(sPtr) != CELL_CONTEXT
+				    || (SYMBOL *)((CELL*)sPtr->contents)->contents != sPtr)
+					sPtr = NULL;
+				}
+			root = (SYMBOL *)cell->aux;
+			}
+		if(sPtr == NULL)
+			sPtr = findInsertSymbol(token, FORCE_CREATION);
+		}
+	}
+
+/* root might have changed, if new symbol was inserted */
+if(context != NULL)
+	cell->aux = (UINT)root;
+
+/* the symbol existed already, return */
+if(sPtr->contents != 0) return(sPtr);
+	
+/* a new symbol has been allocated by findInsertSymbol() */
+if(type != CELL_PRIMITIVE)
+	{
+	len = strlen(token);
+	sPtr->name = (char *)allocMemory(len + 1);
+	memcpy(sPtr->name, token, len + 1);
+ 	cell = copyCell(nilCell); 
+	sPtr->contents = (UINT)cell;
+	/* make a new context symbol */
+	if(type == CELL_CONTEXT && context == mainContext)
+		{
+		cell->type = CELL_CONTEXT;
+		cell->contents = (UINT)sPtr;
+		cell->aux = 0;
+		sPtr->flags |= (SYMBOL_PROTECTED | SYMBOL_GLOBAL);
+		}
+	}
+else
+	sPtr->name = token;
+
+
+sPtr->context = context;
+return(sPtr);
+}
+
+/* ------------------------- dump RB tree info of a symbol -------------------- */
+
+#ifdef SYMBOL_DEBUG
+CELL * p_dumpSymbol(CELL * params)
+{
+char * name;
+SYMBOL * sPtr;
+
+getString(params, &name);
+
+sPtr = findInsertSymbol(name, LOOKUP_ONLY);
+
+if(sPtr == NULL)
+	return(nilCell);
+
+varPrintf(OUT_DEVICE, "name=%s color=%s parent=%s left=%s right=%s\n", 
+	sPtr->name,
+	(sPtr->color == RED) ? "red" : "black",
+	(sPtr->parent) ? sPtr->parent->name : "ROOT",
+	sPtr->left->name,
+	sPtr->right->name);
+
+return(trueCell);
+}
+#endif
+
+
+
+/* ----------------------------- delete a symbol --------------------------- */
+int references(SYMBOL * sPtr, int replaceFlag);
+
+CELL * p_deleteSymbol(CELL * params)
+{
+SYMBOL * sPtr;
+CELL * cell;
+
+cell = evaluateExpression(params);
+if(cell->type == CELL_SYMBOL || cell->type == CELL_CONTEXT)
+	sPtr = (SYMBOL*)cell->contents;
+else if(cell->type == CELL_DYN_SYMBOL)
+	sPtr = getDynamicSymbol(cell);
+else return(errorProcExt(ERR_SYMBOL_OR_CONTEXT_EXPECTED, params));
+
+if(sPtr == mainContext) return(nilCell);
+
+if(symbolType(sPtr) == CELL_CONTEXT)
+	{
+ 	if(cell->type == CELL_SYMBOL) 
+		cell = (CELL*)sPtr->contents;
+	sPtr->flags &= ~SYMBOL_PROTECTED;
+	}
+
+if(sPtr->flags & (SYMBOL_PROTECTED | SYMBOL_BUILTIN) )
+	return(nilCell);
+
+if(getFlag(params->next))
+	{
+	if(references(sPtr, FALSE) > 1)
+		return(nilCell);
+	}
+
+if(cell->type == CELL_CONTEXT)
+	{
+	deleteContextSymbols(cell);	
+	cell->type = CELL_SYMBOL;
+	deleteList((CELL *)sPtr->contents);
+	sPtr->contents = (UINT)nilCell;
+	}
+else 
+	deleteFreeSymbol(sPtr);
+
+return(trueCell);
+}
+
+
+void deleteContextSymbols(CELL * cell)
+{
+SYMBOL * context;
+CELL * symbolList;
+CELL * nextSymbol;
+
+context = (SYMBOL *)cell->contents;
+
+symbolList = getCell(CELL_EXPRESSION);
+nextSymbol = NULL;
+collectSymbols((SYMBOL *)((CELL *)context->contents)->aux, symbolList, &nextSymbol);
+
+nextSymbol = (CELL *)symbolList->contents;
+while(nextSymbol != nilCell)
+	{
+	deleteFreeSymbol((SYMBOL*)nextSymbol->contents);
+	nextSymbol = nextSymbol->next;
+	}
+	
+deleteList(symbolList);
+}
+
+
+
+void deleteFreeSymbol(SYMBOL * sPtr)
+{
+SYMBOL * context;
+
+context = sPtr->context;
+root = (SYMBOL *)((CELL *)context->contents)->aux;
+
+if(!deleteSymbol(sPtr->name))
+	return;
+
+((CELL *)context->contents)->aux = (UINT)root; /* root may have changed */
+
+deleteList((CELL *)sPtr->contents);
+
+references(sPtr, TRUE);
+freeMemory(sPtr->name);
+freeMemory(sPtr);
+}
+
+
+
+void makeContextFromSymbol(SYMBOL * symbol, SYMBOL * treePtr)
+{
+CELL * contextCell;
+
+contextCell = getCell(CELL_CONTEXT);
+contextCell->contents = (UINT)symbol;
+contextCell->aux = (UINT)treePtr;
+symbol->contents = (UINT)contextCell;
+symbol->context = mainContext;
+symbol->flags |= (SYMBOL_PROTECTED | SYMBOL_GLOBAL);
+}
+
+
+int references(SYMBOL * sPtr, int replaceFlag)
+{
+CELL * blockPtr;
+int i, count;
+
+blockPtr = cellMemory;
+count = 0;
+while(blockPtr != NULL)
+	{
+	for(i = 0; i < MAX_BLOCK; i++)
+		{
+		if( blockPtr->contents == (UINT)sPtr &&
+			(*(UINT *)blockPtr == CELL_SYMBOL ||  *(UINT *)blockPtr == CELL_CONTEXT))
+			{
+			count++;
+			if(replaceFlag) blockPtr->contents = (UINT)nilSymbol;
+			}
+		blockPtr++;
+		}
+	blockPtr = blockPtr->next;
+	}
+
+return(count);
+}
+
+CELL * p_name(CELL * params)
+{
+SYMBOL * sPtr;
+CELL * cell;
+
+cell = evaluateExpression(params);
+if(cell->type == CELL_SYMBOL || cell->type == CELL_CONTEXT)
+	sPtr = (SYMBOL *)cell->contents;
+else
+	return(errorProcExt(ERR_SYMBOL_OR_CONTEXT_EXPECTED, cell));
+
+if(getFlag(params->next))
+	return(stuffString(((SYMBOL*)sPtr->context)->name));
+return(stuffString(sPtr->name));
+}
+
+/* -------------------------------------------------------------------------
+
+   Red-Black Balanced Binary Tree Algorithm adapted from:
+
+   Thomas Niemann thomasn@epaperpress.com
+
+   See also:
+
+   http://epaperpress.com/sortsearch/index.html
+
+   and:
+
+   Thomas H. Cormen, et al
+   Introduction to Algorithms
+   (MIT Electrical Engineering and Computer Science)
+   (C) 1990 MIT Press
+
+*/
+
+
+#define compLT(a,b) (a < b)
+#define compEQ(a,b) (a == b)
+
+#define BLACK 0
+#define RED 1
+
+#define NIL_SYM &sentinel	/* all leafs are sentinels */
+
+SYMBOL sentinel = {
+	0, 		/* pretty print */
+	BLACK,		/* color */
+	"NIL",		/* name */
+	0,		/* contents */
+	NULL,		/* context */
+	NULL,		/* parent */
+	NIL_SYM,	/* left */
+ 	NIL_SYM 	/* right */
+	};
+
+void rotateLeft(SYMBOL* x);
+void rotateRight(SYMBOL * x);
+static void insertFixup(SYMBOL * x);
+void deleteFixup(SYMBOL *x);
+
+/* --------------------------------------------------------------------
+
+   lookup the symbol with name key, if it does not exist and the
+   forceCreation flag is set, create and insert the symbol and
+   return a pointer to the new symbol. If the context passed is empty
+   then it's treePtr (root) will be the new symbol.
+
+*/
+
+
+SYMBOL * findInsertSymbol(char * key, int forceCreation) 
+{
+SYMBOL *current, *parent, *x;
+
+/* find future parent */
+current = (root == NULL) ? NIL_SYM : root;
+parent = 0;
+
+while (current != NIL_SYM)
+	{
+	if(strcmp(key, current->name) == 0) /* already exists */
+            return(current);
+
+	parent = current;
+	current = (strcmp(key, current->name) < 0) ? 
+		current->left : current->right;
+	}
+
+/* if forceCreation not specified just return */
+if(forceCreation == LOOKUP_ONLY) return(NULL);
+
+/* allocate new symbol */
+x = (SYMBOL *)callocMemory(sizeof(SYMBOL));
+
+x->parent = parent;
+x->left = NIL_SYM;
+x->right = NIL_SYM;
+x->color = RED;
+
+/* insert node in tree */
+if(parent) 
+	{
+      if(strcmp(key, parent->name) < 0)
+            parent->left = x;
+      else
+            parent->right = x;
+	} 
+else 
+	root = x;
+
+insertFixup(x);
+
+
+/* return new node */
+
+++symbolCount;
+return(x);
+}
+
+
+/* --------------------------------------------------------------------
+   extract symbol in context from tree, return 1 if deleted or 0 if it 
+   couldn't be found.
+
+*/
+
+int deleteSymbol(char * key)
+{
+SYMBOL *x, *y, *z;
+int color;
+
+/* find node in tree */
+z = (root == NULL) ? NIL_SYM : root;
+
+while(z != NIL_SYM)
+	{
+	if(strcmp(key, z->name) == 0) 
+		break;
+	else
+		z = (strcmp(key, z->name) < 0) ? z->left : z->right;
+	}
+
+if (z == NIL_SYM) return(0); /* key to delete not found */
+
+
+if (z->left == NIL_SYM || z->right == NIL_SYM)
+	{
+	/* y has a NIL_SYM node as a child */
+	y = z;
+	}
+else 
+	{
+	/* find tree successor with a NIL_SYM node as a child */
+	y = z->right;
+	while (y->left != NIL_SYM) y = y->left;
+	}
+
+/* x is y's only child */
+if (y->left != NIL_SYM)
+	x = y->left;
+else
+	x = y->right;
+
+/* remove y from the parent chain */
+x->parent = y->parent;
+if (y->parent)
+	{
+	if (y == y->parent->left)
+		y->parent->left = x;
+        else
+            y->parent->right = x;
+	}
+else
+	root = x;
+
+
+color = y->color;
+if (y != z)
+	{
+	/* swap y and z */
+	y->left = z->left;
+	y->right = z->right;
+	y->parent = z->parent;
+
+	if(z->parent)
+		{
+		if(z->parent->left == z)
+			z->parent->left = y;
+		else
+			z->parent->right = y;
+		}
+	else root = y;
+
+	y->right->parent = y;
+	y->left->parent = y;
+
+	y->color = z->color;
+	}
+
+if (color == BLACK)
+	deleteFixup (x);
+
+--symbolCount;
+return TRUE;
+}
+
+
+
+/* -------------------------------------------------------------------- */
+
+void rotateLeft(SYMBOL* x) 
+{
+SYMBOL* y;
+
+y = x->right;
+
+/* establish x->right link */
+x->right = y->left;
+if (y->left != NIL_SYM) 
+	y->left->parent = x;
+
+/* establish y->parent link */
+if(y != NIL_SYM) 
+	y->parent = x->parent;
+
+if (x->parent)
+	{
+	if (x == x->parent->left)
+      	x->parent->left = y;
+      else
+      	x->parent->right = y;
+	} 
+else 
+	root = y;
+
+
+/* link x and y */
+y->left = x;
+if (x != NIL_SYM) 
+	x->parent = y;
+}
+
+
+void rotateRight(SYMBOL * x)
+{
+SYMBOL * y;
+
+y = x->left;
+
+/* establish x->left link */
+x->left = y->right;
+if (y->right != NIL_SYM)
+	y->right->parent = x;
+
+/* establish y->parent link */
+if (y != NIL_SYM) 
+	y->parent = x->parent;
+
+if (x->parent) 
+	{
+      if (x == x->parent->right)
+            x->parent->right = y;
+      else
+            x->parent->left = y;
+	}
+else
+	root = y;
+
+/* link x and y */
+y->right = x;
+if (x != NIL_SYM) 
+	x->parent = y;
+}
+
+
+static void insertFixup(SYMBOL * x)
+{
+SYMBOL * y;
+
+/* check Red-Black properties */
+while (x != root && x->parent->color == RED)
+	{
+	/* we have a violation */
+	if (x->parent == x->parent->parent->left)
+		{
+        y = x->parent->parent->right;
+        if (y->color == RED) 
+			{
+			/* uncle is RED */
+			x->parent->color = BLACK;
+			y->color = BLACK;
+			x->parent->parent->color = RED;
+			x = x->parent->parent;
+			} 
+		else 
+			{
+           	/* uncle is BLACK */
+           	if (x == x->parent->right)
+				{
+           		/* make x a left child */
+           		x = x->parent;
+           		rotateLeft(x);
+				}
+
+			/* recolor and rotate */
+			x->parent->color = BLACK;
+			x->parent->parent->color = RED;
+			rotateRight(x->parent->parent);
+           }
+		} 
+	else 
+		{
+
+		/* mirror image of above code */
+		y = x->parent->parent->left;
+		if (y->color == RED) 
+			{
+			/* uncle is RED */
+			x->parent->color = BLACK;
+			y->color = BLACK;
+			x->parent->parent->color = RED;
+			x = x->parent->parent;
+			} 
+		else 
+			{
+			/* uncle is BLACK */
+			if (x == x->parent->left) 
+				{
+				x = x->parent;
+				rotateRight(x);
+				}
+			x->parent->color = BLACK;
+			x->parent->parent->color = RED;
+			rotateLeft(x->parent->parent);
+			}
+		}
+	}
+
+root->color = BLACK;
+}
+
+
+void deleteFixup(SYMBOL *x)
+{
+SYMBOL * w;
+
+while (x != root && x->color == BLACK)
+	{
+	if (x == x->parent->left)
+		{
+            w = x->parent->right;
+            if (w->color == RED)
+			{
+			w->color = BLACK;
+			x->parent->color = RED;
+			rotateLeft (x->parent);
+			w = x->parent->right;
+			}
+            if (w->left->color == BLACK && w->right->color == BLACK)
+			{
+			w->color = RED;
+			x = x->parent;
+			} 
+		else 
+			{
+			if (w->right->color == BLACK)
+				{
+				w->left->color = BLACK;
+				w->color = RED;
+				rotateRight (w);
+				w = x->parent->right;
+				}
+			w->color = x->parent->color;
+			x->parent->color = BLACK;
+			w->right->color = BLACK;
+			rotateLeft (x->parent);
+			x = root;
+			}
+		} 
+	else 
+		{
+            w = x->parent->left;
+            if (w->color == RED)
+			{
+			w->color = BLACK;
+			x->parent->color = RED;
+			rotateRight (x->parent);
+			w = x->parent->left;
+			}
+            if (w->right->color == BLACK && w->left->color == BLACK)
+			{
+			w->color = RED;
+			x = x->parent;
+			} 
+		else 
+			{
+			if (w->left->color == BLACK)
+				{
+				w->right->color = BLACK;
+				w->color = RED;
+				rotateLeft (w);
+				w = x->parent->left;
+				}
+			w->color = x->parent->color;
+			x->parent->color = BLACK;
+			w->left->color = BLACK;
+			rotateRight (x->parent);
+			x = root;
+			}
+		}
+	}
+
+x->color = BLACK;
+}
+
+
+/* eof */
+
+
diff --git a/nl-utf8.c b/nl-utf8.c
new file mode 100644
index 0000000..40327b3
--- /dev/null
+++ b/nl-utf8.c
@@ -0,0 +1,263 @@
+/* nl-utf8.c --- functions for UTF-8 unicode support
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+//
+// portions are copied from pcre.c by: Philip Hazel <ph10@cam.ac.uk>
+// and Copyright (c) 1997-2003 University of Cambridge
+//
+*/
+
+
+#include "newlisp.h"
+#include <wchar.h>
+#include <wctype.h>
+#include "protos.h"
+
+
+/*************************************************
+*    Macros and tables for character handling    *
+*        by Philip Hazel <ph10@cam.ac.uk>        *
+*************************************************/
+
+/* These are the breakpoints for different numbers of bytes in a UTF-8
+character. */
+
+static const int utf8_table1[] =
+  { 0x7f, 0x7ff, 0xffff, 0x1fffff, 0x3ffffff, 0x7fffffff};
+
+/* These are the indicator bits and the mask for the data bits to set in the
+first byte of a character, indexed by the number of additional bytes. */
+
+static const int utf8_table2[] = { 0,    0xc0, 0xe0, 0xf0, 0xf8, 0xfc};
+static const int utf8_table3[] = { 0xff, 0x1f, 0x0f, 0x07, 0x03, 0x01};
+
+/* Table of the number of extra characters, indexed by the first character
+masked with 0x3f. The highest number for a valid UTF-8 character is in fact
+0x3d. */
+
+static const char utf8_table4[] = {
+  1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
+  1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
+  2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
+  3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5 };
+
+/* Get the next UTF-8 character, advancing the pointer. This is called when we
+know we are in UTF-8 mode. */
+
+#define GETCHARINC(c, eptr) \
+  c = (unsigned char)*eptr++; \
+  if ((c & 0xc0) == 0xc0) \
+    { \
+    int gcaa = utf8_table4[c & 0x3f];  /* Number of additional bytes */ \
+    int gcss = 6*gcaa; \
+    c = (c & utf8_table3[gcaa]) << gcss; \
+    while (gcaa-- > 0) \
+      { \
+      gcss -= 6; \
+      c |= (*eptr++ & 0x3f) << gcss; \
+      } \
+    }
+
+/* This function takes an integer value in the range 0 - 0x7fffffff
+and encodes it as a UTF-8 character in 0 to 6 bytes.
+
+Arguments:
+  cvalue     the character value
+  buffer     pointer to buffer for result - at least 6 bytes long
+
+Returns:     number of characters placed in the buffer
+*/
+
+int wchar_utf8(int cvalue, char *buffer)
+{
+register int i, j;
+for (i = 0; i < sizeof(utf8_table1)/sizeof(int); i++)
+  if (cvalue <= utf8_table1[i]) break;
+buffer += i;
+for (j = i; j > 0; j--)
+ {
+ *buffer-- = 0x80 | (cvalue & 0x3f);
+ cvalue >>= 6;
+ }
+*buffer = utf8_table2[i] | cvalue;
+return i + 1;
+}
+
+
+/* ---------------------- UTF-8 utility fuctions --------------------------- */
+
+/* get utf8 string from unicode wide character
+ * 
+ * int wchar_utf8(int wchar, char * utf8str)
+ * 
+ * the string is not nullterminated for contiguos filling
+ * of longer strings
+ * returns number of bytes placed in utf8str
+*/
+
+
+/* get a unicode wide character from the utf8 string
+ * return advanced utf8 string pointer
+*/
+
+char * utf8_wchar(char * utf8str, int * chr)
+{
+GETCHARINC(*chr, utf8str)
+
+return(utf8str);
+}
+
+/* return the number of characters encoded in utf8 string
+ * without counting the zero terminator
+*/
+
+size_t utf8_wlen(char * utf8str)
+{
+int gcaa;
+int c;
+size_t count = 0;
+
+while((c = *utf8str++) != 0)
+	{
+	count++;
+	if ((c & 0xc0) == 0xc0)
+		{
+    	gcaa = utf8_table4[c & 0x3f];
+		utf8str += gcaa;
+		}
+	}
+
+return(count);
+}
+
+
+/* return the length of the first utf8 character
+*/
+
+int utf8_1st_len(char * utf8str)
+{
+int c;
+
+if((c = *utf8str) != 0)
+	{
+	if((c & 0xc0) == 0xc0)
+		return(utf8_table4[c & 0x3f] + 1);
+	else return(1);
+	}
+
+return(0);
+}
+
+
+/* convert utf8 string to vector of maxwc wide characters
+ * unicode vector is zero terminated
+ * return number of unicode characters (excluding zero int)
+*/
+
+int utf8_wstr(int * unicode, char * utf8str, int maxwc)
+{
+int wchar;
+int count = 0;
+
+while(maxwc-- && *utf8str != 0)
+	{
+	count++;
+	GETCHARINC(wchar, utf8str);
+/*	utf8str = utf8_wchar(utf8str, &wchar); */
+	*(unicode++) = wchar;
+	}
+*unicode = 0;
+
+return(count);
+}
+
+/* convert zero terminated unicode vector into utf8 string
+ * return number of bytes stored in utr8 string excluding terminator
+ * don't use more then maxstr bytes (excluding  zero terminator)
+*/
+
+int wstr_utf8(char * utf8str, int * unicode, int maxstr)
+{
+int len, size = 0;
+
+while(*unicode != 0 && size < maxstr)
+	{
+	len = wchar_utf8(*unicode, utf8str);
+	utf8str += len;
+	size += len;
+	unicode++;
+	}
+
+*utf8str = 0;
+
+return(size);
+}
+
+/* -------------------------------------- newLISP API -----------------------------------*/
+
+CELL * p_unicode(CELL * params)
+{
+char * utf8str;
+size_t size;
+int * unicode;
+CELL * cell;
+
+getStringSize(params, &utf8str, &size, TRUE);
+unicode = allocMemory((size + 1) * sizeof(int));
+
+size = utf8_wstr(unicode, utf8str, size);
+unicode = reallocMemory(unicode, (size + 1) * sizeof(int) + 1);
+
+cell = getCell(CELL_STRING);
+cell->contents = (UINT)unicode;
+cell->aux = (size + 1) * sizeof(int) + 1;
+
+return(cell);
+}
+
+
+CELL * p_utf8(CELL * params)
+{
+int * unicode;
+size_t size;
+char * utf8str;
+CELL *cell;
+
+getStringSize(params, (void *)&unicode, &size, TRUE);
+utf8str = allocMemory(size * UTF8_MAX_BYTES + 1);
+
+size = wstr_utf8(utf8str, unicode, size);
+utf8str = reallocMemory(utf8str, size + 1);
+
+cell = getCell(CELL_STRING);
+cell->contents = (UINT)utf8str;
+cell->aux = size + 1;
+
+return(cell);
+}
+
+
+CELL * p_utf8len(CELL * params)
+{
+char * str;
+
+getString(params, &str);
+
+return(stuffInteger(utf8_wlen(str)));
+}
+
+/* eof */
diff --git a/nl-web.c b/nl-web.c
new file mode 100644
index 0000000..b1c2a6f
--- /dev/null
+++ b/nl-web.c
@@ -0,0 +1,1288 @@
+/* nl-web.c --- HTTP network protocol routines for newLISP
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+#include "newlisp.h"
+#include <errno.h>
+#include "protos.h"
+
+#ifdef WIN_32
+#include <winsock2.h>
+#else
+#include <sys/types.h>
+#include <sys/time.h>
+#include <sys/socket.h>
+#include <sys/ioctl.h>
+#include <sys/wait.h>
+#include <netdb.h>
+#include <netinet/in.h>
+#include <arpa/inet.h>
+#endif
+
+#define BUFFSIZE 10240
+
+#ifndef WIN_32
+#define SOCKET_ERROR -1
+#else
+#define fgets win32_fgets
+#define fgetc win32_fgetc
+#define close closesocket
+#endif
+
+#define ERROR_BAD_URL "ERR: bad formed URL"
+
+
+#define MAX_PROTOCOL 8
+#define NO_FLAGS_SET 0
+
+/* with MinGW gcc 3.4.5 not needed
+#ifdef WIN_32
+struct timezone {
+       int     tz_minuteswest;
+       int     tz_dsttime;
+};
+
+int gettimeofday( struct timeval *tp, struct timezone *tzp );
+#endif
+*/
+
+int parseUrl(char *url, char * protocol, char * host, int * port, char * path, size_t maxlen);
+void parsePath(char * url, char * path, size_t maxlen);
+size_t parseValue(char * str);
+void trimTrailing(char * ptr);
+CELL * base64(CELL * params, int type);
+
+size_t Curl_base64_encode(const char *inp, size_t insize, char **outptr);
+size_t Curl_base64_decode(const char *src, char *dest);
+
+
+jmp_buf socketTimeoutJump;
+long socketTimeout;
+struct timeval socketStart;
+
+/* socket send and receive routines with timeout */
+int recvc_tm(int sock)
+{
+struct timeval tm;
+char chr;
+ssize_t bytes;
+
+while(wait_ready(sock, 1000, 0) <= 0)
+  {
+  if(socketTimeout)
+    {
+    gettimeofday(&tm, NULL);
+    if(timediff(tm, socketStart) > socketTimeout)
+        longjmp(socketTimeoutJump, 1);
+    }
+  } 
+   
+bytes = recv(sock, &chr, 1, NO_FLAGS_SET);
+if(bytes <= 0) return(-1);
+
+return(chr);
+}
+
+
+char * recvs_tm(char * buffer, size_t size, int sock)
+{
+ssize_t bytesReceived = 0;
+int chr;
+
+while(bytesReceived < size)
+    {
+    if((chr = recvc_tm(sock)) < 0)
+        {
+        if(bytesReceived == 0)
+            return(NULL);
+        else break;
+        }
+
+    *(buffer + bytesReceived++) = chr;
+    if(chr == '\n') break;
+    }
+
+*(buffer + bytesReceived) = 0;
+return(buffer);
+}
+
+size_t recvsize_tm(char * buffer, size_t size, int sock)
+{
+ssize_t sizeRead = 0;
+size_t resultSize = 0;
+struct timeval tm;
+
+wait_ready(sock, 1000, 0);
+memset(buffer, 0, size);
+while( (sizeRead = recv(sock, buffer + resultSize, size, NO_FLAGS_SET)) < size)
+  {
+  if(socketTimeout)
+    {
+    gettimeofday(&tm, NULL);
+    if(timediff(tm, socketStart) > socketTimeout)
+        longjmp(socketTimeoutJump, 1);
+    }
+
+  if(size == 0) break;
+  if(sizeRead <= 0)
+      {
+      sizeRead = 0;
+      break;
+      }
+  resultSize += sizeRead;
+  size -= sizeRead;
+  wait_ready(sock, 1000, 0);
+  }
+
+return(resultSize + sizeRead);
+}
+
+ssize_t sendf(int sock, int debug, char * format, ...)
+{
+char * buffer;
+va_list argptr;
+int result;
+ 
+va_start(argptr,format);
+/* new in 7201 , defined in nl-filesys.c if not in libc */
+vasprintf(&buffer, format, argptr); 
+
+result = send(sock, buffer, strlen(buffer), NO_FLAGS_SET);
+if(debug) varPrintf(OUT_CONSOLE, buffer);
+
+freeMemory(buffer);
+va_end(argptr);
+
+return(result);
+}
+
+
+
+CELL * p_getUrl(CELL * params)
+{
+return(getPutPostDeleteUrl(NULL, params, HTTP_GET_URL, 0));
+}
+
+
+CELL * p_putUrl(CELL * params)
+{
+return(getPutPostDeleteUrl(NULL, params, HTTP_PUT_URL, 0));
+}
+
+
+CELL * p_postUrl(CELL * params)
+{
+return(getPutPostDeleteUrl(NULL, params, HTTP_POST_URL, 0));
+}
+
+CELL * p_deleteUrl(CELL * params)
+{
+return(getPutPostDeleteUrl(NULL, params, HTTP_DELETE_URL, 0));
+}
+
+#define BASE64_ENC 0
+#define BASE64_DEC 1
+
+CELL * p_base64Enc(CELL * params) { return(base64(params, BASE64_ENC)); }
+CELL * p_base64Dec(CELL * params) { return(base64(params, BASE64_DEC)); }
+
+CELL * base64(CELL * params, int type)
+{
+char * inPtr;
+char * outPtr;
+size_t sizein, sizeout;
+CELL * strCell;
+
+getStringSize(params, &inPtr, &sizein, TRUE);
+
+
+if(type == BASE64_ENC)
+	{
+	if(sizein == 0)
+		return(stuffString("===="));
+	if((sizeout = Curl_base64_encode(inPtr, sizein, &outPtr)) == 0)
+		return(stuffString(""));
+	}
+else    /* BASE64_DEC */
+	{
+	outPtr = allocMemory((sizein * 3) / 4 + 9);
+	sizeout = Curl_base64_decode(inPtr, outPtr);
+	*(outPtr + sizeout) = 0;
+	}
+	
+strCell = getCell(CELL_STRING);
+strCell->contents = (UINT)outPtr;
+strCell->aux = sizeout + 1;
+
+return(strCell);
+}
+
+
+CELL * getPutPostDeleteUrl(char * url, CELL * params, int type, int timeout)
+{
+char * proxyUrl, * putPostStr = NULL, *contentType;
+char * protocol;
+char * host;
+char * pHost;
+char * path;
+char * customHeader = NULL;
+size_t maxlen;
+int port, pPort, sock = 0;
+char * option, * method = NULL;
+char buff[BUFFSIZE];
+char errorTxt[128];
+char * buffPtr;
+char * resultPtr = NULL;
+int haveContentLength = FALSE, headRequest = FALSE, listFlag = FALSE, debugFlag = FALSE;
+int chunked = FALSE;
+ssize_t sizeRead = 0;
+size_t resultSize = 0, fSize = 0, size = 0;
+CELL * result, * cell;
+CELL * headerCell = NULL;
+int ch;
+int responseLoop;
+int statusCode;
+
+/* get parameters */
+
+if(url == NULL)
+	params = getString(params, &url);
+
+if(type == HTTP_PUT_URL || type == HTTP_PUT_APPEND_URL || type == HTTP_POST_URL)
+	params = getStringSize(params, &putPostStr, &size, TRUE);
+
+if(type == HTTP_POST_URL)
+    {
+    if(params->type != CELL_NIL)
+		params = getString(params, &contentType);
+    else 
+		contentType = "application/x-www-form-urlencoded";
+    }
+
+result = evaluateExpression(params);
+params = params->next;
+socketTimeout = timeout;
+if(isNumber(result->type))
+    getIntegerExt(result, (UINT*)&socketTimeout, FALSE);
+else if(isString(result->type))
+    {
+    option = (char *)result->contents;    
+    if(my_strnicmp(option, "header", 6) == 0)
+      headRequest = TRUE;
+    if(my_strnicmp(option, "list", 5) == 0)
+      listFlag = TRUE;
+    /* "debug" or "header debug" or "list-debug" options
+       print all outgoing informatiopn on the console */	
+	if(my_strnicmp(option, "debug", 5) == 0)
+      debugFlag = TRUE;
+	if(my_strnicmp(option + 7, "debug", 5) == 0)
+      debugFlag = TRUE;
+	if(my_strnicmp(option + 6, "debug", 5) == 0)
+      debugFlag = TRUE;
+    if(params != nilCell)
+        params = getInteger(params, (UINT*)&socketTimeout);
+    }
+else if(result != nilCell)
+    return(errorProcExt(ERR_NUMBER_OR_STRING_EXPECTED, result));
+
+/* if timeout is specified, custom-header can be specified too */
+if(socketTimeout && params != nilCell)
+        getString(params, &customHeader);
+
+maxlen = strlen(url);
+if(maxlen < MAX_URL_LEN) maxlen = MAX_URL_LEN;
+
+protocol = alloca(8);
+host = alloca(maxlen + 1);
+pHost = alloca(maxlen + 1);
+path = alloca(maxlen + 1);
+
+/* parse URL for parameters */
+if(parseUrl(url, protocol, host, &port, path, maxlen) == FALSE)
+	return(stuffString(ERROR_BAD_URL));
+
+proxyUrl = getenv("HTTP_PROXY");
+if(proxyUrl == NULL)
+	{
+	strncpy(pHost, host, maxlen);
+	pPort = port;
+	}
+else
+	{
+	if(parseUrl(proxyUrl, protocol, pHost, &pPort, NULL, maxlen) == FALSE)
+		return(stuffString(ERROR_BAD_URL));
+	}
+
+/* start timer */
+gettimeofday(&socketStart, NULL);
+/* connect to host */
+CONNECT_TO_HOST:
+if(sock) 
+    close(sock);
+
+if((sock = netConnect(pHost, pPort, SOCK_STREAM, NULL, 3)) == SOCKET_ERROR)
+	return(stuffString("ERR: could not connect"));
+
+if(type == HTTP_GET_URL)
+	method = (headRequest == TRUE) ? "HEAD" : "GET";
+else if(type == HTTP_PUT_URL || type == HTTP_PUT_APPEND_URL)
+	method = "PUT";
+else if(type == HTTP_POST_URL)
+	method = "POST";
+else if(type == HTTP_DELETE_URL)
+	method = "DELETE";
+
+/* send header */
+if(proxyUrl != NULL)
+	sendf(sock, debugFlag, "%s %s://%s:%d/%s HTTP/1.1\r\n", method, protocol, host, port, path);
+else
+	sendf(sock, debugFlag, "%s /%s HTTP/1.1\r\n", method, path);
+
+/* obligatory host spec */
+sendf(sock, debugFlag, "Host: %s\r\n", host);
+
+/* send optional custom header entries */
+if (customHeader != NULL)
+    sendf(sock, debugFlag, customHeader);
+else
+	{
+    sendf(sock, debugFlag, "User-Agent: newLISP v%d\r\n", version);
+	}
+
+sendf(sock, debugFlag, "Connection: close\r\n");
+
+/* expanded header for PUT, POST and body */
+if(type == HTTP_GET_URL || type == HTTP_DELETE_URL)
+	{
+	sendf(sock, debugFlag, "\r\n");
+	}
+else if(type == HTTP_PUT_URL || type == HTTP_PUT_APPEND_URL)
+	{
+	if(type == HTTP_PUT_APPEND_URL) sendf(sock, debugFlag, "Pragma: append\r\n");
+	if(customHeader == NULL)
+		sendf(sock, debugFlag, "Content-type: text/html\r\nContent-length: %d\r\n\r\n", size);
+	else
+		sendf(sock, debugFlag, "Content-length: %d\r\n\r\n", size);
+
+	send(sock, putPostStr, size, NO_FLAGS_SET);
+	if(debugFlag) varPrintf(OUT_CONSOLE, putPostStr);
+	}
+else if(type == HTTP_POST_URL)
+	{
+	sendf(sock, debugFlag, "Content-type: %s\r\nContent-length: %d\r\n\r\n", contentType, size);
+	send(sock, putPostStr, size, NO_FLAGS_SET);
+	if(debugFlag) varPrintf(OUT_CONSOLE, putPostStr);
+	}
+
+if(setjmp(socketTimeoutJump) != 0)
+    {
+    if(sock) close(sock);
+    if(resultPtr != NULL) free(resultPtr);
+    return(stuffString("ERR: timeout"));
+    }
+  
+/* Retrieve HTTP response and check for status code. */
+responseLoop = 0;
+READ_RESPONSE:
+if(++responseLoop == 4)
+        return(stuffString("ERR: invalid response from server"));
+
+if (recvs_tm(buff, BUFFSIZE, sock) == NULL) 
+   return(stuffString("ERR: no response from server"));
+
+/* go past first token */
+for (buffPtr = buff; *buffPtr != '\0' && !isspace((int)*buffPtr); ++buffPtr) {;}
+
+/* trim leading spaces */
+while(isspace((int)*buffPtr)) ++buffPtr;
+
+/* get status code */
+statusCode = atoi(buffPtr);
+/* printf("statusCode:%d\n", statusCode); */
+switch (statusCode) 
+	{
+	case 0:
+	case 100:
+		/* drain and continue */
+		while (ch = recvc_tm(sock), ch != EOF && ch != '\n') {;}
+		goto READ_RESPONSE;
+	case 200:
+	case 201:
+	case 202:
+	case 203:
+	case 204:
+	case 205:
+	case 206:
+	case 300:
+	case 301:
+	case 302:
+	case 303:
+	case 307:
+		break;
+	default:
+		if(strlen(buff) > 127) buff[127] = 0;
+		snprintf(errorTxt, 127, "ERR: server code %d: %s", atoi(buffPtr), buff);
+		break;
+	}
+
+/* Retrieve HTTP headers. */
+memset(buff, 0, BUFFSIZE);
+if(listFlag || headRequest)
+    headerCell = stuffString("");
+
+/* printf("retrieving headers\n"); */
+
+/* Retrieve header */
+while(strcmp(buff, "\r\n") != 0 && strcmp(buff, "\n") != 0)
+	{
+	if(recvs_tm(buff, BUFFSIZE, sock) == NULL)
+		return(stuffString("ERR: problem in header"));
+
+/* printf("==>%s<==\n", buff); */
+
+	if(listFlag || headRequest) appendCellString(headerCell, buff, strlen(buff));
+
+	if(my_strnicmp(buff, "content-length:", 15) == 0)
+		{
+		fSize = parseValue(buff + 15);
+		haveContentLength = TRUE;
+		}
+	if(my_strnicmp(buff, "location:", 9) == 0 && (statusCode == 301 || statusCode == 303))
+		{
+		buffPtr = buff + 9;
+		while(isspace((int)*buffPtr)) ++buffPtr;
+		if(*buffPtr == '/')
+			strncpy(path, buffPtr + 1, maxlen);
+		else /* its a url or path */
+			{
+			if(parseUrl(buffPtr, protocol, host, &port, path, maxlen) == FALSE)
+			    /* path only */
+			    parsePath(buffPtr, path, buffPtr - buff);
+
+			if(proxyUrl == NULL)
+				{
+				strncpy(pHost, host, maxlen);
+				pPort = port;
+				}
+			}
+
+		if(headerCell) deleteList(headerCell);	
+		goto CONNECT_TO_HOST;
+		}
+
+	if(my_strnicmp(buff, "Transfer-Encoding:", 18) == 0 
+					&& searchBuffer(buff, strlen(buff), "chunked", 7, 0) != 0xFFFFFFFF)
+		chunked = TRUE;
+	}
+	
+if(headRequest)
+    return(headerCell);
+
+if((haveContentLength == TRUE && fSize == 0) || statusCode == 204)
+	{
+	resultPtr = NULL;
+	}
+/* Retrieve HTTP body. */
+else if(chunked == TRUE)
+	{
+	resultPtr = NULL;
+	if(recvs_tm(buff, BUFFSIZE, sock) == NULL)
+		return(stuffString("ERR: document empty"));
+	while((size = strtoul(buff, NULL, 16)) > 0)
+		{
+		if(resultSize == 0)
+			resultPtr = allocMemory(size + 1);
+		else 
+			resultPtr = reallocMemory(resultPtr, resultSize + size + 1);
+
+        if(recvsize_tm(resultPtr + resultSize, size, sock) != size)
+            {
+            free(resultPtr);
+            return(stuffString("ERR: problem in chunked format"));
+            }
+        resultSize += size;
+		recvs_tm(buff, BUFFSIZE, sock); /* empty line */
+		recvs_tm(buff, BUFFSIZE, sock); /*  chunck size  */
+		}
+	}
+
+else if(haveContentLength == TRUE)
+	{
+	resultPtr = allocMemory(fSize + 1);
+	if((resultSize = recvsize_tm(resultPtr, fSize, sock)) == 0)
+            {
+            free(resultPtr);
+            return(stuffString("ERR: document empty"));
+            }
+	}
+	
+else /* no content length given, relies on host closing the connection */
+	{
+	resultPtr = allocMemory(BUFFSIZE + 1);
+	resultSize = 0;
+	size = BUFFSIZE;
+	memset(buff, 0, BUFFSIZE);
+	while ((sizeRead = recvsize_tm(buff, BUFFSIZE - 1, sock)) > 0)
+		{
+		if((resultSize + sizeRead) > size)
+			{
+			size = resultSize + BUFFSIZE;
+			resultPtr = reallocMemory(resultPtr, size + 1);
+			}
+		memcpy(resultPtr + resultSize, buff, sizeRead);
+		resultSize += sizeRead;
+		memset(buff, 0, BUFFSIZE);
+		}
+	}
+
+
+if(resultPtr == NULL)
+	{
+	if(statusCode < 400)
+		result = stuffString("");
+	else
+		result = stuffString(errorTxt);
+	}
+else
+	{
+	*(resultPtr + resultSize) = 0;
+	result = getCell(CELL_STRING);
+	if(statusCode >= 400)
+		{
+		maxlen = strlen(errorTxt);
+		buffPtr = allocMemory(maxlen + resultSize + 1);
+		memcpy(buffPtr, errorTxt, maxlen);
+		memcpy(buffPtr + maxlen, resultPtr, resultSize);
+		free(resultPtr);
+		resultPtr = buffPtr;
+		resultSize += maxlen;
+		}		
+	result->contents = (UINT)resultPtr;
+	result->aux = resultSize + 1;
+	}
+
+close(sock);
+
+if(listFlag)
+    {
+    cell = getCell(CELL_EXPRESSION);
+    cell->contents = (UINT)headerCell;
+    headerCell->next = result;
+    return(cell);
+    }
+
+return(result);
+}
+
+
+int parseUrl(char * url, char * protocol, char * host, int * port, char * path, size_t maxlen)
+{
+char * colonPtr;
+char * slashPtr;
+int len;
+
+/* trim trailing whitespace like '/r/n' from url */
+len = strlen(url);
+while(*(url + len) <= ' ' && len > 0)
+	{
+	*(url + len) = 0;
+	len--;
+	}
+
+*port = 80;
+
+if(my_strnicmp(url, "http://", 7) == 0)
+    {
+    strncpy(protocol,"http", MAX_PROTOCOL );
+    strncpy(host, url+7, maxlen);
+    }
+else if( my_strnicmp(url, "https://", 8) == 0)
+    {
+    strncpy(protocol, "https", MAX_PROTOCOL);
+    strncpy(host, url+8, maxlen);
+    }
+else 
+    return(FALSE);
+
+colonPtr = strchr(host, ':');
+slashPtr = strchr(host, '/');
+
+if (colonPtr != NULL && (slashPtr == NULL || colonPtr < slashPtr)) 
+	{
+	*colonPtr++ = '\0';
+	*port = atoi(colonPtr);
+	}
+
+if(path == NULL) return(TRUE);
+
+if (slashPtr != NULL) 
+	{
+	*slashPtr++ = '\0';
+	strncpy(path, slashPtr, maxlen);
+	} 
+else
+	strncpy(path, "", maxlen);
+
+
+return(TRUE);
+}
+
+void parsePath(char * url, char * path, size_t maxlen)
+{
+int len;
+
+/* trim trailing whitespace like '/r/n' from url */
+len = strlen(url);
+while(*(url + len) <= ' ' && len > 0)
+	{
+	*(url + len) = 0;
+	len--;
+	}
+	
+/* trim leading whitespace */
+while(*url <= ' ') url++;
+strncpy(path, url, maxlen);
+}
+
+size_t parseValue(char * str)
+{
+char * number;
+while(!isDigit((unsigned char)*str) && *str != 0) ++str;
+number = str;
+while(isDigit((unsigned char)*str)) ++str;
+return atol(number);
+}
+
+
+/***************************************************************************
+ *                                  _   _ ____  _
+ *  Project                     ___| | | |  _ \| |
+ *                             / __| | | | |_) | |
+ *                            | (__| |_| |  _ <| |___
+ *                             \___|\___/|_| \_\_____|
+ *
+ * Copyright (C) 1998 - 2004, Daniel Stenberg, <daniel@haxx.se>, et al.
+ *
+ * This software is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at http://curl.haxx.se/docs/copyright.html.
+ *
+ * You may opt to use, copy, modify, merge, publish, distribute and/or sell
+ * copies of the Software, and permit persons to whom the Software is
+ * furnished to do so, under the terms of the COPYING file.
+ *
+ * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
+ * KIND, either express or implied.
+ *
+ * $Id: base64.c,v 1.32 2004/12/15 01:38:25 danf Exp $
+ ***************************************************************************/
+
+/* Base64 encoding/decoding
+
+   this file from the cURL project is included in nl-web.c for the
+   newLISP functions 'base64-enc' and 'base64-dec' 
+
+   all #include statements have and the test harness rootines have
+   been stripped.  2005-1-6 Lutz Mueller
+*/
+
+
+static void decodeQuantum(unsigned char *dest, const char *src)
+{
+  unsigned int x = 0;
+  int i;
+  for(i = 0; i < 4; i++) {
+    if(src[i] >= 'A' && src[i] <= 'Z')
+      x = (x << 6) + (unsigned int)(src[i] - 'A' + 0);
+    else if(src[i] >= 'a' && src[i] <= 'z')
+      x = (x << 6) + (unsigned int)(src[i] - 'a' + 26);
+    else if(src[i] >= '0' && src[i] <= '9')
+      x = (x << 6) + (unsigned int)(src[i] - '0' + 52);
+    else if(src[i] == '+')
+      x = (x << 6) + 62;
+    else if(src[i] == '/')
+      x = (x << 6) + 63;
+    else if(src[i] == '=')
+      x = (x << 6);
+  }
+
+  dest[2] = (unsigned char)(x & 255);
+  x >>= 8;
+  dest[1] = (unsigned char)(x & 255);
+  x >>= 8;
+  dest[0] = (unsigned char)(x & 255);
+}
+
+/*
+ * Curl_base64_decode()
+ *
+ * Given a base64 string at src, decode it into the memory pointed to by
+ * dest. Returns the length of the decoded data.
+ */
+size_t Curl_base64_decode(const char *src, char *dest)
+{
+  int length = 0;
+  int equalsTerm = 0;
+  int i;
+  int numQuantums;
+  unsigned char lastQuantum[3];
+  size_t rawlen=0;
+
+  while((src[length] != '=') && src[length])
+    length++;
+  while(src[length+equalsTerm] == '=')
+    equalsTerm++;
+
+  if(equalsTerm > 3) equalsTerm = 3; /* LM added 2006-09-08 */
+
+  numQuantums = (length + equalsTerm) / 4;
+
+  if(numQuantums == 0) return(0);
+
+  rawlen = (numQuantums * 3) - equalsTerm;
+
+  for(i = 0; i < numQuantums - 1; i++) {
+    decodeQuantum((unsigned char *)dest, src);
+    dest += 3; src += 4;
+  }
+
+  decodeQuantum(lastQuantum, src);
+  for(i = 0; i < 3 - equalsTerm; i++)
+    dest[i] = lastQuantum[i];
+
+  return rawlen;
+}
+
+/* ---- Base64 Encoding --- */
+static const char table64[]=
+  "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+/*
+ * Curl_base64_encode()
+ *
+ * Returns the length of the newly created base64 string. The third argument
+ * is a pointer to an allocated area holding the base64 data. If something
+ * went wrong, -1 is returned.
+ *
+ */
+size_t Curl_base64_encode(const char *inp, size_t insize, char **outptr)
+{
+  unsigned char ibuf[3];
+  unsigned char obuf[4];
+  int i;
+  int inputparts;
+  char *output;
+  char *base64data;
+
+  char *indata = (char *)inp;
+
+  *outptr = NULL; /* set to NULL in case of failure before we reach the end */
+
+  if(0 == insize)
+    insize = strlen(indata);
+
+  base64data = output = (char*)malloc(insize*4/3+4);
+  if(NULL == output)
+    return 0;
+
+  while(insize > 0) {
+    for (i = inputparts = 0; i < 3; i++) {
+      if(insize > 0) {
+        inputparts++;
+        ibuf[i] = *indata;
+        indata++;
+        insize--;
+      }
+      else
+        ibuf[i] = 0;
+    }
+
+    obuf [0] = (ibuf [0] & 0xFC) >> 2;
+    obuf [1] = ((ibuf [0] & 0x03) << 4) | ((ibuf [1] & 0xF0) >> 4);
+    obuf [2] = ((ibuf [1] & 0x0F) << 2) | ((ibuf [2] & 0xC0) >> 6);
+    obuf [3] = ibuf [2] & 0x3F;
+
+    switch(inputparts) {
+    case 1: /* only one byte read */
+      snprintf(output, 5, "%c%c==",
+               table64[obuf[0]],
+               table64[obuf[1]]);
+      break;
+    case 2: /* two bytes read */
+      snprintf(output, 5, "%c%c%c=",
+               table64[obuf[0]],
+               table64[obuf[1]],
+               table64[obuf[2]]);
+      break;
+    default:
+      snprintf(output, 5, "%c%c%c%c",
+               table64[obuf[0]],
+               table64[obuf[1]],
+               table64[obuf[2]],
+               table64[obuf[3]] );
+      break;
+    }
+    output += 4;
+  }
+  *output=0;
+  *outptr = base64data; /* make it return the actual data memory */
+
+  return strlen(base64data); /* return the length of the new data */
+}
+/* ---- End of Base64 Encoding ---- */
+
+
+/* --------------------------- HTTP server mode -----------------------------
+ handles GET, POST, PUT and DELETE requests
+ handles queries in GET requests and sets environment variable QUERY_STRING
+ sets HTTP_HOST and HTTP_USER_AGENTT when present in client request header
+ no special encodings are supported
+ subset HTTP/1.0 compliant
+*/
+
+int sendHTTPmessage(char * fmt, char * str);
+void handleHTTPcgi(char * command, char * query);
+size_t readHeader(char * buff, int * pragmaFlag);
+ssize_t readPayLoad(ssize_t size, char * content, int outFile, char * request);
+int endsWith(char * str, char * ext);
+
+void sendHTTPpage(char * content, size_t size, char * media, int closeFlag)
+{
+varPrintf(OUT_CONSOLE, "HTTP/1.0 200 OK\r\nServer: newLISP v.%d (%s)\r\n", version, ostype);
+
+if(media != NULL) /* else Content-type: is provided by CGI page */
+  varPrintf(OUT_CONSOLE, "Content-length: %d\r\nContent-type: %s\r\n\r\n", size, media);
+#ifndef WIN_32
+/* size = fwrite(content, 1, size, IOchannel); */ /* does not work with xinetd on OSX */
+size = write(fileno(IOchannel), content, size); 
+fflush(IOchannel); 
+if(closeFlag) 
+	{
+	fclose(IOchannel); 
+	IOchannel = NULL;
+	}
+#else
+if(IOchannel != NULL && isSocketStream(IOchannel))
+	{
+	sendall(getSocket(IOchannel), content, size);
+	close(getSocket(IOchannel));
+	}
+else 
+	varPrintf(OUT_CONSOLE, content);
+return;
+#endif
+}
+
+#define ERR_411 "ERR:411 length required for: %s\r\n"
+#define MAX_BUFF 1024
+#define DEFAULT_PAGE_1 "index.html"
+#define DEFAULT_PAGE_2 "index.cgi"
+#define CGI_EXTENSION ".cgi"
+#define MEDIA_TXT "text/html"
+
+#define ERROR_404 "ERR:404 File not found: %s\r\n"
+
+int executeHTTPrequest(char * request, int type)
+{
+char * sptr;
+char * query;
+int len;
+char * content = NULL;
+ssize_t transferred, size;
+char buff[MAX_BUFF];
+int outFile;
+int pragmaFlag;
+char * fileMode = "w";
+char * mediaType;
+char * command;
+CELL * result = NULL;
+
+chdir(startupDir);
+query = sptr = request;
+
+setenv("DOCUMENT_ROOT", startupDir, 1);
+
+#ifdef DEBUGHTTP
+printf("HTTP request:%s:%d:\n", request, type);
+#endif
+
+/* stuff after request */
+while(*sptr > ' ') ++sptr;
+*sptr = 0;
+while(*query != 0 && *query != '?') ++query;
+if(*query == '?')
+	{
+	*query = 0;
+	query++;
+	}
+
+setenv("QUERY_STRING", query, 1);
+
+/* if httpd-conf is defined call it with the request 
+   the httpd-conf procedure returns a string transformation
+   of request, for security stuff, remappping etc. */
+
+if(lookupSymbol("httpd-conf", mainContext) != NULL)
+    {
+    len = strlen(request) + strlen(query) + 32;
+    command = alloca(len);
+    snprintf(command, len - 1, "(httpd-conf \"%s\" \"%s\")", request, query);
+    result = sysEvalString(command, nilCell, mainContext);
+    if(result->type == CELL_STRING)
+		request = (char *)result->contents;
+	else if (isNil(result))
+		{
+		if(IOchannel != NULL) 
+			{
+			deleteList(result);
+			fclose(IOchannel);
+			IOchannel = NULL;
+			}
+		return(TRUE);
+		}
+    }
+
+/* change to base dir of request file */
+sptr = request + strlen(request);
+while(*sptr != '/' && sptr != request) --sptr;
+if(*sptr == '/') 
+	{
+	*sptr = 0;
+	sptr++;
+	chdir(request);
+	request = sptr;
+	}
+
+if((len = strlen(request)) == 0)
+	{
+	if(isFile(DEFAULT_PAGE_2) == 0)	
+		request = DEFAULT_PAGE_2;
+	else
+		request = DEFAULT_PAGE_1;
+	len = strlen(request);
+	}
+
+size = readHeader(buff, &pragmaFlag);
+switch(type)
+	{
+	case HTTP_GET_HEAD:
+	case HTTP_GET_URL:
+		if(endsWith(request, CGI_EXTENSION))
+			handleHTTPcgi(request, query);
+		else
+			{
+			if(endsWith(request, ".jpg")) mediaType = "image/jpeg";
+			else if(endsWith(request, ".png")) mediaType = "image/png";
+			else if(endsWith(request, ".gif")) mediaType = "image/gif";
+			else if(endsWith(request, ".pdf")) mediaType = "application/pdf";
+			else if(endsWith(request, ".mp3")) mediaType = "audio/mpeg";
+			else if(endsWith(request, ".mov")) mediaType = "video/quicktime";
+			else if(endsWith(request, ".mpg")) mediaType = "video/mpeg";
+			else mediaType = MEDIA_TXT;
+
+			if(type == HTTP_GET_HEAD)
+				{
+				snprintf(buff, MAX_BUFF - 1, 
+#ifndef WIN_32
+					"Content-length: %lld\r\nContent-type: %s\r\n\r\n", 
+					(long long int)fileSize(request), 
+#else
+					"Content-length: %ld\r\nContent-type: %s\r\n\r\n", 
+					(long)fileSize(request), 
+#endif
+					mediaType);
+				sendHTTPpage(buff, strlen(buff), NULL, TRUE);
+				}
+			else
+				{
+				if((size = readFile(request, &content)) == -1)
+					sendHTTPmessage(ERROR_404, request);
+				else
+					sendHTTPpage(content, size, mediaType, TRUE);
+
+				if(content) free(content);
+				}
+			}
+		break;
+
+	case HTTP_DELETE_URL:
+		if(unlink(request) != 0)	
+			sendHTTPmessage("ERR:500 Could not delete: %s\r\n", request);
+		else
+			sendHTTPmessage("File deleted: %s\r\n", request);
+		break;
+
+	case HTTP_POST_URL:
+		if(!size)
+			{
+			sendHTTPmessage(ERR_411, request);
+			break;
+			}
+
+		query = callocMemory(size + 1);
+
+		if(readPayLoad(size, query, 0, request) == -1)
+			{
+			free(query);
+			sendHTTPmessage("ERR:500 cannot read header: %s\r\n", request);
+			break;
+			}
+
+		handleHTTPcgi(request, query);
+		free(query); 
+		break;
+
+	case HTTP_PUT_URL:
+		if(pragmaFlag) fileMode = "a";
+
+		if(!size)
+			{
+			sendHTTPmessage(ERR_411, request);
+			break;
+			}
+
+		if( (outFile = openFile(request, fileMode, NULL)) == (int)-1)
+			{
+			sendHTTPmessage("ERR:500 cannot create file: %s\r\n", request);
+			break;
+			}
+
+		transferred = readPayLoad(size, buff, outFile, request);
+		close(outFile);
+
+		if(transferred != -1)
+			{
+			snprintf(buff, 255, "%d bytes transferred for %s\r\n", (int)transferred, request);
+			sendHTTPpage(buff, strlen(buff), MEDIA_TXT, TRUE);
+			}
+		break;
+
+	default:
+		break;
+	}
+
+chdir(startupDir);
+if(result != NULL) deleteList(result);
+return(TRUE);
+}
+
+
+int sendHTTPmessage(char * fmt, char * str)
+{
+char msg[256];
+
+snprintf(msg, 255, fmt, str);
+sendHTTPpage(msg, strlen(msg), MEDIA_TXT, TRUE);
+return(0);
+}
+
+
+/* remove leading white space */ 
+char * trim(char * buff) 
+{
+char * ptr = buff;
+while(*ptr <= ' ') ptr++;
+return(ptr);
+}
+
+/* retrieve rest of header */
+size_t readHeader(char * buff, int * pragmaFlag)
+{
+size_t size = 0;
+int offset;
+
+*pragmaFlag = 0;
+
+memset(buff, 0, MAX_LINE);
+
+setenv("HTTP_HOST", "", 1);
+setenv("HTTP_USER_AGENT", "", 1);
+setenv("HTTP_COOKIE", "", 1);
+
+while(fgets(buff, MAX_LINE - 1, IOchannel) != NULL)
+	{
+	if(strcmp(buff, "\r\n") == 0 || strcmp(buff, "\n") == 0) break;
+
+	/* trim trailing white space */
+	offset = strlen(buff) - 1;
+	while(offset > 0 && *(buff + offset) <= ' ') 
+		*(buff + offset--) = 0;	
+
+	if(my_strnicmp(buff, "content-length:", 15) == 0)
+		size = parseValue(buff + 15);
+	if(my_strnicmp(buff, "pragma: append", 14) == 0)
+		*pragmaFlag = TRUE;
+
+	/* trim leading white space */
+	if(my_strnicmp(buff, "Host:", 5) == 0)
+		setenv("HTTP_HOST", trim(buff + 5), 1);
+	if(my_strnicmp(buff, "User-Agent:", 11) == 0)
+		setenv("HTTP_USER_AGENT", trim(buff + 11), 1);
+	if(my_strnicmp(buff, "Cookie:", 7) == 0)
+		setenv("HTTP_COOKIE", trim(buff + 7), 1);
+	}
+
+
+return(size);
+}
+
+
+ssize_t readPayLoad(ssize_t size, char * buff, int outFile, char * request)
+{
+ssize_t bytes;
+size_t offset = 0, transferred = 0;
+
+#ifdef DEBUGHTTP
+printf("payload size:%ld:\n", size);
+#endif
+
+while(size > 0)
+	{
+#ifndef WIN_32
+	bytes = read(fileno(IOchannel), buff + offset, MAX_BUFF); 
+#else
+	if(IOchannel != NULL && isSocketStream(IOchannel))
+		bytes = recv(getSocket(IOchannel), buff + offset, MAX_BUFF, NO_FLAGS_SET);
+	else
+		bytes = read(fileno(IOchannel), buff + offset, MAX_BUFF);
+#endif
+
+#ifdef DEBUGHTTP
+printf("payload bytes:%ld:%s:\n", bytes, buff + offset);
+#endif
+
+	if(bytes <= 0)
+		{
+		sendHTTPmessage("ERR:500 error reading data: %s\r\n", request);
+		return(-1);
+		}
+
+	if(outFile)
+		{
+		if(write(outFile, buff + offset, bytes) != bytes)
+			{
+			sendHTTPmessage("ERR:500 cannot create file: %s\r\n", request);
+			return(-1);
+			}
+		}
+	else
+		offset += bytes;
+
+	transferred += bytes;
+	size -= bytes;
+	}	
+#ifndef WIN_32
+fflush(NULL); 
+#endif
+return(transferred);
+}
+
+
+
+void handleHTTPcgi(char * request, char * query)
+{
+FILE * handle;
+char * command;
+char * content = NULL;
+size_t size;
+char tempfile[32];
+#ifdef WIN_32_BEFORE_SETTING_BINARYMODE
+char * ptr;
+char * pos;
+int bytes = 0;
+#endif
+
+srandom(milliSecTime());
+
+#ifdef DEBUGHTTP
+printf("CGI request:%s:%s:\n", request, query);
+#endif
+
+if(isFile(request) != 0)
+	{
+	sendHTTPmessage(ERROR_404, request);
+	return;
+	}
+
+if(isFile("/tmp") != 0)
+    {
+    sendHTTPmessage("ERR:500 need /tmp directory configured: %s\n", request);
+    return;
+    }
+
+size = strlen(request) + 64;
+command = alloca(size);
+snprintf(tempfile, 30, "/tmp/nl%02x%08x%08x", (unsigned int)size, (unsigned int)random(), (unsigned int)random());
+
+#if defined (WIN_32) || (OS2)
+snprintf(command, size - 1, "newlisp %s > %s", request, tempfile);
+#else
+snprintf(command, size - 1, "./%s > %s", request, tempfile);
+#endif
+
+if((handle = popen(command, "w")) == NULL)
+	{
+	sendHTTPmessage("ERR:500 failed creating pipe: %s\n", request);
+	return;
+	}
+
+fwrite(query, 1, strlen(query), handle);
+fflush(handle);
+pclose(handle);
+
+size = readFile(tempfile, &content);
+if(size == -1)	
+	sendHTTPmessage("ERR:500 cannot read output of: %s", request);
+else
+	{
+#ifdef WIN_32_BEFORE_SETTING_BINARYMODE
+	/* replace all \r\r\n with \r\n (artefact of Win32 out-piping) */
+	ptr = content;
+	bytes = 0;
+	while((pos = strstr(ptr, "\r\r\n")))
+		{
+		memcpy(content + bytes, ptr, pos - ptr);
+		bytes += pos - ptr;
+		memcpy(content + bytes, "\r\n", 2);
+		bytes += 2;
+		ptr = pos + 3 ;
+		--size;
+		}
+	memcpy(content + bytes, ptr, size - bytes);
+	*(content + size) = 0;
+#endif	
+	sendHTTPpage(content, size, NULL, TRUE);
+	}
+	
+unlink(tempfile);
+if(content) free(content);
+}	
+
+
+int endsWith(char * str, char * ext)
+{
+size_t size, len;
+
+size = strlen(str);
+len =  strlen(ext);
+
+return(strncmp(str + size - len, ext, len) == 0);
+}
+
+/* eof */
+
diff --git a/nl-xml.c b/nl-xml.c
new file mode 100644
index 0000000..9316e38
--- /dev/null
+++ b/nl-xml.c
@@ -0,0 +1,667 @@
+/* nl-xml.c - newLISP XML interface 
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+#include "newlisp.h"
+#include "protos.h"
+
+#define XML_NONE 0
+#define XML_TEXT 1
+#define XML_CDATA 2
+#define XML_COMMENT 3
+#define XML_ELEMENT 4
+
+int isWhiteSpaceStringN(char * source, int tagPos);
+CELL * makeTagSymbolCell(char * tagStart, int tagLen);
+void performXmlCallback(CELL * cell, char * start);
+
+char * typeNames[] =
+  {
+  "none",
+  "TEXT",
+  "CDATA",
+  "COMMENT",
+  "ELEMENT"
+  };
+
+CELL typeCells[5] = {{0}, {0}, {0}, {0}, {0}};
+
+static char * xmlError;
+static char xmlMsg[64];
+static char * sourceOrg;
+static char * source;
+
+static SYMBOL * XMLcontext;
+
+UINT optionsFlag;
+#define OPTION_NO_OPTION 0
+#define OPTION_NO_WHITESPACE 1
+#define OPTION_NO_EMPTY_ATTRIBUTES 2
+#define OPTION_NO_COMMENTS 4
+#define OPTION_TAGS_TO_SYMBOLS 8
+#define OPTION_SXML_ATTRIBUTES 16
+
+
+typedef struct
+	{
+	char * name;
+	void * next;
+	} TAG_STACK;
+
+TAG_STACK * tagStack = NULL;
+
+CELL * xmlCallback = NULL;
+
+/* setup type tage default cells, if done already just relink */
+CELL * setupTypeTagCells(void)
+{
+int i;
+
+/* if never done, initialize defaults */
+if(typeCells[0].contents == 0)
+    for(i = 0; i < 5; i++)
+    {
+    typeCells[i].type = (i == 0) ? CELL_EXPRESSION : CELL_STRING;
+    typeCells[i].next = nilCell;
+    typeCells[i].aux = (i == 0) ? (UINT)nilCell : strlen(typeNames[i]) + 1;
+    typeCells[i].contents = (UINT)typeNames[i];
+    }
+
+/* link cells in a list */
+typeCells[0].contents = (UINT)&typeCells[1];
+for(i = 1; i < 4; i++)
+    typeCells[i].next = &typeCells[i+1];
+
+return(&typeCells[0]);
+}
+
+CELL * p_XMLparse(CELL * params)
+{
+CELL * result;
+
+if(xmlCallback != NULL)
+	errorProc(ERR_NOT_REENTRANT);
+
+params = getString(params, &source);
+if(params != nilCell)
+	{
+    params = getInteger(params, &optionsFlag);
+	if(params != nilCell)
+		{
+		XMLcontext = getCreateContext(params, TRUE);
+		if(XMLcontext == NULL)
+			return(errorProc(ERR_SYMBOL_OR_CONTEXT_EXPECTED));
+		if(params->next != nilCell)
+			xmlCallback = params->next;	
+		else
+			xmlCallback = NULL;
+		}
+	else
+		XMLcontext = currentContext;
+	}
+else 
+	optionsFlag = OPTION_NO_OPTION;
+
+setupTypeTagCells();
+
+xmlError = NULL;
+sourceOrg = source;
+deleteTagStack();
+
+result = parseDoc();
+deleteTagStack();
+
+if(xmlError != NULL)
+	return nilCell;
+else
+	return result;
+}
+
+
+CELL * p_XMLtypeTags(CELL * params)
+{
+int i;
+CELL * cell;
+
+if(params == nilCell) 
+    return(copyCell(setupTypeTagCells()));
+
+setupTypeTagCells();
+
+for(i = 1; i < 5; i++)
+    {
+    cell = evaluateExpression(params);
+    memcpy(&typeCells[i], cell, sizeof(CELL));
+    params = params->next;
+    }
+
+return(copyCell(setupTypeTagCells()));
+}
+
+
+CELL * p_XMLerror(CELL * params)
+{
+CELL * errorCell;
+CELL * cell;
+
+if(xmlError == NULL)
+	return(nilCell);
+
+errorCell = getCell(CELL_EXPRESSION);
+cell = stuffString(xmlError);
+errorCell->contents = (UINT)cell;
+cell->next = stuffInteger((UINT)(source - sourceOrg));
+
+return errorCell;
+}
+
+void deleteTagStack(void)
+{
+TAG_STACK * oldTagStack;
+
+while(tagStack != NULL)
+	{
+	oldTagStack = tagStack;
+	freeMemory(tagStack->name);
+	tagStack = tagStack->next;
+	freeMemory(oldTagStack);
+	}
+}
+
+
+CELL * parseDoc(void)
+{
+CELL * node;
+CELL * lastNode;
+int closingFlag = FALSE;
+int tagPos;
+
+lastNode = node = getCell(CELL_EXPRESSION);
+
+while(!xmlError && !closingFlag)
+	{
+	if((tagPos = find("<", source)) == -1) break;
+	if(tagPos > 0)
+		{
+		if( (tagStack != NULL) || (node->contents != (UINT)nilCell))
+			{
+			if((optionsFlag & OPTION_NO_WHITESPACE) && isWhiteSpaceStringN(source, tagPos))
+                		{;}
+			else lastNode = appendNode(lastNode, makeTextNode(XML_TEXT, stuffStringN(source, tagPos)));
+			}
+		source = source + tagPos;
+		}
+
+	if(strncmp(source, "<!DOCTYPE", 9) == 0)
+		{
+		parseDTD();
+		continue;
+		}
+
+	if(*source == '<' && *(source + 1) == '?')
+		{
+		parseProcessingInstruction();
+		continue;
+		}
+
+	if(memcmp(source, "<!--", 4) == 0)
+		{
+		if(optionsFlag & OPTION_NO_COMMENTS)
+			parseTag("-->");
+		else
+			lastNode = appendNode(lastNode, parseTag("-->"));
+		continue;
+		}
+	if(memcmp(source, "<![CDATA[", 9) == 0)
+		{
+		lastNode = appendNode(lastNode, parseTag("]]>"));
+		continue;
+		}
+
+	if(*source == '<' && *(source + 1) == '/')
+		{
+		closingFlag = TRUE;
+		parseClosing();
+		continue;
+		}
+
+	lastNode = appendNode(lastNode, parseTag(">"));
+	}
+
+
+if(xmlError != NULL)
+	{
+	deleteList(node);
+	return nilCell;
+	}
+
+return node;
+}
+
+
+void parseDTD(void)
+{
+int closeTag, squareTag;
+int closePos = 0;
+char * closeTagStr;
+
+if((closeTag = find(">", source)) == -1)
+	{
+	xmlError = "error in DTD: expected '>'";
+	return;
+	}
+
+squareTag = find("[", source);
+if(squareTag != -1 && squareTag < closeTag)
+	closeTagStr = "]>";
+else
+	closeTagStr = ">";
+
+while(!xmlError)
+	{
+	if((closePos = find(closeTagStr, source)) == -1)
+		{
+		snprintf(xmlMsg, 63, "expected: %s", closeTagStr);
+		xmlError = xmlMsg;
+		return;
+		}
+	if(*(source + closePos - 1) != ']')
+		break;
+	source = source + closePos + strlen(closeTagStr);
+	}
+
+source = source + closePos + strlen(closeTagStr);
+return;
+}
+
+
+void parseProcessingInstruction(void)
+{
+int closeTag;
+
+if((closeTag = find("?>", source)) == -1)
+	{
+	xmlError = "expecting closing tag sequence '?>'";
+	return;
+	}
+
+source = source + closeTag + 2;
+}
+
+
+void parseClosing(void)
+{
+int closeTag;
+char * tagName;
+TAG_STACK * oldTagStack;
+
+if((closeTag = find(">", source)) == -1)
+	{
+	xmlError = "missing closing >";
+	return;
+	}
+
+if(tagStack == NULL)
+	{
+	xmlError = "closing tag has no opening";
+	return;
+	}
+
+tagName = tagStack->name;
+if(strncmp(source + 2, tagName, strlen(tagName)) != 0)
+	{
+	xmlError = "closing tag doesn't match";
+	return;
+	}
+
+/* pop tagStack */
+freeMemory(tagName);
+oldTagStack = tagStack;
+tagStack = tagStack->next;
+
+freeMemory(oldTagStack);
+
+source = source + closeTag + 1;
+}
+
+
+CELL * parseTag(char * closeTagStr)
+{
+char * newSrc;
+char * tagStart;
+int closeTag;
+CELL * cell;
+
+tagStart = source;
+
+cell = NULL;
+closeTag = find(closeTagStr, source);
+if(*(source + closeTag - 1) == '/')
+	{
+	if(memcmp(closeTagStr,"]]>",3) != 0)
+		{
+		--closeTag;
+		closeTagStr = "/>";
+		}
+	}
+
+if(closeTag == -1)
+	{
+	snprintf(xmlMsg, 63, "expected closing tag: %s", closeTagStr);
+	xmlError = xmlMsg;
+	return nilCell;
+	}
+
+if(memcmp(source, "<!--", 4) == 0)
+	{
+	if(optionsFlag & OPTION_NO_COMMENTS)
+		cell = nilCell;
+	else
+		{
+		cell = stuffStringN(source + 4, closeTag - 4);
+		cell = makeTextNode(XML_COMMENT, cell);
+		}
+	}
+
+if(memcmp(source, "<![CDATA[", 9) == 0)
+	{
+	cell = stuffStringN(source + 9, closeTag - 9);
+	cell = makeTextNode(XML_CDATA, cell);
+	}
+
+if(*source == '<' && *(source + 1) == '/')
+	{
+	xmlError = "closing node has no opening";
+	return nilCell;
+	}
+
+newSrc = source + closeTag + strlen(closeTagStr);
+
+if(cell == NULL)
+	cell = parseNormalTag(source + closeTag, newSrc);
+else
+	source = newSrc;
+
+/* call back with closed tag expression found
+   and opening start and end of source of this
+   tag expression
+*/
+
+if(xmlCallback) 
+	performXmlCallback(cell, tagStart);
+
+return(cell);
+}
+
+
+void performXmlCallback(CELL * result, char * tagStart)
+{
+CELL * list;
+CELL * cell;
+CELL * next;
+int errNo;
+
+list = getCell(CELL_EXPRESSION);
+list->contents = (UINT)copyCell(xmlCallback);
+cell = getCell(CELL_QUOTE);
+cell->contents = (UINT)copyCell(result);
+cell->next = stuffInteger((UINT)(tagStart - sourceOrg));
+next = cell->next;
+next->next = stuffInteger((UINT)(source - tagStart));
+((CELL*)list->contents)->next = cell;
+pushResult(list);
+if(!evaluateExpressionSafe(list, &errNo))
+	{
+	deleteTagStack();
+	longjmp(errorJump, errNo);
+	}
+}
+
+
+CELL * parseNormalTag(char * endSrc, char * newSrc)
+{
+char * tagStart;
+int tagLen;
+CELL * attributes;
+CELL * childs;
+CELL * tagCell;
+TAG_STACK * tag;
+
+++source; /* skip '/' */
+
+while(*source <= ' ' && source < endSrc) ++source; /* skip whitespace */
+
+tagStart = source;
+tagLen = 0;
+while(*source > ' ' && source < endSrc) ++source, ++tagLen; /* find tag end */
+
+attributes = parseAttributes(endSrc);
+if(optionsFlag & OPTION_SXML_ATTRIBUTES)
+	{
+	childs = (CELL*)attributes->contents;
+	if(! (childs == nilCell && (optionsFlag & OPTION_NO_EMPTY_ATTRIBUTES)))
+		{
+		attributes->contents = (UINT)stuffSymbol(atSymbol);
+		((CELL*)(attributes->contents))->next = childs;
+		}
+	}
+
+if(xmlError) 
+	return nilCell;
+
+if(*source == '/' && *(source + 1) == '>')
+	{
+	source = newSrc;
+	if(optionsFlag & OPTION_TAGS_TO_SYMBOLS)
+		tagCell = makeTagSymbolCell(tagStart, tagLen);
+	else
+		tagCell = stuffStringN(tagStart, tagLen);
+	return makeElementNode(tagCell, attributes, getCell(CELL_EXPRESSION));
+	}
+
+/* push tag on tagstack */
+tag = (TAG_STACK*)allocMemory(sizeof(TAG_STACK));
+tag->name = (char *)callocMemory(tagLen + 1);
+memcpy(tag->name, tagStart, tagLen);
+tag->next = tagStack;
+tagStack = tag;
+
+source = newSrc;
+childs = parseDoc();
+
+if(optionsFlag & OPTION_TAGS_TO_SYMBOLS)
+    tagCell = makeTagSymbolCell(tagStart, tagLen);
+else
+    tagCell = stuffStringN(tagStart, tagLen);
+
+return makeElementNode(tagCell, attributes, childs);
+}
+
+
+CELL * makeTagSymbolCell(char * tagStart, int tagLen)
+{
+char * name;
+CELL * cell;
+
+name = (char *)callocMemory(tagLen + 1);
+memcpy(name, tagStart, tagLen);
+cell = stuffSymbol(translateCreateSymbol(name, CELL_NIL, XMLcontext, 0));
+freeMemory(name);
+return(cell);
+}
+
+
+CELL * parseAttributes(char * endSrc)
+{
+CELL * attributes;
+CELL * att;
+CELL * cell;
+CELL * lastAtt;
+char * namePos;
+char * valPos;
+char quoteChar;
+int  nameLen, valLen;
+
+attributes = getCell(CELL_EXPRESSION);
+lastAtt = NULL;
+
+while(!xmlError && source < endSrc)
+	{
+	while(*source <= ' ' && source < endSrc) source++; /* strip leading space */
+	namePos = source;
+	nameLen = 0;
+	while(*source > ' ' && *source != '=' && source < endSrc) source++, nameLen++; /* get end */
+	if(nameLen == 0) break;
+	while(*source <= ' ' && source < endSrc) source++; /* strip leading space */
+	if(*source != '=')
+		{
+		xmlError = "expected '=' in attributes";
+		deleteList(attributes);
+		return nilCell;
+		}
+	else source++;
+	while(*source <= ' ' && source < endSrc) source++; /* strip spaces */
+	if(*source != '\"' && *source != '\'')
+		{
+		xmlError = "attribute values must be delimited by \" or \' ";
+		deleteList(attributes);
+		return nilCell;
+		}
+	quoteChar = *source;
+	source++;
+	valPos = source;
+	valLen = 0;
+	while(*source != quoteChar && source < endSrc) source++, valLen++;
+	if(*source != quoteChar) valLen = -1;
+	else source++;
+	if(nameLen == 0 || valLen == -1)
+		{
+		xmlError = "incorrect attribute";
+		deleteList(attributes);
+		return nilCell;
+		}
+	att = getCell(CELL_EXPRESSION);
+	if(optionsFlag & OPTION_TAGS_TO_SYMBOLS)
+        	cell = makeTagSymbolCell(namePos, nameLen);
+	else
+		cell = stuffStringN(namePos, nameLen);
+	cell->next = stuffStringN(valPos, valLen);
+	att->contents = (UINT)cell;
+	if(lastAtt == NULL)
+		attributes->contents = (UINT)att;
+	else 
+		lastAtt->next = att;
+	lastAtt = att;
+	}
+
+return attributes;
+}
+
+
+CELL * appendNode(CELL * node, CELL * newNode)
+{
+if(node->contents == (UINT)nilCell)
+	node->contents = (UINT)newNode;
+else
+	node->next = newNode;
+
+return newNode;
+}
+
+
+CELL * makeTextNode(int type, CELL * contents)
+{
+CELL * newNode;
+CELL * cell;
+
+/* unwrap text node if nil xml-type-tag */
+if(typeCells[type].type == CELL_NIL)
+    return(contents);
+
+newNode = getCell(CELL_EXPRESSION);
+cell = copyCell(&typeCells[type]);
+newNode->contents = (UINT)cell;
+cell->next = contents;
+
+return newNode;
+}
+
+
+CELL * makeElementNode(CELL * tagNode, CELL * attributesNode, CELL * childrenNode)
+{
+CELL * newNode;
+CELL * cell;
+
+/* unwrap children node, if nil in xml-type-tag */
+if(typeCells[XML_ELEMENT].type == CELL_NIL)
+    {
+    cell = childrenNode;
+    childrenNode = (CELL *)childrenNode->contents;
+    cell->contents = (UINT)nilCell;
+    deleteList(cell);
+    }
+
+newNode = getCell(CELL_EXPRESSION);
+if(typeCells[XML_ELEMENT].type == CELL_NIL)
+    newNode->contents = (UINT)tagNode;
+else
+    {
+    cell = copyCell(&typeCells[XML_ELEMENT]);
+    newNode->contents = (UINT)cell;
+    cell->next = tagNode;
+    }
+
+if( (attributesNode->contents == (UINT)nilCell) && 
+    (optionsFlag & OPTION_NO_EMPTY_ATTRIBUTES))
+    {
+    tagNode->next = childrenNode;
+    deleteList(attributesNode);
+    }
+else
+    {
+    tagNode->next = attributesNode;
+    attributesNode->next = childrenNode;
+    }
+
+return newNode;
+}
+	
+
+int find(char * key, char * source)
+{
+char * ptr;
+
+ptr = strstr(source, key);
+if(ptr == NULL) return -1;
+
+return(ptr - source);
+}
+	
+
+int isWhiteSpaceStringN(char * source, int tagPos)
+{
+while(tagPos--) if((unsigned char)*source++ > 32) return(FALSE);
+return(TRUE);
+}
+
+/* eof */
+
+
+
+
+
diff --git a/pcre-chartables.c b/pcre-chartables.c
new file mode 100644
index 0000000..55e413c
--- /dev/null
+++ b/pcre-chartables.c
@@ -0,0 +1,183 @@
+/*************************************************
+*      Perl-Compatible Regular Expressions       *
+*************************************************/
+
+/* This file is automatically written by the dftables auxiliary 
+program. If you edit it by hand, you might like to edit the Makefile to 
+prevent its ever being regenerated.
+
+This file is #included in the compilation of pcre.c to build the default
+character tables which are used when no tables are passed to the compile
+function. */
+
+static unsigned char pcre_default_tables[] = {
+
+/* This table is a lower casing table. */
+
+    0,  1,  2,  3,  4,  5,  6,  7,
+    8,  9, 10, 11, 12, 13, 14, 15,
+   16, 17, 18, 19, 20, 21, 22, 23,
+   24, 25, 26, 27, 28, 29, 30, 31,
+   32, 33, 34, 35, 36, 37, 38, 39,
+   40, 41, 42, 43, 44, 45, 46, 47,
+   48, 49, 50, 51, 52, 53, 54, 55,
+   56, 57, 58, 59, 60, 61, 62, 63,
+   64, 97, 98, 99,100,101,102,103,
+  104,105,106,107,108,109,110,111,
+  112,113,114,115,116,117,118,119,
+  120,121,122, 91, 92, 93, 94, 95,
+   96, 97, 98, 99,100,101,102,103,
+  104,105,106,107,108,109,110,111,
+  112,113,114,115,116,117,118,119,
+  120,121,122,123,124,125,126,127,
+  128,129,130,131,132,133,134,135,
+  136,137,138,139,140,141,142,143,
+  144,145,146,147,148,149,150,151,
+  152,153,154,155,156,157,158,159,
+  160,161,162,163,164,165,166,167,
+  168,169,170,171,172,173,174,175,
+  176,177,178,179,180,181,182,183,
+  184,185,186,187,188,189,190,191,
+  192,193,194,195,196,197,198,199,
+  200,201,202,203,204,205,206,207,
+  208,209,210,211,212,213,214,215,
+  216,217,218,219,220,221,222,223,
+  224,225,226,227,228,229,230,231,
+  232,233,234,235,236,237,238,239,
+  240,241,242,243,244,245,246,247,
+  248,249,250,251,252,253,254,255,
+
+/* This table is a case flipping table. */
+
+    0,  1,  2,  3,  4,  5,  6,  7,
+    8,  9, 10, 11, 12, 13, 14, 15,
+   16, 17, 18, 19, 20, 21, 22, 23,
+   24, 25, 26, 27, 28, 29, 30, 31,
+   32, 33, 34, 35, 36, 37, 38, 39,
+   40, 41, 42, 43, 44, 45, 46, 47,
+   48, 49, 50, 51, 52, 53, 54, 55,
+   56, 57, 58, 59, 60, 61, 62, 63,
+   64, 97, 98, 99,100,101,102,103,
+  104,105,106,107,108,109,110,111,
+  112,113,114,115,116,117,118,119,
+  120,121,122, 91, 92, 93, 94, 95,
+   96, 65, 66, 67, 68, 69, 70, 71,
+   72, 73, 74, 75, 76, 77, 78, 79,
+   80, 81, 82, 83, 84, 85, 86, 87,
+   88, 89, 90,123,124,125,126,127,
+  128,129,130,131,132,133,134,135,
+  136,137,138,139,140,141,142,143,
+  144,145,146,147,148,149,150,151,
+  152,153,154,155,156,157,158,159,
+  160,161,162,163,164,165,166,167,
+  168,169,170,171,172,173,174,175,
+  176,177,178,179,180,181,182,183,
+  184,185,186,187,188,189,190,191,
+  192,193,194,195,196,197,198,199,
+  200,201,202,203,204,205,206,207,
+  208,209,210,211,212,213,214,215,
+  216,217,218,219,220,221,222,223,
+  224,225,226,227,228,229,230,231,
+  232,233,234,235,236,237,238,239,
+  240,241,242,243,244,245,246,247,
+  248,249,250,251,252,253,254,255,
+
+/* This table contains bit maps for various character classes.
+Each map is 32 bytes long and the bits run from the least
+significant end of each byte. The classes that have their own
+maps are: space, xdigit, digit, upper, lower, word, graph
+print, punct, and cntrl. Other classes are built from combinations. */
+
+  0x00,0x3e,0x00,0x00,0x01,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+  0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03,
+  0x7e,0x00,0x00,0x00,0x7e,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+  0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0xfe,0xff,0xff,0x07,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0x07,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+  0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03,
+  0xfe,0xff,0xff,0x87,0xfe,0xff,0xff,0x07,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+  0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0xff,
+  0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+  0x00,0x00,0x00,0x00,0xff,0xff,0xff,0xff,
+  0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+  0x00,0x00,0x00,0x00,0xfe,0xff,0x00,0xfc,
+  0x01,0x00,0x00,0xf8,0x01,0x00,0x00,0x78,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+  0xff,0xff,0xff,0xff,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x80,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+/* This table identifies various classes of character by individual bits:
+  0x01   white space character
+  0x02   letter
+  0x04   decimal digit
+  0x08   hexadecimal digit
+  0x10   alphanumeric or '_'
+  0x80   regular expression metacharacter or binary zero
+*/
+
+  0x80,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*   0-  7 */
+  0x00,0x01,0x01,0x00,0x01,0x01,0x00,0x00, /*   8- 15 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  16- 23 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  24- 31 */
+  0x01,0x00,0x00,0x00,0x80,0x00,0x00,0x00, /*    - '  */
+  0x80,0x80,0x80,0x80,0x00,0x00,0x80,0x00, /*  ( - /  */
+  0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c, /*  0 - 7  */
+  0x1c,0x1c,0x00,0x00,0x00,0x00,0x00,0x80, /*  8 - ?  */
+  0x00,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /*  @ - G  */
+  0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /*  H - O  */
+  0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /*  P - W  */
+  0x12,0x12,0x12,0x80,0x00,0x00,0x80,0x10, /*  X - _  */
+  0x00,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /*  ` - g  */
+  0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /*  h - o  */
+  0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /*  p - w  */
+  0x12,0x12,0x12,0x80,0x80,0x00,0x00,0x00, /*  x -127 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */
+
+/* End of chartables.c */
diff --git a/pcre-config.h b/pcre-config.h
new file mode 100644
index 0000000..55559d8
--- /dev/null
+++ b/pcre-config.h
@@ -0,0 +1,108 @@
+/* config.h.  Generated by configure.  */
+
+/* On Unix systems config.in is converted by configure into config.h. PCRE is
+written in Standard C, but there are a few non-standard things it can cope
+with, allowing it to run on SunOS4 and other "close to standard" systems.
+
+On a non-Unix system you should just copy this file into config.h, and set up
+the macros the way you need them. You should normally change the definitions of
+HAVE_STRERROR and HAVE_MEMMOVE to 1. Unfortunately, because of the way autoconf
+works, these cannot be made the defaults. If your system has bcopy() and not
+memmove(), change the definition of HAVE_BCOPY instead of HAVE_MEMMOVE. If your
+system has neither bcopy() nor memmove(), leave them both as 0; an emulation
+function will be used. */
+
+/* If you are compiling for a system that uses EBCDIC instead of ASCII
+character codes, define this macro as 1. On systems that can use "configure",
+this can be done via --enable-ebcdic. */
+
+#ifndef EBCDIC
+#define EBCDIC 0
+#endif
+
+/* If you are compiling for a system that needs some magic to be inserted
+before the definition of an exported function, define this macro to contain the
+relevant magic. It apears at the start of every exported function. */
+
+#define EXPORT
+
+/* Define to empty if the "const" keyword does not work. */
+
+/* #undef const */
+
+/* Define to "unsigned" if <stddef.h> doesn't define size_t. */
+
+/* #undef size_t */
+
+/* The following two definitions are mainly for the benefit of SunOS4, which
+doesn't have the strerror() or memmove() functions that should be present in
+all Standard C libraries. The macros HAVE_STRERROR and HAVE_MEMMOVE should
+normally be defined with the value 1 for other systems, but unfortunately we
+can't make this the default because "configure" files generated by autoconf
+will only change 0 to 1; they won't change 1 to 0 if the functions are not
+found. */
+
+#define HAVE_STRERROR 1
+#define HAVE_MEMMOVE 1
+
+/* There are some non-Unix systems that don't even have bcopy(). If this macro
+is false, an emulation is used. If HAVE_MEMMOVE is set to 1, the value of
+HAVE_BCOPY is not relevant. */
+
+#define HAVE_BCOPY 1
+
+/* The value of NEWLINE determines the newline character. The default is to
+leave it up to the compiler, but some sites want to force a particular value.
+On Unix systems, "configure" can be used to override this default. */
+
+#ifndef NEWLINE
+#define NEWLINE '\n'
+#endif
+
+/* The value of LINK_SIZE determines the number of bytes used to store
+links as offsets within the compiled regex. The default is 2, which allows for
+compiled patterns up to 64K long. This covers the vast majority of cases.
+However, PCRE can also be compiled to use 3 or 4 bytes instead. This allows for
+longer patterns in extreme cases. On Unix systems, "configure" can be used to
+override this default. */
+
+#ifndef LINK_SIZE
+#define LINK_SIZE   2
+#endif
+
+/* The value of MATCH_LIMIT determines the default number of times the match()
+function can be called during a single execution of pcre_exec(). (There is a
+runtime method of setting a different limit.) The limit exists in order to
+catch runaway regular expressions that take for ever to determine that they do
+not match. The default is set very large so that it does not accidentally catch
+legitimate cases. On Unix systems, "configure" can be used to override this
+default default. */
+
+#ifndef MATCH_LIMIT
+#define MATCH_LIMIT 10000000
+#endif
+
+/* When calling PCRE via the POSIX interface, additional working storage is
+required for holding the pointers to capturing substrings because PCRE requires
+three integers per substring, whereas the POSIX interface provides only two. If
+the number of expected substrings is small, the wrapper function uses space on
+the stack, because this is faster than using malloc() for each call. The
+threshold above which the stack is no longer use is defined by POSIX_MALLOC_
+THRESHOLD. On Unix systems, "configure" can be used to override this default.
+*/
+
+#ifndef POSIX_MALLOC_THRESHOLD
+#define POSIX_MALLOC_THRESHOLD 10
+#endif
+
+/* PCRE uses recursive function calls to handle backtracking while matching.
+This can sometimes be a problem on systems that have stacks of limited size.
+Define NO_RECURSE to get a version that doesn't use recursion in the match()
+function; instead it creates its own stack by steam using pcre_recurse_malloc
+to get memory. For more detail, see comments and other stuff just above the
+match() function. On Unix systems, "configure" can be used to set this in the
+Makefile (use --disable-stack-for-recursion). */
+
+/* #define NO_RECURSE */
+
+/* End */
diff --git a/pcre-internal.h b/pcre-internal.h
new file mode 100644
index 0000000..44ea4cf
--- /dev/null
+++ b/pcre-internal.h
@@ -0,0 +1,752 @@
+/*************************************************
+*      Perl-Compatible Regular Expressions       *
+*************************************************/
+
+
+/* This is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language. See
+the file doc/Tech.Notes for some information on the internals.
+
+Written by: Philip Hazel <ph10@cam.ac.uk>
+
+           Copyright (c) 1997-2004 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice,
+      this list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+    * Neither the name of the University of Cambridge nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+-----------------------------------------------------------------------------
+*/
+
+/* This header contains definitions that are shared between the different
+modules, but which are not relevant to the outside. */
+
+/* Get the definitions provided by running "configure" */
+
+#include "pcre-config.h"
+
+/* Standard C headers plus the external interface definition. The only time
+setjmp and stdarg are used is when NO_RECURSE is set. */
+
+#include <ctype.h>
+#include <limits.h>
+#include <setjmp.h>
+#include <stdarg.h>
+#include <stddef.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#ifndef PCRE_SPY
+#define PCRE_DEFINITION       /* Win32 __declspec(export) trigger for .dll */
+#endif
+
+/* We need to have types that specify unsigned 16-bit and 32-bit integers. We
+cannot determine these outside the compilation (e.g. by running a program as
+part of "configure") because PCRE is often cross-compiled for use on other
+systems. Instead we make use of the maximum sizes that are available at
+preprocessor time in standard C environments. */
+
+#if USHRT_MAX == 65535
+  typedef unsigned short pcre_uint16;
+#elif UINT_MAX == 65535
+  typedef unsigned int pcre_uint16;
+#else
+  #error Cannot determine a type for 16-bit unsigned integers
+#endif
+
+#if UINT_MAX == 4294967295
+  typedef unsigned int pcre_uint32;
+#elif ULONG_MAX == 4294967295
+  typedef unsigned long int pcre_uint32;
+#else
+  #error Cannot determine a type for 32-bit unsigned integers
+#endif
+
+/* All character handling must be done as unsigned characters. Otherwise there
+are problems with top-bit-set characters and functions such as isspace().
+However, we leave the interface to the outside world as char *, because that
+should make things easier for callers. We define a short type for unsigned char
+to save lots of typing. I tried "uchar", but it causes problems on Digital
+Unix, where it is defined in sys/types, so use "uschar" instead. */
+
+typedef unsigned char uschar;
+
+/* Include the public PCRE header */
+
+#include "pcre.h"
+
+/* When compiling for use with the Virtual Pascal compiler, these functions
+need to have their names changed. PCRE must be compiled with the -DVPCOMPAT
+option on the command line. */
+
+#ifdef VPCOMPAT
+#define strncmp(s1,s2,m) _strncmp(s1,s2,m)
+#define memcpy(d,s,n)    _memcpy(d,s,n)
+#define memmove(d,s,n)   _memmove(d,s,n)
+#define memset(s,c,n)    _memset(s,c,n)
+#else  /* VPCOMPAT */
+
+/* To cope with SunOS4 and other systems that lack memmove() but have bcopy(),
+define a macro for memmove() if HAVE_MEMMOVE is false, provided that HAVE_BCOPY
+is set. Otherwise, include an emulating function for those systems that have
+neither (there some non-Unix environments where this is the case). This assumes
+that all calls to memmove are moving strings upwards in store, which is the
+case in PCRE. */
+
+#if ! HAVE_MEMMOVE
+#undef  memmove        /* some systems may have a macro */
+#if HAVE_BCOPY
+#define memmove(a, b, c) bcopy(b, a, c)
+#else  /* HAVE_BCOPY */
+void *
+pcre_memmove(unsigned char *dest, const unsigned char *src, size_t n)
+{
+int i;
+dest += n;
+src += n;
+for (i = 0; i < n; ++i) *(--dest) =  *(--src);
+}
+#define memmove(a, b, c) pcre_memmove(a, b, c)
+#endif   /* not HAVE_BCOPY */
+#endif   /* not HAVE_MEMMOVE */
+#endif   /* not VPCOMPAT */
+
+
+/* PCRE keeps offsets in its compiled code as 2-byte quantities (always stored
+in big-endian order) by default. These are used, for example, to link from the
+start of a subpattern to its alternatives and its end. The use of 2 bytes per
+offset limits the size of the compiled regex to around 64K, which is big enough
+for almost everybody. However, I received a request for an even bigger limit.
+For this reason, and also to make the code easier to maintain, the storing and
+loading of offsets from the byte string is now handled by the macros that are
+defined here.
+
+The macros are controlled by the value of LINK_SIZE. This defaults to 2 in
+the config.h file, but can be overridden by using -D on the command line. This
+is automated on Unix systems via the "configure" command. */
+
+#if LINK_SIZE == 2
+
+#define PUT(a,n,d)   \
+  (a[n] = (d) >> 8), \
+  (a[(n)+1] = (d) & 255)
+
+#define GET(a,n) \
+  (((a)[n] << 8) | (a)[(n)+1])
+
+#define MAX_PATTERN_SIZE (1 << 16)
+
+
+#elif LINK_SIZE == 3
+
+#define PUT(a,n,d)       \
+  (a[n] = (d) >> 16),    \
+  (a[(n)+1] = (d) >> 8), \
+  (a[(n)+2] = (d) & 255)
+
+#define GET(a,n) \
+  (((a)[n] << 16) | ((a)[(n)+1] << 8) | (a)[(n)+2])
+
+#define MAX_PATTERN_SIZE (1 << 24)
+
+
+#elif LINK_SIZE == 4
+
+#define PUT(a,n,d)        \
+  (a[n] = (d) >> 24),     \
+  (a[(n)+1] = (d) >> 16), \
+  (a[(n)+2] = (d) >> 8),  \
+  (a[(n)+3] = (d) & 255)
+
+#define GET(a,n) \
+  (((a)[n] << 24) | ((a)[(n)+1] << 16) | ((a)[(n)+2] << 8) | (a)[(n)+3])
+
+#define MAX_PATTERN_SIZE (1 << 30)   /* Keep it positive */
+
+
+#else
+#error LINK_SIZE must be either 2, 3, or 4
+#endif
+
+
+/* Convenience macro defined in terms of the others */
+
+#define PUTINC(a,n,d)   PUT(a,n,d), a += LINK_SIZE
+
+
+/* PCRE uses some other 2-byte quantities that do not change when the size of
+offsets changes. There are used for repeat counts and for other things such as
+capturing parenthesis numbers in back references. */
+
+#define PUT2(a,n,d)   \
+  a[n] = (d) >> 8; \
+  a[(n)+1] = (d) & 255
+
+#define GET2(a,n) \
+  (((a)[n] << 8) | (a)[(n)+1])
+
+#define PUT2INC(a,n,d)  PUT2(a,n,d), a += 2
+
+
+/* In case there is no definition of offsetof() provided - though any proper
+Standard C system should have one. */
+
+#ifndef offsetof
+#define offsetof(p_type,field) ((size_t)&(((p_type *)0)->field))
+#endif
+
+
+/* These are the public options that can change during matching. */
+
+#define PCRE_IMS (PCRE_CASELESS|PCRE_MULTILINE|PCRE_DOTALL)
+
+/* Private options flags start at the most significant end of the four bytes,
+but skip the top bit so we can use ints for convenience without getting tangled
+with negative values. The public options defined in pcre.h start at the least
+significant end. Make sure they don't overlap, though now that we have expanded
+to four bytes, there is plenty of space. */
+
+#define PCRE_FIRSTSET      0x40000000  /* first_byte is set */
+#define PCRE_REQCHSET      0x20000000  /* req_byte is set */
+#define PCRE_STARTLINE     0x10000000  /* start after \n for multiline */
+#define PCRE_ICHANGED      0x08000000  /* i option changes within regex */
+#define PCRE_NOPARTIAL     0x04000000  /* can't use partial with this regex */
+
+/* Options for the "extra" block produced by pcre_study(). */
+
+#define PCRE_STUDY_MAPPED   0x01     /* a map of starting chars exists */
+
+/* Masks for identifying the public options which are permitted at compile
+time, run time or study time, respectively. */
+
+#define PUBLIC_OPTIONS \
+  (PCRE_CASELESS|PCRE_EXTENDED|PCRE_ANCHORED|PCRE_MULTILINE| \
+   PCRE_DOTALL|PCRE_DOLLAR_ENDONLY|PCRE_EXTRA|PCRE_UNGREEDY|PCRE_UTF8| \
+   PCRE_NO_AUTO_CAPTURE|PCRE_NO_UTF8_CHECK|PCRE_AUTO_CALLOUT)
+
+#define PUBLIC_EXEC_OPTIONS \
+  (PCRE_ANCHORED|PCRE_NOTBOL|PCRE_NOTEOL|PCRE_NOTEMPTY|PCRE_NO_UTF8_CHECK| \
+   PCRE_PARTIAL)
+
+#define PUBLIC_STUDY_OPTIONS 0   /* None defined */
+
+/* Magic number to provide a small check against being handed junk. */
+
+#define MAGIC_NUMBER  0x50435245UL   /* 'PCRE' */
+
+/* Negative values for the firstchar and reqchar variables */
+
+#define REQ_UNSET (-2)
+#define REQ_NONE  (-1)
+
+/* Flags added to firstbyte or reqbyte; a "non-literal" item is either a
+variable-length repeat, or a anything other than literal characters. */
+
+#define REQ_CASELESS 0x0100    /* indicates caselessness */
+#define REQ_VARY     0x0200    /* reqbyte followed non-literal item */
+
+/* Miscellaneous definitions */
+
+typedef int BOOL;
+
+#define FALSE   0
+#define TRUE    1
+
+/* Escape items that are just an encoding of a particular data value. Note that
+ESC_n is defined as yet another macro, which is set in config.h to either \n
+(the default) or \r (which some people want). */
+
+#ifndef ESC_e
+#define ESC_e 27
+#endif
+
+#ifndef ESC_f
+#define ESC_f '\f'
+#endif
+
+#ifndef ESC_n
+#define ESC_n NEWLINE
+#endif
+
+#ifndef ESC_r
+#define ESC_r '\r'
+#endif
+
+/* We can't officially use ESC_t because it is a POSIX reserved identifier
+(presumably because of all the others like size_t). */
+
+#ifndef ESC_tee
+#define ESC_tee '\t'
+#endif
+
+/* These are escaped items that aren't just an encoding of a particular data
+value such as \n. They must have non-zero values, as check_escape() returns
+their negation. Also, they must appear in the same order as in the opcode
+definitions below, up to ESC_z. There's a dummy for OP_ANY because it
+corresponds to "." rather than an escape sequence. The final one must be
+ESC_REF as subsequent values are used for \1, \2, \3, etc. There is are two
+tests in the code for an escape greater than ESC_b and less than ESC_Z to
+detect the types that may be repeated. These are the types that consume
+characters. If any new escapes are put in between that don't consume a
+character, that code will have to change. */
+
+enum { ESC_A = 1, ESC_G, ESC_B, ESC_b, ESC_D, ESC_d, ESC_S, ESC_s, ESC_W,
+       ESC_w, ESC_dum1, ESC_C, ESC_P, ESC_p, ESC_X, ESC_Z, ESC_z, ESC_E,
+       ESC_Q, ESC_REF };
+
+/* Flag bits and data types for the extended class (OP_XCLASS) for classes that
+contain UTF-8 characters with values greater than 255. */
+
+#define XCL_NOT    0x01    /* Flag: this is a negative class */
+#define XCL_MAP    0x02    /* Flag: a 32-byte map is present */
+
+#define XCL_END       0    /* Marks end of individual items */
+#define XCL_SINGLE    1    /* Single item (one multibyte char) follows */
+#define XCL_RANGE     2    /* A range (two multibyte chars) follows */
+#define XCL_PROP      3    /* Unicode property (one property code) follows */
+#define XCL_NOTPROP   4    /* Unicode inverted property (ditto) */
+
+
+/* Opcode table: OP_BRA must be last, as all values >= it are used for brackets
+that extract substrings. Starting from 1 (i.e. after OP_END), the values up to
+OP_EOD must correspond in order to the list of escapes immediately above.
+Note that whenever this list is updated, the two macro definitions that follow
+must also be updated to match. */
+
+enum {
+  OP_END,            /* 0 End of pattern */
+
+  /* Values corresponding to backslashed metacharacters */
+
+  OP_SOD,            /* 1 Start of data: \A */
+  OP_SOM,            /* 2 Start of match (subject + offset): \G */
+  OP_NOT_WORD_BOUNDARY,  /*  3 \B */
+  OP_WORD_BOUNDARY,      /*  4 \b */
+  OP_NOT_DIGIT,          /*  5 \D */
+  OP_DIGIT,              /*  6 \d */
+  OP_NOT_WHITESPACE,     /*  7 \S */
+  OP_WHITESPACE,         /*  8 \s */
+  OP_NOT_WORDCHAR,       /*  9 \W */
+  OP_WORDCHAR,           /* 10 \w */
+  OP_ANY,            /* 11 Match any character */
+  OP_ANYBYTE,        /* 12 Match any byte (\C); different to OP_ANY for UTF-8 */
+  OP_NOTPROP,        /* 13 \P (not Unicode property) */
+  OP_PROP,           /* 14 \p (Unicode property) */
+  OP_EXTUNI,         /* 15 \X (extended Unicode sequence */
+  OP_EODN,           /* 16 End of data or \n at end of data: \Z. */
+  OP_EOD,            /* 17 End of data: \z */
+
+  OP_OPT,            /* 18 Set runtime options */
+  OP_CIRC,           /* 19 Start of line - varies with multiline switch */
+  OP_DOLL,           /* 20 End of line - varies with multiline switch */
+  OP_CHAR,           /* 21 Match one character, casefully */
+  OP_CHARNC,         /* 22 Match one character, caselessly */
+  OP_NOT,            /* 23 Match anything but the following char */
+
+  OP_STAR,           /* 24 The maximizing and minimizing versions of */
+  OP_MINSTAR,        /* 25 all these opcodes must come in pairs, with */
+  OP_PLUS,           /* 26 the minimizing one second. */
+  OP_MINPLUS,        /* 27 This first set applies to single characters */
+  OP_QUERY,          /* 28 */
+  OP_MINQUERY,       /* 29 */
+  OP_UPTO,           /* 30 From 0 to n matches */
+  OP_MINUPTO,        /* 31 */
+  OP_EXACT,          /* 32 Exactly n matches */
+
+  OP_NOTSTAR,        /* 33 The maximizing and minimizing versions of */
+  OP_NOTMINSTAR,     /* 34 all these opcodes must come in pairs, with */
+  OP_NOTPLUS,        /* 35 the minimizing one second. */
+  OP_NOTMINPLUS,     /* 36 This set applies to "not" single characters */
+  OP_NOTQUERY,       /* 37 */
+  OP_NOTMINQUERY,    /* 38 */
+  OP_NOTUPTO,        /* 39 From 0 to n matches */
+  OP_NOTMINUPTO,     /* 40 */
+  OP_NOTEXACT,       /* 41 Exactly n matches */
+
+  OP_TYPESTAR,       /* 42 The maximizing and minimizing versions of */
+  OP_TYPEMINSTAR,    /* 43 all these opcodes must come in pairs, with */
+  OP_TYPEPLUS,       /* 44 the minimizing one second. These codes must */
+  OP_TYPEMINPLUS,    /* 45 be in exactly the same order as those above. */
+  OP_TYPEQUERY,      /* 46 This set applies to character types such as \d */
+  OP_TYPEMINQUERY,   /* 47 */
+  OP_TYPEUPTO,       /* 48 From 0 to n matches */
+  OP_TYPEMINUPTO,    /* 49 */
+  OP_TYPEEXACT,      /* 50 Exactly n matches */
+
+  OP_CRSTAR,         /* 51 The maximizing and minimizing versions of */
+  OP_CRMINSTAR,      /* 52 all these opcodes must come in pairs, with */
+  OP_CRPLUS,         /* 53 the minimizing one second. These codes must */
+  OP_CRMINPLUS,      /* 54 be in exactly the same order as those above. */
+  OP_CRQUERY,        /* 55 These are for character classes and back refs */
+  OP_CRMINQUERY,     /* 56 */
+  OP_CRRANGE,        /* 57 These are different to the three sets above. */
+  OP_CRMINRANGE,     /* 58 */
+
+  OP_CLASS,          /* 59 Match a character class, chars < 256 only */
+  OP_NCLASS,         /* 60 Same, but the bitmap was created from a negative
+                           class - the difference is relevant only when a UTF-8
+                           character > 255 is encountered. */
+
+  OP_XCLASS,         /* 61 Extended class for handling UTF-8 chars within the
+                           class. This does both positive and negative. */
+
+  OP_REF,            /* 62 Match a back reference */
+  OP_RECURSE,        /* 63 Match a numbered subpattern (possibly recursive) */
+  OP_CALLOUT,        /* 64 Call out to external function if provided */
+
+  OP_ALT,            /* 65 Start of alternation */
+  OP_KET,            /* 66 End of group that doesn't have an unbounded repeat */
+  OP_KETRMAX,        /* 67 These two must remain together and in this */
+  OP_KETRMIN,        /* 68 order. They are for groups the repeat for ever. */
+
+  /* The assertions must come before ONCE and COND */
+
+  OP_ASSERT,         /* 69 Positive lookahead */
+  OP_ASSERT_NOT,     /* 70 Negative lookahead */
+  OP_ASSERTBACK,     /* 71 Positive lookbehind */
+  OP_ASSERTBACK_NOT, /* 72 Negative lookbehind */
+  OP_REVERSE,        /* 73 Move pointer back - used in lookbehind assertions */
+
+  /* ONCE and COND must come after the assertions, with ONCE first, as there's
+  a test for >= ONCE for a subpattern that isn't an assertion. */
+
+  OP_ONCE,           /* 74 Once matched, don't back up into the subpattern */
+  OP_COND,           /* 75 Conditional group */
+  OP_CREF,           /* 76 Used to hold an extraction string number (cond ref) */
+
+  OP_BRAZERO,        /* 77 These two must remain together and in this */
+  OP_BRAMINZERO,     /* 78 order. */
+
+  OP_BRANUMBER,      /* 79 Used for extracting brackets whose number is greater
+                           than can fit into an opcode. */
+
+  OP_BRA             /* 80 This and greater values are used for brackets that
+                           extract substrings up to EXTRACT_BASIC_MAX. After
+                           that, use is made of OP_BRANUMBER. */
+};
+
+/* WARNING WARNING WARNING: There is an implicit assumption in pcre.c and
+study.c that all opcodes are less than 128 in value. This makes handling UTF-8
+character sequences easier. */
+
+/* The highest extraction number before we have to start using additional
+bytes. (Originally PCRE didn't have support for extraction counts highter than
+this number.) The value is limited by the number of opcodes left after OP_BRA,
+i.e. 255 - OP_BRA. We actually set it a bit lower to leave room for additional
+opcodes. */
+
+#define EXTRACT_BASIC_MAX  100
+
+
+/* This macro defines textual names for all the opcodes. There are used only
+for debugging, in pcre.c when DEBUG is defined, and also in pcretest.c. The
+macro is referenced only in printint.c. */
+
+#define OP_NAME_LIST \
+  "End", "\\A", "\\G", "\\B", "\\b", "\\D", "\\d",                \
+  "\\S", "\\s", "\\W", "\\w", "Any", "Anybyte",                   \
+  "notprop", "prop", "extuni",                                    \
+  "\\Z", "\\z",                                                   \
+  "Opt", "^", "$", "char", "charnc", "not",                       \
+  "*", "*?", "+", "+?", "?", "??", "{", "{", "{",                 \
+  "*", "*?", "+", "+?", "?", "??", "{", "{", "{",                 \
+  "*", "*?", "+", "+?", "?", "??", "{", "{", "{",                 \
+  "*", "*?", "+", "+?", "?", "??", "{", "{",                      \
+  "class", "nclass", "xclass", "Ref", "Recurse", "Callout",       \
+  "Alt", "Ket", "KetRmax", "KetRmin", "Assert", "Assert not",     \
+  "AssertB", "AssertB not", "Reverse", "Once", "Cond", "Cond ref",\
+  "Brazero", "Braminzero", "Branumber", "Bra"
+
+
+/* This macro defines the length of fixed length operations in the compiled
+regex. The lengths are used when searching for specific things, and also in the
+debugging printing of a compiled regex. We use a macro so that it can be
+incorporated both into pcre.c and pcretest.c without being publicly exposed.
+
+As things have been extended, some of these are no longer fixed lenths, but are
+minima instead. For example, the length of a single-character repeat may vary
+in UTF-8 mode. The code that uses this table must know about such things. */
+
+#define OP_LENGTHS \
+  1,                             /* End                                    */ \
+  1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* \A, \G, \B, \B, \D, \d, \S, \s, \W, \w */ \
+  1, 1,                          /* Any, Anybyte                           */ \
+  2, 2, 1,                       /* NOTPROP, PROP, EXTUNI                  */ \
+  1, 1, 2, 1, 1,                 /* \Z, \z, Opt, ^, $                      */ \
+  2,                             /* Char  - the minimum length             */ \
+  2,                             /* Charnc  - the minimum length           */ \
+  2,                             /* not                                    */ \
+  /* Positive single-char repeats                            ** These are  */ \
+  2, 2, 2, 2, 2, 2,              /* *, *?, +, +?, ?, ??      ** minima in  */ \
+  4, 4, 4,                       /* upto, minupto, exact     ** UTF-8 mode */ \
+  /* Negative single-char repeats - only for chars < 256                   */ \
+  2, 2, 2, 2, 2, 2,              /* NOT *, *?, +, +?, ?, ??                */ \
+  4, 4, 4,                       /* NOT upto, minupto, exact               */ \
+  /* Positive type repeats                                                 */ \
+  2, 2, 2, 2, 2, 2,              /* Type *, *?, +, +?, ?, ??               */ \
+  4, 4, 4,                       /* Type upto, minupto, exact              */ \
+  /* Character class & ref repeats                                         */ \
+  1, 1, 1, 1, 1, 1,              /* *, *?, +, +?, ?, ??                    */ \
+  5, 5,                          /* CRRANGE, CRMINRANGE                    */ \
+ 33,                             /* CLASS                                  */ \
+ 33,                             /* NCLASS                                 */ \
+  0,                             /* XCLASS - variable length               */ \
+  3,                             /* REF                                    */ \
+  1+LINK_SIZE,                   /* RECURSE                                */ \
+  2+2*LINK_SIZE,                 /* CALLOUT                                */ \
+  1+LINK_SIZE,                   /* Alt                                    */ \
+  1+LINK_SIZE,                   /* Ket                                    */ \
+  1+LINK_SIZE,                   /* KetRmax                                */ \
+  1+LINK_SIZE,                   /* KetRmin                                */ \
+  1+LINK_SIZE,                   /* Assert                                 */ \
+  1+LINK_SIZE,                   /* Assert not                             */ \
+  1+LINK_SIZE,                   /* Assert behind                          */ \
+  1+LINK_SIZE,                   /* Assert behind not                      */ \
+  1+LINK_SIZE,                   /* Reverse                                */ \
+  1+LINK_SIZE,                   /* Once                                   */ \
+  1+LINK_SIZE,                   /* COND                                   */ \
+  3,                             /* CREF                                   */ \
+  1, 1,                          /* BRAZERO, BRAMINZERO                    */ \
+  3,                             /* BRANUMBER                              */ \
+  1+LINK_SIZE                    /* BRA                                    */ \
+
+
+/* A magic value for OP_CREF to indicate the "in recursion" condition. */
+
+#define CREF_RECURSE  0xffff
+
+/* The texts of compile-time error messages are defined as macros here so that
+they can be accessed by the POSIX wrapper and converted into error codes.  Yes,
+I could have used error codes in the first place, but didn't feel like changing
+just to accommodate the POSIX wrapper. */
+
+#define ERR1  "\\ at end of pattern"
+#define ERR2  "\\c at end of pattern"
+#define ERR3  "unrecognized character follows \\"
+#define ERR4  "numbers out of order in {} quantifier"
+#define ERR5  "number too big in {} quantifier"
+#define ERR6  "missing terminating ] for character class"
+#define ERR7  "invalid escape sequence in character class"
+#define ERR8  "range out of order in character class"
+#define ERR9  "nothing to repeat"
+#define ERR10 "operand of unlimited repeat could match the empty string"
+#define ERR11 "internal error: unexpected repeat"
+#define ERR12 "unrecognized character after (?"
+#define ERR13 "POSIX named classes are supported only within a class"
+#define ERR14 "missing )"
+#define ERR15 "reference to non-existent subpattern"
+#define ERR16 "erroffset passed as NULL"
+#define ERR17 "unknown option bit(s) set"
+#define ERR18 "missing ) after comment"
+#define ERR19 "parentheses nested too deeply"
+#define ERR20 "regular expression too large"
+#define ERR21 "failed to get memory"
+#define ERR22 "unmatched parentheses"
+#define ERR23 "internal error: code overflow"
+#define ERR24 "unrecognized character after (?<"
+#define ERR25 "lookbehind assertion is not fixed length"
+#define ERR26 "malformed number after (?("
+#define ERR27 "conditional group contains more than two branches"
+#define ERR28 "assertion expected after (?("
+#define ERR29 "(?R or (?digits must be followed by )"
+#define ERR30 "unknown POSIX class name"
+#define ERR31 "POSIX collating elements are not supported"
+#define ERR32 "this version of PCRE is not compiled with PCRE_UTF8 support"
+#define ERR33 "spare error"
+#define ERR34 "character value in \\x{...} sequence is too large"
+#define ERR35 "invalid condition (?(0)"
+#define ERR36 "\\C not allowed in lookbehind assertion"
+#define ERR37 "PCRE does not support \\L, \\l, \\N, \\U, or \\u"
+#define ERR38 "number after (?C is > 255"
+#define ERR39 "closing ) for (?C expected"
+#define ERR40 "recursive call could loop indefinitely"
+#define ERR41 "unrecognized character after (?P"
+#define ERR42 "syntax error after (?P"
+#define ERR43 "two named groups have the same name"
+#define ERR44 "invalid UTF-8 string"
+#define ERR45 "support for \\P, \\p, and \\X has not been compiled"
+#define ERR46 "malformed \\P or \\p sequence"
+#define ERR47 "unknown property name after \\P or \\p"
+
+/* The real format of the start of the pcre block; the index of names and the
+code vector run on as long as necessary after the end. We store an explicit
+offset to the name table so that if a regex is compiled on one host, saved, and
+then run on another where the size of pointers is different, all might still
+be well. For the case of compiled-on-4 and run-on-8, we include an extra
+pointer that is always NULL. For future-proofing, we also include a few dummy
+fields - even though you can never get this planning right!
+
+NOTE NOTE NOTE:
+Because people can now save and re-use compiled patterns, any additions to this
+structure should be made at the end, and something earlier (e.g. a new
+flag in the options or one of the dummy fields) should indicate that the new
+fields are present. Currently PCRE always sets the dummy fields to zero.
+NOTE NOTE NOTE:
+*/
+
+typedef struct real_pcre {
+  pcre_uint32 magic_number;
+  pcre_uint32 size;               /* Total that was malloced */
+  pcre_uint32 options;
+  pcre_uint32 dummy1;             /* For future use, maybe */
+
+  pcre_uint16 top_bracket;
+  pcre_uint16 top_backref;
+  pcre_uint16 first_byte;
+  pcre_uint16 req_byte;
+  pcre_uint16 name_table_offset;  /* Offset to name table that follows */
+  pcre_uint16 name_entry_size;    /* Size of any name items */
+  pcre_uint16 name_count;         /* Number of name items */
+  pcre_uint16 dummy2;             /* For future use, maybe */
+
+  const unsigned char *tables;    /* Pointer to tables or NULL for std */
+  const unsigned char *nullpad;   /* NULL padding */
+} real_pcre;
+
+/* The format of the block used to store data from pcre_study(). The same
+remark (see NOTE above) about extending this structure applies. */
+
+typedef struct pcre_study_data {
+  pcre_uint32 size;               /* Total that was malloced */
+  pcre_uint32 options;
+  uschar start_bits[32];
+} pcre_study_data;
+
+/* Structure for passing "static" information around between the functions
+doing the compiling, so that they are thread-safe. */
+
+typedef struct compile_data {
+  const uschar *lcc;            /* Points to lower casing table */
+  const uschar *fcc;            /* Points to case-flipping table */
+  const uschar *cbits;          /* Points to character type table */
+  const uschar *ctypes;         /* Points to table of type maps */
+  const uschar *start_code;     /* The start of the compiled code */
+  const uschar *start_pattern;  /* The start of the pattern */
+  uschar *name_table;           /* The name/number table */
+  int  names_found;             /* Number of entries so far */
+  int  name_entry_size;         /* Size of each entry */
+  int  top_backref;             /* Maximum back reference */
+  unsigned int backref_map;     /* Bitmap of low back refs */
+  int  req_varyopt;             /* "After variable item" flag for reqbyte */
+  BOOL nopartial;               /* Set TRUE if partial won't work */
+} compile_data;
+
+/* Structure for maintaining a chain of pointers to the currently incomplete
+branches, for testing for left recursion. */
+
+typedef struct branch_chain {
+  struct branch_chain *outer;
+  uschar *current;
+} branch_chain;
+
+/* Structure for items in a linked list that represents an explicit recursive
+call within the pattern. */
+
+typedef struct recursion_info {
+  struct recursion_info *prevrec; /* Previous recursion record (or NULL) */
+  int group_num;                /* Number of group that was called */
+  const uschar *after_call;     /* "Return value": points after the call in the expr */
+  const uschar *save_start;     /* Old value of md->start_match */
+  int *offset_save;             /* Pointer to start of saved offsets */
+  int saved_max;                /* Number of saved offsets */
+} recursion_info;
+
+/* When compiling in a mode that doesn't use recursive calls to match(),
+a structure is used to remember local variables on the heap. It is defined in
+pcre.c, close to the match() function, so that it is easy to keep it in step
+with any changes of local variable. However, the pointer to the current frame
+must be saved in some "static" place over a longjmp(). We declare the
+structure here so that we can put a pointer in the match_data structure.
+NOTE: This isn't used for a "normal" compilation of pcre. */
+
+struct heapframe;
+
+/* Structure for passing "static" information around between the functions
+doing the matching, so that they are thread-safe. */
+
+typedef struct match_data {
+  unsigned long int match_call_count; /* As it says */
+  unsigned long int match_limit;/* As it says */
+  int   *offset_vector;         /* Offset vector */
+  int    offset_end;            /* One past the end */
+  int    offset_max;            /* The maximum usable for return data */
+  const uschar *lcc;            /* Points to lower casing table */
+  const uschar *ctypes;         /* Points to table of type maps */
+  BOOL   offset_overflow;       /* Set if too many extractions */
+  BOOL   notbol;                /* NOTBOL flag */
+  BOOL   noteol;                /* NOTEOL flag */
+  BOOL   utf8;                  /* UTF8 flag */
+  BOOL   endonly;               /* Dollar not before final \n */
+  BOOL   notempty;              /* Empty string match not wanted */
+  BOOL   partial;               /* PARTIAL flag */
+  BOOL   hitend;                /* Hit the end of the subject at some point */
+  const uschar *start_code;     /* For use when recursing */
+  const uschar *start_subject;  /* Start of the subject string */
+  const uschar *end_subject;    /* End of the subject string */
+  const uschar *start_match;    /* Start of this match attempt */
+  const uschar *end_match_ptr;  /* Subject position at end match */
+  int    end_offset_top;        /* Highwater mark at end of match */
+  int    capture_last;          /* Most recent capture number */
+  int    start_offset;          /* The start offset value */
+  recursion_info *recursive;    /* Linked list of recursion data */
+  void  *callout_data;          /* To pass back to callouts */
+  struct heapframe *thisframe;  /* Used only when compiling for no recursion */
+} match_data;
+
+/* Bit definitions for entries in the pcre_ctypes table. */
+
+#define ctype_space   0x01
+#define ctype_letter  0x02
+#define ctype_digit   0x04
+#define ctype_xdigit  0x08
+#define ctype_word    0x10   /* alphameric or '_' */
+#define ctype_meta    0x80   /* regexp meta char or zero (end pattern) */
+
+/* Offsets for the bitmap tables in pcre_cbits. Each table contains a set
+of bits for a class map. Some classes are built by combining these tables. */
+
+#define cbit_space     0      /* [:space:] or \s */
+#define cbit_xdigit   32      /* [:xdigit:] */
+#define cbit_digit    64      /* [:digit:] or \d */
+#define cbit_upper    96      /* [:upper:] */
+#define cbit_lower   128      /* [:lower:] */
+#define cbit_word    160      /* [:word:] or \w */
+#define cbit_graph   192      /* [:graph:] */
+#define cbit_print   224      /* [:print:] */
+#define cbit_punct   256      /* [:punct:] */
+#define cbit_cntrl   288      /* [:cntrl:] */
+#define cbit_length  320      /* Length of the cbits table */
+
+/* Offsets of the various tables from the base tables pointer, and
+total length. */
+
+#define lcc_offset      0
+#define fcc_offset    256
+#define cbits_offset  512
+#define ctypes_offset (cbits_offset + cbit_length)
+#define tables_length (ctypes_offset + 256)
+
+/* End of internal.h */
diff --git a/pcre.c b/pcre.c
new file mode 100644
index 0000000..f70386e
--- /dev/null
+++ b/pcre.c
@@ -0,0 +1,9195 @@
+/*************************************************
+*      Perl-Compatible Regular Expressions       *
+*************************************************/
+
+/*
+This is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language. See
+the file Tech.Notes for some information on the internals.
+
+Written by: Philip Hazel <ph10@cam.ac.uk>
+
+           Copyright (c) 1997-2004 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice,
+      this list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+    * Neither the name of the University of Cambridge nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+-----------------------------------------------------------------------------
+*/
+
+
+/* Define DEBUG to get debugging output on stdout. */
+/* #define DEBUG */
+
+/* Use a macro for debugging printing, 'cause that eliminates the use of #ifdef
+inline, and there are *still* stupid compilers about that don't like indented
+pre-processor statements. I suppose it's only been 10 years... */
+
+#ifdef DEBUG
+#define DPRINTF(p) printf p
+#else
+#define DPRINTF(p) /*nothing*/
+#endif
+
+/* Include the internals header, which itself includes "config.h", the Standard
+C headers, and the external pcre header. */
+
+#include "pcre-internal.h"
+
+/* If Unicode Property support is wanted, include a private copy of the
+function that does it, and the table that translates names to numbers. */
+
+#ifdef SUPPORT_UCP
+#include "ucp.c"
+#include "ucptypetable.c"
+#endif
+
+/* Maximum number of items on the nested bracket stacks at compile time. This
+applies to the nesting of all kinds of parentheses. It does not limit
+un-nested, non-capturing parentheses. This number can be made bigger if
+necessary - it is used to dimension one int and one unsigned char vector at
+compile time. */
+
+#define BRASTACK_SIZE 200
+
+
+/* Maximum number of ints of offset to save on the stack for recursive calls.
+If the offset vector is bigger, malloc is used. This should be a multiple of 3,
+because the offset vector is always a multiple of 3 long. */
+
+#define REC_STACK_SAVE_MAX 30
+
+
+/* The maximum remaining length of subject we are prepared to search for a
+req_byte match. */
+
+#define REQ_BYTE_MAX 1000
+
+
+/* Table of sizes for the fixed-length opcodes. It's defined in a macro so that
+the definition is next to the definition of the opcodes in internal.h. */
+
+static const uschar OP_lengths[] = { OP_LENGTHS };
+
+/* Min and max values for the common repeats; for the maxima, 0 => infinity */
+
+static const char rep_min[] = { 0, 0, 1, 1, 0, 0 };
+static const char rep_max[] = { 0, 0, 0, 0, 1, 1 };
+
+/* Table for handling escaped characters in the range '0'-'z'. Positive returns
+are simple data values; negative values are for special things like \d and so
+on. Zero means further processing is needed (for things like \x), or the escape
+is invalid. */
+
+#if !EBCDIC   /* This is the "normal" table for ASCII systems */
+static const short int escapes[] = {
+     0,      0,      0,      0,      0,      0,      0,      0,   /* 0 - 7 */
+     0,      0,    ':',    ';',    '<',    '=',    '>',    '?',   /* 8 - ? */
+   '@', -ESC_A, -ESC_B, -ESC_C, -ESC_D, -ESC_E,      0, -ESC_G,   /* @ - G */
+     0,      0,      0,      0,      0,      0,      0,      0,   /* H - O */
+-ESC_P, -ESC_Q,      0, -ESC_S,      0,      0,      0, -ESC_W,   /* P - W */
+-ESC_X,      0, -ESC_Z,    '[',   '\\',    ']',    '^',    '_',   /* X - _ */
+   '`',      7, -ESC_b,      0, -ESC_d,  ESC_e,  ESC_f,      0,   /* ` - g */
+     0,      0,      0,      0,      0,      0,  ESC_n,      0,   /* h - o */
+-ESC_p,      0,  ESC_r, -ESC_s,  ESC_tee,    0,      0, -ESC_w,   /* p - w */
+     0,      0, -ESC_z                                            /* x - z */
+};
+
+#else         /* This is the "abnormal" table for EBCDIC systems */
+static const short int escapes[] = {
+/*  48 */     0,     0,      0,     '.',    '<',   '(',    '+',    '|',
+/*  50 */   '&',     0,      0,       0,      0,     0,      0,      0,
+/*  58 */     0,     0,    '!',     '$',    '*',   ')',    ';',    '~',
+/*  60 */   '-',   '/',      0,       0,      0,     0,      0,      0,
+/*  68 */     0,     0,    '|',     ',',    '%',   '_',    '>',    '?',
+/*  70 */     0,     0,      0,       0,      0,     0,      0,      0,
+/*  78 */     0,   '`',    ':',     '#',    '@',  '\'',    '=',    '"',
+/*  80 */     0,     7, -ESC_b,       0, -ESC_d, ESC_e,  ESC_f,      0,
+/*  88 */     0,     0,      0,     '{',      0,     0,      0,      0,
+/*  90 */     0,     0,      0,     'l',      0, ESC_n,      0, -ESC_p,
+/*  98 */     0, ESC_r,      0,     '}',      0,     0,      0,      0,
+/*  A0 */     0,   '~', -ESC_s, ESC_tee,      0,     0, -ESC_w,      0,
+/*  A8 */     0,-ESC_z,      0,       0,      0,   '[',      0,      0,
+/*  B0 */     0,     0,      0,       0,      0,     0,      0,      0,
+/*  B8 */     0,     0,      0,       0,      0,   ']',    '=',    '-',
+/*  C0 */   '{',-ESC_A, -ESC_B,  -ESC_C, -ESC_D,-ESC_E,      0, -ESC_G,
+/*  C8 */     0,     0,      0,       0,      0,     0,      0,      0,
+/*  D0 */   '}',     0,      0,       0,      0,     0,      0, -ESC_P,
+/*  D8 */-ESC_Q,     0,      0,       0,      0,     0,      0,      0,
+/*  E0 */  '\\',     0, -ESC_S,       0,      0,     0, -ESC_W, -ESC_X,
+/*  E8 */     0,-ESC_Z,      0,       0,      0,     0,      0,      0,
+/*  F0 */     0,     0,      0,       0,      0,     0,      0,      0,
+/*  F8 */     0,     0,      0,       0,      0,     0,      0,      0
+};
+#endif
+
+
+/* Tables of names of POSIX character classes and their lengths. The list is
+terminated by a zero length entry. The first three must be alpha, upper, lower,
+as this is assumed for handling case independence. */
+
+static const char *const posix_names[] = {
+  "alpha", "lower", "upper",
+  "alnum", "ascii", "blank", "cntrl", "digit", "graph",
+  "print", "punct", "space", "word",  "xdigit" };
+
+static const uschar posix_name_lengths[] = {
+  5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 6, 0 };
+
+/* Table of class bit maps for each POSIX class; up to three may be combined
+to form the class. The table for [:blank:] is dynamically modified to remove
+the vertical space characters. */
+
+static const int posix_class_maps[] = {
+  cbit_lower, cbit_upper, -1,             /* alpha */
+  cbit_lower, -1,         -1,             /* lower */
+  cbit_upper, -1,         -1,             /* upper */
+  cbit_digit, cbit_lower, cbit_upper,     /* alnum */
+  cbit_print, cbit_cntrl, -1,             /* ascii */
+  cbit_space, -1,         -1,             /* blank - a GNU extension */
+  cbit_cntrl, -1,         -1,             /* cntrl */
+  cbit_digit, -1,         -1,             /* digit */
+  cbit_graph, -1,         -1,             /* graph */
+  cbit_print, -1,         -1,             /* print */
+  cbit_punct, -1,         -1,             /* punct */
+  cbit_space, -1,         -1,             /* space */
+  cbit_word,  -1,         -1,             /* word - a Perl extension */
+  cbit_xdigit,-1,         -1              /* xdigit */
+};
+
+/* Table to identify digits and hex digits. This is used when compiling
+patterns. Note that the tables in chartables are dependent on the locale, and
+may mark arbitrary characters as digits - but the PCRE compiling code expects
+to handle only 0-9, a-z, and A-Z as digits when compiling. That is why we have
+a private table here. It costs 256 bytes, but it is a lot faster than doing
+character value tests (at least in some simple cases I timed), and in some
+applications one wants PCRE to compile efficiently as well as match
+efficiently.
+
+For convenience, we use the same bit definitions as in chartables:
+
+  0x04   decimal digit
+  0x08   hexadecimal digit
+
+Then we can use ctype_digit and ctype_xdigit in the code. */
+
+#if !EBCDIC    /* This is the "normal" case, for ASCII systems */
+static const unsigned char digitab[] =
+  {
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*   0-  7 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*   8- 15 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  16- 23 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  24- 31 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*    - '  */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  ( - /  */
+  0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c, /*  0 - 7  */
+  0x0c,0x0c,0x00,0x00,0x00,0x00,0x00,0x00, /*  8 - ?  */
+  0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /*  @ - G  */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  H - O  */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  P - W  */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  X - _  */
+  0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /*  ` - g  */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  h - o  */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  p - w  */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  x -127 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */
+
+#else          /* This is the "abnormal" case, for EBCDIC systems */
+static const unsigned char digitab[] =
+  {
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*   0-  7  0 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*   8- 15    */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  16- 23 10 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  24- 31    */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  32- 39 20 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  40- 47    */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  48- 55 30 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  56- 63    */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*    - 71 40 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  72- |     */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  & - 87 50 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  88- ¬     */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  - -103 60 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 104- ?     */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 112-119 70 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 120- "     */
+  0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /* 128- g  80 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  h -143    */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144- p  90 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  q -159    */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160- x  A0 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  y -175    */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  ^ -183 B0 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191    */
+  0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /*  { - G  C0 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  H -207    */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  } - P  D0 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  Q -223    */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  \ - X  E0 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  Y -239    */
+  0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c, /*  0 - 7  F0 */
+  0x0c,0x0c,0x00,0x00,0x00,0x00,0x00,0x00};/*  8 -255    */
+
+static const unsigned char ebcdic_chartab[] = { /* chartable partial dup */
+  0x80,0x00,0x00,0x00,0x00,0x01,0x00,0x00, /*   0-  7 */
+  0x00,0x00,0x00,0x00,0x01,0x01,0x00,0x00, /*   8- 15 */
+  0x00,0x00,0x00,0x00,0x00,0x01,0x00,0x00, /*  16- 23 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  24- 31 */
+  0x00,0x00,0x00,0x00,0x00,0x01,0x00,0x00, /*  32- 39 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  40- 47 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  48- 55 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  56- 63 */
+  0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*    - 71 */
+  0x00,0x00,0x00,0x80,0x00,0x80,0x80,0x80, /*  72- |  */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  & - 87 */
+  0x00,0x00,0x00,0x80,0x80,0x80,0x00,0x00, /*  88- ¬  */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  - -103 */
+  0x00,0x00,0x00,0x00,0x00,0x10,0x00,0x80, /* 104- ?  */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 112-119 */
+  0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 120- "  */
+  0x00,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /* 128- g  */
+  0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /*  h -143 */
+  0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* 144- p  */
+  0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /*  q -159 */
+  0x00,0x00,0x12,0x12,0x12,0x12,0x12,0x12, /* 160- x  */
+  0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /*  y -175 */
+  0x80,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /*  ^ -183 */
+  0x00,0x00,0x80,0x00,0x00,0x00,0x00,0x00, /* 184-191 */
+  0x80,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /*  { - G  */
+  0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /*  H -207 */
+  0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /*  } - P  */
+  0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /*  Q -223 */
+  0x00,0x00,0x12,0x12,0x12,0x12,0x12,0x12, /*  \ - X  */
+  0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /*  Y -239 */
+  0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c, /*  0 - 7  */
+  0x1c,0x1c,0x00,0x00,0x00,0x00,0x00,0x00};/*  8 -255 */
+#endif
+
+
+/* Definition to allow mutual recursion */
+
+static BOOL
+  compile_regex(int, int, int *, uschar **, const uschar **, const char **,
+    BOOL, int, int *, int *, branch_chain *, compile_data *);
+
+/* Structure for building a chain of data that actually lives on the
+stack, for holding the values of the subject pointer at the start of each
+subpattern, so as to detect when an empty string has been matched by a
+subpattern - to break infinite loops. When NO_RECURSE is set, these blocks
+are on the heap, not on the stack. */
+
+typedef struct eptrblock {
+  struct eptrblock *epb_prev;
+  const uschar *epb_saved_eptr;
+} eptrblock;
+
+/* Flag bits for the match() function */
+
+#define match_condassert   0x01    /* Called to check a condition assertion */
+#define match_isgroup      0x02    /* Set if start of bracketed group */
+
+/* Non-error returns from the match() function. Error returns are externally
+defined PCRE_ERROR_xxx codes, which are all negative. */
+
+#define MATCH_MATCH        1
+#define MATCH_NOMATCH      0
+
+
+
+/*************************************************
+*               Global variables                 *
+*************************************************/
+
+/* PCRE is thread-clean and doesn't use any global variables in the normal
+sense. However, it calls memory allocation and free functions via the four
+indirections below, and it can optionally do callouts. These values can be
+changed by the caller, but are shared between all threads. However, when
+compiling for Virtual Pascal, things are done differently (see pcre.in). */
+
+#ifndef VPCOMPAT
+#ifdef __cplusplus
+extern "C" void *(*pcre_malloc)(size_t) = malloc;
+extern "C" void  (*pcre_free)(void *) = free;
+extern "C" void *(*pcre_stack_malloc)(size_t) = malloc;
+extern "C" void  (*pcre_stack_free)(void *) = free;
+extern "C" int   (*pcre_callout)(pcre_callout_block *) = NULL;
+#else
+void *(*pcre_malloc)(size_t) = malloc;
+void  (*pcre_free)(void *) = free;
+void *(*pcre_stack_malloc)(size_t) = malloc;
+void  (*pcre_stack_free)(void *) = free;
+int   (*pcre_callout)(pcre_callout_block *) = NULL;
+#endif
+#endif
+
+
+/*************************************************
+*    Macros and tables for character handling    *
+*************************************************/
+
+/* When UTF-8 encoding is being used, a character is no longer just a single
+byte. The macros for character handling generate simple sequences when used in
+byte-mode, and more complicated ones for UTF-8 characters. */
+
+#ifndef SUPPORT_UTF8
+#define GETCHAR(c, eptr) c = *eptr;
+#define GETCHARINC(c, eptr) c = *eptr++;
+#define GETCHARINCTEST(c, eptr) c = *eptr++;
+#define GETCHARLEN(c, eptr, len) c = *eptr;
+#define BACKCHAR(eptr)
+
+#else   /* SUPPORT_UTF8 */
+
+/* Get the next UTF-8 character, not advancing the pointer. This is called when
+we know we are in UTF-8 mode. */
+
+#define GETCHAR(c, eptr) \
+  c = *eptr; \
+  if ((c & 0xc0) == 0xc0) \
+    { \
+    int gcii; \
+    int gcaa = utf8_table4[c & 0x3f];  /* Number of additional bytes */ \
+    int gcss = 6*gcaa; \
+    c = (c & utf8_table3[gcaa]) << gcss; \
+    for (gcii = 1; gcii <= gcaa; gcii++) \
+      { \
+      gcss -= 6; \
+      c |= (eptr[gcii] & 0x3f) << gcss; \
+      } \
+    }
+
+/* Get the next UTF-8 character, advancing the pointer. This is called when we
+know we are in UTF-8 mode. */
+
+#define GETCHARINC(c, eptr) \
+  c = *eptr++; \
+  if ((c & 0xc0) == 0xc0) \
+    { \
+    int gcaa = utf8_table4[c & 0x3f];  /* Number of additional bytes */ \
+    int gcss = 6*gcaa; \
+    c = (c & utf8_table3[gcaa]) << gcss; \
+    while (gcaa-- > 0) \
+      { \
+      gcss -= 6; \
+      c |= (*eptr++ & 0x3f) << gcss; \
+      } \
+    }
+
+/* Get the next character, testing for UTF-8 mode, and advancing the pointer */
+
+#define GETCHARINCTEST(c, eptr) \
+  c = *eptr++; \
+  if (md->utf8 && (c & 0xc0) == 0xc0) \
+    { \
+    int gcaa = utf8_table4[c & 0x3f];  /* Number of additional bytes */ \
+    int gcss = 6*gcaa; \
+    c = (c & utf8_table3[gcaa]) << gcss; \
+    while (gcaa-- > 0) \
+      { \
+      gcss -= 6; \
+      c |= (*eptr++ & 0x3f) << gcss; \
+      } \
+    }
+
+/* Get the next UTF-8 character, not advancing the pointer, incrementing length
+if there are extra bytes. This is called when we know we are in UTF-8 mode. */
+
+#define GETCHARLEN(c, eptr, len) \
+  c = *eptr; \
+  if ((c & 0xc0) == 0xc0) \
+    { \
+    int gcii; \
+    int gcaa = utf8_table4[c & 0x3f];  /* Number of additional bytes */ \
+    int gcss = 6*gcaa; \
+    c = (c & utf8_table3[gcaa]) << gcss; \
+    for (gcii = 1; gcii <= gcaa; gcii++) \
+      { \
+      gcss -= 6; \
+      c |= (eptr[gcii] & 0x3f) << gcss; \
+      } \
+    len += gcaa; \
+    }
+
+/* If the pointer is not at the start of a character, move it back until
+it is. Called only in UTF-8 mode. */
+
+#define BACKCHAR(eptr) while((*eptr & 0xc0) == 0x80) eptr--;
+
+#endif
+
+
+
+/*************************************************
+*             Default character tables           *
+*************************************************/
+
+/* A default set of character tables is included in the PCRE binary. Its source
+is built by the maketables auxiliary program, which uses the default C ctypes
+functions, and put in the file chartables.c. These tables are used by PCRE
+whenever the caller of pcre_compile() does not provide an alternate set of
+tables. */
+
+#include "pcre-chartables.c"
+
+
+
+#ifdef SUPPORT_UTF8
+/*************************************************
+*           Tables for UTF-8 support             *
+*************************************************/
+
+/* These are the breakpoints for different numbers of bytes in a UTF-8
+character. */
+
+static const int utf8_table1[] =
+  { 0x7f, 0x7ff, 0xffff, 0x1fffff, 0x3ffffff, 0x7fffffff};
+
+/* These are the indicator bits and the mask for the data bits to set in the
+first byte of a character, indexed by the number of additional bytes. */
+
+static const int utf8_table2[] = { 0,    0xc0, 0xe0, 0xf0, 0xf8, 0xfc};
+static const int utf8_table3[] = { 0xff, 0x1f, 0x0f, 0x07, 0x03, 0x01};
+
+/* Table of the number of extra characters, indexed by the first character
+masked with 0x3f. The highest number for a valid UTF-8 character is in fact
+0x3d. */
+
+static const uschar utf8_table4[] = {
+  1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
+  1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
+  2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
+  3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5 };
+
+
+/*************************************************
+*       Convert character value to UTF-8         *
+*************************************************/
+
+/* This function takes an integer value in the range 0 - 0x7fffffff
+and encodes it as a UTF-8 character in 0 to 6 bytes.
+
+Arguments:
+  cvalue     the character value
+  buffer     pointer to buffer for result - at least 6 bytes long
+
+Returns:     number of characters placed in the buffer
+*/
+
+static int
+ord2utf8(int cvalue, uschar *buffer)
+{
+register int i, j;
+for (i = 0; i < sizeof(utf8_table1)/sizeof(int); i++)
+  if (cvalue <= utf8_table1[i]) break;
+buffer += i;
+for (j = i; j > 0; j--)
+ {
+ *buffer-- = 0x80 | (cvalue & 0x3f);
+ cvalue >>= 6;
+ }
+*buffer = utf8_table2[i] | cvalue;
+return i + 1;
+}
+#endif
+
+
+
+/*************************************************
+*         Print compiled regex                   *
+*************************************************/
+
+/* The code for doing this is held in a separate file that is also included in
+pcretest.c. It defines a function called print_internals(). */
+
+#ifdef DEBUG
+#include "printint.c"
+#endif
+
+
+
+/*************************************************
+*          Return version string                 *
+*************************************************/
+
+#define STRING(a)  # a
+#define XSTRING(s) STRING(s)
+
+EXPORT const char *
+pcre_version(void)
+{
+return XSTRING(PCRE_MAJOR) "." XSTRING(PCRE_MINOR) " " XSTRING(PCRE_DATE);
+}
+
+
+
+
+/*************************************************
+*         Flip bytes in an integer               *
+*************************************************/
+
+/* This function is called when the magic number in a regex doesn't match in
+order to flip its bytes to see if we are dealing with a pattern that was
+compiled on a host of different endianness. If so, this function is used to
+flip other byte values.
+
+Arguments:
+  value        the number to flip
+  n            the number of bytes to flip (assumed to be 2 or 4)
+
+Returns:       the flipped value
+*/
+
+static long int
+byteflip(long int value, int n)
+{
+if (n == 2) return ((value & 0x00ff) << 8) | ((value & 0xff00) >> 8);
+return ((value & 0x000000ff) << 24) |
+       ((value & 0x0000ff00) <<  8) |
+       ((value & 0x00ff0000) >>  8) |
+       ((value & 0xff000000) >> 24);
+}
+
+
+
+/*************************************************
+*       Test for a byte-flipped compiled regex   *
+*************************************************/
+
+/* This function is called from pce_exec() and also from pcre_fullinfo(). Its
+job is to test whether the regex is byte-flipped - that is, it was compiled on
+a system of opposite endianness. The function is called only when the native
+MAGIC_NUMBER test fails. If the regex is indeed flipped, we flip all the
+relevant values into a different data block, and return it.
+
+Arguments:
+  re               points to the regex
+  study            points to study data, or NULL
+  internal_re      points to a new regex block
+  internal_study   points to a new study block
+
+Returns:           the new block if is is indeed a byte-flipped regex
+                   NULL if it is not
+*/
+
+static real_pcre *
+try_flipped(const real_pcre *re, real_pcre *internal_re,
+  const pcre_study_data *study, pcre_study_data *internal_study)
+{
+if (byteflip(re->magic_number, sizeof(re->magic_number)) != MAGIC_NUMBER)
+  return NULL;
+
+*internal_re = *re;           /* To copy other fields */
+internal_re->size = byteflip(re->size, sizeof(re->size));
+internal_re->options = byteflip(re->options, sizeof(re->options));
+internal_re->top_bracket = byteflip(re->top_bracket, sizeof(re->top_bracket));
+internal_re->top_backref = byteflip(re->top_backref, sizeof(re->top_backref));
+internal_re->first_byte = byteflip(re->first_byte, sizeof(re->first_byte));
+internal_re->req_byte = byteflip(re->req_byte, sizeof(re->req_byte));
+internal_re->name_table_offset = byteflip(re->name_table_offset,
+  sizeof(re->name_table_offset));
+internal_re->name_entry_size = byteflip(re->name_entry_size,
+  sizeof(re->name_entry_size));
+internal_re->name_count = byteflip(re->name_count, sizeof(re->name_count));
+
+if (study != NULL)
+  {
+  *internal_study = *study;   /* To copy other fields */
+  internal_study->size = byteflip(study->size, sizeof(study->size));
+  internal_study->options = byteflip(study->options, sizeof(study->options));
+  }
+
+return internal_re;
+}
+
+
+
+/*************************************************
+* (Obsolete) Return info about compiled pattern  *
+*************************************************/
+
+/* This is the original "info" function. It picks potentially useful data out
+of the private structure, but its interface was too rigid. It remains for
+backwards compatibility. The public options are passed back in an int - though
+the re->options field has been expanded to a long int, all the public options
+at the low end of it, and so even on 16-bit systems this will still be OK.
+Therefore, I haven't changed the API for pcre_info().
+
+Arguments:
+  argument_re   points to compiled code
+  optptr        where to pass back the options
+  first_byte    where to pass back the first character,
+                or -1 if multiline and all branches start ^,
+                or -2 otherwise
+
+Returns:        number of capturing subpatterns
+                or negative values on error
+*/
+
+EXPORT int
+pcre_info(const pcre *argument_re, int *optptr, int *first_byte)
+{
+real_pcre internal_re;
+const real_pcre *re = (const real_pcre *)argument_re;
+if (re == NULL) return PCRE_ERROR_NULL;
+if (re->magic_number != MAGIC_NUMBER)
+  {
+  re = try_flipped(re, &internal_re, NULL, NULL);
+  if (re == NULL) return PCRE_ERROR_BADMAGIC;
+  }
+if (optptr != NULL) *optptr = (int)(re->options & PUBLIC_OPTIONS);
+if (first_byte != NULL)
+  *first_byte = ((re->options & PCRE_FIRSTSET) != 0)? re->first_byte :
+     ((re->options & PCRE_STARTLINE) != 0)? -1 : -2;
+return re->top_bracket;
+}
+
+
+
+/*************************************************
+*        Return info about compiled pattern      *
+*************************************************/
+
+/* This is a newer "info" function which has an extensible interface so
+that additional items can be added compatibly.
+
+Arguments:
+  argument_re      points to compiled code
+  extra_data       points extra data, or NULL
+  what             what information is required
+  where            where to put the information
+
+Returns:           0 if data returned, negative on error
+*/
+
+EXPORT int
+pcre_fullinfo(const pcre *argument_re, const pcre_extra *extra_data, int what,
+  void *where)
+{
+real_pcre internal_re;
+pcre_study_data internal_study;
+const real_pcre *re = (const real_pcre *)argument_re;
+const pcre_study_data *study = NULL;
+
+if (re == NULL || where == NULL) return PCRE_ERROR_NULL;
+
+if (extra_data != NULL && (extra_data->flags & PCRE_EXTRA_STUDY_DATA) != 0)
+  study = (const pcre_study_data *)extra_data->study_data;
+
+if (re->magic_number != MAGIC_NUMBER)
+  {
+  re = try_flipped(re, &internal_re, study, &internal_study);
+  if (re == NULL) return PCRE_ERROR_BADMAGIC;
+  if (study != NULL) study = &internal_study;
+  }
+
+switch (what)
+  {
+  case PCRE_INFO_OPTIONS:
+  *((unsigned long int *)where) = re->options & PUBLIC_OPTIONS;
+  break;
+
+  case PCRE_INFO_SIZE:
+  *((size_t *)where) = re->size;
+  break;
+
+  case PCRE_INFO_STUDYSIZE:
+  *((size_t *)where) = (study == NULL)? 0 : study->size;
+  break;
+
+  case PCRE_INFO_CAPTURECOUNT:
+  *((int *)where) = re->top_bracket;
+  break;
+
+  case PCRE_INFO_BACKREFMAX:
+  *((int *)where) = re->top_backref;
+  break;
+
+  case PCRE_INFO_FIRSTBYTE:
+  *((int *)where) =
+    ((re->options & PCRE_FIRSTSET) != 0)? re->first_byte :
+    ((re->options & PCRE_STARTLINE) != 0)? -1 : -2;
+  break;
+
+  /* Make sure we pass back the pointer to the bit vector in the external
+  block, not the internal copy (with flipped integer fields). */
+
+  case PCRE_INFO_FIRSTTABLE:
+  *((const uschar **)where) =
+    (study != NULL && (study->options & PCRE_STUDY_MAPPED) != 0)?
+      ((const pcre_study_data *)extra_data->study_data)->start_bits : NULL;
+  break;
+
+  case PCRE_INFO_LASTLITERAL:
+  *((int *)where) =
+    ((re->options & PCRE_REQCHSET) != 0)? re->req_byte : -1;
+  break;
+
+  case PCRE_INFO_NAMEENTRYSIZE:
+  *((int *)where) = re->name_entry_size;
+  break;
+
+  case PCRE_INFO_NAMECOUNT:
+  *((int *)where) = re->name_count;
+  break;
+
+  case PCRE_INFO_NAMETABLE:
+  *((const uschar **)where) = (const uschar *)re + re->name_table_offset;
+  break;
+
+  case PCRE_INFO_DEFAULT_TABLES:
+  *((const uschar **)where) = (const uschar *)pcre_default_tables;
+  break;
+
+  default: return PCRE_ERROR_BADOPTION;
+  }
+
+return 0;
+}
+
+
+
+/*************************************************
+* Return info about what features are configured *
+*************************************************/
+
+/* This is function which has an extensible interface so that additional items
+can be added compatibly.
+
+Arguments:
+  what             what information is required
+  where            where to put the information
+
+Returns:           0 if data returned, negative on error
+*/
+
+EXPORT int
+pcre_config(int what, void *where)
+{
+switch (what)
+  {
+  case PCRE_CONFIG_UTF8:
+#ifdef SUPPORT_UTF8
+  *((int *)where) = 1;
+#else
+  *((int *)where) = 0;
+#endif
+  break;
+
+  case PCRE_CONFIG_UNICODE_PROPERTIES:
+#ifdef SUPPORT_UCP
+  *((int *)where) = 1;
+#else
+  *((int *)where) = 0;
+#endif
+  break;
+
+  case PCRE_CONFIG_NEWLINE:
+  *((int *)where) = NEWLINE;
+  break;
+
+  case PCRE_CONFIG_LINK_SIZE:
+  *((int *)where) = LINK_SIZE;
+  break;
+
+  case PCRE_CONFIG_POSIX_MALLOC_THRESHOLD:
+  *((int *)where) = POSIX_MALLOC_THRESHOLD;
+  break;
+
+  case PCRE_CONFIG_MATCH_LIMIT:
+  *((unsigned int *)where) = MATCH_LIMIT;
+  break;
+
+  case PCRE_CONFIG_STACKRECURSE:
+#ifdef NO_RECURSE
+  *((int *)where) = 0;
+#else
+  *((int *)where) = 1;
+#endif
+  break;
+
+  default: return PCRE_ERROR_BADOPTION;
+  }
+
+return 0;
+}
+
+
+
+#ifdef DEBUG
+/*************************************************
+*        Debugging function to print chars       *
+*************************************************/
+
+/* Print a sequence of chars in printable format, stopping at the end of the
+subject if the requested.
+
+Arguments:
+  p           points to characters
+  length      number to print
+  is_subject  TRUE if printing from within md->start_subject
+  md          pointer to matching data block, if is_subject is TRUE
+
+Returns:     nothing
+*/
+
+static void
+pchars(const uschar *p, int length, BOOL is_subject, match_data *md)
+{
+int c;
+if (is_subject && length > md->end_subject - p) length = md->end_subject - p;
+while (length-- > 0)
+  if (isprint(c = *(p++))) printf("%c", c); else printf("\\x%02x", c);
+}
+#endif
+
+
+
+
+/*************************************************
+*            Handle escapes                      *
+*************************************************/
+
+/* This function is called when a \ has been encountered. It either returns a
+positive value for a simple escape such as \n, or a negative value which
+encodes one of the more complicated things such as \d. When UTF-8 is enabled,
+a positive value greater than 255 may be returned. On entry, ptr is pointing at
+the \. On exit, it is on the final character of the escape sequence.
+
+Arguments:
+  ptrptr     points to the pattern position pointer
+  errorptr   points to the pointer to the error message
+  bracount   number of previous extracting brackets
+  options    the options bits
+  isclass    TRUE if inside a character class
+
+Returns:     zero or positive => a data character
+             negative => a special escape sequence
+             on error, errorptr is set
+*/
+
+static int
+check_escape(const uschar **ptrptr, const char **errorptr, int bracount,
+  int options, BOOL isclass)
+{
+const uschar *ptr = *ptrptr;
+int c, i;
+
+/* If backslash is at the end of the pattern, it's an error. */
+
+c = *(++ptr);
+if (c == 0) *errorptr = ERR1;
+
+/* Non-alphamerics are literals. For digits or letters, do an initial lookup in
+a table. A non-zero result is something that can be returned immediately.
+Otherwise further processing may be required. */
+
+#if !EBCDIC    /* ASCII coding */
+else if (c < '0' || c > 'z') {}                           /* Not alphameric */
+else if ((i = escapes[c - '0']) != 0) c = i;
+
+#else          /* EBCDIC coding */
+else if (c < 'a' || (ebcdic_chartab[c] & 0x0E) == 0) {}   /* Not alphameric */
+else if ((i = escapes[c - 0x48]) != 0)  c = i;
+#endif
+
+/* Escapes that need further processing, or are illegal. */
+
+else
+  {
+  const uschar *oldptr;
+  switch (c)
+    {
+    /* A number of Perl escapes are not handled by PCRE. We give an explicit
+    error. */
+
+    case 'l':
+    case 'L':
+    case 'N':
+    case 'u':
+    case 'U':
+    *errorptr = ERR37;
+    break;
+
+    /* The handling of escape sequences consisting of a string of digits
+    starting with one that is not zero is not straightforward. By experiment,
+    the way Perl works seems to be as follows:
+
+    Outside a character class, the digits are read as a decimal number. If the
+    number is less than 10, or if there are that many previous extracting
+    left brackets, then it is a back reference. Otherwise, up to three octal
+    digits are read to form an escaped byte. Thus \123 is likely to be octal
+    123 (cf \0123, which is octal 012 followed by the literal 3). If the octal
+    value is greater than 377, the least significant 8 bits are taken. Inside a
+    character class, \ followed by a digit is always an octal number. */
+
+    case '1': case '2': case '3': case '4': case '5':
+    case '6': case '7': case '8': case '9':
+
+    if (!isclass)
+      {
+      oldptr = ptr;
+      c -= '0';
+      while ((digitab[ptr[1]] & ctype_digit) != 0)
+        c = c * 10 + *(++ptr) - '0';
+      if (c < 10 || c <= bracount)
+        {
+        c = -(ESC_REF + c);
+        break;
+        }
+      ptr = oldptr;      /* Put the pointer back and fall through */
+      }
+
+    /* Handle an octal number following \. If the first digit is 8 or 9, Perl
+    generates a binary zero byte and treats the digit as a following literal.
+    Thus we have to pull back the pointer by one. */
+
+    if ((c = *ptr) >= '8')
+      {
+      ptr--;
+      c = 0;
+      break;
+      }
+
+    /* \0 always starts an octal number, but we may drop through to here with a
+    larger first octal digit. */
+
+    case '0':
+    c -= '0';
+    while(i++ < 2 && ptr[1] >= '0' && ptr[1] <= '7')
+        c = c * 8 + *(++ptr) - '0';
+    c &= 255;     /* Take least significant 8 bits */
+    break;
+
+    /* \x is complicated when UTF-8 is enabled. \x{ddd} is a character number
+    which can be greater than 0xff, but only if the ddd are hex digits. */
+
+    case 'x':
+#ifdef SUPPORT_UTF8
+    if (ptr[1] == '{' && (options & PCRE_UTF8) != 0)
+      {
+      const uschar *pt = ptr + 2;
+      register int count = 0;
+      c = 0;
+      while ((digitab[*pt] & ctype_xdigit) != 0)
+        {
+        int cc = *pt++;
+        count++;
+#if !EBCDIC    /* ASCII coding */
+        if (cc >= 'a') cc -= 32;               /* Convert to upper case */
+        c = c * 16 + cc - ((cc < 'A')? '0' : ('A' - 10));
+#else          /* EBCDIC coding */
+        if (cc >= 'a' && cc <= 'z') cc += 64;  /* Convert to upper case */
+        c = c * 16 + cc - ((cc >= '0')? '0' : ('A' - 10));
+#endif
+        }
+      if (*pt == '}')
+        {
+        if (c < 0 || count > 8) *errorptr = ERR34;
+        ptr = pt;
+        break;
+        }
+      /* If the sequence of hex digits does not end with '}', then we don't
+      recognize this construct; fall through to the normal \x handling. */
+      }
+#endif
+
+    /* Read just a single hex char */
+
+    c = 0;
+    while (i++ < 2 && (digitab[ptr[1]] & ctype_xdigit) != 0)
+      {
+      int cc;                               /* Some compilers don't like ++ */
+      cc = *(++ptr);                        /* in initializers */
+#if !EBCDIC    /* ASCII coding */
+      if (cc >= 'a') cc -= 32;              /* Convert to upper case */
+      c = c * 16 + cc - ((cc < 'A')? '0' : ('A' - 10));
+#else          /* EBCDIC coding */
+      if (cc <= 'z') cc += 64;              /* Convert to upper case */
+      c = c * 16 + cc - ((cc >= '0')? '0' : ('A' - 10));
+#endif
+      }
+    break;
+
+    /* Other special escapes not starting with a digit are straightforward */
+
+    case 'c':
+    c = *(++ptr);
+    if (c == 0)
+      {
+      *errorptr = ERR2;
+      return 0;
+      }
+
+    /* A letter is upper-cased; then the 0x40 bit is flipped. This coding
+    is ASCII-specific, but then the whole concept of \cx is ASCII-specific.
+    (However, an EBCDIC equivalent has now been added.) */
+
+#if !EBCDIC    /* ASCII coding */
+    if (c >= 'a' && c <= 'z') c -= 32;
+    c ^= 0x40;
+#else          /* EBCDIC coding */
+    if (c >= 'a' && c <= 'z') c += 64;
+    c ^= 0xC0;
+#endif
+    break;
+
+    /* PCRE_EXTRA enables extensions to Perl in the matter of escapes. Any
+    other alphameric following \ is an error if PCRE_EXTRA was set; otherwise,
+    for Perl compatibility, it is a literal. This code looks a bit odd, but
+    there used to be some cases other than the default, and there may be again
+    in future, so I haven't "optimized" it. */
+
+    default:
+    if ((options & PCRE_EXTRA) != 0) switch(c)
+      {
+      default:
+      *errorptr = ERR3;
+      break;
+      }
+    break;
+    }
+  }
+
+*ptrptr = ptr;
+return c;
+}
+
+
+
+#ifdef SUPPORT_UCP
+/*************************************************
+*               Handle \P and \p                 *
+*************************************************/
+
+/* This function is called after \P or \p has been encountered, provided that
+PCRE is compiled with support for Unicode properties. On entry, ptrptr is
+pointing at the P or p. On exit, it is pointing at the final character of the
+escape sequence.
+
+Argument:
+  ptrptr     points to the pattern position pointer
+  negptr     points to a boolean that is set TRUE for negation else FALSE
+  errorptr   points to the pointer to the error message
+
+Returns:     value from ucp_type_table, or -1 for an invalid type
+*/
+
+static int
+get_ucp(const uschar **ptrptr, BOOL *negptr, const char **errorptr)
+{
+int c, i, bot, top;
+const uschar *ptr = *ptrptr;
+char name[4];
+
+c = *(++ptr);
+if (c == 0) goto ERROR_RETURN;
+
+*negptr = FALSE;
+
+/* \P or \p can be followed by a one- or two-character name in {}, optionally
+preceded by ^ for negation. */
+
+if (c == '{')
+  {
+  if (ptr[1] == '^')
+    {
+    *negptr = TRUE;
+    ptr++;
+    }
+  for (i = 0; i <= 2; i++)
+    {
+    c = *(++ptr);
+    if (c == 0) goto ERROR_RETURN;
+    if (c == '}') break;
+    name[i] = c;
+    }
+  if (c !='}')   /* Try to distinguish error cases */
+    {
+    while (*(++ptr) != 0 && *ptr != '}');
+    if (*ptr == '}') goto UNKNOWN_RETURN; else goto ERROR_RETURN;
+    }
+  name[i] = 0;
+  }
+
+/* Otherwise there is just one following character */
+
+else
+  {
+  name[0] = c;
+  name[1] = 0;
+  }
+
+*ptrptr = ptr;
+
+/* Search for a recognized property name using binary chop */
+
+bot = 0;
+top = sizeof(utt)/sizeof(ucp_type_table);
+
+while (bot < top)
+  {
+  i = (bot + top)/2;
+  c = strcmp(name, utt[i].name);
+  if (c == 0) return utt[i].value;
+  if (c > 0) bot = i + 1; else top = i;
+  }
+
+UNKNOWN_RETURN:
+*errorptr = ERR47;
+*ptrptr = ptr;
+return -1;
+
+ERROR_RETURN:
+*errorptr = ERR46;
+*ptrptr = ptr;
+return -1;
+}
+#endif
+
+
+
+
+/*************************************************
+*            Check for counted repeat            *
+*************************************************/
+
+/* This function is called when a '{' is encountered in a place where it might
+start a quantifier. It looks ahead to see if it really is a quantifier or not.
+It is only a quantifier if it is one of the forms {ddd} {ddd,} or {ddd,ddd}
+where the ddds are digits.
+
+Arguments:
+  p         pointer to the first char after '{'
+
+Returns:    TRUE or FALSE
+*/
+
+static BOOL
+is_counted_repeat(const uschar *p)
+{
+if ((digitab[*p++] & ctype_digit) == 0) return FALSE;
+while ((digitab[*p] & ctype_digit) != 0) p++;
+if (*p == '}') return TRUE;
+
+if (*p++ != ',') return FALSE;
+if (*p == '}') return TRUE;
+
+if ((digitab[*p++] & ctype_digit) == 0) return FALSE;
+while ((digitab[*p] & ctype_digit) != 0) p++;
+
+return (*p == '}');
+}
+
+
+
+/*************************************************
+*         Read repeat counts                     *
+*************************************************/
+
+/* Read an item of the form {n,m} and return the values. This is called only
+after is_counted_repeat() has confirmed that a repeat-count quantifier exists,
+so the syntax is guaranteed to be correct, but we need to check the values.
+
+Arguments:
+  p          pointer to first char after '{'
+  minp       pointer to int for min
+  maxp       pointer to int for max
+             returned as -1 if no max
+  errorptr   points to pointer to error message
+
+Returns:     pointer to '}' on success;
+             current ptr on error, with errorptr set
+*/
+
+static const uschar *
+read_repeat_counts(const uschar *p, int *minp, int *maxp, const char **errorptr)
+{
+int min = 0;
+int max = -1;
+
+while ((digitab[*p] & ctype_digit) != 0) min = min * 10 + *p++ - '0';
+
+if (*p == '}') max = min; else
+  {
+  if (*(++p) != '}')
+    {
+    max = 0;
+    while((digitab[*p] & ctype_digit) != 0) max = max * 10 + *p++ - '0';
+    if (max < min)
+      {
+      *errorptr = ERR4;
+      return p;
+      }
+    }
+  }
+
+/* Do paranoid checks, then fill in the required variables, and pass back the
+pointer to the terminating '}'. */
+
+if (min > 65535 || max > 65535)
+  *errorptr = ERR5;
+else
+  {
+  *minp = min;
+  *maxp = max;
+  }
+return p;
+}
+
+
+
+/*************************************************
+*      Find first significant op code            *
+*************************************************/
+
+/* This is called by several functions that scan a compiled expression looking
+for a fixed first character, or an anchoring op code etc. It skips over things
+that do not influence this. For some calls, a change of option is important.
+For some calls, it makes sense to skip negative forward and all backward
+assertions, and also the \b assertion; for others it does not.
+
+Arguments:
+  code         pointer to the start of the group
+  options      pointer to external options
+  optbit       the option bit whose changing is significant, or
+                 zero if none are
+  skipassert   TRUE if certain assertions are to be skipped
+
+Returns:       pointer to the first significant opcode
+*/
+
+static const uschar*
+first_significant_code(const uschar *code, int *options, int optbit,
+  BOOL skipassert)
+{
+for (;;)
+  {
+  switch ((int)*code)
+    {
+    case OP_OPT:
+    if (optbit > 0 && ((int)code[1] & optbit) != (*options & optbit))
+      *options = (int)code[1];
+    code += 2;
+    break;
+
+    case OP_ASSERT_NOT:
+    case OP_ASSERTBACK:
+    case OP_ASSERTBACK_NOT:
+    if (!skipassert) return code;
+    do code += GET(code, 1); while (*code == OP_ALT);
+    code += OP_lengths[*code];
+    break;
+
+    case OP_WORD_BOUNDARY:
+    case OP_NOT_WORD_BOUNDARY:
+    if (!skipassert) return code;
+    /* Fall through */
+
+    case OP_CALLOUT:
+    case OP_CREF:
+    case OP_BRANUMBER:
+    code += OP_lengths[*code];
+    break;
+
+    default:
+    return code;
+    }
+  }
+/* Control never reaches here */
+}
+
+
+
+
+/*************************************************
+*        Find the fixed length of a pattern      *
+*************************************************/
+
+/* Scan a pattern and compute the fixed length of subject that will match it,
+if the length is fixed. This is needed for dealing with backward assertions.
+In UTF8 mode, the result is in characters rather than bytes.
+
+Arguments:
+  code     points to the start of the pattern (the bracket)
+  options  the compiling options
+
+Returns:   the fixed length, or -1 if there is no fixed length,
+             or -2 if \C was encountered
+*/
+
+static int
+find_fixedlength(uschar *code, int options)
+{
+int length = -1;
+
+register int branchlength = 0;
+register uschar *cc = code + 1 + LINK_SIZE;
+
+/* Scan along the opcodes for this branch. If we get to the end of the
+branch, check the length against that of the other branches. */
+
+for (;;)
+  {
+  int d;
+  register int op = *cc;
+  if (op >= OP_BRA) op = OP_BRA;
+
+  switch (op)
+    {
+    case OP_BRA:
+    case OP_ONCE:
+    case OP_COND:
+    d = find_fixedlength(cc, options);
+    if (d < 0) return d;
+    branchlength += d;
+    do cc += GET(cc, 1); while (*cc == OP_ALT);
+    cc += 1 + LINK_SIZE;
+    break;
+
+    /* Reached end of a branch; if it's a ket it is the end of a nested
+    call. If it's ALT it is an alternation in a nested call. If it is
+    END it's the end of the outer call. All can be handled by the same code. */
+
+    case OP_ALT:
+    case OP_KET:
+    case OP_KETRMAX:
+    case OP_KETRMIN:
+    case OP_END:
+    if (length < 0) length = branchlength;
+      else if (length != branchlength) return -1;
+    if (*cc != OP_ALT) return length;
+    cc += 1 + LINK_SIZE;
+    branchlength = 0;
+    break;
+
+    /* Skip over assertive subpatterns */
+
+    case OP_ASSERT:
+    case OP_ASSERT_NOT:
+    case OP_ASSERTBACK:
+    case OP_ASSERTBACK_NOT:
+    do cc += GET(cc, 1); while (*cc == OP_ALT);
+    /* Fall through */
+
+    /* Skip over things that don't match chars */
+
+    case OP_REVERSE:
+    case OP_BRANUMBER:
+    case OP_CREF:
+    case OP_OPT:
+    case OP_CALLOUT:
+    case OP_SOD:
+    case OP_SOM:
+    case OP_EOD:
+    case OP_EODN:
+    case OP_CIRC:
+    case OP_DOLL:
+    case OP_NOT_WORD_BOUNDARY:
+    case OP_WORD_BOUNDARY:
+    cc += OP_lengths[*cc];
+    break;
+
+    /* Handle literal characters */
+
+    case OP_CHAR:
+    case OP_CHARNC:
+    branchlength++;
+    cc += 2;
+#ifdef SUPPORT_UTF8
+    if ((options & PCRE_UTF8) != 0)
+      {
+      while ((*cc & 0xc0) == 0x80) cc++;
+      }
+#endif
+    break;
+
+    /* Handle exact repetitions. The count is already in characters, but we
+    need to skip over a multibyte character in UTF8 mode.  */
+
+    case OP_EXACT:
+    branchlength += GET2(cc,1);
+    cc += 4;
+#ifdef SUPPORT_UTF8
+    if ((options & PCRE_UTF8) != 0)
+      {
+      while((*cc & 0x80) == 0x80) cc++;
+      }
+#endif
+    break;
+
+    case OP_TYPEEXACT:
+    branchlength += GET2(cc,1);
+    cc += 4;
+    break;
+
+    /* Handle single-char matchers */
+
+    case OP_PROP:
+    case OP_NOTPROP:
+    cc++;
+    /* Fall through */
+
+    case OP_NOT_DIGIT:
+    case OP_DIGIT:
+    case OP_NOT_WHITESPACE:
+    case OP_WHITESPACE:
+    case OP_NOT_WORDCHAR:
+    case OP_WORDCHAR:
+    case OP_ANY:
+    branchlength++;
+    cc++;
+    break;
+
+    /* The single-byte matcher isn't allowed */
+
+    case OP_ANYBYTE:
+    return -2;
+
+    /* Check a class for variable quantification */
+
+#ifdef SUPPORT_UTF8
+    case OP_XCLASS:
+    cc += GET(cc, 1) - 33;
+    /* Fall through */
+#endif
+
+    case OP_CLASS:
+    case OP_NCLASS:
+    cc += 33;
+
+    switch (*cc)
+      {
+      case OP_CRSTAR:
+      case OP_CRMINSTAR:
+      case OP_CRQUERY:
+      case OP_CRMINQUERY:
+      return -1;
+
+      case OP_CRRANGE:
+      case OP_CRMINRANGE:
+      if (GET2(cc,1) != GET2(cc,3)) return -1;
+      branchlength += GET2(cc,1);
+      cc += 5;
+      break;
+
+      default:
+      branchlength++;
+      }
+    break;
+
+    /* Anything else is variable length */
+
+    default:
+    return -1;
+    }
+  }
+/* Control never gets here */
+}
+
+
+
+
+/*************************************************
+*    Scan compiled regex for numbered bracket    *
+*************************************************/
+
+/* This little function scans through a compiled pattern until it finds a
+capturing bracket with the given number.
+
+Arguments:
+  code        points to start of expression
+  utf8        TRUE in UTF-8 mode
+  number      the required bracket number
+
+Returns:      pointer to the opcode for the bracket, or NULL if not found
+*/
+
+static const uschar *
+find_bracket(const uschar *code, BOOL utf8, int number)
+{
+#ifndef SUPPORT_UTF8
+utf8 = utf8;               /* Stop pedantic compilers complaining */
+#endif
+
+for (;;)
+  {
+  register int c = *code;
+  if (c == OP_END) return NULL;
+  else if (c > OP_BRA)
+    {
+    int n = c - OP_BRA;
+    if (n > EXTRACT_BASIC_MAX) n = GET2(code, 2+LINK_SIZE);
+    if (n == number) return (uschar *)code;
+    code += OP_lengths[OP_BRA];
+    }
+  else
+    {
+    code += OP_lengths[c];
+
+#ifdef SUPPORT_UTF8
+
+    /* In UTF-8 mode, opcodes that are followed by a character may be followed
+    by a multi-byte character. The length in the table is a minimum, so we have
+    to scan along to skip the extra bytes. All opcodes are less than 128, so we
+    can use relatively efficient code. */
+
+    if (utf8) switch(c)
+      {
+      case OP_CHAR:
+      case OP_CHARNC:
+      case OP_EXACT:
+      case OP_UPTO:
+      case OP_MINUPTO:
+      case OP_STAR:
+      case OP_MINSTAR:
+      case OP_PLUS:
+      case OP_MINPLUS:
+      case OP_QUERY:
+      case OP_MINQUERY:
+      while ((*code & 0xc0) == 0x80) code++;
+      break;
+
+      /* XCLASS is used for classes that cannot be represented just by a bit
+      map. This includes negated single high-valued characters. The length in
+      the table is zero; the actual length is stored in the compiled code. */
+
+      case OP_XCLASS:
+      code += GET(code, 1) + 1;
+      break;
+      }
+#endif
+    }
+  }
+}
+
+
+
+/*************************************************
+*   Scan compiled regex for recursion reference  *
+*************************************************/
+
+/* This little function scans through a compiled pattern until it finds an
+instance of OP_RECURSE.
+
+Arguments:
+  code        points to start of expression
+  utf8        TRUE in UTF-8 mode
+
+Returns:      pointer to the opcode for OP_RECURSE, or NULL if not found
+*/
+
+static const uschar *
+find_recurse(const uschar *code, BOOL utf8)
+{
+#ifndef SUPPORT_UTF8
+utf8 = utf8;               /* Stop pedantic compilers complaining */
+#endif
+
+for (;;)
+  {
+  register int c = *code;
+  if (c == OP_END) return NULL;
+  else if (c == OP_RECURSE) return code;
+  else if (c > OP_BRA)
+    {
+    code += OP_lengths[OP_BRA];
+    }
+  else
+    {
+    code += OP_lengths[c];
+
+#ifdef SUPPORT_UTF8
+
+    /* In UTF-8 mode, opcodes that are followed by a character may be followed
+    by a multi-byte character. The length in the table is a minimum, so we have
+    to scan along to skip the extra bytes. All opcodes are less than 128, so we
+    can use relatively efficient code. */
+
+    if (utf8) switch(c)
+      {
+      case OP_CHAR:
+      case OP_CHARNC:
+      case OP_EXACT:
+      case OP_UPTO:
+      case OP_MINUPTO:
+      case OP_STAR:
+      case OP_MINSTAR:
+      case OP_PLUS:
+      case OP_MINPLUS:
+      case OP_QUERY:
+      case OP_MINQUERY:
+      while ((*code & 0xc0) == 0x80) code++;
+      break;
+
+      /* XCLASS is used for classes that cannot be represented just by a bit
+      map. This includes negated single high-valued characters. The length in
+      the table is zero; the actual length is stored in the compiled code. */
+
+      case OP_XCLASS:
+      code += GET(code, 1) + 1;
+      break;
+      }
+#endif
+    }
+  }
+}
+
+
+
+/*************************************************
+*    Scan compiled branch for non-emptiness      *
+*************************************************/
+
+/* This function scans through a branch of a compiled pattern to see whether it
+can match the empty string or not. It is called only from could_be_empty()
+below. Note that first_significant_code() skips over assertions. If we hit an
+unclosed bracket, we return "empty" - this means we've struck an inner bracket
+whose current branch will already have been scanned.
+
+Arguments:
+  code        points to start of search
+  endcode     points to where to stop
+  utf8        TRUE if in UTF8 mode
+
+Returns:      TRUE if what is matched could be empty
+*/
+
+static BOOL
+could_be_empty_branch(const uschar *code, const uschar *endcode, BOOL utf8)
+{
+register int c;
+for (code = first_significant_code(code + 1 + LINK_SIZE, NULL, 0, TRUE);
+     code < endcode;
+     code = first_significant_code(code + OP_lengths[c], NULL, 0, TRUE))
+  {
+  const uschar *ccode;
+
+  c = *code;
+
+  if (c >= OP_BRA)
+    {
+    BOOL empty_branch;
+    if (GET(code, 1) == 0) return TRUE;    /* Hit unclosed bracket */
+
+    /* Scan a closed bracket */
+
+    empty_branch = FALSE;
+    do
+      {
+      if (!empty_branch && could_be_empty_branch(code, endcode, utf8))
+        empty_branch = TRUE;
+      code += GET(code, 1);
+      }
+    while (*code == OP_ALT);
+    if (!empty_branch) return FALSE;   /* All branches are non-empty */
+    code += 1 + LINK_SIZE;
+    c = *code;
+    }
+
+  else switch (c)
+    {
+    /* Check for quantifiers after a class */
+
+#ifdef SUPPORT_UTF8
+    case OP_XCLASS:
+    ccode = code + GET(code, 1);
+    goto CHECK_CLASS_REPEAT;
+#endif
+
+    case OP_CLASS:
+    case OP_NCLASS:
+    ccode = code + 33;
+
+#ifdef SUPPORT_UTF8
+    CHECK_CLASS_REPEAT:
+#endif
+
+    switch (*ccode)
+      {
+      case OP_CRSTAR:            /* These could be empty; continue */
+      case OP_CRMINSTAR:
+      case OP_CRQUERY:
+      case OP_CRMINQUERY:
+      break;
+
+      default:                   /* Non-repeat => class must match */
+      case OP_CRPLUS:            /* These repeats aren't empty */
+      case OP_CRMINPLUS:
+      return FALSE;
+
+      case OP_CRRANGE:
+      case OP_CRMINRANGE:
+      if (GET2(ccode, 1) > 0) return FALSE;  /* Minimum > 0 */
+      break;
+      }
+    break;
+
+    /* Opcodes that must match a character */
+
+    case OP_PROP:
+    case OP_NOTPROP:
+    case OP_EXTUNI:
+    case OP_NOT_DIGIT:
+    case OP_DIGIT:
+    case OP_NOT_WHITESPACE:
+    case OP_WHITESPACE:
+    case OP_NOT_WORDCHAR:
+    case OP_WORDCHAR:
+    case OP_ANY:
+    case OP_ANYBYTE:
+    case OP_CHAR:
+    case OP_CHARNC:
+    case OP_NOT:
+    case OP_PLUS:
+    case OP_MINPLUS:
+    case OP_EXACT:
+    case OP_NOTPLUS:
+    case OP_NOTMINPLUS:
+    case OP_NOTEXACT:
+    case OP_TYPEPLUS:
+    case OP_TYPEMINPLUS:
+    case OP_TYPEEXACT:
+    return FALSE;
+
+    /* End of branch */
+
+    case OP_KET:
+    case OP_KETRMAX:
+    case OP_KETRMIN:
+    case OP_ALT:
+    return TRUE;
+
+    /* In UTF-8 mode, STAR, MINSTAR, QUERY, MINQUERY, UPTO, and MINUPTO  may be
+    followed by a multibyte character */
+
+#ifdef SUPPORT_UTF8
+    case OP_STAR:
+    case OP_MINSTAR:
+    case OP_QUERY:
+    case OP_MINQUERY:
+    case OP_UPTO:
+    case OP_MINUPTO:
+    if (utf8) while ((code[2] & 0xc0) == 0x80) code++;
+    break;
+#endif
+    }
+  }
+
+return TRUE;
+}
+
+
+
+/*************************************************
+*    Scan compiled regex for non-emptiness       *
+*************************************************/
+
+/* This function is called to check for left recursive calls. We want to check
+the current branch of the current pattern to see if it could match the empty
+string. If it could, we must look outwards for branches at other levels,
+stopping when we pass beyond the bracket which is the subject of the recursion.
+
+Arguments:
+  code        points to start of the recursion
+  endcode     points to where to stop (current RECURSE item)
+  bcptr       points to the chain of current (unclosed) branch starts
+  utf8        TRUE if in UTF-8 mode
+
+Returns:      TRUE if what is matched could be empty
+*/
+
+static BOOL
+could_be_empty(const uschar *code, const uschar *endcode, branch_chain *bcptr,
+  BOOL utf8)
+{
+while (bcptr != NULL && bcptr->current >= code)
+  {
+  if (!could_be_empty_branch(bcptr->current, endcode, utf8)) return FALSE;
+  bcptr = bcptr->outer;
+  }
+return TRUE;
+}
+
+
+
+/*************************************************
+*           Check for POSIX class syntax         *
+*************************************************/
+
+/* This function is called when the sequence "[:" or "[." or "[=" is
+encountered in a character class. It checks whether this is followed by an
+optional ^ and then a sequence of letters, terminated by a matching ":]" or
+".]" or "=]".
+
+Argument:
+  ptr      pointer to the initial [
+  endptr   where to return the end pointer
+  cd       pointer to compile data
+
+Returns:   TRUE or FALSE
+*/
+
+static BOOL
+check_posix_syntax(const uschar *ptr, const uschar **endptr, compile_data *cd)
+{
+int terminator;          /* Don't combine these lines; the Solaris cc */
+terminator = *(++ptr);   /* compiler warns about "non-constant" initializer. */
+if (*(++ptr) == '^') ptr++;
+while ((cd->ctypes[*ptr] & ctype_letter) != 0) ptr++;
+if (*ptr == terminator && ptr[1] == ']')
+  {
+  *endptr = ptr;
+  return TRUE;
+  }
+return FALSE;
+}
+
+
+
+
+/*************************************************
+*          Check POSIX class name                *
+*************************************************/
+
+/* This function is called to check the name given in a POSIX-style class entry
+such as [:alnum:].
+
+Arguments:
+  ptr        points to the first letter
+  len        the length of the name
+
+Returns:     a value representing the name, or -1 if unknown
+*/
+
+static int
+check_posix_name(const uschar *ptr, int len)
+{
+register int yield = 0;
+while (posix_name_lengths[yield] != 0)
+  {
+  if (len == posix_name_lengths[yield] &&
+    strncmp((const char *)ptr, posix_names[yield], len) == 0) return yield;
+  yield++;
+  }
+return -1;
+}
+
+
+/*************************************************
+*    Adjust OP_RECURSE items in repeated group   *
+*************************************************/
+
+/* OP_RECURSE items contain an offset from the start of the regex to the group
+that is referenced. This means that groups can be replicated for fixed
+repetition simply by copying (because the recursion is allowed to refer to
+earlier groups that are outside the current group). However, when a group is
+optional (i.e. the minimum quantifier is zero), OP_BRAZERO is inserted before
+it, after it has been compiled. This means that any OP_RECURSE items within it
+that refer to the group itself or any contained groups have to have their
+offsets adjusted. That is the job of this function. Before it is called, the
+partially compiled regex must be temporarily terminated with OP_END.
+
+Arguments:
+  group      points to the start of the group
+  adjust     the amount by which the group is to be moved
+  utf8       TRUE in UTF-8 mode
+  cd         contains pointers to tables etc.
+
+Returns:     nothing
+*/
+
+static void
+adjust_recurse(uschar *group, int adjust, BOOL utf8, compile_data *cd)
+{
+uschar *ptr = group;
+while ((ptr = (uschar *)find_recurse(ptr, utf8)) != NULL)
+  {
+  int offset = GET(ptr, 1);
+  if (cd->start_code + offset >= group) PUT(ptr, 1, offset + adjust);
+  ptr += 1 + LINK_SIZE;
+  }
+}
+
+
+
+/*************************************************
+*        Insert an automatic callout point       *
+*************************************************/
+
+/* This function is called when the PCRE_AUTO_CALLOUT option is set, to insert
+callout points before each pattern item.
+
+Arguments:
+  code           current code pointer
+  ptr            current pattern pointer
+  cd             pointers to tables etc
+
+Returns:         new code pointer
+*/
+
+static uschar *
+auto_callout(uschar *code, const uschar *ptr, compile_data *cd)
+{
+*code++ = OP_CALLOUT;
+*code++ = 255;
+PUT(code, 0, ptr - cd->start_pattern);  /* Pattern offset */
+PUT(code, LINK_SIZE, 0);                /* Default length */
+return code + 2*LINK_SIZE;
+}
+
+
+
+/*************************************************
+*         Complete a callout item                *
+*************************************************/
+
+/* A callout item contains the length of the next item in the pattern, which
+we can't fill in till after we have reached the relevant point. This is used
+for both automatic and manual callouts.
+
+Arguments:
+  previous_callout   points to previous callout item
+  ptr                current pattern pointer
+  cd                 pointers to tables etc
+
+Returns:             nothing
+*/
+
+static void
+complete_callout(uschar *previous_callout, const uschar *ptr, compile_data *cd)
+{
+int length = ptr - cd->start_pattern - GET(previous_callout, 2);
+PUT(previous_callout, 2 + LINK_SIZE, length);
+}
+
+
+
+#ifdef SUPPORT_UCP
+/*************************************************
+*           Get othercase range                  *
+*************************************************/
+
+/* This function is passed the start and end of a class range, in UTF-8 mode
+with UCP support. It searches up the characters, looking for internal ranges of
+characters in the "other" case. Each call returns the next one, updating the
+start address.
+
+Arguments:
+  cptr        points to starting character value; updated
+  d           end value
+  ocptr       where to put start of othercase range
+  odptr       where to put end of othercase range
+
+Yield:        TRUE when range returned; FALSE when no more
+*/
+
+static BOOL
+get_othercase_range(int *cptr, int d, int *ocptr, int *odptr)
+{
+int c, chartype, othercase, next;
+
+for (c = *cptr; c <= d; c++)
+  {
+  if (ucp_findchar(c, &chartype, &othercase) == ucp_L && othercase != 0) break;
+  }
+
+if (c > d) return FALSE;
+
+*ocptr = othercase;
+next = othercase + 1;
+
+for (++c; c <= d; c++)
+  {
+  if (ucp_findchar(c, &chartype, &othercase) != ucp_L || othercase != next)
+    break;
+  next++;
+  }
+
+*odptr = next - 1;
+*cptr = c;
+
+return TRUE;
+}
+#endif  /* SUPPORT_UCP */
+
+
+/*************************************************
+*           Compile one branch                   *
+*************************************************/
+
+/* Scan the pattern, compiling it into the code vector. If the options are
+changed during the branch, the pointer is used to change the external options
+bits.
+
+Arguments:
+  optionsptr     pointer to the option bits
+  brackets       points to number of extracting brackets used
+  codeptr        points to the pointer to the current code point
+  ptrptr         points to the current pattern pointer
+  errorptr       points to pointer to error message
+  firstbyteptr   set to initial literal character, or < 0 (REQ_UNSET, REQ_NONE)
+  reqbyteptr     set to the last literal character required, else < 0
+  bcptr          points to current branch chain
+  cd             contains pointers to tables etc.
+
+Returns:         TRUE on success
+                 FALSE, with *errorptr set on error
+*/
+
+static BOOL
+compile_branch(int *optionsptr, int *brackets, uschar **codeptr,
+  const uschar **ptrptr, const char **errorptr, int *firstbyteptr,
+  int *reqbyteptr, branch_chain *bcptr, compile_data *cd)
+{
+int repeat_type, op_type;
+int repeat_min = 0, repeat_max = 0;      /* To please picky compilers */
+int bravalue = 0;
+int greedy_default, greedy_non_default;
+int firstbyte, reqbyte;
+int zeroreqbyte, zerofirstbyte;
+int req_caseopt, reqvary, tempreqvary;
+int condcount = 0;
+int options = *optionsptr;
+int after_manual_callout = 0;
+register int c;
+register uschar *code = *codeptr;
+uschar *tempcode;
+BOOL inescq = FALSE;
+BOOL groupsetfirstbyte = FALSE;
+const uschar *ptr = *ptrptr;
+const uschar *tempptr;
+uschar *previous = NULL;
+uschar *previous_callout = NULL;
+uschar classbits[32];
+
+#ifdef SUPPORT_UTF8
+BOOL class_utf8;
+BOOL utf8 = (options & PCRE_UTF8) != 0;
+uschar *class_utf8data;
+uschar utf8_char[6];
+#else
+BOOL utf8 = FALSE;
+#endif
+
+/* Set up the default and non-default settings for greediness */
+
+greedy_default = ((options & PCRE_UNGREEDY) != 0);
+greedy_non_default = greedy_default ^ 1;
+
+/* Initialize no first byte, no required byte. REQ_UNSET means "no char
+matching encountered yet". It gets changed to REQ_NONE if we hit something that
+matches a non-fixed char first char; reqbyte just remains unset if we never
+find one.
+
+When we hit a repeat whose minimum is zero, we may have to adjust these values
+to take the zero repeat into account. This is implemented by setting them to
+zerofirstbyte and zeroreqbyte when such a repeat is encountered. The individual
+item types that can be repeated set these backoff variables appropriately. */
+
+firstbyte = reqbyte = zerofirstbyte = zeroreqbyte = REQ_UNSET;
+
+/* The variable req_caseopt contains either the REQ_CASELESS value or zero,
+according to the current setting of the caseless flag. REQ_CASELESS is a bit
+value > 255. It is added into the firstbyte or reqbyte variables to record the
+case status of the value. This is used only for ASCII characters. */
+
+req_caseopt = ((options & PCRE_CASELESS) != 0)? REQ_CASELESS : 0;
+
+/* Switch on next character until the end of the branch */
+
+for (;; ptr++)
+  {
+  BOOL negate_class;
+  BOOL possessive_quantifier;
+  BOOL is_quantifier;
+  int class_charcount;
+  int class_lastchar;
+  int newoptions;
+  int recno;
+  int skipbytes;
+  int subreqbyte;
+  int subfirstbyte;
+  int mclength;
+  uschar mcbuffer[8];
+
+  /* Next byte in the pattern */
+
+  c = *ptr;
+
+  /* If in \Q...\E, check for the end; if not, we have a literal */
+
+  if (inescq && c != 0)
+    {
+    if (c == '\\' && ptr[1] == 'E')
+      {
+      inescq = FALSE;
+      ptr++;
+      continue;
+      }
+    else
+      {
+      if (previous_callout != NULL)
+        {
+        complete_callout(previous_callout, ptr, cd);
+        previous_callout = NULL;
+        }
+      if ((options & PCRE_AUTO_CALLOUT) != 0)
+        {
+        previous_callout = code;
+        code = auto_callout(code, ptr, cd);
+        }
+      goto NORMAL_CHAR;
+      }
+    }
+
+  /* Fill in length of a previous callout, except when the next thing is
+  a quantifier. */
+
+  is_quantifier = c == '*' || c == '+' || c == '?' ||
+    (c == '{' && is_counted_repeat(ptr+1));
+
+  if (!is_quantifier && previous_callout != NULL &&
+       after_manual_callout-- <= 0)
+    {
+    complete_callout(previous_callout, ptr, cd);
+    previous_callout = NULL;
+    }
+
+  /* In extended mode, skip white space and comments */
+
+  if ((options & PCRE_EXTENDED) != 0)
+    {
+    if ((cd->ctypes[c] & ctype_space) != 0) continue;
+    if (c == '#')
+      {
+      /* The space before the ; is to avoid a warning on a silly compiler
+      on the Macintosh. */
+      while ((c = *(++ptr)) != 0 && c != NEWLINE) ;
+      if (c != 0) continue;   /* Else fall through to handle end of string */
+      }
+    }
+
+  /* No auto callout for quantifiers. */
+
+  if ((options & PCRE_AUTO_CALLOUT) != 0 && !is_quantifier)
+    {
+    previous_callout = code;
+    code = auto_callout(code, ptr, cd);
+    }
+
+  switch(c)
+    {
+    /* The branch terminates at end of string, |, or ). */
+
+    case 0:
+    case '|':
+    case ')':
+    *firstbyteptr = firstbyte;
+    *reqbyteptr = reqbyte;
+    *codeptr = code;
+    *ptrptr = ptr;
+    return TRUE;
+
+    /* Handle single-character metacharacters. In multiline mode, ^ disables
+    the setting of any following char as a first character. */
+
+    case '^':
+    if ((options & PCRE_MULTILINE) != 0)
+      {
+      if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
+      }
+    previous = NULL;
+    *code++ = OP_CIRC;
+    break;
+
+    case '$':
+    previous = NULL;
+    *code++ = OP_DOLL;
+    break;
+
+    /* There can never be a first char if '.' is first, whatever happens about
+    repeats. The value of reqbyte doesn't change either. */
+
+    case '.':
+    if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
+    zerofirstbyte = firstbyte;
+    zeroreqbyte = reqbyte;
+    previous = code;
+    *code++ = OP_ANY;
+    break;
+
+    /* Character classes. If the included characters are all < 255 in value, we
+    build a 32-byte bitmap of the permitted characters, except in the special
+    case where there is only one such character. For negated classes, we build
+    the map as usual, then invert it at the end. However, we use a different
+    opcode so that data characters > 255 can be handled correctly.
+
+    If the class contains characters outside the 0-255 range, a different
+    opcode is compiled. It may optionally have a bit map for characters < 256,
+    but those above are are explicitly listed afterwards. A flag byte tells
+    whether the bitmap is present, and whether this is a negated class or not.
+    */
+
+    case '[':
+    previous = code;
+
+    /* PCRE supports POSIX class stuff inside a class. Perl gives an error if
+    they are encountered at the top level, so we'll do that too. */
+
+    if ((ptr[1] == ':' || ptr[1] == '.' || ptr[1] == '=') &&
+        check_posix_syntax(ptr, &tempptr, cd))
+      {
+      *errorptr = (ptr[1] == ':')? ERR13 : ERR31;
+      goto FAILED;
+      }
+
+    /* If the first character is '^', set the negation flag and skip it. */
+
+    if ((c = *(++ptr)) == '^')
+      {
+      negate_class = TRUE;
+      c = *(++ptr);
+      }
+    else
+      {
+      negate_class = FALSE;
+      }
+
+    /* Keep a count of chars with values < 256 so that we can optimize the case
+    of just a single character (as long as it's < 256). For higher valued UTF-8
+    characters, we don't yet do any optimization. */
+
+    class_charcount = 0;
+    class_lastchar = -1;
+
+#ifdef SUPPORT_UTF8
+    class_utf8 = FALSE;                       /* No chars >= 256 */
+    class_utf8data = code + LINK_SIZE + 34;   /* For UTF-8 items */
+#endif
+
+    /* Initialize the 32-char bit map to all zeros. We have to build the
+    map in a temporary bit of store, in case the class contains only 1
+    character (< 256), because in that case the compiled code doesn't use the
+    bit map. */
+
+    memset(classbits, 0, 32 * sizeof(uschar));
+
+    /* Process characters until ] is reached. By writing this as a "do" it
+    means that an initial ] is taken as a data character. The first pass
+    through the regex checked the overall syntax, so we don't need to be very
+    strict here. At the start of the loop, c contains the first byte of the
+    character. */
+
+    do
+      {
+#ifdef SUPPORT_UTF8
+      if (utf8 && c > 127)
+        {                           /* Braces are required because the */
+        GETCHARLEN(c, ptr, ptr);    /* macro generates multiple statements */
+        }
+#endif
+
+      /* Inside \Q...\E everything is literal except \E */
+
+      if (inescq)
+        {
+        if (c == '\\' && ptr[1] == 'E')
+          {
+          inescq = FALSE;
+          ptr++;
+          continue;
+          }
+        else goto LONE_SINGLE_CHARACTER;
+        }
+
+      /* Handle POSIX class names. Perl allows a negation extension of the
+      form [:^name:]. A square bracket that doesn't match the syntax is
+      treated as a literal. We also recognize the POSIX constructions
+      [.ch.] and [=ch=] ("collating elements") and fault them, as Perl
+      5.6 and 5.8 do. */
+
+      if (c == '[' &&
+          (ptr[1] == ':' || ptr[1] == '.' || ptr[1] == '=') &&
+          check_posix_syntax(ptr, &tempptr, cd))
+        {
+        BOOL local_negate = FALSE;
+        int posix_class, i;
+        register const uschar *cbits = cd->cbits;
+
+        if (ptr[1] != ':')
+          {
+          *errorptr = ERR31;
+          goto FAILED;
+          }
+
+        ptr += 2;
+        if (*ptr == '^')
+          {
+          local_negate = TRUE;
+          ptr++;
+          }
+
+        posix_class = check_posix_name(ptr, tempptr - ptr);
+        if (posix_class < 0)
+          {
+          *errorptr = ERR30;
+          goto FAILED;
+          }
+
+        /* If matching is caseless, upper and lower are converted to
+        alpha. This relies on the fact that the class table starts with
+        alpha, lower, upper as the first 3 entries. */
+
+        if ((options & PCRE_CASELESS) != 0 && posix_class <= 2)
+          posix_class = 0;
+
+        /* Or into the map we are building up to 3 of the static class
+        tables, or their negations. The [:blank:] class sets up the same
+        chars as the [:space:] class (all white space). We remove the vertical
+        white space chars afterwards. */
+
+        posix_class *= 3;
+        for (i = 0; i < 3; i++)
+          {
+          BOOL blankclass = strncmp((char *)ptr, "blank", 5) == 0;
+          int taboffset = posix_class_maps[posix_class + i];
+          if (taboffset < 0) break;
+          if (local_negate)
+            {
+            if (i == 0)
+              for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+taboffset];
+            else
+              for (c = 0; c < 32; c++) classbits[c] &= ~cbits[c+taboffset];
+            if (blankclass) classbits[1] |= 0x3c;
+            }
+          else
+            {
+            for (c = 0; c < 32; c++) classbits[c] |= cbits[c+taboffset];
+            if (blankclass) classbits[1] &= ~0x3c;
+            }
+          }
+
+        ptr = tempptr + 1;
+        class_charcount = 10;  /* Set > 1; assumes more than 1 per class */
+        continue;    /* End of POSIX syntax handling */
+        }
+
+      /* Backslash may introduce a single character, or it may introduce one
+      of the specials, which just set a flag. Escaped items are checked for
+      validity in the pre-compiling pass. The sequence \b is a special case.
+      Inside a class (and only there) it is treated as backspace. Elsewhere
+      it marks a word boundary. Other escapes have preset maps ready to
+      or into the one we are building. We assume they have more than one
+      character in them, so set class_charcount bigger than one. */
+
+      if (c == '\\')
+        {
+        c = check_escape(&ptr, errorptr, *brackets, options, TRUE);
+
+        if (-c == ESC_b) c = '\b';       /* \b is backslash in a class */
+        else if (-c == ESC_X) c = 'X';   /* \X is literal X in a class */
+        else if (-c == ESC_Q)            /* Handle start of quoted string */
+          {
+          if (ptr[1] == '\\' && ptr[2] == 'E')
+            {
+            ptr += 2; /* avoid empty string */
+            }
+          else inescq = TRUE;
+          continue;
+          }
+
+        if (c < 0)
+          {
+          register const uschar *cbits = cd->cbits;
+          class_charcount += 2;     /* Greater than 1 is what matters */
+          switch (-c)
+            {
+            case ESC_d:
+            for (c = 0; c < 32; c++) classbits[c] |= cbits[c+cbit_digit];
+            continue;
+
+            case ESC_D:
+            for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_digit];
+            continue;
+
+            case ESC_w:
+            for (c = 0; c < 32; c++) classbits[c] |= cbits[c+cbit_word];
+            continue;
+
+            case ESC_W:
+            for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_word];
+            continue;
+
+            case ESC_s:
+            for (c = 0; c < 32; c++) classbits[c] |= cbits[c+cbit_space];
+            classbits[1] &= ~0x08;   /* Perl 5.004 onwards omits VT from \s */
+            continue;
+
+            case ESC_S:
+            for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_space];
+            classbits[1] |= 0x08;    /* Perl 5.004 onwards omits VT from \s */
+            continue;
+
+#ifdef SUPPORT_UCP
+            case ESC_p:
+            case ESC_P:
+              {
+              BOOL negated;
+              int property = get_ucp(&ptr, &negated, errorptr);
+              if (property < 0) goto FAILED;
+              class_utf8 = TRUE;
+              *class_utf8data++ = ((-c == ESC_p) != negated)?
+                XCL_PROP : XCL_NOTPROP;
+              *class_utf8data++ = property;
+              class_charcount -= 2;   /* Not a < 256 character */
+              }
+            continue;
+#endif
+
+            /* Unrecognized escapes are faulted if PCRE is running in its
+            strict mode. By default, for compatibility with Perl, they are
+            treated as literals. */
+
+            default:
+            if ((options & PCRE_EXTRA) != 0)
+              {
+              *errorptr = ERR7;
+              goto FAILED;
+              }
+            c = *ptr;              /* The final character */
+            class_charcount -= 2;  /* Undo the default count from above */
+            }
+          }
+
+        /* Fall through if we have a single character (c >= 0). This may be
+        > 256 in UTF-8 mode. */
+
+        }   /* End of backslash handling */
+
+      /* A single character may be followed by '-' to form a range. However,
+      Perl does not permit ']' to be the end of the range. A '-' character
+      here is treated as a literal. */
+
+      if (ptr[1] == '-' && ptr[2] != ']')
+        {
+        int d;
+        ptr += 2;
+
+#ifdef SUPPORT_UTF8
+        if (utf8)
+          {                           /* Braces are required because the */
+          GETCHARLEN(d, ptr, ptr);    /* macro generates multiple statements */
+          }
+        else
+#endif
+        d = *ptr;  /* Not UTF-8 mode */
+
+        /* The second part of a range can be a single-character escape, but
+        not any of the other escapes. Perl 5.6 treats a hyphen as a literal
+        in such circumstances. */
+
+        if (d == '\\')
+          {
+          const uschar *oldptr = ptr;
+          d = check_escape(&ptr, errorptr, *brackets, options, TRUE);
+
+          /* \b is backslash; \X is literal X; any other special means the '-'
+          was literal */
+
+          if (d < 0)
+            {
+            if (d == -ESC_b) d = '\b';
+            else if (d == -ESC_X) d = 'X'; else
+              {
+              ptr = oldptr - 2;
+              goto LONE_SINGLE_CHARACTER;  /* A few lines below */
+              }
+            }
+          }
+
+        /* The check that the two values are in the correct order happens in
+        the pre-pass. Optimize one-character ranges */
+
+        if (d == c) goto LONE_SINGLE_CHARACTER;  /* A few lines below */
+
+        /* In UTF-8 mode, if the upper limit is > 255, or > 127 for caseless
+        matching, we have to use an XCLASS with extra data items. Caseless
+        matching for characters > 127 is available only if UCP support is
+        available. */
+
+#ifdef SUPPORT_UTF8
+        if (utf8 && (d > 255 || ((options & PCRE_CASELESS) != 0 && d > 127)))
+          {
+          class_utf8 = TRUE;
+
+          /* With UCP support, we can find the other case equivalents of
+          the relevant characters. There may be several ranges. Optimize how
+          they fit with the basic range. */
+
+#ifdef SUPPORT_UCP
+          if ((options & PCRE_CASELESS) != 0)
+            {
+            int occ, ocd;
+            int cc = c;
+            int origd = d;
+            while (get_othercase_range(&cc, origd, &occ, &ocd))
+              {
+              if (occ >= c && ocd <= d) continue;  /* Skip embedded ranges */
+
+              if (occ < c  && ocd >= c - 1)        /* Extend the basic range */
+                {                                  /* if there is overlap,   */
+                c = occ;                           /* noting that if occ < c */
+                continue;                          /* we can't have ocd > d  */
+                }                                  /* because a subrange is  */
+              if (ocd > d && occ <= d + 1)         /* always shorter than    */
+                {                                  /* the basic range.       */
+                d = ocd;
+                continue;
+                }
+
+              if (occ == ocd)
+                {
+                *class_utf8data++ = XCL_SINGLE;
+                }
+              else
+                {
+                *class_utf8data++ = XCL_RANGE;
+                class_utf8data += ord2utf8(occ, class_utf8data);
+                }
+              class_utf8data += ord2utf8(ocd, class_utf8data);
+              }
+            }
+#endif  /* SUPPORT_UCP */
+
+          /* Now record the original range, possibly modified for UCP caseless
+          overlapping ranges. */
+
+          *class_utf8data++ = XCL_RANGE;
+          class_utf8data += ord2utf8(c, class_utf8data);
+          class_utf8data += ord2utf8(d, class_utf8data);
+
+          /* With UCP support, we are done. Without UCP support, there is no
+          caseless matching for UTF-8 characters > 127; we can use the bit map
+          for the smaller ones. */
+
+#ifdef SUPPORT_UCP
+          continue;    /* With next character in the class */
+#else
+          if ((options & PCRE_CASELESS) == 0 || c > 127) continue;
+
+          /* Adjust upper limit and fall through to set up the map */
+
+          d = 127;
+
+#endif  /* SUPPORT_UCP */
+          }
+#endif  /* SUPPORT_UTF8 */
+
+        /* We use the bit map for all cases when not in UTF-8 mode; else
+        ranges that lie entirely within 0-127 when there is UCP support; else
+        for partial ranges without UCP support. */
+
+        for (; c <= d; c++)
+          {
+          classbits[c/8] |= (1 << (c&7));
+          if ((options & PCRE_CASELESS) != 0)
+            {
+            int uc = cd->fcc[c];           /* flip case */
+            classbits[uc/8] |= (1 << (uc&7));
+            }
+          class_charcount++;                /* in case a one-char range */
+          class_lastchar = c;
+          }
+
+        continue;   /* Go get the next char in the class */
+        }
+
+      /* Handle a lone single character - we can get here for a normal
+      non-escape char, or after \ that introduces a single character or for an
+      apparent range that isn't. */
+
+      LONE_SINGLE_CHARACTER:
+
+      /* Handle a character that cannot go in the bit map */
+
+#ifdef SUPPORT_UTF8
+      if (utf8 && (c > 255 || ((options & PCRE_CASELESS) != 0 && c > 127)))
+        {
+        class_utf8 = TRUE;
+        *class_utf8data++ = XCL_SINGLE;
+        class_utf8data += ord2utf8(c, class_utf8data);
+
+#ifdef SUPPORT_UCP
+        if ((options & PCRE_CASELESS) != 0)
+          {
+          int chartype;
+          int othercase;
+          if (ucp_findchar(c, &chartype, &othercase) >= 0 && othercase > 0)
+            {
+            *class_utf8data++ = XCL_SINGLE;
+            class_utf8data += ord2utf8(othercase, class_utf8data);
+            }
+          }
+#endif  /* SUPPORT_UCP */
+
+        }
+      else
+#endif  /* SUPPORT_UTF8 */
+
+      /* Handle a single-byte character */
+        {
+        classbits[c/8] |= (1 << (c&7));
+        if ((options & PCRE_CASELESS) != 0)
+          {
+          c = cd->fcc[c];   /* flip case */
+          classbits[c/8] |= (1 << (c&7));
+          }
+        class_charcount++;
+        class_lastchar = c;
+        }
+      }
+
+    /* Loop until ']' reached; the check for end of string happens inside the
+    loop. This "while" is the end of the "do" above. */
+
+    while ((c = *(++ptr)) != ']' || inescq);
+
+    /* If class_charcount is 1, we saw precisely one character whose value is
+    less than 256. In non-UTF-8 mode we can always optimize. In UTF-8 mode, we
+    can optimize the negative case only if there were no characters >= 128
+    because OP_NOT and the related opcodes like OP_NOTSTAR operate on
+    single-bytes only. This is an historical hangover. Maybe one day we can
+    tidy these opcodes to handle multi-byte characters.
+
+    The optimization throws away the bit map. We turn the item into a
+    1-character OP_CHAR[NC] if it's positive, or OP_NOT if it's negative. Note
+    that OP_NOT does not support multibyte characters. In the positive case, it
+    can cause firstbyte to be set. Otherwise, there can be no first char if
+    this item is first, whatever repeat count may follow. In the case of
+    reqbyte, save the previous value for reinstating. */
+
+#ifdef SUPPORT_UTF8
+    if (class_charcount == 1 &&
+          (!utf8 ||
+          (!class_utf8 && (!negate_class || class_lastchar < 128))))
+
+#else
+    if (class_charcount == 1)
+#endif
+      {
+      zeroreqbyte = reqbyte;
+
+      /* The OP_NOT opcode works on one-byte characters only. */
+
+      if (negate_class)
+        {
+        if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
+        zerofirstbyte = firstbyte;
+        *code++ = OP_NOT;
+        *code++ = class_lastchar;
+        break;
+        }
+
+      /* For a single, positive character, get the value into mcbuffer, and
+      then we can handle this with the normal one-character code. */
+
+#ifdef SUPPORT_UTF8
+      if (utf8 && class_lastchar > 127)
+        mclength = ord2utf8(class_lastchar, mcbuffer);
+      else
+#endif
+        {
+        mcbuffer[0] = class_lastchar;
+        mclength = 1;
+        }
+      goto ONE_CHAR;
+      }       /* End of 1-char optimization */
+
+    /* The general case - not the one-char optimization. If this is the first
+    thing in the branch, there can be no first char setting, whatever the
+    repeat count. Any reqbyte setting must remain unchanged after any kind of
+    repeat. */
+
+    if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
+    zerofirstbyte = firstbyte;
+    zeroreqbyte = reqbyte;
+
+    /* If there are characters with values > 255, we have to compile an
+    extended class, with its own opcode. If there are no characters < 256,
+    we can omit the bitmap. */
+
+#ifdef SUPPORT_UTF8
+    if (class_utf8)
+      {
+      *class_utf8data++ = XCL_END;    /* Marks the end of extra data */
+      *code++ = OP_XCLASS;
+      code += LINK_SIZE;
+      *code = negate_class? XCL_NOT : 0;
+
+      /* If the map is required, install it, and move on to the end of
+      the extra data */
+
+      if (class_charcount > 0)
+        {
+        *code++ |= XCL_MAP;
+        memcpy(code, classbits, 32);
+        code = class_utf8data;
+        }
+
+      /* If the map is not required, slide down the extra data. */
+
+      else
+        {
+        int len = class_utf8data - (code + 33);
+        memmove(code + 1, code + 33, len);
+        code += len + 1;
+        }
+
+      /* Now fill in the complete length of the item */
+
+      PUT(previous, 1, code - previous);
+      break;   /* End of class handling */
+      }
+#endif
+
+    /* If there are no characters > 255, negate the 32-byte map if necessary,
+    and copy it into the code vector. If this is the first thing in the branch,
+    there can be no first char setting, whatever the repeat count. Any reqbyte
+    setting must remain unchanged after any kind of repeat. */
+
+    if (negate_class)
+      {
+      *code++ = OP_NCLASS;
+      for (c = 0; c < 32; c++) code[c] = ~classbits[c];
+      }
+    else
+      {
+      *code++ = OP_CLASS;
+      memcpy(code, classbits, 32);
+      }
+    code += 32;
+    break;
+
+    /* Various kinds of repeat; '{' is not necessarily a quantifier, but this
+    has been tested above. */
+
+    case '{':
+    if (!is_quantifier) goto NORMAL_CHAR;
+    ptr = read_repeat_counts(ptr+1, &repeat_min, &repeat_max, errorptr);
+    if (*errorptr != NULL) goto FAILED;
+    goto REPEAT;
+
+    case '*':
+    repeat_min = 0;
+    repeat_max = -1;
+    goto REPEAT;
+
+    case '+':
+    repeat_min = 1;
+    repeat_max = -1;
+    goto REPEAT;
+
+    case '?':
+    repeat_min = 0;
+    repeat_max = 1;
+
+    REPEAT:
+    if (previous == NULL)
+      {
+      *errorptr = ERR9;
+      goto FAILED;
+      }
+
+    if (repeat_min == 0)
+      {
+      firstbyte = zerofirstbyte;    /* Adjust for zero repeat */
+      reqbyte = zeroreqbyte;        /* Ditto */
+      }
+
+    /* Remember whether this is a variable length repeat */
+
+    reqvary = (repeat_min == repeat_max)? 0 : REQ_VARY;
+
+    op_type = 0;                    /* Default single-char op codes */
+    possessive_quantifier = FALSE;  /* Default not possessive quantifier */
+
+    /* Save start of previous item, in case we have to move it up to make space
+    for an inserted OP_ONCE for the additional '+' extension. */
+
+    tempcode = previous;
+
+    /* If the next character is '+', we have a possessive quantifier. This
+    implies greediness, whatever the setting of the PCRE_UNGREEDY option.
+    If the next character is '?' this is a minimizing repeat, by default,
+    but if PCRE_UNGREEDY is set, it works the other way round. We change the
+    repeat type to the non-default. */
+
+    if (ptr[1] == '+')
+      {
+      repeat_type = 0;                  /* Force greedy */
+      possessive_quantifier = TRUE;
+      ptr++;
+      }
+    else if (ptr[1] == '?')
+      {
+      repeat_type = greedy_non_default;
+      ptr++;
+      }
+    else repeat_type = greedy_default;
+
+    /* If previous was a recursion, we need to wrap it inside brackets so that
+    it can be replicated if necessary. */
+
+    if (*previous == OP_RECURSE)
+      {
+      memmove(previous + 1 + LINK_SIZE, previous, 1 + LINK_SIZE);
+      code += 1 + LINK_SIZE;
+      *previous = OP_BRA;
+      PUT(previous, 1, code - previous);
+      *code = OP_KET;
+      PUT(code, 1, code - previous);
+      code += 1 + LINK_SIZE;
+      }
+
+    /* If previous was a character match, abolish the item and generate a
+    repeat item instead. If a char item has a minumum of more than one, ensure
+    that it is set in reqbyte - it might not be if a sequence such as x{3} is
+    the first thing in a branch because the x will have gone into firstbyte
+    instead.  */
+
+    if (*previous == OP_CHAR || *previous == OP_CHARNC)
+      {
+      /* Deal with UTF-8 characters that take up more than one byte. It's
+      easier to write this out separately than try to macrify it. Use c to
+      hold the length of the character in bytes, plus 0x80 to flag that it's a
+      length rather than a small character. */
+
+#ifdef SUPPORT_UTF8
+      if (utf8 && (code[-1] & 0x80) != 0)
+        {
+        uschar *lastchar = code - 1;
+        while((*lastchar & 0xc0) == 0x80) lastchar--;
+        c = code - lastchar;            /* Length of UTF-8 character */
+        memcpy(utf8_char, lastchar, c); /* Save the char */
+        c |= 0x80;                      /* Flag c as a length */
+        }
+      else
+#endif
+
+      /* Handle the case of a single byte - either with no UTF8 support, or
+      with UTF-8 disabled, or for a UTF-8 character < 128. */
+
+        {
+        c = code[-1];
+        if (repeat_min > 1) reqbyte = c | req_caseopt | cd->req_varyopt;
+        }
+
+      goto OUTPUT_SINGLE_REPEAT;   /* Code shared with single character types */
+      }
+
+    /* If previous was a single negated character ([^a] or similar), we use
+    one of the special opcodes, replacing it. The code is shared with single-
+    character repeats by setting opt_type to add a suitable offset into
+    repeat_type. OP_NOT is currently used only for single-byte chars. */
+
+    else if (*previous == OP_NOT)
+      {
+      op_type = OP_NOTSTAR - OP_STAR;  /* Use "not" opcodes */
+      c = previous[1];
+      goto OUTPUT_SINGLE_REPEAT;
+      }
+
+    /* If previous was a character type match (\d or similar), abolish it and
+    create a suitable repeat item. The code is shared with single-character
+    repeats by setting op_type to add a suitable offset into repeat_type. Note
+    the the Unicode property types will be present only when SUPPORT_UCP is
+    defined, but we don't wrap the little bits of code here because it just
+    makes it horribly messy. */
+
+    else if (*previous < OP_EODN)
+      {
+      uschar *oldcode;
+      int prop_type;
+      op_type = OP_TYPESTAR - OP_STAR;  /* Use type opcodes */
+      c = *previous;
+
+      OUTPUT_SINGLE_REPEAT:
+      prop_type = (*previous == OP_PROP || *previous == OP_NOTPROP)?
+        previous[1] : -1;
+
+      oldcode = code;
+      code = previous;                  /* Usually overwrite previous item */
+
+      /* If the maximum is zero then the minimum must also be zero; Perl allows
+      this case, so we do too - by simply omitting the item altogether. */
+
+      if (repeat_max == 0) goto END_REPEAT;
+
+      /* All real repeats make it impossible to handle partial matching (maybe
+      one day we will be able to remove this restriction). */
+
+      if (repeat_max != 1) cd->nopartial = TRUE;
+
+      /* Combine the op_type with the repeat_type */
+
+      repeat_type += op_type;
+
+      /* A minimum of zero is handled either as the special case * or ?, or as
+      an UPTO, with the maximum given. */
+
+      if (repeat_min == 0)
+        {
+        if (repeat_max == -1) *code++ = OP_STAR + repeat_type;
+          else if (repeat_max == 1) *code++ = OP_QUERY + repeat_type;
+        else
+          {
+          *code++ = OP_UPTO + repeat_type;
+          PUT2INC(code, 0, repeat_max);
+          }
+        }
+
+      /* A repeat minimum of 1 is optimized into some special cases. If the
+      maximum is unlimited, we use OP_PLUS. Otherwise, the original item it
+      left in place and, if the maximum is greater than 1, we use OP_UPTO with
+      one less than the maximum. */
+
+      else if (repeat_min == 1)
+        {
+        if (repeat_max == -1)
+          *code++ = OP_PLUS + repeat_type;
+        else
+          {
+          code = oldcode;                 /* leave previous item in place */
+          if (repeat_max == 1) goto END_REPEAT;
+          *code++ = OP_UPTO + repeat_type;
+          PUT2INC(code, 0, repeat_max - 1);
+          }
+        }
+
+      /* The case {n,n} is just an EXACT, while the general case {n,m} is
+      handled as an EXACT followed by an UPTO. */
+
+      else
+        {
+        *code++ = OP_EXACT + op_type;  /* NB EXACT doesn't have repeat_type */
+        PUT2INC(code, 0, repeat_min);
+
+        /* If the maximum is unlimited, insert an OP_STAR. Before doing so,
+        we have to insert the character for the previous code. For a repeated
+        Unicode property match, there is an extra byte that defines the
+        required property. In UTF-8 mode, long characters have their length in
+        c, with the 0x80 bit as a flag. */
+
+        if (repeat_max < 0)
+          {
+#ifdef SUPPORT_UTF8
+          if (utf8 && c >= 128)
+            {
+            memcpy(code, utf8_char, c & 7);
+            code += c & 7;
+            }
+          else
+#endif
+            {
+            *code++ = c;
+            if (prop_type >= 0) *code++ = prop_type;
+            }
+          *code++ = OP_STAR + repeat_type;
+          }
+
+        /* Else insert an UPTO if the max is greater than the min, again
+        preceded by the character, for the previously inserted code. */
+
+        else if (repeat_max != repeat_min)
+          {
+#ifdef SUPPORT_UTF8
+          if (utf8 && c >= 128)
+            {
+            memcpy(code, utf8_char, c & 7);
+            code += c & 7;
+            }
+          else
+#endif
+          *code++ = c;
+          if (prop_type >= 0) *code++ = prop_type;
+          repeat_max -= repeat_min;
+          *code++ = OP_UPTO + repeat_type;
+          PUT2INC(code, 0, repeat_max);
+          }
+        }
+
+      /* The character or character type itself comes last in all cases. */
+
+#ifdef SUPPORT_UTF8
+      if (utf8 && c >= 128)
+        {
+        memcpy(code, utf8_char, c & 7);
+        code += c & 7;
+        }
+      else
+#endif
+      *code++ = c;
+
+      /* For a repeated Unicode property match, there is an extra byte that
+      defines the required property. */
+
+#ifdef SUPPORT_UCP
+      if (prop_type >= 0) *code++ = prop_type;
+#endif
+      }
+
+    /* If previous was a character class or a back reference, we put the repeat
+    stuff after it, but just skip the item if the repeat was {0,0}. */
+
+    else if (*previous == OP_CLASS ||
+             *previous == OP_NCLASS ||
+#ifdef SUPPORT_UTF8
+             *previous == OP_XCLASS ||
+#endif
+             *previous == OP_REF)
+      {
+      if (repeat_max == 0)
+        {
+        code = previous;
+        goto END_REPEAT;
+        }
+
+      /* All real repeats make it impossible to handle partial matching (maybe
+      one day we will be able to remove this restriction). */
+
+      if (repeat_max != 1) cd->nopartial = TRUE;
+
+      if (repeat_min == 0 && repeat_max == -1)
+        *code++ = OP_CRSTAR + repeat_type;
+      else if (repeat_min == 1 && repeat_max == -1)
+        *code++ = OP_CRPLUS + repeat_type;
+      else if (repeat_min == 0 && repeat_max == 1)
+        *code++ = OP_CRQUERY + repeat_type;
+      else
+        {
+        *code++ = OP_CRRANGE + repeat_type;
+        PUT2INC(code, 0, repeat_min);
+        if (repeat_max == -1) repeat_max = 0;  /* 2-byte encoding for max */
+        PUT2INC(code, 0, repeat_max);
+        }
+      }
+
+    /* If previous was a bracket group, we may have to replicate it in certain
+    cases. */
+
+    else if (*previous >= OP_BRA || *previous == OP_ONCE ||
+             *previous == OP_COND)
+      {
+      register int i;
+      int ketoffset = 0;
+      int len = code - previous;
+      uschar *bralink = NULL;
+
+      /* If the maximum repeat count is unlimited, find the end of the bracket
+      by scanning through from the start, and compute the offset back to it
+      from the current code pointer. There may be an OP_OPT setting following
+      the final KET, so we can't find the end just by going back from the code
+      pointer. */
+
+      if (repeat_max == -1)
+        {
+        register uschar *ket = previous;
+        do ket += GET(ket, 1); while (*ket != OP_KET);
+        ketoffset = code - ket;
+        }
+
+      /* The case of a zero minimum is special because of the need to stick
+      OP_BRAZERO in front of it, and because the group appears once in the
+      data, whereas in other cases it appears the minimum number of times. For
+      this reason, it is simplest to treat this case separately, as otherwise
+      the code gets far too messy. There are several special subcases when the
+      minimum is zero. */
+
+      if (repeat_min == 0)
+        {
+        /* If the maximum is also zero, we just omit the group from the output
+        altogether. */
+
+        if (repeat_max == 0)
+          {
+          code = previous;
+          goto END_REPEAT;
+          }
+
+        /* If the maximum is 1 or unlimited, we just have to stick in the
+        BRAZERO and do no more at this point. However, we do need to adjust
+        any OP_RECURSE calls inside the group that refer to the group itself or
+        any internal group, because the offset is from the start of the whole
+        regex. Temporarily terminate the pattern while doing this. */
+
+        if (repeat_max <= 1)
+          {
+          *code = OP_END;
+          adjust_recurse(previous, 1, utf8, cd);
+          memmove(previous+1, previous, len);
+          code++;
+          *previous++ = OP_BRAZERO + repeat_type;
+          }
+
+        /* If the maximum is greater than 1 and limited, we have to replicate
+        in a nested fashion, sticking OP_BRAZERO before each set of brackets.
+        The first one has to be handled carefully because it's the original
+        copy, which has to be moved up. The remainder can be handled by code
+        that is common with the non-zero minimum case below. We have to
+        adjust the value or repeat_max, since one less copy is required. Once
+        again, we may have to adjust any OP_RECURSE calls inside the group. */
+
+        else
+          {
+          int offset;
+          *code = OP_END;
+          adjust_recurse(previous, 2 + LINK_SIZE, utf8, cd);
+          memmove(previous + 2 + LINK_SIZE, previous, len);
+          code += 2 + LINK_SIZE;
+          *previous++ = OP_BRAZERO + repeat_type;
+          *previous++ = OP_BRA;
+
+          /* We chain together the bracket offset fields that have to be
+          filled in later when the ends of the brackets are reached. */
+
+          offset = (bralink == NULL)? 0 : previous - bralink;
+          bralink = previous;
+          PUTINC(previous, 0, offset);
+          }
+
+        repeat_max--;
+        }
+
+      /* If the minimum is greater than zero, replicate the group as many
+      times as necessary, and adjust the maximum to the number of subsequent
+      copies that we need. If we set a first char from the group, and didn't
+      set a required char, copy the latter from the former. */
+
+      else
+        {
+        if (repeat_min > 1)
+          {
+          if (groupsetfirstbyte && reqbyte < 0) reqbyte = firstbyte;
+          for (i = 1; i < repeat_min; i++)
+            {
+            memcpy(code, previous, len);
+            code += len;
+            }
+          }
+        if (repeat_max > 0) repeat_max -= repeat_min;
+        }
+
+      /* This code is common to both the zero and non-zero minimum cases. If
+      the maximum is limited, it replicates the group in a nested fashion,
+      remembering the bracket starts on a stack. In the case of a zero minimum,
+      the first one was set up above. In all cases the repeat_max now specifies
+      the number of additional copies needed. */
+
+      if (repeat_max >= 0)
+        {
+        for (i = repeat_max - 1; i >= 0; i--)
+          {
+          *code++ = OP_BRAZERO + repeat_type;
+
+          /* All but the final copy start a new nesting, maintaining the
+          chain of brackets outstanding. */
+
+          if (i != 0)
+            {
+            int offset;
+            *code++ = OP_BRA;
+            offset = (bralink == NULL)? 0 : code - bralink;
+            bralink = code;
+            PUTINC(code, 0, offset);
+            }
+
+          memcpy(code, previous, len);
+          code += len;
+          }
+
+        /* Now chain through the pending brackets, and fill in their length
+        fields (which are holding the chain links pro tem). */
+
+        while (bralink != NULL)
+          {
+          int oldlinkoffset;
+          int offset = code - bralink + 1;
+          uschar *bra = code - offset;
+          oldlinkoffset = GET(bra, 1);
+          bralink = (oldlinkoffset == 0)? NULL : bralink - oldlinkoffset;
+          *code++ = OP_KET;
+          PUTINC(code, 0, offset);
+          PUT(bra, 1, offset);
+          }
+        }
+
+      /* If the maximum is unlimited, set a repeater in the final copy. We
+      can't just offset backwards from the current code point, because we
+      don't know if there's been an options resetting after the ket. The
+      correct offset was computed above. */
+
+      else code[-ketoffset] = OP_KETRMAX + repeat_type;
+      }
+
+    /* Else there's some kind of shambles */
+
+    else
+      {
+      *errorptr = ERR11;
+      goto FAILED;
+      }
+
+    /* If the character following a repeat is '+', we wrap the entire repeated
+    item inside OP_ONCE brackets. This is just syntactic sugar, taken from
+    Sun's Java package. The repeated item starts at tempcode, not at previous,
+    which might be the first part of a string whose (former) last char we
+    repeated. However, we don't support '+' after a greediness '?'. */
+
+    if (possessive_quantifier)
+      {
+      int len = code - tempcode;
+      memmove(tempcode + 1+LINK_SIZE, tempcode, len);
+      code += 1 + LINK_SIZE;
+      len += 1 + LINK_SIZE;
+      tempcode[0] = OP_ONCE;
+      *code++ = OP_KET;
+      PUTINC(code, 0, len);
+      PUT(tempcode, 1, len);
+      }
+
+    /* In all case we no longer have a previous item. We also set the
+    "follows varying string" flag for subsequently encountered reqbytes if
+    it isn't already set and we have just passed a varying length item. */
+
+    END_REPEAT:
+    previous = NULL;
+    cd->req_varyopt |= reqvary;
+    break;
+
+
+    /* Start of nested bracket sub-expression, or comment or lookahead or
+    lookbehind or option setting or condition. First deal with special things
+    that can come after a bracket; all are introduced by ?, and the appearance
+    of any of them means that this is not a referencing group. They were
+    checked for validity in the first pass over the string, so we don't have to
+    check for syntax errors here.  */
+
+    case '(':
+    newoptions = options;
+    skipbytes = 0;
+
+    if (*(++ptr) == '?')
+      {
+      int set, unset;
+      int *optset;
+
+      switch (*(++ptr))
+        {
+        case '#':                 /* Comment; skip to ket */
+        ptr++;
+        while (*ptr != ')') ptr++;
+        continue;
+
+        case ':':                 /* Non-extracting bracket */
+        bravalue = OP_BRA;
+        ptr++;
+        break;
+
+        case '(':
+        bravalue = OP_COND;       /* Conditional group */
+
+        /* Condition to test for recursion */
+
+        if (ptr[1] == 'R')
+          {
+          code[1+LINK_SIZE] = OP_CREF;
+          PUT2(code, 2+LINK_SIZE, CREF_RECURSE);
+          skipbytes = 3;
+          ptr += 3;
+          }
+
+        /* Condition to test for a numbered subpattern match. We know that
+        if a digit follows ( then there will just be digits until ) because
+        the syntax was checked in the first pass. */
+
+        else if ((digitab[ptr[1]] && ctype_digit) != 0)
+          {
+          int condref;                 /* Don't amalgamate; some compilers */
+          condref = *(++ptr) - '0';    /* grumble at autoincrement in declaration */
+          while (*(++ptr) != ')') condref = condref*10 + *ptr - '0';
+          if (condref == 0)
+            {
+            *errorptr = ERR35;
+            goto FAILED;
+            }
+          ptr++;
+          code[1+LINK_SIZE] = OP_CREF;
+          PUT2(code, 2+LINK_SIZE, condref);
+          skipbytes = 3;
+          }
+        /* For conditions that are assertions, we just fall through, having
+        set bravalue above. */
+        break;
+
+        case '=':                 /* Positive lookahead */
+        bravalue = OP_ASSERT;
+        ptr++;
+        break;
+
+        case '!':                 /* Negative lookahead */
+        bravalue = OP_ASSERT_NOT;
+        ptr++;
+        break;
+
+        case '<':                 /* Lookbehinds */
+        switch (*(++ptr))
+          {
+          case '=':               /* Positive lookbehind */
+          bravalue = OP_ASSERTBACK;
+          ptr++;
+          break;
+
+          case '!':               /* Negative lookbehind */
+          bravalue = OP_ASSERTBACK_NOT;
+          ptr++;
+          break;
+          }
+        break;
+
+        case '>':                 /* One-time brackets */
+        bravalue = OP_ONCE;
+        ptr++;
+        break;
+
+        case 'C':                 /* Callout - may be followed by digits; */
+        previous_callout = code;  /* Save for later completion */
+        after_manual_callout = 1; /* Skip one item before completing */
+        *code++ = OP_CALLOUT;     /* Already checked that the terminating */
+          {                       /* closing parenthesis is present. */
+          int n = 0;
+          while ((digitab[*(++ptr)] & ctype_digit) != 0)
+            n = n * 10 + *ptr - '0';
+          if (n > 255)
+            {
+            *errorptr = ERR38;
+            goto FAILED;
+            }
+          *code++ = n;
+          PUT(code, 0, ptr - cd->start_pattern + 1);  /* Pattern offset */
+          PUT(code, LINK_SIZE, 0);                    /* Default length */
+          code += 2 * LINK_SIZE;
+          }
+        previous = NULL;
+        continue;
+
+        case 'P':                 /* Named subpattern handling */
+        if (*(++ptr) == '<')      /* Definition */
+          {
+          int i, namelen;
+          uschar *slot = cd->name_table;
+          const uschar *name;     /* Don't amalgamate; some compilers */
+          name = ++ptr;           /* grumble at autoincrement in declaration */
+
+          while (*ptr++ != '>');
+          namelen = ptr - name - 1;
+
+          for (i = 0; i < cd->names_found; i++)
+            {
+            int crc = memcmp(name, slot+2, namelen);
+            if (crc == 0)
+              {
+              if (slot[2+namelen] == 0)
+                {
+                *errorptr = ERR43;
+                goto FAILED;
+                }
+              crc = -1;             /* Current name is substring */
+              }
+            if (crc < 0)
+              {
+              memmove(slot + cd->name_entry_size, slot,
+                (cd->names_found - i) * cd->name_entry_size);
+              break;
+              }
+            slot += cd->name_entry_size;
+            }
+
+          PUT2(slot, 0, *brackets + 1);
+          memcpy(slot + 2, name, namelen);
+          slot[2+namelen] = 0;
+          cd->names_found++;
+          goto NUMBERED_GROUP;
+          }
+
+        if (*ptr == '=' || *ptr == '>')  /* Reference or recursion */
+          {
+          int i, namelen;
+          int type = *ptr++;
+          const uschar *name = ptr;
+          uschar *slot = cd->name_table;
+
+          while (*ptr != ')') ptr++;
+          namelen = ptr - name;
+
+          for (i = 0; i < cd->names_found; i++)
+            {
+            if (strncmp((char *)name, (char *)slot+2, namelen) == 0) break;
+            slot += cd->name_entry_size;
+            }
+          if (i >= cd->names_found)
+            {
+            *errorptr = ERR15;
+            goto FAILED;
+            }
+
+          recno = GET2(slot, 0);
+
+          if (type == '>') goto HANDLE_RECURSION;  /* A few lines below */
+
+          /* Back reference */
+
+          previous = code;
+          *code++ = OP_REF;
+          PUT2INC(code, 0, recno);
+          cd->backref_map |= (recno < 32)? (1 << recno) : 1;
+          if (recno > cd->top_backref) cd->top_backref = recno;
+          continue;
+          }
+
+        /* Should never happen */
+        break;
+
+        case 'R':                 /* Pattern recursion */
+        ptr++;                    /* Same as (?0)      */
+        /* Fall through */
+
+        /* Recursion or "subroutine" call */
+
+        case '0': case '1': case '2': case '3': case '4':
+        case '5': case '6': case '7': case '8': case '9':
+          {
+          const uschar *called;
+          recno = 0;
+          while((digitab[*ptr] & ctype_digit) != 0)
+            recno = recno * 10 + *ptr++ - '0';
+
+          /* Come here from code above that handles a named recursion */
+
+          HANDLE_RECURSION:
+
+          previous = code;
+
+          /* Find the bracket that is being referenced. Temporarily end the
+          regex in case it doesn't exist. */
+
+          *code = OP_END;
+          called = (recno == 0)?
+            cd->start_code : find_bracket(cd->start_code, utf8, recno);
+
+          if (called == NULL)
+            {
+            *errorptr = ERR15;
+            goto FAILED;
+            }
+
+          /* If the subpattern is still open, this is a recursive call. We
+          check to see if this is a left recursion that could loop for ever,
+          and diagnose that case. */
+
+          if (GET(called, 1) == 0 && could_be_empty(called, code, bcptr, utf8))
+            {
+            *errorptr = ERR40;
+            goto FAILED;
+            }
+
+          /* Insert the recursion/subroutine item */
+
+          *code = OP_RECURSE;
+          PUT(code, 1, called - cd->start_code);
+          code += 1 + LINK_SIZE;
+          }
+        continue;
+
+        /* Character after (? not specially recognized */
+
+        default:                  /* Option setting */
+        set = unset = 0;
+        optset = &set;
+
+        while (*ptr != ')' && *ptr != ':')
+          {
+          switch (*ptr++)
+            {
+            case '-': optset = &unset; break;
+
+            case 'i': *optset |= PCRE_CASELESS; break;
+            case 'm': *optset |= PCRE_MULTILINE; break;
+            case 's': *optset |= PCRE_DOTALL; break;
+            case 'x': *optset |= PCRE_EXTENDED; break;
+            case 'U': *optset |= PCRE_UNGREEDY; break;
+            case 'X': *optset |= PCRE_EXTRA; break;
+            }
+          }
+
+        /* Set up the changed option bits, but don't change anything yet. */
+
+        newoptions = (options | set) & (~unset);
+
+        /* If the options ended with ')' this is not the start of a nested
+        group with option changes, so the options change at this level. Compile
+        code to change the ims options if this setting actually changes any of
+        them. We also pass the new setting back so that it can be put at the
+        start of any following branches, and when this group ends (if we are in
+        a group), a resetting item can be compiled.
+
+        Note that if this item is right at the start of the pattern, the
+        options will have been abstracted and made global, so there will be no
+        change to compile. */
+
+        if (*ptr == ')')
+          {
+          if ((options & PCRE_IMS) != (newoptions & PCRE_IMS))
+            {
+            *code++ = OP_OPT;
+            *code++ = newoptions & PCRE_IMS;
+            }
+
+          /* Change options at this level, and pass them back for use
+          in subsequent branches. Reset the greedy defaults and the case
+          value for firstbyte and reqbyte. */
+
+          *optionsptr = options = newoptions;
+          greedy_default = ((newoptions & PCRE_UNGREEDY) != 0);
+          greedy_non_default = greedy_default ^ 1;
+          req_caseopt = ((options & PCRE_CASELESS) != 0)? REQ_CASELESS : 0;
+
+          previous = NULL;       /* This item can't be repeated */
+          continue;              /* It is complete */
+          }
+
+        /* If the options ended with ':' we are heading into a nested group
+        with possible change of options. Such groups are non-capturing and are
+        not assertions of any kind. All we need to do is skip over the ':';
+        the newoptions value is handled below. */
+
+        bravalue = OP_BRA;
+        ptr++;
+        }
+      }
+
+    /* If PCRE_NO_AUTO_CAPTURE is set, all unadorned brackets become
+    non-capturing and behave like (?:...) brackets */
+
+    else if ((options & PCRE_NO_AUTO_CAPTURE) != 0)
+      {
+      bravalue = OP_BRA;
+      }
+
+    /* Else we have a referencing group; adjust the opcode. If the bracket
+    number is greater than EXTRACT_BASIC_MAX, we set the opcode one higher, and
+    arrange for the true number to follow later, in an OP_BRANUMBER item. */
+
+    else
+      {
+      NUMBERED_GROUP:
+      if (++(*brackets) > EXTRACT_BASIC_MAX)
+        {
+        bravalue = OP_BRA + EXTRACT_BASIC_MAX + 1;
+        code[1+LINK_SIZE] = OP_BRANUMBER;
+        PUT2(code, 2+LINK_SIZE, *brackets);
+        skipbytes = 3;
+        }
+      else bravalue = OP_BRA + *brackets;
+      }
+
+    /* Process nested bracketed re. Assertions may not be repeated, but other
+    kinds can be. We copy code into a non-register variable in order to be able
+    to pass its address because some compilers complain otherwise. Pass in a
+    new setting for the ims options if they have changed. */
+
+    previous = (bravalue >= OP_ONCE)? code : NULL;
+    *code = bravalue;
+    tempcode = code;
+    tempreqvary = cd->req_varyopt;     /* Save value before bracket */
+
+    if (!compile_regex(
+         newoptions,                   /* The complete new option state */
+         options & PCRE_IMS,           /* The previous ims option state */
+         brackets,                     /* Extracting bracket count */
+         &tempcode,                    /* Where to put code (updated) */
+         &ptr,                         /* Input pointer (updated) */
+         errorptr,                     /* Where to put an error message */
+         (bravalue == OP_ASSERTBACK ||
+          bravalue == OP_ASSERTBACK_NOT), /* TRUE if back assert */
+         skipbytes,                    /* Skip over OP_COND/OP_BRANUMBER */
+         &subfirstbyte,                /* For possible first char */
+         &subreqbyte,                  /* For possible last char */
+         bcptr,                        /* Current branch chain */
+         cd))                          /* Tables block */
+      goto FAILED;
+
+    /* At the end of compiling, code is still pointing to the start of the
+    group, while tempcode has been updated to point past the end of the group
+    and any option resetting that may follow it. The pattern pointer (ptr)
+    is on the bracket. */
+
+    /* If this is a conditional bracket, check that there are no more than
+    two branches in the group. */
+
+    else if (bravalue == OP_COND)
+      {
+      uschar *tc = code;
+      condcount = 0;
+
+      do {
+         condcount++;
+         tc += GET(tc,1);
+         }
+      while (*tc != OP_KET);
+
+      if (condcount > 2)
+        {
+        *errorptr = ERR27;
+        goto FAILED;
+        }
+
+      /* If there is just one branch, we must not make use of its firstbyte or
+      reqbyte, because this is equivalent to an empty second branch. */
+
+      if (condcount == 1) subfirstbyte = subreqbyte = REQ_NONE;
+      }
+
+    /* Handle updating of the required and first characters. Update for normal
+    brackets of all kinds, and conditions with two branches (see code above).
+    If the bracket is followed by a quantifier with zero repeat, we have to
+    back off. Hence the definition of zeroreqbyte and zerofirstbyte outside the
+    main loop so that they can be accessed for the back off. */
+
+    zeroreqbyte = reqbyte;
+    zerofirstbyte = firstbyte;
+    groupsetfirstbyte = FALSE;
+
+    if (bravalue >= OP_BRA || bravalue == OP_ONCE || bravalue == OP_COND)
+      {
+      /* If we have not yet set a firstbyte in this branch, take it from the
+      subpattern, remembering that it was set here so that a repeat of more
+      than one can replicate it as reqbyte if necessary. If the subpattern has
+      no firstbyte, set "none" for the whole branch. In both cases, a zero
+      repeat forces firstbyte to "none". */
+
+      if (firstbyte == REQ_UNSET)
+        {
+        if (subfirstbyte >= 0)
+          {
+          firstbyte = subfirstbyte;
+          groupsetfirstbyte = TRUE;
+          }
+        else firstbyte = REQ_NONE;
+        zerofirstbyte = REQ_NONE;
+        }
+
+      /* If firstbyte was previously set, convert the subpattern's firstbyte
+      into reqbyte if there wasn't one, using the vary flag that was in
+      existence beforehand. */
+
+      else if (subfirstbyte >= 0 && subreqbyte < 0)
+        subreqbyte = subfirstbyte | tempreqvary;
+
+      /* If the subpattern set a required byte (or set a first byte that isn't
+      really the first byte - see above), set it. */
+
+      if (subreqbyte >= 0) reqbyte = subreqbyte;
+      }
+
+    /* For a forward assertion, we take the reqbyte, if set. This can be
+    helpful if the pattern that follows the assertion doesn't set a different
+    char. For example, it's useful for /(?=abcde).+/. We can't set firstbyte
+    for an assertion, however because it leads to incorrect effect for patterns
+    such as /(?=a)a.+/ when the "real" "a" would then become a reqbyte instead
+    of a firstbyte. This is overcome by a scan at the end if there's no
+    firstbyte, looking for an asserted first char. */
+
+    else if (bravalue == OP_ASSERT && subreqbyte >= 0) reqbyte = subreqbyte;
+
+    /* Now update the main code pointer to the end of the group. */
+
+    code = tempcode;
+
+    /* Error if hit end of pattern */
+
+    if (*ptr != ')')
+      {
+      *errorptr = ERR14;
+      goto FAILED;
+      }
+    break;
+
+    /* Check \ for being a real metacharacter; if not, fall through and handle
+    it as a data character at the start of a string. Escape items are checked
+    for validity in the pre-compiling pass. */
+
+    case '\\':
+    tempptr = ptr;
+    c = check_escape(&ptr, errorptr, *brackets, options, FALSE);
+
+    /* Handle metacharacters introduced by \. For ones like \d, the ESC_ values
+    are arranged to be the negation of the corresponding OP_values. For the
+    back references, the values are ESC_REF plus the reference number. Only
+    back references and those types that consume a character may be repeated.
+    We can test for values between ESC_b and ESC_Z for the latter; this may
+    have to change if any new ones are ever created. */
+
+    if (c < 0)
+      {
+      if (-c == ESC_Q)            /* Handle start of quoted string */
+        {
+        if (ptr[1] == '\\' && ptr[2] == 'E') ptr += 2; /* avoid empty string */
+          else inescq = TRUE;
+        continue;
+        }
+
+      /* For metasequences that actually match a character, we disable the
+      setting of a first character if it hasn't already been set. */
+
+      if (firstbyte == REQ_UNSET && -c > ESC_b && -c < ESC_Z)
+        firstbyte = REQ_NONE;
+
+      /* Set values to reset to if this is followed by a zero repeat. */
+
+      zerofirstbyte = firstbyte;
+      zeroreqbyte = reqbyte;
+
+      /* Back references are handled specially */
+
+      if (-c >= ESC_REF)
+        {
+        int number = -c - ESC_REF;
+        previous = code;
+        *code++ = OP_REF;
+        PUT2INC(code, 0, number);
+        }
+
+      /* So are Unicode property matches, if supported. We know that get_ucp
+      won't fail because it was tested in the pre-pass. */
+
+#ifdef SUPPORT_UCP
+      else if (-c == ESC_P || -c == ESC_p)
+        {
+        BOOL negated;
+        int value = get_ucp(&ptr, &negated, errorptr);
+        previous = code;
+        *code++ = ((-c == ESC_p) != negated)? OP_PROP : OP_NOTPROP;
+        *code++ = value;
+        }
+#endif
+
+      /* For the rest, we can obtain the OP value by negating the escape
+      value */
+
+      else
+        {
+        previous = (-c > ESC_b && -c < ESC_Z)? code : NULL;
+        *code++ = -c;
+        }
+      continue;
+      }
+
+    /* We have a data character whose value is in c. In UTF-8 mode it may have
+    a value > 127. We set its representation in the length/buffer, and then
+    handle it as a data character. */
+
+#ifdef SUPPORT_UTF8
+    if (utf8 && c > 127)
+      mclength = ord2utf8(c, mcbuffer);
+    else
+#endif
+
+     {
+     mcbuffer[0] = c;
+     mclength = 1;
+     }
+
+    goto ONE_CHAR;
+
+    /* Handle a literal character. It is guaranteed not to be whitespace or #
+    when the extended flag is set. If we are in UTF-8 mode, it may be a
+    multi-byte literal character. */
+
+    default:
+    NORMAL_CHAR:
+    mclength = 1;
+    mcbuffer[0] = c;
+
+#ifdef SUPPORT_UTF8
+    if (utf8 && (c & 0xc0) == 0xc0)
+      {
+      while ((ptr[1] & 0xc0) == 0x80)
+        mcbuffer[mclength++] = *(++ptr);
+      }
+#endif
+
+    /* At this point we have the character's bytes in mcbuffer, and the length
+    in mclength. When not in UTF-8 mode, the length is always 1. */
+
+    ONE_CHAR:
+    previous = code;
+    *code++ = ((options & PCRE_CASELESS) != 0)? OP_CHARNC : OP_CHAR;
+    for (c = 0; c < mclength; c++) *code++ = mcbuffer[c];
+
+    /* Set the first and required bytes appropriately. If no previous first
+    byte, set it from this character, but revert to none on a zero repeat.
+    Otherwise, leave the firstbyte value alone, and don't change it on a zero
+    repeat. */
+
+    if (firstbyte == REQ_UNSET)
+      {
+      zerofirstbyte = REQ_NONE;
+      zeroreqbyte = reqbyte;
+
+      /* If the character is more than one byte long, we can set firstbyte
+      only if it is not to be matched caselessly. */
+
+      if (mclength == 1 || req_caseopt == 0)
+        {
+        firstbyte = mcbuffer[0] | req_caseopt;
+        if (mclength != 1) reqbyte = code[-1] | cd->req_varyopt;
+        }
+      else firstbyte = reqbyte = REQ_NONE;
+      }
+
+    /* firstbyte was previously set; we can set reqbyte only the length is
+    1 or the matching is caseful. */
+
+    else
+      {
+      zerofirstbyte = firstbyte;
+      zeroreqbyte = reqbyte;
+      if (mclength == 1 || req_caseopt == 0)
+        reqbyte = code[-1] | req_caseopt | cd->req_varyopt;
+      }
+
+    break;            /* End of literal character handling */
+    }
+  }                   /* end of big loop */
+
+/* Control never reaches here by falling through, only by a goto for all the
+error states. Pass back the position in the pattern so that it can be displayed
+to the user for diagnosing the error. */
+
+FAILED:
+*ptrptr = ptr;
+return FALSE;
+}
+
+
+
+
+/*************************************************
+*     Compile sequence of alternatives           *
+*************************************************/
+
+/* On entry, ptr is pointing past the bracket character, but on return
+it points to the closing bracket, or vertical bar, or end of string.
+The code variable is pointing at the byte into which the BRA operator has been
+stored. If the ims options are changed at the start (for a (?ims: group) or
+during any branch, we need to insert an OP_OPT item at the start of every
+following branch to ensure they get set correctly at run time, and also pass
+the new options into every subsequent branch compile.
+
+Argument:
+  options        option bits, including any changes for this subpattern
+  oldims         previous settings of ims option bits
+  brackets       -> int containing the number of extracting brackets used
+  codeptr        -> the address of the current code pointer
+  ptrptr         -> the address of the current pattern pointer
+  errorptr       -> pointer to error message
+  lookbehind     TRUE if this is a lookbehind assertion
+  skipbytes      skip this many bytes at start (for OP_COND, OP_BRANUMBER)
+  firstbyteptr   place to put the first required character, or a negative number
+  reqbyteptr     place to put the last required character, or a negative number
+  bcptr          pointer to the chain of currently open branches
+  cd             points to the data block with tables pointers etc.
+
+Returns:      TRUE on success
+*/
+
+static BOOL
+compile_regex(int options, int oldims, int *brackets, uschar **codeptr,
+  const uschar **ptrptr, const char **errorptr, BOOL lookbehind, int skipbytes,
+  int *firstbyteptr, int *reqbyteptr, branch_chain *bcptr, compile_data *cd)
+{
+const uschar *ptr = *ptrptr;
+uschar *code = *codeptr;
+uschar *last_branch = code;
+uschar *start_bracket = code;
+uschar *reverse_count = NULL;
+int firstbyte, reqbyte;
+int branchfirstbyte, branchreqbyte;
+branch_chain bc;
+
+bc.outer = bcptr;
+bc.current = code;
+
+firstbyte = reqbyte = REQ_UNSET;
+
+/* Offset is set zero to mark that this bracket is still open */
+
+PUT(code, 1, 0);
+code += 1 + LINK_SIZE + skipbytes;
+
+/* Loop for each alternative branch */
+
+for (;;)
+  {
+  /* Handle a change of ims options at the start of the branch */
+
+  if ((options & PCRE_IMS) != oldims)
+    {
+    *code++ = OP_OPT;
+    *code++ = options & PCRE_IMS;
+    }
+
+  /* Set up dummy OP_REVERSE if lookbehind assertion */
+
+  if (lookbehind)
+    {
+    *code++ = OP_REVERSE;
+    reverse_count = code;
+    PUTINC(code, 0, 0);
+    }
+
+  /* Now compile the branch */
+
+  if (!compile_branch(&options, brackets, &code, &ptr, errorptr,
+        &branchfirstbyte, &branchreqbyte, &bc, cd))
+    {
+    *ptrptr = ptr;
+    return FALSE;
+    }
+
+  /* If this is the first branch, the firstbyte and reqbyte values for the
+  branch become the values for the regex. */
+
+  if (*last_branch != OP_ALT)
+    {
+    firstbyte = branchfirstbyte;
+    reqbyte = branchreqbyte;
+    }
+
+  /* If this is not the first branch, the first char and reqbyte have to
+  match the values from all the previous branches, except that if the previous
+  value for reqbyte didn't have REQ_VARY set, it can still match, and we set
+  REQ_VARY for the regex. */
+
+  else
+    {
+    /* If we previously had a firstbyte, but it doesn't match the new branch,
+    we have to abandon the firstbyte for the regex, but if there was previously
+    no reqbyte, it takes on the value of the old firstbyte. */
+
+    if (firstbyte >= 0 && firstbyte != branchfirstbyte)
+      {
+      if (reqbyte < 0) reqbyte = firstbyte;
+      firstbyte = REQ_NONE;
+      }
+
+    /* If we (now or from before) have no firstbyte, a firstbyte from the
+    branch becomes a reqbyte if there isn't a branch reqbyte. */
+
+    if (firstbyte < 0 && branchfirstbyte >= 0 && branchreqbyte < 0)
+        branchreqbyte = branchfirstbyte;
+
+    /* Now ensure that the reqbytes match */
+
+    if ((reqbyte & ~REQ_VARY) != (branchreqbyte & ~REQ_VARY))
+      reqbyte = REQ_NONE;
+    else reqbyte |= branchreqbyte;   /* To "or" REQ_VARY */
+    }
+
+  /* If lookbehind, check that this branch matches a fixed-length string,
+  and put the length into the OP_REVERSE item. Temporarily mark the end of
+  the branch with OP_END. */
+
+  if (lookbehind)
+    {
+    int length;
+    *code = OP_END;
+    length = find_fixedlength(last_branch, options);
+    DPRINTF(("fixed length = %d\n", length));
+    if (length < 0)
+      {
+      *errorptr = (length == -2)? ERR36 : ERR25;
+      *ptrptr = ptr;
+      return FALSE;
+      }
+    PUT(reverse_count, 0, length);
+    }
+
+  /* Reached end of expression, either ')' or end of pattern. Go back through
+  the alternative branches and reverse the chain of offsets, with the field in
+  the BRA item now becoming an offset to the first alternative. If there are
+  no alternatives, it points to the end of the group. The length in the
+  terminating ket is always the length of the whole bracketed item. If any of
+  the ims options were changed inside the group, compile a resetting op-code
+  following, except at the very end of the pattern. Return leaving the pointer
+  at the terminating char. */
+
+  if (*ptr != '|')
+    {
+    int length = code - last_branch;
+    do
+      {
+      int prev_length = GET(last_branch, 1);
+      PUT(last_branch, 1, length);
+      length = prev_length;
+      last_branch -= length;
+      }
+    while (length > 0);
+
+    /* Fill in the ket */
+
+    *code = OP_KET;
+    PUT(code, 1, code - start_bracket);
+    code += 1 + LINK_SIZE;
+
+    /* Resetting option if needed */
+
+    if ((options & PCRE_IMS) != oldims && *ptr == ')')
+      {
+      *code++ = OP_OPT;
+      *code++ = oldims;
+      }
+
+    /* Set values to pass back */
+
+    *codeptr = code;
+    *ptrptr = ptr;
+    *firstbyteptr = firstbyte;
+    *reqbyteptr = reqbyte;
+    return TRUE;
+    }
+
+  /* Another branch follows; insert an "or" node. Its length field points back
+  to the previous branch while the bracket remains open. At the end the chain
+  is reversed. It's done like this so that the start of the bracket has a
+  zero offset until it is closed, making it possible to detect recursion. */
+
+  *code = OP_ALT;
+  PUT(code, 1, code - last_branch);
+  bc.current = last_branch = code;
+  code += 1 + LINK_SIZE;
+  ptr++;
+  }
+/* Control never reaches here */
+}
+
+
+
+
+/*************************************************
+*          Check for anchored expression         *
+*************************************************/
+
+/* Try to find out if this is an anchored regular expression. Consider each
+alternative branch. If they all start with OP_SOD or OP_CIRC, or with a bracket
+all of whose alternatives start with OP_SOD or OP_CIRC (recurse ad lib), then
+it's anchored. However, if this is a multiline pattern, then only OP_SOD
+counts, since OP_CIRC can match in the middle.
+
+We can also consider a regex to be anchored if OP_SOM starts all its branches.
+This is the code for \G, which means "match at start of match position, taking
+into account the match offset".
+
+A branch is also implicitly anchored if it starts with .* and DOTALL is set,
+because that will try the rest of the pattern at all possible matching points,
+so there is no point trying again.... er ....
+
+.... except when the .* appears inside capturing parentheses, and there is a
+subsequent back reference to those parentheses. We haven't enough information
+to catch that case precisely.
+
+At first, the best we could do was to detect when .* was in capturing brackets
+and the highest back reference was greater than or equal to that level.
+However, by keeping a bitmap of the first 31 back references, we can catch some
+of the more common cases more precisely.
+
+Arguments:
+  code           points to start of expression (the bracket)
+  options        points to the options setting
+  bracket_map    a bitmap of which brackets we are inside while testing; this
+                  handles up to substring 31; after that we just have to take
+                  the less precise approach
+  backref_map    the back reference bitmap
+
+Returns:     TRUE or FALSE
+*/
+
+static BOOL
+is_anchored(register const uschar *code, int *options, unsigned int bracket_map,
+  unsigned int backref_map)
+{
+do {
+   const uschar *scode =
+     first_significant_code(code + 1+LINK_SIZE, options, PCRE_MULTILINE, FALSE);
+   register int op = *scode;
+
+   /* Capturing brackets */
+
+   if (op > OP_BRA)
+     {
+     int new_map;
+     op -= OP_BRA;
+     if (op > EXTRACT_BASIC_MAX) op = GET2(scode, 2+LINK_SIZE);
+     new_map = bracket_map | ((op < 32)? (1 << op) : 1);
+     if (!is_anchored(scode, options, new_map, backref_map)) return FALSE;
+     }
+
+   /* Other brackets */
+
+   else if (op == OP_BRA || op == OP_ASSERT || op == OP_ONCE || op == OP_COND)
+     {
+     if (!is_anchored(scode, options, bracket_map, backref_map)) return FALSE;
+     }
+
+   /* .* is not anchored unless DOTALL is set and it isn't in brackets that
+   are or may be referenced. */
+
+   else if ((op == OP_TYPESTAR || op == OP_TYPEMINSTAR) &&
+            (*options & PCRE_DOTALL) != 0)
+     {
+     if (scode[1] != OP_ANY || (bracket_map & backref_map) != 0) return FALSE;
+     }
+
+   /* Check for explicit anchoring */
+
+   else if (op != OP_SOD && op != OP_SOM &&
+           ((*options & PCRE_MULTILINE) != 0 || op != OP_CIRC))
+     return FALSE;
+   code += GET(code, 1);
+   }
+while (*code == OP_ALT);   /* Loop for each alternative */
+return TRUE;
+}
+
+
+
+/*************************************************
+*         Check for starting with ^ or .*        *
+*************************************************/
+
+/* This is called to find out if every branch starts with ^ or .* so that
+"first char" processing can be done to speed things up in multiline
+matching and for non-DOTALL patterns that start with .* (which must start at
+the beginning or after \n). As in the case of is_anchored() (see above), we
+have to take account of back references to capturing brackets that contain .*
+because in that case we can't make the assumption.
+
+Arguments:
+  code           points to start of expression (the bracket)
+  bracket_map    a bitmap of which brackets we are inside while testing; this
+                  handles up to substring 31; after that we just have to take
+                  the less precise approach
+  backref_map    the back reference bitmap
+
+Returns:         TRUE or FALSE
+*/
+
+static BOOL
+is_startline(const uschar *code, unsigned int bracket_map,
+  unsigned int backref_map)
+{
+do {
+   const uschar *scode = first_significant_code(code + 1+LINK_SIZE, NULL, 0,
+     FALSE);
+   register int op = *scode;
+
+   /* Capturing brackets */
+
+   if (op > OP_BRA)
+     {
+     int new_map;
+     op -= OP_BRA;
+     if (op > EXTRACT_BASIC_MAX) op = GET2(scode, 2+LINK_SIZE);
+     new_map = bracket_map | ((op < 32)? (1 << op) : 1);
+     if (!is_startline(scode, new_map, backref_map)) return FALSE;
+     }
+
+   /* Other brackets */
+
+   else if (op == OP_BRA || op == OP_ASSERT || op == OP_ONCE || op == OP_COND)
+     { if (!is_startline(scode, bracket_map, backref_map)) return FALSE; }
+
+   /* .* means "start at start or after \n" if it isn't in brackets that
+   may be referenced. */
+
+   else if (op == OP_TYPESTAR || op == OP_TYPEMINSTAR)
+     {
+     if (scode[1] != OP_ANY || (bracket_map & backref_map) != 0) return FALSE;
+     }
+
+   /* Check for explicit circumflex */
+
+   else if (op != OP_CIRC) return FALSE;
+
+   /* Move on to the next alternative */
+
+   code += GET(code, 1);
+   }
+while (*code == OP_ALT);  /* Loop for each alternative */
+return TRUE;
+}
+
+
+
+/*************************************************
+*       Check for asserted fixed first char      *
+*************************************************/
+
+/* During compilation, the "first char" settings from forward assertions are
+discarded, because they can cause conflicts with actual literals that follow.
+However, if we end up without a first char setting for an unanchored pattern,
+it is worth scanning the regex to see if there is an initial asserted first
+char. If all branches start with the same asserted char, or with a bracket all
+of whose alternatives start with the same asserted char (recurse ad lib), then
+we return that char, otherwise -1.
+
+Arguments:
+  code       points to start of expression (the bracket)
+  options    pointer to the options (used to check casing changes)
+  inassert   TRUE if in an assertion
+
+Returns:     -1 or the fixed first char
+*/
+
+static int
+find_firstassertedchar(const uschar *code, int *options, BOOL inassert)
+{
+register int c = -1;
+do {
+   int d;
+   const uschar *scode =
+     first_significant_code(code + 1+LINK_SIZE, options, PCRE_CASELESS, TRUE);
+   register int op = *scode;
+
+   if (op >= OP_BRA) op = OP_BRA;
+
+   switch(op)
+     {
+     default:
+     return -1;
+
+     case OP_BRA:
+     case OP_ASSERT:
+     case OP_ONCE:
+     case OP_COND:
+     if ((d = find_firstassertedchar(scode, options, op == OP_ASSERT)) < 0)
+       return -1;
+     if (c < 0) c = d; else if (c != d) return -1;
+     break;
+
+     case OP_EXACT:       /* Fall through */
+     scode += 2;
+
+     case OP_CHAR:
+     case OP_CHARNC:
+     case OP_PLUS:
+     case OP_MINPLUS:
+     if (!inassert) return -1;
+     if (c < 0)
+       {
+       c = scode[1];
+       if ((*options & PCRE_CASELESS) != 0) c |= REQ_CASELESS;
+       }
+     else if (c != scode[1]) return -1;
+     break;
+     }
+
+   code += GET(code, 1);
+   }
+while (*code == OP_ALT);
+return c;
+}
+
+
+
+
+#ifdef SUPPORT_UTF8
+/*************************************************
+*         Validate a UTF-8 string                *
+*************************************************/
+
+/* This function is called (optionally) at the start of compile or match, to
+validate that a supposed UTF-8 string is actually valid. The early check means
+that subsequent code can assume it is dealing with a valid string. The check
+can be turned off for maximum performance, but then consequences of supplying
+an invalid string are then undefined.
+
+Arguments:
+  string       points to the string
+  length       length of string, or -1 if the string is zero-terminated
+
+Returns:       < 0    if the string is a valid UTF-8 string
+               >= 0   otherwise; the value is the offset of the bad byte
+*/
+
+static int
+valid_utf8(const uschar *string, int length)
+{
+register const uschar *p;
+
+if (length < 0)
+  {
+  for (p = string; *p != 0; p++);
+  length = p - string;
+  }
+
+for (p = string; length-- > 0; p++)
+  {
+  register int ab;
+  register int c = *p;
+  if (c < 128) continue;
+  if ((c & 0xc0) != 0xc0) return p - string;
+  ab = utf8_table4[c & 0x3f];  /* Number of additional bytes */
+  if (length < ab) return p - string;
+  length -= ab;
+
+  /* Check top bits in the second byte */
+  if ((*(++p) & 0xc0) != 0x80) return p - string;
+
+  /* Check for overlong sequences for each different length */
+  switch (ab)
+    {
+    /* Check for xx00 000x */
+    case 1:
+    if ((c & 0x3e) == 0) return p - string;
+    continue;   /* We know there aren't any more bytes to check */
+
+    /* Check for 1110 0000, xx0x xxxx */
+    case 2:
+    if (c == 0xe0 && (*p & 0x20) == 0) return p - string;
+    break;
+
+    /* Check for 1111 0000, xx00 xxxx */
+    case 3:
+    if (c == 0xf0 && (*p & 0x30) == 0) return p - string;
+    break;
+
+    /* Check for 1111 1000, xx00 0xxx */
+    case 4:
+    if (c == 0xf8 && (*p & 0x38) == 0) return p - string;
+    break;
+
+    /* Check for leading 0xfe or 0xff, and then for 1111 1100, xx00 00xx */
+    case 5:
+    if (c == 0xfe || c == 0xff ||
+       (c == 0xfc && (*p & 0x3c) == 0)) return p - string;
+    break;
+    }
+
+  /* Check for valid bytes after the 2nd, if any; all must start 10 */
+  while (--ab > 0)
+    {
+    if ((*(++p) & 0xc0) != 0x80) return p - string;
+    }
+  }
+
+return -1;
+}
+#endif
+
+
+
+/*************************************************
+*        Compile a Regular Expression            *
+*************************************************/
+
+/* This function takes a string and returns a pointer to a block of store
+holding a compiled version of the expression.
+
+Arguments:
+  pattern      the regular expression
+  options      various option bits
+  errorptr     pointer to pointer to error text
+  erroroffset  ptr offset in pattern where error was detected
+  tables       pointer to character tables or NULL
+
+Returns:       pointer to compiled data block, or NULL on error,
+               with errorptr and erroroffset set
+*/
+
+EXPORT pcre *
+pcre_compile(const char *pattern, int options, const char **errorptr,
+  int *erroroffset, const unsigned char *tables)
+{
+real_pcre *re;
+int length = 1 + LINK_SIZE;      /* For initial BRA plus length */
+/* int runlength; not used L.M. 2004-09-14 */
+int c, firstbyte, reqbyte;
+int bracount = 0;
+int branch_extra = 0;
+int branch_newextra;
+int item_count = -1;
+int name_count = 0;
+int max_name_size = 0;
+int lastitemlength = 0;
+#ifdef SUPPORT_UTF8
+BOOL utf8;
+BOOL class_utf8;
+#endif
+BOOL inescq = FALSE;
+unsigned int brastackptr = 0;
+size_t size;
+uschar *code;
+const uschar *codestart;
+const uschar *ptr;
+compile_data compile_block;
+int brastack[BRASTACK_SIZE];
+uschar bralenstack[BRASTACK_SIZE];
+
+/* We can't pass back an error message if errorptr is NULL; I guess the best we
+can do is just return NULL. */
+
+if (errorptr == NULL) return NULL;
+*errorptr = NULL;
+
+/* However, we can give a message for this error */
+
+if (erroroffset == NULL)
+  {
+  *errorptr = ERR16;
+  return NULL;
+  }
+*erroroffset = 0;
+
+/* Can't support UTF8 unless PCRE has been compiled to include the code. */
+
+#ifdef SUPPORT_UTF8
+utf8 = (options & PCRE_UTF8) != 0;
+if (utf8 && (options & PCRE_NO_UTF8_CHECK) == 0 &&
+     (*erroroffset = valid_utf8((uschar *)pattern, -1)) >= 0)
+  {
+  *errorptr = ERR44;
+  return NULL;
+  }
+#else
+if ((options & PCRE_UTF8) != 0)
+  {
+  *errorptr = ERR32;
+  return NULL;
+  }
+#endif
+
+if ((options & ~PUBLIC_OPTIONS) != 0)
+  {
+  *errorptr = ERR17;
+  return NULL;
+  }
+
+/* Set up pointers to the individual character tables */
+
+if (tables == NULL) tables = pcre_default_tables;
+compile_block.lcc = tables + lcc_offset;
+compile_block.fcc = tables + fcc_offset;
+compile_block.cbits = tables + cbits_offset;
+compile_block.ctypes = tables + ctypes_offset;
+
+/* Maximum back reference and backref bitmap. This is updated for numeric
+references during the first pass, but for named references during the actual
+compile pass. The bitmap records up to 31 back references to help in deciding
+whether (.*) can be treated as anchored or not. */
+
+compile_block.top_backref = 0;
+compile_block.backref_map = 0;
+
+/* Reflect pattern for debugging output */
+
+DPRINTF(("------------------------------------------------------------------\n"));
+DPRINTF(("%s\n", pattern));
+
+/* The first thing to do is to make a pass over the pattern to compute the
+amount of store required to hold the compiled code. This does not have to be
+perfect as long as errors are overestimates. At the same time we can detect any
+flag settings right at the start, and extract them. Make an attempt to correct
+for any counted white space if an "extended" flag setting appears late in the
+pattern. We can't be so clever for #-comments. */
+
+ptr = (const uschar *)(pattern - 1);
+while ((c = *(++ptr)) != 0)
+  {
+  int min, max;
+  int class_optcount;
+  int bracket_length;
+  int duplength;
+
+  /* If we are inside a \Q...\E sequence, all chars are literal */
+
+  if (inescq)
+    {
+    if ((options & PCRE_AUTO_CALLOUT) != 0) length += 2 + 2*LINK_SIZE;
+    goto NORMAL_CHAR;
+    }
+
+  /* Otherwise, first check for ignored whitespace and comments */
+
+  if ((options & PCRE_EXTENDED) != 0)
+    {
+    if ((compile_block.ctypes[c] & ctype_space) != 0) continue;
+    if (c == '#')
+      {
+      /* The space before the ; is to avoid a warning on a silly compiler
+      on the Macintosh. */
+      while ((c = *(++ptr)) != 0 && c != NEWLINE) ;
+      if (c == 0) break;
+      continue;
+      }
+    }
+
+  item_count++;    /* Is zero for the first non-comment item */
+
+  /* Allow space for auto callout before every item except quantifiers. */
+
+  if ((options & PCRE_AUTO_CALLOUT) != 0 &&
+       c != '*' && c != '+' && c != '?' &&
+       (c != '{' || !is_counted_repeat(ptr + 1)))
+    length += 2 + 2*LINK_SIZE;
+
+  switch(c)
+    {
+    /* A backslashed item may be an escaped data character or it may be a
+    character type. */
+
+    case '\\':
+    c = check_escape(&ptr, errorptr, bracount, options, FALSE);
+    if (*errorptr != NULL) goto PCRE_ERROR_RETURN;
+
+    lastitemlength = 1;     /* Default length of last item for repeats */
+
+    if (c >= 0)             /* Data character */
+      {
+      length += 2;          /* For a one-byte character */
+
+#ifdef SUPPORT_UTF8
+      if (utf8 && c > 127)
+        {
+        int i;
+        for (i = 0; i < sizeof(utf8_table1)/sizeof(int); i++)
+          if (c <= utf8_table1[i]) break;
+        length += i;
+        lastitemlength += i;
+        }
+#endif
+
+      continue;
+      }
+
+    /* If \Q, enter "literal" mode */
+
+    if (-c == ESC_Q)
+      {
+      inescq = TRUE;
+      continue;
+      }
+
+    /* \X is supported only if Unicode property support is compiled */
+
+#ifndef SUPPORT_UCP
+    if (-c == ESC_X)
+      {
+      *errorptr = ERR45;
+      goto PCRE_ERROR_RETURN;
+      }
+#endif
+
+    /* \P and \p are for Unicode properties, but only when the support has
+    been compiled. Each item needs 2 bytes. */
+
+    else if (-c == ESC_P || -c == ESC_p)
+      {
+#ifdef SUPPORT_UCP
+      BOOL negated;
+      length += 2;
+      lastitemlength = 2;
+      if (get_ucp(&ptr, &negated, errorptr) < 0) goto PCRE_ERROR_RETURN;
+      continue;
+#else
+      *errorptr = ERR45;
+      goto PCRE_ERROR_RETURN;
+#endif
+      }
+
+    /* Other escapes need one byte */
+
+    length++;
+
+    /* A back reference needs an additional 2 bytes, plus either one or 5
+    bytes for a repeat. We also need to keep the value of the highest
+    back reference. */
+
+    if (c <= -ESC_REF)
+      {
+      int refnum = -c - ESC_REF;
+      compile_block.backref_map |= (refnum < 32)? (1 << refnum) : 1;
+      if (refnum > compile_block.top_backref)
+        compile_block.top_backref = refnum;
+      length += 2;   /* For single back reference */
+      if (ptr[1] == '{' && is_counted_repeat(ptr+2))
+        {
+        ptr = read_repeat_counts(ptr+2, &min, &max, errorptr);
+        if (*errorptr != NULL) goto PCRE_ERROR_RETURN;
+        if ((min == 0 && (max == 1 || max == -1)) ||
+          (min == 1 && max == -1))
+            length++;
+        else length += 5;
+        if (ptr[1] == '?') ptr++;
+        }
+      }
+    continue;
+
+    case '^':     /* Single-byte metacharacters */
+    case '.':
+    case '$':
+    length++;
+    lastitemlength = 1;
+    continue;
+
+    case '*':            /* These repeats won't be after brackets; */
+    case '+':            /* those are handled separately */
+    case '?':
+    length++;
+    goto POSESSIVE;      /* A few lines below */
+
+    /* This covers the cases of braced repeats after a single char, metachar,
+    class, or back reference. */
+
+    case '{':
+    if (!is_counted_repeat(ptr+1)) goto NORMAL_CHAR;
+    ptr = read_repeat_counts(ptr+1, &min, &max, errorptr);
+    if (*errorptr != NULL) goto PCRE_ERROR_RETURN;
+
+    /* These special cases just insert one extra opcode */
+
+    if ((min == 0 && (max == 1 || max == -1)) ||
+      (min == 1 && max == -1))
+        length++;
+
+    /* These cases might insert additional copies of a preceding character. */
+
+    else
+      {
+      if (min != 1)
+        {
+        length -= lastitemlength;   /* Uncount the original char or metachar */
+        if (min > 0) length += 3 + lastitemlength;
+        }
+      length += lastitemlength + ((max > 0)? 3 : 1);
+      }
+
+    if (ptr[1] == '?') ptr++;      /* Needs no extra length */
+
+    POSESSIVE:                     /* Test for possessive quantifier */
+    if (ptr[1] == '+')
+      {
+      ptr++;
+      length += 2 + 2*LINK_SIZE;   /* Allow for atomic brackets */
+      }
+    continue;
+
+    /* An alternation contains an offset to the next branch or ket. If any ims
+    options changed in the previous branch(es), and/or if we are in a
+    lookbehind assertion, extra space will be needed at the start of the
+    branch. This is handled by branch_extra. */
+
+    case '|':
+    length += 1 + LINK_SIZE + branch_extra;
+    continue;
+
+    /* A character class uses 33 characters provided that all the character
+    values are less than 256. Otherwise, it uses a bit map for low valued
+    characters, and individual items for others. Don't worry about character
+    types that aren't allowed in classes - they'll get picked up during the
+    compile. A character class that contains only one single-byte character
+    uses 2 or 3 bytes, depending on whether it is negated or not. Notice this
+    where we can. (In UTF-8 mode we can do this only for chars < 128.) */
+
+    case '[':
+    if (*(++ptr) == '^')
+      {
+      class_optcount = 10;  /* Greater than one */
+      ptr++;
+      }
+    else class_optcount = 0;
+
+#ifdef SUPPORT_UTF8
+    class_utf8 = FALSE;
+#endif
+
+    /* Written as a "do" so that an initial ']' is taken as data */
+
+    if (*ptr != 0) do
+      {
+      /* Inside \Q...\E everything is literal except \E */
+
+      if (inescq)
+        {
+        if (*ptr != '\\' || ptr[1] != 'E') goto GET_ONE_CHARACTER;
+        inescq = FALSE;
+        ptr += 1;
+        continue;
+        }
+
+      /* Outside \Q...\E, check for escapes */
+
+      if (*ptr == '\\')
+        {
+        c = check_escape(&ptr, errorptr, bracount, options, TRUE);
+        if (*errorptr != NULL) goto PCRE_ERROR_RETURN;
+
+        /* \b is backspace inside a class; \X is literal */
+
+        if (-c == ESC_b) c = '\b';
+        else if (-c == ESC_X) c = 'X';
+
+        /* \Q enters quoting mode */
+
+        else if (-c == ESC_Q)
+          {
+          inescq = TRUE;
+          continue;
+          }
+
+        /* Handle escapes that turn into characters */
+
+        if (c >= 0) goto NON_SPECIAL_CHARACTER;
+
+        /* Escapes that are meta-things. The normal ones just affect the
+        bit map, but Unicode properties require an XCLASS extended item. */
+
+        else
+          {
+          class_optcount = 10;         /* \d, \s etc; make sure > 1 */
+#ifdef SUPPORT_UTF8
+          if (-c == ESC_p || -c == ESC_P)
+            {
+            if (!class_utf8)
+              {
+              class_utf8 = TRUE;
+              length += LINK_SIZE + 2;
+              }
+            length += 2;
+            }
+#endif
+          }
+        }
+
+      /* Check the syntax for POSIX stuff. The bits we actually handle are
+      checked during the real compile phase. */
+
+      else if (*ptr == '[' && check_posix_syntax(ptr, &ptr, &compile_block))
+        {
+        ptr++;
+        class_optcount = 10;    /* Make sure > 1 */
+        }
+
+      /* Anything else increments the possible optimization count. We have to
+      detect ranges here so that we can compute the number of extra ranges for
+      caseless wide characters when UCP support is available. If there are wide
+      characters, we are going to have to use an XCLASS, even for single
+      characters. */
+
+      else
+        {
+        int d;
+
+        GET_ONE_CHARACTER:
+
+#ifdef SUPPORT_UTF8
+        if (utf8)
+          {
+          int extra = 0;
+          GETCHARLEN(c, ptr, extra);
+          ptr += extra;
+          }
+        else c = *ptr;
+#else
+        c = *ptr;
+#endif
+
+        /* Come here from handling \ above when it escapes to a char value */
+
+        NON_SPECIAL_CHARACTER:
+        class_optcount++;
+
+        d = -1;
+        if (ptr[1] == '-')
+          {
+          uschar const *hyptr = ptr++;
+          if (ptr[1] == '\\')
+            {
+            ptr++;
+            d = check_escape(&ptr, errorptr, bracount, options, TRUE);
+            if (*errorptr != NULL) goto PCRE_ERROR_RETURN;
+            if (-d == ESC_b) d = '\b';        /* backspace */
+            else if (-d == ESC_X) d = 'X';    /* literal X in a class */
+            }
+          else if (ptr[1] != 0 && ptr[1] != ']')
+            {
+            ptr++;
+#ifdef SUPPORT_UTF8
+            if (utf8)
+              {
+              int extra = 0;
+              GETCHARLEN(d, ptr, extra);
+              ptr += extra;
+              }
+            else
+#endif
+            d = *ptr;
+            }
+          if (d < 0) ptr = hyptr;      /* go back to hyphen as data */
+          }
+
+        /* If d >= 0 we have a range. In UTF-8 mode, if the end is > 255, or >
+        127 for caseless matching, we will need to use an XCLASS. */
+
+        if (d >= 0)
+          {
+          class_optcount = 10;     /* Ensure > 1 */
+          if (d < c)
+            {
+            *errorptr = ERR8;
+            goto PCRE_ERROR_RETURN;
+            }
+
+#ifdef SUPPORT_UTF8
+          if (utf8 && (d > 255 || ((options & PCRE_CASELESS) != 0 && d > 127)))
+            {
+            uschar buffer[6];
+            if (!class_utf8)         /* Allow for XCLASS overhead */
+              {
+              class_utf8 = TRUE;
+              length += LINK_SIZE + 2;
+              }
+
+#ifdef SUPPORT_UCP
+            /* If we have UCP support, find out how many extra ranges are
+            needed to map the other case of characters within this range. We
+            have to mimic the range optimization here, because extending the
+            range upwards might push d over a boundary that makes is use
+            another byte in the UTF-8 representation. */
+
+            if ((options & PCRE_CASELESS) != 0)
+              {
+              int occ, ocd;
+              int cc = c;
+              int origd = d;
+              while (get_othercase_range(&cc, origd, &occ, &ocd))
+                {
+                if (occ >= c && ocd <= d) continue;   /* Skip embedded */
+
+                if (occ < c  && ocd >= c - 1)  /* Extend the basic range */
+                  {                            /* if there is overlap,   */
+                  c = occ;                     /* noting that if occ < c */
+                  continue;                    /* we can't have ocd > d  */
+                  }                            /* because a subrange is  */
+                if (ocd > d && occ <= d + 1)   /* always shorter than    */
+                  {                            /* the basic range.       */
+                  d = ocd;
+                  continue;
+                  }
+
+                /* An extra item is needed */
+
+                length += 1 + ord2utf8(occ, buffer) +
+                  ((occ == ocd)? 0 : ord2utf8(ocd, buffer));
+                }
+              }
+#endif  /* SUPPORT_UCP */
+
+            /* The length of the (possibly extended) range */
+
+            length += 1 + ord2utf8(c, buffer) + ord2utf8(d, buffer);
+            }
+#endif  /* SUPPORT_UTF8 */
+
+          }
+
+        /* We have a single character. There is nothing to be done unless we
+        are in UTF-8 mode. If the char is > 255, or 127 when caseless, we must
+        allow for an XCL_SINGLE item, doubled for caselessness if there is UCP
+        support. */
+
+        else
+          {
+#ifdef SUPPORT_UTF8
+          if (utf8 && (c > 255 || ((options & PCRE_CASELESS) != 0 && c > 127)))
+            {
+            uschar buffer[6];
+            class_optcount = 10;     /* Ensure > 1 */
+            if (!class_utf8)         /* Allow for XCLASS overhead */
+              {
+              class_utf8 = TRUE;
+              length += LINK_SIZE + 2;
+              }
+#ifdef SUPPORT_UCP
+            length += (((options & PCRE_CASELESS) != 0)? 2 : 1) *
+              (1 + ord2utf8(c, buffer));
+#else   /* SUPPORT_UCP */
+            length += 1 + ord2utf8(c, buffer);
+#endif  /* SUPPORT_UCP */
+            }
+#endif  /* SUPPORT_UTF8 */
+          }
+        }
+      }
+    while (*(++ptr) != 0 && (inescq || *ptr != ']')); /* Concludes "do" above */
+
+    if (*ptr == 0)                          /* Missing terminating ']' */
+      {
+      *errorptr = ERR6;
+      goto PCRE_ERROR_RETURN;
+      }
+
+    /* We can optimize when there was only one optimizable character. Repeats
+    for positive and negated single one-byte chars are handled by the general
+    code. Here, we handle repeats for the class opcodes. */
+
+    if (class_optcount == 1) length += 3; else
+      {
+      length += 33;
+
+      /* A repeat needs either 1 or 5 bytes. If it is a possessive quantifier,
+      we also need extra for wrapping the whole thing in a sub-pattern. */
+
+      if (*ptr != 0 && ptr[1] == '{' && is_counted_repeat(ptr+2))
+        {
+        ptr = read_repeat_counts(ptr+2, &min, &max, errorptr);
+        if (*errorptr != NULL) goto PCRE_ERROR_RETURN;
+        if ((min == 0 && (max == 1 || max == -1)) ||
+          (min == 1 && max == -1))
+            length++;
+        else length += 5;
+        if (ptr[1] == '+')
+          {
+          ptr++;
+          length += 2 + 2*LINK_SIZE;
+          }
+        else if (ptr[1] == '?') ptr++;
+        }
+      }
+    continue;
+
+    /* Brackets may be genuine groups or special things */
+
+    case '(':
+    branch_newextra = 0;
+    bracket_length = 1 + LINK_SIZE;
+
+    /* Handle special forms of bracket, which all start (? */
+
+    if (ptr[1] == '?')
+      {
+      int set, unset;
+      int *optset;
+
+      switch (c = ptr[2])
+        {
+        /* Skip over comments entirely */
+        case '#':
+        ptr += 3;
+        while (*ptr != 0 && *ptr != ')') ptr++;
+        if (*ptr == 0)
+          {
+          *errorptr = ERR18;
+          goto PCRE_ERROR_RETURN;
+          }
+        continue;
+
+        /* Non-referencing groups and lookaheads just move the pointer on, and
+        then behave like a non-special bracket, except that they don't increment
+        the count of extracting brackets. Ditto for the "once only" bracket,
+        which is in Perl from version 5.005. */
+
+        case ':':
+        case '=':
+        case '!':
+        case '>':
+        ptr += 2;
+        break;
+
+        /* (?R) specifies a recursive call to the regex, which is an extension
+        to provide the facility which can be obtained by (?p{perl-code}) in
+        Perl 5.6. In Perl 5.8 this has become (??{perl-code}).
+
+        From PCRE 4.00, items such as (?3) specify subroutine-like "calls" to
+        the appropriate numbered brackets. This includes both recursive and
+        non-recursive calls. (?R) is now synonymous with (?0). */
+
+        case 'R':
+        ptr++;
+
+        case '0': case '1': case '2': case '3': case '4':
+        case '5': case '6': case '7': case '8': case '9':
+        ptr += 2;
+        if (c != 'R')
+          while ((digitab[*(++ptr)] & ctype_digit) != 0);
+        if (*ptr != ')')
+          {
+          *errorptr = ERR29;
+          goto PCRE_ERROR_RETURN;
+          }
+        length += 1 + LINK_SIZE;
+
+        /* If this item is quantified, it will get wrapped inside brackets so
+        as to use the code for quantified brackets. We jump down and use the
+        code that handles this for real brackets. */
+
+        if (ptr[1] == '+' || ptr[1] == '*' || ptr[1] == '?' || ptr[1] == '{')
+          {
+          length += 2 + 2 * LINK_SIZE;       /* to make bracketed */
+          duplength = 5 + 3 * LINK_SIZE;
+          goto HANDLE_QUANTIFIED_BRACKETS;
+          }
+        continue;
+
+        /* (?C) is an extension which provides "callout" - to provide a bit of
+        the functionality of the Perl (?{...}) feature. An optional number may
+        follow (default is zero). */
+
+        case 'C':
+        ptr += 2;
+        while ((digitab[*(++ptr)] & ctype_digit) != 0);
+        if (*ptr != ')')
+          {
+          *errorptr = ERR39;
+          goto PCRE_ERROR_RETURN;
+          }
+        length += 2 + 2*LINK_SIZE;
+        continue;
+
+        /* Named subpatterns are an extension copied from Python */
+
+        case 'P':
+        ptr += 3;
+        if (*ptr == '<')
+          {
+          const uschar *p;    /* Don't amalgamate; some compilers */
+          p = ++ptr;          /* grumble at autoincrement in declaration */
+          while ((compile_block.ctypes[*ptr] & ctype_word) != 0) ptr++;
+          if (*ptr != '>')
+            {
+            *errorptr = ERR42;
+            goto PCRE_ERROR_RETURN;
+            }
+          name_count++;
+          if (ptr - p > max_name_size) max_name_size = (ptr - p);
+          break;
+          }
+
+        if (*ptr == '=' || *ptr == '>')
+          {
+          while ((compile_block.ctypes[*(++ptr)] & ctype_word) != 0);
+          if (*ptr != ')')
+            {
+            *errorptr = ERR42;
+            goto PCRE_ERROR_RETURN;
+            }
+          break;
+          }
+
+        /* Unknown character after (?P */
+
+        *errorptr = ERR41;
+        goto PCRE_ERROR_RETURN;
+
+        /* Lookbehinds are in Perl from version 5.005 */
+
+        case '<':
+        ptr += 3;
+        if (*ptr == '=' || *ptr == '!')
+          {
+          branch_newextra = 1 + LINK_SIZE;
+          length += 1 + LINK_SIZE;         /* For the first branch */
+          break;
+          }
+        *errorptr = ERR24;
+        goto PCRE_ERROR_RETURN;
+
+        /* Conditionals are in Perl from version 5.005. The bracket must either
+        be followed by a number (for bracket reference) or by an assertion
+        group, or (a PCRE extension) by 'R' for a recursion test. */
+
+        case '(':
+        if (ptr[3] == 'R' && ptr[4] == ')')
+          {
+          ptr += 4;
+          length += 3;
+          }
+        else if ((digitab[ptr[3]] & ctype_digit) != 0)
+          {
+          ptr += 4;
+          length += 3;
+          while ((digitab[*ptr] & ctype_digit) != 0) ptr++;
+          if (*ptr != ')')
+            {
+            *errorptr = ERR26;
+            goto PCRE_ERROR_RETURN;
+            }
+          }
+        else   /* An assertion must follow */
+          {
+          ptr++;   /* Can treat like ':' as far as spacing is concerned */
+          if (ptr[2] != '?' ||
+             (ptr[3] != '=' && ptr[3] != '!' && ptr[3] != '<') )
+            {
+            ptr += 2;    /* To get right offset in message */
+            *errorptr = ERR28;
+            goto PCRE_ERROR_RETURN;
+            }
+          }
+        break;
+
+        /* Else loop checking valid options until ) is met. Anything else is an
+        error. If we are without any brackets, i.e. at top level, the settings
+        act as if specified in the options, so massage the options immediately.
+        This is for backward compatibility with Perl 5.004. */
+
+        default:
+        set = unset = 0;
+        optset = &set;
+        ptr += 2;
+
+        for (;; ptr++)
+          {
+          c = *ptr;
+          switch (c)
+            {
+            case 'i':
+            *optset |= PCRE_CASELESS;
+            continue;
+
+            case 'm':
+            *optset |= PCRE_MULTILINE;
+            continue;
+
+            case 's':
+            *optset |= PCRE_DOTALL;
+            continue;
+
+            case 'x':
+            *optset |= PCRE_EXTENDED;
+            continue;
+
+            case 'X':
+            *optset |= PCRE_EXTRA;
+            continue;
+
+            case 'U':
+            *optset |= PCRE_UNGREEDY;
+            continue;
+
+            case '-':
+            optset = &unset;
+            continue;
+
+            /* A termination by ')' indicates an options-setting-only item; if
+            this is at the very start of the pattern (indicated by item_count
+            being zero), we use it to set the global options. This is helpful
+            when analyzing the pattern for first characters, etc. Otherwise
+            nothing is done here and it is handled during the compiling
+            process.
+
+            [Historical note: Up to Perl 5.8, options settings at top level
+            were always global settings, wherever they appeared in the pattern.
+            That is, they were equivalent to an external setting. From 5.8
+            onwards, they apply only to what follows (which is what you might
+            expect).] */
+
+            case ')':
+            if (item_count == 0)
+              {
+              options = (options | set) & (~unset);
+              set = unset = 0;     /* To save length */
+              item_count--;        /* To allow for several */
+              }
+
+            /* Fall through */
+
+            /* A termination by ':' indicates the start of a nested group with
+            the given options set. This is again handled at compile time, but
+            we must allow for compiled space if any of the ims options are
+            set. We also have to allow for resetting space at the end of
+            the group, which is why 4 is added to the length and not just 2.
+            If there are several changes of options within the same group, this
+            will lead to an over-estimate on the length, but this shouldn't
+            matter very much. We also have to allow for resetting options at
+            the start of any alternations, which we do by setting
+            branch_newextra to 2. Finally, we record whether the case-dependent
+            flag ever changes within the regex. This is used by the "required
+            character" code. */
+
+            case ':':
+            if (((set|unset) & PCRE_IMS) != 0)
+              {
+              length += 4;
+              branch_newextra = 2;
+              if (((set|unset) & PCRE_CASELESS) != 0) options |= PCRE_ICHANGED;
+              }
+            goto END_OPTIONS;
+
+            /* Unrecognized option character */
+
+            default:
+            *errorptr = ERR12;
+            goto PCRE_ERROR_RETURN;
+            }
+          }
+
+        /* If we hit a closing bracket, that's it - this is a freestanding
+        option-setting. We need to ensure that branch_extra is updated if
+        necessary. The only values branch_newextra can have here are 0 or 2.
+        If the value is 2, then branch_extra must either be 2 or 5, depending
+        on whether this is a lookbehind group or not. */
+
+        END_OPTIONS:
+        if (c == ')')
+          {
+          if (branch_newextra == 2 &&
+              (branch_extra == 0 || branch_extra == 1+LINK_SIZE))
+            branch_extra += branch_newextra;
+          continue;
+          }
+
+        /* If options were terminated by ':' control comes here. Fall through
+        to handle the group below. */
+        }
+      }
+
+    /* Extracting brackets must be counted so we can process escapes in a
+    Perlish way. If the number exceeds EXTRACT_BASIC_MAX we are going to
+    need an additional 3 bytes of store per extracting bracket. However, if
+    PCRE_NO_AUTO)CAPTURE is set, unadorned brackets become non-capturing, so we
+    must leave the count alone (it will aways be zero). */
+
+    else if ((options & PCRE_NO_AUTO_CAPTURE) == 0)
+      {
+      bracount++;
+      if (bracount > EXTRACT_BASIC_MAX) bracket_length += 3;
+      }
+
+    /* Save length for computing whole length at end if there's a repeat that
+    requires duplication of the group. Also save the current value of
+    branch_extra, and start the new group with the new value. If non-zero, this
+    will either be 2 for a (?imsx: group, or 3 for a lookbehind assertion. */
+
+    if (brastackptr >= sizeof(brastack)/sizeof(int))
+      {
+      *errorptr = ERR19;
+      goto PCRE_ERROR_RETURN;
+      }
+
+    bralenstack[brastackptr] = branch_extra;
+    branch_extra = branch_newextra;
+
+    brastack[brastackptr++] = length;
+    length += bracket_length;
+    continue;
+
+    /* Handle ket. Look for subsequent max/min; for certain sets of values we
+    have to replicate this bracket up to that many times. If brastackptr is
+    0 this is an unmatched bracket which will generate an error, but take care
+    not to try to access brastack[-1] when computing the length and restoring
+    the branch_extra value. */
+
+    case ')':
+    length += 1 + LINK_SIZE;
+    if (brastackptr > 0)
+      {
+      duplength = length - brastack[--brastackptr];
+      branch_extra = bralenstack[brastackptr];
+      }
+    else duplength = 0;
+
+    /* The following code is also used when a recursion such as (?3) is
+    followed by a quantifier, because in that case, it has to be wrapped inside
+    brackets so that the quantifier works. The value of duplength must be
+    set before arrival. */
+
+    HANDLE_QUANTIFIED_BRACKETS:
+
+    /* Leave ptr at the final char; for read_repeat_counts this happens
+    automatically; for the others we need an increment. */
+
+    if ((c = ptr[1]) == '{' && is_counted_repeat(ptr+2))
+      {
+      ptr = read_repeat_counts(ptr+2, &min, &max, errorptr);
+      if (*errorptr != NULL) goto PCRE_ERROR_RETURN;
+      }
+    else if (c == '*') { min = 0; max = -1; ptr++; }
+    else if (c == '+') { min = 1; max = -1; ptr++; }
+    else if (c == '?') { min = 0; max = 1;  ptr++; }
+    else { min = 1; max = 1; }
+
+    /* If the minimum is zero, we have to allow for an OP_BRAZERO before the
+    group, and if the maximum is greater than zero, we have to replicate
+    maxval-1 times; each replication acquires an OP_BRAZERO plus a nesting
+    bracket set. */
+
+    if (min == 0)
+      {
+      length++;
+      if (max > 0) length += (max - 1) * (duplength + 3 + 2*LINK_SIZE);
+      }
+
+    /* When the minimum is greater than zero, we have to replicate up to
+    minval-1 times, with no additions required in the copies. Then, if there
+    is a limited maximum we have to replicate up to maxval-1 times allowing
+    for a BRAZERO item before each optional copy and nesting brackets for all
+    but one of the optional copies. */
+
+    else
+      {
+      length += (min - 1) * duplength;
+      if (max > min)   /* Need this test as max=-1 means no limit */
+        length += (max - min) * (duplength + 3 + 2*LINK_SIZE)
+          - (2 + 2*LINK_SIZE);
+      }
+
+    /* Allow space for once brackets for "possessive quantifier" */
+
+    if (ptr[1] == '+')
+      {
+      ptr++;
+      length += 2 + 2*LINK_SIZE;
+      }
+    continue;
+
+    /* Non-special character. It won't be space or # in extended mode, so it is
+    always a genuine character. If we are in a \Q...\E sequence, check for the
+    end; if not, we have a literal. */
+
+    default:
+    NORMAL_CHAR:
+
+    if (inescq && c == '\\' && ptr[1] == 'E')
+      {
+      inescq = FALSE;
+      ptr++;
+      continue;
+      }
+
+    length += 2;          /* For a one-byte character */
+    lastitemlength = 1;   /* Default length of last item for repeats */
+
+    /* In UTF-8 mode, check for additional bytes. */
+
+#ifdef SUPPORT_UTF8
+    if (utf8 && (c & 0xc0) == 0xc0)
+      {
+      while ((ptr[1] & 0xc0) == 0x80)         /* Can't flow over the end */
+        {                                     /* because the end is marked */
+        lastitemlength++;                     /* by a zero byte. */
+        length++;
+        ptr++;
+        }
+      }
+#endif
+
+    continue;
+    }
+  }
+
+length += 2 + LINK_SIZE;    /* For final KET and END */
+
+if ((options & PCRE_AUTO_CALLOUT) != 0)
+  length += 2 + 2*LINK_SIZE;  /* For final callout */
+
+if (length > MAX_PATTERN_SIZE)
+  {
+  *errorptr = ERR20;
+  return NULL;
+  }
+
+/* Compute the size of data block needed and get it, either from malloc or
+externally provided function. */
+
+size = length + sizeof(real_pcre) + name_count * (max_name_size + 3);
+re = (real_pcre *)(pcre_malloc)(size);
+
+if (re == NULL)
+  {
+  *errorptr = ERR21;
+  return NULL;
+  }
+
+/* Put in the magic number, and save the sizes, options, and character table
+pointer. NULL is used for the default character tables. The nullpad field is at
+the end; it's there to help in the case when a regex compiled on a system with
+4-byte pointers is run on another with 8-byte pointers. */
+
+re->magic_number = MAGIC_NUMBER;
+re->size = size;
+re->options = options;
+re->dummy1 = re->dummy2 = 0;
+re->name_table_offset = sizeof(real_pcre);
+re->name_entry_size = max_name_size + 3;
+re->name_count = name_count;
+re->tables = (tables == pcre_default_tables)? NULL : tables;
+re->nullpad = NULL;
+
+/* The starting points of the name/number translation table and of the code are
+passed around in the compile data block. */
+
+compile_block.names_found = 0;
+compile_block.name_entry_size = max_name_size + 3;
+compile_block.name_table = (uschar *)re + re->name_table_offset;
+codestart = compile_block.name_table + re->name_entry_size * re->name_count;
+compile_block.start_code = codestart;
+compile_block.start_pattern = (const uschar *)pattern;
+compile_block.req_varyopt = 0;
+compile_block.nopartial = FALSE;
+
+/* Set up a starting, non-extracting bracket, then compile the expression. On
+error, *errorptr will be set non-NULL, so we don't need to look at the result
+of the function here. */
+
+ptr = (const uschar *)pattern;
+code = (uschar *)codestart;
+*code = OP_BRA;
+bracount = 0;
+(void)compile_regex(options, options & PCRE_IMS, &bracount, &code, &ptr,
+  errorptr, FALSE, 0, &firstbyte, &reqbyte, NULL, &compile_block);
+re->top_bracket = bracount;
+re->top_backref = compile_block.top_backref;
+
+if (compile_block.nopartial) re->options |= PCRE_NOPARTIAL;
+
+/* If not reached end of pattern on success, there's an excess bracket. */
+
+if (*errorptr == NULL && *ptr != 0) *errorptr = ERR22;
+
+/* Fill in the terminating state and check for disastrous overflow, but
+if debugging, leave the test till after things are printed out. */
+
+*code++ = OP_END;
+
+#ifndef DEBUG
+if (code - codestart > length) *errorptr = ERR23;
+#endif
+
+/* Give an error if there's back reference to a non-existent capturing
+subpattern. */
+
+if (re->top_backref > re->top_bracket) *errorptr = ERR15;
+
+/* Failed to compile, or error while post-processing */
+
+if (*errorptr != NULL)
+  {
+  (pcre_free)(re);
+  PCRE_ERROR_RETURN:
+  *erroroffset = ptr - (const uschar *)pattern;
+  return NULL;
+  }
+
+/* If the anchored option was not passed, set the flag if we can determine that
+the pattern is anchored by virtue of ^ characters or \A or anything else (such
+as starting with .* when DOTALL is set).
+
+Otherwise, if we know what the first character has to be, save it, because that
+speeds up unanchored matches no end. If not, see if we can set the
+PCRE_STARTLINE flag. This is helpful for multiline matches when all branches
+start with ^. and also when all branches start with .* for non-DOTALL matches.
+*/
+
+if ((options & PCRE_ANCHORED) == 0)
+  {
+  int temp_options = options;
+  if (is_anchored(codestart, &temp_options, 0, compile_block.backref_map))
+    re->options |= PCRE_ANCHORED;
+  else
+    {
+    if (firstbyte < 0)
+      firstbyte = find_firstassertedchar(codestart, &temp_options, FALSE);
+    if (firstbyte >= 0)   /* Remove caseless flag for non-caseable chars */
+      {
+      int ch = firstbyte & 255;
+      re->first_byte = ((firstbyte & REQ_CASELESS) != 0 &&
+         compile_block.fcc[ch] == ch)? ch : firstbyte;
+      re->options |= PCRE_FIRSTSET;
+      }
+    else if (is_startline(codestart, 0, compile_block.backref_map))
+      re->options |= PCRE_STARTLINE;
+    }
+  }
+
+/* For an anchored pattern, we use the "required byte" only if it follows a
+variable length item in the regex. Remove the caseless flag for non-caseable
+bytes. */
+
+if (reqbyte >= 0 &&
+     ((re->options & PCRE_ANCHORED) == 0 || (reqbyte & REQ_VARY) != 0))
+  {
+  int ch = reqbyte & 255;
+  re->req_byte = ((reqbyte & REQ_CASELESS) != 0 &&
+    compile_block.fcc[ch] == ch)? (reqbyte & ~REQ_CASELESS) : reqbyte;
+  re->options |= PCRE_REQCHSET;
+  }
+
+/* Print out the compiled data for debugging */
+
+#ifdef DEBUG
+
+printf("Length = %d top_bracket = %d top_backref = %d\n",
+  length, re->top_bracket, re->top_backref);
+
+if (re->options != 0)
+  {
+  printf("%s%s%s%s%s%s%s%s%s%s\n",
+    ((re->options & PCRE_NOPARTIAL) != 0)? "nopartial " : "",
+    ((re->options & PCRE_ANCHORED) != 0)? "anchored " : "",
+    ((re->options & PCRE_CASELESS) != 0)? "caseless " : "",
+    ((re->options & PCRE_ICHANGED) != 0)? "case state changed " : "",
+    ((re->options & PCRE_EXTENDED) != 0)? "extended " : "",
+    ((re->options & PCRE_MULTILINE) != 0)? "multiline " : "",
+    ((re->options & PCRE_DOTALL) != 0)? "dotall " : "",
+    ((re->options & PCRE_DOLLAR_ENDONLY) != 0)? "endonly " : "",
+    ((re->options & PCRE_EXTRA) != 0)? "extra " : "",
+    ((re->options & PCRE_UNGREEDY) != 0)? "ungreedy " : "");
+  }
+
+if ((re->options & PCRE_FIRSTSET) != 0)
+  {
+  int ch = re->first_byte & 255;
+  const char *caseless = ((re->first_byte & REQ_CASELESS) == 0)? "" : " (caseless)";
+  if (isprint(ch)) printf("First char = %c%s\n", ch, caseless);
+    else printf("First char = \\x%02x%s\n", ch, caseless);
+  }
+
+if ((re->options & PCRE_REQCHSET) != 0)
+  {
+  int ch = re->req_byte & 255;
+  const char *caseless = ((re->req_byte & REQ_CASELESS) == 0)? "" : " (caseless)";
+  if (isprint(ch)) printf("Req char = %c%s\n", ch, caseless);
+    else printf("Req char = \\x%02x%s\n", ch, caseless);
+  }
+
+print_internals(re, stdout);
+
+/* This check is done here in the debugging case so that the code that
+was compiled can be seen. */
+
+if (code - codestart > length)
+  {
+  *errorptr = ERR23;
+  (pcre_free)(re);
+  *erroroffset = ptr - (uschar *)pattern;
+  return NULL;
+  }
+#endif
+
+return (pcre *)re;
+}
+
+
+
+/*************************************************
+*          Match a back-reference                *
+*************************************************/
+
+/* If a back reference hasn't been set, the length that is passed is greater
+than the number of characters left in the string, so the match fails.
+
+Arguments:
+  offset      index into the offset vector
+  eptr        points into the subject
+  length      length to be matched
+  md          points to match data block
+  ims         the ims flags
+
+Returns:      TRUE if matched
+*/
+
+static BOOL
+match_ref(int offset, register const uschar *eptr, int length, match_data *md,
+  unsigned long int ims)
+{
+const uschar *p = md->start_subject + md->offset_vector[offset];
+
+#ifdef DEBUG
+if (eptr >= md->end_subject)
+  printf("matching subject <null>");
+else
+  {
+  printf("matching subject ");
+  pchars(eptr, length, TRUE, md);
+  }
+printf(" against backref ");
+pchars(p, length, FALSE, md);
+printf("\n");
+#endif
+
+/* Always fail if not enough characters left */
+
+if (length > md->end_subject - eptr) return FALSE;
+
+/* Separate the caselesss case for speed */
+
+if ((ims & PCRE_CASELESS) != 0)
+  {
+  while (length-- > 0)
+    if (md->lcc[*p++] != md->lcc[*eptr++]) return FALSE;
+  }
+else
+  { while (length-- > 0) if (*p++ != *eptr++) return FALSE; }
+
+return TRUE;
+}
+
+
+#ifdef SUPPORT_UTF8
+/*************************************************
+*       Match character against an XCLASS        *
+*************************************************/
+
+/* This function is called from within the XCLASS code below, to match a
+character against an extended class which might match values > 255.
+
+Arguments:
+  c           the character
+  data        points to the flag byte of the XCLASS data
+
+Returns:      TRUE if character matches, else FALSE
+*/
+
+static BOOL
+match_xclass(int c, const uschar *data)
+{
+int t;
+BOOL negated = (*data & XCL_NOT) != 0;
+
+/* Character values < 256 are matched against a bitmap, if one is present. If
+not, we still carry on, because there may be ranges that start below 256 in the
+additional data. */
+
+if (c < 256)
+  {
+  if ((*data & XCL_MAP) != 0 && (data[1 + c/8] & (1 << (c&7))) != 0)
+    return !negated;   /* char found */
+  }
+
+/* First skip the bit map if present. Then match against the list of Unicode
+properties or large chars or ranges that end with a large char. We won't ever
+encounter XCL_PROP or XCL_NOTPROP when UCP support is not compiled. */
+
+if ((*data++ & XCL_MAP) != 0) data += 32;
+
+while ((t = *data++) != XCL_END)
+  {
+  int x, y;
+  if (t == XCL_SINGLE)
+    {
+    GETCHARINC(x, data);
+    if (c == x) return !negated;
+    }
+  else if (t == XCL_RANGE)
+    {
+    GETCHARINC(x, data);
+    GETCHARINC(y, data);
+    if (c >= x && c <= y) return !negated;
+    }
+
+#ifdef SUPPORT_UCP
+  else  /* XCL_PROP & XCL_NOTPROP */
+    {
+    int chartype, othercase;
+    int rqdtype = *data++;
+    int category = ucp_findchar(c, &chartype, &othercase);
+    if (rqdtype >= 128)
+      {
+      if ((rqdtype - 128 == category) == (t == XCL_PROP)) return !negated;
+      }
+    else
+      {
+      if ((rqdtype == chartype) == (t == XCL_PROP)) return !negated;
+      }
+    }
+#endif  /* SUPPORT_UCP */
+  }
+
+return negated;   /* char did not match */
+}
+#endif
+
+
+/***************************************************************************
+****************************************************************************
+                   RECURSION IN THE match() FUNCTION
+
+The match() function is highly recursive. Some regular expressions can cause
+it to recurse thousands of times. I was writing for Unix, so I just let it
+call itself recursively. This uses the stack for saving everything that has
+to be saved for a recursive call. On Unix, the stack can be large, and this
+works fine.
+
+It turns out that on non-Unix systems there are problems with programs that
+use a lot of stack. (This despite the fact that every last chip has oodles
+of memory these days, and techniques for extending the stack have been known
+for decades.) So....
+
+There is a fudge, triggered by defining NO_RECURSE, which avoids recursive
+calls by keeping local variables that need to be preserved in blocks of memory
+obtained from malloc instead instead of on the stack. Macros are used to
+achieve this so that the actual code doesn't look very different to what it
+always used to.
+****************************************************************************
+***************************************************************************/
+
+
+/* These versions of the macros use the stack, as normal */
+
+#ifndef NO_RECURSE
+#define REGISTER register
+#define RMATCH(rx,ra,rb,rc,rd,re,rf,rg) rx = match(ra,rb,rc,rd,re,rf,rg)
+#define RRETURN(ra) return ra
+#else
+
+
+/* These versions of the macros manage a private stack on the heap. Note
+that the rd argument of RMATCH isn't actually used. It's the md argument of
+match(), which never changes. */
+
+#define REGISTER
+
+#define RMATCH(rx,ra,rb,rc,rd,re,rf,rg)\
+  {\
+  heapframe *newframe = (pcre_stack_malloc)(sizeof(heapframe));\
+  if (setjmp(frame->Xwhere) == 0)\
+    {\
+    newframe->Xeptr = ra;\
+    newframe->Xecode = rb;\
+    newframe->Xoffset_top = rc;\
+    newframe->Xims = re;\
+    newframe->Xeptrb = rf;\
+    newframe->Xflags = rg;\
+    newframe->Xprevframe = frame;\
+    frame = newframe;\
+    DPRINTF(("restarting from line %d\n", __LINE__));\
+    goto HEAP_RECURSE;\
+    }\
+  else\
+    {\
+    DPRINTF(("longjumped back to line %d\n", __LINE__));\
+    frame = md->thisframe;\
+    rx = frame->Xresult;\
+    }\
+  }
+
+#define RRETURN(ra)\
+  {\
+  heapframe *newframe = frame;\
+  frame = newframe->Xprevframe;\
+  (pcre_stack_free)(newframe);\
+  if (frame != NULL)\
+    {\
+    frame->Xresult = ra;\
+    md->thisframe = frame;\
+    longjmp(frame->Xwhere, 1);\
+    }\
+  return ra;\
+  }
+
+
+/* Structure for remembering the local variables in a private frame */
+
+typedef struct heapframe {
+  struct heapframe *Xprevframe;
+
+  /* Function arguments that may change */
+
+  const uschar *Xeptr;
+  const uschar *Xecode;
+  int Xoffset_top;
+  long int Xims;
+  eptrblock *Xeptrb;
+  int Xflags;
+
+  /* Function local variables */
+
+  const uschar *Xcallpat;
+  const uschar *Xcharptr;
+  const uschar *Xdata;
+  const uschar *Xnext;
+  const uschar *Xpp;
+  const uschar *Xprev;
+  const uschar *Xsaved_eptr;
+
+  recursion_info Xnew_recursive;
+
+  BOOL Xcur_is_word;
+  BOOL Xcondition;
+  BOOL Xminimize;
+  BOOL Xprev_is_word;
+
+  unsigned long int Xoriginal_ims;
+
+#ifdef SUPPORT_UCP
+  int Xprop_type;
+  int Xprop_fail_result;
+  int Xprop_category;
+  int Xprop_chartype;
+  int Xprop_othercase;
+  int Xprop_test_against;
+  int *Xprop_test_variable;
+#endif
+
+  int Xctype;
+  int Xfc;
+  int Xfi;
+  int Xlength;
+  int Xmax;
+  int Xmin;
+  int Xnumber;
+  int Xoffset;
+  int Xop;
+  int Xsave_capture_last;
+  int Xsave_offset1, Xsave_offset2, Xsave_offset3;
+  int Xstacksave[REC_STACK_SAVE_MAX];
+
+  eptrblock Xnewptrb;
+
+  /* Place to pass back result, and where to jump back to */
+
+  int  Xresult;
+  jmp_buf Xwhere;
+
+} heapframe;
+
+#endif
+
+
+/***************************************************************************
+***************************************************************************/
+
+
+
+/*************************************************
+*         Match from current position            *
+*************************************************/
+
+/* On entry ecode points to the first opcode, and eptr to the first character
+in the subject string, while eptrb holds the value of eptr at the start of the
+last bracketed group - used for breaking infinite loops matching zero-length
+strings. This function is called recursively in many circumstances. Whenever it
+returns a negative (error) response, the outer incarnation must also return the
+same response.
+
+Performance note: It might be tempting to extract commonly used fields from the
+md structure (e.g. utf8, end_subject) into individual variables to improve
+performance. Tests using gcc on a SPARC disproved this; in the first case, it
+made performance worse.
+
+Arguments:
+   eptr        pointer in subject
+   ecode       position in code
+   offset_top  current top pointer
+   md          pointer to "static" info for the match
+   ims         current /i, /m, and /s options
+   eptrb       pointer to chain of blocks containing eptr at start of
+                 brackets - for testing for empty matches
+   flags       can contain
+                 match_condassert - this is an assertion condition
+                 match_isgroup - this is the start of a bracketed group
+
+Returns:       MATCH_MATCH if matched            )  these values are >= 0
+               MATCH_NOMATCH if failed to match  )
+               a negative PCRE_ERROR_xxx value if aborted by an error condition
+                 (e.g. stopped by recursion limit)
+*/
+
+static int
+match(REGISTER const uschar *eptr, REGISTER const uschar *ecode,
+  int offset_top, match_data *md, unsigned long int ims, eptrblock *eptrb,
+  int flags)
+{
+/* These variables do not need to be preserved over recursion in this function,
+so they can be ordinary variables in all cases. Mark them with "register"
+because they are used a lot in loops. */
+
+register int rrc;    /* Returns from recursive calls */
+register int i;      /* Used for loops not involving calls to RMATCH() */
+register int c;      /* Character values not kept over RMATCH() calls */
+
+/* When recursion is not being used, all "local" variables that have to be
+preserved over calls to RMATCH() are part of a "frame" which is obtained from
+heap storage. Set up the top-level frame here; others are obtained from the
+heap whenever RMATCH() does a "recursion". See the macro definitions above. */
+
+#ifdef NO_RECURSE
+heapframe *frame = (pcre_stack_malloc)(sizeof(heapframe));
+frame->Xprevframe = NULL;            /* Marks the top level */
+
+/* Copy in the original argument variables */
+
+frame->Xeptr = eptr;
+frame->Xecode = ecode;
+frame->Xoffset_top = offset_top;
+frame->Xims = ims;
+frame->Xeptrb = eptrb;
+frame->Xflags = flags;
+
+/* This is where control jumps back to to effect "recursion" */
+
+HEAP_RECURSE:
+
+/* Macros make the argument variables come from the current frame */
+
+#define eptr               frame->Xeptr
+#define ecode              frame->Xecode
+#define offset_top         frame->Xoffset_top
+#define ims                frame->Xims
+#define eptrb              frame->Xeptrb
+#define flags              frame->Xflags
+
+/* Ditto for the local variables */
+
+#ifdef SUPPORT_UTF8
+#define charptr            frame->Xcharptr
+#endif
+#define callpat            frame->Xcallpat
+#define data               frame->Xdata
+#define next               frame->Xnext
+#define pp                 frame->Xpp
+#define prev               frame->Xprev
+#define saved_eptr         frame->Xsaved_eptr
+
+#define new_recursive      frame->Xnew_recursive
+
+#define cur_is_word        frame->Xcur_is_word
+#define condition          frame->Xcondition
+#define minimize           frame->Xminimize
+#define prev_is_word       frame->Xprev_is_word
+
+#define original_ims       frame->Xoriginal_ims
+
+#ifdef SUPPORT_UCP
+#define prop_type          frame->Xprop_type
+#define prop_fail_result   frame->Xprop_fail_result
+#define prop_category      frame->Xprop_category
+#define prop_chartype      frame->Xprop_chartype
+#define prop_othercase     frame->Xprop_othercase
+#define prop_test_against  frame->Xprop_test_against
+#define prop_test_variable frame->Xprop_test_variable
+#endif
+
+#define ctype              frame->Xctype
+#define fc                 frame->Xfc
+#define fi                 frame->Xfi
+#define length             frame->Xlength
+#define max                frame->Xmax
+#define min                frame->Xmin
+#define number             frame->Xnumber
+#define offset             frame->Xoffset
+#define op                 frame->Xop
+#define save_capture_last  frame->Xsave_capture_last
+#define save_offset1       frame->Xsave_offset1
+#define save_offset2       frame->Xsave_offset2
+#define save_offset3       frame->Xsave_offset3
+#define stacksave          frame->Xstacksave
+
+#define newptrb            frame->Xnewptrb
+
+/* When recursion is being used, local variables are allocated on the stack and
+get preserved during recursion in the normal way. In this environment, fi and
+i, and fc and c, can be the same variables. */
+
+#else
+#define fi i
+#define fc c
+
+
+#ifdef SUPPORT_UTF8                /* Many of these variables are used ony */
+const uschar *charptr;             /* small blocks of the code. My normal  */
+#endif                             /* style of coding would have declared  */
+const uschar *callpat;             /* them within each of those blocks.    */
+const uschar *data;                /* However, in order to accommodate the */
+const uschar *next;                /* version of this code that uses an    */
+const uschar *pp;                  /* external "stack" implemented on the  */
+const uschar *prev;                /* heap, it is easier to declare them   */
+const uschar *saved_eptr;          /* all here, so the declarations can    */
+                                   /* be cut out in a block. The only      */
+recursion_info new_recursive;      /* declarations within blocks below are */
+                                   /* for variables that do not have to    */
+BOOL cur_is_word;                  /* be preserved over a recursive call   */
+BOOL condition;                    /* to RMATCH().                         */
+BOOL minimize;
+BOOL prev_is_word;
+
+unsigned long int original_ims;
+
+#ifdef SUPPORT_UCP
+int prop_type;
+int prop_fail_result;
+int prop_category;
+int prop_chartype;
+int prop_othercase;
+int prop_test_against;
+int *prop_test_variable;
+#endif
+
+int ctype;
+int length;
+int max;
+int min;
+int number;
+int offset;
+int op;
+int save_capture_last;
+int save_offset1, save_offset2, save_offset3;
+int stacksave[REC_STACK_SAVE_MAX];
+
+eptrblock newptrb;
+#endif
+
+/* These statements are here to stop the compiler complaining about unitialized
+variables. */
+
+#ifdef SUPPORT_UCP
+prop_fail_result = 0;
+prop_test_against = 0;
+prop_test_variable = NULL;
+#endif
+
+/* OK, now we can get on with the real code of the function. Recursion is
+specified by the macros RMATCH and RRETURN. When NO_RECURSE is *not* defined,
+these just turn into a recursive call to match() and a "return", respectively.
+However, RMATCH isn't like a function call because it's quite a complicated
+macro. It has to be used in one particular way. This shouldn't, however, impact
+performance when true recursion is being used. */
+
+if (md->match_call_count++ >= md->match_limit) RRETURN(PCRE_ERROR_MATCHLIMIT);
+
+original_ims = ims;    /* Save for resetting on ')' */
+
+/* At the start of a bracketed group, add the current subject pointer to the
+stack of such pointers, to be re-instated at the end of the group when we hit
+the closing ket. When match() is called in other circumstances, we don't add to
+this stack. */
+
+if ((flags & match_isgroup) != 0)
+  {
+  newptrb.epb_prev = eptrb;
+  newptrb.epb_saved_eptr = eptr;
+  eptrb = &newptrb;
+  }
+
+/* Now start processing the operations. */
+
+for (;;)
+  {
+  op = *ecode;
+  minimize = FALSE;
+
+  /* For partial matching, remember if we ever hit the end of the subject after
+  matching at least one subject character. */
+
+  if (md->partial &&
+      eptr >= md->end_subject &&
+      eptr > md->start_match)
+    md->hitend = TRUE;
+
+  /* Opening capturing bracket. If there is space in the offset vector, save
+  the current subject position in the working slot at the top of the vector. We
+  mustn't change the current values of the data slot, because they may be set
+  from a previous iteration of this group, and be referred to by a reference
+  inside the group.
+
+  If the bracket fails to match, we need to restore this value and also the
+  values of the final offsets, in case they were set by a previous iteration of
+  the same bracket.
+
+  If there isn't enough space in the offset vector, treat this as if it were a
+  non-capturing bracket. Don't worry about setting the flag for the error case
+  here; that is handled in the code for KET. */
+
+  if (op > OP_BRA)
+    {
+    number = op - OP_BRA;
+
+    /* For extended extraction brackets (large number), we have to fish out the
+    number from a dummy opcode at the start. */
+
+    if (number > EXTRACT_BASIC_MAX)
+      number = GET2(ecode, 2+LINK_SIZE);
+    offset = number << 1;
+
+#ifdef DEBUG
+    printf("start bracket %d subject=", number);
+    pchars(eptr, 16, TRUE, md);
+    printf("\n");
+#endif
+
+    if (offset < md->offset_max)
+      {
+      save_offset1 = md->offset_vector[offset];
+      save_offset2 = md->offset_vector[offset+1];
+      save_offset3 = md->offset_vector[md->offset_end - number];
+      save_capture_last = md->capture_last;
+
+      DPRINTF(("saving %d %d %d\n", save_offset1, save_offset2, save_offset3));
+      md->offset_vector[md->offset_end - number] = eptr - md->start_subject;
+
+      do
+        {
+        RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb,
+          match_isgroup);
+        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+        md->capture_last = save_capture_last;
+        ecode += GET(ecode, 1);
+        }
+      while (*ecode == OP_ALT);
+
+      DPRINTF(("bracket %d failed\n", number));
+
+      md->offset_vector[offset] = save_offset1;
+      md->offset_vector[offset+1] = save_offset2;
+      md->offset_vector[md->offset_end - number] = save_offset3;
+
+      RRETURN(MATCH_NOMATCH);
+      }
+
+    /* Insufficient room for saving captured contents */
+
+    else op = OP_BRA;
+    }
+
+  /* Other types of node can be handled by a switch */
+
+  switch(op)
+    {
+    case OP_BRA:     /* Non-capturing bracket: optimized */
+    DPRINTF(("start bracket 0\n"));
+    do
+      {
+      RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb,
+        match_isgroup);
+      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+      ecode += GET(ecode, 1);
+      }
+    while (*ecode == OP_ALT);
+    DPRINTF(("bracket 0 failed\n"));
+    RRETURN(MATCH_NOMATCH);
+
+    /* Conditional group: compilation checked that there are no more than
+    two branches. If the condition is false, skipping the first branch takes us
+    past the end if there is only one branch, but that's OK because that is
+    exactly what going to the ket would do. */
+
+    case OP_COND:
+    if (ecode[LINK_SIZE+1] == OP_CREF) /* Condition extract or recurse test */
+      {
+      offset = GET2(ecode, LINK_SIZE+2) << 1;  /* Doubled ref number */
+      condition = (offset == CREF_RECURSE * 2)?
+        (md->recursive != NULL) :
+        (offset < offset_top && md->offset_vector[offset] >= 0);
+      RMATCH(rrc, eptr, ecode + (condition?
+        (LINK_SIZE + 4) : (LINK_SIZE + 1 + GET(ecode, 1))),
+        offset_top, md, ims, eptrb, match_isgroup);
+      RRETURN(rrc);
+      }
+
+    /* The condition is an assertion. Call match() to evaluate it - setting
+    the final argument TRUE causes it to stop at the end of an assertion. */
+
+    else
+      {
+      RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL,
+          match_condassert | match_isgroup);
+      if (rrc == MATCH_MATCH)
+        {
+        ecode += 1 + LINK_SIZE + GET(ecode, LINK_SIZE+2);
+        while (*ecode == OP_ALT) ecode += GET(ecode, 1);
+        }
+      else if (rrc != MATCH_NOMATCH)
+        {
+        RRETURN(rrc);         /* Need braces because of following else */
+        }
+      else ecode += GET(ecode, 1);
+      RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb,
+        match_isgroup);
+      RRETURN(rrc);
+      }
+    /* Control never reaches here */
+
+    /* Skip over conditional reference or large extraction number data if
+    encountered. */
+
+    case OP_CREF:
+    case OP_BRANUMBER:
+    ecode += 3;
+    break;
+
+    /* End of the pattern. If we are in a recursion, we should restore the
+    offsets appropriately and continue from after the call. */
+
+    case OP_END:
+    if (md->recursive != NULL && md->recursive->group_num == 0)
+      {
+      recursion_info *rec = md->recursive;
+      DPRINTF(("Hit the end in a (?0) recursion\n"));
+      md->recursive = rec->prevrec;
+      memmove(md->offset_vector, rec->offset_save,
+        rec->saved_max * sizeof(int));
+      md->start_match = rec->save_start;
+      ims = original_ims;
+      ecode = rec->after_call;
+      break;
+      }
+
+    /* Otherwise, if PCRE_NOTEMPTY is set, fail if we have matched an empty
+    string - backtracking will then try other alternatives, if any. */
+
+    if (md->notempty && eptr == md->start_match) RRETURN(MATCH_NOMATCH);
+    md->end_match_ptr = eptr;          /* Record where we ended */
+    md->end_offset_top = offset_top;   /* and how many extracts were taken */
+    RRETURN(MATCH_MATCH);
+
+    /* Change option settings */
+
+    case OP_OPT:
+    ims = ecode[1];
+    ecode += 2;
+    DPRINTF(("ims set to %02lx\n", ims));
+    break;
+
+    /* Assertion brackets. Check the alternative branches in turn - the
+    matching won't pass the KET for an assertion. If any one branch matches,
+    the assertion is true. Lookbehind assertions have an OP_REVERSE item at the
+    start of each branch to move the current point backwards, so the code at
+    this level is identical to the lookahead case. */
+
+    case OP_ASSERT:
+    case OP_ASSERTBACK:
+    do
+      {
+      RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL,
+        match_isgroup);
+      if (rrc == MATCH_MATCH) break;
+      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+      ecode += GET(ecode, 1);
+      }
+    while (*ecode == OP_ALT);
+    if (*ecode == OP_KET) RRETURN(MATCH_NOMATCH);
+
+    /* If checking an assertion for a condition, return MATCH_MATCH. */
+
+    if ((flags & match_condassert) != 0) RRETURN(MATCH_MATCH);
+
+    /* Continue from after the assertion, updating the offsets high water
+    mark, since extracts may have been taken during the assertion. */
+
+    do ecode += GET(ecode,1); while (*ecode == OP_ALT);
+    ecode += 1 + LINK_SIZE;
+    offset_top = md->end_offset_top;
+    continue;
+
+    /* Negative assertion: all branches must fail to match */
+
+    case OP_ASSERT_NOT:
+    case OP_ASSERTBACK_NOT:
+    do
+      {
+      RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL,
+        match_isgroup);
+      if (rrc == MATCH_MATCH) RRETURN(MATCH_NOMATCH);
+      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+      ecode += GET(ecode,1);
+      }
+    while (*ecode == OP_ALT);
+
+    if ((flags & match_condassert) != 0) RRETURN(MATCH_MATCH);
+
+    ecode += 1 + LINK_SIZE;
+    continue;
+
+    /* Move the subject pointer back. This occurs only at the start of
+    each branch of a lookbehind assertion. If we are too close to the start to
+    move back, this match function fails. When working with UTF-8 we move
+    back a number of characters, not bytes. */
+
+    case OP_REVERSE:
+#ifdef SUPPORT_UTF8
+    if (md->utf8)
+      {
+      c = GET(ecode,1);
+      for (i = 0; i < c; i++)
+        {
+        eptr--;
+        if (eptr < md->start_subject) RRETURN(MATCH_NOMATCH);
+        BACKCHAR(eptr)
+        }
+      }
+    else
+#endif
+
+    /* No UTF-8 support, or not in UTF-8 mode: count is byte count */
+
+      {
+      eptr -= GET(ecode,1);
+      if (eptr < md->start_subject) RRETURN(MATCH_NOMATCH);
+      }
+
+    /* Skip to next op code */
+
+    ecode += 1 + LINK_SIZE;
+    break;
+
+    /* The callout item calls an external function, if one is provided, passing
+    details of the match so far. This is mainly for debugging, though the
+    function is able to force a failure. */
+
+    case OP_CALLOUT:
+    if (pcre_callout != NULL)
+      {
+      pcre_callout_block cb;
+      cb.version          = 1;   /* Version 1 of the callout block */
+      cb.callout_number   = ecode[1];
+      cb.offset_vector    = md->offset_vector;
+      cb.subject          = (const char *)md->start_subject;
+      cb.subject_length   = md->end_subject - md->start_subject;
+      cb.start_match      = md->start_match - md->start_subject;
+      cb.current_position = eptr - md->start_subject;
+      cb.pattern_position = GET(ecode, 2);
+      cb.next_item_length = GET(ecode, 2 + LINK_SIZE);
+      cb.capture_top      = offset_top/2;
+      cb.capture_last     = md->capture_last;
+      cb.callout_data     = md->callout_data;
+      if ((rrc = (*pcre_callout)(&cb)) > 0) RRETURN(MATCH_NOMATCH);
+      if (rrc < 0) RRETURN(rrc);
+      }
+    ecode += 2 + 2*LINK_SIZE;
+    break;
+
+    /* Recursion either matches the current regex, or some subexpression. The
+    offset data is the offset to the starting bracket from the start of the
+    whole pattern. (This is so that it works from duplicated subpatterns.)
+
+    If there are any capturing brackets started but not finished, we have to
+    save their starting points and reinstate them after the recursion. However,
+    we don't know how many such there are (offset_top records the completed
+    total) so we just have to save all the potential data. There may be up to
+    65535 such values, which is too large to put on the stack, but using malloc
+    for small numbers seems expensive. As a compromise, the stack is used when
+    there are no more than REC_STACK_SAVE_MAX values to store; otherwise malloc
+    is used. A problem is what to do if the malloc fails ... there is no way of
+    returning to the top level with an error. Save the top REC_STACK_SAVE_MAX
+    values on the stack, and accept that the rest may be wrong.
+
+    There are also other values that have to be saved. We use a chained
+    sequence of blocks that actually live on the stack. Thanks to Robin Houston
+    for the original version of this logic. */
+
+    case OP_RECURSE:
+      {
+      callpat = md->start_code + GET(ecode, 1);
+      new_recursive.group_num = *callpat - OP_BRA;
+
+      /* For extended extraction brackets (large number), we have to fish out
+      the number from a dummy opcode at the start. */
+
+      if (new_recursive.group_num > EXTRACT_BASIC_MAX)
+        new_recursive.group_num = GET2(callpat, 2+LINK_SIZE);
+
+      /* Add to "recursing stack" */
+
+      new_recursive.prevrec = md->recursive;
+      md->recursive = &new_recursive;
+
+      /* Find where to continue from afterwards */
+
+      ecode += 1 + LINK_SIZE;
+      new_recursive.after_call = ecode;
+
+      /* Now save the offset data. */
+
+      new_recursive.saved_max = md->offset_end;
+      if (new_recursive.saved_max <= REC_STACK_SAVE_MAX)
+        new_recursive.offset_save = stacksave;
+      else
+        {
+        new_recursive.offset_save =
+          (int *)(pcre_malloc)(new_recursive.saved_max * sizeof(int));
+        if (new_recursive.offset_save == NULL) RRETURN(PCRE_ERROR_NOMEMORY);
+        }
+
+      memcpy(new_recursive.offset_save, md->offset_vector,
+            new_recursive.saved_max * sizeof(int));
+      new_recursive.save_start = md->start_match;
+      md->start_match = eptr;
+
+      /* OK, now we can do the recursion. For each top-level alternative we
+      restore the offset and recursion data. */
+
+      DPRINTF(("Recursing into group %d\n", new_recursive.group_num));
+      do
+        {
+        RMATCH(rrc, eptr, callpat + 1 + LINK_SIZE, offset_top, md, ims,
+            eptrb, match_isgroup);
+        if (rrc == MATCH_MATCH)
+          {
+          md->recursive = new_recursive.prevrec;
+          if (new_recursive.offset_save != stacksave)
+            (pcre_free)(new_recursive.offset_save);
+          RRETURN(MATCH_MATCH);
+          }
+        else if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+
+        md->recursive = &new_recursive;
+        memcpy(md->offset_vector, new_recursive.offset_save,
+            new_recursive.saved_max * sizeof(int));
+        callpat += GET(callpat, 1);
+        }
+      while (*callpat == OP_ALT);
+
+      DPRINTF(("Recursion didn't match\n"));
+      md->recursive = new_recursive.prevrec;
+      if (new_recursive.offset_save != stacksave)
+        (pcre_free)(new_recursive.offset_save);
+      RRETURN(MATCH_NOMATCH);
+      }
+    /* Control never reaches here */
+
+    /* "Once" brackets are like assertion brackets except that after a match,
+    the point in the subject string is not moved back. Thus there can never be
+    a move back into the brackets. Friedl calls these "atomic" subpatterns.
+    Check the alternative branches in turn - the matching won't pass the KET
+    for this kind of subpattern. If any one branch matches, we carry on as at
+    the end of a normal bracket, leaving the subject pointer. */
+
+    case OP_ONCE:
+      {
+      prev = ecode;
+      saved_eptr = eptr;
+
+      do
+        {
+        RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims,
+          eptrb, match_isgroup);
+        if (rrc == MATCH_MATCH) break;
+        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+        ecode += GET(ecode,1);
+        }
+      while (*ecode == OP_ALT);
+
+      /* If hit the end of the group (which could be repeated), fail */
+
+      if (*ecode != OP_ONCE && *ecode != OP_ALT) RRETURN(MATCH_NOMATCH);
+
+      /* Continue as from after the assertion, updating the offsets high water
+      mark, since extracts may have been taken. */
+
+      do ecode += GET(ecode,1); while (*ecode == OP_ALT);
+
+      offset_top = md->end_offset_top;
+      eptr = md->end_match_ptr;
+
+      /* For a non-repeating ket, just continue at this level. This also
+      happens for a repeating ket if no characters were matched in the group.
+      This is the forcible breaking of infinite loops as implemented in Perl
+      5.005. If there is an options reset, it will get obeyed in the normal
+      course of events. */
+
+      if (*ecode == OP_KET || eptr == saved_eptr)
+        {
+        ecode += 1+LINK_SIZE;
+        break;
+        }
+
+      /* The repeating kets try the rest of the pattern or restart from the
+      preceding bracket, in the appropriate order. We need to reset any options
+      that changed within the bracket before re-running it, so check the next
+      opcode. */
+
+      if (ecode[1+LINK_SIZE] == OP_OPT)
+        {
+        ims = (ims & ~PCRE_IMS) | ecode[4];
+        DPRINTF(("ims set to %02lx at group repeat\n", ims));
+        }
+
+      if (*ecode == OP_KETRMIN)
+        {
+        RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb, 0);
+        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+        RMATCH(rrc, eptr, prev, offset_top, md, ims, eptrb, match_isgroup);
+        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+        }
+      else  /* OP_KETRMAX */
+        {
+        RMATCH(rrc, eptr, prev, offset_top, md, ims, eptrb, match_isgroup);
+        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+        RMATCH(rrc, eptr, ecode + 1+LINK_SIZE, offset_top, md, ims, eptrb, 0);
+        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+        }
+      }
+    RRETURN(MATCH_NOMATCH);
+
+    /* An alternation is the end of a branch; scan along to find the end of the
+    bracketed group and go to there. */
+
+    case OP_ALT:
+    do ecode += GET(ecode,1); while (*ecode == OP_ALT);
+    break;
+
+    /* BRAZERO and BRAMINZERO occur just before a bracket group, indicating
+    that it may occur zero times. It may repeat infinitely, or not at all -
+    i.e. it could be ()* or ()? in the pattern. Brackets with fixed upper
+    repeat limits are compiled as a number of copies, with the optional ones
+    preceded by BRAZERO or BRAMINZERO. */
+
+    case OP_BRAZERO:
+      {
+      next = ecode+1;
+      RMATCH(rrc, eptr, next, offset_top, md, ims, eptrb, match_isgroup);
+      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+      do next += GET(next,1); while (*next == OP_ALT);
+      ecode = next + 1+LINK_SIZE;
+      }
+    break;
+
+    case OP_BRAMINZERO:
+      {
+      next = ecode+1;
+      do next += GET(next,1); while (*next == OP_ALT);
+      RMATCH(rrc, eptr, next + 1+LINK_SIZE, offset_top, md, ims, eptrb,
+        match_isgroup);
+      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+      ecode++;
+      }
+    break;
+
+    /* End of a group, repeated or non-repeating. If we are at the end of
+    an assertion "group", stop matching and return MATCH_MATCH, but record the
+    current high water mark for use by positive assertions. Do this also
+    for the "once" (not-backup up) groups. */
+
+    case OP_KET:
+    case OP_KETRMIN:
+    case OP_KETRMAX:
+      {
+      prev = ecode - GET(ecode, 1);
+      saved_eptr = eptrb->epb_saved_eptr;
+
+      /* Back up the stack of bracket start pointers. */
+
+      eptrb = eptrb->epb_prev;
+
+      if (*prev == OP_ASSERT || *prev == OP_ASSERT_NOT ||
+          *prev == OP_ASSERTBACK || *prev == OP_ASSERTBACK_NOT ||
+          *prev == OP_ONCE)
+        {
+        md->end_match_ptr = eptr;      /* For ONCE */
+        md->end_offset_top = offset_top;
+        RRETURN(MATCH_MATCH);
+        }
+
+      /* In all other cases except a conditional group we have to check the
+      group number back at the start and if necessary complete handling an
+      extraction by setting the offsets and bumping the high water mark. */
+
+      if (*prev != OP_COND)
+        {
+        number = *prev - OP_BRA;
+
+        /* For extended extraction brackets (large number), we have to fish out
+        the number from a dummy opcode at the start. */
+
+        if (number > EXTRACT_BASIC_MAX) number = GET2(prev, 2+LINK_SIZE);
+        offset = number << 1;
+
+#ifdef DEBUG
+        printf("end bracket %d", number);
+        printf("\n");
+#endif
+
+        /* Test for a numbered group. This includes groups called as a result
+        of recursion. Note that whole-pattern recursion is coded as a recurse
+        into group 0, so it won't be picked up here. Instead, we catch it when
+        the OP_END is reached. */
+
+        if (number > 0)
+          {
+          md->capture_last = number;
+          if (offset >= md->offset_max) md->offset_overflow = TRUE; else
+            {
+            md->offset_vector[offset] =
+              md->offset_vector[md->offset_end - number];
+            md->offset_vector[offset+1] = eptr - md->start_subject;
+            if (offset_top <= offset) offset_top = offset + 2;
+            }
+
+          /* Handle a recursively called group. Restore the offsets
+          appropriately and continue from after the call. */
+
+          if (md->recursive != NULL && md->recursive->group_num == number)
+            {
+            recursion_info *rec = md->recursive;
+            DPRINTF(("Recursion (%d) succeeded - continuing\n", number));
+            md->recursive = rec->prevrec;
+            md->start_match = rec->save_start;
+            memcpy(md->offset_vector, rec->offset_save,
+              rec->saved_max * sizeof(int));
+            ecode = rec->after_call;
+            ims = original_ims;
+            break;
+            }
+          }
+        }
+
+      /* Reset the value of the ims flags, in case they got changed during
+      the group. */
+
+      ims = original_ims;
+      DPRINTF(("ims reset to %02lx\n", ims));
+
+      /* For a non-repeating ket, just continue at this level. This also
+      happens for a repeating ket if no characters were matched in the group.
+      This is the forcible breaking of infinite loops as implemented in Perl
+      5.005. If there is an options reset, it will get obeyed in the normal
+      course of events. */
+
+      if (*ecode == OP_KET || eptr == saved_eptr)
+        {
+        ecode += 1 + LINK_SIZE;
+        break;
+        }
+
+      /* The repeating kets try the rest of the pattern or restart from the
+      preceding bracket, in the appropriate order. */
+
+      if (*ecode == OP_KETRMIN)
+        {
+        RMATCH(rrc, eptr, ecode + 1+LINK_SIZE, offset_top, md, ims, eptrb, 0);
+        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+        RMATCH(rrc, eptr, prev, offset_top, md, ims, eptrb, match_isgroup);
+        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+        }
+      else  /* OP_KETRMAX */
+        {
+        RMATCH(rrc, eptr, prev, offset_top, md, ims, eptrb, match_isgroup);
+        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+        RMATCH(rrc, eptr, ecode + 1+LINK_SIZE, offset_top, md, ims, eptrb, 0);
+        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+        }
+      }
+
+    RRETURN(MATCH_NOMATCH);
+
+    /* Start of subject unless notbol, or after internal newline if multiline */
+
+    case OP_CIRC:
+    if (md->notbol && eptr == md->start_subject) RRETURN(MATCH_NOMATCH);
+    if ((ims & PCRE_MULTILINE) != 0)
+      {
+      if (eptr != md->start_subject && eptr[-1] != NEWLINE)
+        RRETURN(MATCH_NOMATCH);
+      ecode++;
+      break;
+      }
+    /* ... else fall through */
+
+    /* Start of subject assertion */
+
+    case OP_SOD:
+    if (eptr != md->start_subject) RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+    /* Start of match assertion */
+
+    case OP_SOM:
+    if (eptr != md->start_subject + md->start_offset) RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+    /* Assert before internal newline if multiline, or before a terminating
+    newline unless endonly is set, else end of subject unless noteol is set. */
+
+    case OP_DOLL:
+    if ((ims & PCRE_MULTILINE) != 0)
+      {
+      if (eptr < md->end_subject)
+        { if (*eptr != NEWLINE) RRETURN(MATCH_NOMATCH); }
+      else
+        { if (md->noteol) RRETURN(MATCH_NOMATCH); }
+      ecode++;
+      break;
+      }
+    else
+      {
+      if (md->noteol) RRETURN(MATCH_NOMATCH);
+      if (!md->endonly)
+        {
+        if (eptr < md->end_subject - 1 ||
+           (eptr == md->end_subject - 1 && *eptr != NEWLINE))
+          RRETURN(MATCH_NOMATCH);
+        ecode++;
+        break;
+        }
+      }
+    /* ... else fall through */
+
+    /* End of subject assertion (\z) */
+
+    case OP_EOD:
+    if (eptr < md->end_subject) RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+    /* End of subject or ending \n assertion (\Z) */
+
+    case OP_EODN:
+    if (eptr < md->end_subject - 1 ||
+       (eptr == md->end_subject - 1 && *eptr != NEWLINE)) RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+    /* Word boundary assertions */
+
+    case OP_NOT_WORD_BOUNDARY:
+    case OP_WORD_BOUNDARY:
+      {
+
+      /* Find out if the previous and current characters are "word" characters.
+      It takes a bit more work in UTF-8 mode. Characters > 255 are assumed to
+      be "non-word" characters. */
+
+#ifdef SUPPORT_UTF8
+      if (md->utf8)
+        {
+        if (eptr == md->start_subject) prev_is_word = FALSE; else
+          {
+          const uschar *lastptr = eptr - 1;
+          while((*lastptr & 0xc0) == 0x80) lastptr--;
+          GETCHAR(c, lastptr);
+          prev_is_word = c < 256 && (md->ctypes[c] & ctype_word) != 0;
+          }
+        if (eptr >= md->end_subject) cur_is_word = FALSE; else
+          {
+          GETCHAR(c, eptr);
+          cur_is_word = c < 256 && (md->ctypes[c] & ctype_word) != 0;
+          }
+        }
+      else
+#endif
+
+      /* More streamlined when not in UTF-8 mode */
+
+        {
+        prev_is_word = (eptr != md->start_subject) &&
+          ((md->ctypes[eptr[-1]] & ctype_word) != 0);
+        cur_is_word = (eptr < md->end_subject) &&
+          ((md->ctypes[*eptr] & ctype_word) != 0);
+        }
+
+      /* Now see if the situation is what we want */
+
+      if ((*ecode++ == OP_WORD_BOUNDARY)?
+           cur_is_word == prev_is_word : cur_is_word != prev_is_word)
+        RRETURN(MATCH_NOMATCH);
+      }
+    break;
+
+    /* Match a single character type; inline for speed */
+
+    case OP_ANY:
+    if ((ims & PCRE_DOTALL) == 0 && eptr < md->end_subject && *eptr == NEWLINE)
+      RRETURN(MATCH_NOMATCH);
+    if (eptr++ >= md->end_subject) RRETURN(MATCH_NOMATCH);
+#ifdef SUPPORT_UTF8
+    if (md->utf8)
+      while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+#endif
+    ecode++;
+    break;
+
+    /* Match a single byte, even in UTF-8 mode. This opcode really does match
+    any byte, even newline, independent of the setting of PCRE_DOTALL. */
+
+    case OP_ANYBYTE:
+    if (eptr++ >= md->end_subject) RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+    case OP_NOT_DIGIT:
+    if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+    GETCHARINCTEST(c, eptr);
+    if (
+#ifdef SUPPORT_UTF8
+       c < 256 &&
+#endif
+       (md->ctypes[c] & ctype_digit) != 0
+       )
+      RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+    case OP_DIGIT:
+    if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+    GETCHARINCTEST(c, eptr);
+    if (
+#ifdef SUPPORT_UTF8
+       c >= 256 ||
+#endif
+       (md->ctypes[c] & ctype_digit) == 0
+       )
+      RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+    case OP_NOT_WHITESPACE:
+    if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+    GETCHARINCTEST(c, eptr);
+    if (
+#ifdef SUPPORT_UTF8
+       c < 256 &&
+#endif
+       (md->ctypes[c] & ctype_space) != 0
+       )
+      RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+    case OP_WHITESPACE:
+    if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+    GETCHARINCTEST(c, eptr);
+    if (
+#ifdef SUPPORT_UTF8
+       c >= 256 ||
+#endif
+       (md->ctypes[c] & ctype_space) == 0
+       )
+      RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+    case OP_NOT_WORDCHAR:
+    if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+    GETCHARINCTEST(c, eptr);
+    if (
+#ifdef SUPPORT_UTF8
+       c < 256 &&
+#endif
+       (md->ctypes[c] & ctype_word) != 0
+       )
+      RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+    case OP_WORDCHAR:
+    if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+    GETCHARINCTEST(c, eptr);
+    if (
+#ifdef SUPPORT_UTF8
+       c >= 256 ||
+#endif
+       (md->ctypes[c] & ctype_word) == 0
+       )
+      RRETURN(MATCH_NOMATCH);
+    ecode++;
+    break;
+
+#ifdef SUPPORT_UCP
+    /* Check the next character by Unicode property. We will get here only
+    if the support is in the binary; otherwise a compile-time error occurs. */
+
+    case OP_PROP:
+    case OP_NOTPROP:
+    if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+    GETCHARINCTEST(c, eptr);
+      {
+      int chartype, rqdtype;
+      int othercase;
+      int category = ucp_findchar(c, &chartype, &othercase);
+
+      rqdtype = *(++ecode);
+      ecode++;
+
+      if (rqdtype >= 128)
+        {
+        if ((rqdtype - 128 != category) == (op == OP_PROP))
+          RRETURN(MATCH_NOMATCH);
+        }
+      else
+        {
+        if ((rqdtype != chartype) == (op == OP_PROP))
+          RRETURN(MATCH_NOMATCH);
+        }
+      }
+    break;
+
+    /* Match an extended Unicode sequence. We will get here only if the support
+    is in the binary; otherwise a compile-time error occurs. */
+
+    case OP_EXTUNI:
+    if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+    GETCHARINCTEST(c, eptr);
+      {
+      int chartype;
+      int othercase;
+      int category = ucp_findchar(c, &chartype, &othercase);
+      if (category == ucp_M) RRETURN(MATCH_NOMATCH);
+      while (eptr < md->end_subject)
+        {
+        int len = 1;
+        if (!md->utf8) c = *eptr; else
+          {
+          GETCHARLEN(c, eptr, len);
+          }
+        category = ucp_findchar(c, &chartype, &othercase);
+        if (category != ucp_M) break;
+        eptr += len;
+        }
+      }
+    ecode++;
+    break;
+#endif
+
+
+    /* Match a back reference, possibly repeatedly. Look past the end of the
+    item to see if there is repeat information following. The code is similar
+    to that for character classes, but repeated for efficiency. Then obey
+    similar code to character type repeats - written out again for speed.
+    However, if the referenced string is the empty string, always treat
+    it as matched, any number of times (otherwise there could be infinite
+    loops). */
+
+    case OP_REF:
+      {
+      offset = GET2(ecode, 1) << 1;               /* Doubled ref number */
+      ecode += 3;                                 /* Advance past item */
+
+      /* If the reference is unset, set the length to be longer than the amount
+      of subject left; this ensures that every attempt at a match fails. We
+      can't just fail here, because of the possibility of quantifiers with zero
+      minima. */
+
+      length = (offset >= offset_top || md->offset_vector[offset] < 0)?
+        md->end_subject - eptr + 1 :
+        md->offset_vector[offset+1] - md->offset_vector[offset];
+
+      /* Set up for repetition, or handle the non-repeated case */
+
+      switch (*ecode)
+        {
+        case OP_CRSTAR:
+        case OP_CRMINSTAR:
+        case OP_CRPLUS:
+        case OP_CRMINPLUS:
+        case OP_CRQUERY:
+        case OP_CRMINQUERY:
+        c = *ecode++ - OP_CRSTAR;
+        minimize = (c & 1) != 0;
+        min = rep_min[c];                 /* Pick up values from tables; */
+        max = rep_max[c];                 /* zero for max => infinity */
+        if (max == 0) max = INT_MAX;
+        break;
+
+        case OP_CRRANGE:
+        case OP_CRMINRANGE:
+        minimize = (*ecode == OP_CRMINRANGE);
+        min = GET2(ecode, 1);
+        max = GET2(ecode, 3);
+        if (max == 0) max = INT_MAX;
+        ecode += 5;
+        break;
+
+        default:               /* No repeat follows */
+        if (!match_ref(offset, eptr, length, md, ims)) RRETURN(MATCH_NOMATCH);
+        eptr += length;
+        continue;              /* With the main loop */
+        }
+
+      /* If the length of the reference is zero, just continue with the
+      main loop. */
+
+      if (length == 0) continue;
+
+      /* First, ensure the minimum number of matches are present. We get back
+      the length of the reference string explicitly rather than passing the
+      address of eptr, so that eptr can be a register variable. */
+
+      for (i = 1; i <= min; i++)
+        {
+        if (!match_ref(offset, eptr, length, md, ims)) RRETURN(MATCH_NOMATCH);
+        eptr += length;
+        }
+
+      /* If min = max, continue at the same level without recursion.
+      They are not both allowed to be zero. */
+
+      if (min == max) continue;
+
+      /* If minimizing, keep trying and advancing the pointer */
+
+      if (minimize)
+        {
+        for (fi = min;; fi++)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (fi >= max || !match_ref(offset, eptr, length, md, ims))
+            RRETURN(MATCH_NOMATCH);
+          eptr += length;
+          }
+        /* Control never gets here */
+        }
+
+      /* If maximizing, find the longest string and work backwards */
+
+      else
+        {
+        pp = eptr;
+        for (i = min; i < max; i++)
+          {
+          if (!match_ref(offset, eptr, length, md, ims)) break;
+          eptr += length;
+          }
+        while (eptr >= pp)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          eptr -= length;
+          }
+        RRETURN(MATCH_NOMATCH);
+        }
+      }
+    /* Control never gets here */
+
+
+
+    /* Match a bit-mapped character class, possibly repeatedly. This op code is
+    used when all the characters in the class have values in the range 0-255,
+    and either the matching is caseful, or the characters are in the range
+    0-127 when UTF-8 processing is enabled. The only difference between
+    OP_CLASS and OP_NCLASS occurs when a data character outside the range is
+    encountered.
+
+    First, look past the end of the item to see if there is repeat information
+    following. Then obey similar code to character type repeats - written out
+    again for speed. */
+
+    case OP_NCLASS:
+    case OP_CLASS:
+      {
+      data = ecode + 1;                /* Save for matching */
+      ecode += 33;                     /* Advance past the item */
+
+      switch (*ecode)
+        {
+        case OP_CRSTAR:
+        case OP_CRMINSTAR:
+        case OP_CRPLUS:
+        case OP_CRMINPLUS:
+        case OP_CRQUERY:
+        case OP_CRMINQUERY:
+        c = *ecode++ - OP_CRSTAR;
+        minimize = (c & 1) != 0;
+        min = rep_min[c];                 /* Pick up values from tables; */
+        max = rep_max[c];                 /* zero for max => infinity */
+        if (max == 0) max = INT_MAX;
+        break;
+
+        case OP_CRRANGE:
+        case OP_CRMINRANGE:
+        minimize = (*ecode == OP_CRMINRANGE);
+        min = GET2(ecode, 1);
+        max = GET2(ecode, 3);
+        if (max == 0) max = INT_MAX;
+        ecode += 5;
+        break;
+
+        default:               /* No repeat follows */
+        min = max = 1;
+        break;
+        }
+
+      /* First, ensure the minimum number of matches are present. */
+
+#ifdef SUPPORT_UTF8
+      /* UTF-8 mode */
+      if (md->utf8)
+        {
+        for (i = 1; i <= min; i++)
+          {
+          if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+          GETCHARINC(c, eptr);
+          if (c > 255)
+            {
+            if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
+            }
+          else
+            {
+            if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
+            }
+          }
+        }
+      else
+#endif
+      /* Not UTF-8 mode */
+        {
+        for (i = 1; i <= min; i++)
+          {
+          if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+          c = *eptr++;
+          if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
+          }
+        }
+
+      /* If max == min we can continue with the main loop without the
+      need to recurse. */
+
+      if (min == max) continue;
+
+      /* If minimizing, keep testing the rest of the expression and advancing
+      the pointer while it matches the class. */
+
+      if (minimize)
+        {
+#ifdef SUPPORT_UTF8
+        /* UTF-8 mode */
+        if (md->utf8)
+          {
+          for (fi = min;; fi++)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+            GETCHARINC(c, eptr);
+            if (c > 255)
+              {
+              if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
+              }
+            else
+              {
+              if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
+              }
+            }
+          }
+        else
+#endif
+        /* Not UTF-8 mode */
+          {
+          for (fi = min;; fi++)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+            c = *eptr++;
+            if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
+            }
+          }
+        /* Control never gets here */
+        }
+
+      /* If maximizing, find the longest possible run, then work backwards. */
+
+      else
+        {
+        pp = eptr;
+
+#ifdef SUPPORT_UTF8
+        /* UTF-8 mode */
+        if (md->utf8)
+          {
+          for (i = min; i < max; i++)
+            {
+            int len = 1;
+            if (eptr >= md->end_subject) break;
+            GETCHARLEN(c, eptr, len);
+            if (c > 255)
+              {
+              if (op == OP_CLASS) break;
+              }
+            else
+              {
+              if ((data[c/8] & (1 << (c&7))) == 0) break;
+              }
+            eptr += len;
+            }
+          for (;;)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            if (eptr-- == pp) break;        /* Stop if tried at original pos */
+            BACKCHAR(eptr);
+            }
+          }
+        else
+#endif
+          /* Not UTF-8 mode */
+          {
+          for (i = min; i < max; i++)
+            {
+            if (eptr >= md->end_subject) break;
+            c = *eptr;
+            if ((data[c/8] & (1 << (c&7))) == 0) break;
+            eptr++;
+            }
+          while (eptr >= pp)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            eptr--;
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            }
+          }
+
+        RRETURN(MATCH_NOMATCH);
+        }
+      }
+    /* Control never gets here */
+
+
+    /* Match an extended character class. This opcode is encountered only
+    in UTF-8 mode, because that's the only time it is compiled. */
+
+#ifdef SUPPORT_UTF8
+    case OP_XCLASS:
+      {
+      data = ecode + 1 + LINK_SIZE;                /* Save for matching */
+      ecode += GET(ecode, 1);                      /* Advance past the item */
+
+      switch (*ecode)
+        {
+        case OP_CRSTAR:
+        case OP_CRMINSTAR:
+        case OP_CRPLUS:
+        case OP_CRMINPLUS:
+        case OP_CRQUERY:
+        case OP_CRMINQUERY:
+        c = *ecode++ - OP_CRSTAR;
+        minimize = (c & 1) != 0;
+        min = rep_min[c];                 /* Pick up values from tables; */
+        max = rep_max[c];                 /* zero for max => infinity */
+        if (max == 0) max = INT_MAX;
+        break;
+
+        case OP_CRRANGE:
+        case OP_CRMINRANGE:
+        minimize = (*ecode == OP_CRMINRANGE);
+        min = GET2(ecode, 1);
+        max = GET2(ecode, 3);
+        if (max == 0) max = INT_MAX;
+        ecode += 5;
+        break;
+
+        default:               /* No repeat follows */
+        min = max = 1;
+        break;
+        }
+
+      /* First, ensure the minimum number of matches are present. */
+
+      for (i = 1; i <= min; i++)
+        {
+        if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+        GETCHARINC(c, eptr);
+        if (!match_xclass(c, data)) RRETURN(MATCH_NOMATCH);
+        }
+
+      /* If max == min we can continue with the main loop without the
+      need to recurse. */
+
+      if (min == max) continue;
+
+      /* If minimizing, keep testing the rest of the expression and advancing
+      the pointer while it matches the class. */
+
+      if (minimize)
+        {
+        for (fi = min;; fi++)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+          GETCHARINC(c, eptr);
+          if (!match_xclass(c, data)) RRETURN(MATCH_NOMATCH);
+          }
+        /* Control never gets here */
+        }
+
+      /* If maximizing, find the longest possible run, then work backwards. */
+
+      else
+        {
+        pp = eptr;
+        for (i = min; i < max; i++)
+          {
+          int len = 1;
+          if (eptr >= md->end_subject) break;
+          GETCHARLEN(c, eptr, len);
+          if (!match_xclass(c, data)) break;
+          eptr += len;
+          }
+        for(;;)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (eptr-- == pp) break;        /* Stop if tried at original pos */
+          BACKCHAR(eptr)
+          }
+        RRETURN(MATCH_NOMATCH);
+        }
+
+      /* Control never gets here */
+      }
+#endif    /* End of XCLASS */
+
+    /* Match a single character, casefully */
+
+    case OP_CHAR:
+#ifdef SUPPORT_UTF8
+    if (md->utf8)
+      {
+      length = 1;
+      ecode++;
+      GETCHARLEN(fc, ecode, length);
+      if (length > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+      while (length-- > 0) if (*ecode++ != *eptr++) RRETURN(MATCH_NOMATCH);
+      }
+    else
+#endif
+
+    /* Non-UTF-8 mode */
+      {
+      if (md->end_subject - eptr < 1) RRETURN(MATCH_NOMATCH);
+      if (ecode[1] != *eptr++) RRETURN(MATCH_NOMATCH);
+      ecode += 2;
+      }
+    break;
+
+    /* Match a single character, caselessly */
+
+    case OP_CHARNC:
+#ifdef SUPPORT_UTF8
+    if (md->utf8)
+      {
+      length = 1;
+      ecode++;
+      GETCHARLEN(fc, ecode, length);
+
+      if (length > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+
+      /* If the pattern character's value is < 128, we have only one byte, and
+      can use the fast lookup table. */
+
+      if (fc < 128)
+        {
+        if (md->lcc[*ecode++] != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);
+        }
+
+      /* Otherwise we must pick up the subject character */
+
+      else
+        {
+        int dc;
+        GETCHARINC(dc, eptr);
+        ecode += length;
+
+        /* If we have Unicode property support, we can use it to test the other
+        case of the character, if there is one. The result of ucp_findchar() is
+        < 0 if the char isn't found, and othercase is returned as zero if there
+        isn't one. */
+
+        if (fc != dc)
+          {
+#ifdef SUPPORT_UCP
+          int chartype;
+          int othercase;
+          if (ucp_findchar(fc, &chartype, &othercase) < 0 || dc != othercase)
+#endif
+            RRETURN(MATCH_NOMATCH);
+          }
+        }
+      }
+    else
+#endif   /* SUPPORT_UTF8 */
+
+    /* Non-UTF-8 mode */
+      {
+      if (md->end_subject - eptr < 1) RRETURN(MATCH_NOMATCH);
+      if (md->lcc[ecode[1]] != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);
+      ecode += 2;
+      }
+    break;
+
+    /* Match a single character repeatedly; different opcodes share code. */
+
+    case OP_EXACT:
+    min = max = GET2(ecode, 1);
+    ecode += 3;
+    goto REPEATCHAR;
+
+    case OP_UPTO:
+    case OP_MINUPTO:
+    min = 0;
+    max = GET2(ecode, 1);
+    minimize = *ecode == OP_MINUPTO;
+    ecode += 3;
+    goto REPEATCHAR;
+
+    case OP_STAR:
+    case OP_MINSTAR:
+    case OP_PLUS:
+    case OP_MINPLUS:
+    case OP_QUERY:
+    case OP_MINQUERY:
+    c = *ecode++ - OP_STAR;
+    minimize = (c & 1) != 0;
+    min = rep_min[c];                 /* Pick up values from tables; */
+    max = rep_max[c];                 /* zero for max => infinity */
+    if (max == 0) max = INT_MAX;
+
+    /* Common code for all repeated single-character matches. We can give
+    up quickly if there are fewer than the minimum number of characters left in
+    the subject. */
+
+    REPEATCHAR:
+#ifdef SUPPORT_UTF8
+    if (md->utf8)
+      {
+      length = 1;
+      charptr = ecode;
+      GETCHARLEN(fc, ecode, length);
+      if (min * length > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+      ecode += length;
+
+      /* Handle multibyte character matching specially here. There is
+      support for caseless matching if UCP support is present. */
+
+      if (length > 1)
+        {
+        int oclength = 0;
+        uschar occhars[8];
+
+#ifdef SUPPORT_UCP
+        int othercase;
+        int chartype;
+        if ((ims & PCRE_CASELESS) != 0 &&
+             ucp_findchar(fc, &chartype, &othercase) >= 0 &&
+             othercase > 0)
+          oclength = ord2utf8(othercase, occhars);
+#endif  /* SUPPORT_UCP */
+
+        for (i = 1; i <= min; i++)
+          {
+          if (memcmp(eptr, charptr, length) == 0) eptr += length;
+          /* Need braces because of following else */
+          else if (oclength == 0) { RRETURN(MATCH_NOMATCH); }
+          else
+            {
+            if (memcmp(eptr, occhars, oclength) != 0) RRETURN(MATCH_NOMATCH);
+            eptr += oclength;
+            }
+          }
+
+        if (min == max) continue;
+
+        if (minimize)
+          {
+          for (fi = min;; fi++)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+            if (memcmp(eptr, charptr, length) == 0) eptr += length;
+            /* Need braces because of following else */
+            else if (oclength == 0) { RRETURN(MATCH_NOMATCH); }
+            else
+              {
+              if (memcmp(eptr, occhars, oclength) != 0) RRETURN(MATCH_NOMATCH);
+              eptr += oclength;
+              }
+            }
+          /* Control never gets here */
+          }
+        else
+          {
+          pp = eptr;
+          for (i = min; i < max; i++)
+            {
+            if (eptr > md->end_subject - length) break;
+            if (memcmp(eptr, charptr, length) == 0) eptr += length;
+            else if (oclength == 0) break;
+            else
+              {
+              if (memcmp(eptr, occhars, oclength) != 0) break;
+              eptr += oclength;
+              }
+            }
+          while (eptr >= pp)
+           {
+           RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+           if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+           eptr -= length;
+           }
+          RRETURN(MATCH_NOMATCH);
+          }
+        /* Control never gets here */
+        }
+
+      /* If the length of a UTF-8 character is 1, we fall through here, and
+      obey the code as for non-UTF-8 characters below, though in this case the
+      value of fc will always be < 128. */
+      }
+    else
+#endif  /* SUPPORT_UTF8 */
+
+    /* When not in UTF-8 mode, load a single-byte character. */
+      {
+      if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+      fc = *ecode++;
+      }
+
+    /* The value of fc at this point is always less than 256, though we may or
+    may not be in UTF-8 mode. The code is duplicated for the caseless and
+    caseful cases, for speed, since matching characters is likely to be quite
+    common. First, ensure the minimum number of matches are present. If min =
+    max, continue at the same level without recursing. Otherwise, if
+    minimizing, keep trying the rest of the expression and advancing one
+    matching character if failing, up to the maximum. Alternatively, if
+    maximizing, find the maximum number of characters and work backwards. */
+
+    DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
+      max, eptr));
+
+    if ((ims & PCRE_CASELESS) != 0)
+      {
+      fc = md->lcc[fc];
+      for (i = 1; i <= min; i++)
+        if (fc != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);
+      if (min == max) continue;
+      if (minimize)
+        {
+        for (fi = min;; fi++)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (fi >= max || eptr >= md->end_subject ||
+              fc != md->lcc[*eptr++])
+            RRETURN(MATCH_NOMATCH);
+          }
+        /* Control never gets here */
+        }
+      else
+        {
+        pp = eptr;
+        for (i = min; i < max; i++)
+          {
+          if (eptr >= md->end_subject || fc != md->lcc[*eptr]) break;
+          eptr++;
+          }
+        while (eptr >= pp)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          eptr--;
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          }
+        RRETURN(MATCH_NOMATCH);
+        }
+      /* Control never gets here */
+      }
+
+    /* Caseful comparisons (includes all multi-byte characters) */
+
+    else
+      {
+      for (i = 1; i <= min; i++) if (fc != *eptr++) RRETURN(MATCH_NOMATCH);
+      if (min == max) continue;
+      if (minimize)
+        {
+        for (fi = min;; fi++)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (fi >= max || eptr >= md->end_subject || fc != *eptr++)
+            RRETURN(MATCH_NOMATCH);
+          }
+        /* Control never gets here */
+        }
+      else
+        {
+        pp = eptr;
+        for (i = min; i < max; i++)
+          {
+          if (eptr >= md->end_subject || fc != *eptr) break;
+          eptr++;
+          }
+        while (eptr >= pp)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          eptr--;
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          }
+        RRETURN(MATCH_NOMATCH);
+        }
+      }
+    /* Control never gets here */
+
+    /* Match a negated single one-byte character. The character we are
+    checking can be multibyte. */
+
+    case OP_NOT:
+    if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+    ecode++;
+    GETCHARINCTEST(c, eptr);
+    if ((ims & PCRE_CASELESS) != 0)
+      {
+#ifdef SUPPORT_UTF8
+      if (c < 256)
+#endif
+      c = md->lcc[c];
+      if (md->lcc[*ecode++] == c) RRETURN(MATCH_NOMATCH);
+      }
+    else
+      {
+      if (*ecode++ == c) RRETURN(MATCH_NOMATCH);
+      }
+    break;
+
+    /* Match a negated single one-byte character repeatedly. This is almost a
+    repeat of the code for a repeated single character, but I haven't found a
+    nice way of commoning these up that doesn't require a test of the
+    positive/negative option for each character match. Maybe that wouldn't add
+    very much to the time taken, but character matching *is* what this is all
+    about... */
+
+    case OP_NOTEXACT:
+    min = max = GET2(ecode, 1);
+    ecode += 3;
+    goto REPEATNOTCHAR;
+
+    case OP_NOTUPTO:
+    case OP_NOTMINUPTO:
+    min = 0;
+    max = GET2(ecode, 1);
+    minimize = *ecode == OP_NOTMINUPTO;
+    ecode += 3;
+    goto REPEATNOTCHAR;
+
+    case OP_NOTSTAR:
+    case OP_NOTMINSTAR:
+    case OP_NOTPLUS:
+    case OP_NOTMINPLUS:
+    case OP_NOTQUERY:
+    case OP_NOTMINQUERY:
+    c = *ecode++ - OP_NOTSTAR;
+    minimize = (c & 1) != 0;
+    min = rep_min[c];                 /* Pick up values from tables; */
+    max = rep_max[c];                 /* zero for max => infinity */
+    if (max == 0) max = INT_MAX;
+
+    /* Common code for all repeated single-byte matches. We can give up quickly
+    if there are fewer than the minimum number of bytes left in the
+    subject. */
+
+    REPEATNOTCHAR:
+    if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+    fc = *ecode++;
+
+    /* The code is duplicated for the caseless and caseful cases, for speed,
+    since matching characters is likely to be quite common. First, ensure the
+    minimum number of matches are present. If min = max, continue at the same
+    level without recursing. Otherwise, if minimizing, keep trying the rest of
+    the expression and advancing one matching character if failing, up to the
+    maximum. Alternatively, if maximizing, find the maximum number of
+    characters and work backwards. */
+
+    DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
+      max, eptr));
+
+    if ((ims & PCRE_CASELESS) != 0)
+      {
+      fc = md->lcc[fc];
+
+#ifdef SUPPORT_UTF8
+      /* UTF-8 mode */
+      if (md->utf8)
+        {
+        register int d;
+        for (i = 1; i <= min; i++)
+          {
+          GETCHARINC(d, eptr);
+          if (d < 256) d = md->lcc[d];
+          if (fc == d) RRETURN(MATCH_NOMATCH);
+          }
+        }
+      else
+#endif
+
+      /* Not UTF-8 mode */
+        {
+        for (i = 1; i <= min; i++)
+          if (fc == md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);
+        }
+
+      if (min == max) continue;
+
+      if (minimize)
+        {
+#ifdef SUPPORT_UTF8
+        /* UTF-8 mode */
+        if (md->utf8)
+          {
+          register int d;
+          for (fi = min;; fi++)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            GETCHARINC(d, eptr);
+            if (d < 256) d = md->lcc[d];
+            if (fi >= max || eptr >= md->end_subject || fc == d)
+              RRETURN(MATCH_NOMATCH);
+            }
+          }
+        else
+#endif
+        /* Not UTF-8 mode */
+          {
+          for (fi = min;; fi++)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            if (fi >= max || eptr >= md->end_subject || fc == md->lcc[*eptr++])
+              RRETURN(MATCH_NOMATCH);
+            }
+          }
+        /* Control never gets here */
+        }
+
+      /* Maximize case */
+
+      else
+        {
+        pp = eptr;
+
+#ifdef SUPPORT_UTF8
+        /* UTF-8 mode */
+        if (md->utf8)
+          {
+          register int d;
+          for (i = min; i < max; i++)
+            {
+            int len = 1;
+            if (eptr >= md->end_subject) break;
+            GETCHARLEN(d, eptr, len);
+            if (d < 256) d = md->lcc[d];
+            if (fc == d) break;
+            eptr += len;
+            }
+          for(;;)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            if (eptr-- == pp) break;        /* Stop if tried at original pos */
+            BACKCHAR(eptr);
+            }
+          }
+        else
+#endif
+        /* Not UTF-8 mode */
+          {
+          for (i = min; i < max; i++)
+            {
+            if (eptr >= md->end_subject || fc == md->lcc[*eptr]) break;
+            eptr++;
+            }
+          while (eptr >= pp)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            eptr--;
+            }
+          }
+
+        RRETURN(MATCH_NOMATCH);
+        }
+      /* Control never gets here */
+      }
+
+    /* Caseful comparisons */
+
+    else
+      {
+#ifdef SUPPORT_UTF8
+      /* UTF-8 mode */
+      if (md->utf8)
+        {
+        register int d;
+        for (i = 1; i <= min; i++)
+          {
+          GETCHARINC(d, eptr);
+          if (fc == d) RRETURN(MATCH_NOMATCH);
+          }
+        }
+      else
+#endif
+      /* Not UTF-8 mode */
+        {
+        for (i = 1; i <= min; i++)
+          if (fc == *eptr++) RRETURN(MATCH_NOMATCH);
+        }
+
+      if (min == max) continue;
+
+      if (minimize)
+        {
+#ifdef SUPPORT_UTF8
+        /* UTF-8 mode */
+        if (md->utf8)
+          {
+          register int d;
+          for (fi = min;; fi++)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            GETCHARINC(d, eptr);
+            if (fi >= max || eptr >= md->end_subject || fc == d)
+              RRETURN(MATCH_NOMATCH);
+            }
+          }
+        else
+#endif
+        /* Not UTF-8 mode */
+          {
+          for (fi = min;; fi++)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            if (fi >= max || eptr >= md->end_subject || fc == *eptr++)
+              RRETURN(MATCH_NOMATCH);
+            }
+          }
+        /* Control never gets here */
+        }
+
+      /* Maximize case */
+
+      else
+        {
+        pp = eptr;
+
+#ifdef SUPPORT_UTF8
+        /* UTF-8 mode */
+        if (md->utf8)
+          {
+          register int d;
+          for (i = min; i < max; i++)
+            {
+            int len = 1;
+            if (eptr >= md->end_subject) break;
+            GETCHARLEN(d, eptr, len);
+            if (fc == d) break;
+            eptr += len;
+            }
+          for(;;)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            if (eptr-- == pp) break;        /* Stop if tried at original pos */
+            BACKCHAR(eptr);
+            }
+          }
+        else
+#endif
+        /* Not UTF-8 mode */
+          {
+          for (i = min; i < max; i++)
+            {
+            if (eptr >= md->end_subject || fc == *eptr) break;
+            eptr++;
+            }
+          while (eptr >= pp)
+            {
+            RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+            eptr--;
+            }
+          }
+
+        RRETURN(MATCH_NOMATCH);
+        }
+      }
+    /* Control never gets here */
+
+    /* Match a single character type repeatedly; several different opcodes
+    share code. This is very similar to the code for single characters, but we
+    repeat it in the interests of efficiency. */
+
+    case OP_TYPEEXACT:
+    min = max = GET2(ecode, 1);
+    minimize = TRUE;
+    ecode += 3;
+    goto REPEATTYPE;
+
+    case OP_TYPEUPTO:
+    case OP_TYPEMINUPTO:
+    min = 0;
+    max = GET2(ecode, 1);
+    minimize = *ecode == OP_TYPEMINUPTO;
+    ecode += 3;
+    goto REPEATTYPE;
+
+    case OP_TYPESTAR:
+    case OP_TYPEMINSTAR:
+    case OP_TYPEPLUS:
+    case OP_TYPEMINPLUS:
+    case OP_TYPEQUERY:
+    case OP_TYPEMINQUERY:
+    c = *ecode++ - OP_TYPESTAR;
+    minimize = (c & 1) != 0;
+    min = rep_min[c];                 /* Pick up values from tables; */
+    max = rep_max[c];                 /* zero for max => infinity */
+    if (max == 0) max = INT_MAX;
+
+    /* Common code for all repeated single character type matches. Note that
+    in UTF-8 mode, '.' matches a character of any length, but for the other
+    character types, the valid characters are all one-byte long. */
+
+    REPEATTYPE:
+    ctype = *ecode++;      /* Code for the character type */
+
+#ifdef SUPPORT_UCP
+    if (ctype == OP_PROP || ctype == OP_NOTPROP)
+      {
+      prop_fail_result = ctype == OP_NOTPROP;
+      prop_type = *ecode++;
+      if (prop_type >= 128)
+        {
+        prop_test_against = prop_type - 128;
+        prop_test_variable = &prop_category;
+        }
+      else
+        {
+        prop_test_against = prop_type;
+        prop_test_variable = &prop_chartype;
+        }
+      }
+    else prop_type = -1;
+#endif
+
+    /* First, ensure the minimum number of matches are present. Use inline
+    code for maximizing the speed, and do the type test once at the start
+    (i.e. keep it out of the loop). Also we can test that there are at least
+    the minimum number of bytes before we start. This isn't as effective in
+    UTF-8 mode, but it does no harm. Separate the UTF-8 code completely as that
+    is tidier. Also separate the UCP code, which can be the same for both UTF-8
+    and single-bytes. */
+
+    if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+    if (min > 0)
+      {
+#ifdef SUPPORT_UCP
+      if (prop_type > 0)
+        {
+        for (i = 1; i <= min; i++)
+          {
+          GETCHARINC(c, eptr);
+          prop_category = ucp_findchar(c, &prop_chartype, &prop_othercase);
+          if ((*prop_test_variable == prop_test_against) == prop_fail_result)
+            RRETURN(MATCH_NOMATCH);
+          }
+        }
+
+      /* Match extended Unicode sequences. We will get here only if the
+      support is in the binary; otherwise a compile-time error occurs. */
+
+      else if (ctype == OP_EXTUNI)
+        {
+        for (i = 1; i <= min; i++)
+          {
+          GETCHARINCTEST(c, eptr);
+          prop_category = ucp_findchar(c, &prop_chartype, &prop_othercase);
+          if (prop_category == ucp_M) RRETURN(MATCH_NOMATCH);
+          while (eptr < md->end_subject)
+            {
+            int len = 1;
+            if (!md->utf8) c = *eptr; else
+              {
+              GETCHARLEN(c, eptr, len);
+              }
+            prop_category = ucp_findchar(c, &prop_chartype, &prop_othercase);
+            if (prop_category != ucp_M) break;
+            eptr += len;
+            }
+          }
+        }
+
+      else
+#endif     /* SUPPORT_UCP */
+
+/* Handle all other cases when the coding is UTF-8 */
+
+#ifdef SUPPORT_UTF8
+      if (md->utf8) switch(ctype)
+        {
+        case OP_ANY:
+        for (i = 1; i <= min; i++)
+          {
+          if (eptr >= md->end_subject ||
+             (*eptr++ == NEWLINE && (ims & PCRE_DOTALL) == 0))
+            RRETURN(MATCH_NOMATCH);
+          while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+          }
+        break;
+
+        case OP_ANYBYTE:
+        eptr += min;
+        break;
+
+        case OP_NOT_DIGIT:
+        for (i = 1; i <= min; i++)
+          {
+          if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+          GETCHARINC(c, eptr);
+          if (c < 128 && (md->ctypes[c] & ctype_digit) != 0)
+            RRETURN(MATCH_NOMATCH);
+          }
+        break;
+
+        case OP_DIGIT:
+        for (i = 1; i <= min; i++)
+          {
+          if (eptr >= md->end_subject ||
+             *eptr >= 128 || (md->ctypes[*eptr++] & ctype_digit) == 0)
+            RRETURN(MATCH_NOMATCH);
+          /* No need to skip more bytes - we know it's a 1-byte character */
+          }
+        break;
+
+        case OP_NOT_WHITESPACE:
+        for (i = 1; i <= min; i++)
+          {
+          if (eptr >= md->end_subject ||
+             (*eptr < 128 && (md->ctypes[*eptr++] & ctype_space) != 0))
+            RRETURN(MATCH_NOMATCH);
+          while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+          }
+        break;
+
+        case OP_WHITESPACE:
+        for (i = 1; i <= min; i++)
+          {
+          if (eptr >= md->end_subject ||
+             *eptr >= 128 || (md->ctypes[*eptr++] & ctype_space) == 0)
+            RRETURN(MATCH_NOMATCH);
+          /* No need to skip more bytes - we know it's a 1-byte character */
+          }
+        break;
+
+        case OP_NOT_WORDCHAR:
+        for (i = 1; i <= min; i++)
+          {
+          if (eptr >= md->end_subject ||
+             (*eptr < 128 && (md->ctypes[*eptr++] & ctype_word) != 0))
+            RRETURN(MATCH_NOMATCH);
+          while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+          }
+        break;
+
+        case OP_WORDCHAR:
+        for (i = 1; i <= min; i++)
+          {
+          if (eptr >= md->end_subject ||
+             *eptr >= 128 || (md->ctypes[*eptr++] & ctype_word) == 0)
+            RRETURN(MATCH_NOMATCH);
+          /* No need to skip more bytes - we know it's a 1-byte character */
+          }
+        break;
+
+        default:
+        RRETURN(PCRE_ERROR_INTERNAL);
+        }  /* End switch(ctype) */
+
+      else
+#endif     /* SUPPORT_UTF8 */
+
+      /* Code for the non-UTF-8 case for minimum matching of operators other
+      than OP_PROP and OP_NOTPROP. */
+
+      switch(ctype)
+        {
+        case OP_ANY:
+        if ((ims & PCRE_DOTALL) == 0)
+          {
+          for (i = 1; i <= min; i++)
+            if (*eptr++ == NEWLINE) RRETURN(MATCH_NOMATCH);
+          }
+        else eptr += min;
+        break;
+
+        case OP_ANYBYTE:
+        eptr += min;
+        break;
+
+        case OP_NOT_DIGIT:
+        for (i = 1; i <= min; i++)
+          if ((md->ctypes[*eptr++] & ctype_digit) != 0) RRETURN(MATCH_NOMATCH);
+        break;
+
+        case OP_DIGIT:
+        for (i = 1; i <= min; i++)
+          if ((md->ctypes[*eptr++] & ctype_digit) == 0) RRETURN(MATCH_NOMATCH);
+        break;
+
+        case OP_NOT_WHITESPACE:
+        for (i = 1; i <= min; i++)
+          if ((md->ctypes[*eptr++] & ctype_space) != 0) RRETURN(MATCH_NOMATCH);
+        break;
+
+        case OP_WHITESPACE:
+        for (i = 1; i <= min; i++)
+          if ((md->ctypes[*eptr++] & ctype_space) == 0) RRETURN(MATCH_NOMATCH);
+        break;
+
+        case OP_NOT_WORDCHAR:
+        for (i = 1; i <= min; i++)
+          if ((md->ctypes[*eptr++] & ctype_word) != 0)
+            RRETURN(MATCH_NOMATCH);
+        break;
+
+        case OP_WORDCHAR:
+        for (i = 1; i <= min; i++)
+          if ((md->ctypes[*eptr++] & ctype_word) == 0)
+            RRETURN(MATCH_NOMATCH);
+        break;
+
+        default:
+        RRETURN(PCRE_ERROR_INTERNAL);
+        }
+      }
+
+    /* If min = max, continue at the same level without recursing */
+
+    if (min == max) continue;
+
+    /* If minimizing, we have to test the rest of the pattern before each
+    subsequent match. Again, separate the UTF-8 case for speed, and also
+    separate the UCP cases. */
+
+    if (minimize)
+      {
+#ifdef SUPPORT_UCP
+      if (prop_type > 0)
+        {
+        for (fi = min;; fi++)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+          GETCHARINC(c, eptr);
+          prop_category = ucp_findchar(c, &prop_chartype, &prop_othercase);
+          if ((*prop_test_variable == prop_test_against) == prop_fail_result)
+            RRETURN(MATCH_NOMATCH);
+          }
+        }
+
+      /* Match extended Unicode sequences. We will get here only if the
+      support is in the binary; otherwise a compile-time error occurs. */
+
+      else if (ctype == OP_EXTUNI)
+        {
+        for (fi = min;; fi++)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+          GETCHARINCTEST(c, eptr);
+          prop_category = ucp_findchar(c, &prop_chartype, &prop_othercase);
+          if (prop_category == ucp_M) RRETURN(MATCH_NOMATCH);
+          while (eptr < md->end_subject)
+            {
+            int len = 1;
+            if (!md->utf8) c = *eptr; else
+              {
+              GETCHARLEN(c, eptr, len);
+              }
+            prop_category = ucp_findchar(c, &prop_chartype, &prop_othercase);
+            if (prop_category != ucp_M) break;
+            eptr += len;
+            }
+          }
+        }
+
+      else
+#endif     /* SUPPORT_UCP */
+
+#ifdef SUPPORT_UTF8
+      /* UTF-8 mode */
+      if (md->utf8)
+        {
+        for (fi = min;; fi++)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+
+          GETCHARINC(c, eptr);
+          switch(ctype)
+            {
+            case OP_ANY:
+            if ((ims & PCRE_DOTALL) == 0 && c == NEWLINE) RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_ANYBYTE:
+            break;
+
+            case OP_NOT_DIGIT:
+            if (c < 256 && (md->ctypes[c] & ctype_digit) != 0)
+              RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_DIGIT:
+            if (c >= 256 || (md->ctypes[c] & ctype_digit) == 0)
+              RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_NOT_WHITESPACE:
+            if (c < 256 && (md->ctypes[c] & ctype_space) != 0)
+              RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_WHITESPACE:
+            if  (c >= 256 || (md->ctypes[c] & ctype_space) == 0)
+              RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_NOT_WORDCHAR:
+            if (c < 256 && (md->ctypes[c] & ctype_word) != 0)
+              RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_WORDCHAR:
+            if (c >= 256 && (md->ctypes[c] & ctype_word) == 0)
+              RRETURN(MATCH_NOMATCH);
+            break;
+
+            default:
+            RRETURN(PCRE_ERROR_INTERNAL);
+            }
+          }
+        }
+      else
+#endif
+      /* Not UTF-8 mode */
+        {
+        for (fi = min;; fi++)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+          c = *eptr++;
+          switch(ctype)
+            {
+            case OP_ANY:
+            if ((ims & PCRE_DOTALL) == 0 && c == NEWLINE) RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_ANYBYTE:
+            break;
+
+            case OP_NOT_DIGIT:
+            if ((md->ctypes[c] & ctype_digit) != 0) RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_DIGIT:
+            if ((md->ctypes[c] & ctype_digit) == 0) RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_NOT_WHITESPACE:
+            if ((md->ctypes[c] & ctype_space) != 0) RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_WHITESPACE:
+            if  ((md->ctypes[c] & ctype_space) == 0) RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_NOT_WORDCHAR:
+            if ((md->ctypes[c] & ctype_word) != 0) RRETURN(MATCH_NOMATCH);
+            break;
+
+            case OP_WORDCHAR:
+            if ((md->ctypes[c] & ctype_word) == 0) RRETURN(MATCH_NOMATCH);
+            break;
+
+            default:
+            RRETURN(PCRE_ERROR_INTERNAL);
+            }
+          }
+        }
+      /* Control never gets here */
+      }
+
+    /* If maximizing it is worth using inline code for speed, doing the type
+    test once at the start (i.e. keep it out of the loop). Again, keep the
+    UTF-8 and UCP stuff separate. */
+
+    else
+      {
+      pp = eptr;  /* Remember where we started */
+
+#ifdef SUPPORT_UCP
+      if (prop_type > 0)
+        {
+        for (i = min; i < max; i++)
+          {
+          int len = 1;
+          if (eptr >= md->end_subject) break;
+          GETCHARLEN(c, eptr, len);
+          prop_category = ucp_findchar(c, &prop_chartype, &prop_othercase);
+          if ((*prop_test_variable == prop_test_against) == prop_fail_result)
+            break;
+          eptr+= len;
+          }
+
+        /* eptr is now past the end of the maximum run */
+
+        for(;;)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (eptr-- == pp) break;        /* Stop if tried at original pos */
+          BACKCHAR(eptr);
+          }
+        }
+
+      /* Match extended Unicode sequences. We will get here only if the
+      support is in the binary; otherwise a compile-time error occurs. */
+
+      else if (ctype == OP_EXTUNI)
+        {
+        for (i = min; i < max; i++)
+          {
+          if (eptr >= md->end_subject) break;
+          GETCHARINCTEST(c, eptr);
+          prop_category = ucp_findchar(c, &prop_chartype, &prop_othercase);
+          if (prop_category == ucp_M) break;
+          while (eptr < md->end_subject)
+            {
+            int len = 1;
+            if (!md->utf8) c = *eptr; else
+              {
+              GETCHARLEN(c, eptr, len);
+              }
+            prop_category = ucp_findchar(c, &prop_chartype, &prop_othercase);
+            if (prop_category != ucp_M) break;
+            eptr += len;
+            }
+          }
+
+        /* eptr is now past the end of the maximum run */
+
+        for(;;)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (eptr-- == pp) break;        /* Stop if tried at original pos */
+          for (;;)                        /* Move back over one extended */
+            {
+            int len = 1;
+            BACKCHAR(eptr);
+            if (!md->utf8) c = *eptr; else
+              {
+              GETCHARLEN(c, eptr, len);
+              }
+            prop_category = ucp_findchar(c, &prop_chartype, &prop_othercase);
+            if (prop_category != ucp_M) break;
+            eptr--;
+            }
+          }
+        }
+
+      else
+#endif   /* SUPPORT_UCP */
+
+#ifdef SUPPORT_UTF8
+      /* UTF-8 mode */
+
+      if (md->utf8)
+        {
+        switch(ctype)
+          {
+          case OP_ANY:
+
+          /* Special code is required for UTF8, but when the maximum is unlimited
+          we don't need it, so we repeat the non-UTF8 code. This is probably
+          worth it, because .* is quite a common idiom. */
+
+          if (max < INT_MAX)
+            {
+            if ((ims & PCRE_DOTALL) == 0)
+              {
+              for (i = min; i < max; i++)
+                {
+                if (eptr >= md->end_subject || *eptr == NEWLINE) break;
+                eptr++;
+                while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+                }
+              }
+            else
+              {
+              for (i = min; i < max; i++)
+                {
+                eptr++;
+                while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+                }
+              }
+            }
+
+          /* Handle unlimited UTF-8 repeat */
+
+          else
+            {
+            if ((ims & PCRE_DOTALL) == 0)
+              {
+              for (i = min; i < max; i++)
+                {
+                if (eptr >= md->end_subject || *eptr == NEWLINE) break;
+                eptr++;
+                }
+              break;
+              }
+            else
+              {
+              c = max - min;
+              if (c > md->end_subject - eptr) c = md->end_subject - eptr;
+              eptr += c;
+              }
+            }
+          break;
+
+          /* The byte case is the same as non-UTF8 */
+
+          case OP_ANYBYTE:
+          c = max - min;
+          if (c > md->end_subject - eptr) c = md->end_subject - eptr;
+          eptr += c;
+          break;
+
+          case OP_NOT_DIGIT:
+          for (i = min; i < max; i++)
+            {
+            int len = 1;
+            if (eptr >= md->end_subject) break;
+            GETCHARLEN(c, eptr, len);
+            if (c < 256 && (md->ctypes[c] & ctype_digit) != 0) break;
+            eptr+= len;
+            }
+          break;
+
+          case OP_DIGIT:
+          for (i = min; i < max; i++)
+            {
+            int len = 1;
+            if (eptr >= md->end_subject) break;
+            GETCHARLEN(c, eptr, len);
+            if (c >= 256 ||(md->ctypes[c] & ctype_digit) == 0) break;
+            eptr+= len;
+            }
+          break;
+
+          case OP_NOT_WHITESPACE:
+          for (i = min; i < max; i++)
+            {
+            int len = 1;
+            if (eptr >= md->end_subject) break;
+            GETCHARLEN(c, eptr, len);
+            if (c < 256 && (md->ctypes[c] & ctype_space) != 0) break;
+            eptr+= len;
+            }
+          break;
+
+          case OP_WHITESPACE:
+          for (i = min; i < max; i++)
+            {
+            int len = 1;
+            if (eptr >= md->end_subject) break;
+            GETCHARLEN(c, eptr, len);
+            if (c >= 256 ||(md->ctypes[c] & ctype_space) == 0) break;
+            eptr+= len;
+            }
+          break;
+
+          case OP_NOT_WORDCHAR:
+          for (i = min; i < max; i++)
+            {
+            int len = 1;
+            if (eptr >= md->end_subject) break;
+            GETCHARLEN(c, eptr, len);
+            if (c < 256 && (md->ctypes[c] & ctype_word) != 0) break;
+            eptr+= len;
+            }
+          break;
+
+          case OP_WORDCHAR:
+          for (i = min; i < max; i++)
+            {
+            int len = 1;
+            if (eptr >= md->end_subject) break;
+            GETCHARLEN(c, eptr, len);
+            if (c >= 256 || (md->ctypes[c] & ctype_word) == 0) break;
+            eptr+= len;
+            }
+          break;
+
+          default:
+          RRETURN(PCRE_ERROR_INTERNAL);
+          }
+
+        /* eptr is now past the end of the maximum run */
+
+        for(;;)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          if (eptr-- == pp) break;        /* Stop if tried at original pos */
+          BACKCHAR(eptr);
+          }
+        }
+      else
+#endif
+
+      /* Not UTF-8 mode */
+        {
+        switch(ctype)
+          {
+          case OP_ANY:
+          if ((ims & PCRE_DOTALL) == 0)
+            {
+            for (i = min; i < max; i++)
+              {
+              if (eptr >= md->end_subject || *eptr == NEWLINE) break;
+              eptr++;
+              }
+            break;
+            }
+          /* For DOTALL case, fall through and treat as \C */
+
+          case OP_ANYBYTE:
+          c = max - min;
+          if (c > md->end_subject - eptr) c = md->end_subject - eptr;
+          eptr += c;
+          break;
+
+          case OP_NOT_DIGIT:
+          for (i = min; i < max; i++)
+            {
+            if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_digit) != 0)
+              break;
+            eptr++;
+            }
+          break;
+
+          case OP_DIGIT:
+          for (i = min; i < max; i++)
+            {
+            if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_digit) == 0)
+              break;
+            eptr++;
+            }
+          break;
+
+          case OP_NOT_WHITESPACE:
+          for (i = min; i < max; i++)
+            {
+            if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_space) != 0)
+              break;
+            eptr++;
+            }
+          break;
+
+          case OP_WHITESPACE:
+          for (i = min; i < max; i++)
+            {
+            if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_space) == 0)
+              break;
+            eptr++;
+            }
+          break;
+
+          case OP_NOT_WORDCHAR:
+          for (i = min; i < max; i++)
+            {
+            if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_word) != 0)
+              break;
+            eptr++;
+            }
+          break;
+
+          case OP_WORDCHAR:
+          for (i = min; i < max; i++)
+            {
+            if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_word) == 0)
+              break;
+            eptr++;
+            }
+          break;
+
+          default:
+          RRETURN(PCRE_ERROR_INTERNAL);
+          }
+
+        /* eptr is now past the end of the maximum run */
+
+        while (eptr >= pp)
+          {
+          RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0);
+          eptr--;
+          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+          }
+        }
+
+      /* Get here if we can't make it match with any permitted repetitions */
+
+      RRETURN(MATCH_NOMATCH);
+      }
+    /* Control never gets here */
+
+    /* There's been some horrible disaster. Since all codes > OP_BRA are
+    for capturing brackets, and there shouldn't be any gaps between 0 and
+    OP_BRA, arrival here can only mean there is something seriously wrong
+    in the code above or the OP_xxx definitions. */
+
+    default:
+    DPRINTF(("Unknown opcode %d\n", *ecode));
+    RRETURN(PCRE_ERROR_UNKNOWN_NODE);
+    }
+
+  /* Do not stick any code in here without much thought; it is assumed
+  that "continue" in the code above comes out to here to repeat the main
+  loop. */
+
+  }             /* End of main loop */
+/* Control never reaches here */
+}
+
+
+/***************************************************************************
+****************************************************************************
+                   RECURSION IN THE match() FUNCTION
+
+Undefine all the macros that were defined above to handle this. */
+
+#ifdef NO_RECURSE
+#undef eptr
+#undef ecode
+#undef offset_top
+#undef ims
+#undef eptrb
+#undef flags
+
+#undef callpat
+#undef charptr
+#undef data
+#undef next
+#undef pp
+#undef prev
+#undef saved_eptr
+
+#undef new_recursive
+
+#undef cur_is_word
+#undef condition
+#undef minimize
+#undef prev_is_word
+
+#undef original_ims
+
+#undef ctype
+#undef length
+#undef max
+#undef min
+#undef number
+#undef offset
+#undef op
+#undef save_capture_last
+#undef save_offset1
+#undef save_offset2
+#undef save_offset3
+#undef stacksave
+
+#undef newptrb
+
+#endif
+
+/* These two are defined as macros in both cases */
+
+#undef fc
+#undef fi
+
+/***************************************************************************
+***************************************************************************/
+
+
+
+/*************************************************
+*         Execute a Regular Expression           *
+*************************************************/
+
+/* This function applies a compiled re to a subject string and picks out
+portions of the string if it matches. Two elements in the vector are set for
+each substring: the offsets to the start and end of the substring.
+
+Arguments:
+  argument_re     points to the compiled expression
+  extra_data      points to extra data or is NULL
+  subject         points to the subject string
+  length          length of subject string (may contain binary zeros)
+  start_offset    where to start in the subject string
+  options         option bits
+  offsets         points to a vector of ints to be filled in with offsets
+  offsetcount     the number of elements in the vector
+
+Returns:          > 0 => success; value is the number of elements filled in
+                  = 0 => success, but offsets is not big enough
+                   -1 => failed to match
+                 < -1 => some kind of unexpected problem
+*/
+
+EXPORT int
+pcre_exec(const pcre *argument_re, const pcre_extra *extra_data,
+  const char *subject, int length, int start_offset, int options, int *offsets,
+  int offsetcount)
+{
+int rc, resetcount, ocount;
+int first_byte = -1;
+int req_byte = -1;
+int req_byte2 = -1;
+unsigned long int ims = 0;
+BOOL using_temporary_offsets = FALSE;
+BOOL anchored;
+BOOL startline;
+BOOL first_byte_caseless = FALSE;
+BOOL req_byte_caseless = FALSE;
+match_data match_block;
+const uschar *tables;
+const uschar *start_bits = NULL;
+const uschar *start_match = (const uschar *)subject + start_offset;
+const uschar *end_subject;
+const uschar *req_byte_ptr = start_match - 1;
+
+pcre_study_data internal_study;
+const pcre_study_data *study;
+
+real_pcre internal_re;
+const real_pcre *external_re = (const real_pcre *)argument_re;
+const real_pcre *re = external_re;
+
+/* Plausibility checks */
+
+if ((options & ~PUBLIC_EXEC_OPTIONS) != 0) return PCRE_ERROR_BADOPTION;
+if (re == NULL || subject == NULL ||
+   (offsets == NULL && offsetcount > 0)) return PCRE_ERROR_NULL;
+if (offsetcount < 0) return PCRE_ERROR_BADCOUNT;
+
+/* Fish out the optional data from the extra_data structure, first setting
+the default values. */
+
+study = NULL;
+match_block.match_limit = MATCH_LIMIT;
+match_block.callout_data = NULL;
+
+/* The table pointer is always in native byte order. */
+
+tables = external_re->tables;
+
+if (extra_data != NULL)
+  {
+  register unsigned int flags = extra_data->flags;
+  if ((flags & PCRE_EXTRA_STUDY_DATA) != 0)
+    study = (const pcre_study_data *)extra_data->study_data;
+  if ((flags & PCRE_EXTRA_MATCH_LIMIT) != 0)
+    match_block.match_limit = extra_data->match_limit;
+  if ((flags & PCRE_EXTRA_CALLOUT_DATA) != 0)
+    match_block.callout_data = extra_data->callout_data;
+  if ((flags & PCRE_EXTRA_TABLES) != 0) tables = extra_data->tables;
+  }
+
+/* If the exec call supplied NULL for tables, use the inbuilt ones. This
+is a feature that makes it possible to save compiled regex and re-use them
+in other programs later. */
+
+if (tables == NULL) tables = pcre_default_tables;
+
+/* Check that the first field in the block is the magic number. If it is not,
+test for a regex that was compiled on a host of opposite endianness. If this is
+the case, flipped values are put in internal_re and internal_study if there was
+study data too. */
+
+if (re->magic_number != MAGIC_NUMBER)
+  {
+  re = try_flipped(re, &internal_re, study, &internal_study);
+  if (re == NULL) return PCRE_ERROR_BADMAGIC;
+  if (study != NULL) study = &internal_study;
+  }
+
+/* Set up other data */
+
+anchored = ((re->options | options) & PCRE_ANCHORED) != 0;
+startline = (re->options & PCRE_STARTLINE) != 0;
+
+/* The code starts after the real_pcre block and the capture name table. */
+
+match_block.start_code = (const uschar *)external_re + re->name_table_offset +
+  re->name_count * re->name_entry_size;
+
+match_block.start_subject = (const uschar *)subject;
+match_block.start_offset = start_offset;
+match_block.end_subject = match_block.start_subject + length;
+end_subject = match_block.end_subject;
+
+match_block.endonly = (re->options & PCRE_DOLLAR_ENDONLY) != 0;
+match_block.utf8 = (re->options & PCRE_UTF8) != 0;
+
+match_block.notbol = (options & PCRE_NOTBOL) != 0;
+match_block.noteol = (options & PCRE_NOTEOL) != 0;
+match_block.notempty = (options & PCRE_NOTEMPTY) != 0;
+match_block.partial = (options & PCRE_PARTIAL) != 0;
+match_block.hitend = FALSE;
+
+match_block.recursive = NULL;                   /* No recursion at top level */
+
+match_block.lcc = tables + lcc_offset;
+match_block.ctypes = tables + ctypes_offset;
+
+/* Partial matching is supported only for a restricted set of regexes at the
+moment. */
+
+if (match_block.partial && (re->options & PCRE_NOPARTIAL) != 0)
+  return PCRE_ERROR_BADPARTIAL;
+
+/* Check a UTF-8 string if required. Unfortunately there's no way of passing
+back the character offset. */
+
+#ifdef SUPPORT_UTF8
+if (match_block.utf8 && (options & PCRE_NO_UTF8_CHECK) == 0)
+  {
+  if (valid_utf8((uschar *)subject, length) >= 0)
+    return PCRE_ERROR_BADUTF8;
+  if (start_offset > 0 && start_offset < length)
+    {
+    int tb = ((uschar *)subject)[start_offset];
+    if (tb > 127)
+      {
+      tb &= 0xc0;
+      if (tb != 0 && tb != 0xc0) return PCRE_ERROR_BADUTF8_OFFSET;
+      }
+    }
+  }
+#endif
+
+/* The ims options can vary during the matching as a result of the presence
+of (?ims) items in the pattern. They are kept in a local variable so that
+restoring at the exit of a group is easy. */
+
+ims = re->options & (PCRE_CASELESS|PCRE_MULTILINE|PCRE_DOTALL);
+
+/* If the expression has got more back references than the offsets supplied can
+hold, we get a temporary chunk of working store to use during the matching.
+Otherwise, we can use the vector supplied, rounding down its size to a multiple
+of 3. */
+
+ocount = offsetcount - (offsetcount % 3);
+
+if (re->top_backref > 0 && re->top_backref >= ocount/3)
+  {
+  ocount = re->top_backref * 3 + 3;
+  match_block.offset_vector = (int *)(pcre_malloc)(ocount * sizeof(int));
+  if (match_block.offset_vector == NULL) return PCRE_ERROR_NOMEMORY;
+  using_temporary_offsets = TRUE;
+  DPRINTF(("Got memory to hold back references\n"));
+  }
+else match_block.offset_vector = offsets;
+
+match_block.offset_end = ocount;
+match_block.offset_max = (2*ocount)/3;
+match_block.offset_overflow = FALSE;
+match_block.capture_last = -1;
+
+/* Compute the minimum number of offsets that we need to reset each time. Doing
+this makes a huge difference to execution time when there aren't many brackets
+in the pattern. */
+
+resetcount = 2 + re->top_bracket * 2;
+if (resetcount > offsetcount) resetcount = ocount;
+
+/* Reset the working variable associated with each extraction. These should
+never be used unless previously set, but they get saved and restored, and so we
+initialize them to avoid reading uninitialized locations. */
+
+if (match_block.offset_vector != NULL)
+  {
+  register int *iptr = match_block.offset_vector + ocount;
+  register int *iend = iptr - resetcount/2 + 1;
+  while (--iptr >= iend) *iptr = -1;
+  }
+
+/* Set up the first character to match, if available. The first_byte value is
+never set for an anchored regular expression, but the anchoring may be forced
+at run time, so we have to test for anchoring. The first char may be unset for
+an unanchored pattern, of course. If there's no first char and the pattern was
+studied, there may be a bitmap of possible first characters. */
+
+if (!anchored)
+  {
+  if ((re->options & PCRE_FIRSTSET) != 0)
+    {
+    first_byte = re->first_byte & 255;
+    if ((first_byte_caseless = ((re->first_byte & REQ_CASELESS) != 0)) == TRUE)
+      first_byte = match_block.lcc[first_byte];
+    }
+  else
+    if (!startline && study != NULL &&
+      (study->options & PCRE_STUDY_MAPPED) != 0)
+        start_bits = study->start_bits;
+  }
+
+/* For anchored or unanchored matches, there may be a "last known required
+character" set. */
+
+if ((re->options & PCRE_REQCHSET) != 0)
+  {
+  req_byte = re->req_byte & 255;
+  req_byte_caseless = (re->req_byte & REQ_CASELESS) != 0;
+  req_byte2 = (tables + fcc_offset)[req_byte];  /* case flipped */
+  }
+
+/* Loop for handling unanchored repeated matching attempts; for anchored regexs
+the loop runs just once. */
+
+do
+  {
+  /* Reset the maximum number of extractions we might see. */
+
+  if (match_block.offset_vector != NULL)
+    {
+    register int *iptr = match_block.offset_vector;
+    register int *iend = iptr + resetcount;
+    while (iptr < iend) *iptr++ = -1;
+    }
+
+  /* Advance to a unique first char if possible */
+
+  if (first_byte >= 0)
+    {
+    if (first_byte_caseless)
+      while (start_match < end_subject &&
+             match_block.lcc[*start_match] != first_byte)
+        start_match++;
+    else
+      while (start_match < end_subject && *start_match != first_byte)
+        start_match++;
+    }
+
+  /* Or to just after \n for a multiline match if possible */
+
+  else if (startline)
+    {
+    if (start_match > match_block.start_subject + start_offset)
+      {
+      while (start_match < end_subject && start_match[-1] != NEWLINE)
+        start_match++;
+      }
+    }
+
+  /* Or to a non-unique first char after study */
+
+  else if (start_bits != NULL)
+    {
+    while (start_match < end_subject)
+      {
+      register unsigned int c = *start_match;
+      if ((start_bits[c/8] & (1 << (c&7))) == 0) start_match++; else break;
+      }
+    }
+
+#ifdef DEBUG  /* Sigh. Some compilers never learn. */
+  printf(">>>> Match against: ");
+  pchars(start_match, end_subject - start_match, TRUE, &match_block);
+  printf("\n");
+#endif
+
+  /* If req_byte is set, we know that that character must appear in the subject
+  for the match to succeed. If the first character is set, req_byte must be
+  later in the subject; otherwise the test starts at the match point. This
+  optimization can save a huge amount of backtracking in patterns with nested
+  unlimited repeats that aren't going to match. Writing separate code for
+  cased/caseless versions makes it go faster, as does using an autoincrement
+  and backing off on a match.
+
+  HOWEVER: when the subject string is very, very long, searching to its end can
+  take a long time, and give bad performance on quite ordinary patterns. This
+  showed up when somebody was matching /^C/ on a 32-megabyte string... so we
+  don't do this when the string is sufficiently long.
+
+  ALSO: this processing is disabled when partial matching is requested.
+  */
+
+  if (req_byte >= 0 &&
+      end_subject - start_match < REQ_BYTE_MAX &&
+      !match_block.partial)
+    {
+    register const uschar *p = start_match + ((first_byte >= 0)? 1 : 0);
+
+    /* We don't need to repeat the search if we haven't yet reached the
+    place we found it at last time. */
+
+    if (p > req_byte_ptr)
+      {
+      if (req_byte_caseless)
+        {
+        while (p < end_subject)
+          {
+          register int pp = *p++;
+          if (pp == req_byte || pp == req_byte2) { p--; break; }
+          }
+        }
+      else
+        {
+        while (p < end_subject)
+          {
+          if (*p++ == req_byte) { p--; break; }
+          }
+        }
+
+      /* If we can't find the required character, break the matching loop */
+
+      if (p >= end_subject) break;
+
+      /* If we have found the required character, save the point where we
+      found it, so that we don't search again next time round the loop if
+      the start hasn't passed this character yet. */
+
+      req_byte_ptr = p;
+      }
+    }
+
+  /* When a match occurs, substrings will be set for all internal extractions;
+  we just need to set up the whole thing as substring 0 before returning. If
+  there were too many extractions, set the return code to zero. In the case
+  where we had to get some local store to hold offsets for backreferences, copy
+  those back references that we can. In this case there need not be overflow
+  if certain parts of the pattern were not used. */
+
+  match_block.start_match = start_match;
+  match_block.match_call_count = 0;
+
+  rc = match(start_match, match_block.start_code, 2, &match_block, ims, NULL,
+    match_isgroup);
+
+  if (rc == MATCH_NOMATCH)
+    {
+    start_match++;
+#ifdef SUPPORT_UTF8
+    if (match_block.utf8)
+      while(start_match < end_subject && (*start_match & 0xc0) == 0x80)
+        start_match++;
+#endif
+    continue;
+    }
+
+  if (rc != MATCH_MATCH)
+    {
+    DPRINTF((">>>> error: returning %d\n", rc));
+    return rc;
+    }
+
+  /* We have a match! Copy the offset information from temporary store if
+  necessary */
+
+  if (using_temporary_offsets)
+    {
+    if (offsetcount >= 4)
+      {
+      memcpy(offsets + 2, match_block.offset_vector + 2,
+        (offsetcount - 2) * sizeof(int));
+      DPRINTF(("Copied offsets from temporary memory\n"));
+      }
+    if (match_block.end_offset_top > offsetcount)
+      match_block.offset_overflow = TRUE;
+
+    DPRINTF(("Freeing temporary memory\n"));
+    (pcre_free)(match_block.offset_vector);
+    }
+
+  rc = match_block.offset_overflow? 0 : match_block.end_offset_top/2;
+
+  if (offsetcount < 2) rc = 0; else
+    {
+    offsets[0] = start_match - match_block.start_subject;
+    offsets[1] = match_block.end_match_ptr - match_block.start_subject;
+    }
+
+  DPRINTF((">>>> returning %d\n", rc));
+  return rc;
+  }
+
+/* This "while" is the end of the "do" above */
+
+while (!anchored && start_match <= end_subject);
+
+if (using_temporary_offsets)
+  {
+  DPRINTF(("Freeing temporary memory\n"));
+  (pcre_free)(match_block.offset_vector);
+  }
+
+if (match_block.partial && match_block.hitend)
+  {
+  DPRINTF((">>>> returning PCRE_ERROR_PARTIAL\n"));
+  return PCRE_ERROR_PARTIAL;
+  }
+else
+  {
+  DPRINTF((">>>> returning PCRE_ERROR_NOMATCH\n"));
+  return PCRE_ERROR_NOMATCH;
+  }
+}
+
+/* End of pcre.c */
diff --git a/pcre.h b/pcre.h
new file mode 100644
index 0000000..ee5bf16
--- /dev/null
+++ b/pcre.h
@@ -0,0 +1,239 @@
+/*************************************************
+*       Perl-Compatible Regular Expressions      *
+*************************************************/
+
+/* In its original form, this is the .in file that is transformed by
+"configure" into pcre.h.
+
+           Copyright (c) 1997-2004 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice,
+      this list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+    * Neither the name of the University of Cambridge nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+-----------------------------------------------------------------------------
+*/
+
+#ifndef _PCRE_H
+#define _PCRE_H
+
+/* The file pcre.h is build by "configure". Do not edit it; instead
+make changes to pcre.in. */
+
+#define PCRE_MAJOR          5
+#define PCRE_MINOR          0
+#define PCRE_DATE           13-Sep-2004
+
+/* Win32 uses DLL by default */
+
+#ifdef _WIN32
+#  ifdef PCRE_DEFINITION
+#    ifdef DLL_EXPORT
+#      define PCRE_DATA_SCOPE __declspec(dllexport)
+#    endif
+#  else
+#    ifndef PCRE_STATIC
+#      define PCRE_DATA_SCOPE extern __declspec(dllimport)
+#    endif
+#  endif
+#endif
+#ifndef PCRE_DATA_SCOPE
+#  define PCRE_DATA_SCOPE     extern
+#endif
+
+/* Have to include stdlib.h in order to ensure that size_t is defined;
+it is needed here for malloc. */
+
+#include <stdlib.h>
+
+/* Allow for C++ users */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* Options */
+
+#define PCRE_CASELESS           0x0001
+#define PCRE_MULTILINE          0x0002
+#define PCRE_DOTALL             0x0004
+#define PCRE_EXTENDED           0x0008
+#define PCRE_ANCHORED           0x0010
+#define PCRE_DOLLAR_ENDONLY     0x0020
+#define PCRE_EXTRA              0x0040
+#define PCRE_NOTBOL             0x0080
+#define PCRE_NOTEOL             0x0100
+#define PCRE_UNGREEDY           0x0200
+#define PCRE_NOTEMPTY           0x0400
+#define PCRE_UTF8               0x0800
+#define PCRE_NO_AUTO_CAPTURE    0x1000
+#define PCRE_NO_UTF8_CHECK      0x2000
+#define PCRE_AUTO_CALLOUT       0x4000
+#define PCRE_PARTIAL            0x8000
+
+/* Exec-time and get/set-time error codes */
+
+#define PCRE_ERROR_NOMATCH         (-1)
+#define PCRE_ERROR_NULL            (-2)
+#define PCRE_ERROR_BADOPTION       (-3)
+#define PCRE_ERROR_BADMAGIC        (-4)
+#define PCRE_ERROR_UNKNOWN_NODE    (-5)
+#define PCRE_ERROR_NOMEMORY        (-6)
+#define PCRE_ERROR_NOSUBSTRING     (-7)
+#define PCRE_ERROR_MATCHLIMIT      (-8)
+#define PCRE_ERROR_CALLOUT         (-9)  /* Never used by PCRE itself */
+#define PCRE_ERROR_BADUTF8        (-10)
+#define PCRE_ERROR_BADUTF8_OFFSET (-11)
+#define PCRE_ERROR_PARTIAL        (-12)
+#define PCRE_ERROR_BADPARTIAL     (-13)
+#define PCRE_ERROR_INTERNAL       (-14)
+#define PCRE_ERROR_BADCOUNT       (-15)
+
+/* Request types for pcre_fullinfo() */
+
+#define PCRE_INFO_OPTIONS            0
+#define PCRE_INFO_SIZE               1
+#define PCRE_INFO_CAPTURECOUNT       2
+#define PCRE_INFO_BACKREFMAX         3
+#define PCRE_INFO_FIRSTBYTE          4
+#define PCRE_INFO_FIRSTCHAR          4  /* For backwards compatibility */
+#define PCRE_INFO_FIRSTTABLE         5
+#define PCRE_INFO_LASTLITERAL        6
+#define PCRE_INFO_NAMEENTRYSIZE      7
+#define PCRE_INFO_NAMECOUNT          8
+#define PCRE_INFO_NAMETABLE          9
+#define PCRE_INFO_STUDYSIZE         10
+#define PCRE_INFO_DEFAULT_TABLES    11
+
+/* Request types for pcre_config() */
+
+#define PCRE_CONFIG_UTF8                    0
+#define PCRE_CONFIG_NEWLINE                 1
+#define PCRE_CONFIG_LINK_SIZE               2
+#define PCRE_CONFIG_POSIX_MALLOC_THRESHOLD  3
+#define PCRE_CONFIG_MATCH_LIMIT             4
+#define PCRE_CONFIG_STACKRECURSE            5
+#define PCRE_CONFIG_UNICODE_PROPERTIES      6
+
+/* Bit flags for the pcre_extra structure */
+
+#define PCRE_EXTRA_STUDY_DATA          0x0001
+#define PCRE_EXTRA_MATCH_LIMIT         0x0002
+#define PCRE_EXTRA_CALLOUT_DATA        0x0004
+#define PCRE_EXTRA_TABLES              0x0008
+
+/* Types */
+
+struct real_pcre;                 /* declaration; the definition is private  */
+typedef struct real_pcre pcre;
+
+/* The structure for passing additional data to pcre_exec(). This is defined in
+such as way as to be extensible. Always add new fields at the end, in order to
+remain compatible. */
+
+typedef struct pcre_extra {
+  unsigned long int flags;        /* Bits for which fields are set */
+  void *study_data;               /* Opaque data from pcre_study() */
+  unsigned long int match_limit;  /* Maximum number of calls to match() */
+  void *callout_data;             /* Data passed back in callouts */
+  const unsigned char *tables;    /* Pointer to character tables */
+} pcre_extra;
+
+/* The structure for passing out data via the pcre_callout_function. We use a
+structure so that new fields can be added on the end in future versions,
+without changing the API of the function, thereby allowing old clients to work
+without modification. */
+
+typedef struct pcre_callout_block {
+  int          version;           /* Identifies version of block */
+  /* ------------------------ Version 0 ------------------------------- */
+  int          callout_number;    /* Number compiled into pattern */
+  int         *offset_vector;     /* The offset vector */
+  const char  *subject;           /* The subject being matched */
+  int          subject_length;    /* The length of the subject */
+  int          start_match;       /* Offset to start of this match attempt */
+  int          current_position;  /* Where we currently are in the subject */
+  int          capture_top;       /* Max current capture */
+  int          capture_last;      /* Most recently closed capture */
+  void        *callout_data;      /* Data passed in with the call */
+  /* ------------------- Added for Version 1 -------------------------- */
+  int          pattern_position;  /* Offset to next item in the pattern */
+  int          next_item_length;  /* Length of next item in the pattern */
+  /* ------------------------------------------------------------------ */
+} pcre_callout_block;
+
+/* Indirection for store get and free functions. These can be set to
+alternative malloc/free functions if required. Special ones are used in the
+non-recursive case for "frames". There is also an optional callout function
+that is triggered by the (?) regex item. Some magic is required for Win32 DLL;
+it is null on other OS. For Virtual Pascal, these have to be different again.
+*/
+
+#ifndef VPCOMPAT
+PCRE_DATA_SCOPE void *(*pcre_malloc)(size_t);
+PCRE_DATA_SCOPE void  (*pcre_free)(void *);
+PCRE_DATA_SCOPE void *(*pcre_stack_malloc)(size_t);
+PCRE_DATA_SCOPE void  (*pcre_stack_free)(void *);
+PCRE_DATA_SCOPE int   (*pcre_callout)(pcre_callout_block *);
+#else   /* VPCOMPAT */
+extern void *pcre_malloc(size_t);
+extern void  pcre_free(void *);
+extern void *pcre_stack_malloc(size_t);
+extern void  pcre_stack_free(void *);
+extern int   pcre_callout(pcre_callout_block *);
+#endif  /* VPCOMPAT */
+
+/* Exported PCRE functions */
+
+extern pcre *pcre_compile(const char *, int, const char **,
+              int *, const unsigned char *);
+extern int  pcre_config(int, void *);
+extern int  pcre_copy_named_substring(const pcre *, const char *,
+              int *, int, const char *, char *, int);
+extern int  pcre_copy_substring(const char *, int *, int, int,
+              char *, int);
+extern int  pcre_exec(const pcre *, const pcre_extra *,
+              const char *, int, int, int, int *, int);
+extern void pcre_free_substring(const char *);
+extern void pcre_free_substring_list(const char **);
+extern int  pcre_fullinfo(const pcre *, const pcre_extra *, int,
+              void *);
+extern int  pcre_get_named_substring(const pcre *, const char *,
+              int *, int,  const char *, const char **);
+extern int  pcre_get_stringnumber(const pcre *, const char *);
+extern int  pcre_get_substring(const char *, int *, int, int,
+              const char **);
+extern int  pcre_get_substring_list(const char *, int *, int,
+              const char ***);
+extern int  pcre_info(const pcre *, int *, int *);
+extern const unsigned char *pcre_maketables(void);
+extern pcre_extra *pcre_study(const pcre *, int, const char **);
+extern const char *pcre_version(void);
+
+#ifdef __cplusplus
+}  /* extern "C" */
+#endif
+
+#endif /* End of pcre.h */
diff --git a/primes.h b/primes.h
new file mode 100644
index 0000000..1ac3350
--- /dev/null
+++ b/primes.h
@@ -0,0 +1,391 @@
+/* primes.h - table of primitives
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+
+PRIMITIVE primitive[] =
+	{
+	/* --------- core ------------------ */
+#ifdef SYMBOL_DEBUG
+	{"dump-symbol",		p_dumpSymbol,	0},
+#endif
+	{"while",		p_while,	2},
+	{"until",		p_until,	2},
+	{"do-while",	p_doWhile,	2},
+	{"do-until",	p_doUntil,	2},
+	{"dotimes",		p_dotimes,	2},
+	{"for",			p_for,		2},
+	{"sequence",	p_sequence,	0},
+	{"series",		p_series,	0},
+	{"doargs",		p_doargs,	2},
+	{"dolist",		p_dolist,	2},
+	{"dostring",	p_dostring, 2},
+	{"dotree",		p_dotree,	2},
+	{"case",		p_case,		2},
+	{"cond",		p_condition,1},
+	{"begin",		p_evalBlock,1}, 
+	{"and",			p_and,		0},
+	{"if",			p_if,		2},
+	{"when",		p_when, 2},
+	{"unless",		p_unless,	2},
+	{"or",			p_or,		0},
+	{"quote",		p_quote,	0},
+	{"silent",		p_silent,	0},
+	{"eval",		p_eval,		0},
+	{"amb",			p_amb,		0},
+	{"catch",		p_catch,	0},
+	{"throw",       p_throw,    0},
+	{"apply",		p_apply,	0},
+	{"curry",		p_curry,	0},
+	{"args",		p_args,		0},
+	{"map",			p_map,		0},
+	{"name",       	p_name, 	0},
+	{"filter",		p_filter,	0},
+	{"clean",		p_clean,	0},
+	{"index",		p_index,	0},
+	{"define",		p_define,	2},
+	{"define-macro",	p_defineMacro,	2},
+	{"expand",		p_expand,	0},
+	{"constant",	p_constant,	0},
+	{"global",		p_global,	0},
+	{"set",			p_set,		0},
+	{"setq",		p_setq,		0},
+	{"let",			p_let,		2},
+	{"local",		p_local,	2},
+	{"letn",		p_letn,		2},
+	{"letex",		p_letExpand,3},
+	{"first",		p_first,	0},
+	{"flat",		p_flat,		0},
+	{"last",		p_last,		0},
+	{"rest",		p_rest,		0},
+	{"cons",		p_cons,		0},
+	{"append",		p_append,	0},
+	{"list",		p_list,		0},
+	{"nth",			p_nth,		0},
+	{"nth-set",		p_nthSet,	0},
+	{"ref",			p_ref,		0},
+	{"set-ref",		p_setRef,	0},
+	{"ref-set",		p_refSet,	0},
+	{"ref-all",		p_refAll,	0},
+	{"set-ref-all",	p_setRefAll,0},
+	{"select",		p_select,	0},
+	{"swap",		p_swap,		0}, 
+	{"slice",		p_slice,	0},
+	{"length",		p_length,	0},
+	{"find",		p_find,		0},
+	{"search",		p_search,	0},
+	{"member",		p_member,	0},
+	{"intersect",	p_intersect,	0},
+	{"difference",	p_difference,	0},
+	{"unique",		p_unique,	0},
+	{"assoc",		p_assoc,	0},
+	{"lookup",		p_lookup,	0},
+	{"count",		p_count,	0},
+	{"set-assoc",	p_setAssoc,	0},
+	{"assoc-set",	p_assocSet,	0},
+	{"replace-assoc",	p_replaceAssoc,	0},
+	{"pop-assoc",	p_popAssoc,	0},
+	{"set-nth",		p_setNth,	0},
+	{"replace",		p_replace,	0},
+	{"sort",		p_sort,		0},
+	{"push",		p_push,		0},
+	{"pop",			p_pop,		0},
+	{"reverse",		p_reverse,	0},
+	{"rotate",		p_rotate,	0},
+	{"dup",			p_dup,		0},
+	{"not",			p_not,		0},
+	{"+",			p_add,		0},
+	{"-",			p_subtract,	0},
+	{"*",			p_multiply,	0},
+	{"/",			p_divide,	0},
+	{"%",			p_modulo,	0},
+	{"<",			p_less,	0},
+	{">",			p_greater,	0},
+	{"<=",			p_lessEqual,0},
+	{">=",			p_greaterEqual,0},
+	{"=",			p_equal,	0},
+	{"!=",			p_notEqual,	0},
+
+	/* --------- bit ops --------------- */
+	{"<<",			p_shiftLeft,0},
+	{">>",			p_shiftRight,	0},
+	{"&",			p_bitAnd,	0},
+	{"|",			p_bitOr,	0},
+	{"^",			p_bitXor,	0},
+	{"~",			p_bitNot,	0},
+
+	/* --------- math and float ------- */
+	{"inc",		    p_increment,	0},
+	{"dec",		    p_decrement,	0},
+	{"add",		    p_addFloat,	0},
+	{"sub",		    p_subFloat,	0},
+	{"mul",		    p_mulFloat,	0},
+	{"div",		    p_divFloat,	0},
+	{"abs",		    p_abs,		0},
+	{"ceil",		p_ceil,     0},
+	{"floor",		p_floor,	0},
+	{"erf",			p_erf,		0},
+	{"sgn",			p_sgn,		0},
+	{"sin",		    p_sin,		0},
+	{"cos",		    p_cos,		0},
+	{"tan",		    p_tan,		0},
+	{"asin",		p_asin,	    0},
+	{"acos",		p_acos,	    0},
+	{"atan",		p_atan,	    0},
+	{"atan2",		p_atan2,	0},
+	{"sinh",		p_sinh,		0},
+	{"cosh",		p_cosh,		0},
+	{"tanh",		p_tanh,		0},
+	{"asinh",		p_asinh,	0},
+	{"acosh",		p_acosh,	0},
+	{"atanh",		p_atanh,	0},
+	{"round",		p_round,	0},
+	{"exp",		    p_exp,		0},
+	{"log",		    p_log,		0},
+	{"sqrt",		p_sqrt,     0},
+	{"rand",		p_rand, 	0},
+	{"seed",		p_seed,     0},
+	{"random",      p_random,	0},
+	{"normal",		p_normal,	0},
+	{"randomize",	p_randomize,0},
+	{"encrypt",		p_encrypt,	0},
+	{"min",		    p_minFloat,	0},
+	{"max",		    p_maxFloat,	0},
+	{"pow",		    p_powFloat,	0},
+	{"mod",		    p_modFloat,	0},
+	{"prob-z",		p_probabilityZ, 0},
+	{"prob-chi2",	p_probabilityChi2, 0},
+	{"crit-chi2",	p_criticalChi2,	0},
+	{"crit-z",		p_criticalZ,	0},
+	{"fft",		    p_fft,		0},
+	{"ifft",		p_ifft,	        0},
+	{"beta",		p_beta,	        0},
+	{"betai",		p_betai,	0},
+	{"gammaln",		p_gammaln,	0},
+	{"gammai",		p_gammai,	0},
+	{"binomial",	p_binomial,	0},
+	{"factor",	p_factor,	0},
+	{"pmt",         p_pmt,          0},
+	{"pv",          p_pv,           0},
+	{"fv",          p_fv,           0},
+	{"nper",        p_nper,         0},
+	{"npv",         p_npv,          0},
+	{"irr",			p_irr,		0},
+	{"transpose",	p_matTranspose, 0},
+	{"multiply",	p_matMultiply,  0},
+	{"invert",		p_matInvert,    0},
+	{"det",			p_determinant,  0},
+	{"mat",			p_matScalar,		0},
+	{"array",		p_array,	0},
+	{"array-list",	p_arrayList,	0},
+	{"flt",			p_flt,		0},
+	{"bayes-train",	p_bayesTrain,	0},
+	{"bayes-query",	p_bayesQuery,	0},
+	{"unify",		p_unify,		0},
+	{"bind",		p_bind,			0},
+	{"uuid",		p_uuid,			0},
+	{"gcd",			p_gcd,			0},
+	
+	/* ------------ string ops ------------- */
+	{"eval-string",	p_evalString,	0},
+	{"join",		p_join,	        0},
+	{"chop",		p_chop,	        0},
+	{"explode",		p_explode,		0},
+	{"trim",		p_trim,	        0},
+	{"char",		p_char,	        0},
+	{"starts-with",	p_startsWith,	0},
+	{"ends-with",	p_endsWith,	0},
+	{"upper-case",	p_upper,	0},
+	{"lower-case",	p_lower,	0},
+	{"title-case",	p_title,	0},
+	{"format",		p_format,	0},
+	{"match",		p_match,	0},
+	{"regex",		p_regex,	0},
+	{"int",			p_integer,	0},
+	{"integer",		p_integer,	0},
+	{"float",		p_float,	0},
+	{"sym",			p_symbol,	0},
+	{"string",		p_string,	0},
+	{"get-float",	p_getFloat,	0},
+	{"get-string",	p_getString,	0},
+	{"get-int",		p_getInteger,	0},
+	{"get-long",	p_getLong,	0},
+	{"get-char",	p_getChar,	0},
+	{"parse",		p_parse,	0},
+#ifndef WIN_32
+	{"parse-date",	p_parseDate,	0},
+#endif
+	{"pack",		p_pack, 	0},
+	{"unpack",		p_unpack, 	0},
+	{"xml-parse",	p_XMLparse, 	0},
+	{"xml-error",	p_XMLerror,	0},
+	{"xml-type-tags",   p_XMLtypeTags,  0},
+	{"base64-enc",		p_base64Enc,	0},
+	{"base64-dec",		p_base64Dec,	0},
+	{"crc32",		p_crc32,	0},
+	{"find-all",	p_findAll,	0},
+#ifdef SUPPORT_UTF8
+	{"unicode",		p_unicode,	0},
+	{"utf8",		p_utf8,		0},
+	{"utf8len",		p_utf8len,	0},
+#endif
+
+	/* -------------- I/O ------------------ */
+	{"command-line",	p_commandLine,	0},
+	{"pretty-print",	p_prettyPrint,	0},
+	{"print",		p_print,	0},
+	{"println",		p_println,	0},
+	{"read-line",	p_readLine,	0},
+	{"write-line",	p_writeLine,	0},
+	{"current-line",p_currentLine,0},
+	{"device",		p_device,	0},
+	{"load",		p_load,		0},
+	{"save",		p_save,		0},
+	{"source",		p_symbolSource,	0},
+	{"open",		p_open,		0},
+	{"close",		p_close,	0},
+	{"read-char",	p_readChar,	0},
+	{"write-char",	p_writeChar,0},
+	{"read-buffer",	p_readBuffer,0},
+	{"write-buffer",p_writeBuffer,0},
+	{"write-file",	p_writeFile,0},
+	{"append-file",	p_appendFile,	0},
+	{"read-file",	p_readFile, 0},
+	{"read-key",	p_readKey,	0},
+	{"get-url",		p_getUrl,	0},
+	{"put-url",		p_putUrl, 	0},
+	{"post-url",	p_postUrl,	0},
+	{"delete-url",	p_deleteUrl,0},
+	{"destroy",		p_destroyProcess, 0},
+	{"exec",        p_exec,     0},
+	{"process",		p_process,	0},
+	{"pipe",		p_pipe,		0}, 
+#ifndef WIN_32
+	{"fork",		p_fork,		0},
+	{"wait-pid",	p_waitpid,	0},
+#endif
+#ifndef OS2
+	{"share",		p_share,	0},
+#endif
+	{"semaphore",	p_semaphore,0},
+	{"seek",		p_seek,		0},
+#ifndef WIN_32
+	{"peek",		p_peek,		0},
+#endif
+	
+	/* --------- system/predicates --------- */
+	{"set-locale",		p_setlocale,	0},
+	{"for-all",		p_forAll,	0},
+	{"exists",		p_exists,	0},
+	{"nil?",		p_isNil,	0},
+	{"true?",		p_isTrue,	0},
+	{"NaN?",		p_isnan,	0},
+	{"integer?",	p_isInteger,	0},
+	{"float?",		p_isFloat,	0},
+	{"number?",		p_isNumber,	0},
+	{"string?",		p_isString,	0},
+	{"symbol?",		p_isSymbol,	0},
+	{"legal?",		p_isLegal,	0},
+	{"context?",	p_isContext,	0},
+	{"primitive?",	p_isPrimitive,	0},
+	{"atom?",		p_isAtom,	0},
+	{"quote?",		p_isQuote,	0},
+	{"list?",		p_isList,	0},
+	{"lambda?",		p_isLambda,	0},
+	{"macro?",		p_isMacro,	0},
+	{"array?",		p_isArray,	0},
+	{"empty?",		p_isEmpty,	0},
+	{"null?",		p_isNull,	0},
+	{"zero?",		p_isZero,	0},
+	{"file?",		p_isFile,	0},
+	{"directory?",	p_isDirectory,	0},
+	{"global?",		p_isGlobal,	0},
+	{"protected?",	p_isProtected,	0},
+	{"symbols",		p_symbols,	0},
+	{"exit",		p_exit,		0},
+	{"debug",		p_debug,	0},
+	{"trace",		p_trace,	0},
+	{"trace-highlight", 	p_traceHighlight,0},
+	{"reset",		p_reset,	0},
+	{"throw-error",	p_throwError,	0},
+	{"error-event",	p_errorEvent,	0},
+	{"error-number",p_errorNumber,0},
+	{"error-text",	p_errorText,	0},
+	{"signal",		p_signal,	0},
+	{"sys-info",	p_systemInfo,	0},
+	{"sys-error",	p_systemError,	0},
+	{"date",		p_date,		0},
+	{"!",			p_system,	0},
+	{"file-info",	p_fileInfo,	0},
+	{"copy-file",	p_copyFile,	0},
+	{"rename-file",	p_renameFile,	0},
+	{"delete-file",	p_deleteFile,	0},
+	{"make-dir",	p_makeDir,	0},
+	{"remove-dir",	p_removeDir,	0},
+	{"change-dir",	p_changeDir,	0},
+	{"directory",	p_directory,	0},
+	{"real-path",	p_realpath,		0},
+	{"main-args",	p_mainArgs,	0},
+	{"env",			p_env,		0},
+	{"context",		p_context,	0},
+	{":",			p_colon,	0},
+	{"default",		p_default,	0},
+	{"timer",       p_timerEvent,	0},
+#ifndef NOIMPORT
+	{"import",		p_importLib,	0},
+	{"callback",	p_callback,		0},
+#endif
+	{"delete",		p_deleteSymbol,	0},
+	{"new",			p_new,		0},
+	{"def-new",		p_defineNew,	0},
+	{"address",		p_address,	0},
+	{"dump",		p_dump,	        0},
+	{"cpymem",		p_copyMemory,	0},
+	{"sleep",		p_sleep,	0},
+	{"time",		p_time,	        0},
+	{"time-of-day",	p_timeOfDay,    0},
+	{"now",         p_now,          0},
+	{"date-value",  p_dateValue,    0},
+	{"$",			p_systemSymbol, 0},
+
+	/* ------------ net working ------------ */
+	{"net-close",		p_netClose,	0},
+	{"net-service",		p_netService,	0},
+	{"net-connect",		p_netConnect,	0},
+	{"net-accept",		p_netAccept,	0},
+	{"net-local",		p_netLocal,	0},
+	{"net-peer",		p_netPeer,	0},
+	{"net-lookup",		p_netLookup,	0},
+	{"net-receive",		p_netReceive,	0},
+	{"net-receive-from",p_netReceiveFrom,0},
+	{"net-receive-udp",	p_netReceiveUDP,0},
+	{"net-send",		p_netSend,	0},
+	{"net-send-to",		p_netSendTo,	0},
+	{"net-send-udp",	p_netSendUDP,	0},
+	{"net-listen",		p_netListen,	0},
+	{"net-peek",		p_netPeek,	0},
+	{"net-select",		p_netSelect,	0},
+	{"net-sessions",	p_netSessions,	0},
+	{"net-eval",		p_netEval,	0},
+#ifdef NET_PING
+	{"net-ping",		p_netPing,	0},
+#endif
+ 	{"net-error",		p_netLastError,	0},
+	{NULL,NULL,0},
+};
+
diff --git a/protos.h b/protos.h
new file mode 100644
index 0000000..f007e1f
--- /dev/null
+++ b/protos.h
@@ -0,0 +1,606 @@
+/* protos.h function prototypes fo6 newLISP
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+CELL * addResult(CELL * * result, CELL * cell, CELL * new);
+CELL * appendArray(CELL * cell, CELL * params);
+CELL * appendNode(CELL * node, CELL * newNode);
+CELL * appendString(CELL * cell, CELL * params, char * joint, size_t jointLen, int trailJoint, int evalFlag);
+CELL * appendWriteFile(CELL * params, char * type);
+CELL * arithmetikOp(CELL * params, int operand);
+CELL * arrayList(CELL * params);
+CELL * arrayTranspose(CELL * params);
+CELL * collectSelect(CELL * head, CELL * params, int evalFlag);
+CELL * compareOp(CELL * params, int operand);
+CELL * copyCell(CELL * cell);
+CELL * copyList(CELL * cell);
+CELL * defineOrMacro(CELL * params, UINT type);
+CELL * dolist(CELL * params, int argsFlag);
+CELL * environment(void);
+CELL * errorProc(int errorNumber);
+CELL * errorProcExt(int errorNumber, CELL * expr);
+CELL * errorProcExt2(int errorNumber, CELL * expr);
+CELL * evalCheckProtected(CELL * cell, CELL * * sPtr);
+CELL * evaluateBlock(CELL * cell);
+CELL * evaluateExpression(CELL * cell);
+CELL * evaluateExpressionSafe(CELL * cell, int * errNo);
+CELL * evaluateLambda(CELL * lambda, CELL * arg, SYMBOL * newContext);
+CELL * evaluateMacro(CELL * macro, CELL * arg, SYMBOL * newContext);
+CELL * evaluateStream(STREAM * stream, UINT printDevice, int flag);
+CELL * executeLibfunction(CELL * pcell, CELL * params);
+CELL * expand(CELL * expr, SYMBOL * symbol);
+CELL * explodeList(CELL * list, CELL * params);
+CELL * floatOp(CELL * params, int operand);
+CELL * functionFloat(CELL * params, int operand);
+CELL * getCell(int type);
+CELL * getFloat(CELL * params, double * floatNumber);
+CELL * getInteger(CELL * params, UINT * number);
+CELL * getInteger64(CELL * params, INT64 * number);
+CELL * getIntegerExt(CELL * params, UINT * number, int evalFlag);
+CELL * getListHead(CELL * params, CELL * * list);
+CELL * getList(CELL * params, CELL * * result, int setFlag);
+CELL * getPutPostDeleteUrl(char * url, CELL * params, int type, int timeout);
+CELL * getServicePort(CELL * params, int * portNo, char * protocol);
+CELL * getString(CELL * params, char * * stringPtr);
+CELL * getStringSize(CELL * params, char * * stringPtr, size_t * size, int evalFlag);
+CELL * getSymbol(CELL * params, SYMBOL * * symbol);
+CELL * getContext(CELL * params, SYMBOL * * context);
+CELL * ifUnless(CELL * params, int ifUnlessFlag);
+CELL * incDec(CELL * params, int type);
+CELL * isType(CELL * params, int operand);
+CELL * isEmptyFunc(CELL * params);
+CELL * loop(CELL * params, int flag);
+CELL * implicitIndexArray(CELL * cell, CELL * params);
+CELL * implicitIndexList (CELL * list, CELL * params);
+CELL * implicitNrestSlice(CELL * num, CELL * params);
+CELL * implicitIndexString(CELL * cell, CELL * params);
+CELL * initArray(CELL * array, CELL * list, CELL * * next);
+CELL * loadFile(char * fileName, UINT offset, int encryptFlag, SYMBOL * context);
+CELL * makeArray(ssize_t * index, int p);
+CELL * makePair(CELL * left, CELL * right);
+CELL * makeElementNode(CELL * tagNode, CELL * attributesNode, CELL * childrenNode);
+CELL * makeTextNode(int type, CELL * contents);
+CELL * matScalar(CELL * params, char type);
+CELL * mpdArithmetik(CELL * num, CELL * params, int op);
+CELL * netError(int errorNo);
+CELL * netPeerLocal(CELL * params, int peerLocalFlag);
+CELL * subarray(CELL * array, ssize_t offset, ssize_t length);
+CELL * transposeArray(CELL * array);
+CELL * updateCell(CELL * cell, CELL * new);
+CELL * p_XMLerror(CELL * params);
+CELL * p_XMLparse(CELL * params);
+CELL * p_XMLtypeTags(CELL * params);
+CELL * p_abs(CELL * params);
+CELL * p_acos(CELL * params);
+CELL * p_add(CELL * params);
+CELL * p_addFloat(CELL * params);
+CELL * p_address(CELL * params);
+CELL * p_amb(CELL * params);
+CELL * p_and(CELL * params);
+CELL * p_append(CELL * params);
+CELL * p_appendFile(CELL * params);
+CELL * p_apply(CELL * params);
+CELL * p_args(CELL * params);
+CELL * p_array(CELL * params);
+CELL * p_arrayList(CELL * params);
+CELL * p_asin(CELL * params);
+CELL * p_assoc(CELL * params);
+CELL * p_assocSet(CELL * params);
+CELL * p_atan(CELL * params);
+CELL * p_atan2(CELL * params);
+CELL * p_base64Enc(CELL * params);
+CELL * p_base64Dec(CELL * params);
+CELL * p_bayesTrain(CELL * params);
+CELL * p_bayesQuery(CELL * params);
+CELL * p_beta(CELL * params);
+CELL * p_betai(CELL * params);
+CELL * p_bind(CELL * params);
+CELL * p_binomial(CELL * params);
+CELL * p_bitAnd(CELL * params);
+CELL * p_bitNot(CELL * params);
+CELL * p_bitOr(CELL * params);
+CELL * p_bitXor(CELL * params);
+CELL * p_callback(CELL * params);
+CELL * p_case(CELL * params);
+CELL * p_catch(CELL * params);
+CELL * p_ceil(CELL * params);
+CELL * p_changeDir(CELL * params);
+CELL * p_char(CELL * params);
+CELL * p_chop(CELL * params);
+CELL * p_clean(CELL * params);
+CELL * p_close(CELL * params);
+CELL * p_colon(CELL * params);
+CELL * p_commandLine(CELL * params);
+CELL * p_condition(CELL * params);
+CELL * p_cons(CELL * params);
+CELL * p_constant(CELL * params);
+CELL * p_context(CELL * params);
+CELL * p_copyFile(CELL * params);
+CELL * p_copyMemory(CELL * params);
+CELL * p_cos(CELL * params);
+CELL * p_cosh(CELL * params);
+CELL * p_acosh(CELL * params);
+CELL * p_count(CELL * params);
+CELL * p_crc32(CELL * params);
+CELL * p_criticalChi2(CELL  * params);
+CELL * p_criticalZ(CELL * params);
+CELL * p_currentLine(CELL * params);
+CELL * p_curry(CELL * params);
+CELL * p_date(CELL * params);
+CELL * p_dateValue(CELL * params);
+CELL * p_debug(CELL * params);
+CELL * p_decrement(CELL * params);
+CELL * p_default(CELL * params);
+CELL * p_define(CELL * params);
+CELL * p_defineMacro(CELL * params);
+CELL * p_defineNew(CELL * params);
+CELL * p_deleteFile(CELL * params);
+CELL * p_deleteSymbol(CELL * params);
+CELL * p_destroyProcess(CELL * params);
+CELL * p_determinant(CELL * params);
+CELL * p_device(CELL * params);
+CELL * p_difference(CELL * params);
+CELL * p_directory(CELL * params);
+CELL * p_divFloat(CELL * params);
+CELL * p_divide(CELL * params);
+CELL * p_doargs(CELL * params);
+CELL * p_dolist(CELL * params);
+CELL * p_dostring(CELL * params);
+CELL * p_dotimes(CELL * params);
+CELL * p_dotree(CELL * params);
+CELL * p_doWhile(CELL * params);
+CELL * p_doUntil(CELL * params);
+CELL * p_dump(CELL * params);
+CELL * p_dumpSymbol(CELL* params);
+CELL * p_dup(CELL * params);
+CELL * p_encrypt(CELL * params);
+CELL * p_endsWith(CELL * params);
+CELL * p_env(CELL * params);
+CELL * p_equal(CELL * params);
+CELL * p_erf(CELL * params);
+CELL * p_errorEvent(CELL * params);
+CELL * p_errorNumber(CELL * params);
+CELL * p_errorText(CELL * params);
+CELL * p_eval(CELL * params);
+CELL * p_evalBlock(CELL * params);
+CELL * p_evalString(CELL * params);
+CELL * p_exec(CELL * params);
+CELL * p_exists(CELL * params);
+CELL * p_exit(CELL * params);
+CELL * p_exp(CELL * params);
+CELL * p_expand(CELL * params);
+CELL * p_explode(CELL * params);
+CELL * p_factor(CELL * params);
+CELL * p_fft(CELL * params);
+CELL * p_fileInfo(CELL * params);
+CELL * p_filter(CELL * params);
+CELL * p_find(CELL * params);
+CELL * p_findAll(CELL * params);
+CELL * p_first(CELL * params);
+CELL * p_flat(CELL * params);
+CELL * p_float(CELL * params);
+CELL * p_flt(CELL * params);
+CELL * p_floor(CELL * params);
+CELL * p_for(CELL * params);
+CELL * p_forAll(CELL * params);
+CELL * p_fork(CELL * params);
+CELL * p_format(CELL * params);
+CELL * p_fv(CELL * params);
+CELL * p_gammai(CELL * params);
+CELL * p_gammaln(CELL * params);
+CELL * p_gcd(CELL * params);
+CELL * p_getChar(CELL * params);
+CELL * p_getFloat(CELL * params);
+CELL * p_getInteger(CELL * params);
+CELL * p_getLong(CELL * params);
+CELL * p_getString(CELL * params);
+CELL * p_getUrl(CELL * params);
+CELL * p_getenv(CELL * params);
+CELL * p_global(CELL * params);
+CELL * p_greater(CELL * params);
+CELL * p_greaterEqual(CELL * params);
+CELL * p_if(CELL * params);
+CELL * p_ifft(CELL * params);
+CELL * p_importLib(CELL * params);
+CELL * p_increment(CELL * params);
+CELL * p_index(CELL * params);
+CELL * p_integer(CELL * params);
+CELL * p_intersect(CELL * params);
+CELL * p_irr(CELL * params);
+CELL * p_isAtom(CELL * params);
+CELL * p_isContext(CELL * params);
+CELL * p_isGlobal(CELL * params);
+CELL * p_isNil(CELL * params);
+CELL * p_isNull(CELL * params);
+CELL * p_isNumber(CELL * params);
+CELL * p_isProtected(CELL * params);
+CELL * p_isTrue(CELL * params);
+CELL * p_isZero(CELL * params);
+CELL * p_isDirectory(CELL * params);
+CELL * p_isEmpty(CELL * params);
+CELL * p_isFile(CELL * params);
+CELL * p_isFloat(CELL * params);
+CELL * p_isInteger(CELL * params);
+CELL * p_isLambda(CELL * params);
+CELL * p_isLegal(CELL * params);
+CELL * p_isList(CELL * params);
+CELL * p_isMacro(CELL * params);
+CELL * p_isArray(CELL * params);
+CELL * p_isPrimitive(CELL * params);
+CELL * p_isQuote(CELL * params);
+CELL * p_isString(CELL * params);
+CELL * p_isSymbol(CELL * params);
+CELL * p_isnan(CELL * params);
+CELL * p_join(CELL * params);
+CELL * p_last(CELL * params);
+CELL * p_length(CELL * params);
+CELL * p_less(CELL * params);
+CELL * p_lessEqual(CELL * params);
+CELL * p_let(CELL * params);
+CELL * p_letn(CELL * params);
+CELL * p_letExpand(CELL * params);
+CELL * p_list(CELL * params);
+CELL * p_load(CELL * params);
+CELL * p_local(CELL * params);
+CELL * p_log(CELL * params);
+CELL * p_lookup(CELL * params);
+CELL * p_lower(CELL * params);
+CELL * p_mainArgs(CELL * params);
+CELL * p_makeDir(CELL * params);
+CELL * p_map(CELL * params);
+CELL * p_matScalar(CELL * params);
+CELL * p_matInvert(CELL * params);
+CELL * p_matMultiply(CELL * params);
+CELL * p_matTranspose(CELL * params);
+CELL * p_match(CELL * params);
+CELL * p_maxFloat(CELL * params);
+CELL * p_member(CELL * params);
+CELL * p_minFloat(CELL * params);
+CELL * p_modFloat(CELL * params);
+CELL * p_modulo(CELL * params);
+CELL * p_mulFloat(CELL * params);
+CELL * p_multiply(CELL * params);
+CELL * p_name(CELL* params);
+CELL * p_netAccept(CELL * params);
+CELL * p_netClose(CELL * params);
+CELL * p_netConnect(CELL * params);
+CELL * p_netEval(CELL * params);
+CELL * p_netLastError(CELL * params);
+CELL * p_netListen(CELL * params);
+CELL * p_netLocal(CELL * params);
+CELL * p_netLookup(CELL * params);
+CELL * p_netPeek(CELL * params);
+CELL * p_netPeer(CELL * params);
+CELL * p_netPing(CELL * params);
+CELL * p_netReceive(CELL * params);
+CELL * p_netReceiveFrom(CELL * params);
+CELL * p_netReceiveUDP(CELL * params);
+CELL * p_netSelect(CELL * params);
+CELL * p_netSend(CELL * params);
+CELL * p_netSendTo(CELL * params);
+CELL * p_netSendUDP(CELL * params);
+CELL * p_netService(CELL * params);
+CELL * p_netSessions(CELL * params);
+CELL * p_new(CELL * params);
+CELL * p_normal(CELL * params);
+CELL * p_not(CELL * params);
+CELL * p_notEqual(CELL * params);
+CELL * p_now(CELL * params);
+CELL * p_nper(CELL * params);
+CELL * p_npv(CELL * params);
+CELL * p_nth(CELL * params);
+CELL * p_nthSet(CELL * params);
+CELL * p_open(CELL * params);
+CELL * p_or(CELL * params);
+CELL * p_pack(CELL * params);
+CELL * p_parse(CELL * params);
+CELL * p_parseDate(CELL * params);
+CELL * p_peek(CELL * params);
+CELL * p_pipe(CELL * params);
+CELL * p_pmt(CELL * params);
+CELL * p_pop(CELL * params);
+CELL * p_popAssoc(CELL * params);
+CELL * p_postUrl(CELL * params);
+CELL * p_powFloat(CELL * params);
+CELL * p_prettyPrint(CELL * params);
+CELL * p_print(CELL * params);
+CELL * p_println(CELL * params);
+CELL * p_probabilityChi2(CELL * params);
+CELL * p_probabilityZ(CELL * params);
+CELL * p_process(CELL * params);
+CELL * p_push(CELL * params);
+CELL * p_putUrl(CELL * params);
+CELL * p_deleteUrl(CELL * params);
+CELL * p_pv(CELL * params);
+CELL * p_quote(CELL * params);
+CELL * p_rand(CELL * params);
+CELL * p_random(CELL * params);
+CELL * p_randomize(CELL * params);
+CELL * p_readBuffer(CELL * params);
+CELL * p_readChar(CELL * params);
+CELL * p_readFile(CELL * params);
+CELL * p_readKey(CELL * params);
+CELL * p_readLine(CELL * params);
+CELL * p_realpath(CELL * params);
+CELL * p_ref(CELL * params);
+CELL * p_refAll(CELL * params);
+CELL * p_refSet(CELL * params);
+CELL * p_regex(CELL * params);
+CELL * p_remove(CELL * params);
+CELL * p_removeDir(CELL * params);
+CELL * p_renameFile(CELL * params);
+CELL * p_replace(CELL * params);
+CELL * p_replaceAssoc(CELL * params);
+CELL * p_reset(CELL * params);
+CELL * p_rest(CELL * params);
+CELL * p_reverse(CELL * params);
+CELL * p_rotate(CELL * params);
+CELL * p_round(CELL * params);
+CELL * p_save(CELL * params);
+CELL * p_search(CELL * params);
+CELL * p_seed(CELL * params);
+CELL * p_seek(CELL * params);
+CELL * p_select(CELL * params);
+CELL * p_semaphore(CELL * params);
+CELL * p_sequence(CELL * params);
+CELL * p_series(CELL * params);
+CELL * p_set(CELL * params);
+CELL * p_setAssoc(CELL * params);
+CELL * p_setlocale(CELL * params);
+CELL * p_setNth(CELL * params);
+CELL * p_setq(CELL * params);
+CELL * p_setRef(CELL * params);
+CELL * p_setRefAll(CELL * params);
+CELL * p_sgn(CELL * params);
+CELL * p_share(CELL * params);
+CELL * p_shiftLeft(CELL * params);
+CELL * p_shiftRight(CELL * params);
+CELL * p_signal(CELL * params);
+CELL * p_silent(CELL * params);
+CELL * p_sin(CELL * params);
+CELL * p_sinh(CELL * params);
+CELL * p_asinh(CELL * params);
+CELL * p_sleep(CELL * params);
+CELL * p_slice(CELL * params);
+CELL * p_sort(CELL * params);
+CELL * p_sqrt(CELL * params);
+CELL * p_startsWith(CELL * params);
+CELL * p_string(CELL * params);
+CELL * p_subFloat(CELL * params);
+CELL * p_subtract(CELL * params);
+CELL * p_swap(CELL * params);
+CELL * p_symbol(CELL * params);
+CELL * p_symbolSource(CELL * params);
+CELL * p_symbols(CELL * params);
+CELL * p_systemSymbol(CELL * params);
+CELL * p_references(CELL * params);
+CELL * p_system(CELL * params);
+CELL * p_systemError(CELL * params);
+CELL * p_systemInfo(CELL * params);
+CELL * p_tan(CELL * params);
+CELL * p_tanh(CELL * params);
+CELL * p_atanh(CELL * params);
+CELL * p_throw(CELL * params);
+CELL * p_throwError(CELL * params);
+CELL * p_time(CELL * params);
+CELL * p_timeOfDay(CELL * params);
+CELL * p_timerEvent(CELL * params);
+CELL * p_title(CELL * params);
+CELL * p_trace(CELL * params);
+CELL * p_traceHighlight(CELL * params);
+CELL * p_trim(CELL * params);
+CELL * p_unique(CELL * params);
+CELL * p_unicode(CELL * params);
+CELL * p_unify(CELL * params);
+CELL * p_unless(CELL * params);
+CELL * p_unpack(CELL * params);
+CELL * p_until(CELL * params);
+CELL * p_upper(CELL * params);
+CELL * p_utf8(CELL * params);
+CELL * p_utf8len(CELL * params);
+CELL * p_uuid(CELL * params);
+CELL * p_waitpid(CELL * params);
+CELL * p_when(CELL * params);
+CELL * p_while(CELL * params);
+CELL * p_writeBuffer(CELL * params);
+CELL * p_writeChar(CELL * params);
+CELL * p_writeFile(CELL * params);
+CELL * p_writeLine(CELL * params);
+CELL * parseAttributes(char * endSrc);
+CELL * parseDoc(void);
+CELL * parseNormalTag(char * endSrc, char * newSrc);
+CELL * parseTag(char * closeTagStr);
+CELL * patternMatchL(CELL * pattern, CELL * list, int flag);
+CELL * patternMatchS(char * pattern, char * string);
+CELL * ping(CELL * address, int timeout, int mode, int count, int option);
+CELL * popString(CELL * str, CELL * params);
+CELL * pushOnString(CELL * newStr, CELL * str, CELL * idx);
+CELL * println(CELL * params, int flag);
+CELL * readProcess(char * command);
+CELL * repeat(CELL * params, int type);
+CELL * setDefine(SYMBOL * symbol, CELL * params, int force);
+CELL * setInterDiff(CELL * params, int mode);
+CELL * setRef(CELL * params, int mode);
+CELL * strUpperLower(CELL * params, int type);
+CELL * stuffFloat(double * floatPtr);
+CELL * stuffInteger(UINT contents);
+#ifndef NEWLISP64
+CELL * stuffInteger64(INT64 contents);
+#endif
+CELL * stuffIntegerList(int argc, ...);
+CELL * stuffString(char * string);
+CELL * stuffStringN(char * string, int len);
+CELL * stuffSymbol(SYMBOL * sPtr);
+CELL * sublist(CELL * list, ssize_t offset, ssize_t length);
+CELL * substring(char * string, ssize_t slen, ssize_t offset, ssize_t len);
+CELL * sysEvalString(char * str, CELL * errorProc, SYMBOL * context);
+CELL * updateCell(CELL * cell, CELL * val);
+CELL * whileUntil(CELL * params, int whileUntilFlag);
+CELL * writeProcess(char * command, char * inp);
+FILE * serverFD(int port, char * domain, int reconnect);
+FILE * win32_fdopen(int handle, const char * mode);
+SYMBOL * getCreateContext(CELL * params, int eval);
+SYMBOL * getDynamicSymbol(CELL * cell);
+SYMBOL * getSymbolCheckProtected(CELL * params);
+SYMBOL * lookupSymbol(char * token, SYMBOL * context);
+SYMBOL * translateCreateSymbol(char * token, int type, SYMBOL * context, int forceFlag);
+size_t adjustNegativeIndex(ssize_t index, size_t length);
+ssize_t searchBuffer(char * buffer,  size_t length, char * string, size_t size, int caseFlag);
+ssize_t searchBufferRegex(char * string,  int offset, char * pattern, int length, int options, int * len);
+INT64 fileSize(char * pathName);
+char * getFormatType(char * fmt, int * type);
+char * netLastError(void);
+char * parsePackFormat(char * format, int * length, int * type);
+char * prompt(void);
+char * readStreamText(STREAM * stream, char * limit);
+char * replaceString (char * keyStr, int keyLen, char * buff, size_t buffLen, CELL * exprCell, 
+    					UINT * cnt, int options, size_t * newLen);
+char * win32_fgets(char * buffer, int  size, FILE * fPtr);
+char * win32_realpath(const char * filepath, char * realpath);
+double getDirectFloat(CELL * param);
+int compareArrays(CELL * left, CELL * right);
+int compareCells(CELL * left, CELL * right);
+int compareFloats(CELL * left, CELL * right);
+int compareFunc(CELL * left, CELL * right, CELL * func);
+int compareLists(CELL * left, CELL * right);
+int compileExpression(STREAM * stream, CELL * cell);
+int elmntInList(CELL * elmnt, CELL * listHead);
+int evalHttpRequest(char * command, UINT outDevice);
+int executeHTTPrequest(char * request, int type);
+long executeSymbol(SYMBOL * symbol, CELL * params);
+int find(char * key, char * source);
+int getFlag(CELL * params);
+int getToken(STREAM * stream, char * token, int * tklen);
+int isLegalSymbol(char * source);
+int in_cksum(unsigned short * addr, int len);
+int isDir(char * fileName);
+int isFile(char * fileName);
+int main(int argc, char * argv[]);
+int makeStreamFromFile(STREAM * stream, char * fileName, size_t size, size_t offset);
+int milliSecTime(void);
+int my_setenv(const char * varName, const char * varValue, int flag);
+int my_strnicmp(char * s1, char * s2, ssize_t size);
+int my_vasprintf(char * * buffer, const char * format, va_list argptr);
+int netConnect(char * name, int port, int type, char * protocol, int ttl);
+int netConnectLocal(char * path);
+int netAccept(int listenSock);
+int netListenLocal(char * name);
+int netListenOrDatagram(int portNo, int type, char * ifAddr, char * mcAddr);
+int openFile(char * fileName, char * accessMode, char * option);
+int printCell(CELL * cell, UINT printFlag, UINT device);
+int printExpression(CELL * cell, UINT device);
+int process(char * command, int inpipe, int outpipe, int errpipe);
+int sendall(int sock, char * buffer, int len);
+int sortFunc(const void * left, const void *right);
+int timediff(struct timeval end, struct timeval start);
+int wait_ready(int sock, INT64 wait, int mode);
+int win32_fclose(FILE * fPtr);
+int win32_fgetc(FILE * fPtr);
+int win32_fprintf(FILE * fPtr, char * buffer);
+size_t listlen(CELL * listHead);
+ssize_t convertNegativeOffset(ssize_t offset, CELL * list);
+ssize_t readFile(char * fileName, char * * buffer);
+unsigned int asciiIPtoLong(char *ptr);
+
+void * allocMemory(size_t nbytes);
+void * callocMemory(size_t nbytes);
+void * reallocMemory(void * prevPtr, UINT size);
+void allocBlock(void);
+void cardioBeat(void);
+void cleanupResults(int from);
+void closeStrStream(STREAM * stream);
+void closeTrace(void);
+void collectGarbage(void);
+void deleteArray(CELL * cell);
+void deleteFreeSymbol(SYMBOL * sPtr);
+void deleteList(CELL * cell);
+void deleteTagStack(void);
+void encryptPad(char * encrypted, char * data, char * key, size_t dataLen, size_t keyLen);
+void executeCommandLine(char * command, int outDevice, STREAM * cmdStream);
+void errorMissingPar(STREAM * stream);
+void fatalError(int errorNumber, CELL * expr, int deleteFlag);
+void initLocale(void);
+void initStacks(void);
+void initialize(void);
+void linkCell(CELL * left, CELL * right, int linkFlag);
+void makeContextFromSymbol(SYMBOL * symbol, SYMBOL * treePtr);
+void makeStreamFromString(STREAM * stream, char * str);
+void markArray(CELL * cell);
+void markList(CELL * cell);
+void markReferences(SYMBOL * sPtr);
+void mySleep(int ms);
+void openStrStream(STREAM * stream, size_t buffSize, int reopenFlag);
+void openTrace(void);
+void parseClosing(void);
+void parseDTD(void);
+void parseProcessingInstruction(void);
+void prettyPrint(UINT device);
+void printArray(CELL * array, UINT device);
+void printArrayDimensions(CELL * array, UINT device);
+void printErrorMessage(UINT errorNumber, CELL * expr, int deleteFlag);
+void printLambda(SYMBOL * sPtr, UINT device);
+void printString(char * str, UINT device, int size);
+void printSymbol(SYMBOL * sPtr, UINT device);
+void printSymbolName(UINT device, SYMBOL * sPtr);
+void printSymbolNameExt(UINT device, SYMBOL * sPtr);
+void recoverEnvironment(int idx);
+void relinkCells(void);
+void reset(void);
+void saveContext(SYMBOL * sPtr, UINT device);
+void saveSymbols(SYMBOL * sPtr, UINT device);
+void serializeSymbols(CELL * params, UINT device);
+void setupServer(int reconnect);
+void setupAllSignals(void);
+void signal_handler(int sig);
+void swapEndian(char * data, int n);
+void sweepGarbage(void);
+void traceEntry(CELL * cell, CELL * pCell, CELL * args);
+void traceExit(CELL * result, CELL * cell, CELL * pCell, CELL * args);
+void varPrintf(UINT device, char *format, ...);
+void writeLog(char * text, int newLine);
+void writeStreamChar(STREAM * stream, char chr);
+void writeStreamStr(STREAM * stream, char * buff, size_t length);
+size_t appendCellString(CELL * cell, char * buffer, size_t size);
+UINT * copyArray(CELL * params);
+UINT seconds(void);
+UINT64 timediff64(struct timeval end, struct timeval start);
+
+#ifdef SUPPORT_UTF8
+int utf8_1st_len(char * utf8str);
+int utf8_wstr(int * unicode, char * utf8str, int maxwc);
+int wstr_utf8(char * utf8str, int * unicode, int maxstr);
+char * utf8_wchar(char * utf8str, int * chr);
+size_t utf8_wlen(char * utf8str);
+int wchar_utf8(int cvalue, char *buffer);
+
+#ifdef USE_WIN_UTF16PATH
+WCHAR * utf8_to_utf16(const char *utf8str);
+int utf16_to_utf8ptr(const WCHAR *utf16str, char * utf8str, int size);
+char * utf16_to_utf8(const WCHAR *utf16str);
+char *win32_realpath(const char *filepath, char *realpath);
+int rename_utf16(const char* a, const char* b);
+int stat_utf16(const char* a, struct stat* b);
+int chdir_utf16(const char* a);
+int open_utf16(const char* a, int b, int c);
+int mkdir_utf16(const char* a);
+int rmdir_utf16(const char* a);
+int unlink_utf16(const char* a);
+_WDIR * opendir_utf16(const char* a);
+#endif
+#endif
+
+/* eof */
diff --git a/qa-comma b/qa-comma
new file mode 100755
index 0000000..684978e
--- /dev/null
+++ b/qa-comma
@@ -0,0 +1,3234 @@
+#!/usr/bin/newlisp
+(set 'start-of-qa (time-of-day))
+;;
+;; General test suite testing functioning of all built in primitives.
+;;
+;; use from inside the newlisp-x.x.x/ directory
+;;
+;;   ./newlisp qa-dot
+;;
+;;   or for countries and configurations with decimal 
+;;
+;;   ./newlisp qa-comma (for countries and configurations with decimal , )
+;;
+
+(set (sym "test-:" 'QA) (lambda () true))
+(context 'Lex)  ; predeclare/create context for bayes-train
+(context MAIN)
+
+;;  changed for a locale where the comma ',' is the decimal separator
+;;  instead of the decimal point, i.e. Germany
+;;
+
+;; set a locale which uses the decimal comma
+(set-locale "de_DE")
+
+
+(define (utf8qa)
+(set 'unicodelist '(913 914 915 916 937 945 946 947 948 969 32 
+                 1040 1041 1042 1043 1044 1072 1073 1074 1075 1076 13 10))
+
+(set 'utf8str (join (map char unicodelist)))
+
+(if (not (= (length (char 937)) 2)) (QA:failed "UTF-8 char: failed"))
+
+(if (not (and
+    (= (map char (explode (chop utf8str))) (chop unicodelist)) 
+    (= (map char (explode (chop utf8str 3))) (chop unicodelist 3))
+    (= (map char (explode (chop utf8str 5))) (chop unicodelist 5)))) (QA:failed "UTF-8 chop: failed"))
+
+(if (not (= (map char (explode utf8str)) unicodelist)) (QA:failed "UTF-8 explode: failed"))
+
+(if (not (= (map char (explode (upper-case utf8str))) 
+    '(913 914 915 916 937 913 914 915 916 937 32 1040 1041 1042 1043 1044 1040 1041 1042 1043 1044 13 10)))
+    (QA:failed "UTF-8 upper-case: failed"))
+
+(if (not (= (map char (explode (lower-case utf8str))) 
+    '(945 946 947 948 969 945 946 947 948 969 32 1072 1073 1074 1075 1076 1072 1073 1074 1075 1076 13 10)))
+    (QA:failed "UTF-8 lower-case: failed"))
+
+(if (not (= (map char (explode (first utf8str))) '(913))) (QA:failed "UTF-8 first: failed"))
+
+(if (not (= (map char (explode (last utf8str))) '(10))) (QA:failed "UTF-8 last: failed"))
+
+(if (not (= (map char (explode (rest utf8str))) 
+    '(914 915 916 937 945 946 947 948 969 32 1040 1041 1042 1043 1044 1072 1073 1074 1075 1076 13 10)))
+    (QA:failed "UTF-8 rest: failed"))
+
+(if (not (= (map char (explode (first (rest utf8str)))) '(914))) (QA:failed "UTF-8 first, rest: failed"))
+
+(if (not 
+  (and (= (map char (explode (select utf8str 1 2 3))) '(914 915 916))
+       (= (map char (explode (select utf8str -1 -2 -3))) '(10 13 1076))
+       (= (map char (explode (select utf8str 2 4 6))) '(915 937 946))))
+  (QA:failed "UTF-8 select: failed"))
+
+
+(if (not (= (map char (explode (select utf8str '(1 2 3)))) '(914 915 916))) (QA:failed "UTF-8 select: failed"))
+
+(if (not (and
+    (= (map char (explode (nth 1 utf8str))) '(914))
+    (= (map char (explode (nth -5 utf8str))) '(1074))))
+ (QA:failed "UTF-8 nth: failed"))
+
+(if (not (= (map char (explode (nth-set 2 utf8str (char 937)))) '(915))) (QA:failed "UTF-8 nth-set: failed"))
+
+(if (not (= (map char (explode (set-nth 2 utf8str (char 937)))) 
+    '(913 914 937 916 937 945 946 947 948 969 32 1040 1041 1042 1043 1044 1072 1073 1074 1075 1076 13 10)))
+    (QA:failed "UTF-8 set-nth: failed"))
+
+true
+)
+
+(global 'global-myvar)
+(set 'global-myvar 123)
+
+; testing the default functor
+		
+(define (double:double x) (+ x x))
+
+(define (test-default-functor)
+	(and
+		(= (map double '(1 2 3 4 5)) '(2 4 6 8 10))
+		(= (map 'double '(1 2 3 4 5)) '(2 4 6 8 10))
+		(set 'dflt:dflt '(a b c d e f g))
+		(= (map dflt '(1 2 6)) '(b c g))
+		(set 'i 0 'j -1 'k 6)
+		(= (dflt i) 'a)
+		(= (dflt k) 'g)
+		(= (dflt j) 'g)
+		(set 'ctx dflt)
+		(sort (eval (default ctx)) >)
+		(= dflt:dflt '(g f e d c b a))
+))
+		 
+
+(context 'QA)
+
+;; get operating system
+(set 'opsys (& (last (sys-info)) 0xf))
+
+(define (cleanup)
+  (delete-file "junk")
+  (delete-file "junk2"))
+
+(set 'failed-messages '())
+
+(define (check-case x)
+  (case x 
+   (1 "one") 
+   (2 "two") 
+   (3 "three")))
+
+(define (check-cond x)
+  (cond 
+   ((= x 1) 1) 
+   ((= x 2) 2) 
+   ((= x 3) 3)))
+
+(define (checkqa )
+  (dolist (p (symbols 'MAIN)) 
+   (if (primitive? (eval p)) 
+    (begin 
+     (set 'sm (sym (append "test-" (string p)))) 
+     (if (not (lambda? (eval sm))) 
+      (print sm "\n"))))))
+
+(define-macro (do-args p)
+  (= (args) '(2 "3 4" 5 (x y)))
+  (= (args 3 -1) 'y))	
+
+(define (failed msg)
+;  (println msg)
+  (push msg failed-messages))
+
+(define (file-copy from-file to-file)
+  (set 'in-file (open from-file "read"))
+  (set 'out-file (open to-file "write"))
+  (while (set 'chr (read-char in-file)) 
+   (if (not (= chr 95)) 
+    (write-char out-file chr)))
+  (close in-file)
+  (close out-file))
+
+(define (line-count file)
+  (device (open file "read"))
+  (set 'cnt 0)
+  (while (read-line) 
+   (inc 'cnt))
+  (close (device))cnt)
+
+(define (myappend x y)
+  (cond 
+   ((= '() x) y) 
+   (true (cons (first x) (myappend (rest x) y)))))
+
+(define (qa )
+  (set 'sm-cnt 0)
+  (dolist (sm (symbols 'MAIN)) 
+   (if (not 
+     (if (and (primitive? (eval sm)) (< sm 'zzzz)) 
+       (begin 
+          (inc 'sm-cnt (+ (length (name sm)) 1))
+          (if (> sm-cnt 79)
+            (begin
+              (set 'sm-cnt 0)
+              (println)))
+          (print (name sm) " ")
+          (set 'func (eval (sym (append "test-" (string sm)))) )
+          (and (catch (apply func) 'result)  result))
+       true)) 
+     (failed (string ">>>> " sm " failed " result) )))
+  (println))
+
+(define (test-$) (find "a|b" "xtzabc" 0) (= ($ 0) $0))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; test-functions ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(define (test-!)
+  (integer? (! "")))
+
+(define (test-!= )
+  (and (not (!= -9223372036854775808 (& -9223372036854775808 -1))) (!= "abc" "ABC")
+   (!= "a" "?")
+   (!= 1,000000001 1)
+   (!= "?" "a")))
+
+(define (test-$)
+	(set '$0 123)
+	(= ($ 0) 123))
+
+(define (test-% )
+  (and
+    (= (% 10 3) 1)
+    (not (catch (%) 'result))))
+
+(define (test-& )
+  (= -9223372036854775808 (& -9223372036854775808 -1)))
+
+(define (test-* )
+  (= (* (* 123456789 123456789)) 15241578750190521))
+
+(define (test-+ )
+  (= (+ 999999999999999999 1) 1000000000000000000)
+  (= (+ 9223372036854775807 -9223372036854775808) -1)
+  (= (+ -9223372036854775808 -1) 9223372036854775807)) ; wraps around
+
+(define (test-- )
+  (= (- 100000000 1) 99999999))
+
+(define (test-/ )
+  (= (/ 15241578750190521 123456789) 123456789)
+  (= (/ -10 5) -2))
+
+(define (test-< )
+  (and 
+   (< -9223372036854775808 9223372036854775807)
+   (< "abcdefg" "abcdefgh")
+   (< 1 1,000000001) 
+   (< 1 "a") 
+   (< "a" 'a)
+   (< '(a b) '(b c) '(c d))
+   (not (< '(a b) '(b d) '(b c)))
+   (< '(((a b))) '(((b c))))
+   (< '(a (b c)) '(a (b d)) '(a (b (d))))
+   (< -1)
+   (< -1,23)
+   (not (< "1"))
+   (not (< '()))
+))
+
+(define (test-<< )
+  (= (<< 1 63) -9223372036854775808))
+
+(define (test-<= )
+  (and (<= -2147483648 2147483647) (<= 1 1,00000001)))
+
+(define (test-= )
+  (and (= 1,23456789 1,23456789) 
+       (= 123456789 123456789) 
+       (= '(1 2 3 (4 5) (a b ("CDEFG" "HIJK") 'u 'v 'w)) 
+          '(1 2 3 (4 5) (a b ("CDEFG" "HIJK") 'u 'v 'w))) 
+       (= "éâäáíóúñÑöò" "éâäáíóúñÑöò")
+       (= '())
+       (= 0)
+       (= "")
+       (not (= 1))
+       (not (= "abc"))
+       (not (= '(1 2 3)))
+))
+
+
+(define (test-> )
+  (and (> 2147483647 -2147483648) (> "abcdefgh" "abcdefg") (> 1,000000001 
+    1) 
+   (> "a" 1) 
+   (> "z" "aaaaa")
+   (> "aaa" "a")
+   (> 'a "a") 
+   (> '(a) 'a)
+   (> 1)
+   (> 1,23)
+   (> "abc")
+   (> '(1 2 3))
+   (not (> ""))
+   (not (> '()))   
+))
+
+(define (test->= )
+  (and (>= 1 0) (>= 1,00000001 1)))
+
+(define (test->> )
+  (= (>> 1073741824 30) 1))
+
+(define (test-NaN? )
+  (and (NaN? (sqrt -1))
+       (set 'NaN (sqrt -1)) 
+       (= 1 (+ 1 NaN)) 
+       (= 0 (* 2 NaN)) 
+       (NaN? (add 1 (sqrt -1))) 
+       (NaN? (abs (sqrt -1)))))
+
+(define (test-^ )
+  (= (^ 1431655765 -1431655766) -1))
+
+(define (test-abs )
+  (and (= (abs -1) 1) (= (abs -9,9) 9,9)))
+
+(define (test-acos )
+  (= 0 (acos (cos (acos (cos 0))))))
+
+(define (test-acosh)
+	(= (cosh (acosh 1)) 1))
+
+(define (test-add , l)
+  (dotimes (x 100) 
+   (push x l))
+  (= 4950 (apply add l)))
+
+(define (test-address, s)
+	(set 's "foo")
+	(= (address s) (last (dump s))))
+
+(define (test-amb)
+	(set 'x (amb 1 2))
+	(or (= x 1) (= x 2)))
+
+(define (test-and )
+  (and (and true true true) (not (and true true nil))))
+
+(define (test-append )
+  (and
+	(= '(1 2 3 4) (append '(1 2) '(3 4)))
+	(= '(1 2 3 4 5) (append '(1 2) '(3) '(4 5)))
+	(= '(1 2 3 4) (append '(1 2) '(3 4) '()))
+	(= '(1 2 3 4 5) (append '(1 2) '(3 4) '() '(5)))
+	(= '(1 2 3 4 5) (append '() '(1 2) '(3 4) '() '(5)))
+	(= '() (append '()) (append '() '()) (append))
+	(= "abcdefg" (append "" "a" "bcd" "" "ef" "g" ""))
+	(= "" (append ""))
+	(set 'A (array 3 2 (sequence 1 6)))
+	(set 'B (array 2 2 (sequence 7 10)))
+	(= (array 5 2 (sequence 1 10)) (append A B))
+	(lambda? (append '(lambda)))
+))
+
+(define (test-append-file)
+  (append-file "junk" "ABC")
+  (append-file "junk" "DEF")
+  (= (read-file "junk") "ABCDEF")
+)
+
+
+(define (test-apply )
+  (and (= (apply + '(1 2)) 3) 
+       (= (apply append '("a" "b" "c")) "abc")
+       (= (apply (fn (x y) (+ x y)) '(3 4)) 7)
+))
+
+(define (test-args )
+  (do-args 1 2 "3 4" 5 (x y)))
+
+(define (test-array) 
+  (and
+    (= (array-list (array 3 2 (sequence 1 6))) '((1 2) (3 4) (5 6)))
+    (set 'A (array 3 2 (sequence 1 6)))
+    (= (array-list (nth 0 A)) '(1 2))
+    (= (nth 0 0 A) 1)
+    (= (nth 2 1 A) 6)
+    (= (nth -1 -1 A) 6)
+    (not (catch (nth 10 10 A)  'result))
+    (not (catch (nth -10 -10 A) 'result))
+    (= (nth 0 A) (array 2 '(1 2)))
+    (= (array-list (nth 0 A)) '(1 2))
+    (< (nth 0 A) (nth 1 A))
+    (> (nth 2 A) (nth 1 A))
+    (set-nth 1 0 A 1)
+    (= (nth 1 0 A) 1)
+    (= (nth-set 1 1 A 1) 4)
+    (< (nth 1 A) (nth 0 A))
+))
+
+(define (test-array-list)
+	(set 'a (array 3 4 (sequence 1 12)))
+	(and (array? a) (list? (array-list a))))
+
+(define (test-array?) (test-array-list))
+
+(define (test-asin )
+  (= (round (asin (sin (asin (sin 1)))) -9) 1))
+
+(define (test-asinh)
+  (= (sinh (asinh 1)) 1))
+
+(define (test-assoc )
+  (= (assoc 'b '((a 1) (b 2))) '(b 2)))
+
+(define (test-assoc-set)
+	(and
+		(set 'A '((a 1) (b 2) (c 3)))
+  		(= (assoc-set (A 'b) '(b 3)) '(b 2))
+		(= A '((a 1) (b 3) (c 3)))
+))
+
+(define (test-atan )
+	(< (sub 1 (atan (tan (atan (tan 1))))) 1e-15))
+
+; old test broke after Mac OS X update to 10.5.2
+;  (= 1 (atan (tan (atan (tan 1)))))
+
+(define (test-atanh)
+	(< (sub (tanh (atanh 0,5)) 0,5) 0,0000000001))
+
+(define (test-atan2 )
+  (= (div (acos 0) (atan 1 1)) 2))
+
+(define (test-atom? )
+  (and (atom? 1) (atom? 1,23) (atom? "hello") (atom? 'x) (atom? nil) (atom? true)))
+
+(define (test-base64-enc)
+  (and
+    (= "" (base64-dec (base64-enc "")))
+    (= "1" (base64-dec (base64-enc "1")))
+    (= "12" (base64-dec (base64-enc "12")))
+    (= "123" (base64-dec (base64-enc "123")))
+    (= "1234" (base64-dec (base64-enc "1234")))
+))
+
+(define (test-base64-dec)
+  (test-base64-enc))
+
+;; context Lex was previously created
+
+(define (test-bayes-train)
+  (and
+    (= (bayes-train '(F F F B B) '(F B B B B) 'Lex) '(5 5))
+    (> 0,001 (apply add (map sub (bayes-query '(F) Lex) '(0,75 0,25))))
+    (> 0,001 (apply add (map sub (bayes-query '(F) Lex true) '(0,75 0,25))))
+    (> 0,001 (apply add (map sub (bayes-query '(F F) Lex) '(0,8251777681 0,1748222319))))
+    (> 0,001 (apply add (map sub (bayes-query '(F F) Lex true) '(0,9 0,1))))
+  )
+)
+
+(define (test-bayes-query) 
+	(set 'Lex:F '(0 0))
+	(set 'Lex:B '(0 0))
+	(set 'Lex:total '(0 0))
+	true)
+
+(define (test-begin )
+  (begin 
+   (set 'x 0) 
+   (inc 'x) 
+   (inc 'x) 
+   (= x 2)))
+
+(define (test-beta )
+  (< (abs (sub (beta 1 2) 0,5)) 1e-05))
+
+(define (test-betai )
+  (< (abs (sub (betai 0,5 5 10) 0,910217)) 1e-05))
+
+(define (test-bind)
+	(bind '((a 1) (b "hello") (c (3 4))))
+	(and
+		(= a 1)
+		(= b "hello")
+		(= c '(3 4)))
+)
+
+(define (test-binomial )
+  (< (sub (binomial 2 1 0,5) 0,5) 1e-09))
+
+(define (test-break )
+  (break true)
+  (= true (break))
+  (not (break nil)))
+
+(define (test-case )
+  (and (= (check-case 1) "one") (= (check-case 2) "two") (= (check-case 
+     9) nil)))
+
+(define (test-callback) true)
+
+(define (test-catch )
+  (and 
+	(catch (+ 3 4) 'result) 
+        (= result 7)
+	(= (catch (+ 3 4)) 7)
+        (= (catch (dotimes (x 100) (if (= x 7) (throw x)))) 7)
+))
+
+(define (test-ceil )
+  (= 2 (ceil 1,5)))
+
+(define (test-change-dir )
+  (make-dir "adir")
+  (change-dir "adir")
+  (change-dir "..")
+  (remove-dir "adir"))
+
+(define (test-char )
+  (and 
+    (= (format "%c" (char "a" 0)) "a") 
+    (= (char "A") 65) (= (char 65) "A")
+    (= (map char (sequence 65 67)) '("A" "B" "C"))
+    (= (char 0) "\000")))
+
+(define (test-chop )
+  (and 
+    (= (chop "newlisp") "newlis") 
+    (= (chop "newlisp" 4) "new"))
+	(= (chop "abc" 5) "")
+	(= (chop "abc" -5) "")
+    (= (chop '(a b (c d) e)) '(a b (c d)))
+    (= (chop '(a b (c d) e) 2) '(a b)))
+
+(define (test-clean )
+  (and
+    (= (clean integer? '(1 1,1 2 2,2 3 3,3)) '(1,1 2,2 3,3))
+    (= (clean true? '(a nil b nil c nil)) '(nil nil nil))))
+
+(define (test-close , fno)
+  (and 
+    (set 'fno (open "qa-comma" "read")) 
+    (close fno)))
+
+(define (test-crc32)
+    (= (crc32 "abcdefghijklmnopqrstuvwxyz") 1277644989))
+
+(define (test-select-collect )
+  (and
+    (set 'l '(0 1 2 3 4 5 6 7 8 9))
+    (= (select l '()) '())
+    (= (select l 0 9 9 0 1 8 8 1) '(0 9 9 0 1 8 8 1)) 
+    (= (select "2001-09-20" 5 6 8 9 0 1 2 3) "09202001") 
+    (set 'a 0 'b 1 'c 2)
+    (= (select '(w x y z) a b c) '(w x y))
+    (= (select '(w x y z) (inc 'a) (inc 'b) (inc 'c)) '(x y z))
+))
+
+(define (test-command-line )
+  (and (not (command-line nil)) (command-line true)))
+
+(define (test-cond )
+  (and 
+      (= (check-cond 1) 1)
+      (= (check-cond 2) 2)
+      (not (check-cond 99)) 
+      (= (cond ((+ 3 4))) 7)
+      (= (cond (nil 1) ('())) '())
+      (= (cond (nil 1) (nil)) nil)
+      (= (cond (nil 1) (true nil)) nil)
+      (= (cond ('())) '())
+      (= (cond (nil 1) ('() 2)) '())
+))
+
+(define (test-cons )
+  (= (myappend '(1 2 3) '(4 5 6)) '(1 2 3 4 5 6))
+  (= (cons 'c '(a b) -1) '(a b c))
+)
+
+(define (test-constant )
+  (constant 'cs 123)
+  (= cs 123)
+  (define (trick z) (constant 'z 999))
+  (= (trick) 999)
+  (= (set 'z 123) 123)
+  (= (trick) 999)
+  (= z 123))
+
+
+(define (test-context )
+  (and (context 'TEST) (context 'QA)))
+
+(define (test-context? )
+  (and (context? MAIN) (context? QA)))
+
+(define (test-copy-file ) 
+  (and (copy-file "qa-comma" "junk") (delete-file "junk")))
+
+(define (test-cos )
+  (= 1 (cos (acos (cos (acos 1))))))
+
+(define (test-cosh)
+	(= (cosh 1) (div (add (exp 1) (exp -1)) 2)))
+
+(define (test-count )
+  (and (= (count '(1 2) '(2 1 2 1)) '(2 2)) 
+       (= (count '(a b) '(a a b c a b b)) '(3 3))
+       (= (count '(a b c) '()) '(0 0 0))
+  )
+)
+
+(define (test-cpymem)  
+  (set 'from "12345")
+  (set 'to "     ")
+  (cpymem (address from) (address to) 5)
+  (= from to))
+
+(define (test-crit-chi2 )
+  (< (abs (sub (crit-chi2 0,559506 10) 9,999991)) 1e-05))
+
+(define (test-crit-z )
+  (< (abs (sub (crit-z 0,999) 3,090232)) 1e-05))
+
+(define (test-current-line , handle)
+  (and
+    (set 'handle (open "qa-comma" "r"))
+    (= (read-line handle) "#!/usr/bin/newlisp") 
+    (= (current-line) "#!/usr/bin/newlisp") 
+    (close handle)))
+
+(define (test-curry)
+  (and
+    (= (set 'f (curry + 10)) (lambda (_x) (+ 10 _x)))
+    (= (filter (curry match '(a *)) '((a 10) (b 5) (a 3) (c 8) (a 9)))
+       '((a 10) (a 3) (a 9)))
+    (= (clean (curry match '(a *)) '((a 10) (b 5) (a 3) (c 8) (a 9)))
+       '((b 5) (c 8)))
+    (= (map (curry list 'x) (sequence 1 5))
+       '((x 1) (x 2) (x 3) (x 4) (x 5)))
+))
+
+(define (test-date )
+  (= (date) (date (date-value)) (date (apply date-value (now)))))
+
+(define (test-date-value )
+  (= 0 (date-value 1970 1 1 0 0 0)))
+
+(define (test-debug )
+  (= (debug (+ 3 4)) 7))
+
+(define (test-dec , x)
+  (set 'x 20)
+  (and (= 19 (dec 'x)) (= 17 (dec 'x 2)) (= 16,5 (dec 'x 0,5))))
+
+(define (test-define , foo)
+  (and 
+	(lambda? (define (foo (x 1) (y 2)) (list x y)))
+    (= (foo) '(1 2))
+	(= (foo 3) '(3 2))
+	(= (foo 3 4) '(3 4))
+	(define (foo (x 10) (y (div x 2))) (list x y))
+	(= (foo) '(10 5))
+	(= (foo 20) '(20 10))
+	(= (foo 3 4) '(3 4))
+))
+
+(define (test-def-new)
+  (and
+    (set 'fooctx:x 123)
+    (new fooctx)
+    (= fooctx:x 123)
+    (set 'barctx:bar 999)
+    (def-new 'barctx:bar)
+    (= bar 999)
+    (def-new 'barctx:bar 'foobar)
+    (= foobar 999)
+    (def-new 'barctx:bar 'foofoo:foo)
+    (= foofoo:foo 999)
+))
+
+
+(define (test-define-macro , foo)
+  (and 
+	(macro? (define-macro (foo (x 1) (y 2)) (list x y)))
+    (= (foo) '(1 2))
+	(= (foo 3) '(3 2))
+	(= (foo 3 4) '(3 4))
+	(define-macro (foo (x 10) (y (div x 2))) (list x y))
+	(= (foo) '(10 5))
+	(= (foo 20) '(20 10))
+	(= (foo 3 4) '(3 4))
+))
+
+(define (test-default)
+	(MAIN:test-default-functor))
+
+(define (test-delete )
+  (delete 'xxx))
+
+(define (test-delete-file ) 
+  (and (copy-file "qa-comma" "junk") (delete-file "junk")))
+
+(define (test-delete-url )
+  (= "ERR: bad formed URL" (delete-url "")))
+
+(define (test-destroy)
+ 	(if (or (< opsys 5)(= opsys 9))
+		(set 'pid (fork (dotimes (t 100) (sleep 100))))
+		(set 'pid (process "newlisp"))	)
+	(destroy pid))
+
+(define (test-det) 
+  (set 'A '((-1 1 1) (1 4 -5) (1 -2 0)))
+  (<  (sub (det A) -1) 2e-10))
+
+(define (test-device , fno)
+  (set 'fno (open "junk" "write"))
+  (device fno)
+  (if (= (device) fno) 
+   (close (device))))
+
+(define (test-difference )
+  (and
+    (= (difference '(2 5 6 0 3 0 2 5) '(1 2 3 3 2 1)) '(5 6 0))
+    (= (difference '(1 5 2 3 2 2 4 5 3 4 5 1) '(3 4) true) '(1 5 2 2 2 5 5 1))
+    (= (difference '(nil nil nil) '()) '(nil))
+    (= (difference '(nil nil nil) '() true) '(nil nil nil))
+  )
+)
+
+(define (test-directory )
+  (or (find "qa-comma" (directory)) (find "QA" (directory))))
+
+(define (test-directory? )
+  (directory? "."))
+
+(define (test-div )
+  (and (= 0,1 (div 100000000 1000000000)) 
+       (= (div 1 3) 0,3333333333333333)
+       (= (div 3) 0,3333333333333333)
+))
+
+(define (testdoargs)
+	(local (lst)
+		(doargs (i) (push i lst))
+		lst))
+
+(define (test-doargs)
+	(= (testdoargs 3 2 1) '(1 2 3)))
+
+(define (test-dolist , rList)
+  (and 
+   (dolist (x '(1 2 3 4 5 6 7 8 9)) 
+    (push x rList)) 
+   (= rList '(9 8 7 6 5 4 3 2 1)) 
+   (dolist (x rList) 
+    (pop rList))
+    (dolist (x '(1 2 3 4 5 6 7 8 9) (> x 5))
+	  (push x rList))
+   (= rList '(5 4 3 2 1))
+   (= (local (l) (dolist (e '(1 2 3)) (push $idx l)) l) '(2 1 0))
+   (= (dolist (x '(a b c d e f g)) x) 'g)
+))
+
+(define (test-dostring)
+	(local (r) 
+		(dostring (i "newlisp" (= i 108)) (push  i r)) 
+		(= r '(119 101 110))
+		(= (dostring (c "newlisp") c) 112)
+ 	)
+)
+
+(define (test-dotimes , aList)
+  (dotimes (x 2) 
+   (dotimes (y 2) 
+    (dotimes (z 2) 
+     (push z aList))))
+  (and
+     (= '(1 0 1 0 1 0 1 0) aList)
+     (not (dotimes (x 0) x))
+     (= (dotimes (x 1) x) 0)
+
+     ; dotimes returns nil when ever executed since 8.9.7
+     (not (= (dotimes (x -1) x) 0))
+     (not (= (dotimes (x -1,8) x) 0))
+
+     (= (dotimes (x 1,8) x) 0)
+	 (set 'cnt 0)
+	 (dotimes (x 10 (> x 5)) (inc 'cnt))
+	 (= cnt 6)
+
+))
+     
+(define (test-dotree )
+  (set 'aList '())
+  (and
+    (= (last (symbols MAIN)) (dotree (p MAIN) p))
+  	(dotree (x 'MAIN) 
+   		(push x aList))
+  	(= (length (symbols 'MAIN)) (length aList))
+))
+
+(define (test-dump )
+  ( = "hello" (get-string (last (dump "hello")))))
+
+(define (test-dump-symbol )
+  (= (length (dump nil) 4)))
+
+(define (test-dup)
+  (and
+    (= (dup "" 0) "")
+    (= (dup "" 10) "")
+    (= (dup "A" 10) "AAAAAAAAAA")
+    (= (dup "AB" 5) "ABABABABAB")
+    (= (dup 'x 5) '(x x x x x))
+	(= (dup "l" -1) "")
+	(= (dup '(1) -1) '())
+    (= (dup 1 0) '())
+    (= (dup 1 5) '(1 1 1 1 1))))
+
+(define (test-empty? , aList)
+  (set 'aList '(1 2 3 4 5 6 7 8 9 0))
+  (while aList 
+   (pop aList))
+  (and (empty? aList) (empty? "")))
+
+(define (test-encrypt )
+  (= (encrypt (encrypt "newlisp" "123") "123") "newlisp"))
+
+(define (test-ends-with )
+  (and 
+	(ends-with "newlisp" "lisp") 
+	(ends-with "newlisp" "LISP" nil) 
+	(ends-with "abc.def.ghi" "def|ghi" 1)
+	(ends-with "12345" "4|5" 1)
+   	(ends-with (explode "newlisp") "p")))
+
+(define (test-env)
+  (and 
+    (list? (env))
+    (env "key" "value") 
+    (= (env "key") "value")
+	(env "key" "") ; remove key
+	(if (= ostype "Solaris")
+		(= (env "key" ""))
+		(not (env "key")))
+))
+
+(define (test-erf)
+   (<  (abs (sub 0,5204998778 (erf 0,5))) 0,000001))
+
+(define (alarm) (println "ring..."))
+
+(define (test-timer)
+        (timer 'alarm 2))
+
+(define (test-title-case)
+	(= (title-case "heLLo") "HeLLo")
+	(= (title-case "heLLo" true) "Hello"))
+
+(define (test-throw-error)
+    (and
+        (not (catch (throw-error "message text") 'result))
+        (starts-with result "user error :")) )
+
+(define (test-error-event )
+  (= 'nil (error-event)))
+
+(define (test-error-number )
+  (integer? (error-number)))
+
+(define (test-error-text )
+  (= (error-text 24) "invalid function"))
+
+(define (test-eval , x y)
+  (set 'x 123)
+  (set 'y 'x)
+  (set 'z 'y)
+  (and (= 123 (eval y)) (= 123 (eval 'x)) (= 123 (eval (eval z)))))
+
+(define (test-eval-string )
+  (eval-string "(set 'x 123)")
+  (eval-string "(set 'y x)")
+  (and (= 123 (eval-string "y")))
+  (= 123 (eval-string "(blah-blah)" 123))
+  (set 'Foo:xyz 99999)
+  (= 99999 (eval-string "xyz" nil 'Foo))
+)
+
+(define (test-exec )
+  (and (sub-read-exec) (sub-write-exec)))
+
+(define (sub-read-exec ) 
+   (write-file "exectest" {(println "hello") (exit)})
+   (and
+     (set 'result  (if (and (> opsys 5) (< opsys 9))
+	(exec "newlisp exectest") (exec "./newlisp exectest")))
+     (or (= '("hello") result) (= '("" "hello") result)) 
+     (delete-file "exectest")))
+
+(define (sub-write-exec )
+  (and 
+    (write-file "testexec" {(write-file "exectest" (read-line))})
+    (if (> opsys 5) (exec "newlisp testexec" "HELLO") (exec "./newlisp testexec" "HELLO"))
+    (= "HELLO" (read-file "exectest"))
+    (delete-file "testexec")
+    (delete-file "exectest")))
+
+
+(define (test-exit )
+  (or (primitive? exit) (lambda? exit)))
+
+(define (test-exists)
+  (and
+    (= (exists string? '(2 3 4 6 "hello" 7)) "hello")
+    (not (exists string? '(3 4 2 -7 3 0)) )
+    (= (exists zero? '(3 4 2 -7 3 0)) 0)
+    (= (exists < '(3 4 2 -7 3 0)) -7)
+    (= (exists (fn (x) (> x 3)) '(3 4 2 -7 3 0)) 4)
+    (not (exists (fn (x) (= x 10)) '(3 4 2 -7 3 0)))
+))
+
+(define (test-exp )
+  (= 1 (exp (log (exp (log (exp (log 1))))))))
+
+(define (test-expand)
+  (and
+    (set 'x 2)
+    (= (expand '(a x b) 'x) '(a 2 b))
+    (= (expand '(x b) 'x) '(2 b))
+    (= (expand '(a x) 'x) '(a 2))
+    (= (expand '(a (x) b) 'x) '(a (2) b))
+    (= (expand '(a ((x)) b) 'x) '(a ((2)) b))
+    (set 'a 1 'b 2 'c 3)
+    (= (expand '(a b c) 'b 'a 'c ) '(1 2 3))
+	;; prolog mode with uppercase vars
+	(set 'X 2)
+	(= (expand '(a ((X)) b)) '(a ((2)) b))
+	;; env list as parameter
+	(set 'a "a" 'B "B" 'c "c" 'd "d")
+	(= (expand '(a (B (c) (d a B))) '((a 1) (B 2) (c 3) (d 4)))
+	   '(1 (2 (3) (4 1 2))))
+	(= a "a") (= B "B") (= c "c") (= d "d")
+))
+
+
+(define (test-explode )
+	(and	
+		(= (explode "kakak" -1) '())
+		(= (explode "ABC" 4) '("ABC"))
+		(= (explode '(a b c d e f) -1) '())
+  		(= (explode "new") '("n" "e" "w"))
+		(= (explode "newlisp" 3) '("new" "lis" "p"))
+		(= (explode "newlisp" 3 true) '("new" "lis"))
+		(= (explode "newlisp" 7 true) '("newlisp"))
+		(= (explode "newlisp" 8 true) '())
+		(= (explode '(a b c d e)) '((a) (b) (c) (d) (e)))
+		(= (explode '(a b c d e) 2) '((a b) (c d) (e)))
+		(= (explode '(a b c d e)) '((a) (b) (c) (d) (e)))
+		(= (explode '(a b c d e) 2) '((a b) (c d) (e)))
+		(= (explode '(n e w l i s p)) '((n) (e) (w) (l) (i) (s) (p)))
+		(= (explode '(n e w l i s p) 3) '((n e w) (l i s) (p)))
+		(= (explode '(n e w l i s p) 7 true) '((n e w l i s p)))
+        (= (explode '(n e w l i s p) 8 true) '())
+))
+
+(define (test-factor)
+    (= (apply * (factor 0x7FFFFFFFFFFFFFFF)) 0x7FFFFFFFFFFFFFFF))
+
+(define (test-fft )
+  (= '((1 2) (3 4)) (ifft (fft '((1 2) (3 4))))))
+
+(define (test-file-info )
+  (list? (file-info "qa-comma")))
+
+(define (test-file? )
+  (file? "qa-comma"))
+
+(define (test-filter )
+  (and
+    (= (filter integer? '(1 1,1 2 2,2 3 3,3)) '(1 2 3))
+    (= (filter true? '(a nil b nil c nil)) '(a b c))))
+
+(define (test-find )
+  (and
+    (= 3 (find '(3 4) '(0 1 2 (3 4) 5 6 7 8)))
+    (= nil (find 9 '(1 2 3)))
+    (= 2 (find "W" "newlisp" 1))
+    (= $0 "w")
+    (= (find "newlisp" '("Perl" "Python" "newLISP") 1) 2)
+    ; use a comparison functor
+    (= (find '(1 2) '((1 4) 5 6 (1 2) (8 9))) 3)
+    (= (find 3 '(8 4 3  7 2 6) >)  4)
+    (= (find 5 '((l 3) (k 5) (a 10) (z 22)) (fn (x y) (= x (last y)))) 1)
+    (= (find '(a ?) '((l 3) (k 5) (a 10) (z 22)) match) 2)
+    (= (find '(X X) '((a b) (c d) (e e) (f g)) unify) 2)
+    (define (has-it-as-last x y) (= x (last y)))
+    (= (find 22 '((l 3) (k 5) (a 10) (z 22)) has-it-as-last) 3)
+    (= (find "newlisp" '("Perl" "Python" "newLISP") (fn (x y) (regex x y 1))) 2)
+))
+
+(define (test-find-all)
+  (and
+    (= (find-all {\d+} "asdf2kjh44hgfhgf890") '("2" "44" "890"))
+    (= (find-all {(new)(lisp)} "newLISPisNEWLISP" (append $2 $1) 1) '("LISPnew" "LISPNEW"))
+))
+
+(define (test-first )
+  (= 1 (first '(1 2 3 4)))
+  (= "n" (first "ewLISP"))
+  (= (array 2 '(1 2)) (first (array 3 2 (sequence 1 6))))
+)
+
+(define (test-flat )
+  (set 'lst '(a (b (c d))))
+  (= (map (fn (x) (ref x lst)) (flat lst)) '((0) (1 0) (1 1 0) (1 1 1))))
+
+(define (test-float )
+  (float? (float "1,234")))
+
+(define (test-flt)
+	(= (flt 1,23) 1067282596))
+
+(define (test-float? )
+  (float? 1,234))
+
+(define (test-floor )
+  (= 1 (floor 1,5)))
+
+(define (test-for , x lst1 lst2)
+  (set 'lst1 '())
+  (set 'lst2 '())
+  (for (x 10 0 3) 
+   (push x lst1))
+  (for (x 10 0 3 (< x 7))
+   (push x lst2))
+  (and
+   (= lst1 '(1 4 7 10))
+   (= lst2 '(7 10)) )
+)
+
+(define (test-for-all)
+  (and
+    (for-all number? '(2 3 4 6 7)) 
+    (not (for-all number? '(2 3 4 6 "hello" 7)) )
+    (for-all (fn (x) (= x 10)) '(10 10 10 10 10))
+))
+
+(define (test-fork) (integer? (fork (exit))))
+
+(define (test-format )
+  (and
+   (= (format "%d" 1,23) "1") 
+   (= (format "%5.2f" 10) "10,00") 
+   (= (format "%c %s %d %g" 65 "hello" 123 1,23) "A hello 123 1,23")
+   (= (format "%5.2s" "hello") "   he")
+   ; args passed in a list
+   (= (format "%d" '(1,23)) "1")  
+   (= (format "%5.2f" '(10)) "10,00")  
+   (= (format "%c %s %d %g" '(65 "hello" 123 1,23)) "A hello 123 1,23")
+   (= (format "%5.2s" '("hello")) "   he")
+   (set 'data '((1 "a001" "g") (2 "a101" "c") (3 "c220" "g")))
+   (set 'result (map (fn (x) (format "%3.2f %5s %2s" (nth 0 x) (nth 1 x) (nth 2 x))) data))
+   (set 'result (map (fn (x) (format "%3.2f %5s %2s" (x 0) (x 1) (x 2))) data))
+   (= result '("1,00  a001  g" "2,00  a101  c" "3,00  c220  g"))
+   (not (catch (format "%%" 1) 'result))
+   (not (catch (format "%10.2lf" 123) 'result))
+
+   (if (and (> opsys 5) (< opsys 9) (!= opsys 7)) ;; Win32 
+      (begin
+        (and
+         (= (format "%I64d" 0x7fffffffffffffff) "9223372036854775807")
+         (= (format "%I64x" 0x7fffffffffffffff) "7fffffffffffffff")
+         (= (format "%I64u" 0x7fffffffffffffff) "9223372036854775807")
+         (= (format "%I64d" 0x8000000000000000) "-9223372036854775808")
+         (= (format "%I64x" 0x8000000000000000) "8000000000000000")
+         (= (format "%I64u" 0x8000000000000000) "9223372036854775808")
+         (= (format "%I64d" 0xFFFFFFFFFFFFFFFF) "-1")
+         (= (format "%I64x" 0xFFFFFFFFFFFFFFFF) "ffffffffffffffff")
+         (= (format "%I64u" 0xFFFFFFFFFFFFFFFF) "18446744073709551615"))
+      )
+      (begin ;; UNIX like OS 
+        (if (= opsys 9) ;TRU64
+          (begin
+            (and
+              (= (format "%d" 0x7fffffff) "2147483647")
+              (= (format "%d" 0xffffffff) "-1")
+              (= (format "%u" 0xffffffff) "4294967295")
+              (= (format "%i" 0x7fffffff) "2147483647")
+
+              ; truncate
+              (= (format "%d" 0x7fffffffffffffff) "-1")
+              (= (format "%u" 0x7fffffffffffffff) "4294967295")
+              (= (format "%x" 0x7fffffffffffffff) "ffffffff") 
+              (= (format "%X" 0x7fffffffffffffff) "FFFFFFFF") 
+
+              (= (format "%ld" 0x7fffffffffffffff) "9223372036854775807")
+              (= (format "%lu" 0xffffffffffffffff) "18446744073709551615")
+              (= (format "%li" 0x7fffffffffffffff) "9223372036854775807")
+              (= (format "%lx" 0x7fffffffffffffff) "7fffffffffffffff")
+              (= (format "%ld" 0x8000000000000000) "-9223372036854775808")
+              (= (format "%lx" 0x8000000000000000) "8000000000000000")
+              (= (format "%lu" 0x8000000000000000) "9223372036854775808")
+              (= (format "%ld" 0xFFFFFFFFFFFFFFFF) "-1")
+              (= (format "%lx" 0xFFFFFFFFFFFFFFFF) "ffffffffffffffff")
+              (= (format "%lu" 0xFFFFFFFFFFFFFFFF) "18446744073709551615"))
+          )
+          (begin
+            (and
+              (= (format "%d" 0x7fffffff) "2147483647")
+              (= (format "%d" 0xffffffff) "-1")
+              (= (format "%u" 0xffffffff) "4294967295")
+
+              ; truncate
+              (= (format "%d" 0x7fffffffffffffff) "-1")
+              (= (format "%u" 0x7fffffffffffffff) "4294967295")
+              (= (format "%x" 0x7fffffffffffffff) "ffffffff") 
+              (= (format "%X" 0x7fffffffffffffff) "FFFFFFFF") 
+
+              (= (format "%lld" 0x7fffffffffffffff) "9223372036854775807")
+              (= (format "%llx" 0x7fffffffffffffff) "7fffffffffffffff")
+              (= (format "%llu" 0x7fffffffffffffff) "9223372036854775807")
+              (= (format "%lld" 0x8000000000000000) "-9223372036854775808")
+              (= (format "%llx" 0x8000000000000000) "8000000000000000")
+              (= (format "%llu" 0x8000000000000000) "9223372036854775808")
+              (= (format "%lld" 0xFFFFFFFFFFFFFFFF) "-1")
+              (= (format "%llx" 0xFFFFFFFFFFFFFFFF) "ffffffffffffffff")
+              (= (format "%llu" 0xFFFFFFFFFFFFFFFF) "18446744073709551615"))
+          )
+      )
+))))
+
+(define (test-fv )
+  (< (sub (fv 0,1 10 1000 0 0) -15937,4246) 1e-05))
+
+(define (test-gammai )
+  (< (abs (sub (gammai 4 5) 0,734974)) 1e-05))
+
+(define (test-gammaln )
+  (< (abs (sub 120 (exp (gammaln 6)))) 1e-05))
+
+(define (test-gcd)
+ (and
+  (= (gcd 0) 0)
+  (= (gcd 1) 1)
+  (= (gcd 12 36) 12)
+  (= (gcd 12 36 6) 6)
+  (= (gcd 12 36 6 3) 3)
+))
+
+(define (test-get-char )
+  (= 65 (get-char (address "A"))))
+
+(define (test-get-float )
+  (= 1,234 (get-float (pack "lf" 1,234))))
+
+(define (test-get-int )
+  (and
+    (= 123456789 (get-int (pack "ld" 123456789)))
+    (set 'adr (pack "ldld" 0xaabbccdd 0xccddeeff))
+    (= (format "%x" (get-int adr)) "aabbccdd")
+    (= (format "%x" (get-int (address adr))) "aabbccdd")
+    (= (format "%x" (get-int (+ (address adr) 0))) "aabbccdd")
+    (= (format "%x" (get-int (+ (address adr) 4))) "ccddeeff")
+    (set 'adr (pack "> ldld" 0xaabbccdd 0xccddeeff))
+    (= adr "\170\187\204\221\204\221\238\255")
+    (set 'adr (pack "< ldld" 0xaabbccdd 0xccddeeff))
+    (= adr "\221\204\187\170\255\238\221\204")
+    (set 'buff (pack "lulululululululu" 1 2 3 4))
+    (apply and (map (fn (i) (= (+ i 1) (get-int (+ (* i 4) (address buff))))) '(0 1 2 3))) 
+))
+
+(define (test-get-long)
+	(set 'adr (pack "Ld" -1))
+	(= -1 (get-long adr)))
+
+(define (test-get-string )
+  (= "hello" (get-string (address "hello"))))
+
+(define (test-get-url )
+  (= "ERR: bad formed URL" (get-url "")))
+
+
+(define (test-global)
+	(= global-myvar 123))
+
+(define (test-global?)
+	(and
+		(global? 'global-myvar)
+		(global? 'println)
+))
+
+(define (test-if )
+  (and 
+   (if true true) 
+   (if nil nil true) 
+   (if 'nil nil true) 
+   (if '() nil true)
+   (= (if '()) '())
+   (= (if nil 1 '() 2) '())
+   (= (if nil '() '()) '())
+   (= (if true '() '()) '())
+   (= (if nil 1 nil 2 nil 3 true 4 3) 4)
+   (= (if nil 1 nil 2 nil 3 nil 4 3) 3)
+   ))
+
+(define (test-ifft )
+  (= '((1 2) (3 4)) (ifft (fft '((1 2) (3 4))))))
+
+(define (test-import )
+  (primitive? import))
+
+(define (test-inc , x)
+  (set 'x 1)
+  (and (= 2 (inc 'x)) (= 2,1 (inc 'x 0,1))))
+
+(define (test-index )
+  (= '(1 3) (index (lambda (x) (> x 3)) '(1 5 2 6 2 0))))
+
+(define (test-integer )
+  (and 
+    (integer? (int "12345"))
+    (= (int " 12345") 12345)
+    (= (int "9223372036854775807")  9223372036854775807)
+    (= (int "-9223372036854775808") -9223372036854775808)
+    (= (int 0.0) 0)
+    (= (int 1e30)  9223372036854775807)
+    (= (int -1e30) -9223372036854775808)
+    (= (int 0x8000000000000000) (int "0x8000000000000000"))
+))
+
+(define (test-int) (test-integer))
+
+(define (test-integer? )
+  (and
+    (integer? 12345)
+    (integer? 9223372036854775807)
+    (integer? -9223372036854775808)
+    (integer? 0x7FFFFFFFFFFFFFFF)
+    (integer? 0xFFFFFFFFFFFFFFFF)
+))
+
+(define (test-intersect )
+  (= (intersect '(3 0 2 4 1) '(1 4 2 5)) '(2 4 1)))
+
+(define (test-invert )
+  (set 'A '((-1 1 1) (1 4 -5) (1 -2 0)))
+  (set 'I (multiply A (invert A)))
+  (set 'J (multiply (array 3 3 (flat A)) (invert (array 3 3 (flat A)))))
+  (and (< (sub 1 (nth 0 (nth 0 I))) 1e-06)
+       (< (sub 1 (nth 1 (nth 1 I))) 1e-06) 
+       (< (sub 1 (nth 2 (nth 2 I))) 1e-06)
+       (= I (array-list J)) 
+       (not (invert '((0 1 0) (1 0 1) (0 0 0))) )
+))
+
+(define (test-irr )
+  (< (abs (sub (irr '(-1000 500 400 300 200 100)) 0,20272)) 0,0001))
+
+(define (test-join )
+  (and 
+    (= "this is a sentence" (join '("this" "is" "a" "sentence") " ")) 
+    (= "this_is_a_sentence" (join '("this_" "is_" "a_" "sentence")))
+    (= "" (join '()))
+	(= (join '("A" "B" "C") "-") "A-B-C")
+	(= (join '("A" "B" "C") "-" true) "A-B-C-")
+))
+
+(define (test-lambda? )
+  (lambda? qa))
+
+(define (test-last )
+  (= 'f (last '(a b c d e f)))
+  (= "p" (last "newlisp"))
+  (= (array 2 '(5 6)) (last (array 3 2 (sequence 1 6))))
+)
+
+(define (test-legal?)
+  (and
+    (legal? "abc")
+    (not (legal? "a b c"))
+    (set 'greek (pack "cccccccccccccccccc" 206 160 206 181 206 187 206 181 206 185 206
+				172 206 180 206 181 207 137))
+    (legal? greek)
+))
+
+(define (test-length )
+  (> (length (symbols)) 100)
+  (- 7 (length "newlisp")))
+
+(define (test-let )
+  (set 'a 123)
+  (set 'b 456)
+  (set 'p 111)
+  (set 'q 222)
+  (and
+     (let ((a 1) (b 2)) 
+       (= (+ a b) 3))
+     (= a 123) 
+     (= b 456)
+     (let (p 3 q 4)
+       (= (+ q p) 7))
+     (= p 111)
+     (= q 222)
+))
+
+(define (test-letex)
+  (and
+	(= (letex (x '* y 3 z 4) (x y z)) 12)
+	(= (letex (x 1 y 2 z 3) (quote (x y z))) '(1 2 3))
+	(= (letex (x 1 y 2 z 3) '(x y z)) '(1 2 3))
+	(= (letex (x 1 y 2 z 3) '('x (quote y) z)) '('1 (quote 2) 3))
+	(= (letex (x 1) 'x) 1)
+	))
+
+(define (test-letn)
+  (set 'x 0 'y 0 'z 0)
+  (and
+      (= (letn ((x 1) (y (+ x 1)) (z (+ y 1))) (list x y z)) '(1 2 3))
+      (= 0 x y z))
+)
+
+(define (test-list )
+  (and (list? (list 1 2 3 4 5)) (= '(1) (list 1)) (= '(1 nil) (list 
+     1 'nil))))
+
+(define (test-list? )
+  (and (list? '(1 2 3 4 5)) (list? '())))
+
+(define (test-load )
+  (write-file "junk" "(+ 3 4)")
+  (load "junk"))
+
+(define (test-local)
+	(set 'a 10 'b 20)
+	(and 
+		(= (local (a b) (set 'a 1 'b 2) (+ a b)) 3)
+		(= a 10)
+		(= b 20)))
+
+(define (test-set-locale) 
+  (string? (set-locale)))
+
+(define (test-log )
+  (and
+  	(= 1 (log (exp 1)))
+	(= 1 (log (exp 1) (exp 1)))
+  )
+)
+
+(define (test-lookup )
+  (and (= 3 (lookup 1 '((2 3 4) (1 2 3)))) (= 2 (lookup 1 '((2 3 
+       4) 
+      (1 2 3)) 1))))
+
+(define (test-lower-case )
+  (if (> opsys 4) 
+   (= "abcdefgq" (lower-case "ABCDEFGQ")) 
+   (= "abcdefgh" (lower-case "ABCDEFGH"))))
+
+(define (test-macro? )
+  (macro? 
+   (define-macro (foo-macro))))
+
+(define (test-main-args )
+  (and 
+     (list? (main-args))
+     (list? $main-args)
+     (= $main-args (main-args))
+     (= ($main-args 0) ((main-args) 0) (main-args 0))
+     (= ($main-args -1) ((main-args) -1))
+     (= ($main-args -1) (main-args -1))
+))
+
+
+(define (test-make-dir )
+  (and (make-dir "foodir") (remove-dir "foodir")))
+
+(define (test-map )
+  (and (= '(11 22 33) (map + '(10 20 30) '(1 2 3))) 
+       (= '(2 4 6) (map (lambda (x) (+ x x)) '(1 2 3)))
+))
+
+(define (test-mat)
+	(set 'A '((1 2 3) (4 5 6))) 
+	(set 'B A)
+	(and
+		(= (mat + A B) '((2 4 6) (8 10 12)))
+		(= (mat - A B) '((0 0 0) (0 0 0)))
+		(= (mat * A B) '((1 4 9) (16 25 36)))
+		(= (mat / A B) '((1 1 1) (1 1 1)))
+		(= (mat + A 2) '((3 4 5) (6 7 8)))
+		(= (mat - A 2) '((-1 0 1) (2 3 4)))
+		(= (mat * A 2) '((2 4 6) (8 10 12)))
+		(= (mat / A 2) '((0,5 1 1,5) (2 2,5 3)))
+
+		(= (mat + A 5) '((6 7 8) (9 10 11)))
+		(= (mat - A 2) '((-1 0 1) (2 3 4)))
+		(= (mat * A 3) '((3 6 9) (12 15 18)))
+		(= (mat / A 10) '((,1 ,2 ,3) (,4 ,5 ,6)))
+
+        (set 'op +)
+		(= (mat op A B) '((2 4 6) (8 10 12)))
+        (set 'op '+)
+		(= (mat op A B) '((2 4 6) (8 10 12)))
+	))
+
+
+(define (test-match)
+  (and 
+    (= (match '(a (b ?) d e *) '(a (b c) d e f g) true)   '(a (b c) d e (f g)) )
+    (= (match '(a (b ?) d e *) '(a (b c) d e f g) )  '(c (f g)) )
+
+    (= (match '(a * b x) '(a b c d b x e f b x) true) '(a (b c d b x e f) b x) )
+    (= (match '(a * b x) '(a b c d b x e f b x) ) '((b c d b x e f)) )
+
+
+    (= (match '(? (?) x * ? (? e)) '(a (b) x y c (d e)) true) '(a (b) x (y) c (d e)) )
+    (= (match '(? (?) x * ? (? e)) '(a (b) x y c (d e))) '(a b (y) c d) )
+
+    (= (match '(a * b) '(a x b) true) '(a (x) b) )
+    (= (match '(a * b) '(a x b)) '((x)) )
+
+
+    (= (match '(a * b) '(a b) true) '(a () b) )
+    (= (match '(a * b) '(a b)) '(()) )
+
+    (= (match '( (? ?) * ) '( (x y) ) true) '((x y) ()) )
+    (= (match '( (? ?) * ) '( (x y) )) '(x y ()) )
+    (match '(+) '(a))
+    (match '(+) '(a b))
+    (not (match '(+) '()))
+  ))
+
+
+(define (test-max )
+  (and (= 10 (max 3 6 10 8)) (= 1,2 (max 0,7 0,6 1,2))))
+
+(define (test-member )
+  (= '(3 4) (member 3 '(1 2 3 4)))
+  (= (member "LISP" "newLISP") "LISP")
+  (= (member "LI" "newLISP") "LISP")
+  (= (member "" "newLISP") "newLISP")
+  (not (member "xyz" "newLISP"))
+  (not (member "new" "this is NEWLISP" 0))
+  (= (member "new" "this is NEWLISP" 1) "NEWLISP")
+)
+
+(define (test-min )
+  (and (= 3 (min 3 6 10 8)) (= 0,6 (min 0,7 0,6 1,2))))
+
+(define (test-mod )
+  (and (< (sub (mod 10,5 3,3) 0,6) 0,0001) (< (sub (mod 10 3) 1) 0,0001)))
+
+(define (test-mul )
+  (= 1e-09 (mul 0,0001 1e-05)))
+
+(define (test-multiply )
+  (let ((A '((1 2 3) (4 5 6))) (B '((1 2) (1 2) (1 2)))) 
+    (and 
+       (= '((6 12) (15 30)) (multiply A B))
+       (= (array 2 2 (flat '((6 12) (15 30))))
+          (multiply (array 2 3 (flat A)) (array 3 2 (flat  B))))
+    )
+))
+
+(define (test-name )
+  (= "name" (name 'name)))
+
+(define (test-net-accept )
+  (and
+	(set 'net-listen-test (set 'listen (net-listen 12345)))
+	(set 'net-connect-test (set 'connect (net-connect "localhost" 12345)))
+	(set 'server (net-accept listen))
+	(set 'net-send-test (= (net-send server "hello") 5))
+	(set 'net-select-test (net-select connect "r" 100000))
+	(set 'net-peek-test (= (net-peek connect) 5))
+	(set 'net-receive-test (net-receive connect 'buff 20))
+	(= buff "hello")
+	(set 'net-sessions-test (and  
+	  (find listen (net-sessions))
+	  (find connect (net-sessions))
+	  (find server (net-sessions))))
+	(set 'net-local-test (= (net-local server) (net-peer connect)))
+	(set 'net-peer-test (= (net-local connect) (net-peer server)))
+	(set 'net-close-test (net-close connect))
+	(set 'net-close-test (net-close server))
+	(set 'net-close-test (net-close listen))
+	(not (net-error))
+))
+
+(define (test-net-close ) net-close-test)
+
+(define (test-net-connect )  net-connect-test)
+
+(define (test-net-error ) 
+	(and
+		(not (net-close 12345))
+		(list? (net-error))))
+
+(define (test-net-eval) true) ;; see special test prog
+
+(define (test-net-listen ) net-listen-test)
+
+(define (test-net-local ) net-local-test)
+
+(define (test-net-lookup )
+	(and
+		(or (= "127.0.0.1" (net-lookup "localhost")) (= "::1" (net-lookup "localhost")))
+		(or (= "localhost" (net-lookup "127.0.0.1")) (= "localhost" (net-lookup "::1")))
+	)
+)
+
+(define (test-net-peek ) net-peek-test)
+
+(define (test-net-peer ) net-peer-test)
+
+(define (test-net-ping) true) ; test manually on UNIX as root
+
+(define (test-net-receive ) net-receive-test)
+
+(define (test-net-receive-from)
+  (and
+    (set 'sock (net-listen 1234 "localhost" "udp"))
+    (set 'net-send-to-test (net-send-to "localhost" 1234 "hello" sock))
+    (set 'net-select-test (net-select sock "r" 1000000) )
+    (= "hello" (first (net-receive-from sock 10)))
+    (net-close sock)))
+
+
+(define (test-net-receive-udp)
+    (write-file "udptest.lsp"
+[text]
+(map set '(in out sid) (map int (slice (main-args) 2)))
+(semaphore sid 1) ; signal parent to start
+(set 'msg (net-receive-udp in 20 2000000))
+(sleep 100)
+(if (not msg) (exit))
+(net-send-udp "localhost" out (upper-case (first msg)))
+(exit)
+[/text]
+    )
+  (and
+    (set 'sid (semaphore))
+    (if (> opsys 5)
+      (process (string "newlisp udptest.lsp " 10001 " " 10002 " " sid))
+      (process (string "./newlisp udptest.lsp " 10001 " " 10002 " " sid)))
+    (println "---------- testing UDP Win32 and OS/2 -------------")
+    (println "waiting ...");
+    (semaphore sid -1) ; wait for child process
+    (sleep 100)
+    (println "sending ...")
+    (net-send-udp "localhost" 10001 "hello") 
+    (println "receiving ...")
+    (set 'msg (net-receive-udp 10002 20 3000000))
+    (println "msg:" msg)
+    (or (delete-file "udptest.lsp") true)
+    (println "deleting semaphore:" (semaphore sid 0)) ; delete semaphore
+    (println "------------------------------------------")
+    (if msg (set 'net-send-udp-test (= "HELLO" (first msg)) ) )))
+
+
+(if (< opsys 6)
+  (define (test-net-receive-udp)
+    (fork (begin (sleep 500) (net-send-udp "localhost" 10001 "hello")))
+    (set 'net-send-udp-test (= "hello" (first (net-receive-udp 10001 10)))))
+)
+
+
+(define (test-net-select )  net-select-test)
+
+(define (test-net-send ) net-send-test)
+
+(define (test-net-send-to ) net-send-to-test)
+
+(define (test-net-send-udp ) net-send-udp-test)
+
+(define (test-net-service ) (= 21 (net-service "ftp" "tcp")))
+
+(define (test-net-sessions ) net-sessions-test)
+
+(define (test-new) 
+  (new QA 'MAIN:QA2))
+
+(define (test-nil?)
+  (and
+    ;test symbol-nil = logic-nil in order compare of count
+	(= (count '(nil true) (map (curry < 3) '(1 2 4 5))) '(2 2))
+    (= nil (not (nil? nil)))
+    (= '(nil true) (map nil? '(a nil)))))
+
+(define (test-null?)
+	(= (map null? '(1 0 2 0,0 "hello" "" (a b c) () nil true))
+	'(nil true nil true nil true nil true true nil)))
+
+(define (test-normal )
+  (and (float? (normal)) (float? (normal 10 3)) (list? (normal 10 
+     3 100))))
+
+(define (test-not )
+  (and (not (not (not '()))) (not (not (not (not (not nil))))) (not 
+    (not (not (not true)))) 
+   (= '(true true true) (map not '(nil nil nil))) 
+   (= '(nil nil nil) (map not '(true true true)))))
+
+(define (test-now )
+  (= (length (now)) 11))
+
+(define (test-nper )
+  (< (sub (nper 0,1 1000 100000 0 0) -25,15885793) 1e-08))
+
+(define (test-npv )
+  (< (sub (npv 0,1 '(-10000 3000 4200 6800)) 1188,443412) 1e-06))
+
+(define (test-nth , l) ;; see set-nth for more comprehensive testing
+	(set 'l '(0 1 2))
+	(and (= 0 (nth 0 l))
+		(= 1 (nth 1 l))
+		(= 2 (nth 2 l))
+		(= 2 (nth -1 l))
+		(= (nth 0 "lisp") "l")
+		(= (nth 1 "lisp") "i")
+		(= (nth 3 "lisp") "p")
+		(= (nth -4 "lisp") "l")
+		(= (nth 0 "") "")
+		(= (nth 1 "") "")
+		(= (nth -1 "") "")
+
+		(set 'l '(a b (c d) (e f)))
+		(= 'a (l 0))
+		(= '(c d) (l 2))
+		(= 'c (l 2 0))
+		(= 'f (l -1 -1))
+		(= 'c (l '(2 0)))
+		(= 'f (l '(-1 -1)))
+
+		(set 'myarray (array 3 2 (sequence 1 6)))
+		(= (array 2 '(3 4)) (myarray 1))
+		(= 6 (myarray -1 -1))
+
+		(= (array 2 '(3 4)) (myarray '(1)))
+		(= 6 (myarray '(-1 -1)))
+
+		(= "L" ("newLISP" 3))
+
+		(constant 'constL '((1 2 3) (a b c)))
+		(set 'aref '(1 2))
+		(= (constL 1 2) 'c)
+		(= (nth 1 2 constL) 'c)
+		(= (nth (constL 1 2)) 'c)
+		(= (nth (constL (- 2 1) (+ 1 1))) 'c)
+		(= (nth (constL '(1 2))) 'c)
+		(= (nth (constL aref)) 'c)
+		(= (nth 0 (+ 1 1) constL) 3)
+
+  ))
+
+
+(define (test-number?)
+    (and
+        (number? 1)
+        (number? 1,23)
+        (not (number? 'x))
+        (not (number? "abc"))
+        (not (number? '(a b c)))
+    )
+)
+
+
+(define (test-open )
+  (and 
+    (set 'fle (open "qa-comma" "read"))
+    (close fle)))
+
+(define (test-or )
+  (and (or (or (= 1 2) nil nil) (or nil nil nil true)) (not (or nil 
+     (= "a" "b") nil))))
+
+
+(define (test-pack )
+ (and
+  (= (pack "c c c" 65 66 67) "ABC")
+  (= (unpack "c c c" "ABC") '(65 66 67))
+  (set 's (pack "c d u" 10 12345 56789))
+  (= (unpack "c d u" s) '(10 12345 56789))
+  (set 's (pack "s10 f" "result" 1,23))
+  (= (first (unpack "s10 f" s)) "result\000\000\000\000")
+  (< (- (last (unpack "s10 f" s)) 1,23) 0,00001)
+  (set 's (pack "s3 lf" "result" 1,23))
+  (= (first (unpack "s3 f" s)) "res")
+
+  (= (pack "ccc" 65 66 67) "ABC")
+  (= (unpack "ccc" "ABC") '(65 66 67))
+  (set 's (pack "cdu" 10 12345 56789))
+  (= (unpack "cdu" s) '(10 12345 56789))
+  (set 's (pack "s10f" "result" 1,23))
+  (= (first (unpack "s10f" s)) "result\000\000\000\000")
+  (< (- (last (unpack "s10f" s)) 1,23) 0,00001)
+  (set 's (pack "s3lf" "result" 1,23))
+  (= (first (unpack "s3f" s)) "res")
+
+  (= "\001\000" (pack "<d" 1))
+  (= "\000\001" (pack ">d" 1))
+  (= "\001\000\000\000" (pack "<ld" 1))
+  (= "\000\000\000\001" (pack ">ld" 1))
+  (= '(12345678) (unpack "ld" (pack "ld" 12345678)))
+  (= '(12345678) (unpack "<ld" (pack "<ld" 12345678)))
+  (= '(12345678) (unpack ">ld" (pack ">ld" 12345678)))
+  (= (unpack "bbbbbbbb" (pack "<lf" 1,234)) '(88 57 180 200 118 190 243 63))
+  (= (unpack "bbbbbbbb" (pack ">lf" 1,234)) '(63 243 190 118 200 180 57 88))
+  (= (format "%20.2f" (first (unpack "lf" (pack "lf" 1234567890123456)))) " 1234567890123456,00")
+))
+
+(define (test-parse )
+  (and 
+    (= 3 (length (parse "hello hi there"))) 
+    (= (parse "abcbdbe" "b") '("a" "c" "d" "e")) 
+    (= (parse "," ",") '("" ""))  
+    (= (parse "hello regular   expression 1, 2, 3" {,\s*|\s+} 0)
+       '("hello" "regular" "expression" "1" "2" "3"))))
+
+(define (test-parse-date)
+	(and
+		(= (parse-date "2007.1.3" "%Y.%m.%d") 1167782400)
+; note that the month name here is in German
+		(= (parse-date "Januar 10, 07" "%B %d, %y") 1168387200)
+))
+
+(define (test-peek)
+	(set 'fle (open "qa-comma" "r"))
+	(= (peek fle) (first (file-info "qa-comma")))
+	(close fle))
+
+(define (test-pipe)
+	(write-file "pipe-child.lsp" 
+[text]
+(set 'msg (read-line (int (nth 2 (main-args)))))
+(write-line (upper-case msg) (int (nth 3 (main-args))))
+(exit)
+[/text]
+	)
+	(set 'channel (pipe))
+	(set 'in (first channel))
+	(set 'out (last channel))
+	(if (and (> opsys 5) (< opsys 9))
+		(process (string "newlisp pipe-child.lsp " in " " out))
+		(process (string "./newlisp pipe-child.lsp " in " " out)))
+	(sleep 500)
+	(write-line "hello there" out)
+	(sleep 500)
+	(= (read-line in) "HELLO THERE")
+	(delete-file "pipe-child.lsp"))
+
+(if (< opsys 6)
+  (define (test-pipe)
+	(set 'channel (pipe))
+	(set 'in (first channel))
+	(set 'out (last channel))
+	(fork (write-line (upper-case (read-line in)) out))
+	(write-line "hello there" out)
+	(sleep 1000)
+	(= (read-line in) "HELLO THERE")
+	)
+)
+
+
+(define (test-pmt ) 
+  (< (sub (pmt 0,1 10 100000 0 0) -16274,53949) 1e-05))
+
+(define (test-pop , r l)
+  (set 'r '())
+  (set 'l '(1 2 3 4 5 6 7 8 9 0))
+  (dotimes (x 10) 
+   (push (pop l) r))
+  (and (= r '(0 9 8 7 6 5 4 3 2 1))
+       (set 'l '(a b (c d (x) e)))
+       (= 'x (pop l '(2 2 0)))
+       (set 'lst '(1 2 3 (4 5)()))
+       (push 'x lst -1 -1)
+       (= lst '(1 2 3 (4 5) (x)))
+       (push 'y lst -1 0)
+       (= lst '(1 2 3 (4 5) (y x)))
+       (push 'z lst -1 1)
+       (= lst '(1 2 3 (4 5) (y z x)))
+       (push 'p lst 4)
+       (= lst '(1 2 3 (4 5) p (y z x)))
+       (push 'q lst -2)
+       (= lst '(1 2 3 (4 5) p q (y z x)))
+       (push 'a lst 3 -3)
+       (= lst '(1 2 3 (a 4 5) p q (y z x)))
+       (= (pop lst 3 -3) 'a)
+       (= (pop lst -2) 'q)
+       (= (pop lst 4) 'p)
+       (= (pop lst -1 1) 'z)
+       (= (pop lst -1 0) 'y)
+       (= (pop lst -1 -1) 'x)
+       (= lst '(1 2 3 (4 5)()))
+       ; test pop string
+       (set 's "newLISP")
+       (= (pop s) "n")
+       (= s "ewLISP")
+       (= (pop s 2) "L")
+       (= s "ewISP")
+       (= (pop s -1) "P")
+       (= s "ewIS")
+       (= (pop s -2 2) "IS")
+       (= s "ew")
+       (= (pop s -2 10) "ew")
+       (= s "")
+       (set 's "123456789")
+       (= (pop s 5) "6")
+       (= (pop s 5 -1) "")
+       (= s "12345789")
+       (set 's "123456789")
+       (= (pop s 5 5) "6789")
+       (set 's "x")
+       (= (pop s) "x")
+       (= s "")
+       (= (pop s) "")
+       (= (pop s) "")	
+       (= s "")
+))
+
+(define (test-pop-assoc)
+	(and
+		(set 'L '((a (b 1) (c (d 2)))))
+		(= (pop-assoc (L 'a)) '(a (b 1) (c (d 2))))
+		(= L '())
+		(set 'L '((a (b 1) (c (d 2)))))
+		( = (pop-assoc (L 'a 'b)) '(b 1))
+		(= L '((a (c (d 2)))))
+		(set 'L '((a (b 1) (c (d 2)))))
+		(= (pop-assoc (L 'a 'c)) '(c (d 2)))
+		(= L '((a (b 1))))
+		(set 'L '((a (b 1) (c (d 2)))))
+		(= (pop-assoc (L 'a 'c 'd)) '(d 2))
+		(= L '((a (b 1) (c))))
+		(= (pop-assoc (L 'a 'c)) '(c))
+		(= L '((a (b 1))))
+		(= (pop-assoc (L 'a 'b)) '(b 1))
+		(= L '((a)))
+		(= (pop-assoc (L 'a)) '(a))
+		(= L '())
+	)
+)
+
+
+(define (test-post-url )
+  (= "ERR: bad formed URL" (post-url "" "abc" "def")))
+
+(define (test-pow )
+  (and
+    (= 1024 (pow 2 10))
+    (= 100 (pow 10))
+))
+
+(define (test-pretty-print)
+  (= (pretty-print) '(80 " ")))
+
+(define (test-primitive? )
+  (primitive? primitive?))
+
+(define (test-print ) 
+  (device (open "testprint" "w"))
+  (print "hello")
+  (close (device))
+  (and (= "hello" (read-file "testprint"))
+     (delete-file "testprint")))
+
+(define (test-println ) 
+  (device (open "testprintln" "w"))
+  (print "hello")
+  (close (device))
+  (and 
+     (= "hello" (slice (read-file "testprintln") 0 5))
+     (delete-file "testprintln")))
+
+(define (test-prob-chi2 )
+  (< (abs (sub (prob-chi2 10 10) 0,440493)) 1e-05))
+
+(define (test-prob-z )
+  (< (abs (sub (prob-z 0) 0,5)) 1e-05))
+
+(define (test-process ) 
+   (write-file "processtest" {(write-file "testprocess" "hello") (exit)})
+   (if (> opsys 5) (process "newlisp processtest") (process "./newlisp processtest"))
+   (until (file? "testprocess") (sleep 500))
+   (and
+     (= "hello" (read-file "testprocess"))
+     (delete-file "processtest")
+     (delete-file "testprocess")))
+
+(define (test-protected?)
+	(and
+		(protected? 'println)
+		(constant 'cval 123)
+		(protected? 'cval)
+		(protected? 'QA))
+)
+
+(define (test-push , l)
+  (dotimes (x 10) 
+   (push x l x))
+  (and 
+       (= l '(0 1 2 3 4 5 6 7 8 9))
+       (set 'l '(a b (c d () e)))
+       (push 'x l '(2 2 0))
+       (= (ref 'x l) '(2 2 0))
+       (set 'lst '(1 2 3 (4 5)()))
+       (push 'x lst -1 -1)
+       (= lst '(1 2 3 (4 5) (x)))
+       (push 'y lst -1 0)
+       (= lst '(1 2 3 (4 5) (y x)))
+       (push 'z lst -1 1)
+       (= lst '(1 2 3 (4 5) (y z x)))
+       (push 'p lst 4)
+       (= lst '(1 2 3 (4 5) p (y z x)))
+       (push 'q lst -2)
+       (= lst '(1 2 3 (4 5) p q (y z x)))
+       (push 'a lst 3 -3)
+       (= lst '(1 2 3 (a 4 5) p q (y z x)))
+       (= (pop lst 3 -3) 'a)
+       (= (pop lst -2) 'q)
+       (= (pop lst 4) 'p)
+       (= (pop lst -1 1) 'z)
+       (= (pop lst -1 0) 'y)
+       (= (pop lst -1 -1) 'x)
+       (= lst '(1 2 3 (4 5)()))
+       (test-push-pop)
+       (test-push-optimization-bug)
+       ; test string push
+       (set 's "newLISP")
+       (= (push "#" s) "#")
+       (= s "#newLISP")
+       (= (push "#" s 1) "#")
+       (= s "##newLISP")
+       (= (push "#" s 3) "#")
+       (= s "##n#ewLISP")
+       (= (push "#" s -1) "#")
+       (= s "##n#ewLISP#")
+       (= (push "#" s -3) "#")
+       (= s "##n#ewLIS#P#")
+       (= (push "xy" s) "xy")
+       (= s "xy##n#ewLIS#P#")
+       (= (push "xy" s -1) "xy")
+       (= s "xy##n#ewLIS#P#xy")
+       (set 's "")
+       (= (push "" s) "")
+       (= s "")
+       (set 's "newLISP")
+       (= (push "" s -1) "")
+       (= (push "" s) "")
+       (= s "newLISP")
+       (push "-" s 7)
+	   (= s "newLISP-")
+	   (push "-" s -9)
+	   (= s "-newLISP-")
+       (set 's "newLISP")
+       (push "-" s 8)
+	   (= s "newLISP-")
+	   (push "-" s -10)
+	   (= s "-newLISP-")
+))
+
+(define (test-push-pop)
+	(set 'lst (sequence 1 1000))
+	(dotimes (x 1000) (push (pop lst) lst -1))
+	(= lst (sequence 1 1000)))
+
+(define (test-push-optimization-bug) ; fixed in 8.7.1
+    (set 'l nil)
+    (and (push 'x l -1)
+         (set 'lst l)
+         (push 'y lst -1)
+         (= lst '(x y))))
+
+
+(define (test-put-url ) 
+  (= "ERR: bad formed URL" (put-url "" "abc")))
+
+(define (test-pv )
+  (< (sub (pv 0,1 10 1000 100000 0 0) -44696,89605) 1e-05))
+
+(define (test-quote )
+  (= (quote x) 'x))
+
+(define (test-quote? )
+  (quote? ''quote?))
+
+(define (test-rand , sum)
+  (set 'sum 0)
+  (dotimes (x 1000) 
+   (inc 'sum (rand 2)))
+  (and (< sum 600) (> sum 400) (list? (rand 10 100))))
+
+(define (test-random )
+  (and (float? (random)) (= (length (random 0 1 10)) 10)))
+
+(define (test-randomize)
+  (and
+    (!= '(a b c d e f g) (randomize '(a b c d e f g)))
+    (= (difference '(a b c d e f g) (randomize '(a b c d e f g))) '())
+  )
+)
+
+(define (test-read-expr)
+    (set 'code "; a statement\n(+ 3 4)\n(define (double x) (+ x x))")
+    (read-expr code (fn (x) (push x clist)) (context))
+    (= clist '((define (double x) (+ x x)) (+ 3 4)))
+)
+
+(define (test-read-buffer )
+  (and
+    (set 'file (open "qa-comma" "read"))
+    (read-buffer file 'buff (nth 0 (file-info "qa-comma")))
+    (close file)
+    (set 'file (open "junk" "write"))
+    (write-buffer file 'buff (nth 0 (file-info "qa-comma")))
+    (close file)))
+
+(define (test-read-char )
+  (and 
+    (file-copy "qa-comma" "junk")
+    (delete-file "junk")))
+
+(define (test-read-file )
+  (read-file "qa-comma"))
+
+(define (test-read-key) true)
+
+(define (test-read-line )
+  (line-count "qa-comma"))
+
+
+(define (test-real-path) 
+  (and
+	(string? (real-path))
+    (string? (real-path "."))
+ ))
+
+
+(define (test-ref)
+  (and
+    (set 'pList '(a b (c d () e)))
+    (push 'x pList 2 2 0)
+    (= (ref 'x pList) '(2 2 0))
+    (= (ref '(x) pList) '(2 2))
+    (set 'v (ref '(x) pList))
+    (= (pList v) '(x))
+    (= (ref 'foo pList) '())
+    ; comparison functor
+    (= (ref 'e '(a b (c d (e) f)) =) '(2 2 0))
+    (= (ref 'e '(a b (c d (e) f)) >) '(0))
+    (= (ref 'e '(a b (c d (e) f)) <) '(2))
+    (= (ref 'e '(a b (c d (e) f)) (fn (x y) (or (= x y) (= y 'd)))) '(2 1))
+    (define (is-it-or-d x y) (or (= x y) (= y 'd)))
+    (= (ref 'e '(a b (c d (e) f)) is-it-or-d) '(2 1))
+    ; comparison with match and unify
+    (= (ref '(a ?) '((l 3) (a 12) (k 5) (a 10) (z 22)) match) '(1))
+    (= (ref '(X X) '( ((a b) (c d)) ((e e) (f g)) ) unify) '(1 0))
+    (= (ref '(X g) '( ((a b) (c d)) ((e e) (f g)) ) unify) '(1 1))
+))
+
+(define (test-ref-all)
+  (and
+    (set 'L '(a b c (d a f (a h a)) (k a (m n a) (x))))
+    (= (ref-all 'a L) '((0) (3 1) (3 3 0) (3 3 2) (4 1) (4 2 2)))
+    (= (L '(3 1)) 'a)
+    (= (map 'L (ref-all 'a L)) '(a a a a a a))
+    (= (ref-all 'a '(1 2 3 4 5 6)) '())
+    ; with comparison functor
+    (set 'L '(a b c (d f (h l a)) (k a (m n) (x))))
+    (= (ref-all 'c L =) '((2)))
+    (= (ref-all 'c L >) '((0) (1) (3 2 2) (4 1)))
+    (= (ref-all 'a L (fn (x y) (or (= x y) (= y 'k)))) ' ((0) (3 2 2) (4 0) (4 1)))
+    (define (is-long? x y) (> (length y) 2))
+    (= (ref-all nil L is-long?) '((3) (3 2) (4)))
+    (define (is-it-or-d x y) (or (= x y) (= y 'd)))
+    (= (ref-all 'e '(a b (c d (e) f)) is-it-or-d) '((2 1) (2 2 0)))
+    (= (ref-all 'b '(a b (c d (e) f)) is-it-or-d) '((1) (2 1)))
+    (= (ref-all nil '(((()))) (fn (x y) (> (length y) 0))) '((0) (0 0)))
+    ; test comparison with match and unify
+    (= (ref-all '(a ?) '((l 3) (a 12) (k 5) (a 10) (z 22)) match) '((1) (3)))
+    (= (ref-all '(X X) '( ((a b) (c d)) ((e e) (f g)) ((z) (z))) unify) '((1 0) (2)))
+    (= (ref-all '(X g) '( ((x y z) g) ((a b) (c d)) ((e e) (f g))) unify) '((0) (2 1)))
+))
+
+
+(define (test-regex )
+  (and
+   (= (regex "http://(.*):(.*)" "http://nuevatec.com:80")
+      '("http://nuevatec.com:80" 0 22 "nuevatec.com" 7 12 "80" 20 2))
+   (= $0 "http://nuevatec.com:80")
+   (= $1 "nuevatec.com")
+   (= $2 "80")
+   (= (regex "b+" "AAAABBBAAAA" 1) '("BBB" 4 3))))
+ 
+(define (test-remove-dir )
+  (and (make-dir "junk") (remove-dir "junk")))
+
+(define (test-rename-file )
+  (copy-file "qa-comma" "junk")
+  (rename-file "junk" "junk2"))
+
+;; this can run only once than must be reloaded
+;; because some replace's are in place with a constant
+(define (test-replace )
+ (and
+  (not (catch (replace "a" "akakak") 'result))
+  (not (catch (replace "a") 'result))
+  (not (catch (replace) 'result))
+  (catch (replace "a" '("x" "a" "y")) 'result)
+  (= (replace "a" "ababab" "b") "bbbbbb")
+  (= $0 3)
+  (= (replace 'a '(a a b a b a a a b a) 'b) '(b b b b b b b b b b))
+  (= (replace 'a '(a a b a b a a a b a)) '(b b b))
+  (= (replace 'a '(a)) '())
+;; with regular expressions option
+  (= (replace "" "abc" "x" 0) "xaxbxcx")
+  (= (replace "$" "abc" "x" 0) "abcx")
+  (= (replace "^" "abc" "x" 0) "xabc")
+  (= (replace "\\b" "abc" "x" 0) "xabcx")
+  (= (replace "(?<=[0-9])(?=(?:[0-9]{3})+(?![0-9]))" "1234567" "," 0) "1,234,567")
+  (= (replace "a" "ababab" (upper-case $0) 0) "AbAbAb")
+  (= $0 3)
+  (set 'str2 "abaBab")
+  (= (replace "b|B" str2 "z" 0) "azazaz")
+  (= $0 3)
+  (replace-once "aaa")
+  (= (replace "%([0-9A-F][0-9A-F])" "%41123%42456%43" (char (int (append "0x" $1))) 1) "A123B456C")
+  ; replace with comparison functor
+  (set 'L '(1 4 22 5 6 89 2 3 24))
+  (= (replace 10 L 10 <) '(1 4 10 5 6 10 2 3 10))
+  (set 'L '(1 4 22 5 6 89 2 3 24))
+  (= (replace 10 L 10 (fn (x y) (< x y))) '(1 4 10 5 6 10 2 3 10))
+  ;
+  (set 'AL '((john 5 6 4) (mary 3 4 7) (bob 4 2 7 9) (jane 3)))
+  (= (replace '(mary *)  AL (list 'mary (apply + (rest $0))) match)
+    '((john 5 6 4) (mary 14) (bob 4 2 7 9) (jane 3)))
+  (set 'AL '((john 5 6 4) (mary 3 4 7) (bob 4 2 7 9) (jane 3)))
+  (= (replace '(*) AL (list ($0 0) (apply + (rest $0))) match)
+    '((john 15) (mary 14) (bob 22) (jane 3)))
+  (set 'AL '((john 5 6 4) ("mary" 3 4 7) (bob 4 2 7 9) ("jane" 3)))
+  (= (replace nil AL (cons (sym ($0 0)) (rest $0)) (fn (x y) (string? (y 0))))
+    '((john 5 6 4) (mary 3 4 7) (bob 4 2 7 9) (jane 3)))
+))
+ 
+(define (replace-once str)
+  (= (replace "a" str (upper-case $0) 0x8000) "Aaa") ;; custom option replace once
+)
+
+(define (test-replace-assoc )
+  (set 'aList '((a 1 2 3) (b 4 5 6) (c 7 8 9)))
+  (set 'bList '((a 1) (b 2) (c 3)))
+  (replace-assoc 'b aList '(b 4 5 99))
+  (replace-assoc 'c aList '(x "this works too"))
+  (and
+    (= aList '((a 1 2 3) (b 4 5 99) (x "this works too")))
+    (set 'lst '((a 1)(b 2)(c 3)))
+    (= (replace-assoc 'b lst (list 'b (+ 1 (last $0))))
+       '((a 1)(b 3)(c 3)))
+    (= (replace-assoc 'b bList) '((a 1) (c 3)))
+    (= (replace-assoc 'a bList) '((c 3)))
+    (= (replace-assoc 'c bList) '())
+  )
+)
+
+
+(define (test-reset )
+  true)
+
+(define (test-rest , l)
+  (set 'l '(a b c d e f g))
+  (and  (= (cons (first l) (rest l)) l)
+    (= (rest "newlisp") "ewlisp")
+;; implicit nrest
+        (= (1 l) '(b c d e f g))
+    (= (10 l) '())
+    (= (0 l) l)
+    (= (-3 '(a b c d e f g)) '(e f g))
+        (= (-3 "abcdefg") "efg")
+    (= (1 '(A)) '())
+    (= (1 "A") "")
+    (= (array 2 2 (sequence 3 6)) (rest (array 3 2 (sequence 1 6))))
+))
+
+(define (test-reverse )
+  (and
+    (= (reverse '(1 2 3)) '(3 2 1))
+    (= (reverse "newLISP") "PSILwen")))
+
+(define (test-rotate )
+  (and
+    (= '(8 9 0 1 2 3 4 5 6 7) (rotate '(0 1 2 3 4 5 6 7 8 9) 2))
+    (= '() (rotate '()))
+	(= (rotate '(1) -1) '(1))
+	(= (rotate "") "")
+	(= (rotate "x" -1) "x")
+	(set 'str "abcdefg")
+	(= (rotate str) "gabcdef")
+	(= (rotate str 3) "defgabc")
+	(= (rotate str -4) "abcdefg")
+))
+
+(define (test-round)
+	(and
+		(= (round 1,25)  (round 1,25 0) 1)
+		(= (round 3,89) (round 3,89 0) 4)
+		(= (round 123,49 2) 100)
+		(= (round 123,49 1) 120)
+		(= (round 123,49 0) 123)
+		(= (round 123,49 -1) 123,5)
+		(= (round 123,49 -2) 123,49)
+		(= (round 123,49 -3) 123,49)
+		(!= (round 123,49 -2) 123,49000000000001)
+		(= (round 123,49 3)  0)))
+
+(define (test-save )
+  (and (save "all") (save "save.lsp" 'test-save) (delete-file "all") 
+   (delete-file "save.lsp")))
+
+(define (test-search , file)
+  (and
+    (set 'file (open "qa-comma" "read"))
+    (search file "define")
+    (close file)))
+
+(define (test-seed )
+  (seed 123)
+  (set 'a (rand 10))
+  (seed 123)
+  (set 'b (rand 10))
+  (= a b))
+
+(define (test-seek , file chr)
+  (set 'file (open "junk" "write"))
+  (dotimes (x 100) 
+   (write-char file x))
+  (close file)
+  (set 'file (open "junk" "read"))
+  (seek file 65)
+  (set 'chr (read-char file))
+  (close file)
+  (delete-file "junk")
+  (= chr 65))
+
+(define (test-select )
+  (set 'l '(0 1 2 3 4 5 6 7 8 9))
+  (and
+    (test-select-collect)
+    (= (select l '(0 9 9 0 1 8 8 1)) '(0 9 9 0 1 8 8 1))
+    (= (select "2001-09-20" '(5 6 8 9 0 1 2 3)) "09202001")))
+
+;; for testing semaphores accross processes/threads see test-share
+(define (test-semaphore)
+  (and
+    (set 'sid (semaphore))
+    (if (< opsys 5) (= (semaphore sid) 0) true) ;; no semaphore status on Win32
+    (semaphore sid 1)
+    (if (< opsys 5) (= (semaphore sid) 1) true) ;; no semaphore status on Win32
+    (semaphore sid 0)))
+
+(define (test-sequence )
+  (= (sequence 1 10 3) '(1 4 7 10)))
+
+(define (test-series )
+  (and
+    (= (series 2 2 5) '(2 4 8 16 32))
+    (= (series 2 2 0) '())
+    (= (series 1 2 -10) '())
+    (= (series 1 1 5) '(1 1 1 1 1))
+))
+
+(define (test-set , x y z)
+  (set 'x (set 'y (set 'z 123)))
+  (= x 123))
+
+(define (test-setq , x y z)
+  (setq x 1 y 2 z 3)
+  (and (= x 1) (= y 2) (= z 3)))
+
+(define (test-set-assoc)
+ (and
+	(set 'L '((a 1) (b (c (d 2) (e 3) (e 4))) ("a" 5) ((a) 6)))	
+	(= (assoc 'a L) '(a 1))	
+	(= (assoc 'b L) '(b (c (d 2) (e 3) (e 4))))
+	(= (assoc "a" L) '("a" 5))
+	(= (assoc '(a) L) '((a) 6))
+
+	(= (assoc (L 'a)) '(a 1))
+	(= (assoc (L 'b)) '(b (c (d 2) (e 3) (e 4))))
+	(= (assoc (L "a")) '("a" 5))
+	(= (assoc (L '(a))) '((a) 6))
+
+	(= (assoc (L 'b 'c)) '(c (d 2) (e 3) (e 4)))
+	(= (assoc (L 'b 'c 'd)) '(d 2))
+	(= (assoc (L 'b 'c 'e)) '(e 3))
+
+	(= (set-assoc (L 'a) '(a 11)) 
+	'((a 11) (b (c (d 2) (e 3) (e 4))) ("a" 5) ((a) 6)))
+
+	(= (set-assoc (L 'b) '(B (C (d 2) (e 3) (e 4))))
+ 		'((a 11) (B (C (d 2) (e 3) (e 4))) ("a" 5) ((a) 6)))
+
+	(= (set-assoc (L "a") '("A" 5))
+		'((a 11) (B (C (d 2) (e 3) (e 4))) ("A" 5) ((a) 6)))
+
+	(= (set-assoc (L '(a)) '((A) 6))
+		'((a 11) (B (C (d 2) (e 3) (e 4))) ("A" 5) ((A) 6)))
+
+	(= (set-assoc (L 'B 'C) '(c (d 2) (e 3) (e 4)))
+		'((a 11) (B (c (d 2) (e 3) (e 4))) ("A" 5) ((A) 6)))
+
+	(= (set-assoc (L 'B 'c 'd) '(d 22))
+		'((a 11) (B (c (d 22) (e 3) (e 4))) ("A" 5) ((A) 6)))
+
+	(= (set-assoc (L 'B 'c 'e) '(e 33))
+		'((a 11) (B (c (d 22) (e 33) (e 4))) ("A" 5) ((A) 6)))
+
+	(= (length (set 'L (dup '(a 1) 1000))) 1000)
+	(= (push '(x 9) L -1) '(x 9))
+	(= (ref '(x *) L match) '(1000))
+	(= (assoc 'x L) '(x 9))
+	(= (assoc-set (L 'x) $0) '(x 9))
+))
+
+(define (test-set-nth-implicit) 
+  (and
+    (= (set-nth ("abcd" 0) "z") "zbcd")
+    (= (set-nth ("abcd" -1) "z") "abcz")
+    (= (set-nth ("abcd" 3) "z") "abcz")
+    (= (set-nth ("abcd" -4) "z") "zbcd")
+    (= (set-nth ("abcd" 0) "xyz") "xyzbcd")
+    (= (set-nth ("abcd" -1) "xyz") "abcxyz")
+    (= (set-nth ("abcd" 3) "xyz") "abcxyz")
+    (= (set-nth ("abcd" -4) "xyz") "xyzbcd")
+    (= (set-nth ("abcd" 1) (append $0 $0)) "abbcd")
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 0) 'new) '(new (2 3) 4))
+    (= (nth 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 1) 'new) '(1 new 4))
+    (= (nth 1 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 2) 'new) '(1 (2 3) new))
+    (= (nth 2 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 0 0) 'new) '(new (2 3) 4))
+    (= (nth 0 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 1 0) 'new) '(1 (new 3) 4))
+    (= (nth 1 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 1 1) 'new) '(1 (2 new) 4))
+    (= (nth 1 1 l) 'new)
+    (set 'l '((2 3) 4))
+    (= (set-nth (l 0 0) 'new) '((new 3) 4))
+    (= (nth 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth (l 0 0 0) 'new) '((new (3 4)) (5 6)))
+    (= (nth 0 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth (l 0 0 1) 'new) '((new (3 4)) (5 6)))
+    (= (nth 0 0 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth (l 0 1 1) 'new) '((2 (3 new)) (5 6)))
+    (= (nth 0 1 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth (l 0 1) 'new) '((2 new) (5 6)))
+    (= (nth 0 1 l) 'new)
+	(set 'L '(1 2 3 4 5))
+	(= (set-nth (L 3) (+ $0 1)) '(1 2 3 5 5))
+	(set 'L '(a b c (d e f)))
+	(= (set-nth (L 3) (set-nth (L 3) 99)) '(a b c (a b c 99)))
+	(set 'L '(()))
+	(= (set-nth (L -1) 99) '(99))
+	(set 'L '((1 2 3) (a b c)))
+	(= (set 'aref (ref 'c L)) '(1 2))
+	(= (set-nth (L aref) 99) '((1 2 3) (a b 99)))
+	(set 'L '((1 2 3) (a b c)))
+	(= (set-nth 1 (+ 1 1) L 99) '((1 2 3) (a b 99)))
+	(= (set-nth (L 1 (+ 1 1)) 999) '((1 2 3) (a b 999)))	
+	(= (set-nth (L (sequence 1 10000)) '@) '((1 2 3) (a b @)))
+))
+
+(define (test-set-nth) 
+  (and
+    (= (set-nth 0 "abcd" "z") "zbcd")
+    (= (set-nth -1 "abcd" "z") "abcz")
+    (= (set-nth 3 "abcd" "z") "abcz")
+    (= (set-nth -4 "abcd" "z") "zbcd")
+    (= (set-nth 0 "abcd" "xyz") "xyzbcd")
+    (= (set-nth -1 "abcd" "xyz") "abcxyz")
+    (= (set-nth (+ 1 2) "abcd" "xyz") "abcxyz")
+    (= (set-nth -4 "abcd" "xyz") "xyzbcd")
+    (= (set-nth 1 "abcd" (append $0 $0)) "abbcd")
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth 0 l 'new) '(new (2 3) 4))
+    (= (nth 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth 1 l 'new) '(1 new 4))
+    (= (nth 1 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth 2 l 'new) '(1 (2 3) new))
+    (= (nth 2 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth 0 0 l 'new) '(new (2 3) 4))
+    (= (nth 0 0 l) 'new)
+    (set 'l '(1 (2 3) 4)) ;;;;
+    (= (set-nth 1 0 l 'new) '(1 (new 3) 4))
+    (= (nth 1 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth 1 1 l 'new) '(1 (2 new) 4))
+    (= (nth 1 1 l) 'new)
+    (set 'l '((2 3) 4))
+    (= (set-nth 0 0 l 'new) '((new 3) 4))
+    (= (nth 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth 0 0 0 l 'new) '((new (3 4)) (5 6)))
+    (= (nth 0 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth 0 0 1 l 'new) '((new (3 4)) (5 6)))
+    (= (nth 0 0 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth 0 1 1 l 'new) '((2 (3 new)) (5 6)))
+    (= (nth 0 1 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth 0 1 l 'new) '((2 new) (5 6)))
+    (= (nth 0 1 l) 'new)
+	(set 'L '(1 2 3 4 5))
+	(= (set-nth 3 L (+ $0 1)) '(1 2 3 5 5))
+	(set 'L '(a b c (d e f)))
+	(= (set-nth 3 L (set-nth 3 L 99)) '(a b c (a b c 99)))
+	(test-set-nth-implicit)
+))
+
+(define (test-nth-set-implicit)
+  (and
+    (= (nth-set ("abcd" 0) "z") "a")
+    (= (nth-set ("abcd" -1) "z") "d")
+    (= (nth-set ("abcd" 3) "z") "d")
+    (= (nth-set ("abcd" -4)"z") "a")
+    (= (nth-set ("abcd" 0) "xyz") "a")
+    (= (nth-set ("abcd" -1)"xyz") "d")
+    (= (nth-set ("abcd" 3) "xyz") "d")
+    (= (nth-set ("abcd" -4) "xyz") "a")
+    (= (nth-set ("abcd" 1) (append $0 $0)) "b")
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 0) 'new) 1)
+    (= (nth 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set  (l 1) 'new) '(2 3))
+    (= (nth 1 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 2) 'new) 4)
+    (= (nth 2 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 3) 'new) 4)
+    (= (nth 3 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 0 0) 'new) 1)
+    (= (nth 0 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 1 0) 'new) 2)
+    (= (nth 1 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 1 1) 'new) 3)
+    (= (nth 1 1 l) 'new)
+    (set 'l '((2 3) 4))
+    (= (nth-set (l 0 0) 'new) 2)
+    (= (nth 0 0 l) 'new)
+    (set 'l '((2 3)))
+    (= (nth-set (l 1 1) 'new) 3)
+    (= (nth 1 1 l) 'new)
+    (set 'l '((2 3)))
+    (= (nth-set (l 2 3) 'new) 3)
+    (= (nth 2 3 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set (l 0 0 0) 'new) 2)
+    (= (nth 0 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set (l 0 0 1) 'new) 2)
+    (= (nth 0 0 1 l) 'new) ;;;
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set (l 0 1 1) 'new) 4)
+    (= (nth 0 1 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set (l 0 1) 'new) '(3 4))
+    (= (nth 0 1 l) 'new)
+	(set 'L '(a b c (d e f)))
+	(nth-set (L 3) (nth-set (L 3) 99))
+	(= L '(a b c (d e f)))
+	(set 'L '((1 2 3) (a b c)))
+	(= (set 'aref (ref 'c L)) '(1 2))
+	(= (nth-set (L aref) 99) 'c)
+))
+
+
+(define (test-nth-set) 
+  (and
+    (= (nth-set 0 "abcd" "z") "a")
+    (= (nth-set -1 "abcd" "z") "d")
+    (= (nth-set (+ 1 2) "abcd" "z") "d")
+    (= (nth-set -4 "abcd" "z") "a")
+    (= (nth-set 0 "abcd" "xyz") "a")
+    (= (nth-set -1 "abcd" "xyz") "d")
+    (= (nth-set 3 "abcd" "xyz") "d")
+    (= (nth-set -4 "abcd" "xyz") "a")
+    (= (nth-set 1 "abcd" (append $0 $0)) "b")
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 0 l 'new) 1)
+    (= (nth 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 1 l 'new) '(2 3))
+    (= (nth 1 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 2 l 'new) 4)
+    (= (nth 2 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 2 l 'new) 4)
+    (= (nth 2 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 0 0 l 'new) 1)
+    (= (nth 0 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 1 0 l 'new) 2)
+    (= (nth 1 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 1 1 l 'new) 3)
+    (= (nth 1 1 l) 'new)
+    (set 'l '((2 3) 4))
+    (= (nth-set 0 0 l 'new) 2)
+    (= (nth 0 0 l) 'new)
+    (set 'l '((2 3)))
+    (= (nth-set 0 1 l 'new) 3)
+    (= (nth 0 1 l) 'new)
+    (set 'l '((2 3)))
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set 0 0 0 l 'new) 2)
+    (= (nth 0 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set 0 0 1 l 'new) 2)
+    (= (nth 0 0 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set 0 1 1 l 'new) 4)
+    (= (nth 0 1 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set 0 1 l 'new) '(3 4))
+    (= (nth 0 1 l) 'new)
+	(set 'L '(a b c (d e f)))
+	(nth-set 3 L (nth-set 3 L 99))
+	(= L '(a b c (d e f)))
+))
+
+
+(define (test-set-ref)
+	(and
+		(set 'L '(z a b (z) (d (c c (c)) e f c))) 
+		(= (set-ref (L 'c) 'z) '(z a b (z) (d (z c (c)) e f c)))
+		(set 'L '((a 1) (b 2) (a 3) (b 4)))	
+		(= (set-ref (L '(a *)) '(z 99) match) '((z 99) (b 2) (a 3) (b 4)))
+		(= (set-ref (L '(a *)) '(z 99) match) '((z 99) (b 2) (z 99) (b 4)))
+		(set 'Ct:Ct '(a b c d e f g))
+		(= (set-ref  (Ct 'c) 'z) '(a b z d e f g))
+	)
+)
+
+
+(define (test-set-ref-all)
+    (and
+		(set 'L '(z a b (c) (d (c c (c)) e f c))) 
+		(= (set-ref-all (L 'c) 'z) '(z a b (z) (d (z z (z)) e f z)))
+		(set 'L '((a 1) (b 2) (a 3) (b 4)))
+		(= (set-ref-all (L '(a *)) '(z 99) match) '((z 99) (b 2) (z 99) (b 4)))
+    )
+)
+
+(define (test-ref-set)
+	(and
+		(set 'L '(a b (c) d e f g))
+		(= (ref-set (L 'c) 'z) 'c)
+		(set 'L '(a b (c) d e f g))
+		(= (ref-set (L 'c) 'z) 'c)
+	)
+)
+
+(define (test-share)
+    (and 
+      (if (< opsys 5)
+          (unix-test-share)
+          (win32-test-share))
+      (set 'mvar (share))
+      (share mvar 123)
+      (= (share mvar) 123)
+      (share mvar 123,456)
+      (= (share mvar) 123,456)
+      (share mvar "hello")
+      (= (share mvar) "hello")))
+
+
+(define (win32-test-share)
+    (write-file "sharetest.lsp"
+[text]
+(map set '(sid mm) (map int (slice (main-args) 2)))
+(if (= (share mm) "hello") (share mm "HELLO"))
+(semaphore sid 1) ; signale parent to read
+(exit)
+[/text]
+    )
+  (and
+    (set 'sid (semaphore))
+    (set 'mm (share))
+    (share mm "hello")
+    (if (> opsys 5)
+      (process (string "newlisp sharetest.lsp " sid " " mm))
+      (process (string "./newlisp sharetest.lsp " sid " " mm)))
+    (semaphore sid -1) ; wait for child process
+    (semaphore sid 0) ;; delete semaphore
+    (= (share mm) "HELLO")
+    (or (delete-file "sharetest.lsp") true)))
+
+
+(define (unix-test-share)
+  (and
+    (set 'mm (share))
+    (share mm "hello")
+
+    (wait-pid (fork (begin
+            (if (= (share mm) "hello")
+                (share mm "HELLO"))
+                (exit ))))
+		
+    (= (share mm) "HELLO")
+    (share nil mm) ; unmap share
+))
+
+(define (test-sgn)
+ (and
+   (= 0 (sgn 0))
+   (= 1 (sgn 123))
+   (= -1 (sgn -3,5))))
+
+(define (test-signal)
+  (primitive? signal))
+
+
+(define (test-silent )
+  (primitive? silent))
+
+(define (test-sin )
+  (= 1 (sin (asin (sin (asin 1))))))
+
+(define (test-sinh)
+	(< (abs (sub (tanh 1) (div (sinh 1) (cosh 1))))  0,0000000001)
+)
+
+(define (test-sleep )
+  (set 'start (time-of-day))
+  (sleep 10)
+  (set 'start (time-of-day))
+  (sleep 1000)
+  (set 'duration (- (time-of-day) start))
+  (and (> duration 500) (< duration 1500)))
+
+(define (test-slice )
+(and 
+   (set 'str "0123456789")
+   (= (slice str 0 1) "0") 
+   (= (slice str 0 3) "012") 
+   (= (slice str 8 2) "89") 
+   (= (slice str 8 10) "89") 
+   (= (slice str 20 10) "")
+   (= (slice str 2 -2) "234567")
+   (= (slice str 2 -5) "234")
+   (= (slice str 2 -7) "2")
+   (= (slice str 2 -8) "")
+   (= (slice str 2 -9) "")
+   (= (slice '(a b c d e f g) 3 1) '(d))
+   (= (slice '(a b c d e f g) 3 0) '())
+   (= (slice '(a b c d e f g) 0 0) '())
+   (= (slice '(a b c d e f g) 10 10) '())
+   (= (slice '(a b c d e f g) 3 2) '(d e))
+   (= (slice '(a b c d e f g) 5) '(f g))
+   (= (slice '(a b c d e f g) -5 2) '(c d))
+   (= (slice '(a b c d e f g) -1 -2) '())
+   (= (slice '(a b c d e f g) 1 -2) '(b c d e))
+   (= (slice '(a b c d e f g) 4 -2) '(e))
+   (= (slice '(a b c d e f g) 4 -3) '())
+   (= (slice '(a b c d e f g) 4 -4) '())
+   (= (slice '(a b c d e f g) -6 -3) '(b c d))
+;; implicit slice
+   (= (1 3 '(a b c d e f g)) '(b c d))
+   (= (-4 2 '(a b c d e f g)) '(d e))
+   (= (1 3 "abcdefg") "bcd")
+   (= (-4 2 "abcdefg") "de")
+   (= (1 -3 "abcdefg") "bcd")
+   (= (1 -5 "abcdefg") "b")
+   (=  (1 -7 "abcdefg") "")
+   (setq x 1 y 2)
+   (= (x y '(a b c d e f g)) '(b c))
+   (= (x y "abcdefg") "bc")
+   (= (1 -2 '(a b c d e f g)) '(b c d e))
+   (= (4 -2 '(a b c d e f g)) '(e))
+   (= (4 -3 '(a b c d e f g)) '())
+   (= (4 -4 '(a b c d e f g)) '())
+   (= (-6 -3 '(a b c d e f g)) '(b c d))
+))
+
+(define (test-sort )
+  (and
+    (= '(1 2 3 4 5 6 7 8 9) (sort '(9 1 8 2 7 3 6 4 5)))
+    (= '(1 2 3 4 5 6 7 8 9) (sort '(9 1 8 2 7 3 6 4 5)))
+    (= '(1 2 3 4 5 6 7 8 9) (sort '(9 1 8 2 7 3 6 4 5) <))
+    (= '(9 8 7 6 5 4 3 2 1) (sort '(9 1 8 2 7 3 6 4 5) >))
+    (= '(1 2 3 4 5 6 7 8 9) (sort '(9 1 8 2 7 3 6 4 5) (fn (x y) (< x y))))
+    (= '(9 8 7 6 5 4 3 2 1) (sort '(9 1 8 2 7 3 6 4 5) (fn (x y) (> x y))))
+    (= '() (sort '()))
+  )
+)
+
+(define (test-source)
+  (= (replace "\r|\n" (source 'test-sin) "" 0) 
+     "(define (test-sin )  (= 1 (sin (asin (sin (asin 1))))))"))
+
+(define (test-sqrt )
+  (and (= 10 (sqrt 100)) (= 1,2 (sqrt 1,44))))
+
+(define (test-starts-with )
+  (and (starts-with "newlisp" "new") (starts-with "newlisp" "NEW" 
+    nil)))
+
+(define (test-string )
+  (and (string? (string 12345)) (= (string 12345) "12345") (string? 
+    (string 1.234)) 
+   (= (string 'test-string) "test-string") 
+   (string? (string test-string)) 
+   (= (string "a" "b" "c") (append "a" "b" "c") "abc") 
+   (= (string "a" 123 "b") "a123b")))
+
+(define (test-string? )
+  (and (string? "1234") (not (string? 1234))))
+
+(define (test-sub )
+  (= 0 (sub 0,99999999 0,99999999))
+  (= -123 (sub 123)))
+
+(define (test-swap )
+  (set 'lst '(1 2 3 4))
+  (and 
+	(= (swap 1 2 lst) '(1 3 2 4)) 
+	(= lst '(1 3 2 4))
+    (let (a 1 b 2) (and (= (swap a b) 1) (= a 2) (= b 1)))
+  )
+)
+
+(define (test-sym)
+  (and (= (sym "test-sym") 'test-sym) 
+       (= (sym "test-sym" 'QA) 'test-sym)))
+
+(define (test-symbol? )
+	(and
+  		(symbol? (sym "test-sym"))
+		(symbol? (sym "a b"))
+))
+
+
+(define (test-symbols )
+  (and (list? (symbols)) (> (length (symbols)) 0)))
+
+(define (test-sys-error)
+	(integer? (sys-error 0) ))
+
+(define (test-sys-info )
+   (and (list? (sys-info)) (= (length (sys-info)) 8)))
+
+(define (test-tan )
+  (> 1 (tan (atan (tan (atan 1))))))
+
+(define (test-tanh)
+	(< (abs (sub (sinh 1) (div (sub (exp 1) (exp -1)) 2))) 0,0000000001)
+)
+
+(define (test-throw )
+  (and (catch (throw (+ 3 4)) 'msg) (= msg 7)))
+
+(define (test-time )
+  (integer? (time)))
+
+(define (test-time-of-day )
+  (integer? (time-of-day)))
+
+(define (test-trace )
+  (trace nil)
+  (= nil (trace)))
+
+(define (test-trace-highlight )
+  (trace-highlight "#" "#"))
+
+(define (test-transpose )
+  (= '((1) (2) (3)) (transpose '((1 2 3))))
+  (= '((a b) (c d) (e f)) (transpose '((a c e) (b d f))))
+  (= '((a d f) (b e g) (c nil nil)) (transpose '((a b c) (d e) (f g))))
+  (= '((a c f) (b d g)) (transpose '((a b) (c d e) (f g)))))
+
+(define (test-trim )
+  (and 
+    (= (trim "    hello    ") "hello") 
+    (= (trim "----hello----" "-") "hello")
+    (= (trim "----hello====" "-" "=") "hello")
+    (= (trim "000012345" "0" "") "12345")))
+
+(define (test-true?)
+ (= (map true? '(x nil  1 nil "hi" ())) '(true nil true nil true nil)))
+
+
+(define (test-unique )
+  (= (unique '(2 3 4 4 6 7 8 7)) '(2 3 4 6 7 8)))
+
+(define (test-unify)
+	(and
+		(= (unify 'A 'A) '())
+		(= (unify 'X 123) '((X 123)))
+        (= (unify '(Int Flt Str Sym Lst) '(123 4,56 "Hello" s '(a b c)))
+                  '((Int 123) (Flt 4,56) (Str "Hello") (Sym s) (Lst '(a b c))))
+		(= (unify '(A B "hello") '("hi" A Z)) '((A "hi") (B "hi") (Z "hello")))
+		(= (unify '(A B) '(B abc)) '((A abc) (B abc)))
+		(= (unify '(B A) '(abc B)) '((B abc) (A abc)))
+		(= (unify '(A A C D) '(B C 1 C)) '((B 1) (A 1) (C 1) (D 1)))
+		(= (unify '(D C A A) '(C 1 C B)) '((D 1) (C 1) (B 1) (A 1)))
+		(= (unify '(f A) '(f (a b c))) '((A (a b c))))
+		(= (unify '(A f) '((a b c) f)) '((A (a b c))))
+		(= (unify '(f (g A)) '(f B)) '((B (g A))))
+		(= (unify '(p X Y a) '(p Y X X)) '((Y a) (X a)))
+		(= (unify '(p X Y) '(p Y X)) '((Y X)))
+		(= (unify '(q (p X Y) (p Y X)) '(q Z Z)) '((Y X) (Z (p X X))))
+		(= (unify '(f (g A) A) '(f B xyz)) '((B (g xyz)) (A xyz)))
+		(= (unify '(A (g abc)) '(B A)) '((B (g abc)) (A (g abc))))
+		;; with additional environment list
+		(= (unify '(A (B) X) '(A (A) Z) '((A 1) (Z 4)))
+		   ' ((A 1) (Z 4) (B 1) (X 4)))
+))
+
+(define (test-unicode)
+  (= (utf8 (unicode "newLISP")) "newLISP"))
+
+(define (test-utf8len)
+	(= 23 (utf8len MAIN:utf8str)))
+
+(define (test-unless )
+  (unless nil 
+   true nil))
+
+(define (test-unpack )
+  (= (pack "c c c" 65 66 67) "ABC")
+  (= (unpack "c c c" "ABC") '(65 66 67)))
+
+(define (test-until , x)
+  (set 'x 0)
+  (= 10 (until (= x 10) (inc 'x)) x))
+
+(define (test-do-until , x)
+  (set 'x 0)
+  (and 
+   (= 10 (do-until (= x 10) (inc 'x)) x)
+   (= 11 (do-until (> x 0) (inc 'x)) x)
+))
+
+(define (test-upper-case )
+  (if (> opsys 4) 
+   (= "ABCDEFGQ" (upper-case "abcdefgq")) 
+   (= "ABCDEFGH" (upper-case "abcdefgh"))))
+
+(define (test-utf8)
+  (and
+    (= (utf8 (unicode "newLISP")) "newLISP")
+    (MAIN:utf8qa)))
+
+(define (test-uuid)
+    (= 36 (length (uuid))))
+
+(define (test-wait-pid)
+  (set 'pid (fork (begin (sleep 200)(exit))))
+  (wait-pid pid))
+
+(define (test-when)
+	(and 
+		(= (when true (set 'x 1) (set 'y 2) (set 'z 3)) 3)
+		(= x 1) (= y 2) (= z 3)
+		(= (when 123) 123)
+		(= (when nil) nil))
+)
+
+(define (test-while , x)
+  (and
+    (set 'x 0)
+    (= 1000 (while (< x 1000) (inc 'x)) x)
+))
+
+(define (test-do-while, x)
+  (and
+    (set 'x 0)
+    (= 100 (do-while (< x 100) (inc 'x)) x)
+    (= 101 (do-while (< x 100) (inc 'x)) x)
+))
+
+(define (test-write-buffer )
+  (set 'str "")
+  (dotimes (x 5) (write-buffer str "hello"))
+  (and (= str "hellohellohellohellohello")
+       (test-read-buffer)))
+
+(define (test-write-char )
+  (file-copy "qa-comma" "junk")
+  (delete-file "junk"))
+
+(define (test-write-file )
+  (write-file "junk" "newlisp")
+  (= (read-file "junk") "newlisp"))
+
+(define (test-write-line ) 
+  (and
+    (set 'fle (open "testwrite" "w"))
+    (write-line "hello" fle)
+    (close fle)
+    (set 'fle (open "testwrite" "r"))
+    (= (read-line fle) "hello")
+    (close fle)
+    (delete-file "testwrite")  ))
+
+
+(define (test-xml-error )
+  (= (xml-error) nil))
+
+(define (test-xml-parse )
+  (= (xml-parse "<hello att='value'></hello>") '(("ELEMENT" "hello" 
+     (("att" "value")) 
+     ()))))
+
+(define (test-xml-type-tags )
+  (length (xml-type-tags) 4))
+
+(define (test-zero?)
+  (= (map zero? '(1 0 1,2 0,0)) '(nil true nil true)))
+
+(define (test-| )
+  (= (| -1431655766 1431655765) -1))
+
+(define (test-~ )
+  (and
+    (= (~ 0) -1)
+    (if 
+        (and (> opsys 5) (< opsys 9)) ;; Win32 
+        (= (format "%I64x" (~ 0xa0a0a0a0a0a0a0a0)) "5f5f5f5f5f5f5f5f")
+
+        (= opsys 9)
+        (= (format "%lx" (~ 0xa0a0a0a0a0a0a0a0)) "5f5f5f5f5f5f5f5f")
+
+        (= (format "%llx" (~ 0xa0a0a0a0a0a0a0a0)) "5f5f5f5f5f5f5f5f"))
+))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; MAIN ENTRY POINT ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(if (or (not (or (file? "newlisp") (file? "newlisp.exe"))) (not (file? "qa-comma")))
+	(begin
+		(println "both newlisp(.exe) and qa-comma should be in the current directory.")
+		(exit)))
+
+(cleanup)
+(println)
+(println "Testing built-in functions ...")
+(println)
+(qa)
+(cleanup)
+
+(context 'MAIN)
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(println)
+(println "Testing contexts as objects and scoping rules ...")
+(println)
+
+;; check creating local symbols
+;; in case they already exist in MAIN
+(set 'var 123)
+(set 'CTX:var 456)
+(if (or (!= CTX:var 456) (!= var 123))
+	(println ">>>>> problem creating local symbols"))
+
+(set 'ctx CTX)
+
+(global 'myprint)
+(set 'myprint print)
+
+;; following would fail without dynamic symbols for non-existing
+;; contexts because 'accnt' is not a context at this moment
+(define (report accnt)
+    (list accnt:name accnt:balance))
+
+;; late in ACCOUNT the definition of 'deposit' should
+;; should not fail, locals should always be created for
+;; the current context
+(constant 'amount 999)
+(constant 'stat 999)
+
+;; the symbol defined should always be forced into the current
+;; context, even if alread exists in MAIN, if not following
+;; definition of 'deposit' would fail
+(set 'deposit 999) 
+(set 'clear 999)
+(constant 'withdraw 999) 
+
+(define balance 1000.00)
+(constant 'phone "123-456-789")
+
+
+(context 'ACCOUNT)
+    (set 'ACCOUNT:name "")      ; force creation of local symbol with
+    (define balance 0,0)  	; same name as built in primitive
+    (constant 'phone "")     
+
+    (define (deposit amount)
+        (inc 'balance amount))
+
+    (define (withdraw amount)
+        (dec 'balance amount))
+    
+    ; make sure contexts are inherited
+    ; but not variables containing contexts
+    (if (not (context? CTX)) 
+	(QA:failed ">>>> problem inheriting context symbols"))
+
+    ; make sure context variables get not inherited
+    (if (= ctx CTX) (QA:failed ">>>>> should not inherit context var"))
+    
+    (set 'ctx 123)
+
+    ; make sure redefined primitives get inherited
+    (if (not (primitive? myprint)) 
+    	(QA:failed ">>>> problem inheriting redefined primitives"))
+
+(set 'myprint nil)
+   
+(context 'MAIN)
+
+;; make sure again that context defs did not overwrite MAIN symbols
+(if (or (!= deposit 999) (!= clear 999) (!= withdraw 999) (!= stat 999) (!= ctx CTX)
+        (not (primitive? name)) (!= balance 1000.0) (!= phone "123-456-789"))
+	(QA:failed ">>>> context definitions are overwriting MAIN"))
+
+(new ACCOUNT 'John true)     ; this creates a new context copy of 
+                             ; ACCOUNT called 'John' if exists overwrite symbols
+
+(set 'John:name "John Doe")
+(set 'John:phone "555-123-456")
+
+(John:deposit 100,00)
+(John:withdraw 60)
+
+(new ACCOUNT 'Anne true)
+
+(set 'Anne:name "Anne Somebody")
+(set 'Anne:phone "555-456-123")
+
+(Anne:deposit 120,00)
+(Anne:withdraw 50)
+(if (or (!= John:balance 40) (!= Anne:balance 70))
+	(QA:failed ">>>> problem with methods in contexts"))
+
+(if (or (!= (report John) (list John:name John:balance))
+        (!= (report Anne) (list Anne:name Anne:balance)))
+    (QA:failed ">>>> problem using context variables"))
+
+(if (!= (map report (map eval '(John Anne))) 
+       '(("John Doe" 40) ("Anne Somebody" 70)) )
+    (QA:failed ">>>> problem mapping functions using context vars"))
+
+
+;; dynamic context var as symbol to be defined
+;;
+(define (defit)
+	(define (ctx:foo x) (+ x x)))
+
+(set 'ctx ACCOUNT)
+(defit)
+(if (!= (ctx:foo 10) 20) 
+  (QA:failed ">>>> problem with dyna symbols in defined symbol"))
+
+
+;; check setq, define (as set) and inc, dec on dynamic context vars
+;;
+(define (foo-set ct value) (set 'ct:var value))
+(define (foo-setq ct value) (setq ct:var value))
+(define (foo-define ct value) (define ct:var value))
+(define (foo-inc ct value) (inc 'ct:var))
+(define (foo-dec ct value) (dec 'ct:var))
+
+(set 'CTX:var 0) ;; make sure var is existent
+(foo-set CTX 1)
+(if (!= 1 CTX:var) 
+  (QA:failed ">>>> problem with set on context vars"))
+
+(foo-setq CTX 3)
+(if (!= 3 CTX:var) 
+  (QA:failed ">>>> problem with setq on context vars"))
+
+(foo-define CTX 4)
+(if (!= 4 CTX:var) 
+  (QA:failed ">>>> problem with define on context vars"))
+
+(foo-inc CTX)
+(if (!= 5 CTX:var) 
+  (QA:failed ">>>> problem with inc on context vars"))
+
+(foo-dec CTX)
+(if (!= 4 CTX:var) 
+  (QA:failed ">>>> problem with dec on context vars"))
+
+;; dynamic context vars inside a context (since version 7.5.1)
+
+(context 'TST)
+
+(define (init ctx value)
+	(set 'ctx:foo value))
+
+;; since version 8.7.8 when calling a function in a context the current runtime
+;; context changes
+(define (test-context-change)
+	(= (context) TST))
+
+(context MAIN)
+
+;; foo does not exist in CTX
+
+(TST:init CTX 999)
+
+(if (!= 999 CTX:foo) 
+  (QA:failed ">>>> problem with dyna vars in contexts"))
+
+;; now foo does exist
+(TST:init CTX 222)
+
+(if (!= 222 CTX:foo)
+  (QA:failed ">>>> problem with dyna vars in contexts"))
+
+
+(define (cdf:cdf a b) (+ a b))
+
+(if (!= (cdf 3 4) 7) 
+  (QA:failed ">>>> problem with context default vars"))
+
+;; check for existence of dynamic context symbol
+
+(define (check-sym-existence ctx)
+  (if (symbol? 'ctx:foovar) ;; will not create is only check
+    (QA:failed ">>>> problem with symbol? for dyna vars")))
+
+(check-sym-existence CTX)
+
+;; do not overwrite existing symbols
+
+(set 'Actx:x 123)
+(set 'Actx:y 456)
+(set 'Bctx:x 999)
+
+(new Actx Bctx)
+
+(if (not (= Bctx:x 999))
+  (QA:failed ">>>>> problem with new in overwriting symbols"))
+
+;; delete contexts
+ (if (not (and
+        (delete ACCOUNT)
+        (delete Anne)
+        (delete John)
+;		(map delete '(Actx Bctx cdf))
+      ) )
+    (QA:failed ">>>>> problem deleting contexts"))
+
+;; define static default functions
+
+(define foobar:foobar)
+
+(define (def-static s contents)
+   (def-new 'contents (sym (name s) s)))
+
+(if (not 
+  (and
+    (def-static 'foobar (fn (x) (+ x x)))
+    (= foobar:foobar (lambda (foobar:x) (+ foobar:x foobar:x)))
+    (= (foobar 10) 20)))
+  (QA:failed ">>>>> problem with static default function definition"))
+
+;; calling into context changes context
+(if (not TST:test-context-change)
+  (QA:failed ">>>>> problem changing runtime context with symbol"))
+
+;; but calling with raw lambda doesn't
+(if ((eval TST:test-context-change))
+  (QA:failed ">>>>> problem maintaining runtime context with lambda"))
+
+;; apply evaluates functor
+(if (not (apply 'TST:test-context-change))
+  (QA:failed ">>>>> problem changing runtime context with apply symbol"))
+
+;; apply evaluates functor
+(if (apply TST:test-context-change)
+  (QA:failed ">>>>> problem maintaining runtime context with apply lambda"))
+
+;; map evaluates functor
+(if (!= (map 'TST:test-context-change '(a b c)) '(true true true))
+  (QA:failed ">>>>> problem changing runtime context with map symbol"))
+
+;; map evaluates functor
+(if (!= (map TST:test-context-change '(a b c)) '(nil nil nil))
+  (QA:failed ">>>>> problem maintaining runtime context with map lambda"))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;; testing the default functor ;;;;;;;;;;;;;;;
+
+(define (double:double x) (+ x x))
+
+(define (test-default-functor)
+	(and
+		(= (map double '(1 2 3 4 5)) '(2 4 6 8 10))
+		(= (map 'double '(1 2 3 4 5)) '(2 4 6 8 10))
+		(set 'dflt:dflt '(a b c d e f g))
+		(= (map dflt '(1 2 6)) '(b c g))
+		(set 'i 0 'j -1 'k 6)
+		(= (dflt i) 'a)
+		(= (dflt k) 'g)
+		(= (dflt j) 'g)
+		 
+))
+
+(if (not (test-default-functor))
+	(QA:failed ">>>>> problem testing default functor"))
+	
+		
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(println)>
+(if QA:failed-messages
+  (begin
+    (println "TESTING: " (main-args 0) " FINISHED WITH ERRORS:")
+    (println)
+    (dolist (func (reverse QA:failed-messages))
+        (println func)))
+  (println "ALL FUNCTIONS FINISHED SUCCESSFULL: " (main-args 0)))
+
+(println)
+(delete-file "sharetest.lsp")
+(delete-file "udptest.lsp")
+
+
+(println "total time: " (- (time-of-day) start-of-qa))
+
+(exit)
+
+
+;; eof
+
diff --git a/qa-dot b/qa-dot
new file mode 100755
index 0000000..c278e6d
--- /dev/null
+++ b/qa-dot
@@ -0,0 +1,3208 @@
+#!/usr/bin/newlisp
+(set 'start-of-qa (time-of-day))
+;;
+;; General test suite testing functioning of all built in primitives.
+;;
+;; use from inside the newlisp-x.x.x/ directory
+;;
+;;   ./newlisp qa-dot
+;;
+;;   or for countries and configurations with decimal 
+;;
+;;   ./newlisp qa-comma (for countries and configurations with decimal , )
+;;
+
+(set (sym "test-:" 'QA) (lambda () true))
+(context 'Lex)  ; predeclare/create context for bayes-train
+(context MAIN)
+(define (utf8qa)
+(set-locale "en_US")
+
+(set 'unicodelist '(913 914 915 916 937 945 946 947 948 969 32 
+                 1040 1041 1042 1043 1044 1072 1073 1074 1075 1076 13 10))
+
+(set 'utf8str (join (map char unicodelist)))
+
+
+(if (not (= (length (char 937)) 2)) (QA:failed "UTF-8 char: failed"))
+
+(if (not (and
+    (= (map char (explode (chop utf8str))) (chop unicodelist)) 
+    (= (map char (explode (chop utf8str 3))) (chop unicodelist 3))
+    (= (map char (explode (chop utf8str 5))) (chop unicodelist 5)))) (QA:failed "UTF-8 chop: failed"))
+
+(if (not (= (map char (explode utf8str)) unicodelist)) (QA:failed "UTF-8 explode: failed"))
+
+(if (not (= (map char (explode (upper-case utf8str))) 
+    '(913 914 915 916 937 913 914 915 916 937 32 1040 1041 1042 1043 1044 1040 1041 1042 1043 1044 13 10)))
+    (QA:failed "UTF-8 upper-case: failed"))
+
+(if (not (= (map char (explode (lower-case utf8str))) 
+    '(945 946 947 948 969 945 946 947 948 969 32 1072 1073 1074 1075 1076 1072 1073 1074 1075 1076 13 10)))
+    (QA:failed "UTF-8 lower-case: failed"))
+
+(if (not (= (map char (explode (first utf8str))) '(913))) (QA:failed "UTF-8 first: failed"))
+
+(if (not (= (map char (explode (last utf8str))) '(10))) (QA:failed "UTF-8 last: failed"))
+
+(if (not (= (map char (explode (rest utf8str))) 
+    '(914 915 916 937 945 946 947 948 969 32 1040 1041 1042 1043 1044 1072 1073 1074 1075 1076 13 10)))
+    (QA:failed "UTF-8 rest: failed"))
+
+(if (not (= (map char (explode (first (rest utf8str)))) '(914))) (QA:failed "UTF-8 first, rest: failed"))
+
+(if (not 
+  (and (= (map char (explode (select utf8str 1 2 3))) '(914 915 916))
+       (= (map char (explode (select utf8str -1 -2 -3))) '(10 13 1076))
+       (= (map char (explode (select utf8str 2 4 6))) '(915 937 946))))
+  (QA:failed "UTF-8 select: failed"))
+
+
+(if (not (= (map char (explode (select utf8str '(1 2 3)))) '(914 915 916))) (QA:failed "UTF-8 select: failed"))
+
+(if (not (and
+    (= (map char (explode (nth 1 utf8str))) '(914))
+    (= (map char (explode (nth -5 utf8str))) '(1074))))
+ (QA:failed "UTF-8 nth: failed"))
+
+(if (not (= (map char (explode (nth-set 2 utf8str (char 937)))) '(915))) (QA:failed "UTF-8 nth-set: failed"))
+
+(if (not (= (map char (explode (set-nth 2 utf8str (char 937)))) 
+    '(913 914 937 916 937 945 946 947 948 969 32 1040 1041 1042 1043 1044 1072 1073 1074 1075 1076 13 10)))
+    (QA:failed "UTF-8 set-nth: failed"))
+
+true
+)
+
+(global 'global-myvar)
+(set 'global-myvar 123)
+
+; testing the default functor
+		
+(define (double:double x) (+ x x))
+
+(define (test-default-functor)
+	(and
+		(= (map double '(1 2 3 4 5)) '(2 4 6 8 10))
+		(= (map 'double '(1 2 3 4 5)) '(2 4 6 8 10))
+		(set 'dflt:dflt '(a b c d e f g))
+		(= (map dflt '(1 2 6)) '(b c g))
+		(set 'i 0 'j -1 'k 6)
+		(= (dflt i) 'a)
+		(= (dflt k) 'g)
+		(= (dflt j) 'g)
+		(set 'ctx dflt)
+		(= (default ctx) 'dflt:dflt)
+		(= (default dflt) 'dflt:dflt)
+		(sort (eval (default ctx)) >)
+		(= dflt:dflt '(g f e d c b a))
+))
+		 
+
+(context 'QA)
+
+;; get operating system
+(set 'opsys (& (last (sys-info)) 0xf))
+
+(define (cleanup)
+  (delete-file "junk")
+  (delete-file "junk2"))
+
+(set 'failed-messages '())
+
+(define (check-case x)
+  (case x 
+   (1 "one") 
+   (2 "two") 
+   (3 "three")))
+
+(define (check-cond x)
+  (cond 
+   ((= x 1) 1) 
+   ((= x 2) 2) 
+   ((= x 3) 3)))
+
+(define (checkqa )
+  (dolist (p (symbols 'MAIN)) 
+   (if (primitive? (eval p)) 
+    (begin 
+     (set 'sm (sym (append "test-" (string p)))) 
+     (if (not (lambda? (eval sm))) 
+      (print sm "\n"))))))
+
+(define-macro (do-args p)
+  (= (args) '(2 "3 4" 5 (x y)))
+  (= (args 3 -1) 'y))	
+
+(define (failed msg)
+;  (println msg)
+  (push msg failed-messages))
+
+(define (file-copy from-file to-file)
+  (set 'in-file (open from-file "read"))
+  (set 'out-file (open to-file "write"))
+  (while (set 'chr (read-char in-file)) 
+   (if (not (= chr 95)) 
+    (write-char out-file chr)))
+  (close in-file)
+  (close out-file))
+
+(define (line-count file)
+  (device (open file "read"))
+  (set 'cnt 0)
+  (while (read-line) 
+   (inc 'cnt))
+  (close (device))cnt)
+
+(define (myappend x y)
+  (cond 
+   ((= '() x) y) 
+   (true (cons (first x) (myappend (rest x) y)))))
+
+(define (qa )
+  (dolist (sm (symbols 'MAIN)) 
+   (if (not 
+     (if (and (primitive? (eval sm)) (< sm 'zzzz)) 
+       (begin 
+          (print (name sm) " ")
+          (set 'func (eval (sym (append "test-" (string sm)))) )
+          (and (catch (apply func) 'result)  result))
+       true)) 
+     (failed (string ">>>> " sm " failed " result) )))
+  (println))
+
+(define (test-$) (find "a|b" "xtzabc" 0) (= ($ 0) $0))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; test-functions ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(define (test-!)
+  (integer? (! "")))
+
+(define (test-!= )
+  (and (not (!= -9223372036854775808 (& -9223372036854775808 -1))) (!= "abc" "ABC") 
+   (!= "a" "ä") 
+   (!= 1.000000001 1) 
+   (!= "á" "a")))
+
+(define (test-$)
+	(set '$0 123)
+	(= ($ 0) 123))
+
+(define (test-% )
+  (and
+    (= (% 10 3) 1)
+    (not (catch (%) 'result))))
+
+(define (test-& )
+  (= -9223372036854775808 (& -9223372036854775808 -1)))
+
+(define (test-* )
+  (= (* (* 123456789 123456789)) 15241578750190521))
+
+(define (test-+ )
+  (= (+ 999999999999999999 1) 1000000000000000000)
+  (= (+ 9223372036854775807 -9223372036854775808) -1)
+  (= (+ -9223372036854775808 -1) 9223372036854775807)) ; wraps around
+
+(define (test-- )
+  (= (- 100000000 1) 99999999))
+
+(define (test-/ )
+  (= (/ 15241578750190521 123456789) 123456789)
+  (= (/ -10 5) -2))
+
+(define (test-< )
+  (and 
+   (< -9223372036854775808 9223372036854775807)
+   (< "abcdefg" "abcdefgh")
+   (< 1 1.000000001) 
+   (< 1 "a") 
+   (< "a" 'a)
+   (< '(a b) '(b c) '(c d))
+   (not (< '(a b) '(b d) '(b c)))
+   (< '(((a b))) '(((b c))))
+   (< '(a (b c)) '(a (b d)) '(a (b (d))))
+   (< -1)
+   (< -1.23)
+   (not (< "1"))
+   (not (< '()))
+))
+
+(define (test-<< )
+  (= (<< 1 63) -9223372036854775808))
+
+(define (test-<= )
+  (and (<= -9223372036854775808 -9223372036854775808) (<= 1 1.00000001)))
+
+(define (test-= )
+  (and 
+    (= 1.23456789 1.23456789) 
+    (= 123456789 123456789) 
+    (= '(1 2 3 (4 5) (a b ("CDEFG" "HIJK") 'u 'v 'w)) 
+    '(1 2 3 (4 5) (a b ("CDEFG" "HIJK") 'u 'v 'w))) 
+    (= "éâäáíóúñÑöò" "éâäáíóúñÑöò")
+    (= '())
+    (= 0)
+    (= "")
+    (not (= 1))
+    (not (= "abc"))
+    (not (= '(1 2 3)))
+))
+
+(define (test-> )
+  (and (> 9223372036854775807 -9223372036854775808) (> "abcdefgh" "abcdefg") (> 1.000000001 
+    1) 
+   (> "a" 1) 
+   (> "z" "aaaaa")
+   (> "aaa" "a")
+   (> 'a "a") 
+   (> '(a) 'a)
+   (> 1)
+   (> 1.23)
+   (> "abc")
+   (> '(1 2 3))
+   (not (> ""))
+   (not (> '()))   
+))
+
+(define (test->= )
+  (and (>= 1 0) (>= 1.00000001 1)))
+
+(define (test->> )
+  (= (>> 1073741824 30) 1))
+
+(define (test-NaN? )
+  (and (NaN? (sqrt -1))
+       (set 'NaN (sqrt -1)) 
+       (= 1 (+ 1 NaN)) 
+       (= 0 (* 2 NaN)) 
+       (NaN? (add 1 (sqrt -1))) 
+       (NaN? (abs (sqrt -1)))))
+
+(define (test-^ )
+  (= (^ 1431655765 -1431655766) -1))
+
+(define (test-abs )
+  (and (= (abs -1) 1) (= (abs -9.9) 9.9)))
+
+(define (test-acos )
+  (= 0 (acos (cos (acos (cos 0))))))
+
+(define (test-acosh)
+	(= (cosh (acosh 1)) 1))
+
+(define (test-add , l)
+  (dotimes (x 100) 
+   (push x l))
+  (= 4950 (apply add l)))
+
+(define (test-address, s)
+	(set 's "foo")
+	(= (address s) (last (dump s))))
+
+(define (test-amb)
+	(set 'x (amb 1 2))
+	(or (= x 1) (= x 2)))
+
+(define (test-and )
+  (and (and true true true) (not (and true true nil))))
+
+(define (test-append )
+  (and
+    (= '(1 2 3 4) (append '(1 2) '(3 4)))
+    (= '(1 2 3 4 5) (append '(1 2) '(3) '(4 5)))
+    (= '(1 2 3 4) (append '(1 2) '(3 4) '()))
+    (= '(1 2 3 4 5) (append '(1 2) '(3 4) '() '(5)))
+    (= '(1 2 3 4 5) (append '() '(1 2) '(3 4) '() '(5)))
+    (= '() (append '()) (append '() '()) (append))
+    (= "abcdefg" (append "" "a" "bcd" "" "ef" "g" ""))
+    (= "" (append ""))
+    (set 'A (array 3 2 (sequence 1 6)))
+    (set 'B (array 2 2 (sequence 7 10)))
+    (= (array 5 2 (sequence 1 10)) (append A B))
+    (lambda? (append '(lambda)))
+))
+
+(define (test-append-file)
+  (append-file "junk" "ABC")
+  (append-file "junk" "DEF")
+  (= (read-file "junk") "ABCDEF")
+)
+
+(define (test-apply )
+  (and (= (apply + '(1 2)) 3) 
+       (= (apply append '("a" "b" "c")) "abc")
+       (= (apply (fn (x y) (+ x y)) '(3 4)) 7)
+))
+
+(define (test-args )
+  (do-args 1 2 "3 4" 5 (x y)))
+
+(define (test-array) 
+  (and
+    (= (array-list (array 3 2 (sequence 1 6))) '((1 2) (3 4) (5 6)))
+    (set 'A (array 3 2 (sequence 1 6)))
+    (= (array-list (nth 0 A)) '(1 2))
+    (= (nth 0 0 A) 1)
+    (= (nth 2 1 A) 6)
+    (= (nth -1 -1 A) 6)
+    (not (catch (nth 10 10 A)  'result))
+    (not (catch (nth -10 -10 A) 'result))
+    (= (nth 0 A) (array 2 '(1 2)))
+    (= (array-list (nth 0 A)) '(1 2))
+    (< (nth 0 A) (nth 1 A))
+    (> (nth 2 A) (nth 1 A))
+    (set-nth 1 0 A 1)
+    (= (nth 1 0 A) 1)
+    (= (nth-set 1 1 A 1) 4)
+    (< (nth 1 A) (nth 0 A))
+))
+
+(define (test-array-list)
+	(set 'a (array 3 4 (sequence 1 12)))
+	(and (array? a) (list? (array-list a))))
+
+(define (test-array?) (test-array-list))
+
+(define (test-asin )
+  (= (round (asin (sin (asin (sin 1)))) -9) 1))
+
+(define (test-asinh)
+  (= (sinh (asinh 1)) 1))
+
+(define (test-assoc )
+  (= (assoc 'b '((a 1) (b 2))) '(b 2)))
+
+(define (test-assoc-set)
+	(and
+		(set 'A '((a 1) (b 2) (c 3)))
+  		(= (assoc-set (A 'b) '(b 3)) '(b 2))
+		(= A '((a 1) (b 3) (c 3)))
+))
+
+
+(define (test-atan )
+	(< (sub 1 (atan (tan (atan (tan 1))))) 1e-15))
+
+; old test broke after Mac OS X update to 10.5.2
+;  (= 1 (atan (tan (atan (tan 1)))))
+
+(define (test-atanh)
+	(< (sub (tanh (atanh 0.5)) 0.5) 0.0000000001))
+
+(define (test-atan2 )
+  (= (div (acos 0) (atan 1 1)) 2))
+
+(define (test-atom? )
+  (and (atom? 1) (atom? 1.23) (atom? "hello") (atom? 'x) (atom? nil) (atom? true)))
+
+(define (test-base64-enc)
+  (and
+    (= "" (base64-dec (base64-enc "")))
+    (= "1" (base64-dec (base64-enc "1")))
+    (= "12" (base64-dec (base64-enc "12")))
+    (= "123" (base64-dec (base64-enc "123")))
+    (= "1234" (base64-dec (base64-enc "1234")))
+))
+
+(define (test-base64-dec)
+  (test-base64-enc))
+
+;; context Lex was previously created
+
+(define (test-bayes-train)
+  (and
+    (= (bayes-train '(F F F B B) '(F B B B B) 'Lex) '(5 5))
+    (> 0.001 (apply add (map sub (bayes-query '(F) Lex) '(0.75 0.25))))
+    (> 0.001 (apply add (map sub (bayes-query '(F) Lex true) '(0.75 0.25))))
+    (> 0.001 (apply add (map sub (bayes-query '(F F) Lex) '(0.8251777681 0.1748222319))))
+    (> 0.001 (apply add (map sub (bayes-query '(F F) Lex true) '(0.9 0.1))))
+  )
+)
+
+(define (test-bayes-query) 
+	(set 'Lex:F '(0 0))
+	(set 'Lex:B '(0 0))
+	(set 'Lex:total '(0 0))
+	true)
+
+(define (test-begin )
+  (begin 
+   (set 'x 0) 
+   (inc 'x) 
+   (inc 'x) 
+   (= x 2)))
+
+(define (test-beta )
+  (< (abs (sub (beta 1 2) 0.5)) 1e-05))
+
+(define (test-betai )
+  (< (abs (sub (betai 0.5 5 10) 0.910217)) 1e-05))
+
+(define (test-bind)
+	(bind '((a 1) (b "hello") (c (3 4))))
+	(and
+		(= a 1)
+		(= b "hello")
+		(= c '(3 4)))
+)
+
+(define (test-binomial )
+  (< (sub (binomial 2 1 0.5) 0.5) 1e-09))
+
+(define (test-break )
+  (break true)
+  (= true (break))
+  (not (break nil)))
+
+(define (test-case )
+  (and (= (check-case 1) "one") (= (check-case 2) "two") (= (check-case 
+     9) nil)))
+
+(define (test-callback) true)
+
+(define (test-catch )
+  (and 
+	(catch (+ 3 4) 'result) 
+        (= result 7)
+	(= (catch (+ 3 4)) 7)
+        (= (catch (dotimes (x 100) (if (= x 7) (throw x)))) 7)
+))
+
+(define (test-ceil )
+  (= 2 (ceil 1.5)))
+
+(define (test-change-dir )
+  (make-dir "adir")
+  (change-dir "adir")
+  (change-dir "..")
+  (remove-dir "adir"))
+
+(define (test-char )
+  (and 
+    (= (format "%c" (char "a" 0)) "a") 
+    (= (char "A") 65) (= (char 65) "A")
+    (= (map char (sequence 65 67)) '("A" "B" "C"))
+    (= (char 0) "\000")))
+
+(define (test-chop )
+  (and 
+    (= (chop "newlisp") "newlis") 
+    (= (chop "newlisp" 4) "new"))
+	(= (chop "abc" 5) "")
+	(= (chop "abc" -5) "")
+    (= (chop '(a b (c d) e)) '(a b (c d)))
+    (= (chop '(a b (c d) e) 2) '(a b)))
+
+(define (test-clean ) 
+  (and
+    (= (clean integer? '(1 1.1 2 2.2 3 3.3)) '(1.1 2.2 3.3))
+    (= (clean true? '(a nil b nil c nil)) '(nil nil nil))))
+
+(define (test-close , fno)
+  (and 
+    (set 'fno (open "qa-dot" "read")) 
+    (close fno)))
+
+(define (test-crc32)
+    (= (crc32 "abcdefghijklmnopqrstuvwxyz") 1277644989))
+
+(define (test-select-collect )
+  (and
+    (set 'l '(0 1 2 3 4 5 6 7 8 9))
+    (= (select l '()) '())
+    (= (select l 0 9 9 0 1 8 8 1) '(0 9 9 0 1 8 8 1)) 
+    (= (select "2001-09-20" 5 6 8 9 0 1 2 3) "09202001") 
+    (set 'a 0 'b 1 'c 2)
+    (= (select '(w x y z) a b c) '(w x y))
+    (= (select '(w x y z) (inc 'a) (inc 'b) (inc 'c)) '(x y z))
+))
+
+(define (test-command-line )
+  (and (not (command-line nil)) (command-line true)))
+
+(define (test-cond )
+  (and 
+      (= (check-cond 1) 1)
+      (= (check-cond 2) 2)
+      (not (check-cond 99)) 
+      (= (cond ((+ 3 4))) 7)
+      (= (cond (nil 1) ('())) '())
+      (= (cond (nil 1) (nil)) nil)
+      (= (cond (nil 1) (true nil)) nil)
+      (= (cond ('())) '())
+      (= (cond (nil 1) ('() 2)) '())
+))
+
+(define (test-cons )
+  (= (myappend '(1 2 3) '(4 5 6)) '(1 2 3 4 5 6))
+  (= (cons 'c '(a b) -1) '(a b c))
+)
+
+(define (test-constant )
+  (constant 'cs 123)
+  (= cs 123)
+  (define (trick z) (constant 'z 999))
+  (= (trick) 999)
+  (= (set 'z 123) 123)
+  (= (trick) 999)
+  (= z 123))
+
+
+(define (test-context )
+  (and (context 'TEST) (context 'QA)))
+
+(define (test-context? )
+  (and (context? MAIN) (context? QA)))
+
+(define (test-copy-file ) 
+  (and (copy-file "qa-dot" "junk") (delete-file "junk")))
+
+(define (test-cos )
+  (= 1 (cos (acos (cos (acos 1))))))
+
+(define (test-cosh)
+	(= (cosh 1) (div (add (exp 1) (exp -1)) 2)))
+
+(define (test-count )
+  (and (= (count '(1 2) '(2 1 2 1)) '(2 2)) 
+       (= (count '(a b) '(a a b c a b b)) '(3 3))
+       (= (count '(a b c) '()) '(0 0 0))
+       (set 'L '(a b c d e f))
+       (= (count L L) '(1 1 1 1 1 1))
+  )
+)
+
+(define (test-cpymem)  
+  (set 'from "12345")
+  (set 'to "     ")
+  (cpymem (address from) (address to) 5)
+  (= from to))
+
+(define (test-crit-chi2 )
+  (< (abs (sub (crit-chi2 0.559506 10) 9.999991)) 1e-05))
+
+(define (test-crit-z )
+  (< (abs (sub (crit-z 0.999) 3.090232)) 1e-05))
+
+(define (test-current-line , handle)
+  (and
+    (set 'handle (open "qa-dot" "r"))
+    (= (read-line handle) "#!/usr/bin/newlisp") 
+    (= (current-line) "#!/usr/bin/newlisp") 
+    (close handle)))
+
+(define (test-curry)
+  (and
+    (= (set 'f (curry + 10)) (lambda (_x) (+ 10 _x)))
+    (= (filter (curry match '(a *)) '((a 10) (b 5) (a 3) (c 8) (a 9)))
+       '((a 10) (a 3) (a 9)))
+    (= (clean (curry match '(a *)) '((a 10) (b 5) (a 3) (c 8) (a 9)))
+       '((b 5) (c 8)))
+    (= (map (curry list 'x) (sequence 1 5))
+       '((x 1) (x 2) (x 3) (x 4) (x 5)))
+))
+
+(define (test-date )
+  (= (date) (date (date-value)) (date (apply date-value (now)))))
+
+(define (test-date-value )
+  (= 0 (date-value 1970 1 1 0 0 0)))
+
+(define (test-debug )
+  (= (debug (+ 3 4)) 7))
+
+(define (test-dec , x)
+  (set 'x 20)
+  (and (= 19 (dec 'x)) (= 17 (dec 'x 2)) (= 16.5 (dec 'x 0.5))))
+
+(define (test-define , foo)
+  (and 
+	(lambda? (define (foo (x 1) (y 2)) (list x y)))
+    (= (foo) '(1 2))
+	(= (foo 3) '(3 2))
+	(= (foo 3 4) '(3 4))
+	(define (foo (x 10) (y (div x 2))) (list x y))
+	(= (foo) '(10 5))
+	(= (foo 20) '(20 10))
+	(= (foo 3 4) '(3 4))
+))
+
+(define (test-def-new)
+  (and
+    (set 'fooctx:x 123)
+    (new fooctx)
+    (= fooctx:x 123)
+    (set 'barctx:bar 999)
+    (def-new 'barctx:bar)
+    (= bar 999)
+    (def-new 'barctx:bar 'foobar)
+    (= foobar 999)
+    (def-new 'barctx:bar 'foofoo:foo)
+    (= foofoo:foo 999)
+))
+
+
+(define (test-define-macro , foo)
+  (and 
+	(macro? (define-macro (foo (x 1) (y 2)) (list x y)))
+    (= (foo) '(1 2))
+	(= (foo 3) '(3 2))
+	(= (foo 3 4) '(3 4))
+	(define-macro (foo (x 10) (y (div x 2))) (list x y))
+	(= (foo) '(10 5))
+	(= (foo 20) '(20 10))
+	(= (foo 3 4) '(3 4))
+))
+
+(define (test-default)
+	(MAIN:test-default-functor))
+
+(define (test-delete )
+  (delete 'xxx))
+
+(define (test-delete-file ) 
+  (and (copy-file "qa-dot" "junk") (delete-file "junk")))
+
+(define (test-delete-url )
+  (= "ERR: bad formed URL" (delete-url "")))
+
+(define (test-destroy)
+ 	(if (or (< opsys 5)(= opsys 9))
+		(set 'pid (fork (dotimes (t 100) (sleep 100))))
+		(set 'pid (process "newlisp"))	)
+	(destroy pid))
+
+(define (test-det) 
+  (set 'A '((-1 1 1) (1 4 -5) (1 -2 0)))
+  (<  (sub (det A) -1) 2e-10))
+
+(define (test-device , fno)
+  (set 'fno (open "junk" "write"))
+  (device fno)
+  (if (= (device) fno) 
+   (close (device))))
+
+(define (test-difference )
+  (and
+    (= (difference '(2 5 6 0 3 0 2 5) '(1 2 3 3 2 1)) '(5 6 0))
+    (= (difference '(1 5 2 3 2 2 4 5 3 4 5 1) '(3 4) true) '(1 5 2 2 2 5 5 1))
+    (= (difference '(nil nil nil) '()) '(nil))
+    (= (difference '(nil nil nil) '() true) '(nil nil nil))
+    (set 'L '(a b c d e f))
+    (= (difference L L) '())
+  )
+)
+
+(define (test-directory )
+  (or (find "qa-dot" (directory)) (find "QA" (directory))))
+
+(define (test-directory? )
+  (directory? "."))
+
+(define (test-div )
+  (and (= 0.1 (div 100000000 1000000000)) 
+       (= (div 1 3) 0.3333333333333333)
+       (= (div 3) 0.3333333333333333)
+))
+
+(define (testdoargs)
+	(local (lst)
+		(doargs (i) (push i lst))
+		lst))
+
+(define (test-doargs)
+	(= (testdoargs 3 2 1) '(1 2 3)))
+
+(define (test-dolist , rList)
+  (and 
+   (dolist (x '(1 2 3 4 5 6 7 8 9)) 
+    (push x rList)) 
+   (= rList '(9 8 7 6 5 4 3 2 1)) 
+   (dolist (x rList) 
+    (pop rList))
+    (dolist (x '(1 2 3 4 5 6 7 8 9) (> x 5))
+	  (push x rList))
+   (= rList '(5 4 3 2 1))
+   (= (local (l) (dolist (e '(1 2 3)) (push $idx l)) l) '(2 1 0))
+   (= (dolist (x '(a b c d e f g)) x) 'g)
+))
+
+(define (test-dostring)
+	(local (r) 
+		(dostring (i "newlisp" (= i 108)) (push  i r)) 
+		(= r '(119 101 110))
+		(= (dostring (c "newlisp") c) 112)
+ 	)
+)
+
+(define (test-dotimes , aList)
+  (dotimes (x 2) 
+   (dotimes (y 2) 
+    (dotimes (z 2) 
+     (push z aList))))
+  (and
+     (= '(1 0 1 0 1 0 1 0) aList)
+     (not (dotimes (x 0) x))
+     (= (dotimes (x 1) x) 0)
+
+     ; dotimes returns nil when ever executed since 8.9.7
+     (not (= (dotimes (x -1) x) 0))
+     (not (= (dotimes (x -1.8) x) 0))
+
+     (= (dotimes (x 1.8) x) 0)
+	 (set 'cnt 0)
+	 (dotimes (x 10 (> x 5)) (inc 'cnt))
+	 (= cnt 6)
+
+))
+     
+(define (test-dotree )
+  (set 'aList '())
+  (and
+    (= (last (symbols MAIN)) (dotree (p MAIN) p))
+  	(dotree (x 'MAIN) 
+   		(push x aList))
+  	(= (length (symbols 'MAIN)) (length aList))
+))
+
+(define (test-dump )
+  ( = "hello" (get-string (last (dump "hello")))))
+
+(define (test-dump-symbol )
+  (= (length (dump nil) 4)))
+
+(define (test-dup)
+  (and
+    (= (dup "" 0) "")
+    (= (dup "" 10) "")
+    (= (dup "A" 10) "AAAAAAAAAA")
+    (= (dup "AB" 5) "ABABABABAB")
+    (= (dup 'x 5) '(x x x x x))
+	(= (dup "l" -1) "")
+	(= (dup '(1) -1) '())
+    (= (dup 1 0) '())
+    (= (dup 1 5) '(1 1 1 1 1))))
+
+(define (test-empty? , aList)
+  (set 'aList '(1 2 3 4 5 6 7 8 9 0))
+  (while aList 
+   (pop aList))
+  (and (empty? aList) (empty? "")))
+
+(define (test-encrypt )
+  (= (encrypt (encrypt "newlisp" "123") "123") "newlisp"))
+
+(define (test-ends-with )
+  (and 
+	(ends-with "newlisp" "lisp") 
+	(ends-with "newlisp" "LISP" nil) 
+	(ends-with "abc.def.ghi" "def|ghi" 1)
+	(ends-with "12345" "4|5" 1)
+    (ends-with (explode "newlisp") "p")))
+
+(define (test-env)
+  (and 
+    (list? (env))
+    (env "key" "value") 
+    (= (env "key") "value")
+	(env "key" "") ; remove key
+	(if (= ostype "Solaris")
+		(= (env "key" ""))
+		(not (env "key")))
+))
+
+(define (test-erf)
+   (<  (abs (sub 0.5204998778 (erf 0.5))) 0.000001))
+
+(define (alarm) (println "ring..."))
+
+(define (test-timer)
+        (timer 'alarm 4))
+
+(define (test-title-case)
+	(= (title-case "heLLo") "HeLLo")
+	(= (title-case "heLLo" true) "Hello"))
+
+(define (test-throw-error)
+    (and
+        (not (catch (throw-error "message text") 'result))
+        (starts-with result "user error :")) )
+
+
+(define (test-error-event )
+  (= 'nil (error-event)))
+
+(define (test-error-number )
+  (integer? (error-number)))
+
+(define (test-error-text )
+  (= (error-text 24) "invalid function"))
+
+(define (test-eval , x y)
+  (set 'x 123)
+  (set 'y 'x)
+  (set 'z 'y)
+  (and (= 123 (eval y)) (= 123 (eval 'x)) (= 123 (eval (eval z)))))
+
+(define (test-eval-string )
+  (eval-string "(set 'x 123)")
+  (eval-string "(set 'y x)")
+  (and (= 123 (eval-string "y")))
+  (= 123 (eval-string "(blah-blah)" 123))
+  (set 'Foo:xyz 99999)
+  (= 99999 (eval-string "xyz" nil 'Foo))
+)
+
+(define (test-exec )
+  (and (sub-read-exec) (sub-write-exec)))
+
+(define (sub-read-exec ) 
+   (write-file "exectest" {(println "hello") (exit)})
+   (and
+     (set 'result  (if (and (> opsys 5) (< opsys 9))
+     (exec "newlisp exectest") (exec "./newlisp exectest")))
+     (or (= '("hello") result) (= '("" "hello") result)) 
+     (delete-file "exectest")))
+
+(define (sub-write-exec )
+  (and 
+    (write-file "testexec" {(write-file "exectest" (read-line))})
+    (if (and (> opsys 5) (< opsys 9))
+	 (exec "newlisp testexec" "HELLO") (exec "./newlisp testexec" "HELLO"))
+    (= "HELLO" (read-file "exectest"))
+    (delete-file "testexec")
+    (delete-file "exectest")))
+
+
+(define (test-exit )
+  (or (primitive? exit) (lambda? exit)))
+
+(define (test-exists)
+  (and
+    (= (exists string? '(2 3 4 6 "hello" 7)) "hello")
+    (not (exists string? '(3 4 2 -7 3 0)) )
+    (= (exists zero? '(3 4 2 -7 3 0)) 0)
+    (= (exists < '(3 4 2 -7 3 0)) -7)
+    (= (exists (fn (x) (> x 3)) '(3 4 2 -7 3 0)) 4)
+    (not (exists (fn (x) (= x 10)) '(3 4 2 -7 3 0)))
+))
+
+(define (test-exp )
+  (= 1 (exp (log (exp (log (exp (log 1))))))))
+
+(define (test-expand) 
+  (and
+    (set 'x 2)
+    (= (expand '(a x b) 'x) '(a 2 b))
+    (= (expand '(x b) 'x) '(2 b))
+    (= (expand '(a x) 'x) '(a 2))
+    (= (expand '(a (x) b) 'x) '(a (2) b))
+    (= (expand '(a ((x)) b) 'x) '(a ((2)) b))
+    (set 'a 1 'b 2 'c 3)
+    (= (expand '(a b c) 'b 'a 'c ) '(1 2 3))
+	;; prolog mode with uppercase vars
+	(set 'X 2)
+	(= (expand '(a ((X)) b)) '(a ((2)) b))
+	;; env list as parameter
+	(set 'a "a" 'B "B" 'c "c" 'd "d")
+	(= (expand '(a (B (c) (d a B))) '((a 1) (B 2) (c 3) (d 4)))
+	   '(1 (2 (3) (4 1 2))))
+	(= a "a") (= B "B") (= c "c") (= d "d")
+))
+
+(define (test-explode )
+	(and	
+		(= (explode "kakak" -1) '())
+		(= (explode "ABC" 4) '("ABC"))
+		(= (explode '(a b c d e f) -1) '())
+		(= (explode "new") '("n" "e" "w"))
+		(= (explode "newlisp" 3) '("new" "lis" "p"))
+		(= (explode "newlisp" 3 true) '("new" "lis"))
+		(= (explode "newlisp" 7 true) '("newlisp"))
+		(= (explode "newlisp" 8 true) '())
+		(= (explode '(a b c d e)) '((a) (b) (c) (d) (e)))
+		(= (explode '(a b c d e) 2) '((a b) (c d) (e)))
+		(= (explode '(n e w l i s p)) '((n) (e) (w) (l) (i) (s) (p)))
+		(= (explode '(n e w l i s p) 3) '((n e w) (l i s) (p)))
+		(= (explode '(n e w l i s p) 7 true) '((n e w l i s p)))
+        (= (explode '(n e w l i s p) 8 true) '())
+))
+
+(define (test-factor)
+	(= (apply * (factor 0x7FFFFFFFFFFFFFFF)) 0x7FFFFFFFFFFFFFFF))
+
+(define (test-fft )
+  (= '((1 2) (3 4)) (ifft (fft '((1 2) (3 4))))))
+
+(define (test-file-info )
+  (list? (file-info "qa-dot")))
+
+(define (test-file? )
+  (file? "qa-dot"))
+
+(define (test-filter )
+  (and
+    (= (filter integer? '(1 1.1 2 2.2 3 3.3)) '(1 2 3))
+    (= (filter true? '(a nil b nil c nil)) '(a b c))))
+
+(define (test-find )
+  (and 
+    (= 3 (find '(3 4) '(0 1 2 (3 4) 5 6 7 8)))
+    (= nil (find 9 '(1 2 3))) 
+    (= 2 (find "W" "newlisp" 1))
+    (= $0 "w")
+    (= (find "newlisp" '("Perl" "Python" "newLISP") 1) 2)
+    ; use a comparison functor
+    (= (find '(1 2) '((1 4) 5 6 (1 2) (8 9))) 3)
+    (= (find 3 '(8 4 3  7 2 6) >)  4)
+    (= (find 5 '((l 3) (k 5) (a 10) (z 22)) (fn (x y) (= x (last y)))) 1)
+    (= (find '(a ?) '((l 3) (k 5) (a 10) (z 22)) match) 2)
+    (= (find '(X X) '((a b) (c d) (e e) (f g)) unify) 2)
+    (define (has-it-as-last x y) (= x (last y)))
+    (= (find 22 '((l 3) (k 5) (a 10) (z 22)) has-it-as-last) 3)
+    (= (find "newlisp" '("Perl" "Python" "newLISP") (fn (x y) (regex x y 1))) 2)
+))
+
+(define (test-find-all)
+  (and
+	(= (find-all {\d+} "asdf2kjh44hgfhgf890") '("2" "44" "890"))
+	(= (find-all {(new)(lisp)} "newLISPisNEWLISP" (append $2 $1) 1) '("LISPnew" "LISPNEW"))
+))
+
+(define (test-first )
+  (= 1 (first '(1 2 3 4)))
+  (= "n" (first "ewLISP"))
+  (= (array 2 '(1 2)) (first (array 3 2 (sequence 1 6))))
+)
+
+(define (test-flat )
+  (set 'lst '(a (b (c d))))
+  (= (map (fn (x) (ref x lst)) (flat lst)) '((0) (1 0) (1 1 0) (1 1 1))))
+
+(define (test-float )
+  (float? (float "1.234")))
+
+(define (test-flt)
+	(= (flt 1.23) 1067282596))
+
+(define (test-float? )
+  (float? 1.234))
+
+(define (test-floor )
+  (= 1 (floor 1.5)))
+
+(define (test-for , x lst1 lst2)
+  (set 'lst1 '())
+  (set 'lst2 '())
+  (for (x 10 0 3) 
+   (push x lst1))
+  (for (x 10 0 3 (< x 7))
+   (push x lst2))
+  (and
+   (= lst1 '(1 4 7 10))
+   (= lst2 '(7 10)) )
+)
+
+(define (test-for-all)
+  (and
+    (for-all number? '(2 3 4 6 7)) 
+    (not (for-all number? '(2 3 4 6 "hello" 7)) )
+    (for-all (fn (x) (= x 10)) '(10 10 10 10 10))
+))
+
+
+(define (test-fork) (integer? (fork (exit))))
+
+(define (test-format )
+  (and
+   (= (format "%d" 1.23) "1") 
+   (= (format "%5.2f" 10) "10.00") 
+   (= (format "%c %s %d %g" 65 "hello" 123 1.23) "A hello 123 1.23")
+   (= (format "%5.2s" "hello") "   he")
+   ; args passed in a list
+   (= (format "%d" '(1.23)) "1")  
+   (= (format "%5.2f" '(10)) "10.00")  
+   (= (format "%c %s %d %g" '(65 "hello" 123 1.23)) "A hello 123 1.23")
+   (= (format "%5.2s" '("hello")) "   he")
+   (set 'data '((1 "a001" "g") (2 "a101" "c") (3 "c220" "g")))
+   (set 'result (map (fn (x) (format "%3.2f %5s %2s" (nth 0 x) (nth 1 x) (nth 2 x))) data))
+   (set 'result (map (fn (x) (format "%3.2f %5s %2s" (x 0) (x 1) (x 2))) data))
+   (= result '("1.00  a001  g" "2.00  a101  c" "3.00  c220  g"))
+   (not (catch (format "%%" 1) 'result))
+   (not (catch (format "%10.2lf" 123) 'result))
+   (if (and (> opsys 5) (< opsys 9) (!= opsys 7)) ;; Win32 
+      (begin
+        (and
+         (= (format "%I64d" 0x7fffffffffffffff) "9223372036854775807")
+         (= (format "%I64x" 0x7fffffffffffffff) "7fffffffffffffff")
+         (= (format "%I64u" 0x7fffffffffffffff) "9223372036854775807")
+         (= (format "%I64d" 0x8000000000000000) "-9223372036854775808")
+         (= (format "%I64x" 0x8000000000000000) "8000000000000000")
+         (= (format "%I64u" 0x8000000000000000) "9223372036854775808")
+         (= (format "%I64d" 0xFFFFFFFFFFFFFFFF) "-1")
+         (= (format "%I64x" 0xFFFFFFFFFFFFFFFF) "ffffffffffffffff")
+         (= (format "%I64u" 0xFFFFFFFFFFFFFFFF) "18446744073709551615"))
+      )
+      (begin ;; UNIX like OS 
+        (if (= opsys 9) ;TRU64
+          (begin
+            (and
+              (= (format "%d" 0x7fffffff) "2147483647")
+              (= (format "%d" 0xffffffff) "-1")
+              (= (format "%u" 0xffffffff) "4294967295")
+              (= (format "%i" 0x7fffffff) "2147483647")
+
+              ; truncate
+              (= (format "%d" 0x7fffffffffffffff) "-1")
+              (= (format "%u" 0x7fffffffffffffff) "4294967295")
+              (= (format "%x" 0x7fffffffffffffff) "ffffffff") 
+              (= (format "%X" 0x7fffffffffffffff) "FFFFFFFF") 
+
+              (= (format "%ld" 0x7fffffffffffffff) "9223372036854775807")
+              (= (format "%lu" 0xffffffffffffffff) "18446744073709551615")
+              (= (format "%li" 0x7fffffffffffffff) "9223372036854775807")
+              (= (format "%lx" 0x7fffffffffffffff) "7fffffffffffffff")
+              (= (format "%ld" 0x8000000000000000) "-9223372036854775808")
+              (= (format "%lx" 0x8000000000000000) "8000000000000000")
+              (= (format "%lu" 0x8000000000000000) "9223372036854775808")
+              (= (format "%ld" 0xFFFFFFFFFFFFFFFF) "-1")
+              (= (format "%lx" 0xFFFFFFFFFFFFFFFF) "ffffffffffffffff")
+              (= (format "%lu" 0xFFFFFFFFFFFFFFFF) "18446744073709551615"))
+          )
+          (begin
+            (and
+              (= (format "%d" 0x7fffffff) "2147483647")
+              (= (format "%d" 0xffffffff) "-1")
+              (= (format "%u" 0xffffffff) "4294967295")
+
+              ; truncate
+              (= (format "%d" 0x7fffffffffffffff) "-1")
+              (= (format "%u" 0x7fffffffffffffff) "4294967295")
+              (= (format "%x" 0x7fffffffffffffff) "ffffffff") 
+              (= (format "%X" 0x7fffffffffffffff) "FFFFFFFF") 
+
+              (= (format "%lld" 0x7fffffffffffffff) "9223372036854775807")
+              (= (format "%llx" 0x7fffffffffffffff) "7fffffffffffffff")
+              (= (format "%llu" 0x7fffffffffffffff) "9223372036854775807")
+              (= (format "%lld" 0x8000000000000000) "-9223372036854775808")
+              (= (format "%llx" 0x8000000000000000) "8000000000000000")
+              (= (format "%llu" 0x8000000000000000) "9223372036854775808")
+              (= (format "%lld" 0xFFFFFFFFFFFFFFFF) "-1")
+              (= (format "%llx" 0xFFFFFFFFFFFFFFFF) "ffffffffffffffff")
+              (= (format "%llu" 0xFFFFFFFFFFFFFFFF) "18446744073709551615"))
+          )
+      )
+))))
+
+(define (test-fv )
+  (< (sub (fv 0.1 10 1000 0 0) -15937.4246) 1e-05))
+
+(define (test-gammai )
+  (< (abs (sub (gammai 4 5) 0.734974)) 1e-05))
+
+(define (test-gammaln )
+  (< (abs (sub 120 (exp (gammaln 6)))) 1e-05))
+
+(define (test-gcd)
+ (and
+  (= (gcd 0) 0)
+  (= (gcd 1) 1)
+  (= (gcd 12 36) 12)
+  (= (gcd 12 36 6) 6)
+  (= (gcd 12 36 6 3) 3)
+))
+
+(define (test-get-char )
+  (= 65 (get-char (address "A"))))
+
+(define (test-get-float )
+  (= 1.234 (get-float (pack "lf" 1.234))))
+
+(define (test-get-int )
+  (and
+    (= 123456789 (get-int (pack "ld" 123456789)))
+    (set 'adr (pack "ldld" 0xaabbccdd 0xccddeeff))
+    (= (format "%x" (get-int adr)) "aabbccdd")
+    (= (format "%x" (get-int (address adr))) "aabbccdd")
+    (= (format "%x" (get-int (+ (address adr) 0))) "aabbccdd")
+    (= (format "%x" (get-int (+ (address adr) 4))) "ccddeeff")
+    (set 'adr (pack "> ldld" 0xaabbccdd 0xccddeeff))
+    (= adr "\170\187\204\221\204\221\238\255")
+    (set 'adr (pack "< ldld" 0xaabbccdd 0xccddeeff))
+    (= adr "\221\204\187\170\255\238\221\204")
+    (set 'buff (pack "lulululululululu" 1 2 3 4))
+    (apply and (map (fn (i) (= (+ i 1) (get-int (+ (* i 4) (address buff))))) '(0 1 2 3))) 
+))
+
+(define (test-get-long)
+	(set 'adr (pack "Ld" -1))
+	(= -1 (get-long adr)))
+
+(define (test-get-string )
+  (= "hello" (get-string (address "hello"))))
+
+(define (test-get-url )
+  (= "ERR: bad formed URL" (get-url "")))
+
+
+(define (test-global)
+	(= global-myvar 123))
+
+(define (test-global?)
+	(and
+		(global? 'global-myvar)
+		(global? 'println)
+))
+
+(define (test-if )
+  (and 
+   (if true true) 
+   (if nil nil true) 
+   (if 'nil nil true) 
+   (if '() nil true)
+   (= (if '()) '())
+   (= (if nil 1 '() 2) '())
+   (= (if nil '() '()) '())
+   (= (if true '() '()) '())
+   (= (if nil 1 nil 2 nil 3 true 4 3) 4)
+   (= (if nil 1 nil 2 nil 3 nil 4 3) 3)
+   ))
+
+(define (test-ifft )
+  (= '((1 2) (3 4)) (ifft (fft '((1 2) (3 4))))))
+
+(define (test-import )
+  (primitive? import))
+
+(define (test-inc , x)
+  (set 'x 1)
+  (and (= 2 (inc 'x)) (= 2.1 (inc 'x 0.1))))
+
+(define (test-index )
+  (= '(1 3) (index (lambda (x) (> x 3)) '(1 5 2 6 2 0))))
+
+(define (test-integer )
+  (and 
+    (integer? (int "12345"))
+    (= (int " 12345") 12345)
+    (= (int "9223372036854775807")  9223372036854775807)
+    (= (int "-9223372036854775808") -9223372036854775808)
+    (= (int 0.0) 0)
+    (= (int 1e30)  9223372036854775807)
+    (= (int -1e30) -9223372036854775808)
+    (= (int 0x8000000000000000) (int "0x8000000000000000"))
+))
+
+(define (test-int) (test-integer))
+
+(define (test-integer? )
+  (and
+    (integer? 12345)
+    (integer? 9223372036854775807)
+    (integer? -9223372036854775808)
+    (integer? 0x7FFFFFFFFFFFFFFF)
+    (integer? 0xFFFFFFFFFFFFFFFF)
+))
+
+(define (test-intersect )
+  (and
+    (= (intersect '(3 0 2 4 1) '(1 4 2 5)) '(2 4 1))
+    (set 'L '(a b c d e f))
+    (= (intersect L L) L)
+  )
+)
+
+(define (test-invert )
+  (set 'A '((-1 1 1) (1 4 -5) (1 -2 0)))
+  (set 'I (multiply A (invert A)))
+  (set 'J (multiply (array 3 3 (flat A)) (invert (array 3 3 (flat A)))))
+  (and (< (sub 1 (nth 0 (nth 0 I))) 1e-06)
+       (< (sub 1 (nth 1 (nth 1 I))) 1e-06) 
+       (< (sub 1 (nth 2 (nth 2 I))) 1e-06)
+       (= I (array-list J)) 
+       (not (invert '((0 1 0) (1 0 1) (0 0 0))) )
+))
+
+(define (test-irr )
+  (< (abs (sub (irr '(-1000 500 400 300 200 100)) 0.20272)) 0.0001))
+
+(define (test-join )
+  (and 
+    (= "this is a sentence" (join '("this" "is" "a" "sentence") " ")) 
+    (= "this_is_a_sentence" (join '("this_" "is_" "a_" "sentence")))
+    (= "" (join '()))
+	(= (join '("A" "B" "C") "-") "A-B-C")
+	(= (join '("A" "B" "C") "-" true) "A-B-C-")
+))
+
+(define (test-lambda? )
+  (lambda? qa))
+
+(define (test-last )
+  (= 'f (last '(a b c d e f)))
+  (= "p" (last "newlisp"))
+  (= (array 2 '(5 6)) (last (array 3 2 (sequence 1 6))))
+)
+
+(define (test-legal?)
+  (and
+    (legal? "abc")
+    (not (legal? "a b c"))
+    (set 'greek (pack "cccccccccccccccccc" 206 160 206 181 206 187 206 181 206 185 206
+				172 206 180 206 181 207 137))
+    (legal? greek)
+))
+
+
+(define (test-length )
+  (> (length (symbols)) 100)
+  (- 7 (length "newlisp")))
+
+(define (test-let )
+  (set 'a 123)
+  (set 'b 456)
+  (set 'p 111)
+  (set 'q 222)
+  (and
+     (let ((a 1) (b 2)) 
+       (= (+ a b) 3))
+     (= a 123) 
+     (= b 456)
+     (let (p 3 q 4)
+       (= (+ q p) 7))
+     (= p 111)
+     (= q 222)
+))
+
+(define (test-letex)
+  (and
+	(= (letex (x '* y 3 z 4) (x y z)) 12)
+	(= (letex (x 1 y 2 z 3) (quote (x y z))) '(1 2 3))
+	(= (letex (x 1 y 2 z 3) '(x y z)) '(1 2 3))
+	(= (letex (x 1 y 2 z 3) '('x (quote y) z)) '('1 (quote 2) 3))
+	(= (letex (x 1) 'x) 1)
+	))
+
+(define (test-letn)
+  (set 'x 0 'y 0 'z 0)
+  (and
+      (= (letn ((x 1) (y (+ x 1)) (z (+ y 1))) (list x y z)) '(1 2 3))
+      (= 0 x y z))
+)
+
+(define (test-list )
+  (and (list? (list 1 2 3 4 5)) (= '(1) (list 1)) (= '(1 nil) (list 
+     1 'nil))))
+
+(define (test-list? )
+  (and (list? '(1 2 3 4 5)) (list? '())))
+
+(define (test-load )
+  (write-file "junk" "(+ 3 4)")
+  (load "junk"))
+
+(define (test-local)
+	(set 'a 10 'b 20)
+	(and 
+		(= (local (a b) (set 'a 1 'b 2) (+ a b)) 3)
+		(= a 10)
+		(= b 20)))
+
+(define (test-set-locale) 
+  (string? (set-locale)))
+
+(define (test-log )
+  (and
+  	(= 1 (log (exp 1)))
+	(= 1 (log (exp 1) (exp 1)))
+  )
+)
+
+(define (test-lookup )
+  (and (= 3 (lookup 1 '((2 3 4) (1 2 3)))) (= 2 (lookup 1 '((2 3 
+       4) 
+      (1 2 3)) 1))))
+
+(define (test-lower-case )
+  (if (> opsys 4) 
+   (= "abcdefgq" (lower-case "ABCDEFGQ")) 
+   (= "abcdefgh" (lower-case "ABCDEFGH"))))
+
+(define (test-macro? )
+  (macro? 
+   (define-macro (foo-macro))))
+
+(define (test-main-args )
+  (and 
+     (list? (main-args))
+     (list? $main-args)
+     (= $main-args (main-args))
+     (= ($main-args 0) ((main-args) 0) (main-args 0))
+     (= ($main-args -1) ((main-args) -1))
+     (= ($main-args -1) (main-args -1))
+))
+
+(define (test-make-dir )
+  (and (make-dir "foodir") (remove-dir "foodir")))
+
+(define (test-map )
+  (and (= '(11 22 33) (map + '(10 20 30) '(1 2 3))) 
+       (= '(2 4 6) (map (lambda (x) (+ x x)) '(1 2 3)))
+))
+
+(define (test-mat)
+	(set 'A '((1 2 3) (4 5 6))) 
+	(set 'B A)
+	(and
+		(= (mat + A B) '((2 4 6) (8 10 12)))
+		(= (mat - A B) '((0 0 0) (0 0 0)))
+		(= (mat * A B) '((1 4 9) (16 25 36)))
+		(= (mat / A B) '((1 1 1) (1 1 1)))
+		(= (mat + A 2) '((3 4 5) (6 7 8)))
+		(= (mat - A 2) '((-1 0 1) (2 3 4)))
+		(= (mat * A 2) '((2 4 6) (8 10 12)))
+		(= (mat / A 2) '((0.5 1 1.5) (2 2.5 3)))
+
+		(= (mat + A 5) '((6 7 8) (9 10 11)))
+		(= (mat - A 2) '((-1 0 1) (2 3 4)))
+		(= (mat * A 3) '((3 6 9) (12 15 18)))
+		(= (mat / A 10) '((.1 .2 .3) (.4 .5 .6)))
+
+        (set 'op +)
+		(= (mat op A B) '((2 4 6) (8 10 12)))
+        (set 'op '+)
+		(= (mat op A B) '((2 4 6) (8 10 12)))
+	))
+
+(define (test-match)
+  (and 
+    (= (match '(a (b ?) d e *) '(a (b c) d e f g) true)   '(a (b c) d e (f g)) )
+    (= (match '(a (b ?) d e *) '(a (b c) d e f g) )  '(c (f g)) )
+
+    (= (match '(a * b x) '(a b c d b x e f b x) true) '(a (b c d b x e f) b x) )
+    (= (match '(a * b x) '(a b c d b x e f b x) ) '((b c d b x e f)) )
+
+
+    (= (match '(? (?) x * ? (? e)) '(a (b) x y c (d e)) true) '(a (b) x (y) c (d e)) )
+    (= (match '(? (?) x * ? (? e)) '(a (b) x y c (d e))) '(a b (y) c d) )
+
+    (= (match '(a * b) '(a x b) true) '(a (x) b) )
+    (= (match '(a * b) '(a x b)) '((x)) )
+
+
+    (= (match '(a * b) '(a b) true) '(a () b) )
+    (= (match '(a * b) '(a b)) '(()) )
+
+    (= (match '( (? ?) * ) '( (x y) ) true) '((x y) ()) )
+    (= (match '( (? ?) * ) '( (x y) )) '(x y ()) )
+    (match '(+) '(a))
+    (match '(+) '(a b))
+    (not (match '(+) '()))
+  ))
+
+
+(define (test-max )
+  (and (= 10 (max 3 6 10 8)) (= 1.2 (max 0.7 0.6 1.2))))
+
+(define (test-member )
+  (= '(3 4) (member 3 '(1 2 3 4)))
+  (= (member "LISP" "newLISP") "LISP")
+  (= (member "LI" "newLISP") "LISP")
+  (= (member "" "newLISP") "newLISP")
+  (not (member "xyz" "newLISP"))
+  (not (member "new" "this is NEWLISP" 0))
+  (= (member "new" "this is NEWLISP" 1) "NEWLISP")
+)
+
+(define (test-min )
+  (and (= 3 (min 3 6 10 8)) (= 0.6 (min 0.7 0.6 1.2))))
+
+(define (test-mod )
+  (and (< (sub (mod 10.5 3.3) 0.6) 0.0001) (< (sub (mod 10 3) 1) 0.0001)))
+
+(define (test-mul )
+  (= 1e-09 (mul 0.0001 1e-05)))
+
+(define (test-multiply )
+  (let ((A '((1 2 3) (4 5 6))) (B '((1 2) (1 2) (1 2)))) 
+    (and 
+       (= '((6 12) (15 30)) (multiply A B))
+       (= (array 2 2 (flat '((6 12) (15 30))))
+          (multiply (array 2 3 (flat A)) (array 3 2 (flat  B))))
+    )
+))
+
+(define (test-name )
+  (= "name" (name 'name)))
+
+(define (test-net-accept )
+  (and
+	(set 'net-listen-test (set 'listen (net-listen 12345)))
+	(set 'net-connect-test (set 'connect (net-connect "localhost" 12345)))
+	(set 'server (net-accept listen))
+	(set 'net-send-test (= (net-send server "hello") 5))
+	(set 'net-select-test (net-select connect "r" 100000))
+	(set 'net-peek-test (= (net-peek connect) 5))
+	(set 'net-receive-test (net-receive connect 'buff 20))
+	(= buff "hello")
+	(set 'net-sessions-test (and  
+	  (find listen (net-sessions))
+	  (find connect (net-sessions))
+	  (find server (net-sessions))))
+	(set 'net-local-test (= (net-local server) (net-peer connect)))
+	(set 'net-peer-test (= (net-local connect) (net-peer server)))
+	(set 'net-close-test (net-close connect))
+	(set 'net-close-test (net-close server))
+	(set 'net-close-test (net-close listen))
+	(not (net-error))
+))
+
+(define (test-net-close ) net-close-test)
+
+(define (test-net-connect )  net-connect-test)
+
+(define (test-net-error ) 
+	(and
+		(not (net-close 12345))
+		(list? (net-error))))
+
+(define (test-net-eval) true) ;; see special test prog
+
+(define (test-net-listen ) net-listen-test)
+
+(define (test-net-local ) net-local-test)
+
+(define (test-net-lookup )
+	(and
+		(or (= "127.0.0.1" (net-lookup "localhost")) (= "::1" (net-lookup "localhost")))
+		(or (= "localhost" (net-lookup "127.0.0.1")) (= "localhost" (net-lookup "::1")))
+	)
+)
+
+(define (test-net-peek ) net-peek-test)
+
+(define (test-net-peer ) net-peer-test)
+
+(define (test-net-ping) true) ; test manualyy as superuser
+
+(define (test-net-receive ) net-receive-test)
+
+(define (test-net-receive-from)
+  (and
+    (set 'sock (net-listen 1234 "localhost" "udp"))
+    (set 'net-send-to-test (net-send-to "localhost" 1234 "hello" sock))
+    (set 'net-select-test (net-select sock "r" 1000000) )
+    (= "hello" (first (net-receive-from sock 10)))
+    (net-close sock)))
+
+
+(define (test-net-receive-udp)
+    (write-file "udptest.lsp"
+[text]
+(map set '(in out sid) (map int (slice (main-args) 2)))
+(semaphore sid 1) ; signal parent to start
+(set 'msg (net-receive-udp in 20 2000000))
+(sleep 100)
+(if (not msg) (exit))
+(net-send-udp "localhost" out (upper-case (first msg)))
+(exit)
+[/text]
+    )
+  (and
+    (set 'sid (semaphore))
+    (if (and (> opsys 5)(< opsys 9))
+      (process (string "newlisp udptest.lsp " 10001 " " 10002 " " sid))
+      (process (string "./newlisp udptest.lsp " 10001 " " 10002 " " sid)))
+    (println "---------- testing UDP Win32 and OS/2 -------------")
+    (println "waiting ...");
+    (semaphore sid -1) ; wait for child process
+    (sleep 100)
+    (println "sending ...")
+    (net-send-udp "localhost" 10001 "hello") 
+    (println "receiving ...")
+    (set 'msg (net-receive-udp 10002 20 3000000))
+    (println "msg:" msg)
+    (or (delete-file "udptest.lsp") true)
+    (println "deleting semaphore:" (semaphore sid 0)) ; delete semaphore
+    (println "------------------------------------------")
+    (if msg (set 'net-send-udp-test (= "HELLO" (first msg)) ) )))
+
+
+(if (or (< opsys 6)(= opsys 9))
+  (define (test-net-receive-udp)
+    (fork (begin (sleep 500) (net-send-udp "localhost" 10001 "hello")))
+    (set 'net-send-udp-test (= "hello" (first (net-receive-udp 10001 10)))))
+)
+
+
+(define (test-net-select )  net-select-test)
+
+(define (test-net-send ) net-send-test)
+
+(define (test-net-send-to ) net-send-to-test)
+
+(define (test-net-send-udp ) net-send-udp-test)
+
+(define (test-net-service ) (= 21 (net-service "ftp" "tcp")))
+
+(define (test-net-sessions ) net-sessions-test)
+
+(define (test-new) 
+  (new QA 'MAIN:QA2))
+
+(define (test-nil?) 
+  (and
+    ;test symbol-nil = logic-nil in order compare of count
+	(= (count '(nil true) (map (curry < 3) '(1 2 4 5))) '(2 2))
+    (= nil (not (nil? nil)))
+    (= '(nil true) (map nil? '(a nil)))))
+
+(define (test-null?)
+	(= (map null? '(1 0 2 0.0 "hello" "" (a b c) () nil true (lambda) (fn) (lambda ())))
+	'(nil true nil true nil true nil true true nil true true nil)))
+
+(define (test-normal )
+  (and (float? (normal)) (float? (normal 10 3)) (list? (normal 10 
+     3 100))))
+
+(define (test-not )
+  (and (not (not (not '()))) (not (not (not (not (not nil))))) (not 
+    (not (not (not true)))) 
+   (= '(true true true) (map not '(nil nil nil))) 
+   (= '(nil nil nil) (map not '(true true true)))))
+
+(define (test-now )
+  (= (length (now)) 11))
+
+(define (test-nper )
+  (< (sub (nper 0.1 1000 100000 0 0) -25.15885793) 1e-08))
+
+(define (test-npv )
+  (< (sub (npv 0.1 '(-10000 3000 4200 6800)) 1188.443412) 1e-06))
+
+(define (test-nth , l) ;; see set-nth for more comprehensive testing
+	(set 'l '(0 1 2))
+	(and (= 0 (nth 0 l))
+		(= 1 (nth 1 l))
+		(= 2 (nth 2 l))
+		(= 2 (nth -1 l))
+		(= (nth 0 "lisp") "l")
+		(= (nth 1 "lisp") "i")
+		(= (nth 3 "lisp") "p")
+		(= (nth -4 "lisp") "l")
+		(= (nth 0 "") "")
+		(= (nth 1 "") "")
+		(= (nth -1 "") "")
+
+		(set 'l '(a b (c d) (e f)))
+		(= 'a (l 0))
+		(= '(c d) (l 2))
+		(= 'c (l 2 0))
+		(= 'f (l -1 -1))
+		(= 'c (l '(2 0)))
+		(= 'f (l '(-1 -1)))
+
+		(set 'myarray (array 3 2 (sequence 1 6)))
+		(= (array 2 '(3 4)) (myarray 1))
+		(= 6 (myarray -1 -1))
+
+		(= (array 2 '(3 4)) (myarray '(1)))
+		(= 6 (myarray '(-1 -1)))
+
+		(= "L" ("newLISP" 3))
+
+		(constant 'constL '((1 2 3) (a b c)))
+		(set 'aref '(1 2))
+		(= (constL 1 2) 'c)
+		(= (nth 1 2 constL) 'c)
+		(= (nth (constL 1 2)) 'c)
+		(= (nth (constL (- 2 1) (+ 1 1))) 'c)
+		(= (nth (constL '(1 2))) 'c)
+		(= (nth (constL aref)) 'c)
+		(= (nth 0 (+ 1 1) constL) 3)
+
+  ))
+
+(define (test-number?)
+    (and
+        (number? 1)
+        (number? 1.23)
+        (not (number? 'x))
+        (not (number? "abc"))
+        (not (number? '(a b c)))
+    )
+)
+
+(define (test-open )
+  (and 
+    (set 'fle (open "qa-dot" "read"))
+    (close fle)))
+
+(define (test-or )
+  (and (or (or (= 1 2) nil nil) (or nil nil nil true)) (not (or nil 
+     (= "a" "b") nil))))
+
+(define (test-pack )
+ (and
+  (= (pack "c c c" 65 66 67) "ABC")
+  (= (unpack "c c c" "ABC") '(65 66 67))
+  (set 's (pack "c d u" 10 12345 56789))
+  (= (unpack "c d u" s) '(10 12345 56789))
+  (set 's (pack "s10 f" "result" 1.23))
+  (= (first (unpack "s10 f" s)) "result\000\000\000\000")
+  (< (- (last (unpack "s10 f" s)) 1.23) 0.00001)
+  (set 's (pack "s3 lf" "result" 1.23))
+  (= (first (unpack "s3 f" s)) "res")
+
+  (= (pack "ccc" 65 66 67) "ABC")
+  (= (unpack "ccc" "ABC") '(65 66 67))
+  (set 's (pack "cdu" 10 12345 56789))
+  (= (unpack "cdu" s) '(10 12345 56789))
+  (set 's (pack "s10f" "result" 1.23))
+  (= (first (unpack "s10f" s)) "result\000\000\000\000")
+  (< (- (last (unpack "s10f" s)) 1.23) 0.00001)
+  (set 's (pack "s3lf" "result" 1.23))
+  (= (first (unpack "s3f" s)) "res")
+
+  (= "\001\000" (pack "<d" 1))
+  (= "\000\001" (pack ">d" 1))
+  (= "\001\000\000\000" (pack "<ld" 1))
+  (= "\000\000\000\001" (pack ">ld" 1))
+  (= '(12345678) (unpack "ld" (pack "ld" 12345678)))
+  (= '(12345678) (unpack "<ld" (pack "<ld" 12345678)))
+  (= '(12345678) (unpack ">ld" (pack ">ld" 12345678)))
+  (= (unpack "bbbbbbbb" (pack "<lf" 1.234)) '(88 57 180 200 118 190 243 63))
+  (= (unpack "bbbbbbbb" (pack ">lf" 1.234)) '(63 243 190 118 200 180 57 88))
+  (= (format "%20.2f" (first (unpack "lf" (pack "lf" 1234567890123456)))) " 1234567890123456.00")
+))
+
+(define (test-parse )
+  (and 
+    (= 3 (length (parse "hello hi there"))) 
+    (= (parse "abcbdbe" "b") '("a" "c" "d" "e")) 
+    (= (parse "," ",") '("" ""))  
+    (= (parse "hello regular   expression 1, 2, 3" {,\s*|\s+} 0)
+       '("hello" "regular" "expression" "1" "2" "3"))))
+
+
+(define (test-parse-date)
+	(and
+		(= (parse-date "2007.1.3" "%Y.%m.%d") 1167782400)
+		(= (parse-date "January 10, 07" "%B %d, %y") 1168387200)
+))
+
+
+(define (test-peek)
+	(set 'fle (open "qa-dot" "r"))
+	(= (peek fle) (first (file-info "qa-dot")))
+	(close fle))
+
+(define (test-pipe)
+	(write-file "pipe-child.lsp" 
+[text]
+(set 'msg (read-line (int (nth 2 (main-args)))))
+(write-line (upper-case msg) (int (nth 3 (main-args))))
+(exit)
+[/text]
+	)
+	(set 'channel (pipe))
+	(set 'in (first channel))
+	(set 'out (last channel))
+	(if (and (> opsys 5) (< opsys 9))
+		(process (string "newlisp pipe-child.lsp " in " " out))
+		(process (string "./newlisp pipe-child.lsp " in " " out)))
+	(sleep 500)
+	(write-line "hello there" out)
+	(sleep 500)
+	(= (read-line in) "HELLO THERE")
+	(delete-file "pipe-child.lsp"))
+
+(if (< opsys 6)
+  (define (test-pipe)
+	(set 'channel (pipe))
+	(set 'in (first channel))
+	(set 'out (last channel))
+	(fork (write-line (upper-case (read-line in)) out))
+	(write-line "hello there" out)
+	(sleep 1000)
+	(= (read-line in) "HELLO THERE")
+	)
+)
+
+
+(define (test-pmt ) 
+  (< (sub (pmt 0.1 10 100000 0 0) -16274.53949) 1e-05))
+
+(define (test-pop , r l)
+  (set 'r '())
+  (set 'l '(1 2 3 4 5 6 7 8 9 0))
+  (dotimes (x 10) 
+   (push (pop l) r))
+  (and (= r '(0 9 8 7 6 5 4 3 2 1))
+       (set 'l '(a b (c d (x) e)))
+       (= 'x (pop l '(2 2 0)))
+       (set 'lst '(1 2 3 (4 5)()))
+       (push 'x lst -1 -1)
+       (= lst '(1 2 3 (4 5) (x)))
+       (push 'y lst -1 0)
+       (= lst '(1 2 3 (4 5) (y x)))
+       (push 'z lst -1 1)
+       (= lst '(1 2 3 (4 5) (y z x)))
+       (push 'p lst 4)
+       (= lst '(1 2 3 (4 5) p (y z x)))
+       (push 'q lst -2)
+       (= lst '(1 2 3 (4 5) p q (y z x)))
+       (push 'a lst 3 -3)
+       (= lst '(1 2 3 (a 4 5) p q (y z x)))
+       (= (pop lst 3 -3) 'a)
+       (= (pop lst -2) 'q)
+       (= (pop lst 4) 'p)
+       (= (pop lst -1 1) 'z)
+       (= (pop lst -1 0) 'y)
+       (= (pop lst -1 -1) 'x)
+       (= lst '(1 2 3 (4 5)()))
+       ; test pop string
+       (set 's "newLISP")
+       (= (pop s) "n")
+       (= s "ewLISP")
+       (= (pop s 2) "L")
+       (= s "ewISP")
+       (= (pop s -1) "P")
+       (= s "ewIS")
+       (= (pop s -2 2) "IS")
+       (= s "ew")
+       (= (pop s -2 10) "ew")
+       (= s "")
+       (set 's "123456789")
+       (= (pop s 5) "6")
+       (= (pop s 5 -1) "")
+       (= s "12345789")
+       (set 's "123456789")
+       (= (pop s 5 5) "6789")
+       (set 's "x")
+       (= (pop s) "x")
+       (= s "")
+       (= (pop s) "")
+       (= (pop s) "")	
+       (= s "")
+))
+
+(define (test-pop-assoc)
+	(and
+		(set 'L '((a (b 1) (c (d 2)))))
+		(= (pop-assoc (L 'a)) '(a (b 1) (c (d 2))))
+		(= L '())
+		(set 'L '((a (b 1) (c (d 2)))))
+		( = (pop-assoc (L 'a 'b)) '(b 1))
+		(= L '((a (c (d 2)))))
+		(set 'L '((a (b 1) (c (d 2)))))
+		(= (pop-assoc (L 'a 'c)) '(c (d 2)))
+		(= L '((a (b 1))))
+		(set 'L '((a (b 1) (c (d 2)))))
+		(= (pop-assoc (L 'a 'c 'd)) '(d 2))
+		(= L '((a (b 1) (c))))
+		(= (pop-assoc (L 'a 'c)) '(c))
+		(= L '((a (b 1))))
+		(= (pop-assoc (L 'a 'b)) '(b 1))
+		(= L '((a)))
+		(= (pop-assoc (L 'a)) '(a))
+		(= L '())
+	)
+)
+
+(define (test-post-url )
+  (= "ERR: bad formed URL" (post-url "" "abc" "def")))
+
+(define (test-pow )
+  (and
+    (= 1024 (pow 2 10))
+    (= 100 (pow 10))
+))
+
+(define (test-pretty-print)
+  (= (pretty-print) '(80 " ")))
+
+(define (test-primitive? )
+  (primitive? primitive?))
+
+(define (test-print ) 
+  (device (open "testprint" "w"))
+  (print "hello")
+  (close (device))
+  (and (= "hello" (read-file "testprint"))
+     (delete-file "testprint")))
+
+(define (test-println ) 
+  (device (open "testprintln" "w"))
+  (print "hello")
+  (close (device))
+  (and 
+     (= "hello" (slice (read-file "testprintln") 0 5))
+     (delete-file "testprintln")))
+
+(define (test-prob-chi2 )
+  (< (abs (sub (prob-chi2 10 10) 0.440493)) 1e-05))
+
+(define (test-prob-z )
+  (< (abs (sub (prob-z 0) 0.5)) 1e-05))
+
+(define (test-process ) 
+   (write-file "process test" {(write-file "test process" "hello") (exit)})
+   (if (and (> opsys 5) (< opsys 9))
+	(process {newlisp '"process test"'}) ; Win32
+    (process "./newlisp 'process test'")) ; Unix
+   (until (file? "test process") (sleep 500))
+   (sleep 200)
+   (and
+     (= "hello" (read-file "test process"))
+     (delete-file "process test")
+     (delete-file "test process")))
+
+(define (test-protected?)
+	(and
+		(protected? 'println)
+		(constant 'cval 123)
+		(protected? 'cval)
+		(protected? 'QA))
+)
+
+(define (test-push , l)
+  (dotimes (x 10) 
+   (push x l x))
+  (and 
+       (= l '(0 1 2 3 4 5 6 7 8 9))
+       (set 'l '(a b (c d () e)))
+       (push 'x l '(2 2 0))
+       (= (ref 'x l) '(2 2 0))
+       (set 'lst '(1 2 3 (4 5)()))
+       (push 'x lst -1 -1)
+       (= lst '(1 2 3 (4 5) (x)))
+       (push 'y lst -1 0)
+       (= lst '(1 2 3 (4 5) (y x)))
+       (push 'z lst -1 1)
+       (= lst '(1 2 3 (4 5) (y z x)))
+       (push 'p lst 4)
+       (= lst '(1 2 3 (4 5) p (y z x)))
+       (push 'q lst -2)
+       (= lst '(1 2 3 (4 5) p q (y z x)))
+       (push 'a lst 3 -3)
+       (= lst '(1 2 3 (a 4 5) p q (y z x)))
+       (= (pop lst 3 -3) 'a)
+       (= (pop lst -2) 'q)
+       (= (pop lst 4) 'p)
+       (= (pop lst -1 1) 'z)
+       (= (pop lst -1 0) 'y)
+       (= (pop lst -1 -1) 'x)
+       (= lst '(1 2 3 (4 5)()))
+       (test-push-pop)
+       (test-push-optimization-bug)
+       ; test string push
+       (set 's "newLISP")
+       (= (push "#" s) "#")
+       (= s "#newLISP")
+       (= (push "#" s 1) "#")
+       (= s "##newLISP")
+       (= (push "#" s 3) "#")
+       (= s "##n#ewLISP")
+       (= (push "#" s -1) "#")
+       (= s "##n#ewLISP#")
+       (= (push "#" s -3) "#")
+       (= s "##n#ewLIS#P#")
+       (= (push "xy" s) "xy")
+       (= s "xy##n#ewLIS#P#")
+       (= (push "xy" s -1) "xy")
+       (= s "xy##n#ewLIS#P#xy")
+       (set 's "")
+       (= (push "" s) "")
+       (= s "")
+       (set 's "newLISP")
+       (= (push "" s -1) "")
+       (= (push "" s) "")
+       (= s "newLISP")
+       (push "-" s 7)
+	   (= s "newLISP-")
+	   (push "-" s -9)
+	   (= s "-newLISP-")
+       (set 's "newLISP")
+       (push "-" s 8)
+	   (= s "newLISP-")
+	   (push "-" s -10)
+	   (= s "-newLISP-")
+))
+
+(define (test-push-pop)
+	(set 'lst (sequence 1 1000))
+	(dotimes (x 1000) (push (pop lst) lst -1))
+	(= lst (sequence 1 1000)))
+
+(define (test-push-optimization-bug) ; fixed in 8.7.1
+    (set 'l nil)
+    (and (push 'x l -1)
+         (set 'lst l)
+         (push 'y lst -1)
+         (= lst '(x y))))
+
+(define (test-put-url ) 
+  (= "ERR: bad formed URL" (put-url "" "abc")))
+
+(define (test-pv )
+  (< (sub (pv 0.1 10 1000 100000 0 0) -44696.89605) 1e-05))
+
+(define (test-quote )
+  (= (quote x) 'x))
+
+(define (test-quote? )
+  (quote? ''quote?))
+
+(define (test-rand , sum)
+  (set 'sum 0)
+  (dotimes (x 1000) 
+   (inc 'sum (rand 2)))
+  (and (< sum 600) (> sum 400) (list? (rand 10 100))))
+
+(define (test-random )
+  (and (float? (random)) (= (length (random 0 1 10)) 10)))
+
+(define (test-randomize)
+  (and
+    (!= '(a b c d e f g) (randomize '(a b c d e f g)))
+    (= (difference '(a b c d e f g) (randomize '(a b c d e f g))) '())
+  )
+)
+
+(define (test-read-expr)
+    (set 'code "; a statement\n(+ 3 4)\n(define (double x) (+ x x))")
+    (read-expr code (fn (x) (push x clist)) (context))
+    (= clist '((define (double x) (+ x x)) (+ 3 4)))
+)
+
+(define (test-read-buffer )
+  (and
+    (set 'file (open "qa-dot" "read"))
+    (read-buffer file 'buff (nth 0 (file-info "qa-dot")))
+    (close file)
+    (set 'file (open "junk" "write"))
+    (write-buffer file 'buff (nth 0 (file-info "qa-dot")))
+    (close file)))
+
+(define (test-read-char )
+  (and 
+    (file-copy "qa-dot" "junk")
+    (delete-file "junk")))
+
+(define (test-read-file )
+  (read-file "qa-dot"))
+
+(define (test-read-key) true)
+
+(define (test-read-line )
+  (line-count "qa-dot"))
+
+
+(define (test-real-path) 
+  (and
+	(string? (real-path))
+    (string? (real-path "."))
+ ))
+
+(define (test-ref)
+  (and 
+    (set 'pList '(a b (c d () e)))
+    (push 'x pList 2 2 0)
+    (= (ref 'x pList) '(2 2 0))
+    (= (ref '(x) pList) '(2 2))
+    (set 'v (ref '(x) pList))
+    (= (pList v) '(x))
+    (= (ref 'foo pList) '())
+    ; comparison functor
+    (= (ref 'e '(a b (c d (e) f)) =) '(2 2 0))
+    (= (ref 'e '(a b (c d (e) f)) >) '(0))
+    (= (ref 'e '(a b (c d (e) f)) <) '(2))
+    (= (ref 'e '(a b (c d (e) f)) (fn (x y) (or (= x y) (= y 'd)))) '(2 1))
+    (define (is-it-or-d x y) (or (= x y) (= y 'd)))
+    (= (ref 'e '(a b (c d (e) f)) is-it-or-d) '(2 1))
+    ; comparison with match and unify
+    (= (ref '(a ?) '((l 3) (a 12) (k 5) (a 10) (z 22)) match) '(1))
+    (= (ref '(X X) '( ((a b) (c d)) ((e e) (f g)) ) unify) '(1 0))
+    (= (ref '(X g) '( ((a b) (c d)) ((e e) (f g)) ) unify) '(1 1))
+))
+
+(define (test-ref-all) 
+  (and
+    (set 'L '(a b c (d a f (a h a)) (k a (m n a) (x))))
+    (= (ref-all 'a L) '((0) (3 1) (3 3 0) (3 3 2) (4 1) (4 2 2)))
+    (= (L '(3 1)) 'a)
+    (= (map 'L (ref-all 'a L)) '(a a a a a a))
+    ; with comparison functor
+    (= (ref-all 'a '(1 2 3 4 5 6)) '())
+    (set 'L '(a b c (d f (h l a)) (k a (m n) (x))))
+    (= (ref-all 'c L =) '((2)))
+    (= (ref-all 'c L >) '((0) (1) (3 2 2) (4 1)))
+    (= (ref-all 'a L (fn (x y) (or (= x y) (= y 'k)))) ' ((0) (3 2 2) (4 0) (4 1)))
+    (define (is-long? x y) (> (length y) 2))
+    (= (ref-all nil L is-long?) '((3) (3 2) (4)))
+    (define (is-it-or-d x y) (or (= x y) (= y 'd)))
+    (= (ref-all 'e '(a b (c d (e) f)) is-it-or-d) '((2 1) (2 2 0)))
+    (= (ref-all 'b '(a b (c d (e) f)) is-it-or-d) '((1) (2 1)))
+    (= (ref-all nil '(((()))) (fn (x y) (> (length y) 0))) '((0) (0 0)))
+    ; test comparison with match and unify
+    (= (ref-all '(a ?) '((l 3) (a 12) (k 5) (a 10) (z 22)) match) '((1) (3)))
+    (= (ref-all '(X X) '( ((a b) (c d)) ((e e) (f g)) ((z) (z))) unify) '((1 0) (2)))
+    (= (ref-all '(X g) '( ((x y z) g) ((a b) (c d)) ((e e) (f g))) unify) '((0) (2 1)))
+))
+
+
+(define (test-regex )
+  (and
+   (= (regex "http://(.*):(.*)" "http://nuevatec.com:80")
+      '("http://nuevatec.com:80" 0 22 "nuevatec.com" 7 12 "80" 20 2))
+   (= $0 "http://nuevatec.com:80")
+   (= $1 "nuevatec.com")
+   (= $2 "80")
+   (= (regex "b+" "AAAABBBAAAA" 1) '("BBB" 4 3))))
+ 
+(define (test-remove-dir )
+  (and (make-dir "junk") (remove-dir "junk")))
+
+(define (test-rename-file )
+  (copy-file "qa-dot" "junk")
+  (rename-file "junk" "junk2"))
+
+;; this can run only once than must be reloaded
+;; because some replace's are in place with a constant
+(define (test-replace ) 
+ (and
+  (not (catch (replace "a" "akakak") 'result))
+  (not (catch (replace "a") 'result))
+  (not (catch (replace) 'result))
+  (catch (replace "a" '("x" "a" "y")) 'result)
+  (= (replace "a" "ababab" "b") "bbbbbb")
+  (= $0 3) 
+  (= (replace 'a '(a a b a b a a a b a) 'b) '(b b b b b b b b b b))
+  (= (replace 'a '(a a b a b a a a b a)) '(b b b))
+  (= (replace 'a '(a)) '())
+;; with regular expressions option
+  (= (replace "" "abc" "x" 0) "xaxbxcx")
+  (= (replace "$" "abc" "x" 0) "abcx")
+  (= (replace "^" "abc" "x" 0) "xabc")
+  (= (replace "\\b" "abc" "x" 0) "xabcx")
+  (= (replace "(?<=[0-9])(?=(?:[0-9]{3})+(?![0-9]))" "1234567" "," 0) "1,234,567")
+  (= (replace "a" "ababab" (upper-case $0) 0) "AbAbAb")
+  (= $0 3) 
+  (set 'str2 "abaBab")
+  (= (replace "b|B" str2 "z" 0) "azazaz")
+  (= $0 3)
+  (replace-once "aaa")
+  (= (replace "%([0-9A-F][0-9A-F])" "%41123%42456%43" (char (int (append "0x" $1))) 1) "A123B456C")
+  ; replace with comparison functor
+  (set 'L '(1 4 22 5 6 89 2 3 24))
+  (= (replace 10 L 10 <) '(1 4 10 5 6 10 2 3 10)) 
+  (set 'L '(1 4 22 5 6 89 2 3 24))
+  (= (replace 10 L 10 (fn (x y) (< x y))) '(1 4 10 5 6 10 2 3 10))
+  ;
+  (set 'AL '((john 5 6 4) (mary 3 4 7) (bob 4 2 7 9) (jane 3)))
+  (= (replace '(mary *)  AL (list 'mary (apply + (rest $0))) match)
+    '((john 5 6 4) (mary 14) (bob 4 2 7 9) (jane 3)))
+  (set 'AL '((john 5 6 4) (mary 3 4 7) (bob 4 2 7 9) (jane 3)))
+  (= (replace '(*) AL (list ($0 0) (apply + (rest $0))) match)
+    '((john 15) (mary 14) (bob 22) (jane 3)))
+  (set 'AL '((john 5 6 4) ("mary" 3 4 7) (bob 4 2 7 9) ("jane" 3)))
+  (= (replace nil AL (cons (sym ($0 0)) (rest $0)) (fn (x y) (string? (y 0))))
+    '((john 5 6 4) (mary 3 4 7) (bob 4 2 7 9) (jane 3)))
+))
+ 
+(define (replace-once str)
+  (= (replace "a" str (upper-case $0) 0x8000) "Aaa") ;; custom option replace once
+)
+
+(define (test-replace-assoc )
+  (set 'aList '((a 1 2 3) (b 4 5 6) (c 7 8 9)))
+  (set 'bList '((a 1) (b 2) (c 3)))
+  (replace-assoc 'b aList '(b 4 5 99))
+  (replace-assoc 'c aList '(x "this works too"))
+  (and
+    (= aList '((a 1 2 3) (b 4 5 99) (x "this works too")))
+    (set 'lst '((a 1)(b 2)(c 3)))
+    (= (replace-assoc 'b lst (list 'b (+ 1 (last $0))))
+       '((a 1)(b 3)(c 3)))
+    (= (replace-assoc 'b bList) '((a 1) (c 3)))
+    (= (replace-assoc 'a bList) '((c 3)))
+    (= (replace-assoc 'c bList) '())
+  )
+)
+
+(define (test-reset )
+  true)
+
+(define (test-rest , l)
+  (set 'l '(a b c d e f g))
+  (and  (= (cons (first l) (rest l)) l)
+    (= (rest "newlisp") "ewlisp")
+;; implicit nrest
+        (= (1 l) '(b c d e f g))
+    (= (10 l) '())
+    (= (0 l) l)
+    (= (-3 '(a b c d e f g)) '(e f g))
+        (= (-3 "abcdefg") "efg")
+    (= (1 '(A)) '())
+    (= (1 "A") "")
+    (= (array 2 2 (sequence 3 6)) (rest (array 3 2 (sequence 1 6))))
+))
+
+(define (test-reverse )
+  (and
+    (= (reverse '(1 2 3)) '(3 2 1))
+    (= (reverse "newLISP") "PSILwen")))
+
+(define (test-rotate )
+  (and
+    (= '(8 9 0 1 2 3 4 5 6 7) (rotate '(0 1 2 3 4 5 6 7 8 9) 2))
+    (= '() (rotate '()))
+	(= (rotate '(1) -1) '(1))
+	(= (rotate "") "")
+	(= (rotate "x" -1) "x")
+	(set 'str "abcdefg")
+	(= (rotate str) "gabcdef")
+	(= (rotate str 3) "defgabc")
+	(= (rotate str -4) "abcdefg")
+))
+
+(define (test-round)
+	(and
+		(= (round 1.25)  (round 1.25 0) 1)
+		(= (round 3.89) (round 3.89 0) 4)
+		(= (round 123.49 2) 100)
+		(= (round 123.49 1) 120)
+		(= (round 123.49 0) 123)
+		(= (round 123.49 -1) 123.5)
+		(= (round 123.49 -2) 123.49)
+		(= (round 123.49 -3) 123.49)
+		(!= (round 123.49 -2) 123.49000000000001)
+		(= (round 123.49 3)  0)))
+
+(define (test-save )
+  (and (save "all") (save "save.lsp" 'test-save) (delete-file "all") 
+   (delete-file "save.lsp")))
+
+(define (test-search , file)
+  (and
+    (set 'file (open "qa-dot" "read"))
+    (search file "define")
+    (close file)))
+
+(define (test-seed )
+  (seed 123)
+  (set 'a (rand 10))
+  (seed 123)
+  (set 'b (rand 10))
+  (= a b))
+
+(define (test-seek , file chr)
+  (set 'file (open "junk" "write"))
+  (dotimes (x 100) 
+   (write-char file x))
+  (close file)
+  (set 'file (open "junk" "read"))
+  (seek file 65)
+  (set 'chr (read-char file))
+  (close file)
+  (delete-file "junk")
+  (= chr 65))
+
+(define (test-select )
+  (set 'l '(0 1 2 3 4 5 6 7 8 9))
+  (and
+    (test-select-collect)
+    (= (select l '(0 9 9 0 1 8 8 1)) '(0 9 9 0 1 8 8 1))
+    (= (select "2001-09-20" '(5 6 8 9 0 1 2 3)) "09202001")))
+
+;; for testing semaphores accross processes/threads see test-share
+(define (test-semaphore)
+  (and
+    (set 'sid (semaphore))
+    (if (or (< opsys 5)(= opsys 9)) (= (semaphore sid) 0) true) ;; no semaphore status on Win32
+    (semaphore sid 1)
+    (if (or (< opsys 5)(= opsys 9)) (= (semaphore sid) 1) true) ;; no semaphore status on Win32
+    (semaphore sid 0)))
+
+(define (test-sequence )
+  (= (sequence 1 10 3) '(1 4 7 10)))
+
+(define (test-series )
+  (and
+    (= (series 2 2 5) '(2 4 8 16 32))
+    (= (series 2 2 0) '())
+    (= (series 1 2 -10) '())
+    (= (series 1 1 5) '(1 1 1 1 1))
+))
+
+(define (test-set , x y z)
+  (set 'x (set 'y (set 'z 123)))
+  (= x 123))
+
+(define (test-setq , x y z)
+  (setq x 1 y 2 z 3)
+  (and (= x 1) (= y 2) (= z 3)))
+
+(define (test-set-assoc)
+ (and
+	(set 'L '((a 1) (b (c (d 2) (e 3) (e 4))) ("a" 5) ((a) 6)))	
+	(= (assoc 'a L) '(a 1))	
+	(= (assoc 'b L) '(b (c (d 2) (e 3) (e 4))))
+	(= (assoc "a" L) '("a" 5))
+	(= (assoc '(a) L) '((a) 6))
+
+	(= (assoc (L 'a)) '(a 1))
+	(= (assoc (L 'b)) '(b (c (d 2) (e 3) (e 4))))
+	(= (assoc (L "a")) '("a" 5))
+	(= (assoc (L '(a))) '((a) 6))
+
+	(= (assoc (L 'b 'c)) '(c (d 2) (e 3) (e 4)))
+	(= (assoc (L 'b 'c 'd)) '(d 2))
+	(= (assoc (L 'b 'c 'e)) '(e 3))
+
+	(= (set-assoc (L 'a) '(a 11)) 
+	'((a 11) (b (c (d 2) (e 3) (e 4))) ("a" 5) ((a) 6)))
+
+	(= (set-assoc (L 'b) '(B (C (d 2) (e 3) (e 4))))
+ 		'((a 11) (B (C (d 2) (e 3) (e 4))) ("a" 5) ((a) 6)))
+
+	(= (set-assoc (L "a") '("A" 5))
+		'((a 11) (B (C (d 2) (e 3) (e 4))) ("A" 5) ((a) 6)))
+
+	(= (set-assoc (L '(a)) '((A) 6))
+		'((a 11) (B (C (d 2) (e 3) (e 4))) ("A" 5) ((A) 6)))
+
+	(= (set-assoc (L 'B 'C) '(c (d 2) (e 3) (e 4)))
+		'((a 11) (B (c (d 2) (e 3) (e 4))) ("A" 5) ((A) 6)))
+
+	(= (set-assoc (L 'B 'c 'd) '(d 22))
+		'((a 11) (B (c (d 22) (e 3) (e 4))) ("A" 5) ((A) 6)))
+
+	(= (set-assoc (L 'B 'c 'e) '(e 33))
+		'((a 11) (B (c (d 22) (e 33) (e 4))) ("A" 5) ((A) 6)))
+
+	(= (length (set 'L (dup '(a 1) 1000))) 1000)
+	(= (push '(x 9) L -1) '(x 9))
+	(= (ref '(x *) L match) '(1000))
+	(= (assoc 'x L) '(x 9))
+	(= (assoc-set (L 'x) $0) '(x 9))
+))
+
+(define (test-set-nth-implicit) 
+  (and
+    (= (set-nth ("abcd" 0) "z") "zbcd")
+    (= (set-nth ("abcd" -1) "z") "abcz")
+    (= (set-nth ("abcd" 3) "z") "abcz")
+    (= (set-nth ("abcd" -4) "z") "zbcd")
+    (= (set-nth ("abcd" 0) "xyz") "xyzbcd")
+    (= (set-nth ("abcd" -1) "xyz") "abcxyz")
+    (= (set-nth ("abcd" 3) "xyz") "abcxyz")
+    (= (set-nth ("abcd" -4) "xyz") "xyzbcd")
+    (= (set-nth ("abcd" 1) (append $0 $0)) "abbcd")
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 0) 'new) '(new (2 3) 4))
+    (= (nth 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 1) 'new) '(1 new 4))
+    (= (nth 1 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 2) 'new) '(1 (2 3) new))
+    (= (nth 2 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 0 0) 'new) '(new (2 3) 4))
+    (= (nth 0 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 1 0) 'new) '(1 (new 3) 4))
+    (= (nth 1 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth (l 1 1) 'new) '(1 (2 new) 4))
+    (= (nth 1 1 l) 'new)
+    (set 'l '((2 3) 4))
+    (= (set-nth (l 0 0) 'new) '((new 3) 4))
+    (= (nth 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth (l 0 0 0) 'new) '((new (3 4)) (5 6)))
+    (= (nth 0 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth (l 0 0 1) 'new) '((new (3 4)) (5 6)))
+    (= (nth 0 0 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth (l 0 1 1) 'new) '((2 (3 new)) (5 6)))
+    (= (nth 0 1 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth (l 0 1) 'new) '((2 new) (5 6)))
+    (= (nth 0 1 l) 'new)
+	(set 'L '(1 2 3 4 5))
+	(= (set-nth (L 3) (+ $0 1)) '(1 2 3 5 5))
+	(set 'L '(a b c (d e f)))
+	(= (set-nth (L 3) (set-nth (L 3) 99)) '(a b c (a b c 99)))
+	(set 'L '(()))
+	(= (set-nth (L -1) 99) '(99))
+	(set 'L '((1 2 3) (a b c)))
+	(= (set 'aref (ref 'c L)) '(1 2))
+	(= (set-nth (L aref) 99) '((1 2 3) (a b 99)))
+	(set 'L '((1 2 3) (a b c)))
+	(= (set-nth 1 (+ 1 1) L 99) '((1 2 3) (a b 99)))
+	(= (set-nth (L 1 (+ 1 1)) 999) '((1 2 3) (a b 999)))	
+	(= (set-nth (L (sequence 1 10000)) '@) '((1 2 3) (a b @)))
+))
+
+(define (test-set-nth) 
+  (and
+    (= (set-nth 0 "abcd" "z") "zbcd")
+    (= (set-nth -1 "abcd" "z") "abcz")
+    (= (set-nth 3 "abcd" "z") "abcz")
+    (= (set-nth -4 "abcd" "z") "zbcd")
+    (= (set-nth 0 "abcd" "xyz") "xyzbcd")
+    (= (set-nth -1 "abcd" "xyz") "abcxyz")
+    (= (set-nth (+ 1 2) "abcd" "xyz") "abcxyz")
+    (= (set-nth -4 "abcd" "xyz") "xyzbcd")
+    (= (set-nth 1 "abcd" (append $0 $0)) "abbcd")
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth 0 l 'new) '(new (2 3) 4))
+    (= (nth 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth 1 l 'new) '(1 new 4))
+    (= (nth 1 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth 2 l 'new) '(1 (2 3) new))
+    (= (nth 2 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth 0 0 l 'new) '(new (2 3) 4))
+    (= (nth 0 0 l) 'new)
+    (set 'l '(1 (2 3) 4)) ;;;;
+    (= (set-nth 1 0 l 'new) '(1 (new 3) 4))
+    (= (nth 1 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (set-nth 1 1 l 'new) '(1 (2 new) 4))
+    (= (nth 1 1 l) 'new)
+    (set 'l '((2 3) 4))
+    (= (set-nth 0 0 l 'new) '((new 3) 4))
+    (= (nth 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth 0 0 0 l 'new) '((new (3 4)) (5 6)))
+    (= (nth 0 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth 0 0 1 l 'new) '((new (3 4)) (5 6)))
+    (= (nth 0 0 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth 0 1 1 l 'new) '((2 (3 new)) (5 6)))
+    (= (nth 0 1 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (set-nth 0 1 l 'new) '((2 new) (5 6)))
+    (= (nth 0 1 l) 'new)
+	(set 'L '(1 2 3 4 5))
+	(= (set-nth 3 L (+ $0 1)) '(1 2 3 5 5))
+	(set 'L '(a b c (d e f)))
+	(= (set-nth 3 L (set-nth 3 L 99)) '(a b c (a b c 99)))
+	(test-set-nth-implicit)
+))
+
+(define (test-nth-set-implicit)
+  (and
+    (= (nth-set ("abcd" 0) "z") "a")
+    (= (nth-set ("abcd" -1) "z") "d")
+    (= (nth-set ("abcd" 3) "z") "d")
+    (= (nth-set ("abcd" -4)"z") "a")
+    (= (nth-set ("abcd" 0) "xyz") "a")
+    (= (nth-set ("abcd" -1)"xyz") "d")
+    (= (nth-set ("abcd" 3) "xyz") "d")
+    (= (nth-set ("abcd" -4) "xyz") "a")
+    (= (nth-set ("abcd" 1) (append $0 $0)) "b")
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 0) 'new) 1)
+    (= (nth 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set  (l 1) 'new) '(2 3))
+    (= (nth 1 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 2) 'new) 4)
+    (= (nth 2 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 3) 'new) 4)
+    (= (nth 3 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 0 0) 'new) 1)
+    (= (nth 0 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 1 0) 'new) 2)
+    (= (nth 1 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set (l 1 1) 'new) 3)
+    (= (nth 1 1 l) 'new)
+    (set 'l '((2 3) 4))
+    (= (nth-set (l 0 0) 'new) 2)
+    (= (nth 0 0 l) 'new)
+    (set 'l '((2 3)))
+    (= (nth-set (l 1 1) 'new) 3)
+    (= (nth 1 1 l) 'new)
+    (set 'l '((2 3)))
+    (= (nth-set (l 2 3) 'new) 3)
+    (= (nth 2 3 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set (l 0 0 0) 'new) 2)
+    (= (nth 0 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set (l 0 0 1) 'new) 2)
+    (= (nth 0 0 1 l) 'new) ;;;
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set (l 0 1 1) 'new) 4)
+    (= (nth 0 1 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set (l 0 1) 'new) '(3 4))
+    (= (nth 0 1 l) 'new)
+	(set 'L '(a b c (d e f)))
+	(nth-set (L 3) (nth-set (L 3) 99))
+	(= L '(a b c (d e f)))
+	(set 'L '((1 2 3) (a b c)))
+	(= (set 'aref (ref 'c L)) '(1 2))
+	(= (nth-set (L aref) 99) 'c)
+))
+
+
+(define (test-nth-set) 
+  (and
+    (= (nth-set 0 "abcd" "z") "a")
+    (= (nth-set -1 "abcd" "z") "d")
+    (= (nth-set (+ 1 2) "abcd" "z") "d")
+    (= (nth-set -4 "abcd" "z") "a")
+    (= (nth-set 0 "abcd" "xyz") "a")
+    (= (nth-set -1 "abcd" "xyz") "d")
+    (= (nth-set 3 "abcd" "xyz") "d")
+    (= (nth-set -4 "abcd" "xyz") "a")
+    (= (nth-set 1 "abcd" (append $0 $0)) "b")
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 0 l 'new) 1)
+    (= (nth 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 1 l 'new) '(2 3))
+    (= (nth 1 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 2 l 'new) 4)
+    (= (nth 2 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 2 l 'new) 4)
+    (= (nth 2 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 0 0 l 'new) 1)
+    (= (nth 0 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 1 0 l 'new) 2)
+    (= (nth 1 0 l) 'new)
+    (set 'l '(1 (2 3) 4))
+    (= (nth-set 1 1 l 'new) 3)
+    (= (nth 1 1 l) 'new)
+    (set 'l '((2 3) 4))
+    (= (nth-set 0 0 l 'new) 2)
+    (= (nth 0 0 l) 'new)
+    (set 'l '((2 3)))
+    (= (nth-set 0 1 l 'new) 3)
+    (= (nth 0 1 l) 'new)
+    (set 'l '((2 3)))
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set 0 0 0 l 'new) 2)
+    (= (nth 0 0 0 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set 0 0 1 l 'new) 2)
+    (= (nth 0 0 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set 0 1 1 l 'new) 4)
+    (= (nth 0 1 1 l) 'new)
+    (set 'l '((2 (3 4))(5 6)))
+    (= (nth-set 0 1 l 'new) '(3 4))
+    (= (nth 0 1 l) 'new)
+	(set 'L '(a b c (d e f)))
+	(nth-set 3 L (nth-set 3 L 99))
+	(= L '(a b c (d e f)))
+))
+
+
+(define (test-set-ref)
+	(and
+		(set 'L '(z a b (z) (d (c c (c)) e f c))) 
+		(= (set-ref (L 'c) 'z) '(z a b (z) (d (z c (c)) e f c)))
+		(set 'L '((a 1) (b 2) (a 3) (b 4)))	
+		(= (set-ref (L '(a *)) '(z 99) match) '((z 99) (b 2) (a 3) (b 4)))
+		(= (set-ref (L '(a *)) '(z 99) match) '((z 99) (b 2) (z 99) (b 4)))
+		(set 'Ct:Ct '(a b c d e f g))
+		(= (set-ref  (Ct 'c) 'z) '(a b z d e f g))
+	)
+)
+
+
+(define (test-set-ref-all)
+    (and
+		(set 'L '(z a b (c) (d (c c (c)) e f c))) 
+		(= (set-ref-all (L 'c) 'z) '(z a b (z) (d (z z (z)) e f z)))
+		(set 'L '((a 1) (b 2) (a 3) (b 4)))
+		(= (set-ref-all (L '(a *)) '(z 99) match) '((z 99) (b 2) (z 99) (b 4)))
+    )
+)
+
+(define (test-ref-set)
+	(and
+		(set 'L '(a b (c) d e f g))
+		(= (ref-set (L 'c) 'z) 'c)
+		(set 'L '(a b (c) d e f g))
+		(= (ref-set (L 'c) 'z) 'c)
+	)
+)
+
+(define (test-share)
+    (and 
+      (if (or (< opsys 5)(= opsys 9))
+          (unix-test-share)
+          (win32-test-share))
+      (set 'mvar (share))
+      (share mvar 123)
+      (= (share mvar) 123)
+      (share mvar 123.456)
+      (= (share mvar) 123.456)
+      (share mvar "hello")
+      (= (share mvar) "hello")))
+
+
+(define (win32-test-share)
+    (write-file "sharetest.lsp"
+[text]
+(map set '(sid mm) (map int (slice (main-args) 2)))
+(if (= (share mm) "hello") (share mm "HELLO"))
+(semaphore sid 1) ; signale parent to read
+(exit)
+[/text]
+    )
+  (and
+    (set 'sid (semaphore))
+    (set 'mm (share))
+    (share mm "hello")
+    (if (and (> opsys 5)(< opsys 9))
+      (process (string "newlisp sharetest.lsp " sid " " mm))
+      (process (string "./newlisp sharetest.lsp " sid " " mm)))
+    (semaphore sid -1) ; wait for child process
+    (sleep 1000)
+    (semaphore sid 0) ;; delete semaphore
+    (= (share mm) "HELLO")
+    (or (delete-file "sharetest.lsp") true)))
+
+
+(define (unix-test-share)
+  (and
+    (set 'mm (share))
+    (share mm "hello")
+
+    (wait-pid (fork (begin
+            (if (= (share mm) "hello")
+                (share mm "HELLO"))
+                (exit ))))
+		
+    (= (share mm) "HELLO")
+    (share nil mm) ; unmap share
+))
+
+(define (test-sgn)
+ (and
+   (= 0 (sgn 0))
+   (= 1 (sgn 123))
+   (= -1 (sgn -3.5))))
+
+
+; test manually
+(define (test-signal) true)
+
+(define (test-silent )
+  (primitive? silent))
+
+(define (test-sin )
+  (= 1 (sin (asin (sin (asin 1))))))
+
+(define (test-sinh)
+	(< (abs (sub (tanh 1) (div (sinh 1) (cosh 1))))  0.0000000001)
+)
+
+(define (test-sleep )
+  (set 'start (time-of-day))
+  (sleep 10)
+  (set 'start (time-of-day))
+  (sleep 1000)
+  (set 'duration (- (time-of-day) start))
+  (and (> duration 500) (< duration 1500)))
+
+(define (test-slice )
+(and 
+   (set 'str "0123456789")
+   (= (slice str 0 1) "0") 
+   (= (slice str 0 3) "012") 
+   (= (slice str 8 2) "89") 
+   (= (slice str 8 10) "89") 
+   (= (slice str 20 10) "")
+   (= (slice str 2 -2) "234567")
+   (= (slice str 2 -5) "234")
+   (= (slice str 2 -7) "2")
+   (= (slice str 2 -8) "")
+   (= (slice str 2 -9) "")
+   (= (slice '(a b c d e f g) 3 1) '(d))
+   (= (slice '(a b c d e f g) 3 0) '())
+   (= (slice '(a b c d e f g) 0 0) '())
+   (= (slice '(a b c d e f g) 10 10) '())
+   (= (slice '(a b c d e f g) 3 2) '(d e))
+   (= (slice '(a b c d e f g) 5) '(f g))
+   (= (slice '(a b c d e f g) -5 2) '(c d))
+   (= (slice '(a b c d e f g) -1 -2) '())
+   (= (slice '(a b c d e f g) 1 -2) '(b c d e))
+   (= (slice '(a b c d e f g) 4 -2) '(e))
+   (= (slice '(a b c d e f g) 4 -3) '())
+   (= (slice '(a b c d e f g) 4 -4) '())
+   (= (slice '(a b c d e f g) -6 -3) '(b c d))
+;; implicit slice
+   (= (1 3 '(a b c d e f g)) '(b c d))
+   (= (-4 2 '(a b c d e f g)) '(d e))
+   (= (1 3 "abcdefg") "bcd")
+   (= (-4 2 "abcdefg") "de")
+   (= (1 -3 "abcdefg") "bcd")
+   (= (1 -5 "abcdefg") "b")
+   (=  (1 -7 "abcdefg") "")
+   (setq x 1 y 2)
+   (= (x y '(a b c d e f g)) '(b c))
+   (= (x y "abcdefg") "bc")
+   (= (1 -2 '(a b c d e f g)) '(b c d e))
+   (= (4 -2 '(a b c d e f g)) '(e))
+   (= (4 -3 '(a b c d e f g)) '())
+   (= (4 -4 '(a b c d e f g)) '())
+   (= (-6 -3 '(a b c d e f g)) '(b c d))
+))
+
+(define (test-sort )
+  (and
+    (= '(1 2 3 4 5 6 7 8 9) (sort '(9 1 8 2 7 3 6 4 5)))
+    (= '(1 2 3 4 5 6 7 8 9) (sort '(9 1 8 2 7 3 6 4 5)))
+    (= '(1 2 3 4 5 6 7 8 9) (sort '(9 1 8 2 7 3 6 4 5) <))
+    (= '(9 8 7 6 5 4 3 2 1) (sort '(9 1 8 2 7 3 6 4 5) >))
+    (= '(1 2 3 4 5 6 7 8 9) (sort '(9 1 8 2 7 3 6 4 5) (fn (x y) (< x y))))
+    (= '(9 8 7 6 5 4 3 2 1) (sort '(9 1 8 2 7 3 6 4 5) (fn (x y) (> x y))))
+    (= '() (sort '()))
+  )
+)
+
+(define (test-source) 
+  (= (replace "\r|\n" (source 'test-sin) "" 0) 
+     "(define (test-sin )  (= 1 (sin (asin (sin (asin 1))))))"))
+
+(define (test-sqrt )
+  (and (= 10 (sqrt 100)) (= 1.2 (sqrt 1.44))))
+
+(define (test-starts-with )
+  (and (starts-with "newlisp" "new") (starts-with "newlisp" "NEW" 
+    nil)))
+
+(define (test-string )
+  (and (string? (string 12345)) (= (string 12345) "12345") (string? 
+    (string 1.234)) 
+   (= (string 'test-string) "test-string") 
+   (string? (string test-string)) 
+   (= (string "a" "b" "c") (append "a" "b" "c") "abc") 
+   (= (string "a" 123 "b") "a123b")))
+
+(define (test-string? )
+  (and (string? "1234") (not (string? 1234))))
+
+(define (test-sub )
+  (= 0 (sub 0.99999999 0.99999999))
+  (= -123 (sub 123)))
+
+(define (test-swap )
+  (set 'lst '(1 2 3 4))
+  (and 
+	(= (swap 1 2 lst) '(1 3 2 4)) 
+	(= lst '(1 3 2 4))
+    (let (a 1 b 2) (and (= (swap a b) 1) (= a 2) (= b 1)))
+  )
+)
+
+(define (test-sym)
+  (and (= (sym "test-sym") 'test-sym) 
+       (= (sym "test-sym" 'QA) 'test-sym)))
+
+(define (test-symbol? )
+	(and
+  		(symbol? (sym "test-symbol"))
+		(symbol? (sym "a b"))
+))
+
+(define (test-symbols )
+  (and (list? (symbols)) (> (length (symbols)) 0)))
+
+(define (test-sys-error)
+	(integer? (sys-error 0) ))
+
+(define (test-sys-info )
+   (and (list? (sys-info)) (= (length (sys-info)) 8)))
+
+(define (test-tan )
+  (> 1 (tan (atan (tan (atan 1))))))
+
+(define (test-tanh)
+	(< (abs (sub (sinh 1) (div (sub (exp 1) (exp -1)) 2))) 0.0000000001)
+)
+
+(define (test-throw )
+  (and (catch (throw (+ 3 4)) 'msg) (= msg 7)))
+
+(define (test-time )
+  (integer? (time)))
+
+(define (test-time-of-day )
+  (integer? (time-of-day)))
+
+(define (test-trace )
+  (trace nil)
+  (= nil (trace)))
+
+(define (test-trace-highlight )
+  (trace-highlight "#" "#"))
+
+(define (test-transpose )
+ (and
+  (= '((1) (2) (3)) (transpose '((1 2 3))))
+  (= '((a b) (c d) (e f)) (transpose '((a c e) (b d f))))
+  (= '((a d f) (b e g) (c nil nil)) (transpose '((a b c) (d e) (f g))))
+  (= '((a c f) (b d g)) (transpose '((a b) (c d e) (f g))))
+;; transpose arrays
+  (set 'A (array 2 3 (sequence 1 6)))
+  (= (array-list (transpose A)) '((1 4) (2 5) (3 6))) 
+))
+
+(define (test-trim )
+  (and 
+    (= (trim "    hello    ") "hello") 
+    (= (trim "----hello----" "-") "hello")
+    (= (trim "----hello====" "-" "=") "hello")
+    (= (trim "000012345" "0" "") "12345")))
+
+(define (test-true?)
+ (= (map true? '(x nil  1 nil "hi" ())) '(true nil true nil true nil)))
+
+(define (test-unique )
+  (= (unique '(2 3 4 4 6 7 8 7)) '(2 3 4 6 7 8)))
+
+(define (test-unicode)
+  (= (utf8 (unicode "newLISP")) "newLISP"))
+
+(define (test-unify) 
+	(and
+		(= (unify 'X 123) '((X 123)))
+        (= (unify '(Int Flt Str Sym Lst) '(123 4.56 "Hello" s '(a b c)))
+                  '((Int 123) (Flt 4.56) (Str "Hello") (Sym s) (Lst '(a b c))))
+		(= (unify 'A 'A) '())
+		(= (unify '(A B "hello") '("hi" A Z)) '((A "hi") (B "hi") (Z "hello")))
+		(= (unify '(A B) '(B abc)) '((A abc) (B abc)))
+		(= (unify '(B A) '(abc B)) '((B abc) (A abc)))
+		(= (unify '(A A C D) '(B C 1 C)) '((B 1) (A 1) (C 1) (D 1)))
+		(= (unify '(D C A A) '(C 1 C B)) '((D 1) (C 1) (B 1) (A 1)))
+		(= (unify '(f A) '(f (a b c))) '((A (a b c))))
+		(= (unify '(A f) '((a b c) f)) '((A (a b c))))
+		(= (unify '(f (g A)) '(f B)) '((B (g A))))
+		(= (unify '(p X Y a) '(p Y X X)) '((Y a) (X a)))
+		(= (unify '(p X Y) '(p Y X)) '((Y X)))
+		(= (unify '(q (p X Y) (p Y X)) '(q Z Z)) '((Y X) (Z (p X X))))
+		(= (unify '(f (g A) A) '(f B xyz)) '((B (g xyz)) (A xyz)))
+		(= (unify '(A (g abc)) '(B A)) '((B (g abc)) (A (g abc))))
+		;; with additional environment list
+		(= (unify '(A (B) X) '(A (A) Z) '((A 1) (Z 4)))
+		   '((A 1) (Z 4) (B 1) (X 4)))
+))
+
+(define (test-unless )
+  (unless nil 
+   true nil))
+
+(define (test-unpack )
+  (= (pack "c c c" 65 66 67) "ABC")
+  (= (unpack "c c c" "ABC") '(65 66 67)))
+
+(define (test-until , x)
+  (set 'x 0)
+  (= 10 (until (= x 10) (inc 'x)) x))
+
+(define (test-do-until , x)
+  (set 'x 0)
+  (and 
+   (= 10 (do-until (= x 10) (inc 'x)) x)
+   (= 11 (do-until (> x 0) (inc 'x)) x)
+))
+
+(define (test-upper-case )
+  (if (> opsys 4) 
+   (= "ABCDEFGQ" (upper-case "abcdefgq")) 
+   (= "ABCDEFGH" (upper-case "abcdefgh"))))
+
+(define (test-utf8)
+  (and
+    (= (utf8 (unicode "newLISP")) "newLISP")
+    (MAIN:utf8qa)))
+
+(define (test-utf8len)
+	(= 23 (utf8len MAIN:utf8str)))
+
+(define (test-uuid)
+    (= 36 (length (uuid))))
+
+(define (test-wait-pid)
+  (set 'pid (fork (begin (sleep 200)(exit))))
+  (wait-pid pid))
+
+(define (test-when)
+	(and 
+		(= (when true (set 'x 1) (set 'y 2) (set 'z 3)) 3)
+		(= x 1) (= y 2) (= z 3)
+		(= (when 123) 123)
+		(= (when nil) nil))
+)
+
+(define (test-while , x)
+  (and
+    (set 'x 0)
+    (= 1000 (while (< x 1000) (inc 'x)) x)
+))
+
+(define (test-do-while, x)
+  (and
+    (set 'x 0)
+    (= 100 (do-while (< x 100) (inc 'x)) x)
+    (= 101 (do-while (< x 100) (inc 'x)) x)
+))
+
+(define (test-write-buffer )
+  (set 'str "")
+  (dotimes (x 5) (write-buffer str "hello"))
+  (and (= str "hellohellohellohellohello")
+       (test-read-buffer)))
+
+(define (test-write-char )
+  (file-copy "qa-dot" "junk")
+  (delete-file "junk"))
+
+(define (test-write-file )
+  (write-file "junk" "newlisp")
+  (= (read-file "junk") "newlisp"))
+
+(define (test-write-line ) 
+  (and
+    (set 'fle (open "testwrite" "w"))
+    (write-line "hello" fle)
+    (close fle)
+    (set 'fle (open "testwrite" "r"))
+    (= (read-line fle) "hello")
+    (close fle)
+    (delete-file "testwrite")  ))
+
+
+(define (test-xml-error )
+  (= (xml-error) nil))
+
+(define (test-xml-parse )
+  (= (xml-parse "<hello att='value'></hello>") '(("ELEMENT" "hello" 
+     (("att" "value")) 
+     ()))))
+
+(define (test-xml-type-tags )
+  (length (xml-type-tags) 4))
+
+(define (test-zero?)
+  (= (map zero? '(1 0 1.2 0.0)) '(nil true nil true)))
+
+(define (test-| )
+  (= (| -1431655766 1431655765) -1))
+
+(define (test-~ )
+  (and
+    (= (~ 0) -1)
+    (if 
+        (and (> opsys 5) (< opsys 9)) ;; Win32 
+        (= (format "%I64x" (~ 0xa0a0a0a0a0a0a0a0)) "5f5f5f5f5f5f5f5f")
+
+        (= opsys 9)
+        (= (format "%lx" (~ 0xa0a0a0a0a0a0a0a0)) "5f5f5f5f5f5f5f5f")
+
+        (= (format "%llx" (~ 0xa0a0a0a0a0a0a0a0)) "5f5f5f5f5f5f5f5f"))
+))
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; MAIN ENTRY POINT ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(if (or (not (or (file? "newlisp") (file? "newlisp.exe"))) (not (file? "qa-dot")))
+	(begin
+		(println "both newlisp(.exe) and qa-dot should be in the current directory.")
+		(exit)))
+
+(cleanup)
+(println)
+(println "Testing built-in functions ...")
+(println)
+(qa)
+(cleanup)
+
+(context 'MAIN)
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+(println)
+(println "Testing contexts as objects and scoping rules ...")
+(println)
+
+;; check creating local symbols
+;; in case they already exist in MAIN
+(set 'var 123)
+(set 'CTX:var 456)
+(if (or (!= CTX:var 456) (!= var 123))
+	(println ">>>>> problem creating local symbols"))
+
+(set 'ctx CTX)
+
+(global 'myprint)
+(set 'myprint print)
+
+;; following would fail without dynamic symbols for non-existing
+;; contexts because 'accnt' is not a context at this moment
+(define (report accnt)
+    (list accnt:name accnt:balance))
+
+;; late in ACCOUNT the definition of 'deposit' should
+;; should not fail, locals should always be created for
+;; the current context
+(constant 'amount 999)
+(constant 'stat 999)
+
+;; the symbol defined should always be forced into the current
+;; context, even if alread exists in MAIN, if not following
+;; definition of 'deposit' would fail
+(set 'deposit 999) 
+(set 'clear 999)
+(constant 'withdraw 999) 
+
+(define balance 1000.00)
+(constant 'phone "123-456-789")
+
+
+(context 'ACCOUNT)
+    (set 'ACCOUNT:name "")      ; force creation of local symbol with
+    (define balance 0.0)  	; same name as built in primitive
+    (constant 'phone "")     
+
+    (define (deposit amount)
+        (inc 'balance amount))
+
+    (define (withdraw amount)
+        (dec 'balance amount))
+    
+    ; make sure contexts are inherited
+    ; but not variables containing contexts
+    (if (not (context? CTX)) 
+	(QA:failed ">>>> problem inheriting context symbols"))
+
+    ; make sure context variables get not inherited
+    (if (= ctx CTX) (QA:failed ">>>>> should not inherit context var"))
+    
+    (set 'ctx 123)
+
+    ; make sure redefined primitives get inherited
+    (if (not (primitive? myprint)) 
+    	(QA:failed ">>>> problem inheriting redefined primitives"))
+
+(set 'myprint nil)
+   
+(context 'MAIN)
+
+;; make sure again that context defs did not overwrite MAIN symbols
+(if (or (!= deposit 999) (!= clear 999) (!= withdraw 999) (!= stat 999) (!= ctx CTX)
+        (not (primitive? name)) (!= balance 1000.0) (!= phone "123-456-789"))
+	(QA:failed ">>>> context definitions are overwriting MAIN"))
+
+(new ACCOUNT 'John true)     ; this creates a new context copy of 
+                             ; ACCOUNT called 'John' if exists overwrite symbols
+
+(set 'John:name "John Doe")
+(set 'John:phone "555-123-456")
+
+(John:deposit 100.00)
+(John:withdraw 60)
+
+(new ACCOUNT 'Anne true)
+
+(set 'Anne:name "Anne Somebody")
+(set 'Anne:phone "555-456-123")
+
+(Anne:deposit 120.00)
+(Anne:withdraw 50)
+(if (or (!= John:balance 40) (!= Anne:balance 70))
+	(QA:failed ">>>> problem with methods in contexts"))
+
+(if (or (!= (report John) (list John:name John:balance))
+        (!= (report Anne) (list Anne:name Anne:balance)))
+    (QA:failed ">>>> problem using context variables"))
+
+(if (!= (map report (map eval '(John Anne))) 
+       '(("John Doe" 40) ("Anne Somebody" 70)) )
+    (QA:failed ">>>> problem mapping functions using context vars"))
+
+
+;; dynamic context var as symbol to be defined
+;;
+(define (defit)
+	(define (ctx:foo x) (+ x x)))
+
+(set 'ctx ACCOUNT)
+(defit)
+(if (!= (ctx:foo 10) 20) 
+  (QA:failed ">>>> problem with dyna symbols in defined symbol"))
+
+
+;; check setq, define (as set) and inc, dec on dynamic context vars
+;;
+(define (foo-set ct value) (set 'ct:var value))
+(define (foo-setq ct value) (setq ct:var value))
+(define (foo-define ct value) (define ct:var value))
+(define (foo-inc ct value) (inc 'ct:var))
+(define (foo-dec ct value) (dec 'ct:var))
+
+(set 'CTX:var 0) ;; make sure var is existent
+(foo-set CTX 1)
+(if (!= 1 CTX:var) 
+  (QA:failed ">>>> problem with set on context vars"))
+
+(foo-setq CTX 3)
+(if (!= 3 CTX:var) 
+  (QA:failed ">>>> problem with setq on context vars"))
+
+(foo-define CTX 4)
+(if (!= 4 CTX:var) 
+  (QA:failed ">>>> problem with define on context vars"))
+
+(foo-inc CTX)
+(if (!= 5 CTX:var) 
+  (QA:failed ">>>> problem with inc on context vars"))
+
+(foo-dec CTX)
+(if (!= 4 CTX:var) 
+  (QA:failed ">>>> problem with dec on context vars"))
+
+;; dynamic context vars inside a context (since version 7.5.1)
+
+(context 'TST)
+
+(define (init ctx value)
+	(set 'ctx:foo value))
+
+;; since version 8.7.8 when calling a function in a context the current runtime
+;; context changes
+(define (test-context-change)
+	(= (context) TST))
+
+(context MAIN)
+
+;; foo does not exist in CTX
+
+(TST:init CTX 999)
+
+(if (!= 999 CTX:foo) 
+  (QA:failed ">>>> problem with dyna vars in contexts"))
+
+;; now foo does exist
+(TST:init CTX 222)
+
+(if (!= 222 CTX:foo)
+  (QA:failed ">>>> problem with dyna vars in contexts"))
+
+
+(define (cdf:cdf a b) (+ a b))
+
+(if (!= (cdf 3 4) 7) 
+  (QA:failed ">>>> problem with context default vars"))
+
+;; check for existence of dynamic context symbol
+
+(define (check-sym-existence ctx)
+  (if (symbol? 'ctx:foovar) ;; chack only, will not create 
+    (QA:failed ">>>> problem with symbol? for dyna vars")))
+
+(check-sym-existence CTX)
+
+;; do not overwrite existing symbols
+
+(set 'Actx:x 123)
+(set 'Actx:y 456)
+(set 'Bctx:x 999)
+
+(new Actx Bctx)
+
+(if (not (= Bctx:x 999))
+  (QA:failed ">>>>> problem with new in overwriting symbols"))
+
+
+;; delete contexts
+ (if (not (and
+        (delete ACCOUNT)
+        (delete Anne)
+        (delete John)
+;		(map delete '(Actx Bctx cdf))
+      ) )
+    (QA:failed ">>>>> problem deleting contexts"))
+
+
+;; define static default functions
+
+(define foobar:foobar)
+
+(define (def-static s contents)
+   (def-new 'contents (sym (name s) s)))
+
+(if (not 
+  (and
+    (def-static 'foobar (fn (x) (+ x x)))
+    (= foobar:foobar (lambda (foobar:x) (+ foobar:x foobar:x)))
+    (= (foobar 10) 20)))
+  (QA:failed ">>>>> problem with static default function definition"))
+
+;; calling into context changes context
+(if (not TST:test-context-change)
+  (QA:failed ">>>>> problem changing runtime context with symbol"))
+
+;; but calling with raw lambda doesn't
+(if ((eval TST:test-context-change))
+  (QA:failed ">>>>> problem maintaining runtime context with lambda"))
+
+;; apply evaluates functor
+(if (not (apply 'TST:test-context-change))
+  (QA:failed ">>>>> problem changing runtime context with apply symbol"))
+
+;; apply evaluates functor
+(if (apply TST:test-context-change)
+  (QA:failed ">>>>> problem maintaining runtime context with apply lambda"))
+
+;; map evaluates functor
+(if (!= (map 'TST:test-context-change '(a b c)) '(true true true))
+  (QA:failed ">>>>> problem changing runtime context with map symbol"))
+
+;; map evaluates functor
+(if (!= (map TST:test-context-change '(a b c)) '(nil nil nil))
+  (QA:failed ">>>>> problem maintaining runtime context with map lambda"))
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+(println)>
+(if QA:failed-messages
+  (begin
+    (println "TESTING: " (main-args 0) " FINISHED WITH ERRORS:")
+    (println)
+    (dolist (func (reverse QA:failed-messages))
+        (println func)))
+  (println "ALL FUNCTIONS FINISHED SUCCESSFULL: " (main-args 0)))
+
+(println)
+(delete-file "sharetest.lsp")
+(delete-file "udptest.lsp")
+(println "total time: " (- (time-of-day) start-of-qa))
+(exit)
+;; eof
+
+
diff --git a/qa-lfs b/qa-lfs
new file mode 100644
index 0000000..fa7aef9
--- /dev/null
+++ b/qa-lfs
@@ -0,0 +1,28 @@
+;; Test for LFS (Large Files Support)
+;; create a file with more than 2^32 bytes
+;; and read back some records for verification
+;; Needs apprxomately 5 Gigabyte of diskspace
+;; writing a file of 5,000,000 records of 1k each.
+
+(set 'file (open "largefile" "write"))
+
+(dotimes (i 5000000)
+	(set 'rec (append (format "%08d" i) (dup "#" 992)))
+	(write-buffer file rec 1000)
+	(if (= 0 (% i 10000)) (println i " kbytes written"))
+)
+(close file)
+
+(set 'file (open "largefile" "read"))
+
+(for (i 0 4999999 10000)
+	(set 'test (append (format "%08d" i) (dup "#" 992)))
+    (seek file (mul i 1000))
+	(read-buffer file 'rec 1000)
+	(if (= test rec) 
+		(println i " record -> Ok " (0 8 rec))
+		(println i " record -> Error reading " (0 8 rec)))
+)	
+
+(exit)
+
diff --git a/qa-local-domain b/qa-local-domain
new file mode 100755
index 0000000..466a2af
--- /dev/null
+++ b/qa-local-domain
@@ -0,0 +1,41 @@
+#!/usr/bin/newlisp
+
+; test local domain UNIX sockets
+
+(define (listener path)
+	(set 'lsock (net-listen path))
+	(set 'csock (net-accept lsock))
+	(net-receive csock 'buff 1024)
+	(net-send csock (upper-case buff))
+	(net-close csock)
+	(exit)
+)
+
+(set 'pid (fork (listener "/tmp/mysock")))
+(println "pid:" pid)
+
+(while (not (set 'conn (net-connect "/tmp/mysock")))
+	(sleep 100))
+
+(if (not conn)
+	(begin
+		(println "Could not connect")
+		(exit)))
+(println "net-peer: " (net-peer conn))
+(println "net-local: " (net-local conn))
+(net-send conn "hello world")
+
+(while (not (net-select conn "read" 1000))
+	(println "waiting with net-select ..."))
+
+(println "net-peek: " (net-peek conn))
+
+(net-receive conn 'buff 1024)
+(if (= "HELLO WORLD" buff)
+	(println buff ": Ok")
+	(prrintn buff ": Error"))
+
+(wait-pid pid)
+
+(exit)
+
diff --git a/qa-net b/qa-net
new file mode 100755
index 0000000..12803c8
--- /dev/null
+++ b/qa-net
@@ -0,0 +1,131 @@
+#!/usr/bin/newlisp
+
+; qa-net - test network routines for server mode
+;
+; tests: net-eval
+; tests http mode of: load, save, read-file, write-file, delete-file
+; 
+; assumes newlisp executable in the current directory:
+;     newlisp-x.x.x/
+;
+; usage to test on local host:
+;
+;        ./newlisp qa-net  
+;
+; usage to test on a remote host
+; 
+;        ./newlisp qa-net http://mysite.com:10001//home/test
+; or 
+;        ./newlisp qa-net http://localhost:4711//Users/Lutz/newlisp-8.9.8
+;
+; running this test on Win32:
+;
+;        newlisp qa-net
+;
+; On Win32 this test may have timing issues, try running again.
+; 
+;
+
+(set 'start (time-of-day))
+
+; get operating system
+(set 'opsys (& (last (sys-info)) 0xf))
+
+(set 'targetURL (or 
+		(main-args 2)
+		(append "http://localhost:10001/" (real-path) "/qa-junk.txt")))
+
+(replace "\\" targetURL "/") ; for Win32
+
+(if (not (ends-with targetURL "/qa-junk.txt"))
+	(set 'targetURL (append targetURL "/qa-junk.txt")))
+
+(set 'host ((regex "http://(.*?):" targetURL) 3))
+(set 'port (int ((regex "http://.*?:(\\d+)/" targetURL) 3)))
+(set 'path ((regex "http://.*:\\d+/(.*)" targetURL) 3))
+
+(println)
+(println "target URL: " targetURL)
+
+(println "host: " host)
+(println "port: " port)
+(println "path: " path)
+
+; check if server is online or start it, if not
+; start one on localhost if no URL was specified
+; on the command line
+(set 'connection (net-connect host port))
+(if (not connection)
+	(begin
+		(println "Starting server on localhost")
+		(if (and (not (main-args -2)) (> opsys 5) (< opsys 9))
+			(set 'pid (process (string "newlisp -c -d " port)))
+			(set 'pid (process (string "./newlisp -c -d " port)))))
+	(begin
+		(println "Server already running ...")
+		(net-close connection)))
+	
+
+(println "waiting for server ...")
+(sleep 1000)
+
+; test short syntax normal mode
+(if (=  (net-eval host port {(+ 3 4)} 1000) 7) 
+	(println "net-eval normal mode ->OK")
+	(println "net-eval poblem with normal mode ->ERROR"))
+
+; test raw mode only in list syntax
+(if (=  (net-eval '((host port {(+ 3 4)} true)) 1000) '("7\n")) 
+	(println "net-eval raw mode ->OK")
+	(println "net-eval problem with raw mode ->ERROR"))
+
+
+; test saving to URL
+(set 'key (uuid))
+(set 'verify key)
+(if (find "transferred" (print (save targetURL 'key)))
+	(println "save to URL ->OK")
+	(println "save to URL ->ERROR"))
+
+(if (= opsys 6) (sleep 4000)) ; for Win32
+
+; test loading from URL
+(if (and
+	(println "loading target URL: " targetURL)
+	(= (load targetURL) verify)
+	(= key verify))
+	(println "load from URL ->OK")
+	(println "load from URL ->ERROR"))
+
+; test writing file to remote
+
+; generate random binary data
+(set 'content "")
+(dotimes (i 100000)
+	(write-buffer content (pack "c" (rand 255))))
+
+; write content to remote URL
+(if	(find "transferred" (print (write-file targetURL content)) )
+	(println "write-file to remote URL ->OK")
+	(println "write-file to remote URL ->ERROR"))
+
+(if (= opsys 6) (sleep 4000)) ; for Win32
+
+; read content from remote URL
+(if (= content (read-file targetURL))
+	(println "read-file from remote URL ->OK")
+	(println "read-file from  remote URL ->ERROR"))
+
+; delete file at remote URL
+(if (!= opsys 6)
+(if (starts-with (print  (delete-file targetURL)) "File deleted:")
+	(println "delete-file from remote URL ->OK")
+	(println "delete-file from remote URL ->Error"))
+)
+
+(if pid
+	(println "destroy -> " pid " ->" (destroy pid)))
+
+(println "\nduration =>" (- (time-of-day) start) " ms\n")
+
+(exit)
diff --git a/qa-setsig b/qa-setsig
new file mode 100755
index 0000000..77ce0ee
--- /dev/null
+++ b/qa-setsig
@@ -0,0 +1,72 @@
+#!/usr/bin/newlisp
+#
+# check out customized signal handlers
+#
+# USAGE: qa-setsig <low-bound> <high-bound>
+#
+# example: qa-setsig 1 8
+#
+# checks all signals between 1 and 8
+#
+# run without arguments for testing 1-8, 10-16
+#
+# USAGE: qa-setsig
+#
+
+(set 'opsys (& 0xF ((sys-info) -1)))
+
+(set 'library (if
+  (= opsys 1) "libc.so.6" ;; Linux
+  (= opsys 2) "libc.so"        ;; FreeBSD
+  (= opsys 3) "libc.dylib"     ;; Mac OSX
+  (= opsys 4) "libc.so"))      ;; Solaris
+
+(if (not library)
+	(begin
+		(println "Cannot run qa-signal on this platform")
+		(exit)))
+
+(import library "getpid")
+(import library "kill")
+
+(set 'low (int (main-args 2)))
+(set 'high (int (main-args 3)))
+(set 'pid (getpid))
+
+(if low
+	(println "low=" low " hight=" high " pid=" pid))
+
+(define (alarm sig)
+	(if (= sig high) (set 'done true)) 
+	(print "sig-" sig " ")
+	(push sig result-list -1)
+)
+
+(if (and low high) 
+	(set 'sig-list (sequence low high))
+	(set 'sig-list (append (sequence 1 8) (sequence 10 16))))
+
+(set 'high (last sig-list))
+
+(dolist (s sig-list) (signal s 'alarm))
+
+
+(fork (begin
+		(dolist (s sig-list)
+			(sleep 200)
+			(kill pid (int s)))
+		(sleep 200)
+;		(kill pid 9)
+))
+
+(println)
+(while (not done)  (print ".") (sleep 100))
+(println)
+(println "sent: " sig-list)
+(println "received: " result-list)
+(if (= result-list sig-list)
+	(println "signal testing OK")
+	(println "ERROR: problem in signal testing"))
+
+(println)
+(exit)
diff --git a/qa-utf16path.lsp b/qa-utf16path.lsp
new file mode 100644
index 0000000..d749a6e
--- /dev/null
+++ b/qa-utf16path.lsp
@@ -0,0 +1,107 @@
+;; qa-utf16path - check WIN_32 file and directory routines on 
+;; UTF-16 encoded paths
+
+(if (not (= ostype "Win32"))
+		(println "This test is lengthy and normally only used on" 
+				" the Win32 UTF8 enabled versions.")
+)
+
+(setq Yuki "\230\162\182\230\181\166\231\148\177\232\168\152")
+(setq InvalidUTF8 "\xC0\xC1")
+
+(setq UnicodeStr Yuki)
+
+(setq h 1) ; pre allocate mem so changes should be minimal
+(setq sRand 
+	(join (map char (map (curry + 32)
+		(rand 
+			(- 127 32)
+			(+ 10 90);(rand 100))
+		)
+	)
+)))
+(setq buff sRand)
+
+
+(define-macro (assert any)
+	(local (result)
+		(unless (setq result (eval any))
+			(throw-error (string "Expression failed! " any))
+		)
+		result
+	)
+)
+
+(println "Check memory - hit <enter>.")
+(read-line)
+
+(println "Step 1")
+
+(println (time 
+	(begin 
+		(assert (make-dir UnicodeStr))
+		(assert (remove-dir UnicodeStr))
+	)
+	1000
+))
+
+(println "Step 2")
+
+(assert (make-dir UnicodeStr))
+(println (time (assert (directory? UnicodeStr)) 100000))
+(println (time (assert (file? UnicodeStr)) 100000))
+(println (time (begin
+	(assert (directory))
+	(assert (real-path UnicodeStr))
+	(assert (change-dir UnicodeStr))
+	(assert (real-path))
+	(assert (directory))
+	(assert (change-dir ".."))
+) 5000))
+(assert (remove-dir UnicodeStr))
+
+(println "Step 3")
+
+		
+(println (time
+	(begin
+		(assert (write-file UnicodeStr sRand))
+		(assert (= (read-file UnicodeStr) sRand))
+		(assert (append-file UnicodeStr (reverse sRand)))
+		(assert (delete-file UnicodeStr))
+	)
+5000 ))
+
+(println "Step 4")
+
+(assert (write-file UnicodeStr sRand))
+
+(println (time (assert (not (directory? UnicodeStr))) 100000))
+(println (time (assert (file? UnicodeStr)) 100000))
+
+(println (time (assert (file-info UnicodeStr)) 100000))
+
+(println "Step 5")
+
+(println (time (begin
+	(assert (setq h (open UnicodeStr "w")))
+	(assert (write-buffer h sRand))
+	(assert (close h))
+	(assert (setq h (open UnicodeStr "a")))
+	(assert (write-buffer h (reverse sRand)))
+	(assert (close h))
+	(assert (setq h (open UnicodeStr "r")))
+	(assert (read-buffer h 'buff 1024))
+	(assert (close h))
+	(assert (rename-file UnicodeStr "foo"))
+	(assert (rename-file "foo" UnicodeStr))
+) 10000))
+
+(assert (delete-file UnicodeStr))
+
+(println "Step 6")
+
+(println (time (save UnicodeStr) 10000))
+
+(assert (delete-file UnicodeStr))
+
diff --git a/qa-utf8 b/qa-utf8
new file mode 100755
index 0000000..af940ee
--- /dev/null
+++ b/qa-utf8
@@ -0,0 +1,128 @@
+#!/usr/bin/newlisp
+#
+# a selection of languages from from 
+# http://www.columbia.edu/kermit/utf8.html
+#
+# see also: http://www.unicode.org/charts/
+#
+
+(context 'L)
+(set 'Albanian "Un\195\171 mund t\195\171 ha qelq dhe nuk m\195\171 gjen gj\195\171.")
+
+(set 'Arabic "\216\163\217\134\216\167 \217\130\216\167\216\175\216\177 \216\185\217\132\217\137 \216\163\217\131\217\132 \216\167\217\132\216\178\216\172\216\167\216\172 \217\136 \217\135\216\176\216\167 \217\132\216\167 \217\138\216\164\217\132\217\133\217\134\217\138. ")
+
+(set 'Armenian "\212\191\214\128\213\182\213\161\213\180 \213\161\213\186\213\161\213\175\213\171 \213\184\214\130\213\191\213\165\213\172 \214\135 \213\171\213\182\213\174\213\171 \213\161\213\182\213\176\213\161\213\182\213\163\213\171\213\189\213\191 \213\185\213\168\213\182\213\165\214\128\214\137")
+
+(set 'Braille " \226\160\138\226\160\128\226\160\137\226\160\129\226\160\157\226\160\128\226\160\145\226\160\129\226\160\158\226\160\128\226\160\155\226\160\135\226\160\129\226\160\142\226\160\142\226\160\128\226\160\129\226\160\157\226\160\153\226\160\128\226\160\138\226\160\158\226\160\128\226\160\153\226\160\149\226\160\145\226\160\142\226\160\157\226\160\158\226\160\128\226\160\147\226\160\165\226\160\151\226\160\158\226\160\128\226\160\141\226\160\145")
+
+(set 'Bulgarian "\208\156\208\190\208\179\208\176 \208\180\208\176 \209\143\208\188 \209\129\209\130\209\138\208\186\208\187\208\190, \209\130\208\190 \208\189\208\181 \208\188\208\184 \208\178\209\128\208\181\208\180\208\184.")
+
+(set 'Chamorro "Si\195\177a yo' chumocho krestat, ti ha na'lalamen yo'.")
+
+(set 'Chinese1 "\230\136\145\232\131\189\229\144\158\228\184\139\231\142\187\231\146\131\232\128\140\228\184\141\228\188\164\232\186\171\228\189\147\227\128\130")
+
+(set 'Chinese2 "\230\136\145\232\131\189\229\144\158\228\184\139\231\142\187\231\146\131\232\128\140\228\184\141\229\130\183\232\186\171\233\171\148\227\128\130")
+
+(set 'Croatian "Ja mogu jesti staklo i ne boli me.")
+
+(set 'Czech "Mohu j\195\173st sklo, neubl\195\173\197\190\195\173 mi.")
+
+(set 'Danish "Jeg kan spise glas, det g\195\184r ikke ondt p\195\165 mig.")
+
+(set 'Dutch "Ik kan glas eten, het doet m\196\179 geen kwaad.")
+
+(set 'English "I can eat glass and it doesn't hurt me.")
+
+(set 'EnglishIPA "[a\201\170 k\195\166n i\203\144t gl\201\145\203\144s \195\166nd \201\170t d\201\144z n\201\146t h\201\156\203\144t mi\203\144")
+
+(set 'Esperanto "Mi povas man\196\157i vitron, \196\157i ne dama\196\157as min. ")
+
+(set 'Estonian "Ma v\195\181in klaasi s\195\188\195\188a, see ei tee mulle midagi.")
+
+(set 'Farsi " .\217\133\217\134 \217\133\219\140 \216\170\217\136\216\167\217\134\217\133 \216\168\216\175\217\136\217\134\217\144 \216\167\216\173\216\179\216\167\216\179 \216\175\216\177\216\175 \216\180\217\138\216\180\217\135 \216\168\216\174\217\136\216\177\217\133")
+
+(set 'French "Je peux manger du verre, \195\167a ne me fait pas de mal.")
+
+(set 'German "Ich kann Glas essen, ohne mir weh zu tun.")
+
+(set 'Greek "\225\189\149\206\177\206\187\206\191\206\189 \207\149\206\177\206\179\206\181\225\191\150\206\189 \206\180\225\189\187\206\189\206\177\206\188\206\177\206\185\206\135 \207\132\206\191\225\191\166\207\132\206\191 \206\191\225\189\148 \206\188\206\181 \206\178\206\187\225\189\177\207\128\207\132\206\181\206\185.")
+
+(set 'Hausa "\216\165\217\144\217\134\216\167 \216\165\217\144\217\137\217\142 \216\170\217\142\217\136\217\134\217\142\216\177 \216\186\217\144\217\132\217\142\216\167\216\180\217\144 \217\131\217\143\217\133\217\142 \216\165\217\144\217\134 \216\186\217\142\217\133\217\142\216\167 \217\132\217\142\216\167\217\129\217\144\217\137\217\142\216\167")
+
+(set 'Hebrew "\215\144\215\160\215\153 \215\153\215\155\215\149\215\156 \215\156\215\144\215\155\215\149\215\156 \215\150\215\155\215\149\215\155\215\153\215\170 \215\149\215\150\215\148 \215\156\215\144 \215\158\215\150\215\153\215\167 \215\156\215\153.")
+
+(set 'Hindi "\224\164\174\224\165\136\224\164\130 \224\164\149\224\164\190\224\164\129\224\164\154 \224\164\150\224\164\190 \224\164\184\224\164\149\224\164\164\224\164\190 \224\164\185\224\165\130\224\164\129, \224\164\174\224\165\129\224\164\157\224\165\135 \224\164\137\224\164\184 \224\164\184\224\165\135 \224\164\149\224\165\139\224\164\136 \224\164\170\224\165\128\224\164\161\224\164\190 \224\164\168\224\164\185\224\165\128\224\164\130 \224\164\185\224\165\139\224\164\164\224\165\128.")
+
+(set 'Irish "Is f\195\169idir liom gloinne a ithe. N\195\173 dh\195\169anann s\195\173 dochar ar bith dom.")
+
+(set 'Italian "Posso mangiare il vetro e non mi fa male.")
+
+(set 'Japanese "\231\167\129\227\129\175\227\130\172\227\131\169\227\130\185\227\130\146\233\163\159\227\129\185\227\130\137\227\130\140\227\129\190\227\129\153\227\128\130\227\129\157\227\130\140\227\129\175\231\167\129\227\130\146\229\130\183\227\129\164\227\129\145\227\129\190\227\129\155\227\130\147\227\128\130")
+
+(set 'Korean "\235\130\152\235\138\148 \236\156\160\235\166\172\235\165\188 \235\168\185\236\157\132 \236\136\152 \236\158\136\236\150\180\236\154\148. \234\183\184\235\158\152\235\143\132 \236\149\132\237\148\132\236\167\128 \236\149\138\236\149\132\236\154\148")
+
+(set 'Latvian "Es varu \196\147st stiklu, tas man nekait\196\147.")
+
+(set 'Lithuanian "A\197\161 galiu valgyti stikl\196\133 ir jis man\196\153s ne\197\190eid\197\190ia ")
+
+(set 'Macedonian "\208\156\208\190\208\182\208\176\208\188 \208\180\208\176 \209\152\208\176\208\180\208\176\208\188 \209\129\209\130\208\176\208\186\208\187\208\190, \208\176 \208\189\208\181 \208\188\208\181 \209\136\209\130\208\181\209\130\208\176.")
+
+(set 'Malay "Saya boleh makan kaca dan ia tidak mencederakan saya.")
+
+(set 'Marathi "\224\164\174\224\165\128 \224\164\149\224\164\190\224\164\154 \224\164\150\224\164\190\224\164\138 \224\164\182\224\164\149\224\164\164\224\165\139, \224\164\174\224\164\178\224\164\190 \224\164\164\224\165\135 \224\164\166\224\165\129\224\164\150\224\164\164 \224\164\168\224\164\190\224\164\185\224\165\128.")
+
+(set 'Mongolian1 "\208\145\208\184 \209\136\208\184\208\187 \208\184\208\180\209\141\208\185 \209\135\208\176\208\180\208\189\208\176, \208\189\208\176\208\180\208\176\208\180 \209\133\208\190\209\128\209\130\208\190\208\185 \208\177\208\184\209\136")
+
+(set 'Mongolian2 "\225\160\170\225\160\162 \225\160\176\225\160\162\225\160\175\225\160\162 \225\160\162\225\160\179\225\160\161\225\160\182\225\160\166 \225\160\180\225\160\162\225\160\179\225\160\160\225\160\168\225\160\160 \225\160\130 \225\160\168\225\160\160\225\160\179\225\160\164\225\160\183 \225\160\172\225\160\163\225\160\164\225\160\183\225\160\160\225\160\179\225\160\160\225\160\162 \225\160\170\225\160\162\225\160\176\225\160\162 ")
+
+(set 'Norvegian "Jeg kan spise glass uten \195\165 skade meg. ")
+
+(set 'Pashto "\216\178\217\135 \216\180\217\138\216\180\217\135 \216\174\217\136\218\147\217\132\219\144 \216\180\217\133\216\140 \217\135\216\186\217\135 \217\133\216\167 \217\134\217\135 \216\174\217\136\218\150\217\136\217\138")
+
+(set 'Polish "Mog\196\153 je\197\155\196\135 szk\197\130o i mi nie szkodzi.")
+
+(set 'Portugese "Posso comer vidro, n\195\163o me faz mal.")
+
+(set 'Russian "\208\175 \208\188\208\190\208\179\209\131 \208\181\209\129\209\130\209\140 \209\129\209\130\208\181\208\186\208\187\208\190, \208\190\208\189\208\190 \208\188\208\189\208\181 \208\189\208\181 \208\178\209\128\208\181\208\180\208\184\209\130.")
+
+(set 'Sanskrit "\224\164\149\224\164\190\224\164\154\224\164\130 \224\164\182\224\164\149\224\165\141\224\164\168\224\165\139\224\164\174\224\165\141\224\164\175\224\164\164\224\165\141\224\164\164\224\165\129\224\164\174\224\165\141 \224\165\164 \224\164\168\224\165\139\224\164\170\224\164\185\224\164\191\224\164\168\224\164\184\224\165\141\224\164\164\224\164\191 \224\164\174\224\164\190\224\164\174\224\165\141 \224\165\165")
+
+(set 'Serbian "\208\156\208\190\208\179\209\131 \209\152\208\181\209\129\209\130\208\184 \209\129\209\130\208\176\208\186\208\187\208\190 \208\176 \208\180\208\176 \208\188\208\184 \208\189\208\181 \209\136\208\186\208\190\208\180\208\184.")
+
+(set 'Slovak "M\195\180\197\190em jes\197\165 sklo. Nezran\195\173 ma.")
+
+(set 'Slovenian "Lahko jem steklo, ne da bi mi \197\161kodovalo.")
+
+(set 'Spanish "Puedo comer vidrio, no me hace da\195\177o.")
+
+(set 'SwahiliKI "Naweza kula bilauri na sikunyui.")
+
+(set 'Swedish "Jag kan \195\164ta glas utan att skada mig.")
+
+(set 'Tagalog "Kaya kong kumain nang bubog at hindi ako masaktan.")
+
+(set 'Tamil "\224\174\168\224\174\190\224\174\169\224\175\141 \224\174\149\224\174\163\224\175\141\224\174\163\224\174\190\224\174\159\224\174\191 \224\174\154\224\174\190\224\174\170\224\175\141\224\174\170\224\174\191\224\174\159\224\175\129\224\174\181\224\175\135\224\174\169\224\175\141, \224\174\133\224\174\164\224\174\169\224\174\190\224\174\178\224\175\141 \224\174\142\224\174\169\224\174\149\224\175\141\224\174\149\224\175\129 \224\174\146\224\174\176\224\175\129 \224\174\149\224\175\135\224\174\159\224\175\129\224\174\174\224\175\141 \224\174\181\224\174\176\224\174\190\224\174\164\224\175\129.")
+
+(set 'Thai "\224\184\137\224\184\177\224\184\153\224\184\129\224\184\180\224\184\153\224\184\129\224\184\163\224\184\176\224\184\136\224\184\129\224\185\132\224\184\148\224\185\137 \224\185\129\224\184\149\224\185\136\224\184\161\224\184\177\224\184\153\224\185\132\224\184\161\224\185\136\224\184\151\224\184\179\224\185\131\224\184\171\224\185\137\224\184\137\224\184\177\224\184\153\224\185\128\224\184\136\224\185\135\224\184\154")
+
+(set 'Tibetan "\224\189\164\224\189\186\224\189\163\224\188\139\224\189\166\224\190\146\224\189\188\224\188\139\224\189\159\224\188\139\224\189\147\224\189\166\224\188\139\224\189\132\224\188\139\224\189\147\224\188\139\224\189\130\224\189\178\224\188\139\224\189\152\224\188\139\224\189\162\224\189\186\224\189\145\224\188\141")
+
+(set 'Turkish "\216\172\216\167\217\133 \217\138\217\138\217\135 \216\168\217\132\217\136\216\177\217\133 \216\168\218\173\216\167 \216\182\216\177\216\177\217\137 \216\183\217\136\217\130\217\136\217\134\217\133\216\178")
+
+(set 'Ukranian "\208\175 \208\188\208\190\208\182\209\131 \209\151\209\129\209\130\208\184 \209\136\208\186\208\187\208\190, \208\185 \208\178\208\190\208\189\208\190 \208\188\208\181\208\189\209\150 \208\189\208\181 \208\191\208\190\209\136\208\186\208\190\208\180\208\184\209\130\209\140.")
+
+(set 'Urdu "\217\133\219\140\218\186 \218\169\216\167\217\134\218\134 \218\169\218\190\216\167 \216\179\218\169\216\170\216\167 \219\129\217\136\218\186 \216\167\217\136\216\177 \217\133\216\172\218\190\219\146 \216\170\218\169\217\132\219\140\217\129 \217\134\219\129\219\140\218\186 \219\129\217\136\216\170\219\140 \219\148")
+
+(set 'Vietnamese "\228\186\155 \240\163\142\143 \228\184\150 \229\146\185 \230\176\180 \230\153\182 \240\166\147\161 \231\169\186 \240\163\142\143 \229\174\179 \229\146\166 ")
+
+(set 'Yiddish "\215\144\215\153\215\154 \215\167\215\162\215\159 \215\162\215\161\215\159 \215\146\215\156\215\144\214\184\215\150 \215\144\215\149\215\159 \215\162\215\161 \215\152\215\149\215\152 \215\158\215\153\215\168 \215\160\215\153\215\169\215\152 \215\176\215\178. ")
+
+(set 'Yoruba "Mo l\195\168 je\204\169 d\195\173g\195\173, k\195\178 n\195\173 pa m\195\173 l\195\161ra.")
+
+(context MAIN)
+
+(dotree (l L)
+	(println (name l) ":" (eval l)))
+
+(exit)
+;; eof
diff --git a/qa-xml b/qa-xml
new file mode 100755
index 0000000..435bd3f
--- /dev/null
+++ b/qa-xml
@@ -0,0 +1,138 @@
+#!/usr/bin/newlisp
+
+# qa-xml - test newLISP xml-parse, xml-type-tags functions
+
+(set 'example-xml
+[text]
+
+<DATABASE name="example.xml">
+<!--This is a database of fruits-->
+    <FRUIT>
+        <NAME>apple</NAME>
+        <COLOR>red</COLOR>
+        <PRICE>0.80</PRICE>
+    </FRUIT>
+
+    <FRUIT>
+        <NAME>orange</NAME>
+        <COLOR>orange</COLOR>
+        <PRICE>1.00</PRICE>
+    </FRUIT>
+
+    <FRUIT>
+       <NAME>banana</NAME>
+       <COLOR>yellow</COLOR>
+       <PRICE>0.60</PRICE>
+    </FRUIT>
+</DATABASE>
+[/text])
+
+
+(set 'result1 '(
+  ("ELEMENT" "DATABASE" (("name" "example.xml")) (("TEXT" "\n") (
+     "COMMENT" "This is a database of fruits") 
+    ("TEXT" "\n    ") 
+    ("ELEMENT" "FRUIT" () (("TEXT" "\n        ") ("ELEMENT" "NAME" 
+       () 
+       (("TEXT" "apple"))) 
+      ("TEXT" "\n        ") 
+      ("ELEMENT" "COLOR" () (("TEXT" "red"))) 
+      ("TEXT" "\n        ") 
+      ("ELEMENT" "PRICE" () (("TEXT" "0.80"))) 
+      ("TEXT" "\n    "))) 
+    ("TEXT" "\n\n    ") 
+    ("ELEMENT" "FRUIT" () (("TEXT" "\n        ") ("ELEMENT" "NAME" 
+       () 
+       (("TEXT" "orange"))) 
+      ("TEXT" "\n        ") 
+      ("ELEMENT" "COLOR" () (("TEXT" "orange"))) 
+      ("TEXT" "\n        ") 
+      ("ELEMENT" "PRICE" () (("TEXT" "1.00"))) 
+      ("TEXT" "\n    "))) 
+    ("TEXT" "\n\n    ") 
+    ("ELEMENT" "FRUIT" () (("TEXT" "\n       ") ("ELEMENT" "NAME" 
+       () 
+       (("TEXT" "banana"))) 
+      ("TEXT" "\n       ") 
+      ("ELEMENT" "COLOR" () (("TEXT" "yellow"))) 
+      ("TEXT" "\n       ") 
+      ("ELEMENT" "PRICE" () (("TEXT" "0.60"))) 
+      ("TEXT" "\n    "))) 
+    ("TEXT" "\n")))))
+
+
+(set 'result2 '(
+  ("ELEMENT" "DATABASE" (("name" "example.xml")) (("ELEMENT" "FRUIT" 
+     (("ELEMENT" "NAME" (("TEXT" "apple"))) ("ELEMENT" "COLOR" ((
+         "TEXT" "red"))) 
+      ("ELEMENT" "PRICE" (("TEXT" "0.80"))))) 
+    ("ELEMENT" "FRUIT" (("ELEMENT" "NAME" (("TEXT" "orange"))) ("ELEMENT" 
+       "COLOR" 
+       (("TEXT" "orange"))) 
+      ("ELEMENT" "PRICE" (("TEXT" "1.00"))))) 
+    ("ELEMENT" "FRUIT" (("ELEMENT" "NAME" (("TEXT" "banana"))) ("ELEMENT" 
+       "COLOR" 
+       (("TEXT" "yellow"))) 
+      ("ELEMENT" "PRICE" (("TEXT" "0.60")))))))))
+
+
+(set 'result3 '(
+  (DATABASE ((name "example.xml")) (!-- "This is a database of fruits") 
+   (FRUIT (NAME "apple") (COLOR "red") (PRICE "0.80")) 
+   (FRUIT (NAME "orange") (COLOR "orange") (PRICE "1.00")) 
+   (FRUIT (NAME "banana") (COLOR "yellow") (PRICE "0.60")))))
+
+;(define CTX:msg)
+
+(define (test-xml-parse)
+  (begin
+	(= (xml-type-tags "TEXT" "CDATA" "COMMENT" "ELEMENT")
+		'("TEXT" "CDATA" "COMMENT" "ELEMENT"))
+	(print (= result1 (xml-parse example-xml)) " ")
+	(print (= result2 (xml-parse example-xml (+ 1 2 4))) " ")
+ 	(xml-type-tags nil 'cdata '!-- nil) 
+	(print (= result3 (xml-parse example-xml (+ 1 2 8))) " ")
+	(xml-type-tags nil nil nil nil)
+	(print (= (xml-parse "<msg>Hello World</msg>" (+ 1 2 4 8 16) 'CTX)
+    		'((CTX:msg "Hello World"))) " -> ")
+))
+
+(println)
+(if (test-xml-parse)
+	(println "xml-parse and xml-type-tags OK")
+    (println "ERROR with xml-parse or xml-type-tags"))
+(println)
+
+
+
+;; test callback feature
+(define (xml-callback s-expr start size)
+	(if (or (= (s-expr 0) 'NAME) (= (s-expr 0) 'COLOR) (= (s-expr 0) 'PRICE))
+		(begin
+			(print "parsed expresson:" s-expr)
+			(println ", source:" (start size example-xml))
+		)
+	)
+)
+
+(println "Testing xml-parse with callback feature")
+(xml-type-tags nil 'cdata '!-- nil) 
+(xml-parse example-xml (+ 1 2 8) MAIN xml-callback)
+
+; produces this output:
+[text]
+parsed expresson:(NAME "apple"), source:<NAME>apple</NAME>
+parsed expresson:(COLOR "red"), source:<COLOR>red</COLOR>
+parsed expresson:(PRICE "0.80"), source:<PRICE>0.80</PRICE>
+parsed expresson:(NAME "orange"), source:<NAME>orange</NAME>
+parsed expresson:(COLOR "orange"), source:<COLOR>orange</COLOR>
+parsed expresson:(PRICE "1.00"), source:<PRICE>1.00</PRICE>
+parsed expresson:(NAME "banana"), source:<NAME>banana</NAME>
+parsed expresson:(COLOR "yellow"), source:<COLOR>yellow</COLOR>
+parsed expresson:(PRICE "0.60"), source:<PRICE>0.60</PRICE>
+[/text]
+
+(exit)
+
+;; eof
+	
diff --git a/unix-lib.c b/unix-lib.c
new file mode 100644
index 0000000..9f7722a
--- /dev/null
+++ b/unix-lib.c
@@ -0,0 +1,85 @@
+/* unix-lib.c - make the newlisp shared newlisp library
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+#include "newlisp.h"
+#include "protos.h"
+
+extern void setupAllSignals(void);
+extern int evalSilent;
+extern int opsys;
+extern SYMBOL * mainArgsSymbol;
+
+int libInitialized = 0;
+
+void initializeMain(void)
+{
+opsys += 64;
+
+#ifdef SUPPORT_UTF8
+opsys += 128;
+#endif
+
+initLocale();
+initialize();
+
+mainArgsSymbol->contents = (UINT)getCell(CELL_EXPRESSION);
+setupAllSignals();
+
+initStacks();
+
+libInitialized = 1;
+reset();
+}
+
+
+extern STREAM errorStream;
+STREAM libStrStream;
+
+
+/* ---- imported and called from a client using newlisp.so ---- */
+
+char * newlispEvalStr(char * cmd)
+{
+if(!libInitialized) initializeMain();
+
+if(setjmp(errorJump)) 
+	{
+	setupAllSignals(); 
+
+	reset();
+	initStacks();
+
+	if(errorReg) 
+		{
+		executeSymbol(errorEvent, NULL);
+		return(libStrStream.buffer);
+		}
+	else
+	return(errorStream.buffer);
+	}
+
+openStrStream(&libStrStream, MAX_STRING, 1);
+executeCommandLine(cmd, OUT_CONSOLE, NULL);
+
+if(evalSilent) evalSilent = 0;
+
+return(libStrStream.buffer);
+}
+
+/* eof */
diff --git a/util/._newlisp.vim b/util/._newlisp.vim
new file mode 100644
index 0000000000000000000000000000000000000000..269f7451a4d4b700bd4652a09158e73e75a2c993
GIT binary patch
literal 443
zcwS>*6=P>$Vqox1Ojhs@R)|o50+1L3ClDJkFfeukX&|3*Hv>_?F(f32L2dFjsE!jr
z{25IN6I6T=1A}UEey(0(K|xNcUT$hhVoG93qE)u9i)Tq{Zg@s&QL0-}er_>PDPtCp
z2xMRoMW`<<O)N^xE6L1DWk@Q>$t*50Fj&OM6fa<vQBqQ1rLSLJUanV`nX8vyl&)W#
zT$EW*QmmhnU!IqfpO_L45zs5hD6lUsN{-J=v9&NZGmIB7!J`>j510wkW@KPy&cW>g
z@faf`)Q8MyKCUm+Hvj@_6Z2$qgG38U>)^z+#G*`)PpmCXO)ZRF4P11cOe{@wO$>|;
db)6g?4Ry^e49(2VoZJkYEzN5X-iGL8003H-X0`wT

literal 0
HcwPel00001

diff --git a/util/debug b/util/debug
new file mode 100644
index 0000000..b6f9883
--- /dev/null
+++ b/util/debug
@@ -0,0 +1 @@
+comeing here
\ No newline at end of file
diff --git a/util/httpd-conf.lsp b/util/httpd-conf.lsp
new file mode 100644
index 0000000..42215e4
--- /dev/null
+++ b/util/httpd-conf.lsp
@@ -0,0 +1,62 @@
+# httpd.conf - sample file
+#
+# The path-name variable contains the path-name from the HTTP request
+# query contains the query string. The function does not need to handle
+# query, but must return a valid path-name string. If anything else
+# than a string is returned, newlisp server ignores http-conf.
+#
+# In the following example all path-name trying to access unauthorized
+# files causes the path-name returned asan access-denied.html error page.
+# All path-name ending with the name of an existing directory on the
+# server but wihtout the trailing "/" character generate a response
+# with a "Location:" header spcifying the URL correctly. This will
+# cause the client to reissue the request.
+# 
+# Using httpd.conf (a different filename can be chosen) newLISP's HTTP
+# mode can be completely customized.
+#
+# EXAMPLE USAGE:
+#    newlisp httpd.conf -http -d 8080 -w /usr/home/www
+#
+ 
+(define (httpd-conf path-name query)
+	(if 
+		;; check for unauthorized files
+		(or
+			(ends-with path-name ".exe")
+			(starts-with path-name "/") 
+			(find ".." path-name) 
+		)
+		(access-denied-error path-name)
+
+		;; send back 'Location:' header on directories missing trailing '/'
+		(and (directory? path-name) (not (ends-with path-name "/")))	
+		(begin
+			(read-headers)
+			(print "HTTP/1.0 301 OK\r\n")
+			(print (format "Server: newLISP v.%d (%s)\r\n" (sys-info -1) ostype))
+			(print "Location: " path-name "/\r\n")
+			(print "Content-type: text/html\r\n\r\n")
+			nil) ; must return nil to finish processing
+
+		;; else just return the original path-name
+		true
+		path-name
+	))
+
+(define (read-headers)
+	(local (header)
+		(while (!= (set 'header (read-line)) "")
+			; add more if required
+			(if (starts-with header "Host:" 0) (env "HTTP_HOST" (5 header)))
+			(if (starts-with header "User-Agent:" 0) (env "HTTP_USER_AGENT" (11 header)))
+		)))
+
+(define (access-denied-error)
+	(print "HTTP/1.0 200 OK\r\n")
+	(print (format "Server: newLISP v.%d (%s)\r\n" (sys-info -1) ostype))
+	(print "Content-type: text/html\r\n\r\n")
+	(println "ERR:400 Access to " path-name " not allowed.\r\n")
+	nil)
+
+;; eof ;;
diff --git a/util/link.lsp b/util/link.lsp
new file mode 100644
index 0000000..f7084d9
--- /dev/null
+++ b/util/link.lsp
@@ -0,0 +1,87 @@
+;; link.lsp - v.1.1
+;; link.lsp - v.1.2 fix for '.exe' problem on CYGWIN
+;; link.lsp - v.1.3 no code change, added note for win32 dll
+;; link.lsp - v.1.4 no code change, reformatted comments 
+;; link.lsp - v.1.5 no code change, changed dllEvalStr to newlispEvalStr 
+;;
+;; links newLISP executable and a .lsp source file to a new
+;; executable containing both. This way newLISp and a source
+;; file can be packaged together for easier distribution and install.
+;;
+;; 
+;; NOTES FOR LINKING AND IMPORTING WIN32 DLLs
+;; Since newLISP v.7.3.16 CYGWIN is not supported anymore for
+;; linking source to the executable, use a native Win32 instead
+;; which also can be used in an CYGWIN environment
+;;
+;; When importing a linked win32 dll from win32 programs other
+;; then newlisp.exe, than the following statment should be executed
+;; directly after importing functions and before any 'newlispEvalStr'
+;; statment: (dllName <name-of-dll>) where <name-of-dll> is the file
+;; name of the linked win32 newlisp dll. This will enable the autoload
+;; of linked newlisp source in the dll. When importing to newlisp.exe
+;; this is not required.
+;;
+;; How it works:
+;; =============
+;; copies the original newLISP.exe to newExeName
+;; then searches for '@@@@@@@@', which is the place holder
+;; for the exe offset to append lisp source and for a simple
+;; encryption key derived from the source size
+;; the file in lispSourceName gets encrypted and appended
+;; to the a copy of newLISP.exe with a new name.
+;;
+;; the new executable file will not load init.lsp but
+;; the appended file instead
+;;
+;; How to use on CYGWIN WIn32:
+;; ===========================
+;; example: to link the source mySource.lsp to myProg.exe
+;;
+;; (link "newlisp.exe" "myProg.exe" "mySource.lsp")
+;;
+;; then:
+;;
+;; c:\> myProg
+;;
+;; 
+;; On Linux/freeBSD implementations:
+;; =================================
+;; (link "newlisp" "myProg" "mySource.lsp")
+;;
+;; and to execute myProg assuming myProg is in the current directory
+;;
+;; /home/joe > ./myProg
+;;
+
+
+(define (link orgExe newExeName lispSourceName)
+    (set 'size (first (file-info orgExe)))
+
+    ;; copy newLISP.exe to the newExeName
+    (copy-file orgExe newExeName)
+
+    ;; get the binary representation of size
+    (set 'buff (pack "ld" size))
+
+    ;; open the new exe for update
+    (set 'handle (open newExeName "u"))
+    (search handle "@@@@@@@@")
+
+    ;; this field gets read by the newLISP startup
+    (write-buffer handle 'buff 4)
+    (set 'buff (read-file lispSourceName))
+    (set 'keylen (pack "ld" (length buff)))
+    (write-buffer handle 'keylen 4)
+
+    ;; append lisp source encrypted at the end
+    (seek handle size)
+    (set 'buff (encrypt buff (string (length buff))))
+    (write-buffer handle 'buff (length buff))
+    (close handle))
+
+;; eof
+
+;; test
+;;(link "newlisp" "qaprog" "qa")
+
diff --git a/util/make-osx-images b/util/make-osx-images
new file mode 100644
index 0000000..bd25adf
--- /dev/null
+++ b/util/make-osx-images
@@ -0,0 +1,4 @@
+# usage: ./make-os-image x.x.x-ppc or x.x.x-intel
+#/Developer/Applications/Utilities/PackageMaker.app/Contents/MacOS/PackageMaker -d newLISPpackage-project.pmdoc/ -o newLISP-image/newLISPpackage.pkg
+hdiutil create -srcfolder newLISP-image newlisp-$1
+
diff --git a/util/nclocal.c b/util/nclocal.c
new file mode 100644
index 0000000..f61ce59
--- /dev/null
+++ b/util/nclocal.c
@@ -0,0 +1,98 @@
+/*
+//  nclocal - copy stdin to local-domain UNIX socket and output response
+//            to std.out
+//
+//  to make:
+//    gcc nclocal.c -o nclocal
+//
+//  to test, start server:
+//    newlisp -c -d /tmp/mysocket &
+//
+//  verify functioning:
+//    newlisp -e '(net-eval "/tmp/mysocket" 0 "(symbols)")'
+//
+//  then use nclocal:
+//    echo '(symbols)(exit)' | ./nclocal /tmp/mysocket
+//
+//  for multiline send a [cmd] before and a [/cmd] after the code
+//  each on an extra line.
+//      
+// Copyright (C) 2007 Lutz Mueller <lutz@nuevatec.com>
+// 
+// This program is free software; you can redistribute it and/or modify
+// it under the terms of the GNU General Public License version 2, 1991,
+// as published by the Free Software Foundation.
+//
+// This program is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+// 
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, write to the Free Software
+// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+//
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <errno.h>
+#include <string.h>
+#include <sys/types.h>
+#include <sys/socket.h>
+#include <sys/un.h>
+
+int main(int argc, char * argv[])
+{
+int s, t, len;
+struct sockaddr_un remote_sun;
+char str[102];
+char * sock_path;
+
+if(argc < 2)
+	{
+	printf("nclocal - (c) Lutz Mueller, 2007\n");
+	printf("Send stdin to <socket-path> and output response to stdout\n\n");
+	printf("USAGE: nclocal <socket-path> < message-file\n");
+	exit(0);
+	}
+
+sock_path = argv[1];
+
+if ((s = socket(AF_UNIX, SOCK_STREAM, 0)) == -1)
+	{
+	perror("socket");
+	exit(1);
+	}
+
+remote_sun.sun_family = AF_UNIX;
+strncpy(remote_sun.sun_path, sock_path, sizeof(remote_sun.sun_path) - 1);
+remote_sun.sun_path[sizeof (remote_sun.sun_path) - 1] = '\0';
+
+if (connect(s, (struct sockaddr *)&remote_sun, SUN_LEN(&remote_sun)) == -1)
+	{
+	perror("connect");
+	exit(1);
+	}
+
+while(fgets(str, 100, stdin), !feof(stdin)) 
+	{
+	if (send(s, str, strlen(str), 0) == -1) 
+		{
+		perror("send");
+		exit(1);
+		}
+	}
+
+while((t = recv(s, str, 100, 0)) > 0)
+	{
+	str[t] = '\0';
+	printf("%s", str);
+	}
+
+if(t < 0) perror("recv");
+
+close(s);
+return 0;
+}
+
diff --git a/util/newlisp.vim b/util/newlisp.vim
new file mode 100644
index 0000000..3cbd073
--- /dev/null
+++ b/util/newlisp.vim
@@ -0,0 +1,222 @@
+" Vim syntax file
+" Language:     newLISP
+" Maintainer:   Cyril Slobin <slobin@ice.ru>
+" URL:          http://www.vim.org/scripts/script.php?script_id=2067
+" Another URL:  http://wagner.pp.ru/~slobin/vim/syntax/newlisp.vim
+" Started at:   2007 Nov 07 (The Great Revolution 90th Anniversary)
+" Last change:  2008 Feb 28
+" newLISP site: http://www.newlisp.org/
+
+" $Id: newlisp.vim,v 1.19 2008-02-28 21:10:00+03 slobin Exp $
+
+" This was the alternative Vim syntax file for the newLISP language.
+" Now it is the official Vim syntax file! I am a celebrity! Wow!
+
+" *** Some syntax quirks of newLISP and how this file treats them: ***
+"  
+" * In the following text, the word "character" refers to the ASCII
+"   characters, and the word "symbol" to the lisp symbols (= atoms).
+" 
+" * All built-in symbols are in the same class (Statement); functions,
+"   definitions, macros and control structures aren't distinguished.
+" 
+" * Special syntax for : character (colon) is underway, meantime it is
+"   just highlighted and not checked otherwise.
+"
+" * Quoting character ' (apostrophe) is allowed anywhere, even before
+"   closing parenthesis. Interpreter uses it this way, this file just
+"   does the same.
+"
+" * newLISP interpreter doesn't insist that numbers must be separated
+"   from the following numbers or symbols. E.g. the sequence 1.2.3e4e5
+"   is valid and equal to three tokens 1.2 .3e4 e5. Such a monster is
+"   rather a typo than someones intent, so it is marked as an error.
+" 
+" * If a backlash character \ in a quoted string is not followed by
+"   a valid escape sequence, the interpreter doesn't alarm you, it
+"   just silently removes this character from the string. E.g. the
+"   string "a\b" is equal to the string "ab". Again, this is rather
+"   a typo than someones intent, so it is marked as an error.
+"
+" * Brackets [ ] and braces { } are used by newLISP as the alternate
+"   string delimiters. Although, when they doesn't fit into delimiter
+"   syntax, they treated by interpreter as the ordinary characters.
+"   E.g. {string} is a string while string} is symbol, or [text] is
+"   a string delimiter while text] is a symbol. Such a symbols are
+"   rather typos than someones intent, so they are marked as errors.
+" 
+" * Starting from version 1.13 of this file, the feature of selective
+"   errors disabling was itself disabled. If you want NOT to highlight
+"   nested left parenthesis in the first column, just put the line:
+"
+"     hi link newlispLeftParenError newlispParenthesis
+"
+"   in your .vimrc file, similarly for all other errors.
+"
+" * This syntax file is not compatible with Vim version 5.x and elder.
+"   Where have you dug them out? In fact I haven't tested it even with
+"   version 6.x - I all do my development with 7.1.175.
+
+if exists("b:current_syntax")
+  finish
+endif
+
+syntax case match
+
+setlocal iskeyword=33,36-38,42,43,45-47,48-57,60-64,@,92,94,_,124,126
+
+syn region newlispComment oneline start="[;#]" end="$" contains=newlispTodo,@Spell
+syn keyword newlispTodo FIXME TODO XXX contained
+
+syn region newlispDocComment start="^;;\(\s\|$\)" end="^\(;;\(\s\|$\)\)\@!" contains=newlispTodo,newlispDocExample,newlispDocKeyword,newlispDocItalic,newlispDocMonospace,newlispDocHTMLTag,newlispDocHTMLEntity,@Spell
+syn region newlispDocExample matchgroup=newlispDocKeyword start="^;;\s@example$"ms=s+3 matchgroup=NONE end="^\(;;\(\s\|$\)\)\@!" contained
+syn match newlispDocKeyword "^;;\s@\(module\|index\|description\|location\|version\|author\|syntax\|param\|return\)\s"ms=s+3,me=e-1 contained
+syn match newlispDocKeyword "@link\s"me=e-1 contained
+syn match newlispDocItalic "<[^<>]\+>"hs=s+1,he=e-1 contained
+syn match newlispDocMonospace "'[^']\+'"hs=s+1,he=e-1 contained
+syn match newlispDocHTMLTag "<\/\=\(h1\|h2\|h3\|h4\|i\|em\|b\|tt\|p\|pre\|center\|li\|ul\|blockquote\)>" contained
+syn match newlispDocHTMLTag "<\(br\|hr\)\/\=>" contained
+syn match newlispDocHTMLEntity "&\w\+;" contained
+
+syn cluster newlispListContent contains=TOP,newlispRightParenError
+syn region newlispList matchgroup=newlispParenthesis start="(" end=")" contains=@newlispListContent,newlispListError
+syn region newlispListError matchgroup=newlispLeftParenError start="^(" matchgroup=newlispParenthesis end=")" contains=@newlispListContent,newlispListError contained
+syn match newlispRightParenError ")"
+
+syn match newlispSymbol "\<\([+-]\=\d\)\@!\k\+\>"
+syn match newlispSymbolSpecial "\<\([+-]\=\d\)\@!\k*\W\>"
+syn match newlispSymbolSpecial "\<[A-Z_][0-9A-Z_]*\>"
+
+syn match newlispQuote "'" nextgroup=newlispQuote,newlispQuotedSymbol skipwhite
+syn match newlispQuotedSymbol "\<\([+-]\=\d\)\@!\k\+\>" contained
+
+syn match newlispNumberError "\<[+-]\=\d\k\+\>"
+syn match newlispNumberDec "\<[+-]\=[1-9]\d*\>"
+syn match newlispNumberOct "\<[+-]\=0\o*\>"
+syn match newlispNumberHex "\<[+-]\=0[Xx]\x\+\>"
+
+syn match newlispFloat "\<[+-]\=\d\+[Ee][+-]\=\d\+\>"
+syn match newlispFloat "\<[+-]\=\.\d\+\([Ee][+-]\=\d\+\)\=\>"
+syn match newlispFloat "\<[+-]\=\d\+\.\d*\([Ee][+-]\=\d\+\)\=\>"
+
+syn region newlispStringQuoted start=+"+ skip=+\\"+ end=+"+ contains=newlispEscapeError,newlispEscape
+syn match newlispEscapeError +\\+ contained
+syn match newlispEscape +\\["\\nrt]+ contained
+syn match newlispEscape +\\\d\d\d+ contained
+syn match newlispEscape +\\x\x\x+ contained
+
+syn match newlispBracketError "[][}{]"
+
+syn region newlispStringBraced start="{" end="}" contains=newlispStringBraced
+syn region newlispStringTexted start="\[text\]" end="\[\/text\]"
+
+" This keywords list is based on newLISP v.9.3 release primes.h file 
+
+syn keyword newlispFunction ! != $ % & * + - / : < << <= = > >= >> NaN? ^ abs acos acosh add address
+syn keyword newlispFunction amb and append append-file apply args array array-list array? asin asinh
+syn keyword newlispFunction assoc assoc-set atan atan2 atanh atom? base64-dec base64-enc bayes-query
+syn keyword newlispFunction bayes-train begin beta betai bind binomial callback case catch ceil
+syn keyword newlispFunction change-dir char chop clean close command-line cond cons constant context
+syn keyword newlispFunction context? copy-file cos cosh count cpymem crc32 crit-chi2 crit-z
+syn keyword newlispFunction current-line curry date date-value debug dec def-new default define
+syn keyword newlispFunction define-macro delete delete-file delete-url destroy det device difference
+syn keyword newlispFunction directory directory? div do-until do-while doargs dolist dostring
+syn keyword newlispFunction dotimes dotree dump dump-symbol dup empty? encrypt ends-with env erf
+syn keyword newlispFunction error-event error-number error-text eval eval-string exec exists exit
+syn keyword newlispFunction exp expand explode factor fft file-info file? filter find find-all first
+syn keyword newlispFunction flat float float? floor flt for for-all fork format fv gammai gammaln
+syn keyword newlispFunction gcd get-char get-float get-int get-long get-string get-url global
+syn keyword newlispFunction global? if ifft import inc index int integer integer? intersect invert
+syn keyword newlispFunction irr join lambda? last legal? length let letex letn list list? load local
+syn keyword newlispFunction log lookup lower-case macro? main-args make-dir map mat match max member
+syn keyword newlispFunction min mod mul multiply name net-accept net-close net-connect net-error
+syn keyword newlispFunction net-eval net-listen net-local net-lookup net-peek net-peer net-ping
+syn keyword newlispFunction net-receive net-receive-from net-receive-udp net-select net-send
+syn keyword newlispFunction net-send-to net-send-udp net-service net-sessions new nil? normal not
+syn keyword newlispFunction now nper npv nth nth-set null? number? open or pack parse parse-date
+syn keyword newlispFunction peek pipe pmt pop pop-assoc post-url pow pretty-print primitive? print
+syn keyword newlispFunction println prob-chi2 prob-z process protected? push put-url pv quote quote?
+syn keyword newlispFunction rand random randomize read-buffer read-char read-file read-key read-line
+syn keyword newlispFunction real-path ref ref-all ref-set regex remove-dir rename-file replace
+syn keyword newlispFunction replace-assoc reset rest reverse rotate round save search seed seek
+syn keyword newlispFunction select semaphore sequence series set set-assoc set-locale set-nth
+syn keyword newlispFunction set-ref set-ref-all setq sgn share signal silent sin sinh sleep slice
+syn keyword newlispFunction sort source sqrt starts-with string string? sub swap sym symbol? symbols
+syn keyword newlispFunction sys-error sys-info tan tanh throw throw-error time time-of-day timer
+syn keyword newlispFunction title-case trace trace-highlight transpose trim true? unicode unify
+syn keyword newlispFunction unique unless unpack until upper-case utf8 utf8len uuid wait-pid when
+syn keyword newlispFunction while write-buffer write-char write-file write-line xml-error xml-parse
+syn keyword newlispFunction xml-type-tags zero? \| ~
+
+syn keyword newlispFunction read " introduced in newLISP 9.3.1
+
+syn keyword newlispKeyword fn lambda
+syn keyword newlispVariable ostype $0 $1 $2 $3 $4 $5 $6 $7 $8 $9 $10 $11 $12 $13 $14 $15 $args $idx $main-args 
+
+syn match newlispColon ":"
+syn match newlispComma ","
+
+syn keyword newlispBoolean nil true
+
+hi def link newlispNumberDec newlispNumber
+hi def link newlispNumberOct newlispNumber
+hi def link newlispNumberHex newlispNumber
+
+hi def link newlispStringQuoted newlispString
+hi def link newlispStringBraced newlispString
+hi def link newlispStringTexted newlispString
+
+hi def link newlispLeftParenError newlispError
+hi def link newlispRightParenError newlispError
+hi def link newlispNumberError newlispError
+hi def link newlispEscapeError newlispError
+hi def link newlispBracketError newlispError
+
+hi def link newlispComment Comment
+hi def link newlispTodo Todo
+hi def link newlispDocComment Comment
+hi def link newlispDocExample Comment
+hi def link newlispDocKeyword Type
+hi def link newlispDocItalic CommentItalic
+hi def link newlispDocMonospace CommentUnderlined
+hi def link newlispDocHTMLTag Statement
+hi def link newlispDocHTMLEntity Special
+hi def link newlispList Normal
+hi def link newlispParenthesis Delimiter
+hi def link newlispSymbol Identifier
+hi def link newlispSymbolSpecial Type
+hi def link newlispQuote Type
+hi def link newlispQuotedSymbol Type
+hi def link newlispNumber Number
+hi def link newlispFloat Float
+hi def link newlispString String
+hi def link newlispEscape Special
+hi def link newlispFunction Statement
+hi def link newlispKeyword Statement
+hi def link newlispVariable Statement
+hi def link newlispColon Type
+hi def link newlispComma Type
+hi def link newlispBoolean Boolean
+hi def link newlispError Error
+
+" CommentItalic and CommentUnderlined groups have the same colors as
+" plain Comment, but italic and underlined respectively. Therefore we
+" need to recalculate those attributes on each colorscheme change.
+
+function! s:color_of(where, what)
+  let val = synIDattr(hlID("Comment"), a:what, a:where)
+  return val == "" || val == -1 ? "" : printf(" %s%s=%s", a:where, a:what, val)
+endfunction
+
+function! s:set_colors()
+  let colors =  s:color_of("cterm", "fg") . s:color_of("cterm", "bg") . s:color_of("gui", "fg") . s:color_of("gui", "bg")
+  exec "hi CommentItalic term=italic cterm=italic gui=italic" . colors
+  exec "hi CommentUnderlined term=underline cterm=underline gui=underline" . colors
+endfunction
+
+au ColorScheme <buffer> call s:set_colors()
+call s:set_colors()
+
+let b:current_syntax = "newlisp"
+
+" vim: textwidth=70
diff --git a/util/newlispdoc b/util/newlispdoc
new file mode 100755
index 0000000..66244e0
--- /dev/null
+++ b/util/newlispdoc
@@ -0,0 +1,496 @@
+#!/usr/bin/newlisp
+
+# newlispdoc - generates html documentation from newLISP source files
+
+# Copyright (C) 1992-2007 Lutz Mueller <lutz@nuevatec.com>
+ 
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License version 2, 1991,
+# as published by the Free Software Foundation.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+ 
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+
+;; @module newlispdoc
+;; @description Generates documentation and hightligted source from newLISP source files.
+;; @version 1.3 - handle remote files specified in URLs in a url-file
+;; @version 1.4 - title on page changed to index or module name and new index module option
+;; @version 1.5 - removed font restrictions on h1,h2,h3,h4 and added hr as a legal tag
+;; @author Lutz Mueller, 2006, 2007
+;; @location http://newlisp.org
+;;
+;; <h3>Usage:</h3>
+;; The <tt>-s</tt> switch can be used to generate highlighted source files.
+;; <pre>
+;;    newlispdoc afile.lsp bfile.lsp
+;;    newlispdoc -s afile.lsp bfile.lsp
+;;    newlispdoc -s *.lsp
+;;
+;;    ; or on Win32
+;;    newlisp newlispdoc afile.lsp bfile.lsp
+;;    newlisp newlispdoc -s afile.lsp bfile.lsp
+;;    newlisp newlispdoc -s *.lsp
+;; </pre>
+;; newlispdoc can take a file of URLs and generate documentation and syntax
+;; highlighted source from remote files:
+;; <pre>
+;;    newlispdoc -url file-with-urls.txt 10000
+;;    newlispdoc -s -url file-with-urls.txt 10000
+;;
+;;    ; or on Win32
+;;    newlisp newlispdoc -url file-with-urls.txt 10000
+;;    newlisp newlispdoc -s -url file-with-urls.txt 10000
+;; </pre>
+;; file-with-urls.txt contains one URL per line in the file. A URLstarts either 
+;; with http:// or file:// - This allows mixing  remote and local files. An optional 
+;; timeout of 10 seconds is specified after the url file name. If no timeout is specified
+;; newlispdoc assumes 5 seconds.
+;;
+;; Execute from within the same directory of the source files when
+;; no url file is given.
+;;
+;; For each file a file with the same name and extension '.html' is generated
+;; and written to the current directory. A file 'index.htm' is written as
+;; an index for all other files generated. If the '-s' switch is specified,
+;; a file with the extension '.src.html' is generated for each file.
+;;
+;; Please read @link http://newlisp.org/newLISPdoc.html newLISPdoc.htm to learn
+;; about tagging of newLISP source code for newlispdoc.
+;;
+
+(set 'version "1.5")
+
+; get list of files from command line
+(set 'files (2 (main-args)))
+
+(if (empty? files)
+	(begin
+		(println "USAGE: newlispdoc [-s] <file-names>")
+		(println "USAGE: newlispdoc [-s] -url <file-with-urls>")
+		(exit -1)))
+
+
+(set 'prolog1
+[text]<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+<META http-equiv="Content-Type" content="text/html; charset=utf-8">
+<title>%s</title>
+[/text])
+
+(set 'stylesheet
+[text]
+<style type="text/css" media="screen">
+<!--
+span.arw {
+	color:#666666;
+	}
+	
+body, p {
+	font-family: Georgia, Times New Roman, Times, serif;
+ 	}
+
+h1, h2, h3, h4 {
+	font-family: Georgia, Times New Roman, Times, serif;
+	}
+
+pre {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	}
+
+tt {
+	font-family: Andale Mono, "Bitstream Vera Sans Mono", Monaco, "Courier New";
+	}
+-->
+</style>
+</head>
+[/text])
+
+(set 'prolog2
+[text]
+<body style="margin: 20px;" text="#333333" bgcolor="#FFFFFF" 
+			link="#376590" vlink="#551A8B" alink="#ffAA28">
+<blockquote>
+<center><h1>%s</h1></center>
+[/text])
+
+(set 'prolog3 {<p><a href="index.html">Module index</a></p>})
+
+(set 'epilog [text]
+<p></p><center>- &part; -</center><br/>
+<center><font face='Arial' size='-2' color='#444444'>
+generated with <a href="http://newlisp.org">newLISP</a>&nbsp;
+and <a href="http://newlisp.org/newLISPdoc.html">newLISPdoc</a>
+</font></center>
+</blockquote>
+</body>
+</html>
+[/text])
+
+; ---------- routines for generating syntax-highlighted file <file-name>.src.html ------------------
+
+(define keyword-color "#0000AA")      ; newLISP keywords
+(define string-color "#008800")       ; single line quoted and braced strings
+(define long-string-color "#008800")  ; multiline for [text], [/text] tags
+(define paren-color "#AA0000")        ; parenthesis
+(define comment-color "#555555")      ; comments
+(define number-color "#665500")       ; numbers
+
+(define function-name-color "#000088")    ; not implemented yet for func in (define (func x y z) ...)
+
+(set 'keywords (map name (filter (fn (x) (primitive? (eval x))) (sort (symbols) > ))))
+(push "nil" keywords)
+(push "true" keywords)
+(set 'keyword-regex (join keywords "|"))
+(replace "?" keyword-regex "\\?")
+(replace "$" keyword-regex "\\$")
+(replace "!" keyword-regex "\\!")
+(replace "+" keyword-regex "\\+")
+(replace "*" keyword-regex "\\*")
+(replace "||" keyword-regex "|\\|")
+(set 'keyword-regex (append {(\s+|\(|\))(} keyword-regex {)(\s+|\(|\))}))
+
+(define (clean-comment str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace {[text]} str "&#091&text]")
+	(replace {[/text]} str "&#091&/text]")
+)
+
+(define (format-quoted-string str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace ";" str "&#059&")
+	(replace "{" str "&#123&")
+	(replace "}" str "&#125&")
+	(replace {\} str "&#092&")
+	(replace {[text]} str "&#091&text]")
+	(replace {[/text]} str "&#091&/text]")
+	(format {<font color='%s'>%s</font>} string-color str)
+)
+
+(define (format-braced-string str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace ";" str "&#059&")
+	(replace {"} str "&#034&")
+	(replace {[text]} str "&#091&text]")
+	(replace {[/text]} str "&#091&/text]")
+	(format {<font color='%s'>%s</font>} string-color str)
+)
+
+(define (format-tagged-string str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace ";" str "&#059&")
+	(format {<font color='%s'>%s</font>} string-color str)
+)
+
+(define (write-syntax-highlight src-file outputfile)
+	; replace special HTML characters
+	(replace "\r\n" src-file "\n")
+	(replace "&" src-file "&amp&")
+	(replace "<(\\w)" src-file (append "&lt&" $1) 0)
+	(replace "(\\w)>" src-file (append $1 "&gt&") 0)
+	(replace "/>" src-file "/&gt&" 0)
+	(replace "</" src-file "&lt&/" 0)
+	(replace "<!" src-file "&lt&!" 0)
+	; replace escaped quotes
+	(replace  "\092\034"  src-file "&#092&&#034&")
+
+	; color keywords
+	(replace keyword-regex src-file 
+		(format {%s<font color='%s'>%s</font>%s} $1 keyword-color $2 $3) 0)
+
+	; color numbers
+	(replace {(\s+|\(|\))(0x[0-9a-fA-F]+|[+-]?\d+\.\d+|[+-]?\d+|\.\d+)} src-file 
+         (format {%s<font color='%s'>%s</font>} $1 number-color $2) 0)
+
+	; color parens
+	(replace "(" src-file (format {<font color='%s'>(</font>} paren-color))
+	(replace ")" src-file (format {<font color='%s'>)</font>} paren-color))
+
+	; color braced strings
+	(replace "{.*?}" src-file (format-braced-string $0) 0) ; no multiline string
+	; color quoted strings
+	(replace {".*?"} src-file (format-quoted-string $0) 0) ; no multiline strings
+
+	; color ;  comments
+	(replace ";.*" src-file (clean-comment $0) 0)
+	(replace ";.*" src-file (format {<font color='%s'>%s</font>} comment-color $0) 0)
+
+	; color # comments
+	(set 'buff "")
+	(dolist (lne (parse src-file "\n"))
+		(replace "^\\s*#.*" lne  (clean-comment $0) 0)
+		(replace "^\\s*#.*" lne (format {<font color='%s'>%s</font>} comment-color $0) 0)
+		(write-line lne buff))
+
+	(set 'src-file buff)
+
+	; color tagged strings
+	(replace {\[text\].*?\[/text\]} src-file 
+		(format-tagged-string $0) 4) ; handles multiline strings
+
+	; xlate back special characters
+	(replace "&amp&" src-file "&amp;")   ; ampersand
+	(replace "&lt&" src-file "&lt;")     ; less
+	(replace "&gt&" src-file "&gt;")     ; greater
+	(replace {&#034&} src-file "&#034;") ; quotes
+	(replace {&#059&} src-file "&#059;") ; semicolon
+	(replace {&#123&} src-file "&#123;") ; left curly brace
+	(replace {&#125&} src-file "&#125;") ; right curly brace
+	(replace {&#091&} src-file "&#091;") ; left bracket
+	(replace {&#092&} src-file "&#092;") ; back slash
+
+	; add pre and post tags
+	(write-file (string outputfile ".src.html") 
+		(append
+			"<html><body><pre>\n" src-file "\n</pre>" 
+			{<center><font face='Arial' size='-3' color='#666666'>}
+			{syntax highlighting with <a href="http://newlisp.org">newLISP</a>&nbsp;}
+			{and <a href="http://newlisp.org/newLISPdoc.html">newLISPdoc</a>}
+			{</font></center></body></html>}))
+)
+
+;---------------------------------- End syntax highlighting routines ------------------------
+
+; get command line switch -s for generating syntax highlighted source
+(let (pos (find "-s" files))
+	(if pos
+		(begin
+			(pop files pos)
+			(set 'source-link true))))
+
+; get command line switch -url for retrieving files via http from remote location
+(let (pos (find "-url" files))
+	(if pos
+		(begin
+			(pop files pos)
+			(set 'url-file (files pos))
+			(set 'time-out (int (last files) 5000)))))
+
+; if url-file is specified make a list of all urls
+(if url-file
+	(set 'files (parse (read-file url-file) "\\s+" 0)))
+
+(if (= (last files) "") (pop files -1))
+
+(set 'indexpage "") ; buffer for modules index page
+(write-buffer indexpage (format prolog1 "Index"))
+(write-buffer indexpage stylesheet)
+(write-buffer indexpage (format prolog2 "Index"))
+
+; reformat
+
+(define (protect-html text)
+	(replace "<h1>" text "[h1]")
+	(replace "<h2>" text "[h2]")
+	(replace "<h3>" text "[h3]")
+	(replace "<h4>" text "[h4]")
+	(replace "</h1>" text "[/h1]")
+	(replace "</h2>" text "[/h2]")
+	(replace "</h3>" text "[/h3]")
+	(replace "</h4>" text "[/h4]")
+	(replace "<i>" text "[i]")
+	(replace "</i>" text "[/i]")
+	(replace "<em>" text "[em]")
+	(replace "</em>" text "[/em]")
+	(replace "<b>" text "[b]")
+	(replace "</b>" text "[/b]")
+	(replace "<tt>" text "[tt]")
+	(replace "</tt>" text "[/tt]")
+	(replace "<p>" text "[p]")
+	(replace "</p>" text "[/p]")
+	(replace "<br>" text "[br]")
+	(replace "<br/>" text "[br/]")
+	(replace "<pre>" text "[pre]")
+	(replace "</pre>" text "[/pre]")
+	(replace "<center>" text "[center]")
+	(replace "</center>" text "[/center]")
+	(replace "<li>" text "[li]")
+	(replace "</li>" text "[/li]")
+	(replace "</ul>" text "[/ul]")
+	(replace "<ul>" text "[ul]")
+	(replace "</blockquote>" text "[/blockquote]")
+	(replace "<blockquote>" text "[blockquote]")
+	(replace "<hr>" text "[hr]") 
+	(replace "<hr/>" text "[hr/]") 
+)
+
+(define (unprotect-html text)
+	(replace "[h1]" text "<h1>")
+	(replace "[h2]" text "<h2>")
+	(replace "[h3]" text "<h3>")
+	(replace "[h4]" text "<h4>")
+	(replace "[/h1]" text "</h1>")
+	(replace "[/h2]" text "</h2>")
+	(replace "[/h3]" text "</h3>")
+	(replace "[/h4]" text "</h4>")
+	(replace "[i]" text "<i>")
+	(replace "[/i]" text "</i>")
+	(replace "[em]" text "<em>")
+	(replace "[/em]" text "</em>")
+	(replace "[b]" text "<b>")
+	(replace "[/b]" text "</b>")
+	(replace "[tt]" text "<tt>")
+	(replace "[/tt]" text "</tt>")
+	(replace "[p]" text "<p>")
+	(replace "[/p]" text "</p>")
+	(replace "[br]" text "<br>")
+	(replace "[br/]" text "<br/>")
+	(replace "[pre]" text "<pre>")
+	(replace "[/pre]" text "</pre>")
+	(replace "[center]" text "<center>")
+	(replace "[/center]" text "</center>")
+	(replace "[li]" text "<li>")
+	(replace "[/li]" text "</li>")
+	(replace "[ul]" text "<ul>")
+	(replace "[/ul]" text "</ul>")
+	(replace "[blockquote]" text "<blockquote>")
+	(replace "[/blockquote]" text "</blockquote>")
+ 	(replace "[hr]" text "<hr>") 
+	(replace "[hr/]" text "<hr/>") 
+)
+
+; format the example tags
+(define (format-example text)
+	(replace "<" text "&lt;")
+	(replace ">" text "&gt;")
+	(string "<p></p><b>example:</b><blockquote><pre>" (replace ";;" text "") "</pre></blockquote>\n")
+)
+
+; write the module tag link on the index page
+; put source link on doc page if -s flag
+(define (format-module text desc filename , module)
+	(set 'module (string "<br/><br/><h2>Module:&nbsp;" text "</h2>"))
+	(write-buffer indexpage (string {<a href="} filename {.html">} module "</a>\n" ))
+	(write-buffer indexpage (string "<p>" desc "</p>\n"))
+	(if source-link
+		(string {<a href="} filename {.src.html">source</a>} module)
+		(string "<br/>" module))
+)
+
+; write the function name links on the index page under the module
+(define (format-func-link func-name file-name)
+		(let (names (if (find ":" func-name) (parse func-name ":") (list "" func-name)))
+			(write-buffer indexpage (string {<a href="} file-name 
+					{.html#} (names 0) "_" (names 1) {">} (names 1) {</a>&nbsp; &nbsp; }))
+			(string (names 0) "_" (names 1))
+		)
+)
+
+; format the syntax line
+(define (format-syntax text file-name, tag)
+	(replace "<([^<]*?)>" text (string "<em>" $1 "</em>") 0)
+	(replace {^ *\((.*?) (.*?\))} text (string "(<font color=#CC0000>" $1 "</font> " $2) 0)
+	(replace {^ *\(([^ ]*?)\)} text (string "(<font color=#CC0000>" $1 "</font>)") 0)
+	(string
+		(unless (= old-syntax $1)
+			(begin
+				(set 'old-syntax $1)
+				(set 'tag (format-func-link $1 file-name))
+				(set 'tag (string {<a name="} tag {"></a>}))
+				(string "<p></p><center>- &sect; -</center><p></p>\n" tag
+						"<h3><font color=#CC0000>" old-syntax "</font></h3>\n"))
+		"")
+		"<b>syntax: " (trim text) "</b><br/>\n")
+)
+
+(define (format-parameter param text)
+;	(replace "<([^<]*?)>" param (string "<em>" $1 "</em>") 0)
+;	(replace "<([^<]*?)>" text (string "<em>" $1 "</em>") 0)
+	(string "<b>parameter: </b>" (format-text (trim param)) " - " (format-text text) "<br/>\n")
+)
+
+(define (format-return text)
+	(string "<p><b>return: </b>" (format-text text) "</p>\n") 
+)
+
+(define (format-text text)
+	(replace "<([^<]*?)>" text (string "<em>" $1 "</em>") 0)
+	(replace "'([^\\s].*?[^\\s])'" text (string "<tt>" $1 "</tt>") 0)
+)
+
+;---------------------------------- End newlisdoc formatting subroutines ----------------
+; MAIN function
+
+(dolist (fle files)
+	(println fle)
+	(set 'html "")
+
+	(set 'original (read-file fle time-out))
+
+	(if (not original)
+		(begin
+			(println "Could not read " fle)
+			(exit 1)))
+
+	(if (starts-with original "ERR:")
+		(println "Could not read " fle " " original))
+
+	(set 'outfile (last (parse fle "\\\\|/" 0)))
+
+	(set 'page (parse (replace "\r\n" original "\n") "\n"))
+
+	(set 'page (filter (fn (ln) (or (starts-with ln ";;") (= (length (trim ln)) 0))) page))
+	(set 'page (join page "\n"))
+
+	; link to another index page
+	(if (find ";; *@index ([^ ]*?) ([^ ]*?)\n" page 0)
+		(begin
+			(write-buffer indexpage 
+				(string {<br /><br /><h2><a href="} $2 {">Index:&nbsp;} $1 "</a></h2>\n"))
+			(if (find ";; *@description (.*?)\n" page 0)
+				(write-buffer indexpage (string $1 "<br/>\n")))
+		)
+	)
+		
+
+	(if (find ";; *@module " page 0)
+		(begin
+			(replace ";; @example *\n(.*?)\n\\s*\n" page (format-example $1) 4)
+			(set 'page (protect-html page))
+			(set 'desc "")
+			(replace ";; *@description (.*?)\n" page (begin (set 'desc $1) (string "<p>" desc "</p>\n") ) 0)
+			(replace ";; *@module (.*?)\n" page (format-module $1 desc outfile)  0)
+			(replace ";; *@author (.*?)\n" page (string "<b>Author: </b>" $1 "<br/>\n")  0)
+			(replace ";; *@version (.*?)\n" page (string "<b>Version: </b>" $1 "<br/>\n")  0)
+			(replace ";; *@location (.*?)\n" page 
+				(string {<b>Location: </b><a href="} $1 {">} $1 "</a><br/>\n")  0)
+			(replace ";; *@syntax (.*?)\n" page (format-syntax $1 outfile) 0)
+			(replace ";; *@param (.*?) (.*?)\n" page (format-parameter $1 $2) 0)
+			(replace ";; *@return (.*?)\n" page (format-return $1)  0)
+			(replace ";;\\s*\n" page "<p></p>\n" 0)
+			(replace ";;(.*\n)" page (format-text $1) 0)
+			(replace {@link ([^ ]*?) ([^ ]*?)\s} page (string {<a href="} $1 {">} $2 {</a> }) 0)
+			(set 'page (unprotect-html page))
+			(write-buffer html (format prolog1 outfile))
+			(write-buffer html stylesheet)
+			(write-buffer html (format prolog2 outfile))
+			(write-buffer html prolog3)
+			(write-buffer html page)
+			(write-buffer html epilog)
+
+			(write-file (string outfile ".html") html)
+
+			; write syntax highlighted source	
+			(if source-link
+				(write-syntax-highlight original outfile))
+
+		)
+	)
+)
+	
+; write the modules index page
+(write-buffer indexpage epilog)
+(write-file "index.html" indexpage)
+
+(exit)
+
diff --git a/util/pagetest.txt b/util/pagetest.txt
new file mode 100644
index 0000000..822dcda
--- /dev/null
+++ b/util/pagetest.txt
@@ -0,0 +1,251 @@
+<br/><br/><br/><h2>Module:&nbsp;mysql5.lsp </h2><p>MySQL v.5 interface</p>
+<b>Version: </b>2.6 - addition for mysql_escape_string (Jeff)<br/>
+<b>Author: </b>Lutz Mueller 2003-2006, Gordon Fischer 2005, Jeff Ober 2007<br/>
+<p></p>
+ This MySQL 5 interface module has been tested on version 5.0.19
+ of mysql from <a href="http://www.mysql.com">www.mysql.com</a> <p></p>
+ This implementation supports a maximum of 2,147,483,647
+ rows in a database table. Now automatically adjusts row indexes to
+ endian type of host CPU, but higher 32 bits are treated as 0 for now.
+<p></p>
+ @seealso here here  here
+<p></p>
+ [h3]Requirements[/h3]
+ At the beginning of the program file include a <tt>load</tt> statment for the module:
+ [pre]
+ (load "/usr/share/newlisp/mysql5.lsp")
+ [/pre]
+<p></p>
+ A version of <tt>libmysqlclient</tt> for a specific platform is required:
+<p></p>
+ on LINUX/UNIX: <tt>/usr/local/mysql/libmysqlclient.15.so</tt> [br]
+ on Mac OS X:   <tt>/usr/local/mysql/libmysqlclient.15.dylib</tt>
+<p></p>
+ To compile MySQL with client libraries use:
+<p></p>
+ <tt>./configure --prefix=/usr/local --enable-shared</tt>
+<p></p>
+ This library might be in a different location on a particular
+ installation of MySQL or have a different name.
+ Change accordingly in the code at the beginning.
+<p></p>
+ The MySQL server itself may reside on a different machine
+ on the network. The library <tt>libmysqlclient</tt> will communicate
+ with that server. The correct connection is created using
+ the <tt>MySQL:connect</tt> call.
+<p></p>
+ At the bottom of the module file <tt>mysql5,lsp</tt> a test routine <tt>test-mysql</tt>
+ is included to test for correct installation of MySQL.
+<p></p>
+ In the <tt>MySQL:connect</tt> call of that test routine the correct parameters 
+ for the MySQL server location and user and password have to be inserted.
+<p></p>
+ [h3]Adapting mysql.lsp to other versions of MySQL[/h3]
+ Some of the functions like <tt>mysql_num_rows()</tt> cannot be imported
+ because they are really macros extracting data from structures
+ like <tt>MYSQL</tt> or <tt>MYSQL_RES</tt>. See the file <tt>mysql.h</tt> in your MySQL distribution.
+<p></p>
+ The file <tt>sql.c</tt> in the newLISP distribution contains a program
+ calculating the offsets of the most important fields in these
+ structures. These offsets are used here to retrieve values for
+ the number of rows in a result set, etc. Using these offsets
+ and the information found in <tt>mysql.h</tt> and <tt>mysql_com.h</tt>, other
+ functions can be imported and wrappers built around them.
+ In this case one needs to install the developer's version of
+ MySQL to get the header files mentioned.
+<p></p>
+ [h3]Functions available[/h3]
+ [pre]
+     MySQL:init ................ get a database handle MYSQL
+     MySQL:connect ............. connect to a database
+     MySQL:query ............... execute a SQL statement
+     MySQL:num-rows ............ rows in result of query
+     MySQL:num-fields .......... columns in result of query
+     MySQL:fetch-row ........... get row from the query result
+     MySQL:fetch-all ........... get all rows from the last query
+     MySQL:database ............ return all database names
+     MySQL:tables .............. return all tables names
+     MySQL:fields .............. return all fields in a table
+     MySQL:data-seek ........... position in result for fetching
+     MySQL:affected-rows ....... number of affected rows from operation
+     MySQL:inserted-id ......... last value of auto increment id operation
+     MySQL:escape .............. escapes SQL input string using mysql_real_escape_string
+     MySQL:error ............... get error message
+     MySQL:close-db ............ close database connection
+ [/pre]
+<p></p>
+ [h3]A typical MySQL session[/h3]
+ The following code piece outlines a typical MySQL session:
+[p][/p][b]example:[/b][blockquote][pre] (load "mysql5.lsp) ; load the module file
+
+ (MySQL:init)       ; initialize
+ (MySQL:connect "192.168.1.10" "auser" "secret" "mydb") ; logon
+ (MySQL:query "select ...;") ; SQL query
+ (MySQL:query "insert ...;") ; SQL query
+        ...
+ (MySQL:close-db)[/pre][/blockquote]
+ The database server is listening on IP 192.168.1.10. The program
+ connects with username <tt>"auser"</tt> password <tt>"secret"</tt> to a database with 
+ the name <tt>"mydb"</tt>. After connecting SQL statements are performed and
+ finally the program disconnects from the server.
+
+
+
+
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_init"></a><h3><font color=#CC0000>MySQL:init</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:init</font>)</b><br/>
+<p><b>return: </b><tt>true</tt> on success, <tt>nil</tt> on failure.</p>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_connect"></a><h3><font color=#CC0000>MySQL:connect</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:connect</font> <em>str-server</em> <em>str-userID</em> <em>str-password</em> <em>str-db</em>)</b><br/>
+<b>parameter: </b><em>str-server</em> - The host name or IP address or [tt]0[/tt] for localhost.<br/>
+<b>parameter: </b><em>str-userID</em> - The user ID for authentication.<br/>
+<b>parameter: </b><em>str-password</em> - The password for authentication.<br/>
+<b>parameter: </b><em>str-db</em> - The name of the database to connect to.<br/>
+<p><b>return: </b><tt>true</tt> for success or <tt>nil</tt> for failure.</p>
+<p></p>
+ Connects to a database on server and authenticates a user ID.
+ <tt>(MySQL:init)</tt> must have been called previously.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_query"></a><h3><font color=#CC0000>MySQL:query</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:query</font> <em>str-sql</em>)</b><br/>
+<b>parameter: </b><em>str-sql</em> - A valid SQL query string.<br/>
+<p><b>return: </b>For <tt>insert</tt> queries rerturns the inserted ID else <tt>true</tt> </p>
+ for success or <tt>nil</tt> for failure.
+<p></p>
+ Sends a SQL query string to the database server for evaluation.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_num-rows"></a><h3><font color=#CC0000>MySQL:num-rows</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:num-rows</font>)</b><br/>
+<p><b>return: </b>Number of rows from last query.</p>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_num-fields"></a><h3><font color=#CC0000>MySQL:num-fields</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:num-fields</font>)</b><br/>
+<p><b>return: </b>Number of columns from last query.</p>
+
+
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_fetch-row"></a><h3><font color=#CC0000>MySQL:fetch-row</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:fetch-row</font>)</b><br/>
+<p><b>return: </b>A list of field elements.</p>
+<p></p>
+ Fetches a row from a previous SQL <tt>MySQL:query</tt>  <tt>select</tt> statement.
+ Subsequent calls fetch row by row from the result table until the
+ end of the table is reached.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_fetch-all"></a><h3><font color=#CC0000>MySQL:fetch-all</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:fetch-all</font>)</b><br/>
+<p><b>return: </b>All rows/fields from the last query.</p>
+<p></p>
+ The whole result set from the query is returned at once as a list of row lists.
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_databases"></a><h3><font color=#CC0000>MySQL:databases</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:databases</font>)</b><br/>
+<p><b>return: </b>A list of databases.</p>
+<p></p>
+ Performs a <tt>show databases;</tt> query.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_table"></a><h3><font color=#CC0000>MySQL:table</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:table</font>)</b><br/>
+<p><b>return: </b>A list of tables in the database.</p>
+<p></p>
+ Performs a <tt>show tables;</tt> query.
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_fields"></a><h3><font color=#CC0000>MySQL:fields</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:fields</font> <em>str-table</em>)</b><br/>
+<b>parameter: </b><em>str-table</em> - The name of the table.<br/>
+<p><b>return: </b>A list of field description lists.</p>
+<p></p>
+ For each field name in the table a list of specifications
+ for that field is returned. The list starts with the name
+ for the field followed by the type size/precision and
+ other optional field descriptions.
+
+  
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_data-seek"></a><h3><font color=#CC0000>MySQL:data-seek</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:data-seek</font> <em>num-offset</em>)</b><br/>
+<b>parameter: </b><em>num-offset</em> - The [tt]0[/tt] based offset to position inside the data set.<br/>
+<p><b>return: </b>Always <tt>true</tt>. </p>
+<p></p>
+ Positions in the result set at a zero based offset
+ for a subsequent <tt>MySQL:fetch-row</tt> call. If the offset
+ is out of the allowed range for the result set a subsequent
+ fetch-row will return <tt>nil</tt>.
+ 
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_error"></a><h3><font color=#CC0000>MySQL:error</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:error</font>)</b><br/>
+<p><b>return: </b>Text info about the last error which occured.</p>
+
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_affected-rows"></a><h3><font color=#CC0000>MySQL:affected-rows</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:affected-rows</font>)</b><br/>
+<p><b>return: </b>Number of affected rows by the last <tt>MySQL:query</tt> operation.</p>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_inserted-id"></a><h3><font color=#CC0000>MySQL:inserted-id</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:inserted-id</font>)</b><br/>
+<p><b>return: </b>Last insert ID from an auto increment field.</p>
+
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_escape"></a><h3><font color=#CC0000>MySQL:escape</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:escape</font> <em>str-sql</em>)</b><br/>
+<p><b>return: </b>escaped string</p>
+<p></p>
+ This function will escape special characters in <em>str-sql</em>, so that it 
+ is safe to place it in a MySQL query.
+
+<p></p><center>- &sect; -</center><p></p>
+<a name="MySQL_close-db"></a><h3><font color=#CC0000>MySQL:close-db</font></h3>
+<b>syntax: (<font color=#CC0000>MySQL:close-db</font>)</b><br/>
+<p><b>return: </b>Always <tt>true</tt>.</p>
+<p></p>
+ Closes database access. For new database acess, both <tt>MySQL:init</tt> and 
+ <tt>MySQL:connect</tt> functions have to be called.
+
+
+
+
+  
+
+  
+  
+
+
+  
+  
+
+  
+  
+
diff --git a/util/preparepdf b/util/preparepdf
new file mode 100755
index 0000000..2b409b5
--- /dev/null
+++ b/util/preparepdf
@@ -0,0 +1,26 @@
+#!/usr/bin/newlisp
+#
+# this utility is called from Makefile:
+#     make preparepdf
+# to prepare the file for PDF conversion, byt replaceing all <span class="function"></span>
+# with <font color="#DD0000"></font> in the syntax statements and replacing &rarr; (one line
+# arrow with &rArr; (double line arrow)
+#
+# USAGE: preparepdf newlisp_manual.html newlisp_manual_preparepdf.html
+#
+(set 'text (read-file (main-args 2))) ; input file
+
+(replace {(<h2><span class="function">)(.*?)(</span></h2>)} text 
+         (append {<h2><font color="#DD0000">} $2 {</font></h2>}) 0)
+
+(println $0 " replacements made for syntax color")
+
+(replace {&rarr;} text {&rArr;} 0)
+
+(println $0 " replacements made for arrow code")
+
+(write-file (main-args 3) text) ; output file
+
+(exit)
+
+
diff --git a/util/sql.c b/util/sql.c
new file mode 100644
index 0000000..6907d78
--- /dev/null
+++ b/util/sql.c
@@ -0,0 +1,73 @@
+/* 
+  sql.c - find offsets of important data fields in MySQL data structures 
+
+  version 1.1, (c) Lutz Mueller 2004, released under the GNU GPL License
+  version 1.2 added 2 more include files for 4.0
+
+  compile using: gcc sql.c -o sql
+
+  then do: ./sql
+  to obtain a list of offsets in MySQL data structures
+
+  this program is only needed when designing new MySQL support functions
+  in newLISP and the MySQL data structures have to be accessed directly
+
+  the values produced by this program are used in the file mysql.lsp.
+
+  See also /usr/share/newlisp/mysql.lsp
+
+*/
+
+
+#define LINUX
+/* #define MACOSX */
+
+#include <stdio.h>
+#include <unistd.h>
+#include <stdlib.h>
+
+#ifdef MACOSX
+#include "/usr/local/mysql/include/mysql.h"
+#include "/usr/local/mysql/include/mysql_com.h"
+#include "/usr/local/mysql/include/mysql_version.h"
+#include "/usr/local/mysql/include/my_alloc.h"
+#endif
+
+#ifdef LINUX
+#include "/usr/include/mysql/mysql.h"
+#include "/usr/include/mysql/mysql_com.h"
+#include "/usr/include/mysql/mysql_version.h"
+#include "/usr/include/mysql/my_alloc.h"
+#endif
+
+MYSQL  * mysql;
+MYSQL_RES  * mysql_res;
+
+
+int main(int argc, char ** argv)
+{
+printf("sizeof(MYSQL)       %d\n", sizeof(MYSQL));
+printf("sizeof(MYSQL_RES)   %d\n", sizeof(MYSQL_RES));
+printf("sizeof(MYSQL_ROW)   %d\n", sizeof(MYSQL_ROW));
+printf("sizeof(MYSQL_FIELD) %d\n", sizeof(MYSQL_FIELD));
+printf("sizeof(NET) %d\n", sizeof(NET));
+printf("sizeof(my_ulonglong) %d\n", sizeof(my_ulonglong));
+printf("sizeof(my_bool) %d\n\n", sizeof(my_bool));
+
+mysql = 0;
+mysql_res = 0;
+
+printf("offset mysql->affected_rows: %d\n", &mysql->affected_rows);
+printf("offset mysql->insert_id: %d\n", &mysql->insert_id);
+printf("offset mysql->net.last_error: %d\n", &mysql->net.last_error);
+
+printf("offset mysql_res->row_count: %d\n", &mysql_res->row_count);
+printf("offset mysql_res->field_count: %d\n", &mysql_res->field_count);
+printf("offset mysql_res->eof: %d\n", &mysql_res->eof);
+
+
+return 0;
+}
+
+/* eof */
+
diff --git a/util/standard.lsp b/util/standard.lsp
new file mode 100644
index 0000000..d72e237
--- /dev/null
+++ b/util/standard.lsp
@@ -0,0 +1,3 @@
+;; @index Standard http://newlisp.org/code/modules
+;; @description Standard modules shipped with the distribution
+
diff --git a/util/syntax-help b/util/syntax-help
new file mode 100644
index 0000000..7a19d68
--- /dev/null
+++ b/util/syntax-help
@@ -0,0 +1,21 @@
+;; syntax-help
+;; include this in your init.lsp for syntax commandline help on Mac OS X
+;; or other UNIX operating systems.
+;; example:
+;;   > (help starts-with)
+;;   syntax: (starts-with <str str-key> [<num-option>] )
+;;   syntax: (starts-with <list> [<expr>] )
+;;
+;; For Win32 change the manual path accordingly
+
+(define-macro (help)
+	(let (func-name (name (args 0)))
+		(dolist (item 
+			(find-all (format {<b>(syntax: \(%s.*?)</b>} func-name) 
+				(read-file "/usr/share/doc/newlisp/newlisp_manual.html") $1)) ; UNIX
+			(replace "<em>" item "<")
+			(replace "</em>" item ">")
+			(println  item ""))))
+
+;; eof
+	
diff --git a/util/syntax.cgi b/util/syntax.cgi
new file mode 100755
index 0000000..aae6996
--- /dev/null
+++ b/util/syntax.cgi
@@ -0,0 +1,193 @@
+#!/usr/bin/newlisp
+
+# comment following line out when using as CGI utilty
+# in this case files to convert which are local must end with .txt
+#(define cgi-use true)
+
+# syntax.cgi 2.1
+#
+# v.1.7 - switch for using as commandline or cgi utility
+# v.1.9 - fixed highlighting problem with escaped quotes
+# v.2.0 - fixed \r\n translation
+# v.2.1 - more compatible CGI
+#
+# formats newLISP source files with syntax highlighting in HTML
+#
+# use on the command line or as cgi file together with a webserver
+# 
+# EXAMPLE command line:
+#
+#    ./syntaxi.cgi mysource.lsp > mysource.lsp.html
+#
+# formats mysorce.lsp and redirects output to a new file mysource.lsp.html
+#
+# EXAMPLE webserver CGI (tested on Apache) local files must end in txt for security
+#
+#    http://www.mysite.com/syntax.cgi?mysource.lsp.txt
+#
+# returns mysorce.lsp HTML formatted to the requesting client (browser)
+#
+# EXAMPLE webserver CGI with other site URL
+#
+#    http://www.mysite.com/syntax.cgi?http://othersite/afile.lsp
+#
+# displays afile.lsp formateed from other site
+#
+# the following situations are not handled correctly:
+#    - nested curly braces for strings like {abd{def}ghi}
+#    - multiline quoted strings, use [text] [/text] instead
+#    - multiline braced strings, use [text] [/text] instead
+#    - comments starting with # but not starting at beginning of line
+#      use ; as comment starter when comment appears after code
+
+(if cgi-use 
+	(print "Content-type: text/html\r\n\r\n"))
+
+(define keyword-color "#0000AA")      ; newLISP keywords
+(define string-color "#008800")       ; single line quoted and braced strings
+(define long-string-color "#008800")  ; multiline for [text], [/text] tags
+(define paren-color "#AA0000")        ; parenthesis
+(define comment-color "#555555")      ; comments
+(define number-color "#665500")       ; numbers
+
+(define function-name-color "#000088")    ; not implemented yet for func in (define (func x y z) ...)
+
+(set 'keywords (map name (filter (fn (x) (primitive? (eval x))) (sort (symbols) > ))))
+(push "nil" keywords)
+(push "true" keywords)
+(set 'keyword-regex (join keywords "|"))
+(replace "?" keyword-regex "\\?")
+(replace "$" keyword-regex "\\$")
+(replace "!" keyword-regex "\\!")
+(replace "+" keyword-regex "\\+")
+(replace "*" keyword-regex "\\*")
+(replace "||" keyword-regex "|\\|")
+(set 'keyword-regex (append {(\s+|\(|\))(} keyword-regex {)(\s+|\(|\))}))
+
+(set 'file (if cgi-use 
+	(or (read-line) (env "QUERY_STRING"))
+	(main-args 2)))
+
+(if cgi-use
+  (begin 
+    (if (and (not (starts-with file "http://" nil)) (not (ends-with file ".txt")))
+	(begin
+		(println "<h3>File not allowed for viewing: " file "</h3>")
+		(exit)))
+  ))
+
+
+(if (starts-with file "http://" nil)
+	(set 'file (get-url file 10000))
+	(set 'file (read-file file )))
+
+(if (not file)
+	(begin
+		(println "<h3>Cannot find file</h3>")
+		(exit)))
+
+(define (clean-comment str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace {[text]} str "&#091&text]")
+	(replace {[/text]} str "&#091&/text]")
+)
+
+(define (format-quoted-string str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace ";" str "&#059&")
+	(replace "{" str "&#123&")
+	(replace "}" str "&#125&")
+	(replace {\} str "&#092&")
+	(replace {[text]} str "&#091&text]")
+	(replace {[/text]} str "&#091&/text]")
+	(format {<font color='%s'>%s</font>} string-color str)
+)
+
+(define (format-braced-string str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace ";" str "&#059&")
+	(replace {"} str "&#034&")
+	(replace {[text]} str "&#091&text]")
+	(replace {[/text]} str "&#091&/text]")
+	(format {<font color='%s'>%s</font>} string-color str)
+)
+
+(define (format-tagged-string str)
+	(replace {<font color='#......'>} str "" 0)
+	(replace {</font>} str "")
+	(replace ";" str "&#059&")
+	(format {<font color='%s'>%s</font>} string-color str)
+)
+
+; replace special HTML characters
+(replace "\r\n" file "\n")
+(replace "&" file "&amp&")
+(replace "<(\\w)" file (append "&lt&" $1) 0)
+(replace "(\\w)>" file (append $1 "&gt&") 0)
+(replace "/>" file "/&gt&" 0)
+(replace "</" file "&lt&/" 0)
+(replace "<!" file "&lt&!" 0)
+; replace escaped quotes
+(replace  "\092\034"  file "&#092&&#034&")
+
+; color keywords
+(replace keyword-regex file (format {%s<font color='%s'>%s</font>%s} $1 keyword-color $2 $3) 0)
+
+; color numbers
+(replace {(\s+|\(|\))(0x[0-9a-fA-F]+|[+-]?\d+\.\d+|[+-]?\d+|\.\d+)} file 
+         (format {%s<font color='%s'>%s</font>} $1 number-color $2) 0)
+
+
+; color parens
+(replace "(" file (format {<font color='%s'>(</font>} paren-color))
+(replace ")" file (format {<font color='%s'>)</font>} paren-color))
+
+; color braced strings
+(replace "{.*?}" file (format-braced-string $0) 0) ; no multiline string
+; color quoted strings
+(replace {".*?"} file (format-quoted-string $0) 0) ; no multiline strings
+
+; color ;  comments
+(replace ";.*" file (clean-comment $0) 0)
+(replace ";.*" file (format {<font color='%s'>%s</font>} comment-color $0) 0)
+
+; color # comments
+(set 'buff "")
+(dolist (lne (parse file "\n"))
+	(replace "^\\s*#.*" lne  (clean-comment $0) 0)
+	(replace "^\\s*#.*" lne (format {<font color='%s'>%s</font>} comment-color $0) 0)
+	(write-line lne buff))
+(set 'file buff)
+
+; color tagged strings
+(replace {\[text\].*?\[/text\]} file (format-tagged-string $0) 4) ; handles multiline strings
+
+; xlate back special characters
+(replace "&amp&" file "&amp;")   ; ampersand
+(replace "&lt&" file "&lt;")     ; less
+(replace "&gt&" file "&gt;")     ; greater
+(replace {&#034&} file "&#034;") ; quotes
+(replace {&#059&} file "&#059;") ; semicolon
+(replace {&#123&} file "&#123;") ; left curly brace
+(replace {&#125&} file "&#125;") ; right curly brace
+(replace {&#091&} file "&#091;") ; left bracket
+(replace {&#092&} file "&#092;") ; back slash
+
+
+; add pre and post tags
+(println (append "<html><body><pre>\n" file "\n</pre>" ))
+
+(println {<center><font face='Arial' size='-2' color='#444444'>}
+         {syntax highlighting with <a href="http://newlisp.org">newLISP</a>&nbsp;}
+         {and <a href="http://newlisp.org/syntax.cgi?code/syntax-cgi.txt">syntax.cgi</a>}
+         {</font></center>})
+
+(println {</body></html>})
+
+(exit)
+
+;; eof
+
diff --git a/util/types.c b/util/types.c
new file mode 100644
index 0000000..8a486d5
--- /dev/null
+++ b/util/types.c
@@ -0,0 +1,99 @@
+/* types.c -- find out size of data types */
+
+/* 
+
+output on Mac OS X PPC
+
+type      bytes
+---------------
+char      1
+char *    4
+void *    4
+short int 2
+int       4
+long      4
+long int  4
+long long 8
+float     4
+double    8
+wchar_t   4
+
+output on AMD64
+
+type      bytes
+---------------
+char        1
+char *      8
+void *      8
+short int   2
+int         4
+long        8
+long int    8
+long long   8
+float       4
+double      8
+long double 16
+wchar_t     4
+
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <wchar.h>
+
+int main(int argc, char * argv[])
+{
+printf("\n");
+printf("type      bytes\n");
+printf("---------------\n");
+printf("char        %d\n", sizeof(char));
+printf("char *      %d\n", sizeof(char *));
+printf("void *      %d\n", sizeof(void *));
+printf("short int   %d\n", sizeof(short int));
+printf("int         %d\n", sizeof(int));
+printf("long        %d\n", sizeof(long));
+printf("long int    %d\n", sizeof(long int));
+printf("long long   %d\n", sizeof(long long));
+printf("size_t      %d\n", sizeof(size_t));
+printf("float       %d\n", sizeof(float));
+printf("double      %d\n", sizeof(double));
+printf("long double %d\n", sizeof(long double));
+printf("wchar_t     %d\n", sizeof(wchar_t));
+
+printf("\n");
+printf("format input              output\n");
+printf("------------------------------------------------\n");
+printf("%%d     0xffffffff           %d\n", 0xffffffff);
+printf("%%u     0xffffffff           %u\n", 0xffffffff);
+printf("%%d     0x7fffffff           %d\n", 0x7fffffff);
+printf("%%u     0x7fffffff           %u\n", 0x7fffffff);
+printf("%%d     0x80000000           %d\n", 0x80000000);
+printf("%%u     0x80000000           %u\n", 0x80000000);
+printf("%%d     0x7fffffffffffffffLL %d\n", 0x7fffffffffffffffLL);
+printf("%%u     0x7fffffffffffffffLL %u\n", 0x7fffffffffffffffLL);
+printf("%%x     0xffffffffffffffffLL %x\n", 0xffffffffffffffffLL);
+printf("%%X     0x7fffffffffffffffLL %x\n", 0x7fffffffffffffffLL);
+printf("%%X     0x8000000000000000LL %x\n", 0x8000000000000000LL);
+printf("%%llX   0xFFFFFFFFFFFFFFFFLL %x\n", 0xFFFFFFFFFFFFFFFFLL);
+printf("%%llX   0x7FFFFFFFFFFFFFFFLL %x\n", 0x7FFFFFFFFFFFFFFFLL);
+printf("%%llX   0x8000000000000000LL %x\n", 0x8000000000000000LL);
+#ifndef TRU64
+printf("%%lld   0xffffffffffffffffLL %lld\n", 0xFFFFFFFFFFFFFFFFLL);
+printf("%%llu   0xffffffffffffffffLL %llu\n", 0xFFFFFFFFFFFFFFFFLL);
+printf("%%lld   0x7fffffffffffffffLL %lld\n", 0x7fffffffffffffffLL);
+printf("%%llu   0x7fffffffffffffffLL %lld\n", 0x7fffffffffffffffLL);
+printf("%%lld   0x8000000000000000LL %lld\n", 0x8000000000000000LL);
+printf("%%llu   0x8000000000000000LL %llu\n", 0x8000000000000000LL);
+#else
+printf("%%ld   0xffffffffffffffffLL %ld\n", 0xFFFFFFFFFFFFFFFFLL);
+printf("%%lu   0xffffffffffffffffLL %ld\n", 0xFFFFFFFFFFFFFFFFLL);
+printf("%%ld   0x7fffffffffffffffLL %ld\n", 0x7FFFFFFFFFFFFFFFLL);
+printf("%%lu   0x7fffffffffffffffLL %lu\n", 0x7FFFFFFFFFFFFFFFLL);
+printf("%%ld   0x8000000000000000LL %ld\n", 0x8000000000000000LL);
+printf("%%lu   0x8000000000000000LL %lu\n", 0x8000000000000000LL);
+#endif
+
+exit(0);
+}
+
+
diff --git a/win32-path.c b/win32-path.c
new file mode 100644
index 0000000..4b99c24
--- /dev/null
+++ b/win32-path.c
@@ -0,0 +1,296 @@
+/* win32-path.c - directory and file functions working on UTF-16
+   file and path names
+
+    Copyright (C) 2007,2008 Michael Sabin
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+#include <wchar.h>
+#include <windows.h>
+#include "newlisp.h"
+#include "protos.h"
+
+/*
+utf8_to_utf16
+Uses the Windows API to convert a UTF-8 string to a UTF-16 string.
+Returns a pointer to a WCHAR string, or NULL if there was an error
+(like if an invalid utf8 string was provided).
+Note that the returned string must be free()ed.
+*/
+WCHAR * utf8_to_utf16(const char *utf8str)
+{
+	int size = -1;
+	WCHAR *utf16str = NULL;
+
+	size = MultiByteToWideChar(
+		CP_UTF8,
+		0,			/* no flags=ignore errors if possible */
+		utf8str,
+		-1,			/* read until NULL character */
+		NULL,		
+		0			/* just calculate size */
+	);
+	
+	if (size == 0) return (NULL);
+	
+	utf16str = (WCHAR*)allocMemory((size+1) * sizeof(WCHAR));
+	
+	size = MultiByteToWideChar(
+		CP_UTF8,
+		0,
+		utf8str,
+		-1,
+		utf16str,
+		size
+	);	
+	
+	if (size == 0) 
+	{
+		free(utf16str);
+		return(NULL);
+	}
+	else
+		return(utf16str);
+}
+
+
+/*
+utf16_to_utf8ptr
+Used in win32_realpath.
+Generally wrapped by utf16_to_utf8.
+*/
+int utf16_to_utf8ptr(const WCHAR *utf16str, char * utf8str, int size)
+{
+	
+	if (size < 1) return(-1);
+	
+	size = WideCharToMultiByte(
+		CP_UTF8,
+		0,
+		utf16str,
+		-1,
+		utf8str,
+		size,
+		NULL,
+		NULL
+	);
+	
+	if (size == 0) 
+		return(-1);
+	else
+		return(0);
+}
+
+/*
+utf16_to_utf8
+Uses the Windows API to convert a UTF-16 string to a UTF-8 string.
+Returns a pointer to a char string, or NULL if there was an error
+(like if an invalid utf16 string was provided).
+Note that the returned string must be free()ed.
+*/
+char * utf16_to_utf8(const WCHAR *utf16str)
+{
+	int size = -1;
+	char *utf8str = NULL;
+	
+	size = WideCharToMultiByte(
+		CP_UTF8,
+		0,
+		utf16str,
+		-1,
+		0,
+		0,
+		NULL,
+		NULL
+	);
+	
+	if (size == 0) return (NULL);	
+	
+	utf8str = (char*)allocMemory((size+1) * sizeof(char));
+	
+	if (utf16_to_utf8ptr(utf16str, utf8str, size) == -1)
+	{
+		free(utf8str);
+		return(NULL);
+	}
+	else
+		return(utf8str);
+}
+
+
+/* 
+win32_realpath
+Identical interface as realpath
+for both ANSI and UTF-16 path names on Windows.
+Has the following functional differences
+* If GetFullPathNameW, first converts the UTF-8 file name to UTF-16 (WCHAR)
+* Uses GetFullPathNameA or GetFullPathNameW to receive the char/WCHAR path
+* If GetFullPathNameW, converts the UTF-16 WCHAR path back to UTF-8
+*/
+char *win32_realpath(const char *filepath, char *realpath)
+{
+
+#ifdef USE_WIN_UTF16PATH
+	
+	WCHAR * utf16filepath;
+	WCHAR utf16realpath[MAX_PATH + 2];
+	int err;
+	
+	utf16filepath = utf8_to_utf16(filepath);
+	err = GetFullPathNameW(utf16filepath, MAX_PATH, utf16realpath, NULL);
+	free(utf16filepath);
+	
+	if (err == 0)
+		return(NULL);
+	
+	if (utf16_to_utf8ptr(utf16realpath, realpath, MAX_PATH) == -1)
+		return(NULL);
+	
+#else
+
+	if(GetFullPathNameA(filepath, MAX_PATH, realpath, NULL) == 0)
+		return(NULL);
+	
+#endif
+
+	return (realpath);	
+}
+
+
+
+/*
+fileSizeW
+Same behavior as fileSize() in nl-filesys.c
+but accepts a WCHAR path.
+Primarily for use in p_fileInfo()
+*/
+INT64 fileSizeW(WCHAR * pathName)
+{
+int handle;
+INT64 size;
+
+handle = _wopen(pathName,O_RDONLY | O_BINARY, 0);
+size = lseek(handle, 0, SEEK_END);
+close(handle);
+if(size == -1) size = 0;
+return(size);
+}
+
+
+/* ---------------------------------------------------------------------------- 
+Wrappers for wide-character functions.
+Same interface as the standard functions.
+Adds the following functionality:
+* first converts the UTF-8 string to UTF-16
+* if there a conversion error, return fail
+* calls the wide-character function
+---------------------------------------------------------------------------- */
+
+int	rename_utf16(const char* a, const char* b)
+{
+	int i;
+	WCHAR * utf16a;
+	WCHAR * utf16b;
+	
+	utf16a = utf8_to_utf16(a);
+	if (utf16a == NULL) return (-1); 
+	utf16b = utf8_to_utf16(b);
+	if (utf16b == NULL) return (-1); 
+	
+	i = _wrename(utf16a, utf16b);
+	free(utf16a);
+	free(utf16b);
+	return i;
+}
+
+int stat_utf16(const char* a, struct stat* b)
+{
+	int i;
+	WCHAR * utf16a = utf8_to_utf16(a);
+	if (utf16a == NULL) return (-1); 
+	
+	i = _wstat(utf16a, (struct _stat*)b);
+	free(utf16a);
+	return i;
+}
+
+int chdir_utf16(const char* a)
+{
+	int i;
+	WCHAR * utf16a = utf8_to_utf16(a);
+	if (utf16a == NULL) return (-1); 
+	
+	i = _wchdir(utf16a);
+	free(utf16a);
+	return i;
+}
+
+int open_utf16(const char* a, int b, int c)
+{
+	int i;
+	WCHAR * utf16a = utf8_to_utf16(a);
+	if (utf16a == NULL) return (-1);
+	
+	i = _wopen(utf16a, b, c);
+	free(utf16a);
+	return i;
+}
+
+int mkdir_utf16(const char* a)
+{
+	int i;
+	WCHAR * utf16a = utf8_to_utf16(a);
+	if (utf16a == NULL) return (-1);
+	
+	i = _wmkdir(utf16a);
+	free(utf16a);
+	return i;
+}
+
+int rmdir_utf16(const char* a)
+{
+	int i;
+	WCHAR * utf16a = utf8_to_utf16(a);
+	if (utf16a == NULL) return (-1);
+	
+	i = _wrmdir(utf16a);
+	free(utf16a);
+	return i;
+}
+
+int unlink_utf16(const char* a)
+{
+	int i;
+	WCHAR * utf16a = utf8_to_utf16(a);
+	if (utf16a == NULL) return (-1);
+	
+	i = _wunlink(utf16a);
+	free(utf16a);
+	return i;
+}
+
+_WDIR * opendir_utf16(const char* a)
+{
+	_WDIR * dir;
+	WCHAR * utf16a = utf8_to_utf16(a);
+	if (utf16a == NULL) return (NULL);
+	
+	dir = _wopendir(utf16a);
+	free(utf16a);
+	return dir;
+}
+
+/* eof */
diff --git a/win32-util.c b/win32-util.c
new file mode 100644
index 0000000..f36537e
--- /dev/null
+++ b/win32-util.c
@@ -0,0 +1,302 @@
+/* 
+   win32-util.c, utitity routines for native win32 port of newLISP 
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+//
+// for function: gettimeofday() 
+//
+// Copyright (C) 1992-2002 Steve Adams
+// 
+// This program is free software; you can redistribute it and/or modify
+// it under the terms of the GNU General Public License version 2, 1991,
+// as published by the Free Software Foundation.
+//
+// This program is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+// 
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, write to the Free Software
+// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+//
+*/
+
+/*
+//
+// Copyright (c) 1992-2007 Lutz Mueller 
+// 
+// This program is free software; you can redistribute it and/or modify
+// it under the terms of the GNU General Public License version 2, 1991,
+// as published by the Free Software Foundation.
+//
+// This program is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+// 
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, write to the Free Software
+// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+//
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <errno.h>
+#include <time.h>
+#include <windows.h>
+#include <io.h>
+
+/* ------------------------  gettimeofday() ------------------------ */
+/* not needed with MinGW gcc 3.4.5
+
+struct timezone {
+       int     tz_minuteswest;
+       int     tz_dsttime;
+};
+
+int gettimeofday( struct timeval *tp, struct timezone *tzp )
+{
+  SYSTEMTIME lpt;
+  TIME_ZONE_INFORMATION tzi;
+  int result = 0;
+
+  time_t        Now;
+  Now         = time( NULL );
+  tp->tv_sec  = Now;
+
+  GetSystemTime(&lpt);
+  tp->tv_usec = lpt.wMilliseconds * 1000;
+
+  if(tzp != NULL)
+  {
+    result = GetTimeZoneInformation(&tzi);
+    tzp->tz_minuteswest = tzi.Bias;
+    tzp->tz_dsttime = tzi.DaylightBias;
+  }
+
+  return(result);
+}
+*/
+
+
+/* ---------------------------- pipes -------------------------------------- */
+
+UINT winPipedProcess(char * cmd, int inpipe, int outpipe, int option)
+{
+STARTUPINFO si = { 0 };
+PROCESS_INFORMATION process;
+int result;
+long fin, fout; 
+
+/* GetStartupInfo(&si);  */
+si.cb = sizeof(si);
+si.dwFlags = STARTF_USESTDHANDLES | STARTF_USESHOWWINDOW;
+si.wShowWindow = option; /* SW_SHOW, SW_HIDE  get additional user option in Win32 versions */
+
+fin = _get_osfhandle(inpipe);
+fout = _get_osfhandle(outpipe);
+
+si.hStdInput = (inpipe) ? (HANDLE)fin : GetStdHandle(STD_INPUT_HANDLE);
+si.hStdOutput = (outpipe) ? (HANDLE)fout : GetStdHandle(STD_OUTPUT_HANDLE);
+si.hStdError = (outpipe) ? (HANDLE)fout : GetStdHandle(STD_OUTPUT_HANDLE);
+
+if((result = CreateProcess(NULL,cmd,NULL,NULL,TRUE,DETACHED_PROCESS,NULL,NULL,&si, &process)) == 0)
+	return(0); 
+
+/* let this be handled by parent process
+CloseHandle((HANDLE)fin);
+CloseHandle((HANDLE)fout);
+*/
+
+return((UINT)process.hProcess);
+}
+
+/*
+typedef struct _PROCESS_INFORMATION { // pi  
+    HANDLE hProcess; 
+    HANDLE hThread; 
+    DWORD dwProcessId; 
+    DWORD dwThreadId; 
+} PROCESS_INFORMATION; 
+*/
+
+
+int winPipe(UINT * inpipe, UINT * outpipe)
+{
+SECURITY_ATTRIBUTES sa = { 0 };
+HANDLE pipe_r, pipe_w;
+
+sa.nLength = sizeof(sa);
+sa.bInheritHandle = TRUE;
+sa.lpSecurityDescriptor = NULL;
+
+if(!CreatePipe(&pipe_r, &pipe_w, &sa, 0))
+	return(0);
+
+*inpipe = _open_osfhandle((long) pipe_r, 0);
+*outpipe = _open_osfhandle((long) pipe_w, 0);
+
+
+return(1);
+}
+
+
+/* ---------------------------------- semaphores ---------------------------- */
+
+UINT winCreateSemaphore(void)
+{
+SECURITY_ATTRIBUTES security = { 0 };
+HANDLE hSemaphore;
+
+security.nLength = sizeof(security);
+security.bInheritHandle = TRUE;
+security.lpSecurityDescriptor = NULL; /* default of caller */
+
+hSemaphore = CreateSemaphore(&security, 0, 65536, NULL);
+
+return((UINT)hSemaphore);
+} 
+
+UINT winWaitSemaphore(UINT hSemaphore)
+{
+DWORD dwWaitResult; 
+
+dwWaitResult = WaitForSingleObject((HANDLE)hSemaphore, INFINITE);
+
+if(dwWaitResult == WAIT_FAILED)
+	return(FALSE);
+
+return(TRUE);
+}
+
+UINT winSignalSemaphore(UINT hSemaphore, int count)
+{
+return(ReleaseSemaphore((HANDLE)hSemaphore, count, NULL));
+}
+
+int winDeleteSemaphore(UINT hSemaphore) 
+{
+return (CloseHandle((HANDLE)hSemaphore));
+}
+
+/*
+See: http://www.codeguru.com/Cpp/W-P/win32/article.php/c1423/
+QuerySemaphore() call
+int winGetSemaphoreCount(UINT hSemaphore) {}
+*/
+
+/* ---------------------------- shared memory interface -------------------- */
+
+UINT winSharedMemory(int size)
+{
+SECURITY_ATTRIBUTES sa = { 0 };
+HANDLE hMemory;
+
+sa.nLength = sizeof(sa);
+sa.bInheritHandle = TRUE;
+sa.lpSecurityDescriptor = NULL; /* default of caller */
+
+hMemory = CreateFileMapping((HANDLE)0xFFFFFFFF, &sa, PAGE_READWRITE, 0, size, NULL);
+
+return((UINT)hMemory);
+}
+
+UINT * winMapView(UINT hMemory, int size)
+{
+return((UINT*)MapViewOfFile((HANDLE)hMemory, FILE_MAP_WRITE, 0, 0, size));
+}
+
+/* ---------------------------- timer -------------------------------------- */
+
+
+#include "newlisp.h"
+#include "protos.h"
+
+extern SYMBOL * timerEvent;
+extern int milliSecTime(void);
+
+/* 
+UINT_PTR SetTimer(HWND hWnd, UINT_PTR nIDEvent, UINT uElapse, TIMERPROC lpTimerFunc);
+BOOL KillTimer(HWND hWnd, UINT_PTR uIDEvent);
+*/
+
+void timerFunc(void * dummy);
+int timerDuration = 0;
+int rollover = 0;
+int start;
+
+CELL * p_timerEvent(CELL * params)
+{
+CELL * symCell;
+double seconds;
+int now;
+
+if(params != nilCell) 
+  {
+  params = getSymbol(params, &timerEvent);
+
+  if(params != nilCell)
+	{
+    getFloat(params, &seconds);
+    timerDuration = 1000 * seconds;
+	if(timerDuration > 0)
+		{
+    	start = milliSecTime();
+    	_beginthread(timerFunc, 0, 0);
+    	seconds = timerDuration/1000.0;
+		}
+	}
+  else
+    {
+    /* return the elapsed time */
+    seconds = ((now = milliSecTime()) < start ? 
+			86400000 - start + now :
+            now - start)/1000.0;  
+    }
+  return(stuffFloat(&seconds));    
+  }
+  
+symCell = getCell(CELL_SYMBOL);
+symCell->contents = (UINT)timerEvent;
+return(symCell);
+}
+
+
+void timerFunc(void * dummy)
+{
+if(timerDuration == 0) return;
+
+/* take care of midnight rollover */
+if((rollover = start + timerDuration - 86400000) > 0)
+    {
+	while(milliSecTime() > start) mySleep(10); /* wait for rollover */
+	while(milliSecTime() < rollover) mySleep(10);
+	}
+else
+	while( milliSecTime() < (start + timerDuration) ) mySleep(10);
+
+if(recursionCount)
+  traceFlag |= TRACE_TIMER;
+else /* if idle */
+  executeSymbol(timerEvent, NULL);
+}
+
+/* eof */
diff --git a/win32dll.c b/win32dll.c
new file mode 100644
index 0000000..b2840cb
--- /dev/null
+++ b/win32dll.c
@@ -0,0 +1,131 @@
+/* win32dll.c - make the newlisp.exe usable as a DLL 
+
+    Copyright (C) 2008 Lutz Mueller
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+#include "newlisp.h"
+#include "protos.h"
+
+/* note that DLL compile with MinGW is still in development */
+#ifdef WIN_32
+#define EXPORT __declspec(dllexport) __stdcall
+#define DLLCALL EXPORT
+#endif
+
+#include <winsock2.h>
+
+extern void loadStartup(char *name);
+extern LPSTR getLibname(void);
+extern int evalSilent;
+extern int opsys;
+extern SYMBOL * mainArgsSymbol;
+
+
+int dllInitialized = 0;
+WSADATA WSAData;
+
+char libName[MAX_LINE] = "newlisp.dll";
+
+void initializeMain(void)
+{
+char name[MAX_LINE + 1];
+
+WSAStartup(MAKEWORD(1,1), &WSAData);
+
+opsys += 64;
+
+#ifdef SUPPORT_UTF8
+opsys += 128;
+#endif
+
+initLocale();
+initialize();
+mainArgsSymbol->contents = (UINT)getCell(CELL_EXPRESSION);
+initStacks();
+
+GetModuleFileName(GetModuleHandle(libName), name, MAX_LINE);
+
+loadStartup(name);
+
+dllInitialized = 1;
+reset();
+}
+
+/* ------------ initialize DLL (gets called by Windows) ----------------- */
+
+extern STREAM errorStream;
+
+STREAM libStrStream;
+
+int CALLBACK LibMain(HANDLE hModule, WORD wDataSeg, WORD cbHeapSize, LPSTR lpszCmdLine)
+{
+return 1;
+}
+
+
+/* called automatically from nl-import when DLL is loaded from newLISP */
+
+int DLLCALL dllName(LPSTR name)
+{
+strncpy(libName, name, MAX_LINE);
+return(1);
+}
+
+
+/* ---- imported and called from a client using newlisp.dll ---- */
+
+LPSTR DLLCALL newlispEvalStr(LPSTR cmd)
+{
+if(!dllInitialized) initializeMain();
+
+if(setjmp(errorJump)) 
+	{
+	reset();
+	initStacks();
+	if(errorReg) 
+		{
+		executeSymbol(errorEvent, NULL);
+		return((LPSTR)libStrStream.buffer);
+		}
+	else
+	return((LPSTR)errorStream.buffer);
+	}
+
+openStrStream(&libStrStream, MAX_STRING, 1);
+executeCommandLine(cmd, (UINT)&libStrStream, NULL);
+
+if(evalSilent) evalSilent = 0;
+
+return((LPSTR)libStrStream.buffer);
+}
+
+
+LPSTR DLLCALL dllEvalStr(LPSTR cmd)
+{
+return(newlispEvalStr(cmd));
+}
+
+
+
+/* ------------ called from Windows when unloading DLL ------------------ */
+
+int DLLCALL WEP (int bSystemExit)
+{
+return(1);
+}
+
+/* eof */
diff --git a/win32dll.def b/win32dll.def
new file mode 100644
index 0000000..1458984
--- /dev/null
+++ b/win32dll.def
@@ -0,0 +1,8 @@
+LIBRARY     NEWLISP.DLL
+
+
+EXPORTS
+    WEP             @1 WEP
+    dllEvalStr      @2 dllEvalStr
+    dllName         @3 dllName
+    newlispEvalStr  @4 newlispEvalStr
-- 
2.11.4.GIT